npm - @chili-publish/studio-sdk - Versions diffs - 0.121.0 - Mend

@chili-publish/studio-sdk 0.121.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (264) hide show

package/_bundles/main.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"main.js","mappings":";CAAA,SAA2CA,KAAMC,SAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,UACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,iBAAkB,GAAIH,SACH,iBAAZC,QACdA,QAAwB,eAAID,UAE5BD,KAAqB,eAAIC,SAC1B,CATD,CASGK,MAAM,gECTT,mCAmCA,SAAUN,MAER,aAEA,IAAIO,KAAO,SAASC,GAClB,MAAsC,IAA9BC,KAAKC,IAAIF,GAAKC,KAAKC,KAAKF,GAClC,EAEIG,KAAO,SAASH,GAClB,MAAsC,IAA9BC,KAAKC,IAAIF,GAAKC,KAAKC,KAAKF,GAClC,EA+DII,YAAc,WAChB,MAAMC,YAAY,gBACpB,EASA,SAASC,SAASC,EAAGC,GAEnB,IAAIC,GAAKR,KAAKS,IAAIH,GACdI,GAAKV,KAAKS,IAAIF,GAElB,OAAU,IAAND,EACKN,KAAKW,IAAID,IAGR,IAANH,EACKP,KAAKW,IAAIH,IAGdA,GAAK,KAAQE,GAAK,IACa,GAA1BV,KAAKW,IAAIL,EAAIA,EAAIC,EAAIA,GAmCvBP,KAAKW,IAAIL,EAAIN,KAAKY,IAAIZ,KAAKa,MAAMN,EAAGD,IAC7C,CAwHA,SAASQ,QAAQR,EAAGC,GAElB,KAAMV,gBAAgBiB,SACpB,OAAO,IAAIA,QAAQR,EAAGC,GAGxB,IAAIQ,EA5HM,SAAST,EAAGC,GAEtB,IAAIQ,EAAI,CAAE,GAAM,EAAG,GAAM,GAEzB,GAAIT,QACFS,EAAM,GACNA,EAAM,GAAI,OACL,QAAUC,IAANT,EACTQ,EAAM,GAAIT,EACVS,EAAM,GAAIR,OAEV,cAAeD,GAEb,IAAK,SAEH,GAAI,OAAQA,GAAK,OAAQA,EACvBS,EAAM,GAAIT,EAAM,GAChBS,EAAM,GAAIT,EAAM,QACX,GAAI,QAASA,GAAK,QAASA,EAAG,CACnC,IAAKW,OAAOC,SAASZ,EAAO,MAAMW,OAAOC,SAASZ,EAAO,KACvD,OAAOQ,QAAkB,SAE3BC,EAAM,GAAIT,EAAO,IAAIN,KAAKY,IAAIN,EAAO,KACrCS,EAAM,GAAIT,EAAO,IAAIN,KAAKmB,IAAIb,EAAO,IACvC,MAAO,GAAI,MAAOA,GAAK,QAASA,EAAG,CACjC,IAAKW,OAAOC,SAASZ,EAAK,IAAMW,OAAOC,SAASZ,EAAO,KACrD,OAAOQ,QAAkB,SAE3BC,EAAM,GAAIT,EAAK,EAAIN,KAAKY,IAAIN,EAAO,KACnCS,EAAM,GAAIT,EAAK,EAAIN,KAAKmB,IAAIb,EAAO,IACrC,MAAwB,IAAbA,EAAEc,QACXL,EAAM,GAAIT,EAAE,GACZS,EAAM,GAAIT,EAAE,IAEZH,cAEF,MAEF,IAAK,SAEHY,EAAM,GACNA,EAAM,GAAI,EAEV,IAAIM,OAASf,EAAEgB,MAAM,yCACjBC,KAAO,EACPC,MAAQ,EAEG,OAAXH,QACFlB,cAGF,IAAK,IAAIsB,EAAI,EAAGA,EAAIJ,OAAOD,OAAQK,IAAK,CAEtC,IAAIC,EAAIL,OAAOI,GAEL,MAANC,GAAmB,OAANA,GAAoB,OAANA,IAEd,MAANA,EACTH,OACe,MAANG,EACTF,QACe,MAANE,GAAmB,MAANA,GAElBH,KAAOC,QAAU,GACnBrB,cAGoB,MAAlBkB,OAAOI,EAAI,IAAeE,MAAMN,OAAOI,EAAI,IAI7CV,EAAM,IAAKa,YAAYJ,MAAQ,EAAI,IAAM,IAAM,MAH/CT,EAAM,IAAKa,YAAYJ,MAAQ,EAAI,IAAM,IAAMH,OAAOI,EAAI,IAC1DA,KAIFF,KAAOC,MAAQ,KAIXD,KAAOC,QAAU,GAAKG,MAAMD,KAC9BvB,cAGoB,MAAlBkB,OAAOI,EAAI,IAAgC,MAAlBJ,OAAOI,EAAI,IACtCV,EAAM,IAAKa,YAAYJ,MAAQ,EAAI,IAAM,IAAME,GAC/CD,KAEAV,EAAM,IAAKa,YAAYJ,MAAQ,EAAI,IAAM,IAAME,GAEjDH,KAAOC,MAAQ,GAEnB,CAGID,KAAOC,MAAQ,GACjBrB,cAEF,MAEF,IAAK,SACHY,EAAM,GAAI,EACVA,EAAM,GAAIT,EACV,MAEF,QACEH,cAQN,OALIwB,MAAMZ,EAAM,KAAMY,MAAMZ,EAAM,IAK3BA,CACT,CAYUc,CAAMvB,EAAGC,GAEjBV,KAAS,GAAIkB,EAAM,GACnBlB,KAAS,GAAIkB,EAAM,EACrB,CAEAD,QAAQgB,UAAY,CAElB,GAAM,EACN,GAAM,EAON,KAAQ,WAEN,IAAIrB,IAAMZ,KAAU,MAEpB,OAAO,IAAIiB,QACTjB,KAAS,GAAIY,IACbZ,KAAS,GAAIY,IACjB,EAOA,IAAO,SAASH,EAAGC,GAEjB,IAAIQ,EAAI,IAAID,QAAQR,EAAGC,GAGvB,OAAIV,KAAiB,cAAOkB,EAAc,aACjCD,QAAa,IAIlBjB,KAAiB,cAAOkB,EAAc,aACjCD,QAAkB,SAGpB,IAAIA,QACTjB,KAAS,GAAIkB,EAAM,GACnBlB,KAAS,GAAIkB,EAAM,GACvB,EAOA,IAAO,SAAST,EAAGC,GAEjB,IAAIQ,EAAI,IAAID,QAAQR,EAAGC,GAGvB,OAAIV,KAAiB,cAAOkB,EAAc,aACjCD,QAAa,IAIlBjB,KAAiB,cAAOkB,EAAc,aACjCD,QAAkB,SAGpB,IAAIA,QACTjB,KAAS,GAAIkB,EAAM,GACnBlB,KAAS,GAAIkB,EAAM,GACvB,EAOA,IAAO,SAAST,EAAGC,GAEjB,IAAIQ,EAAI,IAAID,QAAQR,EAAGC,GAGvB,OAAKV,KAAiB,cAAOkB,EAAU,UAASlB,KAAa,UAAOkB,EAAc,aACzED,QAAa,IAIlBjB,KAAiB,cAAOkB,EAAc,aACjCD,QAAkB,SAIX,IAAZC,EAAM,IAA0B,IAAflB,KAAS,GACrB,IAAIiB,QAAQjB,KAAS,GAAIkB,EAAM,GAAG,GAGpC,IAAID,QACTjB,KAAS,GAAIkB,EAAM,GAAIlB,KAAS,GAAIkB,EAAM,GAC1ClB,KAAS,GAAIkB,EAAM,GAAIlB,KAAS,GAAIkB,EAAM,GAC9C,EAOA,IAAO,SAAST,EAAGC,GAEjB,IAAIQ,EAAI,IAAID,QAAQR,EAAGC,GAGvB,GAAKV,KAAa,UAAOkB,EAAU,UAASlB,KAAiB,cAAOkB,EAAc,aAChF,OAAOD,QAAa,IAItB,GAAIjB,KAAiB,cAAOkB,EAAU,SACpC,OAAOD,QAAkB,SAI3B,GAAIjB,KAAa,UAAOkB,EAAc,aACpC,OAAOD,QAAc,KAGvBR,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEb,IAEIkC,EAAGhC,EAFH2B,EAAIX,EAAM,GACViB,EAAIjB,EAAM,GAGd,OAAI,IAAMiB,EAED,IAAIlB,QAAQR,EAAIoB,EAAGnB,EAAImB,GAG5B1B,KAAKS,IAAIiB,GAAK1B,KAAKS,IAAIuB,GAKlB,IAAIlB,SACRR,GAJHP,EAAI2B,EAAIM,GAIGzB,IAHXwB,EAAIL,EAAI3B,EAAIiC,IAITzB,EAAIR,EAAIO,GAAKyB,GAOT,IAAIjB,SACRR,EAAIC,GAJPR,EAAIiC,EAAIN,KACRK,EAAIC,EAAIjC,EAAI2B,IAITnB,EAAID,EAAIP,GAAKgC,EAEpB,EAOA,IAAO,SAASzB,EAAGC,GAEjB,IAAIQ,EAAI,IAAID,QAAQR,EAAGC,GAKvB,GAHAD,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAETkB,EAAU,SACZ,OAAOD,QAAa,IAItB,GAAgB,IAAZC,EAAM,GAAS,CAEjB,GAAU,IAANR,GAAWD,EAAI,EAEjB,OAAO,IAAIQ,QAAQd,KAAKiC,IAAI3B,EAAGS,EAAM,IAAI,GAEpC,GAAU,IAANT,EAET,QAASS,EAAM,GAAI,EAAI,GAAK,GAC1B,KAAK,EACH,OAAO,IAAID,QAAQd,KAAKiC,IAAI1B,EAAGQ,EAAM,IAAI,GAC3C,KAAK,EACH,OAAO,IAAID,QAAQ,EAAGd,KAAKiC,IAAI1B,EAAGQ,EAAM,KAC1C,KAAK,EACH,OAAO,IAAID,SAASd,KAAKiC,IAAI1B,EAAGQ,EAAM,IAAI,GAC5C,KAAK,EACH,OAAO,IAAID,QAAQ,GAAId,KAAKiC,IAAI1B,EAAGQ,EAAM,KAGjD,CAqBA,GAAU,IAANT,GAAiB,IAANC,GAAWQ,EAAM,GAAI,GAAKA,EAAM,IAAK,EAClD,OAAOD,QAAc,KAGvB,IAAIoB,IAAMlC,KAAKa,MAAMN,EAAGD,GACpB6B,IAAM9B,SAASC,EAAGC,GAItB,OAFAD,EAAIN,KAAKC,IAAIc,EAAM,GAAIoB,IAAMpB,EAAM,GAAImB,KACvC3B,EAAIQ,EAAM,GAAIoB,IAAMpB,EAAM,GAAImB,IACvB,IAAIpB,QACTR,EAAIN,KAAKY,IAAIL,GACbD,EAAIN,KAAKmB,IAAIZ,GACjB,EAOA,KAAQ,WAEN,IAII6B,GAAIC,GAJJ/B,EAAIT,KAAS,GACbU,EAAIV,KAAS,GACbyC,EAAIzC,KAAU,MAIlB,GAAIS,GAAK,EAAG,CAEV,GAAU,IAANC,EACF,OAAO,IAAIO,QAAQd,KAAKuC,KAAKjC,GAAI,GAGnC8B,GAAK,GAAMpC,KAAKuC,KAAK,GAAOD,EAAIhC,GAClC,MACE8B,GAAKpC,KAAKS,IAAIF,GAAKP,KAAKuC,KAAK,GAAKD,EAAIhC,IASxC,OALE+B,GADE/B,GAAK,EACF,GAAMN,KAAKuC,KAAK,GAAOD,EAAIhC,IAE3BN,KAAKS,IAAIF,GAAKP,KAAKuC,KAAK,GAAKD,EAAIhC,IAGjC,IAAIQ,QAAQsB,GAAI7B,EAAI,GAAK8B,GAAKA,GACvC,EAOA,IAAO,WAEL,IAAIG,IAAMxC,KAAKC,IAAIJ,KAAS,IAK5B,OAHIA,KAAS,GAGN,IAAIiB,QACT0B,IAAMxC,KAAKY,IAAIf,KAAS,IACxB2C,IAAMxC,KAAKmB,IAAItB,KAAS,IAC5B,EAUA,MAAS,WAQP,IAAIS,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEjB,OAAO,IAAIiB,QACTd,KAAKyC,MAAMnC,GAAKN,KAAKY,IAAIL,GA7hBnB,SAASR,GAEnB,IAAIQ,EAAIP,KAAK0C,GAAK,EAClB,IAAKnC,EAAIR,GAAKA,EAAIQ,EAChB,OAAOP,KAAKY,IAAIb,GAAK,EAevB,IAAI4C,GAAK5C,EAAIA,EACb,OAAO4C,IACLA,IACEA,IACEA,IACEA,IACEA,IACEA,IACEA,GAAK,cACH,EAAI,aACN,EAAI,WACN,EAAI,SACN,EAAI,OACN,EAAI,KACN,EAAI,IACN,GACN,CA0foCC,CAAMrC,GACpCP,KAAKC,IAAIK,GAAKN,KAAKmB,IAAIZ,GAC3B,EAOA,IAAO,WAEL,IAAID,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAMjB,OAAO,IAAIiB,QACTT,SAASC,EAAGC,GACZP,KAAKa,MAAMN,EAAGD,GAClB,EAOA,IAAO,WAEL,OAthBiBP,EAshBJF,KAAS,GAthBFgD,EAshBKhD,KAAS,GAphBhCS,EAAIN,KAAKS,IAAIV,GACbQ,EAAIP,KAAKS,IAAIoC,GAEbvC,EAAI,KAAQC,EAAI,IACXP,KAAKuC,KAAKjC,EAAIA,EAAIC,EAAIA,IAG3BD,EAAIC,GACND,EAAIC,EACJA,EAAIR,EAAI8C,GAERtC,EAAIsC,EAAI9C,EAEHO,EAAIN,KAAKuC,KAAK,EAAIhC,EAAIA,IAfnB,IAASR,EAAG8C,EAElBvC,EACAC,CAohBJ,EAOA,IAAO,WAEL,OAAOP,KAAKa,MAAMhB,KAAS,GAAGA,KAAS,GACzC,EAOA,IAAO,WAIL,IAAIS,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEjB,OAAO,IAAIiB,QACTd,KAAKmB,IAAIb,GAAKR,KAAKS,GACnBP,KAAKY,IAAIN,GAAKJ,KAAKK,GACvB,EAOA,IAAO,WAIL,IAAID,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEjB,OAAO,IAAIiB,QACTd,KAAKY,IAAIN,GAAKR,KAAKS,IAClBP,KAAKmB,IAAIb,GAAKJ,KAAKK,GACxB,EAOA,IAAO,WAIL,IAAID,EAAI,EAAIT,KAAS,GACjBU,EAAI,EAAIV,KAAS,GACjBmC,EAAIhC,KAAKY,IAAIN,GAAKR,KAAKS,GAE3B,OAAO,IAAIO,QACTd,KAAKmB,IAAIb,GAAK0B,EACd9B,KAAKK,GAAKyB,EACd,EAOA,IAAO,WAIL,IAAI1B,EAAI,EAAIT,KAAS,GACjBU,EAAI,EAAIV,KAAS,GACjBmC,EAAIhC,KAAKY,IAAIN,GAAKR,KAAKS,GAE3B,OAAO,IAAIO,SACRd,KAAKmB,IAAIb,GAAK0B,EACf9B,KAAKK,GAAKyB,EACd,EAOA,IAAO,WAIL,IAAI1B,EAAIT,KAAS,GACbU,EAAIV,KAAS,GACbmC,EAAI,GAAMlC,KAAK,EAAIS,GAAK,GAAMP,KAAKY,IAAI,EAAIN,GAE/C,OAAO,IAAIQ,QACTd,KAAKY,IAAIN,GAAKR,KAAKS,GAAKyB,EACxBhC,KAAKmB,IAAIb,GAAKJ,KAAKK,GAAKyB,EAC5B,EAOA,IAAO,WAIL,IAAI1B,EAAIT,KAAS,GACbU,EAAIV,KAAS,GACbmC,EAAI,GAAMlC,KAAK,EAAIS,GAAK,GAAMP,KAAKY,IAAI,EAAIN,GAE/C,OAAO,IAAIQ,QACTd,KAAKmB,IAAIb,GAAKR,KAAKS,GAAKyB,GACvBhC,KAAKY,IAAIN,GAAKJ,KAAKK,GAAKyB,EAC7B,EAOA,KAAQ,WAIN,IAAI1B,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEbiD,GAAK,IAAIhC,QACXP,EAAIA,EAAID,EAAIA,EAAI,GACf,EAAIA,EAAIC,GAAS,OAEhBwC,GAAK,IAAIjC,QACXgC,GAAO,GAAIvC,EACXuC,GAAO,GAAIxC,GAAQ,MAErB,OAAO,IAAIQ,QAAQiC,GAAO,IAAIA,GAAO,GACvC,EAOA,KAAQ,WAIN,IAAIzC,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEbiD,GAAK,IAAIhC,QACXP,EAAIA,EAAID,EAAIA,EAAI,GACf,EAAIA,EAAIC,GAAS,OAEhBwC,GAAK,IAAIjC,QACXgC,GAAO,GAAIvC,EACXuC,GAAO,GAAIxC,GAAQ,MAErB,OAAO,IAAIQ,QAAQd,KAAK0C,GAAK,EAAIK,GAAO,GAAGA,GAAO,GACpD,EAOA,KAAQ,WAIN,IAAIzC,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEjB,GAAU,IAANS,EAAS,CAEX,GAAU,IAANC,EACF,OAAO,IAAIO,QAAQ,EAAGkC,KAGxB,IAAW,IAAPzC,EACF,OAAO,IAAIO,QAAQ,GAAIkC,IAE3B,CAEA,IAAIhB,EAAI1B,EAAIA,GAAK,EAAMC,IAAM,EAAMA,GAE/BuC,GAAK,IAAIhC,SACV,EAAIP,EAAIA,EAAID,EAAIA,GAAK0B,GACrB,EAAI1B,EAAI0B,GAAGrB,MAEd,OAAO,IAAIG,SAAS,GAAMgC,GAAO,GAAG,GAAMA,GAAO,GACnD,EAOA,KAAQ,WAIN,IAAIxC,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEjB,GAAU,IAANU,EACF,OAAO,IAAIO,QAAQd,KAAKa,MAAM,EAAGP,GAAI,GAGvC,IAAI0B,EAAI1B,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANyB,EACJ,IAAIlB,QACJR,EAAI0B,GACHzB,EAAIyB,GAAGiB,OACR,IAAInC,QACG,IAANR,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAG0C,MAC9B,EAOA,KAAQ,WAIN,IAAI3C,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEjB,GAAU,IAANS,GAAiB,IAANC,EACb,OAAO,IAAIO,QAAQ,EAAGkC,KAGxB,IAAIhB,EAAI1B,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANyB,EACJ,IAAIlB,QACJR,EAAI0B,GACHzB,EAAIyB,GAAGkB,OACR,IAAIpC,QACG,IAANR,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAG2C,MAC9B,EAOA,KAAQ,WAIN,IAAI5C,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEjB,GAAU,IAANS,GAAiB,IAANC,EACb,OAAO,IAAIO,QAAQd,KAAK0C,GAAK,EAAGM,KAGlC,IAAIhB,EAAI1B,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANyB,EACJ,IAAIlB,QACJR,EAAI0B,GACHzB,EAAIyB,GAAGmB,OACR,IAAIrC,QACG,IAANR,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAG4C,MAC9B,EAOA,KAAQ,WAIN,IAAI7C,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEjB,OAAO,IAAIiB,QACTZ,KAAKI,GAAKN,KAAKY,IAAIL,GACnBT,KAAKQ,GAAKN,KAAKmB,IAAIZ,GACvB,EAOA,KAAQ,WAIN,IAAID,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEjB,OAAO,IAAIiB,QACThB,KAAKQ,GAAKN,KAAKY,IAAIL,GACnBL,KAAKI,GAAKN,KAAKmB,IAAIZ,GACvB,EAOA,KAAQ,WAIN,IAAID,EAAI,EAAIT,KAAS,GACjBU,EAAI,EAAIV,KAAS,GACjBmC,EAAIlC,KAAKQ,GAAKN,KAAKY,IAAIL,GAE3B,OAAO,IAAIO,QACTZ,KAAKI,GAAK0B,EACVhC,KAAKmB,IAAIZ,GAAKyB,EAClB,EAOA,KAAQ,WAIN,IAAI1B,EAAI,EAAIT,KAAS,GACjBU,EAAI,EAAIV,KAAS,GACjBmC,EAAIlC,KAAKQ,GAAKN,KAAKY,IAAIL,GAE3B,OAAO,IAAIO,QACTZ,KAAKI,GAAK0B,GACThC,KAAKmB,IAAIZ,GAAKyB,EACnB,EAOA,KAAQ,WAIN,IAAI1B,EAAIT,KAAS,GACbU,EAAIV,KAAS,GACbmC,EAAIhC,KAAKY,IAAI,EAAIL,GAAKT,KAAK,EAAIQ,GAEnC,OAAO,IAAIQ,SACR,EAAIZ,KAAKI,GAAKN,KAAKY,IAAIL,GAAKyB,EAC7B,EAAIlC,KAAKQ,GAAKN,KAAKmB,IAAIZ,GAAKyB,EAChC,EAOA,KAAQ,WAIN,IAAI1B,EAAIT,KAAS,GACbU,EAAIV,KAAS,GACbmC,EAAIhC,KAAKY,IAAI,EAAIL,GAAKT,KAAK,EAAIQ,GAEnC,OAAO,IAAIQ,QACT,EAAIhB,KAAKQ,GAAKN,KAAKY,IAAIL,GAAKyB,GAC3B,EAAI9B,KAAKI,GAAKN,KAAKmB,IAAIZ,GAAKyB,EACjC,EAOA,MAAS,WAIP,IAAIQ,IAAM3C,KAAS,GACnBA,KAAS,IAAKA,KAAS,GACvBA,KAAS,GAAI2C,IACb,IAAIY,IAAMvD,KAAW,OAQrB,OANAA,KAAS,IAAKA,KAAS,GACvBA,KAAS,GAAI2C,IACbA,IAAMY,IAAQ,GAEdA,IAAQ,IAAKA,IAAQ,GACrBA,IAAQ,GAAIZ,IACLY,GACT,EAOA,MAAS,WAIP,IAAIA,IAAMvD,KAAW,OACrB,GAAIuD,IAAQ,IAAK,EAAG,CAClB,IAAIZ,IAAMY,IAAQ,GAClBA,IAAQ,IAAKA,IAAQ,GACrBA,IAAQ,GAAIZ,GACd,KAAO,CACDA,IAAMY,IAAQ,GAClBA,IAAQ,IAAKA,IAAQ,GACrBA,IAAQ,GAAIZ,GACd,CACA,OAAOY,GACT,EAOA,MAAS,WAIP,IAAI9C,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEbwD,KAAO/C,EAAI,GAAW,IAANC,EAChB+C,SAAW,EAAIhD,EACfiD,QAAU,EAAIjD,EACd0B,EAAIsB,SAAWA,SAAW/C,EAAIA,EAE9BR,EAAW,IAANiC,EACL,IAAIlB,SACHyC,QAAUD,SAAW/C,EAAIA,GAAKyB,GAC9BzB,EAAI+C,SAAWC,QAAUhD,GAAKyB,GAC/B,IAAIlB,SACI,IAAPR,EAAaA,EAAI,EAAK,EAChB,IAANC,EAAYA,EAAI,EAAK,GAEtBiD,KAAOzD,EAAM,GAMjB,OALAA,EAAM,GAAIM,SAASN,EAAM,GAAGA,EAAM,IAAK,EACvCA,EAAM,GAAIC,KAAKa,MAAMd,EAAM,GAAGyD,MAAQ,EAClCH,OACFtD,EAAM,IAAKA,EAAM,IAEZA,CACT,EAOA,MAAS,WAIP,IAAIO,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEjB,GAAU,IAANS,GAAiB,IAANC,EACb,OAAO,IAAIO,QAAQ,EAAGd,KAAK0C,GAAK,GAGlC,IAAIV,EAAI1B,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANyB,EACJ,IAAIlB,QACJR,EAAI0B,GACHzB,EAAIyB,GAAGyB,QACR,IAAI3C,QACG,IAANR,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAGkD,OAC9B,EAOA,MAAS,WAIP,IAAInD,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEjB,GAAU,IAANU,EAEF,OAAO,IAAIO,QACF,IAANR,EACGN,KAAKW,IAAIL,EAAIN,KAAKuC,KAAKjC,EAAIA,EAAI,IAC/B0C,IAAU,GAGlB,IAAIhB,EAAI1B,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANyB,EACJ,IAAIlB,QACJR,EAAI0B,GACHzB,EAAIyB,GAAG0B,QACR,IAAI5C,QACG,IAANR,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAGmD,OAC9B,EAOA,MAAS,WAIP,IAAIpD,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEjB,GAAIA,KAAa,SACf,OAAOiB,QAAkB,SAG3B,IAAIkB,EAAI1B,EAAIA,EAAIC,EAAIA,EACpB,OAAc,IAANyB,EACJ,IAAIlB,QACJR,EAAI0B,GACHzB,EAAIyB,GAAG2B,QACR,IAAI7C,QACG,IAANR,EAAWA,EAAI,EAAI,EACb,IAANC,GAAYA,EAAI,EAAI,GAAGoD,OAC9B,EAOA,QAAW,WAGT,GAAI9D,KAAa,SACf,OAAOiB,QAAkB,SAG3B,GAAIjB,KAAiB,aACnB,OAAOiB,QAAc,KAGvB,IAAIR,EAAIT,KAAS,GACbU,EAAIV,KAAS,GAEbmC,EAAI1B,EAAIA,EAAIC,EAAIA,EAEpB,OAAO,IAAIO,QAAQR,EAAI0B,GAAIzB,EAAIyB,EACjC,EAOA,UAAa,WAEX,OAAO,IAAIlB,QAAQjB,KAAS,IAAIA,KAAS,GAC3C,EAOA,IAAO,WAEL,OAAO,IAAIiB,SAASjB,KAAS,IAAIA,KAAS,GAC5C,EAOA,KAAQ,SAAS+D,QAIf,OAFAA,OAAS5D,KAAKiC,IAAI,GAAI2B,QAAU,GAEzB,IAAI9C,QACTd,KAAK6D,KAAKhE,KAAS,GAAI+D,QAAUA,OACjC5D,KAAK6D,KAAKhE,KAAS,GAAI+D,QAAUA,OACrC,EAOA,MAAS,SAASA,QAIhB,OAFAA,OAAS5D,KAAKiC,IAAI,GAAI2B,QAAU,GAEzB,IAAI9C,QACTd,KAAK8D,MAAMjE,KAAS,GAAI+D,QAAUA,OAClC5D,KAAK8D,MAAMjE,KAAS,GAAI+D,QAAUA,OACtC,EAOA,MAAS,SAASA,QAIhB,OAFAA,OAAS5D,KAAKiC,IAAI,GAAI2B,QAAU,GAEzB,IAAI9C,QACTd,KAAK+D,MAAMlE,KAAS,GAAI+D,QAAUA,OAClC5D,KAAK+D,MAAMlE,KAAS,GAAI+D,QAAUA,OACtC,EASA,OAAU,SAAStD,EAAGC,GAEpB,IAAIQ,EAAI,IAAID,QAAQR,EAAGC,GAEvB,OAAOP,KAAKS,IAAIM,EAAM,GAAIlB,KAAS,KAAMiB,QAAiB,SACxDd,KAAKS,IAAIM,EAAM,GAAIlB,KAAS,KAAMiB,QAAiB,OACvD,EAOA,MAAS,WAEP,OAAO,IAAIA,QAAQjB,KAAS,GAAGA,KAAS,GAC1C,EAOA,SAAY,WAEV,IAAIS,EAAIT,KAAS,GACbU,EAAIV,KAAS,GACbmE,IAAM,GAEV,OAAInE,KAAY,QACP,MAGLA,KAAiB,aACZ,YAGLG,KAAKS,IAAIH,GAAKQ,QAAiB,UACjCR,EAAI,GAGFN,KAAKS,IAAIF,GAAKO,QAAiB,UACjCP,EAAI,GAII,IAANA,EACKyD,IAAM1D,GAGL,IAANA,GACF0D,KAAO1D,EACP0D,KAAO,IACHzD,EAAI,GACNA,GAAKA,EACLyD,KAAO,KAEPA,KAAO,IAETA,KAAO,KACEzD,EAAI,IACbA,GAAKA,EACLyD,KAAO,KAGL,IAAMzD,IACRyD,KAAOzD,GAEFyD,IAAM,KACf,EAOA,SAAY,WAEV,MAAO,CAACnE,KAAS,GAAGA,KAAS,GAC/B,EAOA,QAAW,WAET,OAAmB,IAAfA,KAAS,GACJA,KAAS,GAEX,IACT,EAOA,MAAS,WACP,OAAO8B,MAAM9B,KAAS,KAAM8B,MAAM9B,KAAS,GAC7C,EAQA,OAAU,WACR,OAAsB,IAAfA,KAAS,IAA0B,IAAfA,KAAS,EACtC,EAQA,SAAY,WACV,OAAOqB,SAASrB,KAAS,KAAMqB,SAASrB,KAAS,GACnD,EAQA,WAAc,WACZ,QAASA,KAAY,SAAOA,KAAe,WAC7C,GAGFiB,QAAc,KAAI,IAAIA,QAAQ,EAAG,GACjCA,QAAa,IAAI,IAAIA,QAAQ,EAAG,GAChCA,QAAW,EAAI,IAAIA,QAAQ,EAAG,GAC9BA,QAAY,GAAI,IAAIA,QAAQd,KAAK0C,GAAI,GACrC5B,QAAW,EAAI,IAAIA,QAAQd,KAAKiE,EAAG,GACnCnD,QAAkB,SAAI,IAAIA,QAAQkC,IAAUA,KAC5ClC,QAAa,IAAI,IAAIA,QAAQoD,IAAKA,KAClCpD,QAAiB,QAAI,WAKlB,KAFU,8BAAF,WACP,OAAOA,OACR,gBAFM,OAEN,6CAUJ,CAp2CD,qDCnCA,mCAAC,SAAWqD,aACV,aAiBA,IAkFEC,QAASC,QAAqBC,SAlF5BC,UAAY,KAOdC,SAAW,mBAGXC,KAAO,qgCAGP/B,GAAK,qgCAILgC,SAAW,CAOTC,UAAW,GAiBXC,SAAU,EAeVC,OAAQ,EAIRC,UAAW,EAIXC,SAAW,GAIXC,MAAOT,UAIPU,KAAMV,UAGNW,QAAQ,GAQVC,UAAW,EAGXC,gBAAkBC,oCAGlBC,IAAM,mBAENC,UAAYvF,KAAK8D,MACjB0B,QAAUxF,KAAKiC,IAEfwD,SAAW,6CACXC,MAAQ,yDACRC,QAAU,gDACVC,UAAY,qCAEZC,KAAO,IAIPC,eAAiBrB,KAAKrD,OAAS,EAC/B2E,aAAerD,GAAGtB,OAAS,EAG3B4E,EAAI,CAAEC,YAAaX,KA01ErB,SAASY,eAAelE,GACtB,IAAIP,EAAG0E,EAAGC,GACRC,gBAAkBrE,EAAEZ,OAAS,EAC7BkF,IAAM,GACNC,EAAIvE,EAAE,GAER,GAAIqE,gBAAkB,EAAG,CAEvB,IADAC,KAAOC,EACF9E,EAAI,EAAGA,EAAI4E,gBAAiB5E,KAE/B0E,EA32EO,GA02EPC,GAAKpE,EAAEP,GAAK,IACML,UACXkF,KAAOE,cAAcL,IAC5BG,KAAOF,IAKTD,EAl3ES,GAi3ETC,IADAG,EAAIvE,EAAEP,IACG,IACSL,UACXkF,KAAOE,cAAcL,GAC9B,MAAO,GAAU,IAANI,EACT,MAAO,IAIT,KAAOA,EAAI,IAAO,GAAIA,GAAK,GAE3B,OAAOD,IAAMC,CACf,CAGA,SAASE,WAAWhF,EAAGiF,IAAKC,KAC1B,GAAIlF,MAAQA,GAAKA,EAAIiF,KAAOjF,EAAIkF,IAC9B,MAAMC,MAAMxB,gBAAkB3D,EAElC,CAQA,SAASoF,oBAAoB7E,EAAGP,EAAGqF,GAAIC,WACrC,IAAIC,GAAIb,EAAG7D,EAAG2E,GAGd,IAAKd,EAAInE,EAAE,GAAImE,GAAK,GAAIA,GAAK,KAAM1E,EAwCnC,QArCMA,EAAI,GACRA,GAn5ES,EAo5ETuF,GAAK,IAELA,GAAKhH,KAAK6D,MAAMpC,EAAI,GAt5EX,GAu5ETA,GAv5ES,GA65EX0E,EAAIX,QAAQ,GA75ED,EA65EgB/D,GAC3BwF,GAAKjF,EAAEgF,IAAMb,EAAI,EAEA,MAAbY,UACEtF,EAAI,GACG,GAALA,EAAQwF,GAAKA,GAAK,IAAM,EACd,GAALxF,IAAQwF,GAAKA,GAAK,GAAK,GAChC3E,EAAIwE,GAAK,GAAW,OAANG,IAAeH,GAAK,GAAW,OAANG,IAAqB,KAANA,IAAqB,GAANA,IAErE3E,GAAKwE,GAAK,GAAKG,GAAK,GAAKd,GAAKW,GAAK,GAAKG,GAAK,GAAKd,EAAI,KACnDnE,EAAEgF,GAAK,GAAKb,EAAI,IAAM,IAAMX,QAAQ,GAAI/D,EAAI,GAAK,IAC/CwF,IAAMd,EAAI,GAAW,GAANc,KAAyC,IAA5BjF,EAAEgF,GAAK,GAAKb,EAAI,IAAM,GAGrD1E,EAAI,GACG,GAALA,EAAQwF,GAAKA,GAAK,IAAO,EACf,GAALxF,EAAQwF,GAAKA,GAAK,IAAM,EACnB,GAALxF,IAAQwF,GAAKA,GAAK,GAAK,GAChC3E,GAAKyE,WAAaD,GAAK,IAAY,MAANG,KAAeF,WAAaD,GAAK,GAAW,MAANG,IAEnE3E,IAAMyE,WAAaD,GAAK,IAAMG,GAAK,GAAKd,IACtCY,WAAaD,GAAK,GAAMG,GAAK,GAAKd,EAAI,KACrCnE,EAAEgF,GAAK,GAAKb,EAAI,IAAO,IAAMX,QAAQ,GAAI/D,EAAI,GAAK,EAIlDa,CACT,CAMA,SAAS4E,YAAYZ,IAAKa,OAAQC,SAOhC,IANA,IAAIC,EAEFC,KADAC,IAAM,CAAC,GAEP9F,EAAI,EACJ+F,KAAOlB,IAAIlF,OAENK,EAAI+F,MAAO,CAChB,IAAKF,KAAOC,IAAInG,OAAQkG,QAASC,IAAID,OAASH,OAE9C,IADAI,IAAI,IAAM/C,SAASiD,QAAQnB,IAAIoB,OAAOjG,MACjC4F,EAAI,EAAGA,EAAIE,IAAInG,OAAQiG,IACtBE,IAAIF,GAAKD,QAAU,SACF,IAAfG,IAAIF,EAAI,KAAeE,IAAIF,EAAI,GAAK,GACxCE,IAAIF,EAAI,IAAME,IAAIF,GAAKD,QAAU,EACjCG,IAAIF,IAAMD,QAGhB,CAEA,OAAOG,IAAII,SACb,CAj4EA3B,EAAE4B,cAAgB5B,EAAEvF,IAAM,WACxB,IAAIV,EAAI,IAAIF,KAAKgI,YAAYhI,MAE7B,OADIE,EAAE+H,EAAI,IAAG/H,EAAE+H,EAAI,GACZC,SAAShI,EAClB,EAQAiG,EAAEnC,KAAO,WACP,OAAOkE,SAAS,IAAIlI,KAAKgI,YAAYhI,MAAOA,KAAKmI,EAAI,EAAG,EAC1D,EAWAhC,EAAEiC,UAAYjC,EAAEkC,MAAQ,SAAUxB,IAAKC,KACrC,IACE5G,EAAIF,KACJsI,KAAOpI,EAAE8H,YAGX,GAFAnB,IAAM,IAAIyB,KAAKzB,KACfC,IAAM,IAAIwB,KAAKxB,MACVD,IAAIoB,IAAMnB,IAAImB,EAAG,OAAO,IAAIK,KAAKjE,KACtC,GAAIwC,IAAI0B,GAAGzB,KAAM,MAAMC,MAAMxB,gBAAkBuB,KAE/C,OADI5G,EAAEsI,IAAI3B,KACC,EAAIA,IAAM3G,EAAEsI,IAAI1B,KAAO,EAAIA,IAAM,IAAIwB,KAAKpI,EACvD,EAWAiG,EAAEsC,WAAatC,EAAEqC,IAAM,SAAUxF,GAC/B,IAAIpB,EAAG4F,EAAGkB,IAAKC,IACbzI,EAAIF,KACJ4I,GAAK1I,EAAEiC,EACP0G,IAAM7F,EAAI,IAAI9C,EAAE8H,YAAYhF,IAAIb,EAChC2G,GAAK5I,EAAE+H,EACPc,GAAK/F,EAAEiF,EAGT,IAAKW,KAAOC,GACV,OAAQC,IAAOC,GAAWD,KAAOC,GAAKD,GAAKF,KAAOC,GAAK,GAAKD,GAAKE,GAAK,EAAI,GAAK,EAA3DzE,IAItB,IAAKuE,GAAG,KAAOC,GAAG,GAAI,OAAOD,GAAG,GAAKE,GAAKD,GAAG,IAAME,GAAK,EAGxD,GAAID,KAAOC,GAAI,OAAOD,GAGtB,GAAI5I,EAAEiI,IAAMnF,EAAEmF,EAAG,OAAOjI,EAAEiI,EAAInF,EAAEmF,EAAIW,GAAK,EAAI,GAAK,EAMlD,IAAKlH,EAAI,EAAG4F,GAJZkB,IAAME,GAAGrH,SACToH,IAAME,GAAGtH,QAGmBmH,IAAMC,IAAK/G,EAAI4F,IAAK5F,EAC9C,GAAIgH,GAAGhH,KAAOiH,GAAGjH,GAAI,OAAOgH,GAAGhH,GAAKiH,GAAGjH,GAAKkH,GAAK,EAAI,GAAK,EAI5D,OAAOJ,MAAQC,IAAM,EAAID,IAAMC,IAAMG,GAAK,EAAI,GAAK,CACrD,EAgBA3C,EAAE6C,OAAS7C,EAAEpF,IAAM,WACjB,IAAIkI,GAAIhC,GACN/G,EAAIF,KACJsI,KAAOpI,EAAE8H,YAEX,OAAK9H,EAAEiC,EAGFjC,EAAEiC,EAAE,IAET8G,GAAKX,KAAKxD,UACVmC,GAAKqB,KAAKvD,SACVuD,KAAKxD,UAAYmE,GAAK9I,KAAK2G,IAAI5G,EAAEiI,EAAGjI,EAAEgJ,MA3L3B,EA4LXZ,KAAKvD,SAAW,EAEhB7E,EA4xEF,SAAgBoI,KAAMpI,GACpB,IAAIoG,EAAG6C,IAAKnG,EAEZ,GAAI9C,EAAEkJ,SAAU,OAAOlJ,GAMvBiJ,IAAMjJ,EAAEiC,EAAEZ,QACA,GAERyB,GAAK,EAAIqG,QAAQ,EADjB/C,EAAInG,KAAK6D,KAAKmF,IAAM,KACIG,YAExBhD,EAAI,GACJtD,EAAI,gCAGNsF,KAAKxD,WAAawB,EAElBpG,EAAIqJ,aAAajB,KAAM,EAAGpI,EAAEsJ,MAAMxG,GAAI,IAAIsF,KAAK,IAG/C,IAAK,IAAI1G,EAAI0E,EAAG1E,KAAM,CACpB,IAAI6H,MAAQvJ,EAAEsJ,MAAMtJ,GACpBA,EAAIuJ,MAAMD,MAAMC,OAAO9H,MAAM8H,OAAOD,MAAM,GAAG9H,KAAK,EACpD,CAIA,OAFA4G,KAAKxD,WAAawB,EAEXpG,CACT,CA3zEM8I,CAAOV,KAAMoB,iBAAiBpB,KAAMpI,IAExCoI,KAAKxD,UAAYmE,GACjBX,KAAKvD,SAAWkC,GAETiB,SAAqB,GAAZzD,UAA6B,GAAZA,SAAgBvE,EAAEyJ,MAAQzJ,EAAG+I,GAAIhC,IAAI,IAZlD,IAAIqB,KAAK,GAHZ,IAAIA,KAAKjE,IAgB5B,EAmBA8B,EAAEyD,SAAWzD,EAAE0D,KAAO,WACpB,IAAI1B,EAAG2B,EAAGC,EAAGtH,EAAGuH,IAAK/B,EAAGiB,GAAIhH,EAAG+H,GAAIC,QACjChK,EAAIF,KACJsI,KAAOpI,EAAE8H,YAEX,IAAK9H,EAAEmB,YAAcnB,EAAEkJ,SAAU,OAAO,IAAId,KAAKpI,GAoCjD,IAnCAoF,UAAW,GAGX2C,EAAI/H,EAAE+H,EAAItC,QAAQzF,EAAE+H,EAAI/H,EAAG,EAAI,KAIrBC,KAAKS,IAAIqH,IAAM,IAqBvBxF,EAAI,IAAI6F,KAAKL,EAAEqB,aApBfS,EAAI1D,eAAenG,EAAEiC,IAIjB8F,IAHJE,EAAIjI,EAAEiI,GAGO4B,EAAExI,OAAS,GAAK,KAAGwI,GAAW,GAAL9B,IAAgB,GAANA,EAAU,IAAM,MAChEA,EAAItC,QAAQoE,EAAG,EAAI,GAGnB5B,EAAIzC,WAAWyC,EAAI,GAAK,IAAMA,EAAI,IAAMA,EAAI,GAAK,EAAI,KASrD1F,EAAI,IAAI6F,KANNyB,EADE9B,GAAK,IACH,KAAOE,GAEX4B,EAAI9B,EAAEkC,iBACAC,MAAM,EAAGL,EAAEnC,QAAQ,KAAO,GAAKO,IAIrCF,EAAI/H,EAAE+H,GAKViB,IAAMf,EAAIG,KAAKxD,WAAa,IAW1B,GAJAoF,SADAD,IADA/H,EAAIO,GACG+G,MAAMtH,GAAGsH,MAAMtH,IACTR,KAAKxB,GAClBuC,EAAI4H,OAAOH,QAAQxI,KAAKxB,GAAGsJ,MAAMtH,GAAIgI,QAAQxI,KAAKuI,IAAKf,GAAK,EAAG,GAG3D7C,eAAenE,EAAEC,GAAGiI,MAAM,EAAGlB,OAASa,EAAI1D,eAAe5D,EAAEN,IAAIiI,MAAM,EAAGlB,IAAK,CAK/E,GAAS,SAJTa,EAAIA,EAAEK,MAAMlB,GAAK,EAAGA,GAAK,MAILc,KAAY,QAALD,GAepB,EAICA,KAAOA,EAAEK,MAAM,IAAqB,KAAfL,EAAElC,OAAO,MAGlCK,SAASzF,EAAG0F,EAAI,EAAG,GACnB2B,GAAKrH,EAAE+G,MAAM/G,GAAG+G,MAAM/G,GAAG6H,GAAGpK,IAG9B,KACF,CAvBE,IAAK8J,MACH9B,SAAShG,EAAGiG,EAAI,EAAG,GAEfjG,EAAEsH,MAAMtH,GAAGsH,MAAMtH,GAAGoI,GAAGpK,IAAI,CAC7BuC,EAAIP,EACJ,KACF,CAGFgH,IAAM,EACNc,IAAM,CAcV,CAKF,OAFA1E,UAAW,EAEJ4C,SAASzF,EAAG0F,EAAGG,KAAKvD,SAAU+E,EACvC,EAOA3D,EAAEoE,cAAgBpE,EAAEqE,GAAK,WACvB,IAAI9D,EACFvE,EAAInC,KAAKmC,EACT4H,EAAI1F,IAEN,GAAIlC,EAAG,CAML,GAJA4H,EA5TS,IA2TTrD,EAAIvE,EAAEZ,OAAS,GACNmE,UAAU1F,KAAKmI,EA5Tf,IA+TTzB,EAAIvE,EAAEuE,GACC,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIqD,IAChCA,EAAI,IAAGA,EAAI,EACjB,CAEA,OAAOA,CACT,EAwBA5D,EAAEsE,UAAYtE,EAAEuE,IAAM,SAAU1H,GAC9B,OAAOqH,OAAOrK,KAAM,IAAIA,KAAKgI,YAAYhF,GAC3C,EAQAmD,EAAEwE,mBAAqBxE,EAAEyE,SAAW,SAAU5H,GAC5C,IACEsF,KADMtI,KACGgI,YACX,OAAOE,SAASmC,OAFRrK,KAEkB,IAAIsI,KAAKtF,GAAI,EAAG,EAAG,GAAIsF,KAAKxD,UAAWwD,KAAKvD,SACxE,EAOAoB,EAAE0E,OAAS1E,EAAEmE,GAAK,SAAUtH,GAC1B,OAAuB,IAAhBhD,KAAKwI,IAAIxF,EAClB,EAQAmD,EAAElC,MAAQ,WACR,OAAOiE,SAAS,IAAIlI,KAAKgI,YAAYhI,MAAOA,KAAKmI,EAAI,EAAG,EAC1D,EAQAhC,EAAE2E,YAAc3E,EAAEoC,GAAK,SAAUvF,GAC/B,OAAOhD,KAAKwI,IAAIxF,GAAK,CACvB,EAQAmD,EAAE4E,qBAAuB5E,EAAE6E,IAAM,SAAUhI,GACzC,IAAIsD,EAAItG,KAAKwI,IAAIxF,GACjB,OAAY,GAALsD,GAAgB,IAANA,CACnB,EA4BAH,EAAE8E,iBAAmB9E,EAAElG,KAAO,WAC5B,IAAIqG,EAAGyD,EAAGd,GAAIhC,GAAIkC,IAChBjJ,EAAIF,KACJsI,KAAOpI,EAAE8H,YACTkD,IAAM,IAAI5C,KAAK,GAEjB,IAAKpI,EAAEmB,WAAY,OAAO,IAAIiH,KAAKpI,EAAE+H,EAAI,IAAQ5D,KACjD,GAAInE,EAAEkJ,SAAU,OAAO8B,IAEvBjC,GAAKX,KAAKxD,UACVmC,GAAKqB,KAAKvD,SACVuD,KAAKxD,UAAYmE,GAAK9I,KAAK2G,IAAI5G,EAAEiI,EAAGjI,EAAEgJ,MAAQ,EAC9CZ,KAAKvD,SAAW,GAChBoE,IAAMjJ,EAAEiC,EAAEZ,QAOA,GAERwI,GAAK,EAAIV,QAAQ,EADjB/C,EAAInG,KAAK6D,KAAKmF,IAAM,KACIG,YAExBhD,EAAI,GACJyD,EAAI,gCAGN7J,EAAIqJ,aAAajB,KAAM,EAAGpI,EAAEsJ,MAAMO,GAAI,IAAIzB,KAAK,IAAI,GAMnD,IAHA,IAAI6C,QACFvJ,EAAI0E,EACJ8E,GAAK,IAAI9C,KAAK,GACT1G,KACLuJ,QAAUjL,EAAEsJ,MAAMtJ,GAClBA,EAAIgL,IAAIvJ,MAAMwJ,QAAQ3B,MAAM4B,GAAGzJ,MAAMwJ,QAAQ3B,MAAM4B,OAGrD,OAAOlD,SAAShI,EAAGoI,KAAKxD,UAAYmE,GAAIX,KAAKvD,SAAWkC,IAAI,EAC9D,EAiCAd,EAAEkF,eAAiBlF,EAAE9F,KAAO,WAC1B,IAAIiG,EAAG2C,GAAIhC,GAAIkC,IACbjJ,EAAIF,KACJsI,KAAOpI,EAAE8H,YAEX,IAAK9H,EAAEmB,YAAcnB,EAAEkJ,SAAU,OAAO,IAAId,KAAKpI,GAQjD,GANA+I,GAAKX,KAAKxD,UACVmC,GAAKqB,KAAKvD,SACVuD,KAAKxD,UAAYmE,GAAK9I,KAAK2G,IAAI5G,EAAEiI,EAAGjI,EAAEgJ,MAAQ,EAC9CZ,KAAKvD,SAAW,GAChBoE,IAAMjJ,EAAEiC,EAAEZ,QAEA,EACRrB,EAAIqJ,aAAajB,KAAM,EAAGpI,EAAGA,GAAG,OAC3B,CAYLoG,GADAA,EAAI,IAAMnG,KAAKuC,KAAKyG,MACZ,GAAK,GAAS,EAAJ7C,EAGlBpG,EAAIqJ,aAAajB,KAAM,EADvBpI,EAAIA,EAAEsJ,MAAM,EAAIH,QAAQ,EAAG/C,IACEpG,GAAG,GAOhC,IAJA,IAAIoL,QACFC,GAAK,IAAIjD,KAAK,GACdkD,IAAM,IAAIlD,KAAK,IACfmD,IAAM,IAAInD,KAAK,IACVhC,KACLgF,QAAUpL,EAAEsJ,MAAMtJ,GAClBA,EAAIA,EAAEsJ,MAAM+B,GAAG7J,KAAK4J,QAAQ9B,MAAMgC,IAAIhC,MAAM8B,SAAS5J,KAAK+J,OAE9D,CAKA,OAHAnD,KAAKxD,UAAYmE,GACjBX,KAAKvD,SAAWkC,GAETiB,SAAShI,EAAG+I,GAAIhC,IAAI,EAC7B,EAmBAd,EAAEuF,kBAAoBvF,EAAEwF,KAAO,WAC7B,IAAI1C,GAAIhC,GACN/G,EAAIF,KACJsI,KAAOpI,EAAE8H,YAEX,OAAK9H,EAAEmB,WACHnB,EAAEkJ,SAAiB,IAAId,KAAKpI,IAEhC+I,GAAKX,KAAKxD,UACVmC,GAAKqB,KAAKvD,SACVuD,KAAKxD,UAAYmE,GAAK,EACtBX,KAAKvD,SAAW,EAETsF,OAAOnK,EAAEG,OAAQH,EAAED,OAAQqI,KAAKxD,UAAYmE,GAAIX,KAAKvD,SAAWkC,KAR7C,IAAIqB,KAAKpI,EAAE+H,EASvC,EAsBA9B,EAAEyF,cAAgBzF,EAAE9C,KAAO,WACzB,IAAIwI,OACF3L,EAAIF,KACJsI,KAAOpI,EAAE8H,YACT1B,EAAIpG,EAAEU,MAAM4H,IAAI,GAChBS,GAAKX,KAAKxD,UACVmC,GAAKqB,KAAKvD,SAEZ,OAAW,IAAPuB,EACW,IAANA,EAEHpG,EAAE4L,QAAUC,MAAMzD,KAAMW,GAAIhC,IAAM,IAAIqB,KAAK,GAE3C,IAAIA,KAAKjE,KAGXnE,EAAEkJ,SAAiB2C,MAAMzD,KAAMW,GAAK,EAAGhC,IAAIuC,MAAM,KAIrDlB,KAAKxD,UAAYmE,GAAK,EACtBX,KAAKvD,SAAW,EAEhB7E,EAAIA,EAAEoD,OACNuI,OAASE,MAAMzD,KAAMW,GAAK,EAAGhC,IAAIuC,MAAM,IAEvClB,KAAKxD,UAAYmE,GACjBX,KAAKvD,SAAWkC,GAET4E,OAAOlK,MAAMzB,GACtB,EAsBAiG,EAAE6F,wBAA0B7F,EAAErC,MAAQ,WACpC,IAAImF,GAAIhC,GACN/G,EAAIF,KACJsI,KAAOpI,EAAE8H,YAEX,OAAI9H,EAAE+L,IAAI,GAAW,IAAI3D,KAAKpI,EAAEoK,GAAG,GAAK,EAAIjG,KACvCnE,EAAEmB,YAEP4H,GAAKX,KAAKxD,UACVmC,GAAKqB,KAAKvD,SACVuD,KAAKxD,UAAYmE,GAAK9I,KAAK2G,IAAI3G,KAAKS,IAAIV,EAAEiI,GAAIjI,EAAEgJ,MAAQ,EACxDZ,KAAKvD,SAAW,EAChBO,UAAW,EAEXpF,EAAIA,EAAEsJ,MAAMtJ,GAAGyB,MAAM,GAAGe,OAAOhB,KAAKxB,GAEpCoF,UAAW,EACXgD,KAAKxD,UAAYmE,GACjBX,KAAKvD,SAAWkC,GAET/G,EAAEgM,MAdiB,IAAI5D,KAAKpI,EAerC,EAmBAiG,EAAEgG,sBAAwBhG,EAAEtC,MAAQ,WAClC,IAAIoF,GAAIhC,GACN/G,EAAIF,KACJsI,KAAOpI,EAAE8H,YAEX,OAAK9H,EAAEmB,YAAcnB,EAAEkJ,SAAiB,IAAId,KAAKpI,IAEjD+I,GAAKX,KAAKxD,UACVmC,GAAKqB,KAAKvD,SACVuD,KAAKxD,UAAYmE,GAAK,EAAI9I,KAAK2G,IAAI3G,KAAKS,IAAIV,EAAEiI,GAAIjI,EAAEgJ,MAAQ,EAC5DZ,KAAKvD,SAAW,EAChBO,UAAW,EAEXpF,EAAIA,EAAEsJ,MAAMtJ,GAAGwB,KAAK,GAAGgB,OAAOhB,KAAKxB,GAEnCoF,UAAW,EACXgD,KAAKxD,UAAYmE,GACjBX,KAAKvD,SAAWkC,GAET/G,EAAEgM,KACX,EAsBA/F,EAAEiG,yBAA2BjG,EAAEvC,MAAQ,WACrC,IAAIqF,GAAIhC,GAAIoF,IAAKC,IACfpM,EAAIF,KACJsI,KAAOpI,EAAE8H,YAEX,OAAK9H,EAAEmB,WACHnB,EAAEiI,GAAK,EAAU,IAAIG,KAAKpI,EAAEU,MAAM0J,GAAG,GAAKpK,EAAE+H,EAAI,EAAI/H,EAAEkJ,SAAWlJ,EAAImE,MAEzE4E,GAAKX,KAAKxD,UACVmC,GAAKqB,KAAKvD,SACVuH,IAAMpM,EAAEgJ,KAEJ/I,KAAK2G,IAAIwF,IAAKrD,IAAM,GAAK/I,EAAEiI,EAAI,EAAUD,SAAS,IAAII,KAAKpI,GAAI+I,GAAIhC,IAAI,IAE3EqB,KAAKxD,UAAYuH,IAAMC,IAAMpM,EAAEiI,EAE/BjI,EAAImK,OAAOnK,EAAEwB,KAAK,GAAI,IAAI4G,KAAK,GAAG3G,MAAMzB,GAAImM,IAAMpD,GAAI,GAEtDX,KAAKxD,UAAYmE,GAAK,EACtBX,KAAKvD,SAAW,EAEhB7E,EAAIA,EAAEgM,KAEN5D,KAAKxD,UAAYmE,GACjBX,KAAKvD,SAAWkC,GAET/G,EAAEsJ,MAAM,MArBW,IAAIlB,KAAKjE,IAsBrC,EAwBA8B,EAAEoG,YAAcpG,EAAE7C,KAAO,WACvB,IAAIuI,OAAQvF,EACV2C,GAAIhC,GACJ/G,EAAIF,KACJsI,KAAOpI,EAAE8H,YAEX,OAAI9H,EAAEkJ,SAAiB,IAAId,KAAKpI,IAEhCoG,EAAIpG,EAAEU,MAAM4H,IAAI,GAChBS,GAAKX,KAAKxD,UACVmC,GAAKqB,KAAKvD,UAEC,IAAPuB,EAGQ,IAANA,IACFuF,OAASE,MAAMzD,KAAMW,GAAK,EAAGhC,IAAIuC,MAAM,KAChCvB,EAAI/H,EAAE+H,EACN4D,QAIF,IAAIvD,KAAKjE,MAKlBiE,KAAKxD,UAAYmE,GAAK,EACtBX,KAAKvD,SAAW,EAEhB7E,EAAIA,EAAEwK,IAAI,IAAIpC,KAAK,GAAG3G,MAAMzB,EAAEsJ,MAAMtJ,IAAIwC,OAAOhB,KAAK,IAAI0B,OAExDkF,KAAKxD,UAAYmE,GACjBX,KAAKvD,SAAWkC,GAET/G,EAAEsJ,MAAM,IACjB,EAqBArD,EAAEqG,eAAiBrG,EAAE/C,KAAO,WAC1B,IAAIxB,EAAG4F,EAAGlB,EAAGyD,EAAG0C,GAAIvK,EAAGO,EAAG4J,IAAKK,GAC7BxM,EAAIF,KACJsI,KAAOpI,EAAE8H,YACTiB,GAAKX,KAAKxD,UACVmC,GAAKqB,KAAKvD,SAEZ,GAAK7E,EAAEmB,WAOA,IAAInB,EAAEkJ,SACX,OAAO,IAAId,KAAKpI,GACX,GAAIA,EAAEU,MAAM0J,GAAG,IAAMrB,GAAK,GAAK/C,aAGpC,OAFAzD,EAAIsJ,MAAMzD,KAAMW,GAAK,EAAGhC,IAAIuC,MAAM,MAChCvB,EAAI/H,EAAE+H,EACDxF,CACT,KAbmB,CACjB,IAAKvC,EAAE+H,EAAG,OAAO,IAAIK,KAAKjE,KAC1B,GAAI4E,GAAK,GAAK/C,aAGZ,OAFAzD,EAAIsJ,MAAMzD,KAAMW,GAAK,EAAGhC,IAAIuC,MAAM,KAChCvB,EAAI/H,EAAE+H,EACDxF,CAEX,CAmBA,IAXA6F,KAAKxD,UAAYuH,IAAMpD,GAAK,GAC5BX,KAAKvD,SAAW,EAUXnD,EAFL0E,EAAInG,KAAK0G,IAAI,GAAIwF,IA/2BN,EA+2BuB,EAAI,GAE1BzK,IAAKA,EAAG1B,EAAIA,EAAEwK,IAAIxK,EAAEsJ,MAAMtJ,GAAGwB,KAAK,GAAGgB,OAAOhB,KAAK,IAW7D,IATA4D,UAAW,EAEXkC,EAAIrH,KAAK6D,KAAKqI,IAr3BH,GAs3BXtC,EAAI,EACJ2C,GAAKxM,EAAEsJ,MAAMtJ,GACbuC,EAAI,IAAI6F,KAAKpI,GACbuM,GAAKvM,GAGS,IAAP0B,GAOL,GANA6K,GAAKA,GAAGjD,MAAMkD,IACdxK,EAAIO,EAAEd,MAAM8K,GAAG/B,IAAIX,GAAK,IAExB0C,GAAKA,GAAGjD,MAAMkD,SAGC,KAFfjK,EAAIP,EAAER,KAAK+K,GAAG/B,IAAIX,GAAK,KAEjB5H,EAAEqF,GAAe,IAAK5F,EAAI4F,EAAG/E,EAAEN,EAAEP,KAAOM,EAAEC,EAAEP,IAAMA,MAO1D,OAJI0E,IAAG7D,EAAIA,EAAE+G,MAAM,GAAMlD,EAAI,IAE7BhB,UAAW,EAEJ4C,SAASzF,EAAG6F,KAAKxD,UAAYmE,GAAIX,KAAKvD,SAAWkC,IAAI,EAC9D,EAOAd,EAAE9E,SAAW,WACX,QAASrB,KAAKmC,CAChB,EAOAgE,EAAEwG,UAAYxG,EAAEyG,MAAQ,WACtB,QAAS5M,KAAKmC,GAAKuD,UAAU1F,KAAKmI,EA55BvB,GA45BuCnI,KAAKmC,EAAEZ,OAAS,CACpE,EAOA4E,EAAErE,MAAQ,WACR,OAAQ9B,KAAKiI,CACf,EAOA9B,EAAE0G,WAAa1G,EAAE2F,MAAQ,WACvB,OAAO9L,KAAKiI,EAAI,CAClB,EAOA9B,EAAE2G,WAAa3G,EAAE4G,MAAQ,WACvB,OAAO/M,KAAKiI,EAAI,CAClB,EAOA9B,EAAEiD,OAAS,WACT,QAASpJ,KAAKmC,GAAmB,IAAdnC,KAAKmC,EAAE,EAC5B,EAOAgE,EAAE6G,SAAW7G,EAAE8G,GAAK,SAAUjK,GAC5B,OAAOhD,KAAKwI,IAAIxF,GAAK,CACvB,EAOAmD,EAAE+G,kBAAoB/G,EAAE8F,IAAM,SAAUjJ,GACtC,OAAOhD,KAAKwI,IAAIxF,GAAK,CACvB,EAiCAmD,EAAEgH,UAAYhH,EAAErF,IAAM,SAAUsM,MAC9B,IAAIC,SAAUlL,EAAGmL,YAAahH,EAAGiH,IAAKC,IAAKtE,GAAIzG,EAE7C6F,KADMtI,KACKgI,YACXiB,GAAKX,KAAKxD,UACVmC,GAAKqB,KAAKvD,SAIZ,GAAY,MAARqI,KACFA,KAAO,IAAI9E,KAAK,IAChB+E,UAAW,MACN,CAKL,GAHAlL,GADAiL,KAAO,IAAI9E,KAAK8E,OACPjL,EAGLiL,KAAKnF,EAAI,IAAM9F,IAAMA,EAAE,IAAMiL,KAAK9C,GAAG,GAAI,OAAO,IAAIhC,KAAKjE,KAE7DgJ,SAAWD,KAAK9C,GAAG,GACrB,CAKA,GAHAnI,EApBQnC,KAoBAmC,EApBAnC,KAuBAiI,EAAI,IAAM9F,IAAMA,EAAE,IAvBlBnC,KAuB4BsK,GAAG,GACrC,OAAO,IAAIhC,KAAKnG,IAAMA,EAAE,IAAK,IAAkB,GAxBzCnC,KAwBoCiI,EAAS5D,IAAMlC,EAAI,EAAI,KAKnE,GAAIkL,SACF,GAAIlL,EAAEZ,OAAS,EACbgM,KAAM,MACD,CACL,IAAKjH,EAAInE,EAAE,GAAImE,EAAI,IAAO,GAAIA,GAAK,GACnCiH,IAAY,IAANjH,CACR,CAyBF,GAtBAhB,UAAW,EAEXkI,IAAMC,iBAxCEzN,KAuCRkJ,GAAKD,GAnCK,GAqCVqE,YAAcD,SAAWK,QAAQpF,KAAMY,GAAK,IAAMuE,iBAAiBL,KAAMlE,IAmBrElC,qBAhBJvE,EAAI4H,OAAOmD,IAAKF,YAAapE,GAAI,IAgBP/G,EAAGmE,EAAI2C,GAAIhC,IAEnC,GAME,GAJAuG,IAAMC,iBAhEFzN,KA+DJkJ,IAAM,IAENoE,YAAcD,SAAWK,QAAQpF,KAAMY,GAAK,IAAMuE,iBAAiBL,KAAMlE,IACzEzG,EAAI4H,OAAOmD,IAAKF,YAAapE,GAAI,IAE5BqE,IAAK,EAGHlH,eAAe5D,EAAEN,GAAGiI,MAAM9D,EAAI,EAAGA,EAAI,IAAM,GAAK,OACnD7D,EAAIyF,SAASzF,EAAGwG,GAAK,EAAG,IAG1B,KACF,QACOjC,oBAAoBvE,EAAEN,EAAGmE,GAAK,GAAIW,KAK7C,OAFA3B,UAAW,EAEJ4C,SAASzF,EAAGwG,GAAIhC,GACzB,EAgDAd,EAAExE,MAAQwE,EAAEwH,IAAM,SAAU3K,GAC1B,IAAIb,EAAGgG,EAAGvG,EAAG4F,EAAGlB,EAAG6C,IAAKF,GAAIhC,GAAI2B,GAAIgF,GAAIC,KAAMhF,GAC5C3I,EAAIF,KACJsI,KAAOpI,EAAE8H,YAKX,GAHAhF,EAAI,IAAIsF,KAAKtF,IAGR9C,EAAEiC,IAAMa,EAAEb,EAab,OAVKjC,EAAE+H,GAAMjF,EAAEiF,EAGN/H,EAAEiC,EAAGa,EAAEiF,GAAKjF,EAAEiF,EAKlBjF,EAAI,IAAIsF,KAAKtF,EAAEb,GAAKjC,EAAE+H,IAAMjF,EAAEiF,EAAI/H,EAAImE,KARzBrB,EAAI,IAAIsF,KAAKjE,KAUxBrB,EAIT,GAAI9C,EAAE+H,GAAKjF,EAAEiF,EAEX,OADAjF,EAAEiF,GAAKjF,EAAEiF,EACF/H,EAAEwB,KAAKsB,GAShB,GANA4F,GAAK1I,EAAEiC,EACP0G,GAAK7F,EAAEb,EACP8G,GAAKX,KAAKxD,UACVmC,GAAKqB,KAAKvD,UAGL6D,GAAG,KAAOC,GAAG,GAAI,CAGpB,GAAIA,GAAG,GAAI7F,EAAEiF,GAAKjF,EAAEiF,MAGf,KAAIW,GAAG,GAIP,OAAO,IAAIN,KAAY,IAAPrB,IAAY,EAAI,GAJrBjE,EAAI,IAAIsF,KAAKpI,EAIU,CAEvC,OAAOoF,SAAW4C,SAASlF,EAAGiG,GAAIhC,IAAMjE,CAC1C,CAYA,GAPAmF,EAAIzC,UAAU1C,EAAEmF,EA/qCL,GAgrCXyF,GAAKlI,UAAUxF,EAAEiI,EAhrCN,GAkrCXS,GAAKA,GAAGwB,QACR9D,EAAIsH,GAAKzF,EAGF,CAyBL,KAxBA0F,KAAOvH,EAAI,IAGTnE,EAAIyG,GACJtC,GAAKA,EACL6C,IAAMN,GAAGtH,SAETY,EAAI0G,GACJV,EAAIyF,GACJzE,IAAMP,GAAGrH,QAQP+E,GAFJ1E,EAAIzB,KAAK2G,IAAI3G,KAAK6D,KAAKiF,GAtsCd,GAssC8BE,KAAO,KAG5C7C,EAAI1E,EACJO,EAAEZ,OAAS,GAIbY,EAAE2F,UACGlG,EAAI0E,EAAG1E,KAAMO,EAAE2L,KAAK,GACzB3L,EAAE2F,SAGJ,KAAO,CASL,KAHA+F,MAFAjM,EAAIgH,GAAGrH,SACP4H,IAAMN,GAAGtH,WAEC4H,IAAMvH,GAEXA,EAAI,EAAGA,EAAIuH,IAAKvH,IACnB,GAAIgH,GAAGhH,IAAMiH,GAAGjH,GAAI,CAClBiM,KAAOjF,GAAGhH,GAAKiH,GAAGjH,GAClB,KACF,CAGF0E,EAAI,CACN,CAaA,IAXIuH,OACF1L,EAAIyG,GACJA,GAAKC,GACLA,GAAK1G,EACLa,EAAEiF,GAAKjF,EAAEiF,GAGXkB,IAAMP,GAAGrH,OAIJK,EAAIiH,GAAGtH,OAAS4H,IAAKvH,EAAI,IAAKA,EAAGgH,GAAGO,OAAS,EAGlD,IAAKvH,EAAIiH,GAAGtH,OAAQK,EAAI0E,GAAI,CAE1B,GAAIsC,KAAKhH,GAAKiH,GAAGjH,GAAI,CACnB,IAAK4F,EAAI5F,EAAG4F,GAAiB,IAAZoB,KAAKpB,IAAWoB,GAAGpB,GAAKxB,KAAO,IAC9C4C,GAAGpB,GACLoB,GAAGhH,IAAMoE,IACX,CAEA4C,GAAGhH,IAAMiH,GAAGjH,EACd,CAGA,KAAqB,IAAdgH,KAAKO,MAAaP,GAAGmF,MAG5B,KAAiB,IAAVnF,GAAG,GAAUA,GAAGoF,UAAW7F,EAGlC,OAAKS,GAAG,IAER5F,EAAEb,EAAIyG,GACN5F,EAAEmF,EAAI8F,kBAAkBrF,GAAIT,GAErB7C,SAAW4C,SAASlF,EAAGiG,GAAIhC,IAAMjE,GALrB,IAAIsF,KAAY,IAAPrB,IAAY,EAAI,EAM9C,EA2BAd,EAAEnB,OAASmB,EAAE+H,IAAM,SAAUlL,GAC3B,IAAImL,EACFjO,EAAIF,KACJsI,KAAOpI,EAAE8H,YAKX,OAHAhF,EAAI,IAAIsF,KAAKtF,IAGR9C,EAAEiC,IAAMa,EAAEiF,GAAKjF,EAAEb,IAAMa,EAAEb,EAAE,GAAW,IAAImG,KAAKjE,MAG/CrB,EAAEb,GAAKjC,EAAEiC,IAAMjC,EAAEiC,EAAE,GACf+F,SAAS,IAAII,KAAKpI,GAAIoI,KAAKxD,UAAWwD,KAAKvD,WAIpDO,UAAW,EAEQ,GAAfgD,KAAKtD,QAIPmJ,EAAI9D,OAAOnK,EAAG8C,EAAEpC,MAAO,EAAG,EAAG,IAC3BqH,GAAKjF,EAAEiF,EAETkG,EAAI9D,OAAOnK,EAAG8C,EAAG,EAAGsF,KAAKtD,OAAQ,GAGnCmJ,EAAIA,EAAE3E,MAAMxG,GAEZsC,UAAW,EAEJpF,EAAEyB,MAAMwM,GACjB,EASAhI,EAAEiI,mBAAqBjI,EAAE/F,IAAM,WAC7B,OAAOgO,mBAAmBpO,KAC5B,EAQAmG,EAAEsH,iBAAmBtH,EAAE+F,GAAK,WAC1B,OAAOuB,iBAAiBzN,KAC1B,EAQAmG,EAAEkI,QAAUlI,EAAEwD,IAAM,WAClB,IAAIzJ,EAAI,IAAIF,KAAKgI,YAAYhI,MAE7B,OADAE,EAAE+H,GAAK/H,EAAE+H,EACFC,SAAShI,EAClB,EAwBAiG,EAAEzE,KAAOyE,EAAEmI,IAAM,SAAUtL,GACzB,IAAIuL,MAAOpM,EAAGgG,EAAGvG,EAAG0E,EAAG6C,IAAKF,GAAIhC,GAAI2B,GAAIC,GACtC3I,EAAIF,KACJsI,KAAOpI,EAAE8H,YAKX,GAHAhF,EAAI,IAAIsF,KAAKtF,IAGR9C,EAAEiC,IAAMa,EAAEb,EAWb,OARKjC,EAAE+H,GAAMjF,EAAEiF,EAML/H,EAAEiC,IAAGa,EAAI,IAAIsF,KAAKtF,EAAEb,GAAKjC,EAAE+H,IAAMjF,EAAEiF,EAAI/H,EAAImE,MANnCrB,EAAI,IAAIsF,KAAKjE,KAQxBrB,EAIT,GAAI9C,EAAE+H,GAAKjF,EAAEiF,EAEX,OADAjF,EAAEiF,GAAKjF,EAAEiF,EACF/H,EAAEyB,MAAMqB,GASjB,GANA4F,GAAK1I,EAAEiC,EACP0G,GAAK7F,EAAEb,EACP8G,GAAKX,KAAKxD,UACVmC,GAAKqB,KAAKvD,UAGL6D,GAAG,KAAOC,GAAG,GAMhB,OAFKA,GAAG,KAAI7F,EAAI,IAAIsF,KAAKpI,IAElBoF,SAAW4C,SAASlF,EAAGiG,GAAIhC,IAAMjE,EAa1C,GAPAsD,EAAIZ,UAAUxF,EAAEiI,EA/6CL,GAg7CXA,EAAIzC,UAAU1C,EAAEmF,EAh7CL,GAk7CXS,GAAKA,GAAGwB,QACRxI,EAAI0E,EAAI6B,EAGD,CAuBL,IArBIvG,EAAI,GACNO,EAAIyG,GACJhH,GAAKA,EACLuH,IAAMN,GAAGtH,SAETY,EAAI0G,GACJV,EAAI7B,EACJ6C,IAAMP,GAAGrH,QAOPK,GAFJuH,KADA7C,EAAInG,KAAK6D,KAAKiF,GAn8CL,IAo8CCE,IAAM7C,EAAI,EAAI6C,IAAM,KAG5BvH,EAAIuH,IACJhH,EAAEZ,OAAS,GAIbY,EAAE2F,UACKlG,KAAMO,EAAE2L,KAAK,GACpB3L,EAAE2F,SACJ,CAcA,KAZAqB,IAAMP,GAAGrH,SACTK,EAAIiH,GAAGtH,QAGO,IACZK,EAAIuH,IACJhH,EAAI0G,GACJA,GAAKD,GACLA,GAAKzG,GAIFoM,MAAQ,EAAG3M,GACd2M,OAAS3F,KAAKhH,GAAKgH,GAAGhH,GAAKiH,GAAGjH,GAAK2M,OAASvI,KAAO,EACnD4C,GAAGhH,IAAMoE,KAUX,IAPIuI,QACF3F,GAAG4F,QAAQD,SACTpG,GAKCgB,IAAMP,GAAGrH,OAAqB,GAAbqH,KAAKO,MAAYP,GAAGmF,MAK1C,OAHA/K,EAAEb,EAAIyG,GACN5F,EAAEmF,EAAI8F,kBAAkBrF,GAAIT,GAErB7C,SAAW4C,SAASlF,EAAGiG,GAAIhC,IAAMjE,CAC1C,EASAmD,EAAErB,UAAYqB,EAAE+C,GAAK,SAAUhI,GAC7B,IAAIoF,EACFpG,EAAIF,KAEN,QAAU,IAANkB,GAAgBA,MAAQA,GAAW,IAANA,GAAiB,IAANA,EAAS,MAAM6F,MAAMxB,gBAAkBrE,GASnF,OAPIhB,EAAEiC,GACJmE,EAAImI,aAAavO,EAAEiC,GACfjB,GAAKhB,EAAEiI,EAAI,EAAI7B,IAAGA,EAAIpG,EAAEiI,EAAI,IAEhC7B,EAAIjC,IAGCiC,CACT,EAQAH,EAAEjC,MAAQ,WACR,IAAIhE,EAAIF,KACNsI,KAAOpI,EAAE8H,YAEX,OAAOE,SAAS,IAAII,KAAKpI,GAAIA,EAAEiI,EAAI,EAAGG,KAAKvD,SAC7C,EAkBAoB,EAAEuI,KAAOvI,EAAE7E,IAAM,WACf,IAAI2H,GAAIhC,GACN/G,EAAIF,KACJsI,KAAOpI,EAAE8H,YAEX,OAAK9H,EAAEmB,WACHnB,EAAEkJ,SAAiB,IAAId,KAAKpI,IAEhC+I,GAAKX,KAAKxD,UACVmC,GAAKqB,KAAKvD,SACVuD,KAAKxD,UAAYmE,GAAK9I,KAAK2G,IAAI5G,EAAEiI,EAAGjI,EAAEgJ,MA/iD3B,EAgjDXZ,KAAKvD,SAAW,EAEhB7E,EAs7DF,SAAcoI,KAAMpI,GAClB,IAAIoG,EACF6C,IAAMjJ,EAAEiC,EAAEZ,OAEZ,GAAI4H,IAAM,EACR,OAAOjJ,EAAEkJ,SAAWlJ,EAAIqJ,aAAajB,KAAM,EAAGpI,EAAGA,GASnDoG,GADAA,EAAI,IAAMnG,KAAKuC,KAAKyG,MACZ,GAAK,GAAS,EAAJ7C,EAElBpG,EAAIA,EAAEsJ,MAAM,EAAIH,QAAQ,EAAG/C,IAC3BpG,EAAIqJ,aAAajB,KAAM,EAAGpI,EAAGA,GAO7B,IAJA,IAAIyO,OACFpD,GAAK,IAAIjD,KAAK,GACdkD,IAAM,IAAIlD,KAAK,IACfmD,IAAM,IAAInD,KAAK,IACVhC,KACLqI,OAASzO,EAAEsJ,MAAMtJ,GACjBA,EAAIA,EAAEsJ,MAAM+B,GAAG7J,KAAKiN,OAAOnF,MAAMgC,IAAIhC,MAAMmF,QAAQhN,MAAM8J,QAG3D,OAAOvL,CACT,CAp9DMwO,CAAKpG,KAAMoB,iBAAiBpB,KAAMpI,IAEtCoI,KAAKxD,UAAYmE,GACjBX,KAAKvD,SAAWkC,GAETiB,SAASzD,SAAW,EAAIvE,EAAEyJ,MAAQzJ,EAAG+I,GAAIhC,IAAI,IAb1B,IAAIqB,KAAKjE,IAcrC,EAeA8B,EAAEyI,WAAazI,EAAEzD,KAAO,WACtB,IAAIoH,EAAGC,EAAGb,GAAIzG,EAAGuH,IAAK9H,EACpBhC,EAAIF,KACJmC,EAAIjC,EAAEiC,EACNgG,EAAIjI,EAAEiI,EACNF,EAAI/H,EAAE+H,EACNK,KAAOpI,EAAE8H,YAGX,GAAU,IAANC,IAAY9F,IAAMA,EAAE,GACtB,OAAO,IAAImG,MAAML,GAAKA,EAAI,KAAO9F,GAAKA,EAAE,IAAMkC,IAAMlC,EAAIjC,EAAI,KAgC9D,IA7BAoF,UAAW,EAOF,IAJT2C,EAAI9H,KAAKuC,MAAMxC,KAID+H,GAAK,OACjB8B,EAAI1D,eAAelE,IAEZZ,OAAS4G,GAAK,GAAK,IAAG4B,GAAK,KAClC9B,EAAI9H,KAAKuC,KAAKqH,GACd5B,EAAIzC,WAAWyC,EAAI,GAAK,IAAMA,EAAI,GAAKA,EAAI,GAS3C1F,EAAI,IAAI6F,KANNyB,EADE9B,GAAK,IACH,KAAOE,GAEX4B,EAAI9B,EAAEkC,iBACAC,MAAM,EAAGL,EAAEnC,QAAQ,KAAO,GAAKO,IAKvC1F,EAAI,IAAI6F,KAAKL,EAAEqB,YAGjBJ,IAAMf,EAAIG,KAAKxD,WAAa,IAQ1B,GAHArC,GADAP,EAAIO,GACEf,KAAK2I,OAAOnK,EAAGgC,EAAGgH,GAAK,EAAG,IAAIM,MAAM,IAGtCnD,eAAenE,EAAEC,GAAGiI,MAAM,EAAGlB,OAASa,EAAI1D,eAAe5D,EAAEN,IAAIiI,MAAM,EAAGlB,IAAK,CAK/E,GAAS,SAJTa,EAAIA,EAAEK,MAAMlB,GAAK,EAAGA,GAAK,MAILc,KAAY,QAALD,GAepB,EAICA,KAAOA,EAAEK,MAAM,IAAqB,KAAfL,EAAElC,OAAO,MAGlCK,SAASzF,EAAG0F,EAAI,EAAG,GACnB2B,GAAKrH,EAAE+G,MAAM/G,GAAG6H,GAAGpK,IAGrB,KACF,CAvBE,IAAK8J,MACH9B,SAAShG,EAAGiG,EAAI,EAAG,GAEfjG,EAAEsH,MAAMtH,GAAGoI,GAAGpK,IAAI,CACpBuC,EAAIP,EACJ,KACF,CAGFgH,IAAM,EACNc,IAAM,CAcV,CAKF,OAFA1E,UAAW,EAEJ4C,SAASzF,EAAG0F,EAAGG,KAAKvD,SAAU+E,EACvC,EAgBA3D,EAAE0I,QAAU1I,EAAE2I,IAAM,WAClB,IAAI7F,GAAIhC,GACN/G,EAAIF,KACJsI,KAAOpI,EAAE8H,YAEX,OAAK9H,EAAEmB,WACHnB,EAAEkJ,SAAiB,IAAId,KAAKpI,IAEhC+I,GAAKX,KAAKxD,UACVmC,GAAKqB,KAAKvD,SACVuD,KAAKxD,UAAYmE,GAAK,GACtBX,KAAKvD,SAAW,GAEhB7E,EAAIA,EAAEoB,OACJ2G,EAAI,EACN/H,EAAImK,OAAOnK,EAAG,IAAIoI,KAAK,GAAG3G,MAAMzB,EAAEsJ,MAAMtJ,IAAIwC,OAAQuG,GAAK,GAAI,GAE7DX,KAAKxD,UAAYmE,GACjBX,KAAKvD,SAAWkC,GAETiB,SAAqB,GAAZzD,UAA6B,GAAZA,SAAgBvE,EAAEyJ,MAAQzJ,EAAG+I,GAAIhC,IAAI,IAf5C,IAAIqB,KAAKjE,IAgBrC,EAwBA8B,EAAEqD,MAAQrD,EAAE4I,IAAM,SAAU/L,GAC1B,IAAIuL,MAAOpG,EAAGvG,EAAG0E,EAAG7D,EAAGuM,GAAI9M,EAAGwG,IAAKC,IACjCzI,EAAIF,KACJsI,KAAOpI,EAAE8H,YACTY,GAAK1I,EAAEiC,EACP0G,IAAM7F,EAAI,IAAIsF,KAAKtF,IAAIb,EAKzB,GAHAa,EAAEiF,GAAK/H,EAAE+H,IAGJW,IAAOA,GAAG,IAAOC,IAAOA,GAAG,IAE9B,OAAO,IAAIP,MAAMtF,EAAEiF,GAAKW,KAAOA,GAAG,KAAOC,IAAMA,KAAOA,GAAG,KAAOD,GAI5DvE,IAICuE,IAAOC,GAAqB,EAAN7F,EAAEiF,EAAZjF,EAAEiF,EAAI,GAoBzB,IAjBAE,EAAIzC,UAAUxF,EAAEiI,EAjvDL,GAivDqBzC,UAAU1C,EAAEmF,EAjvDjC,IAkvDXO,IAAME,GAAGrH,SACToH,IAAME,GAAGtH,UAIPkB,EAAImG,GACJA,GAAKC,GACLA,GAAKpG,EACLuM,GAAKtG,IACLA,IAAMC,IACNA,IAAMqG,IAIRvM,EAAI,GAECb,EADLoN,GAAKtG,IAAMC,IACE/G,KAAMa,EAAEqL,KAAK,GAG1B,IAAKlM,EAAI+G,MAAO/G,GAAK,GAAI,CAEvB,IADA2M,MAAQ,EACHjI,EAAIoC,IAAM9G,EAAG0E,EAAI1E,GACpBM,EAAIO,EAAE6D,GAAKuC,GAAGjH,GAAKgH,GAAGtC,EAAI1E,EAAI,GAAK2M,MACnC9L,EAAE6D,KAAOpE,EAAI8D,KAAO,EACpBuI,MAAQrM,EAAI8D,KAAO,EAGrBvD,EAAE6D,IAAM7D,EAAE6D,GAAKiI,OAASvI,KAAO,CACjC,CAGA,MAAQvD,IAAIuM,KAAMvM,EAAEsL,MAQpB,OANIQ,QAASpG,EACR1F,EAAEuL,QAEPhL,EAAEb,EAAIM,EACNO,EAAEmF,EAAI8F,kBAAkBxL,EAAG0F,GAEpB7C,SAAW4C,SAASlF,EAAGsF,KAAKxD,UAAWwD,KAAKvD,UAAY/B,CACjE,EAaAmD,EAAE8I,SAAW,SAAU/F,GAAIjC,IACzB,OAAOiI,eAAelP,KAAM,EAAGkJ,GAAIjC,GACrC,EAaAd,EAAEgJ,gBAAkBhJ,EAAEiJ,KAAO,SAAU5E,GAAIvD,IACzC,IAAI/G,EAAIF,KACNsI,KAAOpI,EAAE8H,YAGX,OADA9H,EAAI,IAAIoI,KAAKpI,QACF,IAAPsK,GAAsBtK,GAE1B0G,WAAW4D,GAAI,EA75DF,UA+5DF,IAAPvD,GAAeA,GAAKqB,KAAKvD,SACxB6B,WAAWK,GAAI,EAAG,GAEhBiB,SAAShI,EAAGsK,GAAKtK,EAAEiI,EAAI,EAAGlB,IACnC,EAWAd,EAAEgE,cAAgB,SAAUK,GAAIvD,IAC9B,IAAIR,IACFvG,EAAIF,KACJsI,KAAOpI,EAAE8H,YAcX,YAZW,IAAPwC,GACF/D,IAAM4I,eAAenP,GAAG,IAExB0G,WAAW4D,GAAI,EAt7DJ,UAw7DA,IAAPvD,GAAeA,GAAKqB,KAAKvD,SACxB6B,WAAWK,GAAI,EAAG,GAGvBR,IAAM4I,eADNnP,EAAIgI,SAAS,IAAII,KAAKpI,GAAIsK,GAAK,EAAGvD,KACV,EAAMuD,GAAK,IAG9BtK,EAAE4L,UAAY5L,EAAEkJ,SAAW,IAAM3C,IAAMA,GAChD,EAmBAN,EAAEmJ,QAAU,SAAU9E,GAAIvD,IACxB,IAAIR,IAAKzD,EACP9C,EAAIF,KACJsI,KAAOpI,EAAE8H,YAgBX,YAdW,IAAPwC,GACF/D,IAAM4I,eAAenP,IAErB0G,WAAW4D,GAAI,EA39DJ,UA69DA,IAAPvD,GAAeA,GAAKqB,KAAKvD,SACxB6B,WAAWK,GAAI,EAAG,GAGvBR,IAAM4I,eADNrM,EAAIkF,SAAS,IAAII,KAAKpI,GAAIsK,GAAKtK,EAAEiI,EAAI,EAAGlB,KAChB,EAAOuD,GAAKxH,EAAEmF,EAAI,IAKrCjI,EAAE4L,UAAY5L,EAAEkJ,SAAW,IAAM3C,IAAMA,GAChD,EAcAN,EAAEoJ,WAAa,SAAUC,MACvB,IAAIrN,EAAGsN,GAAIC,GAAIC,GAAIxH,EAAG7B,EAAGyD,EAAG6F,GAAIC,GAAI5G,GAAIkF,EAAG1L,EACzCvC,EAAIF,KACJ4I,GAAK1I,EAAEiC,EACPmG,KAAOpI,EAAE8H,YAEX,IAAKY,GAAI,OAAO,IAAIN,KAAKpI,GAUzB,GARA2P,GAAKJ,GAAK,IAAInH,KAAK,GACnBoH,GAAKE,GAAK,IAAItH,KAAK,GAInBhC,GADA6B,GADAhG,EAAI,IAAImG,KAAKoH,KACPvH,EAAIsG,aAAa7F,IAAM1I,EAAEiI,EAAI,GAj6DxB,EAm6DXhG,EAAEA,EAAE,GAAKwD,QAAQ,GAAIW,EAAI,EAn6Dd,EAm6D6BA,EAAIA,GAEhC,MAARkJ,KAGFA,KAAOrH,EAAI,EAAIhG,EAAI0N,OACd,CAEL,KADA9F,EAAI,IAAIzB,KAAKkH,OACN5C,SAAW7C,EAAEkD,GAAG4C,IAAK,MAAM9I,MAAMxB,gBAAkBwE,GAC1DyF,KAAOzF,EAAExB,GAAGpG,GAAMgG,EAAI,EAAIhG,EAAI0N,GAAM9F,CACtC,CAOA,IALAzE,UAAW,EACXyE,EAAI,IAAIzB,KAAKjC,eAAeuC,KAC5BK,GAAKX,KAAKxD,UACVwD,KAAKxD,UAAYqD,EAl7DN,EAk7DUS,GAAGrH,OAAoB,EAG1C4M,EAAI9D,OAAON,EAAG5H,EAAG,EAAG,EAAG,GAEH,IADpBwN,GAAKF,GAAG/N,KAAKyM,EAAE3E,MAAMkG,MACdlH,IAAIgH,OACXC,GAAKC,GACLA,GAAKC,GACLA,GAAKE,GACLA,GAAKD,GAAGlO,KAAKyM,EAAE3E,MAAMmG,KACrBC,GAAKD,GACLA,GAAKxN,EACLA,EAAI4H,EAAEpI,MAAMwM,EAAE3E,MAAMmG,KACpB5F,EAAI4F,GAeN,OAZAA,GAAKtF,OAAOmF,KAAK7N,MAAM8N,IAAKC,GAAI,EAAG,EAAG,GACtCE,GAAKA,GAAGlO,KAAKiO,GAAGnG,MAAMqG,KACtBJ,GAAKA,GAAG/N,KAAKiO,GAAGnG,MAAMkG,KACtBE,GAAG3H,EAAI4H,GAAG5H,EAAI/H,EAAE+H,EAGhBxF,EAAI4H,OAAOwF,GAAIH,GAAIvH,EAAG,GAAGxG,MAAMzB,GAAGU,MAAM4H,IAAI6B,OAAOuF,GAAIH,GAAItH,EAAG,GAAGxG,MAAMzB,GAAGU,OAAS,EAC7E,CAACiP,GAAIH,IAAM,CAACE,GAAIH,IAEtBnH,KAAKxD,UAAYmE,GACjB3D,UAAW,EAEJ7C,CACT,EAaA0D,EAAE2J,cAAgB3J,EAAE4J,MAAQ,SAAU7G,GAAIjC,IACxC,OAAOiI,eAAelP,KAAM,GAAIkJ,GAAIjC,GACtC,EAmBAd,EAAE6J,UAAY,SAAUhN,EAAGiE,IACzB,IAAI/G,EAAIF,KACNsI,KAAOpI,EAAE8H,YAIX,GAFA9H,EAAI,IAAIoI,KAAKpI,GAEJ,MAAL8C,EAAW,CAGb,IAAK9C,EAAEiC,EAAG,OAAOjC,EAEjB8C,EAAI,IAAIsF,KAAK,GACbrB,GAAKqB,KAAKvD,QACZ,KAAO,CASL,GARA/B,EAAI,IAAIsF,KAAKtF,QACF,IAAPiE,GACFA,GAAKqB,KAAKvD,SAEV6B,WAAWK,GAAI,EAAG,IAIf/G,EAAEiC,EAAG,OAAOa,EAAEiF,EAAI/H,EAAI8C,EAG3B,IAAKA,EAAEb,EAEL,OADIa,EAAEiF,IAAGjF,EAAEiF,EAAI/H,EAAE+H,GACVjF,CAEX,CAeA,OAZIA,EAAEb,EAAE,IACNmD,UAAW,EACXpF,EAAImK,OAAOnK,EAAG8C,EAAG,EAAGiE,GAAI,GAAGuC,MAAMxG,GACjCsC,UAAW,EACX4C,SAAShI,KAIT8C,EAAEiF,EAAI/H,EAAE+H,EACR/H,EAAI8C,GAGC9C,CACT,EAQAiG,EAAE8J,SAAW,WACX,OAAQjQ,IACV,EAaAmG,EAAE+J,QAAU,SAAUhH,GAAIjC,IACxB,OAAOiI,eAAelP,KAAM,EAAGkJ,GAAIjC,GACrC,EA8CAd,EAAEgK,QAAUhK,EAAE/D,IAAM,SAAUY,GAC5B,IAAImF,EAAG7B,EAAG2C,GAAIxG,EAAGwE,GAAIgB,EACnB/H,EAAIF,KACJsI,KAAOpI,EAAE8H,YACToI,KAAOpN,EAAI,IAAIsF,KAAKtF,IAGtB,KAAK9C,EAAEiC,GAAMa,EAAEb,GAAMjC,EAAEiC,EAAE,IAAOa,EAAEb,EAAE,IAAI,OAAO,IAAImG,KAAK3C,SAASzF,EAAGkQ,KAIpE,IAFAlQ,EAAI,IAAIoI,KAAKpI,IAEPoK,GAAG,GAAI,OAAOpK,EAKpB,GAHA+I,GAAKX,KAAKxD,UACVmC,GAAKqB,KAAKvD,SAEN/B,EAAEsH,GAAG,GAAI,OAAOpC,SAAShI,EAAG+I,GAAIhC,IAMpC,IAHAkB,EAAIzC,UAAU1C,EAAEmF,EAxnEL,KA2nEFnF,EAAEb,EAAEZ,OAAS,IAAM+E,EAAI8J,GAAK,GAAKA,GAAKA,KA1nE5B,iBA4nEjB,OADA3N,EAAI4N,OAAO/H,KAAMpI,EAAGoG,EAAG2C,IAChBjG,EAAEiF,EAAI,EAAI,IAAIK,KAAK,GAAGoC,IAAIjI,GAAKyF,SAASzF,EAAGwG,GAAIhC,IAMxD,IAHAgB,EAAI/H,EAAE+H,GAGE,EAAG,CAGT,GAAIE,EAAInF,EAAEb,EAAEZ,OAAS,EAAG,OAAO,IAAI+G,KAAKjE,KAMxC,GAHoB,IAAN,EAATrB,EAAEb,EAAEgG,MAAcF,EAAI,GAGhB,GAAP/H,EAAEiI,GAAoB,GAAVjI,EAAEiC,EAAE,IAAyB,GAAdjC,EAAEiC,EAAEZ,OAEjC,OADArB,EAAE+H,EAAIA,EACC/H,CAEX,CAcA,OAPAiI,EAAS,IADT7B,EAAIX,SAASzF,EAAGkQ,MACD/O,SAASiF,GAEpB,IAAIgC,KAAKhC,EAAI,IAAI6B,EADjBzC,UAAU0K,IAAMjQ,KAAKW,IAAI,KAAOuF,eAAenG,EAAEiC,IAAMhC,KAAKyE,KAAO1E,EAAEiI,EAAI,KAMrEG,KAAKlD,KAAO,GAAK+C,EAAIG,KAAKnD,KAAO,EAAU,IAAImD,KAAKH,EAAI,EAAIF,EAAI,EAAI,IAE5E3C,UAAW,EACXgD,KAAKvD,SAAW7E,EAAE+H,EAAI,EAMtB3B,EAAInG,KAAK0G,IAAI,IAAKsB,EAAI,IAAI5G,SAG1BkB,EAAI2L,mBAAmBpL,EAAEwG,MAAMiE,iBAAiBvN,EAAG+I,GAAK3C,IAAK2C,KAGvD9G,GAOA6E,qBAJJvE,EAAIyF,SAASzF,EAAGwG,GAAK,EAAG,IAIE9G,EAAG8G,GAAIhC,MAC/BkB,EAAIc,GAAK,IAMJ5C,gBAHL5D,EAAIyF,SAASkG,mBAAmBpL,EAAEwG,MAAMiE,iBAAiBvN,EAAGiI,EAAI7B,IAAK6B,GAAIA,EAAI,EAAG,IAG1DhG,GAAGiI,MAAMnB,GAAK,EAAGA,GAAK,IAAM,GAAK,OACrDxG,EAAIyF,SAASzF,EAAGwG,GAAK,EAAG,KAK9BxG,EAAEwF,EAAIA,EACN3C,UAAW,EACXgD,KAAKvD,SAAWkC,GAETiB,SAASzF,EAAGwG,GAAIhC,IACzB,EAcAd,EAAEmK,YAAc,SAAUpH,GAAIjC,IAC5B,IAAIR,IACFvG,EAAIF,KACJsI,KAAOpI,EAAE8H,YAcX,YAZW,IAAPkB,GACFzC,IAAM4I,eAAenP,EAAGA,EAAEiI,GAAKG,KAAKrD,UAAY/E,EAAEiI,GAAKG,KAAKpD,WAE5D0B,WAAWsC,GAAI,EA5zEJ,UA8zEA,IAAPjC,GAAeA,GAAKqB,KAAKvD,SACxB6B,WAAWK,GAAI,EAAG,GAGvBR,IAAM4I,eADNnP,EAAIgI,SAAS,IAAII,KAAKpI,GAAIgJ,GAAIjC,IACNiC,IAAMhJ,EAAEiI,GAAKjI,EAAEiI,GAAKG,KAAKrD,SAAUiE,KAGtDhJ,EAAE4L,UAAY5L,EAAEkJ,SAAW,IAAM3C,IAAMA,GAChD,EAiBAN,EAAEoK,oBAAsBpK,EAAEqK,KAAO,SAAUtH,GAAIjC,IAC7C,IACEqB,KADMtI,KACGgI,YAYX,YAVW,IAAPkB,IACFA,GAAKZ,KAAKxD,UACVmC,GAAKqB,KAAKvD,WAEV6B,WAAWsC,GAAI,EA/1EJ,UAi2EA,IAAPjC,GAAeA,GAAKqB,KAAKvD,SACxB6B,WAAWK,GAAI,EAAG,IAGlBiB,SAAS,IAAII,KAbZtI,MAaqBkJ,GAAIjC,GACnC,EAUAd,EAAEmD,SAAW,WACX,IAAIpJ,EAAIF,KACNsI,KAAOpI,EAAE8H,YACTvB,IAAM4I,eAAenP,EAAGA,EAAEiI,GAAKG,KAAKrD,UAAY/E,EAAEiI,GAAKG,KAAKpD,UAE9D,OAAOhF,EAAE4L,UAAY5L,EAAEkJ,SAAW,IAAM3C,IAAMA,GAChD,EAOAN,EAAEsK,UAAYtK,EAAEuK,MAAQ,WACtB,OAAOxI,SAAS,IAAIlI,KAAKgI,YAAYhI,MAAOA,KAAKmI,EAAI,EAAG,EAC1D,EAQAhC,EAAEwK,QAAUxK,EAAEyK,OAAS,WACrB,IAAI1Q,EAAIF,KACNsI,KAAOpI,EAAE8H,YACTvB,IAAM4I,eAAenP,EAAGA,EAAEiI,GAAKG,KAAKrD,UAAY/E,EAAEiI,GAAKG,KAAKpD,UAE9D,OAAOhF,EAAE4L,QAAU,IAAMrF,IAAMA,GACjC,EAkNA,IAAI4D,OAAS,WAGX,SAASwG,gBAAgB3Q,EAAGoG,EAAG8G,MAC7B,IAAIzJ,KACF4K,MAAQ,EACR3M,EAAI1B,EAAEqB,OAER,IAAKrB,EAAIA,EAAEkK,QAASxI,KAClB+B,KAAOzD,EAAE0B,GAAK0E,EAAIiI,MAClBrO,EAAE0B,GAAK+B,KAAOyJ,KAAO,EACrBmB,MAAQ5K,KAAOyJ,KAAO,EAKxB,OAFImB,OAAOrO,EAAEsO,QAAQD,OAEdrO,CACT,CAEA,SAAS4Q,QAAQrQ,EAAGC,EAAGqQ,GAAIC,IACzB,IAAIpP,EAAGa,EAEP,GAAIsO,IAAMC,GACRvO,EAAIsO,GAAKC,GAAK,GAAK,OAEnB,IAAKpP,EAAIa,EAAI,EAAGb,EAAImP,GAAInP,IACtB,GAAInB,EAAEmB,IAAMlB,EAAEkB,GAAI,CAChBa,EAAIhC,EAAEmB,GAAKlB,EAAEkB,GAAK,GAAK,EACvB,KACF,CAIJ,OAAOa,CACT,CAEA,SAASwO,SAASxQ,EAAGC,EAAGqQ,GAAI3D,MAI1B,IAHA,IAAIxL,EAAI,EAGDmP,MACLtQ,EAAEsQ,KAAOnP,EACTA,EAAInB,EAAEsQ,IAAMrQ,EAAEqQ,IAAM,EAAI,EACxBtQ,EAAEsQ,IAAMnP,EAAIwL,KAAO3M,EAAEsQ,IAAMrQ,EAAEqQ,IAI/B,MAAQtQ,EAAE,IAAMA,EAAEc,OAAS,GAAId,EAAEuN,OACnC,CAEA,OAAO,SAAU9N,EAAG8C,EAAGiG,GAAIhC,GAAIuD,GAAI4C,MACjC,IAAI5E,IAAKL,EAAGvG,EAAG0E,EAAG4K,QAASC,KAAMC,KAAMC,MAAOlD,EAAGmD,GAAIC,IAAKC,KAAMC,KAAMvI,GAAIhH,EAAGwP,GAAIC,GAAIC,IACnFC,GAAIC,GACJxJ,KAAOpI,EAAE8H,YACT+J,KAAO7R,EAAE+H,GAAKjF,EAAEiF,EAAI,GAAK,EACzBW,GAAK1I,EAAEiC,EACP0G,GAAK7F,EAAEb,EAGT,KAAKyG,IAAOA,GAAG,IAAOC,IAAOA,GAAG,IAE9B,OAAO,IAAIP,KACRpI,EAAE+H,GAAMjF,EAAEiF,IAAMW,IAAKC,IAAMD,GAAG,IAAMC,GAAG,GAAMA,IAG9CD,IAAe,GAATA,GAAG,KAAYC,GAAY,EAAPkJ,KAAWA,KAAO,EAHQ1N,KAsBxD,IAhBI+I,MACF8D,QAAU,EACV/I,EAAIjI,EAAEiI,EAAInF,EAAEmF,IAEZiF,KAAOpH,KACPkL,QAxkFO,EAykFP/I,EAAIzC,UAAUxF,EAAEiI,EAAI+I,SAAWxL,UAAU1C,EAAEmF,EAAI+I,UAGjDW,GAAKhJ,GAAGtH,OACRoQ,GAAK/I,GAAGrH,OAER+P,IADAnD,EAAI,IAAI7F,KAAKyJ,OACN5P,EAAI,GAINP,EAAI,EAAGiH,GAAGjH,KAAOgH,GAAGhH,IAAM,GAAIA,KAanC,GAXIiH,GAAGjH,IAAMgH,GAAGhH,IAAM,IAAIuG,IAEhB,MAANc,IACFC,GAAKD,GAAKX,KAAKxD,UACfmC,GAAKqB,KAAKvD,UAEVmE,GADSsB,GACJvB,IAAM/I,EAAEiI,EAAInF,EAAEmF,GAAK,EAEnBc,GAGHC,GAAK,EACPoI,GAAGxD,KAAK,GACRqD,MAAO,MACF,CAOL,GAJAjI,GAAKA,GAAKgI,QAAU,EAAI,EACxBtP,EAAI,EAGM,GAANiQ,GAAS,CAMX,IALAvL,EAAI,EACJuC,GAAKA,GAAG,GACRK,MAGQtH,EAAI+P,IAAMrL,IAAM4C,KAAMtH,IAC5BM,EAAIoE,EAAI8G,MAAQxE,GAAGhH,IAAM,GACzB0P,GAAG1P,GAAKM,EAAI2G,GAAK,EACjBvC,EAAIpE,EAAI2G,GAAK,EAGfsI,KAAO7K,GAAK1E,EAAI+P,EAGlB,KAAO,CAiBL,KAdArL,EAAI8G,MAAQvE,GAAG,GAAK,GAAK,GAEjB,IACNA,GAAKgI,gBAAgBhI,GAAIvC,EAAG8G,MAC5BxE,GAAKiI,gBAAgBjI,GAAItC,EAAG8G,MAC5ByE,GAAKhJ,GAAGtH,OACRoQ,GAAK/I,GAAGrH,QAGVmQ,GAAKG,GAELL,MADAD,IAAM3I,GAAGwB,MAAM,EAAGyH,KACPtQ,OAGJiQ,KAAOK,IAAKN,IAAIC,QAAU,GAEjCM,GAAKjJ,GAAGuB,SACLoE,QAAQ,GACXoD,IAAM/I,GAAG,GAELA,GAAG,IAAMuE,KAAO,KAAKwE,IAEzB,GACEtL,EAAI,GAGJkC,IAAMsI,QAAQjI,GAAI0I,IAAKM,GAAIL,OAGjB,GAGRC,KAAOF,IAAI,GACPM,IAAML,OAAMC,KAAOA,KAAOrE,MAAQmE,IAAI,IAAM,KAGhDjL,EAAImL,KAAOG,IAAM,GAUT,GACFtL,GAAK8G,OAAM9G,EAAI8G,KAAO,GAWf,IAHX5E,IAAMsI,QALNM,KAAOP,gBAAgBhI,GAAIvC,EAAG8G,MAKVmE,IAJpBF,MAAQD,KAAK7P,OACbiQ,KAAOD,IAAIhQ,WAOT+E,IAGA2K,SAASG,KAAMS,GAAKR,MAAQS,GAAKjJ,GAAIwI,MAAOjE,SAOrC,GAAL9G,IAAQkC,IAAMlC,EAAI,GACtB8K,KAAOvI,GAAGuB,UAGZiH,MAAQD,KAAK7P,QACDiQ,MAAMJ,KAAK5C,QAAQ,GAG/ByC,SAASM,IAAKH,KAAMI,KAAMpE,OAGd,GAAR5E,MAIFA,IAAMsI,QAAQjI,GAAI0I,IAAKM,GAHvBL,KAAOD,IAAIhQ,SAMD,IACR+E,IAGA2K,SAASM,IAAKM,GAAKL,KAAOM,GAAKjJ,GAAI2I,KAAMpE,OAI7CoE,KAAOD,IAAIhQ,QACM,IAARiH,MACTlC,IACAiL,IAAM,CAAC,IAITD,GAAG1P,KAAO0E,EAGNkC,KAAO+I,IAAI,GACbA,IAAIC,QAAU5I,GAAG8I,KAAO,GAExBH,IAAM,CAAC3I,GAAG8I,KACVF,KAAO,UAGDE,KAAOC,SAAiB,IAAXJ,IAAI,KAAkBrI,MAE7CiI,UAAkB,IAAXI,IAAI,EACb,CAGKD,GAAG,IAAIA,GAAGtD,OACjB,CAGA,GAAe,GAAXkD,QACF/C,EAAEhG,EAAIA,EACN3D,QAAU2M,SACL,CAGL,IAAKvP,EAAI,EAAG0E,EAAIgL,GAAG,GAAIhL,GAAK,GAAIA,GAAK,GAAI1E,IACzCuM,EAAEhG,EAAIvG,EAAIuG,EAAI+I,QAAU,EAExBhJ,SAASiG,EAAG3D,GAAKvB,GAAKkF,EAAEhG,EAAI,EAAIc,GAAIhC,GAAIkK,KAC1C,CAEA,OAAOhD,CACT,CACD,CArQY,GA4QZ,SAASjG,SAAShI,EAAGgJ,GAAIjC,GAAI+K,aAC5B,IAAIC,OAAQrQ,EAAG4F,EAAGlB,EAAGc,GAAI8K,QAASxL,EAAGkC,GAAIuJ,IACvC7J,KAAOpI,EAAE8H,YAGXoK,IAAK,GAAU,MAANlJ,GAAY,CAInB,KAHAN,GAAK1I,EAAEiC,GAGE,OAAOjC,EAWhB,IAAK+R,OAAS,EAAG3L,EAAIsC,GAAG,GAAItC,GAAK,GAAIA,GAAK,GAAI2L,SAI9C,IAHArQ,EAAIsH,GAAK+I,QAGD,EACNrQ,GApyFO,EAqyFP4F,EAAI0B,GAIJ9B,IAHAV,EAAIkC,GAAGuJ,IAAM,IAGJxM,QAAQ,GAAIsM,OAASzK,EAAI,GAAK,GAAK,OAI5C,IAFA2K,IAAMhS,KAAK6D,MAAMpC,EAAI,GA3yFd,MA4yFP0E,EAAIsC,GAAGrH,QACO,CACZ,IAAIyQ,YASF,MAAMI,IANN,KAAO9L,KAAO6L,KAAMvJ,GAAGkF,KAAK,GAC5BpH,EAAIU,GAAK,EACT6K,OAAS,EAETzK,GADA5F,GApzFG,KAqzFgB,CAIvB,KAAO,CAIL,IAHA8E,EAAIJ,EAAIsC,GAAGuJ,KAGNF,OAAS,EAAG3L,GAAK,GAAIA,GAAK,GAAI2L,SAUnC7K,IAHAI,GAJA5F,GAh0FK,KAo0FcqQ,QAGV,EAAI,EAAIvL,EAAIf,QAAQ,GAAIsM,OAASzK,EAAI,GAAK,GAAK,CAC1D,CAmBF,GAfAwK,YAAcA,aAAe9I,GAAK,QAChB,IAAhBN,GAAGuJ,IAAM,KAAkB3K,EAAI,EAAId,EAAIA,EAAIf,QAAQ,GAAIsM,OAASzK,EAAI,IAMtE0K,QAAUjL,GAAK,GACVG,IAAM4K,eAAuB,GAAN/K,IAAWA,KAAO/G,EAAE+H,EAAI,EAAI,EAAI,IACxDb,GAAK,GAAW,GAANA,KAAkB,GAANH,IAAW+K,aAAqB,GAAN/K,KAG9CrF,EAAI,EAAI4F,EAAI,EAAId,EAAIf,QAAQ,GAAIsM,OAASzK,GAAK,EAAIoB,GAAGuJ,IAAM,IAAM,GAAM,GACvElL,KAAO/G,EAAE+H,EAAI,EAAI,EAAI,IAEvBiB,GAAK,IAAMN,GAAG,GAgBhB,OAfAA,GAAGrH,OAAS,EACR2Q,SAGFhJ,IAAMhJ,EAAEiI,EAAI,EAGZS,GAAG,GAAKjD,QAAQ,IAn2FX,EAm2F2BuD,GAn2F3B,MAo2FLhJ,EAAEiI,GAAKe,IAAM,GAIbN,GAAG,GAAK1I,EAAEiI,EAAI,EAGTjI,EAiBT,GAbS,GAAL0B,GACFgH,GAAGrH,OAAS4Q,IACZ7L,EAAI,EACJ6L,QAEAvJ,GAAGrH,OAAS4Q,IAAM,EAClB7L,EAAIX,QAAQ,GAr3FL,EAq3FoB/D,GAI3BgH,GAAGuJ,KAAO3K,EAAI,GAAKd,EAAIf,QAAQ,GAAIsM,OAASzK,GAAK7B,QAAQ,GAAI6B,GAAK,GAAKlB,EAAI,GAGzE4L,QACF,OAAS,CAGP,GAAW,GAAPC,IAAU,CAGZ,IAAKvQ,EAAI,EAAG4F,EAAIoB,GAAG,GAAIpB,GAAK,GAAIA,GAAK,GAAI5F,IAEzC,IADA4F,EAAIoB,GAAG,IAAMtC,EACRA,EAAI,EAAGkB,GAAK,GAAIA,GAAK,GAAIlB,IAG1B1E,GAAK0E,IACPpG,EAAEiI,IACES,GAAG,IAAM5C,OAAM4C,GAAG,GAAK,IAG7B,KACF,CAEE,GADAA,GAAGuJ,MAAQ7L,EACPsC,GAAGuJ,MAAQnM,KAAM,MACrB4C,GAAGuJ,OAAS,EACZ7L,EAAI,CAER,CAIF,IAAK1E,EAAIgH,GAAGrH,OAAoB,IAAZqH,KAAKhH,IAAWgH,GAAGmF,KACzC,CAqBA,OAnBIzI,WAGEpF,EAAEiI,EAAIG,KAAKlD,MAGblF,EAAEiC,EAAI,KACNjC,EAAEiI,EAAI9D,KAGGnE,EAAEiI,EAAIG,KAAKnD,OAGpBjF,EAAEiI,EAAI,EACNjI,EAAEiC,EAAI,CAAC,KAKJjC,CACT,CAGA,SAASmP,eAAenP,EAAGmS,MAAOnJ,IAChC,IAAKhJ,EAAEmB,WAAY,OAAOiR,kBAAkBpS,GAC5C,IAAIoG,EACF6B,EAAIjI,EAAEiI,EACN1B,IAAMJ,eAAenG,EAAEiC,GACvBgH,IAAM1C,IAAIlF,OAwBZ,OAtBI8Q,OACEnJ,KAAO5C,EAAI4C,GAAKC,KAAO,EACzB1C,IAAMA,IAAIoB,OAAO,GAAK,IAAMpB,IAAI2D,MAAM,GAAKzD,cAAcL,GAChD6C,IAAM,IACf1C,IAAMA,IAAIoB,OAAO,GAAK,IAAMpB,IAAI2D,MAAM,IAGxC3D,IAAMA,KAAOvG,EAAEiI,EAAI,EAAI,IAAM,MAAQjI,EAAEiI,GAC9BA,EAAI,GACb1B,IAAM,KAAOE,eAAewB,EAAI,GAAK1B,IACjCyC,KAAO5C,EAAI4C,GAAKC,KAAO,IAAG1C,KAAOE,cAAcL,KAC1C6B,GAAKgB,KACd1C,KAAOE,cAAcwB,EAAI,EAAIgB,KACzBD,KAAO5C,EAAI4C,GAAKf,EAAI,GAAK,IAAG1B,IAAMA,IAAM,IAAME,cAAcL,OAE3DA,EAAI6B,EAAI,GAAKgB,MAAK1C,IAAMA,IAAI2D,MAAM,EAAG9D,GAAK,IAAMG,IAAI2D,MAAM9D,IAC3D4C,KAAO5C,EAAI4C,GAAKC,KAAO,IACrBhB,EAAI,IAAMgB,MAAK1C,KAAO,KAC1BA,KAAOE,cAAcL,KAIlBG,GACT,CAIA,SAASwH,kBAAkBgE,OAAQ9J,GACjC,IAAIzB,EAAIuL,OAAO,GAGf,IAAM9J,GAx9FK,EAw9FUzB,GAAK,GAAIA,GAAK,GAAIyB,IACvC,OAAOA,CACT,CAGA,SAASuF,QAAQpF,KAAMY,GAAID,IACzB,GAAIC,GAAKjD,eAKP,MAFAX,UAAW,EACP2D,KAAIX,KAAKxD,UAAYmE,IACnBlC,MAh/FiBvB,2CAk/FzB,OAAO0C,SAAS,IAAII,KAAK1D,MAAOsE,GAAI,GAAG,EACzC,CAGA,SAAS6C,MAAMzD,KAAMY,GAAIjC,IACvB,GAAIiC,GAAKhD,aAAc,MAAMa,MAv/FJvB,2CAw/FzB,OAAO0C,SAAS,IAAII,KAAKzF,IAAKqG,GAAIjC,IAAI,EACxC,CAGA,SAASwH,aAAawD,QACpB,IAAIvL,EAAIuL,OAAO1Q,OAAS,EACtB4H,IAj/FS,EAi/FHzC,EAAe,EAKvB,GAHAA,EAAIuL,OAAOvL,GAGJ,CAGL,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIyC,MAG7B,IAAKzC,EAAIuL,OAAO,GAAIvL,GAAK,GAAIA,GAAK,GAAIyC,KACxC,CAEA,OAAOA,GACT,CAGA,SAASxC,cAAcL,GAErB,IADA,IAAIiM,GAAK,GACFjM,KAAMiM,IAAM,IACnB,OAAOA,EACT,CAUA,SAASlC,OAAO/H,KAAMpI,EAAG6J,EAAGd,IAC1B,IAAI+I,YACFvP,EAAI,IAAI6F,KAAK,GAIbhC,EAAInG,KAAK6D,KAAKiF,GAvhGL,EAuhGqB,GAIhC,IAFA3D,UAAW,IAEF,CAOP,GANIyE,EAAI,GAEFyI,UADJ/P,EAAIA,EAAE+G,MAAMtJ,IACGiC,EAAGmE,KAAI0L,aAAc,GAI5B,KADVjI,EAAIrE,UAAUqE,EAAI,IACL,CAGXA,EAAItH,EAAEN,EAAEZ,OAAS,EACbyQ,aAA0B,IAAXvP,EAAEN,EAAE4H,MAAYtH,EAAEN,EAAE4H,GACvC,KACF,CAGAyI,UADAtS,EAAIA,EAAEsJ,MAAMtJ,IACDiC,EAAGmE,EAChB,CAIA,OAFAhB,UAAW,EAEJ7C,CACT,CAGA,SAASgQ,MAAM1I,GACb,OAA6B,EAAtBA,EAAE5H,EAAE4H,EAAE5H,EAAEZ,OAAS,EAC1B,CAMA,SAASmR,SAASpK,KAAMqK,KAAMC,MAK5B,IAJA,IAAI5P,EACF9C,EAAI,IAAIoI,KAAKqK,KAAK,IAClB/Q,EAAI,IAEGA,EAAI+Q,KAAKpR,QAAS,CAEzB,KADAyB,EAAI,IAAIsF,KAAKqK,KAAK/Q,KACXqG,EAAG,CACR/H,EAAI8C,EACJ,KACF,CAAW9C,EAAE0S,MAAM5P,KACjB9C,EAAI8C,EAER,CAEA,OAAO9C,CACT,CAkCA,SAASkO,mBAAmBlO,EAAGgJ,IAC7B,IAAIoE,YAAauF,MAAOrL,EAAGpF,IAAK0Q,IAAK5Q,EAAGmK,IACtCrC,IAAM,EACNpI,EAAI,EACJ0E,EAAI,EACJgC,KAAOpI,EAAE8H,YACTf,GAAKqB,KAAKvD,SACVkE,GAAKX,KAAKxD,UAGZ,IAAK5E,EAAEiC,IAAMjC,EAAEiC,EAAE,IAAMjC,EAAEiI,EAAI,GAE3B,OAAO,IAAIG,KAAKpI,EAAEiC,EACbjC,EAAEiC,EAAE,GAASjC,EAAE+H,EAAI,EAAI,EAAI,IAAlB,EACV/H,EAAE+H,EAAI/H,EAAE+H,EAAI,EAAI,EAAI/H,EAAI,KAa9B,IAVU,MAANgJ,IACF5D,UAAW,EACX+G,IAAMpD,IAENoD,IAAMnD,GAGRhH,EAAI,IAAIoG,KAAK,QAGNpI,EAAEiI,GAAK,GAGZjI,EAAIA,EAAEsJ,MAAMtH,GACZoE,GAAK,EAUP,IAJA+F,KADAwG,MAAQ1S,KAAKW,IAAI6E,QAAQ,EAAGW,IAAMnG,KAAKyE,KAAO,EAAI,EAAI,EAEtD0I,YAAclL,IAAM0Q,IAAM,IAAIxK,KAAK,GACnCA,KAAKxD,UAAYuH,MAER,CAKP,GAJAjK,IAAM8F,SAAS9F,IAAIoH,MAAMtJ,GAAImM,IAAK,GAClCiB,YAAcA,YAAY9D,QAAQ5H,GAG9ByE,gBAFJnE,EAAI4Q,IAAIpR,KAAK2I,OAAOjI,IAAKkL,YAAajB,IAAK,KAEtBlK,GAAGiI,MAAM,EAAGiC,OAAShG,eAAeyM,IAAI3Q,GAAGiI,MAAM,EAAGiC,KAAM,CAE7E,IADA7E,EAAIlB,EACGkB,KAAKsL,IAAM5K,SAAS4K,IAAItJ,MAAMsJ,KAAMzG,IAAK,GAOhD,GAAU,MAANnD,GAYF,OADAZ,KAAKxD,UAAYmE,GACV6J,IAVP,KAAI9I,IAAM,GAAKhD,oBAAoB8L,IAAI3Q,EAAGkK,IAAMwG,MAAO5L,GAAI+C,MAMzD,OAAO9B,SAAS4K,IAAKxK,KAAKxD,UAAYmE,GAAIhC,GAAI3B,UAAW,GALzDgD,KAAKxD,UAAYuH,KAAO,GACxBiB,YAAclL,IAAMF,EAAI,IAAIoG,KAAK,GACjC1G,EAAI,EACJoI,KAQN,CAEA8I,IAAM5Q,CACR,CACF,CAkBA,SAASuL,iBAAiBzK,EAAGkG,IAC3B,IAAIrH,EAAGkR,GAAIzF,YAAanF,EAAG6K,UAAWhJ,IAAK8I,IAAK5Q,EAAGmK,IAAK4G,GAAIvG,GAC1D3C,EAAI,EAEJ7J,EAAI8C,EACJ4F,GAAK1I,EAAEiC,EACPmG,KAAOpI,EAAE8H,YACTf,GAAKqB,KAAKvD,SACVkE,GAAKX,KAAKxD,UAGZ,GAAI5E,EAAE+H,EAAI,IAAMW,KAAOA,GAAG,KAAO1I,EAAEiI,GAAc,GAATS,GAAG,IAAwB,GAAbA,GAAGrH,OACvD,OAAO,IAAI+G,KAAKM,KAAOA,GAAG,IAAK,IAAgB,GAAP1I,EAAE+H,EAAS5D,IAAMuE,GAAK,EAAI1I,GAcpE,GAXU,MAANgJ,IACF5D,UAAW,EACX+G,IAAMpD,IAENoD,IAAMnD,GAGRZ,KAAKxD,UAAYuH,KAnBP,GAqBV0G,IADAlR,EAAIwE,eAAeuC,KACZf,OAAO,KAEV1H,KAAKS,IAAIuH,EAAIjI,EAAEiI,GAAK,OAqCtB,OAJAjG,EAAIwL,QAAQpF,KAAM+D,IAAM,EAAGpD,IAAIO,MAAMrB,EAAI,IACzCjI,EAAIuN,iBAAiB,IAAInF,KAAKyK,GAAK,IAAMlR,EAAEuI,MAAM,IAAKiC,IAzD9C,IAyD2D3K,KAAKQ,GACxEoG,KAAKxD,UAAYmE,GAEJ,MAANC,GAAahB,SAAShI,EAAG+I,GAAIhC,GAAI3B,UAAW,GAAQpF,EAxB3D,KAAO6S,GAAK,GAAW,GAANA,IAAiB,GAANA,IAAWlR,EAAEgG,OAAO,GAAK,GAGnDkL,IADAlR,EAAIwE,gBADJnG,EAAIA,EAAEsJ,MAAMxG,IACSb,IACd0F,OAAO,GACdkC,IAiCJ,IA9BE5B,EAAIjI,EAAEiI,EAEF4K,GAAK,GACP7S,EAAI,IAAIoI,KAAK,KAAOzG,GACpBsG,KAEAjI,EAAI,IAAIoI,KAAKyK,GAAK,IAAMlR,EAAEuI,MAAM,IAepC6I,GAAK/S,EAKL4S,IAAME,UAAY9S,EAAImK,OAAOnK,EAAEyB,MAAM,GAAIzB,EAAEwB,KAAK,GAAI2K,IAAK,GACzDK,GAAKxE,SAAShI,EAAEsJ,MAAMtJ,GAAImM,IAAK,GAC/BiB,YAAc,IAEL,CAIP,GAHA0F,UAAY9K,SAAS8K,UAAUxJ,MAAMkD,IAAKL,IAAK,GAG3ChG,gBAFJnE,EAAI4Q,IAAIpR,KAAK2I,OAAO2I,UAAW,IAAI1K,KAAKgF,aAAcjB,IAAK,KAEtClK,GAAGiI,MAAM,EAAGiC,OAAShG,eAAeyM,IAAI3Q,GAAGiI,MAAM,EAAGiC,KAAM,CAc7E,GAbAyG,IAAMA,IAAItJ,MAAM,GAIN,IAANrB,IAAS2K,IAAMA,IAAIpR,KAAKgM,QAAQpF,KAAM+D,IAAM,EAAGpD,IAAIO,MAAMrB,EAAI,MACjE2K,IAAMzI,OAAOyI,IAAK,IAAIxK,KAAKyB,GAAIsC,IAAK,GAQ1B,MAANnD,GAWF,OADAZ,KAAKxD,UAAYmE,GACV6J,IAVP,IAAI9L,oBAAoB8L,IAAI3Q,EAAGkK,IA5F3B,GA4FwCpF,GAAI+C,KAM9C,OAAO9B,SAAS4K,IAAKxK,KAAKxD,UAAYmE,GAAIhC,GAAI3B,UAAW,GALzDgD,KAAKxD,UAAYuH,KA7Ff,GA8FFnK,EAAI8Q,UAAY9S,EAAImK,OAAO4I,GAAGtR,MAAM,GAAIsR,GAAGvR,KAAK,GAAI2K,IAAK,GACzDK,GAAKxE,SAAShI,EAAEsJ,MAAMtJ,GAAImM,IAAK,GAC/BiB,YAActD,IAAM,CAQ1B,CAEA8I,IAAM5Q,EACNoL,aAAe,CACjB,CACF,CAIA,SAASgF,kBAAkBpS,GAEzB,OAAOgT,OAAOhT,EAAE+H,EAAI/H,EAAE+H,EAAI,EAC5B,CAMA,SAASkL,aAAajT,EAAGuG,KACvB,IAAI0B,EAAGvG,EAAGuH,IAmBV,KAhBKhB,EAAI1B,IAAImB,QAAQ,OAAS,IAAGnB,IAAMA,IAAI2M,QAAQ,IAAK,MAGnDxR,EAAI6E,IAAI4M,OAAO,OAAS,GAGvBlL,EAAI,IAAGA,EAAIvG,GACfuG,IAAM1B,IAAI2D,MAAMxI,EAAI,GACpB6E,IAAMA,IAAI6M,UAAU,EAAG1R,IACduG,EAAI,IAGbA,EAAI1B,IAAIlF,QAILK,EAAI,EAAyB,KAAtB6E,IAAI8M,WAAW3R,GAAWA,KAGtC,IAAKuH,IAAM1C,IAAIlF,OAAoC,KAA5BkF,IAAI8M,WAAWpK,IAAM,KAAaA,KAGzD,GAFA1C,IAAMA,IAAI2D,MAAMxI,EAAGuH,KAEV,CAYP,GAXAA,KAAOvH,EACP1B,EAAEiI,EAAIA,EAAIA,EAAIvG,EAAI,EAClB1B,EAAEiC,EAAI,GAMNP,GAAKuG,EAAI,GAz2GA,EA02GLA,EAAI,IAAGvG,GA12GF,GA42GLA,EAAIuH,IAAK,CAEX,IADIvH,GAAG1B,EAAEiC,EAAE2L,MAAMrH,IAAI2D,MAAM,EAAGxI,IACzBuH,KA92GE,EA82GevH,EAAIuH,KAAMjJ,EAAEiC,EAAE2L,MAAMrH,IAAI2D,MAAMxI,EAAGA,GA92GhD,IAg3GPA,EAh3GO,GA+2GP6E,IAAMA,IAAI2D,MAAMxI,IACGL,MACrB,MACEK,GAAKuH,IAGP,KAAOvH,KAAM6E,KAAO,IACpBvG,EAAEiC,EAAE2L,MAAMrH,KAENnB,WAGEpF,EAAEiI,EAAIjI,EAAE8H,YAAY5C,MAGtBlF,EAAEiC,EAAI,KACNjC,EAAEiI,EAAI9D,KAGGnE,EAAEiI,EAAIjI,EAAE8H,YAAY7C,OAG7BjF,EAAEiI,EAAI,EACNjI,EAAEiC,EAAI,CAAC,IAIb,MAGEjC,EAAEiI,EAAI,EACNjI,EAAEiC,EAAI,CAAC,GAGT,OAAOjC,CACT,CAMA,SAASsT,WAAWtT,EAAGuG,KACrB,IAAI2G,KAAM9E,KAAMmL,QAAS7R,EAAG8R,QAASvK,IAAKwK,EAAG/K,GAAIgF,GAEjD,GAAInH,IAAImB,QAAQ,MAAQ,GAEtB,GADAnB,IAAMA,IAAI2M,QAAQ,eAAgB,MAC9BrN,UAAU6N,KAAKnN,KAAM,OAAO0M,aAAajT,EAAGuG,UAC3C,GAAY,aAARA,KAA8B,QAARA,IAI/B,OAHMA,MAAKvG,EAAE+H,EAAI5D,KACjBnE,EAAEiI,EAAI9D,IACNnE,EAAEiC,EAAI,KACCjC,EAGT,GAAI2F,MAAM+N,KAAKnN,KACb2G,KAAO,GACP3G,IAAMA,IAAIoN,mBACL,GAAIjO,SAASgO,KAAKnN,KACvB2G,KAAO,MACF,KAAItH,QAAQ8N,KAAKnN,KAGtB,MAAMM,MAAMxB,gBAAkBkB,KAF9B2G,KAAO,CAGT,CA+BA,KA5BAxL,EAAI6E,IAAI4M,OAAO,OAEP,GACNM,GAAKlN,IAAI2D,MAAMxI,EAAI,GACnB6E,IAAMA,IAAI6M,UAAU,EAAG1R,IAEvB6E,IAAMA,IAAI2D,MAAM,GAMlBsJ,SADA9R,EAAI6E,IAAImB,QAAQ,OACD,EACfU,KAAOpI,EAAE8H,YAEL0L,UAGF9R,GADAuH,KADA1C,IAAMA,IAAI2M,QAAQ,IAAK,KACb7R,QACAK,EAGV6R,QAAUpD,OAAO/H,KAAM,IAAIA,KAAK8E,MAAOxL,EAAO,EAAJA,IAOvCA,EAHLgM,IADAhF,GAAKvB,YAAYZ,IAAK2G,KAAMpH,OACpBzE,OAAS,EAGM,IAAVqH,GAAGhH,KAAYA,EAAGgH,GAAGmF,MAClC,OAAInM,EAAI,EAAU,IAAI0G,KAAW,EAANpI,EAAE+H,IAC7B/H,EAAEiI,EAAI8F,kBAAkBrF,GAAIgF,IAC5B1N,EAAEiC,EAAIyG,GACNtD,UAAW,EAQPoO,UAASxT,EAAImK,OAAOnK,EAAGuT,QAAe,EAANtK,MAGhCwK,IAAGzT,EAAIA,EAAEsJ,MAAMrJ,KAAKS,IAAI+S,GAAK,GAAKhO,QAAQ,EAAGgO,GAAKpP,QAAQnC,IAAI,EAAGuR,KACrErO,UAAW,EAEJpF,EACT,CA0CA,SAASqJ,aAAajB,KAAMyB,EAAG7J,EAAG8C,EAAG8Q,cACnC,IAAItM,EAAGtF,EAAG6R,EAAGrH,GAEXzD,GAAKX,KAAKxD,UACVwB,EAAInG,KAAK6D,KAAKiF,GA9gHL,GAohHX,IAJA3D,UAAW,EACXoH,GAAKxM,EAAEsJ,MAAMtJ,GACb6T,EAAI,IAAIzL,KAAKtF,KAEJ,CAMP,GALAd,EAAImI,OAAO0J,EAAEvK,MAAMkD,IAAK,IAAIpE,KAAKyB,IAAMA,KAAMd,GAAI,GACjD8K,EAAID,aAAe9Q,EAAEtB,KAAKQ,GAAKc,EAAErB,MAAMO,GACvCc,EAAIqH,OAAOnI,EAAEsH,MAAMkD,IAAK,IAAIpE,KAAKyB,IAAMA,KAAMd,GAAI,QAGlC,KAFf/G,EAAI6R,EAAErS,KAAKsB,IAELb,EAAEmE,GAAe,CACrB,IAAKkB,EAAIlB,EAAGpE,EAAEC,EAAEqF,KAAOuM,EAAE5R,EAAEqF,IAAMA,MACjC,IAAU,GAANA,EAAS,KACf,CAEAA,EAAIuM,EACJA,EAAI/Q,EACJA,EAAId,EACJA,EAAIsF,CAEN,CAKA,OAHAlC,UAAW,EACXpD,EAAEC,EAAEZ,OAAS+E,EAAI,EAEVpE,CACT,CAIA,SAASmH,QAAQ3I,EAAGyH,GAElB,IADA,IAAI4B,EAAIrJ,IACCyH,GAAG4B,GAAKrJ,EACjB,OAAOqJ,CACT,CAIA,SAASL,iBAAiBpB,KAAMpI,GAC9B,IAAIgC,EACF4J,MAAQ5L,EAAE+H,EAAI,EACd+L,GAAKjI,MAAMzD,KAAMA,KAAKxD,UAAW,GACjC+G,OAASmI,GAAGxK,MAAM,IAIpB,IAFAtJ,EAAIA,EAAEU,OAEAqL,IAAIJ,QAER,OADApH,SAAWqH,MAAQ,EAAI,EAChB5L,EAKT,IAFAgC,EAAIhC,EAAE0K,SAASoJ,KAET5K,SACJ3E,SAAWqH,MAAQ,EAAI,MAClB,CAIL,IAHA5L,EAAIA,EAAEyB,MAAMO,EAAEsH,MAAMwK,MAGd/H,IAAIJ,QAER,OADApH,SAAWgO,MAAMvQ,GAAM4J,MAAQ,EAAI,EAAMA,MAAQ,EAAI,EAC9C5L,EAGTuE,SAAWgO,MAAMvQ,GAAM4J,MAAQ,EAAI,EAAMA,MAAQ,EAAI,CACvD,CAEA,OAAO5L,EAAEyB,MAAMqS,IAAIpT,KACrB,CAQA,SAASsO,eAAehP,EAAGqH,QAAS2B,GAAIjC,IACtC,IAAImG,KAAMjF,EAAGvG,EAAG0E,EAAG6C,IAAK+I,QAASzL,IAAKmC,GAAI5F,EACxCsF,KAAOpI,EAAE8H,YACTqK,WAAe,IAAPnJ,GAWV,GATImJ,OACFzL,WAAWsC,GAAI,EAlsHJ,UAmsHA,IAAPjC,GAAeA,GAAKqB,KAAKvD,SACxB6B,WAAWK,GAAI,EAAG,KAEvBiC,GAAKZ,KAAKxD,UACVmC,GAAKqB,KAAKvD,UAGP7E,EAAEmB,WAEA,CAoCL,IA3BIgR,OACFjF,KAAO,EACQ,IAAX7F,QACF2B,GAAU,EAALA,GAAS,EACM,GAAX3B,UACT2B,GAAU,EAALA,GAAS,IAGhBkE,KAAO7F,SAfT3F,GADA6E,IAAM4I,eAAenP,IACb0H,QAAQ,OAsBP,IACPnB,IAAMA,IAAI2M,QAAQ,IAAK,KACvBpQ,EAAI,IAAIsF,KAAK,IACXH,EAAI1B,IAAIlF,OAASK,EACnBoB,EAAEb,EAAIkF,YAAYgI,eAAerM,GAAI,GAAIoK,MACzCpK,EAAEmF,EAAInF,EAAEb,EAAEZ,QAIZ4G,EAAIgB,KADJP,GAAKvB,YAAYZ,IAAK,GAAI2G,OACb7L,OAGO,GAAbqH,KAAKO,MAAYP,GAAGmF,MAE3B,GAAKnF,GAAG,GAED,CAyBL,GAxBIhH,EAAI,EACNuG,MAEAjI,EAAI,IAAIoI,KAAKpI,IACXiC,EAAIyG,GACN1I,EAAEiI,EAAIA,EAENS,IADA1I,EAAImK,OAAOnK,EAAG8C,EAAGkG,GAAIjC,GAAI,EAAGmG,OACrBjL,EACPgG,EAAIjI,EAAEiI,EACN+J,QAAU1N,SAIZ5C,EAAIgH,GAAGM,IACP5C,EAAI8G,KAAO,EACX8E,QAAUA,cAA0B,IAAftJ,GAAGM,GAAK,GAE7BgJ,QAAUjL,GAAK,QACJ,IAANrF,GAAgBsQ,WAAoB,IAAPjL,IAAYA,MAAQ/G,EAAE+H,EAAI,EAAI,EAAI,IAChErG,EAAI0E,GAAK1E,IAAM0E,IAAa,IAAPW,IAAYiL,SAAkB,IAAPjL,IAAyB,EAAb2B,GAAGM,GAAK,IAChEjC,MAAQ/G,EAAE+H,EAAI,EAAI,EAAI,IAE1BW,GAAGrH,OAAS2H,GAERgJ,QAGF,OAAStJ,KAAKM,IAAMkE,KAAO,GACzBxE,GAAGM,IAAM,EACJA,OACDf,EACFS,GAAG4F,QAAQ,IAMjB,IAAKrF,IAAMP,GAAGrH,QAASqH,GAAGO,IAAM,KAAMA,KAGtC,IAAKvH,EAAI,EAAG6E,IAAM,GAAI7E,EAAIuH,IAAKvH,IAAK6E,KAAO9B,SAASkD,OAAOe,GAAGhH,IAG9D,GAAIyQ,MAAO,CACT,GAAIlJ,IAAM,EACR,GAAe,IAAX5B,SAA4B,GAAXA,QAAc,CAEjC,IADA3F,EAAe,IAAX2F,QAAgB,EAAI,IACjB4B,IAAKA,IAAMvH,EAAGuH,MAAO1C,KAAO,IAEnC,IAAK0C,KADLP,GAAKvB,YAAYZ,IAAK2G,KAAM7F,UACdhG,QAASqH,GAAGO,IAAM,KAAMA,KAGtC,IAAKvH,EAAI,EAAG6E,IAAM,KAAM7E,EAAIuH,IAAKvH,IAAK6E,KAAO9B,SAASkD,OAAOe,GAAGhH,GAClE,MACE6E,IAAMA,IAAIoB,OAAO,GAAK,IAAMpB,IAAI2D,MAAM,GAI1C3D,IAAOA,KAAO0B,EAAI,EAAI,IAAM,MAAQA,CACtC,MAAO,GAAIA,EAAI,EAAG,CAChB,OAASA,GAAI1B,IAAM,IAAMA,IACzBA,IAAM,KAAOA,GACf,MACE,KAAM0B,EAAIgB,IAAK,IAAKhB,GAAKgB,IAAKhB,KAAO1B,KAAO,SACnC0B,EAAIgB,MAAK1C,IAAMA,IAAI2D,MAAM,EAAGjC,GAAK,IAAM1B,IAAI2D,MAAMjC,GAE9D,MApEE1B,IAAM4L,MAAQ,OAAS,IAsEzB5L,KAAkB,IAAXc,QAAgB,KAAkB,GAAXA,QAAe,KAAkB,GAAXA,QAAe,KAAO,IAAMd,GAClF,MA/GEA,IAAM6L,kBAAkBpS,GAiH1B,OAAOA,EAAE+H,EAAI,EAAI,IAAMxB,IAAMA,GAC/B,CAIA,SAAS+L,SAAS9K,IAAKyB,KACrB,GAAIzB,IAAInG,OAAS4H,IAEf,OADAzB,IAAInG,OAAS4H,KACN,CAEX,CAyDA,SAASvI,IAAIV,GACX,OAAO,IAAIF,KAAKE,GAAGU,KACrB,CASA,SAASyC,KAAKnD,GACZ,OAAO,IAAIF,KAAKE,GAAGmD,MACrB,CAUA,SAASS,MAAM5D,GACb,OAAO,IAAIF,KAAKE,GAAG4D,OACrB,CAWA,SAASwK,IAAIpO,EAAG8C,GACd,OAAO,IAAIhD,KAAKE,GAAGwB,KAAKsB,EAC1B,CAUA,SAASM,KAAKpD,GACZ,OAAO,IAAIF,KAAKE,GAAGoD,MACrB,CAUA,SAASO,MAAM3D,GACb,OAAO,IAAIF,KAAKE,GAAG2D,OACrB,CAUA,SAAST,KAAKlD,GACZ,OAAO,IAAIF,KAAKE,GAAGkD,MACrB,CAUA,SAASQ,MAAM1D,GACb,OAAO,IAAIF,KAAKE,GAAG0D,OACrB,CA4BA,SAAS5C,MAAMgC,EAAG9C,GAChB8C,EAAI,IAAIhD,KAAKgD,GACb9C,EAAI,IAAIF,KAAKE,GACb,IAAIuC,EACFwG,GAAKjJ,KAAK8E,UACVmC,GAAKjH,KAAK+E,SACVsH,IAAMpD,GAAK,EAkCb,OA/BKjG,EAAEiF,GAAM/H,EAAE+H,EAIHjF,EAAEb,GAAMjC,EAAEiC,GAKVjC,EAAEiC,GAAKa,EAAEoG,UACnB3G,EAAIvC,EAAE+H,EAAI,EAAI8D,MAAM/L,KAAMiJ,GAAIhC,IAAM,IAAIjH,KAAK,IAC3CiI,EAAIjF,EAAEiF,GAGEjF,EAAEb,GAAKjC,EAAEkJ,UACnB3G,EAAIsJ,MAAM/L,KAAMqM,IAAK,GAAG7C,MAAM,KAC5BvB,EAAIjF,EAAEiF,EAGC/H,EAAE+H,EAAI,GACfjI,KAAK8E,UAAYuH,IACjBrM,KAAK+E,SAAW,EAChBtC,EAAIzC,KAAKoD,KAAKiH,OAAOrH,EAAG9C,EAAGmM,IAAK,IAChCnM,EAAI6L,MAAM/L,KAAMqM,IAAK,GACrBrM,KAAK8E,UAAYmE,GACjBjJ,KAAK+E,SAAWkC,GAChBxE,EAAIO,EAAEiF,EAAI,EAAIxF,EAAEd,MAAMzB,GAAKuC,EAAEf,KAAKxB,IAElCuC,EAAIzC,KAAKoD,KAAKiH,OAAOrH,EAAG9C,EAAGmM,IAAK,KAvBhC5J,EAAIsJ,MAAM/L,KAAMqM,IAAK,GAAG7C,MAAMtJ,EAAE+H,EAAI,EAAI,IAAO,MAC7CA,EAAIjF,EAAEiF,EALRxF,EAAI,IAAIzC,KAAKqE,KA8BR5B,CACT,CAUA,SAASoH,KAAK3J,GACZ,OAAO,IAAIF,KAAKE,GAAG2J,MACrB,CASA,SAAS7F,KAAK9D,GACZ,OAAOgI,SAAShI,EAAI,IAAIF,KAAKE,GAAIA,EAAEiI,EAAI,EAAG,EAC5C,CAWA,SAASE,MAAMnI,EAAG2G,IAAKC,KACrB,OAAO,IAAI9G,KAAKE,GAAGmI,MAAMxB,IAAKC,IAChC,CAqBA,SAASmN,OAAOC,KACd,IAAKA,KAAsB,iBAARA,IAAkB,MAAMnN,MAAMvB,kCACjD,IAAI5D,EAAG+R,EAAGQ,EACRC,aAA+B,IAAjBF,IAAIG,SAClBC,GAAK,CACH,YAAa,EAxlIJ,IAylIT,WAAY,EAAG,EACf,YAAa5P,UAAW,EACxB,WAAY,EAAGA,UACf,OAAQ,EAAGA,UACX,QAASA,UAAW,EACpB,SAAU,EAAG,GAGjB,IAAK9C,EAAI,EAAGA,EAAI0S,GAAG/S,OAAQK,GAAK,EAE9B,GADI+R,EAAIW,GAAG1S,GAAIwS,cAAapU,KAAK2T,GAAK9O,SAAS8O,SAC1B,KAAhBQ,EAAID,IAAIP,IAAgB,CAC3B,KAAIjO,UAAUyO,KAAOA,GAAKA,GAAKG,GAAG1S,EAAI,IAAMuS,GAAKG,GAAG1S,EAAI,IACnD,MAAMmF,MAAMxB,gBAAkBoO,EAAI,KAAOQ,GADcnU,KAAK2T,GAAKQ,CAExE,CAIF,GADIR,EAAI,SAAUS,cAAapU,KAAK2T,GAAK9O,SAAS8O,SAC7B,KAAhBQ,EAAID,IAAIP,IAAgB,CAC3B,IAAU,IAANQ,IAAoB,IAANA,GAAqB,IAANA,GAAiB,IAANA,EAY1C,MAAMpN,MAAMxB,gBAAkBoO,EAAI,KAAOQ,GAXzC,GAAIA,EAAG,CACL,GAAqB,oBAAV9O,SAAyBA,SACjCA,OAAOkP,kBAAmBlP,OAAOmP,YAGlC,MAAMzN,MA7hIMvB,qCA2hIZxF,KAAK2T,IAAK,CAId,MACE3T,KAAK2T,IAAK,CAKhB,CAEA,OAAO3T,IACT,CAUA,SAASe,IAAIb,GACX,OAAO,IAAIF,KAAKE,GAAGa,KACrB,CAUA,SAASd,KAAKC,GACZ,OAAO,IAAIF,KAAKE,GAAGD,MACrB,CAwMA,SAASyK,IAAIxK,EAAG8C,GACd,OAAO,IAAIhD,KAAKE,GAAGwK,IAAI1H,EACzB,CAUA,SAAS5C,IAAIF,GACX,OAAO,IAAIF,KAAKE,GAAGE,KACrB,CASA,SAAS6D,MAAM/D,GACb,OAAOgI,SAAShI,EAAI,IAAIF,KAAKE,GAAIA,EAAEiI,EAAI,EAAG,EAC5C,CAYA,SAASsM,QACP,IAAI7S,EAAGmI,EACL7H,EAAI,IAAIlC,KAAK,GAIf,IAFAsF,UAAW,EAEN1D,EAAI,EAAGA,EAAI8S,UAAUnT,QAExB,IADAwI,EAAI,IAAI/J,KAAK0U,UAAU9S,OAChBO,EAMID,EAAEC,IACXD,EAAIA,EAAER,KAAKqI,EAAEP,MAAMO,SAPX,CACR,GAAIA,EAAE9B,EAEJ,OADA3C,UAAW,EACJ,IAAItF,KAAK,KAElBkC,EAAI6H,CACN,CAOF,OAFAzE,UAAW,EAEJpD,EAAEQ,MACX,CAQA,SAASiS,kBAAkBT,KACzB,OAAOA,eAAe3P,SAAW2P,KAAOA,IAAI9N,cAAgBX,MAAO,CACrE,CAUA,SAASyG,GAAGhM,GACV,OAAO,IAAIF,KAAKE,GAAGgM,IACrB,CAaA,SAASpL,IAAIZ,EAAG8C,GACd,OAAO,IAAIhD,KAAKE,GAAGY,IAAIkC,EACzB,CAUA,SAAS4R,KAAK1U,GACZ,OAAO,IAAIF,KAAKE,GAAGY,IAAI,EACzB,CAUA,SAAS+T,MAAM3U,GACb,OAAO,IAAIF,KAAKE,GAAGY,IAAI,GACzB,CASA,SAASgG,MACP,OAAO4L,SAAS1S,KAAM0U,UAAW,KACnC,CASA,SAAS7N,MACP,OAAO6L,SAAS1S,KAAM0U,UAAW,KACnC,CAWA,SAASxG,IAAIhO,EAAG8C,GACd,OAAO,IAAIhD,KAAKE,GAAGgO,IAAIlL,EACzB,CAWA,SAAS+L,IAAI7O,EAAG8C,GACd,OAAO,IAAIhD,KAAKE,GAAG6O,IAAI/L,EACzB,CAWA,SAASZ,IAAIlC,EAAG8C,GACd,OAAO,IAAIhD,KAAKE,GAAGkC,IAAIY,EACzB,CAWA,SAAS8R,OAAO5L,IACd,IAAI/G,EAAGgG,EAAG7B,EAAGyD,EACXnI,EAAI,EACJa,EAAI,IAAIzC,KAAK,GACboH,GAAK,GAOP,QALW,IAAP8B,GAAeA,GAAKlJ,KAAK8E,UACxB8B,WAAWsC,GAAI,EAniJP,KAqiJb5C,EAAInG,KAAK6D,KAAKkF,GAr8IH,GAu8INlJ,KAAKqF,OAIH,GAAIA,OAAOkP,gBAGhB,IAFApS,EAAIkD,OAAOkP,gBAAgB,IAAIQ,YAAYzO,IAEpC1E,EAAI0E,IACTyD,EAAI5H,EAAEP,KAIG,MACPO,EAAEP,GAAKyD,OAAOkP,gBAAgB,IAAIQ,YAAY,IAAI,GAKlD3N,GAAGxF,KAAOmI,EAAI,QAKb,KAAI1E,OAAOmP,YAwBhB,MAAMzN,MAlgJYvB,qCA++IlB,IAFArD,EAAIkD,OAAOmP,YAAYlO,GAAK,GAErB1E,EAAI0E,IAGTyD,EAAI5H,EAAEP,IAAMO,EAAEP,EAAI,IAAM,IAAMO,EAAEP,EAAI,IAAM,MAAmB,IAAXO,EAAEP,EAAI,KAAc,MAG7D,MACPyD,OAAOmP,YAAY,GAAGQ,KAAK7S,EAAGP,IAK9BwF,GAAG0G,KAAK/D,EAAI,KACZnI,GAAK,GAITA,EAAI0E,EAAI,CAGV,MA/CE,KAAO1E,EAAI0E,GAAIc,GAAGxF,KAAuB,IAAhBzB,KAAK2U,SAAiB,EA2DjD,IATA5L,IA1/IW,GAy/IX5C,EAAIc,KAAKxF,KAIAsH,KACPa,EAAIpE,QAAQ,GA9/IH,EA8/IkBuD,IAC3B9B,GAAGxF,IAAM0E,EAAIyD,EAAI,GAAKA,GAIP,IAAV3C,GAAGxF,GAAUA,IAAKwF,GAAG2G,MAG5B,GAAInM,EAAI,EACNuG,EAAI,EACJf,GAAK,CAAC,OACD,CAIL,IAHAe,GAAK,EAGY,IAAVf,GAAG,GAAUe,GA7gJX,EA6gJ0Bf,GAAG4G,QAGtC,IAAK1H,EAAI,EAAGyD,EAAI3C,GAAG,GAAI2C,GAAK,GAAIA,GAAK,GAAIzD,IAGrCA,EAnhJK,IAmhJS6B,GAnhJT,EAmhJyB7B,EACpC,CAKA,OAHA7D,EAAE0F,EAAIA,EACN1F,EAAEN,EAAIiF,GAEC3E,CACT,CAWA,SAASyB,MAAMhE,GACb,OAAOgI,SAAShI,EAAI,IAAIF,KAAKE,GAAIA,EAAEiI,EAAI,EAAGnI,KAAK+E,SACjD,CAcA,SAASgN,KAAK7R,GAEZ,OADAA,EAAI,IAAIF,KAAKE,IACJiC,EAAKjC,EAAEiC,EAAE,GAAKjC,EAAE+H,EAAI,EAAI/H,EAAE+H,EAAK/H,EAAE+H,GAAK5D,GACjD,CAUA,SAAS/C,IAAIpB,GACX,OAAO,IAAIF,KAAKE,GAAGoB,KACrB,CAUA,SAASjB,KAAKH,GACZ,OAAO,IAAIF,KAAKE,GAAGG,MACrB,CAUA,SAASqC,KAAKxC,GACZ,OAAO,IAAIF,KAAKE,GAAGwC,MACrB,CAWA,SAASiL,IAAIzN,EAAG8C,GACd,OAAO,IAAIhD,KAAKE,GAAGyN,IAAI3K,EACzB,CAYA,SAAS8P,MACP,IAAIlR,EAAI,EACN+Q,KAAO+B,UACPxU,EAAI,IAAIF,KAAK2S,KAAK/Q,IAGpB,IADA0D,UAAW,EACJpF,EAAE+H,KAAOrG,EAAI+Q,KAAKpR,QAASrB,EAAIA,EAAEwB,KAAKiR,KAAK/Q,IAGlD,OAFA0D,UAAW,EAEJ4C,SAAShI,EAAGF,KAAK8E,UAAW9E,KAAK+E,SAC1C,CAUA,SAAS+J,IAAI5O,GACX,OAAO,IAAIF,KAAKE,GAAG4O,KACrB,CAUA,SAASnD,KAAKzL,GACZ,OAAO,IAAIF,KAAKE,GAAGyL,MACrB,CASA,SAAS+E,MAAMxQ,GACb,OAAOgI,SAAShI,EAAI,IAAIF,KAAKE,GAAIA,EAAEiI,EAAI,EAAG,EAC5C,CAIA5D,QA1mBA,SAAS0Q,MAAMf,KACb,IAAItS,EAAG+R,EAAGW,GASV,SAAS/P,QAAQ4P,GACf,IAAIhM,EAAGvG,EAAGM,EACRhC,EAAIF,KAGN,KAAME,aAAaqE,SAAU,OAAO,IAAIA,QAAQ4P,GAOhD,GAHAjU,EAAE8H,YAAczD,QAGZoQ,kBAAkBR,GAuBpB,OAtBAjU,EAAE+H,EAAIkM,EAAElM,OAEJ3C,UACG6O,EAAEhS,GAAKgS,EAAEhM,EAAI5D,QAAQa,MAGxBlF,EAAEiI,EAAI9D,IACNnE,EAAEiC,EAAI,MACGgS,EAAEhM,EAAI5D,QAAQY,MAGvBjF,EAAEiI,EAAI,EACNjI,EAAEiC,EAAI,CAAC,KAEPjC,EAAEiI,EAAIgM,EAAEhM,EACRjI,EAAEiC,EAAIgS,EAAEhS,EAAEiI,UAGZlK,EAAEiI,EAAIgM,EAAEhM,EACRjI,EAAEiC,EAAIgS,EAAEhS,EAAIgS,EAAEhS,EAAEiI,QAAU+J,EAAEhS,IAQhC,GAAU,YAFVD,SAAWiS,GAES,CAClB,GAAU,IAANA,EAIF,OAHAjU,EAAE+H,EAAI,EAAIkM,EAAI,GAAK,EAAI,EACvBjU,EAAEiI,EAAI,OACNjI,EAAEiC,EAAI,CAAC,IAYT,GARIgS,EAAI,GACNA,GAAKA,EACLjU,EAAE+H,GAAK,GAEP/H,EAAE+H,EAAI,EAIJkM,MAAQA,GAAKA,EAAI,IAAK,CACxB,IAAKhM,EAAI,EAAGvG,EAAIuS,EAAGvS,GAAK,GAAIA,GAAK,GAAIuG,IAkBrC,YAhBI7C,SACE6C,EAAI5D,QAAQa,MACdlF,EAAEiI,EAAI9D,IACNnE,EAAEiC,EAAI,MACGgG,EAAI5D,QAAQY,MACrBjF,EAAEiI,EAAI,EACNjI,EAAEiC,EAAI,CAAC,KAEPjC,EAAEiI,EAAIA,EACNjI,EAAEiC,EAAI,CAACgS,KAGTjU,EAAEiI,EAAIA,EACNjI,EAAEiC,EAAI,CAACgS,IAMX,CAAO,OAAQ,EAAJA,GAAU,GACdA,IAAGjU,EAAE+H,EAAI5D,KACdnE,EAAEiI,EAAI9D,SACNnE,EAAEiC,EAAI,OAIDgR,aAAajT,EAAGiU,EAAE7K,WAE3B,CAAO,GAAU,WAANpH,EACT,MAAM6E,MAAMxB,gBAAkB4O,GAahC,OAT8B,MAAzBvS,EAAIuS,EAAEZ,WAAW,KACpBY,EAAIA,EAAE/J,MAAM,GACZlK,EAAE+H,GAAK,IAGG,KAANrG,IAAUuS,EAAIA,EAAE/J,MAAM,IAC1BlK,EAAE+H,EAAI,GAGDlC,UAAU6N,KAAKO,GAAKhB,aAAajT,EAAGiU,GAAKX,WAAWtT,EAAGiU,EAChE,CA2DA,GAzDA5P,QAAQtC,UAAYkE,EAEpB5B,QAAQ2Q,SAAW,EACnB3Q,QAAQ4Q,WAAa,EACrB5Q,QAAQ6Q,WAAa,EACrB7Q,QAAQ8Q,YAAc,EACtB9Q,QAAQ+Q,cAAgB,EACxB/Q,QAAQgR,gBAAkB,EAC1BhR,QAAQiR,gBAAkB,EAC1BjR,QAAQkR,gBAAkB,EAC1BlR,QAAQmR,iBAAmB,EAC3BnR,QAAQoR,OAAS,EAEjBpR,QAAQ0P,OAAS1P,QAAQqR,IAAM3B,OAC/B1P,QAAQ0Q,MAAQA,MAChB1Q,QAAQwB,UAAY4O,kBAEpBpQ,QAAQ3D,IAAMA,IACd2D,QAAQlB,KAAOA,KACfkB,QAAQT,MAAQA,MAChBS,QAAQ+J,IAAMA,IACd/J,QAAQjB,KAAOA,KACfiB,QAAQV,MAAQA,MAChBU,QAAQnB,KAAOA,KACfmB,QAAQX,MAAQA,MAChBW,QAAQvD,MAAQA,MAChBuD,QAAQsF,KAAOA,KACftF,QAAQP,KAAOA,KACfO,QAAQ8D,MAAQA,MAChB9D,QAAQxD,IAAMA,IACdwD,QAAQtE,KAAOA,KACfsE,QAAQmG,IAAMA,IACdnG,QAAQnE,IAAMA,IACdmE,QAAQN,MAAQA,MAChBM,QAAQkQ,MAAQA,MAChBlQ,QAAQ2H,GAAKA,GACb3H,QAAQzD,IAAMA,IACdyD,QAAQsQ,MAAQA,MAChBtQ,QAAQqQ,KAAOA,KACfrQ,QAAQuC,IAAMA,IACdvC,QAAQsC,IAAMA,IACdtC,QAAQ2J,IAAMA,IACd3J,QAAQwK,IAAMA,IACdxK,QAAQnC,IAAMA,IACdmC,QAAQuQ,OAASA,OACjBvQ,QAAQL,MAAQA,MAChBK,QAAQwN,KAAOA,KACfxN,QAAQjD,IAAMA,IACdiD,QAAQlE,KAAOA,KACfkE,QAAQ7B,KAAOA,KACf6B,QAAQoJ,IAAMA,IACdpJ,QAAQuO,IAAMA,IACdvO,QAAQuK,IAAMA,IACdvK,QAAQoH,KAAOA,KACfpH,QAAQmM,MAAQA,WAEJ,IAARwD,MAAgBA,IAAM,CAAC,GACvBA,MACmB,IAAjBA,IAAIG,SAEN,IADAC,GAAK,CAAC,YAAa,WAAY,WAAY,WAAY,OAAQ,OAAQ,SAAU,UAC5E1S,EAAI,EAAGA,EAAI0S,GAAG/S,QAAc2S,IAAI2B,eAAelC,EAAIW,GAAG1S,QAAOsS,IAAIP,GAAK3T,KAAK2T,IAMpF,OAFApP,QAAQ0P,OAAOC,KAER3P,OACT,CAqbU0Q,CAAMpQ,UAChBN,QAAQtC,UAAU+F,YAAczD,QAChCA,QAAiB,QAAIA,QAAQA,QAAUA,QAGvCK,KAAO,IAAIL,QAAQK,MACnB/B,GAAK,IAAI0B,QAAQ1B,SAUd,KAFD,yCACE,OAAO0B,OACR,mGAyBJ,CAr0JA,8BCKD,IAAIuR,SAAWC,OAAOC,QAAU,SAAUC,QAAU,IAAK,IAAIrU,EAAI,EAAGA,EAAI8S,UAAUnT,OAAQK,IAAK,CAAE,IAAIsU,OAASxB,UAAU9S,GAAI,IAAK,IAAIuU,OAAOD,OAAcH,OAAO9T,UAAU4T,eAAeO,KAAKF,OAAQC,OAAQF,OAAOE,KAAOD,OAAOC,KAAU,CAAE,OAAOF,MAAQ,EAE3PI,eAAiB,CACnB,IAAK,MACL,IAAK,MACL,KAAM,oBACN,IAAK,MACLC,EAAG,MACH,IAAK,MACL,IAAK,MACL,IAAK,sBACLC,EAAG,MACH,IAAK,sBAEHC,cAAgB,CAClB,IAAU,OACV,IAAU,QACV,IAAK,IACL,KAAM,YACN,OAAQ,cACR,KAAM,eAGJC,mBAAqB,SAA4BJ,eAAgBG,eACnE,OAAOV,SAAS,CAAC,EAAGO,eAAgBG,cACtC,EAUA3W,OAAOD,QAAU,SAAU6G,KAmCzB,IAlCA,IAAIiQ,KAAOhC,UAAUnT,OAAS,QAAsBJ,IAAjBuT,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAC5EiC,sBAAwBD,KAAKE,mBAC7BA,wBAA+CzV,IAA1BwV,uBAA8CA,sBACnEE,iBAAmBH,KAAKI,YACxBA,iBAAmC3V,IAArB0V,iBAAiCJ,mBAAqBI,iBAEpEE,WAAa7D,OAAOzM,KACpBuQ,OAAS,GAETC,QAAUH,YAAYhB,SAAS,CAAC,EAAGO,gBAAiBO,mBAAqBd,SAAS,CAAC,EAAGU,eAAiB,CAAC,GACxGU,WAAanB,OAAOoB,KAAKF,SAMzBG,MAAQ,WACV,IAAIC,kBAAmB,EACvBH,WAAWI,SAAQ,SAAUnB,IAAKoB,OAC5BF,kBAGAN,WAAWxV,QAAU4U,IAAI5U,QAAUwV,WAAW3M,MAAM,EAAG+L,IAAI5U,UAAY4U,MACzEa,QAAUC,QAAQC,WAAWK,QAC7BR,WAAaA,WAAW3M,MAAM+L,IAAI5U,OAAQwV,WAAWxV,QACrD8V,kBAAmB,EAEvB,IACKA,mBACHL,QAAUD,WAAW3M,MAAM,EAAG,GAC9B2M,WAAaA,WAAW3M,MAAM,EAAG2M,WAAWxV,QAEhD,EAEOwV,YACLK,QAEF,OAAOJ,MACT,gCC/EA,mCAuCA,SAAUtX,MAER,aAKA,IAGIyG,EAAI,CACN,EAAK,EACL,EAAK,EACL,EAAK,GAGP,SAASqR,YAAYC,MAEnB,SAASC,mBACP,IAAI/T,KAAOoD,MAAM4Q,MAAM3X,KAAM0U,WAC7B/Q,KAAW,KAAI3D,KAAW,KAAIyX,KAC9BzX,KAAY,MAAI2D,KAAY,MAC5B3D,KAAc,QAAI2D,KAAc,OAClC,CAOA,SAASiU,wBAA0B,CAInC,OAHAA,sBAAsB3V,UAAY8E,MAAM9E,UACxCyV,iBAAiBzV,UAAY,IAAI2V,sBAE1BF,gBACT,CAEA,IAAIG,eAAiBC,SAAyB,eAAIN,YAAY,kBAC1DO,iBAAmBD,SAA2B,iBAAIN,YAAY,oBAElE,SAASxB,OAAOjM,EAAG9B,GAKjB,OAHInG,MAAMiI,EAAIiO,SAASjO,EAAG,MACxBkO,oBAEKlO,EAAI9B,CACb,CAEA,SAASgQ,oBACP,MAAM,IAAIF,gBACZ,CAEA,SAASG,UAAU1K,KAQjB,IANA,IAAI2K,QAAU,CAAC,EAEXpO,EAAIyD,IACJ5L,EAAI,EACJqG,EAAI,EAEDA,GAAK8B,GAAG,CAEb,KAAOA,EAAInI,GAAM,GACfmI,GAAKnI,EACLuW,QAAQvW,IAAMuW,QAAQvW,IAAM,GAAK,EAEnCqG,GAAK,EAAI,EAAIrG,GACf,CAQA,OANImI,IAAMyD,IACJzD,EAAI,IACRoO,QAAQpO,IAAMoO,QAAQpO,IAAM,GAAK,GAEjCoO,QAAQ3K,MAAQ2K,QAAQ3K,MAAQ,GAAK,EAEhC2K,OACT,CAEA,IAAInW,MAAQ,SAASoW,GAAIC,IAEvB,IAOIC,EAPAvO,EAAI,EAAG5H,EAAI,EAAG8F,EAAI,EAClBkM,EAAI,EAAGzN,EAAI,EAAGxG,EAAI,EAAG8C,EAAI,EAAG9B,EAAI,EAEhCqX,EAAI,EAAGC,EAAI,EACXC,EAAI,EAAGC,EAAI,EAEXC,EAAI,IAGR,GAAIP,eAEG,QAAWjX,IAAPkX,GAGTpQ,GAFA8B,EAAIqO,KACJjW,EAAIkW,SAGJ,cAAeD,IAEb,IAAK,SAEG,MAAOA,IAAM,MAAOA,IACtBrO,EAAIqO,GAAM,EACVjW,EAAIiW,GAAM,EACN,MAAOA,KACTrO,GAAKqO,GAAM,IACJ,KAAKA,IACdrO,EAAIqO,GAAG,GACH,KAAKA,KACPjW,EAAIiW,GAAG,KAETH,oBAEFhQ,EAAI8B,EAAI5H,EACR,MAEJ,IAAK,SAOD,GALIiW,GAAK,IACPnQ,EAAImQ,GACJA,IAAMA,IAGJA,GAAK,GAAM,EACbrO,EAAIqO,QACC,GAAIA,GAAK,EAAG,CAUjB,IARIA,IAAM,IAERA,IADAlX,EAAIf,KAAKiC,IAAI,GAAIjC,KAAK8D,MAAM,EAAI9D,KAAKW,IAAIsX,IAAMjY,KAAKyE,QAO/C4T,GAAKG,GAAKD,GAAKC,GAAG,CAGvB,GAAIP,MAFJE,GAAKC,EAAIE,IAAMD,EAAIE,IAEL,CACRF,EAAIE,GAAKC,GACX5O,EAAIwO,EAAIE,EACRtW,EAAIqW,EAAIE,GACCA,EAAIF,GACbzO,EAAI0O,EACJtW,EAAIuW,IAEJ3O,EAAIwO,EACJpW,EAAIqW,GAEN,KAEF,CAEMJ,GAAKE,GACPC,GAAKE,EACLD,GAAKE,IAELD,GAAKF,EACLG,GAAKF,GAGHA,EAAIG,GACN5O,EAAI0O,EACJtW,EAAIuW,IAEJ3O,EAAIwO,EACJpW,EAAIqW,EAGV,CACAzO,GAAK7I,CACP,MAAWY,MAAMsW,KAAOtW,MAAMuW,OAC5BlW,EAAI4H,EAAI1F,KAEV,MAEJ,IAAK,SAgDD,GA5CU,QAFVmU,EAAIJ,GAAG3W,MAAM,YAGXwW,oBAEW,MAATO,EAAED,IACJtQ,GAAK,EACLsQ,KACkB,MAATC,EAAED,IACXA,IAGEC,EAAEjX,SAAWgX,EAAI,EACnB7R,EAAIsP,OAAOwC,EAAED,KAAMtQ,GACG,MAAbuQ,EAAED,EAAI,IAAuB,MAATC,EAAED,IAElB,MAATC,EAAED,KACJpE,EAAI6B,OAAOwC,EAAED,KAAMtQ,OAErBsQ,EAGQ,IAAMC,EAAEjX,QAAuB,MAAbiX,EAAED,EAAI,IAA2B,MAAbC,EAAED,EAAI,IAA2B,MAAbC,EAAED,EAAI,IAA2B,MAAbC,EAAED,EAAI,MAC1F7R,EAAIsP,OAAOwC,EAAED,GAAItQ,GACjBjF,EAAI7C,KAAKiC,IAAI,GAAIoW,EAAED,GAAGhX,QACtBgX,MAIW,MAATC,EAAED,IAA2B,MAAbC,EAAED,EAAI,IAAuB,MAATC,EAAED,IAA2B,MAAbC,EAAED,EAAI,MAC5DrY,EAAI8V,OAAOwC,EAAED,EAAI,GAAItQ,GACrB/G,EAAIf,KAAKiC,IAAI,GAAIoW,EAAED,EAAI,GAAGhX,QAAU,EACpCgX,GAAK,IAGe,MAAbC,EAAED,EAAI,IAA2B,MAAbC,EAAED,EAAI,IACnC7R,EAAIsP,OAAOwC,EAAED,GAAItQ,GACjBjF,EAAIgT,OAAOwC,EAAED,EAAI,GAAI,GACrBA,GAAK,GACiB,MAAbC,EAAED,EAAI,IAA2B,MAAbC,EAAED,EAAI,KACnCpE,EAAI6B,OAAOwC,EAAED,GAAItQ,GACjBvB,EAAIsP,OAAOwC,EAAED,EAAI,GAAItQ,GACrBjF,EAAIgT,OAAOwC,EAAED,EAAI,GAAI,GACrBA,GAAK,GAGHC,EAAEjX,QAAUgX,EAAG,CAEjBtQ,EACA8B,EAAI7J,GAFJiC,EAAIa,EAAI9B,GAEIiT,EAAIjT,EAAIwF,EACpB,KACF,CAIJ,QACEuR,oBAGN,GAAU,IAAN9V,EACF,MAAM,IAAI0V,eAGZ1R,EAAK,EAAI8B,EAAI,GAAK,EAAI,EACtB9B,EAAK,EAAIhG,KAAKS,IAAImJ,GAClB5D,EAAK,EAAIhG,KAAKS,IAAIuB,EACpB,EA+DA,SAASyW,IAAInY,EAAGC,GAEd,IAAKD,EACH,OAAOC,EACT,IAAKA,EACH,OAAOD,EAET,OAAU,CAER,KADAA,GAAKC,GAEH,OAAOA,EAET,KADAA,GAAKD,GAEH,OAAOA,CACX,CACF,CASA,SAASqX,SAASrX,EAAGC,GAEnB,KAAMV,gBAAgB8X,UACpB,OAAO,IAAIA,SAASrX,EAAGC,GAGzBsB,MAAMvB,EAAGC,GAETD,EAAImY,IAAIzS,EAAK,EAAGA,EAAK,GAErBnG,KAAQ,EAAImG,EAAK,EACjBnG,KAAQ,EAAImG,EAAK,EAAI1F,EACrBT,KAAQ,EAAImG,EAAK,EAAI1F,CACvB,CAEAqX,SAAS7V,UAAY,CAEnB,EAAK,EACL,EAAK,EACL,EAAK,EAOL,IAAO,WAEL,OAAO,IAAI6V,SAAS9X,KAAQ,EAAGA,KAAQ,EACzC,EAOA,IAAO,WAEL,OAAO,IAAI8X,UAAU9X,KAAQ,EAAIA,KAAQ,EAAGA,KAAQ,EACtD,EAOA,IAAO,SAASS,EAAGC,GAGjB,OADAsB,MAAMvB,EAAGC,GACF,IAAIoX,SACT9X,KAAQ,EAAIA,KAAQ,EAAImG,EAAK,EAAIA,EAAK,EAAInG,KAAQ,EAAImG,EAAK,EAC3DnG,KAAQ,EAAImG,EAAK,EAErB,EAOA,IAAO,SAAS1F,EAAGC,GAGjB,OADAsB,MAAMvB,EAAGC,GACF,IAAIoX,SACT9X,KAAQ,EAAIA,KAAQ,EAAImG,EAAK,EAAIA,EAAK,EAAInG,KAAQ,EAAImG,EAAK,EAC3DnG,KAAQ,EAAImG,EAAK,EAErB,EAOA,IAAO,SAAS1F,EAAGC,GAGjB,OADAsB,MAAMvB,EAAGC,GACF,IAAIoX,SACT9X,KAAQ,EAAImG,EAAK,EAAInG,KAAQ,EAAImG,EAAK,EACtCnG,KAAQ,EAAImG,EAAK,EAErB,EAOA,IAAO,SAAS1F,EAAGC,GAGjB,OADAsB,MAAMvB,EAAGC,GACF,IAAIoX,SACT9X,KAAQ,EAAImG,EAAK,EAAInG,KAAQ,EAAImG,EAAK,EACtCnG,KAAQ,EAAImG,EAAK,EAErB,EAOA,MAAS,WACP,OAAO,IAAI2R,SAAS9X,KACtB,EAOA,IAAO,SAASS,EAAGC,GAEjB,OAAIoB,MAAM9B,KAAQ,IAAM8B,MAAM9B,KAAQ,GAC7B,IAAI8X,SAASzT,UAGZlD,IAANV,EACK,IAAIqX,SAAS9X,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,EAAG,IAGzDgC,MAAMvB,EAAGC,GACL,IAAMyF,EAAK,GAAK,IAAMnG,KAAQ,GAChC8X,SAAS,EAAG,GAiBP,IAAIA,SACT9X,KAAQ,GAAKmG,EAAK,EAAInG,KAAQ,IAAMmG,EAAK,EAAInG,KAAQ,GACrDmG,EAAK,EAAInG,KAAQ,GAErB,EAOA,IAAO,SAASS,EAAGC,GAMjB,OAJAsB,MAAMvB,EAAGC,GAIF,IAAIoX,SAASc,IAAIzS,EAAK,EAAGnG,KAAQ,GAAK4Y,IAAIzS,EAAK,EAAGnG,KAAQ,GAAImG,EAAK,EAAInG,KAAQ,EACxF,EAOA,IAAO,SAASS,EAAGC,GAMjB,OAJAsB,MAAMvB,EAAGC,GAIM,IAAXyF,EAAK,GAAyB,IAAdnG,KAAQ,EACnB,IAAI8X,SAEN,IAAIA,SAAS3R,EAAK,EAAInG,KAAQ,EAAG4Y,IAAIzS,EAAK,EAAGnG,KAAQ,GAAK4Y,IAAIzS,EAAK,EAAGnG,KAAQ,GACvF,EAOA,KAAQ,SAAS+D,QAIf,OAFAA,OAAS5D,KAAKiC,IAAI,GAAI2B,QAAU,GAE5BjC,MAAM9B,KAAQ,IAAM8B,MAAM9B,KAAQ,GAC7B,IAAI8X,SAASzT,KAEf,IAAIyT,SAAS3X,KAAK6D,KAAKD,OAAS/D,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,GAAI+D,OAC7E,EAOA,MAAS,SAASA,QAIhB,OAFAA,OAAS5D,KAAKiC,IAAI,GAAI2B,QAAU,GAE5BjC,MAAM9B,KAAQ,IAAM8B,MAAM9B,KAAQ,GAC7B,IAAI8X,SAASzT,KAEf,IAAIyT,SAAS3X,KAAK8D,MAAMF,OAAS/D,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,GAAI+D,OAC9E,EAOA,MAAS,SAASA,QAIhB,OAFAA,OAAS5D,KAAKiC,IAAI,GAAI2B,QAAU,GAE5BjC,MAAM9B,KAAQ,IAAM8B,MAAM9B,KAAQ,GAC7B,IAAI8X,SAASzT,KAEf,IAAIyT,SAAS3X,KAAK+D,MAAMH,OAAS/D,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,GAAI+D,OAC9E,EAOA,QAAW,WAET,OAAO,IAAI+T,SAAS9X,KAAQ,EAAIA,KAAQ,EAAGA,KAAQ,EACrD,EAOA,IAAO,SAASS,EAAGC,GAMjB,GAJAsB,MAAMvB,EAAGC,GAIM,IAAXyF,EAAK,EAEP,OAAIA,EAAK,EAAI,EACJ,IAAI2R,SAAS3X,KAAKiC,IAAIpC,KAAQ,EAAIA,KAAQ,EAAGmG,EAAK,GAAIhG,KAAKiC,IAAIpC,KAAQ,EAAGmG,EAAK,IAE/E,IAAI2R,SAAS3X,KAAKiC,IAAIpC,KAAQ,EAAIA,KAAQ,EAAGmG,EAAK,GAAIhG,KAAKiC,IAAIpC,KAAQ,EAAGmG,EAAK,IAU1F,GAAInG,KAAQ,EAAI,EAAG,OAAO,KAG1B,IAAI2Y,EAAIT,UAAUlY,KAAQ,GACtB0Y,EAAIR,UAAUlY,KAAQ,GAGtB+J,EAAI,EACJ5H,EAAI,EACR,IAAK,IAAImE,KAAKqS,EACZ,GAAU,MAANrS,EAAJ,CACA,GAAU,MAANA,EAAW,CACbyD,EAAI,EACJ,KACF,CAGA,GAFA4O,EAAErS,IAAKH,EAAK,EAERwS,EAAErS,GAAKH,EAAK,GAAM,EAEf,OAAO,KADZwS,EAAErS,IAAKH,EAAK,EAEd4D,GAAI5J,KAAKiC,IAAIkE,EAAGqS,EAAErS,GAVK,CAazB,IAAK,IAAIA,KAAKoS,EACZ,GAAU,MAANpS,EAAJ,CAGA,GAFAoS,EAAEpS,IAAKH,EAAK,EAERuS,EAAEpS,GAAKH,EAAK,GAAM,EAEf,OAAO,KADZuS,EAAEpS,IAAKH,EAAK,EAEdhE,GAAIhC,KAAKiC,IAAIkE,EAAGoS,EAAEpS,GANK,CASzB,OAAIH,EAAK,EAAI,EACJ,IAAI2R,SAAS3V,EAAG4H,GAElB,IAAI+N,SAAS/N,EAAG5H,EACzB,EAOA,OAAU,SAAS1B,EAAGC,GAGpB,OADAsB,MAAMvB,EAAGC,GACFV,KAAQ,EAAIA,KAAQ,EAAImG,EAAK,GAAMA,EAAK,EAAIA,EAAK,EAAInG,KAAQ,CACtE,EAOA,QAAW,SAASS,EAAGC,GAErBsB,MAAMvB,EAAGC,GACT,IAAIwB,EAAKlC,KAAQ,EAAIA,KAAQ,EAAImG,EAAK,EAAIA,EAAK,EAAIA,EAAK,EAAInG,KAAQ,EACpE,OAAQ,EAAIkC,IAAMA,EAAI,EACxB,EAEA,SAAY,SAAS2W,KAInB,GAAI/W,MAAM9B,KAAQ,IAAM8B,MAAM9B,KAAQ,GACpC,OAAOA,KAGT,IAAI8Y,KAAO9Y,KAAU,MAAiB,cAItC,SAAS+Y,IAAItY,GACX,OAAiB,IAAbA,EAAEc,OACG,IAAIuW,SAASrX,EAAE,IACjBsY,IAAItY,EAAE2J,MAAM,IAAa,UAAS,IAAE3J,EAAE,GAC/C,CANAoY,IAAMA,KAAO,KAQb,IAAK,IAAIjX,EAAI,EAAGA,EAAIkX,KAAKvX,OAAQK,IAAK,CACpC,IAAIe,IAAMoW,IAAID,KAAK1O,MAAM,EAAGxI,EAAI,IAChC,GAAIe,IAAS,IAAE3C,KAAU,OAAU,MAAI2Q,UAAYkI,IACjD,OAAOlW,IAAS,IAAE3C,KAAQ,EAE9B,CACA,OAAOA,IACT,EAOA,UAAa,SAASS,EAAGC,GAGvB,OADAsB,MAAMvB,EAAGC,OACEyF,EAAK,EAAInG,KAAQ,IAAQA,KAAQ,EAAImG,EAAK,GAAMA,EAAK,EAAInG,KAAQ,GAC9E,EAOA,QAAW,WAET,OAAOA,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,CACzC,EAOA,WAAc,SAASgZ,cAErB,IAAIC,MAAOxS,IAAM,GACbsD,EAAI/J,KAAQ,EACZmC,EAAInC,KAAQ,EAmBhB,OAlBIA,KAAQ,EAAI,IACdyG,KAAO,KAGC,IAANtE,EACFsE,KAAOsD,GAGHiP,eAAiBC,MAAQ9Y,KAAK8D,MAAM8F,EAAI5H,IAAM,IAChDsE,KAAOwS,MACPxS,KAAO,IACPsD,GAAK5H,GAGPsE,KAAOsD,EACPtD,KAAO,IACPA,KAAOtE,GAEFsE,GACT,EAOA,QAAW,SAASuS,cAElB,IAAIC,MAAOxS,IAAM,GACbsD,EAAI/J,KAAQ,EACZmC,EAAInC,KAAQ,EAoBhB,OAnBIA,KAAQ,EAAI,IACdyG,KAAO,KAGC,IAANtE,EACFsE,KAAOsD,GAGHiP,eAAiBC,MAAQ9Y,KAAK8D,MAAM8F,EAAI5H,IAAM,IAChDsE,KAAOwS,MACPlP,GAAK5H,GAGPsE,KAAO,UACPA,KAAOsD,EACPtD,KAAO,KACPA,KAAOtE,EACPsE,KAAO,KAEFA,GACT,EAOA,YAAe,WAEb,IAAIvE,EACAzB,EAAIT,KAAQ,EACZU,EAAIV,KAAQ,EACZuD,IAAM,GAEV,GAAIzB,MAAMrB,IAAMqB,MAAMpB,GACpB,OAAO6C,IAGT,GACEA,IAAIuK,KAAK3N,KAAK8D,MAAMxD,EAAIC,IACxBwB,EAAIzB,EAAIC,EACRD,EAAIC,EACJA,EAAIwB,QACS,IAANzB,GAET,OAAO8C,GACT,EAOA,SAAY,SAAS2V,KAEnB,IACIP,EAAI3Y,KAAQ,EACZ0Y,EAAI1Y,KAAQ,EAEhB,GAAI8B,MAAM6W,IAAM7W,MAAM4W,GACpB,MAAO,MAGTQ,IAAMA,KAAO,GAEb,IAAIC,OAliBR,SAAkBpP,EAAG5H,GAEnB,KAAOA,EAAI,GAAM,EACfA,GAAK,GAGP,KAAOA,EAAI,GAAM,EACfA,GAAK,GAGP,GAAU,IAANA,EACF,OAAO,EAUT,IAHA,IAAIoP,IAAM,GAAKpP,EACXD,EAAI,EAEO,IAARqP,IAAWrP,IAGhB,GAFAqP,IAAY,GAANA,IAAWpP,EAEbD,EAnRY,IAoRd,OAAO,EAEX,OAAOA,CACT,CAsgBiBkX,CAAST,EAAGD,GACrBW,OApgBR,SAAoBtP,EAAG5H,EAAGgH,KAKxB,IAHA,IAAImQ,KAAO,EACPC,KA/CN,SAAgB7Y,EAAGyH,EAAG2B,GAGpB,IADA,IAAIrH,EAAI,EACD0F,EAAI,EAAGzH,EAAKA,EAAIA,EAAKoJ,EAAG3B,IAAM,EAE3B,EAAJA,IACF1F,EAAKA,EAAI/B,EAAKoJ,GAGlB,OAAOrH,CACT,CAqCa+W,CAAO,GAAIrQ,IAAKhH,GAElBD,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAG5B,GAAIoX,OAASC,KACX,OAAOrX,EAEToX,KAAc,GAAPA,KAAYnX,EACnBoX,KAAc,GAAPA,KAAYpX,CACrB,CACA,OAAO,CACT,CAqfiBsX,CAAWd,EAAGD,EAAGS,QAE1B1S,KAAqB,IAAfzG,KAAQ,EAAW,IAAM,GAUnC,GARAyG,KAAOkS,EAAID,EAAI,EAEfC,GAAKD,GACLC,GAAK,MAGHlS,KAAO,KAEL0S,OAAQ,CAEV,IAAK,IAAIvX,EAAIyX,OAAQzX,KACnB6E,KAAOkS,EAAID,EAAI,EACfC,GAAKD,EACLC,GAAK,GAEPlS,KAAO,IACP,IAAS7E,EAAIuX,OAAQvX,KACnB6E,KAAOkS,EAAID,EAAI,EACfC,GAAKD,EACLC,GAAK,GAEPlS,KAAO,GACT,MACE,IAAS7E,EAAIsX,IAAKP,GAAK/W,KACrB6E,KAAOkS,EAAID,EAAI,EACfC,GAAKD,EACLC,GAAK,GAGT,OAAOlS,GACT,QAMC,KAFU,8BAAF,WACP,OAAOqR,QACR,gBAFM,OAEN,6CAUJ,CAv1BD,iBCvCA,SAAS1T,IAGT,CAEAA,EAAEnC,UAAY,CACZyX,GAAI,SAAUjC,KAAMkC,SAAUC,KAC5B,IAAIzR,EAAInI,KAAKmI,IAAMnI,KAAKmI,EAAI,CAAC,GAO7B,OALCA,EAAEsP,QAAUtP,EAAEsP,MAAQ,KAAK3J,KAAK,CAC/B+L,GAAIF,SACJC,MAGK5Z,IACT,EAEA8Z,KAAM,SAAUrC,KAAMkC,SAAUC,KAC9B,IAAIG,KAAO/Z,KACX,SAASga,WACPD,KAAKE,IAAIxC,KAAMuC,UACfL,SAAShC,MAAMiC,IAAKlF,UACtB,CAGA,OADAsF,SAASzD,EAAIoD,SACN3Z,KAAK0Z,GAAGjC,KAAMuC,SAAUJ,IACjC,EAEAM,KAAM,SAAUzC,MAMd,IALA,IAAI0C,KAAO,GAAG/P,MAAMgM,KAAK1B,UAAW,GAChC0F,SAAWpa,KAAKmI,IAAMnI,KAAKmI,EAAI,CAAC,IAAIsP,OAAS,IAAIrN,QACjDxI,EAAI,EACJuH,IAAMiR,OAAO7Y,OAETK,EAAIuH,IAAKvH,IACfwY,OAAOxY,GAAGiY,GAAGlC,MAAMyC,OAAOxY,GAAGgY,IAAKO,MAGpC,OAAOna,IACT,EAEAia,IAAK,SAAUxC,KAAMkC,UACnB,IAAIxR,EAAInI,KAAKmI,IAAMnI,KAAKmI,EAAI,CAAC,GACzBkS,KAAOlS,EAAEsP,MACT6C,WAAa,GAEjB,GAAID,MAAQV,SACV,IAAK,IAAI/X,EAAI,EAAGuH,IAAMkR,KAAK9Y,OAAQK,EAAIuH,IAAKvH,IACtCyY,KAAKzY,GAAGiY,KAAOF,UAAYU,KAAKzY,GAAGiY,GAAGtD,IAAMoD,UAC9CW,WAAWxM,KAAKuM,KAAKzY,IAY3B,OAJC0Y,WAAiB,OACdnS,EAAEsP,MAAQ6C,kBACHnS,EAAEsP,MAENzX,IACT,GAGFH,OAAOD,QAAUwE,EACjBvE,OAAOD,QAAQ2a,YAAcnW,6CClE7B,8FAYI,6BAAO,GAAI,+BAUP,WAEN,SAASoW,KACP,OAAO,CACT,CAEA,SAASC,QACP,OAAO,CACT,CAEA,SAASC,QAET,CAkCA,SAASC,SAEP,IAAIC,OAAS,CACX,CAAEnD,KAAM,SAAa7D,KAAM,SAAU1T,GAAK,MAAoB,iBAANA,CAAe,GACvE,CAAEuX,KAAM,SAAa7D,KAAM,SAAU1T,GAAK,MAAoB,iBAANA,CAAe,GACvE,CAAEuX,KAAM,UAAa7D,KAAM,SAAU1T,GAAK,MAAoB,kBAANA,CAAgB,GACxE,CAAEuX,KAAM,WAAa7D,KAAM,SAAU1T,GAAK,MAAoB,mBAANA,CAAgB,GACxE,CAAEuX,KAAM,QAAa7D,KAAMiH,MAAMC,SACjC,CAAErD,KAAM,OAAa7D,KAAM,SAAU1T,GAAK,OAAOA,aAAa6a,IAAK,GACnE,CAAEtD,KAAM,SAAa7D,KAAM,SAAU1T,GAAK,OAAOA,aAAa8a,MAAO,GACrE,CAAEvD,KAAM,SAAa7D,KAAM,SAAU1T,GACnC,MAAoB,iBAANA,GAAwB,OAANA,GAAcA,EAAE8H,cAAgB+N,MAClE,GACA,CAAE0B,KAAM,OAAa7D,KAAM,SAAU1T,GAAK,OAAa,OAANA,CAAW,GAC5D,CAAEuX,KAAM,YAAa7D,KAAM,SAAU1T,GAAK,YAAaiB,IAANjB,CAAgB,IAG/D+a,QAAU,CACZxD,KAAM,MACN7D,KAAM4G,IAIJU,QAAU,GAGVC,aAAe,GAGfC,MAAQ,CACVC,MAAOT,OACPU,YAAaH,aACbI,OAAQL,SASV,SAASM,eAAgBC,UACvB,IAAIC,MAAQC,YAAYP,MAAMC,OAAO,SAAUK,OAC7C,OAAOA,MAAMjE,OAASgE,QACxB,IAEA,GAAIC,MACF,OAAOA,MAGT,GAAiB,QAAbD,SACF,OAAOR,QAGT,IAAIW,KAAOD,YAAYP,MAAMC,OAAO,SAAUK,OAC5C,OAAOA,MAAMjE,KAAK5D,gBAAkB4H,SAAS5H,aAC/C,IAEA,MAAM,IAAIgI,UAAU,iBAAmBJ,SAAW,KAC7CG,KAAQ,mBAAqBA,KAAKnE,KAAO,KAAQ,IACxD,CAOA,SAASqE,cAAcC,MACrB,OAAIA,OAASd,QACJ,IAGFG,MAAMC,MAAMzT,QAAQmU,KAC7B,CAQA,SAASC,aAAaC,OACpB,IAAIP,MAAQC,YAAYP,MAAMC,OAAO,SAAUK,OAC7C,OAAOA,MAAM9H,KAAKqI,MACpB,IAEA,GAAIP,MACF,OAAOA,MAAMjE,KAGf,MAAM,IAAIoE,UAAU,kCAAoCI,MAC1D,CAiBA,SAASC,KAAMrC,GAAIsC,WACjB,IAAKtC,GAAGuC,WACN,MAAM,IAAIP,UAAU,iCAItB,IAAInU,IACJ,GAAyB,iBAAdyU,UAAwB,CACjCzU,IAAMyU,UAAUE,MAAM,KACtB,IAAK,IAAIza,EAAI,EAAGA,EAAI8F,IAAInG,OAAQK,IAC9B8F,IAAI9F,GAAK8F,IAAI9F,GAAG0a,MAEpB,KACK,KAAIzB,MAAMC,QAAQqB,WAIrB,MAAM,IAAIN,UAAU,qDAHpBnU,IAAMyU,SAIR,CAEA,IAAI1V,IAAMiB,IAAI6U,KAAK,KAGf9a,MAAQoY,GAAGuC,WAAW3V,KAC1B,GAAIhF,MACF,OAAOA,MAKT,MAAM,IAAIoa,UAAU,oCAAsChC,GAAGpC,MAAQ,WAAa,IAAM/P,IAAI6U,KAAK,MAAQ,KAC3G,CAOA,SAASC,QAASP,MAAOF,MACvB,IAAIU,KAAOT,aAAaC,OAGxB,GAAIF,OAASU,KACX,OAAOR,MAGT,IAAK,IAAIra,EAAI,EAAGA,EAAIwZ,MAAME,YAAY/Z,OAAQK,IAAK,CACjD,IAAI8a,WAAatB,MAAME,YAAY1Z,GACnC,GAAI8a,WAAWD,OAASA,MAAQC,WAAWC,KAAOZ,KAChD,OAAOW,WAAWF,QAAQP,MAE9B,CAEA,MAAM,IAAIlV,MAAM,uBAAyB0V,KAAO,OAASV,KAC3D,CAOA,SAASa,gBAAiBC,QACxB,OAAOA,OACFC,KAAI,SAAUC,OACb,IAAIC,UAAYD,MAAM1B,MAAMyB,IAAIG,aAEhC,OAAQF,MAAMG,UAAY,MAAQ,IAAMF,UAAUT,KAAK,IACzD,IACCA,KAAK,IACZ,CAQA,SAASY,WAAYJ,MAAOzB,aAC1B,IAAI4B,UAAqC,IAAzBH,MAAMnV,QAAQ,OAO1BoV,WANUE,UAEPH,MAAMxb,OAAS,EACZwb,MAAM3S,MAAM,GACZ,MAHJ2S,OAKgBV,MAAM,KAAKS,IAAIR,MAChCc,OAAOC,UACPD,OAAOE,WAERC,oBAAsBC,kBAAkBlC,YAAa0B,WAErDS,WAAaT,UAAUF,KAAI,SAAUrB,UACvC,IAAIM,KAAOP,eAAeC,UAE1B,MAAO,CACLhE,KAAMgE,SACNiC,UAAW5B,cAAcC,MACzBnI,KAAMmI,KAAKnI,KACX8I,WAAY,KACZiB,iBAAkB,EAEtB,IAEIC,iBAAmBL,oBAAoBT,KAAI,SAAUJ,YACvD,IAAIX,KAAOP,eAAekB,WAAWD,MAErC,MAAO,CACLhF,KAAMiF,WAAWD,KACjBiB,UAAW5B,cAAcC,MACzBnI,KAAMmI,KAAKnI,KACX8I,WACAiB,gBAAiBrC,YAAY1T,QAAQ8U,YAEzC,IAEA,MAAO,CACLrB,MAAOoC,WAAWI,OAAOD,kBACzBV,UAEJ,CAUA,SAASY,eAAgB3B,UAAWtC,GAAIyB,aACtC,IAAIuB,OAAS,GAkBb,MAhByB,KAArBV,UAAUG,SACZO,OAASV,UACJE,MAAM,KACNS,IAAIR,MACJQ,KAAI,SAAUC,MAAOxF,MAAOwG,OAC3B,IAAIC,YAAcb,WAAWJ,MAAOzB,aAEpC,GAAI0C,YAAYd,WAAc3F,QAAUwG,MAAMxc,OAAS,EACrD,MAAM,IAAIhB,YAAY,8BAAgCwc,MAAhC,0CAIxB,OAAOiB,WACX,KAGAnB,OAAOoB,KAAKC,gBAGP,KAGF,CACLrB,OACAhD,GAEJ,CAOA,SAASsE,aAAatB,QACpB,IAAIE,MAAQqB,KAAKvB,QACjB,QAAOE,OAAQA,MAAMG,SACvB,CAQA,SAASmB,eAAetB,OACtB,OAAOA,MAAM1B,MAAM4C,MAAK,SAAUlC,MAChC,OAA0B,MAAnBA,KAAKW,UACd,GACF,CAQA,SAAS4B,YAAYvB,OACnB,GAAKA,OAAgC,IAAvBA,MAAM1B,MAAM9Z,OAIrB,IAA2B,IAAvBwb,MAAM1B,MAAM9Z,OACnB,OAAOia,eAAeuB,MAAM1B,MAAM,GAAG5D,MAAM7D,KAExC,GAA2B,IAAvBmJ,MAAM1B,MAAM9Z,OAAc,CACjC,IAAIgd,MAAQ/C,eAAeuB,MAAM1B,MAAM,GAAG5D,MAAM7D,KAC5C4K,MAAQhD,eAAeuB,MAAM1B,MAAM,GAAG5D,MAAM7D,KAChD,OAAO,SAAY1T,GACjB,OAAOqe,MAAMre,IAAMse,MAAMte,EAC3B,CACF,CAEE,IAAIue,MAAQ1B,MAAM1B,MAAMyB,KAAI,SAAUf,MACpC,OAAOP,eAAeO,KAAKtE,MAAM7D,IACnC,IACA,OAAO,SAAY1T,GACjB,IAAK,IAAI0B,EAAI,EAAGA,EAAI6c,MAAMld,OAAQK,IAChC,GAAI6c,MAAM7c,GAAG1B,GACX,OAAO,EAGX,OAAO,CACT,CACF,CAxBE,OAAOsa,EAyBX,CAOA,SAASkE,aAAa7B,QACpB,IAAI4B,MAAOF,MAAOC,MAElB,GAAIL,aAAatB,QAAS,CAGxB,IAAI8B,UADJF,MAAQG,QAAQ/B,QAAQC,IAAIwB,cACP/c,OACjBsd,SAAWP,YAAYF,KAAKvB,SAC5BiC,cAAgB,SAAUnM,MAC5B,IAAK,IAAI/Q,EAAI+c,SAAU/c,EAAI+Q,KAAKpR,OAAQK,IACtC,IAAKid,SAASlM,KAAK/Q,IACjB,OAAO,EAGX,OAAO,CACT,EAEA,OAAO,SAAkB+Q,MACvB,IAAK,IAAI/Q,EAAI,EAAGA,EAAI6c,MAAMld,OAAQK,IAChC,IAAK6c,MAAM7c,GAAG+Q,KAAK/Q,IACjB,OAAO,EAGX,OAAOkd,cAAcnM,OAAUA,KAAKpR,QAAUod,SAAW,CAC3D,CACF,CAGE,OAAsB,IAAlB9B,OAAOtb,OACF,SAAkBoR,MACvB,OAAuB,IAAhBA,KAAKpR,MACd,EAEyB,IAAlBsb,OAAOtb,QACdgd,MAAQD,YAAYzB,OAAO,IACpB,SAAkBlK,MACvB,OAAO4L,MAAM5L,KAAK,KAAuB,IAAhBA,KAAKpR,MAChC,GAEyB,IAAlBsb,OAAOtb,QACdgd,MAAQD,YAAYzB,OAAO,IAC3B2B,MAAQF,YAAYzB,OAAO,IACpB,SAAkBlK,MACvB,OAAO4L,MAAM5L,KAAK,KAAO6L,MAAM7L,KAAK,KAAuB,IAAhBA,KAAKpR,MAClD,IAGAkd,MAAQ5B,OAAOC,IAAIwB,aACZ,SAAkB3L,MACvB,IAAK,IAAI/Q,EAAI,EAAGA,EAAI6c,MAAMld,OAAQK,IAChC,IAAK6c,MAAM7c,GAAG+Q,KAAK/Q,IACjB,OAAO,EAGX,OAAO+Q,KAAKpR,SAAWkd,MAAMld,MAC/B,EAGN,CAUA,SAASwd,gBAAgB5C,UAAW5E,OAClC,OAAOA,MAAQ4E,UAAUU,OAAOtb,OAC1B4a,UAAUU,OAAOtF,OACjB4G,aAAahC,UAAUU,QACnBuB,KAAKjC,UAAUU,QACf,IACZ,CASA,SAASmC,qBAAsB7C,UAAW5E,MAAO0H,oBAC/C,IAAIlC,MAAQgC,gBAAgB5C,UAAW5E,OAOvC,OANYwF,MACNkC,mBACQlC,MAAM1B,MAAM+B,OAAO8B,aACnBnC,MAAM1B,MACd,IAEOyB,IAAIG,YACnB,CAOA,SAASA,YAAYlB,MACnB,OAAOA,KAAKtE,IACd,CAOA,SAASyH,YAAYnD,MACnB,OAA2B,OAApBA,KAAKW,iBAA2Cvb,IAApB4a,KAAKW,UAC1C,CASA,SAASyC,oBAAoB/C,WAAY7E,OACvC,IAAIyF,UAAYoC,KAAKC,QAAQjD,YAAY,SAAUD,WACjD,OAAO6C,qBAAqB7C,UAAW5E,OAAO,EAChD,KAEA,OAAsC,IAA9ByF,UAAUpV,QAAQ,OAAiB,CAAC,OAASoV,SACvD,CAUA,SAASxF,YAAYC,KAAM9E,KAAMyJ,YAC/B,IAAIkD,IAAKC,SAKLhI,MAJAiI,MAAQ/H,MAAQ,UAGhBgI,mBAAqBrD,WAEzB,IAAK7E,MAAQ,EAAGA,MAAQ5E,KAAKpR,OAAQgW,QAAS,CAC5C,IAAImI,iBAAmBD,mBAAmBrC,QAAO,SAAUjB,WACzD,IAAIvI,KAAO0K,YAAYS,gBAAgB5C,UAAW5E,QAClD,OAAQA,MAAQ4E,UAAUU,OAAOtb,QAAU4c,aAAahC,UAAUU,UAC9DjJ,KAAKjB,KAAK4E,OAChB,IAEA,GAAgC,IAA5BmI,iBAAiBne,QAGnB,IADAge,SAAWJ,oBAAoBM,mBAAoBlI,QACtChW,OAAS,EAAG,CACvB,IAAIoe,WAAa3D,aAAarJ,KAAK4E,QAYnC,OAVA+H,IAAM,IAAIzD,UAAU,2CAA6C2D,MAC7D,eAAiBD,SAAShD,KAAK,QAC/B,aAAeoD,WAAa,YAAcpI,MAAQ,MAClD4C,KAAO,CACTyF,SAAU,YACV/F,GAAI2F,MACJjI,MACAsI,OAAQF,WACRJ,UAEKD,GACT,OAGAG,mBAAqBC,gBAEzB,CAGA,IAAII,QAAUL,mBAAmB3C,KAAI,SAAUX,WAC7C,OAAOgC,aAAahC,UAAUU,QAAU1Z,IAAWgZ,UAAUU,OAAOtb,MACtE,IACA,GAAIoR,KAAKpR,OAASpB,KAAK0G,IAAI8Q,MAAM,KAAMmI,SAWrC,OAVAP,SAAWJ,oBAAoBM,mBAAoBlI,QACnD+H,IAAM,IAAIzD,UAAU,iCAAmC2D,MACnD,eAAiBD,SAAShD,KAAK,QAC/B,YAAc5J,KAAKpR,OAAS,MAC5B4Y,KAAO,CACTyF,SAAU,aACV/F,GAAI2F,MACJjI,MAAO5E,KAAKpR,OACZge,UAEKD,IAIT,IAAIS,UAAY5f,KAAK2G,IAAI6Q,MAAM,KAAMmI,SACrC,OAAInN,KAAKpR,OAASwe,YAChBT,IAAM,IAAIzD,UAAU,kCAAoC2D,MACpD,eAAiBO,UAAY,aAAepN,KAAKpR,OAAS,MAC1D4Y,KAAO,CACTyF,SAAU,cACV/F,GAAI2F,MACJjI,MAAO5E,KAAKpR,OACZye,eAAgBD,WAEXT,OAGTA,IAAM,IAAIzD,UAAU,sBAAwBlJ,KAAK4J,KAAK,MAClD,4DAA8DiD,MAAQ,MACtErF,KAAO,CACTyF,SAAU,WACVC,OAAQlN,KAAKmK,IAAId,eAEZsD,IACT,CAOA,SAASW,mBAAoBlD,OAG3B,IAFA,IAAIlW,IAAM,IAEDjF,EAAI,EAAGA,EAAImb,MAAM1B,MAAM9Z,OAAQK,IAClCsd,YAAYnC,MAAM1B,MAAMzZ,MAC1BiF,IAAM1G,KAAK0G,IAAIA,IAAKkW,MAAM1B,MAAMzZ,GAAG8b,YAIvC,OAAO7W,GACT,CAQA,SAASqZ,yBAA0BnD,OAGjC,IAFA,IAAIlW,IAAM,IAEDjF,EAAI,EAAGA,EAAImb,MAAM1B,MAAM9Z,OAAQK,IACjCsd,YAAYnC,MAAM1B,MAAMzZ,MAC3BiF,IAAM1G,KAAK0G,IAAIA,IAAKkW,MAAM1B,MAAMzZ,GAAG+b,kBAIvC,OAAO9W,GACT,CAUA,SAASsZ,cAAeC,OAAQC,QAC9B,IAAIxe,EAIJ,OAAU,IADVA,EAAIue,OAAOlD,UAAYmD,OAAOnD,YAOpB,IADVrb,EAAIwc,eAAe+B,QAAU/B,eAAegC,UAOlC,IADVxe,EAAIoe,mBAAmBG,QAAUH,mBAAmBI,SAV3Cxe,EAgBFqe,yBAAyBE,QAAUF,yBAAyBG,OACrE,CAUA,SAASC,kBAAmBC,WAAYC,YACtC,IACI5e,EACAC,EAFAsH,IAAMhJ,KAAK0G,IAAI0Z,WAAW1D,OAAOtb,OAAQif,WAAW3D,OAAOtb,QAM/D,GAAU,IADVM,EAAI0e,WAAW1D,OAAOoB,KAAKI,gBAAkBmC,WAAW3D,OAAOoB,KAAKI,iBAElE,OAAOxc,EAIT,IAAKD,EAAI,EAAGA,EAAIuH,IAAKvH,IAEnB,GAAU,IADVC,EAAIwc,eAAekC,WAAW1D,OAAOjb,IAAMyc,eAAemC,WAAW3D,OAAOjb,KAE1E,OAAOC,EAKX,IAAKD,EAAI,EAAGA,EAAIuH,IAAKvH,IAEnB,GAAU,KADVC,EAAIse,cAAcI,WAAW1D,OAAOjb,GAAI4e,WAAW3D,OAAOjb,KAExD,OAAOC,EAKX,OAAO0e,WAAW1D,OAAOtb,OAASif,WAAW3D,OAAOtb,MACtD,CAUA,SAASic,kBAAkBlC,YAAa0B,WACtC,IAAIyD,QAAU,CAAC,EAUf,OARAnF,YAAYhE,SAAQ,SAAUoF,aACgB,IAAxCM,UAAUpV,QAAQ8U,WAAWD,QACS,IAAtCO,UAAUpV,QAAQ8U,WAAWC,KAC5B8D,QAAQ/D,WAAWD,QACtBgE,QAAQ/D,WAAWD,MAAQC,WAE/B,IAEO3G,OAAOoB,KAAKsJ,SAAS3D,KAAI,SAAUL,MACxC,OAAOgE,QAAQhE,KACjB,GACF,CAUA,SAASiE,yBAAyB7D,OAAQhD,IACxC,IAAI8G,UAAY9G,GAIhB,GAAIgD,OAAOoB,KAAKI,gBAAiB,CAC/B,IAAInB,UAAYiB,aAAatB,QACzB+D,oBAAsB/D,OAAOC,IAAI+D,sBAErCF,UAAY,WAGV,IAFA,IAAIhO,KAAO,GACPyL,KAAOlB,UAAYxI,UAAUnT,OAAS,EAAImT,UAAUnT,OAC/CK,EAAI,EAAGA,EAAIwc,KAAMxc,IACxB+Q,KAAK/Q,GAAKgf,oBAAoBhf,GAAG8S,UAAU9S,IAM7C,OAJIsb,YACFvK,KAAKyL,MAAQ1J,UAAU0J,MAAMtB,IAAI8D,oBAAoBxC,QAGhDvE,GAAGlC,MAAM3X,KAAM2S,KACxB,CACF,CAEA,IAAImO,aAAeH,UACnB,GAAIxC,aAAatB,QAAS,CACxB,IAAIkE,OAASlE,OAAOtb,OAAS,EAE7Buf,aAAe,WACb,OAAOH,UAAUhJ,MAAM3X,KACnBoK,MAAMsK,UAAW,EAAGqM,QAAQlD,OAAO,CAACzT,MAAMsK,UAAWqM,UAC3D,CACF,CAEA,OAAOD,YACT,CAQA,SAASD,qBAAqB9D,OAC5B,IAAIwB,MAAOC,MAAOwC,YAAaC,YAC3BxC,MAAQ,GACRnD,YAAc,GAUlB,OARAyB,MAAM1B,MAAM/D,SAAQ,SAAUyE,MACxBA,KAAKW,aACP+B,MAAM3Q,KAAK0N,eAAeO,KAAKW,WAAWD,MAAM7I,MAChD0H,YAAYxN,KAAKiO,KAAKW,WAAWF,SAErC,IAGQlB,YAAY/Z,QAClB,KAAK,EACH,OAAO,SAAoBc,KACzB,OAAOA,GACT,EAEF,KAAK,EAGH,OAFAkc,MAAQE,MAAM,GACduC,YAAc1F,YAAY,GACnB,SAAoBjZ,KACzB,OAAIkc,MAAMlc,KACD2e,YAAY3e,KAEdA,GACT,EAEF,KAAK,EAKH,OAJAkc,MAAQE,MAAM,GACdD,MAAQC,MAAM,GACduC,YAAc1F,YAAY,GAC1B2F,YAAc3F,YAAY,GACnB,SAAoBjZ,KACzB,OAAIkc,MAAMlc,KACD2e,YAAY3e,KAEjBmc,MAAMnc,KACD4e,YAAY5e,KAEdA,GACT,EAEF,QACE,OAAO,SAAoBA,KACzB,IAAK,IAAIT,EAAI,EAAGA,EAAI0Z,YAAY/Z,OAAQK,IACtC,GAAI6c,MAAM7c,GAAGS,KACX,OAAOiZ,YAAY1Z,GAAGS,KAG1B,OAAOA,GACT,EAEN,CAaA,SAAS6e,oBAAoB9E,YAC3B,IAAI+E,cAAgB,CAAC,EASrB,OARA/E,WAAW9E,SAAQ,SAAU6E,WACtBA,UAAUU,OAAOoB,KAAKI,iBACzB+C,YAAYjF,UAAUU,QAAQ,GAAMvF,SAAQ,SAAUuF,QACpDsE,cAAcvE,gBAAgBC,SAAWV,UAAUtC,EACrD,GAEJ,IAEOsH,aACT,CAoBA,SAASC,YAAYvE,OAAQwE,uBAC3B,SAASC,aAAazE,OAAQtF,MAAO8D,OACnC,GAAI9D,MAAQsF,OAAOtb,OAAQ,CACzB,IAIIggB,WAJAxE,MAAQF,OAAOtF,OACfiK,cAAgBH,sBACdtE,MAAM1B,MAAM+B,OAAO8B,aACnBnC,MAAM1B,MAGZ,GAAI0B,MAAMG,UAAW,CAGnB,IAAIO,WAAa+D,cAAcpE,OAAO8B,aACtCqC,WAAa9D,WAAWlc,OAASigB,cAAcjgB,OACzC,CAACkc,WAAY+D,eACb,CAACA,cAET,MAGED,WAAaC,cAAc1E,KAAI,SAAUf,MACvC,MAAO,CAACA,KACV,IAIF,OAAOsD,QAAQkC,YAAY,SAAUE,WACnC,OAAOH,aAAazE,OAAQtF,MAAQ,EAAG8D,MAAMwC,OAAO,CAAC4D,YACvD,GAEF,CAUE,MAAO,CAPcpG,MAAMyB,KAAI,SAAUf,KAAM2B,WAC7C,MAAO,CACLrC,MAAOU,KACPmB,UAAYQ,YAAcb,OAAOtb,OAAS,GAAM4c,aAAatB,QAEjE,IAIJ,CAEA,OAAOyE,aAAazE,OAAQ,EAAG,GACjC,CAQA,SAAS6E,qBAAqBnB,WAAYC,YAGxC,IAFA,IAAImB,GAAKxhB,KAAK2G,IAAIyZ,WAAW1D,OAAOtb,OAAQif,WAAW3D,OAAOtb,QAErDK,EAAI,EAAGA,EAAI+f,GAAI/f,IAItB,IAAKggB,WAHa5C,qBAAqBuB,WAAY3e,GAAG,GACpCod,qBAAqBwB,WAAY5e,GAAG,IAGpD,OAAO,EAIX,IAAIigB,KAAOtB,WAAW1D,OAAOtb,OACzBugB,KAAOtB,WAAW3D,OAAOtb,OACzBwgB,WAAa5D,aAAaoC,WAAW1D,QACrCmF,WAAa7D,aAAaqC,WAAW3D,QAEzC,OAAOkF,WACDC,WAAcH,OAASC,KAASA,MAAQD,KACxCG,WAAcH,MAAQC,KAAUD,OAASC,IACjD,CAYA,SAASG,oBAAoBxK,KAAM0J,eACjC,GAA0C,IAAtCpL,OAAOoB,KAAKgK,eAAe5f,OAC7B,MAAM,IAAIhB,YAAY,0BAIxB,IAAI2hB,iBAAmB,GACvBnM,OAAOoB,KAAKgK,eACPrE,KAAI,SAAUX,WACb,OAAO2B,eAAe3B,UAAWgF,cAAchF,WAAYf,MAAME,YACnE,IACC8B,OAAO+E,SACP7K,SAAQ,SAAU8K,iBAEjB,IAAIC,qBAAuB1G,YAAYuG,kBAAkB,SAAUja,GACjE,OAAOyZ,qBAAqBzZ,EAAGma,gBACjC,IACA,GAAIC,qBACF,MAAM,IAAIxG,UAAU,2BAChBe,gBAAgByF,qBAAqBxF,QAAU,UAC/CD,gBAAgBwF,gBAAgBvF,QAAU,MAGhDqF,iBAAiBpU,KAAKsU,gBACxB,IAGJ,IAAIhG,WAAaiD,QAAQ6C,kBAAkB,SAAUE,iBAGnD,OAFaA,gBAAkBhB,YAAYgB,gBAAgBvF,QAAQ,GAAS,IAE9DC,KAAI,SAAUD,QAC1B,MAAO,CACLA,OACAhD,GAAIuI,gBAAgBvI,GAExB,GACF,IAAGuD,OAAO+E,SAEV/F,WAAWkG,KAAKhC,mBAGhB,IAAIiC,IAAMnG,WAAW,IAAMA,WAAW,GAAGS,OAAOtb,QAAU,IAAM4c,aAAa/B,WAAW,GAAGS,QACvF2F,IAAMpG,WAAW,IAAMA,WAAW,GAAGS,OAAOtb,QAAU,IAAM4c,aAAa/B,WAAW,GAAGS,QACvF4F,IAAMrG,WAAW,IAAMA,WAAW,GAAGS,OAAOtb,QAAU,IAAM4c,aAAa/B,WAAW,GAAGS,QACvF6F,IAAMtG,WAAW,IAAMA,WAAW,GAAGS,OAAOtb,QAAU,IAAM4c,aAAa/B,WAAW,GAAGS,QACvF8F,IAAMvG,WAAW,IAAMA,WAAW,GAAGS,OAAOtb,QAAU,IAAM4c,aAAa/B,WAAW,GAAGS,QACvF+F,IAAMxG,WAAW,IAAMA,WAAW,GAAGS,OAAOtb,QAAU,IAAM4c,aAAa/B,WAAW,GAAGS,QACvFgG,MAAQN,KAAOC,KAAOC,KAAOC,KAAOC,KAAOC,IAG3CnE,MAAQrC,WAAWU,KAAI,SAAUX,WACnC,OAAOuC,aAAavC,UAAUU,OAChC,IAEIiG,OAASP,IAAMjE,YAAYlC,WAAW,GAAGS,OAAO,IAAMpC,MACtDsI,OAASP,IAAMlE,YAAYlC,WAAW,GAAGS,OAAO,IAAMpC,MACtDuI,OAASP,IAAMnE,YAAYlC,WAAW,GAAGS,OAAO,IAAMpC,MACtDwI,OAASP,IAAMpE,YAAYlC,WAAW,GAAGS,OAAO,IAAMpC,MACtDyI,OAASP,IAAMrE,YAAYlC,WAAW,GAAGS,OAAO,IAAMpC,MACtD0I,OAASP,IAAMtE,YAAYlC,WAAW,GAAGS,OAAO,IAAMpC,MAEtD2I,OAASb,IAAMjE,YAAYlC,WAAW,GAAGS,OAAO,IAAMpC,MACtD4I,OAASb,IAAMlE,YAAYlC,WAAW,GAAGS,OAAO,IAAMpC,MACtD6I,OAASb,IAAMnE,YAAYlC,WAAW,GAAGS,OAAO,IAAMpC,MACtD8I,OAASb,IAAMpE,YAAYlC,WAAW,GAAGS,OAAO,IAAMpC,MACtD+I,OAASb,IAAMrE,YAAYlC,WAAW,GAAGS,OAAO,IAAMpC,MACtDgJ,OAASb,IAAMtE,YAAYlC,WAAW,GAAGS,OAAO,IAAMpC,MAGtDiJ,IAAMtH,WAAWU,KAAI,SAASX,WAChC,OAAOuE,yBAAyBvE,UAAUU,OAAQV,UAAUtC,GAC9D,IAEI8J,IAAMpB,IAAMmB,IAAI,GAAKhJ,MACrBkJ,IAAMpB,IAAMkB,IAAI,GAAKhJ,MACrBmJ,IAAMpB,IAAMiB,IAAI,GAAKhJ,MACrBoJ,IAAMpB,IAAMgB,IAAI,GAAKhJ,MACrBqJ,IAAMpB,IAAMe,IAAI,GAAKhJ,MACrBsJ,IAAMpB,IAAMc,IAAI,GAAKhJ,MAErBuJ,KAAO1B,IAAMnG,WAAW,GAAGS,OAAOtb,QAAU,EAC5CsgB,KAAOW,IAAMpG,WAAW,GAAGS,OAAOtb,QAAU,EAC5CugB,KAAOW,IAAMrG,WAAW,GAAGS,OAAOtb,QAAU,EAC5C2iB,KAAOxB,IAAMtG,WAAW,GAAGS,OAAOtb,QAAU,EAC5C4iB,KAAOxB,IAAMvG,WAAW,GAAGS,OAAOtb,QAAU,EAC5C6iB,KAAOxB,IAAMxG,WAAW,GAAGS,OAAOtb,QAAU,EAG5C8iB,OAASxB,MAAQ,EAAI,EACrByB,KAAOlI,WAAW7a,OAClBgjB,QAAU,WAGZ,IAAK,IAAI3iB,EAAIyiB,OAAQziB,EAAI0iB,KAAM1iB,IAC7B,GAAI6c,MAAM7c,GAAG8S,WACX,OAAOgP,IAAI9hB,GAAG+V,MAAM3X,KAAM0U,WAI9B,MAAM8C,YAAYC,KAAM/C,UAAW0H,WACrC,EAIIvC,GAAK,SAASA,GAAG2K,KAAMC,MAGzB,OAAI/P,UAAUnT,SAAW0iB,MAAQnB,OAAO0B,OAASpB,OAAOqB,MAAgBd,IAAIhM,MAAMkC,GAAInF,WAClFA,UAAUnT,SAAWsgB,MAAQkB,OAAOyB,OAASnB,OAAOoB,MAAgBb,IAAIjM,MAAMkC,GAAInF,WAClFA,UAAUnT,SAAWugB,MAAQkB,OAAOwB,OAASlB,OAAOmB,MAAgBZ,IAAIlM,MAAMkC,GAAInF,WAClFA,UAAUnT,SAAW2iB,MAAQjB,OAAOuB,OAASjB,OAAOkB,MAAgBX,IAAInM,MAAMkC,GAAInF,WAClFA,UAAUnT,SAAW4iB,MAAQjB,OAAOsB,OAAShB,OAAOiB,MAAgBV,IAAIpM,MAAMkC,GAAInF,WAClFA,UAAUnT,SAAW6iB,MAAQjB,OAAOqB,OAASf,OAAOgB,MAAgBT,IAAIrM,MAAMkC,GAAInF,WAE/E6P,QAAQ5M,MAAMkC,GAAInF,UAC3B,EAGA,IACEqB,OAAO2O,eAAe7K,GAAI,OAAQ,CAACoC,MAAOxE,MAM5C,CAJA,MAAO6H,KAIP,CAKA,OAFAzF,GAAGuC,WAAa8E,oBAAoB9E,YAE7BvC,EACT,CAOA,SAASyD,UAAU7B,UACjB,OAA2C,IAApCL,MAAMG,OAAO3T,QAAQ6T,SAC9B,CAOA,SAASa,KAAK7V,KACZ,OAAOA,IAAI6V,MACb,CAOA,SAASe,SAAS5W,KAChB,QAASA,GACX,CAOA,SAAS0b,QAAQlG,OACf,OAAiB,OAAVA,KACT,CAOA,SAASiC,eAAgBnB,OACvB,OAA8B,IAAvBA,MAAM1B,MAAM9Z,MACrB,CAOA,SAASqd,QAAQlX,KACf,OAAOA,IAAI0C,MAAM,EAAG1C,IAAInG,OAAS,EACnC,CAOA,SAAS6c,KAAK1W,KACZ,OAAOA,IAAIA,IAAInG,OAAS,EAC1B,CASA,SAAS6I,MAAM1C,IAAKid,MAAOC,KACzB,OAAO/J,MAAM5Y,UAAUmI,MAAMgM,KAAK1O,IAAKid,MAAOC,IAChD,CAQA,SAASC,SAAS9G,MAAO+G,MACvB,OAAgC,IAAzB/G,MAAMnW,QAAQkd,KACvB,CAQA,SAASlD,WAAWmD,OAAQC,QAC1B,IAAK,IAAIpjB,EAAI,EAAGA,EAAImjB,OAAOxjB,OAAQK,IACjC,GAAIijB,SAASG,OAAQD,OAAOnjB,IAC1B,OAAO,EAIX,OAAO,CACT,CASA,SAAS+Z,YAAYjU,IAAKkM,MACxB,IAAK,IAAIhS,EAAI,EAAGA,EAAI8F,IAAInG,OAAQK,IAC9B,GAAIgS,KAAKlM,IAAI9F,IACX,OAAO8F,IAAI9F,EAIjB,CAOA,SAASwd,KAAK1X,KAEZ,IADA,IAAIud,QAAU,CAAC,EACNrjB,EAAI,EAAGA,EAAI8F,IAAInG,OAAQK,IAC9BqjB,QAAQvd,IAAI9F,KAAM,EAEpB,OAAOmU,OAAOoB,KAAK8N,QACrB,CASA,SAAS5F,QAAQ3X,IAAKiS,UACpB,OAAOkB,MAAM5Y,UAAU4b,OAAOlG,MAAM,GAAIjQ,IAAIoV,IAAInD,UAClD,CAOA,SAASuL,QAASxB,KAGhB,IAFA,IAAIjM,KAAO,GAEF7V,EAAI,EAAGA,EAAI8hB,IAAIniB,OAAQK,IAAK,CACnC,IAAIiY,GAAK6J,IAAI9hB,GAGb,IAA8B,iBAAlBiY,GAAGuC,YAAmD,iBAAjBvC,GAAGsC,YAAuC,KAAZtC,GAAGpC,KAChF,GAAa,KAATA,KACFA,KAAOoC,GAAGpC,UAEP,GAAIA,OAASoC,GAAGpC,KAAM,CACzB,IAAI6H,IAAM,IAAIvY,MAAM,0CAA4C0Q,KAAO,aAAeoC,GAAGpC,KAAO,KAKhG,MAJA6H,IAAInF,KAAO,CACT0F,OAAQhG,GAAGpC,KACX8H,SAAU9H,MAEN6H,GACR,CAEJ,CAEA,OAAO7H,IACT,CAGA,SAAS0N,kBAAkBzB,KACzB,IAAIpE,IACA6B,cAAgB,CAAC,EAErB,SAASiE,eAAeC,WAAYC,KAClC,GAAInE,cAActL,eAAewP,aAAeC,MAAQnE,cAAckE,YAGpE,MAFA/F,IAAM,IAAIvY,MAAM,cAAgBse,WAAa,uBACzClL,KAAO,CAACgC,UAAWkJ,YACjB/F,GAGV,CAEA,IAAK,IAAI1d,EAAI,EAAGA,EAAI8hB,IAAIniB,OAAQK,IAAK,CACnC,IAAIiY,GAAK6J,IAAI9hB,GAGb,GAA6B,iBAAlBiY,GAAGuC,WAEZ,IAAK,IAAID,aAAatC,GAAGuC,WACnBvC,GAAGuC,WAAWvG,eAAesG,aAC/BiJ,eAAejJ,UAAWtC,GAAGuC,WAAWD,YACxCgF,cAAchF,WAAatC,GAAGuC,WAAWD,gBAI1C,IAA4B,iBAAjBtC,GAAGsC,UAOjB,MAFAmD,IAAM,IAAIzD,UAAU,yCAA2Cja,EAAI,MAC/DuY,KAAO,CAAC5C,MAAO3V,GACb0d,IANN8F,eAAevL,GAAGsC,UAAWtC,IAC7BsH,cAActH,GAAGsC,WAAatC,EAMhC,CACF,CAEA,OAAOsH,aACT,CAmEA,OAjEA/F,MAAQ6G,oBAAoB,QAAS,CACnC,iBAAkBA,oBAClB,OAAU,SAAUd,eAElB,IAAIuC,IAAM,GACV,IAAK,IAAIvH,aAAagF,cAChBA,cAActL,eAAesG,YAC/BuH,IAAI5V,KAAKqT,cAAchF,YAI3B,OAAO8F,oBADIiD,QAAQxB,KACcvC,cACnC,EACA,cAAe,SAAUuC,KACvB,OAAOzB,oBAAoBiD,QAAQxB,KAAMyB,kBAAkBzB,KAC7D,EACA,sBAAuB,SAAUjM,KAAMiM,KACrC,OAAOzB,oBAAoBxK,KAAM0N,kBAAkBzB,KACrD,KAGI/I,OAASA,OACfS,MAAMC,MAAQT,OACdQ,MAAME,YAAcH,aACpBC,MAAMG,OAASL,QACfE,MAAMoB,QAAUA,QAChBpB,MAAMc,KAAOA,KAUbd,MAAMmK,QAAU,SAAUxJ,KAAMyJ,kBAC9B,IAAKzJ,MAA6B,iBAAdA,KAAKtE,MAA0C,mBAAdsE,KAAKnI,KACxD,MAAM,IAAIiI,UAAU,kEAGtB,IAAyB,IAArB2J,iBACF,IAAK,IAAI5jB,EAAI,EAAGA,EAAIwZ,MAAMC,MAAM9Z,OAAQK,IACtC,GAA4B,WAAxBwZ,MAAMC,MAAMzZ,GAAG6V,KAEjB,YADA2D,MAAMC,MAAMoK,OAAO7jB,EAAG,EAAGma,MAM/BX,MAAMC,MAAMvN,KAAKiO,KACnB,EAGAX,MAAMsK,cAAgB,SAAUhJ,YAC9B,IAAKA,YAC6B,iBAApBA,WAAWD,MACO,iBAAlBC,WAAWC,IACY,mBAAvBD,WAAWF,QACvB,MAAM,IAAIX,UAAU,iFAGtBT,MAAME,YAAYxN,KAAK4O,WACzB,EAEOtB,KACT,CAEA,OAAOT,QACT,OAl2CsB,kPCXlBgL,yBAA2B,CAAC,EAGhC,SAASC,oBAAoBC,UAE5B,IAAIC,aAAeH,yBAAyBE,UAC5C,QAAqB1kB,IAAjB2kB,aACH,OAAOA,aAAalmB,QAGrB,IAAIC,OAAS8lB,yBAAyBE,UAAY,CAGjDjmB,QAAS,CAAC,GAOX,OAHAmmB,oBAAoBF,UAAUzP,KAAKvW,OAAOD,QAASC,OAAQA,OAAOD,QAASgmB,qBAGpE/lB,OAAOD,OACf,CCrBAgmB,oBAAoBzjB,EAAI,CAACvC,QAASomB,cACjC,IAAI,IAAI7P,OAAO6P,WACXJ,oBAAoBK,EAAED,WAAY7P,OAASyP,oBAAoBK,EAAErmB,QAASuW,MAC5EJ,OAAO2O,eAAe9kB,QAASuW,IAAK,CAAE+P,YAAY,EAAMC,IAAKH,WAAW7P,MAE1E,ECNDyP,oBAAoBK,EAAI,CAAC/R,IAAKkS,OAAUrQ,OAAO9T,UAAU4T,eAAeO,KAAKlC,IAAKkS,MCClFR,oBAAoBnjB,EAAK7C,UACH,oBAAXymB,QAA0BA,OAAOjgB,aAC1C2P,OAAO2O,eAAe9kB,QAASymB,OAAOjgB,YAAa,CAAE6V,MAAO,WAE7DlG,OAAO2O,eAAe9kB,QAAS,aAAc,CAAEqc,OAAO,GAAO,sDCLvD,IAAI,kBAQAqK,WAKAC,UAMAC,gBAIA,wmDAtBX,SAAWC,aACPA,YAAkB,KAAI,OACtBA,YAAmB,MAAI,QACvBA,YAAiB,IAAI,MACrBA,YAAoB,OAAI,SACxBA,YAAiB,IAAI,KACxB,CAND,CAMG,oBAAgB,kBAAc,CAAC,IAElC,SAAWH,YACPA,WAAsB,UAAI,YAC1BA,WAAqB,SAAI,UAC5B,CAHD,CAGGA,aAAeA,WAAa,CAAC,IAEhC,SAAWC,WACPA,UAA+B,oBAAI,sBACnCA,UAA6B,kBAAI,oBACjCA,UAAuB,YAAI,aAC9B,CAJD,CAIGA,YAAcA,UAAY,CAAC,IAE9B,SAAWC,iBACPA,gBAAgC,eAAI,gBACvC,CAFD,CAEGA,kBAAoBA,gBAAkB,CAAC,IAE1C,SAAWE,iBACPA,gBAAyB,QAAI,SAChC,CAFD,CAEG,wBAAoB,sBAAkB,CAAC,IC1B1C,MCAMC,yBAA2B,CAC7B,QAAS,KACT,SAAU,OAERC,UAAY,oCACZC,oBAAsB,CAAC,QAAS,SCFzBC,eAAiB,EAAGrP,KAAMsP,QAASC,UAAa,CACzDvP,KACAsP,QACAC,QCNJ,IAAIC,GAAK,EAIT,uBAAuBA,GCHjBC,kBAAqBC,SAAYA,QAAUA,QAAQ9K,MAD9B,KAC0D,GAgBxE+K,aAAe,CAACC,QAASF,QAASlL,SAC3C,MAAMqL,SAAWJ,kBAAkBC,SAUnC,OATAG,SAASC,QAAO,CAACC,YAAarR,IAAKsR,YACC,IAArBD,YAAYrR,OACnBqR,YAAYrR,KAAO,CAAC,GAEpBsR,MAAQH,SAAS/lB,OAAS,IAC1BimB,YAAYrR,KAAO8F,OAEhBuL,YAAYrR,OACpBkR,SACIA,OAAO,EAUL,qCAAmB,CAACK,QAASC,UACtC,MAAMC,iBAAmB,CAAC,EAa1B,OAZA7R,OAAOoB,KAAKuQ,SAASpQ,SAASnB,MAC1B,MAAM8F,MAAQyL,QAAQvR,KAChBgR,QAvCQ,EAAChR,IAAKwR,UACxB,MAAML,SAAWJ,kBAAkBS,QAAU,IAE7C,OADAL,SAASxZ,KAAKqI,KAHQ,CAACmR,UAAaA,SAAS/K,KAFtB,KAMhBsL,CAAkBP,SAAS,EAoCdQ,CAAc3R,IAAKwR,QACd,iBAAV1L,OAEPlG,OAAOC,OAAO4R,iBAAkB,qCAAiB3L,MAAOkL,UAEvC,mBAAVlL,QAEP2L,iBAAiBT,SAAWlL,MAChC,IAEG2L,gBAAgB,ECrC3B,uBAAgBG,WAAYC,KAAMC,eAAgBC,kBAAmBpnB,OACjE,MAAM,UAAW,MAAO,OAAQ,iBAAkB,oBAA0BknB,KAC5E,IAAIG,WAAY,EAChBrnB,IAAI,GAAGsnB,qCACP,MAAMC,kBAAqBC,YAChB,IAAI3V,QAWP,IAAI4V,cAVJznB,IAAI,GAAGsnB,sBAAsBE,qBAW7B,IACQE,OAAOC,SACPF,eAAgB,EAKxB,CAFA,MAAOpgB,GACHogB,eAAgB,CACpB,CAIA,GAHIA,eACAL,oBAEAC,UAAW,CACX,MAAMO,MAAQ,IAAI3hB,MAAM,kBAAkBuhB,iDAE1C,MADAI,MAAMC,KAAOpC,UAAUqC,oBACjBF,KACV,CACA,OAAO,IAAIG,SAAQ,CAACC,QAASC,UACzB,MAAM9B,GAAK+B,aACLC,mBAAsBC,QACxB,GAAIA,MAAMhT,SAAWsS,QACjBU,MAAM/O,KAAKgP,SAAW,yBACtBD,MAAM/O,KAAK8M,KAAOA,GAClB,OAEJ,GAAIiC,MAAME,SAAWC,mBAEjB,YADAvoB,IAAI,GAAGsnB,0CAA0Cc,MAAME,8CAA8CC,sBAGzG,MAAMC,aAAeJ,MAAM/O,KAC3BrZ,IAAI,GAAGsnB,uBAAuBE,sBAC9BiB,MAAMC,oBAAoB,8BAAyBP,oBACnD,IAAIQ,YAAcH,aAAaG,YAC3BH,aAAaI,qBACbD,YHtDQ,CAACvV,MAC7B,MAAMyV,kBAAoB,IAAI5iB,MAG9B,OADAgP,OAAOoB,KAAKjD,KAAKoD,SAASnB,KAASwT,kBAAkBxT,KAAOjC,IAAIiC,OACzDwT,iBAAiB,EGkDUC,CAAiBH,eAElCH,aAAaO,aAAevD,WAAWwD,UAAYhB,QAAUC,QAAQU,YAAY,EAEtFF,MAAMQ,iBAAiB,8BAAyBd,oBAChD,MAAMe,YAAc,CAChBb,OAAQ,uBACRlC,GACAqB,WACA3V,MAEJ6V,OAAOyB,YAAYD,YAAaE,iBAAiB,GACnD,EAIJtC,iBAAmBK,eAAeV,QAAO,CAAC4C,IAAK1S,QACjD0S,IAAI1S,MAAQ4Q,kBAAkB5Q,MACvB0S,MACR,CAAC,GAIJ,OADApU,OAAOC,OAAO+R,WD3BgB,CAACH,mBAC/B,MAAMF,QAAU,CAAC,EACjB,IAAK,MAAMP,WAAWS,iBAClBR,aAAaM,QAASP,QAASS,iBAAiBT,UAEpD,OAAOO,OAAO,ECsBY0C,CAAmBxC,mBACtC,KACHO,WAAY,CAAI,CAEvB,ECtFD,yBAAgBkC,kBAAmBC,YAAaJ,iBAAkBK,WAAYzpB,OAC1E,MAAM,QAAS,WAAgBypB,WAC/B,IAAIC,oBACAC,oBAKJ,MAAM1C,WAAa,CAAC,EACpB,OAAQmB,QACJ,GAAIA,MAAME,SAAWkB,YAEjB,YADAxpB,IAAI,wDAAwDooB,MAAME,8CAA8CkB,eAGpHxpB,IAAI,oCACJ,MAAMknB,KAAO,CACTI,UAAW,SACXmB,MAAOmB,OACPlC,OAAQU,MAAMhT,OACdgU,iBACAb,mBAAoBiB,aAIpBE,qBACAA,sBAEJA,oBC1BR,EAAgBxC,KAAMqC,kBAAmBvpB,OACrC,MAAM,UAAW,MAAO,OAAQ,iBAAkB,oBAA0BknB,KAC5E,IAAIG,WAAY,EAChB,MAAMc,mBAAsBC,QACxB,GAAIA,MAAMhT,SAAWsS,QAAUU,MAAM/O,KAAKgP,SAAW,uBACjD,OAEJ,GAAID,MAAME,SAAWC,mBAEjB,YADAvoB,IAAI,GAAGsnB,0CAA0Cc,MAAME,8CAA8CC,sBAGzG,MAAMW,YAAcd,MAAM/O,MACpB,WAAY,KAAM,IAAS6P,YACjClpB,IAAI,GAAGsnB,uBAAuBE,qBAC9B,MAAMqC,qBAAwBd,YAClBJ,cAEJ,GADA3oB,IAAI,GAAGsnB,sBAAsBE,sBACzBH,UAOA,YADArnB,IAAI,GAAGsnB,6BAA6BE,kDAGxC,MAAMvB,QAAU,CACZoC,OAAQ,wBACRlC,GACA4C,WACAJ,aAEAI,aAAevD,WAAWsE,UAC1BnB,uBAAuB1iB,QACvBggB,QAAQ0C,YAAc3C,eAAe2C,aACrC1C,QAAQ2C,oBAAqB,GAEjC,IACIlB,OAAOyB,YAAYlD,QAASmD,iBAgBhC,CAdA,MAAO5K,KAGH,GAAIA,IAAI7H,OAAS+O,gBAAgBqE,eAAgB,CAC7C,MAAMC,kBAAoB,CACtB3B,OAAQ,wBACRlC,GACA4C,WAAYvD,WAAWsE,SACvBnB,YAAa3C,eAAexH,KAC5BoK,oBAAoB,GAExBlB,OAAOyB,YAAYa,kBAAmBZ,iBAC1C,CACA,MAAM5K,GACV,GAGR,IAAIuJ,SAASC,SAAYA,QAAQuB,kBAAkB/B,YAAY3Q,MAAM0S,kBAAmB1X,SAAQoY,KAAKJ,qBAAqBrE,WAAWwD,WAAYa,qBAAqBrE,WAAWsE,UAAU,EAG/L,OADArB,MAAMQ,iBAAiB,8BAAyBd,oBACzC,KACHd,WAAY,EACZoB,MAAMC,oBAAoB,8BAAyBP,mBAAmB,CAE7E,EDtC6B,CAAoBjB,KAAMqC,kBAAmBvpB,KACnEkqB,UAAUR,qBAGNC,qBACAA,oBAAoBnT,SAAS2T,4BAClBlD,WAAWkD,mBAAmB,IAG7CR,oBAAsBvB,MAAM/O,KAAK+Q,YACjC,MAAMC,kBAAoB,sBAAkBpD,WAAYC,KAAMyC,oBAAqBW,QAAStqB,KAE5F,OADAkqB,UAAUG,mBACHpD,UAAU,CAExB,EEjCD,eAAgBsD,UACZ,IAAI,OAAQ,QAAY,CAAC,EAAC,YAAa,QAAS,OAAU,GAAUA,QACpE,MAAMvqB,ICfV,CAAgBwqB,OAIL,IAAI3Y,QACH2Y,OACAC,QAAQzqB,IAAI,cAAe6R,KAC/B,EDQQ,CAAa2Y,OACnBf,WRhBV,EAAgBnC,UAAWtnB,OACvB,MAAM0qB,UAAY,GAClB,IAAIrD,WAAY,EAChB,MAAO,CACHiD,QAAQ1C,OACCP,YACDA,WAAY,EACZrnB,IAAI,GAAGsnB,oCACPoD,UAAUlU,SAASqC,WACfA,SAAS+O,MAAM,IAG3B,EACAsC,UAAUrR,UACNwO,UAAYxO,WAAa6R,UAAU1d,KAAK6L,SAC5C,EAEP,EQDsB,CAAiB,SAAU7Y,MACxC,UAAW,SAAcypB,WAC1BD,cEjBT,CAAgBmB,SACZ,IAAKA,OAAOC,MAAQD,OAAOE,OAAQ,CAC/B,MAAMjD,MAAQ,IAAI3hB,MAAM,oDAExB,MADA2hB,MAAMC,KAAOpC,UAAUqF,YACjBlD,KACV,CACH,EFYOmD,CAA6BJ,QAC7BnB,YPXR,CAAgBoB,MACZ,GAAIA,KAAO7E,oBAAoB3K,MAAM4P,QAAWJ,IAAIK,WAAWD,UAI3D,MAAO,OAKX,MAAME,SAAWC,SAASD,SACpBE,YAActF,UAAUuF,KAAKT,KACnC,IAAIU,SACAC,SACAC,KAiBJ,OAhBIJ,aAGAE,SAAWF,YAAY,GAAKA,YAAY,GAAKF,SAASI,SACtDC,SAAWH,YAAY,GACvBI,KAAOJ,YAAY,KAInBE,SAAWJ,SAASI,SACpBC,SAAWL,SAASK,SACpBC,KAAON,SAASM,MAKb,GAAGF,aAAaC,WADJC,MAAQA,OAAS3F,yBAAyByF,UAAY,IAAIE,OAAS,IAEzF,EOrBqBC,CAAiBd,OAAOC,MAK1C,MAAMxB,iBAAmC,SAAhBI,YAAyB,IAAMA,YAClDD,kBAAoB,qCAAiB3C,SACrC8E,iBGvBV,EAAgB1rB,IAAKupB,kBAAmBC,YAAaJ,mBACzChB,QACJ,GAAIA,MAAME,SAAWkB,YAEjB,YADAxpB,IAAI,wDAAwDooB,MAAME,8CAA8CkB,eAGpHxpB,IAAI,6DACJ,MAAM2rB,cAAgB,CAClBtD,OAAQ,yBACR+B,YAAanV,OAAOoB,KAAKkT,oBAE7BnB,MAAMhT,OAAO+T,YAAYwC,cAAevC,iBAAiB,EHYpCwC,CAAwB5rB,IAAKupB,kBAAmBC,YAAaJ,kBAChFyC,iBAAmBC,wBAAwBvC,kBAAmBC,YAAaJ,iBAAkBK,WAAYzpB,KACzG+rB,QAAU,IAAIhE,SAAQ,CAACC,QAASC,UAClC,MAAM+D,sBIzBd,EAAgBC,QAASpT,YACrB,IAAIqT,UAQJ,YAPgB7rB,IAAZ4rB,UACAC,UAAYtC,OAAOuC,YAAW,KAC1B,MAAMvE,MAAQ,IAAI3hB,MAAM,8BAA8BgmB,aACtDrE,MAAMC,KAAOpC,UAAU2G,kBACvBvT,SAAS+O,MAAM,GAChBqE,UAEA,KACHI,aAAaH,UAAU,CAE9B,EJaqC,CAAuBD,QAAS3B,SACxDgC,cAAiBlE,QACnB,GAAIA,MAAMhT,SAAWuV,OAAO4B,eAAkBnE,MAAM/O,KAGpD,GAAI+O,MAAM/O,KAAKgP,SAAW,sBAI1B,GAAID,MAAM/O,KAAKgP,SAAW,2BAA1B,CACI,MAAMpB,WAAa4E,iBAAiBzD,OAChCnB,aACA+E,wBACAhE,QAAQf,YAGhB,MAVIyE,iBAAiBtD,MAUrB,EAEJwB,OAAOX,iBAAiB,8BAAyBqD,eACjDtsB,IAAI,8BKvCZ,EAAgB2qB,OAAQlB,cACpB,MAAM,QAAS,WAAgBA,WACzB+C,2BAA6BC,aAAY,KACtC9B,OAAO+B,cACRC,cAAcH,4BACdlC,UACJ,GAhB6B,KAkBjCJ,WAAU,KACNyC,cAAcH,2BAA2B,GAEhD,EL6BOI,CAAqBjC,OAAQlB,YAC7BS,WAAWtC,QACPgC,OAAOlB,oBAAoB,8BAAyB4D,eAChD1E,OACAK,OAAOL,MACX,GACF,IAEN,MAAO,CACHmE,QACAzB,UAEIA,SACJ,EAEP,EMlDYuC,WAAa,CAAClC,OAA2BmC,cAClD,MAAMC,KAdwB,CAACD,aAE/B,IAAIC,KAAO,GAQX,OATsB,IAAI7S,OAAO,oDAEfpH,KAAKga,YACnBC,KAAOD,WACAA,WAAWhmB,QAAQ,gBAAkB,EAC5CimB,KAAOD,WAAWxa,QAAQ,cAAe,KACR,MAA1Bwa,WAAW/lB,QAAQ,KAC1BgmB,KAAO,GAAGD,eAEPC,IAAI,EAIEC,CAAmBF,YAC1BG,KAAO,4OAKuBF,4DAGfA,yIAEAA,oEAMrBpC,OAAOE,OAAS,OAEhB,IAAIqC,UAAsBvC,OAAOwC,cAC7BxC,OAAO4B,gBACPW,UAAYvC,OAAO4B,cAAcpB,UAErC+B,UAAUE,OACVF,UAAUG,MAAMJ,MAChBC,UAAUI,OAAO,EA6FrB,UAhEgB,CACZR,WACA/Q,OACAwR,cACAC,SAAW,kBAEX,MAAMC,iBAAmB,IAAID,WACvB7C,OAASQ,SAASuC,cAAc,UACtC/C,OAAOgD,aAAa,SAAU,KAC9BhD,OAAOgD,aAAa,QAAS,gBAC7BhD,OAAOgD,aAAa,QAAS,8BAC7BhD,OAAOgD,aAAa,cAAe,KACnChD,OAAOgD,aAAa,iBAAkB,UAEtC,MAAMC,cAAgB,KAClB,MAAMC,gBAAkB1C,SAAS2C,cAAcL,kBAC3CI,kBACAA,uBAAAA,gBAAiBE,YAAYpD,QAC7BkC,WAAWlC,OAAQmC,cAIC,aAAxB3B,SAAS6C,YAAqD,gBAAxB7C,SAAS6C,WAC/CJ,gBAEAzC,SAASlC,iBAAiB,oBAAoB,KAC1C2E,eAAe,IAGvBL,cACIU,eAAe,CAEXtD,OAGA/D,QAAS,CACLsH,eAAgBnS,OAAOoS,iBACvBC,aAAcrS,OAAOsS,eACrBC,eAAgBvS,OAAOwS,iBACvBC,qBAAsBzS,OAAO0S,8BAC7BC,oBAAqB3S,OAAO4S,6BAC5BC,yBAA0B7S,OAAO8S,kCACjCC,0BAA2B/S,OAAOgT,uBAClCC,wBAAyBjT,OAAOkT,0BAChCC,uBAAwBnT,OAAOoT,yBAC/BC,oBAAqBrT,OAAOsT,sBAC5BC,oBAAqBvT,OAAOwT,sBAC5BC,sBAAuBzT,OAAO0T,mBAC9BC,4BAA6B3T,OAAO4T,8BACpCC,yBAA0B7T,OAAO8T,2BACjCC,cAAe/T,OAAOgU,gBACtBC,uBAAwBjU,OAAOkU,yBAC/BC,uBAAwBnU,OAAOoU,yBAC/BC,aAAcrU,OAAOsU,eACrBC,iBAAkBvU,OAAOwU,0BACzBC,kBAAmBzU,OAAO0U,iBAC1BC,eAAgB3U,OAAO4U,iBACvBC,YAAa7U,OAAO8U,cACpBC,gBAAiB/U,OAAOgV,kBACxBC,yBAA0BjV,OAAOkV,8BAG5C,ECpIU,SAASjc,WAetB,OAdAA,SAAWC,OAAOC,QAAU,SAAUC,QACpC,IAAK,IAAIrU,EAAI,EAAGA,EAAI8S,UAAUnT,OAAQK,IAAK,CACzC,IAAIsU,OAASxB,UAAU9S,GAEvB,IAAK,IAAIuU,OAAOD,OACVH,OAAO9T,UAAU4T,eAAeO,KAAKF,OAAQC,OAC/CF,OAAOE,KAAOD,OAAOC,KAG3B,CAEA,OAAOF,MACT,EAEOH,SAAS6B,MAAM3X,KAAM0U,UAC9B,CCHO,SAASsd,SAAS9xB,GACvB,MAAoB,iBAANA,CAChB,CACO,SAAS+xB,YAAY/xB,GAC1B,SAAKA,GAAkB,iBAANA,GAA2C,mBAAlBA,EAAE8H,gBAItB,IAAlB9H,EAAE+xB,aAA2D,iBAA5B/xB,EAAE8H,YAAY/F,YAAkE,IAAxC/B,EAAE8H,YAAY/F,UAAUgwB,aAI9D,mBAA5B/xB,EAAE8H,YAAYjC,YAA2D,IAA/B7F,EAAE8H,YAAYjC,UAAU7F,GAK/E,CACO,SAASgyB,UAAUhyB,GACxB,OAAOA,GAAkB,iBAANA,IAAyD,IAAvC6V,OAAOoc,eAAejyB,GAAGgyB,YAAsB,CACtF,CACO,SAASE,WAAWlyB,GACzB,OAAOA,GAAkB,iBAANA,IAA0D,IAAxC6V,OAAOoc,eAAejyB,GAAGkyB,aAAuB,CACvF,CACO,SAASC,OAAOnyB,GACrB,OAAOA,IAAwC,IAAnCA,EAAE8H,YAAY/F,UAAUowB,SAAmB,CACzD,CACO,SAAS,YAASnyB,GACvB,MAAoB,iBAANA,CAChB,CACO,IAAI4a,QAAUD,MAAMC,QACpB,SAAS,YAAS5a,GACvB,OAAOA,IAA0C,IAArCA,EAAE8H,YAAY/F,UAAUqwB,WAAqB,CAC3D,CAOO,SAAS,gBAAapyB,GAC3B,OAAO2a,MAAMC,QAAQ5a,IAAM,YAASA,EACtC,CACO,SAASqyB,cAAcryB,GAC5B,OAAOA,GAAKA,EAAEqyB,gBAAsD,IAArCryB,EAAE8H,YAAY/F,UAAUqwB,WAAqB,CAC9E,CACO,SAASE,eAAetyB,GAC7B,OAAOA,GAAKA,EAAEsyB,iBAAuD,IAArCtyB,EAAE8H,YAAY/F,UAAUqwB,WAAqB,CAC/E,CACO,SAASG,QAAQvyB,GACtB,OAAOA,IAAyC,IAApCA,EAAE8H,YAAY/F,UAAUwwB,UAAoB,CAC1D,CACO,SAASC,QAAQxyB,GACtB,OAAOA,IAAyC,IAApCA,EAAE8H,YAAY/F,UAAUywB,UAAoB,CAC1D,CACO,SAASC,UAAUzyB,GACxB,MAAoB,kBAANA,CAChB,CACO,SAAS0yB,YAAY1yB,GAC1B,OAAOA,IAA6C,IAAxCA,EAAE8H,YAAY/F,UAAU2wB,cAAwB,CAC9D,CACO,SAASC,OAAO3yB,GACrB,OAAOA,IAAwC,IAAnCA,EAAE8H,YAAY/F,UAAU4wB,SAAmB,CACzD,CACO,SAASC,WAAW5yB,GACzB,MAAoB,mBAANA,CAChB,CACO,SAAS6yB,OAAO7yB,GACrB,OAAOA,aAAa6a,IACtB,CACO,SAASiY,SAAS9yB,GACvB,OAAOA,aAAa8a,MACtB,CACO,SAASiY,SAAS/yB,GACvB,SAAUA,GAAkB,iBAANA,GAAkBA,EAAE8H,cAAgB+N,QAAWmc,UAAUhyB,IAAOkyB,WAAWlyB,GACnG,CACO,SAASgzB,OAAOhzB,GACrB,OAAa,OAANA,CACT,CACO,SAASizB,YAAYjzB,GAC1B,YAAaiB,IAANjB,CACT,CACO,SAASkzB,eAAelzB,GAC7B,OAAOA,IAA0B,IAArBA,EAAEkzB,iBAA8D,IAAnClzB,EAAE8H,YAAY/F,UAAUoxB,SAAmB,CACtF,CACO,SAASC,YAAYpzB,GAC1B,OAAOA,IAAuB,IAAlBA,EAAEozB,cAA2D,IAAnCpzB,EAAE8H,YAAY/F,UAAUoxB,SAAmB,CACnF,CACO,SAASE,iBAAiBrzB,GAC/B,OAAOA,IAA4B,IAAvBA,EAAEqzB,mBAAgE,IAAnCrzB,EAAE8H,YAAY/F,UAAUoxB,SAAmB,CACxF,CACO,SAASG,YAAYtzB,GAC1B,OAAOA,IAAuB,IAAlBA,EAAEszB,cAA2D,IAAnCtzB,EAAE8H,YAAY/F,UAAUoxB,SAAmB,CACnF,CACO,SAASI,kBAAkBvzB,GAChC,OAAOA,IAA6B,IAAxBA,EAAEuzB,oBAAiE,IAAnCvzB,EAAE8H,YAAY/F,UAAUoxB,SAAmB,CACzF,CACO,SAASK,eAAexzB,GAC7B,OAAOA,IAA0B,IAArBA,EAAEwzB,iBAA8D,IAAnCxzB,EAAE8H,YAAY/F,UAAUoxB,SAAmB,CACtF,CACO,SAASM,yBAAyBzzB,GACvC,OAAOA,IAAoC,IAA/BA,EAAEyzB,2BAAwE,IAAnCzzB,EAAE8H,YAAY/F,UAAUoxB,SAAmB,CAChG,CACO,SAASO,eAAe1zB,GAC7B,OAAOA,IAA0B,IAArBA,EAAE0zB,iBAA8D,IAAnC1zB,EAAE8H,YAAY/F,UAAUoxB,SAAmB,CACtF,CACO,SAASQ,YAAY3zB,GAC1B,OAAOA,IAAuB,IAAlBA,EAAE2zB,cAA2D,IAAnC3zB,EAAE8H,YAAY/F,UAAUoxB,SAAmB,CACnF,CACO,SAASA,OAAOnzB,GACrB,OAAOA,IAAkB,IAAbA,EAAEmzB,SAAsD,IAAnCnzB,EAAE8H,YAAY/F,UAAUoxB,SAAmB,CAC9E,CACO,SAASS,aAAa5zB,GAC3B,OAAOA,IAAwB,IAAnBA,EAAE4zB,eAA4D,IAAnC5zB,EAAE8H,YAAY/F,UAAUoxB,SAAmB,CACpF,CACO,SAASU,eAAe7zB,GAC7B,OAAOA,IAA0B,IAArBA,EAAE6zB,iBAA8D,IAAnC7zB,EAAE8H,YAAY/F,UAAUoxB,SAAmB,CACtF,CACO,SAASW,kBAAkB9zB,GAChC,OAAOA,IAA6B,IAAxBA,EAAE8zB,oBAAiE,IAAnC9zB,EAAE8H,YAAY/F,UAAUoxB,SAAmB,CACzF,CACO,SAASY,YAAY/zB,GAC1B,OAAOA,IAAuB,IAAlBA,EAAE+zB,cAA2D,IAAnC/zB,EAAE8H,YAAY/F,UAAUoxB,SAAmB,CACnF,CACO,SAASa,aAAah0B,GAC3B,OAAOA,IAAwB,IAAnBA,EAAEg0B,eAA4D,IAAnCh0B,EAAE8H,YAAY/F,UAAUoxB,SAAmB,CACpF,CACO,SAASc,QAAQj0B,GACtB,OAAOA,IAAyC,IAApCA,EAAE8H,YAAY/F,UAAUkyB,UAAoB,CAC1D,CACO,SAAS,UAAOj0B,GACrB,IAAIgC,SAAWhC,EAEf,MAAU,WAANgC,EAEQ,OAANhC,EAAmB,OACnB2a,MAAMC,QAAQ5a,GAAW,QACzBA,aAAa6a,KAAa,OAC1B7a,aAAa8a,OAAe,SAE5BiX,YAAY/xB,GAAW,YACvBgyB,UAAUhyB,GAAW,UACrBkyB,WAAWlyB,GAAW,WACtB,YAASA,GAAW,SACpBmyB,OAAOnyB,GAAW,OAClBwyB,QAAQxyB,GAAW,QACnBuyB,QAAQvyB,GAAW,QACnB0yB,YAAY1yB,GAAW,YACvBmzB,OAAOnzB,GAAWA,EAAE6b,KACpBoY,QAAQj0B,GAAW,QACnB2yB,OAAO3yB,GAAW,OACf,SAGC,aAANgC,EAAyB,WACtBA,CACT,CC5JO,SAAS+S,MAAM/U,GACpB,IAAI6b,YAAc7b,EAElB,GAAa,WAAT6b,MAA8B,WAATA,MAA8B,YAATA,MAA1CA,MAAgE7b,EAClE,OAAOA,EAIT,GAAuB,mBAAZA,EAAE+U,MACX,OAAO/U,EAAE+U,QAIX,GAAI4F,MAAMC,QAAQ5a,GAChB,OAAOA,EAAE4c,KAAI,SAAUb,OACrB,OAAOhH,MAAMgH,MACf,IAGF,GAAI/b,aAAa6a,KAAM,OAAO,IAAIA,KAAK7a,EAAEyQ,WACzC,GAAIshB,YAAY/xB,GAAI,OAAOA,EAE3B,GAAIA,aAAa8a,OAAQ,MAAM,IAAIa,UAAU,gBAAkB3b,GAG/D,OAAOk0B,UAAUl0B,EAAG+U,MACtB,CAQO,SAASmf,UAAUC,OAAQ1a,UAChC,IAAI1E,MAAQ,CAAC,EAEb,IAAK,IAAIkB,OAAOke,OACV,sBAAeA,OAAQle,OACzBlB,MAAMkB,KAAOwD,SAAS0a,OAAOle,OAIjC,OAAOlB,KACT,CAQO,SAASqf,OAAO7zB,EAAGC,GACxB,IAAK,IAAI0lB,QAAQ1lB,EACX,sBAAeA,EAAG0lB,QACpB3lB,EAAE2lB,MAAQ1lB,EAAE0lB,OAIhB,OAAO3lB,CACT,CAQO,SAAS8zB,WAAW9zB,EAAGC,GAE5B,GAAIma,MAAMC,QAAQpa,GAChB,MAAM,IAAImb,UAAU,0CAGtB,IAAK,IAAIuK,QAAQ1lB,EAGf,GAAI,sBAAeA,EAAG0lB,SAAWA,QAAQrQ,OAAO9T,cAAgBmkB,QAAQoO,SAASvyB,WAC/E,GAAIvB,EAAE0lB,OAAS1lB,EAAE0lB,MAAMpe,cAAgB+N,YACrB5U,IAAZV,EAAE2lB,QACJ3lB,EAAE2lB,MAAQ,CAAC,GAGT3lB,EAAE2lB,OAAS3lB,EAAE2lB,MAAMpe,cAAgB+N,OACrCwe,WAAW9zB,EAAE2lB,MAAO1lB,EAAE0lB,OAEtB3lB,EAAE2lB,MAAQ1lB,EAAE0lB,UAET,IAAIvL,MAAMC,QAAQpa,EAAE0lB,OACzB,MAAM,IAAIvK,UAAU,0CAEpBpb,EAAE2lB,MAAQ1lB,EAAE0lB,KACd,CAIJ,OAAO3lB,CACT,CASO,SAASg0B,gBAAgBh0B,EAAGC,GACjC,IAAI0lB,KAAMxkB,EAAGuH,IAEb,GAAI0R,MAAMC,QAAQra,GAAI,CACpB,IAAKoa,MAAMC,QAAQpa,GACjB,OAAO,EAGT,GAAID,EAAEc,SAAWb,EAAEa,OACjB,OAAO,EAGT,IAAKK,EAAI,EAAGuH,IAAM1I,EAAEc,OAAQK,EAAIuH,IAAKvH,IACnC,IAAK6yB,gBAAgBh0B,EAAEmB,GAAIlB,EAAEkB,IAC3B,OAAO,EAIX,OAAO,CACT,CAAO,GAAiB,mBAANnB,EAChB,OAAOA,IAAMC,EACR,GAAID,aAAasV,OAAQ,CAC9B,GAAI8E,MAAMC,QAAQpa,MAAQA,aAAaqV,QACrC,OAAO,EAGT,IAAKqQ,QAAQ3lB,EAEX,KAAM2lB,QAAQ1lB,KAAO+zB,gBAAgBh0B,EAAE2lB,MAAO1lB,EAAE0lB,OAC9C,OAAO,EAIX,IAAKA,QAAQ1lB,EAEX,KAAM0lB,QAAQ3lB,GACZ,OAAO,EAIX,OAAO,CACT,CACE,OAAOA,IAAMC,CAEjB,CAOO,SAASg0B,YAAYC,cAC1B,IAAIC,gBAAkB,CAAC,EAIvB,OAFAC,aAAaF,aAAcC,iBAEpBA,eACT,CAEA,SAASC,aAAaF,aAAcC,iBAClC,IAAK,IAAIxO,QAAQuO,aACf,GAAI,sBAAeA,aAAcvO,MAAO,CACtC,IAAInK,MAAQ0Y,aAAavO,MAEJ,iBAAVnK,OAAgC,OAAVA,MAC/B4Y,aAAa5Y,MAAO2Y,iBAEpBA,gBAAgBxO,MAAQnK,KAE5B,CAEJ,CA8BO,SAAS6Y,KAAKT,OAAQjO,KAAM2O,eACjC,IAEIC,OAFAC,gBAAiB,EAIrBlf,OAAO2O,eAAe2P,OAAQjO,KAAM,CAClCD,IAAK,WAMH,OALI8O,iBACFD,OAASD,gBACTE,gBAAiB,GAGZD,MACT,EACApf,IAAK,SAAaqG,OAChB+Y,OAAS/Y,MACTgZ,gBAAiB,CACnB,EACAC,cAAc,EACdhP,YAAY,GAEhB,CAoCO,SAAS,sBAAemO,OAAQc,UACrC,OAAOd,QAAUte,OAAOF,eAAeO,KAAKie,OAAQc,SACtD,CA6HO,SAASC,OAAOf,QACrB,OAAOte,OAAOoB,KAAKkd,QAAQvX,KAAI3G,KAAOke,OAAOle,MAC/C,2CC3XO,SAAS,gBAAQsB,KAAM4d,aAAc1a,OAAQ2a,MAClD,SAASC,gBAAgBC,OAIvB,IAAIC,KDsWD,SAAqBpB,OAAQqB,YAGlC,IAFA,IAAI1gB,KAAO,CAAC,EAEHpT,EAAI,EAAGA,EAAI8zB,WAAWn0B,OAAQK,IAAK,CAC1C,IAAIuU,IAAMuf,WAAW9zB,GACjBqa,MAAQoY,OAAOle,UAELhV,IAAV8a,QACFjH,KAAKmB,KAAO8F,MAEhB,CAEA,OAAOjH,IACT,CCnXe2gB,CAAYH,MAAOH,aAAavY,IAAI8Y,wBAE/C,OAqFG,SAA4Bne,KAAM4d,aAAcG,OAIrD,IAHiBH,aAAajY,QAAOyY,aAShC,SAA8BA,YACnC,OAAOA,YAAgC,MAAlBA,WAAW,EAClC,CAXsDC,CAAqBD,cACxEE,OAAMF,iBAAoC10B,IAAtBq0B,MAAMK,cAEV,CACf,IAAIG,oBAAsBX,aAAajY,QAAOyY,iBAAoC10B,IAAtBq0B,MAAMK,cAElE,MAAM,IAAI9uB,MAAM,2BAA4B8W,OAAOpG,KAAM,OAAU,kCAAkCoG,OAAOmY,oBAAoBlZ,KAAI3a,GAAK,IAAK0b,OAAO1b,EAAG,OAAOoa,KAAK,MAAO,KAC7K,CACF,CA/FI0Z,CAAmBxe,KAAM4d,aAAcG,OAChC7a,OAAO8a,KAChB,CAUA,OARAF,gBAAgBW,WAAY,EAC5BX,gBAAgB1b,GAAKpC,KACrB8d,gBAAgBF,aAAeA,aAAajrB,QAAQkY,OAEhDgT,OACFC,gBAAgBD,KAAOA,MAGlBC,eACT,CA4DO,SAASW,UAAUhiB,KACxB,MAAsB,mBAARA,KAAwC,iBAAXA,IAAI2F,IAAmBgB,MAAMC,QAAQ5G,IAAImhB,aACtF,CAwBO,SAASO,sBAAsBC,YACpC,OAAOA,YAAgC,MAAlBA,WAAW,GAAaA,WAAWzrB,MAAM,GAAKyrB,UACrE,CC3HO,SAASlpB,UAAUsP,OACxB,MAAqB,kBAAVA,SAIJ5a,SAAS4a,QAASA,QAAU9b,KAAK+D,MAAM+X,MAChD,CAOO,IAAIlK,KAAsB5R,KAAK4R,MAAQ,SAAU7R,GACtD,OAAIA,EAAI,EACC,EACEA,EAAI,GACL,EAED,CAEX,EAOiCC,KAAKyU,KASJzU,KAAK0U,MASL1U,KAAKg2B,MAaNh2B,KAAK0J,KA4BJ1J,KAAKyC,MAWvC,SAASwzB,mBAAmBrsB,EAAGqD,KAAMipB,MACnC,IAKI1O,OALW,CACb,EAAG,KACH,EAAG,KACH,GAAI,MAEgBva,MAClBkpB,OAAS,GAEb,GAAID,KAAM,CACR,GAAIA,KAAO,EACT,MAAM,IAAItvB,MAAM,kCAGlB,IAAK4F,UAAU0pB,MACb,MAAM,IAAItvB,MAAM,2BAGlB,GAAIgD,EAAI,IAAMssB,KAAO,GAAK,GAAKtsB,IAAM,IAAMssB,KAAO,IAChD,MAAM,IAAItvB,MAAM,8BAA8B8W,OAAOwY,KAAO,EAAG,QAAQxY,OAAOwY,KAAO,EAAG,QAG1F,IAAK1pB,UAAU5C,GACb,MAAM,IAAIhD,MAAM,4BAGdgD,EAAI,IACNA,GAAQ,GAAKssB,MAGfC,OAAS,IAAIzY,OAAOwY,KACtB,CAEA,IAAItkB,KAAO,GAOX,OALIhI,EAAI,IACNA,GAAKA,EACLgI,KAAO,KAGF,GAAG8L,OAAO9L,MAAM8L,OAAO8J,QAAQ9J,OAAO9T,EAAET,SAAS8D,OAAOyQ,OAAOyY,OACxE,CAuFO,SAASC,OAAOta,MAAOoP,SAC5B,GAAuB,mBAAZA,QAET,OAAOA,QAAQpP,OAIjB,GAAIA,QAAU9Y,IACZ,MAAO,WACF,GAAI8Y,SAAW9Y,IACpB,MAAO,YACF,GAAIrB,MAAMma,OACf,MAAO,MAIT,IACInX,UACA0xB,SAFAC,SAAW,OAIf,GAAIpL,UAEEA,QAAQoL,WACVA,SAAWpL,QAAQoL,UAIjBzE,SAAS3G,SACXvmB,UAAYumB,QACH2G,SAAS3G,QAAQvmB,aAC1BA,UAAYumB,QAAQvmB,WAGlBumB,QAAQmL,UAGc,iBAFxBA,SAAWnL,QAAQmL,WAGjB,MAAM,IAAIzvB,MAAM,sCAMtB,OAAQ0vB,UACN,IAAK,QACH,OAAOnnB,QAAQ2M,MAAOnX,WAExB,IAAK,cACH,OAAOqF,cAAc8R,MAAOnX,WAE9B,IAAK,cACH,OAsEC,SAAuBmX,MAAOnX,WACnC,GAAIhD,MAAMma,SAAW5a,SAAS4a,OAC5B,OAAO/I,OAAO+I,OAGhB,IACIya,QAAUC,YADFC,YAAY3a,OACSnX,WAC7BqD,EAAIuuB,QAAQG,SACZh1B,EAAI60B,QAAQI,aAEZC,OAAS5uB,EAAI,GAAM,EAAIA,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAIA,EAAI,EAE/D,GAAI6pB,SAASltB,WAEX,KAAOA,UAAYjD,EAAEN,QAAU4G,EAAI4uB,OAAS,EAAIl1B,EAAEN,QAChDM,EAAEiM,KAAK,QAOT,IAFA,IAAIkpB,aAAe72B,KAAKS,IAAIuH,EAAI4uB,SAAWl1B,EAAEN,OAAS,GAE7CK,EAAI,EAAGA,EAAIo1B,aAAcp1B,IAChCC,EAAEiM,KAAK,GAKX,IAAImpB,QAAU92B,KAAKS,IAAIuH,EAAI4uB,QACvBG,WAAa,EAEjB,KAAOD,QAAU,GACfC,aACAD,UAKF,IAAIE,SAAWt1B,EAAEuI,MAAM8sB,YAAY3a,KAAK,IACpC6a,WAAapF,SAASltB,YAAcqyB,SAAS51B,QAAU41B,SAAS11B,MAAM,SAAW,IAAM01B,SAAW,GAClG1wB,IAAM5E,EAAEuI,MAAM,EAAG8sB,YAAY3a,KAAK,IAAM6a,WAAa,KAAOjvB,GAAK,EAAI,IAAM,IAAM4uB,OAAOztB,WAC5F,OAAOotB,QAAQ3kB,KAAOtL,GACxB,CAhHa4wB,CAAcpb,MAAOnX,WAE9B,IAAK,MACH,OAAOsxB,mBAAmBna,MAAO,EAAGua,UAEtC,IAAK,MACH,OAAOJ,mBAAmBna,MAAO,EAAGua,UAEtC,IAAK,MACH,OAAOJ,mBAAmBna,MAAO,GAAIua,UAEvC,IAAK,OAEH,OA+KC,SAAqBva,MAAOnX,UAAWumB,SAC5C,GAAIvpB,MAAMma,SAAW5a,SAAS4a,OAC5B,OAAO/I,OAAO+I,OAIhB,IAAIqb,SAAWjM,cAAgClqB,IAArBkqB,QAAQiM,SAAyBjM,QAAQiM,UAAY,EAC3EC,SAAWlM,cAAgClqB,IAArBkqB,QAAQkM,SAAyBlM,QAAQkM,SAAW,EAC1Elb,MAAQua,YAAY3a,OACpBya,QAAU5xB,UAAY6xB,YAAYta,MAAOvX,WAAauX,MAE1D,GAAIqa,QAAQG,SAAWS,UAAYZ,QAAQG,UAAYU,SAErD,OAAOptB,cAAc8R,MAAOnX,WAE5B,IAAIjD,EAAI60B,QAAQI,aACZ3uB,EAAIuuB,QAAQG,SAEZh1B,EAAEN,OAASuD,YACbjD,EAAIA,EAAEgc,OAAO2Z,MAAM1yB,UAAYjD,EAAEN,UAKnCM,EAAIA,EAAEgc,OAAO2Z,MAAMrvB,EAAItG,EAAEN,OAAS,GAAKM,EAAEN,OAASuD,UAAYA,UAAYjD,EAAEN,OAAS,KAGrF,IAAIk2B,IAAMtvB,EAAI,EAAIA,EAAI,EAMtB,OAJIsvB,KAHJ51B,EAAI21B,OAAOrvB,GAAG0V,OAAOhc,IAGTN,OAAS,GACnBM,EAAE4jB,OAAOgS,IAAM,EAAG,EAAG,KAGhBf,QAAQ3kB,KAAOlQ,EAAE0a,KAAK,GAEjC,CAlNajM,CAAY2L,MAAOnX,UAAWumB,SAAWA,SAASjY,QAAQ,uBAAuB,WACtF,IAAInB,OAASyC,UAAU,GACnBvM,EAAIuM,UAAU,GAClB,MAAkB,MAAXzC,OAAiBA,OAAS9J,EAAIA,CACvC,IAEF,QACE,MAAM,IAAIpB,MAAM,qBAAuB0vB,SAAvB,oEAEtB,CAQO,SAASG,YAAY3a,OAE1B,IAAIxa,MAAQyR,OAAO+I,OAAOpI,cAAcpS,MAAM,mCAE9C,IAAKA,MACH,MAAM,IAAIlB,YAAY,kBAAoB0b,OAG5C,IAAIlK,KAAOtQ,MAAM,GACbwQ,OAASxQ,MAAM,GACfo1B,SAAW90B,WAAWN,MAAM,IAAM,KAClCg2B,IAAMxlB,OAAOrK,QAAQ,KACzBivB,WAAqB,IAATY,IAAaA,IAAM,EAAIxlB,OAAO1Q,OAAS,EACnD,IAAIu1B,aAAe7kB,OAAOmB,QAAQ,IAAK,IACtCA,QAAQ,OAAO,SAAUokB,OAGxB,OADAX,UAAYW,MAAMj2B,OACX,EACT,IAAG6R,QAAQ,MAAO,IACjBiJ,MAAM,IAAIS,KAAI,SAAU3a,GACvB,OAAO6V,SAAS7V,EAClB,IAOA,OAL4B,IAAxB20B,aAAav1B,SACfu1B,aAAahpB,KAAK,GAClB+oB,YAGK,CACL9kB,KACA+kB,aACAD,SAEJ,CAyDO,SAASvnB,QAAQ2M,MAAOnX,WAC7B,GAAIhD,MAAMma,SAAW5a,SAAS4a,OAC5B,OAAO/I,OAAO+I,OAGhB,IAAIyb,WAAad,YAAY3a,OACzBya,QAA+B,iBAAd5xB,UAAyB6xB,YAAYe,WAAYA,WAAWb,SAAW,EAAI/xB,WAAa4yB,WACzG71B,EAAI60B,QAAQI,aACZnjB,EAAI+iB,QAAQG,SAAW,EAGvBc,GAAKhkB,GAAK7O,WAAa,GAiB3B,OAfIjD,EAAEN,OAASo2B,KACb91B,EAAIA,EAAEgc,OAAO2Z,MAAMG,GAAK91B,EAAEN,UAIxBoS,EAAI,IACN9R,EAAI21B,MAAW,EAAJ7jB,GAAOkK,OAAOhc,GACzB8R,EAAI,GAIFA,EAAI9R,EAAEN,QACRM,EAAE4jB,OAAO9R,EAAG,EAAS,IAANA,EAAU,KAAO,KAG3B+iB,QAAQ3kB,KAAOlQ,EAAE0a,KAAK,GAC/B,CASO,SAASpS,cAAc8R,MAAOnX,WACnC,GAAIhD,MAAMma,SAAW5a,SAAS4a,OAC5B,OAAO/I,OAAO+I,OAIhB,IAAII,MAAQua,YAAY3a,OACpBya,QAAU5xB,UAAY6xB,YAAYta,MAAOvX,WAAauX,MACtDxa,EAAI60B,QAAQI,aACZ3uB,EAAIuuB,QAAQG,SAEZh1B,EAAEN,OAASuD,YACbjD,EAAIA,EAAEgc,OAAO2Z,MAAM1yB,UAAYjD,EAAEN,UAInC,IAAIq2B,MAAQ/1B,EAAEmM,QACd,OAAO0oB,QAAQ3kB,KAAO6lB,OAAS/1B,EAAEN,OAAS,EAAI,IAAMM,EAAE0a,KAAK,IAAM,IAAM,KAAOpU,GAAK,EAAI,IAAM,IAAMA,CACrG,CAyDO,SAASwuB,YAAYta,MAAOvX,WASjC,IAPA,IAAI4xB,QAAU,CACZ3kB,KAAMsK,MAAMtK,KACZ+kB,aAAcza,MAAMya,aACpBD,SAAUxa,MAAMwa,UAEdh1B,EAAI60B,QAAQI,aAEThyB,WAAa,GAClBjD,EAAE2M,QAAQ,GACVkoB,QAAQG,WACR/xB,YAGF,GAAIjD,EAAEN,OAASuD,WACCjD,EAAE4jB,OAAO3gB,UAAWjD,EAAEN,OAASuD,WAEjC,IAAM,EAAG,CACnB,IAAIlD,EAAIkD,UAAY,EAGpB,IAFAjD,EAAED,KAEc,KAATC,EAAED,IACPC,EAAEkM,MAEQ,IAANnM,IACFC,EAAE2M,QAAQ,GACVkoB,QAAQG,WACRj1B,KAIFC,IADAD,IAGJ,CAGF,OAAO80B,OACT,CAOA,SAASc,MAAMj2B,QAGb,IAFA,IAAImG,IAAM,GAED9F,EAAI,EAAGA,EAAIL,OAAQK,IAC1B8F,IAAIoG,KAAK,GAGX,OAAOpG,GACT,CAuBO,IAAImwB,YAAcz2B,OAAO02B,SAAW,qBAWpC,SAAS,mBAAY53B,EAAG8C,EAAG+0B,SAEhC,GAAIA,cACF,OAAO73B,IAAM8C,EAGf,GAAI9C,IAAM8C,EACR,OAAO,EAIT,GAAIlB,MAAM5B,IAAM4B,MAAMkB,GACpB,OAAO,EAIT,GAAI3B,SAASnB,IAAMmB,SAAS2B,GAAI,CAE9B,IAAIg1B,KAAO73B,KAAKS,IAAIV,EAAI8C,GAExB,OAAIg1B,KAAOH,aAIFG,MAAQ73B,KAAK2G,IAAI3G,KAAKS,IAAIV,GAAIC,KAAKS,IAAIoC,IAAM+0B,OAExD,CAGA,OAAO,CACT,CAOmB53B,KAAK2D,MAGL3D,KAAK0D,MASL1D,KAAKyD,MASNzD,KAAKF,KASLE,KAAKE,KASLF,KAAKwL,KCnqBvB,SAASssB,sBAAsBluB,EAAGqD,KAAMipB,MACtC,IACI6B,KAAO,IAAIC,EADKpuB,EAAE/B,aACO,GACzBsuB,OAAS,GAEb,GAAID,KAAM,CACR,GAAIA,KAAO,EACT,MAAM,IAAItvB,MAAM,kCAGlB,IAAK4F,UAAU0pB,MACb,MAAM,IAAItvB,MAAM,2BAGlB,GAAIgD,EAAEe,YAAYotB,KAAK91B,IAAIi0B,KAAO,GAAG1oB,IAAI,KAAO5D,EAAEiD,SAASkrB,KAAK91B,IAAIi0B,KAAO,GAAGtnB,KAAK,IACjF,MAAM,IAAIhI,MAAM,8BAA8B8W,OAAOwY,KAAO,EAAG,QAAQxY,OAAOwY,KAAO,EAAG,QAG1F,IAAKtsB,EAAE4C,YACL,MAAM,IAAI5F,MAAM,4BAGdgD,EAAEiD,SAAS,KACbjD,EAAIA,EAAEuE,IAAI4pB,KAAK91B,IAAIi0B,QAGrBC,OAAS,IAAIzY,OAAOwY,KACtB,CAEA,OAAQjpB,MACN,KAAK,EACH,MAAO,GAAGyQ,OAAO9T,EAAEkF,YAAY4O,OAAOyY,QAExC,KAAK,EACH,MAAO,GAAGzY,OAAO9T,EAAEmG,WAAW2N,OAAOyY,QAEvC,KAAK,GACH,MAAO,GAAGzY,OAAO9T,EAAE+F,iBAAiB+N,OAAOyY,QAE7C,QACE,MAAM,IAAIvvB,MAAM,QAAQ8W,OAAOzQ,KAAM,oBAE3C,CAoFO,SAAS,iBAAO6O,MAAOoP,SAC5B,GAAuB,mBAAZA,QAET,OAAOA,QAAQpP,OAIjB,IAAKA,MAAM5a,WACT,OAAO4a,MAAMna,QAAU,MAAQma,MAAM1T,GAAG,GAAK,WAAa,YAI5D,IACIzD,UACA0xB,SAFAC,SAAW,OAIf,QAAgBt1B,IAAZkqB,UAEEA,QAAQoL,WACVA,SAAWpL,QAAQoL,UAIE,iBAAZpL,QACTvmB,UAAYumB,QACHA,QAAQvmB,YACjBA,UAAYumB,QAAQvmB,WAGlBumB,QAAQmL,UAGc,iBAFxBA,SAAWnL,QAAQmL,WAGjB,MAAM,IAAIzvB,MAAM,sCAMtB,OAAQ0vB,UACN,IAAK,QACH,OA6FC,SAAiBxa,MAAOnX,WAC7B,OAAOmX,MAAM3M,QAAQxK,UACvB,CA/Fa,CAAQmX,MAAOnX,WAExB,IAAK,cACH,OAAO,wBAAcmX,MAAOnX,WAE9B,IAAK,cACH,OAkDC,SAAuBmX,MAAOnX,WAEnC,IAAIqD,EAAI8T,MAAM9T,EACV4uB,OAAS5uB,EAAI,GAAM,EAAIA,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAIA,EAAI,EAE3DiwB,gBAAkBnc,MAAMlN,IAAI5O,KAAKiC,IAAI,IAAK20B,SAC1CsB,SAAWD,gBAAgB9nB,YAAYxL,YAEZ,IAA3BuzB,SAASzwB,QAAQ,OACnBywB,SAAWD,gBAAgB9uB,YAG7B,OAAO+uB,SAAW,KAAOlwB,GAAK,EAAI,IAAM,IAAM4uB,OAAOztB,UACvD,CA/Da,CAAc2S,MAAOnX,WAE9B,IAAK,MACH,OAAOmzB,sBAAsBhc,MAAO,EAAGua,UAEzC,IAAK,MACH,OAAOyB,sBAAsBhc,MAAO,EAAGua,UAEzC,IAAK,MACH,OAAOyB,sBAAsBhc,MAAO,GAAIua,UAE1C,IAAK,OAID,IAAIc,SAAWjM,cAAgClqB,IAArBkqB,QAAQiM,SAAyBjM,QAAQiM,UAAY,EAC3EC,SAAWlM,cAAgClqB,IAArBkqB,QAAQkM,SAAyBlM,QAAQkM,SAAW,EAE9E,GAAItb,MAAM7S,SAAU,MAAO,IAG3B,IAAIstB,QAAUza,MAAM1L,oBAAoBzL,WACpC1E,IAAMs2B,QAAQvuB,EAWlB,OATI/H,KAAOk3B,UAAYl3B,IAAMm3B,SAErBb,QAAQpnB,UAGR,wBAAc2M,MAAOnX,YAIlBsO,QAAQ,uBAAuB,WACxC,IAAInB,OAASyC,UAAU,GACnBvM,EAAIuM,UAAU,GAClB,MAAkB,MAAXzC,OAAiBA,OAAS9J,EAAIA,CACvC,IAGJ,QACE,MAAM,IAAIpB,MAAM,qBAAuB0vB,SAAvB,oEAEtB,CA8BO,SAAS,wBAAcxa,MAAOnX,WACnC,YAAkB3D,IAAd2D,UACKmX,MAAM9R,cAAcrF,UAAY,GAEhCmX,MAAM9R,eAEjB,CC5PO,SAASmuB,SAASC,KAAMllB,QAC7B,IAAIsR,MAAQ4T,KAAKh3B,OAAS8R,OAAO9R,OAC7BqjB,IAAM2T,KAAKh3B,OACf,OAAOg3B,KAAKjlB,UAAUqR,MAAOC,OAASvR,MACxC,CAqCO,SAAS,cAAO4I,MAAOoP,SAC5B,MAAqB,iBAAVpP,MACFsa,OAAata,MAAOoP,SAGzB4G,YAAYhW,OACP,iBAAgBA,MAAOoP,SA+HlC,SAA2BpP,OACzB,OAAOA,OAA0B,iBAAVA,OAAyC,iBAAZA,MAAMhU,GAAqC,iBAAZgU,MAAMlS,GAAqC,iBAAZkS,MAAM9Z,IAAkB,CAC5I,CA5HMq2B,CAAkBvc,OACfoP,SAAgC,YAArBA,QAAQoN,SAKfxc,MAAM3S,WAHN2S,MAAMhU,EAAIgU,MAAMlS,EAAI,IAAMkS,MAAM9Z,EAOvC0Y,MAAMC,QAAQmB,OACTyc,YAAYzc,MAAOoP,SAGxB,YAASpP,OACJ,IAAMA,MAAQ,IAGF,mBAAVA,MACFA,MAAM0c,OAASzlB,OAAO+I,MAAM0c,QAAU,WAG3C1c,OAA0B,iBAAVA,MACU,mBAAjBA,MAAMsa,OACRta,MAAMsa,OAAOlL,SACXpP,OAASA,MAAM3S,SAAS+hB,WAAa,CAAC,EAAE/hB,WAE1C2S,MAAM3S,SAAS+hB,SAKf,IAHOtV,OAAOoB,KAAK8E,OAAOa,KAAI3G,KAC5B,IAAMA,IAAM,MAAQ,cAAO8F,MAAM9F,KAAMkV,WAE3B9O,KAAK,MAAQ,IAI/BrJ,OAAO+I,MAChB,CAQO,SAAS2c,UAAU3c,OAKxB,IAJA,IAAIsc,KAAOrlB,OAAO+I,OACd4c,QAAU,GACVj3B,EAAI,EAEDA,EAAI22B,KAAKh3B,QAAQ,CACtB,IAAIM,EAAI02B,KAAK1wB,OAAOjG,GAEV,OAANC,GACFg3B,SAAWh3B,EACXD,IAGU,MAFVC,EAAI02B,KAAK1wB,OAAOjG,MAE6B,IAA7B,aAAagG,QAAQ/F,KACnCg3B,SAAW,MAGbA,SAAWh3B,GAEXg3B,SADe,MAANh3B,EACE,MAEAA,EAGbD,GACF,CAEA,MAAO,IAAMi3B,QAAU,GACzB,CAOO,SAAS,cAAO5c,OACrB,IAAIsc,KAAOrlB,OAAO+I,OAElB,OADAsc,KAAOA,KAAKnlB,QAAQ,KAAM,SAASA,QAAQ,KAAM,UAAUA,QAAQ,KAAM,SAASA,QAAQ,KAAM,QAAQA,QAAQ,KAAM,OAExH,CAYA,SAASslB,YAAY3a,MAAOsN,SAC1B,GAAIxQ,MAAMC,QAAQiD,OAAQ,CAIxB,IAHA,IAAItX,IAAM,IACN0C,IAAM4U,MAAMxc,OAEPK,EAAI,EAAGA,EAAIuH,IAAKvH,IACb,IAANA,IACF6E,KAAO,MAGTA,KAAOiyB,YAAY3a,MAAMnc,GAAIypB,SAI/B,OADA5kB,KAAO,GAET,CACE,OAAO,cAAOsX,MAAOsN,QAEzB,CCtKO,SAASyN,eAAejZ,OAAQN,SAAUwZ,UAC/C,KAAM/4B,gBAAgB84B,gBACpB,MAAM,IAAIv4B,YAAY,oDAGxBP,KAAK6f,OAASA,OACd7f,KAAKuf,SAAWA,SAChBvf,KAAK+4B,SAAWA,SAChB/4B,KAAK+mB,QAAU,wBAA0BlM,MAAMC,QAAQ+E,QAAU,IAAMA,OAAOtD,KAAK,MAAQ,IAAMsD,QAAU,KAAO7f,KAAK+4B,UAAY,MAAQ,KAAOle,MAAMC,QAAQyE,UAAY,IAAMA,SAAShD,KAAK,MAAQ,IAAMgD,UAAY,IAC1Nvf,KAAKgnB,OAAQ,IAAIjgB,OAAQigB,KAC3B,CCTO,SAAS,sBAAWzP,MAAO1Q,IAAKC,KACrC,KAAM9G,gBAAgB,uBACpB,MAAM,IAAIO,YAAY,oDAGxBP,KAAKuX,MAAQA,MAET7C,UAAUnT,OAAS,GACrBvB,KAAK6G,IAAM,EACX7G,KAAK8G,IAAMD,MAEX7G,KAAK6G,IAAMA,IACX7G,KAAK8G,IAAMA,UAGI3F,IAAbnB,KAAK6G,KAAqB7G,KAAKuX,MAAQvX,KAAK6G,IAC9C7G,KAAK+mB,QAAU,uBAAyB/mB,KAAKuX,MAAQ,MAAQvX,KAAK6G,IAAM,SAClD1F,IAAbnB,KAAK8G,KAAqB9G,KAAKuX,OAASvX,KAAK8G,IACtD9G,KAAK+mB,QAAU,uBAAyB/mB,KAAKuX,MAAQ,OAASvX,KAAK8G,IAAM,GAAK,IAE9E9G,KAAK+mB,QAAU,uBAAyB/mB,KAAKuX,MAAQ,IAGvDvX,KAAKgnB,OAAQ,IAAIjgB,OAAQigB,KAC3B,CCrBO,SAAS,gBAAU9mB,GAGxB,IAFA,IAAI+H,EAAI,GAED4S,MAAMC,QAAQ5a,IACnB+H,EAAE6F,KAAK5N,EAAEqB,QACTrB,EAAIA,EAAE,GAGR,OAAO+H,CACT,CAWA,SAAS+wB,UAAUjb,MAAOsY,KAAM4C,KAC9B,IAAIr3B,EACAuH,IAAM4U,MAAMxc,OAEhB,GAAI4H,MAAQktB,KAAK4C,KACf,MAAM,IAAIH,eAAe3vB,IAAKktB,KAAK4C,MAGrC,GAAIA,IAAM5C,KAAK90B,OAAS,EAAG,CAEzB,IAAI23B,QAAUD,IAAM,EAEpB,IAAKr3B,EAAI,EAAGA,EAAIuH,IAAKvH,IAAK,CACxB,IAAIu3B,MAAQpb,MAAMnc,GAElB,IAAKiZ,MAAMC,QAAQqe,OACjB,MAAM,IAAIL,eAAezC,KAAK90B,OAAS,EAAG80B,KAAK90B,OAAQ,KAGzDy3B,UAAUjb,MAAMnc,GAAIy0B,KAAM6C,QAC5B,CACF,MAEE,IAAKt3B,EAAI,EAAGA,EAAIuH,IAAKvH,IACnB,GAAIiZ,MAAMC,QAAQiD,MAAMnc,IACtB,MAAM,IAAIk3B,eAAezC,KAAK90B,OAAS,EAAG80B,KAAK90B,OAAQ,IAI/D,CAUO,SAAS63B,SAASrb,MAAOsY,MAG9B,GAF+B,IAAhBA,KAAK90B,QAIlB,GAAIsZ,MAAMC,QAAQiD,OAChB,MAAM,IAAI+a,eAAe/a,MAAMxc,OAAQ,QAIzCy3B,UAAUjb,MAAOsY,KAAM,EAE3B,CAQO,SAASgD,cAAc9hB,MAAOhW,QACnC,IAAKywB,SAASza,SAAW5K,UAAU4K,OACjC,MAAM,IAAIsE,UAAU,oCAAsCtE,MAAQ,KAGpE,GAAIA,MAAQ,GAAuB,iBAAXhW,QAAuBgW,OAAShW,OACtD,MAAM,IAAI,sBAAWgW,MAAOhW,OAEhC,CAYO,SAAS+3B,OAAOvb,MAAOsY,KAAMkD,cAGlC,IAAK1e,MAAMC,QAAQiD,SAAWlD,MAAMC,QAAQub,MAC1C,MAAM,IAAIxa,UAAU,kBAGtB,GAAoB,IAAhBwa,KAAK90B,OACP,MAAM,IAAIwF,MAAM,uCAclB,OAVAsvB,KAAK/e,SAAQ,SAAU2E,OACrB,IAAK+V,SAAS/V,SAAWtP,UAAUsP,QAAUA,MAAQ,EACnD,MAAM,IAAIJ,UAAU,uDAA8D,cAAOwa,MAAQ,IAErG,IAIAmD,QAAQzb,MAAOsY,KAAM,OAFgBl1B,IAAjBo4B,aAA6BA,aAAe,GAIzDxb,KACT,CAWA,SAASyb,QAAQzb,MAAOsY,KAAM4C,IAAKM,cACjC,IAAI33B,EACA63B,KACAC,OAAS3b,MAAMxc,OACfo4B,OAAStD,KAAK4C,KACdW,OAASz5B,KAAK0G,IAAI6yB,OAAQC,QAI9B,GAFA5b,MAAMxc,OAASo4B,OAEXV,IAAM5C,KAAK90B,OAAS,EAAG,CAEzB,IAAI23B,QAAUD,IAAM,EAEpB,IAAKr3B,EAAI,EAAGA,EAAIg4B,OAAQh4B,IAEtB63B,KAAO1b,MAAMnc,GAERiZ,MAAMC,QAAQ2e,QACjBA,KAAO,CAACA,MAER1b,MAAMnc,GAAK63B,MAGbD,QAAQC,KAAMpD,KAAM6C,QAASK,cAI/B,IAAK33B,EAAIg4B,OAAQh4B,EAAI+3B,OAAQ/3B,IAE3B63B,KAAO,GACP1b,MAAMnc,GAAK63B,KAEXD,QAAQC,KAAMpD,KAAM6C,QAASK,aAEjC,KAAO,CAGL,IAAK33B,EAAI,EAAGA,EAAIg4B,OAAQh4B,IACtB,KAAOiZ,MAAMC,QAAQiD,MAAMnc,KACzBmc,MAAMnc,GAAKmc,MAAMnc,GAAG,GAKxB,IAAKA,EAAIg4B,OAAQh4B,EAAI+3B,OAAQ/3B,IAC3Bmc,MAAMnc,GAAK23B,YAEf,CACF,CAaO,SAASM,QAAQ9b,MAAO+b,OAC7B,IAAIC,UA+NC,SAAiBhc,OACtB,IAAKlD,MAAMC,QAAQiD,OAEjB,OAAOA,MAGT,IAAIic,KAAO,GAQX,OAPAjc,MAAMzG,SAAQ,SAASqC,SAASsC,OAC1BpB,MAAMC,QAAQmB,OAChBA,MAAM3E,QAAQqC,UAEdqgB,KAAKlsB,KAAKmO,MAEd,IACO+d,IACT,CA9OkBC,CAAQlc,OACpBmc,cAAgBH,UAAUx4B,OAE9B,IAAKsZ,MAAMC,QAAQiD,SAAWlD,MAAMC,QAAQgf,OAC1C,MAAM,IAAIje,UAAU,kBAGtB,GAAqB,IAAjBie,MAAMv4B,OACR,MAAM,IAAIu3B,eAAe,EAAGoB,cAAe,MAI7C,IAAIC,UAAYC,QADhBN,MAAQO,qBAAqBP,MAAOI,gBAGpC,GAAIA,gBAAkBC,UACpB,MAAM,IAAIrB,eAAeqB,UAAWD,cAAe,MAGrD,IACE,OA2DJ,SAAkBnc,MAAO+b,OAKvB,IAHA,IACIQ,UADAC,SAAWxc,MAGNyc,UAAYV,MAAMv4B,OAAS,EAAGi5B,UAAY,EAAGA,YAAa,CACjE,IAAInE,KAAOyD,MAAMU,WACjBF,UAAY,GAIZ,IAFA,IAAI/4B,OAASg5B,SAASh5B,OAAS80B,KAEtBz0B,EAAI,EAAGA,EAAIL,OAAQK,IAC1B04B,UAAUxsB,KAAKysB,SAASnwB,MAAMxI,EAAIy0B,MAAOz0B,EAAI,GAAKy0B,OAIpDkE,SAAWD,SACb,CAEA,OAAOC,QACT,CA/EWE,CAASV,UAAWD,MAO7B,CANE,MAAO3xB,GACP,GAAIA,aAAa2wB,eACf,MAAM,IAAIA,eAAeqB,UAAWD,cAAe,MAGrD,MAAM/xB,CACR,CACF,CASO,SAASkyB,qBAAqBP,MAAOI,eAC1C,IAAIC,UAAYC,QAAQN,OACpBY,eAAiBZ,MAAM1vB,QAEvBuwB,cAAgBb,MAAMlyB,SADX,GAIf,GAF4BkyB,MAAMlyB,SAFnB,EAEqC+yB,cAAgB,IAAM,EAGxE,MAAM,IAAI5zB,MAAM,mCAMlB,GAHkB4zB,eAAiB,EAGlB,CACf,KAHuBT,cAAgBC,WAAc,GAMnD,MAAM,IAAIpzB,MAAM,qCAAuCmzB,cAAgB,uBAAyBC,WAFhGO,eAAeC,gBAAkBT,cAAgBC,SAIrD,CAEA,OAAOO,cACT,CAOA,SAASN,QAAQrc,OACf,OAAOA,MAAMwJ,QAAO,CAACqT,KAAMC,OAASD,KAAOC,MAAM,EACnD,CAsGO,SAASC,UAAU/c,MAAOgd,KAAMC,MAAO3E,MAC5C,IAAIpuB,EAAIouB,MAAQ,gBAAUtY,OAE1B,GAAIid,MACF,IAAK,IAAIp5B,EAAI,EAAGA,EAAIo5B,MAAOp5B,IACzBmc,MAAQ,CAACA,OACT9V,EAAEuG,QAAQ,GAOd,IAFAuP,MAAQkd,WAAWld,MAAOgd,KAAM,GAEzB9yB,EAAE1G,OAASw5B,MAChB9yB,EAAE6F,KAAK,GAGT,OAAOiQ,KACT,CAUA,SAASkd,WAAWld,MAAOgd,KAAM9B,KAC/B,IAAIr3B,EAAG+f,GAEP,GAAI9G,MAAMC,QAAQiD,OAAQ,CACxB,IAAImd,KAAOjC,IAAM,EAEjB,IAAKr3B,EAAI,EAAG+f,GAAK5D,MAAMxc,OAAQK,EAAI+f,GAAI/f,IACrCmc,MAAMnc,GAAKq5B,WAAWld,MAAMnc,GAAIm5B,KAAMG,KAE1C,MACE,IAAK,IAAI/4B,EAAI82B,IAAK92B,EAAI44B,KAAM54B,IAC1B4b,MAAQ,CAACA,OAIb,OAAOA,KACT,CA+BO,SAASjB,IAAIiB,MAAOpE,UACzB,OAAOkB,MAAM5Y,UAAU6a,IAAI1G,KAAK2H,MAAOpE,SACzC,CAOO,SAASrC,QAAQyG,MAAOpE,UAC7BkB,MAAM5Y,UAAUqV,QAAQlB,KAAK2H,MAAOpE,SACtC,CAmCO,SAAS4C,KAAKwB,MAAOod,WAC1B,OAAOtgB,MAAM5Y,UAAUsa,KAAKnG,KAAK2H,MAAOod,UAC1C,CAuEO,SAASC,iBAAiBrd,MAAOsd,QAKtC,IAJA,IAAItf,KAEAxa,OAAS,EAEJK,EAAI,EAAGA,EAAImc,MAAMxc,OAAQK,IAAK,CACrC,IAAIkjB,KAAO/G,MAAMnc,GACbkZ,QAAUD,MAAMC,QAAQgK,MAO5B,GALU,IAANljB,GAAWkZ,UACbvZ,OAASujB,KAAKvjB,QAIZuZ,SAAWgK,KAAKvjB,SAAWA,OAC7B,OAGF,IAAI+5B,SAAWxgB,QAAUsgB,iBAAiBtW,KAAMuW,QAC9CA,OAAOvW,MAET,QAAa3jB,IAAT4a,KACFA,KAAOuf,cACF,GAAIvf,OAASuf,SAClB,MAAO,OAGX,CAEA,OAAOvf,IACT,CAwBO,SAAS,eAASgC,MAAO+G,MAC9B,OAAgC,IAAzB/G,MAAMnW,QAAQkd,KACvB,CC3mBO,SAASyW,eAAe1hB,GAAI2hB,MAAO30B,IAAKC,KAC7C,KAAM9G,gBAAgBu7B,gBACpB,MAAM,IAAIh7B,YAAY,oDAGxBP,KAAK6Z,GAAKA,GACV7Z,KAAKw7B,MAAQA,MACbx7B,KAAK6G,IAAMA,IACX7G,KAAK8G,IAAMA,IACX9G,KAAK+mB,QAAU,yCAA2ClN,GAAK,KAAO2hB,MAAQ,cAAgB30B,KAAOC,UAAoC,IAAMA,IAAM,IAAM,aAC3J9G,KAAKgnB,OAAQ,IAAIjgB,OAAQigB,KAC3B,CCfO,SAASyU,cAAcrgB,MAAOsgB,KAAMC,KAAMC,mBA4H/C,SAASC,QAAQpkB,KAAMwE,MAAOoP,SAuN9B,IAAmCxR,GAzMjC,GAZIwR,QAAQyQ,MAAyB,mBAAV7f,QAEzBA,MAkFJ,SAAepC,IACb,IAAIkiB,QAAU,WAGZ,IAFA,IAAIppB,KAAO,GAEF/Q,EAAI,EAAGuH,IAAMuL,UAAUnT,OAAQK,EAAIuH,IAAKvH,IAAK,CACpD,IAAIS,IAAMqS,UAAU9S,GACpB+Q,KAAK/Q,GAAKS,KAAOA,IAAIsO,SACvB,CAEA,OAAOkJ,GAAGlC,MAAMgkB,KAAMhpB,KACxB,EAEIkH,GAAGmiB,YACLD,QAAQC,UAAYniB,GAAGmiB,WAGzB,OAAOD,OACT,CAnGYE,CAAMhgB,QAoNK,mBADYpC,GA/MHoC,QAgN6B,iBAAjBpC,GAAGsC,YA/M3CF,MAAQb,MAAM3D,KAAM,CAClB,CAACwE,MAAME,WAAYF,SAInBigB,gBAAgBP,KAAKlkB,QAAUykB,gBAAgBjgB,OAiBjD,OAdEA,MAFEoP,QAAQ8Q,SAEF/gB,MAAM3D,KAAMwE,MAAMG,YAGlBhB,MAAMugB,KAAKlkB,MAAOwE,OAG5B0f,KAAKlkB,MAAQwE,aACN2f,kBAAkBnkB,MAEzB2kB,iBAAiB3kB,KAAMwE,YAEvB0f,KAAKzhB,KAAK,SAAUzC,MAAM,WACxB,OAAOwE,KACT,IAIF,QAAmB9a,IAAfw6B,KAAKlkB,OAAuB4T,QAAQ8Q,SAStC,OARAR,KAAKlkB,MAAQwE,aACN2f,kBAAkBnkB,MAEzB2kB,iBAAiB3kB,KAAMwE,YAEvB0f,KAAKzhB,KAAK,SAAUzC,MAAM,WACxB,OAAOwE,KACT,IAIF,IAAKoP,QAAQgR,OACX,MAAM,IAAIt1B,MAAM,kBAAoB0Q,KAAO,oBAE/C,CAEA,SAAS2kB,iBAAiB3kB,KAAMwE,OAC1BA,OAAoC,mBAApBA,MAAM+f,WACxBL,KAAKW,WAAWN,UAAUvkB,MAAQwE,MAAM+f,UAEpCO,qBAAqB9kB,QACvBkkB,KAAKW,WAAWE,kBAAkB/kB,MAAQwE,MAAM+f,oBAI3CL,KAAKW,WAAWN,UAAUvkB,MAE7B8kB,qBAAqB9kB,QACvBkkB,KAAKW,WAAWE,kBAAkB/kB,MAAQwE,OAGhD,CAEA,SAASwgB,iBAAiBhlB,aACjBkkB,KAAKW,WAAWN,UAAUvkB,MAE7B8kB,qBAAqB9kB,MACvBkkB,KAAKW,WAAWE,kBAAkB/kB,MAAQkkB,KAAKlkB,aAExCkkB,KAAKW,WAAWE,kBAAkB/kB,KAE7C,CAqCA,SAASilB,eAAe/8B,QAAS0rB,SAC/B,IAAI5T,KAAO/C,UAAUnT,OAAS,QAAsBJ,IAAjBuT,UAAU,GAAmBA,UAAU,GAAK/U,QAAQka,GAEvF,GAAI,eAASpC,KAAM,KACjB,MAAM,IAAI1Q,MAAM,wDAA+D41B,KAAK/D,UAAUnhB,OAGhG,IAAImlB,UAAYC,2BAA2Bl9B,SAAWg8B,KAAKW,WAAWN,UAAYL,KAC9EmB,kBAAqBrlB,QAAQkkB,KAAKW,WAAWN,UAC7Ce,SAAW,sBAAeH,UAAWnlB,MAAQmlB,UAAUnlB,WAAQtW,EAE/D67B,SAAW,WAEb,IAAI3H,aAAe,CAAC,EACpB11B,QAAQ01B,aAAavY,IAAI8Y,uBAAuBte,SAAQue,aACtD,GAAI,eAASA,WAAY,KACvB,MAAM,IAAI9uB,MAAM,8DAAqE41B,KAAK/D,UAAU/C,aAGnF,SAAfA,WACFR,aAAasG,KAAOA,KACI,sBAAf9F,WACTR,aAAamH,kBAAoBb,KAAKW,WAAWE,kBACzB,YAAf3G,WAETR,aAAa4H,QAAUtB,KAEvBtG,aAAaQ,YAAc8F,KAAK9F,WAClC,IAEF,IAAIqH,SAA0Bv9B,QAAQ01B,cAEtC,GAAI6H,UAA0C,mBAAvBA,SAASlB,UAC9B,MAAM,IAAIj1B,MAAM,yIAGlB,QAAiB5F,IAAb47B,UAA0B1R,QAAQ8Q,SACpC,OAAOe,SAGT,GAAIhB,gBAAgBa,WAAab,gBAAgBgB,UAE/C,OAAO9hB,MAAM2hB,SAAUG,UAGzB,GAAI7R,QAAQgR,OAEV,OAAOU,SAEP,MAAM,IAAIh2B,MAAM,kBAAoB0Q,KAAO,oBAE/C,EAGK9X,QAAQ21B,OAA8B,IAAtB31B,QAAQ21B,KAAKR,MAWhC8H,UAAUnlB,MAAQulB,WAEdD,UAAYD,kBACdL,iBAAiBhlB,OAEbolB,2BAA2Bl9B,UAAYw9B,4BAA4Bx9B,WACrEm1B,KAAK6G,KAAKW,WAAWE,kBAAmB/kB,MAAM,IAAMmlB,UAAUnlB,UAhBlEqd,KAAK8H,UAAWnlB,KAAMulB,UAElBD,UAAYD,kBACdL,iBAAiBhlB,OAEbolB,2BAA2Bl9B,UAAYw9B,4BAA4Bx9B,WACrEm1B,KAAK6G,KAAKW,WAAWE,kBAAmB/kB,MAAM,IAAMmlB,UAAUnlB,SAgBpEmkB,kBAAkBnkB,MAAQ9X,QAC1Bg8B,KAAKzhB,KAAK,SAAUzC,KAAMulB,SAC5B,CASA,SAASI,gBAAgB/I,QACvB,MAAyB,mBAAXA,QAA2C,iBAAXA,QAAyC,iBAAXA,QAAyC,kBAAXA,QAAmC,OAAXA,QAAmBhC,OAAOgC,SAAWnC,UAAUmC,SAAWpC,YAAYoC,SAAWjC,WAAWiC,SAAW,YAASA,SAAWxZ,MAAMC,QAAQuZ,OAC7Q,CAQA,SAAS6H,gBAAgBriB,IACvB,MAAqB,mBAAPA,IAA8C,iBAAlBA,GAAGuC,UAC/C,CAMA,SAASmgB,qBAAqB9kB,MAC5B,OAAQ,sBAAe4lB,OAAQ5lB,KACjC,CAEA,SAAS0lB,4BAA4Bx9B,SACnC,SAAoC,IAA7BA,QAAQka,GAAGjS,QAAQ,MACzB,sBAAey1B,OAAQ19B,QAAQka,KAASla,QAAQ21B,MAAS31B,QAAQ21B,KAAKgI,QACzE,CAEA,SAAST,2BAA2Bl9B,SAClC,YAAmBwB,IAAZxB,cAA0CwB,IAAjBxB,QAAQ21B,OAA2D,IAArC31B,QAAQ21B,KAAKiI,sBAAgC,CAC7G,CAGA,IAAIF,OAAS,CACXf,YAAY,EACZvgB,MAAM,EACNyhB,MAAM,EACN9U,OAAO,EACP+U,MAAM,EACNC,OAAO,GAGT,OAtTA,SAAoBC,UAAWtS,SAC7B,IAAI7d,IAAMkH,UAAUnT,OAEpB,GAAY,IAARiM,KAAqB,IAARA,IACf,MAAM,IAAI+tB,eAAe,SAAU/tB,IAAK,EAAG,GAO7C,SAASowB,eAAeC,WAAY5hB,MAAOxE,MACzC,GAAIoD,MAAMC,QAAQmB,OAChBA,MAAM3E,SAAQwN,MAAQ8Y,eAAeC,WAAY/Y,aAC5C,GAAqB,iBAAV7I,MAChB,IAAK,IAAIuD,SAASvD,MACZ,sBAAeA,MAAOuD,QACxBoe,eAAeC,WAAY5hB,MAAMuD,OAAQA,YAGxC,GAAI0W,UAAUja,aAAmB9a,IAATsW,KAAoB,CACjD,IAAIqmB,SAAW5H,UAAUja,OAAS4gB,2BAA2B5gB,OAASA,MAAMpC,GAAK,aAC/EoC,MAAMpC,GAAKpC,KAEb,GAAI,sBAAeomB,WAAYC,WAAaD,WAAWC,YAAc7hB,QAAUoP,QAAQgR,OACrF,MAAM,IAAIt1B,MAAM,kBAAoB+2B,SAAW,WAGjDD,WAAWC,UAAY7hB,KACzB,MACE,IAAKoP,QAAQgR,OACX,MAAM,IAAIxgB,UAAU,qCAG1B,CA3BKwP,UACHA,QAAU,CAAC,GA4Bb,IAAIwS,WAAa,CAAC,EAGlB,IAAK,IAAIpmB,QAFTmmB,eAAeC,WAAYF,WAEVE,WACf,GAAI,sBAAeA,WAAYpmB,MAAO,CAEpC,IAAIwE,MAAQ4hB,WAAWpmB,MAEvB,GAAIye,UAAUja,OAIZygB,eAAezgB,MAAOoP,cACjB,GAAI+R,gBAAgBnhB,OACzB4f,QAAQpkB,KAAMwE,MAAOoP,cAErB,IAAKA,QAAQgR,OACX,MAAM,IAAIxgB,UAAU,qCAG1B,CAEJ,CA6PF,CJhWAid,eAAe72B,UAAY,IAAI87B,WAC/BjF,eAAe72B,UAAU+F,YAAc+1B,WACvCjF,eAAe72B,UAAUwV,KAAO,iBAChCqhB,eAAe72B,UAAU+7B,kBAAmB,ECY5C,sBAAW/7B,UAAY,IAAI87B,WAC3B,sBAAW97B,UAAU+F,YAAc+1B,WACnC,sBAAW97B,UAAUwV,KAAO,aAC5B,sBAAWxV,UAAUg8B,cAAe,EEjBpC1C,eAAet5B,UAAY,IAAI8E,MAC/Bw0B,eAAet5B,UAAU+F,YAAcjB,MACvCw0B,eAAet5B,UAAUwV,KAAO,iBAChC8jB,eAAet5B,UAAUi8B,kBAAmB,EExBrC,IAAIC,eAAiB,CAG1BpG,QAAS,MAETqG,OAAQ,SAERC,OAAQ,SAERv5B,UAAW,GAKXw5B,aAAa,EAGbC,WAAY,MCfHC,eAAiB,CAAC,SAAU,SAE5BC,eAAiB,CAAC,SAAU,YAAa,YAE7C,SAASC,cAAczqB,OAAQiG,MA2CpC,SAASykB,QAAQtT,SACf,GAAIA,QAAS,CACX,IAAIuP,KAAOxG,UAAUngB,OAAQgB,OAE7B2pB,eAAevT,QAAS,SAAUmT,gBAClCI,eAAevT,QAAS,SAAUoT,gBAElClK,WAAWtgB,OAAQoX,SACnB,IAAIwP,KAAOzG,UAAUngB,OAAQgB,OACzB4pB,QAAUzK,UAAU/I,QAASpW,OAGjC,OADAiF,KAAK,SAAU2gB,KAAMD,KAAMiE,SACpBhE,IACT,CACE,OAAOzG,UAAUngB,OAAQgB,MAE7B,CAaA,OAVA0pB,QAAQH,eAAiBA,eACzBG,QAAQF,eAAiBA,eAEzB1oB,OAAOoB,KAAKgnB,gBAAgB7mB,SAAQnB,MAClCJ,OAAO2O,eAAeia,QAASxoB,IAAK,CAClCgQ,IAAK,IAAMlS,OAAOkC,KAClB+P,YAAY,EACZgP,cAAc,GACd,IAEGyJ,OACT,CAmBA,SAASC,eAAevT,QAAS5T,KAAM2d,QAXvC,IAAkBrX,MAAO+G,UAYD3jB,IAAlBkqB,QAAQ5T,QAZIsG,MAY6BqX,OAZtBtQ,KAY8BuG,QAAQ5T,OAX7B,IAAzBsG,MAAMnW,QAAQkd,QAanByG,QAAQuT,KAAK,2BAA6BzT,QAAQ5T,MAAQ,+BAAiCA,KAA9E,yBAAqH2d,OAAOtY,KAAIb,OAAS0gB,KAAK/D,UAAU3c,SAAQM,KAAK,MAAQ,IAE9L,CCtGO,IAAIwiB,SAAW,IAAIC,IAAI,CAAC,QCS/B,SAASC,gBAAgB5K,OAAQjO,MAE/B,GAAI8Y,cAAc7K,SAAW8K,eAAe9K,OAAQjO,MAClD,OAAOiO,OAAOjO,MAGhB,GAA4B,mBAAjBiO,OAAOjO,OAAwBgZ,aAAa/K,OAAQjO,MAC7D,MAAM,IAAIrf,MAAM,yBAA2Bqf,KAAO,mBAGpD,MAAM,IAAIrf,MAAM,0BAA4Bqf,KAAO,IACrD,CAaA,SAAS,wBAAgBiO,OAAQjO,KAAMnK,OAErC,GAAIijB,cAAc7K,SAAW8K,eAAe9K,OAAQjO,MAElD,OADAiO,OAAOjO,MAAQnK,MACRA,MAGT,MAAM,IAAIlV,MAAM,0BAA4Bqf,KAAO,IACrD,CAiBA,SAAS+Y,eAAe9K,OAAQjO,MAC9B,SAAKiO,QAA4B,iBAAXA,YAMlB,sBAAegL,qBAAsBjZ,SAMrCA,QAAQrQ,OAAO9T,cASfmkB,QAAQoO,SAASvyB,WAQvB,CAwBA,SAASm9B,aAAa/K,OAAQiL,QAC5B,OAAIjL,cAAqE,mBAAnBA,OAAOiL,YAOzD,sBAAejL,OAAQiL,SAAWvpB,OAAOoc,gBAAkBmN,UAAUvpB,OAAOoc,eAAekC,aAM3F,sBAAekL,kBAAmBD,WAMlCA,UAAUvpB,OAAO9T,cASjBq9B,UAAU9K,SAASvyB,YAQzB,CAEA,SAASi9B,cAAc7K,QACrB,MAAyB,iBAAXA,QAAuBA,QAAUA,OAAOrsB,cAAgB+N,MACxE,CAEA,IAAIspB,qBAAuB,CACzB99B,QAAQ,EACRkW,MAAM,GAEJ8nB,kBAAoB,CACtBj2B,UAAU,EACVqH,SAAS,EACT6uB,gBAAgB,GCxJX,MAAMC,kBACXz3B,YAAYqsB,QACVr0B,KAAK0/B,cAAgBrL,MACvB,CAEAld,OACE,OAAOpB,OAAOoB,KAAKnX,KAAK0/B,cAC1B,CAEAvZ,IAAIhQ,KACF,OAAO8oB,gBAAgBj/B,KAAK0/B,cAAevpB,IAC7C,CAEAP,IAAIO,IAAK8F,OAEP,OADA,wBAAgBjc,KAAK0/B,cAAevpB,IAAK8F,OAClCjc,IACT,CAEA2/B,IAAIxpB,KACF,ODkBqBke,OClBEr0B,KAAK0/B,cAAevpB,ODmB9Bke,OADjB,IAAyBA,MCjBvB,EASK,SAASuL,iBACd,OAAO,IAAIC,GACb,CAqDO,SAASC,MAAMzL,QAGpB,QAAKA,SAIEA,kBAAkBwL,KAAOxL,kBAAkBoL,mBAA2C,mBAAfpL,OAAOze,KAA4C,mBAAfye,OAAOlO,KAA6C,mBAAhBkO,OAAOld,MAA6C,mBAAfkd,OAAOsL,IACpM,CASO,SAAS,WAAO7iB,KACrB,IAAK,IAAIijB,KAAOrrB,UAAUnT,OAAQy+B,QAAU,IAAInlB,MAAMklB,KAAO,EAAIA,KAAO,EAAI,GAAIE,KAAO,EAAGA,KAAOF,KAAME,OACrGD,QAAQC,KAAO,GAAKvrB,UAAUurB,MAGhC,IAAK,IAAIttB,QAAQqtB,QACf,GAAKrtB,KAIL,GAAImtB,MAAMntB,MACR,IAAK,IAAIwD,OAAOxD,KAAKwE,OACnB2F,IAAIlH,IAAIO,IAAKxD,KAAKwT,IAAIhQ,WAEnB,GAAI8c,SAAStgB,MAClB,IAAK,IAAIutB,SAASnqB,OAAOoB,KAAKxE,MAC5BmK,IAAIlH,IAAIsqB,MAAOvtB,KAAKutB,QAK1B,OAAOpjB,GACT,CCjIA,ICAWqjB,iBAAmB,CAC5BC,WDCqC,gBAF5B,OACQ,CAAC,sBAC+C1pB,OACjE,IAAI,mBAEAA,KAKJ,SAAS2pB,OACP,KAAMrgC,gBAAgBqgC,MACpB,MAAM,IAAI9/B,YAAY,mDAE1B,CA6XA,OArXA8/B,KAAKp+B,UAAUq+B,SAAW,SAAU9K,OAClC,OAAOx1B,KAAKugC,UAAUD,SAAS9K,MACjC,EAEA6K,KAAKp+B,UAAU8Z,KAAO,OACtBskB,KAAKp+B,UAAUoxB,QAAS,EACxBgN,KAAKp+B,UAAUu+B,QAAU,GAUzBH,KAAKp+B,UAAUs+B,QAAU,WACvB,IAAIE,KAAOzgC,KAAK0gC,SAASlE,kBAAmB,CAAC,GAEzC7pB,KAAO,CAAC,EAWZ,MAAO,CACL2tB,SATF,SAAkB9K,OAChB,IAAIvtB,EDAH,SAAmB04B,aACxB,IAAKA,YACH,OAAOf,iBAGT,GAAIE,MAAMa,aACR,OAAOA,YAGT,GAAI1N,SAAS0N,aACX,OAAO,IAAIlB,kBAAkBkB,aAG/B,MAAM,IAAI55B,MAAM,iDAClB,CCdc65B,CAAUpL,OAIlB,OAkVJ,SAAwBA,OACtB,IAAK,IAAIqL,SAAU,IAAI9B,UACrB,GAAIvJ,MAAMmK,IAAIkB,QACZ,MAAM,IAAI95B,MAAM,sCAAwC85B,OAAS,0BAGvE,CA1VIC,CAAe74B,GAERw4B,KAAKx4B,EAAG0K,KAPH,KAQd,EAKF,EAgBA0tB,KAAKp+B,UAAUy+B,SAAW,SAAU/E,KAAMoF,UACxC,MAAM,IAAIh6B,MAAM,iDAAmD/G,KAAK+b,KAC1E,EAOAskB,KAAKp+B,UAAUqV,QAAU,SAAUqC,UAEjC,MAAM,IAAI5S,MAAM,yCAClB,EASAs5B,KAAKp+B,UAAU6a,IAAM,SAAUnD,UAE7B,MAAM,IAAI5S,MAAM,qCAClB,EASAs5B,KAAKp+B,UAAU++B,QAAU,SAAUC,MACjC,IAAK5N,OAAO4N,MACV,MAAM,IAAIplB,UAAU,wCAGtB,OAAOolB,IACT,EASAZ,KAAKp+B,UAAUi/B,SAAW,SAAUvnB,UAGlCA,SAAS3Z,KAAM,KAAM,MAErB,SAASmhC,UAAUF,KAAMtnB,UACvBsnB,KAAK3pB,SAAQ,SAAU6hB,MAAOiI,KAAMC,QAClC1nB,SAASwf,MAAOiI,KAAMC,QAEtBF,UAAUhI,MAAOxf,SACnB,GACF,CAEAwnB,CAAUnhC,KAAM2Z,SAClB,EAwBA0mB,KAAKp+B,UAAU+5B,UAAY,SAAUriB,UAYnC,OAXA,SAAS2nB,WAAWnI,MAAOiI,KAAMC,QAC/B,IAAIE,YAAc5nB,SAASwf,MAAOiI,KAAMC,QAExC,OAAIE,cAAgBpI,MAEXoI,YAGFpI,MAAMrc,IAAIwkB,WACnB,CAEOA,CAAWthC,KAAM,KAAM,KAChC,EAiBAqgC,KAAKp+B,UAAUmb,OAAS,SAAUzD,UAChC,IAAI6nB,MAAQ,GAMZ,OALAxhC,KAAKkhC,UAAS,SAAUD,KAAMG,KAAMC,QAC9B1nB,SAASsnB,KAAMG,KAAMC,SACvBG,MAAM1zB,KAAKmzB,KAEf,IACOO,KACT,EAOAnB,KAAKp+B,UAAUgT,MAAQ,WAErB,MAAM,IAAIlO,MAAM,gCAClB,EAOAs5B,KAAKp+B,UAAUw/B,UAAY,WACzB,OAAOzhC,KAAK8c,KAAI,SAAUmkB,MACxB,OAAOA,KAAKQ,WACd,GACF,EASApB,KAAKp+B,UAAU4I,OAAS,SAAU62B,OAChC,QAAOA,OAAQjN,gBAAgBz0B,KAAM0hC,MACvC,EAkBArB,KAAKp+B,UAAUqH,SAAW,SAAU+hB,SAClC,IAAIsW,aAAe3hC,KAAK4hC,iBAAiBvW,SAEzC,YAA4B,IAAjBsW,aACFA,aAGF3hC,KAAK6hC,UAAUxW,QACxB,EASAgV,KAAKp+B,UAAU2O,OAAS,WACtB,MAAM,IAAI7J,MAAM,sDAAwD/G,KAAK+b,KAC/E,EAkBAskB,KAAKp+B,UAAU6/B,OAAS,SAAUzW,SAChC,IAAIsW,aAAe3hC,KAAK4hC,iBAAiBvW,SAEzC,YAA4B,IAAjBsW,aACFA,aAGF3hC,KAAK8hC,OAAOzW,QACrB,EASAgV,KAAKp+B,UAAU4/B,UAAY,WAEzB,MAAM,IAAI96B,MAAM,iCAAmC/G,KAAK+b,KAC1D,EAkBAskB,KAAKp+B,UAAU8/B,MAAQ,SAAU1W,SAC/B,IAAIsW,aAAe3hC,KAAK4hC,iBAAiBvW,SAEzC,YAA4B,IAAjBsW,aACFA,aAGF3hC,KAAKgiC,OAAO3W,QACrB,EAUAgV,KAAKp+B,UAAU+/B,OAAS,SAAU3W,SAEhC,MAAM,IAAItkB,MAAM,8BAAgC/G,KAAK+b,KACvD,EAMAskB,KAAKp+B,UAAU2/B,iBAAmB,SAAUvW,SAC1C,GAAIA,SAA8B,iBAAZA,QACpB,cAAeA,QAAQ4W,SACrB,IAAK,SACL,IAAK,YACH,OAEF,IAAK,WACH,OAAO5W,QAAQ4W,QAAQjiC,KAAMqrB,SAE/B,QACE,MAAM,IAAIxP,UAAU,2CAG5B,EAOAwkB,KAAKp+B,UAAUigC,cAAgB,WAC7B,OAAOliC,KAAK+b,IACd,EAOAskB,KAAKp+B,UAAUkgC,WAAa,WAC1B,OAAOniC,IACT,EAgBOqgC,IAAI,GACV,CACD/C,SAAS,EACTjK,QAAQ,KE9YC+O,mBAAqB,CAC9BC,kBCH4C,gBAFnC,SACQ,IACuD,KAuBxE,SAASC,SACP,KAAMtiC,gBAAgBsiC,QACpB,MAAM,IAAI/hC,YAAY,mDAE1B,CAkOA,OA5NA+hC,OAAOrgC,UAAU8Z,KAAO,SACxBumB,OAAOrgC,UAAUqwB,UAAW,EAU5BgQ,OAAOrgC,UAAUsgC,QAAU,WAEzB,MAAM,IAAIx7B,MAAM,8CAClB,EAWAu7B,OAAOrgC,UAAUugC,SAAW,WAE1B,MAAM,IAAIz7B,MAAM,+CAClB,EAQAu7B,OAAOrgC,UAAU0Y,OAAS,SAAUR,KAAMqoB,UACxC,MAAM,IAAIz7B,MAAM,6CAClB,EAgBAu7B,OAAOrgC,UAAUwgC,OAAS,SAAUlrB,MAAOgqB,YAAahI,cAEtD,MAAM,IAAIxyB,MAAM,6CAClB,EAQAu7B,OAAOrgC,UAAUkkB,IAAM,SAAU5O,OAE/B,MAAM,IAAIxQ,MAAM,0CAClB,EAYAu7B,OAAOrgC,UAAU2T,IAAM,SAAU2B,MAAO0E,MAAOsd,cAE7C,MAAM,IAAIxyB,MAAM,0CAClB,EAeAu7B,OAAOrgC,UAAUq3B,OAAS,SAAUjD,KAAMkD,cAExC,MAAM,IAAIxyB,MAAM,6CAClB,EAYAu7B,OAAOrgC,UAAU43B,QAAU,SAAUxD,KAAMkD,cAEzC,MAAM,IAAIxyB,MAAM,8CAClB,EAOAu7B,OAAOrgC,UAAUgT,MAAQ,WAEvB,MAAM,IAAIlO,MAAM,4CAClB,EAOAu7B,OAAOrgC,UAAUo0B,KAAO,WAEtB,MAAM,IAAItvB,MAAM,2CAClB,EAaAu7B,OAAOrgC,UAAU6a,IAAM,SAAUnD,SAAU+oB,WAEzC,MAAM,IAAI37B,MAAM,0CAClB,EASAu7B,OAAOrgC,UAAUqV,QAAU,SAAUqC,UAEnC,MAAM,IAAI5S,MAAM,8CAClB,EAOAu7B,OAAOrgC,UAAUokB,OAAOsc,UAAY,WAElC,MAAM,IAAI57B,MAAM,oCAClB,EAOAu7B,OAAOrgC,UAAU2gC,QAAU,WAEzB,MAAM,IAAI77B,MAAM,8CAClB,EAOAu7B,OAAOrgC,UAAU0O,QAAU,WAEzB,MAAM,IAAI5J,MAAM,8CAClB,EAWAu7B,OAAOrgC,UAAUs0B,OAAS,SAAUlL,SAElC,MAAM,IAAItkB,MAAM,6CAClB,EAOAu7B,OAAOrgC,UAAUqH,SAAW,WAE1B,MAAM,IAAIvC,MAAM,+CAClB,EAEOu7B,MAAM,GACZ,CACDhF,SAAS,KCzPAuF,uBAAwC,gBAFxC,cACQ,CAAC,WAC2DnsB,OAC7E,IAAI,QAEAA,KAOJ,SAASosB,YAAY3oB,KAAMqoB,UACzB,KAAMxiC,gBAAgB8iC,aACpB,MAAM,IAAIviC,YAAY,oDAGxB,GAAIiiC,WAAa,YAASA,UACxB,MAAM,IAAIz7B,MAAM,qBAAuBy7B,UAGzC,GAAI,YAASroB,MAEO,gBAAdA,KAAK4B,MAEP/b,KAAK+iC,MAAQ9tB,MAAMkF,KAAK4oB,OACxB/iC,KAAKgjC,MAAQ/tB,MAAMkF,KAAK6oB,OACxBhjC,KAAKijC,UAAYT,UAAYroB,KAAK8oB,YAGlCjjC,KAAK+iC,MAAQ5oB,KAAKyoB,UAClB5iC,KAAKgjC,MAAQ7oB,KAAKkc,OAClBr2B,KAAKijC,UAAYT,UAAYroB,KAAK8oB,gBAE/B,GAAI9oB,MAAQW,QAAQX,KAAKA,OAASW,QAAQX,KAAKkc,MAEpDr2B,KAAK+iC,MAAQ5oB,KAAKA,KAClBna,KAAKgjC,MAAQ7oB,KAAKkc,KAElB+C,SAASp5B,KAAK+iC,MAAO/iC,KAAKgjC,OAC1BhjC,KAAKijC,UAAYT,UAAYroB,KAAKqoB,cAC7B,GAAI1nB,QAAQX,MAEjBna,KAAK+iC,MAAQG,WAAW/oB,MAExBna,KAAKgjC,MAAQ,gBAAUhjC,KAAK+iC,OAE5B3J,SAASp5B,KAAK+iC,MAAO/iC,KAAKgjC,OAE1BhjC,KAAKijC,UAAYT,aACZ,IAAIroB,KAET,MAAM,IAAI0B,UAAU,6BAA+B,UAAO1B,MAAQ,KAGlEna,KAAK+iC,MAAQ,GACb/iC,KAAKgjC,MAAQ,CAAC,GACdhjC,KAAKijC,UAAYT,QACnB,CACF,CAwLA,SAASW,KAAK/E,OAAQ7mB,OACpB,IAAKmb,QAAQnb,OACX,MAAM,IAAIsE,UAAU,iBAKtB,GAFetE,MAAM6rB,WAInB,OAAOhF,OAAOjY,IAAI5O,MAAM1Q,OAGxB,IAAIwvB,KAAO9e,MAAM8e,OAEjB,GAAIA,KAAK90B,SAAW68B,OAAO4E,MAAMzhC,OAC/B,MAAM,IAAIu3B,eAAezC,KAAK90B,OAAQ68B,OAAO4E,MAAMzhC,QAOrD,IAHA,IAAIsF,IAAM0Q,MAAM1Q,MACZC,IAAMyQ,MAAMzQ,MAEPlF,EAAI,EAAG+f,GAAKyc,OAAO4E,MAAMzhC,OAAQK,EAAI+f,GAAI/f,IAChDy3B,cAAcxyB,IAAIjF,GAAIw8B,OAAO4E,MAAMphC,IACnCy3B,cAAcvyB,IAAIlF,GAAIw8B,OAAO4E,MAAMphC,IAKrC,OAAO,IAAIkhC,YAAYO,cAAcjF,OAAO2E,MAAOxrB,MAAO8e,KAAK90B,OAAQ,GAAI68B,OAAO6E,UAEtF,CAcA,SAASI,cAAclpB,KAAM5C,MAAOwjB,KAAM9B,KACxC,IAAI7a,KAAO6a,MAAQ8B,KAAO,EACtBuI,MAAQ/rB,MAAMgsB,UAAUtK,KAE5B,OAAI7a,KACKklB,MAAMxmB,KAAI,SAAUlb,GAEzB,OADAy3B,cAAcz3B,EAAGuY,KAAK5Y,QACf4Y,KAAKvY,EACd,IAAG+O,UAEI2yB,MAAMxmB,KAAI,SAAUlb,GAGzB,OAFAy3B,cAAcz3B,EAAGuY,KAAK5Y,QAEf8hC,cADKlpB,KAAKvY,GACW2V,MAAOwjB,KAAM9B,IAAM,EACjD,IAAGtoB,SAEP,CAeA,SAAS6yB,KAAKpF,OAAQ7mB,MAAOksB,UAAWlK,cACtC,IAAKhiB,QAA2B,IAAlBA,MAAMmb,QAClB,MAAM,IAAI7W,UAAU,iBAItB,IAGI6nB,MAHAC,MAAQpsB,MAAM8e,OACd+M,SAAW7rB,MAAM6rB,WAWrB,GAPI,YAASK,YACXC,MAAQD,UAAUpN,OAClBoN,UAAYA,UAAU9yB,WAEtB+yB,MAAQ,gBAAUD,WAGhBL,SAAU,CAGZ,GAAqB,IAAjBM,MAAMniC,OACR,MAAM,IAAIsa,UAAU,mBAGtBuiB,OAAOxoB,IAAI2B,MAAM1Q,MAAO48B,UAAWlK,aACrC,KAAO,CAGL,GAAIoK,MAAMpiC,OAAS68B,OAAO4E,MAAMzhC,OAC9B,MAAM,IAAIu3B,eAAe6K,MAAMpiC,OAAQ68B,OAAO4E,MAAMzhC,OAAQ,KAG9D,GAAImiC,MAAMniC,OAASoiC,MAAMpiC,OAAQ,CAK/B,IAHA,IAAIK,EAAI,EACJo5B,MAAQ,EAEQ,IAAb2I,MAAM/hC,IAAyB,IAAb8hC,MAAM9hC,IAC7BA,IAGF,KAAoB,IAAb+hC,MAAM/hC,IACXo5B,QACAp5B,IAIF6hC,UAAY3I,UAAU2I,UAAWE,MAAMpiC,OAAQy5B,MAAO0I,MACxD,CAGA,IAAKjP,gBAAgBkP,MAAOD,OAC1B,MAAM,IAAI5K,eAAe6K,MAAOD,MAAO,KAIzC,IAAIrN,KAAO9e,MAAMzQ,MAAMgW,KAAI,SAAUlb,GACnC,OAAOA,EAAI,CACb,IAEAgiC,KAAKxF,OAAQ/H,KAAMkD,cAGnB,IAAIwB,KAAO4I,MAAMpiC,OAGjBsiC,cAAczF,OAAO2E,MAAOxrB,MAAOksB,UAAW1I,KAFpC,EAGZ,CAEA,OAAOqD,MACT,CAaA,SAASyF,cAAc1pB,KAAM5C,MAAOksB,UAAW1I,KAAM9B,KACnD,IAAI7a,KAAO6a,MAAQ8B,KAAO,EACtBuI,MAAQ/rB,MAAMgsB,UAAUtK,KAExB7a,KACFklB,MAAMhsB,SAAQ,SAAUwsB,UAAWC,UACjC1K,cAAcyK,WACd3pB,KAAK2pB,WAAaL,UAAUM,SAAS,GACvC,IAEAT,MAAMhsB,SAAQ,SAAUwsB,UAAWC,UACjC1K,cAAcyK,WAEdD,cAAc1pB,KAAK2pB,WAAYvsB,MAAOksB,UAAUM,SAAS,IAAKhJ,KAAM9B,IAAM,EAC5E,GAEJ,CAgCA,SAASO,QAAQ4E,OAAQ/H,KAAMkD,cAE7B,GAAoB,IAAhBlD,KAAK90B,OAAc,CAIrB,IAFA,IAAI4S,EAAIiqB,OAAO2E,MAERjoB,QAAQ3G,IACbA,EAAIA,EAAE,GAGR,OAAOA,CACT,CAOA,OAJAiqB,OAAO4E,MAAQ3M,KAAKjsB,MAAM,GAE1Bg0B,OAAO2E,MAAQzJ,OAAO8E,OAAO2E,MAAO3E,OAAO4E,MAAOzJ,cAE3C6E,MACT,CAqCA,SAASwF,KAAKxF,OAAQ/H,KAAMkD,cAM1B,IALA,IACAyK,QAAU5F,OAAO4E,MAAM54B,MAAM,GAEzB65B,SAAU,EAEPD,QAAQziC,OAAS80B,KAAK90B,QAC3ByiC,QAAQl2B,KAAK,GACbm2B,SAAU,EAIZ,IAAK,IAAIriC,EAAI,EAAG+f,GAAK0U,KAAK90B,OAAQK,EAAI+f,GAAI/f,IACpCy0B,KAAKz0B,GAAKoiC,QAAQpiC,KACpBoiC,QAAQpiC,GAAKy0B,KAAKz0B,GAClBqiC,SAAU,GAIVA,SAEFzK,QAAQ4E,OAAQ4F,QAASzK,aAE7B,CAucA,SAAS2J,WAAW/oB,MAClB,IAAK,IAAIvY,EAAI,EAAG+f,GAAKxH,KAAK5Y,OAAQK,EAAI+f,GAAI/f,IAAK,CAC7C,IAAI63B,KAAOtf,KAAKvY,GAEZkZ,QAAQ2e,MACVtf,KAAKvY,GAAKshC,WAAWzJ,MACZA,OAA0B,IAAlBA,KAAKnH,WACtBnY,KAAKvY,GAAKshC,WAAWzJ,KAAK9oB,WAE9B,CAEA,OAAOwJ,IACT,CAEA,OA16BA2oB,YAAY7gC,UAAY,IAAIqgC,OAK5BQ,YAAY7gC,UAAUiiC,kBAAoB,SAAU/pB,KAAMqoB,UACxD,OAAO,IAAIM,YAAY3oB,KAAMqoB,SAC/B,EAMAM,YAAY7gC,UAAU8Z,KAAO,cAC7B+mB,YAAY7gC,UAAUswB,eAAgB,EAWtCuQ,YAAY7gC,UAAUkiC,YAAc,WAClC,OAAO/I,iBAAiBp7B,KAAK+iC,MAAO,UACtC,EAYAD,YAAY7gC,UAAUsgC,QAAU,WAC9B,MAAO,OACT,EAYAO,YAAY7gC,UAAUugC,SAAW,WAC/B,OAAOxiC,KAAKijC,SACd,EASAH,YAAY7gC,UAAU0Y,OAAS,SAAUR,KAAMqoB,UAC7C,OAAO,IAAIM,YAAY3oB,KAAMqoB,SAC/B,EAiBAM,YAAY7gC,UAAUwgC,OAAS,SAAUlrB,MAAOgqB,YAAahI,cAC3D,OAAQ7kB,UAAUnT,QAChB,KAAK,EACH,OAAO4hC,KAAKnjC,KAAMuX,OAGpB,KAAK,EACL,KAAK,EACH,OAAOisB,KAAKxjC,KAAMuX,MAAOgqB,YAAahI,cAExC,QACE,MAAM,IAAIh5B,YAAY,6BAE5B,EASAuiC,YAAY7gC,UAAUkkB,IAAM,SAAU5O,OACpC,IAAKuD,QAAQvD,OACX,MAAM,IAAIsE,UAAU,kBAGtB,GAAItE,MAAMhW,SAAWvB,KAAKgjC,MAAMzhC,OAC9B,MAAM,IAAIu3B,eAAevhB,MAAMhW,OAAQvB,KAAKgjC,MAAMzhC,QAIpD,IAAK,IAAIrB,EAAI,EAAGA,EAAIqX,MAAMhW,OAAQrB,IAChCm5B,cAAc9hB,MAAMrX,GAAIF,KAAKgjC,MAAM9iC,IAKrC,IAFA,IAAIia,KAAOna,KAAK+iC,MAEPnhC,EAAI,EAAG+f,GAAKpK,MAAMhW,OAAQK,EAAI+f,GAAI/f,IAAK,CAC9C,IAAIwiC,OAAS7sB,MAAM3V,GACnBy3B,cAAc+K,OAAQjqB,KAAK5Y,QAC3B4Y,KAAOA,KAAKiqB,OACd,CAEA,OAAOjqB,IACT,EAaA2oB,YAAY7gC,UAAU2T,IAAM,SAAU2B,MAAO0E,MAAOsd,cAClD,IAAKze,QAAQvD,OACX,MAAM,IAAIsE,UAAU,kBAGtB,GAAItE,MAAMhW,OAASvB,KAAKgjC,MAAMzhC,OAC5B,MAAM,IAAIu3B,eAAevhB,MAAMhW,OAAQvB,KAAKgjC,MAAMzhC,OAAQ,KAG5D,IAAIK,EAAG+f,GAAIyiB,OAEP/N,KAAO9e,MAAMuF,KAAI,SAAUlb,GAC7B,OAAOA,EAAI,CACb,IAEAgiC,KAAK5jC,KAAMq2B,KAAMkD,cAGjB,IAAIpf,KAAOna,KAAK+iC,MAEhB,IAAKnhC,EAAI,EAAG+f,GAAKpK,MAAMhW,OAAS,EAAGK,EAAI+f,GAAI/f,IAEzCy3B,cADA+K,OAAS7sB,MAAM3V,GACOuY,KAAK5Y,QAC3B4Y,KAAOA,KAAKiqB,QAOd,OAFA/K,cADA+K,OAAS7sB,MAAMA,MAAMhW,OAAS,GACR4Y,KAAK5Y,QAC3B4Y,KAAKiqB,QAAUnoB,MACRjc,IACT,EA0MA8iC,YAAY7gC,UAAUq3B,OAAS,SAAUjD,KAAMkD,aAAcvkB,MAE3D,IAAK,gBAAaqhB,MAChB,MAAM,IAAIxa,UAAU,4BAItB,IAAIwoB,UAAYhO,KAAK1lB,UAAUmM,KAAIb,OAC1BpB,MAAMC,QAAQmB,QAA2B,IAAjBA,MAAM1a,OAAe0a,MAAM,GAAKA,QAKjE,OAAOud,QAFCxkB,KAAOhV,KAAKiV,QAAUjV,KAEZqkC,UAAW9K,aAC/B,EAsCAuJ,YAAY7gC,UAAU43B,QAAU,SAAUxD,KAAMrhB,MAC9C,IAAIlL,EAAIkL,KAAOhV,KAAKiV,QAAUjV,KAC9B8J,EAAEi5B,MAAQlJ,QAAQ/vB,EAAEi5B,MAAO1M,MAE3B,IAAI6D,cAAgBpwB,EAAEk5B,MAAMzb,QAAO,CAAChmB,OAAQ80B,OAAS90B,OAAS80B,OAG9D,OADAvsB,EAAEk5B,MAAQ3I,qBAAqBhE,KAAM6D,eAC9BpwB,CACT,EA2CAg5B,YAAY7gC,UAAUgT,MAAQ,WAM5B,OALQ,IAAI6tB,YAAY,CACtB3oB,KAAMlF,MAAMjV,KAAK+iC,OACjB1M,KAAMphB,MAAMjV,KAAKgjC,OACjBR,SAAUxiC,KAAKijC,WAGnB,EAQAH,YAAY7gC,UAAUo0B,KAAO,WAC3B,OAAOr2B,KAAKgjC,MAAM54B,MAAM,EAC1B,EAaA04B,YAAY7gC,UAAU6a,IAAM,SAAUnD,UAEpC,IAAI2qB,GAAKtkC,KAcLma,KAZU,SAASoqB,QAAQtoB,MAAO1E,OACpC,OAAIuD,QAAQmB,OACHA,MAAMa,KAAI,SAAUqc,MAAOv3B,GAChC,OAAO2iC,QAAQpL,MAAO5hB,MAAMsG,OAAOjc,GACrC,IAEO+X,SAASsC,MAAO1E,MAAO+sB,GAElC,CAIWC,CAAQvkC,KAAK+iC,MAAO,IAE/B,OAAO,IAAID,YAAY3oB,UADWhZ,IAAnBnB,KAAKijC,UAA0B7H,iBAAiBjhB,KAAM,gBAAUhZ,EAEjF,EAUA2hC,YAAY7gC,UAAUqV,QAAU,SAAUqC,UAExC,IAAI2qB,GAAKtkC,MAEK,SAASukC,QAAQtoB,MAAO1E,OAChCuD,QAAQmB,OACVA,MAAM3E,SAAQ,SAAU6hB,MAAOv3B,GAC7B2iC,QAAQpL,MAAO5hB,MAAMsG,OAAOjc,GAC9B,IAEA+X,SAASsC,MAAO1E,MAAO+sB,GAE3B,CAEAC,CAAQvkC,KAAK+iC,MAAO,GACtB,EAOAD,YAAY7gC,UAAUokB,OAAOsc,UAAY,kBACzB,SAAU4B,QAAQtoB,MAAO1E,OACrC,GAAIuD,QAAQmB,OACV,IAAK,IAAIra,EAAI,EAAGA,EAAIqa,MAAM1a,OAAQK,UACzB2iC,QAAQtoB,MAAMra,GAAI2V,MAAMsG,OAAOjc,cAGlC,CACJqa,MACA1E,MAGN,CAEOgtB,CAAQvkC,KAAK+iC,MAAO,GAC7B,EAOAD,YAAY7gC,UAAUuiC,KAAO,WAC3B,IAAIxtB,OAAS,GAGb,GAAiB,IAFThX,KAAKq2B,OAEP90B,OACJ,MAAM,IAAIsa,UAAU,8CAGtB,IAAI1B,KAAOna,KAAK+iC,MAEhB,IAAK,IAAI0B,OAAOtqB,KACdnD,OAAOlJ,KAAK,IAAIg1B,YAAY,CAAC2B,KAAMzkC,KAAKijC,YAG1C,OAAOjsB,MACT,EAOA8rB,YAAY7gC,UAAUyiC,QAAU,WAC9B,IAAIC,MAAQ3kC,KAERgX,OAAS,GACT/O,EAAIjI,KAAKq2B,OAEb,GAAiB,IAAbpuB,EAAE1G,OACJ,MAAM,IAAIsa,UAAU,8CAUtB,IAPA,IAAI1B,KAAOna,KAAK+iC,MAEZ3rB,MAAQ,SAAexV,GACzB,IAAIgjC,IAAMzqB,KAAK2C,KAAI2nB,KAAO,CAACA,IAAI7iC,MAC/BoV,OAAOlJ,KAAK,IAAIg1B,YAAY8B,IAAKD,MAAM1B,WACzC,EAESrhC,EAAI,EAAGA,EAAIqG,EAAE,GAAIrG,IACxBwV,MAAMxV,GAGR,OAAOoV,MACT,EAQA8rB,YAAY7gC,UAAU2gC,QAAU,WAC9B,OAAO3tB,MAAMjV,KAAK+iC,MACpB,EAQAD,YAAY7gC,UAAU0O,QAAU,WAC9B,OAAO3Q,KAAK+iC,KACd,EAYAD,YAAY7gC,UAAUs0B,OAAS,SAAUlL,SACvC,OAAO,cAAOrrB,KAAK+iC,MAAO1X,QAC5B,EAQAyX,YAAY7gC,UAAUqH,SAAW,WAC/B,OAAO,cAAOtJ,KAAK+iC,MACrB,EAQAD,YAAY7gC,UAAU2O,OAAS,WAC7B,MAAO,CACLi0B,OAAQ,cACR1qB,KAAMna,KAAK+iC,MACX1M,KAAMr2B,KAAKgjC,MACXR,SAAUxiC,KAAKijC,UAEnB,EAWAH,YAAY7gC,UAAU6iC,SAAW,SAAUx+B,GAEzC,GAAIA,GAOF,GALI2rB,YAAY3rB,KACdA,EAAIA,EAAE2J,aAIH+hB,SAAS1rB,KAAOqG,UAAUrG,GAC7B,MAAM,IAAIuV,UAAU,kDAItBvV,EAAI,EAaN,IAVA,IAAIy+B,OAASz+B,EAAI,EAAIA,EAAI,EACrB0+B,KAAO1+B,EAAI,GAAKA,EAAI,EAEpBk+B,KAAOxkC,KAAKgjC,MAAM,GAClB0B,QAAU1kC,KAAKgjC,MAAM,GAErBj5B,EAAI5J,KAAK0G,IAAI29B,KAAOQ,KAAMN,QAAUK,QAEpC5qB,KAAO,GAEFvY,EAAI,EAAGA,EAAImI,EAAGnI,IACrBuY,KAAKvY,GAAK5B,KAAK+iC,MAAMnhC,EAAIojC,MAAMpjC,EAAImjC,QAIrC,OAAO,IAAIjC,YAAY,CACrB3oB,KACAkc,KAAM,CAACtsB,GACPy4B,SAAUxiC,KAAKijC,WAEnB,EAeAH,YAAYgC,SAAW,SAAUzO,KAAMpa,MAAO3V,EAAGizB,cAC/C,IAAKze,QAAQub,MACX,MAAM,IAAIxa,UAAU,kCAGtB,GAAoB,IAAhBwa,KAAK90B,OACP,MAAM,IAAIwF,MAAM,4CAmBlB,GAfAsvB,KAAOA,KAAKvZ,KAAI,SAAU7U,GAQxB,GANIgqB,YAAYhqB,KAEdA,EAAIA,EAAEgI,aAIH+hB,SAAS/pB,KAAO0E,UAAU1E,IAAMA,EAAI,EACvC,MAAM,IAAIlB,MAAM,yCAGlB,OAAOkB,CACT,IAEI3B,GAOF,GALI2rB,YAAY3rB,KACdA,EAAIA,EAAE2J,aAIH+hB,SAAS1rB,KAAOqG,UAAUrG,GAC7B,MAAM,IAAIuV,UAAU,kDAItBvV,EAAI,EAGN,IAQI0uB,OARA+P,OAASz+B,EAAI,EAAIA,EAAI,EACrB0+B,KAAO1+B,EAAI,GAAKA,EAAI,EAEpBk+B,KAAOnO,KAAK,GACZqO,QAAUrO,KAAK,GAEftsB,EAAI5J,KAAK0G,IAAI29B,KAAOQ,KAAMN,QAAUK,QAKxC,GAAIjqB,QAAQmB,OAAQ,CAElB,GAAIA,MAAM1a,SAAWwI,EAEnB,MAAM,IAAIhD,MAAM,8BAIlBiuB,OAAS,SAAgBpzB,GAEvB,OAAOqa,MAAMra,EACf,CACF,MAAO,GAAI,YAASqa,OAAQ,CAE1B,IAAIgpB,GAAKhpB,MAAMoa,OAEf,GAAkB,IAAd4O,GAAG1jC,QAAgB0jC,GAAG,KAAOl7B,EAE/B,MAAM,IAAIhD,MAAM,yBAIlBiuB,OAAS,SAAgBpzB,GAEvB,OAAOqa,MAAMkK,IAAI,CAACvkB,GACpB,CACF,MAEEozB,OAAS,WAEP,OAAO/Y,KACT,EAIGsd,eAEHA,aAAetH,YAAY+C,OAAO,IAAMA,OAAO,GAAGjmB,IAAI,GACpD,GAIJ,IAAIoL,KAAO,GAEX,GAAIkc,KAAK90B,OAAS,EAAG,CAEnB4Y,KAAOmf,OAAOnf,KAAMkc,KAAMkD,cAE1B,IAAK,IAAIp3B,EAAI,EAAGA,EAAI4H,EAAG5H,IACrBgY,KAAKhY,EAAI6iC,MAAM7iC,EAAI4iC,QAAU/P,OAAO7yB,EAExC,CAGA,OAAO,IAAI2gC,YAAY,CACrB3oB,KACAkc,KAAM,CAACmO,KAAME,UAEjB,EAWA5B,YAAYoC,SAAW,SAAUzH,MAC/B,OAAO,IAAIqF,YAAYrF,KACzB,EAYAqF,YAAY7gC,UAAUkjC,SAAW,SAAUvjC,EAAG4F,GAE5C,KAAKwqB,SAASpwB,IAAO+K,UAAU/K,IAAOowB,SAASxqB,IAAOmF,UAAUnF,IAC9D,MAAM,IAAIT,MAAM,uCAIlB,GAA0B,IAAtB/G,KAAKgjC,MAAMzhC,OACb,MAAM,IAAIwF,MAAM,4CAUlB,OANAsyB,cAAcz3B,EAAG5B,KAAKgjC,MAAM,IAC5B3J,cAAc7xB,EAAGxH,KAAKgjC,MAAM,IAE5BF,YAAYsC,UAAUxjC,EAAG4F,EAAGxH,KAAK+iC,OAG1B/iC,IACT,EAUA8iC,YAAYsC,UAAY,SAAUxjC,EAAG4F,EAAG2S,MAEtC,IAAIkrB,GAAKlrB,KAAKvY,GACduY,KAAKvY,GAAKuY,KAAK3S,GACf2S,KAAK3S,GAAK69B,EACZ,EAwBOvC,WAAW,GACjB,CACDxF,SAAS,IC1+BAgI,wBAA0B,CACnClD,mBACAS,yDCHS0C,sBAAwB,CACjCC,qBCF+C,gBAFtC,YACQ,CAAC,MAAO,WACkD9uB,OAC3E,IAAI,GACA,QAEAA,KACA+uB,UAAY,cAAc,CAC5B3gC,UAAWmP,OAAOnP,UAClBE,OAAQ,iBA6CV,OA3CAygC,UAAUxjC,UAAY8T,OAAO4E,OAAO8qB,UAAUxjC,WAK9CwjC,UAAUxjC,UAAU8Z,KAAO,YAC3B0pB,UAAUxjC,UAAUgwB,aAAc,EAQlCwT,UAAUxjC,UAAU2O,OAAS,WAC3B,MAAO,CACLi0B,OAAQ,YACR5oB,MAAOjc,KAAKsJ,WAEhB,EASAm8B,UAAUP,SAAW,SAAUzH,MAC7B,OAAO,IAAIgI,UAAUhI,KAAKxhB,MAC5B,EAEIvC,IAEFA,GAAG,UAAU,SAAUmhB,KAAMD,MACvBC,KAAK/1B,YAAc81B,KAAK91B,WAC1B2gC,UAAUxxB,OAAO,CACfnP,UAAW+1B,KAAK/1B,WAGtB,IAGK2gC,SAAS,GACf,CACDnI,SAAS,sCCrDAoI,oBAAsB,CAC/BC,mBCA6C,gBAFpC,UACQ,IACwD,KAIzE,uBAAyB,UACzB,6BAA8B,EAO9B,yBAA2B,WACzB,MAAO,CACLd,OAAQ,UACRtiC,GAAIvC,KAAKuC,GACTC,GAAIxC,KAAKwC,GAEb,EAQA,0BAA4B,WAC1B,MAAO,CACLC,EAAGzC,KAAKY,MACRglC,IAAK5lC,KAAKqC,MAEd,EAYA,yBAA2B,SAAUgpB,SACnC,IACI7oB,GAAKxC,KAAKwC,GACVD,GAAKvC,KAAKuC,GACVsjC,MAAQtP,OAAOv2B,KAAKuC,GAAI8oB,SACxBya,MAAQvP,OAAOv2B,KAAKwC,GAAI6oB,SAExBvmB,UAAYktB,SAAS3G,SAAWA,QAAUA,QAAUA,QAAQvmB,UAAY,KAE5E,GAAkB,OAAdA,UAAoB,CACtB,IAAIizB,QAAU53B,KAAKiC,IAAI,IAAK0C,WAExB3E,KAAKS,IAAI2B,GAAKC,IAAMu1B,UACtBx1B,GAAK,GAGHpC,KAAKS,IAAI4B,GAAKD,IAAMw1B,UACtBv1B,GAAK,EAET,CA+BA,OA7BW,IAAPA,GAEIqjC,MACU,IAAPtjC,GAEE,IAAPC,GACI,KACW,IAARA,GACH,KAEAsjC,MAAQ,IAIZtjC,GAAK,GACK,IAARA,GACIqjC,MAAQ,OAERA,MAAQ,MAAQC,MAAMxyB,UAAU,GAAK,IAGlC,IAAP9Q,GACIqjC,MAAQ,OAERA,MAAQ,MAAQC,MAAQ,GAMtC,EAcA,kBAAoB,SAAUnzB,MAC5B,OAAQ+B,UAAUnT,QAChB,KAAK,EAED,IAAIc,IAAMqS,UAAU,GAEpB,GAAmB,iBAARrS,IACT,OAAO,QAAQA,KAEf,MAAM,IAAIwZ,UAAU,kDAI1B,KAAK,EAED,IAAIpZ,EAAIiS,UAAU,GACdkxB,IAAMlxB,UAAU,GAEpB,GAAIsd,SAASvvB,GAAI,CAMf,GALI4vB,OAAOuT,MAAQA,IAAIG,QAAQ,WAE7BH,IAAMA,IAAI31B,SAAS,QAGjB+hB,SAAS4T,KACX,OAAO,IAAI,QAAQ,CACjBnjC,EACAmjC,MAIJ,MAAM,IAAI/pB,UAAU,yCACtB,CACE,MAAM,IAAIA,UAAU,6BAI1B,QACE,MAAM,IAAItb,YAAY,mDAE5B,EAEA,0BAA4B,2BAU5B,iBAAmB,SAAUk9B,MAC3B,OAAO,IAAI,QAAQA,KACrB,EAkBA,gBAAkB,SAAUh9B,EAAGC,GAC7B,OAAID,EAAE8B,GAAK7B,EAAE6B,GACJ,EAGL9B,EAAE8B,GAAK7B,EAAE6B,IACH,EAGN9B,EAAE+B,GAAK9B,EAAE8B,GACJ,EAGL/B,EAAE+B,GAAK9B,EAAE8B,IACH,EAGH,CACT,EAEO,UACN,CACD86B,SAAS,uCC3MA0I,qBAAuB,CAChCC,oBCF8C,gBAFrC,WACQ,IACyD,KAI1E,wBAA0B,WAC1B,+BAAgC,EAOhC,0BAA4B,WAC1B,MAAO,CACLpB,OAAQ,WACR96B,EAAG/J,KAAKiI,EAAIjI,KAAK+J,EACjB5H,EAAGnC,KAAKmC,EAEZ,EASA,kBAAoB,SAAUs7B,MAC5B,OAAO,IAAI,SAASA,KACtB,EAEO,WACN,CACDH,SAAS,6CCMP4I,cAAgB,WAIlB,OADAA,cAAgB,sBACT,cACT,EAsUA,SAASC,iBAAiBjmC,GACxB,MAAM,IAAI6G,MAAM,wBAAwB8W,OAAO3d,EAAG,oDACpD,CAEA,SAASkmC,eAAelmC,GACtB,MAAM,IAAI6G,MAAM,wBAAwB8W,OAAO3d,EAAG,uDACpD,CAMA,SAASmmC,gBAAgBnmC,GACvB,MAAM,IAAI6G,MAAM,wBAAwB8W,OAAO3d,EAAG,mDACpD,CC3XO,IAAIomC,kBAAoB,CAC7Bf,sBACAG,oBACAJ,wBACAU,qBACAO,YD2CsC,gBAAQ,QAP7B,CAAC,aAAc,WAAY,eAAgB,cAOS,SAAqB7vB,MAC1F,IAAI,UACO,QACF,YACI,UAETA,KAIA0E,MAAQ8qB,gBAgTZ,OA3SA9qB,MAAMC,MAAQ,CAAC,CACb5D,KAAM,SACN7D,KAAMoe,UACL,CACDva,KAAM,UACN7D,KAAMse,WACL,CACDza,KAAM,YACN7D,KAAMqe,aACL,CACDxa,KAAM,WACN7D,KAAMwe,YACL,CACD3a,KAAM,OACN7D,KAAMye,QACL,CACD5a,KAAM,SACN7D,KAAM,aACL,CACD6D,KAAM,QACN7D,KAAMugB,SACL,CACD1c,KAAM,QACN7D,KAAMkH,SACL,CACDrD,KAAM,SACN7D,KAAM,aACL,CACD6D,KAAM,cACN7D,KAAM2e,eACL,CACD9a,KAAM,eACN7D,KAAM4e,gBACL,CACD/a,KAAM,QACN7D,KAAM6e,SACL,CACDhb,KAAM,QACN7D,KAAM8e,SACL,CACDjb,KAAM,UACN7D,KAAM+e,WACL,CACDlb,KAAM,YACN7D,KAAMgf,aACL,CACDnb,KAAM,OACN7D,KAAMif,QACL,CACDpb,KAAM,WACN7D,KAAMkf,YACL,CACDrb,KAAM,OACN7D,KAAMmf,QACL,CACDtb,KAAM,SACN7D,KAAMof,UACL,CACDvb,KAAM,OACN7D,KAAMsf,QACL,CACDzb,KAAM,YACN7D,KAAMuf,aACL,CACD1b,KAAM,eACN7D,KAAMwf,gBACL,CACD3b,KAAM,YACN7D,KAAM0f,aACL,CACD7b,KAAM,iBACN7D,KAAM2f,kBACL,CACD9b,KAAM,YACN7D,KAAM4f,aACL,CACD/b,KAAM,kBACN7D,KAAM6f,mBACL,CACDhc,KAAM,eACN7D,KAAM8f,gBACL,CACDjc,KAAM,eACN7D,KAAMggB,gBACL,CACDnc,KAAM,yBACN7D,KAAM+f,0BACL,CACDlc,KAAM,YACN7D,KAAMigB,aACL,CACDpc,KAAM,OACN7D,KAAMyf,QACL,CACD5b,KAAM,aACN7D,KAAMkgB,cACL,CACDrc,KAAM,eACN7D,KAAMmgB,gBACL,CACDtc,KAAM,kBACN7D,KAAMogB,mBACL,CACDvc,KAAM,YACN7D,KAAMqgB,aACL,CACDxc,KAAM,aACN7D,KAAMsgB,cACL,CACDzc,KAAM,MACN7D,KAAMksB,OACL,CACDroB,KAAM,SACN7D,KAAMqf,WAGR7X,MAAME,YAAc,CAAC,CACnBmB,KAAM,SACNE,GAAI,YACJH,QAAS,SAAiBtc,GAMxB,GALKulC,WACHU,iBAAiBjmC,GAIRA,EzBwYFiK,gBAAgBiJ,QAAQ,OAAQ,IAC5CA,QAAQ,aAAc,IACtB7R,OyB1YmB,GACd,MAAM,IAAIsa,UAAU,uFAA8F3b,EAA9F,yDAGtB,OAAO,IAAIulC,UAAUvlC,EACvB,GACC,CACDuc,KAAM,SACNE,GAAI,UACJH,QAAS,SAAiBtc,GAKxB,OAJKe,SACHmlC,eAAelmC,GAGV,IAAIe,QAAQf,EAAG,EACxB,GACC,CACDuc,KAAM,SACNE,GAAI,SACJH,QAAS,SAAiBtc,GACxB,OAAOA,EAAI,EACb,GACC,CACDuc,KAAM,YACNE,GAAI,UACJH,QAAS,SAAiBtc,GAKxB,OAJKe,SACHmlC,eAAelmC,GAGV,IAAIe,QAAQf,EAAE+P,WAAY,EACnC,GACC,CACDwM,KAAM,WACNE,GAAI,YACJH,QAAS,SAAiBtc,GACxB,MAAM,IAAI2b,UAAU,4JACtB,GACC,CACDY,KAAM,WACNE,GAAI,UACJH,QAAS,SAAiBtc,GAKxB,OAJKe,SACHmlC,eAAelmC,GAGV,IAAIe,QAAQf,EAAEyQ,UAAW,EAClC,GACC,CACD8L,KAAM,SACNE,GAAI,WACJH,QAAS,SAAiBtc,GACnB4X,UACHuuB,gBAAgBnmC,GAGlB,IAAIsmC,EAAI,IAAI1uB,SAAS5X,GAErB,GAAIsmC,EAAE71B,YAAczQ,EAClB,MAAM,IAAI2b,UAAU,mGAA0G3b,EAA1G,uDAGtB,OAAOsmC,CACT,GACC,CAQD/pB,KAAM,SACNE,GAAI,SACJH,QAAS,SAAiBtc,GACxB,IAAI6J,EAAI3I,OAAOlB,GAEf,GAAI4B,MAAMiI,GACR,MAAM,IAAIhD,MAAM,mBAAqB7G,EAAI,iBAG3C,OAAO6J,CACT,GACC,CACD0S,KAAM,SACNE,GAAI,YACJH,QAAS,SAAiBtc,GACnBulC,WACHU,iBAAiBjmC,GAGnB,IACE,OAAO,IAAIulC,UAAUvlC,EAGvB,CAFE,MAAOof,KACP,MAAM,IAAIvY,MAAM,mBAAqB7G,EAAI,iBAC3C,CACF,GACC,CACDuc,KAAM,SACNE,GAAI,WACJH,QAAS,SAAiBtc,GACnB4X,UACHuuB,gBAAgBnmC,GAGlB,IACE,OAAO,IAAI4X,SAAS5X,EAGtB,CAFE,MAAOof,KACP,MAAM,IAAIvY,MAAM,mBAAqB7G,EAAI,gBAC3C,CACF,GACC,CACDuc,KAAM,SACNE,GAAI,UACJH,QAAS,SAAiBtc,GACnBe,SACHmlC,eAAelmC,GAGjB,IACE,OAAO,IAAIe,QAAQf,EAGrB,CAFE,MAAOof,KACP,MAAM,IAAIvY,MAAM,mBAAqB7G,EAAI,eAC3C,CACF,GACC,CACDuc,KAAM,UACNE,GAAI,SACJH,QAAS,SAAiBtc,GACxB,OAAQA,CACV,GACC,CACDuc,KAAM,UACNE,GAAI,YACJH,QAAS,SAAiBtc,GAKxB,OAJKulC,WACHU,iBAAiBjmC,GAGZ,IAAIulC,WAAWvlC,EACxB,GACC,CACDuc,KAAM,UACNE,GAAI,WACJH,QAAS,SAAiBtc,GAKxB,OAJK4X,UACHuuB,gBAAgBnmC,GAGX,IAAI4X,UAAU5X,EACvB,GACC,CACDuc,KAAM,UACNE,GAAI,SACJH,QAAS,SAAiBtc,GACxB,OAAOgT,OAAOhT,EAChB,GACC,CACDuc,KAAM,QACNE,GAAI,SACJH,QAAS,SAAiBuB,OAKxB,OAJK+kB,aAwBX,WACE,MAAM,IAAI/7B,MAAM,sEAClB,CAzBQ0/B,GAGK,IAAI3D,YAAY/kB,MACzB,GACC,CACDtB,KAAM,SACNE,GAAI,QACJH,QAAS,SAAiB4hB,QACxB,OAAOA,OAAOztB,SAChB,IAEKyK,KACT,KE3WO,SAAS,wBAAYlb,EAAG8C,EAAG+0B,SAEhC,GAAIA,cACF,OAAO73B,EAAEoK,GAAGtH,GAId,GAAI9C,EAAEoK,GAAGtH,GACP,OAAO,EAIT,GAAI9C,EAAE4B,SAAWkB,EAAElB,QACjB,OAAO,EAIT,GAAI5B,EAAEmB,YAAc2B,EAAE3B,WAAY,CAEhC,IAAI22B,KAAO93B,EAAEyB,MAAMqB,GAAGpC,MAEtB,GAAIo3B,KAAK5uB,SACP,OAAO,EAGP,IAAItC,IAAM5G,EAAE8H,YAAYlB,IAAI5G,EAAEU,MAAOoC,EAAEpC,OACvC,OAAOo3B,KAAK/rB,IAAInF,IAAI0C,MAAMuuB,SAE9B,CAGA,OAAO,CACT,CCrCA,IAEW2O,kBAAmC,gBAFnC,cACQ,CAAC,QAAS,WAC6ChwB,OACxE,IAAI,MACG,QAEHA,KAUJ,OAAO0E,MAhBE,cAgBU,CACjB,mBAAoB,SAAwBlb,EAAG8C,GAC7C,OAAO9C,IAAM8C,CACf,EACA,iBAAkB,SAAsB9C,EAAG8C,GACzC,OAAO,mBAAY9C,EAAG8C,EAAGiR,OAAO8jB,QAClC,EACA,uBAAwB,SAA4B73B,EAAG8C,GACrD,OAAO9C,EAAEoK,GAAGtH,IAAM,wBAAe9C,EAAG8C,EAAGiR,OAAO8jB,QAChD,EACA,qBAAsB,SAA0B73B,EAAG8C,GACjD,OAAO9C,EAAE2K,OAAO7H,EAClB,EACA,mBAAoB,SAAwB9C,EAAG8C,GAC7C,OCxBC,SAAuB9C,EAAG8C,EAAG+0B,SAClC,OAAO,mBAAY73B,EAAEqC,GAAIS,EAAET,GAAIw1B,UAAY,mBAAY73B,EAAEsC,GAAIQ,EAAER,GAAIu1B,QACrE,CDsBa4O,CAAczmC,EAAG8C,EAAGiR,OAAO8jB,QACpC,EACA,aAAc,SAAkB73B,EAAG8C,GACjC,IAAK9C,EAAE0mC,UAAU5jC,GACf,MAAM,IAAI+D,MAAM,4CAGlB,OAAO/G,KAAKE,EAAE+b,MAAOjZ,EAAEiZ,MACzB,GACA,IErCO4qB,yBFuC0B,gBAzC1B,cAyCwC,CAAC,QAAS,WAAWC,QACtE,IAAI,MACG,QAEHA,MACJ,OAAO1rB,MA9CE,cA8CU,CACjB,iBAAkB,SAAsBlb,EAAG8C,GACzC,OAAO,mBAAY9C,EAAG8C,EAAGiR,OAAO8jB,QAClC,GACA,IEhDiC,CACnCuO,kBACAI,oBCCSK,wBAAyC,gBAFzC,eACQ,CAAC,QAAS,cAAe,WACoCrwB,OAC9E,IAAI,MACG,YACM,QAETA,KAQJ,SAASswB,aAAa7sB,KAAMqoB,UAC1B,KAAMxiC,gBAAgBgnC,cACpB,MAAM,IAAIzmC,YAAY,oDAGxB,GAAIiiC,WAAa,YAASA,UACxB,MAAM,IAAIz7B,MAAM,qBAAuBy7B,UAGzC,GAAI,YAASroB,OA0Bf,SAA2BikB,OAAQloB,OAAQssB,UAErB,iBAAhBtsB,OAAO6F,MAETqiB,OAAO6I,QAAU/wB,OAAO+wB,QAAUhyB,MAAMiB,OAAO+wB,cAAW9lC,EAC1Di9B,OAAO8I,OAASjyB,MAAMiB,OAAOgxB,QAC7B9I,OAAO+I,KAAOlyB,MAAMiB,OAAOixB,MAC3B/I,OAAO4E,MAAQ/tB,MAAMiB,OAAO8sB,OAC5B5E,OAAO6E,UAAYT,UAAYtsB,OAAO+sB,WAGtCmE,iBAAiBhJ,OAAQloB,OAAOvF,UAAW6xB,UAAYtsB,OAAO+sB,UAElE,CArCIoE,CAAkBrnC,KAAMma,KAAMqoB,eACzB,GAAIroB,MAAQW,QAAQX,KAAK5C,QAAUuD,QAAQX,KAAKmtB,MAAQxsB,QAAQX,KAAKkc,MAE1Er2B,KAAKinC,QAAU9sB,KAAKib,OACpBp1B,KAAKknC,OAAS/sB,KAAK5C,MACnBvX,KAAKmnC,KAAOhtB,KAAKmtB,IACjBtnC,KAAKgjC,MAAQ7oB,KAAKkc,KAClBr2B,KAAKijC,UAAYT,UAAYroB,KAAKqoB,cAC7B,GAAI1nB,QAAQX,MAEjBitB,iBAAiBpnC,KAAMma,KAAMqoB,cACxB,IAAIroB,KAET,MAAM,IAAI0B,UAAU,6BAA+B,UAAO1B,MAAQ,KAGlEna,KAAKinC,QAAU,GACfjnC,KAAKknC,OAAS,GACdlnC,KAAKmnC,KAAO,CAAC,GACbnnC,KAAKgjC,MAAQ,CAAC,EAAG,GACjBhjC,KAAKijC,UAAYT,QACnB,CACF,CAiBA,SAAS4E,iBAAiBhJ,OAAQjkB,KAAMqoB,UAEtCpE,OAAO6I,QAAU,GACjB7I,OAAO8I,OAAS,GAChB9I,OAAO+I,KAAO,GACd/I,OAAO6E,UAAYT,SAEnB,IAAIgC,KAAOrqB,KAAK5Y,OACZmjC,QAAU,EAEVp6B,GAAKi9B,YAELC,KAAO,EAUX,GARI,YAAShF,YAEXl4B,GAAK8Q,MAAMc,KAAKqrB,YAAa,CAAC/E,SAAUA,YAAc+E,YAEtDC,KAAOpsB,MAAMoB,QAAQ,EAAGgmB,WAItBgC,KAAO,EAAG,CAEZ,IAAIh9B,EAAI,EAER,EAAG,CAED42B,OAAO+I,KAAKr5B,KAAKswB,OAAO8I,OAAO3lC,QAG/B,IAAK,IAAIK,EAAI,EAAGA,EAAI4iC,KAAM5iC,IAAK,CAE7B,IAAI6iC,IAAMtqB,KAAKvY,GAEf,GAAIkZ,QAAQ2pB,MAOV,GALU,IAANj9B,GAAWk9B,QAAUD,IAAIljC,SAC3BmjC,QAAUD,IAAIljC,QAIZiG,EAAIi9B,IAAIljC,OAAQ,CAElB,IAAI4S,EAAIswB,IAAIj9B,GAEP8C,GAAG6J,EAAGqzB,QAETpJ,OAAO6I,QAAQn5B,KAAKqG,GAGpBiqB,OAAO8I,OAAOp5B,KAAKlM,GAEvB,OAGU,IAAN4F,GAAWk9B,QAAU,IACvBA,QAAU,GAIPp6B,GAAGm6B,IAAK+C,QAEXpJ,OAAO6I,QAAQn5B,KAAK22B,KAGpBrG,OAAO8I,OAAOp5B,KAAKlM,GAGzB,CAGA4F,GACF,OAASA,EAAIk9B,QACf,CAGAtG,OAAO+I,KAAKr5B,KAAKswB,OAAO8I,OAAO3lC,QAG/B68B,OAAO4E,MAAQ,CAACwB,KAAME,QACxB,CA4HA,SAAS+C,WAAWrJ,OAAQ3W,KAE1B,IAAKiL,QAAQjL,KACX,MAAM,IAAI5L,UAAU,iBAKtB,GAFe4L,IAAI2b,WAIjB,OAAOhF,OAAOjY,IAAIsB,IAAI5gB,OAIxB,IAOIjF,EAAG+f,GAAIrb,EAAGohC,GAPVrR,KAAO5O,IAAI4O,OAEf,GAAIA,KAAK90B,SAAW68B,OAAO4E,MAAMzhC,OAC/B,MAAM,IAAIu3B,eAAezC,KAAK90B,OAAQ68B,OAAO4E,MAAMzhC,QAMrD,IAAIsF,IAAM4gB,IAAI5gB,MACVC,IAAM2gB,IAAI3gB,MAEd,IAAKlF,EAAI,EAAG+f,GAAKyc,OAAO4E,MAAMzhC,OAAQK,EAAI+f,GAAI/f,IAC5Cy3B,cAAcxyB,IAAIjF,GAAIw8B,OAAO4E,MAAMphC,IACnCy3B,cAAcvyB,IAAIlF,GAAIw8B,OAAO4E,MAAMphC,IAIrC,IAAI+lC,QAAUvJ,OAAO6I,QACjBW,OAASxJ,OAAO8I,OAChBW,KAAOzJ,OAAO+I,KAEd3C,KAAO/c,IAAI8b,UAAU,GACrBmB,QAAUjd,IAAI8b,UAAU,GAExB78B,EAAI,GACJohC,GAAK,GAETtD,KAAKltB,SAAQ,SAAU1V,EAAGa,GAExBqlC,GAAGlmC,GAAKa,EAAE,GAEViE,EAAE9E,IAAK,CACT,IAEA,IAAIwzB,OAASuS,QAAU,QAAKxmC,EACxBoW,MAAQ,GACR+vB,IAAM,GAuBV,OArBA5C,QAAQptB,SAAQ,SAAU9P,GAIxB,IAFA8/B,IAAIx5B,KAAKyJ,MAAMhW,QAEV+E,EAAIuhC,KAAKrgC,GAAIkgC,GAAKG,KAAKrgC,EAAI,GAAIlB,EAAIohC,GAAIphC,IAE1C1E,EAAIgmC,OAAOthC,IAEE,IAATI,EAAE9E,KAEJ2V,MAAMzJ,KAAKg6B,GAAGlmC,IAEVwzB,QACFA,OAAOtnB,KAAK65B,QAAQrhC,IAI5B,IAEAghC,IAAIx5B,KAAKyJ,MAAMhW,QAER,IAAIylC,aAAa,CACtB5R,OACA7d,MACA+vB,IACAjR,KACAmM,SAAUpE,OAAO6E,WAErB,CAEA,SAAS8E,WAAW3J,OAAQ7mB,MAAOksB,UAAWlK,cAE5C,IAAKhiB,QAA2B,IAAlBA,MAAMmb,QAClB,MAAM,IAAI7W,UAAU,iBAItB,IAGI6nB,MAHAC,MAAQpsB,MAAM8e,OACd+M,SAAW7rB,MAAM6rB,WAerB,GAXI,YAASK,YAEXC,MAAQD,UAAUpN,OAElBoN,UAAYA,UAAUb,WAGtBc,MAAQ,gBAAUD,WAIhBL,SAAU,CAEZ,GAAqB,IAAjBM,MAAMniC,OACR,MAAM,IAAIsa,UAAU,mBAItBuiB,OAAOxoB,IAAI2B,MAAM1Q,MAAO48B,UAAWlK,aACrC,KAAO,CAEL,GAAqB,IAAjBoK,MAAMpiC,QAAiC,IAAjBoiC,MAAMpiC,OAC9B,MAAM,IAAIu3B,eAAe6K,MAAMpiC,OAAQ68B,OAAO4E,MAAMzhC,OAAQ,KAI9D,GAAImiC,MAAMniC,OAASoiC,MAAMpiC,OAAQ,CAK/B,IAHA,IAAIK,EAAI,EACJo5B,MAAQ,EAEQ,IAAb2I,MAAM/hC,IAAyB,IAAb8hC,MAAM9hC,IAC7BA,IAGF,KAAoB,IAAb+hC,MAAM/hC,IACXo5B,QACAp5B,IAIF6hC,UAAY3I,UAAU2I,UAAWE,MAAMpiC,OAAQy5B,MAAO0I,MACxD,CAGA,IAAKjP,gBAAgBkP,MAAOD,OAC1B,MAAM,IAAI5K,eAAe6K,MAAOD,MAAO,KAIzC,GAAqB,IAAjBC,MAAMpiC,OAAc,CAEVgW,MAAMgsB,UAAU,GACtBjsB,SAAQ,SAAUwsB,UAAWC,UACjC1K,cAAcyK,WACd1F,OAAOxoB,IAAI,CAACkuB,UAAW,GAAIL,UAAUM,SAAS,IAAKxK,aACrD,GACF,KAAO,CAEL,IAAIyO,oBAAsBzwB,MAAMgsB,UAAU,GACtC0E,qBAAuB1wB,MAAMgsB,UAAU,GAC3CyE,oBAAoB1wB,SAAQ,SAAU4wB,eAAgBC,eACpD9O,cAAc6O,gBACdD,qBAAqB3wB,SAAQ,SAAU8wB,gBAAiBC,gBACtDhP,cAAc+O,iBACdhK,OAAOxoB,IAAI,CAACsyB,eAAgBE,iBAAkB3E,UAAU0E,cAAc,IAAIE,eAAe,IAAK9O,aAChG,GACF,GACF,CACF,CAEA,OAAO6E,MACT,CAqHA,SAASkK,eAAe1mC,EAAG2mC,IAAKC,OAAQjxB,OAEtC,GAAIixB,OAASD,KAAQ,EACnB,OAAOC,OAIT,IAAK,IAAI/lC,EAAI8lC,IAAK9lC,EAAI+lC,OAAQ/lC,IAE5B,GAAI8U,MAAM9U,KAAOb,EACf,OAAOa,EAKX,OAAO8lC,GACT,CAYA,SAASE,QAAQniC,EAAG1E,EAAG4F,EAAG2M,EAAGihB,OAAQ7d,MAAO+vB,KAE1ClS,OAAO3P,OAAOnf,EAAG,EAAG6N,GAEpBoD,MAAMkO,OAAOnf,EAAG,EAAG1E,GAEnB,IAAK,IAAI1B,EAAIsH,EAAI,EAAGtH,EAAIonC,IAAI/lC,OAAQrB,IAClConC,IAAIpnC,IAER,CA6CA,SAASs5B,QAAQ4E,OAAQoG,KAAME,QAASnL,cAEtC,IAAItd,MAAQsd,cAAgB,EAExBjvB,GAAKi9B,YAELC,KAAO,EAEP,YAASpJ,OAAO6E,aAElB34B,GAAK8Q,MAAMc,KAAKqrB,YAAa,CAACnJ,OAAO6E,UAAW7E,OAAO6E,aAAesE,YAEtEC,KAAOpsB,MAAMoB,QAAQ,EAAG4hB,OAAO6E,WAE/BhnB,MAAQb,MAAMoB,QAAQP,MAAOmiB,OAAO6E,YAItC,IAIIrhC,EAAG4F,EAAGlB,EAJNoiC,KAAOp+B,GAAG2R,MAAOurB,MAEjB/kC,EAAI27B,OAAO4E,MAAM,GACjBnhC,EAAIu8B,OAAO4E,MAAM,GAGrB,GAAI0B,QAAU7iC,EAAG,CAEf,IAAK2F,EAAI3F,EAAG2F,EAAIk9B,QAASl9B,IAIvB,GAFA42B,OAAO+I,KAAK3/B,GAAK42B,OAAO6I,QAAQ1lC,OAE5BmnC,IAEF,IAAK9mC,EAAI,EAAGA,EAAIa,EAAGb,IAEjBw8B,OAAO6I,QAAQn5B,KAAKmO,OAGpBmiB,OAAO8I,OAAOp5B,KAAKlM,GAMzBw8B,OAAO+I,KAAKzC,SAAWtG,OAAO6I,QAAQ1lC,MACxC,MAAWmjC,QAAU7iC,IAEnBu8B,OAAO+I,KAAK1hB,OAAOif,QAAU,EAAG7iC,EAAI6iC,SAGpCtG,OAAO6I,QAAQxhB,OAAO2Y,OAAO+I,KAAKzC,SAAUtG,OAAO6I,QAAQ1lC,QAE3D68B,OAAO8I,OAAOzhB,OAAO2Y,OAAO+I,KAAKzC,SAAUtG,OAAO8I,OAAO3lC,SAM3D,GAFAM,EAAI6iC,QAEAF,KAAO/hC,GAET,GAAIimC,IAAK,CAEP,IAAI3+B,EAAI,EAER,IAAKvC,EAAI,EAAGA,EAAI3F,EAAG2F,IAAK,CAEtB42B,OAAO+I,KAAK3/B,GAAK42B,OAAO+I,KAAK3/B,GAAKuC,EAElCzD,EAAI83B,OAAO+I,KAAK3/B,EAAI,GAAKuC,EAEzB,IAAI4J,EAAI,EAER,IAAK/R,EAAIa,EAAGb,EAAI4iC,KAAM5iC,IAAK+R,IAEzByqB,OAAO6I,QAAQxhB,OAAOnf,EAAIqN,EAAG,EAAGsI,OAGhCmiB,OAAO8I,OAAOzhB,OAAOnf,EAAIqN,EAAG,EAAG/R,GAG/BmI,GAEJ,CAGAq0B,OAAO+I,KAAKtlC,GAAKu8B,OAAO6I,QAAQ1lC,MAClC,OACK,GAAIijC,KAAO/hC,EAAG,CAEnB,IAAIN,EAAI,EAER,IAAKqF,EAAI,EAAGA,EAAI3F,EAAG2F,IAAK,CAEtB42B,OAAO+I,KAAK3/B,GAAK42B,OAAO+I,KAAK3/B,GAAKrF,EAElC,IAAIwmC,GAAKvK,OAAO+I,KAAK3/B,GACjBohC,GAAKxK,OAAO+I,KAAK3/B,EAAI,GAAKrF,EAE9B,IAAKmE,EAAIqiC,GAAIriC,EAAIsiC,GAAItiC,KAEnB1E,EAAIw8B,OAAO8I,OAAO5gC,IAEVk+B,KAAO,IAEbpG,OAAO6I,QAAQxhB,OAAOnf,EAAG,GAGzB83B,OAAO8I,OAAOzhB,OAAOnf,EAAG,GAGxBnE,IAGN,CAGAi8B,OAAO+I,KAAK3/B,GAAK42B,OAAO6I,QAAQ1lC,MAClC,CAMA,OAHA68B,OAAO4E,MAAM,GAAKwB,KAClBpG,OAAO4E,MAAM,GAAK0B,QAEXtG,MACT,CA6VA,SAASyK,SAASzT,OAAQ7d,MAAO+vB,IAAKjR,KAAMrhB,MAE1C,IAKIpT,EAAG4F,EALHg9B,KAAOnO,KAAK,GACZqO,QAAUrO,KAAK,GAEf51B,EAAI,GAIR,IAAKmB,EAAI,EAAGA,EAAI4iC,KAAM5iC,IAGpB,IAFAnB,EAAEmB,GAAK,GAEF4F,EAAI,EAAGA,EAAIk9B,QAASl9B,IACvB/G,EAAEmB,GAAG4F,GAAK,EAKd,IAAKA,EAAI,EAAGA,EAAIk9B,QAASl9B,IAKvB,IAHA,IAAImhC,GAAKrB,IAAI9/B,GACTohC,GAAKtB,IAAI9/B,EAAI,GAERlB,EAAIqiC,GAAIriC,EAAIsiC,GAAItiC,IAIvB7F,EAFAmB,EAAI2V,MAAMjR,IAELkB,GAAK4tB,OAASpgB,KAAOC,MAAMmgB,OAAO9uB,IAAM8uB,OAAO9uB,GAAK,EAI7D,OAAO7F,CACT,CAyaA,OAz4CAumC,aAAa/kC,UAAY,IAAIqgC,OAK7B0E,aAAa/kC,UAAU6mC,mBAAqB,SAAU3uB,KAAMqoB,UAC1D,OAAO,IAAIwE,aAAa7sB,KAAMqoB,SAChC,EAMAwE,aAAa/kC,UAAU8Z,KAAO,eAC9BirB,aAAa/kC,UAAUuwB,gBAAiB,EAWxCwU,aAAa/kC,UAAUkiC,YAAc,WACnC,OAAO/I,iBAAiBp7B,KAAKinC,QAAS,UACxC,EAYAD,aAAa/kC,UAAUsgC,QAAU,WAC/B,MAAO,QACT,EAYAyE,aAAa/kC,UAAUugC,SAAW,WAChC,OAAOxiC,KAAKijC,SACd,EASA+D,aAAa/kC,UAAU0Y,OAAS,SAAUR,KAAMqoB,UAC9C,OAAO,IAAIwE,aAAa7sB,KAAMqoB,SAChC,EAYAwE,aAAa/kC,UAAU8mC,QAAU,WAE/B,IAAIvE,KAAOxkC,KAAKgjC,MAAM,GAClB0B,QAAU1kC,KAAKgjC,MAAM,GAEzB,OAAgB,IAATwB,MAA0B,IAAZE,QAAgB1kC,KAAKknC,OAAO3lC,QAAUijC,KAAOE,SAAW,CAC/E,EAiBAsC,aAAa/kC,UAAUwgC,OAAS,SAAUlrB,MAAOgqB,YAAahI,cAE5D,IAAKv5B,KAAKinC,QACR,MAAM,IAAIlgC,MAAM,iDAIlB,OAAQ2N,UAAUnT,QAChB,KAAK,EACH,OAAOkmC,WAAWznC,KAAMuX,OAG1B,KAAK,EACL,KAAK,EACH,OAAOwwB,WAAW/nC,KAAMuX,MAAOgqB,YAAahI,cAE9C,QACE,MAAM,IAAIh5B,YAAY,6BAE5B,EAkLAymC,aAAa/kC,UAAUkkB,IAAM,SAAU5O,OACrC,IAAKuD,QAAQvD,OACX,MAAM,IAAIsE,UAAU,kBAGtB,GAAItE,MAAMhW,SAAWvB,KAAKgjC,MAAMzhC,OAC9B,MAAM,IAAIu3B,eAAevhB,MAAMhW,OAAQvB,KAAKgjC,MAAMzhC,QAIpD,IAAKvB,KAAKinC,QACR,MAAM,IAAIlgC,MAAM,8CAIlB,IAAInF,EAAI2V,MAAM,GACV/P,EAAI+P,MAAM,GAEd8hB,cAAcz3B,EAAG5B,KAAKgjC,MAAM,IAC5B3J,cAAc7xB,EAAGxH,KAAKgjC,MAAM,IAE5B,IAAI18B,EAAIgiC,eAAe1mC,EAAG5B,KAAKmnC,KAAK3/B,GAAIxH,KAAKmnC,KAAK3/B,EAAI,GAAIxH,KAAKknC,QAG/D,OAAI5gC,EAAItG,KAAKmnC,KAAK3/B,EAAI,IAAMxH,KAAKknC,OAAO5gC,KAAO1E,EACtC5B,KAAKinC,QAAQ3gC,GAGf,CACT,EAaA0gC,aAAa/kC,UAAU2T,IAAM,SAAU2B,MAAOpD,EAAGolB,cAC/C,IAAKze,QAAQvD,OACX,MAAM,IAAIsE,UAAU,kBAGtB,GAAItE,MAAMhW,SAAWvB,KAAKgjC,MAAMzhC,OAC9B,MAAM,IAAIu3B,eAAevhB,MAAMhW,OAAQvB,KAAKgjC,MAAMzhC,QAIpD,IAAKvB,KAAKinC,QACR,MAAM,IAAIlgC,MAAM,8CAIlB,IAAInF,EAAI2V,MAAM,GACV/P,EAAI+P,MAAM,GAEVitB,KAAOxkC,KAAKgjC,MAAM,GAClB0B,QAAU1kC,KAAKgjC,MAAM,GAErB14B,GAAKi9B,YAELC,KAAO,EAEP,YAASxnC,KAAKijC,aAEhB34B,GAAK8Q,MAAMc,KAAKqrB,YAAa,CAACvnC,KAAKijC,UAAWjjC,KAAKijC,aAAesE,YAElEC,KAAOpsB,MAAMoB,QAAQ,EAAGxc,KAAKijC,aAI3BrhC,EAAI4iC,KAAO,GAAKh9B,EAAIk9B,QAAU,KAEhClL,QAAQx5B,KAAMG,KAAK2G,IAAIlF,EAAI,EAAG4iC,MAAOrkC,KAAK2G,IAAIU,EAAI,EAAGk9B,SAAUnL,cAG/DiL,KAAOxkC,KAAKgjC,MAAM,GAClB0B,QAAU1kC,KAAKgjC,MAAM,IAIvB3J,cAAcz3B,EAAG4iC,MACjBnL,cAAc7xB,EAAGk9B,SAEjB,IAAIp+B,EAAIgiC,eAAe1mC,EAAG5B,KAAKmnC,KAAK3/B,GAAIxH,KAAKmnC,KAAK3/B,EAAI,GAAIxH,KAAKknC,QAiB/D,OAdI5gC,EAAItG,KAAKmnC,KAAK3/B,EAAI,IAAMxH,KAAKknC,OAAO5gC,KAAO1E,EAExC0I,GAAG6J,EAAGqzB,MAiCf,SAAiBlhC,EAAGkB,EAAG4tB,OAAQ7d,MAAO+vB,KAEpClS,OAAO3P,OAAOnf,EAAG,GACjBiR,MAAMkO,OAAOnf,EAAG,GAEhB,IAAK,IAAIpG,EAAIsH,EAAI,EAAGtH,EAAIonC,IAAI/lC,OAAQrB,IAClConC,IAAIpnC,IAER,CApCM8oC,CAAQ1iC,EAAGkB,EAAGxH,KAAKinC,QAASjnC,KAAKknC,OAAQlnC,KAAKmnC,MAH9CnnC,KAAKinC,QAAQ3gC,GAAK6N,EAOpBs0B,QAAQniC,EAAG1E,EAAG4F,EAAG2M,EAAGnU,KAAKinC,QAASjnC,KAAKknC,OAAQlnC,KAAKmnC,MAG/CnnC,IACT,EAyDAgnC,aAAa/kC,UAAUq3B,OAAS,SAAUjD,KAAMkD,aAAcvkB,MAE5D,IAAK,gBAAaqhB,MAChB,MAAM,IAAIxa,UAAU,4BAItB,IAAIwoB,UAAYhO,KAAK1lB,UAAUmM,KAAIb,OAC1BpB,MAAMC,QAAQmB,QAA2B,IAAjBA,MAAM1a,OAAe0a,MAAM,GAAKA,QAGjE,GAAyB,IAArBooB,UAAU9iC,OACZ,MAAM,IAAIwF,MAAM,4CAYlB,OARAs9B,UAAU/sB,SAAQ,SAAU2E,OAC1B,IAAK+V,SAAS/V,SAAWtP,UAAUsP,QAAUA,MAAQ,EACnD,MAAM,IAAIJ,UAAU,uDAA8D,cAAOwoB,WAAa,IAE1G,IAIO7K,QAFCxkB,KAAOhV,KAAKiV,QAAUjV,KAEZqkC,UAAU,GAAIA,UAAU,GAAI9K,aAChD,EAgJAyN,aAAa/kC,UAAU43B,QAAU,SAAUC,MAAO9kB,MAEhD,IAAK8F,QAAQgf,OACX,MAAM,IAAIje,UAAU,kBAGtB,GAAqB,IAAjBie,MAAMv4B,OACR,MAAM,IAAIwF,MAAM,0DAIlB+yB,MAAMxiB,SAAQ,SAAU2E,OACtB,IAAK+V,SAAS/V,SAAWtP,UAAUsP,QAAUA,QAAU,GAAe,IAAVA,MAC1D,MAAM,IAAIJ,UAAU,6DAAoE,cAAOie,OAAS,IAE5G,IACA,IAAII,cAAgBl6B,KAAKgjC,MAAM,GAAKhjC,KAAKgjC,MAAM,GAI/C,GAAI9I,iBAHJJ,MAAQO,qBAAqBP,MAAOI,gBACd,GAAKJ,MAAM,GAG/B,MAAM,IAAI/yB,MAAM,uEAIlB,IAAI+C,EAAIkL,KAAOhV,KAAKiV,QAAUjV,KAE9B,GAAIA,KAAKgjC,MAAM,KAAOlJ,MAAM,IAAM95B,KAAKgjC,MAAM,KAAOlJ,MAAM,GACxD,OAAOhwB,EAMT,IAFA,IAAIm/B,SAAW,GAENrnC,EAAI,EAAGA,EAAIkI,EAAEq9B,KAAK5lC,OAAQK,IACjC,IAAK,IAAI4F,EAAI,EAAGA,EAAIsC,EAAEq9B,KAAKvlC,EAAI,GAAKkI,EAAEq9B,KAAKvlC,GAAI4F,IAC7CyhC,SAASn7B,KAAKlM,GAWlB,IANA,IAAIwzB,OAAStrB,EAAEm9B,QAAQ78B,QAGnB8+B,SAAWp/B,EAAEo9B,OAAO98B,QAGf++B,GAAK,EAAGA,GAAKr/B,EAAEo9B,OAAO3lC,OAAQ4nC,KAAM,CAC3C,IAAIC,GAAKF,SAASC,IACdE,GAAKJ,SAASE,IACdnP,KAAOoP,GAAKt/B,EAAEk5B,MAAM,GAAKqG,GAC7BJ,SAASE,IAAMnP,KAAOF,MAAM,GAC5BoP,SAASC,IAAMhpC,KAAK8D,MAAM+1B,KAAOF,MAAM,GACzC,CAOAhwB,EAAEm9B,QAAQ1lC,OAAS,EACnBuI,EAAEo9B,OAAO3lC,OAAS,EAClBuI,EAAEq9B,KAAK5lC,OAASu4B,MAAM,GAAK,EAC3BhwB,EAAEk5B,MAAQlJ,MAAM1vB,QAEhB,IAAK,IAAIk/B,IAAM,EAAGA,IAAMx/B,EAAEq9B,KAAK5lC,OAAQ+nC,MACrCx/B,EAAEq9B,KAAKmC,KAAO,EAKhB,IAAK,IAAIC,EAAI,EAAGA,EAAInU,OAAO7zB,OAAQgoC,IAAK,CACtC,IAAIC,IAAMN,SAASK,GACfE,GAAKR,SAASM,GACdp1B,EAAIihB,OAAOmU,GAIfd,QAFQH,eAAekB,IAAK1/B,EAAEq9B,KAAKsC,IAAK3/B,EAAEq9B,KAAKsC,GAAK,GAAI3/B,EAAEo9B,QAE/CsC,IAAKC,GAAIt1B,EAAGrK,EAAEm9B,QAASn9B,EAAEo9B,OAAQp9B,EAAEq9B,KAChD,CAGA,OAAOr9B,CACT,EAQAk9B,aAAa/kC,UAAUgT,MAAQ,WAQ7B,OAPQ,IAAI+xB,aAAa,CACvB5R,OAAQp1B,KAAKinC,QAAUhyB,MAAMjV,KAAKinC,cAAW9lC,EAC7CoW,MAAOtC,MAAMjV,KAAKknC,QAClBI,IAAKryB,MAAMjV,KAAKmnC,MAChB9Q,KAAMphB,MAAMjV,KAAKgjC,OACjBR,SAAUxiC,KAAKijC,WAGnB,EAQA+D,aAAa/kC,UAAUo0B,KAAO,WAC5B,OAAOr2B,KAAKgjC,MAAM54B,MAAM,EAC1B,EAcA48B,aAAa/kC,UAAU6a,IAAM,SAAUnD,SAAU+oB,WAE/C,IAAK1iC,KAAKinC,QACR,MAAM,IAAIlgC,MAAM,8CAIlB,IAAIu9B,GAAKtkC,KAWT,OAQF,SAAco+B,OAAQsL,OAAQC,OAAQC,UAAWC,UAAWlwB,SAAU+oB,WAEpE,IAAItN,OAAS,GACT7d,MAAQ,GACR+vB,IAAM,GAENh9B,GAAKi9B,YAELC,KAAO,EAEP,YAASpJ,OAAO6E,aAElB34B,GAAK8Q,MAAMc,KAAKqrB,YAAa,CAACnJ,OAAO6E,UAAW7E,OAAO6E,aAAesE,YAEtEC,KAAOpsB,MAAMoB,QAAQ,EAAG4hB,OAAO6E,YAiBjC,IAbA,IAAI6G,OAAS,SAAgB31B,EAAGjU,EAAG8C,GAEjCmR,EAAIwF,SAASxF,EAAGjU,EAAG8C,GAEdsH,GAAG6J,EAAGqzB,QAETpS,OAAOtnB,KAAKqG,GAEZoD,MAAMzJ,KAAK5N,GAEf,EAGSsH,EAAIoiC,UAAWpiC,GAAKqiC,UAAWriC,IAAK,CAE3C8/B,IAAIx5B,KAAKsnB,OAAO7zB,QAEhB,IAAIonC,GAAKvK,OAAO+I,KAAK3/B,GACjBohC,GAAKxK,OAAO+I,KAAK3/B,EAAI,GAEzB,GAAIk7B,UAEF,IAAK,IAAIp8B,EAAIqiC,GAAIriC,EAAIsiC,GAAItiC,IAAK,CAE5B,IAAI1E,EAAIw8B,OAAO8I,OAAO5gC,GAElB1E,GAAK8nC,QAAU9nC,GAAK+nC,QAEtBG,OAAO1L,OAAO6I,QAAQ3gC,GAAI1E,EAAI8nC,OAAQliC,EAAIoiC,UAE9C,KACK,CAIL,IAFA,IAAI3C,QAAU,CAAC,EAEN8C,GAAKpB,GAAIoB,GAAKnB,GAAImB,KAAM,CAE/B9C,QADU7I,OAAO8I,OAAO6C,KACT3L,OAAO6I,QAAQ8C,GAChC,CAIA,IAAK,IAAIC,IAAMN,OAAQM,KAAOL,OAAQK,MAAO,CAE3CF,OADYE,OAAO/C,QAAUA,QAAQ+C,KAAO,EAC9BA,IAAMN,OAAQliC,EAAIoiC,UAClC,CACF,CACF,CAKA,OAFAtC,IAAIx5B,KAAKsnB,OAAO7zB,QAET,IAAIylC,aAAa,CACtB5R,OACA7d,MACA+vB,IACAjR,KAAM,CAACsT,OAASD,OAAS,EAAGG,UAAYD,UAAY,IAExD,CApFSK,CAAKjqC,KAAM,EATPA,KAAKgjC,MAAM,GASM,EAAG,EARjBhjC,KAAKgjC,MAAM,GAQmB,GAN/B,SAAgB7uB,EAAGvS,EAAG4F,GAEjC,OAAOmS,SAASxF,EAAG,CAACvS,EAAG4F,GAAI88B,GAC7B,GAGuD5B,UACzD,EAgGAsE,aAAa/kC,UAAUqV,QAAU,SAAUqC,SAAU+oB,WAEnD,IAAK1iC,KAAKinC,QACR,MAAM,IAAIlgC,MAAM,kDASlB,IALA,IAEIy9B,KAAOxkC,KAAKgjC,MAAM,GAClB0B,QAAU1kC,KAAKgjC,MAAM,GAEhBx7B,EAAI,EAAGA,EAAIk9B,QAASl9B,IAAK,CAEhC,IAAImhC,GAAK3oC,KAAKmnC,KAAK3/B,GACfohC,GAAK5oC,KAAKmnC,KAAK3/B,EAAI,GAEvB,GAAIk7B,UAEF,IAAK,IAAIp8B,EAAIqiC,GAAIriC,EAAIsiC,GAAItiC,IAAK,CAE5B,IAAI1E,EAAI5B,KAAKknC,OAAO5gC,GAEpBqT,SAAS3Z,KAAKinC,QAAQ3gC,GAAI,CAAC1E,EAAG4F,GAhB3BxH,KAiBL,KACK,CAIL,IAFA,IAAIo1B,OAAS,CAAC,EAEL8U,IAAMvB,GAAIuB,IAAMtB,GAAIsB,MAAO,CAElC9U,OADUp1B,KAAKknC,OAAOgD,MACRlqC,KAAKinC,QAAQiD,IAC7B,CAIA,IAAK,IAAIC,IAAM,EAAGA,IAAM3F,KAAM2F,MAAO,CAEnCxwB,SADYwwB,OAAO/U,OAASA,OAAO+U,KAAO,EAC1B,CAACA,IAAK3iC,GA/BnBxH,KAgCL,CACF,CACF,CACF,EAOAgnC,aAAa/kC,UAAUokB,OAAOsc,UAAY,YACxC,IAAK3iC,KAAKinC,QACR,MAAM,IAAIlgC,MAAM,wCAKlB,IAFA,IAAI29B,QAAU1kC,KAAKgjC,MAAM,GAEhBx7B,EAAI,EAAGA,EAAIk9B,QAASl9B,IAI3B,IAHA,IAAImhC,GAAK3oC,KAAKmnC,KAAK3/B,GACfohC,GAAK5oC,KAAKmnC,KAAK3/B,EAAI,GAEdlB,EAAIqiC,GAAIriC,EAAIsiC,GAAItiC,IAAK,CAE5B,IAAI1E,EAAI5B,KAAKknC,OAAO5gC,QACd,CACJ2V,MAAOjc,KAAKinC,QAAQ3gC,GACpBiR,MAAO,CAAC3V,EAAG4F,GAEf,CAEJ,EAQAw/B,aAAa/kC,UAAU2gC,QAAU,WAC/B,OAAOiG,SAAS7oC,KAAKinC,QAASjnC,KAAKknC,OAAQlnC,KAAKmnC,KAAMnnC,KAAKgjC,OAAO,EACpE,EAQAgE,aAAa/kC,UAAU0O,QAAU,WAC/B,OAAOk4B,SAAS7oC,KAAKinC,QAASjnC,KAAKknC,OAAQlnC,KAAKmnC,KAAMnnC,KAAKgjC,OAAO,EACpE,EA8CAgE,aAAa/kC,UAAUs0B,OAAS,SAAUlL,SASxC,IAPA,IAAImZ,KAAOxkC,KAAKgjC,MAAM,GAClB0B,QAAU1kC,KAAKgjC,MAAM,GAErB+F,QAAU/oC,KAAK+oC,UAEftiC,IAAM,kBAAoB,cAAO+9B,KAAMnZ,SAAW,MAAQ,cAAOqZ,QAASrZ,SAAW,cAAgB,cAAO0d,QAAS1d,SAAW,KAE3H7jB,EAAI,EAAGA,EAAIk9B,QAASl9B,IAK3B,IAHA,IAAImhC,GAAK3oC,KAAKmnC,KAAK3/B,GACfohC,GAAK5oC,KAAKmnC,KAAK3/B,EAAI,GAEdlB,EAAIqiC,GAAIriC,EAAIsiC,GAAItiC,IAAK,CAI5BG,KAAO,UAAY,cAFXzG,KAAKknC,OAAO5gC,GAES+kB,SAAW,KAAO,cAAO7jB,EAAG6jB,SAAW,UAAYrrB,KAAKinC,QAAU,cAAOjnC,KAAKinC,QAAQ3gC,GAAI+kB,SAAW,IACpI,CAGF,OAAO5kB,GACT,EAQAugC,aAAa/kC,UAAUqH,SAAW,WAChC,OAAO,cAAOtJ,KAAK4iC,UACrB,EAQAoE,aAAa/kC,UAAU2O,OAAS,WAC9B,MAAO,CACLi0B,OAAQ,eACRzP,OAAQp1B,KAAKinC,QACb1vB,MAAOvX,KAAKknC,OACZI,IAAKtnC,KAAKmnC,KACV9Q,KAAMr2B,KAAKgjC,MACXR,SAAUxiC,KAAKijC,UAEnB,EAWA+D,aAAa/kC,UAAU6iC,SAAW,SAAUx+B,GAE1C,GAAIA,GAOF,GALI2rB,YAAY3rB,KACdA,EAAIA,EAAE2J,aAIH+hB,SAAS1rB,KAAOqG,UAAUrG,GAC7B,MAAM,IAAIuV,UAAU,kDAItBvV,EAAI,EAGN,IAAIy+B,OAASz+B,EAAI,EAAIA,EAAI,EACrB0+B,KAAO1+B,EAAI,GAAKA,EAAI,EAEpBk+B,KAAOxkC,KAAKgjC,MAAM,GAClB0B,QAAU1kC,KAAKgjC,MAAM,GAErBj5B,EAAI5J,KAAK0G,IAAI29B,KAAOQ,KAAMN,QAAUK,QAEpC3P,OAAS,GACT7d,MAAQ,GACR+vB,IAAM,GAEVA,IAAI,GAAK,EAET,IAAK,IAAI9/B,EAAIu9B,OAAQv9B,EAAIk9B,SAAWtP,OAAO7zB,OAASwI,EAAGvC,IAKrD,IAHA,IAAImhC,GAAK3oC,KAAKmnC,KAAK3/B,GACfohC,GAAK5oC,KAAKmnC,KAAK3/B,EAAI,GAEdtH,EAAIyoC,GAAIzoC,EAAI0oC,GAAI1oC,IAAK,CAE5B,IAAI0B,EAAI5B,KAAKknC,OAAOhnC,GAEpB,GAAI0B,IAAM4F,EAAIu9B,OAASC,KAAM,CAE3B5P,OAAOtnB,KAAK9N,KAAKinC,QAAQ/mC,IAEzBqX,MAAM6d,OAAO7zB,OAAS,GAAKK,EAAIojC,KAE/B,KACF,CACF,CAMF,OAFAsC,IAAIx5B,KAAKsnB,OAAO7zB,QAET,IAAIylC,aAAa,CACtB5R,OACA7d,MACA+vB,IACAjR,KAAM,CAACtsB,EAAG,IAEd,EAWAi9B,aAAa9B,SAAW,SAAUzH,MAChC,OAAO,IAAIuJ,aAAavJ,KAC1B,EAeAuJ,aAAalC,SAAW,SAAUzO,KAAMpa,MAAO3V,EAAGizB,aAAciJ,UAC9D,IAAK1nB,QAAQub,MACX,MAAM,IAAIxa,UAAU,kCAGtB,GAAoB,IAAhBwa,KAAK90B,OACP,MAAM,IAAIwF,MAAM,4CAmBlB,GAfAsvB,KAAOA,KAAKvZ,KAAI,SAAU7U,GAQxB,GANIgqB,YAAYhqB,KAEdA,EAAIA,EAAEgI,aAIH+hB,SAAS/pB,KAAO0E,UAAU1E,IAAMA,EAAI,EACvC,MAAM,IAAIlB,MAAM,yCAGlB,OAAOkB,CACT,IAEI3B,GAOF,GALI2rB,YAAY3rB,KACdA,EAAIA,EAAE2J,aAIH+hB,SAAS1rB,KAAOqG,UAAUrG,GAC7B,MAAM,IAAIuV,UAAU,kDAItBvV,EAAI,EAIN,IAAIgE,GAAKi9B,YAELC,KAAO,EAEP,YAAShF,YAEXl4B,GAAK8Q,MAAMc,KAAKqrB,YAAa,CAAC/E,SAAUA,YAAc+E,YAEtDC,KAAOpsB,MAAMoB,QAAQ,EAAGgmB,WAG1B,IAQIxN,OARA+P,OAASz+B,EAAI,EAAIA,EAAI,EACrB0+B,KAAO1+B,EAAI,GAAKA,EAAI,EAEpBk+B,KAAOnO,KAAK,GACZqO,QAAUrO,KAAK,GAEftsB,EAAI5J,KAAK0G,IAAI29B,KAAOQ,KAAMN,QAAUK,QAKxC,GAAIjqB,QAAQmB,OAAQ,CAElB,GAAIA,MAAM1a,SAAWwI,EAEnB,MAAM,IAAIhD,MAAM,8BAIlBiuB,OAAS,SAAgBpzB,GAEvB,OAAOqa,MAAMra,EACf,CACF,MAAO,GAAI,YAASqa,OAAQ,CAE1B,IAAIgpB,GAAKhpB,MAAMoa,OAEf,GAAkB,IAAd4O,GAAG1jC,QAAgB0jC,GAAG,KAAOl7B,EAE/B,MAAM,IAAIhD,MAAM,yBAIlBiuB,OAAS,SAAgBpzB,GAEvB,OAAOqa,MAAMkK,IAAI,CAACvkB,GACpB,CACF,MAEEozB,OAAS,WAEP,OAAO/Y,KACT,EAQF,IAJA,IAAImZ,OAAS,GACT7d,MAAQ,GACR+vB,IAAM,GAED9/B,EAAI,EAAGA,EAAIk9B,QAASl9B,IAAK,CAEhC8/B,IAAIx5B,KAAKsnB,OAAO7zB,QAEhB,IAAIK,EAAI4F,EAAIu9B,OAEZ,GAAInjC,GAAK,GAAKA,EAAImI,EAAG,CAEnB,IAAIoK,EAAI6gB,OAAOpzB,GAGV0I,GAAG6J,EAAGqzB,QAETjwB,MAAMzJ,KAAKlM,EAAIojC,MAEf5P,OAAOtnB,KAAKqG,GAEhB,CACF,CAKA,OAFAmzB,IAAIx5B,KAAKsnB,OAAO7zB,QAET,IAAIylC,aAAa,CACtB5R,OACA7d,MACA+vB,IACAjR,KAAM,CAACmO,KAAME,UAEjB,EAYAsC,aAAa/kC,UAAUkjC,SAAW,SAAUvjC,EAAG4F,GAE7C,KAAKwqB,SAASpwB,IAAO+K,UAAU/K,IAAOowB,SAASxqB,IAAOmF,UAAUnF,IAC9D,MAAM,IAAIT,MAAM,uCAIlB,GAA0B,IAAtB/G,KAAKgjC,MAAMzhC,OACb,MAAM,IAAIwF,MAAM,4CAUlB,OANAsyB,cAAcz3B,EAAG5B,KAAKgjC,MAAM,IAC5B3J,cAAc7xB,EAAGxH,KAAKgjC,MAAM,IAE5BgE,aAAa5B,UAAUxjC,EAAG4F,EAAGxH,KAAKgjC,MAAM,GAAIhjC,KAAKinC,QAASjnC,KAAKknC,OAAQlnC,KAAKmnC,MAGrEnnC,IACT,EAYAgnC,aAAaoD,YAAc,SAAU5iC,EAAG4tB,OAAQ7d,MAAO+vB,IAAK3tB,UAK1D,IAHA,IAAIgvB,GAAKrB,IAAI9/B,GACTohC,GAAKtB,IAAI9/B,EAAI,GAERlB,EAAIqiC,GAAIriC,EAAIsiC,GAAItiC,IAEvBqT,SAASpC,MAAMjR,GAAI8uB,OAAO9uB,GAE9B,EAaA0gC,aAAa5B,UAAY,SAAUllC,EAAG8C,EAAG0hC,QAAStP,OAAQ7d,MAAO+vB,KAE/D,IAAK,IAAI9/B,EAAI,EAAGA,EAAIk9B,QAASl9B,IAAK,CAEhC,IAAImhC,GAAKrB,IAAI9/B,GACTohC,GAAKtB,IAAI9/B,EAAI,GAEb6iC,GAAK/B,eAAepoC,EAAGyoC,GAAIC,GAAIrxB,OAG/B+yB,GAAKhC,eAAetlC,EAAG2lC,GAAIC,GAAIrxB,OAGnC,GAAI8yB,GAAKzB,IAAM0B,GAAK1B,IAAMrxB,MAAM8yB,MAAQnqC,GAAKqX,MAAM+yB,MAAQtnC,GAEzD,GAAIoyB,OAAQ,CACV,IAAIjhB,EAAIihB,OAAOiV,IACfjV,OAAOiV,IAAMjV,OAAOkV,IACpBlV,OAAOkV,IAAMn2B,CACf,OAOF,GAAIk2B,GAAKzB,IAAMrxB,MAAM8yB,MAAQnqC,IAAMoqC,IAAM1B,IAAMrxB,MAAM+yB,MAAQtnC,GAA7D,CAEE,IAAIunC,GAAKnV,OAASA,OAAOiV,SAAMlpC,EAE/BoW,MAAMkO,OAAO6kB,GAAI,EAAGtnC,GAEhBoyB,QACFA,OAAO3P,OAAO6kB,GAAI,EAAGC,IAIvBhzB,MAAMkO,OAAO6kB,IAAMD,GAAKA,GAAK,EAAIA,GAAI,GAEjCjV,QACFA,OAAO3P,OAAO6kB,IAAMD,GAAKA,GAAK,EAAIA,GAAI,EAK1C,MAGA,GAAIC,GAAK1B,IAAMrxB,MAAM+yB,MAAQtnC,IAAMqnC,IAAMzB,IAAMrxB,MAAM8yB,MAAQnqC,GAAI,CAE/D,IAAIsqC,GAAKpV,OAASA,OAAOkV,SAAMnpC,EAE/BoW,MAAMkO,OAAO4kB,GAAI,EAAGnqC,GAEhBk1B,QACFA,OAAO3P,OAAO4kB,GAAI,EAAGG,IAIvBjzB,MAAMkO,OAAO4kB,IAAMC,GAAKA,GAAK,EAAIA,GAAI,GAEjClV,QACFA,OAAO3P,OAAO4kB,IAAMC,GAAKA,GAAK,EAAIA,GAAI,EAE1C,CACF,CACF,EAEOtD,YAAY,GAClB,CACD1J,SAAS,IC9hDAmN,yBAA2B,CACpCrI,mBACAyE,wBACAP,kBACAS,yBCTS2D,aAA8B,gBAF9B,SACQ,CAAC,QAAS,SAAU,cAAe,iBACeh0B,OACnE,IAAI,MACG,OACC,YACK,cAETA,KAmCJ,OAAO0E,MA3CE,SA2CU,CACjB,GAAI,WACF,OAAOuvB,QAAQ,GACjB,EACAC,OAAQ,SAAgBrU,QACtB,OAAOoU,QAAQ,GAAIpU,OACrB,EACA,iBAAkB,SAAsBA,OAAQiM,UAC9C,OAAOmI,QAAQ,GAAIpU,OAAQiM,SAC7B,EACA3nB,MAAO,SAAeV,MACpB,OAAOwwB,QAAQxwB,KACjB,EACAmoB,OAAQ,SAAgBnoB,MACtB,OAAOwwB,QAAQxwB,KAAMA,KAAKooB,UAC5B,EACA,yBAA0BoI,QAC1B,iCAAkCA,UAWpC,SAASA,QAAQxwB,KAAMoc,OAAQiM,UAE7B,GAAe,UAAXjM,QAAiC,YAAXA,aAAmCp1B,IAAXo1B,OAChD,OAAO,IAAIuM,YAAY3oB,KAAMqoB,UAG/B,GAAe,WAAXjM,OACF,OAAO,IAAIyQ,aAAa7sB,KAAMqoB,UAGhC,MAAM,IAAI3mB,UAAU,uBAAyB8gB,KAAK/D,UAAUrC,QAAU,IACxE,KC1ESsU,mBAAqB,CAC9BvF,wBACAlD,mBACAqI,yBACAnE,kBACAoE,cCyEF,SAASI,cAAcrkC,IAAK8Q,OAC1B,IAAKmb,QAAQnb,OAEX,MAAM,IAAIsE,UAAU,kBAGtB,GAA4B,IAAxBtE,MAAM8e,OAAO90B,OACf,MAAM,IAAIu3B,eAAevhB,MAAM8e,OAAO90B,OAAQ,GAIhD,IAAIwpC,OAAStkC,IAAIlF,OACjB83B,cAAc9hB,MAAM1Q,MAAM,GAAIkkC,QAC9B1R,cAAc9hB,MAAMzQ,MAAM,GAAIikC,QAC9B,IAAIzH,MAAQ/rB,MAAMgsB,UAAU,GACxByH,OAAS,GAIb,OAHA1H,MAAMhsB,SAAQ,SAAUnD,GACtB62B,QAAUvkC,IAAIoB,OAAOsM,EACvB,IACO62B,MACT,CAaA,SAASC,cAAcxkC,IAAK8Q,MAAOgqB,YAAahI,cAC9C,IAAKhiB,QAA2B,IAAlBA,MAAMmb,QAElB,MAAM,IAAI7W,UAAU,kBAGtB,GAA4B,IAAxBtE,MAAM8e,OAAO90B,OACf,MAAM,IAAIu3B,eAAevhB,MAAM8e,OAAO90B,OAAQ,GAGhD,QAAqBJ,IAAjBo4B,cACF,GAA4B,iBAAjBA,cAAqD,IAAxBA,aAAah4B,OACnD,MAAM,IAAIsa,UAAU,kDAGtB0d,aAAe,IAGjB,IAAI+J,MAAQ/rB,MAAMgsB,UAAU,GAG5B,GAFUD,MAAMjN,OAAO,KAEXkL,YAAYhgC,OACtB,MAAM,IAAIu3B,eAAewK,MAAMjN,OAAO,GAAIkL,YAAYhgC,QAIxD,IAAIwpC,OAAStkC,IAAIlF,OACjB83B,cAAc9hB,MAAM1Q,MAAM,IAC1BwyB,cAAc9hB,MAAMzQ,MAAM,IAI1B,IAFA,IAAIokC,MAAQ,GAEHtpC,EAAI,EAAGA,EAAImpC,OAAQnpC,IAC1BspC,MAAMtpC,GAAK6E,IAAIoB,OAAOjG,GAOxB,GAJA0hC,MAAMhsB,SAAQ,SAAUnD,EAAGvS,GACzBspC,MAAM/2B,GAAKotB,YAAY15B,OAAOjG,EAAE,GAClC,IAEIspC,MAAM3pC,OAASwpC,OACjB,IAAK,IAAI5B,GAAK4B,OAAS,EAAGhL,KAAOmL,MAAM3pC,OAAQ4nC,GAAKpJ,KAAMoJ,KACnD+B,MAAM/B,MACT+B,MAAM/B,IAAM5P,cAKlB,OAAO2R,MAAM3uB,KAAK,GACpB,CAUA,SAAS4uB,mBAAmB9W,OAAQ9c,OAClC,GAA4B,IAAxBA,MAAM8e,OAAO90B,OACf,MAAM,IAAIu3B,eAAevhB,MAAM8e,OAAQ,GAGzC,IAAIlgB,IAAMoB,MAAMgsB,UAAU,GAE1B,GAAmB,iBAARptB,IACT,MAAM,IAAI0F,UAAU,2DAGtB,OAAOojB,gBAAgB5K,OAAQle,IACjC,CAWA,SAASi1B,mBAAmB/W,OAAQ9c,MAAOgqB,aACzC,GAA4B,IAAxBhqB,MAAM8e,OAAO90B,OACf,MAAM,IAAIu3B,eAAevhB,MAAM8e,OAAQ,GAGzC,IAAIlgB,IAAMoB,MAAMgsB,UAAU,GAE1B,GAAmB,iBAARptB,IACT,MAAM,IAAI0F,UAAU,2DAItB,IAAIwvB,QAAUp2B,MAAMof,QAEpB,OADA,wBAAgBgX,QAASl1B,IAAKorB,aACvB8J,OACT,CClNO,IAAIC,mBAAqB,CAC9BT,mBACAvE,kBACAiF,aDFuC,gBAF9B,SACQ,CAAC,QAAS,WACwC70B,OACnE,IAAI,MACG,QAEHA,KAoCJ,OAAO0E,MA1CE,SA0CU,CAEjB,eAAgB,SAAoBa,MAAO1E,OACzC,IACIkrB,OADIrE,OAAOniB,OACAwmB,OAAOlrB,OAEtB,OAAOA,MAAM6rB,WAAaX,OAASA,OAAO9xB,SAC5C,EACA,gBAAiB,SAAqBsL,MAAO1E,OAC3C,OAAO0E,MAAMwmB,OAAOlrB,MACtB,EACA,gBAAiB4zB,mBACjB,gBAAiBL,cAEjB,oBAAqB,SAAuB7uB,MAAO1E,MAAOgqB,aACxD,OAAOnD,OAAOnpB,MAAMgH,QAAQwmB,OAAOlrB,MAAOgqB,iBAAapgC,GAAWwP,SACpE,EACA,yBAA0B,SAA0BsL,MAAO1E,MAAOgqB,YAAahI,cAC7E,OAAO6E,OAAOnpB,MAAMgH,QAAQwmB,OAAOlrB,MAAOgqB,YAAahI,cAAc5oB,SACvE,EACA,qBAAsB,SAAwBsL,MAAO1E,MAAOgqB,aAC1D,OAAOtlB,MAAMhH,QAAQwtB,OAAOlrB,MAAOgqB,YACrC,EACA,0BAA2B,SAA2BtlB,MAAO1E,MAAOgqB,YAAahI,cAC/E,OAAOtd,MAAMhH,QAAQwtB,OAAOlrB,MAAOgqB,YAAahI,aAClD,EACA,wBAAyB0R,cACzB,gCAAiCA,cACjC,qBAAsBG,oBACtB,KEtEG,SAASI,eAAelsB,KAC7B,OAAIA,KAAOA,IAAI2e,aACN,IAAI,sBAAW3e,IAAI/H,MAAQ,EAAG+H,IAAIzY,IAAM,OAAe1F,IAAZme,IAAIxY,IAAoBwY,IAAIxY,IAAM,OAAI3F,GAGnFme,GACT,CCXO,SAASmsB,cAAc/0B,MAC5B,IAAI,QAEAA,KAaJ,OAAO,SAAgB2d,OAAQ9c,OAC7B,IACE,GAAIsD,MAAMC,QAAQuZ,QAChB,OAAOoO,OAAOpO,OAAQ9c,OACjB,GAAI8c,QAAmC,mBAAlBA,OAAOoO,OAEjC,OAAOpO,OAAOoO,OAAOlrB,OAChB,GAAsB,iBAAX8c,OAEhB,OAAOoO,OAAOpO,OAAQ9c,OACjB,GAAsB,iBAAX8c,OAAqB,CACrC,IAAK9c,MAAMm0B,mBACT,MAAM,IAAI7vB,UAAU,mDAGtB,OAAOojB,gBAAgB5K,OAAQ9c,MAAMo0B,oBACvC,CACE,MAAM,IAAI9vB,UAAU,iDAIxB,CAFE,MAAOyD,KACP,MAAMksB,eAAelsB,IACvB,CACF,CACF,CCrCA,ICGWssB,yBAA2B,CACpCzL,iBACAmL,mBACAO,mBDJ6C,gBAFpC,eACQ,CAAC,SAAU,SAC6Cn1B,OACzE,IAAI,OACI,MAEJA,KACAo1B,OAASL,cAAc,CACzBhJ,SAYF,SAASsJ,aAAa1X,OAAQ9c,OAC5B,KAAMvX,gBAAgB+rC,cACpB,MAAM,IAAIxrC,YAAY,oDAGxB,IAAK8yB,OAAOgB,QACV,MAAM,IAAIxY,UAAU,wCAGtB,IAAKgY,YAAYtc,OACf,MAAM,IAAIsE,UAAU,4CAGtB7b,KAAKq0B,OAASA,QAAU,KACxBr0B,KAAKuX,MAAQA,MAEbxB,OAAO2O,eAAe1kB,KAAM,OAAQ,CAClCmmB,IAAK,WACH,OAAInmB,KAAKuX,MACAvX,KAAKuX,MAAMm0B,mBAAqB1rC,KAAKuX,MAAMo0B,oBAAsB,GAEjE3rC,KAAKq0B,OAAO5c,MAAQ,EAE/B,EAAEu0B,KAAKhsC,MACP4V,IAAK,WACH,MAAM,IAAI7O,MAAM,8CAClB,GAEJ,CAoJA,SAASklC,gBAAgBhL,MAEvB,QAAS7N,eAAe6N,OAAS3N,YAAY2N,OAASvN,eAAeuN,OAASrN,eAAeqN,OAASnN,aAAamN,OAASjN,kBAAkBiN,OAAS/M,aAAa+M,MACtK,CAEA,OAvJA8K,aAAa9pC,UAAY,IAAIo+B,KAC7B0L,aAAa9pC,UAAU8Z,KAAO,eAC9BgwB,aAAa9pC,UAAUmxB,gBAAiB,EAexC2Y,aAAa9pC,UAAUy+B,SAAW,SAAU/E,KAAMoF,UAChD,IAAImL,WAAalsC,KAAKq0B,OAAOqM,SAAS/E,KAAMoF,UAExCoL,UAAYnsC,KAAKuX,MAAMmpB,SAAS/E,KAAMoF,UAE1C,GAAI/gC,KAAKuX,MAAMm0B,mBAAoB,CACjC,IAAItlB,KAAOpmB,KAAKuX,MAAMo0B,oBACtB,OAAO,SAA0BnW,MAAO7iB,KAAMy5B,SAE5C,OAAOnN,gBAAgBiN,WAAW1W,MAAO7iB,KAAMy5B,SAAUhmB,KAC3D,CACF,CACE,OAAO,SAA0BoP,MAAO7iB,KAAMy5B,SAC5C,IAAI/X,OAAS6X,WAAW1W,MAAO7iB,KAAMy5B,SACjC70B,MAAQ40B,UAAU3W,MAAO7iB,KAAM0hB,QAEnC,OAAOyX,OAAOzX,OAAQ9c,MACxB,CAEJ,EAOAw0B,aAAa9pC,UAAUqV,QAAU,SAAUqC,UACzCA,SAAS3Z,KAAKq0B,OAAQ,SAAUr0B,MAChC2Z,SAAS3Z,KAAKuX,MAAO,QAASvX,KAChC,EASA+rC,aAAa9pC,UAAU6a,IAAM,SAAUnD,UACrC,OAAO,IAAIoyB,aAAa/rC,KAAKghC,QAAQrnB,SAAS3Z,KAAKq0B,OAAQ,SAAUr0B,OAAQA,KAAKghC,QAAQrnB,SAAS3Z,KAAKuX,MAAO,QAASvX,OAC1H,EAOA+rC,aAAa9pC,UAAUgT,MAAQ,WAC7B,OAAO,IAAI82B,aAAa/rC,KAAKq0B,OAAQr0B,KAAKuX,MAC5C,EAQAw0B,aAAa9pC,UAAU4/B,UAAY,SAAUxW,SAC3C,IAAIgJ,OAASr0B,KAAKq0B,OAAO/qB,SAAS+hB,SAMlC,OAJI4gB,gBAAgBjsC,KAAKq0B,UACvBA,OAAS,IAAMA,OAAS,KAGnBA,OAASr0B,KAAKuX,MAAMjO,SAAS+hB,QACtC,EAQA0gB,aAAa9pC,UAAU6/B,OAAS,SAAUzW,SACxC,IAAIgJ,OAASr0B,KAAKq0B,OAAOyN,OAAOzW,SAMhC,OAJI4gB,gBAAgBjsC,KAAKq0B,UACvBA,OAAS,iEAAmEA,OAAS,kEAGhFA,OAASr0B,KAAKuX,MAAMuqB,OAAOzW,QACpC,EAQA0gB,aAAa9pC,UAAU+/B,OAAS,SAAU3W,SACxC,IAAIgJ,OAASr0B,KAAKq0B,OAAO0N,MAAM1W,SAM/B,OAJI4gB,gBAAgBjsC,KAAKq0B,UACvBA,OAAS,iCAGJA,OAASr0B,KAAKuX,MAAMwqB,MAAM1W,QACnC,EAOA0gB,aAAa9pC,UAAU2O,OAAS,WAC9B,MAAO,CACLi0B,OAAQ,eACRxQ,OAAQr0B,KAAKq0B,OACb9c,MAAOvX,KAAKuX,MAEhB,EAUAw0B,aAAa7G,SAAW,SAAUzH,MAChC,OAAO,IAAIsO,aAAatO,KAAKpJ,OAAQoJ,KAAKlmB,MAC5C,EAYOw0B,YAAY,GAClB,CACDzO,SAAS,EACTjK,QAAQ,KE1MCgZ,sBAAwB,CACjClM,iBACAmM,gBCH0C,gBAFjC,YACQ,CAAC,SACoD51B,OACtE,IAAI,MAEAA,KAQJ,SAAS61B,UAAUC,OACjB,KAAMxsC,gBAAgBusC,WACpB,MAAM,IAAIhsC,YAAY,oDAKxB,GAFAP,KAAKwsC,MAAQA,OAAS,IAEjB3xB,MAAMC,QAAQ9a,KAAKwsC,SAAWxsC,KAAKwsC,MAAMzW,MAAM1C,QAClD,MAAM,IAAIxX,UAAU,kCAExB,CA2JA,OAzJA0wB,UAAUtqC,UAAY,IAAIo+B,KAC1BkM,UAAUtqC,UAAU8Z,KAAO,YAC3BwwB,UAAUtqC,UAAUqxB,aAAc,EAelCiZ,UAAUtqC,UAAUy+B,SAAW,SAAU/E,KAAMoF,UAC7C,IAAI0L,UAAY3vB,IAAI9c,KAAKwsC,OAAO,SAAU1nB,MACxC,OAAOA,KAAK4b,SAAS/E,KAAMoF,SAC7B,IAGA,GAFsC,UAAvBpF,KAAK1nB,OAAOmqB,OAEb,CACZ,IAAIA,OAASzC,KAAKyC,OAClB,OAAO,SAAuB5I,MAAO7iB,KAAMy5B,SACzC,OAAOhO,OAAOthB,IAAI2vB,WAAW,SAAUC,UACrC,OAAOA,SAASlX,MAAO7iB,KAAMy5B,QAC/B,IACF,CACF,CACE,OAAO,SAAuB5W,MAAO7iB,KAAMy5B,SACzC,OAAOtvB,IAAI2vB,WAAW,SAAUC,UAC9B,OAAOA,SAASlX,MAAO7iB,KAAMy5B,QAC/B,GACF,CAEJ,EAOAG,UAAUtqC,UAAUqV,QAAU,SAAUqC,UACtC,IAAK,IAAI/X,EAAI,EAAGA,EAAI5B,KAAKwsC,MAAMjrC,OAAQK,IAAK,CAE1C+X,SADW3Z,KAAKwsC,MAAM5qC,GACP,SAAWA,EAAI,IAAK5B,KACrC,CACF,EASAusC,UAAUtqC,UAAU6a,IAAM,SAAUnD,UAGlC,IAFA,IAAI6yB,MAAQ,GAEH5qC,EAAI,EAAGA,EAAI5B,KAAKwsC,MAAMjrC,OAAQK,IACrC4qC,MAAM5qC,GAAK5B,KAAKghC,QAAQrnB,SAAS3Z,KAAKwsC,MAAM5qC,GAAI,SAAWA,EAAI,IAAK5B,OAGtE,OAAO,IAAIusC,UAAUC,MACvB,EAOAD,UAAUtqC,UAAUgT,MAAQ,WAC1B,OAAO,IAAIs3B,UAAUvsC,KAAKwsC,MAAMpiC,MAAM,GACxC,EASAmiC,UAAUtqC,UAAU4/B,UAAY,SAAUxW,SAIxC,MAAO,IAHKrrB,KAAKwsC,MAAM1vB,KAAI,SAAUmkB,MACnC,OAAOA,KAAK33B,SAAS+hB,QACvB,IACmB9O,KAAK,MAAQ,GAClC,EAOAgwB,UAAUtqC,UAAU2O,OAAS,WAC3B,MAAO,CACLi0B,OAAQ,YACR2H,MAAOxsC,KAAKwsC,MAEhB,EAUAD,UAAUrH,SAAW,SAAUzH,MAC7B,OAAO,IAAI8O,UAAU9O,KAAK+O,MAC5B,EASAD,UAAUtqC,UAAU6/B,OAAS,SAAUzW,SAIrC,MAAO,kEAHKrrB,KAAKwsC,MAAM1vB,KAAI,SAAUmkB,MACnC,OAAOA,KAAKa,OAAOzW,QACrB,IACiF9O,KAAK,yCAA2C,iEACnI,EAQAgwB,UAAUtqC,UAAU+/B,OAAS,SAAU3W,SAerC,OAdA,SAASshB,WAAWH,MAAOI,QACzB,IAAIC,WAAaL,MAAMvuB,KAAKqV,eAAiBkZ,MAAMzW,MAAMzC,aACrDwZ,aAAeF,QAAUC,WACzBE,QAAUD,aAAe,IAAM,OAC/BE,SAAWR,MAAM1vB,KAAI,SAAUmkB,MACjC,OAAIA,KAAKuL,MACAG,WAAW1L,KAAKuL,OAAQI,QAExB3L,KAAKc,MAAM1W,QAEtB,IAAG9O,KAAKwwB,SACR,OAAOF,aAAeC,cAAgBA,eAAiBF,OAAS,mBAAqBI,SAAW,iBAAmBA,QACrH,CAEOL,CAAW3sC,KAAKwsC,OAAO,EAChC,EAEOD,SAAS,GACf,CACDjP,SAAS,EACTjK,QAAQ,KCrKH,IAAIqC,WAAa,CAAC,CAEvBuX,eAAgB,CAAC,EACjBC,uBAAwB,CAAC,GACxB,CAEDC,gBAAiB,CACfC,iBAAiB,EACjBC,kBAAkB,EAClBC,aAAa,IAId,CAED,kBAAmB,CACjBC,cAAe,OACfC,gBAAiB,KAElB,CAED,mBAAoB,CAClBD,cAAe,OACfC,gBAAiB,KAElB,CAED,mBAAoB,CAClBD,cAAe,OACfC,gBAAiB,KAElB,CAED,qBAAsB,CACpBD,cAAe,OACfC,gBAAiB,KAElB,CAED,sBAAuB,CACrBD,cAAe,OACfC,gBAAiB,KAElB,CAED,sBAAuB,CACrBD,cAAe,OACfC,gBAAiB,KAElB,CAED,qBAAsB,CACpBD,cAAe,OACfC,gBAAiB,IAEnB,uBAAwB,CACtBD,cAAe,OACfC,gBAAiB,IAEnB,uBAAwB,CACtBD,cAAe,OACfC,gBAAiB,IAEnB,sBAAuB,CACrBD,cAAe,OACfC,gBAAiB,IAEnB,yBAA0B,CACxBD,cAAe,OACfC,gBAAiB,IAEnB,wBAAyB,CACvBD,cAAe,OACfC,gBAAiB,IAEnBC,eAAgB,CACdF,cAAe,OACfC,gBAAiB,KAElB,CAED,yBAA0B,CACxBD,cAAe,OACfC,gBAAiB,IAEnB,+BAAgC,CAC9BD,cAAe,OACfC,gBAAiB,IAEnB,6BAA8B,CAC5BD,cAAe,OACfC,gBAAiB,KAElB,CAED,kBAAmB,CACjBD,cAAe,OACfC,gBAAiB,KAElB,CAEDE,UAAW,CAAC,GACX,CAED,mBAAoB,CAClBH,cAAe,OACfC,gBAAiB,CAAC,mBAAoB,0BAExC,wBAAyB,CACvBD,cAAe,OACfC,gBAAiB,KAElB,CAED,wBAAyB,CACvBD,cAAe,OACfC,gBAAiB,CAAC,wBAAyB,sBAAuB,uBAAwB,uBAE5F,sBAAuB,CACrBD,cAAe,OACfC,gBAAiB,GACjBJ,iBAAiB,EACjBC,kBAAkB,EAClBC,aAAa,GAKf,2BAA4B,CAC1BC,cAAe,OACfC,gBAAiB,CAAC,wBAAyB,sBAAuB,2BAA4B,0BAEhG,yBAA0B,CACxBD,cAAe,OACfC,gBAAiB,IAEnB,mBAAoB,CAClBD,cAAe,OACfC,gBAAiB,KAElB,CAED,yBAA0B,CACxBD,cAAe,SAEjB,0BAA2B,CACzBA,cAAe,SAEjB,sBAAuB,CACrBA,cAAe,SAEjB,mBAAoB,CAClBA,cAAe,UAEhB,CAED,mBAAoB,CAClBA,cAAe,QACfC,gBAAiB,GACjBH,kBAAkB,GAKpB,sBAAuB,CACrBE,cAAe,QACfC,gBAAiB,KAElB,CAED,yBAA0B,CACxBD,cAAe,SAEhB,CAED,yBAA0B,CACxBA,cAAe,UAaZ,SAASI,cAAcC,MAAOC,aACnC,IAAI5M,KAAO2M,MAES,SAAhBC,cAEF5M,KAAO2M,MAAMzL,cAKf,IAFA,IAAI2L,WAAa7M,KAAKiB,gBAEbtgC,EAAI,EAAGA,EAAI8zB,WAAWn0B,OAAQK,IACrC,GAAIksC,cAAcpY,WAAW9zB,GAC3B,OAAOA,EAIX,OAAO,IACT,CAYO,SAASmsC,iBAAiBH,MAAOC,aACtC,IAAI5M,KAAO2M,MAES,SAAhBC,cAEF5M,KAAO2M,MAAMzL,cAGf,IAAI2L,WAAa7M,KAAKiB,gBAClB3qB,MAAQo2B,cAAc1M,KAAM4M,aAEhC,GAAc,OAAVt2B,MAEF,OAAO,KAGT,IAAI4d,SAAWO,WAAWne,OAAOu2B,YAEjC,GAAI,sBAAe3Y,SAAU,iBAAkB,CAC7C,GAA+B,SAA3BA,SAASoY,cACX,MAAO,OAGT,GAA+B,UAA3BpY,SAASoY,cACX,MAAO,QAIT,MAAMxmC,MAAM,IAAO+mC,WAAa,oCAAwC3Y,SAASoY,cAAgB,KACnG,CAGA,OAAO,IACT,CAWO,SAASS,kBAAkBC,MAAOC,MAAOL,aAE9C,IAAIptC,EAAoB,SAAhBotC,YAAyBI,MAAM9L,aAAe8L,MAClDvtC,EAAoB,SAAhBmtC,YAAyBI,MAAM9L,aAAe+L,MAClDC,YAAc1tC,EAAEyhC,gBAChBkM,YAAc1tC,EAAEwhC,gBAChB3qB,MAAQo2B,cAAcltC,EAAGotC,aAE7B,GAAc,OAAVt2B,MAEF,OAAO,KAGT,IAAI4d,SAAWO,WAAWne,OAAO42B,aAEjC,GAAI,sBAAehZ,SAAU,oBAAsBA,SAASqY,2BAA2B3yB,MAAO,CAC5F,IAAK,IAAIjZ,EAAI,EAAGA,EAAIuzB,SAASqY,gBAAgBjsC,OAAQK,IACnD,GAAIuzB,SAASqY,gBAAgB5rC,KAAOwsC,YAClC,OAAO,EAIX,OAAO,CACT,CAGA,OAAO,IACT,CC9SA,ICEWC,2BAA6B,CACtCxD,mBACA1K,iBACAmL,mBACAgD,qBDH+C,gBAHtC,iBACQ,CAAC,SAAU,UAC9B,SAC6E53B,OAC3E,IAAI,OACI,OACA,MAEJA,KACAo1B,OAASL,cAAc,CACzBhJ,SAEEzsB,OEhBC,SAAuBU,MAC5B,IAAI,OACI,QAEJA,KAgBJ,OAAO,SAAgB2d,OAAQ9c,MAAO0E,OACpC,IACE,GAAIpB,MAAMC,QAAQuZ,QAEhB,OAAO+J,OAAO/J,QAAQoO,OAAOlrB,MAAO0E,OAAOtL,UACtC,GAAI0jB,QAAmC,mBAAlBA,OAAOoO,OAEjC,OAAOpO,OAAOoO,OAAOlrB,MAAO0E,OACvB,GAAsB,iBAAXoY,OAEhB,OAAOoO,OAAOpO,OAAQ9c,MAAO0E,OACxB,GAAsB,iBAAXoY,OAAqB,CACrC,IAAK9c,MAAMm0B,mBACT,MAAM7vB,UAAU,mDAIlB,OADA,wBAAgBwY,OAAQ9c,MAAMo0B,oBAAqB1vB,OAC5CoY,MACT,CACE,MAAM,IAAIxY,UAAU,iDAIxB,CAFE,MAAOyD,KACP,MAAMksB,eAAelsB,IACvB,CACF,CACF,CF7BeivB,CAAc,CACzB9L,OACArE,SA6BF,SAAS6O,eAAe5Y,OAAQ9c,MAAO0E,OACrC,KAAMjc,gBAAgBitC,gBACpB,MAAM,IAAI1sC,YAAY,oDAOxB,GAJAP,KAAKq0B,OAASA,OACdr0B,KAAKuX,MAAQ0E,MAAQ1E,MAAQ,KAC7BvX,KAAKic,MAAQA,OAAS1E,OAEjB2c,aAAaG,UAAYjB,eAAeiB,QAC3C,MAAM,IAAIxY,UAAU,mDAGtB,GAAIqY,aAAaG,SAA2B,QAAhBA,OAAO5c,KACjC,MAAM,IAAI1Q,MAAM,iCAGlB,GAAI/G,KAAKuX,QAAUsc,YAAY7zB,KAAKuX,OAElC,MAAM,IAAIsE,UAAU,iCAGtB,IAAKwX,OAAOrzB,KAAKic,OACf,MAAM,IAAIJ,UAAU,4BAItB9F,OAAO2O,eAAe1kB,KAAM,OAAQ,CAClCmmB,IAAK,WACH,OAAInmB,KAAKuX,MACAvX,KAAKuX,MAAMm0B,mBAAqB1rC,KAAKuX,MAAMo0B,oBAAsB,GAEjE3rC,KAAKq0B,OAAO5c,MAAQ,EAE/B,EAAEu0B,KAAKhsC,MACP4V,IAAK,WACH,MAAM,IAAI7O,MAAM,8CAClB,GAEJ,CAgJA,SAASklC,gBAAgBhL,KAAM4M,aACxBA,cACHA,YAAc,QAGhB,IAAIW,WAAab,cAAc1M,KAAM4M,aACjCY,eAAiBd,cAAc1M,KAAKhlB,MAAO4xB,aAC/C,MAAuB,QAAhBA,aAA4C,OAAnBY,gBAA2BA,gBAAkBD,UAC/E,CAkFA,OAxOAvB,eAAehrC,UAAY,IAAIo+B,KAC/B4M,eAAehrC,UAAU8Z,KAAO,iBAChCkxB,eAAehrC,UAAUsxB,kBAAmB,EAe5C0Z,eAAehrC,UAAUy+B,SAAW,SAAU/E,KAAMoF,UAClD,IAAImL,WAAalsC,KAAKq0B,OAAOqM,SAAS/E,KAAMoF,UAExCoL,UAAYnsC,KAAKuX,MAAQvX,KAAKuX,MAAMmpB,SAAS/E,KAAMoF,UAAY,KAE/D2N,UAAY1uC,KAAKic,MAAMykB,SAAS/E,KAAMoF,UAEtCtpB,KAAOzX,KAAKq0B,OAAO5c,KAEvB,GAAKzX,KAAKuX,MAWH,IAAIvX,KAAKuX,MAAMm0B,mBAAoB,CAExC,IAAItlB,KAAOpmB,KAAKuX,MAAMo0B,oBACtB,OAAO,SAA4BnW,MAAO7iB,KAAMy5B,SAC9C,IAAI/X,OAAS6X,WAAW1W,MAAO7iB,KAAMy5B,SACjCnwB,MAAQyyB,UAAUlZ,MAAO7iB,KAAMy5B,SAEnC,OADA,wBAAgB/X,OAAQjO,KAAMnK,OACvBA,KACT,CACF,CAAO,GAAIiY,aAAal0B,KAAKq0B,QAE3B,OAAO,SAA4BmB,MAAO7iB,KAAMy5B,SAC9C,IAAIuC,YAAczC,WAAW1W,MAAO7iB,KAAMy5B,SACtCnwB,MAAQyyB,UAAUlZ,MAAO7iB,KAAMy5B,SAC/B70B,MAAQ40B,UAAU3W,MAAO7iB,KAAMg8B,aAGnC,OADAnZ,MAAM5f,IAAI6B,KAAMzB,OAAO24B,YAAap3B,MAAO0E,QACpCA,KACT,EAOA,IAAI2yB,iBAAmB5uC,KAAKq0B,OAAOA,OAAOqM,SAAS/E,KAAMoF,UAEzD,GAAI/gC,KAAKq0B,OAAO9c,MAAMm0B,mBAAoB,CACxC,IAAImD,WAAa7uC,KAAKq0B,OAAO9c,MAAMo0B,oBACnC,OAAO,SAA4BnW,MAAO7iB,KAAMy5B,SAC9C,IAAI/K,OAASuN,iBAAiBpZ,MAAO7iB,KAAMy5B,SACvCuC,YAAc1P,gBAAgBoC,OAAQwN,YACtCt3B,MAAQ40B,UAAU3W,MAAO7iB,KAAMg8B,aAE/B1yB,MAAQyyB,UAAUlZ,MAAO7iB,KAAMy5B,SAEnC,OADA,wBAAgB/K,OAAQwN,WAAY74B,OAAO24B,YAAap3B,MAAO0E,QACxDA,KACT,CACF,CAEE,IAAI6yB,gBAAkB9uC,KAAKq0B,OAAO9c,MAAMmpB,SAAS/E,KAAMoF,UAEvD,OAAO,SAA4BvL,MAAO7iB,KAAMy5B,SAC9C,IAAI/K,OAASuN,iBAAiBpZ,MAAO7iB,KAAMy5B,SACvC2C,YAAcD,gBAAgBtZ,MAAO7iB,KAAM0uB,QAE3CsN,YAAc7C,OAAOzK,OAAQ0N,aAC7Bx3B,MAAQ40B,UAAU3W,MAAO7iB,KAAMg8B,aAE/B1yB,MAAQyyB,UAAUlZ,MAAO7iB,KAAMy5B,SAEnC,OADAp2B,OAAOqrB,OAAQ0N,YAAa/4B,OAAO24B,YAAap3B,MAAO0E,QAChDA,KACT,CAEJ,CA/DE,IAAKiY,aAAal0B,KAAKq0B,QACrB,MAAM,IAAIxY,UAAU,iCAGtB,OAAO,SAA4B2Z,MAAO7iB,KAAMy5B,SAC9C,IAAInwB,MAAQyyB,UAAUlZ,MAAO7iB,KAAMy5B,SAEnC,OADA5W,MAAM5f,IAAI6B,KAAMwE,OACTA,KACT,CAwDJ,EAOAgxB,eAAehrC,UAAUqV,QAAU,SAAUqC,UAC3CA,SAAS3Z,KAAKq0B,OAAQ,SAAUr0B,MAE5BA,KAAKuX,OACPoC,SAAS3Z,KAAKuX,MAAO,QAASvX,MAGhC2Z,SAAS3Z,KAAKic,MAAO,QAASjc,KAChC,EASAitC,eAAehrC,UAAU6a,IAAM,SAAUnD,UAOvC,OAAO,IAAIszB,eANEjtC,KAAKghC,QAAQrnB,SAAS3Z,KAAKq0B,OAAQ,SAAUr0B,OAE9CA,KAAKuX,MAAQvX,KAAKghC,QAAQrnB,SAAS3Z,KAAKuX,MAAO,QAASvX,OAAS,KAEjEA,KAAKghC,QAAQrnB,SAAS3Z,KAAKic,MAAO,QAASjc,OAGzD,EAOAitC,eAAehrC,UAAUgT,MAAQ,WAC/B,OAAO,IAAIg4B,eAAejtC,KAAKq0B,OAAQr0B,KAAKuX,MAAOvX,KAAKic,MAC1D,EAyBAgxB,eAAehrC,UAAU4/B,UAAY,SAAUxW,SAC7C,IAAIgJ,OAASr0B,KAAKq0B,OAAO/qB,SAAS+hB,SAC9B9T,MAAQvX,KAAKuX,MAAQvX,KAAKuX,MAAMjO,SAAS+hB,SAAW,GACpDpP,MAAQjc,KAAKic,MAAM3S,SAAS+hB,SAMhC,OAJI4gB,gBAAgBjsC,KAAMqrB,SAAWA,QAAQwiB,eAC3C5xB,MAAQ,IAAMA,MAAQ,KAGjBoY,OAAS9c,MAAQ,MAAQ0E,KAClC,EAOAgxB,eAAehrC,UAAU2O,OAAS,WAChC,MAAO,CACLi0B,OAAQ,iBACRxQ,OAAQr0B,KAAKq0B,OACb9c,MAAOvX,KAAKuX,MACZ0E,MAAOjc,KAAKic,MAEhB,EAUAgxB,eAAe/H,SAAW,SAAUzH,MAClC,OAAO,IAAIwP,eAAexP,KAAKpJ,OAAQoJ,KAAKlmB,MAAOkmB,KAAKxhB,MAC1D,EAQAgxB,eAAehrC,UAAU6/B,OAAS,SAAUzW,SAC1C,IAAIgJ,OAASr0B,KAAKq0B,OAAOyN,OAAOzW,SAC5B9T,MAAQvX,KAAKuX,MAAQvX,KAAKuX,MAAMuqB,OAAOzW,SAAW,GAClDpP,MAAQjc,KAAKic,MAAM6lB,OAAOzW,SAM9B,OAJI4gB,gBAAgBjsC,KAAMqrB,SAAWA,QAAQwiB,eAC3C5xB,MAAQ,iEAAmEA,MAAQ,kEAG9EoY,OAAS9c,MAAQ,uHAAyH0E,KACnJ,EAQAgxB,eAAehrC,UAAU+/B,OAAS,SAAU3W,SAC1C,IAAIgJ,OAASr0B,KAAKq0B,OAAO0N,MAAM1W,SAC3B9T,MAAQvX,KAAKuX,MAAQvX,KAAKuX,MAAMwqB,MAAM1W,SAAW,GACjDpP,MAAQjc,KAAKic,MAAM8lB,MAAM1W,SAM7B,OAJI4gB,gBAAgBjsC,KAAMqrB,SAAWA,QAAQwiB,eAC3C5xB,MAAQ,UAAU4B,OAAO5B,MAAO,aAG3BoY,OAAS9c,MAAQ,KAAO0E,KACjC,EAEOgxB,cAAc,GACpB,CACD3P,SAAS,EACTjK,QAAQ,KG9TC2b,sBAAwB,CACjC7O,iBACA8O,sBCJiC,CACjCC,gBCH0C,gBAFjC,YACQ,IACqD,KAOtE,SAASC,UAAUlqB,SACjB,KAAMjlB,gBAAgBmvC,WACpB,MAAM,IAAI5uC,YAAY,oDAGxBP,KAAKilB,QAAUA,SAAW,EAC5B,CAsDA,OAhDAkqB,UAAUltC,UAAU8Z,KAAO,YAC3BozB,UAAUltC,UAAU2wB,aAAc,EAOlCuc,UAAUltC,UAAU0O,QAAU,WAC5B,OAAO3Q,KAAKilB,OACd,EAQAkqB,UAAUltC,UAAUqH,SAAW,WAC7B,MAAO,IAAMtJ,KAAKilB,QAAQ1I,KAAK,MAAQ,GACzC,EASA4yB,UAAUltC,UAAU2O,OAAS,WAC3B,MAAO,CACLi0B,OAAQ,YACR5f,QAASjlB,KAAKilB,QAElB,EAUAkqB,UAAUjK,SAAW,SAAUzH,MAC7B,OAAO,IAAI0R,UAAU1R,KAAKxY,QAC5B,EAEOkqB,SAAS,GACf,CACD7R,SAAS,KF9DT8R,gBGL0C,gBAFjC,YACQ,CAAC,YAAa,SACuC14B,OACtE,IAAI,UACO,MAEPA,KAWJ,SAAS24B,UAAUC,QACjB,KAAMtvC,gBAAgBqvC,WACpB,MAAM,IAAI9uC,YAAY,oDAIxB,IAAKsa,MAAMC,QAAQw0B,QAAS,MAAM,IAAIvoC,MAAM,kBAC5C/G,KAAKsvC,OAASA,OAAOxyB,KAAI,SAAUyyB,OACjC,IAAItO,KAAOsO,OAASA,MAAMtO,KACtBuO,SAAUD,YAA2BpuC,IAAlBouC,MAAMC,SAAwBD,MAAMC,QAC3D,IAAKnc,OAAO4N,MAAO,MAAM,IAAIplB,UAAU,kCACvC,GAAuB,kBAAZ2zB,QAAuB,MAAM,IAAI3zB,UAAU,wCACtD,MAAO,CACLolB,KACAuO,QAEJ,GACF,CAuJA,OArJAH,UAAUptC,UAAY,IAAIo+B,KAC1BgP,UAAUptC,UAAU8Z,KAAO,YAC3BszB,UAAUptC,UAAUuxB,aAAc,EAelC6b,UAAUptC,UAAUy+B,SAAW,SAAU/E,KAAMoF,UAC7C,IAAI0O,WAAa3yB,IAAI9c,KAAKsvC,QAAQ,SAAUC,OAC1C,MAAO,CACLjP,SAAUiP,MAAMtO,KAAKP,SAAS/E,KAAMoF,UACpCyO,QAASD,MAAMC,QAEnB,IACA,OAAO,SAAwBha,MAAO7iB,KAAMy5B,SAC1C,IAAIsD,QAAU,GAQd,OAPAp4B,QAAQm4B,YAAY,SAAuBF,OACzC,IAAIv4B,OAASu4B,MAAMjP,SAAS9K,MAAO7iB,KAAMy5B,SAErCmD,MAAMC,SACRE,QAAQ5hC,KAAKkJ,OAEjB,IACO,IAAIm4B,UAAUO,QACvB,CACF,EAOAL,UAAUptC,UAAUqV,QAAU,SAAUqC,UACtC,IAAK,IAAI/X,EAAI,EAAGA,EAAI5B,KAAKsvC,OAAO/tC,OAAQK,IACtC+X,SAAS3Z,KAAKsvC,OAAO1tC,GAAGq/B,KAAM,UAAYr/B,EAAI,SAAU5B,KAE5D,EASAqvC,UAAUptC,UAAU6a,IAAM,SAAUnD,UAGlC,IAFA,IAAI21B,OAAS,GAEJ1tC,EAAI,EAAGA,EAAI5B,KAAKsvC,OAAO/tC,OAAQK,IAAK,CAC3C,IAAI2tC,MAAQvvC,KAAKsvC,OAAO1tC,GAEpBq/B,KAAOjhC,KAAKghC,QAAQrnB,SAAS41B,MAAMtO,KAAM,UAAYr/B,EAAI,SAAU5B,OAEvEsvC,OAAO1tC,GAAK,CACVq/B,KACAuO,QAASD,MAAMC,QAEnB,CAEA,OAAO,IAAIH,UAAUC,OACvB,EAOAD,UAAUptC,UAAUgT,MAAQ,WAO1B,OAAO,IAAIo6B,UANErvC,KAAKsvC,OAAOxyB,KAAI,SAAUyyB,OACrC,MAAO,CACLtO,KAAMsO,MAAMtO,KACZuO,QAASD,MAAMC,QAEnB,IAEF,EASAH,UAAUptC,UAAU4/B,UAAY,SAAUxW,SACxC,OAAOrrB,KAAKsvC,OAAOxyB,KAAI,SAAUC,OAC/B,OAAOA,MAAMkkB,KAAK33B,SAAS+hB,UAAYtO,MAAMyyB,QAAU,GAAK,IAC9D,IAAGjzB,KAAK,KACV,EAOA8yB,UAAUptC,UAAU2O,OAAS,WAC3B,MAAO,CACLi0B,OAAQ,YACRyK,OAAQtvC,KAAKsvC,OAEjB,EAUAD,UAAUnK,SAAW,SAAUzH,MAC7B,OAAO,IAAI4R,UAAU5R,KAAK6R,OAC5B,EASAD,UAAUptC,UAAU6/B,OAAS,SAAUzW,SACrC,OAAOrrB,KAAKsvC,OAAOxyB,KAAI,SAAUC,OAC/B,OAAOA,MAAMkkB,KAAKa,OAAOzW,UAAYtO,MAAMyyB,QAAU,GAAK,wCAC5D,IAAGjzB,KAAK,6CACV,EAQA8yB,UAAUptC,UAAU+/B,OAAS,SAAU3W,SACrC,OAAOrrB,KAAKsvC,OAAOxyB,KAAI,SAAUC,OAC/B,OAAOA,MAAMkkB,KAAKc,MAAM1W,UAAYtO,MAAMyyB,QAAU,GAAK,IAC3D,IAAGjzB,KAAK,WACV,EAEO8yB,SAAS,GACf,CACD/R,SAAS,EACTjK,QAAQ,KCzLCsc,4BAA8B,CACvCxP,iBACAyP,sBCHgD,gBAFvC,kBACQ,CAAC,SAC0Dl5B,OAC5E,IAAI,MAEAA,KAYJ,SAASy2B,gBAAgB0C,UAAWC,SAAUC,WAC5C,KAAM/vC,gBAAgBmtC,iBACpB,MAAM,IAAI5sC,YAAY,oDAGxB,IAAK8yB,OAAOwc,WAAY,MAAM,IAAIh0B,UAAU,sCAC5C,IAAKwX,OAAOyc,UAAW,MAAM,IAAIj0B,UAAU,qCAC3C,IAAKwX,OAAO0c,WAAY,MAAM,IAAIl0B,UAAU,sCAC5C7b,KAAK6vC,UAAYA,UACjB7vC,KAAK8vC,SAAWA,SAChB9vC,KAAK+vC,UAAYA,SACnB,CA4MA,OA1MA5C,gBAAgBlrC,UAAY,IAAIo+B,KAChC8M,gBAAgBlrC,UAAU8Z,KAAO,kBACjCoxB,gBAAgBlrC,UAAUwxB,mBAAoB,EAe9C0Z,gBAAgBlrC,UAAUy+B,SAAW,SAAU/E,KAAMoF,UACnD,IAAIiP,cAAgBhwC,KAAK6vC,UAAUnP,SAAS/E,KAAMoF,UAE9CkP,aAAejwC,KAAK8vC,SAASpP,SAAS/E,KAAMoF,UAE5CmP,cAAgBlwC,KAAK+vC,UAAUrP,SAAS/E,KAAMoF,UAElD,OAAO,SAA6BvL,MAAO7iB,KAAMy5B,SAC/C,OAuJJ,SAAuByD,WACrB,GAAyB,iBAAdA,WAA+C,kBAAdA,WAAgD,iBAAdA,UAC5E,QAASA,UAGX,GAAIA,UAAW,CACb,GAAI5d,YAAY4d,WACd,OAAQA,UAAUzmC,SAGpB,GAAI8oB,UAAU2d,WACZ,SAAUA,UAAUttC,KAAMstC,UAAUrtC,IAGtC,GAAI6vB,OAAOwd,WACT,QAASA,UAAU5zB,KAEvB,CAEA,GAAI4zB,gBACF,OAAO,EAGT,MAAM,IAAIh0B,UAAU,kCAAoC,UAAOg0B,WAAa,IAC9E,CA/KWM,CAAcH,cAAcxa,MAAO7iB,KAAMy5B,UAAY6D,aAAaza,MAAO7iB,KAAMy5B,SAAW8D,cAAc1a,MAAO7iB,KAAMy5B,QAC9H,CACF,EAOAe,gBAAgBlrC,UAAUqV,QAAU,SAAUqC,UAC5CA,SAAS3Z,KAAK6vC,UAAW,YAAa7vC,MACtC2Z,SAAS3Z,KAAK8vC,SAAU,WAAY9vC,MACpC2Z,SAAS3Z,KAAK+vC,UAAW,YAAa/vC,KACxC,EASAmtC,gBAAgBlrC,UAAU6a,IAAM,SAAUnD,UACxC,OAAO,IAAIwzB,gBAAgBntC,KAAKghC,QAAQrnB,SAAS3Z,KAAK6vC,UAAW,YAAa7vC,OAAQA,KAAKghC,QAAQrnB,SAAS3Z,KAAK8vC,SAAU,WAAY9vC,OAAQA,KAAKghC,QAAQrnB,SAAS3Z,KAAK+vC,UAAW,YAAa/vC,OACpM,EAOAmtC,gBAAgBlrC,UAAUgT,MAAQ,WAChC,OAAO,IAAIk4B,gBAAgBntC,KAAK6vC,UAAW7vC,KAAK8vC,SAAU9vC,KAAK+vC,UACjE,EAQA5C,gBAAgBlrC,UAAU4/B,UAAY,SAAUxW,SAC9C,IAAIwiB,YAAcxiB,SAAWA,QAAQwiB,YAAcxiB,QAAQwiB,YAAc,OACrEW,WAAab,cAAc3tC,KAAM6tC,aAKjCgC,UAAY7vC,KAAK6vC,UAAUvmC,SAAS+hB,SACpC+kB,oBAAsBzC,cAAc3tC,KAAK6vC,UAAWhC,cAEpC,QAAhBA,aAAiD,iBAAxB7tC,KAAK6vC,UAAU9zB,MAAmD,OAAxBq0B,qBAAgCA,qBAAuB5B,cAC5HqB,UAAY,IAAMA,UAAY,KAGhC,IAAIC,SAAW9vC,KAAK8vC,SAASxmC,SAAS+hB,SAClCglB,eAAiB1C,cAAc3tC,KAAK8vC,SAAUjC,cAE9B,QAAhBA,aAAgD,iBAAvB7tC,KAAK8vC,SAAS/zB,MAA8C,OAAnBs0B,gBAA2BA,gBAAkB7B,cACjHsB,SAAW,IAAMA,SAAW,KAG9B,IAAIC,UAAY/vC,KAAK+vC,UAAUzmC,SAAS+hB,SACpCilB,gBAAkB3C,cAAc3tC,KAAK+vC,UAAWlC,aAMpD,OAJoB,QAAhBA,aAAiD,iBAAxB7tC,KAAK+vC,UAAUh0B,MAA+C,OAApBu0B,iBAA4BA,iBAAmB9B,cACpHuB,UAAY,IAAMA,UAAY,KAGzBF,UAAY,MAAQC,SAAW,MAAQC,SAChD,EAOA5C,gBAAgBlrC,UAAU2O,OAAS,WACjC,MAAO,CACLi0B,OAAQ,kBACRgL,UAAW7vC,KAAK6vC,UAChBC,SAAU9vC,KAAK8vC,SACfC,UAAW/vC,KAAK+vC,UAEpB,EAUA5C,gBAAgBjI,SAAW,SAAUzH,MACnC,OAAO,IAAI0P,gBAAgB1P,KAAKoS,UAAWpS,KAAKqS,SAAUrS,KAAKsS,UACjE,EAQA5C,gBAAgBlrC,UAAU6/B,OAAS,SAAUzW,SAC3C,IAAIwiB,YAAcxiB,SAAWA,QAAQwiB,YAAcxiB,QAAQwiB,YAAc,OACrEW,WAAab,cAAc3tC,KAAM6tC,aAKjCgC,UAAY7vC,KAAK6vC,UAAU/N,OAAOzW,SAClC+kB,oBAAsBzC,cAAc3tC,KAAK6vC,UAAWhC,cAEpC,QAAhBA,aAAiD,iBAAxB7tC,KAAK6vC,UAAU9zB,MAAmD,OAAxBq0B,qBAAgCA,qBAAuB5B,cAC5HqB,UAAY,iEAAmEA,UAAY,kEAG7F,IAAIC,SAAW9vC,KAAK8vC,SAAShO,OAAOzW,SAChCglB,eAAiB1C,cAAc3tC,KAAK8vC,SAAUjC,cAE9B,QAAhBA,aAAgD,iBAAvB7tC,KAAK8vC,SAAS/zB,MAA8C,OAAnBs0B,gBAA2BA,gBAAkB7B,cACjHsB,SAAW,iEAAmEA,SAAW,kEAG3F,IAAIC,UAAY/vC,KAAK+vC,UAAUjO,OAAOzW,SAClCilB,gBAAkB3C,cAAc3tC,KAAK+vC,UAAWlC,aAMpD,OAJoB,QAAhBA,aAAiD,iBAAxB7tC,KAAK+vC,UAAUh0B,MAA+C,OAApBu0B,iBAA4BA,iBAAmB9B,cACpHuB,UAAY,iEAAmEA,UAAY,kEAGtFF,UAAY,iEAAmEC,SAAW,iEAAmEC,SACtK,EAQA5C,gBAAgBlrC,UAAU+/B,OAAS,SAAU3W,SAC3C,MAAO,mBAAqBrrB,KAAK8vC,SAAS/N,MAAM1W,SAAW,4BAA8BrrB,KAAK6vC,UAAU9N,MAAM1W,SAAW,SAAWrrB,KAAK+vC,UAAUhO,MAAM1W,SAAW,2CACtK,EAkCO8hB,eAAe,GACrB,CACD7P,SAAS,EACTjK,QAAQ,mCC3OCkd,aAAe,CAExBC,MAAO,IACPC,MAAO,UACPC,KAAM,IACNC,KAAM,SACNC,MAAO,UACPC,MAAO,UACPC,MAAO,UACPC,MAAO,UACPC,QAAS,IACTjZ,QAAS,YACTkZ,WAAY,eACZC,KAAM,IACNC,KAAM,SACNC,IAAK,IACLC,IAAK,QACLC,MAAO,UACPC,MAAO,UACPC,SAAU,aACVC,KAAM,IACNC,KAAM,SACNC,MAAO,IACPC,MAAO,UACPC,SAAU,aACVC,OAAQ,WACRC,OAAQ,WACRC,GAAI,IACJC,GAAI,OACJC,GAAI,IACJC,GAAI,OACJC,GAAI,OACJ1gC,GAAI,OACJ2gC,QAAS,IACTC,QAAS,IACTC,GAAI,OACJv+B,GAAI,OACJw+B,MAAO,UACPC,IAAK,IACLC,IAAK,QACLC,OAAQ,WACRC,MAAO,UACPC,MAAO,UACPC,SAAU,aACVC,IAAK,IACLC,IAAK,QACLC,QAAS,YACTC,QAAS,YACTC,IAAK,QACLvN,IAAK,QACLwN,OAAQ,WACRC,IAAK,IACLC,IAAK,QACLC,IAAK,QACLC,IAAK,QACLC,MAAO,UACPC,MAAO,UAEPC,KAAM,iBACNC,MAAO,kBAEPhyC,EAAG,IAEH2L,IAAK,UACLsmC,IAAK,UACLC,SAAU,UACV3wC,SAAU,UACV4wC,GAAI,UACJC,IAAK,QACL7yC,UAAW,eAEF8yC,eAAiB,CAC1BC,UAAW,SACXC,WAAY,KACZC,UAAW,IACXhyC,IAAK,IACLiyC,OAAQ,YAERC,UAAW,IACXC,WAAY,IACZC,OAAQ,MAERC,IAAK,QACLC,SAAU,SACVrqC,OAAQ,SAERsqC,YAAa,UAEbC,UAAW,KAEX1mC,IAAK,QACLI,IAAK,IACL2C,SAAU,IACV0L,GAAI,eACJk4B,UAAW,KACXC,gBAAiB,KACjBC,cAAe,MACfC,MAAO,IACPC,QAAS,QACTC,QAAS,IACTC,OAAQ,IACRC,UAAW,QACXC,SAAU,QACVC,OAAQ,MACRC,OAAQ,iBACRC,MAAO,IACPC,IAAK,UACLC,IAAK,WACLC,GAAI,SAEKC,eAAiB,CAE1Bh1C,IAAK,CACH,EAAG,6BAEL0N,IAAK,CACH,EAAG,oBAAoBuP,OAAOo2B,eAAe3lC,IAAK,uBAEpDzE,KAAM,CACJ,EAAG,yBAEL7F,KAAM,CACJ,EAAG,yCAEL6xC,KAAM,CACJ,EAAG,+BAELxrC,OAAQ,CACN,EAAG,kCAELuqC,UAAW,CACT,EAAG,oBAAoB/2B,OAAOo2B,eAAeW,UAAW,uBAE1DD,YAAa,CACX,EAAG,oBAAoB92B,OAAOo2B,eAAeU,YAAa,uBAE5DN,OAAQ,CACN,EAAG,oBAAoBx2B,OAAOo2B,eAAeI,OAAQ,uBAEvDj0C,IAAK,CACH,EAAG,kCAELwC,MAAO,WAAWib,OAAOo2B,eAAe7xC,IAAK,0BAC7C0zC,IAAK,CACH,EAAG,8CAEL7xC,MAAO,CACL,EAAG,2CAEL2U,IAAK,8BACLnE,MAAO,gCACP3T,IAAK,CACH,EAAG,gCACH,EAAG,+CAEL+T,MAAO,CACL,EAAG,uCAELshB,MAAO,CACL,EAAG,kCACH,EAAG,iDAELvhB,KAAM,qCACN1G,IAAK,CACH,EAAG,oBAAoB2P,OAAOo2B,eAAe/lC,IAAK,uBAEpDwmC,SAAU,CACR,EAAG,oBAAoB72B,OAAOo2B,eAAeS,SAAU,uBAEzDqB,KAAM,CACJ,EAAG,gCACH,OAAG50C,GAGL60C,QAAS,CACP,EAAG,kCAELC,SAAU,CACR,EAAG,yCAEL7zC,IAAK,CACH,EAAG,4BAA4Byb,OAAOo2B,eAAe7xC,IAAK,iBAE5D8B,MAAO,CACL,EAAG,yCACH,OAAG/C,GAGL4Q,KAAM,CACJ,EAAG,8CAELrP,KAAM,CACJ,EAAG,sBAELwzC,OAAQ,CACN,EAAG,+BAELjlC,SAAU,CACR,EAAG,oBAAoB4M,OAAOo2B,eAAehjC,SAAU,uBAEzDsjC,WAAY,CACV,EAAG,GAAG12B,OAAOo2B,eAAeM,WAAY,8BAE1CD,UAAW,CACT,EAAG,GAAGz2B,OAAOo2B,eAAeK,UAAW,8BAGzCgB,OAAQ,CACN,EAAG,oBAAoBz3B,OAAOo2B,eAAeqB,OAAQ,uBAEvDd,OAAQ,CACN,EAAGP,eAAeO,OAAS,6BAE7BgB,MAAO,CACL,EAAG,oBAAoB33B,OAAOo2B,eAAeuB,MAAO,uBAEtDD,OAAQ,CACN,EAAG,oBAAoB13B,OAAOo2B,eAAesB,OAAQ,uBAEvDV,UAAW,CACT,EAAG,oBAAoBh3B,OAAOo2B,eAAeY,UAAW,uBAE1DC,gBAAiB,CACf,EAAG,oBAAoBj3B,OAAOo2B,eAAea,gBAAiB,uBAEhEC,cAAe,CACb,EAAG,oBAAoBl3B,OAAOo2B,eAAec,cAAe,uBAG9DoB,YAAa,CACX,EAAG,4BAELC,QAAS,CACP,EAAG,4BAELC,WAAY,CACV,EAAG,qCAGLh0C,IAAK,CACH,EAAG,kCAELi0C,KAAM,CACJ,EAAG,+BAEL9zC,GAAI,CACF,EAAG,+CAELD,GAAI,CACF,EAAG,+CAGLkzC,IAAK,CACH,EAAG,oBAAoB53B,OAAOo2B,eAAewB,IAAK,uBAEpDhB,IAAK,CACH,EAAGR,eAAeQ,IAAM,6BAE1BkB,GAAI,CACF,EAAG,oBAAoB93B,OAAOo2B,eAAe0B,GAAI,uBAEnDD,IAAK,CACH,EAAG,oBAAoB73B,OAAOo2B,eAAeyB,IAAK,uBAGpDa,MAAO,CACL,EAAG,6DAELpC,WAAY,CACV,EAAG,4BAA4Bt2B,OAAOo2B,eAAeE,aAEvDqC,IAAK,CACH,EAAG,kCAEL/e,IAAK,CACH,EAAG,6CAELgf,KAAM,CACJ,EAAG,kCAELC,IAAK,CACH,EAAG,kCAELC,MAAO,CACL,EAAG,eAAe94B,OAAOo2B,eAAe7xC,IAAK,mBAE/Cw0C,MAAO,CACL,EAAG,yCAEL1C,UAAW,CACT,EAAG,4BAA4Br2B,OAAOo2B,eAAeC,YAGvD2C,aAAc,CACZ,EAAG,mCAELC,oBAAqB,CACnB,EAAG,gEAEL1C,UAAW,CACT,EAAG,4BAA4Bv2B,OAAOo2B,eAAeG,YAEvDvD,MAAO,CACL,EAAG,oCAGLmE,MAAO,CACL,EAAG,oBAAoBn3B,OAAOo2B,eAAee,MAAO,uBAEtDG,OAAQ,CACN,EAAG,oBAAoBt3B,OAAOo2B,eAAekB,OAAQ,uBAEvDE,SAAU,CACR,EAAG,oBAAoBx3B,OAAOo2B,eAAeoB,SAAU,uBAEzDH,QAAS,CACP,EAAG,oBAAoBr3B,OAAOo2B,eAAeiB,QAAS,uBAExDE,UAAW,CACT,EAAG,oBAAoBv3B,OAAOo2B,eAAemB,UAAW,uBAE1DH,QAAS,CACP,EAAG,oBAAoBp3B,OAAOo2B,eAAegB,QAAS,uBAGxD8B,IAAK,CACH,EAAG,gCAGLjwC,IAAK,8BACLD,IAAK,8BACLmwC,SAAU,sCAEV3zC,KAAM,CACJ,EAAG,uCAELS,MAAO,CACL,EAAG,wCAELmzC,KAAM,CACJ,EAAG,uCAELC,MAAO,CACL,EAAG,wCAELC,KAAM,CACJ,EAAG,uCAELC,MAAO,CACL,EAAG,gDAELC,KAAM,CACJ,EAAG,uCAELC,MAAO,CACL,EAAG,gDAELh0C,KAAM,CACJ,EAAG,uCAELO,MAAO,CACL,EAAG,wCAELT,KAAM,CACJ,EAAG,uCAELpC,MAAO,CACL,EAAG,yCAEL4C,MAAO,CACL,EAAG,wCAEL7C,IAAK,CACH,EAAG,kCAELd,KAAM,CACJ,EAAG,mCAELs3C,IAAK,CACH,EAAG,kCAELC,KAAM,CACJ,EAAG,mCAELC,IAAK,CACH,EAAG,kCAELC,KAAM,CACJ,EAAG,2CAELC,IAAK,CACH,EAAG,kCAELC,KAAM,CACJ,EAAG,2CAELt2C,IAAK,CACH,EAAG,kCAELjB,KAAM,CACJ,EAAG,mCAELyO,IAAK,CACH,EAAG,kCAELnD,KAAM,CACJ,EAAG,mCAGLgR,GAAI,CACF,EAAG,oBAAoBkB,OAAOo2B,eAAet3B,GAAI,uBAGnDk7B,QAAS,SAAiB5W,KAAM5V,SAE9B,OAAO4V,KAAKtuB,KAAK,GAAGovB,OACtB,EAEA1D,OAAQ,CACN,EAAG,IACH,EAAG,4BACH,EAAG,sDAELuM,OAAQ,CACN,EAAG,eACH,EAAG,6CAELkN,UAAW,CACT,EAAG,IACH,EAAG,6BAELC,QAAS,CACP,EAAG,IACH,EAAG,4BACH,EAAG,oCAAoCl6B,OAAO0yB,aAAa3uC,EAAG,4CAEhEw8B,OAAQ,CACN,EAAG,iCACH,EAAG,4BACH,EAAG,6BAEL4Z,OAAQ,CACN,EAAG,iCACH,EAAG,6BAELC,KAAM,CACJ,EAAG,4BACH,EAAG,uDAIHC,WAAa,CACfC,IAAK,WAEA,SAASC,YAAYxN,QAC1B,OAAO,KAAeA,OAAQ,CAC5Bh0B,oBAAoB,GAExB,CAGO,SAASyhC,SAAS5gC,KAAM4a,QAG7B,OAFAA,YAA2B,IAAXA,QAAiCA,QAG3C,sBAAe6lB,WAAYzgC,MACtBygC,WAAWzgC,MAGb,YAAc2gC,YAAY3gC,MAAQ,IAGvC,sBAAe84B,aAAc94B,MACxB84B,aAAa94B,MAGf2gC,YAAY3gC,KACrB,CC5dA,ICEW6gC,yBAA2B,CACpCnY,iBACAoY,mBDF6C,gBAFpC,eACQ,CAAC,SACuD7hC,OACzE,IAAI,MAEAA,KAcJ,SAAS8hC,aAAav8B,OACpB,KAAMjc,gBAAgBw4C,cACpB,MAAM,IAAIj4C,YAAY,oDAGxBP,KAAKic,MAAQA,KACf,CA4JA,OA1JAu8B,aAAav2C,UAAY,IAAIo+B,KAC7BmY,aAAav2C,UAAU8Z,KAAO,eAC9By8B,aAAav2C,UAAUyxB,gBAAiB,EAexC8kB,aAAav2C,UAAUy+B,SAAW,SAAU/E,KAAMoF,UAChD,IAAI9kB,MAAQjc,KAAKic,MACjB,OAAO,WACL,OAAOA,KACT,CACF,EAOAu8B,aAAav2C,UAAUqV,QAAU,SAAUqC,UAC3C,EASA6+B,aAAav2C,UAAU6a,IAAM,SAAUnD,UACrC,OAAO3Z,KAAKiV,OACd,EAOAujC,aAAav2C,UAAUgT,MAAQ,WAC7B,OAAO,IAAIujC,aAAax4C,KAAKic,MAC/B,EAQAu8B,aAAav2C,UAAU4/B,UAAY,SAAUxW,SAC3C,OAAO,cAAOrrB,KAAKic,MAAOoP,QAC5B,EAQAmtB,aAAav2C,UAAU6/B,OAAS,SAAUzW,SACxC,IAAIpP,MAAQjc,KAAK6hC,UAAUxW,SAE3B,OAAQ,UAAOrrB,KAAKic,QAClB,IAAK,SACL,IAAK,YACL,IAAK,WACH,MAAO,6BAA+BA,MAAQ,UAEhD,IAAK,SACH,MAAO,6BAA+BA,MAAQ,UAEhD,IAAK,UACH,MAAO,8BAAgCA,MAAQ,UAEjD,IAAK,OACH,MAAO,kCAAoCA,MAAQ,UAErD,IAAK,YACH,MAAO,gCAAkCA,MAAQ,UAEnD,QACE,MAAO,6BAA+BA,MAAQ,UAEpD,EAOAu8B,aAAav2C,UAAU2O,OAAS,WAC9B,MAAO,CACLi0B,OAAQ,eACR5oB,MAAOjc,KAAKic,MAEhB,EAUAu8B,aAAatT,SAAW,SAAUzH,MAChC,OAAO,IAAI+a,aAAa/a,KAAKxhB,MAC/B,EAQAu8B,aAAav2C,UAAU+/B,OAAS,SAAU3W,SACxC,IAAIpP,MAAQjc,KAAK6hC,UAAUxW,SAE3B,OAAQ,UAAOrrB,KAAKic,QAClB,IAAK,SACH,MAAO,YAAcm8B,YAAYn8B,OAAS,IAE5C,IAAK,SACL,IAAK,YAED,IAAK5a,SAASrB,KAAKic,OACjB,OAAOjc,KAAKic,MAAMtL,UAAY,EAAI,WAAa,UAGjD,IAAI4G,MAAQ0E,MAAMpI,cAAcjM,QAAQ,KAExC,OAAe,IAAX2P,MACK0E,MAAM3I,UAAU,EAAGiE,OAAS,aAAe0E,MAAM3I,UAAUiE,MAAQ,GAAK,IAG5E0E,MAET,IAAK,WACH,OAAOjc,KAAKic,MAAMw8B,UAEpB,QACE,OAAOx8B,MAEb,EAEOu8B,YAAY,GAClB,CACDlb,SAAS,EACTjK,QAAQ,KErLCqlB,mCAAqC,CAC9CvY,iBACAmG,kBACAqS,6BCDuD,gBAF9C,yBACQ,CAAC,QAAS,SACwDjiC,OACnF,IAAI,MACG,MAEHA,KAcJ,SAASw2B,uBAAuBz1B,KAAMoF,OAAQ4jB,MAC5C,KAAMzgC,gBAAgBktC,wBACpB,MAAM,IAAI3sC,YAAY,oDAIxB,GAAoB,iBAATkX,KAAmB,MAAM,IAAIoE,UAAU,wCAClD,IAAKhB,MAAMC,QAAQ+B,QAAS,MAAM,IAAIhB,UAAU,uEAChD,IAAKwX,OAAOoN,MAAO,MAAM,IAAI5kB,UAAU,sCACvC,GAAIkjB,SAASY,IAAIloB,MAAO,MAAM,IAAI1Q,MAAM,2BAA6B0Q,KAAO,2BAC5EzX,KAAKyX,KAAOA,KACZzX,KAAK6c,OAASA,OAAOC,KAAI,SAAUC,OACjC,OAAOA,OAASA,MAAMtF,MAAQsF,KAChC,IACA/c,KAAKqb,MAAQwB,OAAOC,KAAI,SAAUC,OAChC,OAAOA,OAASA,MAAMhB,MAAQ,KAChC,IACA/b,KAAKygC,KAAOA,IACd,CAyFA,SAASwL,gBAAgBhL,KAAM4M,aAC7B,IAAIW,WAAab,cAAc1M,KAAM4M,aACjCY,eAAiBd,cAAc1M,KAAKR,KAAMoN,aAC9C,MAAuB,QAAhBA,aAA4C,OAAnBY,gBAA2BA,gBAAkBD,UAC/E,CA2FA,OAtLAtB,uBAAuBjrC,UAAY,IAAIo+B,KACvC6M,uBAAuBjrC,UAAU8Z,KAAO,yBACxCmxB,uBAAuBjrC,UAAU0xB,0BAA2B,EAe5DuZ,uBAAuBjrC,UAAUy+B,SAAW,SAAU/E,KAAMoF,UAC1D,IAAI6X,cAAgB7iC,OAAO4E,OAAOomB,UAClCzpB,QAAQtX,KAAK6c,QAAQ,SAAUE,OAC7B67B,cAAc77B,QAAS,CACzB,IAEA,IAAI87B,SAAW74C,KAAKygC,KAAKC,SAAS/E,KAAMid,eAEpCnhC,KAAOzX,KAAKyX,KACZoF,OAAS7c,KAAK6c,OACdV,UAAYI,KAAKvc,KAAKqb,MAAO,KAC7Bsd,OAASlhB,KAAO,IAAM8E,KAAKvc,KAAK6c,OAAQ,MAAQ,IACpD,OAAO,SAAoC2Y,MAAO7iB,KAAMy5B,SACtD,IAAIhwB,WAAa,CAAC,EAElBA,WAAWD,WAAa,WAGtB,IAFA,IAAI28B,UAAY/iC,OAAO4E,OAAOhI,MAErB/Q,EAAI,EAAGA,EAAIib,OAAOtb,OAAQK,IACjCk3C,UAAUj8B,OAAOjb,IAAM8S,UAAU9S,GAGnC,OAAOi3C,SAASrjB,MAAOsjB,UAAW1M,QACpC,EAEA,IAAIvyB,GAAKuB,MAAM3D,KAAM2E,YAGrB,OAFAvC,GAAG8e,OAASA,OACZnD,MAAM5f,IAAI6B,KAAMoC,IACTA,EACT,CACF,EAOAqzB,uBAAuBjrC,UAAUqV,QAAU,SAAUqC,UACnDA,SAAS3Z,KAAKygC,KAAM,OAAQzgC,KAC9B,EASAktC,uBAAuBjrC,UAAU6a,IAAM,SAAUnD,UAC/C,IAAI8mB,KAAOzgC,KAAKghC,QAAQrnB,SAAS3Z,KAAKygC,KAAM,OAAQzgC,OAEpD,OAAO,IAAIktC,uBAAuBltC,KAAKyX,KAAMzX,KAAK6c,OAAOzS,MAAM,GAAIq2B,KACrE,EAOAyM,uBAAuBjrC,UAAUgT,MAAQ,WACvC,OAAO,IAAIi4B,uBAAuBltC,KAAKyX,KAAMzX,KAAK6c,OAAOzS,MAAM,GAAIpK,KAAKygC,KAC1E,EAqBAyM,uBAAuBjrC,UAAU4/B,UAAY,SAAUxW,SACrD,IAAIwiB,YAAcxiB,SAAWA,QAAQwiB,YAAcxiB,QAAQwiB,YAAc,OACrEpN,KAAOzgC,KAAKygC,KAAKn3B,SAAS+hB,SAM9B,OAJI4gB,gBAAgBjsC,KAAM6tC,eACxBpN,KAAO,IAAMA,KAAO,KAGfzgC,KAAKyX,KAAO,IAAMzX,KAAK6c,OAAON,KAAK,MAAQ,OAASkkB,IAC7D,EAOAyM,uBAAuBjrC,UAAU2O,OAAS,WACxC,IAAIyK,MAAQrb,KAAKqb,MACjB,MAAO,CACLwpB,OAAQ,yBACRptB,KAAMzX,KAAKyX,KACXoF,OAAQ7c,KAAK6c,OAAOC,KAAI,SAAUC,MAAOxF,OACvC,MAAO,CACLE,KAAMsF,MACNhB,KAAMV,MAAM9D,OAEhB,IACAkpB,KAAMzgC,KAAKygC,KAEf,EAUAyM,uBAAuBhI,SAAW,SAAUzH,MAC1C,OAAO,IAAIyP,uBAAuBzP,KAAKhmB,KAAMgmB,KAAK5gB,OAAQ4gB,KAAKgD,KACjE,EAQAyM,uBAAuBjrC,UAAU6/B,OAAS,SAAUzW,SAIlD,IAHA,IAAIwiB,YAAcxiB,SAAWA,QAAQwiB,YAAcxiB,QAAQwiB,YAAc,OACrEhxB,OAAS,GAEJjb,EAAI,EAAGA,EAAI5B,KAAK6c,OAAOtb,OAAQK,IACtCib,OAAO/O,KAAK,4CAA8C,cAAO9N,KAAK6c,OAAOjb,IAAM,WAGrF,IAAI6+B,KAAOzgC,KAAKygC,KAAKqB,OAAOzW,SAM5B,OAJI4gB,gBAAgBjsC,KAAM6tC,eACxBpN,KAAO,iEAAmEA,KAAO,kEAG5E,+BAAiC,cAAOzgC,KAAKyX,MAA7C,wEAAoIoF,OAAON,KAAK,yCAA2C,qLAAuLkkB,IAC3X,EAQAyM,uBAAuBjrC,UAAU+/B,OAAS,SAAU3W,SAClD,IAAIwiB,YAAcxiB,SAAWA,QAAQwiB,YAAcxiB,QAAQwiB,YAAc,OACrEpN,KAAOzgC,KAAKygC,KAAKsB,MAAM1W,SAM3B,OAJI4gB,gBAAgBjsC,KAAM6tC,eACxBpN,KAAO,UAAU5iB,OAAO4iB,KAAM,aAGzB,YAAczgC,KAAKyX,KAAO,WAAazX,KAAK6c,OAAOC,IAAIu7B,UAAU97B,KAAK,KAAO,aAAekkB,IACrG,EAEOyM,sBAAsB,GAC5B,CACD5P,SAAS,EACTjK,QAAQ,KCjLH,SAAS0lB,QAAQh7B,MAAOpE,SAAU+oB,WACvC,OAAI3kB,OAA8B,mBAAdA,MAAMjB,IAEjBiB,MAAMjB,KAAI,SAAU5c,GACzB,OAAO64C,QAAQ74C,EAAGyZ,SAAU+oB,UAC9B,IAEO/oB,SAASoE,MAEpB,CC/DA,IAAIlO,GAAK,SACLmpC,GAAK,iBACF,SAASC,UAAUx4C,GACxB,OAAON,KAAKS,IAAIH,EAClB,CAEO,SAASy4C,UAAUz4C,EAAGC,GAC3B,OAAOD,EAAIC,CACb,CAMO,SAASy4C,eAAe14C,EAAGC,GAChC,OAAOD,EAAIC,CACb,CAMO,SAAS04C,iBAAiBl5C,GAC/B,OAAQA,CACV,CAUO,SAASm5C,WAAWn5C,GACzB,OAAOC,KAAK6D,KAAK9D,EACnB,CA4HO,SAASo5C,UAAUp5C,EAAG8C,GAC3B,GAAIA,EAAI,EAIN,OAAO9C,EAAI8C,EAAI7C,KAAK8D,MAAM/D,EAAI8C,GACzB,GAAU,IAANA,EACT,OAAO9C,EAIP,MAAM,IAAI6G,MAAM,8CAEpB,CAiIO,SAASwyC,UAAUr5C,EAAG8C,GAG3B,OAAI9C,EAAIA,EAAI,GAAK8C,IAAMG,KAAYjD,EAAIA,EAAI,GAAK8C,KAAOG,IAC9C,EAGFhD,KAAKiC,IAAIlC,EAAG8C,EACrB,CAUO,SAASw2C,YAAYv9B,OAC1B,IAAIkb,SAAWziB,UAAUnT,OAAS,QAAsBJ,IAAjBuT,UAAU,GAAmBA,UAAU,GAAK,EACnF,OAAO3S,WAAWuN,QAAQ2M,MAAOkb,UACnC,CA9TA8hB,UAAU98B,UAAYtM,GAItBqpC,UAAU/8B,UAAY68B,GAQtBG,eAAeh9B,UAAY68B,GAQ3BI,iBAAiBj9B,UAAYtM,GAY7BwpC,WAAWl9B,UAAYtM,GAyIvBypC,UAAUn9B,UAAY68B,GAyItBO,UAAUp9B,UAAY68B,GAatBQ,YAAYr9B,UAAY68B,GClUxB,ICGWS,gBAAkB,CAC3BnT,kBACAoT,UDHoC,gBAF3B,MACQ,CAAC,UAC8ChjC,OAChE,IAAI,OAEAA,KA0BJ,OAAO0E,MA/BE,MA+BU,CACjBijB,OAAQ4a,UACRh4C,QAAS,SAAiBf,GACxB,OAAOA,EAAEU,KACX,EACA6kC,UAAW,SAAmBvlC,GAC5B,OAAOA,EAAEU,KACX,EACAkX,SAAU,SAAkB5X,GAC1B,OAAOA,EAAEU,KACX,EACA,iBAAkB,SAAqBV,GAErC,OAAO64C,QAAQ74C,EAAGF,MAAM,EAC1B,EACA25C,KAAM,SAAcz5C,GAClB,OAAOA,EAAEU,KACX,GACA,KE9COg5C,sBAAwB,CACjCtT,kBACAuT,gBCJ0C,gBAFjC,YACQ,CAAC,UACoDnjC,OACtE,IAAI,OAEAA,KAcJ,OAAO0E,MAnBE,YAmBU,CACjB,iBAAkB89B,UAClB,mBAAoB,SAAwBh5C,EAAG8C,GAC7C,OAAO9C,EAAEoO,IAAItL,EACf,EACA,uBAAwB,SAA4B9C,EAAG8C,GACrD,OAAO9C,EAAEwB,KAAKsB,EAChB,EACA,qBAAsB,SAA0B9C,EAAG8C,GACjD,OAAO9C,EAAEoO,IAAItL,EACf,EACA,aAAc,SAAkB9C,EAAG8C,GACjC,GAAgB,OAAZ9C,EAAE+b,YAA8B9a,IAAZjB,EAAE+b,MAAqB,MAAM,IAAIlV,MAAM,oDAC/D,GAAgB,OAAZ/D,EAAEiZ,YAA8B9a,IAAZ6B,EAAEiZ,MAAqB,MAAM,IAAIlV,MAAM,oDAC/D,IAAK7G,EAAE0mC,UAAU5jC,GAAI,MAAM,IAAI+D,MAAM,sBACrC,IAAIxD,IAAMrD,EAAE+U,QAGZ,OAFA1R,IAAI0Y,MAAQjc,KAAKuD,IAAI0Y,MAAOjZ,EAAEiZ,OAC9B1Y,IAAIu2C,WAAY,EACTv2C,GACT,GACA,KClCOw2C,sBAAwB,CACjCxU,sBACAe,kBACA0T,gBCN0C,gBAFjC,YACQ,CAAC,QAAS,cAC2CtjC,OACtE,IAAI,MACG,WAEHA,KA2BJ,OAAO0E,MAAM,YAAa,CACxB,GAAI,WACF,OAAO,IAAIqqB,UAAU,EACvB,EACApH,OAAQ,SAAgBn+B,GAEtB,OAAO,IAAIulC,UAAUvlC,EAAI,GAC3B,EACA0qC,OAAQ,SAAgB1qC,GACtB,IAAI+5C,oBAAsB/5C,EAAEuB,MAAM,iCAElC,GAAIw4C,oBAAqB,CAEvB,IAAI5jB,KAAO4jB,oBAAoB,GAC3BlwC,EAAI07B,UAAUwU,oBAAoB,IAClCC,WAAa,IAAIzU,UAAU,GAAGrjC,IAAIhB,OAAOi1B,OAE7C,GAAItsB,EAAExB,GAAG2xC,WAAWvsC,IAAI,IACtB,MAAM,IAAIpN,YAAY,WAAYsd,OAAO3d,EAAG,sBAG9C,IAAIi6C,iBAAmB,IAAI1U,UAAU,GAAGrjC,IAAIhB,OAAOi1B,MAAQ,GAE3D,OAAItsB,EAAEiB,IAAImvC,kBACDpwC,EAAE4D,IAAIusC,YAENnwC,CAEX,CAEA,OAAO,IAAI07B,UAAUvlC,EACvB,EACAulC,UAAW,SAAmBvlC,GAE5B,OAAOA,CACT,EACA4X,SAAU,SAAkB5X,GAC1B,OAAO,IAAIulC,UAAUvlC,EAAE6J,GAAGW,IAAIxK,EAAEiC,GAAGqH,MAAMtJ,EAAE+H,EAC7C,EACAmyC,KAAM,SAAel6C,GACnB,OAAO,IAAIulC,UAAU,EACvB,EACA,iBAAkB,SAAqBvlC,GACrC,OAAO64C,QAAQ74C,EAAGF,KACpB,GACA,KCzEOq6C,qBAAuB,CAChCrU,qBACAM,kBACAgU,eCNyC,gBAFhC,WACQ,CAAC,QAAS,aAC0C5jC,OACrE,IAAI,MACG,UAEHA,KA2BJ,OAAO0E,MAAM,WAAY,CACvBijB,OAAQ,SAAgBn+B,GACtB,IAAKmB,SAASnB,IAAM4B,MAAM5B,GACxB,MAAM,IAAI6G,MAAM7G,EAAI,wCAGtB,OAAO,IAAI4X,SAAS5X,EACtB,EACA0qC,OAAQ,SAAgB1qC,GACtB,OAAO,IAAI4X,SAAS5X,EACtB,EACA,iBAAkB,SAAsB8S,UAAW1F,aACjD,OAAO,IAAIwK,SAAS9E,UAAW1F,YACjC,EACA8sC,KAAM,SAAel6C,GACnB,OAAO,IAAI4X,SAAS,EACtB,EACA2tB,UAAW,SAAmBvlC,GAC5B,OAAO,IAAI4X,SAAS5X,EAAEoJ,WACxB,EACAwO,SAAU,SAAkB5X,GAC1B,OAAOA,CACT,EACA6V,OAAQ,SAAgB7V,GACtB,OAAO,IAAI4X,SAAS5X,EACtB,EACA,iBAAkB,SAAqBA,GACrC,OAAO64C,QAAQ74C,EAAGF,KACpB,GACA,KCRG,IClDIu6C,mBAAqB,CAC9BjU,kBACAkU,aDgDuC,gBAtD9B,SACQ,CAAC,UAqDiD9jC,OACnE,IAAI,OAEAA,KA2BA2nB,OAASjjB,MAAM,SAAU,CAC3B,GAAI,WACF,OAAO,CACT,EACAijB,OAAQ,SAAgBn+B,GACtB,OAAOA,CACT,EACA0qC,OAAQ,SAAgB1qC,GACtB,GAAU,QAANA,EAAa,OAAOmE,IACxB,IArF4Bo2C,MAC5BC,yBAoFIC,uBApFJD,0BAD4BD,MAqFyBv6C,GApFpBuB,MAAM,2CAUlC,CACLg5C,MACAG,MATU,CACV,KAAM,EACN,KAAM,EACN,KAAM,IACNF,yBAAyB,IAMzBG,YALgBH,yBAAyB,GAMzCI,eALmBJ,yBAAyB,IAQvC,KAqEL,GAAIC,sBACF,OA5DR,SAAuCI,OAIrC,IAHA,IAAIhxC,EAAIiO,SAAS+iC,MAAMF,YAAaE,MAAMH,OACtCpU,EAAI,EAEC5kC,EAAI,EAAGA,EAAIm5C,MAAMD,eAAev5C,OAAQK,IAE/C4kC,GADiBxuB,SAAS+iC,MAAMD,eAAel5C,GAAIm5C,MAAMH,OACvCz6C,KAAKiC,IAAI24C,MAAMH,MAAOh5C,EAAI,GAG9C,IAAIoV,OAASjN,EAAIy8B,EAEjB,GAAI1kC,MAAMkV,QACR,MAAM,IAAIzW,YAAY,WAAaw6C,MAAMN,MAAQ,wBAGnD,OAAOzjC,MACT,CA4CegkC,CAA8BL,uBAGvC,IAAItkB,KAAO,EACP4jB,oBAAsB/5C,EAAEuB,MAAM,iCAE9Bw4C,sBAGF5jB,KAAOj1B,OAAO64C,oBAAoB,IAClC/5C,EAAI+5C,oBAAoB,IAG1B,IAAIzsC,IAAMpM,OAAOlB,GAEjB,GAAI4B,MAAM0L,KACR,MAAM,IAAIjN,YAAY,WAAaL,EAAI,wBAGzC,GAAI+5C,oBAAqB,CAGvB,GAAIzsC,IAAM,GAAK6oB,KAAO,EAEpB,MAAM,IAAI91B,YAAY,WAAYsd,OAAO3d,EAAG,sBAI1CsN,KAAO,IAAM6oB,KAAO,KACtB7oB,KAAY,GAAK6oB,KAErB,CAEA,OAAO7oB,GACT,EACAi4B,UAAW,SAAmBvlC,GAC5B,OAAOA,EAAE+P,UACX,EACA6H,SAAU,SAAkB5X,GAC1B,OAAOA,EAAEyQ,SACX,EACAgpC,KAAM,SAAcz5C,GAClB,MAAM,IAAI6G,MAAM,+CAClB,EACAqzC,KAAM,SAAel6C,GACnB,OAAO,CACT,EACA,sBAAuB,SAAwB+3C,KAAMgD,eACnD,OAAOhD,KAAKhoC,SAASgrC,cACvB,EACA,iBAAkB,SAAqB/6C,GACrC,OAAO64C,QAAQ74C,EAAGF,KACpB,IAWF,OAJAq+B,OAAO6G,SAAW,SAAUzH,MAC1B,OAAO17B,WAAW07B,KAAKxhB,MACzB,EAEOoiB,MAAM,KEjKR,SAAS6c,cACd,MAAM,IAAIn0C,MAAM,0CAClB,CACO,SAASo0C,aACd,MAAM,IAAIp0C,MAAM,yCAClB,CCFA,IAEWq0C,cAA+B,gBAF/B,UACQ,CAAC,SAAU,aAAc,cAC0B1kC,OACpE,IACE2nB,OAAQgd,QAAO,UACN,UAEP3kC,KACA4kC,gBAAkB,CACpB1Q,QAAQ,EACRvM,QAAQ,EACRoH,WAAW,EACX3tB,UAAU,GAGRyjC,iBAAmB,CACrBld,OAAQn+B,GAAKm7C,QAAQn7C,GACrBulC,UAAWqS,UAAY53C,GAAK43C,UAAU53C,GAAKg7C,YAC3CpjC,SAAU2gB,SAAWv4B,GAAKu4B,SAASv4B,GAAKi7C,YA+B1C,OAAO,SAAiBl/B,MAAOu/B,YAC7B,IAAIC,UAAY,UAAOx/B,OAEvB,KAAMw/B,aAAaH,iBACjB,MAAM,IAAIz/B,UAAU,kBAAoBI,MAAQ,aAAew/B,UAAY,4BAA8B1lC,OAAOoB,KAAKmkC,iBAAiB/+B,KAAK,OAG7I,KAAMi/B,cAAcD,kBAClB,MAAM,IAAI1/B,UAAU,kBAAoBI,MAAQ,aAAeu/B,WAAa,6BAA+BzlC,OAAOoB,KAAKokC,kBAAkBh/B,KAAK,OAGhJ,OAAIi/B,aAAeC,UACVx/B,MAEAs/B,iBAAiBC,YAAYv/B,MAExC,CAAC,IC5DQy/B,oBAAsB,CAC/B3B,sBACAM,qBACAE,mBACAa,eCLSO,yBAA2B,CACpCD,oBACApV,kBACAsV,mBCN6C,gBAFpC,eACQ,CAAC,QAAS,YAC8CllC,OACzE,IAAI,MACG,SAEHA,KAcJ,OAAO0E,MApBE,eAoBU,CACjB,iBAAkB,SAAsBlb,EAAG8C,GACzC,OAAO9C,EAAI8C,CACb,EACA,mBAAoB,SAAwB9C,EAAG8C,GAC7C,OAAO9C,EAAEwK,IAAI1H,EACf,EACA,uBAAwB,SAA4B9C,EAAG8C,GACrD,OAAO9C,EAAEwK,IAAI1H,EACf,EACA,qBAAsB,SAA0B9C,EAAG8C,GACjD,OAAO9C,EAAEwK,IAAI1H,EACf,EACA,sCAAuC,SAAqC9C,EAAG8C,GAC7E,IAAIO,IAAMrD,EAAE+U,QAER/J,IAAM2sC,QAAQ,EAAG,UAAO70C,IAE5B,OADAO,IAAI0Y,MAAQjc,KAAmB,OAAduD,IAAI0Y,MAAiB1Y,IAAIs4C,WAAW3wC,KAAO3H,IAAI0Y,MAAOjZ,GAChEO,GACT,EACA,sCAAuC,SAAqCrD,EAAG8C,GAC7E,IAAIO,IAAMP,EAAEiS,QACZ1R,IAAMA,IAAInB,KAAK,GAEf,IAAI8I,IAAM2sC,QAAQ,EAAG,UAAO33C,IAE5B,OADAqD,IAAI0Y,MAAQjc,KAAKE,EAAe,OAAZ8C,EAAEiZ,MAAiBjZ,EAAE64C,WAAW3wC,KAAOlI,EAAEiZ,OACtD1Y,GACT,EACA,aAAc,SAAkBrD,EAAG8C,GACjC,OAAO9C,EAAEmK,OAAOrH,EAClB,GACA,KCjDO84C,kBAAmC,gBAFnC,cACQ,CAAC,UACsDplC,OACxE,IAAI,OAEAA,KAqBJ,OAAO,SAAqBqlC,YAAaC,aAAcriC,SAAUsiC,SAE/D,IAAIC,MAAQH,YAAYhZ,MACpBoZ,MAAQJ,YAAY/Y,MACpBoZ,IAAML,YAAY9Y,UAElBoZ,QAAUL,aAAa/U,QACvBqV,OAASN,aAAa9U,OACtBqV,KAAOP,aAAa7U,KACpBqV,MAAQR,aAAahZ,MACrByZ,IAAMT,aAAa/Y,UAEvB,GAAIkZ,MAAM56C,SAAWi7C,MAAMj7C,OACzB,MAAM,IAAIu3B,eAAeqjB,MAAM56C,OAAQi7C,MAAMj7C,QAI/C,GAAI46C,MAAM,KAAOK,MAAM,IAAML,MAAM,KAAOK,MAAM,GAC9C,MAAM,IAAIze,WAAW,iCAAmCoe,MAAQ,0BAA4BK,MAAQ,KAItG,IAAKH,QACH,MAAM,IAAIt1C,MAAM,sEAIlB,IAGI21C,GAHAlY,KAAO2X,MAAM,GACbzX,QAAUyX,MAAM,GAIhB3U,KAAO,EAEPmV,GAAKhjC,SAEU,iBAARyiC,KAAoBA,MAAQK,MAErCC,GAAKN,IAEL5U,KAAOpsB,MAAMoB,QAAQ,EAAGkgC,IAExBC,GAAKvhC,MAAMc,KAAKvC,SAAU,CAAC+iC,GAAIA,MAMjC,IAFA,IAAIE,MAAQ,GAEH17C,EAAI,EAAGA,EAAIsjC,KAAMtjC,IAExB07C,MAAM17C,GAAK,GAQb,IAJA,IAAIhB,EAAI,GAEJwG,EAAI,GAECc,EAAI,EAAGA,EAAIk9B,QAASl9B,IAAK,CAIhC,IAFA,IAAIq1C,KAAOr1C,EAAI,EAENmhC,GAAK4T,KAAK/0C,GAAIohC,GAAK2T,KAAK/0C,EAAI,GAAIlB,EAAIqiC,GAAIriC,EAAIsiC,GAAItiC,IAAK,CAE5D,IAAI1E,EAAI06C,OAAOh2C,GAEfpG,EAAE0B,GAAKq6C,QAAUU,GAAGN,QAAQ/1C,GAAI41C,MAAMt6C,GAAG4F,IAAMm1C,GAAGT,MAAMt6C,GAAG4F,GAAI60C,QAAQ/1C,IACvEI,EAAE9E,GAAKi7C,IACT,CAGA,IAAK,IAAI75C,EAAI,EAAGA,EAAIwhC,KAAMxhC,IAEpB0D,EAAE1D,KAAO65C,KAEXD,MAAM55C,GAAGwE,GAAKtH,EAAE8C,GAGhB45C,MAAM55C,GAAGwE,GAAKy0C,QAAUU,GAAGnV,KAAM0U,MAAMl5C,GAAGwE,IAAMm1C,GAAGT,MAAMl5C,GAAGwE,GAAIggC,KAGtE,CAGA,OAAOuU,YAAY7X,kBAAkB,CACnC/pB,KAAMyiC,MACNvmB,KAAM,CAACmO,KAAME,SACblC,SAAUka,IAEd,CAAC,ICjHQI,kBAAmC,gBAFnC,cACQ,CAAC,QAAS,gBAC6CpmC,OACxE,IAAI,MACG,aAEHA,KAgBJ,OAAO,SAAqBjW,EAAGC,EAAGiZ,UAEhC,IAAIwiC,MAAQ17C,EAAEuiC,MACVoZ,IAAM37C,EAAEwiC,UAERuZ,MAAQ97C,EAAEsiC,MACVyZ,IAAM/7C,EAAEuiC,UAEZ,GAAIkZ,MAAM56C,SAAWi7C,MAAMj7C,OACzB,MAAM,IAAIu3B,eAAeqjB,MAAM56C,OAAQi7C,MAAMj7C,QAI/C,GAAI46C,MAAM,KAAOK,MAAM,IAAML,MAAM,KAAOK,MAAM,GAC9C,MAAM,IAAIze,WAAW,iCAAmCoe,MAAQ,0BAA4BK,MAAQ,KAItG,IAGIE,GAgBA96C,EAAG4F,EAnBHg9B,KAAO2X,MAAM,GACbzX,QAAUyX,MAAM,GAIhB3U,KAAO,EAEPmV,GAAKhjC,SAEU,iBAARyiC,KAAoBA,MAAQK,MAErCC,GAAKN,IAEL5U,KAAOpsB,MAAMoB,QAAQ,EAAGkgC,IAExBC,GAAKvhC,MAAMc,KAAKvC,SAAU,CAAC+iC,GAAIA,MAMjC,IAAIE,MAAQ,GAEZ,IAAKh7C,EAAI,EAAGA,EAAI4iC,KAAM5iC,IACpBg7C,MAAMh7C,GAAK,GAIb,IAAIm7C,GAAK,GACLC,GAAK,GAELC,GAAK,GACLC,GAAK,GAET,IAAK11C,EAAI,EAAGA,EAAIk9B,QAASl9B,IAAK,CAE5B,IAAIq1C,KAAOr1C,EAAI,EAQf,IANA21C,SAAS18C,EAAG+G,EAAGy1C,GAAIF,GAAIF,MAGvBM,SAASz8C,EAAG8G,EAAG01C,GAAIF,GAAIH,MAGlBj7C,EAAI,EAAGA,EAAI4iC,KAAM5iC,IAAK,CAEzB,IAAIw7C,GAAKH,GAAGr7C,KAAOi7C,KAAOE,GAAGn7C,GAAK4lC,KAC9B6V,GAAKH,GAAGt7C,KAAOi7C,KAAOG,GAAGp7C,GAAK4lC,KAElCoV,MAAMh7C,GAAG4F,GAAKm1C,GAAGS,GAAIC,GACvB,CACF,CAGA,OAAO,IAAIva,YAAY,CACrB3oB,KAAMyiC,MACNvmB,KAAM,CAACmO,KAAME,SACblC,SAAUka,IAEd,EAEA,SAASS,SAASrzC,EAAGtC,EAAGd,EAAGxG,EAAG28C,MAM5B,IAJA,IAAIznB,OAAStrB,EAAEm9B,QACX1vB,MAAQzN,EAAEo9B,OACVI,IAAMx9B,EAAEq9B,KAEH7gC,EAAIghC,IAAI9/B,GAAIohC,GAAKtB,IAAI9/B,EAAI,GAAIlB,EAAIsiC,GAAItiC,IAAK,CAEjD,IAAI1E,EAAI2V,MAAMjR,GAEdI,EAAE9E,GAAKi7C,KACP38C,EAAE0B,GAAKwzB,OAAO9uB,EAChB,CACF,KCjHSg3C,kBAAmC,gBAFnC,cACQ,CAAC,QAAS,gBAC6C5mC,OACxE,IAAI,MACG,aAEHA,KAqBJ,OAAO,SAAqBzO,EAAGvH,EAAGiZ,SAAUsiC,SAE1C,IAAIsB,QAAUt1C,EAAEg/B,QACZuW,OAASv1C,EAAEi/B,OACXuW,KAAOx1C,EAAEk/B,KACTgV,MAAQl0C,EAAE+6B,MACVoZ,IAAMn0C,EAAEg7B,UAEZ,IAAKsa,QACH,MAAM,IAAIx2C,MAAM,sEAIlB,IAGI21C,GAHAlY,KAAO2X,MAAM,GACbzX,QAAUyX,MAAM,GAIhBQ,GAAKhjC,SAEU,iBAARyiC,MAETM,GAAKN,IAEL17C,EAAI0a,MAAMoB,QAAQ9b,EAAGg8C,IAErBC,GAAKvhC,MAAMc,KAAKvC,SAAU,CAAC+iC,GAAIA,MAUjC,IANA,IAAIE,MAAQ,GAER18C,EAAI,GAEJwG,EAAI,GAECc,EAAI,EAAGA,EAAIk9B,QAASl9B,IAAK,CAIhC,IAFA,IAAIq1C,KAAOr1C,EAAI,EAENmhC,GAAK8U,KAAKj2C,GAAIohC,GAAK6U,KAAKj2C,EAAI,GAAIlB,EAAIqiC,GAAIriC,EAAIsiC,GAAItiC,IAAK,CAE5D,IAAI7D,EAAI+6C,OAAOl3C,GAEfpG,EAAEuC,GAAK86C,QAAQj3C,GACfI,EAAEjE,GAAKo6C,IACT,CAGA,IAAK,IAAIj7C,EAAI,EAAGA,EAAI4iC,KAAM5iC,IAEd,IAAN4F,IAEFo1C,MAAMh7C,GAAK,IAIT8E,EAAE9E,KAAOi7C,KAEXD,MAAMh7C,GAAG4F,GAAKy0C,QAAUU,GAAGj8C,EAAGR,EAAE0B,IAAM+6C,GAAGz8C,EAAE0B,GAAIlB,GAG/Ck8C,MAAMh7C,GAAG4F,GAAKy0C,QAAUU,GAAGj8C,EAAG,GAAKi8C,GAAG,EAAGj8C,EAG/C,CAGA,OAAO,IAAIoiC,YAAY,CACrB3oB,KAAMyiC,MACNvmB,KAAM,CAACmO,KAAME,SACblC,SAAUka,IAEd,CAAC,ICjGQgB,kBAAmC,gBAFnC,cACQ,CAAC,UACsDhnC,OACxE,IAAI,OAEAA,KAgBJ,OAAO,SAAqBjW,EAAGC,EAAGiZ,UAEhC,IA0BI+iC,GA1BAR,MAAQz7C,EAAEsiC,MACVoZ,MAAQ17C,EAAEuiC,MACVoZ,IAAM37C,EAAEwiC,UAER0a,MAAQj9C,EAAEqiC,MACVyZ,MAAQ97C,EAAEsiC,MACVyZ,IAAM/7C,EAAEuiC,UAER2a,MAAQ,GAEZ,GAAIzB,MAAM56C,SAAWi7C,MAAMj7C,OACzB,MAAM,IAAIu3B,eAAeqjB,MAAM56C,OAAQi7C,MAAMj7C,QAI/C,IAAK,IAAI0G,EAAI,EAAGA,EAAIk0C,MAAM56C,OAAQ0G,IAAK,CAErC,GAAIk0C,MAAMl0C,KAAOu0C,MAAMv0C,GACrB,MAAM,IAAI81B,WAAW,iCAAmCoe,MAAQ,0BAA4BK,MAAQ,KAItGoB,MAAM31C,GAAKk0C,MAAMl0C,EACnB,CAKA,IAAI00C,GAAKhjC,SAEU,iBAARyiC,KAAoBA,MAAQK,MAErCC,GAAKN,IAELO,GAAKvhC,MAAMc,KAAKvC,SAAU,CAAC+iC,GAAIA,MAIjC,IAAIE,MAAQgB,MAAMr8C,OAAS,EAAIs8C,SAASlB,GAAI,EAAGiB,MAAOA,MAAM,GAAI1B,MAAOyB,OAAS,GAEhF,OAAOl9C,EAAEyjC,kBAAkB,CACzB/pB,KAAMyiC,MACNvmB,KAAMunB,MACNpb,SAAUka,IAEd,EAEA,SAASmB,SAASrX,EAAGsX,MAAO71C,EAAG8B,EAAGg0C,GAAIC,IAEpC,IAAIC,GAAK,GAET,GAAIH,QAAU71C,EAAE1G,OAAS,EAEvB,IAAK,IAAIK,EAAI,EAAGA,EAAImI,EAAGnI,IAErBq8C,GAAGr8C,GAAK4kC,EAAEuX,GAAGn8C,GAAIo8C,GAAGp8C,SAItB,IAAK,IAAI4F,EAAI,EAAGA,EAAIuC,EAAGvC,IAErBy2C,GAAGz2C,GAAKq2C,SAASrX,EAAGsX,MAAQ,EAAG71C,EAAGA,EAAE61C,MAAQ,GAAIC,GAAGv2C,GAAIw2C,GAAGx2C,IAI9D,OAAOy2C,EACT,KCvFSC,kBAAmC,gBAFnC,cACQ,CAAC,UACsDxnC,OACxE,IAAI,OAEAA,KAiBJ,OAAO,SAAqBjW,EAAGC,EAAGiZ,SAAUsiC,SAE1C,IAIIS,GAJAR,MAAQz7C,EAAEsiC,MACVoZ,MAAQ17C,EAAEuiC,MACVoZ,IAAM37C,EAAEwiC,UAIR0Z,GAAKhjC,SAEU,iBAARyiC,MAETM,GAAKN,IAEL17C,EAAI0a,MAAMoB,QAAQ9b,EAAGg8C,IAErBC,GAAKvhC,MAAMc,KAAKvC,SAAU,CAAC+iC,GAAIA,MAIjC,IAAIE,MAAQT,MAAM56C,OAAS,EAAIs8C,SAASlB,GAAI,EAAGR,MAAOA,MAAM,GAAID,MAAOx7C,EAAGu7C,SAAW,GAErF,OAAOx7C,EAAEyjC,kBAAkB,CACzB/pB,KAAMyiC,MACNvmB,KAAMphB,MAAMknC,OACZ3Z,SAAUka,IAEd,EAEA,SAASmB,SAASrX,EAAGsX,MAAO71C,EAAG8B,EAAGg0C,GAAIC,GAAI/B,SAExC,IAAIgC,GAAK,GAET,GAAIH,QAAU71C,EAAE1G,OAAS,EAEvB,IAAK,IAAIK,EAAI,EAAGA,EAAImI,EAAGnI,IAErBq8C,GAAGr8C,GAAKq6C,QAAUzV,EAAEwX,GAAID,GAAGn8C,IAAM4kC,EAAEuX,GAAGn8C,GAAIo8C,SAI5C,IAAK,IAAIx2C,EAAI,EAAGA,EAAIuC,EAAGvC,IAErBy2C,GAAGz2C,GAAKq2C,SAASrX,EAAGsX,MAAQ,EAAG71C,EAAGA,EAAE61C,MAAQ,GAAIC,GAAGv2C,GAAIw2C,GAAI/B,SAI/D,OAAOgC,EACT,KChESE,YAA6B,gBAF7B,QACQ,CAAC,QAAS,SAAU,cAAe,gBACcznC,OAClE,IAAI,MACG,OACC,YACK,aAETA,KACA0nC,YAActC,kBAAkB,CAClC1gC,QAEEijC,YAAcvB,kBAAkB,CAClC1hC,MACA0nB,cAEEwb,YAAchB,kBAAkB,CAClCliC,MACA0nB,cAEEyb,YAAcb,kBAAkB,CAClCtiC,QAEEojC,YAAcN,kBAAkB,CAClC9iC,QA+CF,OAAOA,MAvEE,QAuEU,CACjB,WAAY,SAAgBlb,EAAG8C,GAE7B,OAAU,OAAN9C,EACW,OAAN8C,EAGC,OAANA,EACW,OAAN9C,OAGCiB,IAANjB,OACWiB,IAAN6B,OAGC7B,IAAN6B,OACW7B,IAANjB,EAGFqnC,YAAYrnC,EAAG8C,EACxB,EACA,6BAA8B,SAAkC9C,EAAG8C,GACjE,OAAOq7C,YAAYn+C,EAAG8C,EAAGukC,YAC3B,EACA,4BAA6B,SAAiCrnC,EAAG8C,GAC/D,OAAOo7C,YAAYp7C,EAAG9C,EAAGqnC,aAAa,EACxC,EACA,4BAA6B,SAAiCrnC,EAAG8C,GAC/D,OAAOo7C,YAAYl+C,EAAG8C,EAAGukC,aAAa,EACxC,EACA,2BAA4B,SAAgCrnC,EAAG8C,GAC7D,OAAOu7C,YAAYr+C,EAAG8C,EAAGukC,YAC3B,EACA,eAAgB,SAAoBrnC,EAAG8C,GAErC,OAAOhD,KAAKo+B,OAAOl+B,GAAIk+B,OAAOp7B,IAAI2N,SACpC,EACA,gBAAiB,SAAqBzQ,EAAG8C,GAEvC,OAAOhD,KAAKo+B,OAAOl+B,GAAI8C,EACzB,EACA,gBAAiB,SAAqB9C,EAAG8C,GAEvC,OAAOhD,KAAKE,EAAGk+B,OAAOp7B,GACxB,EACA,oBAAqB,SAAyB9C,EAAG8C,GAC/C,OAAOs7C,YAAYp+C,EAAG8C,EAAGukC,aAAa,EACxC,EACA,mBAAoB,SAAwBrnC,EAAG8C,GAC7C,OAAOw7C,YAAYt+C,EAAG8C,EAAGukC,aAAa,EACxC,EACA,oBAAqB,SAAyBrnC,EAAG8C,GAC/C,OAAOs7C,YAAYt7C,EAAG9C,EAAGqnC,aAAa,EACxC,EACA,mBAAoB,SAAwBrnC,EAAG8C,GAC7C,OAAOw7C,YAAYx7C,EAAG9C,EAAGqnC,aAAa,EACxC,EACA,aAAc,SAAkBrnC,EAAG8C,GAEjC,OAAOw7C,YAAYpgB,OAAOl+B,GAAI8C,EAAGukC,aAAa,GAAO52B,SACvD,EACA,aAAc,SAAkBzQ,EAAG8C,GAEjC,OAAOw7C,YAAYpgB,OAAOp7B,GAAI9C,EAAGqnC,aAAa,GAAM52B,SACtD,GACA,ICrIO8tC,mBDuIoB,gBA1IpB,QA0IkC,CAAC,QAAS,gBAAgB3X,QACrE,IAAI,MACG,aAEHA,MACJ,OAAO1rB,MA/IE,QA+IU,CACjB,WAAY,SAAgBlb,EAAG8C,GAE7B,OAAU,OAAN9C,EACW,OAAN8C,EAGC,OAANA,EACW,OAAN9C,OAGCiB,IAANjB,OACWiB,IAAN6B,OAGC7B,IAAN6B,OACW7B,IAANjB,EAGFqnC,YAAYrnC,EAAG8C,EACxB,GACA,ICjK2B,CAC7BsiC,wBACAuB,wBACAgE,mBACAvE,kBACA6X,cCRSO,YAA6B,gBAF7B,QACQ,CAAC,QAAS,SAAU,SAAU,cACmBhoC,OAClE,IAAI,MACG,OACC,OACA,WAEJA,KAiCJ,OAAO0E,MAzCE,QAyCU,CACjB,GAAI,WACF,MAAyB,UAAlBnH,OAAOmqB,OAAqBugB,OAAO,IAAMA,OAAO,GAAI,UAC7D,EAGA,iCAAkC,SAA+BtoB,MAG/D,GAAoB,iBAFTA,KAAKA,KAAK90B,OAAS,GAEA,CAC5B,IAAIg1B,OAASF,KAAKtoB,MAClB,OAAO4wC,OAAOtoB,KAAME,OACtB,CAAO,MAAsB,UAAlBtiB,OAAOmqB,OACTugB,OAAOtoB,MAEPsoB,OAAOtoB,KAAM,UAExB,EACAxb,MAAO8jC,OACPrc,OAAQ,SAAgBjM,MACtB,IAAIE,OAASF,KAAKkM,UAClB,OAAOoc,OAAOtoB,KAAK1lB,UAAW4lB,OAChC,EACA,yBAA0B,SAA2BF,KAAME,QACzD,OAAOooB,OAAOtoB,KAAK1lB,UAAW4lB,OAChC,IAUF,SAASooB,OAAOtoB,KAAME,QACpB,IAAIqoB,cA4BN,SAAoBvoB,MAClB,IAAIuoB,eAAgB,EAOpB,OANAvoB,KAAK/e,SAAQ,SAAU2E,MAAO1E,MAAO7P,KAC/BuqB,YAAYhW,SACd2iC,eAAgB,EAChBl3C,IAAI6P,OAAS0E,MAAMhM,WAEvB,IACO2uC,aACT,CArCsB/C,CAAWxlB,MAE3BkD,aAAeqlB,cAAgB,IAAInZ,UAAU,GAAK,EAItD,GAkCF,SAAmBpP,MACjBA,KAAK/e,SAAQ,SAAU2E,OACrB,GAAqB,iBAAVA,QAAuBtP,UAAUsP,QAAUA,MAAQ,EAC5D,MAAM,IAAIlV,MAAM,yDAEpB,GACF,CA1CEiyB,CAAU3C,MAENE,OAAQ,CAEV,IAAIzsB,EAAIs0B,OAAO7H,QAEf,OAAIF,KAAK90B,OAAS,EACTuI,EAAEwvB,OAAOjD,KAAMkD,cAGjBzvB,CACT,CAEE,IAAIpC,IAAM,GAEV,OAAI2uB,KAAK90B,OAAS,EACT+3B,OAAO5xB,IAAK2uB,KAAMkD,cAGpB7xB,GAEX,CAqBA,ICvHSm3C,kBAAoB,CAC7BtZ,sBACAsF,mBACAvE,kBACAoY,aCZa,SAASI,gBAAgB5qC,IAAKiC,IAAK8F,OAYhD,OAXI9F,OAAOjC,IACT6B,OAAO2O,eAAexQ,IAAKiC,IAAK,CAC9B8F,MACAiK,YAAY,EACZgP,cAAc,EACd6pB,UAAU,IAGZ7qC,IAAIiC,KAAO8F,MAGN/H,GACT,CCZA,IAEW8qC,kBAAmC,gBAFnC,cACQ,CAAC,QAAS,gBAC6CtoC,OACxE,IAAI,MACG,aAEHA,KAqBJ,OAAO,SAAqBzO,EAAGvH,EAAGiZ,SAAUsiC,SAE1C,IAAIsB,QAAUt1C,EAAEg/B,QACZuW,OAASv1C,EAAEi/B,OACXuW,KAAOx1C,EAAEk/B,KACTgV,MAAQl0C,EAAE+6B,MACVoZ,IAAMn0C,EAAEg7B,UAEZ,IAAKsa,QACH,MAAM,IAAIx2C,MAAM,sEAIlB,IAGI21C,GAHAlY,KAAO2X,MAAM,GACbzX,QAAUyX,MAAM,GAIhB7xC,GAAKi9B,YAELC,KAAO,EAEPmV,GAAKhjC,SAEU,iBAARyiC,MAETM,GAAKN,IAEL9xC,GAAK8Q,MAAMc,KAAKqrB,YAAa,CAACmV,GAAIA,KAElClV,KAAOpsB,MAAMoB,QAAQ,EAAGkgC,IAExBh8C,EAAI0a,MAAMoB,QAAQ9b,EAAGg8C,IAErBC,GAAKvhC,MAAMc,KAAKvC,SAAU,CAAC+iC,GAAIA,MAQjC,IAJA,IAAIuC,QAAU,GACVC,OAAS,GACTC,KAAO,GAEF33C,EAAI,EAAGA,EAAIk9B,QAASl9B,IAAK,CAEhC23C,KAAK33C,GAAK03C,OAAO39C,OAEjB,IAAK,IAAIonC,GAAK8U,KAAKj2C,GAAIohC,GAAK6U,KAAKj2C,EAAI,GAAIlB,EAAIqiC,GAAIriC,EAAIsiC,GAAItiC,IAAK,CAE5D,IAAI1E,EAAI47C,OAAOl3C,GAEX6N,EAAI8nC,QAAUU,GAAGj8C,EAAG68C,QAAQj3C,IAAMq2C,GAAGY,QAAQj3C,GAAI5F,GAEhD4J,GAAG6J,EAAGqzB,QAET0X,OAAOpxC,KAAKlM,GACZq9C,QAAQnxC,KAAKqG,GAEjB,CACF,CAKA,OAFAgrC,KAAKza,SAAWwa,OAAO39C,OAEhB0G,EAAE6gC,mBAAmB,CAC1B1T,OAAQ6pB,QACR1nC,MAAO2nC,OACP5X,IAAK6X,KACL9oB,KAAM,CAACmO,KAAME,SACblC,SAAUka,IAEd,CAAC,IChGH,SAAS0C,QAAQ/qB,OAAQgrB,gBAAkB,IAAIloC,KAAOpB,OAAOoB,KAAKkd,QAAS,GAAIte,OAAOupC,sBAAuB,CAAE,IAAIC,QAAUxpC,OAAOupC,sBAAsBjrB,QAASgrB,iBAAmBE,QAAUA,QAAQniC,QAAO,SAAUoiC,KAAO,OAAOzpC,OAAO0pC,yBAAyBprB,OAAQmrB,KAAKt5B,UAAY,KAAK/O,KAAKrJ,KAAK6J,MAAMR,KAAMooC,QAAU,CAAE,OAAOpoC,IAAM,CAEpV,SAASuoC,cAAczpC,QAAU,IAAK,IAAIrU,EAAI,EAAGA,EAAI8S,UAAUnT,OAAQK,IAAK,CAAE,IAAIsU,OAAS,MAAQxB,UAAU9S,GAAK8S,UAAU9S,GAAK,CAAC,EAAGA,EAAI,EAAIw9C,QAAQrpC,OAAOG,SAAS,GAAIoB,SAAQ,SAAUnB,KAAO2oC,gBAAgB7oC,OAAQE,IAAKD,OAAOC,KAAO,IAAKJ,OAAO4pC,0BAA4B5pC,OAAO6pC,iBAAiB3pC,OAAQF,OAAO4pC,0BAA0BzpC,SAAWkpC,QAAQrpC,OAAOG,SAASoB,SAAQ,SAAUnB,KAAOJ,OAAO2O,eAAezO,OAAQE,IAAKJ,OAAO0pC,yBAAyBvpC,OAAQC,KAAO,GAAI,CAAE,OAAOF,MAAQ,CASzf,IAAI4pC,OAAS,0DAGFC,YAA6B,gBAF7B,QACQ,CAAC,QAAS,SAAU,cAAe,QAAS,YAAa,gBACRppC,OAClE,IAAI,MACG,OACC,YACK,MACN,UACI,aAEPA,KACAqpC,YAAcf,kBAAkB,CAClC5jC,MACAmsB,cAEE+W,YAAchB,kBAAkB,CAClCliC,MACA0nB,cAEE0b,YAAcN,kBAAkB,CAClC9iC,QAsCF,OAAOA,MA1DE,QA0DUskC,cAAcA,cAAc,CAAC,EAAGM,uBAAwB,CAAC,EAAG,CAC7E/+C,QAAS,SAAiBf,GACxB,OAAOA,EAAEgE,OACX,EACA,kBAAmB,SAAuBhE,EAAG6J,GAC3C,GAAIA,EAAI,EACN,MAAM,IAAI8R,UAAUgkC,QAGtB,OAAO3/C,EAAEgE,MAAM6F,EACjB,EACA,qBAAsB,SAA0B7J,EAAG6J,GACjD,IAAKA,EAAE4C,YACL,MAAM,IAAIkP,UAAUgkC,QAGtB,IAAII,GAAKl2C,EAAEkG,WAEX,OAAO/P,EAAEgE,MAAM+7C,GACjB,EACA,oBAAqB,SAAyB//C,EAAG6J,GAC/C,IAAKA,EAAE4C,YACL,MAAM,IAAIkP,UAAUgkC,QAGtB,OAAO,IAAIpa,UAAUvlC,GAAGiP,gBAAgBpF,EAAEkG,WAC5C,EACAw1B,UAAW,SAAmBvlC,GAC5B,OAAOA,EAAEiP,gBAAgB,EAC3B,EACA,uBAAwB,SAA4BjP,EAAG6J,GACrD,IAAKA,EAAE4C,YACL,MAAM,IAAIkP,UAAUgkC,QAGtB,OAAO3/C,EAAEiP,gBAAgBpF,EAAEkG,WAC7B,EACA6H,SAAU,SAAkB5X,GAC1B,OAAOA,EAAEgE,OACX,EACA,mBAAoB,SAAwBhE,EAAG6J,GAC7C,GAAIA,EAAI,EACN,MAAM,IAAI8R,UAAUgkC,QAGtB,OAAO3/C,EAAEgE,MAAM6F,EACjB,EACA,iBAAkB,SAAqB7J,GAErC,OAAO64C,QAAQ74C,EAAGF,MAAM,EAC1B,EACA,mCAAoC,SAAqCE,EAAG8C,GAC1E,OAAO+8C,YAAY7/C,EAAG8C,EAAGhD,MAAM,EACjC,EACA,kCAAmC,SAAoCE,EAAG8C,GACxE,OAAOw7C,YAAYt+C,EAAG8C,EAAGhD,MAAM,EACjC,EACA,6CAA8C,SAA4CE,EAAG8C,GAE3F,OAAIukC,YAAYrnC,EAAG,GAEVs3B,MAAMx0B,EAAEqzB,OAAQrzB,EAAEu/B,WAGpB+b,YAAYt7C,EAAG9C,EAAGF,MAAM,EACjC,EACA,4CAA6C,SAA2CE,EAAG8C,GAEzF,OAAIukC,YAAYrnC,EAAG,GAEVs3B,MAAMx0B,EAAEqzB,OAAQrzB,EAAEu/B,WAGpBic,YAAYx7C,EAAG9C,EAAGF,MAAM,EACjC,EACA,4BAA6B,SAA8BE,EAAG8C,GAE5D,OAAOw7C,YAAYpgB,OAAOl+B,GAAI8C,EAAGhD,MAAM,GAAO2Q,SAChD,EACA,sCAAuC,SAAqCzQ,EAAG8C,GAE7E,OAAOw7C,YAAYpgB,OAAOp7B,GAAI9C,EAAGF,MAAM,GAAM2Q,SAC/C,IACC,IAEDqvC,sBAAwB,CAC1B3hB,OAAQmb,YACR,iBAAkB,SAAsBt5C,EAAG6J,GACzC,IAAK4C,UAAU5C,GACb,MAAM,IAAI8R,UAAUgkC,QAGtB,GAAI91C,EAAI,GAAKA,EAAI,GACf,MAAM,IAAIhD,MAAM,qEAGlB,OAAOyyC,YAAYt5C,EAAG6J,EACxB,GC9JSm2C,kBAAoB,CAC7B3a,sBACAD,wBACAuB,wBACAgE,mBACAvE,kBACAuY,kBACAiB,aCRSK,WAA4B,gBAF5B,OACQ,CAAC,QAAS,SAAU,QAAS,SAAU,gBACSzpC,OACjE,IAAI,MACG,OACC,MACD,OACC,aAEJA,KACAqpC,YAAcf,kBAAkB,CAClC5jC,MACAmsB,cAEEiX,YAAcN,kBAAkB,CAClC9iC,QAwCF,OAAOA,MAAM,OAAQ,CACnBijB,OAAQ,SAAgBn+B,GACtB,OAAI,mBAAYA,EAAGgE,MAAMhE,GAAI+T,OAAO8jB,SAC3B7zB,MAAMhE,GAENm5C,WAAWn5C,EAEtB,EACA,iBAAkB,SAAsBA,EAAG6J,GACzC,GAAI,mBAAY7J,EAAGgE,MAAMhE,EAAG6J,GAAIkK,OAAO8jB,SACrC,OAAO7zB,MAAMhE,EAAG6J,GAEhB,IAAKs0B,OAAQxH,UAAY,GAAGhZ,OAAO3d,EAAG,KAAKmc,MAAM,KAC7CrF,OAAS7W,KAAK6D,KAAK5C,OAAO,GAAGyc,OAAOwgB,OAAQ,KAAKxgB,OAAOzc,OAAOy1B,UAAY9sB,KAE/E,OADCs0B,OAAQxH,UAAY,GAAGhZ,OAAO7G,OAAQ,KAAKqF,MAAM,KAC3Cjb,OAAO,GAAGyc,OAAOwgB,OAAQ,KAAKxgB,OAAOzc,OAAOy1B,UAAY9sB,GAEnE,EACA9I,QAAS,SAAiBf,GACxB,OAAOA,EAAE8D,MACX,EACA,kBAAmB,SAAuB9D,EAAG6J,GAC3C,OAAO7J,EAAE8D,KAAK+F,EAChB,EACA07B,UAAW,SAAmBvlC,GAC5B,OAAI,wBAAeA,EAAGgE,MAAMhE,GAAI+T,OAAO8jB,SAC9B7zB,MAAMhE,GAENA,EAAE8D,MAEb,EACA,uBAAwB,SAA4B9D,EAAG6J,GACrD,OAAI,wBAAe7J,EAAGgE,MAAMhE,EAAG6J,GAAIkK,OAAO8jB,SACjC7zB,MAAMhE,EAAG6J,GAET7J,EAAEiP,gBAAgBpF,EAAEkG,WAAY,mBAE3C,EACA6H,SAAU,SAAkB5X,GAC1B,OAAOA,EAAE8D,MACX,EACA,mBAAoB,SAAwB9D,EAAG6J,GAC7C,OAAO7J,EAAE8D,KAAK+F,EAChB,EACA,iBAAkB,SAAqB7J,GAErC,OAAO64C,QAAQ74C,EAAGF,MAAM,EAC1B,EACA,yBAA0B,SAA2BE,EAAG6J,GAEtD,OAAOgvC,QAAQ74C,GAAG0B,GAAK5B,KAAK4B,EAAGmI,KAAI,EACrC,EACA,mCAAoC,SAAqC7J,EAAG8C,GAC1E,OAAO+8C,YAAY7/C,EAAG8C,EAAGhD,MAAM,EACjC,EACA,kCAAmC,SAAoCE,EAAG8C,GACxE,OAAOw7C,YAAYt+C,EAAG8C,EAAGhD,MAAM,EACjC,EACA,sCAAuC,SAAqCE,EAAG8C,GAE7E,OAAOw7C,YAAYpgB,OAAOp7B,GAAI9C,EAAGF,MAAM,GAAM2Q,SAC/C,GACA,ICpHOyvC,iBAAmB,CAC5BvZ,wBACAgE,mBACAqV,kBACA5Z,kBACA6Z,YCLSE,YAA6B,gBAF7B,QACQ,CAAC,QAAS,SAAU,QAAS,SAAU,gBACU3pC,OAClE,IAAI,MACG,OACC,MACD,OACC,aAEJA,KACAqpC,YAAcf,kBAAkB,CAClC5jC,MACAmsB,cAEEiX,YAAcN,kBAAkB,CAClC9iC,QAuCF,OAAOA,MAAM,QAAS,CACpBijB,OAAQ,SAAgBn+B,GACtB,OAAI,mBAAYA,EAAGgE,MAAMhE,GAAI+T,OAAO8jB,SAC3B7zB,MAAMhE,GAENC,KAAK8D,MAAM/D,EAEtB,EACA,iBAAkB,SAAsBA,EAAG6J,GACzC,GAAI,mBAAY7J,EAAGgE,MAAMhE,EAAG6J,GAAIkK,OAAO8jB,SACrC,OAAO7zB,MAAMhE,EAAG6J,GAEhB,IAAKs0B,OAAQxH,UAAY,GAAGhZ,OAAO3d,EAAG,KAAKmc,MAAM,KAC7CrF,OAAS7W,KAAK8D,MAAM7C,OAAO,GAAGyc,OAAOwgB,OAAQ,KAAKxgB,OAAOzc,OAAOy1B,UAAY9sB,KAEhF,OADCs0B,OAAQxH,UAAY,GAAGhZ,OAAO7G,OAAQ,KAAKqF,MAAM,KAC3Cjb,OAAO,GAAGyc,OAAOwgB,OAAQ,KAAKxgB,OAAOzc,OAAOy1B,UAAY9sB,GAEnE,EACA9I,QAAS,SAAiBf,GACxB,OAAOA,EAAE+D,OACX,EACA,kBAAmB,SAAuB/D,EAAG6J,GAC3C,OAAO7J,EAAE+D,MAAM8F,EACjB,EACA07B,UAAW,SAAmBvlC,GAC5B,OAAI,wBAAeA,EAAGgE,MAAMhE,GAAI+T,OAAO8jB,SAC9B7zB,MAAMhE,GAENA,EAAE+D,OAEb,EACA,uBAAwB,SAA4B/D,EAAG6J,GACrD,OAAI,wBAAe7J,EAAGgE,MAAMhE,EAAG6J,GAAIkK,OAAO8jB,SACjC7zB,MAAMhE,EAAG6J,GAET7J,EAAEiP,gBAAgBpF,EAAEkG,WAAY,oBAE3C,EACA6H,SAAU,SAAkB5X,GAC1B,OAAOA,EAAE+D,OACX,EACA,mBAAoB,SAAwB/D,EAAG6J,GAC7C,OAAO7J,EAAE+D,MAAM8F,EACjB,EACA,iBAAkB,SAAqB7J,GAErC,OAAO64C,QAAQ74C,EAAGF,MAAM,EAC1B,EACA,yBAA0B,SAA2BE,EAAG6J,GAEtD,OAAOgvC,QAAQ74C,GAAG0B,GAAK5B,KAAK4B,EAAGmI,KAAI,EACrC,EACA,mCAAoC,SAAqC7J,EAAG8C,GAC1E,OAAO+8C,YAAY7/C,EAAG8C,EAAGhD,MAAM,EACjC,EACA,kCAAmC,SAAoCE,EAAG8C,GACxE,OAAOw7C,YAAYt+C,EAAG8C,EAAGhD,MAAM,EACjC,EACA,sCAAuC,SAAqCE,EAAG8C,GAE7E,OAAOw7C,YAAYpgB,OAAOp7B,GAAI9C,EAAGF,MAAM,GAAM2Q,SAC/C,GACA,ICjHO2vC,gBAAkB,CAC3B5a,oBACA0a,iBACAG,kBCJ6B,CAC7B1Z,wBACAgE,mBACAqV,kBACA5Z,kBACA+Z,aDAAxV,mBACAvE,kBACAka,UEXoC,gBAF3B,MACQ,CAAC,QAAS,UAAW,SAAU,OAAQ,UACQ9pC,OAChE,IAAI,MAEFzV,QAASw/C,SAAQ,OACX,KACF,OAEF/pC,KACA8nC,YAAcN,kBAAkB,CAClC9iC,QAsCF,OAAOA,MAAM,MAAO,CAClBijB,OAAQ,SAAgBn+B,GACtB,OAAOA,EAAI,EAAI+D,MAAM/D,GAAK8D,KAAK9D,EACjC,EACA,6BAA8B,SAA+BA,EAAG6J,GAC9D,OAAO7J,EAAI,EAAI+D,MAAM/D,EAAG6J,GAAK/F,KAAK9D,EAAG6J,EACvC,EACA9I,QAAS,SAAiBf,GACxB,OAAO,IAAIugD,SAASvgD,EAAEqC,GAAK,EAAIpC,KAAK8D,MAAM/D,EAAEqC,IAAMpC,KAAK6D,KAAK9D,EAAEqC,IAAKrC,EAAEsC,GAAK,EAAIrC,KAAK8D,MAAM/D,EAAEsC,IAAMrC,KAAK6D,KAAK9D,EAAEsC,IAC/G,EACA,8BAA+B,SAAgCtC,EAAG6J,GAChE,OAAO,IAAI02C,SAASvgD,EAAEqC,GAAK,EAAI0B,MAAM/D,EAAEqC,GAAIwH,GAAK/F,KAAK9D,EAAEqC,GAAIwH,GAAI7J,EAAEsC,GAAK,EAAIyB,MAAM/D,EAAEsC,GAAIuH,GAAK/F,KAAK9D,EAAEsC,GAAIuH,GACxG,EACA07B,UAAW,SAAmBvlC,GAC5B,OAAOA,EAAE2M,aAAe7I,KAAK9D,GAAK+D,MAAM/D,EAC1C,EACA,gCAAiC,SAAkCA,EAAG6J,GACpE,OAAO7J,EAAE2M,aAAe7I,KAAK9D,EAAG6J,GAAK9F,MAAM/D,EAAG6J,EAChD,EACA+N,SAAU,SAAkB5X,GAC1B,OAAOA,EAAE+H,EAAI,EAAI/H,EAAE8D,OAAS9D,EAAE+D,OAChC,EACA,+BAAgC,SAAiC/D,EAAG6J,GAClE,OAAO7J,EAAE+H,EAAI,EAAI/H,EAAE8D,KAAK+F,GAAK7J,EAAE+D,MAAM8F,EACvC,EACA,iBAAkB,SAAqB7J,GAErC,OAAO64C,QAAQ74C,EAAGF,MAAM,EAC1B,EACA,qCAAsC,SAAoCE,EAAG6J,GAE3E,OAAOgvC,QAAQ74C,GAAG0B,GAAK5B,KAAK4B,EAAGmI,KAAI,EACrC,EACA,sCAAuC,SAAqC7J,EAAG8C,GAE7E,OAAOw7C,YAAYpgB,OAAOp7B,GAAI9C,EAAGF,MAAM,GAAM2Q,SAC/C,GACA,KCnFO+vC,mBAAqB,CAC9Bpa,kBACAqa,aCJuC,gBAF9B,SACQ,CAAC,UACiDjqC,OACnE,IAAI,OAEAA,KAqHJ,OAAO0E,MA1HE,SA0HU,CACjBwlC,IAAK,cACL,kCAAmC,eACnC,KCzHOC,sBAAwB,CACjCva,kBACAwa,gBCJ0C,gBAFjC,YACQ,CAAC,UACoDpqC,OACtE,IAAI,OAEAA,KA+BJ,OAAO0E,MApCE,YAoCU,CACjB,0CAA2C,WACzC,OAAO,CACT,EACA,oDAAqD,WACnD,OAAO,CACT,EACA,iBAAkB,SAAqBlb,GACrC,OAAO64C,QAAQ74C,EAAGF,KACpB,GACA,KC1CO+gD,2BAA6B,CACtCza,kBACA0a,qBCJ+C,gBAFtC,iBACQ,CAAC,UACyDtqC,OAC3E,IAAI,OAEAA,KAcJ,OAAO0E,MAAM,iBAAkB,CAC7B,iBAAkB+9B,eAClB,mBAAoB,SAAwBj5C,EAAG8C,GAC7C,OAAO9C,EAAE6O,IAAI/L,EACf,EACA,uBAAwB,SAA4B9C,EAAG8C,GACrD,OAAO9C,EAAEsJ,MAAMxG,EACjB,EACA,qBAAsB,SAA0B9C,EAAG8C,GACjD,OAAO9C,EAAE6O,IAAI/L,EACf,EACA,gDAAiD,SAA4C9C,EAAG8C,GAC9F,IAAIO,IAAMP,EAAEiS,QAEZ,OADA1R,IAAI0Y,MAAsB,OAAd1Y,IAAI0Y,MAAiB1Y,IAAIs4C,WAAW37C,GAAKF,KAAKuD,IAAI0Y,MAAO/b,GAC9DqD,GACT,EACA,gDAAiD,SAA4CrD,EAAG8C,GAC9F,IAAIO,IAAMrD,EAAE+U,QAEZ,OADA1R,IAAI0Y,MAAsB,OAAd1Y,IAAI0Y,MAAiB1Y,IAAIs4C,WAAW74C,GAAKhD,KAAKuD,IAAI0Y,MAAOjZ,GAC9DO,GACT,EACA,aAAc,SAAkBrD,EAAG8C,GACjC,OAAO9C,EAAEw0C,SAAS1xC,EACpB,GACA,KCvCOi+C,eAAgC,gBAFhC,WACQ,CAAC,QAAS,SAAU,SAAU,YAAa,cAAe,iBACNvqC,OACrE,IAAI,MACG,OACC,OACA,UACG,YACE,cAETA,KAgCJ,OAAO0E,MA1CE,WA0CU,CACjB,GAAI,WACF,MAAyB,WAAlBnH,OAAOmqB,OAAsBA,OAAO,IAAM,EACnD,EACAwM,OAAQ,SAAgBrU,QACtB,OAAO6H,OAAO7H,OAChB,EACA,qBAAsB,SAAyBiO,MAC7C,OAAO0c,UAAU1c,KAAMA,KAAwB,WAAlBvwB,OAAOmqB,OAAsB,aAAUj9B,EACtE,EACA,6BAA8B,SAA+BqjC,KAAMjO,QACjE,OAAO2qB,UAAU1c,KAAMA,KAAMjO,OAC/B,EACA,yCAA0C,SAAwCiO,KAAM2c,MACtF,OAAOD,UAAU1c,KAAM2c,KAAwB,WAAlBltC,OAAOmqB,OAAsB,aAAUj9B,EACtE,EACA,iDAAkD,SAA8CqjC,KAAM2c,KAAM5qB,QAC1G,OAAO2qB,UAAU1c,KAAM2c,KAAM5qB,OAC/B,EACA1b,MAAO,SAAewb,MACpB,OAAO+qB,gBAAgB/qB,KACzB,EACA,gBAAiB,SAAqBA,KAAME,QAC1C,OAAO6qB,gBAAgB/qB,KAAME,OAC/B,EACA+L,OAAQ,SAAgBjM,MACtB,OAAO+qB,gBAAgB/qB,KAAK1lB,UAAW0lB,KAAKkM,UAC9C,EACA,iBAAkB,SAAsBlM,KAAME,QAC5C,OAAO6qB,gBAAgB/qB,KAAK1lB,UAAW4lB,OACzC,IAGF,SAAS6qB,gBAAgB/qB,KAAME,QAC7B,OAAQF,KAAK90B,QACX,KAAK,EACH,OAAOg1B,OAAS6H,OAAO7H,QAAU,GAEnC,KAAK,EACH,OAAO2qB,UAAU7qB,KAAK,GAAIA,KAAK,GAAIE,QAErC,KAAK,EACH,OAAO2qB,UAAU7qB,KAAK,GAAIA,KAAK,GAAIE,QAErC,QACE,MAAM,IAAIxvB,MAAM,yCAEtB,CAWA,SAASm6C,UAAU1c,KAAM2c,KAAM5qB,QAE7B,IAAI8qB,IAAMpvB,YAAYuS,OAASvS,YAAYkvB,MAAQ1b,UAAY,KAI/D,GAHIxT,YAAYuS,QAAOA,KAAOA,KAAKv0B,YAC/BgiB,YAAYkvB,QAAOA,KAAOA,KAAKlxC,aAE9BtD,UAAU63B,OAASA,KAAO,EAC7B,MAAM,IAAIz9B,MAAM,6DAGlB,IAAK4F,UAAUw0C,OAASA,KAAO,EAC7B,MAAM,IAAIp6C,MAAM,6DAGlB,IAAImE,IAAMm2C,IAAM,IAAI5b,UAAU,GAAK,EAC/BlM,aAAe8nB,IAAM,IAAIA,IAAI,GAAK,EAClChrB,KAAO,CAACmO,KAAM2c,MAElB,GAAI5qB,OAAQ,CAEV,GAAe,WAAXA,OACF,OAAOyQ,aAAalC,SAASzO,KAAMnrB,IAAK,EAAGquB,cAG7C,GAAe,UAAXhD,OACF,OAAOuM,YAAYgC,SAASzO,KAAMnrB,IAAK,EAAGquB,cAG5C,MAAM,IAAI1d,UAAU,wBAAyBgC,OAAO0Y,OAAQ,KAC9D,CAOA,IAJA,IAAIhzB,IAAM+1B,OAAO,GAAIjD,KAAMkD,cAEvB+nB,QAAU9c,KAAO2c,KAAO3c,KAAO2c,KAE1Bh/C,EAAI,EAAGA,EAAIm/C,QAASn/C,IAC3BoB,IAAIpB,GAAGA,GAAK+I,IAGd,OAAO3H,GACT,KCvISg+C,qBAAuB,CAChChc,sBACAD,wBACAmF,yBACAI,mBACAvE,kBACA2a,gBCVSO,iBAAmB,CAC5Blb,kBACAmb,WCJqC,gBAF5B,OACQ,CAAC,UAC+C/qC,OACjE,IAAI,OAEAA,KA2BJ,OAAO0E,MAhCE,OAgCU,CACjBijB,OAAQ,SAAgBn+B,GACtB,OAAOA,CACT,EACAulC,UAAW,SAAmBvlC,GAC5B,OAAOA,CACT,EACAe,QAAS,SAAiBf,GACxB,OAAOA,EAAEwhD,WACX,EACA,iBAAkB,SAAqBxhD,GACrC,OAAO64C,QAAQ74C,EAAGF,KACpB,GACA,KCxCO2hD,iBAAmB,CAC5B9W,mBACAvE,kBACAsb,WCLqC,gBAF5B,OACQ,CAAC,QAAS,SAAU,YAC4BlrC,OACjE,IAAI,MACG,OACC,QAEJA,KAyBJ,OAAO0E,MAhCE,OAgCU,CACjBknB,OAAQ,SAAgBpiC,GACtB,OAAOA,EAAEya,OAAOza,EAAEm2B,OACpB,EACAxb,MAAO,gBACP+vB,OAAQ,SAAgB1qC,GACtB,MAAyB,UAAlB+T,OAAOmqB,OAAqB,CAACl+B,EAAEqB,QAAU68B,OAAO,CAACl+B,EAAEqB,QAC5D,EACA,uDAAwD,SAA+CrB,GAErG,MAAyB,UAAlB+T,OAAOmqB,OAAqB,GAAKA,OAASA,OAAO,InCvCvD,WACL,MAAM,IAAIr3B,MAAM,uCAClB,CmCqCoE86C,EAChE,GACA,KCrCOC,gBAAkB,CAC3BlI,sBACA4H,iBACAT,2BACAY,iBACArb,kBACAyb,UCZoC,gBAF3B,MACQ,CAAC,QAAS,YAAa,iBAAkB,OAAQ,SACFrrC,OAChE,IAAI,MACG,UACI,eACK,KACV,MAEFA,KAyBJ,OAAO0E,MAlCE,MAkCU,CACjB,2CAgCF,SAAmB3a,EAAGC,GACpB,IAAIiY,EAAIqpC,aAAavhD,EAAGC,GAEpBw7C,MAAQ,YAASz7C,GAAKA,EAAEsiC,MAAQtiC,EAChC27C,IAAM,YAAS37C,GAAKA,EAAEwiC,eAAY9hC,EAClCw8C,MAAQ,YAASj9C,GAAKA,EAAEqiC,MAAQriC,EAChC+7C,IAAM,YAAS/7C,GAAKA,EAAEuiC,eAAY9hC,EAElC8gD,UAAgC,IAApBjf,MAAMviC,GAAGc,OACrB2gD,UAAgC,IAApBlf,MAAMtiC,GAAGa,OACrB+M,IAAM6zC,UACNpzC,IAAMqzC,eAEV,GAAIhG,KAAOK,KAAOL,MAAQK,KAAsB,iBAARL,IAAkB,CACxD,IAAIM,GAAKN,IAET9tC,IAAM8M,MAAMc,KAAKimC,UAAW,CAACzF,GAAIA,KACjC3tC,IAAMqM,MAAMc,KAAKkmC,eAAgB,CAAC1F,GAAIA,IACxC,CAGA,IAAKuF,YAAcC,UAAW,CAG5B,IAFA,IAAIrgD,EAAIkN,IAAIunC,KAAK4F,MAAM,IAAKyB,MAAM,IAEzB/7C,EAAI,EAAGA,EAAI+W,EAAG/W,IACrBC,EAAIyM,IAAIzM,EAAGkN,IAAIunC,KAAK4F,MAAMt6C,IAAK+7C,MAAM/7C,KAGvC,OAAOC,CACT,CAGA,IAAKogD,WAAaC,UAAW,CAG3B,IAFA,IAAIG,GAAKtzC,IAAIunC,KAAK4F,MAAM,IAAKyB,MAAM,GAAG,IAE7BxU,GAAK,EAAGA,GAAKxwB,EAAGwwB,KACvBkZ,GAAK/zC,IAAI+zC,GAAItzC,IAAIunC,KAAK4F,MAAM/S,KAAMwU,MAAMxU,IAAI,KAG9C,OAAOkZ,EACT,CAGA,GAAIJ,YAAcC,UAAW,CAG3B,IAFA,IAAII,IAAMvzC,IAAIunC,KAAK4F,MAAM,GAAG,IAAKyB,MAAM,IAE9BrU,IAAM,EAAGA,IAAM3wB,EAAG2wB,MACzBgZ,IAAMh0C,IAAIg0C,IAAKvzC,IAAIunC,KAAK4F,MAAM5S,KAAK,IAAKqU,MAAMrU,OAGhD,OAAOgZ,GACT,CAGA,GAAIL,WAAaC,UAAW,CAG1B,IAFA,IAAIK,IAAMxzC,IAAIunC,KAAK4F,MAAM,GAAG,IAAKyB,MAAM,GAAG,IAEjCnU,IAAM,EAAGA,IAAM7wB,EAAG6wB,MACzB+Y,IAAMj0C,IAAIi0C,IAAKxzC,IAAIunC,KAAK4F,MAAM1S,KAAK,IAAKmU,MAAMnU,KAAK,KAGrD,OAAO+Y,GACT,CACF,EA9FE,6BAgGF,SAAoBriD,EAAG8C,GACrBg/C,aAAa9hD,EAAG8C,GAEhB,IAAIw/C,OAAStiD,EAAEgnC,OACXub,QAAUviD,EAAE+mC,QACZyb,OAAS1/C,EAAEkkC,OACXyb,QAAU3/C,EAAEikC,QAEZplC,EAAI,EACJyM,IAAM6zC,UACNpzC,IAAMqzC,eACNxgD,EAAI,EACJ4F,EAAI,EAER,KAAO5F,EAAI4gD,OAAOjhD,QAAUiG,EAAIk7C,OAAOnhD,QAAQ,CAC7C,IAAIqhD,EAAIJ,OAAO5gD,GACXihD,EAAIH,OAAOl7C,GAEXo7C,EAAIC,EACNjhD,IAIEghD,EAAIC,EACNr7C,IAIEo7C,IAAMC,IACRhhD,EAAIyM,IAAIzM,EAAGkN,IAAI0zC,QAAQ7gD,GAAI+gD,QAAQn7C,KACnC5F,IACA4F,IAEJ,CAEA,OAAO3F,CACT,IAjIA,SAASmgD,aAAa9hD,EAAG8C,GACvB,IAII8/C,KAAMC,KAJNC,MAAQhgB,MAAM9iC,GAEd+iD,MAAQjgB,MAAMhgC,GAIlB,GAAqB,IAAjBggD,MAAMzhD,OACRuhD,KAAOE,MAAM,OACR,IAAqB,IAAjBA,MAAMzhD,QAA6B,IAAbyhD,MAAM,GAGrC,MAAM,IAAIjlB,WAAW,2DAA6DilB,MAAMzmC,KAAK,MAAQ,KAFrGumC,KAAOE,MAAM,EAGf,CAEA,GAAqB,IAAjBC,MAAM1hD,OACRwhD,KAAOE,MAAM,OACR,IAAqB,IAAjBA,MAAM1hD,QAA6B,IAAb0hD,MAAM,GAGrC,MAAM,IAAIllB,WAAW,2DAA6DklB,MAAM1mC,KAAK,MAAQ,KAFrGwmC,KAAOE,MAAM,EAGf,CAEA,GAAIH,OAASC,KAAM,MAAM,IAAIhlB,WAAW,mCAAqC+kB,KAAO,OAASC,KAAO,KACpG,GAAa,IAATD,KAAY,MAAM,IAAI/kB,WAAW,qDACrC,OAAO+kB,IACT,CA0GA,SAAS9f,MAAM9iC,GACb,OAAO,YAASA,GAAKA,EAAEm2B,OAASA,KAAKn2B,EACvC,MCvKSgjD,eAAgC,gBAFhC,WACQ,CAAC,QAAS,SAAU,YAAa,iBAAkB,cAAe,QACdxsC,OACrE,IAAI,MACG,OACC,UACG,eACK,YACH,KAETA,KACAqpC,YAAcf,kBAAkB,CAClC5jC,MACAmsB,cAEEiX,YAAcN,kBAAkB,CAClC9iC,QAGF,SAAS+nC,0BAA0BC,MAAOC,OAExC,OAAQD,MAAM7hD,QACZ,KAAK,EAEH,OAAQ8hD,MAAM9hD,QACZ,KAAK,EAEH,GAAI6hD,MAAM,KAAOC,MAAM,GAErB,MAAM,IAAItlB,WAAW,2EAGvB,MAEF,KAAK,EAEH,GAAIqlB,MAAM,KAAOC,MAAM,GAErB,MAAM,IAAItlB,WAAW,wDAA0DqlB,MAAM,GAAK,6BAA+BC,MAAM,GAAK,KAGtI,MAEF,QACE,MAAM,IAAIt8C,MAAM,+DAAiEs8C,MAAM9hD,OAAS,gBAGpG,MAEF,KAAK,EAEH,OAAQ8hD,MAAM9hD,QACZ,KAAK,EAEH,GAAI6hD,MAAM,KAAOC,MAAM,GAErB,MAAM,IAAItlB,WAAW,yDAA2DqlB,MAAM,GAAK,+BAAiCC,MAAM,GAAK,KAGzI,MAEF,KAAK,EAEH,GAAID,MAAM,KAAOC,MAAM,GAErB,MAAM,IAAItlB,WAAW,2DAA6DqlB,MAAM,GAAK,+BAAiCC,MAAM,GAAK,KAG3I,MAEF,QACE,MAAM,IAAIt8C,MAAM,+DAAiEs8C,MAAM9hD,OAAS,gBAGpG,MAEF,QACE,MAAM,IAAIwF,MAAM,+DAAiEq8C,MAAM7hD,OAAS,gBAEtG,CA6BA,SAAS+hD,sBAAsB7iD,EAAGC,GAEhC,GAAoB,UAAhBA,EAAE6hC,UACJ,MAAM,IAAIx7B,MAAM,4CAGlB,OAYF,SAAoCtG,EAAGC,GAErC,IAWIg8C,GAXAR,MAAQz7C,EAAEsiC,MACVoZ,MAAQ17C,EAAEuiC,MACVoZ,IAAM37C,EAAEwiC,UAER0a,MAAQj9C,EAAEqiC,MACVyZ,MAAQ97C,EAAEsiC,MACVyZ,IAAM/7C,EAAEuiC,UAERsgB,QAAUpH,MAAM,GAChBqH,SAAWhH,MAAM,GAIjBiH,GAAKtB,UAELuB,GAAKtB,eAELhG,KAAOK,KAAOL,MAAQK,KAAsB,iBAARL,MAEtCM,GAAKN,IAELqH,GAAKroC,MAAMc,KAAKimC,UAAW,CAACzF,GAAIA,KAChCgH,GAAKtoC,MAAMc,KAAKkmC,eAAgB,CAAC1F,GAAIA,MAMvC,IAFA,IAAI76C,EAAI,GAEC2F,EAAI,EAAGA,EAAIg8C,SAAUh8C,IAAK,CAIjC,IAFA,IAAIsL,IAAM4wC,GAAGxH,MAAM,GAAIyB,MAAM,GAAGn2C,IAEvB5F,EAAI,EAAGA,EAAI2hD,QAAS3hD,IAE3BkR,IAAM2wC,GAAG3wC,IAAK4wC,GAAGxH,MAAMt6C,GAAI+7C,MAAM/7C,GAAG4F,KAGtC3F,EAAE2F,GAAKsL,GACT,CAGA,OAAOrS,EAAEyjC,kBAAkB,CACzB/pB,KAAMtY,EACNw0B,KAAM,CAACmtB,UACPhhB,SAAUka,IAEd,CA5DSiH,CAA2BljD,EAAGC,EACvC,CAsEA,IAAIkjD,sBAAwBxoC,MAAM,wBAAyB,CACzD,mBA6BF,SAAoC3a,EAAGC,GAErC,IAUIg8C,GAVAR,MAAQz7C,EAAEsiC,MACVoZ,MAAQ17C,EAAEuiC,MACVoZ,IAAM37C,EAAEwiC,UAER0a,MAAQj9C,EAAEqiC,MACV0Z,IAAM/7C,EAAEuiC,UAER4gB,MAAQ1H,MAAM,GACd2H,SAAW3H,MAAM,GAIjBsH,GAAKtB,UAELuB,GAAKtB,eAELhG,KAAOK,KAAOL,MAAQK,KAAsB,iBAARL,MAEtCM,GAAKN,IAELqH,GAAKroC,MAAMc,KAAKimC,UAAW,CAACzF,GAAIA,KAChCgH,GAAKtoC,MAAMc,KAAKkmC,eAAgB,CAAC1F,GAAIA,MAMvC,IAFA,IAAI76C,EAAI,GAECD,EAAI,EAAGA,EAAIiiD,MAAOjiD,IAAK,CAM9B,IAJA,IAAI6iC,IAAMyX,MAAMt6C,GAEZkR,IAAM4wC,GAAGjf,IAAI,GAAIkZ,MAAM,IAElBn2C,EAAI,EAAGA,EAAIs8C,SAAUt8C,IAE5BsL,IAAM2wC,GAAG3wC,IAAK4wC,GAAGjf,IAAIj9B,GAAIm2C,MAAMn2C,KAGjC3F,EAAED,GAAKkR,GACT,CAGA,OAAOrS,EAAEyjC,kBAAkB,CACzB/pB,KAAMtY,EACNw0B,KAAM,CAACwtB,OACPrhB,SAAUka,IAEd,EA7EE,oBA0QF,SAAqCj8C,EAAGC,GAEtC,IAAI68C,QAAU98C,EAAEwmC,QACZuW,OAAS/8C,EAAEymC,OACXuW,KAAOh9C,EAAE0mC,KACTiV,IAAM37C,EAAEwiC,UAEZ,IAAKsa,QACH,MAAM,IAAIx2C,MAAM,0DAIlB,IAUI21C,GAVAiB,MAAQj9C,EAAEqiC,MACV0Z,IAAM/7C,EAAEuiC,UAER4gB,MAAQpjD,EAAEuiC,MAAM,GAChB+gB,MAAQrjD,EAAEsiC,MAAM,GAEhBic,QAAU,GACVC,OAAS,GACTC,KAAO,GAIPsE,GAAKtB,UAELuB,GAAKtB,eAEL93C,GAAKi9B,YAELC,KAAO,EAEP4U,KAAOK,KAAOL,MAAQK,KAAsB,iBAARL,MAEtCM,GAAKN,IAELqH,GAAKroC,MAAMc,KAAKimC,UAAW,CAACzF,GAAIA,KAChCgH,GAAKtoC,MAAMc,KAAKkmC,eAAgB,CAAC1F,GAAIA,KACrCpyC,GAAK8Q,MAAMc,KAAKqrB,YAAa,CAACmV,GAAIA,KAElClV,KAAOpsB,MAAMoB,QAAQ,EAAGkgC,KAI1B,IAAIx8C,EAAI,GAEJwG,EAAI,GAERy4C,KAAK,GAAK,EAEV,IAAK,IAAI6E,GAAK,EAAGA,GAAKD,MAAOC,KAAM,CAEjC,IAAIC,IAAMtG,MAAMqG,IAEhB,IAAK15C,GAAG25C,IAAKzc,MAEX,IAAK,IAAI0c,IAAMzG,KAAKuG,IAAKG,IAAM1G,KAAKuG,GAAK,GAAII,GAAKF,IAAKE,GAAKD,IAAKC,KAAM,CAErE,IAAIC,GAAK7G,OAAO4G,IAEX19C,EAAE29C,IASLnkD,EAAEmkD,IAAMZ,GAAGvjD,EAAEmkD,IAAKX,GAAGO,IAAK1G,QAAQ6G,OAPlC19C,EAAE29C,KAAM,EAERnF,OAAOpxC,KAAKu2C,IAEZnkD,EAAEmkD,IAAMX,GAAGO,IAAK1G,QAAQ6G,KAK5B,CAEJ,CAGA,IAAK,IAAIhsC,GAAK8mC,OAAO39C,OAAQoS,EAAI,EAAGA,EAAIyE,GAAIzE,IAAK,CAE/C,IAAI2wC,GAAKpF,OAAOvrC,GAEhBsrC,QAAQtrC,GAAKzT,EAAEokD,GACjB,CAKA,OAFAnF,KAAK,GAAKD,OAAO39C,OAEVd,EAAEqoC,mBAAmB,CAC1B1T,OAAQ6pB,QACR1nC,MAAO2nC,OACP5X,IAAK6X,KACL9oB,KAAM,CAACwtB,MAAO,GACdrhB,SAAUka,IAEd,IA3VI6H,sBAAwBnpC,MAAM,wBAAyB,CACzD,2BA2EF,SAAyC3a,EAAGC,GAE1C,IAYIg8C,GAZAR,MAAQz7C,EAAEsiC,MACVoZ,MAAQ17C,EAAEuiC,MACVoZ,IAAM37C,EAAEwiC,UAER0a,MAAQj9C,EAAEqiC,MACVyZ,MAAQ97C,EAAEsiC,MACVyZ,IAAM/7C,EAAEuiC,UAER4gB,MAAQ1H,MAAM,GACd2H,SAAW3H,MAAM,GACjBqH,SAAWhH,MAAM,GAIjBiH,GAAKtB,UAELuB,GAAKtB,eAELhG,KAAOK,KAAOL,MAAQK,KAAsB,iBAARL,MAEtCM,GAAKN,IAELqH,GAAKroC,MAAMc,KAAKimC,UAAW,CAACzF,GAAIA,KAChCgH,GAAKtoC,MAAMc,KAAKkmC,eAAgB,CAAC1F,GAAIA,MAMvC,IAFA,IAAI76C,EAAI,GAECD,EAAI,EAAGA,EAAIiiD,MAAOjiD,IAAK,CAE9B,IAAI6iC,IAAMyX,MAAMt6C,GAEhBC,EAAED,GAAK,GAEP,IAAK,IAAI4F,EAAI,EAAGA,EAAIg8C,SAAUh8C,IAAK,CAIjC,IAFA,IAAIsL,IAAM4wC,GAAGjf,IAAI,GAAIkZ,MAAM,GAAGn2C,IAErBtH,EAAI,EAAGA,EAAI4jD,SAAU5jD,IAE5B4S,IAAM2wC,GAAG3wC,IAAK4wC,GAAGjf,IAAIvkC,GAAIy9C,MAAMz9C,GAAGsH,KAGpC3F,EAAED,GAAG4F,GAAKsL,GACZ,CACF,CAGA,OAAOrS,EAAEyjC,kBAAkB,CACzB/pB,KAAMtY,EACNw0B,KAAM,CAACwtB,MAAOL,UACdhhB,SAAUka,IAEd,EAlIE,4BA6IF,SAA0Cj8C,EAAGC,GAE3C,IAAIw7C,MAAQz7C,EAAEsiC,MACVoZ,MAAQ17C,EAAEuiC,MACVoZ,IAAM37C,EAAEwiC,UAERoZ,QAAU37C,EAAEumC,QACZqV,OAAS57C,EAAEwmC,OACXqV,KAAO77C,EAAEymC,KACTqV,MAAQ97C,EAAEsiC,MACVyZ,IAAM/7C,EAAEuiC,UAEZ,IAAKoZ,QACH,MAAM,IAAIt1C,MAAM,0DAIlB,IAGI21C,GAHAmH,MAAQ1H,MAAM,GACdqH,SAAWhH,MAAM,GAIjBiH,GAAKtB,UAELuB,GAAKtB,eAEL93C,GAAKi9B,YAELC,KAAO,EAEP4U,KAAOK,KAAOL,MAAQK,KAAsB,iBAARL,MAEtCM,GAAKN,IAELqH,GAAKroC,MAAMc,KAAKimC,UAAW,CAACzF,GAAIA,KAChCgH,GAAKtoC,MAAMc,KAAKkmC,eAAgB,CAAC1F,GAAIA,KACrCpyC,GAAK8Q,MAAMc,KAAKqrB,YAAa,CAACmV,GAAIA,KAElClV,KAAOpsB,MAAMoB,QAAQ,EAAGkgC,KAgB1B,IAZA,IAAIuC,QAAU,GACVC,OAAS,GACTC,KAAO,GAEPt9C,EAAInB,EAAEooC,mBAAmB,CAC3B1T,OAAQ6pB,QACR1nC,MAAO2nC,OACP5X,IAAK6X,KACL9oB,KAAM,CAACwtB,MAAOL,UACdhhB,SAAUka,KAGH8H,GAAK,EAAGA,GAAKhB,SAAUgB,KAAM,CAEpCrF,KAAKqF,IAAMtF,OAAO39C,OAElB,IAAIkjD,IAAMlI,KAAKiI,IACXE,IAAMnI,KAAKiI,GAAK,GAEpB,GAAIE,IAAMD,IAIR,IAFA,IAAIrmC,KAAO,EAEFxc,EAAI,EAAGA,EAAIiiD,MAAOjiD,IAAK,CAM9B,IAJA,IAAIi7C,KAAOj7C,EAAI,EAEX+iD,SAAM,EAEDC,GAAKH,IAAKG,GAAKF,IAAKE,KAAM,CAEjC,IAAIZ,GAAK1H,OAAOsI,IAEZxmC,OAASy+B,MAEX8H,IAAMjB,GAAGxH,MAAMt6C,GAAGoiD,IAAK3H,QAAQuI,KAE/BxmC,KAAOy+B,MAGP8H,IAAMlB,GAAGkB,IAAKjB,GAAGxH,MAAMt6C,GAAGoiD,IAAK3H,QAAQuI,KAE3C,CAGIxmC,OAASy+B,MAASvyC,GAAGq6C,IAAKnd,QAE5B0X,OAAOpxC,KAAKlM,GACZq9C,QAAQnxC,KAAK62C,KAEjB,CAEJ,CAKA,OAFAxF,KAAKqE,UAAYtE,OAAO39C,OAEjBM,CACT,EAhPE,4BAmWF,SAA0CpB,EAAGC,GAE3C,IAAI68C,QAAU98C,EAAEwmC,QACZuW,OAAS/8C,EAAEymC,OACXuW,KAAOh9C,EAAE0mC,KACTiV,IAAM37C,EAAEwiC,UAEZ,IAAKsa,QACH,MAAM,IAAIx2C,MAAM,0DAIlB,IAOI21C,GAPAiB,MAAQj9C,EAAEqiC,MACV0Z,IAAM/7C,EAAEuiC,UAER4gB,MAAQpjD,EAAEuiC,MAAM,GAChB+gB,MAAQrjD,EAAEsiC,MAAM,GAChBwgB,SAAW9iD,EAAEsiC,MAAM,GAInBygB,GAAKtB,UAELuB,GAAKtB,eAEL93C,GAAKi9B,YAELC,KAAO,EAEP4U,KAAOK,KAAOL,MAAQK,KAAsB,iBAARL,MAEtCM,GAAKN,IAELqH,GAAKroC,MAAMc,KAAKimC,UAAW,CAACzF,GAAIA,KAChCgH,GAAKtoC,MAAMc,KAAKkmC,eAAgB,CAAC1F,GAAIA,KACrCpyC,GAAK8Q,MAAMc,KAAKqrB,YAAa,CAACmV,GAAIA,KAElClV,KAAOpsB,MAAMoB,QAAQ,EAAGkgC,KAoB1B,IAhBA,IAAIuC,QAAU,GACVC,OAAS,GACTC,KAAO,GAEPt9C,EAAIpB,EAAEqoC,mBAAmB,CAC3B1T,OAAQ6pB,QACR1nC,MAAO2nC,OACP5X,IAAK6X,KACL9oB,KAAM,CAACwtB,MAAOL,UACdhhB,SAAUka,KAGRx8C,EAAI,GAEJwG,EAAI,GAEC89C,GAAK,EAAGA,GAAKhB,SAAUgB,KAAM,CAEpCrF,KAAKqF,IAAMtF,OAAO39C,OAIlB,IAFA,IAAIs7C,KAAO2H,GAAK,EAEPR,GAAK,EAAGA,GAAKD,MAAOC,KAAM,CAEjC,IAAIa,KAAOlH,MAAMqG,IAAIQ,IAErB,IAAKl6C,GAAGu6C,KAAMrd,MAEZ,IAAK,IAAI0c,IAAMzG,KAAKuG,IAAKG,IAAM1G,KAAKuG,GAAK,GAAII,GAAKF,IAAKE,GAAKD,IAAKC,KAAM,CAErE,IAAIC,GAAK7G,OAAO4G,IAEZ19C,EAAE29C,MAAQxH,MAEZn2C,EAAE29C,IAAMxH,KAERqC,OAAOpxC,KAAKu2C,IAEZnkD,EAAEmkD,IAAMX,GAAGmB,KAAMtH,QAAQ6G,MAGzBlkD,EAAEmkD,IAAMZ,GAAGvjD,EAAEmkD,IAAKX,GAAGmB,KAAMtH,QAAQ6G,KAEvC,CAEJ,CAGA,IAAK,IAAIU,GAAK3F,KAAKqF,IAAKpsC,GAAK8mC,OAAO39C,OAAQoS,EAAImxC,GAAInxC,EAAIyE,GAAIzE,IAAK,CAE/D,IAAI2wC,GAAKpF,OAAOvrC,GAEhBsrC,QAAQtrC,GAAKzT,EAAEokD,GACjB,CACF,CAKA,OAFAnF,KAAKqE,UAAYtE,OAAO39C,OAEjBM,CACT,EAvcE,6BAkdF,SAA2CpB,EAAGC,GAE5C,IAeIg8C,GAfAa,QAAU98C,EAAEwmC,QACZuW,OAAS/8C,EAAEymC,OACXuW,KAAOh9C,EAAE0mC,KACTiV,IAAM37C,EAAEwiC,UAERoZ,QAAU37C,EAAEumC,QACZqV,OAAS57C,EAAEwmC,OACXqV,KAAO77C,EAAEymC,KACTsV,IAAM/7C,EAAEuiC,UAER4gB,MAAQpjD,EAAEuiC,MAAM,GAChBwgB,SAAW9iD,EAAEsiC,MAAM,GAEnB5N,OAASmoB,SAAWlB,QAIpBoH,GAAKtB,UAELuB,GAAKtB,eAELhG,KAAOK,KAAOL,MAAQK,KAAsB,iBAARL,MAEtCM,GAAKN,IAELqH,GAAKroC,MAAMc,KAAKimC,UAAW,CAACzF,GAAIA,KAChCgH,GAAKtoC,MAAMc,KAAKkmC,eAAgB,CAAC1F,GAAIA,MAsBvC,IAlBA,IAgBI0H,GAAIF,IAAKC,IAAKS,GAAIH,IAAKC,IAAKL,GAAIL,GAhBhC/E,QAAU7pB,OAAS,QAAKj0B,EACxB+9C,OAAS,GACTC,KAAO,GAEPt9C,EAAIpB,EAAEqoC,mBAAmB,CAC3B1T,OAAQ6pB,QACR1nC,MAAO2nC,OACP5X,IAAK6X,KACL9oB,KAAM,CAACwtB,MAAOL,UACdhhB,SAAUka,KAGRx8C,EAAIk1B,OAAS,QAAKj0B,EAElBuF,EAAI,GAIC89C,GAAK,EAAGA,GAAKhB,SAAUgB,KAAM,CAEpCrF,KAAKqF,IAAMtF,OAAO39C,OAElB,IAAIs7C,KAAO2H,GAAK,EAEhB,IAAKC,IAAMlI,KAAKiI,IAAKE,IAAMnI,KAAKiI,GAAK,GAAII,GAAKH,IAAKG,GAAKF,IAAKE,KAI3D,GAFAZ,GAAK1H,OAAOsI,IAERxvB,OAEF,IAAK8uB,IAAMzG,KAAKuG,IAAKG,IAAM1G,KAAKuG,GAAK,GAAII,GAAKF,IAAKE,GAAKD,IAAKC,KAE3DC,GAAK7G,OAAO4G,IAER19C,EAAE29C,MAAQxH,MAEZn2C,EAAE29C,IAAMxH,KAERqC,OAAOpxC,KAAKu2C,IAEZnkD,EAAEmkD,IAAMX,GAAGrH,QAAQuI,IAAKrH,QAAQ6G,MAGhClkD,EAAEmkD,IAAMZ,GAAGvjD,EAAEmkD,IAAKX,GAAGrH,QAAQuI,IAAKrH,QAAQ6G,WAK9C,IAAKF,IAAMzG,KAAKuG,IAAKG,IAAM1G,KAAKuG,GAAK,GAAII,GAAKF,IAAKE,GAAKD,IAAKC,KAE3DC,GAAK7G,OAAO4G,IAER19C,EAAE29C,MAAQxH,OAEZn2C,EAAE29C,IAAMxH,KAERqC,OAAOpxC,KAAKu2C,KAOpB,GAAIjvB,OAEF,IAAK,IAAI0vB,GAAK3F,KAAKqF,IAAKpsC,GAAK8mC,OAAO39C,OAAQoS,EAAImxC,GAAInxC,EAAIyE,GAAIzE,IAAK,CAE/D,IAAI2wC,GAAKpF,OAAOvrC,GAEhBsrC,QAAQtrC,GAAKzT,EAAEokD,GACjB,CAEJ,CAKA,OAFAnF,KAAKqE,UAAYtE,OAAO39C,OAEjBM,CACT,IAoCA,OAAOuZ,MA/yBE,WA+yBUkZ,OAAO,CAExB,eAAgB,SAAoBp0B,EAAG8C,GAErCmgD,0BAA0B,gBAAUjjD,GAAI,gBAAU8C,IAGlD,IAAI8G,EAAI9J,KAAKo+B,OAAOl+B,GAAIk+B,OAAOp7B,IAE/B,OAAO,YAAS8G,GAAKA,EAAE6G,UAAY7G,CACrC,EACA,iBAAkB,SAAsB5J,EAAG8C,GAEzC,IAAI+hD,MAAQ7kD,EAAEm2B,OACV2uB,MAAQhiD,EAAEqzB,OAKd,OAHA8sB,0BAA0B4B,MAAOC,OAGZ,IAAjBD,MAAMxjD,OAEa,IAAjByjD,MAAMzjD,OA1uBhB,SAA+Bd,EAAGC,EAAGqJ,GAEnC,GAAU,IAANA,EACF,MAAM,IAAIhD,MAAM,qCAGlB,OAAO0wB,IAAIh3B,EAAGC,EAChB,CAquBeukD,CAAsB/kD,EAAG8C,EAAG+hD,MAAM,IAIpCzB,sBAAsBpjD,EAAG8C,GAIb,IAAjBgiD,MAAMzjD,OAEDqiD,sBAAsB1jD,EAAG8C,GAI3BuhD,sBAAsBrkD,EAAG8C,EAClC,EACA,gBAAiB,SAAqB9C,EAAG8C,GAEvC,OAAOhD,KAAKE,EAAGk+B,OAAOp7B,GACxB,EACA,gBAAiB,SAAqB9C,EAAG8C,GAEvC,OAAOhD,KAAKo+B,OAAOl+B,EAAG8C,EAAEu/B,WAAYv/B,EACtC,EACA,oBAAqB,SAAyB9C,EAAG8C,GAC/C,OAAO+8C,YAAY7/C,EAAG8C,EAAGo/C,gBAAgB,EAC3C,EACA,mBAAoB,SAAwBliD,EAAG8C,GAC7C,OAAOw7C,YAAYt+C,EAAG8C,EAAGo/C,gBAAgB,EAC3C,EACA,oBAAqB,SAAyBliD,EAAG8C,GAC/C,OAAO+8C,YAAY/8C,EAAG9C,EAAGkiD,gBAAgB,EAC3C,EACA,mBAAoB,SAAwBliD,EAAG8C,GAC7C,OAAOw7C,YAAYx7C,EAAG9C,EAAGkiD,gBAAgB,EAC3C,EACA,aAAc,SAAkBliD,EAAG8C,GAEjC,OAAOw7C,YAAYpgB,OAAOl+B,GAAI8C,EAAGo/C,gBAAgB,GAAOzxC,SAC1D,EACA,aAAc,SAAkBzQ,EAAG8C,GAEjC,OAAOw7C,YAAYpgB,OAAOp7B,GAAI9C,EAAGkiD,gBAAgB,GAAMzxC,SACzD,EACA,WAAYyxC,eACZ,mBAAoB,SAAmBliD,EAAG8C,EAAGkiD,MAG3C,IAFA,IAAIluC,OAAShX,KAAKE,EAAG8C,GAEZpB,EAAI,EAAGA,EAAIsjD,KAAK3jD,OAAQK,IAC/BoV,OAAShX,KAAKgX,OAAQkuC,KAAKtjD,IAG7B,OAAOoV,MACT,GACCorC,eAAehmC,YAAY,ICv3BrB+oC,qBAAuB,CAChCvL,sBACAkI,gBACAjb,wBACAgE,mBACAkW,2BACAza,kBACA4c,gBCZSkC,UAA2B,gBAF3B,MACQ,CAAC,QAAS,SAAU,WAAY,WAAY,SAAU,WAAY,SAAU,YAC7B1uC,OAChE,IAAI,MACG,OACC,SACE,SACA,OACF,OACA,SACE,SAENA,KAkCJ,OAAO0E,MA9CE,MA8CU,CACjB,iBAAkBiqC,KAClB,mBAAoB,SAAwBnlD,EAAG8C,GAC7C,OAAO9C,EAAEkC,IAAIY,EACf,EACA,uBAAwB,SAA4B9C,EAAG8C,GACrD,OAAIA,EAAE2J,aAAezM,GAAK,GAAK+T,OAAOqqB,YAC7Bp+B,EAAEkC,IAAIY,GAEN,IAAI/B,QAAQf,EAAE+P,WAAY,GAAG7N,IAAIY,EAAEiN,WAAY,EAE1D,EACA,qBAAsB,SAA0B/P,EAAG8C,GACjD,IAAIgU,OAAS9W,EAAEkC,IAAIY,GAEnB,GAAc,MAAVgU,OACF,OAAOA,OAGT,GAAI/C,OAAOqqB,YACT,MAAM,IAAIv3B,MAAM,uEAEhB,OAAOs+C,KAAKnlD,EAAEyQ,UAAW3N,EAAE2N,UAE/B,EACA,gBAAiB20C,UACjB,mBAAoB,SAAwBplD,EAAG8C,GAC7C,OAAOsiD,UAAUplD,EAAG8C,EAAEiN,WACxB,EACA,iBAAkBs1C,WAClB,oBAAqB,SAAyBrlD,EAAG8C,GAC/C,OAAOuiD,WAAWrlD,EAAG8C,EAAEiN,WACzB,EACA,2BAA4B,SAA6B/P,EAAG8C,GAC1D,OAAO9C,EAAEkC,IAAIY,EACf,IAUF,SAASqiD,KAAKnlD,EAAG8C,GAGf,GAAIiR,OAAOqqB,cAAgB3xB,UAAU3J,IAAM9C,EAAI,EAE7C,IACE,IAAIslD,MAAQ/sB,SAASz1B,GACjByiD,KAAOpnB,OAAOmnB,OAElB,IAAIxiD,IAAMyiD,MAAQtlD,KAAKS,KAAKoC,EAAIyiD,MAAQziD,GAAK,QACvCwiD,MAAMrjD,EAAI,GAAM,EAClB,OAAQqjD,MAAMz7C,EAAI,GAAM,EAAI,GAAK,GAAK5J,KAAKiC,KAAKlC,EAAG8C,EAIzD,CADE,MAAO0iD,IACT,CAOF,OAAIzxC,OAAOqqB,cAAgBp+B,GAAK,GAAK8C,IAAMG,KAAYjD,GAAK,GAAKA,EAAI,GAAK8C,KAAOG,KACxEkB,IAGLsI,UAAU3J,IAAM9C,GAAK,GAAK+T,OAAOqqB,YAC5Bib,UAAUr5C,EAAG8C,GAKhB9C,EAAIA,EAAI,GAAK8C,IAAMG,KAAYjD,EAAIA,EAAI,GAAK8C,KAAOG,IAC9C,EAGF,IAAIlC,QAAQf,EAAG,GAAGkC,IAAIY,EAAG,EAEpC,CAUA,SAASsiD,UAAUplD,EAAG8C,GACpB,IAAK2J,UAAU3J,IAAMA,EAAI,EACvB,MAAM,IAAI6Y,UAAU,mDAAqD7Y,EAAI,KAI/E,IAAIiF,EAAI,gBAAK/H,GAEb,GAAiB,IAAb+H,EAAE1G,OACJ,MAAM,IAAIwF,MAAM,2CAA6CkB,EAAE1G,OAAS,gBAG1E,GAAI0G,EAAE,KAAOA,EAAE,GACb,MAAM,IAAIlB,MAAM,sCAAwCkB,EAAE,GAAK,IAAMA,EAAE,GAAK,KAM9E,IAHA,IAAI1E,IAAMoiD,SAAS19C,EAAE,IAAI0I,UACrBlE,GAAKvM,EAEF8C,GAAK,GACM,IAAP,EAAJA,KACHO,IAAMmxC,SAASjoC,GAAIlJ,MAGrBP,IAAM,EACNyJ,GAAKioC,SAASjoC,GAAIA,IAGpB,OAAOlJ,GACT,CAUA,SAASgiD,WAAWrlD,EAAG8C,GACrB,OAAOo7B,OAAOknB,UAAUplD,EAAEyQ,UAAW3N,GACvC,KC5KS4iD,gBAAkB,CAC3BlgB,oBACA2U,qBACAkH,qBACA1W,mBACAsa,qBACA5K,mBACAjU,kBACA8e,WCdSS,uBAAyB,CAClCvf,kBACAwf,iBCH2C,gBAFlC,aACQ,CAAC,UACqDpvC,OACvE,IAAI,OAEAA,KAyBJ,OAAO0E,MA9BE,aA8BU,CACjBijB,OAAQ+a,iBACRn4C,QAAS,SAAiBf,GACxB,OAAOA,EAAEyJ,KACX,EACA87B,UAAW,SAAmBvlC,GAC5B,OAAOA,EAAEyJ,KACX,EACAmO,SAAU,SAAkB5X,GAC1B,OAAOA,EAAEyJ,KACX,EACAgwC,KAAM,SAAcz5C,GAClB,IAAIqD,IAAMrD,EAAE+U,QAEZ,OADA1R,IAAI0Y,MAAQjc,KAAKE,EAAE+b,OACZ1Y,GACT,EACA,iBAAkB,SAAqBrD,GAErC,OAAO64C,QAAQ74C,EAAGF,MAAM,EAC1B,GAEA,KClDO+lD,kBAAmC,gBAFnC,cACQ,CAAC,UACsDrvC,OACxE,IAAI,OAEAA,KAqBJ,OAAO,SAAoBqlC,YAAaC,aAAcriC,SAAUsiC,SAE9D,IAAIC,MAAQH,YAAYhZ,MACpBoZ,MAAQJ,YAAY/Y,MACpBoZ,IAAML,YAAY9Y,UAElBoZ,QAAUL,aAAa/U,QACvBqV,OAASN,aAAa9U,OACtBqV,KAAOP,aAAa7U,KACpBqV,MAAQR,aAAahZ,MACrByZ,IAAMT,aAAa/Y,UAEvB,GAAIkZ,MAAM56C,SAAWi7C,MAAMj7C,OACzB,MAAM,IAAIu3B,eAAeqjB,MAAM56C,OAAQi7C,MAAMj7C,QAI/C,GAAI46C,MAAM,KAAOK,MAAM,IAAML,MAAM,KAAOK,MAAM,GAC9C,MAAM,IAAIze,WAAW,iCAAmCoe,MAAQ,0BAA4BK,MAAQ,KAItG,IAAKH,QACH,MAAM,IAAIt1C,MAAM,sEAIlB,IAOInF,EAAG4F,EAPHg9B,KAAO2X,MAAM,GACbzX,QAAUyX,MAAM,GAEhBO,GAAoB,iBAARN,KAAoBA,MAAQK,IAAML,SAAMj7C,EAEpDw7C,GAAKD,GAAKthC,MAAMc,KAAKvC,SAAU,CAAC+iC,GAAIA,KAAO/iC,SAI3CijC,MAAQ,GAEZ,IAAKh7C,EAAI,EAAGA,EAAI4iC,KAAM5iC,IACpBg7C,MAAMh7C,GAAK,GAIb,IAAI1B,EAAI,GAEJwG,EAAI,GAER,IAAKc,EAAI,EAAGA,EAAIk9B,QAASl9B,IAAK,CAI5B,IAFA,IAAIq1C,KAAOr1C,EAAI,EAENmhC,GAAK4T,KAAK/0C,GAAIohC,GAAK2T,KAAK/0C,EAAI,GAAIlB,EAAIqiC,GAAIriC,EAAIsiC,GAAItiC,IAIvDpG,EAFA0B,EAAI06C,OAAOh2C,IAEJ21C,QAAUU,GAAGN,QAAQ/1C,GAAI41C,MAAMt6C,GAAG4F,IAAMm1C,GAAGT,MAAMt6C,GAAG4F,GAAI60C,QAAQ/1C,IAEvEI,EAAE9E,GAAKi7C,KAIT,IAAKj7C,EAAI,EAAGA,EAAI4iC,KAAM5iC,IAEhB8E,EAAE9E,KAAOi7C,KAEXD,MAAMh7C,GAAG4F,GAAKtH,EAAE0B,GAGhBg7C,MAAMh7C,GAAG4F,GAAK00C,MAAMt6C,GAAG4F,EAG7B,CAGA,OAAOu0C,YAAY7X,kBAAkB,CACnC/pB,KAAMyiC,MACNvmB,KAAM,CAACmO,KAAME,SACblC,SAAUka,IAEd,CAAC,ICvGQsJ,kBAAmC,gBAFnC,cACQ,CAAC,QAAS,gBAC6CtvC,OACxE,IAAI,MACG,aAEHA,KAoBJ,OAAO,SAAqBjW,EAAGC,EAAGiZ,UAEhC,IAAI4jC,QAAU98C,EAAEwmC,QACZuW,OAAS/8C,EAAEymC,OACXuW,KAAOh9C,EAAE0mC,KACTgV,MAAQ17C,EAAEuiC,MACVoZ,IAAM37C,EAAEwiC,UAERoZ,QAAU37C,EAAEumC,QACZqV,OAAS57C,EAAEwmC,OACXqV,KAAO77C,EAAEymC,KACTqV,MAAQ97C,EAAEsiC,MACVyZ,IAAM/7C,EAAEuiC,UAEZ,GAAIkZ,MAAM56C,SAAWi7C,MAAMj7C,OACzB,MAAM,IAAIu3B,eAAeqjB,MAAM56C,OAAQi7C,MAAMj7C,QAI/C,GAAI46C,MAAM,KAAOK,MAAM,IAAML,MAAM,KAAOK,MAAM,GAC9C,MAAM,IAAIze,WAAW,iCAAmCoe,MAAQ,0BAA4BK,MAAQ,KAItG,IAGIE,GAHAlY,KAAO2X,MAAM,GACbzX,QAAUyX,MAAM,GAIhB7xC,GAAKi9B,YAELC,KAAO,EAEPmV,GAAKhjC,SAEU,iBAARyiC,KAAoBA,MAAQK,MAErCC,GAAKN,IAEL9xC,GAAK8Q,MAAMc,KAAKqrB,YAAa,CAACmV,GAAIA,KAElClV,KAAOpsB,MAAMoB,QAAQ,EAAGkgC,IAExBC,GAAKvhC,MAAMc,KAAKvC,SAAU,CAAC+iC,GAAIA,MAIjC,IAUI96C,EAAG4F,EAAGlB,EAAGsiC,GAVTqW,QAAU1B,SAAWlB,QAAU,QAAKl7C,EACpC+9C,OAAS,GACTC,KAAO,GAEPpC,GAAKkC,QAAU,QAAK99C,EACpB67C,GAAKiC,QAAU,QAAK99C,EAEpB87C,GAAK,GACLC,GAAK,GAIT,IAAK11C,EAAI,EAAGA,EAAIk9B,QAASl9B,IAAK,CAE5B23C,KAAK33C,GAAK03C,OAAO39C,OAEjB,IAAIs7C,KAAOr1C,EAAI,EAEf,IAAKlB,EAAIm3C,KAAKj2C,GAAIohC,GAAK6U,KAAKj2C,EAAI,GAAIlB,EAAIsiC,GAAItiC,IAE1C1E,EAAI47C,OAAOl3C,GAEX44C,OAAOpxC,KAAKlM,GAEZq7C,GAAGr7C,GAAKi7C,KAEJE,KACFA,GAAGn7C,GAAK27C,QAAQj3C,IAKpB,IAAKA,EAAIi2C,KAAK/0C,GAAIohC,GAAK2T,KAAK/0C,EAAI,GAAIlB,EAAIsiC,GAAItiC,IAItC22C,GAFJr7C,EAAI06C,OAAOh2C,MAEGu2C,MAEZqC,OAAOpxC,KAAKlM,GAIds7C,GAAGt7C,GAAKi7C,KAEJG,KACFA,GAAGp7C,GAAKy6C,QAAQ/1C,IAKpB,GAAI24C,QAIF,IAFA34C,EAAI64C,KAAK33C,GAEFlB,EAAI44C,OAAO39C,QAAQ,CAIxB,IAAI0kD,IAAMhJ,GAFVr7C,EAAIs9C,OAAO54C,IAGP4/C,IAAMhJ,GAAGt7C,GAEb,GAAIqkD,MAAQpJ,MAAQqJ,MAAQrJ,KAAM,CAEhC,IAGIsJ,GAAKxJ,GAHAsJ,MAAQpJ,KAAOE,GAAGn7C,GAAK4lC,KACvB0e,MAAQrJ,KAAOG,GAAGp7C,GAAK4lC,MAI3Bl9B,GAAG67C,GAAI3e,MAOV0X,OAAOz5B,OAAOnf,EAAG,IALjB24C,QAAQnxC,KAAKq4C,IAEb7/C,IAKJ,CACF,CAEJ,CAKA,OAFA64C,KAAKza,SAAWwa,OAAO39C,OAEhBd,EAAEqoC,mBAAmB,CAC1B1T,OAAQ6pB,QACR1nC,MAAO2nC,OACP5X,IAAK6X,KACL9oB,KAAM,CAACmO,KAAME,SACblC,SAAUka,IAEd,CAAC,ICpKQ0J,kBAAmC,gBAFnC,cACQ,CAAC,QAAS,gBAC6C1vC,OACxE,IAAI,MACG,aAEHA,KAqBJ,OAAO,SAAqBzO,EAAGvH,EAAGiZ,SAAUsiC,SAE1C,IAAIsB,QAAUt1C,EAAEg/B,QACZuW,OAASv1C,EAAEi/B,OACXuW,KAAOx1C,EAAEk/B,KACTgV,MAAQl0C,EAAE+6B,MACVoZ,IAAMn0C,EAAEg7B,UAEZ,IAAKsa,QACH,MAAM,IAAIx2C,MAAM,sEAIlB,IAGI21C,GAHAlY,KAAO2X,MAAM,GACbzX,QAAUyX,MAAM,GAIhBQ,GAAKhjC,SAEU,iBAARyiC,MAETM,GAAKN,IAEL17C,EAAI0a,MAAMoB,QAAQ9b,EAAGg8C,IAErBC,GAAKvhC,MAAMc,KAAKvC,SAAU,CAAC+iC,GAAIA,MAUjC,IANA,IAAIE,MAAQ,GAER18C,EAAI,GAEJwG,EAAI,GAECc,EAAI,EAAGA,EAAIk9B,QAASl9B,IAAK,CAIhC,IAFA,IAAIq1C,KAAOr1C,EAAI,EAENmhC,GAAK8U,KAAKj2C,GAAIohC,GAAK6U,KAAKj2C,EAAI,GAAIlB,EAAIqiC,GAAIriC,EAAIsiC,GAAItiC,IAAK,CAE5D,IAAI7D,EAAI+6C,OAAOl3C,GAEfpG,EAAEuC,GAAK86C,QAAQj3C,GACfI,EAAEjE,GAAKo6C,IACT,CAGA,IAAK,IAAIj7C,EAAI,EAAGA,EAAI4iC,KAAM5iC,IAEd,IAAN4F,IAEFo1C,MAAMh7C,GAAK,IAIT8E,EAAE9E,KAAOi7C,KAEXD,MAAMh7C,GAAG4F,GAAKy0C,QAAUU,GAAGj8C,EAAGR,EAAE0B,IAAM+6C,GAAGz8C,EAAE0B,GAAIlB,GAG/Ck8C,MAAMh7C,GAAG4F,GAAK9G,CAGpB,CAGA,OAAO,IAAIoiC,YAAY,CACrB3oB,KAAMyiC,MACNvmB,KAAM,CAACmO,KAAME,SACblC,SAAUka,IAEd,CAAC,IC6DH,SAAS2J,qBAAqBnmD,EAAG8C,GAC/B,IAAI+hD,MAAQ7kD,EAAEm2B,OACV2uB,MAAQhiD,EAAEqzB,OAEd,GAAI0uB,MAAMxjD,SAAWyjD,MAAMzjD,OACzB,MAAM,IAAIu3B,eAAeisB,MAAMxjD,OAAQyjD,MAAMzjD,OAEjD,CC9JO,IAAI+kD,qBAAuB,CAChChhB,wBACAsU,sBACA/S,wBACAgE,mBACAvE,kBACAuf,uBACAU,eDRyC,gBAFhC,WACQ,CAAC,QAAS,SAAU,cAAe,YAAa,aAAc,gBACV7vC,OACrE,IAAI,MACG,OACC,YACK,UACF,WACC,aAERA,KAEA8vC,YAAcT,kBAAkB,CAClC3qC,QAEEgjC,YAActC,kBAAkB,CAClC1gC,QAEEqrC,YAAcT,kBAAkB,CAClC5qC,MACAmsB,cAEEmf,YAAcN,kBAAkB,CAClChrC,MACA0nB,cAEEyb,YAAcb,kBAAkB,CAClCtiC,QAEEojC,YAAcN,kBAAkB,CAClC9iC,QAoCF,OAAOA,MAlEE,WAkEU,CACjB,iBAAkB,SAAsBlb,EAAG8C,GACzC,OAAO9C,EAAI8C,CACb,EACA,mBAAoB,SAAwB9C,EAAG8C,GAC7C,OAAO9C,EAAEyN,IAAI3K,EACf,EACA,uBAAwB,SAA4B9C,EAAG8C,GACrD,OAAO9C,EAAEyB,MAAMqB,EACjB,EACA,qBAAsB,SAA0B9C,EAAG8C,GACjD,OAAO9C,EAAEyN,IAAI3K,EACf,EACA,aAAc,SAAkB9C,EAAG8C,GACjC,GAAgB,OAAZ9C,EAAE+b,MACJ,MAAM,IAAIlV,MAAM,oDAGlB,GAAgB,OAAZ/D,EAAEiZ,MACJ,MAAM,IAAIlV,MAAM,oDAGlB,IAAK7G,EAAE0mC,UAAU5jC,GACf,MAAM,IAAI+D,MAAM,sBAGlB,IAAIxD,IAAMrD,EAAE+U,QAGZ,OAFA1R,IAAI0Y,MAAQjc,KAAKuD,IAAI0Y,MAAOjZ,EAAEiZ,OAC9B1Y,IAAIu2C,WAAY,EACTv2C,GACT,EACA,6BAA8B,SAAkCrD,EAAG8C,GAEjE,OADAqjD,qBAAqBnmD,EAAG8C,GACjByjD,YAAYvmD,EAAG8C,EAAGhD,KAC3B,EACA,4BAA6B,SAAiCE,EAAG8C,GAE/D,OADAqjD,qBAAqBnmD,EAAG8C,GACjBo7C,YAAYp7C,EAAG9C,EAAGF,MAAM,EACjC,EACA,4BAA6B,SAAiCE,EAAG8C,GAE/D,OADAqjD,qBAAqBnmD,EAAG8C,GACjBwjD,YAAYtmD,EAAG8C,EAAGhD,MAAM,EACjC,EACA,2BAA4B,SAAgCE,EAAG8C,GAE7D,OADAqjD,qBAAqBnmD,EAAG8C,GACjBu7C,YAAYr+C,EAAG8C,EAAGhD,KAC3B,EACA,eAAgB,SAAoBE,EAAG8C,GAErC,OAAOhD,KAAKo+B,OAAOl+B,GAAIk+B,OAAOp7B,IAAI2N,SACpC,EACA,gBAAiB,SAAqBzQ,EAAG8C,GAEvC,OAAOhD,KAAKo+B,OAAOl+B,GAAI8C,EACzB,EACA,gBAAiB,SAAqB9C,EAAG8C,GAEvC,OAAOhD,KAAKE,EAAGk+B,OAAOp7B,GACxB,EACA,oBAAqB,SAAyB9C,EAAG8C,GAC/C,OAAO0jD,YAAYxmD,EAAGq0C,WAAWvxC,GAAIm/C,UACvC,EACA,mBAAoB,SAAwBjiD,EAAG8C,GAC7C,OAAOw7C,YAAYt+C,EAAG8C,EAAGhD,KAC3B,EACA,oBAAqB,SAAyBE,EAAG8C,GAC/C,OAAO0jD,YAAY1jD,EAAG9C,EAAGF,MAAM,EACjC,EACA,mBAAoB,SAAwBE,EAAG8C,GAC7C,OAAOw7C,YAAYx7C,EAAG9C,EAAGF,MAAM,EACjC,EACA,aAAc,SAAkBE,EAAG8C,GAEjC,OAAOw7C,YAAYpgB,OAAOl+B,GAAI8C,EAAGhD,MAAM,GAAO2Q,SAChD,EACA,aAAc,SAAkBzQ,EAAG8C,GAEjC,OAAOw7C,YAAYpgB,OAAOp7B,GAAI9C,EAAGF,MAAM,GAAM2Q,SAC/C,GACA,KEtJG,SAASg2C,SAASC,OACvB,IAAIvwB,KAAO,EACPjpB,KAAO,EACPy5C,MAAQ9wC,OAAO4E,OAAO,MACtBmC,IAAM/G,OAAO4E,OAAO,MACpBpD,MAAQ,EAERuvC,IAAM,SAAa7/B,IACrB,IAAI8/B,SAAWjqC,IAAImK,IACnB,GAAK8/B,kBACEF,MAAME,iBACNjqC,IAAImK,MACToP,KACEjpB,OAAS25C,UAAb,CAEA,IAAK1wB,KAGH,OAFA9e,MAAQ,OACRnK,KAAO,GAIT,MAAQyI,eAAeO,KAAKywC,QAASz5C,QARR,CAW/B,EAGA,OADAw5C,MAAQzmD,KAAKS,IAAIgmD,OACV,CACLI,IAAK,SAAa//B,IAChB,IAAI8/B,SAAWjqC,IAAImK,IACfggC,UAAY1vC,MAIhB,GAHAsvC,MAAMI,SAAWhgC,GACjBnK,IAAImK,IAAMggC,SAELF,SAAU,CAEb,KADE1wB,MACUuwB,MAAO,OAGnB,OAFA3/B,GAAK4/B,MAAMz5C,MACX05C,IAAI7/B,IACGA,EACT,CAGA,UADO4/B,MAAME,UACT35C,OAAS25C,SAEb,MAAQlxC,eAAeO,KAAKywC,QAASz5C,QAKvC,EACA85C,OAAQJ,IACRK,MAAO,WACL9wB,KAAO9e,MAAQ,EACfnK,KAAO,EACPy5C,MAAQ9wC,OAAO4E,OAAO,MACtBmC,IAAM/G,OAAO4E,OAAO,KACtB,EAEJ,CC5CO,SAASysC,QAAQvtC,IACtB,IAAI,OACI,OAEJnF,UAAUnT,OAAS,QAAsBJ,IAAjBuT,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAGzE,OAFAkyC,MAAiB,MAATA,MAAgBxlD,OAAOimD,kBAAoBT,MACnDU,OAAmB,MAAVA,OAAiB3qB,KAAK/D,UAAY0uB,OACpC,SAASF,UACe,iBAAlBA,QAAQG,QACjBH,QAAQG,MAAQ,CACdnyB,OAAQ,IAAIyK,IACZ2nB,IAAKb,SAASC,OAASxlD,OAAOimD,qBAMlC,IAFA,IAAI10C,KAAO,GAEF/Q,EAAI,EAAGA,EAAI8S,UAAUnT,OAAQK,IACpC+Q,KAAK/Q,GAAK8S,UAAU9S,GAGtB,IAAI6lD,KAAOH,OAAO30C,MAElB,GAAIy0C,QAAQG,MAAMnyB,OAAOuK,IAAI8nB,MAE3B,OADAL,QAAQG,MAAMC,IAAIR,IAAIS,MACfL,QAAQG,MAAMnyB,OAAOjP,IAAIshC,MAGlC,IAAIC,OAAS7tC,GAAGlC,MAAMkC,GAAIlH,MAG1B,OAFAy0C,QAAQG,MAAMnyB,OAAOxf,IAAI6xC,KAAMC,QAC/BN,QAAQG,MAAMnyB,OAAO8xB,OAAOE,QAAQG,MAAMC,IAAIR,IAAIS,OAC3CC,MACT,CACF,CC5C8BN,SAAQ,SAAU3hB,WAC9C,OAAO,IAAIA,UAAU,GAAGrlC,KAC1B,GAAG,CACDknD,SAQ8BF,SAAQ,SAAU3hB,WAChD,OAAO,IAAIA,UAAU,GAAG/jC,KAAK,IAAI+jC,UAAU,GAAG/iC,QAAQgI,IAAI,EAC5D,GAAG,CACD48C,SAdK,IAsBIK,kBAAoBP,SAAQ,SAAU3hB,WAC/C,OAAOA,UAAUpiC,MAAM,EACzB,GAAG,CACDikD,SAQ8BF,SAAQ,SAAU3hB,WAChD,OAAOkiB,kBAAkBliB,WAAWj8B,MAAM,EAC5C,GAAG,CACD89C,SAWF,SAASA,OAAO30C,MACd,OAAOA,KAAK,GAAG7N,SACjB,CCrDA,SAAS,aAAQuvB,OAAQgrB,gBAAkB,IAAIloC,KAAOpB,OAAOoB,KAAKkd,QAAS,GAAIte,OAAOupC,sBAAuB,CAAE,IAAIC,QAAUxpC,OAAOupC,sBAAsBjrB,QAASgrB,iBAAmBE,QAAUA,QAAQniC,QAAO,SAAUoiC,KAAO,OAAOzpC,OAAO0pC,yBAAyBprB,OAAQmrB,KAAKt5B,UAAY,KAAK/O,KAAKrJ,KAAK6J,MAAMR,KAAMooC,QAAU,CAAE,OAAOpoC,IAAM,CAEpV,SAAS,kBAAclB,QAAU,IAAK,IAAIrU,EAAI,EAAGA,EAAI8S,UAAUnT,OAAQK,IAAK,CAAE,IAAIsU,OAAS,MAAQxB,UAAU9S,GAAK8S,UAAU9S,GAAK,CAAC,EAAGA,EAAI,EAAI,aAAQmU,OAAOG,SAAS,GAAIoB,SAAQ,SAAUnB,KAAO2oC,gBAAgB7oC,OAAQE,IAAKD,OAAOC,KAAO,IAAKJ,OAAO4pC,0BAA4B5pC,OAAO6pC,iBAAiB3pC,OAAQF,OAAO4pC,0BAA0BzpC,SAAW,aAAQH,OAAOG,SAASoB,SAAQ,SAAUnB,KAAOJ,OAAO2O,eAAezO,OAAQE,IAAKJ,OAAO0pC,yBAAyBvpC,OAAQC,KAAO,GAAI,CAAE,OAAOF,MAAQ,CAQzf,IAEW2xC,gBAAiC,gBAFjC,OACQ,CAAC,MAAO,SAAU,YAAa,WAAY,iBAAkB,eAAgB,MAAO,MAAO,MAAO,QAAS,QAAS,YAAa,SAAU,SAAU,UAAW,YAAa,aACxHlxC,OACtE,IAwFI6hB,KAAMhhB,MAAO1V,GAxFb,GACA,OACI,UACG,SACD,eACM,aACF,IACT,IACA,IACA,MACE,MACA,UACI,OACH,OACA,QAEN4jC,UAAWoiB,WACX/vC,SAAUgwC,WACRpxC,KACAzG,SAAWouB,OAqBf,SAASsb,KAAK19B,MAAOxE,MACnB,KAAMzX,gBAAgB25C,MACpB,MAAM,IAAI5yC,MAAM,oDAGlB,GAAMkV,cAAyC8rC,UAAU9rC,SAAUiW,UAAUjW,OAC3E,MAAM,IAAIJ,UAAU,kGAGtB,QAAa1a,IAATsW,OAAuC,iBAATA,MAA8B,KAATA,MACrD,MAAM,IAAIoE,UAAU,yDAGtB,QAAa1a,IAATsW,KAAoB,CACtB,IAAI1D,EAAI4lC,KAAK33C,MAAMyV,MACnBzX,KAAKgoD,MAAQj0C,EAAEi0C,MACfhoD,KAAKioD,WAAal0C,EAAEk0C,UACtB,KAAO,CACLjoD,KAAKgoD,MAAQ,CAAC,CACZ/P,KAAMiQ,UACNvgC,OAAQwgC,SAASC,KAEjBC,MAAO,IAETroD,KAAKioD,WAAa,GAElB,IAAK,IAAIrmD,EAAI,EAAGA,EAAI0mD,gBAAgB/mD,OAAQK,IAC1C5B,KAAKioD,WAAWrmD,GAAK,CAEzB,CAEA5B,KAAKic,MAAQA,YAAwCjc,KAAK67C,WAAW5/B,OAAS,KAC9Ejc,KAAK85C,WAAY,EAMjB95C,KAAKuoD,6BAA8B,CACrC,CAWA,SAASC,iBACP,KAAa,MAAN3mD,GAAmB,OAANA,GAClBq5B,MAEJ,CAMA,SAASutB,QAAQ5mD,GACf,OAAOA,GAAK,KAAOA,GAAK,GAC1B,CAEA,SAASq5B,OACP3jB,QACA1V,EAAI02B,KAAK1wB,OAAO0P,MAClB,CAEA,SAASmxC,OAAO3B,UACdxvC,MAAQwvC,SACRllD,EAAI02B,KAAK1wB,OAAO0P,MAClB,CAEA,SAASoxC,cACP,IAAItqB,OAAS,GACT0oB,SAAWxvC,MASf,GAPU,MAAN1V,EACFq5B,OACe,MAANr5B,IACTw8B,QAAUx8B,EACVq5B,SA1BJ,SAAoBr5B,GAClB,OAAOA,GAAK,KAAOA,GAAK,KAAa,MAANA,CACjC,CA2BO+mD,CAAW/mD,GAGd,OADA6mD,OAAO3B,UACA,KAIT,GAAU,MAANllD,GAIF,GAHAw8B,QAAUx8B,EACVq5B,QAEKutB,QAAQ5mD,GAGX,OADA6mD,OAAO3B,UACA,SAEJ,CACL,KAAO0B,QAAQ5mD,IACbw8B,QAAUx8B,EACVq5B,OAGQ,MAANr5B,IACFw8B,QAAUx8B,EACVq5B,OAEJ,CAEA,KAAOutB,QAAQ5mD,IACbw8B,QAAUx8B,EACVq5B,OAIF,GAAU,MAANr5B,GAAmB,MAANA,EAAW,CAE1B,IAAIgnD,gBAAkB,GAClBC,eAAiBvxC,MAUrB,GATAsxC,iBAAmBhnD,EACnBq5B,OAEU,MAANr5B,GAAmB,MAANA,IACfgnD,iBAAmBhnD,EACnBq5B,SAIGutB,QAAQ5mD,GAGX,OADA6mD,OAAOI,gBACAzqB,OAMT,IAFAA,QAAkBwqB,gBAEXJ,QAAQ5mD,IACbw8B,QAAUx8B,EACVq5B,MAEJ,CAEA,OAAOmD,MACT,CAEA,SAAS0qB,YAGP,IAFA,IAAIC,SAAW,GAERP,QAAQ5mD,IAAM83C,KAAKsP,aAAapnD,IACrCmnD,UAAYnnD,EACZq5B,OAIF,IAAIguB,OAASF,SAASnhD,OAAO,GAE7B,OAAI8xC,KAAKsP,aAAaC,QACbF,SAEA,IAEX,CAEA,SAASG,eAAeC,QACtB,OAAIvnD,IAAMunD,QACRluB,OACOkuB,QAEA,IAEX,CAlIAzP,KAAK13C,UAAU8Z,KAAO,OACtB49B,KAAK13C,UAAUowB,QAAS,EA8IxBsnB,KAAK33C,MAAQ,SAAUyE,IAAK4kB,SAM1B,GALAA,QAAUA,SAAW,CAAC,EAEtB9T,OAAS,EACT1V,EAAI,GAEgB,iBAJpB02B,KAAO9xB,KAKL,MAAM,IAAIoV,UAAU,mDAGtB,IAAIo8B,KAAO,IAAI0B,KACf1B,KAAK+P,MAAQ,GACb,IAAIqB,uBAAyB,EACzBC,eAAgB,EAapBpuB,OACAstB,iBAEA,IAAInwB,SAAWswB,cACX1sC,MAAQ,KAEZ,GAAIoc,SAAU,CACZ,GAAsB,cAAlBpkB,OAAOoqB,OACTpiB,MAAQ,IAAI4rC,WAAWxvB,eAClB,GAAsB,aAAlBpkB,OAAOoqB,OAChB,IAEEpiB,MAAQ,IAAI6rC,UAAUzvB,SAGxB,CAFE,MAAO/Y,KACPrD,MAAQla,WAAWs2B,SACrB,MAGApc,MAAQla,WAAWs2B,UAGrBmwB,iBAGIW,eAAe,MACjBE,uBAAyB,EACzBC,eAAgB,GACPH,eAAe,OACxBE,wBAA0B,EAC1BC,eAAgB,EAEpB,CAOA,IAJA,IAAIC,qBAAuB,GAEvBC,4BAA8B,IAErB,CAIX,IAHAhB,iBAGa,MAAN3mD,GACL0nD,qBAAqBz7C,KAAKu7C,wBAC1BG,6BAA+BH,uBAC/BA,uBAAyB,EACzBnuB,OACAstB,iBAIF,IAAIiB,UAAO,EAEX,IAAI5nD,EASF,MARA,IAAI6nD,KAAO7nD,EAGX,GAAa,QAFb4nD,KAAOV,aAGL,MAAM,IAAIxoD,YAAY,eAAiBmpD,KAAO,SAAWnxB,KAAO,cAAgBhhB,MAAMjO,YAQ1F,IAAI/F,IAAMomD,UAAUF,MAEpB,GAAY,OAARlmD,IAEF,MAAM,IAAIhD,YAAY,SAAWkpD,KAAO,gBAG1C,IAAIpB,MAAQgB,uBAAyBG,4BAIrC,GAFAhB,iBAEIW,eAAe,KAAM,CACvBX,iBACA,IAAI70C,EAAIg1C,cAER,GAAU,OAANh1C,EAEF,MAAM,IAAIpT,YAAY,OAASkG,IAAM,sDAGvC4hD,OAAS10C,CACX,CAGAskC,KAAK+P,MAAMl6C,KAAK,CACdmqC,KAAM10C,IAAI00C,KACVtwB,OAAQpkB,IAAIokB,OACZ0gC,QAGF,IAAK,IAAIzmD,EAAI,EAAGA,EAAI0mD,gBAAgB/mD,OAAQK,IAC1Cq2C,KAAKgQ,WAAWrmD,KAAO2B,IAAI00C,KAAKgQ,WAAWrmD,IAAM,GAAKymD,MAOxD,IAFAG,iBAEa,MAAN3mD,GAAW,CAChB,GAAoC,IAAhC0nD,qBAAqBhoD,OACvB,MAAM,IAAIhB,YAAY,qBAAuBg4B,KAAO,cAAgBhhB,MAAMjO,YAG5EkgD,6BAA+BD,qBAAqBx7C,MACpDmtB,OACAstB,gBACF,CAoBA,GAhBAc,eAAgB,EAEZH,eAAe,MAEjBE,uBAAyB,EACzBC,eAAgB,GACPH,eAAe,MAExBE,wBAA0B,EAC1BC,eAAgB,GAGhBD,uBAAyB,EAIvB9lD,IAAI00C,KAAK7qC,KAAM,CACjB,IAAIw8C,QAAUrmD,IAAI00C,KAAK7qC,KAAK+I,IAC5B0zC,aAAaC,KAAKF,SAAW,CAC3B3R,KAAM10C,IAAI00C,KACVtwB,OAAQpkB,IAAIokB,OAEhB,CACF,CAKA,GAFA6gC,iBAEI3mD,EACF,MAAM,IAAItB,YAAY,qBAAuBkG,IAAM,KAIrD,GAAI6iD,cACF,MAAM,IAAI/oD,YAAY,yBAA2BkG,IAAM,KAIzD,GAAoC,IAAhC8iD,qBAAqBhoD,OACvB,MAAM,IAAIhB,YAAY,qBAAuBg4B,KAAO,KAItD,GAA0B,IAAtB0f,KAAK+P,MAAMzmD,SAAiB8pB,QAAQ0+B,aACtC,MAAM,IAAIxpD,YAAY,IAAMkG,IAAM,uBAIpC,OADAwxC,KAAKh8B,WAAkB9a,IAAV8a,MAAsBg8B,KAAK4D,WAAW5/B,OAAS,KACrDg8B,IACT,EAQA0B,KAAK13C,UAAUgT,MAAQ,WACrB,IAAIgjC,KAAO,IAAI0B,KACf1B,KAAK6B,UAAY95C,KAAK85C,UACtB7B,KAAKsQ,4BAA8BvoD,KAAKuoD,4BACxCtQ,KAAKh8B,MAAQhH,MAAMjV,KAAKic,OACxBg8B,KAAKgQ,WAAajoD,KAAKioD,WAAW79C,MAAM,GACxC6tC,KAAK+P,MAAQ,GAEb,IAAK,IAAIpmD,EAAI,EAAGA,EAAI5B,KAAKgoD,MAAMzmD,OAAQK,IAGrC,IAAK,IAAI+R,KAFTskC,KAAK+P,MAAMpmD,GAAK,CAAC,EAEH5B,KAAKgoD,MAAMpmD,GACnB,sBAAe5B,KAAKgoD,MAAMpmD,GAAI+R,KAChCskC,KAAK+P,MAAMpmD,GAAG+R,GAAK3T,KAAKgoD,MAAMpmD,GAAG+R,IAKvC,OAAOskC,IACT,EAQA0B,KAAK13C,UAAU+nD,WAAa,WAC1B,OAA0B,IAAtBhqD,KAAKgoD,MAAMzmD,SAIRvB,KAAKgoD,MAAMzmD,OAAS,GAAKpB,KAAKS,IAAIZ,KAAKgoD,MAAM,GAAGK,MAAQ,GAAO,MACxE,EAUA1O,KAAK13C,UAAU45C,WAAa,SAAU5/B,OACpC,IAAIguC,UAAWC,WAAYC,UAAWC,gBAClC5tC,QAEJ,GAAIP,aAA+D,IAAtBjc,KAAKgoD,MAAMzmD,OACtD,OAAO0a,MACF,GAAIjc,KAAKgqD,aAAc,CAG5B,IAAIzmD,IAAM0Y,MACVO,QAAUm9B,KAAK0Q,oBAAoB,UAAOpuC,QAE1C,IAAK,IAAIra,EAAI,EAAGA,EAAI5B,KAAKgoD,MAAMzmD,OAAQK,IACrCqoD,UAAYztC,QAAQxc,KAAKgoD,MAAMpmD,GAAGq2C,KAAKh8B,OACvCmuC,gBAAkB5tC,QAAQxc,KAAKgoD,MAAMpmD,GAAG+lB,OAAO1L,OAC/CkuC,UAAY3tC,QAAQxc,KAAKgoD,MAAMpmD,GAAGymD,OAClC9kD,IAAM6+C,eAAe7+C,IAAKnB,IAAIggD,eAAe6H,UAAWG,iBAAkBD,YAG5E,OAAO5mD,GACT,CAOE,OAHA0mD,WAFAztC,QAAUm9B,KAAK0Q,oBAAoB,UAAOpuC,SAEtBjc,KAAKgoD,MAAM,GAAG/P,KAAKh8B,OACvCiuC,WAAa1tC,QAAQxc,KAAKgoD,MAAM,GAAG/P,KAAKl3B,QACxCqpC,gBAAkB5tC,QAAQxc,KAAKgoD,MAAM,GAAGrgC,OAAO1L,OACxCmmC,eAAeD,UAAUlmC,MAAOiuC,YAAa9H,eAAe6H,UAAWG,iBAElF,EAWAzQ,KAAK13C,UAAUqoD,aAAe,SAAUruC,MAAOsuC,aAC7C,IAAIN,UAAWC,WAAYC,UAAWC,gBAClC5tC,QAEJ,GAAIP,aAA+D,IAAtBjc,KAAKgoD,MAAMzmD,OACtD,OAAO0a,MACF,GAAIjc,KAAKgqD,aAAc,CAI5B,IAAIzmD,IAAM0Y,MACVO,QAAUm9B,KAAK0Q,oBAAoB,UAAOpuC,QAE1C,IAAK,IAAIra,EAAI,EAAGA,EAAI5B,KAAKgoD,MAAMzmD,OAAQK,IACrCqoD,UAAYztC,QAAQxc,KAAKgoD,MAAMpmD,GAAGq2C,KAAKh8B,OACvCmuC,gBAAkB5tC,QAAQxc,KAAKgoD,MAAMpmD,GAAG+lB,OAAO1L,OAC/CkuC,UAAY3tC,QAAQxc,KAAKgoD,MAAMpmD,GAAGymD,OAClC9kD,IAAMinD,aAAajnD,IAAKnB,IAAIggD,eAAe6H,UAAWG,iBAAkBD,YAG1E,OAAO5mD,GACT,CAQE,OAJA0mD,WAFAztC,QAAUm9B,KAAK0Q,oBAAoB,UAAOpuC,SAEtBjc,KAAKgoD,MAAM,GAAG/P,KAAKh8B,OACvCmuC,gBAAkB5tC,QAAQxc,KAAKgoD,MAAM,GAAGrgC,OAAO1L,OAC/CiuC,WAAa1tC,QAAQxc,KAAKgoD,MAAM,GAAG/P,KAAKl3B,QAG/B9P,SAASu5C,aAAaA,aAAavuC,MAAOguC,WAD/CM,kBAC2DH,gBAEAG,aAFkBL,WAKrF,EAWA,IAAIP,UAAYvC,SAAQ3gD,MAEtB,GAAI,sBAAegkD,MAAOhkD,KAAM,CAC9B,IAAIwxC,KAAOwS,MAAMhkD,KAEjB,MAAO,CACLwxC,KACAtwB,OAHWswB,KAAKyS,SAAS,IAK7B,CAEA,IAAK,IAAIlrC,SAASirC,MAChB,GAAI,sBAAeA,MAAOjrC,QACpB8Y,SAAS7xB,IAAK+Y,OAAQ,CACxB,IAAImrC,MAAQF,MAAMjrC,OACdorC,UAAYnkD,IAAIlF,OAASie,MAAMje,OAC/BspD,WAAapkD,IAAI6M,UAAU,EAAGs3C,WAE9BE,QAAU,sBAAeH,MAAMD,SAAUG,YAAcF,MAAMD,SAASG,iBAAc1pD,EAExF,QAAgBA,IAAZ2pD,QAEF,MAAO,CACL7S,KAAM0S,MACNhjC,OAAQmjC,QAGd,CAIJ,OAAO,IAAI,GACV,CACDxD,OAAQ30C,MAAQA,KAAK,GACrBi0C,MAAO,MA0LT,SAASmE,qBAAqB9S,MAC5B,OAAIA,KAAKrR,UAAUokB,WAAW5C,OAAwB,OAAfnQ,KAAKh8B,QAAmBhI,OAAOqqB,YAC7D2Z,KAAKh8B,MAELg8B,IAEX,CApLA0B,KAAKsR,gBAAkB,SAAUxzC,MAC/B,OAA2B,OAApBkyC,UAAUlyC,KACnB,EASAkiC,KAAK13C,UAAU8jC,QAAU,SAAU34B,MAKjC,GAJoB,iBAATA,OACTA,KAAO49C,WAAW59C,QAGfA,KACH,OAAO,EAIT,IAAK,IAAIxL,EAAI,EAAGA,EAAI0mD,gBAAgB/mD,OAAQK,IAC1C,GAAIzB,KAAKS,KAAKZ,KAAKioD,WAAWrmD,IAAM,IAAMwL,KAAK66C,WAAWrmD,IAAM,IAAM,MACpE,OAAO,EAIX,OAAO,CACT,EAUA+3C,KAAK13C,UAAU2kC,UAAY,SAAUlF,OAEnC,IAAK,IAAI9/B,EAAI,EAAGA,EAAI0mD,gBAAgB/mD,OAAQK,IAC1C,GAAIzB,KAAKS,KAAKZ,KAAKioD,WAAWrmD,IAAM,IAAM8/B,MAAMumB,WAAWrmD,IAAM,IAAM,MACrE,OAAO,EAIX,OAAO,CACT,EASA+3C,KAAK13C,UAAU4I,OAAS,SAAU62B,OAChC,OAAO1hC,KAAK4mC,UAAUlF,QAAUsT,MAAMh1C,KAAKic,MAAOylB,MAAMzlB,MAC1D,EASA09B,KAAK13C,UAAUyyC,SAAW,SAAUhT,OAGlC,IAFA,IAAIn+B,IAAMvD,KAAKiV,QAENrT,EAAI,EAAGA,EAAI0mD,gBAAgB/mD,OAAQK,IAE1C2B,IAAI0kD,WAAWrmD,IAAM5B,KAAKioD,WAAWrmD,IAAM,IAAM8/B,MAAMumB,WAAWrmD,IAAM,GAI1E,IAAK,IAAIunC,GAAK,EAAGA,GAAKzH,MAAMsmB,MAAMzmD,OAAQ4nC,KAAM,CAE9C,IAAI+hB,SAAW,kBAAc,CAAC,EAAGxpB,MAAMsmB,MAAM7e,KAE7C5lC,IAAIykD,MAAMl6C,KAAKo9C,SACjB,CAGA,GAAmB,OAAflrD,KAAKic,OAAkC,OAAhBylB,MAAMzlB,MAAgB,CAC/C,IAAIkvC,QAAyB,OAAfnrD,KAAKic,MAAiBjc,KAAK67C,WAAW,GAAK77C,KAAKic,MAC1DmvC,SAA2B,OAAhB1pB,MAAMzlB,MAAiBylB,MAAMma,WAAW,GAAKna,MAAMzlB,MAClE1Y,IAAI0Y,MAAQmmC,eAAe+I,QAASC,SACtC,MACE7nD,IAAI0Y,MAAQ,KAId,OADA1Y,IAAIglD,6BAA8B,EAC3BwC,qBAAqBxnD,IAC9B,EASAo2C,KAAK13C,UAAUoI,OAAS,SAAUq3B,OAGhC,IAFA,IAAIn+B,IAAMvD,KAAKiV,QAENrT,EAAI,EAAGA,EAAI0mD,gBAAgB/mD,OAAQK,IAE1C2B,IAAI0kD,WAAWrmD,IAAM5B,KAAKioD,WAAWrmD,IAAM,IAAM8/B,MAAMumB,WAAWrmD,IAAM,GAI1E,IAAK,IAAI0nC,IAAM,EAAGA,IAAM5H,MAAMsmB,MAAMzmD,OAAQ+nC,MAAO,CAEjD,IAAI4hB,SAAW,kBAAc,kBAAc,CAAC,EAAGxpB,MAAMsmB,MAAM1e,MAAO,CAAC,EAAG,CACpE+e,OAAQ3mB,MAAMsmB,MAAM1e,KAAK+e,QAG3B9kD,IAAIykD,MAAMl6C,KAAKo9C,SACjB,CAGA,GAAmB,OAAflrD,KAAKic,OAAkC,OAAhBylB,MAAMzlB,MAAgB,CAC/C,IAAIkvC,QAAyB,OAAfnrD,KAAKic,MAAiBjc,KAAK67C,WAAW,GAAK77C,KAAKic,MAC1DmvC,SAA2B,OAAhB1pB,MAAMzlB,MAAiBylB,MAAMma,WAAW,GAAKna,MAAMzlB,MAClE1Y,IAAI0Y,MAAQuuC,aAAaW,QAASC,SACpC,MACE7nD,IAAI0Y,MAAQ,KAId,OADA1Y,IAAIglD,6BAA8B,EAC3BwC,qBAAqBxnD,IAC9B,EASAo2C,KAAK13C,UAAUG,IAAM,SAAUuR,GAG7B,IAFA,IAAIpQ,IAAMvD,KAAKiV,QAENrT,EAAI,EAAGA,EAAI0mD,gBAAgB/mD,OAAQK,IAE1C2B,IAAI0kD,WAAWrmD,IAAM5B,KAAKioD,WAAWrmD,IAAM,GAAK+R,EAIlD,IAAK,IAAI61B,IAAM,EAAGA,IAAMjmC,IAAIykD,MAAMzmD,OAAQioC,MACxCjmC,IAAIykD,MAAMxe,KAAK6e,OAAS10C,EAc1B,OAXkB,OAAdpQ,IAAI0Y,MACN1Y,IAAI0Y,MAAQ7Z,IAAImB,IAAI0Y,MAAOtI,GAM3BpQ,IAAI0Y,MAAQ,KAGd1Y,IAAIglD,6BAA8B,EAC3BwC,qBAAqBxnD,IAC9B,EAuBAo2C,KAAK13C,UAAUrB,IAAM,WAGnB,IAAIuD,IAAMnE,KAAKiV,QAGf,IAAK,IAAIrT,KAFTuC,IAAI8X,MAAsB,OAAd9X,IAAI8X,MAAiBrb,IAAIuD,IAAI8X,OAAS,KAEpC9X,IAAI6jD,MACe,OAA3B7jD,IAAI6jD,MAAMpmD,GAAGq2C,KAAKxgC,MAA4C,QAA3BtT,IAAI6jD,MAAMpmD,GAAGq2C,KAAKxgC,OACvDtT,IAAI6jD,MAAMpmD,GAAGq2C,KAAOwS,MAAMY,GAI9B,OAAOlnD,GACT,EASAw1C,KAAK13C,UAAU0a,GAAK,SAAUs+B,eAC5B,IAAIvZ,MACAzlB,MAAuB,OAAfjc,KAAKic,MAAiBjc,KAAK67C,WAAW,GAAK77C,KAAKic,MAE5D,GAA6B,iBAAlBg/B,cAA4B,CAIrC,GAFAvZ,MAAQiY,KAAK33C,MAAMi5C,gBAEdj7C,KAAK4mC,UAAUlF,OAClB,MAAM,IAAI36B,MAAM,wBAAwB8W,OAAO6jB,MAAMp4B,WAAY,UAAUuU,OAAO7d,KAAKsJ,WAAY,OAGrG,GAAoB,OAAhBo4B,MAAMzlB,MACR,MAAM,IAAIlV,MAAM,yCAMlB,OAHA26B,MAAMzlB,MAAQhH,MAAMgH,OACpBylB,MAAMoY,WAAY,EAClBpY,MAAM6mB,6BAA8B,EAC7B7mB,KACT,CAAO,GAAIrP,OAAO4oB,eAAgB,CAChC,IAAKj7C,KAAK4mC,UAAUqU,eAClB,MAAM,IAAIl0C,MAAM,wBAAwB8W,OAAOo9B,cAAc3xC,WAAY,UAAUuU,OAAO7d,KAAKsJ,WAAY,OAG7G,GAA4B,OAAxB2xC,cAAch/B,MAChB,MAAM,IAAIlV,MAAM,yCAOlB,OAJA26B,MAAQuZ,cAAchmC,SAChBgH,MAAQhH,MAAMgH,OACpBylB,MAAMoY,WAAY,EAClBpY,MAAM6mB,6BAA8B,EAC7B7mB,KACT,CACE,MAAM,IAAI36B,MAAM,uCAEpB,EAUA4yC,KAAK13C,UAAUgO,SAAW,SAAUgrC,eAClC,OAAOhrC,SAASjQ,KAAKsrD,UAAUrQ,eACjC,EASAtB,KAAK13C,UAAUqpD,UAAY,SAAUrQ,eACnC,IAAIvZ,MASJ,OALEA,MAFEuZ,cAEMj7C,KAAK2c,GAAGs+B,eAERj7C,KAAKiV,SAGL+0C,cAAuC,IAAvBtoB,MAAMsmB,MAAMzmD,OAC7BmgC,MAAM4oB,aAAa5oB,MAAMzlB,OAEzBylB,MAAM4oB,aAAa5oB,MAAMzlB,MAAOylB,MAAMsmB,MAAM,GAAGrgC,OAAO1L,MAEjE,EAQA09B,KAAK13C,UAAUqH,SAAW,WACxB,OAAOtJ,KAAKu2B,QACd,EASAojB,KAAK13C,UAAU2O,OAAS,WACtB,MAAO,CACLi0B,OAAQ,OACR5oB,MAAOjc,KAAKsqD,aAAatqD,KAAKic,OAC9Bg8B,KAAMj4C,KAAKurD,cACXzR,UAAW95C,KAAK85C,UAEpB,EAUAH,KAAKzU,SAAW,SAAUzH,MACxB,IAAIwa,KAAO,IAAI0B,KAAKlc,KAAKxhB,MAAOwhB,KAAKwa,MAErC,OADAA,KAAK6B,UAAYrc,KAAKqc,YAAa,EAC5B7B,IACT,EAQA0B,KAAK13C,UAAU0O,QAAUgpC,KAAK13C,UAAUqH,SAMxCqwC,KAAK13C,UAAUupD,SAAW,WACxB,IAGIC,aAcEC,aAjBFvnD,IAAMnE,KAAKiV,QACX02C,iBAAmB,GAIvB,IAAK,IAAIx1C,OAAOy1C,kBACd,GAAI,sBAAeA,kBAAmBz1C,MAChChS,IAAI4hC,QAAQilB,WAAW70C,MAAO,CAChCs1C,aAAet1C,IACf,KACF,CAIJ,GAAqB,SAAjBs1C,aACFtnD,IAAI6jD,MAAQ,QAWZ,GAPIyD,cAEE,sBAAeG,kBAAmBH,gBACpCC,aAAeE,kBAAkBH,eAIjCC,aACFvnD,IAAI6jD,MAAQ,CAAC,CACX/P,KAAMyT,aAAazT,KACnBtwB,OAAQ+jC,aAAa/jC,OACrB0gC,MAAO,QAEJ,CAML,IAFA,IAAIwD,gBAAiB,EAEZjqD,EAAI,EAAGA,EAAI0mD,gBAAgB/mD,OAAQK,IAAK,CAC/C,IAAIgoD,QAAUtB,gBAAgB1mD,GAE1BzB,KAAKS,IAAIuD,IAAI8jD,WAAWrmD,IAAM,GAAK,QACjC,sBAAegqD,kBAAmBhC,SACpC+B,iBAAiB79C,KAAK,CACpBmqC,KAAM2T,kBAAkBhC,SAAS3R,KACjCtwB,OAAQikC,kBAAkBhC,SAASjiC,OACnC0gC,MAAOlkD,IAAI8jD,WAAWrmD,IAAM,IAG9BiqD,gBAAiB,EAGvB,CAGIF,iBAAiBpqD,OAAS4C,IAAI6jD,MAAMzmD,SAAWsqD,iBAEjD1nD,IAAI6jD,MAAQ2D,iBAEhB,CAGF,OAAOxnD,GACT,EAMAw1C,KAAK13C,UAAU6pD,KAAO,WAMpB,IALA,IAAI3nD,IAAMnE,KAAKiV,QACX02C,iBAAmB,GAId/pD,EAAI,EAAGA,EAAI0mD,gBAAgB/mD,OAAQK,IAAK,CAC/C,IAAIgoD,QAAUtB,gBAAgB1mD,GAE9B,GAAIzB,KAAKS,IAAIuD,IAAI8jD,WAAWrmD,IAAM,GAAK,MAAO,CAC5C,IAAI,sBAAeioD,aAAakC,GAAInC,SAOlC,MAAM,IAAI7iD,MAAM,8BAAgC6iD,QAAU,gBAN1D+B,iBAAiB79C,KAAK,CACpBmqC,KAAM4R,aAAakC,GAAGnC,SAAS3R,KAC/BtwB,OAAQkiC,aAAakC,GAAGnC,SAASjiC,OACjC0gC,MAAOlkD,IAAI8jD,WAAWrmD,IAAM,GAKlC,CACF,CAMA,OAHAuC,IAAI6jD,MAAQ2D,iBACZxnD,IAAI21C,WAAY,EAChB31C,IAAIokD,6BAA8B,EAC3BpkD,GACT,EAQAw1C,KAAK13C,UAAUspD,YAAc,WAM3B,IALA,IAAIS,OAAS,GACTC,OAAS,GACTC,KAAO,EACPC,KAAO,EAEFvqD,EAAI,EAAGA,EAAI5B,KAAKgoD,MAAMzmD,OAAQK,IACjC5B,KAAKgoD,MAAMpmD,GAAGymD,MAAQ,GACxB6D,OACAF,QAAU,IAAMhsD,KAAKgoD,MAAMpmD,GAAG+lB,OAAOlQ,KAAOzX,KAAKgoD,MAAMpmD,GAAGq2C,KAAKxgC,KAE3DtX,KAAKS,IAAIZ,KAAKgoD,MAAMpmD,GAAGymD,MAAQ,GAAO,QACxC2D,QAAU,IAAMhsD,KAAKgoD,MAAMpmD,GAAGymD,QAEvBroD,KAAKgoD,MAAMpmD,GAAGymD,MAAQ,GAC/B8D,OAIJ,GAAIA,KAAO,EACT,IAAK,IAAIC,IAAM,EAAGA,IAAMpsD,KAAKgoD,MAAMzmD,OAAQ6qD,MACrCpsD,KAAKgoD,MAAMoE,KAAK/D,MAAQ,IACtB6D,KAAO,GACTD,QAAU,IAAMjsD,KAAKgoD,MAAMoE,KAAKzkC,OAAOlQ,KAAOzX,KAAKgoD,MAAMoE,KAAKnU,KAAKxgC,KAE/DtX,KAAKS,IAAIZ,KAAKgoD,MAAMoE,KAAK/D,MAAQ,GAAO,QAC1C4D,QAAU,KAAOjsD,KAAKgoD,MAAMoE,KAAK/D,SAGnC4D,QAAU,IAAMjsD,KAAKgoD,MAAMoE,KAAKzkC,OAAOlQ,KAAOzX,KAAKgoD,MAAMoE,KAAKnU,KAAKxgC,KACnEw0C,QAAU,IAAMjsD,KAAKgoD,MAAMoE,KAAK/D,QAOxC2D,OAASA,OAAOhhB,OAAO,GACvBihB,OAASA,OAAOjhB,OAAO,GAEnBkhB,KAAO,GAAKC,KAAO,IACrBH,OAAS,IAAMA,OAAS,KAGtBG,KAAO,GAAKD,KAAO,IACrBD,OAAS,IAAMA,OAAS,KAG1B,IAAIxlD,IAAMulD,OAOV,OALIE,KAAO,GAAKC,KAAO,IACrB1lD,KAAO,OAGTA,KAAOwlD,MAET,EAYAtS,KAAK13C,UAAUs0B,OAAS,SAAUlL,SAGhC,IAAIghC,KAAOrsD,KAAKuoD,6BAA8C,OAAfvoD,KAAKic,MAAiBjc,KAAKiV,QAAUjV,KAAKwrD,WAErFc,aAAc,EAOlB,IAAK,IAAI1qD,UALiB,IAAfyqD,KAAKpwC,OAAwC,OAAfowC,KAAKpwC,OAAkBiW,UAAUm6B,KAAKpwC,SAE7EqwC,YAAcnsD,KAAKS,IAAIyrD,KAAKpwC,MAAM1Z,IAAM,OAG5B8pD,KAAKrE,MACb,sBAAeqE,KAAKrE,MAAOpmD,IACzByqD,KAAKrE,MAAMpmD,GAAGq2C,OACgB,OAA5BoU,KAAKrE,MAAMpmD,GAAGq2C,KAAKxgC,MAAiB60C,YACtCD,KAAKrE,MAAMpmD,GAAGq2C,KAAOwS,MAAM8B,IACU,QAA5BF,KAAKrE,MAAMpmD,GAAGq2C,KAAKxgC,MAAmB60C,cAC/CD,KAAKrE,MAAMpmD,GAAGq2C,KAAOwS,MAAM+B,KAQT,IAAtBH,KAAKrE,MAAMzmD,QAAiB8qD,KAAKvS,WAG/B35C,KAAKS,IAAIyrD,KAAKrE,MAAM,GAAGK,MAAQloD,KAAK+D,MAAMmoD,KAAKrE,MAAM,GAAGK,QAAU,QAEpEgE,KAAKrE,MAAM,GAAGrgC,OAAS0kC,KAAKI,eAIhC,IAAIxwC,MAAQowC,KAAK/B,aAAa+B,KAAKpwC,OAE/BxV,IAAqB,OAAf4lD,KAAKpwC,MAAiBsa,OAAOta,MAAOoP,SAAW,CAAC,GAAK,GAC3DqhC,QAAUL,KAAKd,cAWnB,OATIc,KAAKpwC,OAASiW,UAAUm6B,KAAKpwC,SAC/BxV,IAAM,IAAMA,IAAM,KAGhBimD,QAAQnrD,OAAS,GAAKkF,IAAIlF,OAAS,IACrCkF,KAAO,KAGTA,KAAOimD,OAET,EASA/S,KAAK13C,UAAUwqD,YAAc,WAC3B,GAA0B,IAAtBzsD,KAAKgoD,MAAMzmD,OACb,MAAM,IAAIwF,MAAM,4GAGlB,GAAI5G,KAAKS,IAAIZ,KAAKgoD,MAAM,GAAGK,MAAQloD,KAAK+D,MAAMlE,KAAKgoD,MAAM,GAAGK,SAAW,MACrE,MAAM,IAAIthD,MAAM,4GAUlB,IAAI4lD,SAA0B,OAAf3sD,KAAKic,MAAiBrb,IAAIZ,KAAKic,OAAS,EACnD2wC,aAAehsD,IAAIZ,KAAKgoD,MAAM,GAAG/P,KAAKh8B,OACtC4wC,WAAa7sD,KAAKgoD,MAAM,GAAGrgC,OAE/B,GAAiB,IAAbglC,SACF,OAAOE,WAGT,IAAIxE,MAAQroD,KAAKgoD,MAAM,GAAGK,MACtByE,SAAW3sD,KAAKW,IAAI6rD,SAAWxsD,KAAKiC,IAAIyqD,WAAW5wC,MAAQ2wC,aAAcvE,QAAUloD,KAAKyE,KAAO,IACnG,GAAIkoD,UAAY,UAAYA,SAAW,SAAU,OAAOD,WAExDC,SAAW3sD,KAAKS,IAAIksD,UACpB,IAAIpC,SAAW1qD,KAAKgoD,MAAM,GAAG/P,KAAKyS,SAElC,IAAK,IAAI/2C,KAAK+2C,SACZ,GAAI,sBAAeA,SAAU/2C,GAAI,CAC/B,IAAIgU,OAAS+iC,SAAS/2C,GAEtB,GAAIgU,OAAOolC,WAAY,CACrB,IAAI/0B,KAAO73B,KAAKS,IAAIT,KAAKW,IAAI6rD,SAAWxsD,KAAKiC,IAAIulB,OAAO1L,MAAQ2wC,aAAcvE,QAAUloD,KAAKyE,KAAO,MAEhGozB,KAAO80B,UAAY90B,OAAS80B,UAAYnlC,OAAOlQ,KAAKlW,OAASsrD,WAAWp1C,KAAKlW,UAG/EsrD,WAAallC,OACbmlC,SAAW90B,KAEf,CACF,CAGF,OAAO60B,UACT,EAgBAlT,KAAK13C,UAAU+qD,UAAY,SAAUjS,OAInC,IAHA,IAAI76C,EAAIF,KAAKiV,QACT9Q,IAAM,GAEDvC,EAAI,EAAGA,EAAIm5C,MAAMx5C,SAExBrB,EAAIA,EAAEyc,GAAGo+B,MAAMn5C,IACXA,IAAMm5C,MAAMx5C,OAAS,GAHOK,IAAK,CAKrC,IAAIqrD,SAAW/sD,EAAEorD,YAGb4B,SAAWhpD,MAAM+oD,UAUjBjqD,EAAI,IAAI22C,KARQ3E,MAAMkY,SAAUD,UAGzBC,SAEApX,IAAI51C,EAAEorD,aAGQvQ,MAAMn5C,GAAG0H,YAClCnF,IAAI2J,KAAK9K,GACT9C,EAAI+Q,SAAS/Q,EAAG8C,EAClB,CAQA,IAFA,IAAImqD,QAAU,EAELnjB,IAAM,EAAGA,IAAM7lC,IAAI5C,OAAQyoC,MAClCmjB,QAAUhL,UAAUgL,QAAShpD,IAAI6lC,KAAK/tB,OAQxC,OALI+4B,MAAMmY,QAASntD,KAAKic,SACtB/b,EAAE+b,MAAQ,GAGZ9X,IAAI2J,KAAK5N,GACFiE,GACT,EAEA,IAAIgkD,SAAW,CACbC,KAAM,CACJ,GAAI,CACF3wC,KAAM,GACNwE,MAAO,EACP8wC,YAAY,IAGhBK,MAAO,CACL,GAAI,CACF31C,KAAM,GACNwE,MAAO,EACP8wC,YAAY,GAEdM,GAAI,CACF51C,KAAM,KACNwE,MAAO,GACP8wC,YAAY,GAEdxjB,EAAG,CACD9xB,KAAM,IACNwE,MAAO,IACP8wC,YAAY,GAEdzmD,EAAG,CACDmR,KAAM,IACNwE,MAAO,IACP8wC,YAAY,GAEdz0C,EAAG,CACDb,KAAM,IACNwE,MAAO,IACP8wC,YAAY,GAEdO,EAAG,CACD71C,KAAM,IACNwE,MAAO,IACP8wC,YAAY,GAEdQ,EAAG,CACD91C,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEd5mD,EAAG,CACDsR,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEd3oD,EAAG,CACDqT,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdS,EAAG,CACD/1C,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdU,EAAG,CACDh2C,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEd5qD,EAAG,CACDsV,KAAM,IACNwE,MAAO,GACP8wC,YAAY,GAEdlrD,EAAG,CACD4V,KAAM,IACNwE,MAAO,IACP8wC,YAAY,GAEdjjD,EAAG,CACD2N,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdh5C,EAAG,CACD0D,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdhjD,EAAG,CACD0N,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdp5C,EAAG,CACD8D,KAAM,IACNwE,MAAO,MACP8wC,YAAY,GAEdvmB,EAAG,CACD/uB,KAAM,IACNwE,MAAO,MACP8wC,YAAY,GAEdtsD,EAAG,CACDgX,KAAM,IACNwE,MAAO,MACP8wC,YAAY,GAEd7rD,EAAG,CACDuW,KAAM,IACNwE,MAAO,MACP8wC,YAAY,GAEd/pD,EAAG,CACDyU,KAAM,IACNwE,MAAO,MACP8wC,YAAY,IAGhBW,KAAM,CACJ,GAAI,CACFj2C,KAAM,GACNwE,MAAO,EACP8wC,YAAY,GAEdY,KAAM,CACJl2C,KAAM,OACNwE,MAAO,GACP8wC,YAAY,GAEda,MAAO,CACLn2C,KAAM,QACNwE,MAAO,IACP8wC,YAAY,GAEdc,KAAM,CACJp2C,KAAM,OACNwE,MAAO,IACP8wC,YAAY,GAEde,KAAM,CACJr2C,KAAM,OACNwE,MAAO,IACP8wC,YAAY,GAEdgB,KAAM,CACJt2C,KAAM,OACNwE,MAAO,IACP8wC,YAAY,GAEdiB,KAAM,CACJv2C,KAAM,OACNwE,MAAO,KACP8wC,YAAY,GAEdkB,KAAM,CACJx2C,KAAM,OACNwE,MAAO,KACP8wC,YAAY,GAEdmB,IAAK,CACHz2C,KAAM,MACNwE,MAAO,KACP8wC,YAAY,GAEdoB,MAAO,CACL12C,KAAM,QACNwE,MAAO,KACP8wC,YAAY,GAEdqB,MAAO,CACL32C,KAAM,QACNwE,MAAO,KACP8wC,YAAY,GAEdsB,KAAM,CACJ52C,KAAM,OACNwE,MAAO,GACP8wC,YAAY,GAEduB,MAAO,CACL72C,KAAM,QACNwE,MAAO,IACP8wC,YAAY,GAEdwB,MAAO,CACL92C,KAAM,QACNwE,MAAO,KACP8wC,YAAY,GAEdyB,MAAO,CACL/2C,KAAM,QACNwE,MAAO,KACP8wC,YAAY,GAEd0B,KAAM,CACJh3C,KAAM,OACNwE,MAAO,KACP8wC,YAAY,GAEd2B,KAAM,CACJj3C,KAAM,OACNwE,MAAO,MACP8wC,YAAY,GAEd4B,MAAO,CACLl3C,KAAM,QACNwE,MAAO,MACP8wC,YAAY,GAEd6B,KAAM,CACJn3C,KAAM,OACNwE,MAAO,MACP8wC,YAAY,GAEd8B,MAAO,CACLp3C,KAAM,QACNwE,MAAO,MACP8wC,YAAY,GAEd+B,MAAO,CACLr3C,KAAM,QACNwE,MAAO,MACP8wC,YAAY,IAGhBgC,QAAS,CACP,GAAI,CACFt3C,KAAM,GACNwE,MAAO,EACP8wC,YAAY,GAEdM,GAAI,CACF51C,KAAM,KACNwE,MAAO,IACP8wC,YAAY,GAEdxjB,EAAG,CACD9xB,KAAM,IACNwE,MAAO,IACP8wC,YAAY,GAEdzmD,EAAG,CACDmR,KAAM,IACNwE,MAAO,IACP8wC,YAAY,GAEdz0C,EAAG,CACDb,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdO,EAAG,CACD71C,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdQ,EAAG,CACD91C,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEd5mD,EAAG,CACDsR,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEd3oD,EAAG,CACDqT,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdS,EAAG,CACD/1C,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdU,EAAG,CACDh2C,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEd5qD,EAAG,CACDsV,KAAM,IACNwE,MAAO,IACP8wC,YAAY,GAEdlrD,EAAG,CACD4V,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdjjD,EAAG,CACD2N,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdh5C,EAAG,CACD0D,KAAM,IACNwE,MAAO,MACP8wC,YAAY,GAEdhjD,EAAG,CACD0N,KAAM,IACNwE,MAAO,MACP8wC,YAAY,GAEdp5C,EAAG,CACD8D,KAAM,IACNwE,MAAO,MACP8wC,YAAY,GAEdvmB,EAAG,CACD/uB,KAAM,IACNwE,MAAO,MACP8wC,YAAY,GAEdtsD,EAAG,CACDgX,KAAM,IACNwE,MAAO,MACP8wC,YAAY,GAEd7rD,EAAG,CACDuW,KAAM,IACNwE,MAAO,MACP8wC,YAAY,GAEd/pD,EAAG,CACDyU,KAAM,IACNwE,MAAO,MACP8wC,YAAY,IAGhBiC,MAAO,CACL,GAAI,CACFv3C,KAAM,GACNwE,MAAO,EACP8wC,YAAY,GAEdM,GAAI,CACF51C,KAAM,KACNwE,MAAO,IACP8wC,YAAY,GAEdxjB,EAAG,CACD9xB,KAAM,IACNwE,MAAO,IACP8wC,YAAY,GAEdzmD,EAAG,CACDmR,KAAM,IACNwE,MAAO,IACP8wC,YAAY,GAEdz0C,EAAG,CACDb,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdO,EAAG,CACD71C,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdQ,EAAG,CACD91C,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEd5mD,EAAG,CACDsR,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEd3oD,EAAG,CACDqT,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdS,EAAG,CACD/1C,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdU,EAAG,CACDh2C,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEd5qD,EAAG,CACDsV,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdlrD,EAAG,CACD4V,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdjjD,EAAG,CACD2N,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdh5C,EAAG,CACD0D,KAAM,IACNwE,MAAO,MACP8wC,YAAY,GAEdhjD,EAAG,CACD0N,KAAM,IACNwE,MAAO,MACP8wC,YAAY,GAEdp5C,EAAG,CACD8D,KAAM,IACNwE,MAAO,MACP8wC,YAAY,GAEdvmB,EAAG,CACD/uB,KAAM,IACNwE,MAAO,MACP8wC,YAAY,GAEdtsD,EAAG,CACDgX,KAAM,IACNwE,MAAO,MACP8wC,YAAY,GAEd7rD,EAAG,CACDuW,KAAM,IACNwE,MAAO,MACP8wC,YAAY,GAEd/pD,EAAG,CACDyU,KAAM,IACNwE,MAAO,MACP8wC,YAAY,IAGhBkC,gBAAiB,CACf,GAAI,CACFx3C,KAAM,GACNwE,MAAO,EACP8wC,YAAY,GAEdzmD,EAAG,CACDmR,KAAM,IACNwE,MAAO,IACP8wC,YAAY,GAEdz0C,EAAG,CACDb,KAAM,IACNwE,MAAO,IACP8wC,YAAY,GAEdO,EAAG,CACD71C,KAAM,IACNwE,MAAO,IACP8wC,YAAY,GAEdQ,EAAG,CACD91C,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEd5mD,EAAG,CACDsR,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEd3oD,EAAG,CACDqT,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdS,EAAG,CACD/1C,KAAM,IACNwE,MAAO,KACP8wC,YAAY,GAEdU,EAAG,CACDh2C,KAAM,IACNwE,MAAO,KACP8wC,YAAY,IAGhBmC,iBAAkB,CAChB,GAAI,CACFz3C,KAAM,GACNwE,MAAO,EACP8wC,YAAY,GAEdoC,GAAI,CACF13C,KAAM,KACNwE,MAAO,KACP8wC,YAAY,GAEdqC,GAAI,CACF33C,KAAM,KACNwE,MAAO9b,KAAKiC,IAAI,KAAM,GACtB2qD,YAAY,GAEdsC,GAAI,CACF53C,KAAM,KACNwE,MAAO9b,KAAKiC,IAAI,KAAM,GACtB2qD,YAAY,GAEduC,GAAI,CACF73C,KAAM,KACNwE,MAAO9b,KAAKiC,IAAI,KAAM,GACtB2qD,YAAY,GAEdxa,GAAI,CACF96B,KAAM,KACNwE,MAAO9b,KAAKiC,IAAI,KAAM,GACtB2qD,YAAY,GAEdwC,GAAI,CACF93C,KAAM,KACNwE,MAAO9b,KAAKiC,IAAI,KAAM,GACtB2qD,YAAY,GAEdyC,GAAI,CACF/3C,KAAM,KACNwE,MAAO9b,KAAKiC,IAAI,KAAM,GACtB2qD,YAAY,GAEd0C,GAAI,CACFh4C,KAAM,KACNwE,MAAO9b,KAAKiC,IAAI,KAAM,GACtB2qD,YAAY,IAGhB2C,eAAgB,CACd,GAAI,CACFj4C,KAAM,GACNwE,MAAO,EACP8wC,YAAY,GAEdc,KAAM,CACJp2C,KAAM,OACNwE,MAAO,IACP8wC,YAAY,GAEde,KAAM,CACJr2C,KAAM,OACNwE,MAAO,IACP8wC,YAAY,GAEdgB,KAAM,CACJt2C,KAAM,OACNwE,MAAO,IACP8wC,YAAY,GAEdiB,KAAM,CACJv2C,KAAM,OACNwE,MAAO,KACP8wC,YAAY,GAEdkB,KAAM,CACJx2C,KAAM,OACNwE,MAAO,KACP8wC,YAAY,GAEdmB,IAAK,CACHz2C,KAAM,MACNwE,MAAO,KACP8wC,YAAY,GAEdoB,MAAO,CACL12C,KAAM,QACNwE,MAAO,KACP8wC,YAAY,GAEdqB,MAAO,CACL32C,KAAM,QACNwE,MAAO,KACP8wC,YAAY,IAGhB4C,gBAAiB,CACf,GAAI,CACFl4C,KAAM,GACNwE,MAAO,EACP8wC,YAAY,GAEd6C,KAAM,CACJn4C,KAAM,OACNwE,MAAO,KACP8wC,YAAY,GAEd8C,KAAM,CACJp4C,KAAM,OACNwE,MAAO9b,KAAKiC,IAAI,KAAM,GACtB2qD,YAAY,GAEd+C,KAAM,CACJr4C,KAAM,OACNwE,MAAO9b,KAAKiC,IAAI,KAAM,GACtB2qD,YAAY,GAEdgD,KAAM,CACJt4C,KAAM,OACNwE,MAAO9b,KAAKiC,IAAI,KAAM,GACtB2qD,YAAY,GAEdiD,KAAM,CACJv4C,KAAM,OACNwE,MAAO9b,KAAKiC,IAAI,KAAM,GACtB2qD,YAAY,GAEdkD,IAAK,CACHx4C,KAAM,MACNwE,MAAO9b,KAAKiC,IAAI,KAAM,GACtB2qD,YAAY,GAEdmD,KAAM,CACJz4C,KAAM,OACNwE,MAAO9b,KAAKiC,IAAI,KAAM,GACtB2qD,YAAY,GAEdoD,KAAM,CACJ14C,KAAM,OACNwE,MAAO9b,KAAKiC,IAAI,KAAM,GACtB2qD,YAAY,IAGhBqD,IAAK,CACH,GAAI,CACF34C,KAAM,GACNwE,MAAO,EACP8wC,YAAY,GAEdsD,GAAI,CACF54C,KAAM,KACNwE,MAAO,IACP8wC,YAAY,KAIlB5E,SAASmI,UAAYx6C,SAAS,CAAC,EAAGqyC,SAASiF,MAAOjF,SAASuF,MAC3DvF,SAASoI,aAAez6C,SAAS,CAAC,EAAGqyC,SAAS8G,gBAAiB9G,SAAS+G,kBACxE/G,SAASqI,YAAc16C,SAAS,CAAC,EAAGqyC,SAASuH,eAAgBvH,SAASwH,iBAiBtE,IAAIrH,gBAAkB,CAAC,OAAQ,SAAU,OAAQ,UAAW,cAAe,qBAAsB,sBAAuB,QAAS,OAC7H0C,WAAa,CACf5C,KAAM,CACJH,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCwI,KAAM,CACJxI,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCyI,OAAQ,CACNzI,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC0I,KAAM,CACJ1I,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC2I,QAAS,CACP3I,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC4I,YAAa,CACX5I,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC6I,mBAAoB,CAClB7I,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC8I,oBAAqB,CACnB9I,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC+I,MAAO,CACL/I,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExCgJ,QAAS,CACPhJ,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCiJ,OAAQ,CACNjJ,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCkJ,OAAQ,CACNlJ,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExCmJ,MAAO,CACLnJ,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExCoJ,SAAU,CACRpJ,WAAY,CAAC,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzCqJ,gBAAiB,CACfrJ,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCsJ,qBAAsB,CACpBtJ,WAAY,EAAE,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzCuJ,mBAAoB,CAClBvJ,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzCwJ,oBAAqB,CACnBxJ,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzCyJ,oBAAqB,CACnBzJ,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC0J,qBAAsB,CACpB1J,WAAY,EAAE,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC2J,cAAe,CACb3J,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC4J,sBAAuB,CACrB5J,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC6J,UAAW,CACT7J,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExC8J,MAAO,CACL9J,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC+J,IAAK,CACH/J,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,KAIzC,IAAK,IAAI9xC,OAAO60C,WACV,sBAAeA,WAAY70C,OAC7B60C,WAAW70C,KAAKA,IAAMA,KAI1B,IACI+xC,UAAY,CACdzwC,KAAM,GACNrK,KAHmB,CAAC,EAIpB6O,MAAO,EACP8E,OAAQ,EACRknC,WAAYK,gBAAgBxrC,KAAI5c,GAAK,KAEnCuqD,MAAQ,CAEVwH,MAAO,CACLx6C,KAAM,QACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,GAEVmxC,KAAM,CACJz6C,KAAM,OACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASC,KACnBnsC,MAAO,MACP8E,OAAQ,GAEVoxC,KAAM,CACJ16C,KAAM,OACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASC,KACnBnsC,MAAO,MACP8E,OAAQ,GAEVqxC,KAAM,CACJ36C,KAAM,OACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASC,KACnBnsC,MAAO,MACP8E,OAAQ,GAEVsxC,KAAM,CACJ56C,KAAM,OACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASC,KACnBnsC,MAAO,SACP8E,OAAQ,GAEV8M,KAAM,CACJpW,KAAM,OACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASC,KACnBnsC,MAAO,QACP8E,OAAQ,GAEVuxC,IAAK,CACH76C,KAAM,MACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASC,KACnBnsC,MAAO,OACP8E,OAAQ,GAEV2c,MAAO,CACLjmB,KAAM,QACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASC,KACnBnsC,MAAO,QACP8E,OAAQ,GAEVwxC,SAAU,CACR96C,KAAM,WACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASC,KACnBnsC,MAAO,MACP8E,OAAQ,GAEVjX,EAAG,CACD2N,KAAM,IACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAEVyxC,GAAI,CACF/6C,KAAM,KACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASC,KACnBnsC,MAAO,MACP8E,OAAQ,GAEV0xC,GAAI,CACFh7C,KAAM,KACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASC,KACnBnsC,MAAO,MACP8E,OAAQ,GAEVlY,GAAI,CACF4O,KAAM,KACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASC,KACnBnsC,MAAO,MACP8E,OAAQ,GAEV2xC,GAAI,CACFj7C,KAAM,KACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASC,KACnBnsC,MAAO,SACP8E,OAAQ,GAEV4xC,GAAI,CACFl7C,KAAM,KACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASC,KACnBnsC,MAAO,QACP8E,OAAQ,GAEV3Z,GAAI,CACFqQ,KAAM,KACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASC,KACnBnsC,MAAO,QACP8E,OAAQ,GAEV6xC,GAAI,CACFn7C,KAAM,KACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASC,KACnBnsC,MAAO,QACP8E,OAAQ,GAEV8xC,IAAK,CACHp7C,KAAM,MACNrK,KAAM49C,WAAW0F,OACjBhG,SAAUvC,SAASC,KACnBnsC,MAAO,OACP8E,OAAQ,GAIV+xC,GAAI,CACFr7C,KAAM,KACNrK,KAAM49C,WAAWiG,QACjBvG,SAAUvC,SAAS4G,QACnB9yC,MAAO,EACP8E,OAAQ,GAEVgyC,KAAM,CACJt7C,KAAM,OACNrK,KAAM49C,WAAWiG,QACjBvG,SAAUvC,SAASC,KACnBnsC,MAAO,SACP8E,OAAQ,GAGViyC,KAAM,CACJv7C,KAAM,OACNrK,KAAM49C,WAAWiG,QACjBvG,SAAUvC,SAASC,KACnBnsC,MAAO,UACP8E,OAAQ,GAGVkyC,KAAM,CACJx7C,KAAM,OACNrK,KAAM49C,WAAWiG,QACjBvG,SAAUvC,SAASC,KACnBnsC,MAAO,UACP8E,OAAQ,GAGVmyC,KAAM,CACJz7C,KAAM,OACNrK,KAAM49C,WAAWiG,QACjBvG,SAAUvC,SAASC,KACnBnsC,MAAO,eACP8E,OAAQ,GAGVoyC,KAAM,CACJ17C,KAAM,OACNrK,KAAM49C,WAAWiG,QACjBvG,SAAUvC,SAASC,KACnBnsC,MAAO,SACP8E,OAAQ,GAGVqyC,KAAM,CACJ37C,KAAM,OACNrK,KAAM49C,WAAWiG,QACjBvG,SAAUvC,SAASC,KACnBnsC,MAAO,SACP8E,OAAQ,GAGVsyC,MAAO,CACL57C,KAAM,QACNrK,KAAM49C,WAAWiG,QACjBvG,SAAUvC,SAASC,KACnBnsC,MAAO,WACP8E,OAAQ,GAGVuyC,KAAM,CACJ77C,KAAM,OACNrK,KAAM49C,WAAWiG,QACjBvG,SAAUvC,SAASC,KACnBnsC,MAAO,QACP8E,OAAQ,GAGVwyC,QAAS,CACP97C,KAAM,UACNrK,KAAM49C,WAAWiG,QACjBvG,SAAUvC,SAASC,KACnBnsC,MAAO,IACP8E,OAAQ,GAIVyyC,GAAI,CACF/7C,KAAM,KACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAAS6G,MACnB/yC,MAAO,EACP8E,OAAQ,GAEV0yC,EAAG,CACDh8C,KAAM,IACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASiF,MACnBnxC,MAAO,KACP8E,OAAQ,GAGV2yC,EAAG,CACDj8C,KAAM,IACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASiF,MACnBnxC,MAAO,KACP8E,OAAQ,GAGV4yC,MAAO,CACLl8C,KAAM,QACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASuF,KACnBzxC,MAAO,KACP8E,OAAQ,GAEV6yC,KAAM,CACJn8C,KAAM,OACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,aACP8E,OAAQ,GAGV8yC,KAAM,CACJp8C,KAAM,OACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,cACP8E,OAAQ,GAGV+yC,KAAM,CACJr8C,KAAM,OACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,cACP8E,OAAQ,GAGVgzC,SAAU,CACRt8C,KAAM,WACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,KACP8E,OAAQ,GAGVizC,WAAY,CACVv8C,KAAM,aACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,MACP8E,OAAQ,GAIVkzC,KAAM,CACJx8C,KAAM,OACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,KACP8E,OAAQ,GAGVmzC,IAAK,CACHz8C,KAAM,MACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,KACP8E,OAAQ,GAIVozC,MAAO,CACL18C,KAAM,QACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,YACP8E,OAAQ,GAGVqzC,UAAW,CACT38C,KAAM,YACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,aACP8E,OAAQ,GAGVszC,WAAY,CACV58C,KAAM,aACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,YACP8E,OAAQ,GAGVuzC,KAAM,CACJ78C,KAAM,OACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,YACP8E,OAAQ,GAGVwzC,GAAI,CACF98C,KAAM,KACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,KACP8E,OAAQ,GAGVyzC,IAAK,CACH/8C,KAAM,MACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,YACP8E,OAAQ,GAGV0zC,KAAM,CACJh9C,KAAM,OACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,YACP8E,OAAQ,GAGV2zC,MAAO,CACLj9C,KAAM,QACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,YACP8E,OAAQ,GAGV4zC,OAAQ,CACNl9C,KAAM,SACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,WACP8E,OAAQ,GAGV6zC,WAAY,CACVn9C,KAAM,aACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,SACP8E,OAAQ,GAGV8zC,UAAW,CACTp9C,KAAM,YACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,SACP8E,OAAQ,GAGV+zC,SAAU,CACRr9C,KAAM,WACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,QACP8E,OAAQ,GAIVg0C,KAAM,CACJt9C,KAAM,OACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,aACP8E,OAAQ,GAGVi0C,KAAM,CACJv9C,KAAM,OACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,YACP8E,OAAQ,GAGVk0C,GAAI,CACFx9C,KAAM,KACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,YACP8E,OAAQ,GAGVm0C,GAAI,CACFz9C,KAAM,KACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,YACP8E,OAAQ,GAGVo0C,GAAI,CACF19C,KAAM,KACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,YACP8E,OAAQ,GAGVq0C,GAAI,CACF39C,KAAM,KACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,YACP8E,OAAQ,GAGVs0C,IAAK,CACH59C,KAAM,MACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,WACP8E,OAAQ,GAGVu0C,IAAK,CACH79C,KAAM,MACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,SACP8E,OAAQ,GAGVw0C,IAAK,CACH99C,KAAM,MACNrK,KAAM49C,WAAWkG,OACjBxG,SAAUvC,SAASC,KACnBnsC,MAAO,SACP8E,OAAQ,GAKVy0C,EAAG,CACD/9C,KAAM,IACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASiF,MACnBnxC,MAAO,KACP8E,OAAQ,GAEV00C,KAAM,CACJh+C,KAAM,OACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASuF,KACnBzxC,MAAO,KACP8E,OAAQ,GAEV20C,IAAK,CACHj+C,KAAM,MACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASiF,MACnBnxC,MAAO,UACP8E,OAAQ,GAEV7e,EAAG,CACDuV,KAAM,IACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASiF,MACnBnxC,MAAO,IACP8E,OAAQ,GAEV40C,MAAO,CACLl+C,KAAM,QACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASuF,KACnBzxC,MAAO,IACP8E,OAAQ,GAEV60C,MAAO,CACLn+C,KAAM,QACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASC,KACnBnsC,MAAO,YACP8E,OAAQ,GAEV80C,KAAM,CACJp+C,KAAM,OACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASC,KACnBnsC,MAAO,kBACP8E,OAAQ,GAEV+0C,MAAO,CACLr+C,KAAM,QACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASC,KACnBnsC,MAAO,cACP8E,OAAQ,GAEVg1C,UAAW,CACTt+C,KAAM,YACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASC,KACnBnsC,MAAO,UACP8E,OAAQ,GAEVi1C,cAAe,CACbv+C,KAAM,gBACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASC,KACnBnsC,MAAO,UACP8E,OAAQ,GAEVk1C,MAAO,CACLx+C,KAAM,QACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASC,KACnBnsC,MAAO,KACP8E,OAAQ,GAEVm1C,MAAO,CACLz+C,KAAM,QACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASC,KACnBnsC,MAAO,WACP8E,OAAQ,GAEVo1C,GAAI,CACF1+C,KAAM,KACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASC,KACnBnsC,MAAO,YACP8E,OAAQ,GAEVq1C,GAAI,CACF3+C,KAAM,KACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASC,KACnBnsC,MAAO,kBACP8E,OAAQ,GAEVs1C,GAAI,CACF5+C,KAAM,KACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASC,KACnBnsC,MAAO,cACP8E,OAAQ,GAEVu1C,IAAK,CACH7+C,KAAM,MACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASC,KACnBnsC,MAAO,UACP8E,OAAQ,GAEVw1C,IAAK,CACH9+C,KAAM,MACNrK,KAAM49C,WAAWyF,KACjB/F,SAAUvC,SAASC,KACnBnsC,MAAO,UACP8E,OAAQ,GAGV9Y,EAAG,CACDwP,KAAM,IACNrK,KAAM49C,WAAW2F,KACjBjG,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAEVla,IAAK,CACH4Q,KAAM,MACNrK,KAAM49C,WAAW2F,KACjBjG,SAAUvC,SAASC,KACnBnsC,MAAO,GACP8E,OAAQ,GAEVwoB,EAAG,CACD9xB,KAAM,IACNrK,KAAM49C,WAAW2F,KACjBjG,SAAUvC,SAASC,KACnBnsC,MAAO,KACP8E,OAAQ,GAEVy1C,OAAQ,CACN/+C,KAAM,SACNrK,KAAM49C,WAAW2F,KACjBjG,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,GAEV42B,IAAK,CACHlgC,KAAM,MACNrK,KAAM49C,WAAW2F,KACjBjG,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,GAEV01C,OAAQ,CACNh/C,KAAM,SACNrK,KAAM49C,WAAW2F,KACjBjG,SAAUvC,SAASC,KACnBnsC,MAAO,GACP8E,OAAQ,GAEV21C,KAAM,CACJj/C,KAAM,OACNrK,KAAM49C,WAAW2F,KACjBjG,SAAUvC,SAASC,KACnBnsC,MAAO,KACP8E,OAAQ,GAEV41C,IAAK,CACHl/C,KAAM,MACNrK,KAAM49C,WAAW2F,KACjBjG,SAAUvC,SAASC,KACnBnsC,MAAO,MACP8E,OAAQ,GAEV61C,KAAM,CACJn/C,KAAM,OACNrK,KAAM49C,WAAW2F,KACjBjG,SAAUvC,SAASC,KACnBnsC,MAAO,OACP8E,OAAQ,GAEV81C,MAAO,CACLp/C,KAAM,QACNrK,KAAM49C,WAAW2F,KACjBjG,SAAUvC,SAASC,KACnBnsC,MAAO,QAEP8E,OAAQ,GAEV+1C,KAAM,CACJr/C,KAAM,OACNrK,KAAM49C,WAAW2F,KACjBjG,SAAUvC,SAASC,KACnBnsC,MAAO,SAEP8E,OAAQ,GAEVg2C,OAAQ,CACNt/C,KAAM,SACNrK,KAAM49C,WAAW2F,KACjBjG,SAAUvC,SAASC,KACnBnsC,MAAO,SAEP8E,OAAQ,GAEVi2C,QAAS,CACPv/C,KAAM,UACNrK,KAAM49C,WAAW2F,KACjBjG,SAAUvC,SAASC,KACnBnsC,MAAO,SAEP8E,OAAQ,GAEVk2C,WAAY,CACVx/C,KAAM,aACNrK,KAAM49C,WAAW2F,KACjBjG,SAAUvC,SAASC,KACnBnsC,MAAO,SAEP8E,OAAQ,GAGVm2C,MAAO,CACLz/C,KAAM,QACNrK,KAAM49C,WAAW8G,UACjBpH,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,EACRo2C,YAAY,GAEdC,GAAI,CACF3/C,KAAM,KACNrK,KAAM49C,WAAW8G,UACjBpH,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,EACRo2C,YAAY,GAGdE,IAAK,CACH5/C,KAAM,MACNrK,KAAM49C,WAAW+G,MACjBrH,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAEVu2C,OAAQ,CACN7/C,KAAM,SACNrK,KAAM49C,WAAW+G,MACjBrH,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,GAGVo3B,IAAK,CACH1gC,KAAM,MACNrK,KAAM49C,WAAW+G,MACjBrH,SAAUvC,SAASiF,MACnBnxC,MAAO,KAEP8E,OAAQ,GAEVw2C,OAAQ,CACN9/C,KAAM,SACNrK,KAAM49C,WAAW+G,MACjBrH,SAAUvC,SAASuF,KACnBzxC,MAAO,KAEP8E,OAAQ,GAGVy2C,KAAM,CACJ//C,KAAM,OACNrK,KAAM49C,WAAW+G,MACjBrH,SAAUvC,SAASiF,MACnBnxC,MAAO,KAEP8E,OAAQ,GAEV02C,QAAS,CACPhgD,KAAM,UACNrK,KAAM49C,WAAW+G,MACjBrH,SAAUvC,SAASuF,KACnBzxC,MAAO,KAEP8E,OAAQ,GAGV22C,MAAO,CACLjgD,KAAM,QACNrK,KAAM49C,WAAW+G,MACjBrH,SAAUvC,SAASC,KACnBnsC,MAAO,KAEP8E,OAAQ,GAGV42C,OAAQ,CACNlgD,KAAM,SACNrK,KAAM49C,WAAW+G,MACjBrH,SAAUvC,SAASC,KACnBnsC,MAAO,KAEP8E,OAAQ,GAGV62C,OAAQ,CACNngD,KAAM,SACNrK,KAAM49C,WAAW+G,MACjBrH,SAAUvC,SAASC,KACnBnsC,MAAO,KAEP8E,OAAQ,GAGVxI,EAAG,CACDd,KAAM,IACNrK,KAAM49C,WAAW4F,QACjBlG,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAEV82C,OAAQ,CACNpgD,KAAM,SACNrK,KAAM49C,WAAW4F,QACjBlG,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,GAMV+2C,EAAG,CACDrgD,KAAM,IACNrK,KAAM49C,WAAW6F,YACjBnG,SAAUvC,SAASC,KACnBnsC,MAAO,EACP8E,OAAQ,GAEVg3C,KAAM,CACJtgD,KAAM,OACNrK,KAAM49C,WAAW6F,YACjBnG,SAAUvC,SAASC,KACnBnsC,MAAO,EACP8E,OAAQ,QAEVi3C,KAAM,CACJvgD,KAAM,OACNrK,KAAM49C,WAAW6F,YACjBnG,SAAUvC,SAASC,KACnBnsC,MAAO,EAAI,IACX8E,OAAQ,QAEVk3C,KAAM,CACJxgD,KAAM,OACNrK,KAAM49C,WAAW6F,YACjBnG,SAAUvC,SAASC,KACnBnsC,MAAO,EAAI,IACX8E,OAAQ,GAEVm3C,OAAQ,CACNzgD,KAAM,SACNrK,KAAM49C,WAAW6F,YACjBnG,SAAUvC,SAASC,KACnBnsC,MAAO,EACP8E,OAAQ,GAEVo3C,QAAS,CACP1gD,KAAM,UACNrK,KAAM49C,WAAW6F,YACjBnG,SAAUvC,SAASC,KACnBnsC,MAAO,EACP8E,OAAQ,QAEVq3C,WAAY,CACV3gD,KAAM,aACNrK,KAAM49C,WAAW6F,YACjBnG,SAAUvC,SAASC,KACnBnsC,MAAO,EAAI,IACX8E,OAAQ,QAEVs3C,QAAS,CACP5gD,KAAM,UACNrK,KAAM49C,WAAW6F,YACjBnG,SAAUvC,SAASC,KACnBnsC,MAAO,EAAI,IACX8E,OAAQ,GAGVu3C,IAAK,CACH7gD,KAAM,MACNrK,KAAM49C,WAAW+F,oBACjBrG,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAEVw3C,KAAM,CACJ9gD,KAAM,OACNrK,KAAM49C,WAAW+F,oBACjBrG,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,GAGVy3C,GAAI,CACF/gD,KAAM,KACNrK,KAAM49C,WAAW8F,mBACjBpG,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAEV03C,QAAS,CACPhhD,KAAM,UACNrK,KAAM49C,WAAW8F,mBACjBpG,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,GAMVpI,EAAG,CACDlB,KAAM,IACNrK,KAAM49C,WAAWgG,MACjBtG,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAEV23C,OAAQ,CACNjhD,KAAM,SACNrK,KAAM49C,WAAWgG,MACjBtG,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,GAEV43C,IAAK,CACHlhD,KAAM,MACNrK,KAAM49C,WAAWgG,MACjBtG,SAAUvC,SAASiF,MACnBnxC,MAAO,KACP8E,OAAQ,GAEV63C,KAAM,CACJnhD,KAAM,OACNrK,KAAM49C,WAAWgG,MACjBtG,SAAUvC,SAASuF,KACnBzxC,MAAO,KACP8E,OAAQ,GAEV83C,IAAK,CACHphD,KAAM,MACNrK,KAAM49C,WAAWgG,MACjBtG,SAAUvC,SAASC,KACnBnsC,MAAO,gBACP8E,OAAQ,GAEV+3C,WAAY,CACVrhD,KAAM,aACNrK,KAAM49C,WAAWgG,MACjBtG,SAAUvC,SAASC,KACnBnsC,MAAO,gBACP8E,OAAQ,GAEVg4C,IAAK,CACHthD,KAAM,MACNrK,KAAM49C,WAAWgG,MACjBtG,SAAUvC,SAASuF,KACnBzxC,MAAO,UACP8E,OAAQ,GAEVi4C,cAAe,CACbvhD,KAAM,gBACNrK,KAAM49C,WAAWgG,MACjBtG,SAAUvC,SAASC,KACnBnsC,MAAO,QACP8E,OAAQ,GAGV8hC,EAAG,CACDprC,KAAM,IACNrK,KAAM49C,WAAWmG,OACjBzG,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAEVk4C,MAAO,CACLxhD,KAAM,QACNrK,KAAM49C,WAAWmG,OACjBzG,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAEVm4C,IAAK,CACHzhD,KAAM,MACNrK,KAAM49C,WAAWmG,OACjBzG,SAAUvC,SAASC,KACnBnsC,MAAO,KACP8E,OAAQ,GAEVo4C,GAAI,CACF1hD,KAAM,KACNrK,KAAM49C,WAAWmG,OACjBzG,SAAUvC,SAASiF,MACnBnxC,MAAO,KACP8E,OAAQ,GAEVqvC,IAAK,CACH34C,KAAM,MACNrK,KAAM49C,WAAWmG,OACjBzG,SAAUvC,SAASiI,IACnBn0C,MAAO,cACP8E,OAAQ,GAEVq4C,GAAI,CACF3hD,KAAM,KACNrK,KAAM49C,WAAWmG,OACjBzG,SAAUvC,SAASiF,MACnBnxC,MAAO,eACP8E,OAAQ,GAEVs4C,aAAc,CACZ5hD,KAAM,eACNrK,KAAM49C,WAAWmG,OACjBzG,SAAUvC,SAASuF,KACnBzxC,MAAO,eACP8E,OAAQ,GAGVsqC,EAAG,CACD5zC,KAAM,IACNrK,KAAM49C,WAAWoG,MACjB1G,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAEVu4C,KAAM,CACJ7hD,KAAM,OACNrK,KAAM49C,WAAWoG,MACjB1G,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,GAEVw4C,GAAI,CACF9hD,KAAM,KACNrK,KAAM49C,WAAWoG,MACjB1G,SAAUvC,SAASC,KACnBnsC,MAAO,eACP8E,OAAQ,GAGVwrC,IAAK,CACH90C,KAAM,MACNrK,KAAM49C,WAAWoG,MACjB1G,SAAUvC,SAASiF,MACnBnxC,MAAOhb,QAAQ2hD,EACf7hC,OAAQ,GAEVyrC,GAAI,CACF/0C,KAAM,KACNrK,KAAM49C,WAAWoG,MACjB1G,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAGVy4C,GAAI,CACF/hD,KAAM,KACNrK,KAAM49C,WAAWqG,SACjB3G,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAEVyyB,IAAK,CACH/7B,KAAM,MACNrK,KAAM49C,WAAWqG,SACjB3G,SAAUvC,SAASC,KACnBnsC,MAAO,iBACP8E,OAAQ,GAEV04C,IAAK,CACHhiD,KAAM,MACNrK,KAAM49C,WAAWqG,SACjB3G,SAAUvC,SAASC,KACnBnsC,MAAO,OACP8E,OAAQ,GAEV24C,IAAK,CACHjiD,KAAM,MACNrK,KAAM49C,WAAWqG,SACjB3G,SAAUvC,SAASmI,UACnBr0C,MAAO,IACP8E,OAAQ,GAEV44C,KAAM,CACJliD,KAAM,OACNrK,KAAM49C,WAAWqG,SACjB3G,SAAUvC,SAASC,KACnBnsC,MAAO,QACP8E,OAAQ,GAEV64C,KAAM,CACJniD,KAAM,OACNrK,KAAM49C,WAAWqG,SACjB3G,SAAUvC,SAASC,KACnBnsC,MAAO,QACP8E,OAAQ,GAEV84C,MAAO,CACLpiD,KAAM,QACNrK,KAAM49C,WAAWqG,SACjB3G,SAAUvC,SAASC,KACnBnsC,MAAO,QACP8E,OAAQ,GAEV+4C,MAAO,CACLriD,KAAM,QACNrK,KAAM49C,WAAWqG,SACjB3G,SAAUvC,SAASC,KACnBnsC,MAAO,QACP8E,OAAQ,GAGVg5C,QAAS,CACPtiD,KAAM,UACNrK,KAAM49C,WAAWsG,gBACjB5G,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,GAEVtI,EAAG,CACDhB,KAAM,IACNrK,KAAM49C,WAAWsG,gBACjB5G,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAGVi5C,MAAO,CACLviD,KAAM,QACNrK,KAAM49C,WAAWuG,qBACjB7G,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,GAEVk5C,EAAG,CACDxiD,KAAM,IACNrK,KAAM49C,WAAWuG,qBACjB7G,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAGVm5C,KAAM,CACJziD,KAAM,OACNrK,KAAM49C,WAAWwG,mBACjB9G,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,GAEVo5C,EAAG,CACD1iD,KAAM,IACNrK,KAAM49C,WAAWwG,mBACjB9G,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAGVq5C,IAAK,CACH3iD,KAAM,MACNrK,KAAM49C,WAAWyG,oBACjB/G,SAAUvC,SAASmI,UAEnBr0C,MAAO,EACP8E,OAAQ,GAcVs5C,MAAO,CACL5iD,KAAM,QACNrK,KAAM49C,WAAW0G,oBACjBhH,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,GAEVu5C,EAAG,CACD7iD,KAAM,IACNrK,KAAM49C,WAAW0G,oBACjBhH,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAGVw5C,QAAS,CACP9iD,KAAM,UACNrK,KAAM49C,WAAW2G,qBACjBjH,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,GAEVy5C,EAAG,CACD/iD,KAAM,IACNrK,KAAM49C,WAAW2G,qBACjBjH,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAGV05C,MAAO,CACLhjD,KAAM,QACNrK,KAAM49C,WAAW4G,cACjBlH,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,GAEV25C,GAAI,CACFjjD,KAAM,KACNrK,KAAM49C,WAAW4G,cACjBlH,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAGV45C,MAAO,CACLljD,KAAM,QACNrK,KAAM49C,WAAW6G,sBACjBnH,SAAUvC,SAASuF,KACnBzxC,MAAO,EACP8E,OAAQ,GAEVwsC,EAAG,CACD91C,KAAM,IACNrK,KAAM49C,WAAW6G,sBACjBnH,SAAUvC,SAASiF,MACnBnxC,MAAO,EACP8E,OAAQ,GAGVrgB,EAAG,CACD+W,KAAM,IACNrK,KAAM49C,WAAWgH,IACjBtH,SAAUvC,SAASoI,aACnBt0C,MAAO,EACP8E,OAAQ,GAEV65C,KAAM,CACJnjD,KAAM,OACNrK,KAAM49C,WAAWgH,IACjBtH,SAAUvC,SAASqI,YACnBv0C,MAAO,EACP8E,OAAQ,GAEVvI,EAAG,CACDf,KAAM,IACNrK,KAAM49C,WAAWgH,IACjBtH,SAAUvC,SAASoI,aACnBt0C,MAAO,EACP8E,OAAQ,GAEV85C,MAAO,CACLpjD,KAAM,QACNrK,KAAM49C,WAAWgH,IACjBtH,SAAUvC,SAASqI,YACnBv0C,MAAO,EACP8E,OAAQ,IAIR+5C,QAAU,CACZC,OAAQ,QACRC,OAAQ,OACRC,KAAM,OACNC,MAAO,OACPC,MAAO,OACPC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,UAAW,WACXtuD,GAAI,IACJuuD,OAAQ,QACRC,MAAO,QACPC,OAAQ,QACRC,UAAW,WACXC,YAAa,aACbC,OAAQ,QACRC,WAAY,YACZC,YAAa,aACbC,MAAO,OACPC,KAAM,MACNC,MAAO,OACPC,OAAQ,QACRC,QAAS,SACTC,YAAa,aACbC,WAAY,YACZC,UAAW,WACXC,KAAM,MACNC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,OAAQ,QACRC,MAAO,OACPC,OAAQ,QACRC,YAAa,YACbC,eAAgB,gBAChBC,OAAQ,QACRC,GAAI,MACJC,IAAK,MACLC,KAAM,MACNC,IAAK,gBACLC,MAAO,OACPC,SAAU,UACVC,OAAQ,OACRC,OAAQ,OACRC,OAAQ,OACRC,QAAS,OACTC,KAAM,OACNC,MAAO,QACPC,MAAO,QACPC,QAAS,SACTC,KAAM,SACNC,QAAS,SACTC,KAAM,SACNC,MAAO,OACPC,GAAI,OACJC,IAAK,OACLC,KAAM,MACNC,MAAO,OACPC,OAAQ,QACRC,MAAO,OACPC,QAAS,SACTC,UAAW,UACXC,UAAW,aACX1H,MAAO,QACP2H,QAAS,SACTC,QAAS,SACTC,SAAU,UACVC,OAAQ,QACRC,UAAW,SACXC,WAAY,SACZC,UAAW,SACXC,WAAY,SACZC,KAAM,MACNC,MAAO,OACPC,OAAQ,QACRC,QAAS,SACTC,SAAU,UACVC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,OAAQ,QACRC,OAAQ,QACRC,cAAe,eACfC,MAAO,OACPC,IAAK,OACLC,KAAM,SAQR,SAASC,qBAAqBlsD,QAC5B,GAAsB,cAAlBA,OAAOoqB,OAAwB,CACjC,IAAIrqB,GAAK,kBAAS6zC,YAClB4C,MAAM4M,IAAIp7C,MAAQ,IAAI4rC,WAAW,GACjC4C,MAAMtS,IAAIl8B,MAAQjI,GAAGtJ,IAAI,KAEzB+/C,MAAM+M,KAAKv7C,MAAQjI,GAAGtJ,IAAI,KAE1B+/C,MAAMiN,MAAMz7C,MAAQjI,GAAGxK,MAAM,GAE7BihD,MAAMkN,OAAO17C,MAAQjI,GAAGtJ,IAAI,OAE5B+/C,MAAMmN,OAAO37C,MAAQjI,GAAGtJ,IAAI,MAC9B,MAEE+/C,MAAM4M,IAAIp7C,MAAQ,EAClBwuC,MAAMtS,IAAIl8B,MAAQ9b,KAAK0C,GAAK,IAE5B4nD,MAAM+M,KAAKv7C,MAAQ9b,KAAK0C,GAAK,IAE7B4nD,MAAMiN,MAAMz7C,MAAkB,EAAV9b,KAAK0C,GAEzB4nD,MAAMkN,OAAO17C,MAAQ9b,KAAK0C,GAAK,MAE/B4nD,MAAMmN,OAAO37C,MAAQ9b,KAAK0C,GAAK,MAIjC4nD,MAAM6M,OAAOr7C,MAAQwuC,MAAM4M,IAAIp7C,MAC/BwuC,MAAM8M,OAAOt7C,MAAQwuC,MAAMtS,IAAIl8B,MAC/BwuC,MAAMgN,QAAQx7C,MAAQwuC,MAAM+M,KAAKv7C,KACnC,CAGAkkD,qBAAqBlsD,QAEjByF,IAEFA,GAAG,UAAU,SAAUmhB,KAAMD,MACvBC,KAAKwD,SAAWzD,KAAKyD,QACvB8hC,qBAAqBtlC,KAEzB,IASF,IAAIgvB,aAAe,CACjBkC,GAAI,CAEF3D,KAAM,CACJnQ,KAAMiQ,UACNvgC,OAAQwgC,SAASC,KAAK,KAExBsI,OAAQ,CACNzY,KAAMwS,MAAM3gD,EACZ6d,OAAQwgC,SAASiF,MAAM,KAEzBqD,KAAM,CACJxY,KAAMwS,MAAM+K,EACZ7tC,OAAQwgC,SAASiF,MAAM9mD,GAEzBqqD,KAAM,CACJ1Y,KAAMwS,MAAMxiD,EACZ0f,OAAQwgC,SAASiF,MAAM,KAEzBwD,QAAS,CACP3Y,KAAMwS,MAAMlyC,EACZoP,OAAQwgC,SAASiF,MAAM,KAEzByD,YAAa,CACX5Y,KAAMwS,MAAMqN,EACZnwC,OAAQwgC,SAASiF,MAAM,KAEzB0D,mBAAoB,CAClB7Y,KAAMwS,MAAM+N,GACZ7wC,OAAQwgC,SAASiF,MAAM,KAEzB2D,oBAAqB,CACnB9Y,KAAMwS,MAAM6N,IACZ3wC,OAAQwgC,SAASiF,MAAM,KAEzB2E,MAAO,CACL9Z,KAAMwS,MAAM4M,IACZ1vC,OAAQwgC,SAASiF,MAAM,KAEzB4E,IAAK,CACH/Z,KAAMwS,MAAMmQ,KACZjzC,OAAQwgC,SAASiF,MAAM,KAGzB4D,MAAO,CACL/Y,KAAMwS,MAAM9xC,EACZgP,OAAQwgC,SAASiF,MAAM,KAEzB+D,OAAQ,CACNlZ,KAAMwS,MAAM5H,EACZl7B,OAAQwgC,SAASiF,MAAM,KAEzBgE,MAAO,CACLnZ,KAAMwS,MAAMY,EACZ1jC,OAAQwgC,SAASiF,MAAM,KAEzBiE,SAAU,CACRpZ,KAAMwS,MAAM+O,GACZ7xC,OAAQwgC,SAASiF,MAAM,KAEzBkE,gBAAiB,CACfrZ,KAAMwS,MAAMhyC,EACZkP,OAAQwgC,SAASiF,MAAM,KAEzBmE,qBAAsB,CACpBtZ,KAAMwS,MAAMwP,EACZtyC,OAAQwgC,SAASiF,MAAM,KAEzBoE,mBAAoB,CAClBvZ,KAAMwS,MAAM0P,EACZxyC,OAAQwgC,SAASiF,MAAM,KAEzBqE,oBAAqB,CACnBxZ,KAAMwS,MAAM2P,IACZzyC,OAAQwgC,SAASiF,MAAM,KAEzBsE,oBAAqB,CACnBzZ,KAAMwS,MAAM6P,EACZ3yC,OAAQwgC,SAASiF,MAAM,KAEzBuE,qBAAsB,CACpB1Z,KAAMwS,MAAM+P,EACZ7yC,OAAQwgC,SAASiF,MAAM,KAEzBwE,cAAe,CACb3Z,KAAMwS,MAAMiQ,GACZ/yC,OAAQwgC,SAASiF,MAAM,KAEzByE,sBAAuB,CACrB5Z,KAAMwS,MAAM8C,EACZ5lC,OAAQwgC,SAASiF,MAAM,KAEzB0E,UAAW,CACT7Z,KAAMwS,MAAM2M,GACZzvC,OAAQwgC,SAASiF,MAAM,OAK7BvD,aAAauW,IAAMzjC,KAAK36B,MAAM26B,KAAK/D,UAAUixB,aAAakC,KAC1DlC,aAAauW,IAAI1P,OAAS,CACxBzY,KAAMwS,MAAM3gD,EACZ6d,OAAQwgC,SAASiF,MAAMvrD,GAEzBgoD,aAAauW,IAAI3P,KAAO,CACtBxY,KAAMwS,MAAM+K,EACZ7tC,OAAQwgC,SAASiF,MAAM,KAEzBvD,aAAauW,IAAIpP,MAAQ,CACvB/Y,KAAMwS,MAAMkO,IACZhxC,OAAQwgC,SAASiF,MAAM,KAEzBvD,aAAauW,IAAIjP,OAAS,CACxBlZ,KAAMwS,MAAMyO,IACZvxC,OAAQwgC,SAASC,KAAK,KAIxByB,aAAawW,GAAK1jC,KAAK36B,MAAM26B,KAAK/D,UAAUixB,aAAakC,KACzDlC,aAAawW,GAAG3P,OAAS,CACvBzY,KAAMwS,MAAMgI,GACZ9qC,OAAQwgC,SAASC,KAAK,KAExByB,aAAawW,GAAG5P,KAAO,CACrBxY,KAAMwS,MAAM6L,IACZ3uC,OAAQwgC,SAASC,KAAK,KAExByB,aAAawW,GAAGxP,YAAc,CAC5B5Y,KAAMwS,MAAMuN,KACZrwC,OAAQwgC,SAASC,KAAK,KAExByB,aAAawW,GAAGrP,MAAQ,CACtB/Y,KAAMwS,MAAMoO,IACZlxC,OAAQwgC,SAASC,KAAK,KAExByB,aAAawW,GAAGlP,OAAS,CACvBlZ,KAAMwS,MAAM2F,IACZzoC,OAAQwgC,SAASiI,IAAI,KAEvBvG,aAAawW,GAAGjP,MAAQ,CACtBnZ,KAAMwS,MAAM8O,GACZ5xC,OAAQwgC,SAASC,KAAK,KAExByB,aAAawW,GAAGhP,SAAW,CACzBpZ,KAAMwS,MAAMjX,IACZ7rB,OAAQwgC,SAASC,KAAK,KAIxByB,aAAaC,KAAOntB,KAAK36B,MAAM26B,KAAK/D,UAAUixB,aAAakC,KAE3D,IAAIH,kBAAoB/B,aAAaC,KAkErC,IAAK,IAAI5pB,SA5DTyZ,KAAK2mB,cAAgB,SAAU7oD,MAC7B,IAAI,sBAAeoyC,aAAcpyC,MAG/B,MAAM,IAAI1Q,MAAM,eAAiB0Q,KAAO,iCAAmC1B,OAAOoB,KAAK0yC,cAActtC,KAAK,OAF1GqvC,kBAAoB/B,aAAapyC,KAIrC,EAOAkiC,KAAK4mB,cAAgB,WACnB,IAAK,IAAItgC,QAAQ4pB,aACf,GAAI,sBAAeA,aAAc5pB,OAC3B4pB,aAAa5pB,QAAU2rB,kBACzB,OAAO3rB,IAIf,EAOA0Z,KAAK6mB,eAAiB,CACpB/6B,UAAW,SAAmBvlC,GAC5B,OAAO,IAAI2nD,WAAW3nD,EAAI,GAC5B,EACA4X,SAAU,SAAkB5X,GAC1B,OAAO,IAAI4nD,UAAU5nD,EACvB,EACAe,QAAS,SAAiBf,GACxB,OAAOA,CACT,EACAm+B,OAAQ,SAAgBn+B,GACtB,OAAOA,CACT,GAWFy5C,KAAK0Q,oBAAsB,SAAUtuC,MACnC,IAAK49B,KAAK6mB,eAAezkD,MACvB,MAAM,IAAIF,UAAU,qBAAuBE,KAAO,KAGpD,OAAO49B,KAAK6mB,eAAezkD,KAC7B,EAGkB0uC,MAChB,GAAI,sBAAeA,MAAOvqB,OAAQ,CAChC,IAAI+X,KAAOwS,MAAMvqB,OACjB+X,KAAKgQ,WAAahQ,KAAK7qC,KAAK66C,UAC9B,CAIF,IAAK,IAAIwY,UAAU3F,QACjB,GAAI,sBAAeA,QAAS2F,QAAS,CACnC,IAAIC,OAASjW,MAAMqQ,QAAQ2F,SACvBE,MAAQ,CAAC,EAEb,IAAK,IAAIC,SAASF,OACZ,sBAAeA,OAAQE,SACzBD,MAAMC,OAASF,OAAOE,QAI1BD,MAAMlpD,KAAOgpD,OACbhW,MAAMgW,QAAUE,KAClB,CA+SF,OAtSAhnB,KAAKsP,aAAe,SAAsBpnD,GACxC,MAAO,aAAa+R,KAAK/R,EAC3B,EAmCA83C,KAAKknB,WAAa,SAAU3sD,IAAKmX,SAC/B,GAAmB,iBAARnX,IACT,MAAM,IAAI2H,UAAU,6DAItB,GAAIwP,SAAWA,QAAQ8Q,SACrB,IAAK,IAAI2kC,SAAS5sD,IAKhB,GAJI,sBAAeA,IAAK4sD,QACtBnnB,KAAKonB,WAAWD,OAGd5sD,IAAI4sD,OAAOE,QACb,IAAK,IAAIp/D,EAAI,EAAGA,EAAIsS,IAAI4sD,OAAOE,QAAQz/D,OAAQK,IAC7C+3C,KAAKonB,WAAW7sD,IAAI4sD,OAAOE,QAAQp/D,IAO3C,IAAIq/D,SAEJ,IAAK,IAAIC,SAAShtD,IACZ,sBAAeA,IAAKgtD,SACtBD,SAAWtnB,KAAKwnB,iBAAiBD,MAAOhtD,IAAIgtD,SAIhD,OAAOD,QACT,EA+BAtnB,KAAKwnB,iBAAmB,SAAU1pD,KAAMvD,IAAKmX,SAK3C,GAJI,MAAOnX,MACTA,IAAM,CAAC,GAGW,iBAATuD,KACT,MAAM,IAAIoE,UAAU,mEAItB,GAAI,sBAAe4uC,MAAOhzC,MACxB,MAAM,IAAI1Q,MAAM,uBAAyB0Q,KAAO,4CAzGpD,SAA+BA,MAC7B,IAAK,IAAI7V,EAAI,EAAGA,EAAI6V,KAAKlW,OAAQK,IAAK,CAGpC,GAFAC,EAAI4V,KAAK5P,OAAOjG,GAEN,IAANA,IAAY+3C,KAAKsP,aAAapnD,GAChC,MAAM,IAAIkF,MAAM,yDAA2D0Q,KAAO,KAGpF,GAAI7V,EAAI,IAAO+3C,KAAKsP,aAAapnD,KAAM4mD,QAAQ5mD,GAC7C,MAAM,IAAIkF,MAAM,kEAAoE0Q,KAAO,IAE/F,CACF,CAiGE2pD,CAAsB3pD,MACtB,IAIIuO,WACA0kC,SACA2W,SANAC,QAAU,KAEVN,QAAU,GACVjgD,OAAS,EAKb,GAAI7M,KAAoB,SAAbA,IAAI6H,KACbulD,QAAUptD,IAAIe,aACT,GAAmB,iBAARf,IACJ,KAARA,MACF8R,WAAa9R,SAEV,IAAmB,iBAARA,IAUhB,MAAM,IAAI2H,UAAU,uBAAyBpE,KAAO,WAAavD,IAAI5K,WAAa,+CATlF0c,WAAa9R,IAAI8R,WACjB0kC,SAAWx2C,IAAIw2C,SACf3pC,OAAS7M,IAAI6M,OACbsgD,SAAWntD,IAAImtD,SAEXntD,IAAI8sD,UACNA,QAAU9sD,IAAI8sD,QAAQrwD,UAI1B,CAEA,GAAIqwD,QACF,IAAK,IAAIp/D,EAAI,EAAGA,EAAIo/D,QAAQz/D,OAAQK,IAClC,GAAI,sBAAe6oD,MAAOuW,QAAQp/D,IAChC,MAAM,IAAImF,MAAM,wBAA0Bi6D,QAAQp/D,GAAK,2CAK7D,GAAIokB,YAAoC,iBAAfA,aAA4Bs7C,QACnD,IACEA,QAAU3nB,KAAK33C,MAAMgkB,WAAY,CAC/B+jC,cAAc,GAKlB,CAHE,MAAOrE,IAEP,MADAA,GAAG3+B,QAAU,0BAA4BtP,KAAO,WAAauO,WAAa,MAAQ0/B,GAAG3+B,QAC/E2+B,EACR,MACS1/B,YAAkC,SAApBA,WAAWjK,OAClCulD,QAAUt7C,WAAW/Q,SAGvB+rD,QAAUA,SAAW,GACrBjgD,OAASA,QAAU,EAGjB2pC,SADEA,UAAYA,SAAS6W,aACZpZ,SAASuC,SAAS6W,gBAElBpZ,SAASC,KAKtB,IAAIoZ,QAAU,CAAC,EAEf,GAAKF,QAwCE,CACLE,QAAU,CACR/pD,KACAwE,MAAOqlD,QAAQrlD,MACfgsC,WAAYqZ,QAAQrZ,WAAW79C,MAAM,GACrCsgD,SACA3pC,QAGF,IAAI0gD,UAAW,EAEf,IAAK,IAAIt3B,OAAO6gB,WACd,GAAI,sBAAeA,WAAY7gB,KAAM,CAGnC,IAFA,IAAI1oC,OAAQ,EAEH+F,EAAI,EAAGA,EAAI8gD,gBAAgB/mD,OAAQiG,IAC1C,GAAIrH,KAAKS,KAAK4gE,QAAQvZ,WAAWzgD,IAAM,IAAMwjD,WAAW7gB,KAAK8d,WAAWzgD,IAAM,IAAM,MAAO,CACzF/F,OAAQ,EACR,KACF,CAGF,GAAIA,MAAO,CACTggE,UAAW,EACXD,QAAQp0D,KAAO49C,WAAW7gB,KAC1B,KACF,CACF,CAGF,IAAKs3B,SAAU,CACbJ,SAAWA,UAAY5pD,KAAO,SAG9B,IAAIiqD,aAAe,CACjBzZ,WAAYqZ,QAAQrZ,WAAW79C,MAAM,IAEvCs3D,aAAavrD,IAAMkrD,SACnBrW,WAAWqW,UAAYK,aACvB9V,kBAAkByV,UAAY,CAC5BppB,KAAMupB,QACN75C,OAAQwgC,SAASC,KAAK,KAExBoZ,QAAQp0D,KAAO49C,WAAWqW,SAC5B,CACF,KArFc,CAIZ,GAFAA,SAAWA,UAAY5pD,KAAO,SAE1B6wC,gBAAgB1gD,QAAQy5D,WAAa,EACvC,MAAM,IAAIt6D,MAAM,gCAAkC0Q,KAAO,2EAK3D,IAAK,IAAI/W,KAFT4nD,gBAAgBx6C,KAAKuzD,UAEPrW,WACR,sBAAeA,WAAYtqD,KAC7BsqD,WAAWtqD,GAAGunD,WAAWK,gBAAgB/mD,OAAS,GAAK,GAS3D,IAJA,IAAIogE,YAAc,CAChB1Z,WAAY,IAGL2Z,IAAM,EAAGA,IAAMtZ,gBAAgB/mD,OAAQqgE,MAC9CD,YAAY1Z,WAAW2Z,KAAO,EAGhCD,YAAY1Z,WAAWK,gBAAgB/mD,OAAS,GAAK,EACrDogE,YAAYxrD,IAAMkrD,SAClBrW,WAAWqW,UAAYM,YACvBH,QAAU,CACR/pD,KACAwE,MAAO,EACPgsC,WAAY+C,WAAWqW,UAAUpZ,WAAW79C,MAAM,GAClDsgD,SACA3pC,OACA3T,KAAM49C,WAAWqW,WAEnBzV,kBAAkByV,UAAY,CAC5BppB,KAAMupB,QACN75C,OAAQwgC,SAASC,KAAK,IAE1B,CA+CAzO,KAAK8Q,MAAMhzC,MAAQ+pD,QAEnB,IAAK,IAAIK,IAAM,EAAGA,IAAMb,QAAQz/D,OAAQsgE,MAAO,CAC7C,IAAIC,UAAYd,QAAQa,KACpBE,OAAS,CAAC,EAEd,IAAK,IAAIC,SAASR,QACZ,sBAAeA,QAASQ,SAC1BD,OAAOC,OAASR,QAAQQ,QAI5BD,OAAOtqD,KAAOqqD,UACdnoB,KAAK8Q,MAAMqX,WAAaC,MAC1B,CAKA,cADOpY,UAAUpC,MACV,IAAI5N,KAAK,KAAMliC,KACxB,EAEAkiC,KAAKonB,WAAa,SAAUtpD,aACnBkiC,KAAK8Q,MAAMhzC,KACpB,EAGAkiC,KAAKwO,SAAWA,SAChBxO,KAAK2O,gBAAkBA,gBACvB3O,KAAKqR,WAAaA,WAClBrR,KAAKkQ,aAAeA,aACpBlQ,KAAK8Q,MAAQA,MACN9Q,IAAI,GACV,CACDrc,SAAS,IC73HA2kC,iBAAmB,CAC5B18B,sBACAG,oBACAM,qBACAyT,gBACAG,sBACA+B,yBACA8C,kBACA6B,gBACAI,mBACAG,sBACAE,2BACAxG,mBACAqL,gBACA1F,kBACAoG,qBACAsB,iBC9BSsa,iBAAkC,gBAFlC,aACQ,CAAC,OAAQ,QAAS,SACoCxrD,OACvE,IAAI,KACE,KACA,MAEFA,KAOJ,SAASu0C,gBAAgBxzC,MACvB,QAAOkiC,MAAOA,KAAKsR,gBAAgBxzC,KACrC,CAUA,SAAS0qD,WAAW1qD,MAClB,KAAMzX,gBAAgBmiE,YACpB,MAAM,IAAI5hE,YAAY,oDAIxB,GAAoB,iBAATkX,KAAmB,MAAM,IAAIoE,UAAU,wCAClD7b,KAAKyX,KAAOA,IACd,CAoKA,OAlKA0qD,WAAWlgE,UAAY,IAAIo+B,KAC3B8hC,WAAWlgE,UAAU8Z,KAAO,aAC5BomD,WAAWlgE,UAAUiyB,cAAe,EAepCiuC,WAAWlgE,UAAUy+B,SAAW,SAAU/E,KAAMoF,UAC9C,IAAItpB,KAAOzX,KAAKyX,KAEhB,IAAuB,IAAnBspB,SAAStpB,MAGX,OAAO,SAAU+d,MAAO7iB,KAAMy5B,SAC5B,OAAOz5B,KAAK8E,KACd,EACK,GAAIA,QAAQkkB,KACjB,OAAO,SAAUnG,MAAO7iB,KAAMy5B,SAC5B,OAAO5W,MAAMmK,IAAIloB,MAAQ+d,MAAMrP,IAAI1O,MAAQwnB,gBAAgBtD,KAAMlkB,KACnE,EAEA,IAAI4a,OAAS44B,gBAAgBxzC,MAC7B,OAAO,SAAU+d,MAAO7iB,KAAMy5B,SAC5B,OAAO5W,MAAMmK,IAAIloB,MAAQ+d,MAAMrP,IAAI1O,MAAQ4a,OAAS,IAAIsnB,KAAK,KAAMliC,MAAQ0qD,WAAWC,kBAAkB3qD,KAC1G,CAEJ,EAOA0qD,WAAWlgE,UAAUqV,QAAU,SAAUqC,UACzC,EASAwoD,WAAWlgE,UAAU6a,IAAM,SAAUnD,UACnC,OAAO3Z,KAAKiV,OACd,EAOAktD,WAAWC,kBAAoB,SAAU3qD,MACvC,MAAM,IAAI1Q,MAAM,oBAAsB0Q,KACxC,EAOA0qD,WAAWlgE,UAAUgT,MAAQ,WAC3B,OAAO,IAAIktD,WAAWniE,KAAKyX,KAC7B,EASA0qD,WAAWlgE,UAAU4/B,UAAY,SAAUxW,SACzC,OAAOrrB,KAAKyX,IACd,EASA0qD,WAAWlgE,UAAU6/B,OAAS,SAAUzW,SACtC,IAAI5T,KAAO,cAAOzX,KAAKyX,MAEvB,MAAa,SAATA,MAA4B,UAATA,KACd,0CAA4CA,KAAO,UACxC,MAATA,KACF,mDAAqDA,KAAO,UACjD,aAATA,KACF,kDAAoDA,KAAO,UAChD,QAATA,KACF,6CAA+CA,KAAO,UAC3C,SAATA,KACF,8CAAgDA,KAAO,UAC5C,cAATA,KACF,mDAAqDA,KAAO,UAG9D,6BAA+BA,KAAO,SAC/C,EAOA0qD,WAAWlgE,UAAU2O,OAAS,WAC5B,MAAO,CACLi0B,OAAQ,aACRptB,KAAMzX,KAAKyX,KAEf,EAUA0qD,WAAWj9B,SAAW,SAAUzH,MAC9B,OAAO,IAAI0kC,WAAW1kC,KAAKhmB,KAC7B,EASA0qD,WAAWlgE,UAAU+/B,OAAS,SAAU3W,SACtC,IAAIgH,QAAS,OAEkB,IAApBsJ,KAAK37B,KAAKyX,OAAyBwzC,gBAAgBjrD,KAAKyX,QACjE4a,QAAS,GAGX,IAAIwO,OAASwX,SAASr4C,KAAKyX,KAAM4a,QAEjC,MAAkB,OAAdwO,OAAO,GAEFA,OAIF,IAAMA,MACf,EAEOshC,UAAU,GAChB,CACD7kC,SAAS,EACTjK,QAAQ,ICtMCgvC,uBAAyB,CAClCJ,iBACA9hC,iBACA+hC,kBCKK,SAASI,eAAeC,aAC7B,IAAK,IAAIxiC,KAAOrrB,UAAUnT,OAAQoR,KAAO,IAAIkI,MAAMklB,KAAO,EAAIA,KAAO,EAAI,GAAIE,KAAO,EAAGA,KAAOF,KAAME,OAClGttB,KAAKstB,KAAO,GAAKvrB,UAAUurB,MAG7B,MAA0C,mBAA/BsiC,YAAYD,eACd,WAAOC,YAAYD,oBAAqB3vD,MAG1C,WAAOitB,iBAAkB2iC,eAAgB5vD,KAClD,CClBA,IAEW6vD,mBAAoC,gBAFpC,eACQ,CAAC,OAAQ,OAAQ,eACuC9rD,OACzE,IAAI,KACE,KACA,YAEFA,KAUJ,SAAS+rD,aAAa5oD,GAAIlH,MACxB,KAAM3S,gBAAgByiE,cACpB,MAAM,IAAIliE,YAAY,oDAQxB,GALkB,iBAAPsZ,KACTA,GAAK,IAAIsoD,WAAWtoD,MAIjBwZ,OAAOxZ,IAAK,MAAM,IAAIgC,UAAU,mCAErC,IAAKhB,MAAMC,QAAQnI,QAAUA,KAAKojB,MAAM1C,QACtC,MAAM,IAAIxX,UAAU,wDAGtB7b,KAAK6Z,GAAKA,GACV7Z,KAAK2S,KAAOA,MAAQ,GAEpBoD,OAAO2O,eAAe1kB,KAAM,OAAQ,CAClCmmB,IAAK,WACH,OAAOnmB,KAAK6Z,GAAGpC,MAAQ,EACzB,EAAEu0B,KAAKhsC,MACP4V,IAAK,WACH,MAAM,IAAI7O,MAAM,8CAClB,GAEJ,CAEA07D,aAAaxgE,UAAY,IAAIo+B,KAC7BoiC,aAAaxgE,UAAU8Z,KAAO,eAC9B0mD,aAAaxgE,UAAU2xB,gBAAiB,EAexC6uC,aAAaxgE,UAAUy+B,SAAW,SAAU/E,KAAMoF,UAChD,KAAM/gC,gBAAgByiE,cACpB,MAAM,IAAI5mD,UAAU,yBAItB,IAAI6mD,SAAW1iE,KAAK2S,KAAKmK,KAAIza,KAAOA,IAAIq+B,SAAS/E,KAAMoF,YAEvD,IAAI7M,aAAal0B,KAAK6Z,IA0Df,IAAIuZ,eAAepzB,KAAK6Z,KAAOga,YAAY7zB,KAAK6Z,GAAGtC,QAAUvX,KAAK6Z,GAAGtC,MAAMm0B,mBAAoB,CAEpG,IAAIQ,WAAalsC,KAAK6Z,GAAGwa,OAAOqM,SAAS/E,KAAMoF,UAE3C3a,KAAOpmB,KAAK6Z,GAAGtC,MAAMo0B,oBACrBg3B,SAAW3iE,KAAK2S,KACpB,OAAO,SAA0B6iB,MAAO7iB,KAAMy5B,SAC5C,IAAI/X,OAAS6X,WAAW1W,MAAO7iB,KAAMy5B,SAIrC,GpHhDR,SAA4B/X,OAAQiL,QAClC,IAAKF,aAAa/K,OAAQiL,QACxB,MAAM,IAAIv4B,MAAM,wBAA0Bu4B,OAAS,IAEvD,CoHyCQsjC,CAAmBvuC,OAAQjO,MACfiO,OAAOjO,OAASiO,OAAOjO,MAAMy8C,QAGvC,OAAOxuC,OAAOjO,MAAMu8C,SAAUhnC,KAAM2mC,eAAe9sC,MAAO7iB,MAAO6iB,OAGjE,IAAIJ,OAASstC,SAAS5lD,KAAIgmD,SAAWA,QAAQttC,MAAO7iB,KAAMy5B,WAC1D,OAAO/X,OAAOjO,MAAMzO,MAAM0c,OAAQe,OAEtC,CACF,CAGE,IAAI2tC,OAAS/iE,KAAK6Z,GAAG6mB,SAAS/E,KAAMoF,UAEhCiiC,UAAYhjE,KAAK2S,KACrB,OAAO,SAA0B6iB,MAAO7iB,KAAMy5B,SAC5C,IAAIvyB,GAAKkpD,OAAOvtC,MAAO7iB,KAAMy5B,SAG7B,GAFYvyB,IAAMA,GAAGgpD,QAGnB,OAAOhpD,GAAGmpD,UAAWrnC,KAAM2mC,eAAe9sC,MAAO7iB,MAAO6iB,OAGxD,IAAIJ,OAASstC,SAAS5lD,KAAIgmD,SAAWA,QAAQttC,MAAO7iB,KAAMy5B,WAC1D,OAAOvyB,GAAGlC,MAAMkC,GAAIub,OAExB,CACF,CA7FE,IAAI5V,MAAQxf,KAAK6Z,GAAGpC,KAChBoC,GAAK2F,SAASmc,KAAOsD,gBAAgBtD,KAAMnc,YAASre,EACpD8hE,MAAsB,mBAAPppD,KAAoC,IAAfA,GAAGgpD,QAEvCK,UAAY1tC,OACVA,MAAMmK,IAAIngB,OACLgW,MAAMrP,IAAI3G,OAGfA,SAASmc,KACJsD,gBAAgBtD,KAAMnc,OAGxBijD,aAAaU,oBAAoB3jD,OAG1C,GAAIyjD,MAAO,CAGT,IAAIJ,QAAU7iE,KAAK2S,KACnB,OAAO,SAA0B6iB,MAAO7iB,KAAMy5B,SAE5C,OADS82B,UAAU1tC,MACZ3b,CAAGgpD,QAASlnC,KAAM2mC,eAAe9sC,MAAO7iB,MAAO6iB,MACxD,CACF,CAEE,OAAQktC,SAASnhE,QACf,KAAK,EACH,OAAO,SAA0Bi0B,MAAO7iB,KAAMy5B,SAE5C,OADS82B,UAAU1tC,MACZ3b,EACT,EAEF,KAAK,EACH,OAAO,SAA0B2b,MAAO7iB,KAAMy5B,SAG5C,OAFS82B,UAAU1tC,MAEZ3b,EAAGupD,EADKV,SAAS,IACLltC,MAAO7iB,KAAMy5B,SAClC,EAEF,KAAK,EACH,OAAO,SAA0B5W,MAAO7iB,KAAMy5B,SAC5C,IAAIvyB,GAAKqpD,UAAU1tC,OACf4tC,SAAWV,SAAS,GACpBW,SAAWX,SAAS,GACxB,OAAO7oD,GAAGupD,SAAS5tC,MAAO7iB,KAAMy5B,SAAUi3B,SAAS7tC,MAAO7iB,KAAMy5B,SAClE,EAEF,QACE,OAAO,SAA0B5W,MAAO7iB,KAAMy5B,SAG5C,OAFS82B,UAAU1tC,MAEZ3b,IADM6oD,SAAS5lD,KAAIgmD,SAAWA,QAAQttC,MAAO7iB,KAAMy5B,WAE5D,EAyCV,EAOAq2B,aAAaxgE,UAAUqV,QAAU,SAAUqC,UACzCA,SAAS3Z,KAAK6Z,GAAI,KAAM7Z,MAExB,IAAK,IAAI4B,EAAI,EAAGA,EAAI5B,KAAK2S,KAAKpR,OAAQK,IACpC+X,SAAS3Z,KAAK2S,KAAK/Q,GAAI,QAAUA,EAAI,IAAK5B,KAE9C,EASAyiE,aAAaxgE,UAAU6a,IAAM,SAAUnD,UAKrC,IAJA,IAAIE,GAAK7Z,KAAKghC,QAAQrnB,SAAS3Z,KAAK6Z,GAAI,KAAM7Z,OAE1C2S,KAAO,GAEF/Q,EAAI,EAAGA,EAAI5B,KAAK2S,KAAKpR,OAAQK,IACpC+Q,KAAK/Q,GAAK5B,KAAKghC,QAAQrnB,SAAS3Z,KAAK2S,KAAK/Q,GAAI,QAAUA,EAAI,IAAK5B,OAGnE,OAAO,IAAIyiE,aAAa5oD,GAAIlH,KAC9B,EAOA8vD,aAAaxgE,UAAUgT,MAAQ,WAC7B,OAAO,IAAIwtD,aAAaziE,KAAK6Z,GAAI7Z,KAAK2S,KAAKvI,MAAM,GACnD,EAOAq4D,aAAaU,oBAAsB,SAAU1rD,MAC3C,MAAM,IAAI1Q,MAAM,sBAAwB0Q,KAC1C,EAIA,IAAI6rD,aAAeb,aAAaxgE,UAAUqH,SA8F1C,SAASi6D,eAAeC,SAAUviC,KAAM5V,SAStC,IARA,IAMI5pB,MANAgiE,MAAQ,GAGRC,MAAQ,qDACRC,SAAW,EAI2B,QAAlCliE,MAAQiiE,MAAMv3C,KAAKq3C,YAMzB,GAHAC,OAASD,SAASlwD,UAAUqwD,SAAUliE,MAAM8V,OAC5CosD,SAAWliE,MAAM8V,MAEA,OAAb9V,MAAM,GAERgiE,OAAS,IACTE,eACK,CAELA,UAAYliE,MAAM,GAAGF,OACrB,IAAI4zB,SAAW8L,KAAKx/B,MAAM,IAE1B,IAAK0zB,SACH,MAAM,IAAIyuC,eAAe,sBAAwBniE,MAAM,GAAK,oBAG9D,QAAiBN,IAAbM,MAAM,GAER,cAAe0zB,UACb,IAAK,SACHsuC,OAAStuC,SACT,MAEF,IAAK,SACH,GAAI9B,OAAO8B,UACTsuC,OAAStuC,SAAS4M,MAAM1W,aACnB,KAAIxQ,MAAMC,QAAQqa,UAUvB,MAAM,IAAItZ,UAAU,aAAepa,MAAM,GAAK,+CAR9CgiE,OAAStuC,SAASrY,KAAI,SAAUza,IAAKkV,OACnC,GAAI8b,OAAOhxB,KACT,OAAOA,IAAI0/B,MAAM1W,SAGnB,MAAM,IAAIxP,UAAU,aAAepa,MAAM,GAAK,IAAM8V,MAAQ,mBAC9D,IAAGgF,KAAK,IAGV,CAEA,MAEF,QACE,MAAM,IAAIV,UAAU,aAAepa,MAAM,GAAK,mDAE7C,CAEL,IAAI4xB,OAAO8B,SAAS1zB,MAAM,KAAO0zB,SAAS1zB,MAAM,KAG9C,MAAM,IAAIoa,UAAU,aAAepa,MAAM,GAAK,IAAMA,MAAM,GAAK,oBAF/DgiE,OAAStuC,SAAS1zB,MAAM,IAAIsgC,MAAM1W,QAItC,CACF,CAKF,OAFAo4C,OAASD,SAASp5D,MAAMu5D,SAG1B,CAtJAlB,aAAaxgE,UAAUqH,SAAW,SAAU+hB,SAC1C,IAAIsW,aACAlqB,KAAOzX,KAAK6Z,GAAGvQ,SAAS+hB,SAO5B,OALIA,SAAsC,iBAApBA,QAAQ4W,SAAwB,sBAAe5W,QAAQ4W,QAASxqB,QAEpFkqB,aAAetW,QAAQ4W,QAAQxqB,MAAMzX,KAAMqrB,eAGjB,IAAjBsW,aACFA,aAIF2hC,aAAaltD,KAAKpW,KAAMqrB,QACjC,EAQAo3C,aAAaxgE,UAAU4/B,UAAY,SAAUxW,SAC3C,IAAI1Y,KAAO3S,KAAK2S,KAAKmK,KAAI,SAAUza,KACjC,OAAOA,IAAIiH,SAAS+hB,QACtB,IAGA,OAFSsI,yBAAyB3zB,KAAK6Z,IAAM,IAAM7Z,KAAK6Z,GAAGvQ,SAAS+hB,SAAW,IAAMrrB,KAAK6Z,GAAGvQ,SAAS+hB,UAE1F,IAAM1Y,KAAK4J,KAAK,MAAQ,GACtC,EAOAkmD,aAAaxgE,UAAU2O,OAAS,WAC9B,MAAO,CACLi0B,OAAQ,eACRhrB,GAAI7Z,KAAK6Z,GACTlH,KAAM3S,KAAK2S,KAEf,EAUA8vD,aAAav9B,SAAW,SAAUzH,MAChC,OAAO,IAAIglC,aAAahlC,KAAK5jB,GAAI4jB,KAAK9qB,KACxC,EAQA8vD,aAAaxgE,UAAU6/B,OAAS,SAAUzW,SACxC,IAAI1Y,KAAO3S,KAAK2S,KAAKmK,KAAI,SAAUza,KACjC,OAAOA,IAAIy/B,OAAOzW,QACpB,IAEA,MAAO,+BAAiC,cAAOrrB,KAAK6Z,IAAM,wEAA0ElH,KAAK4J,KAAK,yCAA2C,gEAC3L,EAqFA,IAAIsnD,UAAYpB,aAAaxgE,UAAU8/B,MA+FvC,OAlFA0gC,aAAaxgE,UAAU8/B,MAAQ,SAAU1W,SACvC,IAAIy4C,UAOJ,OALIz4C,SAAsC,iBAApBA,QAAQ4W,SAAwB,sBAAe5W,QAAQ4W,QAASjiC,KAAKyX,QAEzFqsD,UAAYz4C,QAAQ4W,QAAQjiC,KAAKyX,MAAMzX,KAAMqrB,eAGtB,IAAdy4C,UACFA,UAIFD,UAAUztD,KAAKpW,KAAMqrB,QAC9B,EAQAo3C,aAAaxgE,UAAU+/B,OAAS,SAAU3W,SACxC,IAII04C,eAYAC,YAhBArxD,KAAO3S,KAAK2S,KAAKmK,KAAI,SAAUza,KAEjC,OAAOA,IAAI0/B,MAAM1W,QACnB,IAeA,OAZIuqB,eAAe51C,KAAKyX,QACtBssD,eAAiBnuB,eAAe51C,KAAKyX,QAInCkkB,KAAK37B,KAAKyX,OAA2C,mBAA1BkkB,KAAK37B,KAAKyX,MAAMsqB,OAAyD,iBAA1BpG,KAAK37B,KAAKyX,MAAMsqB,OAAuD,iBAA1BpG,KAAK37B,KAAKyX,MAAMsqB,QAEzIgiC,eAAiBpoC,KAAK37B,KAAKyX,MAAMsqB,cAKpBgiC,gBACb,IAAK,WAEHC,YAAcD,eAAe/jE,KAAMqrB,SACnC,MAEF,IAAK,SAEH24C,YAAcT,eAAeQ,eAAgB/jE,KAAMqrB,SACnD,MAEF,IAAK,SAEH,cAAe04C,eAAepxD,KAAKpR,SACjC,IAAK,WACHyiE,YAAcD,eAAepxD,KAAKpR,QAAQvB,KAAMqrB,SAChD,MAEF,IAAK,SACH24C,YAAcT,eAAeQ,eAAepxD,KAAKpR,QAASvB,KAAMqrB,UAMxE,YAA2B,IAAhB24C,YACFA,YAGFT,e1E1BkB,0C0E0BcvjE,KAAMqrB,QAC/C,EAOAo3C,aAAaxgE,UAAUigC,cAAgB,WACrC,OAAOliC,KAAK+b,KAAO,IAAM/b,KAAKyX,IAChC,EAEOgrD,YAAY,GAClB,CACDnlC,SAAS,EACTjK,QAAQ,ICveC4wC,yBAA2B,CACpC9jC,iBACAkiC,uBACAG,oBCFS0B,sBAAwB,CACjC/jC,iBACAgkC,kBCL6B,CAC7BC,iBCD2C,gBAFlC,QACQ,IACsD,KAgCvE,SAASC,MAAM1/C,MAAOC,IAAK0/C,MACzB,KAAMtkE,gBAAgBqkE,OACpB,MAAM,IAAI9jE,YAAY,oDAGxB,IAAIgkE,SAAW5/C,YACX6/C,OAAS5/C,UACT6/C,QAAUH,WAEd,GAAIC,SACF,GAAItyC,YAAYtN,OACdA,MAAQA,MAAM1U,gBACT,GAAqB,iBAAV0U,MAChB,MAAM,IAAI9I,UAAU,oCAIxB,GAAI2oD,OACF,GAAIvyC,YAAYrN,KACdA,IAAMA,IAAI3U,gBACL,GAAmB,iBAAR2U,IAChB,MAAM,IAAI/I,UAAU,kCAIxB,GAAI4oD,QACF,GAAIxyC,YAAYqyC,MACdA,KAAOA,KAAKr0D,gBACP,GAAoB,iBAATq0D,KAChB,MAAM,IAAIzoD,UAAU,mCAIxB7b,KAAK2kB,MAAQ4/C,SAAWxiE,WAAW4iB,OAAS,EAC5C3kB,KAAK4kB,IAAM4/C,OAASziE,WAAW6iB,KAAO,EACtC5kB,KAAKskE,KAAOG,QAAU1iE,WAAWuiE,MAAQ,CAC3C,CAmQA,OA7PAD,MAAMpiE,UAAU8Z,KAAO,QACvBsoD,MAAMpiE,UAAUwwB,SAAU,EAW1B4xC,MAAMriE,MAAQ,SAAUyE,KACtB,GAAmB,iBAARA,IACT,OAAO,KAGT,IACIi+D,KADOj+D,IAAI4V,MAAM,KACLS,KAAI,SAAUza,KAC5B,OAAON,WAAWM,IACpB,IAKA,GAJcqiE,KAAKzmD,MAAK,SAAUzQ,KAChC,OAAO1L,MAAM0L,IACf,IAGE,OAAO,KAGT,OAAQk3D,KAAKnjE,QACX,KAAK,EACH,OAAO,IAAI8iE,MAAMK,KAAK,GAAIA,KAAK,IAEjC,KAAK,EACH,OAAO,IAAIL,MAAMK,KAAK,GAAIA,KAAK,GAAIA,KAAK,IAE1C,QACE,OAAO,KAEb,EAOAL,MAAMpiE,UAAUgT,MAAQ,WACtB,OAAO,IAAIovD,MAAMrkE,KAAK2kB,MAAO3kB,KAAK4kB,IAAK5kB,KAAKskE,KAC9C,EASAD,MAAMpiE,UAAUo0B,KAAO,WACrB,IAAIltB,IAAM,EACNwb,MAAQ3kB,KAAK2kB,MACb2/C,KAAOtkE,KAAKskE,KAEZtsC,KADMh4B,KAAK4kB,IACED,MAYjB,OAVI5S,KAAKuyD,QAAUvyD,KAAKimB,MACtB7uB,IAAMhJ,KAAK6D,KAAKg0B,KAAOssC,MACL,IAATtsC,OACT7uB,IAAM,GAGJrH,MAAMqH,OACRA,IAAM,GAGD,CAACA,IACV,EAQAk7D,MAAMpiE,UAAU4E,IAAM,WACpB,IAAIwvB,KAAOr2B,KAAKq2B,OAAO,GAEvB,OAAIA,KAAO,EACLr2B,KAAKskE,KAAO,EAEPtkE,KAAK2kB,MAGL3kB,KAAK2kB,OAAS0R,KAAO,GAAKr2B,KAAKskE,UAGxC,CAEJ,EAQAD,MAAMpiE,UAAU6E,IAAM,WACpB,IAAIuvB,KAAOr2B,KAAKq2B,OAAO,GAEvB,OAAIA,KAAO,EACLr2B,KAAKskE,KAAO,EAEPtkE,KAAK2kB,OAAS0R,KAAO,GAAKr2B,KAAKskE,KAG/BtkE,KAAK2kB,WAGd,CAEJ,EAUA0/C,MAAMpiE,UAAUqV,QAAU,SAAUqC,UAClC,IAAIzZ,EAAIF,KAAK2kB,MACT2/C,KAAOtkE,KAAKskE,KACZ1/C,IAAM5kB,KAAK4kB,IACXhjB,EAAI,EAER,GAAI0iE,KAAO,EACT,KAAOpkE,EAAI0kB,KACTjL,SAASzZ,EAAG,CAAC0B,GAAI5B,MACjBE,GAAKokE,KACL1iE,SAEG,GAAI0iE,KAAO,EAChB,KAAOpkE,EAAI0kB,KACTjL,SAASzZ,EAAG,CAAC0B,GAAI5B,MACjBE,GAAKokE,KACL1iE,GAGN,EAYAyiE,MAAMpiE,UAAU6a,IAAM,SAAUnD,UAC9B,IAAIoE,MAAQ,GAIZ,OAHA/d,KAAKsX,SAAQ,SAAU2E,MAAO1E,MAAOrD,KACnC6J,MAAMxG,MAAM,IAAMoC,SAASsC,MAAO1E,MAAOrD,IAC3C,IACO6J,KACT,EAQAsmD,MAAMpiE,UAAU2gC,QAAU,WACxB,IAAI7kB,MAAQ,GAIZ,OAHA/d,KAAKsX,SAAQ,SAAU2E,MAAO1E,OAC5BwG,MAAMxG,MAAM,IAAM0E,KACpB,IACO8B,KACT,EAQAsmD,MAAMpiE,UAAU0O,QAAU,WAExB,OAAO3Q,KAAK4iC,SACd,EAaAyhC,MAAMpiE,UAAUs0B,OAAS,SAAUlL,SACjC,IAAI5kB,IAAM8vB,OAAOv2B,KAAK2kB,MAAO0G,SAO7B,OALkB,IAAdrrB,KAAKskE,OACP79D,KAAO,IAAM8vB,OAAOv2B,KAAKskE,KAAMj5C,UAGjC5kB,KAAO,IAAM8vB,OAAOv2B,KAAK4kB,IAAKyG,QAEhC,EAQAg5C,MAAMpiE,UAAUqH,SAAW,WACzB,OAAOtJ,KAAKu2B,QACd,EASA8tC,MAAMpiE,UAAU2O,OAAS,WACvB,MAAO,CACLi0B,OAAQ,QACRlgB,MAAO3kB,KAAK2kB,MACZC,IAAK5kB,KAAK4kB,IACV0/C,KAAMtkE,KAAKskE,KAEf,EAUAD,MAAMn/B,SAAW,SAAUzH,MACzB,OAAO,IAAI4mC,MAAM5mC,KAAK9Y,MAAO8Y,KAAK7Y,IAAK6Y,KAAK6mC,KAC9C,EAEOD,KAAK,GACX,CACD/mC,SAAS,KFnUTqkB,iBACAgjB,gBGL0C,gBAFjC,YACQ,CAAC,QAAS,OAAQ,SACmCjuD,OACtE,IAAI,MACG,KACD,MAEFA,KAiBJ,SAASkuD,UAAU3c,WAAY4c,aAC7B,KAAM7kE,gBAAgB4kE,WACpB,MAAM,IAAIrkE,YAAY,oDAMxB,GAHAP,KAAKioD,WAAaA,WAClBjoD,KAAK6kE,YAAcA,cAAe,GAE7BhqD,MAAMC,QAAQmtC,cAAgBA,WAAWlyB,MAAM1C,QAClD,MAAM,IAAIxX,UAAU,8DAGtB,GAAI7b,KAAK6kE,cAAgB7kE,KAAK0rC,mBAC5B,MAAM,IAAI3kC,MAAM,oDAEpB,CA0NA,SAAS+9D,YAAYngD,MAAOC,IAAK0/C,MAC/B,OAAO,IAAID,MAAMpyC,YAAYtN,OAASA,MAAM1U,WAAa0U,MAAOsN,YAAYrN,KAAOA,IAAI3U,WAAa2U,IAAKqN,YAAYqyC,MAAQA,KAAKr0D,WAAaq0D,KACjJ,CAEA,OA5NAM,UAAU3iE,UAAY,IAAIo+B,KAC1BukC,UAAU3iE,UAAU8Z,KAAO,YAC3B6oD,UAAU3iE,UAAU4xB,aAAc,EAelC+wC,UAAU3iE,UAAUy+B,SAAW,SAAU/E,KAAMoF,UAM7C,IAAIgkC,eAAiBjoD,IAAI9c,KAAKioD,YAAY,SAAU3kB,MAAO1hC,GACzD,GAAIqyB,YAAYqP,OAAQ,CACtB,GAAIA,MAAM0hC,WAAY,CAEpB,IAAIpsB,cAAgB7iC,OAAO4E,OAAOomB,UAClC6X,cAAch0B,KAAM,EAEpB,IAAIqgD,UAAY3hC,MAAM3e,MAAM+b,SAAS/E,KAAMid,eAEvCssB,QAAU5hC,MAAM1e,IAAI8b,SAAS/E,KAAMid,eAEnCusB,SAAW7hC,MAAMghC,KAAOhhC,MAAMghC,KAAK5jC,SAAS/E,KAAMid,eAAiB,WACrE,OAAO,CACT,EACA,OAAO,SAAuBpjB,MAAO7iB,KAAMy5B,SACzC,IAAInkC,EAAIouB,KAAK+V,SAASz7B,UAClBmoC,UAAY/iC,OAAO4E,OAAOhI,MAE9B,OADAmmC,UAAUl0B,IAAM3c,EAAErG,GACXkjE,YAAYG,UAAUzvC,MAAOsjB,UAAW1M,SAAU84B,QAAQ1vC,MAAOsjB,UAAW1M,SAAU+4B,SAAS3vC,MAAOsjB,UAAW1M,SAC1H,CACF,CAEE,IAAIg5B,WAAa9hC,MAAM3e,MAAM+b,SAAS/E,KAAMoF,UAExCskC,SAAW/hC,MAAM1e,IAAI8b,SAAS/E,KAAMoF,UAEpCukC,UAAYhiC,MAAMghC,KAAOhhC,MAAMghC,KAAK5jC,SAAS/E,KAAMoF,UAAY,WACjE,OAAO,CACT,EAEA,OAAO,SAAuBvL,MAAO7iB,KAAMy5B,SACzC,OAAO04B,YAAYM,WAAW5vC,MAAO7iB,KAAMy5B,SAAUi5B,SAAS7vC,MAAO7iB,KAAMy5B,SAAUk5B,UAAU9vC,MAAO7iB,KAAMy5B,SAC9G,CAEJ,CAAO,GAAIlY,aAAaoP,QAAyB,QAAfA,MAAM7rB,KAAgB,CAEtD,IAAI8tD,eAAiBxvD,OAAO4E,OAAOomB,UAEnCwkC,eAAe3gD,KAAM,EAErB,IAAI4gD,UAAYliC,MAAM5C,SAAS/E,KAAM4pC,gBAErC,OAAO,SAAuB/vC,MAAO7iB,KAAMy5B,SACzC,IAAInkC,EAAIouB,KAAK+V,SAASz7B,UAClBmoC,UAAY/iC,OAAO4E,OAAOhI,MAE9B,OADAmmC,UAAUl0B,IAAM3c,EAAErG,GACX4jE,UAAUhwC,MAAOsjB,UAAW1M,QACrC,CACF,CAEE,IAAIq5B,WAAaniC,MAAM5C,SAAS/E,KAAMoF,UAEtC,OAAO,SAAuBvL,MAAO7iB,KAAMy5B,SACzC,OAAOq5B,WAAWjwC,MAAO7iB,KAAMy5B,QACjC,CAEJ,IACI70B,MAAQ0nB,gBAAgBtD,KAAM,SAClC,OAAO,SAAuBnG,MAAO7iB,KAAMy5B,SACzC,IAAI6b,WAAanrC,IAAIioD,gBAAgB,SAAUW,eAC7C,OAAOA,cAAclwC,MAAO7iB,KAAMy5B,QACpC,IACA,OAAO70B,SAAS0wC,WAClB,CACF,EAOA2c,UAAU3iE,UAAUqV,QAAU,SAAUqC,UACtC,IAAK,IAAI/X,EAAI,EAAGA,EAAI5B,KAAKioD,WAAW1mD,OAAQK,IAC1C+X,SAAS3Z,KAAKioD,WAAWrmD,GAAI,cAAgBA,EAAI,IAAK5B,KAE1D,EASA4kE,UAAU3iE,UAAU6a,IAAM,SAAUnD,UAGlC,IAFA,IAAIsuC,WAAa,GAERrmD,EAAI,EAAGA,EAAI5B,KAAKioD,WAAW1mD,OAAQK,IAC1CqmD,WAAWrmD,GAAK5B,KAAKghC,QAAQrnB,SAAS3Z,KAAKioD,WAAWrmD,GAAI,cAAgBA,EAAI,IAAK5B,OAGrF,OAAO,IAAI4kE,UAAU3c,WAAYjoD,KAAK6kE,YACxC,EAOAD,UAAU3iE,UAAUgT,MAAQ,WAC1B,OAAO,IAAI2vD,UAAU5kE,KAAKioD,WAAW79C,MAAM,GAAIpK,KAAK6kE,YACtD,EAOAD,UAAU3iE,UAAUypC,iBAAmB,WACrC,OAAkC,IAA3B1rC,KAAKioD,WAAW1mD,QAAgBmyB,eAAe1zB,KAAKioD,WAAW,KAA2C,iBAA7BjoD,KAAKioD,WAAW,GAAGhsC,KACzG,EAQA2oD,UAAU3iE,UAAU0pC,kBAAoB,WACtC,OAAO3rC,KAAK0rC,mBAAqB1rC,KAAKioD,WAAW,GAAGhsC,MAAQ,IAC9D,EAQA2oD,UAAU3iE,UAAU4/B,UAAY,SAAUxW,SAExC,OAAOrrB,KAAK6kE,YAAc,IAAM7kE,KAAK2rC,oBAAsB,IAAM3rC,KAAKioD,WAAW1rC,KAAK,MAAQ,GAChG,EAOAqoD,UAAU3iE,UAAU2O,OAAS,WAC3B,MAAO,CACLi0B,OAAQ,YACRojB,WAAYjoD,KAAKioD,WACjB4c,YAAa7kE,KAAK6kE,YAEtB,EAUAD,UAAU1/B,SAAW,SAAUzH,MAC7B,OAAO,IAAImnC,UAAUnnC,KAAKwqB,WAAYxqB,KAAKonC,YAC7C,EAQAD,UAAU3iE,UAAU6/B,OAAS,SAAUzW,SAIrC,IAFA,IAAI48B,WAAa,GAERrmD,EAAI,EAAGA,EAAI5B,KAAKioD,WAAW1mD,OAAQK,IAC1CqmD,WAAWrmD,GAAK5B,KAAKioD,WAAWrmD,GAAGkgC,SAGrC,OAAI9hC,KAAK6kE,YACA,sGAA6G,cAAO7kE,KAAK2rC,qBAAuB,UAEhJ,kEAAoEsc,WAAW1rC,KAAK,yCAA2C,iEAE1I,EAQAqoD,UAAU3iE,UAAU+/B,OAAS,SAAU3W,SACrC,IAAI48B,WAAajoD,KAAKioD,WAAWnrC,KAAI,SAAUwmB,OAC7C,OAAOA,MAAMvB,MAAM1W,QACrB,IACA,OAAOrrB,KAAK6kE,YAAc,IAAM7kE,KAAK2rC,oBAA2B,KAAOsc,WAAW1rC,KAAK,KAAO,GAChG,EAOOqoD,SAAS,GACf,CACDtnC,SAAS,EACTjK,QAAQ,KCtQCsyC,iBAAkC,gBAFlC,aACQ,CAAC,SACqDjvD,OACvE,IAAI,MAEAA,KAQJ,SAASkvD,WAAWlwC,YAClB,KAAM11B,gBAAgB4lE,YACpB,MAAM,IAAIrlE,YAAY,oDAKxB,GAFAP,KAAK01B,WAAaA,YAAc,CAAC,EAE7BA,aAC0B,iBAAfA,aAA6B3f,OAAOoB,KAAKue,YAAYK,OAAM,SAAU5f,KAChF,OAAOkd,OAAOqC,WAAWvf,KAC3B,KACE,MAAM,IAAI0F,UAAU,mCAG1B,CAmLA,OAjLA+pD,WAAW3jE,UAAY,IAAIo+B,KAC3BulC,WAAW3jE,UAAU8Z,KAAO,aAC5B6pD,WAAW3jE,UAAU6xB,cAAe,EAepC8xC,WAAW3jE,UAAUy+B,SAAW,SAAU/E,KAAMoF,UAC9C,IAAI8kC,YAAc,CAAC,EAEnB,IAAK,IAAI1vD,OAAOnW,KAAK01B,WACnB,GAAI,sBAAe11B,KAAK01B,WAAYvf,KAAM,CAGxC,IAAI2vD,eAAiBltC,UAAUziB,KAC3B4vD,UAAYppC,KAAK36B,MAAM8jE,gBAE3B,IAAK3mC,eAAen/B,KAAK01B,WAAYqwC,WACnC,MAAM,IAAIh/D,MAAM,0BAA4Bg/D,UAAY,KAG1DF,YAAYE,WAAa/lE,KAAK01B,WAAWvf,KAAKuqB,SAAS/E,KAAMoF,SAC/D,CAGF,OAAO,SAAwBvL,MAAO7iB,KAAMy5B,SAC1C,IAAIl4B,IAAM,CAAC,EAEX,IAAK,IAAI+rB,QAAQ4lC,YACX,sBAAeA,YAAa5lC,QAC9B/rB,IAAI+rB,MAAQ4lC,YAAY5lC,MAAMzK,MAAO7iB,KAAMy5B,UAI/C,OAAOl4B,GACT,CACF,EAOA0xD,WAAW3jE,UAAUqV,QAAU,SAAUqC,UACvC,IAAK,IAAIxD,OAAOnW,KAAK01B,WACf,sBAAe11B,KAAK01B,WAAYvf,MAClCwD,SAAS3Z,KAAK01B,WAAWvf,KAAM,cAAgByiB,UAAUziB,KAAO,IAAKnW,KAG3E,EASA4lE,WAAW3jE,UAAU6a,IAAM,SAAUnD,UACnC,IAAI+b,WAAa,CAAC,EAElB,IAAK,IAAIvf,OAAOnW,KAAK01B,WACf,sBAAe11B,KAAK01B,WAAYvf,OAClCuf,WAAWvf,KAAOnW,KAAKghC,QAAQrnB,SAAS3Z,KAAK01B,WAAWvf,KAAM,cAAgByiB,UAAUziB,KAAO,IAAKnW,QAIxG,OAAO,IAAI4lE,WAAWlwC,WACxB,EAOAkwC,WAAW3jE,UAAUgT,MAAQ,WAC3B,IAAIygB,WAAa,CAAC,EAElB,IAAK,IAAIvf,OAAOnW,KAAK01B,WACf,sBAAe11B,KAAK01B,WAAYvf,OAClCuf,WAAWvf,KAAOnW,KAAK01B,WAAWvf,MAItC,OAAO,IAAIyvD,WAAWlwC,WACxB,EASAkwC,WAAW3jE,UAAU4/B,UAAY,SAAUxW,SACzC,IAAIpG,QAAU,GAEd,IAAK,IAAI9O,OAAOnW,KAAK01B,WACf,sBAAe11B,KAAK01B,WAAYvf,MAClC8O,QAAQnX,KAAK8qB,UAAUziB,KAAO,KAAOnW,KAAK01B,WAAWvf,KAAK7M,SAAS+hB,UAIvE,MAAO,IAAMpG,QAAQ1I,KAAK,MAAQ,GACpC,EAOAqpD,WAAW3jE,UAAU2O,OAAS,WAC5B,MAAO,CACLi0B,OAAQ,aACRnP,WAAY11B,KAAK01B,WAErB,EAUAkwC,WAAW1gC,SAAW,SAAUzH,MAC9B,OAAO,IAAImoC,WAAWnoC,KAAK/H,WAC7B,EASAkwC,WAAW3jE,UAAU6/B,OAAS,SAAUzW,SACtC,IAAIpG,QAAU,GAEd,IAAK,IAAI9O,OAAOnW,KAAK01B,WACf,sBAAe11B,KAAK01B,WAAYvf,MAClC8O,QAAQnX,KAAK,2CAA6C,cAAOqI,KAApD,8HAAgMnW,KAAK01B,WAAWvf,KAAK2rB,OAAOzW,UAI7O,MAAO,iEAAmEpG,QAAQ1I,KAAK,yCAA2C,gEACpI,EAQAqpD,WAAW3jE,UAAU+/B,OAAS,SAAU3W,SACtC,IAAIpG,QAAU,GAEd,IAAK,IAAI9O,OAAOnW,KAAK01B,WACf,sBAAe11B,KAAK01B,WAAYvf,MAClC8O,QAAQnX,KAAK,YAAcqI,IAAM,QAAUnW,KAAK01B,WAAWvf,KAAK4rB,MAAM1W,SAAW,QAIrF,MAAO,8BAA8BxN,OAAOoH,QAAQ1I,KAAK,MAAO,yBAClE,EAEOqpD,UAAU,GAChB,CACDtoC,SAAS,EACTjK,QAAQ,IChNC2yC,uBAAyB,CAClC7lC,iBACAwlC,kBCCSM,mBAAoC,gBAFpC,eACQ,CAAC,SACuDvvD,OACzE,IAAI,MAEAA,KAaJ,SAASwvD,aAAaC,GAAItsD,GAAIlH,KAAMyzD,SAAUC,cAC5C,KAAMrmE,gBAAgBkmE,cACpB,MAAM,IAAI3lE,YAAY,oDAIxB,GAAkB,iBAAP4lE,GACT,MAAM,IAAItqD,UAAU,sCAGtB,GAAkB,iBAAPhC,GACT,MAAM,IAAIgC,UAAU,sCAGtB,IAAKhB,MAAMC,QAAQnI,QAAUA,KAAKojB,MAAM1C,QACtC,MAAM,IAAIxX,UAAU,wDAGtB7b,KAAKomE,UAAwB,IAAbA,SAChBpmE,KAAKqmE,cAAgC,IAAjBA,aACpBrmE,KAAKmmE,GAAKA,GACVnmE,KAAK6Z,GAAKA,GACV7Z,KAAK2S,KAAOA,MAAQ,EACtB,CA6HA,SAAS2zD,8BAA8B5mE,KAAMmuC,YAAau4B,SAAUzzD,KAAM8wD,OAExE,IAmBIzsD,OAnBAw3B,WAAab,cAAcjuC,KAAMmuC,aACjCN,cAAgBQ,iBAAiBruC,KAAMmuC,aAE3C,GAAoB,QAAhBA,aAAyBl7B,KAAKpR,OAAS,GAA8B,qBAAzB7B,KAAKwiC,iBAAmE,0BAAzBxiC,KAAKwiC,gBAClG,OAAOvvB,KAAKmK,KAAI,SAAUza,KACxB,OAAQA,IAAI8/B,aAAapmB,MAEvB,IAAK,YACL,IAAK,eACL,IAAK,aACL,IAAK,kBACH,OAAO,EAET,QACE,OAAO,EAEb,IAKF,OAAQpJ,KAAKpR,QACX,KAAK,EACHyV,OAAS,GACT,MAEF,KAAK,EAID,IAAIuvD,kBAAoB54B,cAAch7B,KAAK,GAAIk7B,aAE/C,GAAI41B,OAA+B,OAAtB8C,kBAA4B,CACvC,IAAIC,kBACAC,eAWJ,GAToB,SAAhB54B,aACF24B,kBAAoB7zD,KAAK,GAAGuvB,gBAC5BukC,eAAiB/mE,KAAKwiC,kBAGtBskC,kBAAoB7zD,KAAK,GAAGwvB,aAAaD,gBACzCukC,eAAiB/mE,KAAKyiC,aAAaD,kBAG0B,IAA3DxM,WAAW8Y,YAAYi4B,gBAAgBr5B,gBAA2B,CACpEp2B,OAAS,EAAC,GACV,KACF,CAEA,IAAqE,IAAjE0e,WAAW6wC,mBAAmBC,mBAAmBl5B,YAAuB,CAC1Et2B,OAAS,EAAC,GACV,KACF,CACF,CAEA,GAA0B,OAAtBuvD,kBAA4B,CAE9BvvD,OAAS,EAAC,GACV,KACF,CAEA,GAAIuvD,mBAAqB/3B,WAAY,CAEnCx3B,OAAS,EAAC,GACV,KACF,CAGAA,OAAS,EAAC,GAEZ,MAEF,KAAK,EAGD,IAAI0vD,UAuBAC,UApBAC,cAAgBj5B,cAAch7B,KAAK,GAAIk7B,aAEvCg5B,aAAe74B,kBAAkBtuC,KAAMiT,KAAK,GAAIk7B,aAKlD64B,UAHoB,OAAlBE,gBAIOA,gBAAkBp4B,YAAgC,UAAlBjB,gBAA8Bs5B,cAM9DD,cAAgBp4B,YAS3B,IAsBMs4B,gBAEAC,cACAC,cAzBFC,cAAgBt5B,cAAch7B,KAAK,GAAIk7B,aAEvCq5B,aAAel5B,kBAAkBtuC,KAAMiT,KAAK,GAAIk7B,aAmBpD,GAdE84B,UAHoB,OAAlBM,gBAIOA,gBAAkBz4B,YAAgC,SAAlBjB,gBAA6B25B,cAM7DD,cAAgBz4B,YAOvBi1B,MAMkB,SAAhB51B,aACFi5B,gBAAkBpnE,KAAKwiC,gBACvB6kC,cAAgBrnE,KAAKiT,KAAK,GAAGuvB,gBAC7B8kC,cAAgBtnE,KAAKiT,KAAK,GAAGuvB,kBAG7B4kC,gBAAkBpnE,KAAKyiC,aAAaD,gBACpC6kC,cAAgBrnE,KAAKiT,KAAK,GAAGwvB,aAAaD,gBAC1C8kC,cAAgBtnE,KAAKiT,KAAK,GAAGwvB,aAAaD,iBAGtB,OAAlB0kC,iBAC8D,IAA5DlxC,WAAW8Y,YAAYs4B,iBAAiB15B,kBAC1Cs5B,WAAY,IAG+C,IAAzDhxC,WAAWkxC,eAAeG,eAAez5B,cAC3Co5B,WAAY,IAIM,OAAlBO,iBAC+D,IAA7DvxC,WAAW8Y,YAAYs4B,iBAAiBz5B,mBAC1Cs5B,WAAY,IAG+C,IAAzDjxC,WAAWuxC,eAAeD,eAAe15B,cAC3Cq5B,WAAY,IAKlB3vD,OAAS,CAAC0vD,UAAWC,WAEvB,MAEF,QAC+B,qBAAzBjnE,KAAKwiC,iBAAmE,0BAAzBxiC,KAAKwiC,kBACtDlrB,OAASrE,KAAKmK,KAAI,SAAUza,KAC1B,IAAI8kE,cAAgBx5B,cAActrC,IAAKwrC,aACnCu5B,aAAep5B,kBAAkBtuC,KAAM2C,IAAKwrC,aAC5Cw5B,iBAAmBt5B,iBAAiB1rC,IAAKwrC,aAE7C,OAAsB,OAAlBs5B,gBAGO34B,aAAe24B,eAAiB55B,gBAAkB85B,mBAAqBD,cAEvED,cAAgB34B,WAK7B,KAsBN,OAbI77B,KAAKpR,QAAU,GAA8B,0BAAzB7B,KAAKwiC,iBAA+CxiC,KAAK0mE,UAA4B,SAAhBv4B,aAAuC,SAAbu4B,WACrHpvD,OAASrE,KAAKmK,KAAI,SAAUza,IAAKkV,OAC/B,IAAIyc,kBAA4C,oBAAxB3xB,IAAI6/B,gBAE5B,SAAIlrB,OAAOO,SAAUyc,kBAMvB,KAGKhd,MACT,CA+SA,OAznBAkvD,aAAajkE,UAAY,IAAIo+B,KAC7B6lC,aAAajkE,UAAU8Z,KAAO,eAC9BmqD,aAAajkE,UAAU8xB,gBAAiB,EAexCmyC,aAAajkE,UAAUy+B,SAAW,SAAU/E,KAAMoF,UAEhD,GAAuB,iBAAZ/gC,KAAK6Z,KAAoBulB,aAAazD,KAAM37B,KAAK6Z,IAC1D,MAAK8hB,KAAK37B,KAAK6Z,IAGP,IAAI9S,MAAM,0BAA4B/G,KAAK6Z,GAAK,KAFhD,IAAI9S,MAAM,YAAc/G,KAAK6Z,GAAK,yCAM5C,IAAIA,GAAKolB,gBAAgBtD,KAAM37B,KAAK6Z,IAChC6oD,SAAW5lD,IAAI9c,KAAK2S,MAAM,SAAUtQ,KACtC,OAAOA,IAAIq+B,SAAS/E,KAAMoF,SAC5B,IAEA,GAAwB,IAApB2hC,SAASnhE,OAAc,CACzB,IAAI6hE,SAAWV,SAAS,GACxB,OAAO,SAA0BltC,MAAO7iB,KAAMy5B,SAC5C,OAAOvyB,GAAGupD,SAAS5tC,MAAO7iB,KAAMy5B,SAClC,CACF,CAAO,GAAwB,IAApBs2B,SAASnhE,OAAc,CAChC,IAAI+lE,SAAW5E,SAAS,GACpBW,SAAWX,SAAS,GACxB,OAAO,SAA0BltC,MAAO7iB,KAAMy5B,SAC5C,OAAOvyB,GAAGytD,SAAS9xC,MAAO7iB,KAAMy5B,SAAUi3B,SAAS7tC,MAAO7iB,KAAMy5B,SAClE,CACF,CACE,OAAO,SAA0B5W,MAAO7iB,KAAMy5B,SAC5C,OAAOvyB,GAAGlC,MAAM,KAAMmF,IAAI4lD,UAAU,SAAUI,SAC5C,OAAOA,QAAQttC,MAAO7iB,KAAMy5B,QAC9B,IACF,CAEJ,EAOA85B,aAAajkE,UAAUqV,QAAU,SAAUqC,UACzC,IAAK,IAAI/X,EAAI,EAAGA,EAAI5B,KAAK2S,KAAKpR,OAAQK,IACpC+X,SAAS3Z,KAAK2S,KAAK/Q,GAAI,QAAUA,EAAI,IAAK5B,KAE9C,EASAkmE,aAAajkE,UAAU6a,IAAM,SAAUnD,UAGrC,IAFA,IAAIhH,KAAO,GAEF/Q,EAAI,EAAGA,EAAI5B,KAAK2S,KAAKpR,OAAQK,IACpC+Q,KAAK/Q,GAAK5B,KAAKghC,QAAQrnB,SAAS3Z,KAAK2S,KAAK/Q,GAAI,QAAUA,EAAI,IAAK5B,OAGnE,OAAO,IAAIkmE,aAAalmE,KAAKmmE,GAAInmE,KAAK6Z,GAAIlH,KAAM3S,KAAKomE,SAAUpmE,KAAKqmE,aACtE,EAOAH,aAAajkE,UAAUgT,MAAQ,WAC7B,OAAO,IAAIixD,aAAalmE,KAAKmmE,GAAInmE,KAAK6Z,GAAI7Z,KAAK2S,KAAKvI,MAAM,GAAIpK,KAAKomE,SAAUpmE,KAAKqmE,aACpF,EAQAH,aAAajkE,UAAUslE,QAAU,WAC/B,OAA4B,IAArBvnE,KAAK2S,KAAKpR,MACnB,EAQA2kE,aAAajkE,UAAU2D,SAAW,WAChC,OAA4B,IAArB5F,KAAK2S,KAAKpR,MACnB,EAuOA2kE,aAAajkE,UAAU4/B,UAAY,SAAUxW,SAC3C,IAAIwiB,YAAcxiB,SAAWA,QAAQwiB,YAAcxiB,QAAQwiB,YAAc,OACrEu4B,SAAW/6C,SAAWA,QAAQ+6C,SAAW/6C,QAAQ+6C,SAAW,OAC5DzzD,KAAO3S,KAAK2S,KACZ60D,OAASlB,8BAA8BtmE,KAAM6tC,YAAau4B,SAAUzzD,MAAM,GAE9E,GAAoB,IAAhBA,KAAKpR,OAAc,CAErB,IAAIkmE,MAAQ15B,iBAAiB/tC,KAAM6tC,aAC/B65B,QAAU/0D,KAAK,GAAGrJ,SAAS+hB,SAE3Bm8C,OAAO,KACTE,QAAU,IAAMA,QAAU,KAI5B,IAAIC,UAAY,YAAY/zD,KAAK5T,KAAKmmE,IAEtC,MAAc,UAAVsB,MAEKznE,KAAKmmE,IAAMwB,UAAY,IAAM,IAAMD,QACvB,SAAVD,MAEFC,SAAWC,UAAY,IAAM,IAAM3nE,KAAKmmE,GAI1CuB,QAAU1nE,KAAKmmE,EACxB,CAAO,GAAoB,IAAhBxzD,KAAKpR,OAAc,CAC5B,IAAIqmE,IAAMj1D,KAAK,GAAGrJ,SAAS+hB,SAEvBw8C,IAAMl1D,KAAK,GAAGrJ,SAAS+hB,SAY3B,OAVIm8C,OAAO,KAETI,IAAM,IAAMA,IAAM,KAGhBJ,OAAO,KAETK,IAAM,IAAMA,IAAM,KAGhB7nE,KAAKomE,UAAqC,0BAAzBpmE,KAAKkiC,iBAA4D,SAAbkkC,SAChEwB,IAAM,IAAMC,IAGdD,IAAM,IAAM5nE,KAAKmmE,GAAK,IAAM0B,GACrC,CAAO,GAAIl1D,KAAKpR,OAAS,IAA+B,qBAAzBvB,KAAKkiC,iBAAmE,0BAAzBliC,KAAKkiC,iBAA8C,CAC/H,IAAI4lC,gBAAkBn1D,KAAKmK,KAAI,SAAUza,IAAKkV,OAQ5C,OAPAlV,IAAMA,IAAIiH,SAAS+hB,SAEfm8C,OAAOjwD,SAETlV,IAAM,IAAMA,IAAM,KAGbA,GACT,IAEA,OAAIrC,KAAKomE,UAAqC,0BAAzBpmE,KAAKkiC,iBAA4D,SAAbkkC,SAChE0B,gBAAgBvrD,KAAK,KAGvBurD,gBAAgBvrD,KAAK,IAAMvc,KAAKmmE,GAAK,IAC9C,CAEE,OAAOnmE,KAAK6Z,GAAK,IAAM7Z,KAAK2S,KAAK4J,KAAK,MAAQ,GAElD,EAOA2pD,aAAajkE,UAAU2O,OAAS,WAC9B,MAAO,CACLi0B,OAAQ,eACRshC,GAAInmE,KAAKmmE,GACTtsD,GAAI7Z,KAAK6Z,GACTlH,KAAM3S,KAAK2S,KACXyzD,SAAUpmE,KAAKomE,SACfC,aAAcrmE,KAAKqmE,aAEvB,EAUAH,aAAahhC,SAAW,SAAUzH,MAChC,OAAO,IAAIyoC,aAAazoC,KAAK0oC,GAAI1oC,KAAK5jB,GAAI4jB,KAAK9qB,KAAM8qB,KAAK2oC,SAAU3oC,KAAK4oC,aAC3E,EAQAH,aAAajkE,UAAU6/B,OAAS,SAAUzW,SACxC,IAAIwiB,YAAcxiB,SAAWA,QAAQwiB,YAAcxiB,QAAQwiB,YAAc,OACrEu4B,SAAW/6C,SAAWA,QAAQ+6C,SAAW/6C,QAAQ+6C,SAAW,OAC5DzzD,KAAO3S,KAAK2S,KACZ60D,OAASlB,8BAA8BtmE,KAAM6tC,YAAau4B,SAAUzzD,MAAM,GAE9E,GAAoB,IAAhBA,KAAKpR,OAAc,CAErB,IAAIkmE,MAAQ15B,iBAAiB/tC,KAAM6tC,aAC/B65B,QAAU/0D,KAAK,GAAGmvB,OAAOzW,SAM7B,OAJIm8C,OAAO,KACTE,QAAU,iEAAmEA,QAAU,kEAG3E,UAAVD,MAEK,gFAAkF,cAAOznE,KAAKmmE,IAAM,UAAYuB,QAGhHA,QAAU,iFAAmF,cAAO1nE,KAAKmmE,IAAM,SAE1H,CAAO,GAAoB,IAAhBxzD,KAAKpR,OAAc,CAE5B,IAAIqmE,IAAMj1D,KAAK,GAAGmvB,OAAOzW,SAErBw8C,IAAMl1D,KAAK,GAAGmvB,OAAOzW,SAYzB,OAVIm8C,OAAO,KAETI,IAAM,iEAAmEA,IAAM,kEAG7EJ,OAAO,KAETK,IAAM,iEAAmEA,IAAM,kEAG7E7nE,KAAKomE,UAAqC,0BAAzBpmE,KAAKkiC,iBAA4D,SAAbkkC,SAChEwB,IAAM,yFAA2FC,IAGnGD,IAAM,kFAAoF,cAAO5nE,KAAKmmE,IAAM,UAAY0B,GACjI,CACE,IAAIC,gBAAkBn1D,KAAKmK,KAAI,SAAUza,IAAKkV,OAQ5C,OAPAlV,IAAMA,IAAIy/B,OAAOzW,SAEbm8C,OAAOjwD,SAETlV,IAAM,iEAAmEA,IAAM,kEAG1EA,GACT,IAEA,OAAIsQ,KAAKpR,OAAS,IAA+B,qBAAzBvB,KAAKkiC,iBAAmE,0BAAzBliC,KAAKkiC,iBACtEliC,KAAKomE,UAAqC,0BAAzBpmE,KAAKkiC,iBAA4D,SAAbkkC,SAChE0B,gBAAgBvrD,KAAK,0FAGvBurD,gBAAgBvrD,KAAK,kFAAoF,cAAOvc,KAAKmmE,IAAM,WAG3H,+BAAiC,cAAOnmE,KAAK6Z,IAAM,wEAA0EiuD,gBAAgBvrD,KAAK,yCAA2C,gEAG1M,EAQA2pD,aAAajkE,UAAU+/B,OAAS,SAAU3W,SACxC,IAAIwiB,YAAcxiB,SAAWA,QAAQwiB,YAAcxiB,QAAQwiB,YAAc,OACrEu4B,SAAW/6C,SAAWA,QAAQ+6C,SAAW/6C,QAAQ+6C,SAAW,OAC5DzzD,KAAO3S,KAAK2S,KACZ60D,OAASlB,8BAA8BtmE,KAAM6tC,YAAau4B,SAAUzzD,MAAM,GAC1EwzD,GAAKlyB,eAAej0C,KAAK6Z,IAG7B,GAFAssD,QAAmB,IAAPA,GAAqBnmE,KAAKmmE,GAAKA,GAEvB,IAAhBxzD,KAAKpR,OAAc,CAErB,IAAIkmE,MAAQ15B,iBAAiB/tC,KAAM6tC,aAC/B65B,QAAU/0D,KAAK,GAAGovB,MAAM1W,SAM5B,OAJIm8C,OAAO,KACTE,QAAU,UAAU7pD,OAAO6pD,QAAS,aAGxB,UAAVD,MAEKtB,GAAKuB,QAGLA,QAAUvB,EAKrB,CAAO,GAAoB,IAAhBxzD,KAAKpR,OAAc,CAE5B,IAAIqmE,IAAMj1D,KAAK,GAEXo1D,OAASH,IAAI7lC,MAAM1W,SAEnBm8C,OAAO,KACTO,OAAS,UAAUlqD,OAAOkqD,OAAQ,aAGpC,IASIhB,cAPAiB,OAFMr1D,KAAK,GAEEovB,MAAM1W,SAgBvB,OAdIm8C,OAAO,KACTQ,OAAS,UAAUnqD,OAAOmqD,OAAQ,aAOlCjB,cADkB,SAAhBl5B,YACc+5B,IAAI1lC,gBAGJ0lC,IAAIzlC,aAAaD,gBAG3BliC,KAAKkiC,iBACX,IAAK,sBAEH,OAAOikC,GAAK,IAAM4B,OAAX5B,KAAgC6B,OAAS,IAElD,IAAK,mBAIH,OAHAD,OAAS,IAAMA,OAAS,IACxBC,OAAS,IAAMA,OAAS,IAEhBjB,eACN,IAAK,kBAEL,IAAK,sBACHgB,OAAS,UAAUlqD,OAAOkqD,OAAQ,YAGtC,MAEF,IAAK,wBACH,GAAI/nE,KAAKomE,UAAyB,SAAbA,SACnB,OAAO2B,OAAS,IAAMC,OAK5B,OAAOD,OAAS5B,GAAK6B,MACvB,CAAO,GAAIr1D,KAAKpR,OAAS,IAA+B,qBAAzBvB,KAAKkiC,iBAAmE,0BAAzBliC,KAAKkiC,iBAA8C,CAC/H,IAAI+lC,aAAet1D,KAAKmK,KAAI,SAAUza,IAAKkV,OAOzC,OANAlV,IAAMA,IAAI0/B,MAAM1W,SAEZm8C,OAAOjwD,SACTlV,IAAM,UAAUwb,OAAOxb,IAAK,aAGvBA,GACT,IAEA,MAA6B,0BAAzBrC,KAAKkiC,iBAA+CliC,KAAKomE,SACpD6B,aAAa1rD,KAAK,KAGpB0rD,aAAa1rD,KAAK4pD,GAC3B,CAIE,MAAO,YAAcnmE,KAAK6Z,GAAK,WAAalH,KAAKmK,KAAI,SAAUza,KAC7D,OAAOA,IAAI0/B,MAAM1W,QACnB,IAAG9O,KAAK,KAAO,UAEnB,EAOA2pD,aAAajkE,UAAUigC,cAAgB,WACrC,OAAOliC,KAAK+b,KAAO,IAAM/b,KAAK6Z,EAChC,EAEOqsD,YAAY,GAClB,CACD5oC,SAAS,EACTjK,QAAQ,ICxqBC60C,yBAA2B,CACpC/nC,iBACA8lC,oBCFSkC,4BAA8B,CACvChoC,iBACAioC,sBCJgD,gBAFvC,kBACQ,CAAC,SAC0D1xD,OAC5E,IAAI,MAEAA,KASJ,SAAS2xD,gBAAgBC,SACvB,KAAMtoE,gBAAgBqoE,iBACpB,MAAM,IAAI9nE,YAAY,oDAIxB,IAAK8yB,OAAOi1C,SACV,MAAM,IAAIzsD,UAAU,yCAGtB7b,KAAKsoE,QAAUA,OACjB,CAoIA,OAlIAD,gBAAgBpmE,UAAY,IAAIo+B,KAChCgoC,gBAAgBpmE,UAAU8Z,KAAO,kBACjCssD,gBAAgBpmE,UAAU+xB,mBAAoB,EAe9Cq0C,gBAAgBpmE,UAAUy+B,SAAW,SAAU/E,KAAMoF,UACnD,OAAO/gC,KAAKsoE,QAAQ5nC,SAAS/E,KAAMoF,SACrC,EAQAsnC,gBAAgBpmE,UAAUkgC,WAAa,WACrC,OAAOniC,KAAKsoE,QAAQnmC,YACtB,EAOAkmC,gBAAgBpmE,UAAUqV,QAAU,SAAUqC,UAC5CA,SAAS3Z,KAAKsoE,QAAS,UAAWtoE,KACpC,EASAqoE,gBAAgBpmE,UAAU6a,IAAM,SAAUnD,UAExC,OAAO,IAAI0uD,gBADG1uD,SAAS3Z,KAAKsoE,QAAS,UAAWtoE,MAElD,EAOAqoE,gBAAgBpmE,UAAUgT,MAAQ,WAChC,OAAO,IAAIozD,gBAAgBroE,KAAKsoE,QAClC,EASAD,gBAAgBpmE,UAAU4/B,UAAY,SAAUxW,SAC9C,OAAKA,SAAWA,UAAYA,QAAQwiB,aAAexiB,SAAmC,SAAxBA,QAAQwiB,YAC7D,IAAM7tC,KAAKsoE,QAAQh/D,SAAS+hB,SAAW,IAGzCrrB,KAAKsoE,QAAQh/D,SAAS+hB,QAC/B,EAOAg9C,gBAAgBpmE,UAAU2O,OAAS,WACjC,MAAO,CACLi0B,OAAQ,kBACRyjC,QAAStoE,KAAKsoE,QAElB,EAUAD,gBAAgBnjC,SAAW,SAAUzH,MACnC,OAAO,IAAI4qC,gBAAgB5qC,KAAK6qC,QAClC,EASAD,gBAAgBpmE,UAAU6/B,OAAS,SAAUzW,SAC3C,OAAKA,SAAWA,UAAYA,QAAQwiB,aAAexiB,SAAmC,SAAxBA,QAAQwiB,YAC7D,iEAAmE7tC,KAAKsoE,QAAQxmC,OAAOzW,SAAW,iEAGpGrrB,KAAKsoE,QAAQxmC,OAAOzW,QAC7B,EASAg9C,gBAAgBpmE,UAAU+/B,OAAS,SAAU3W,SAC3C,OAAKA,SAAWA,UAAYA,QAAQwiB,aAAexiB,SAAmC,SAAxBA,QAAQwiB,YAC7D,UAAUhwB,OAAO7d,KAAKsoE,QAAQvmC,MAAM1W,SAAU,YAGhDrrB,KAAKsoE,QAAQvmC,MAAM1W,QAC5B,EAEOg9C,eAAe,GACrB,CACD/qC,SAAS,EACTjK,QAAQ,KC5JCk1C,sBAAwB,CACjCpoC,iBACAqoC,gBCH0C,gBAFjC,YACQ,CAAC,SACoD9xD,OACtE,IAAI,MAEAA,KAUJ,SAASg3B,UAAU/oB,MAAOC,IAAK0/C,MAC7B,KAAMtkE,gBAAgB0tC,WACpB,MAAM,IAAIntC,YAAY,oDAIxB,IAAK8yB,OAAO1O,OAAQ,MAAM,IAAI9I,UAAU,iBACxC,IAAKwX,OAAOzO,KAAM,MAAM,IAAI/I,UAAU,iBACtC,GAAIyoD,OAASjxC,OAAOixC,MAAO,MAAM,IAAIzoD,UAAU,iBAC/C,GAAInH,UAAUnT,OAAS,EAAG,MAAM,IAAIwF,MAAM,sBAC1C/G,KAAK2kB,MAAQA,MAEb3kB,KAAK4kB,IAAMA,IAEX5kB,KAAKskE,KAAOA,MAAQ,IACtB,CA+FA,SAASgC,8BAA8BrlC,KAAM4M,aAC3C,IAAIW,WAAab,cAAc1M,KAAM4M,aACjC25B,OAAS,CAAC,EACViB,gBAAkB96B,cAAc1M,KAAKtc,MAAOkpB,aAGhD,GAFA25B,OAAO7iD,MAA4B,OAApB8jD,iBAA4BA,iBAAmBj6B,YAA8B,QAAhBX,YAExE5M,KAAKqjC,KAAM,CACb,IAAIoE,eAAiB/6B,cAAc1M,KAAKqjC,KAAMz2B,aAC9C25B,OAAOlD,KAA0B,OAAnBoE,gBAA2BA,gBAAkBl6B,YAA8B,QAAhBX,WAC3E,CAEA,IAAI86B,cAAgBh7B,cAAc1M,KAAKrc,IAAKipB,aAE5C,OADA25B,OAAO5iD,IAAwB,OAAlB+jD,eAA0BA,eAAiBn6B,YAA8B,QAAhBX,YAC/D25B,MACT,CA6IA,OAxPA95B,UAAUzrC,UAAY,IAAIo+B,KAC1BqN,UAAUzrC,UAAU8Z,KAAO,YAC3B2xB,UAAUzrC,UAAUgyB,aAAc,EAOlCyZ,UAAUzrC,UAAU+iE,SAAW,WAK7B,OAHiBhlE,KAAKod,QAAO,SAAU6jB,MACrC,OAAO/M,aAAa+M,OAAuB,QAAdA,KAAKxpB,IACpC,IACkBlW,OAAS,CAC7B,EAgBAmsC,UAAUzrC,UAAUy+B,SAAW,SAAU/E,KAAMoF,UAC7C,IAAIuC,MAAQ3H,KAAK2H,MAEb2hC,UAAYjlE,KAAK2kB,MAAM+b,SAAS/E,KAAMoF,UAEtCmkC,QAAUllE,KAAK4kB,IAAI8b,SAAS/E,KAAMoF,UAEtC,GAAI/gC,KAAKskE,KAAM,CACb,IAAIa,SAAWnlE,KAAKskE,KAAK5jC,SAAS/E,KAAMoF,UAExC,OAAO,SAAuBvL,MAAO7iB,KAAMy5B,SACzC,OAAO9I,MAAM2hC,UAAUzvC,MAAO7iB,KAAMy5B,SAAU84B,QAAQ1vC,MAAO7iB,KAAMy5B,SAAU+4B,SAAS3vC,MAAO7iB,KAAMy5B,SACrG,CACF,CACE,OAAO,SAAuB5W,MAAO7iB,KAAMy5B,SACzC,OAAO9I,MAAM2hC,UAAUzvC,MAAO7iB,KAAMy5B,SAAU84B,QAAQ1vC,MAAO7iB,KAAMy5B,SACrE,CAEJ,EAOAsB,UAAUzrC,UAAUqV,QAAU,SAAUqC,UACtCA,SAAS3Z,KAAK2kB,MAAO,QAAS3kB,MAC9B2Z,SAAS3Z,KAAK4kB,IAAK,MAAO5kB,MAEtBA,KAAKskE,MACP3qD,SAAS3Z,KAAKskE,KAAM,OAAQtkE,KAEhC,EASA0tC,UAAUzrC,UAAU6a,IAAM,SAAUnD,UAClC,OAAO,IAAI+zB,UAAU1tC,KAAKghC,QAAQrnB,SAAS3Z,KAAK2kB,MAAO,QAAS3kB,OAAQA,KAAKghC,QAAQrnB,SAAS3Z,KAAK4kB,IAAK,MAAO5kB,OAAQA,KAAKskE,MAAQtkE,KAAKghC,QAAQrnB,SAAS3Z,KAAKskE,KAAM,OAAQtkE,OAC/K,EAOA0tC,UAAUzrC,UAAUgT,MAAQ,WAC1B,OAAO,IAAIy4B,UAAU1tC,KAAK2kB,MAAO3kB,KAAK4kB,IAAK5kB,KAAKskE,MAAQtkE,KAAKskE,KAC/D,EAgCA52B,UAAUzrC,UAAU4/B,UAAY,SAAUxW,SACxC,IAGI5kB,IAFA+gE,OAASlB,8BAA8BtmE,KADzBqrB,SAAWA,QAAQwiB,YAAcxiB,QAAQwiB,YAAc,QAIrElpB,MAAQ3kB,KAAK2kB,MAAMrb,SAAS+hB,SAQhC,GANIm8C,OAAO7iD,QACTA,MAAQ,IAAMA,MAAQ,KAGxBle,IAAMke,MAEF3kB,KAAKskE,KAAM,CACb,IAAIA,KAAOtkE,KAAKskE,KAAKh7D,SAAS+hB,SAE1Bm8C,OAAOlD,OACTA,KAAO,IAAMA,KAAO,KAGtB79D,KAAO,IAAM69D,IACf,CAEA,IAAI1/C,IAAM5kB,KAAK4kB,IAAItb,SAAS+hB,SAO5B,OALIm8C,OAAO5iD,MACTA,IAAM,IAAMA,IAAM,KAGpBne,KAAO,IAAMme,GAEf,EAOA8oB,UAAUzrC,UAAU2O,OAAS,WAC3B,MAAO,CACLi0B,OAAQ,YACRlgB,MAAO3kB,KAAK2kB,MACZC,IAAK5kB,KAAK4kB,IACV0/C,KAAMtkE,KAAKskE,KAEf,EAUA52B,UAAUxI,SAAW,SAAUzH,MAC7B,OAAO,IAAIiQ,UAAUjQ,KAAK9Y,MAAO8Y,KAAK7Y,IAAK6Y,KAAK6mC,KAClD,EAQA52B,UAAUzrC,UAAU6/B,OAAS,SAAUzW,SACrC,IAGI5kB,IAFA+gE,OAASlB,8BAA8BtmE,KADzBqrB,SAAWA,QAAQwiB,YAAcxiB,QAAQwiB,YAAc,QAIrElpB,MAAQ3kB,KAAK2kB,MAAMmd,OAAOzW,SAQ9B,GANIm8C,OAAO7iD,QACTA,MAAQ,iEAAmEA,MAAQ,kEAGrFle,IAAMke,MAEF3kB,KAAKskE,KAAM,CACb,IAAIA,KAAOtkE,KAAKskE,KAAKxiC,OAAOzW,SAExBm8C,OAAOlD,OACTA,KAAO,iEAAmEA,KAAO,kEAGnF79D,KAAO,2DAA6D69D,IACtE,CAEA,IAAI1/C,IAAM5kB,KAAK4kB,IAAIkd,OAAOzW,SAO1B,OALIm8C,OAAO5iD,MACTA,IAAM,iEAAmEA,IAAM,kEAGjFne,KAAO,2DAA6Dme,GAEtE,EAQA8oB,UAAUzrC,UAAU+/B,OAAS,SAAU3W,SACrC,IACIm8C,OAASlB,8BAA8BtmE,KADzBqrB,SAAWA,QAAQwiB,YAAcxiB,QAAQwiB,YAAc,QAErEpnC,IAAMzG,KAAK2kB,MAAMod,MAAM1W,SAM3B,GAJIm8C,OAAO7iD,QACTle,IAAM,UAAUoX,OAAOpX,IAAK,aAG1BzG,KAAKskE,KAAM,CACb,IAAIA,KAAOtkE,KAAKskE,KAAKviC,MAAM1W,SAEvBm8C,OAAOlD,OACTA,KAAO,UAAUzmD,OAAOymD,KAAM,aAGhC79D,KAAO,IAAM69D,IACf,CAEA,IAAI1/C,IAAM5kB,KAAK4kB,IAAImd,MAAM1W,SAOzB,OALIm8C,OAAO5iD,MACTA,IAAM,UAAU/G,OAAO+G,IAAK,aAG9Bne,KAAO,IAAMme,GAEf,EAEO8oB,SAAS,GACf,CACDpQ,SAAS,EACTjK,QAAQ,KCxRCu1C,2BAA6B,CACtCzoC,iBACA0oC,qBCD+C,gBAFtC,iBACQ,CAAC,SACyDnyD,OAC3E,IAAI,MAEAA,KAWJ,SAAS+2B,eAAeq7B,aAAcjsD,QACpC,KAAM7c,gBAAgBytC,gBACpB,MAAM,IAAIltC,YAAY,oDAGxB,IAAKsa,MAAMC,QAAQguD,cAAe,MAAM,IAAIjtD,UAAU,2CACtD,IAAKhB,MAAMC,QAAQ+B,QAAS,MAAM,IAAIhB,UAAU,qCAChD,GAAIitD,aAAavnE,SAAWsb,OAAOtb,OAAS,EAAG,MAAM,IAAIsa,UAAU,sFACnE7b,KAAK8oE,aAAeA,aACpB9oE,KAAK6c,OAASA,MAChB,CAgLA,OA9KA4wB,eAAexrC,UAAY,IAAIo+B,KAC/BoN,eAAexrC,UAAU8Z,KAAO,iBAChC0xB,eAAexrC,UAAU8mE,kBAAmB,EAe5Ct7B,eAAexrC,UAAUy+B,SAAW,SAAU/E,KAAMoF,UAClD,IAAIhnB,KAAO/Z,KACPgpE,SAAWhpE,KAAK6c,OAAOC,KAAInJ,GAAKA,EAAE+sB,SAAS/E,KAAMoF,YACrD,OAAO,SAA4BvL,MAAO7iB,KAAMy5B,SAI9C,IAHA,IAAI68B,QACAC,QAAUF,SAAS,GAAGxzC,MAAO7iB,KAAMy5B,SAE9BxqC,EAAI,EAAGA,EAAImY,KAAK+uD,aAAavnE,OAAQK,IAAK,CAKjD,GAJAqnE,QAAUC,QACVA,QAAUF,SAASpnE,EAAI,GAAG4zB,MAAO7iB,KAAMy5B,UAC1BnN,gBAAgBtD,KAAM5hB,KAAK+uD,aAAalnE,GAEhDunE,CAAOF,QAASC,SACnB,OAAO,CAEX,CAEA,OAAO,CACT,CACF,EAOAz7B,eAAexrC,UAAUqV,QAAU,SAAUqC,UAC3C3Z,KAAK6c,OAAOvF,SAAQ,CAACvN,EAAGnI,IAAM+X,SAAS5P,EAAG,UAAYnI,EAAI,IAAK5B,OAAOA,KACxE,EASAytC,eAAexrC,UAAU6a,IAAM,SAAUnD,UACvC,OAAO,IAAI8zB,eAAeztC,KAAK8oE,aAAa1+D,QAASpK,KAAK6c,OAAOC,KAAI,CAAC/S,EAAGnI,IAAM5B,KAAKghC,QAAQrnB,SAAS5P,EAAG,UAAYnI,EAAI,IAAK5B,QAAQA,MACvI,EAOAytC,eAAexrC,UAAUgT,MAAQ,WAC/B,OAAO,IAAIw4B,eAAeztC,KAAK8oE,aAAc9oE,KAAK6c,OACpD,EAQA4wB,eAAexrC,UAAU4/B,UAAY,SAAUxW,SAiB7C,IAhBA,IAAIwiB,YAAcxiB,SAAWA,QAAQwiB,YAAcxiB,QAAQwiB,YAAc,OACrEW,WAAab,cAAc3tC,KAAM6tC,aACjCu7B,aAAeppE,KAAK6c,OAAOC,KAAI,SAAUnJ,EAAG4D,OAC9C,IAAI8xD,gBAAkB17B,cAAch6B,EAAGk6B,aACvC,MAAuB,QAAhBA,aAA6C,OAApBw7B,iBAA4BA,iBAAmB76B,WAAa,IAAM76B,EAAErK,SAAS+hB,SAAW,IAAM1X,EAAErK,SAAS+hB,QAC3I,IACIi+C,YAAc,CAChBt0B,MAAO,KACPC,QAAS,KACTC,QAAS,IACTC,OAAQ,IACRC,UAAW,KACXC,SAAU,MAERlxC,IAAMilE,aAAa,GAEdxnE,EAAI,EAAGA,EAAI5B,KAAK8oE,aAAavnE,OAAQK,IAC5CuC,KAAO,IAAMmlE,YAAYtpE,KAAK8oE,aAAalnE,IAAM,IAAMwnE,aAAaxnE,EAAI,GAG1E,OAAOuC,GACT,EAOAspC,eAAexrC,UAAU2O,OAAS,WAChC,MAAO,CACLi0B,OAAQ,iBACRikC,aAAc9oE,KAAK8oE,aACnBjsD,OAAQ7c,KAAK6c,OAEjB,EAUA4wB,eAAevI,SAAW,SAAUzH,MAClC,OAAO,IAAIgQ,eAAehQ,KAAKqrC,aAAcrrC,KAAK5gB,OACpD,EAQA4wB,eAAexrC,UAAU6/B,OAAS,SAAUzW,SAiB1C,IAhBA,IAAIwiB,YAAcxiB,SAAWA,QAAQwiB,YAAcxiB,QAAQwiB,YAAc,OACrEW,WAAab,cAAc3tC,KAAM6tC,aACjCu7B,aAAeppE,KAAK6c,OAAOC,KAAI,SAAUnJ,EAAG4D,OAC9C,IAAI8xD,gBAAkB17B,cAAch6B,EAAGk6B,aACvC,MAAuB,QAAhBA,aAA6C,OAApBw7B,iBAA4BA,iBAAmB76B,WAAa,iEAAmE76B,EAAEmuB,OAAOzW,SAAW,iEAAmE1X,EAAEmuB,OAAOzW,QACjQ,IACIi+C,YAAc,CAChBt0B,MAAO,KACPC,QAAS,KACTC,QAAS,IACTC,OAAQ,IACRC,UAAW,KACXC,SAAU,MAERlxC,IAAMilE,aAAa,GAEdxnE,EAAI,EAAGA,EAAI5B,KAAK8oE,aAAavnE,OAAQK,IAC5CuC,KAAO,kFAAoF,cAAOmlE,YAAYtpE,KAAK8oE,aAAalnE,KAAO,UAAYwnE,aAAaxnE,EAAI,GAGtK,OAAOuC,GACT,EAQAspC,eAAexrC,UAAU+/B,OAAS,SAAU3W,SAS1C,IARA,IAAIwiB,YAAcxiB,SAAWA,QAAQwiB,YAAcxiB,QAAQwiB,YAAc,OACrEW,WAAab,cAAc3tC,KAAM6tC,aACjCu7B,aAAeppE,KAAK6c,OAAOC,KAAI,SAAUnJ,EAAG4D,OAC9C,IAAI8xD,gBAAkB17B,cAAch6B,EAAGk6B,aACvC,MAAuB,QAAhBA,aAA6C,OAApBw7B,iBAA4BA,iBAAmB76B,WAAa,UAAY76B,EAAEouB,MAAM1W,SAAW,UAAY1X,EAAEouB,MAAM1W,QACjJ,IACIlnB,IAAMilE,aAAa,GAEdxnE,EAAI,EAAGA,EAAI5B,KAAK8oE,aAAavnE,OAAQK,IAC5CuC,KAAO8vC,eAAej0C,KAAK8oE,aAAalnE,IAAMwnE,aAAaxnE,EAAI,GAGjE,OAAOuC,GACT,EAEOspC,cAAc,GACpB,CACDnQ,SAAS,EACTjK,QAAQ,KC3MCk2C,YAA6B,gBAF7B,QACQ,CAAC,QAAS,UAAW,SAAU,eAAgB,YAAa,iBAAkB,YAAa,kBAAmB,eAAgB,yBAA0B,eAAgB,YAAa,aAAc,eAAgB,kBAAmB,YAAa,iBAAkB,eACpN7yD,OAClE,IAAI,MACG,QACE,OACD,aACM,UACH,eACK,UACL,gBACM,aACH,uBACU,aACV,UACH,WACC,aACE,gBACG,UACN,eACK,YAEZA,KAyCA1U,MAAQoZ,MA/DH,QA+De,CACtBwvB,OAAQ,SAAgBtO,YACtB,OAAOktC,WAAWltC,WAAY,CAAC,EACjC,EACA,iBAAkB,SAAqBmtC,aACrC,OAAOC,cAAcD,YAAa,CAAC,EACrC,EACA,iBAAkB,SAAsBntC,WAAYjR,SAElD,OAAOm+C,WAAWltC,gBADiBn7B,IAAlBkqB,QAAQmW,MAAsBnW,QAAQmW,MAAQ,CAAC,EAElE,EACA,yBAA0BkoC,gBAG5B,SAASA,cAAcD,aACrB,IAAIp+C,QAAU3W,UAAUnT,OAAS,QAAsBJ,IAAjBuT,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAC/Ei1D,gBAA+BxoE,IAAlBkqB,QAAQmW,MAAsBnW,QAAQmW,MAAQ,CAAC,EAEhE,OAAOuX,QAAQ0wB,aAAa,SAAUhwC,MACpC,GAAoB,iBAATA,KAAmB,MAAM,IAAI5d,UAAU,mBAClD,OAAO2tD,WAAW/vC,KAAMkwC,WAC1B,GACF,CAGA,IAAIC,eACI,EADJA,oBAES,EAFTA,iBAGM,EAHNA,iBAIM,EAJNA,kBAKO,EAGPC,WAAa,CACf,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAM,EACN,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,MAAM,EACN,KAAK,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,MAAM,EACN,MAAM,EACN,OAAO,GAGLC,iBAAmB,CACrB57D,KAAK,EACLyO,IAAI,EACJ61C,IAAI,EACJ/c,KAAK,EACLC,KAAK,EACLC,IAAI,EACJlB,KAAK,GAEHs1B,UAAY,CACdp2B,MAAM,EACNC,OAAO,EACPwG,KAAM,KACNj5C,eAAWA,GAET6oE,kBAAoB,CAAC,MAAO,YAgChC,SAASC,cAAcC,MAAO3oE,QAC5B,OAAO2oE,MAAM5tC,WAAW0O,OAAOk/B,MAAM3yD,MAAOhW,OAC9C,CAUA,SAAS4oE,iBAAiBD,OACxB,OAAOD,cAAcC,MAAO,EAC9B,CASA,SAAShvC,KAAKgvC,OACZA,MAAM3yD,OACR,CAQA,SAAS6yD,cAAcF,OACrB,OAAOA,MAAM5tC,WAAWz0B,OAAOqiE,MAAM3yD,MAAQ,EAC/C,CAQA,SAAS8yD,cAAcH,OACrB,OAAOA,MAAM5tC,WAAWz0B,OAAOqiE,MAAM3yD,MAAQ,EAC/C,CAQA,SAAS+yD,SAASJ,OAMhB,IALAA,MAAMK,UAAYX,eAClBM,MAAMM,MAAQ,GACdN,MAAM1pC,QAAU,GAGTx+B,MAAMyoE,aAAaN,iBAAiBD,OAAQA,MAAMQ,eACvDxvC,KAAKgvC,OAIP,GAAgC,MAA5BC,iBAAiBD,OACnB,KAAmC,OAA5BC,iBAAiBD,QAA+C,KAA5BC,iBAAiBD,QAC1DA,MAAM1pC,SAAW2pC,iBAAiBD,OAClChvC,KAAKgvC,OAKT,GAAgC,KAA5BC,iBAAiBD,OAArB,CAOA,GAAgC,OAA5BC,iBAAiBD,SAAoBA,MAAMQ,aAI7C,OAHAR,MAAMK,UAAYX,oBAClBM,MAAMM,MAAQL,iBAAiBD,YAC/BhvC,KAAKgvC,OAIP,IAAI7gC,GAAK8gC,iBAAiBD,OACtBS,GAAKV,cAAcC,MAAO,GAC1BU,GAAKX,cAAcC,MAAO,GAE9B,GAAkB,IAAdU,GAAGrpE,QAAgBsoE,WAAWe,IAMhC,OALAV,MAAMK,UAAYX,oBAClBM,MAAMM,MAAQI,GACd1vC,KAAKgvC,OACLhvC,KAAKgvC,YACLhvC,KAAKgvC,OAKP,GAAkB,IAAdS,GAAGppE,QAAgBsoE,WAAWc,IAKhC,OAJAT,MAAMK,UAAYX,oBAClBM,MAAMM,MAAQG,GACdzvC,KAAKgvC,YACLhvC,KAAKgvC,OAKP,GAAIL,WAAWxgC,IAIb,OAHA6gC,MAAMK,UAAYX,oBAClBM,MAAMM,MAAQnhC,QACdnO,KAAKgvC,OAKP,GAAIloE,MAAM4mD,WAAWvf,IAArB,CACE6gC,MAAMK,UAAYX,iBAElB,IAAIvnB,GAAK4nB,cAAcC,MAAO,GAE9B,GAAW,OAAP7nB,IAAsB,OAAPA,IAAsB,OAAPA,GAAa,CAM7C,IALA6nB,MAAMM,OAASL,iBAAiBD,OAChChvC,KAAKgvC,OACLA,MAAMM,OAASL,iBAAiBD,OAChChvC,KAAKgvC,OAEEloE,MAAM6oE,WAAWV,iBAAiBD,SACvCA,MAAMM,OAASL,iBAAiBD,OAChChvC,KAAKgvC,OAGP,GAAgC,MAA5BC,iBAAiBD,OAKnB,IAHAA,MAAMM,OAAS,IACftvC,KAAKgvC,OAEEloE,MAAM6oE,WAAWV,iBAAiBD,SACvCA,MAAMM,OAASL,iBAAiBD,OAChChvC,KAAKgvC,YAEF,GAAgC,MAA5BC,iBAAiBD,OAK1B,IAHAA,MAAMM,OAAS,IACftvC,KAAKgvC,OAEEloE,MAAMymD,QAAQ0hB,iBAAiBD,SACpCA,MAAMM,OAASL,iBAAiBD,OAChChvC,KAAKgvC,OAIT,MACF,CAGA,GAAgC,MAA5BC,iBAAiBD,QAInB,GAHAA,MAAMM,OAASL,iBAAiBD,OAChChvC,KAAKgvC,QAEAloE,MAAMymD,QAAQ0hB,iBAAiBD,QAGlC,YADAA,MAAMK,UAAYX,yBAGf,CACL,KAAO5nE,MAAMymD,QAAQ0hB,iBAAiBD,SACpCA,MAAMM,OAASL,iBAAiBD,OAChChvC,KAAKgvC,OAGHloE,MAAM8oE,cAAcX,iBAAiBD,OAAQG,cAAcH,UAC7DA,MAAMM,OAASL,iBAAiBD,OAChChvC,KAAKgvC,OAET,CAEA,KAAOloE,MAAMymD,QAAQ0hB,iBAAiBD,SACpCA,MAAMM,OAASL,iBAAiBD,OAChChvC,KAAKgvC,OAIP,GAAgC,MAA5BC,iBAAiBD,QAA8C,MAA5BC,iBAAiBD,OACtD,GAAIloE,MAAMymD,QAAQ4hB,cAAcH,SAAoC,MAAzBG,cAAcH,QAA2C,MAAzBG,cAAcH,OAAgB,CAUvG,GATAA,MAAMM,OAASL,iBAAiBD,OAChChvC,KAAKgvC,OAE2B,MAA5BC,iBAAiBD,QAA8C,MAA5BC,iBAAiBD,SACtDA,MAAMM,OAASL,iBAAiBD,OAChChvC,KAAKgvC,SAIFloE,MAAMymD,QAAQ0hB,iBAAiBD,QAClC,MAAMa,kBAAkBb,MAAO,wBAA0BC,iBAAiBD,OAAS,KAGrF,KAAOloE,MAAMymD,QAAQ0hB,iBAAiBD,SACpCA,MAAMM,OAASL,iBAAiBD,OAChChvC,KAAKgvC,OAGP,GAAIloE,MAAM8oE,cAAcX,iBAAiBD,OAAQG,cAAcH,QAC7D,MAAMa,kBAAkBb,MAAO,wBAA0BC,iBAAiBD,OAAS,IAEvF,MAAO,GAA6B,MAAzBG,cAAcH,OAEvB,MADAhvC,KAAKgvC,OACCa,kBAAkBb,MAAO,wBAA0BC,iBAAiBD,OAAS,IAKzF,KAjGA,CAoGA,IAAIloE,MAAMgpE,QAAQb,iBAAiBD,OAAQE,cAAcF,OAAQG,cAAcH,QAA/E,CAkBA,IAFAA,MAAMK,UAAYX,kBAEiB,KAA5BO,iBAAiBD,QACtBA,MAAMM,OAASL,iBAAiBD,OAChChvC,KAAKgvC,OAGP,MAAMa,kBAAkBb,MAAO,yBAA2BA,MAAMM,MAAQ,IAVxE,CAZE,KAAOxoE,MAAMgpE,QAAQb,iBAAiBD,OAAQE,cAAcF,OAAQG,cAAcH,SAAWloE,MAAMymD,QAAQ0hB,iBAAiBD,SAC1HA,MAAMM,OAASL,iBAAiBD,OAChChvC,KAAKgvC,OAGH,sBAAeJ,iBAAkBI,MAAMM,OACzCN,MAAMK,UAAYX,oBAElBM,MAAMK,UAAYX,gBAZtB,CA1IA,MAFEM,MAAMK,UAAYX,mBAuKtB,CAMA,SAASqB,oBAAoBf,OAC3B,GACEI,SAASJ,aACc,OAAhBA,MAAMM,MAEjB,CAOA,SAASU,WAAWhB,OAClBA,MAAMQ,cACR,CAOA,SAASS,YAAYjB,OACnBA,MAAMQ,cACR,CAmHA,SAASlB,WAAWltC,WAAYqtC,YAC9B,IAAIO,MA/ZG,CACLP,WAAY,CAAC,EAEbrtC,WAAY,GAEZkE,QAAS,GAETjpB,MAAO,EAEPizD,MAAO,GAEPD,UAAWX,eAEXc,aAAc,EAEdU,iBAAkB,MAkZpBt1D,SAASo0D,MAAO,CACd5tC,WACAqtC,aAGFW,SAASJ,OACT,IAAIjpC,KAwBN,SAAoBipC,OAClB,IAAIjpC,KAEAuO,QADAF,OAAS,GAGO,KAAhB46B,MAAMM,OAAgC,OAAhBN,MAAMM,OAAkC,MAAhBN,MAAMM,SACtDvpC,KAAOoqC,gBAAgBnB,QAClB1pC,QAAU0pC,MAAM1pC,SAIvB,KAAuB,OAAhB0pC,MAAMM,OAAkC,MAAhBN,MAAMM,OAEb,IAAlBl7B,OAAO/tC,QAAgB0/B,OACzBuO,QAA0B,MAAhB06B,MAAMM,MAChBl7B,OAAOxhC,KAAK,CACVmzB,KACAuO,WAIJ86B,SAASJ,OAEW,OAAhBA,MAAMM,OAAkC,MAAhBN,MAAMM,OAAiC,KAAhBN,MAAMM,SACvDvpC,KAAOoqC,gBAAgBnB,QAClB1pC,QAAU0pC,MAAM1pC,QACrBgP,QAA0B,MAAhB06B,MAAMM,MAChBl7B,OAAOxhC,KAAK,CACVmzB,KACAuO,WAKN,OAAIF,OAAO/tC,OAAS,EACX,IAAI8tC,UAAUC,SAEhBrO,QACHA,KAAO,IAAIuX,kBAAar3C,IACnBq/B,QAAU0pC,MAAM1pC,SAGhBS,KAEX,CApEaqqC,CAAWpB,OAGtB,GAAoB,KAAhBA,MAAMM,MACR,MAAIN,MAAMK,YAAcX,oBAGhBpyD,YAAY0yD,MAAO,uBAAyBA,MAAMM,OAElDO,kBAAkBb,MAAO,oBAAsBA,MAAMM,MAAQ,KAIvE,OAAOvpC,IACT,CAiEA,SAASoqC,gBAAgBnB,OACvB,IAAIzyD,KAAM9E,KAAMsJ,MAAOsvD,MACnBtqC,KAmDN,SAA0BipC,OACxB,IAAIjpC,KA8BN,SAAwBipC,OACtB,IAAIjpC,KAAOuqC,gBAAgBtB,OAE3B,KAAuB,OAAhBA,MAAMM,OAEXS,oBAAoBf,OACpBjpC,KAAO,IAAIilC,aAAa,KAAM,KAAM,CAACjlC,KAAMuqC,gBAAgBtB,SAG7D,OAAOjpC,IACT,CAxCawqC,CAAevB,OAE1B,KAAuB,MAAhBA,MAAMM,OAAe,CAI1B,IAAI5vC,KAAOsvC,MAAMkB,iBACjBlB,MAAMkB,iBAAmBlB,MAAMQ,aAC/BO,oBAAoBf,OACpB,IAAIr6B,UAAY5O,KACZ6O,SAAWu7B,gBAAgBnB,OAC/B,GAAoB,MAAhBA,MAAMM,MAAe,MAAMO,kBAAkBb,MAAO,iDACxDA,MAAMkB,iBAAmB,KACzBH,oBAAoBf,OACpB,IAAIn6B,UAAYs7B,gBAAgBnB,OAEhCjpC,KAAO,IAAIkM,gBAAgB0C,UAAWC,SAAUC,WAEhDm6B,MAAMkB,iBAAmBxwC,IAC3B,CAEA,OAAOqG,IACT,CA1EayqC,CAAiBxB,OAE5B,GAAoB,MAAhBA,MAAMM,MAAe,CACvB,GAAIt2C,aAAa+M,MAKf,OAHAxpB,KAAOwpB,KAAKxpB,KACZwzD,oBAAoBf,OACpBjuD,MAAQovD,gBAAgBnB,OACjB,IAAIj9B,eAAe,IAAIk1B,WAAW1qD,MAAOwE,OAC3C,GAAImX,eAAe6N,MAIxB,OAFAgqC,oBAAoBf,OACpBjuD,MAAQovD,gBAAgBnB,OACjB,IAAIj9B,eAAehM,KAAK5M,OAAQ4M,KAAK1pB,MAAO0E,OAC9C,GAAI2X,eAAeqN,OAAS/M,aAAa+M,KAAKpnB,MAEnD0xD,OAAQ,EACR54D,KAAO,GACP8E,KAAOwpB,KAAKxpB,KACZwpB,KAAKtuB,KAAK2E,SAAQ,SAAUjV,IAAKkV,OAC3B2c,aAAa7xB,KACfsQ,KAAK4E,OAASlV,IAAIoV,KAElB8zD,OAAQ,CAEZ,IAEIA,OAGF,OAFAN,oBAAoBf,OACpBjuD,MAAQovD,gBAAgBnB,OACjB,IAAIh9B,uBAAuBz1B,KAAM9E,KAAMsJ,OAIlD,MAAM8uD,kBAAkBb,MAAO,kDACjC,CAEA,OAAOjpC,IACT,CA8DA,SAASuqC,gBAAgBtB,OAGvB,IAFA,IAAIjpC,KAAO0qC,gBAAgBzB,OAEJ,QAAhBA,MAAMM,OAEXS,oBAAoBf,OACpBjpC,KAAO,IAAIilC,aAAa,MAAO,MAAO,CAACjlC,KAAM0qC,gBAAgBzB,SAG/D,OAAOjpC,IACT,CAQA,SAAS0qC,gBAAgBzB,OAGvB,IAFA,IAAIjpC,KAAO2qC,eAAe1B,OAEH,QAAhBA,MAAMM,OAEXS,oBAAoBf,OACpBjpC,KAAO,IAAIilC,aAAa,MAAO,MAAO,CAACjlC,KAAM2qC,eAAe1B,SAG9D,OAAOjpC,IACT,CAQA,SAAS2qC,eAAe1B,OAGtB,IAFA,IAAIjpC,KAAO4qC,gBAAgB3B,OAEJ,MAAhBA,MAAMM,OAEXS,oBAAoBf,OACpBjpC,KAAO,IAAIilC,aAAa,IAAK,QAAS,CAACjlC,KAAM4qC,gBAAgB3B,SAG/D,OAAOjpC,IACT,CAQA,SAAS4qC,gBAAgB3B,OAGvB,IAFA,IAAIjpC,KAAO6qC,gBAAgB5B,OAEJ,OAAhBA,MAAMM,OAEXS,oBAAoBf,OACpBjpC,KAAO,IAAIilC,aAAa,KAAM,SAAU,CAACjlC,KAAM6qC,gBAAgB5B,SAGjE,OAAOjpC,IACT,CAQA,SAAS6qC,gBAAgB5B,OAGvB,IAFA,IAAIjpC,KAAO8qC,gBAAgB7B,OAEJ,MAAhBA,MAAMM,OAEXS,oBAAoBf,OACpBjpC,KAAO,IAAIilC,aAAa,IAAK,SAAU,CAACjlC,KAAM8qC,gBAAgB7B,SAGhE,OAAOjpC,IACT,CAOA,SAAS8qC,gBAAgB7B,OAYvB,IAXA,IAAIrtD,OAAS,CAACmvD,WAAW9B,QACrBpB,aAAe,GACfmD,UAAY,CACd,KAAM,QACN,KAAM,UACN,IAAK,UACL,IAAK,SACL,KAAM,YACN,KAAM,YAGD,sBAAeA,UAAW/B,MAAMM,QAAQ,CAE7C,IAAI0B,KAAO,CACTz0D,KAAMyyD,MAAMM,MACZ3wD,GAAIoyD,UAAU/B,MAAMM,QAEtB1B,aAAah7D,KAAKo+D,MAClBjB,oBAAoBf,OACpBrtD,OAAO/O,KAAKk+D,WAAW9B,OACzB,CAEA,OAAsB,IAAlBrtD,OAAOtb,OACFsb,OAAO,GACa,IAAlBA,OAAOtb,OACT,IAAI2kE,aAAa4C,aAAa,GAAGrxD,KAAMqxD,aAAa,GAAGjvD,GAAIgD,QAE3D,IAAI4wB,eAAeq7B,aAAahsD,KAAIjb,GAAKA,EAAEgY,KAAKgD,OAE3D,CAQA,SAASmvD,WAAW9B,OAClB,IAAIjpC,KAAMxpB,KAAMoC,GAAIgD,OACpBokB,KAAOkrC,gBAAgBjC,OAOvB,IANA,IAAI+B,UAAY,CACd,KAAM,YACN,KAAM,kBACN,MAAO,iBAGF,sBAAeA,UAAW/B,MAAMM,QAErC3wD,GAAKoyD,UADLx0D,KAAOyyD,MAAMM,OAEbS,oBAAoBf,OACpBrtD,OAAS,CAACokB,KAAMkrC,gBAAgBjC,QAChCjpC,KAAO,IAAIilC,aAAazuD,KAAMoC,GAAIgD,QAGpC,OAAOokB,IACT,CAQA,SAASkrC,gBAAgBjC,OACvB,IAAIjpC,KAAMxpB,KAAMoC,GAAIgD,OACpBokB,KAAOmrC,WAAWlC,OAOlB,IANA,IAAI+B,UAAY,CACdtvD,GAAI,KACJ61C,GAAI,MAIC,sBAAeyZ,UAAW/B,MAAMM,QAErC3wD,GAAKoyD,UADLx0D,KAAOyyD,MAAMM,OAEbS,oBAAoBf,OAEP,OAATzyD,MAAiC,KAAhByyD,MAAMM,MAEzBvpC,KAAO,IAAIilC,aAAa,IAAK,WAAY,CAACjlC,KAAM,IAAIkhC,WAAW,QAAQ,IAGvEtlD,OAAS,CAACokB,KAAMmrC,WAAWlC,QAC3BjpC,KAAO,IAAIilC,aAAazuD,KAAMoC,GAAIgD,SAItC,OAAOokB,IACT,CAQA,SAASmrC,WAAWlC,OAClB,IAAIjpC,KACApkB,OAAS,GAUb,GANEokB,KAFkB,MAAhBipC,MAAMM,MAED,IAAIhyB,aAAa,GAGjB6zB,iBAAiBnC,OAGN,MAAhBA,MAAMM,OAAiBN,MAAMkB,mBAAqBlB,MAAMQ,aAAc,CAIxE,IAFA7tD,OAAO/O,KAAKmzB,MAEW,MAAhBipC,MAAMM,OAAiB3tD,OAAOtb,OAAS,GAE5C0pE,oBAAoBf,OAEA,MAAhBA,MAAMM,OAAiC,MAAhBN,MAAMM,OAAiC,MAAhBN,MAAMM,OAAiC,KAAhBN,MAAMM,MAE7E3tD,OAAO/O,KAAK,IAAIq0D,WAAW,QAG3BtlD,OAAO/O,KAAKu+D,iBAAiBnC,QAM/BjpC,KAFoB,IAAlBpkB,OAAOtb,OAEF,IAAImsC,UAAU7wB,OAAO,GAAIA,OAAO,GAAIA,OAAO,IAI3C,IAAI6wB,UAAU7wB,OAAO,GAAIA,OAAO,GAE3C,CAEA,OAAOokB,IACT,CAQA,SAASorC,iBAAiBnC,OACxB,IAAIjpC,KAAMxpB,KAAMoC,GAAIgD,OACpBokB,KAAOqrC,oBAAoBpC,OAM3B,IALA,IAAI+B,UAAY,CACd,IAAK,MACL,IAAK,YAGA,sBAAeA,UAAW/B,MAAMM,QAAQ,CAE7C3wD,GAAKoyD,UADLx0D,KAAOyyD,MAAMM,OAEbS,oBAAoBf,OACpB,IAAIqC,UAAYD,oBAAoBpC,OAGlCrtD,OADE0vD,UAAUlG,aACH,CAACplC,KAAM,IAAIilC,aAAa,IAAK,WAAY,CAACjlC,KAAMsrC,aAEhD,CAACtrC,KAAMsrC,WAGlBtrC,KAAO,IAAIilC,aAAazuD,KAAMoC,GAAIgD,OACpC,CAEA,OAAOokB,IACT,CAQA,SAASqrC,oBAAoBpC,OAC3B,IAAIjpC,KAAM7iB,KAAM3G,KAAMoC,GAEtBuE,KADA6iB,KAAOurC,4BAA4BtC,OASnC,IAPA,IAAI+B,UAAY,CACd,IAAK,WACL,KAAM,cACN,IAAK,SACL,KAAM,aAIF,sBAAeA,UAAW/B,MAAMM,QAGlC3wD,GAAKoyD,UADLx0D,KAAOyyD,MAAMM,OAEbS,oBAAoBf,OACpB9rD,KAAOouD,4BAA4BtC,OACnCjpC,KAAO,IAAIilC,aAAazuD,KAAMoC,GAAI,CAAConB,KAAM7iB,OAM7C,OAAO6iB,IACT,CAQA,SAASurC,4BAA4BtC,OACnC,IAAIjpC,KAAM7iB,KAIV,IAFAA,KADA6iB,KAAOwrC,WAAWvC,OAIZA,MAAMK,YAAcX,kBAAoC,OAAhBM,MAAMM,OAAkB92C,eAAeuN,SAASipC,MAAMK,YAAcX,kBAAqBl2C,eAAetV,OAAW2V,eAAe3V,OAAqB,MAAZA,KAAK+nD,KAA+B,MAAhB+D,MAAMM,OAM/MpsD,KAAOquD,WAAWvC,OAClBjpC,KAAO,IAAIilC,aAAa,IAAK,WAAY,CAACjlC,KAAM7iB,OAAO,GAQ3D,OAAO6iB,IACT,CAUA,SAASwrC,WAAWvC,OAKlB,IAJA,IAAIjpC,KAAOyrC,gBAAgBxC,OACvB9rD,KAAO6iB,KACP0rC,YAAc,GAII,MAAhBzC,MAAMM,OAAiB92C,eAAetV,OAF/B,CAOT,GAHAuuD,YAAY7+D,KAAKgI,SAAS,CAAC,EAAGo0D,QAC9Be,oBAAoBf,OAEhBA,MAAMK,YAAcX,iBAqBjB,CAEL9zD,SAASo0D,MAAOyC,YAAY5+D,OAE5B,KACF,CArBE,GAHA4+D,YAAY7+D,KAAKgI,SAAS,CAAC,EAAGo0D,QAC9Be,oBAAoBf,OAEhBA,MAAMK,YAAcX,kBAAoC,MAAhBM,MAAMM,MAQ3C,CAELmC,YAAY5+D,MAEZ+H,SAASo0D,MAAOyC,YAAY5+D,OAE5B,KACF,CAZE+H,SAASo0D,MAAOyC,YAAY5+D,OAE5B4+D,YAAY5+D,MACZqQ,KAAOsuD,gBAAgBxC,OACvBjpC,KAAO,IAAIilC,aAAa,IAAK,SAAU,CAACjlC,KAAM7iB,MAkBtD,CAEA,OAAO6iB,IACT,CAQA,SAASyrC,gBAAgBxC,OACvB,IAAIjpC,KAAMxpB,KAAMoC,GAAIgD,OACpBokB,KAAO2rC,WAAW1C,OAMlB,IALA,IAAI+B,UAAY,CACd,IAAK,MACL/9D,IAAK,OAGA,sBAAe+9D,UAAW/B,MAAMM,QAErC3wD,GAAKoyD,UADLx0D,KAAOyyD,MAAMM,OAEbS,oBAAoBf,OAEP,MAATzyD,MAAgByyD,MAAMK,YAAcX,qBAAuC,MAAhBM,MAAMM,MAEnEvpC,KAAO,IAAIilC,aAAa,IAAK,SAAU,CAACjlC,KAAM,IAAIuX,aAAa,OAAO,GAAO,IAE7E37B,OAAS,CAACokB,KAAM2rC,WAAW1C,QAC3BjpC,KAAO,IAAIilC,aAAazuD,KAAMoC,GAAIgD,SAItC,OAAOokB,IACT,CAQA,SAAS2rC,WAAW1C,OAClB,IAAIzyD,KAAMoF,OAAQhD,GACdoyD,UAAY,CACd,IAAK,aACL,IAAK,YACL,IAAK,SACLx3B,IAAK,OAGP,OAAI,sBAAew3B,UAAW/B,MAAMM,QAClC3wD,GAAKoyD,UAAU/B,MAAMM,OACrB/yD,KAAOyyD,MAAMM,MACbS,oBAAoBf,OACpBrtD,OAAS,CAAC+vD,WAAW1C,QACd,IAAIhE,aAAazuD,KAAMoC,GAAIgD,SAatC,SAAkBqtD,OAChB,IAAIjpC,KAAMxpB,KAAMoC,GAAIgD,OACpBokB,KAoBF,SAAgCipC,OAC9B,IAAIjpC,KAAMxpB,KAAMoC,GAChBonB,KA+CF,SAA0BipC,OACxB,IAAIrtD,OAAS,GAEb,GAAIqtD,MAAMK,YAAcX,kBAAoB,sBAAeM,MAAMP,WAAYO,MAAMM,OAAQ,CACzF,IAAIqC,WAAa3C,MAAMP,WAAWO,MAAMM,OAGxC,GAFAF,SAASJ,OAEW,MAAhBA,MAAMM,MAAe,CAKvB,GAJA3tD,OAAS,GACTquD,WAAWhB,OACXI,SAASJ,OAEW,MAAhBA,MAAMM,MAGR,IAFA3tD,OAAO/O,KAAKu9D,gBAAgBnB,QAEL,MAAhBA,MAAMM,OAEXF,SAASJ,OACTrtD,OAAO/O,KAAKu9D,gBAAgBnB,QAIhC,GAAoB,MAAhBA,MAAMM,MACR,MAAMO,kBAAkBb,MAAO,0BAGjCiB,YAAYjB,OACZI,SAASJ,MACX,CAIA,OAAO,IAAI2C,WAAWhwD,OACxB,CAEA,OASF,SAAqBqtD,OACnB,IAAUzyD,KAEV,GAAIyyD,MAAMK,YAAcX,kBAAoBM,MAAMK,YAAcX,qBAAuBM,MAAMM,SAASV,iBAgBpG,OAfAryD,KAAOyyD,MAAMM,MACbF,SAASJ,OAaF4C,eAAe5C,MAXlB,sBAAeH,UAAWtyD,MAErB,IAAI+gC,aAAauxB,UAAUtyD,QACY,IAArCuyD,kBAAkBpiE,QAAQ6P,MAE5B,IAAI+gC,aAAaX,QAAQpgC,KAAM,WAE/B,IAAI0qD,WAAW1qD,OAQ1B,OAoGF,SAAiCyyD,OAC/B,IAAUzjE,IAEV,GAAoB,MAAhByjE,MAAMM,MAMR,OALA/jE,IAAMsmE,6BAA6B7C,OAI5B4C,eAAe5C,MAFf,IAAI1xB,aAAa/xC,MAM1B,OAuCF,SAAiCyjE,OAC/B,IAAUzjE,IAEV,GAAoB,MAAhByjE,MAAMM,MAMR,OALA/jE,IAAMumE,6BAA6B9C,OAI5B4C,eAAe5C,MAFf,IAAI1xB,aAAa/xC,MAM1B,OAuCF,SAAqByjE,OACnB,IAAInsD,MAAOlB,OAAQ2nB,KAAM2c,KAEzB,GAAoB,MAAhB+oB,MAAMM,MAAe,CAKvB,GAHAU,WAAWhB,OACXI,SAASJ,OAEW,MAAhBA,MAAMM,MAAe,CAEvB,IAAI/lC,IAAMwoC,SAAS/C,OAEnB,GAAoB,MAAhBA,MAAMM,MAAe,CAKvB,IAHAhmC,KAAO,EACP3nB,OAAS,CAAC4nB,KAEa,MAAhBylC,MAAMM,OAEXF,SAASJ,OACTrtD,OAAO2nB,MAAQyoC,SAAS/C,OACxB1lC,OAGF,GAAoB,MAAhB0lC,MAAMM,MACR,MAAMO,kBAAkBb,MAAO,4BAGjCiB,YAAYjB,OACZI,SAASJ,OAET/oB,KAAOtkC,OAAO,GAAG2vB,MAAMjrC,OAEvB,IAAK,IAAIkB,EAAI,EAAGA,EAAI+hC,KAAM/hC,IACxB,GAAIoa,OAAOpa,GAAG+pC,MAAMjrC,SAAW4/C,KAC7B,MAAM3pC,YAAY0yD,MAAO,+BAAsCrtD,OAAOpa,GAAG+pC,MAAMjrC,OAAS,QAAU4/C,KAAO,KAI7GpjC,MAAQ,IAAIwuB,UAAU1vB,OACxB,KAAO,CAEL,GAAoB,MAAhBqtD,MAAMM,MACR,MAAMO,kBAAkBb,MAAO,4BAGjCiB,YAAYjB,OACZI,SAASJ,OACTnsD,MAAQ0mB,GACV,CACF,MAEE0mC,YAAYjB,OACZI,SAASJ,OACTnsD,MAAQ,IAAIwuB,UAAU,IAGxB,OAAOugC,eAAe5C,MAAOnsD,MAC/B,CAEA,OA6BF,SAAqBmsD,OACnB,GAAoB,MAAhBA,MAAMM,MAAe,CAEvB,IAAIr0D,IADJ+0D,WAAWhB,OAEX,IAAIx0C,WAAa,CAAC,EAElB,GAGE,GAFA40C,SAASJ,OAEW,MAAhBA,MAAMM,MAAe,CAEvB,GAAoB,MAAhBN,MAAMM,MACRr0D,IAAM42D,6BAA6B7C,YAC9B,GAAoB,MAAhBA,MAAMM,MACfr0D,IAAM62D,6BAA6B9C,WAC9B,MAAIA,MAAMK,YAAcX,kBAAoBM,MAAMK,YAAcX,qBAAuBM,MAAMM,SAASV,kBAI3G,MAAMiB,kBAAkBb,MAAO,2CAH/B/zD,IAAM+zD,MAAMM,MACZF,SAASJ,MAGX,CAGA,GAAoB,MAAhBA,MAAMM,MACR,MAAMO,kBAAkBb,MAAO,qCAGjCI,SAASJ,OAETx0C,WAAWvf,KAAOk1D,gBAAgBnB,MACpC,QACuB,MAAhBA,MAAMM,OAGf,GAAoB,MAAhBN,MAAMM,MACR,MAAMO,kBAAkBb,MAAO,oDAGjCiB,YAAYjB,OACZI,SAASJ,OACT,IAAIjpC,KAAO,IAAI2kC,WAAWlwC,YAG1B,OADAuL,KAAO6rC,eAAe5C,MAAOjpC,KAE/B,CAEA,OASF,SAAqBipC,OACnB,IAAIgD,UAEJ,GAAIhD,MAAMK,YAAcX,iBAItB,OAFAsD,UAAYhD,MAAMM,MAClBF,SAASJ,OACF,IAAI1xB,aAAaX,QAAQq1B,UAAWj5D,OAAOoqB,SAGpD,OASF,SAA0B6rC,OACxB,IAAIjpC,KAEJ,GAAoB,MAAhBipC,MAAMM,MAAe,CAMvB,GAJAU,WAAWhB,OACXI,SAASJ,OACTjpC,KAAOoqC,gBAAgBnB,OAEH,MAAhBA,MAAMM,MACR,MAAMO,kBAAkBb,MAAO,0BAOjC,OAJAiB,YAAYjB,OACZI,SAASJ,OAETjpC,KAAO6rC,eAAe5C,MADtBjpC,KAAO,IAAIonC,gBAAgBpnC,MAG7B,CAEA,OASF,SAAkBipC,OAChB,KAAoB,KAAhBA,MAAMM,MAEFO,kBAAkBb,MAAO,gCAEzBa,kBAAkBb,MAAO,iBAEnC,CAhBSiD,CAASjD,MAClB,CA9BSkD,CAAiBlD,MAC1B,CApBSvhB,CAAYuhB,MACrB,CA5ESmD,CAAYnD,MACrB,CApGSoD,CAAYpD,MACrB,CApDSqD,CAAwBrD,MACjC,CAjHSsD,CAAwBtD,MACjC,CAhCSuD,CAAYvD,MACrB,CAnFSwD,CAAiBxD,OACxB,IAAI+B,UAAY,CACd,IAAK,YACL,IAAM,cAGR,KAAO,sBAAeA,UAAW/B,MAAMM,QAErC3wD,GAAKoyD,UADLx0D,KAAOyyD,MAAMM,OAEbF,SAASJ,OAGTjpC,KAAO6rC,eAAe5C,MADtBjpC,KAAO,IAAIilC,aAAazuD,KAAMoC,GADrB,CAAConB,QAKZ,OAAOA,IACT,CAtCS0sC,CAAuBzD,QAEV,MAAhBA,MAAMM,OAAiC,OAAhBN,MAAMM,SAE/B3wD,GAAc,OADdpC,KAAOyyD,MAAMM,OACO,MAAQ,SAC5BS,oBAAoBf,OACpBrtD,OAAS,CAACokB,KAAM2rC,WAAW1C,QAE3BjpC,KAAO,IAAIilC,aAAazuD,KAAMoC,GAAIgD,SAGpC,OAAOokB,IACT,CAxBS2sC,CAAS1D,MAClB,CAoKA,SAAS4C,eAAe5C,MAAOjpC,KAAM5lB,OAGnC,IAFA,IAAIwB,SAEoB,MAAhBqtD,MAAMM,OAAiC,MAAhBN,MAAMM,OAAiC,MAAhBN,MAAMM,OAAoBnvD,QAAyC,IAAhCA,MAAMzT,QAAQsiE,MAAMM,SAI3G,GAFA3tD,OAAS,GAEW,MAAhBqtD,MAAMM,MAAe,CACvB,IAAIt2C,aAAa+M,QAAS7N,eAAe6N,MA0BvC,OAAOA,KArBP,GAHAiqC,WAAWhB,OACXI,SAASJ,OAEW,MAAhBA,MAAMM,MAGR,IAFA3tD,OAAO/O,KAAKu9D,gBAAgBnB,QAEL,MAAhBA,MAAMM,OAEXF,SAASJ,OACTrtD,OAAO/O,KAAKu9D,gBAAgBnB,QAIhC,GAAoB,MAAhBA,MAAMM,MACR,MAAMO,kBAAkBb,MAAO,0BAGjCiB,YAAYjB,OACZI,SAASJ,OACTjpC,KAAO,IAAIwhC,aAAaxhC,KAAMpkB,OAOlC,MAAO,GAAoB,MAAhBqtD,MAAMM,MAAe,CAK9B,GAHAU,WAAWhB,OACXI,SAASJ,OAEW,MAAhBA,MAAMM,MAGR,IAFA3tD,OAAO/O,KAAKu9D,gBAAgBnB,QAEL,MAAhBA,MAAMM,OAEXF,SAASJ,OACTrtD,OAAO/O,KAAKu9D,gBAAgBnB,QAIhC,GAAoB,MAAhBA,MAAMM,MACR,MAAMO,kBAAkBb,MAAO,0BAGjCiB,YAAYjB,OACZI,SAASJ,OACTjpC,KAAO,IAAI8K,aAAa9K,KAAM,IAAI2jC,UAAU/nD,QAC9C,KAAO,CAIL,GAFAytD,SAASJ,OAELA,MAAMK,YAAcX,iBACtB,MAAMmB,kBAAkBb,MAAO,oCAGjCrtD,OAAO/O,KAAK,IAAI0qC,aAAa0xB,MAAMM,QACnCF,SAASJ,OAETjpC,KAAO,IAAI8K,aAAa9K,KAAM,IAAI2jC,UAAU/nD,QAD1B,GAEpB,CAGF,OAAOokB,IACT,CA4BA,SAAS8rC,6BAA6B7C,OAGpC,IAFA,IAAIzjE,IAAM,GAEyB,KAA5B0jE,iBAAiBD,QAA6C,MAA5BC,iBAAiBD,QACxB,OAA5BC,iBAAiBD,SAGnBzjE,KAAO0jE,iBAAiBD,OACxBhvC,KAAKgvC,QAGPzjE,KAAO0jE,iBAAiBD,OACxBhvC,KAAKgvC,OAKP,GAFAI,SAASJ,OAEW,MAAhBA,MAAMM,MACR,MAAMO,kBAAkBb,MAAO,4BAIjC,OADAI,SAASJ,OACFvtC,KAAK36B,MAAM,IAAMyE,IAAM,IAChC,CA4BA,SAASumE,6BAA6B9C,OAGpC,IAFA,IAAIzjE,IAAM,GAEyB,KAA5B0jE,iBAAiBD,QAA6C,MAA5BC,iBAAiBD,QACxB,OAA5BC,iBAAiBD,SAGnBzjE,KAAO0jE,iBAAiBD,OACxBhvC,KAAKgvC,QAGPzjE,KAAO0jE,iBAAiBD,OACxBhvC,KAAKgvC,OAKP,GAFAI,SAASJ,OAEW,MAAhBA,MAAMM,MACR,MAAMO,kBAAkBb,MAAO,4BAIjC,OADAI,SAASJ,OACFvtC,KAAK36B,MAAM,IAAMyE,IAAM,IAChC,CA4EA,SAASwmE,SAAS/C,OAIhB,IAHA,IAAIrtD,OAAS,CAACwuD,gBAAgBnB,QAC1B/gE,IAAM,EAEa,MAAhB+gE,MAAMM,OAEXF,SAASJ,OAETrtD,OAAO1T,KAAOkiE,gBAAgBnB,OAC9B/gE,MAGF,OAAO,IAAIojC,UAAU1vB,OACvB,CA0IA,SAAS+nB,IAAIslC,OACX,OAAOA,MAAM3yD,MAAQ2yD,MAAMM,MAAMjpE,OAAS,CAC5C,CAUA,SAASwpE,kBAAkBb,MAAOnjD,SAChC,IAAIllB,EAAI+iC,IAAIslC,OACRxhD,MAAQ,IAAInoB,YAAYwmB,QAAU,UAAYllB,EAAI,KAEtD,OADA6mB,MAAMmlD,KAAOhsE,EACN6mB,KACT,CAUA,SAASlR,YAAY0yD,MAAOnjD,SAC1B,IAAIllB,EAAI+iC,IAAIslC,OACRxhD,MAAQ,IAAInoB,YAAYwmB,QAAU,UAAYllB,EAAI,KAEtD,OADA6mB,MAAMmlD,KAAOhsE,EACN6mB,KACT,CAEA,OAtyCA1mB,MAAMgpE,QAAU,SAAiBnpE,EAAGisE,MAAOC,OACzC,OAAO/rE,MAAMgsE,oBAAoBnsE,IAAMG,MAAMisE,kBAAkBpsE,EAAGksE,QAAU/rE,MAAMisE,kBAAkBH,MAAOjsE,EAC7G,EAQAG,MAAMgsE,oBAAsB,SAA6BnsE,GACvD,MAAO,sDAAsD+R,KAAK/R,EACpE,EAkBAG,MAAMisE,kBAAoB,SAA2BC,KAAMC,KACzD,MAAO,aAAav6D,KAAKs6D,OAAS,oBAAoBt6D,KAAKu6D,MAAQ,2KAA2Kv6D,KAAKu6D,IACrP,EASAnsE,MAAMyoE,aAAe,SAAsB5oE,EAAG6oE,cAE5C,MAAa,MAAN7oE,GAAmB,OAANA,GAAoB,OAANA,GAAc6oE,aAAe,CACjE,EAUA1oE,MAAM8oE,cAAgB,SAAuBjpE,EAAGksE,OAC9C,MAAa,MAANlsE,GAAuB,MAAVksE,OAA2B,MAAVA,OAA2B,MAAVA,KACxD,EAQA/rE,MAAM4mD,WAAa,SAAoB/mD,GACrC,OAAOA,GAAK,KAAOA,GAAK,KAAa,MAANA,CACjC,EAQAG,MAAMymD,QAAU,SAAiB5mD,GAC/B,OAAOA,GAAK,KAAOA,GAAK,GAC1B,EAQAG,MAAM6oE,WAAa,SAAoBhpE,GACrC,OAAOA,GAAK,KAAOA,GAAK,KAAOA,GAAK,KAAOA,GAAK,KAAOA,GAAK,KAAOA,GAAK,GAC1E,EAgtCOG,KAAK,IC7vDHosE,qBAAuB,CAChCC,kBCc6B,CAC7BziC,yBACAS,sBACAgC,2BACAW,sBACAW,4BACA2I,yBACAI,mCACAurB,yBACAC,sBACA8B,uBACAkC,yBACAC,4BACAI,sBACAK,2BACAvG,uBACA3mB,oBACApV,kBACAijC,aD/BAjjC,kBACAgoC,eELyC,gBAFhC,WACQ,CAAC,QAAS,UAC0C53D,OACrE,IAAI,MACG,OAEHA,KAkCJ,OAAO0E,MAxCE,WAwCU,CACjBwvB,OAAQ,SAAgBnK,MACtB,IAAIjL,MAAQoK,iBACZ,OAAO59B,MAAMy+B,MAAMF,UAAUD,SAAS9K,MACxC,EACA,uBAAwB,SAAyBiL,KAAMjL,OACrD,OAAOxzB,MAAMy+B,MAAMF,UAAUD,SAAS9K,MACxC,EACA,iBAAkB,SAAqBiL,MACrC,IAAIjL,MAAQoK,iBACZ,OAAOmZ,QAAQtY,MAAM,SAAU/kB,OAC7B,OAAO1Z,MAAM0Z,OAAO6kB,UAAUD,SAAS9K,MACzC,GACF,EACA,+BAAgC,SAA8BiL,KAAMjL,OAClE,OAAOujB,QAAQtY,MAAM,SAAU/kB,OAC7B,OAAO1Z,MAAM0Z,OAAO6kB,UAAUD,SAAS9K,MACzC,GACF,GACA,KC1DO+4C,kBAAmC,gBAFnC,cACQ,CAAC,QAAS,gBAC6C73D,OACxE,IAAI,MACG,aAEHA,KAoBJ,OAAO,SAAqBjW,EAAGC,EAAGiZ,UAEhC,IAAI4jC,QAAU98C,EAAEwmC,QACZuW,OAAS/8C,EAAEymC,OACXuW,KAAOh9C,EAAE0mC,KACTgV,MAAQ17C,EAAEuiC,MACVoZ,IAAM37C,EAAEwiC,UAERoZ,QAAU37C,EAAEumC,QACZqV,OAAS57C,EAAEwmC,OACXqV,KAAO77C,EAAEymC,KACTqV,MAAQ97C,EAAEsiC,MACVyZ,IAAM/7C,EAAEuiC,UAEZ,GAAIkZ,MAAM56C,SAAWi7C,MAAMj7C,OACzB,MAAM,IAAIu3B,eAAeqjB,MAAM56C,OAAQi7C,MAAMj7C,QAI/C,GAAI46C,MAAM,KAAOK,MAAM,IAAML,MAAM,KAAOK,MAAM,GAC9C,MAAM,IAAIze,WAAW,iCAAmCoe,MAAQ,0BAA4BK,MAAQ,KAItG,IAGIE,GAHAlY,KAAO2X,MAAM,GACbzX,QAAUyX,MAAM,GAIhB7xC,GAAKi9B,YAELC,KAAO,EAEPmV,GAAKhjC,SAEU,iBAARyiC,KAAoBA,MAAQK,MAErCC,GAAKN,IAEL9xC,GAAK8Q,MAAMc,KAAKqrB,YAAa,CAACmV,GAAIA,KAElClV,KAAOpsB,MAAMoB,QAAQ,EAAGkgC,IAExBC,GAAKvhC,MAAMc,KAAKvC,SAAU,CAAC+iC,GAAIA,MAIjC,IAUI96C,EAAG4F,EAAGlB,EAAGqiC,GAAIC,GAVbqW,QAAU1B,SAAWlB,QAAU,QAAKl7C,EACpC+9C,OAAS,GACTC,KAAO,GAEPpC,GAAKQ,SAAWlB,QAAU,QAAKl7C,EAC/B67C,GAAKO,SAAWlB,QAAU,QAAKl7C,EAE/B87C,GAAK,GACLC,GAAK,GAIT,IAAK11C,EAAI,EAAGA,EAAIk9B,QAASl9B,IAAK,CAE5B23C,KAAK33C,GAAK03C,OAAO39C,OAEjB,IAAIs7C,KAAOr1C,EAAI,EAEf,IAAKmhC,GAAK8U,KAAKj2C,GAAIohC,GAAK6U,KAAKj2C,EAAI,GAAIlB,EAAIqiC,GAAIriC,EAAIsiC,GAAItiC,IAEnD1E,EAAI47C,OAAOl3C,GAEX44C,OAAOpxC,KAAKlM,GAEZq7C,GAAGr7C,GAAKi7C,KAEJE,KACFA,GAAGn7C,GAAK27C,QAAQj3C,IAKpB,IAAKqiC,GAAK4T,KAAK/0C,GAAIohC,GAAK2T,KAAK/0C,EAAI,GAAIlB,EAAIqiC,GAAIriC,EAAIsiC,GAAItiC,IAInD,GAAI22C,GAFJr7C,EAAI06C,OAAOh2C,MAEGu2C,MAEZ,GAAIE,GAAI,CAEN,IAAI5oC,EAAIwoC,GAAGI,GAAGn7C,GAAIy6C,QAAQ/1C,IAErBgE,GAAG6J,EAAGqzB,MAKTyV,GAAGr7C,GAAK,KAHRm7C,GAAGn7C,GAAKuS,CAKZ,OAGA+qC,OAAOpxC,KAAKlM,GAEZs7C,GAAGt7C,GAAKi7C,KAEJG,KACFA,GAAGp7C,GAAKy6C,QAAQ/1C,IAMtB,GAAIy2C,IAAMC,GAIR,IAFA12C,EAAI64C,KAAK33C,GAEFlB,EAAI44C,OAAO39C,QAIZ07C,GAFJr7C,EAAIs9C,OAAO54C,MAEGu2C,MAEZoC,QAAQ34C,GAAKy2C,GAAGn7C,GAEhB0E,KACS42C,GAAGt7C,KAAOi7C,MAEnBoC,QAAQ34C,GAAK02C,GAAGp7C,GAEhB0E,KAGA44C,OAAOz5B,OAAOnf,EAAG,EAIzB,CAKA,OAFA64C,KAAKza,SAAWwa,OAAO39C,OAEhBd,EAAEqoC,mBAAmB,CAC1B1T,OAAQ6pB,QACR1nC,MAAO2nC,OACP5X,IAAK6X,KACL9oB,KAAM,CAACmO,KAAME,SACblC,SAAUka,IAEd,CAAC,ICnKQ8xB,gBAAkB,CAC3BlpC,wBACAmF,yBACAmP,sBACA/S,wBACAgE,mBACAvE,kBACAmoC,UCToC,gBAF3B,MACQ,CAAC,QAAS,SAAU,YAAa,cAAe,cAAe,iBAChB/3D,OAChE,IAAI,MACG,OACC,UACG,YACE,YACA,cAETA,KACA8vC,YAAcT,kBAAkB,CAClC3qC,QAEEszD,YAAcH,kBAAkB,CAClCnzD,MACAmsB,cAEEmf,YAAcN,kBAAkB,CAClChrC,MACA0nB,cAEEyb,YAAcb,kBAAkB,CAClCtiC,QAEEojC,YAAcN,kBAAkB,CAClC9iC,QAqCF,OAAOA,MA/DE,MA+DUkZ,OAAO,CAExB,2BAA4B,SAAgCp0B,EAAG8C,GAC7D,OAAOu7C,YAAYr+C,EAAG8C,EAAGm/C,UAC3B,EACA,4BAA6B,SAAiCjiD,EAAG8C,GAC/D,OAAOwjD,YAAYtmD,EAAG8C,EAAGm/C,WAAW,EACtC,EACA,4BAA6B,SAAiCjiD,EAAG8C,GAC/D,OAAOwjD,YAAYxjD,EAAG9C,EAAGiiD,WAAW,EACtC,EACA,6BAA8B,SAAkCjiD,EAAG8C,GACjE,OAAO0rE,YAAYxuE,EAAG8C,EAAGm/C,UAC3B,EACA,eAAgB,SAAoBjiD,EAAG8C,GAErC,OAAOhD,KAAKo+B,OAAOl+B,GAAIk+B,OAAOp7B,IAAI2N,SACpC,EACA,gBAAiB,SAAqBzQ,EAAG8C,GAEvC,OAAOhD,KAAKo+B,OAAOl+B,GAAI8C,EACzB,EACA,gBAAiB,SAAqB9C,EAAG8C,GAEvC,OAAOhD,KAAKE,EAAGk+B,OAAOp7B,GACxB,EACA,mBAAoB,SAAwB9C,EAAG8C,GAC7C,OAAOw7C,YAAYt+C,EAAG8C,EAAGm/C,WAAW,EACtC,EACA,oBAAqB,SAAyBjiD,EAAG8C,GAC/C,OAAO0jD,YAAYxmD,EAAG8C,EAAGm/C,WAAW,EACtC,EACA,mBAAoB,SAAwBjiD,EAAG8C,GAC7C,OAAOw7C,YAAYx7C,EAAG9C,EAAGiiD,WAAW,EACtC,EACA,oBAAqB,SAAyBjiD,EAAG8C,GAC/C,OAAO0jD,YAAY1jD,EAAG9C,EAAGiiD,WAAW,EACtC,EACA,aAAc,SAAkBjiD,EAAG8C,GAEjC,OAAOw7C,YAAYpgB,OAAOl+B,GAAI8C,EAAGm/C,WAAW,GAAOxxC,SACrD,EACA,aAAc,SAAkBzQ,EAAG8C,GAEjC,OAAOw7C,YAAYpgB,OAAOp7B,GAAI9C,EAAGiiD,WAAW,GAAMxxC,SACpD,EACA,WAAYwxC,UACZ,mBAAoB,SAAmBjiD,EAAG8C,EAAGkiD,MAG3C,IAFA,IAAIluC,OAAShX,KAAKE,EAAG8C,GAEZpB,EAAI,EAAGA,EAAIsjD,KAAK3jD,OAAQK,IAC/BoV,OAAShX,KAAKgX,OAAQkuC,KAAKtjD,IAG7B,OAAOoV,MACT,GACCmrC,UAAU/lC,YAAY,KCtHhBuyD,mBAAqB,CAC9BrpC,wBACAuF,mBACAvE,kBACAsoC,aCFuC,gBAF9B,SACQ,CAAC,QAAS,SAAU,SAAU,gBACoBl4D,OACnE,IAAI,MACG,OACC,OACA,aAEJA,KACA0nC,YAActC,kBAAkB,CAClC1gC,QAEEijC,YAAcvB,kBAAkB,CAClC1hC,MACA0nB,cAEEwb,YAAchB,kBAAkB,CAClCliC,MACA0nB,cAEEyb,YAAcb,kBAAkB,CAClCtiC,QAEEojC,YAAcN,kBAAkB,CAClC9iC,QAkCF,OAAOA,MA1DE,SA0DU,CACjB,mBAAoB,SAAwBlb,EAAG8C,GAC7C,OAAO9C,EAAI8C,CACb,EACA,iBAAkB,SAAsB9C,EAAG8C,GACzC,OAAO9C,EAAI8C,IAAM,mBAAY9C,EAAG8C,EAAGiR,OAAO8jB,QAC5C,EACA,uBAAwB,SAA4B73B,EAAG8C,GACrD,OAAO9C,EAAEqI,GAAGvF,KAAO,wBAAe9C,EAAG8C,EAAGiR,OAAO8jB,QACjD,EACA,qBAAsB,SAA0B73B,EAAG8C,GACjD,OAAwB,IAAjB9C,EAAE4Q,QAAQ9N,EACnB,EACA,mBAAoB,WAClB,MAAM,IAAI6Y,UAAU,sDACtB,EACA,aAAc,SAAkB3b,EAAG8C,GACjC,IAAK9C,EAAE0mC,UAAU5jC,GACf,MAAM,IAAI+D,MAAM,4CAGlB,OAAO/G,KAAKE,EAAE+b,MAAOjZ,EAAEiZ,MACzB,EACA,6BAA8B,SAAkC/b,EAAG8C,GACjE,OAAOq7C,YAAYn+C,EAAG8C,EAAGhD,KAC3B,EACA,4BAA6B,SAAiCE,EAAG8C,GAC/D,OAAOo7C,YAAYp7C,EAAG9C,EAAGF,MAAM,EACjC,EACA,4BAA6B,SAAiCE,EAAG8C,GAC/D,OAAOo7C,YAAYl+C,EAAG8C,EAAGhD,MAAM,EACjC,EACA,2BAA4B,SAAgCE,EAAG8C,GAC7D,OAAOu7C,YAAYr+C,EAAG8C,EAAGhD,KAC3B,EACA,eAAgB,SAAoBE,EAAG8C,GAErC,OAAOhD,KAAKo+B,OAAOl+B,GAAIk+B,OAAOp7B,IAAI2N,SACpC,EACA,gBAAiB,SAAqBzQ,EAAG8C,GAEvC,OAAOhD,KAAKo+B,OAAOl+B,GAAI8C,EACzB,EACA,gBAAiB,SAAqB9C,EAAG8C,GAEvC,OAAOhD,KAAKE,EAAGk+B,OAAOp7B,GACxB,EACA,oBAAqB,SAAyB9C,EAAG8C,GAC/C,OAAOs7C,YAAYp+C,EAAG8C,EAAGhD,MAAM,EACjC,EACA,mBAAoB,SAAwBE,EAAG8C,GAC7C,OAAOw7C,YAAYt+C,EAAG8C,EAAGhD,MAAM,EACjC,EACA,oBAAqB,SAAyBE,EAAG8C,GAC/C,OAAOs7C,YAAYt7C,EAAG9C,EAAGF,MAAM,EACjC,EACA,mBAAoB,SAAwBE,EAAG8C,GAC7C,OAAOw7C,YAAYx7C,EAAG9C,EAAGF,MAAM,EACjC,EACA,aAAc,SAAkBE,EAAG8C,GAEjC,OAAOw7C,YAAYpgB,OAAOl+B,GAAI8C,EAAGhD,MAAM,GAAO2Q,SAChD,EACA,aAAc,SAAkBzQ,EAAG8C,GAEjC,OAAOw7C,YAAYpgB,OAAOp7B,GAAI9C,EAAGF,MAAM,GAAM2Q,SAC/C,GACA,KC9HOk+D,0BAA4B,CACrCF,mBACAG,oBCD+B,CAC/BxpC,wBACAuF,mBACAvE,kBACAyoC,cCFwC,gBAF/B,UACQ,CAAC,QAAS,SAAU,SAAU,gBACqBr4D,OACpE,IAAI,MACG,OACC,OACA,aAEJA,KACA0nC,YAActC,kBAAkB,CAClC1gC,QAEEijC,YAAcvB,kBAAkB,CAClC1hC,MACA0nB,cAEEwb,YAAchB,kBAAkB,CAClCliC,MACA0nB,cAEEyb,YAAcb,kBAAkB,CAClCtiC,QAEEojC,YAAcN,kBAAkB,CAClC9iC,QAkCF,OAAOA,MA1DE,UA0DU,CACjB,mBAAoB,SAAwBlb,EAAG8C,GAC7C,OAAO9C,EAAI8C,CACb,EACA,iBAAkB,SAAsB9C,EAAG8C,GACzC,OAAO9C,EAAI8C,IAAM,mBAAY9C,EAAG8C,EAAGiR,OAAO8jB,QAC5C,EACA,uBAAwB,SAA4B73B,EAAG8C,GACrD,OAAO9C,EAAE+M,GAAGjK,KAAO,wBAAe9C,EAAG8C,EAAGiR,OAAO8jB,QACjD,EACA,qBAAsB,SAA0B73B,EAAG8C,GACjD,OAAyB,IAAlB9C,EAAE4Q,QAAQ9N,EACnB,EACA,mBAAoB,SAAwB9C,EAAG8C,GAC7C,MAAM,IAAI6Y,UAAU,sDACtB,EACA,aAAc,SAAkB3b,EAAG8C,GACjC,IAAK9C,EAAE0mC,UAAU5jC,GACf,MAAM,IAAI+D,MAAM,4CAGlB,OAAO/G,KAAKE,EAAE+b,MAAOjZ,EAAEiZ,MACzB,EACA,6BAA8B,SAAkC/b,EAAG8C,GACjE,OAAOq7C,YAAYn+C,EAAG8C,EAAGhD,KAC3B,EACA,4BAA6B,SAAiCE,EAAG8C,GAC/D,OAAOo7C,YAAYp7C,EAAG9C,EAAGF,MAAM,EACjC,EACA,4BAA6B,SAAiCE,EAAG8C,GAC/D,OAAOo7C,YAAYl+C,EAAG8C,EAAGhD,MAAM,EACjC,EACA,2BAA4B,SAAgCE,EAAG8C,GAC7D,OAAOu7C,YAAYr+C,EAAG8C,EAAGhD,KAC3B,EACA,eAAgB,SAAoBE,EAAG8C,GAErC,OAAOhD,KAAKo+B,OAAOl+B,GAAIk+B,OAAOp7B,IAAI2N,SACpC,EACA,gBAAiB,SAAqBzQ,EAAG8C,GAEvC,OAAOhD,KAAKo+B,OAAOl+B,GAAI8C,EACzB,EACA,gBAAiB,SAAqB9C,EAAG8C,GAEvC,OAAOhD,KAAKE,EAAGk+B,OAAOp7B,GACxB,EACA,oBAAqB,SAAyB9C,EAAG8C,GAC/C,OAAOs7C,YAAYp+C,EAAG8C,EAAGhD,MAAM,EACjC,EACA,mBAAoB,SAAwBE,EAAG8C,GAC7C,OAAOw7C,YAAYt+C,EAAG8C,EAAGhD,MAAM,EACjC,EACA,oBAAqB,SAAyBE,EAAG8C,GAC/C,OAAOs7C,YAAYt7C,EAAG9C,EAAGF,MAAM,EACjC,EACA,mBAAoB,SAAwBE,EAAG8C,GAC7C,OAAOw7C,YAAYx7C,EAAG9C,EAAGF,MAAM,EACjC,EACA,aAAc,SAAkBE,EAAG8C,GAEjC,OAAOw7C,YAAYpgB,OAAOl+B,GAAI8C,EAAGhD,MAAM,GAAO2Q,SAChD,EACA,aAAc,SAAkBzQ,EAAG8C,GAEjC,OAAOw7C,YAAYpgB,OAAOp7B,GAAI9C,EAAGF,MAAM,GAAM2Q,SAC/C,GACA,KF3HFq+D,yBGPmD,gBAF1C,gBACQ,CAAC,UAAW,WACkDt4D,OAC/E,IAAI,QACK,QAELA,KACAu4D,cAAgB,EAAM9uE,KAAKW,KAAK,EAAMX,KAAKuC,KAAK,IAAQ,GAO5D,SAASwsE,gBACP,KAAMlvE,gBAAgBkvE,eACpB,MAAM,IAAI3uE,YAAY,oDAIxBP,KAAKmvE,SAAW,KAChBnvE,KAAKgjC,MAAQ,CACf,CA6LA,SAASosC,KAAK9tB,QAASrgB,KAAMI,QAE3BJ,KAAKouC,KAAKC,MAAQruC,KAAKquC,MACvBruC,KAAKquC,MAAMD,KAAOpuC,KAAKouC,KACvBhuC,OAAOk2B,SAEHl2B,OAAOlI,QAAU8H,OACnBI,OAAOlI,MAAQ8H,KAAKquC,OAIA,IAAlBjuC,OAAOk2B,SACTl2B,OAAOlI,MAAQ,MAIjB8H,KAAKouC,KAAO/tB,QACZrgB,KAAKquC,MAAQhuB,QAAQguB,MACrBhuB,QAAQguB,MAAQruC,KAChBA,KAAKquC,MAAMD,KAAOpuC,KAElBA,KAAKI,OAAS,KAEdJ,KAAK4b,MAAO,CACd,CASA,SAAS0yB,cAAcjuB,QAASrgB,MAE9B,IAAII,OAASJ,KAAKI,OAEbA,SAKAJ,KAAK4b,MAIRuyB,KAAK9tB,QAASrgB,KAAMI,QAGpBkuC,cAAcluC,SANdJ,KAAK4b,MAAO,EAQhB,CA1OAqyB,cAAcjtE,UAAU8Z,KAAO,gBAC/BmzD,cAAcjtE,UAAUutE,iBAAkB,EAQ1CN,cAAcjtE,UAAUwtE,OAAS,SAAUt5D,IAAK8F,OAE9C,IAAIglB,KAAO,CACT9qB,IACA8F,MACAs7C,OAAQ,GAGV,GAAIv3D,KAAKmvE,SAAU,CAEjB,IAAI7tB,QAAUthD,KAAKmvE,SAEnBluC,KAAKouC,KAAO/tB,QACZrgB,KAAKquC,MAAQhuB,QAAQguB,MACrBhuB,QAAQguB,MAAQruC,KAChBA,KAAKquC,MAAMD,KAAOpuC,KAEdiU,QAAQ/+B,IAAKmrC,QAAQnrC,OAEvBnW,KAAKmvE,SAAWluC,KAEpB,MAEEA,KAAKouC,KAAOpuC,KACZA,KAAKquC,MAAQruC,KAEbjhC,KAAKmvE,SAAWluC,KAMlB,OAFAjhC,KAAKgjC,QAEE/B,IACT,EAOAiuC,cAAcjtE,UAAUo0B,KAAO,WAC7B,OAAOr2B,KAAKgjC,KACd,EAOAksC,cAAcjtE,UAAUklD,MAAQ,WAC9BnnD,KAAKmvE,SAAW,KAChBnvE,KAAKgjC,MAAQ,CACf,EAOAksC,cAAcjtE,UAAUytE,QAAU,WAChC,OAAsB,IAAf1vE,KAAKgjC,KACd,EAQAksC,cAAcjtE,UAAU0tE,eAAiB,WAEvC,IAAI1uC,KAAOjhC,KAAKmvE,SAEhB,GAAa,OAATluC,KACF,OAAOA,KAUT,IANA,IAAIqgB,QAAUthD,KAAKmvE,SAEfS,iBAAmB3uC,KAAKs2B,OAExBr3D,EAAI+gC,KAAK9H,MAENy2C,iBAAmB,GAAG,CAE3B,IAAIC,UAAY3vE,EAAEovE,MAElBpvE,EAAEmvE,KAAKC,MAAQpvE,EAAEovE,MACjBpvE,EAAEovE,MAAMD,KAAOnvE,EAAEmvE,KAEjBnvE,EAAEmvE,KAAO/tB,QACTphD,EAAEovE,MAAQhuB,QAAQguB,MAClBhuB,QAAQguB,MAAQpvE,EAChBA,EAAEovE,MAAMD,KAAOnvE,EAEfA,EAAEmhC,OAAS,KACXnhC,EAAI2vE,UACJD,kBACF,CAqBA,OAlBA3uC,KAAKouC,KAAKC,MAAQruC,KAAKquC,MACvBruC,KAAKquC,MAAMD,KAAOpuC,KAAKouC,KAIrB/tB,QAFErgB,OAASA,KAAKquC,MAEN,KAqJd,SAA0BhuB,QAASjrB,MAEjC,IAkBIrzB,EAlBA8sE,UAAY3vE,KAAK8D,MAAM9D,KAAKW,IAAIu1B,MAAQ44C,eAAiB,EAEzDlxD,MAAQ,IAAIlD,MAAMi1D,WAElBC,SAAW,EACX7vE,EAAIohD,QAER,GAAIphD,EAIF,IAHA6vE,WACA7vE,EAAIA,EAAEovE,MAECpvE,IAAMohD,SACXyuB,WACA7vE,EAAIA,EAAEovE,MAOV,KAAOS,SAAW,GAAG,CAMnB,IAJA,IAAI5tE,EAAIjC,EAAEq3D,OAENr8B,KAAOh7B,EAAEovE,MAIXtsE,EAAI+a,MAAM5b,IAFC,CASX,GAAIgzC,OAAOj1C,EAAEiW,IAAKnT,EAAEmT,KAAM,CACxB,IAAIxS,KAAOX,EACXA,EAAI9C,EACJA,EAAIyD,IACN,CAGAqsE,WAAWhtE,EAAG9C,GAGd6d,MAAM5b,GAAK,KACXA,GACF,CAGA4b,MAAM5b,GAAKjC,EAEXA,EAAIg7B,KACJ60C,UACF,CAGAzuB,QAAU,KAEV,IAAK,IAAI1/C,EAAI,EAAGA,EAAIkuE,UAAWluE,KAE7BoB,EAAI+a,MAAMnc,MAON0/C,SAEFt+C,EAAEqsE,KAAKC,MAAQtsE,EAAEssE,MACjBtsE,EAAEssE,MAAMD,KAAOrsE,EAAEqsE,KAEjBrsE,EAAEqsE,KAAO/tB,QACTt+C,EAAEssE,MAAQhuB,QAAQguB,MAClBhuB,QAAQguB,MAAQtsE,EAChBA,EAAEssE,MAAMD,KAAOrsE,EAEXkyC,QAAQlyC,EAAEmT,IAAKmrC,QAAQnrC,OACzBmrC,QAAUt+C,IAGZs+C,QAAUt+C,GAId,OAAOs+C,OACT,CAzOc2uB,CAFV3uB,QAAUrgB,KAAKquC,MAEqBtvE,KAAKgjC,OAI3ChjC,KAAKgjC,QAELhjC,KAAKmvE,SAAW7tB,QAETrgB,IACT,EAUAiuC,cAAcjtE,UAAUiuE,OAAS,SAAUjvC,MAEzCjhC,KAAKmvE,SAYP,SAAsB7tB,QAASrgB,KAAM9qB,KAEnC8qB,KAAK9qB,IAAMA,IAEX,IAAIkrB,OAASJ,KAAKI,OAEdA,QAAU6T,QAAQjU,KAAK9qB,IAAKkrB,OAAOlrB,OAErCi5D,KAAK9tB,QAASrgB,KAAMI,QAGpBkuC,cAAcjuB,QAASjgB,SAIrB6T,QAAQjU,KAAK9qB,IAAKmrC,QAAQnrC,OAC5BmrC,QAAUrgB,MAIZ,OAAOqgB,OACT,CAjCkB6uB,CAAanwE,KAAKmvE,SAAUluC,MAAO,GAEnDjhC,KAAK2vE,gBACP,EAgGA,IAAIK,WAAa,SAAoB/uC,KAAMI,QAEzCJ,KAAKouC,KAAKC,MAAQruC,KAAKquC,MACvBruC,KAAKquC,MAAMD,KAAOpuC,KAAKouC,KAEvBpuC,KAAKI,OAASA,OAETA,OAAOlI,OAKV8H,KAAKouC,KAAOhuC,OAAOlI,MACnB8H,KAAKquC,MAAQjuC,OAAOlI,MAAMm2C,MAC1BjuC,OAAOlI,MAAMm2C,MAAQruC,KACrBA,KAAKquC,MAAMD,KAAOpuC,OAPlBI,OAAOlI,MAAQ8H,KACfA,KAAKquC,MAAQruC,KACbA,KAAKouC,KAAOpuC,MASdI,OAAOk2B,SAEPt2B,KAAK4b,MAAO,CACd,EA6FA,OAAOqyB,aAAa,GACnB,CACD5xC,SAAS,KChYA8yC,eAAgC,gBAFhC,MACQ,CAAC,YAAa,cAAe,kBACuB15D,OACrE,IAAI,UACO,YACE,eAETA,KAMJ,SAAS25D,MACP,KAAMrwE,gBAAgBqwE,KACpB,MAAM,IAAI9vE,YAAY,oDAIxBP,KAAKinC,QAAU,GACfjnC,KAAKswE,MAAQ,IAAIpB,aACnB,CAgIA,OA1HAmB,IAAIpuE,UAAU8Z,KAAO,MACrBs0D,IAAIpuE,UAAUsuE,OAAQ,EAQtBF,IAAIpuE,UAAU2T,IAAM,SAAUhU,EAAGuS,GAE/B,GAAKnU,KAAKinC,QAAQrlC,GAQhB5B,KAAKinC,QAAQrlC,GAAGqa,MAAQ9H,MARJ,CAEpB,IAAI8sB,KAAOjhC,KAAKswE,MAAMb,OAAO7tE,EAAGuS,GAGhCnU,KAAKinC,QAAQrlC,GAAKq/B,IACpB,CAIF,EAEAovC,IAAIpuE,UAAUkkB,IAAM,SAAUvkB,GAC5B,IAAIq/B,KAAOjhC,KAAKinC,QAAQrlC,GAExB,OAAIq/B,KACKA,KAAKhlB,MAGP,CACT,EAEAo0D,IAAIpuE,UAAUuuE,WAAa,SAAU5uE,EAAGuS,GAEtC,IAAI8sB,KAAOjhC,KAAKinC,QAAQrlC,GAEnBq/B,KAOHA,KAAKhlB,MAAQkmC,UAAUlhB,KAAKhlB,MAAO9H,IALnC8sB,KAAOjhC,KAAKswE,MAAMb,OAAO7tE,EAAGuS,GAE5BnU,KAAKinC,QAAQrlC,GAAKq/B,KAKtB,EAEAovC,IAAIpuE,UAAUqV,QAAU,SAAUmF,KAAME,GAAIhD,UAE1C,IAAI82D,KAAOzwE,KAAKswE,MACZl7C,OAASp1B,KAAKinC,QAEdzF,MAAQ,GAERP,KAAOwvC,KAAKd,iBAOhB,IALI1uC,MACFO,MAAM1zB,KAAKmzB,MAINA,MAAQA,KAAK9qB,KAAOwG,IAErBskB,KAAK9qB,KAAOsG,OAET8qB,YAAYtG,KAAKhlB,MAAO,IAE3BtC,SAASsnB,KAAK9qB,IAAK8qB,KAAKhlB,MAAOjc,QAKnCihC,KAAOwvC,KAAKd,mBAGVnuC,MAAM1zB,KAAKmzB,MAKf,IAAK,IAAIr/B,EAAI,EAAGA,EAAI4/B,MAAMjgC,OAAQK,IAAK,CAErC,IAAImI,EAAIy3B,MAAM5/B,GAIdwzB,QAFA6L,KAAOwvC,KAAKhB,OAAO1lE,EAAEoM,IAAKpM,EAAEkS,QAEhB9F,KAAO8qB,IACrB,CACF,EAEAovC,IAAIpuE,UAAUyuE,KAAO,SAAU9uE,EAAG4F,GAEhC,IAAImpE,MAAQ3wE,KAAKinC,QAAQrlC,GACrBgvE,MAAQ5wE,KAAKinC,QAAQz/B,GAEzB,IAAKmpE,OAASC,MAEZD,MAAQ3wE,KAAKswE,MAAMb,OAAO7tE,EAAGgvE,MAAM30D,OAEnCjc,KAAKswE,MAAMJ,OAAOU,OAGlB5wE,KAAKinC,QAAQrlC,GAAK+uE,MAClB3wE,KAAKinC,QAAQz/B,QAAKrG,OACb,GAAIwvE,QAAUC,MAEnBA,MAAQ5wE,KAAKswE,MAAMb,OAAOjoE,EAAGmpE,MAAM10D,OAEnCjc,KAAKswE,MAAMJ,OAAOS,OAGlB3wE,KAAKinC,QAAQz/B,GAAKopE,MAClB5wE,KAAKinC,QAAQrlC,QAAKT,OACb,GAAIwvE,OAASC,MAAO,CAEzB,IAAIz8D,EAAIw8D,MAAM10D,MACd00D,MAAM10D,MAAQ20D,MAAM30D,MACpB20D,MAAM30D,MAAQ9H,CAChB,CACF,EAEOk8D,GAAG,GACT,CACD/yC,SAAS,IChJAuzC,gBAAkB,CAC3BhC,0BACAj1B,sBACA/S,wBACAupC,gBCRSU,UAA2B,gBAF3B,MACQ,CAAC,QAAS,SAAU,MAAO,YAAa,eAAgB,iBAAkB,WAAY,SAAU,cAAe,aAAc,cAAe,eAAgB,QAC7Gp6D,OAChE,IAAI,MACG,OACC,IACH,UACM,aACG,eACE,SACN,OACF,YACK,WACD,YACC,aACC,KAEVA,KA4BJ,OAAO0E,MA7CE,MA6CU,CACjB0nB,YAAa,SAAqBh5B,GAChC,OAAOinE,UAAUjnE,EACnB,EACAk9B,aAAc,SAAsBl9B,GAClC,OAAOknE,WAAWlnE,EACpB,EACA+Q,MAAO,SAAepa,GAEpB,IAEIgC,EAAIsuE,UAFA3yC,OAAO39B,IAKf,MAAO,CACLgzD,EAAGhxD,EAAEgxD,EAAE9iD,UACPsgE,EAAGxuE,EAAEwuE,EAAEtgE,UACPgD,EAAGlR,EAAEkR,EAET,IAGF,SAASo9D,UAAUjnE,GAEjB,IAaIlI,EAAG4F,EAAGlB,EAbNk+B,KAAO16B,EAAEk5B,MAAM,GACf0B,QAAU56B,EAAEk5B,MAAM,GAElBj5B,EAAI5J,KAAK0G,IAAI29B,KAAME,SAEnBvqB,KAAOlF,MAAMnL,EAAEi5B,OAEfmuC,MAAQ,GACRC,MAAQ,CAAC3sC,KAAMz6B,GAEfqnE,MAAQ,GACRC,MAAQ,CAACtnE,EAAG26B,SAIZ/wB,EAAI,GAER,IAAK/R,EAAI,EAAGA,EAAI4iC,KAAM5iC,IACpB+R,EAAE/R,GAAKA,EAIT,IAAK4F,EAAI,EAAGA,EAAIk9B,QAASl9B,IAAK,CAE5B,GAAIA,EAAI,EAEN,IAAK5F,EAAI,EAAGA,EAAI4iC,KAAM5iC,IAAK,CAEzB,IAAIiF,IAAM1G,KAAK0G,IAAIjF,EAAG4F,GAElBS,EAAI,EAER,IAAK3B,EAAI,EAAGA,EAAIO,IAAKP,IAEnB2B,EAAIk6C,UAAUl6C,EAAGm6C,eAAejoC,KAAKvY,GAAG0E,GAAI6T,KAAK7T,GAAGkB,KAGtD2S,KAAKvY,GAAG4F,GAAKyJ,SAASkJ,KAAKvY,GAAG4F,GAAIS,EACpC,CAIF,IAAI+L,GAAKxM,EACL8pE,MAAQ,EACRC,IAAM,EAEV,IAAK3vE,EAAI4F,EAAG5F,EAAI4iC,KAAM5iC,IAAK,CAEzB,IAAIuS,EAAIgG,KAAKvY,GAAG4F,GAEZgqE,KAAO5wE,IAAIuT,GAEXghC,OAAOq8B,KAAMF,SAEft9D,GAAKpS,EAEL0vE,MAAQE,KAERD,IAAMp9D,EAEV,CAWA,GARI3M,IAAMwM,KAERL,EAAEnM,GAAK,CAACmM,EAAEK,IAAKL,EAAEK,IAAML,EAAEnM,IAAI,GAE7Bs7B,YAAYsC,UAAU59B,EAAGwM,GAAImG,OAI3B3S,EAAIg9B,KAEN,IAAK5iC,EAAI4F,EAAI,EAAG5F,EAAI4iC,KAAM5iC,IAAK,CAE7B,IAAI6vE,IAAMt3D,KAAKvY,GAAG4F,GAEb+/B,YAAYkqC,IAAK,KAEpBt3D,KAAKvY,GAAG4F,GAAKgjD,aAAarwC,KAAKvY,GAAG4F,GAAI+pE,KAE1C,CAEJ,CAGA,IAAK/pE,EAAI,EAAGA,EAAIk9B,QAASl9B,IAEvB,IAAK5F,EAAI,EAAGA,EAAI4iC,KAAM5iC,IAEV,IAAN4F,IAEE5F,EAAI8iC,UAEN0sC,MAAMxvE,GAAK,IAIbsvE,MAAMtvE,GAAK,IAITA,EAAI4F,GAEF5F,EAAI8iC,UAEN0sC,MAAMxvE,GAAG4F,GAAK2S,KAAKvY,GAAG4F,IAIpBA,EAAIg9B,OAEN0sC,MAAMtvE,GAAG4F,GAAK,IAOd5F,IAAM4F,GAiBN5F,EAAI8iC,UAEN0sC,MAAMxvE,GAAG4F,GAAK,GAIZA,EAAIg9B,OAEN0sC,MAAMtvE,GAAG4F,GAAK2S,KAAKvY,GAAG4F,MAvBlB5F,EAAI8iC,UAEN0sC,MAAMxvE,GAAG4F,GAAK2S,KAAKvY,GAAG4F,IAIpBA,EAAIg9B,OAEN0sC,MAAMtvE,GAAG4F,GAAK,IAqBtB,IAAIksD,EAAI,IAAI5wB,YAAY,CACtB3oB,KAAM+2D,MACN76C,KAAM86C,QAGJp9D,EAAI,IAAI+uB,YAAY,CACtB3oB,KAAMi3D,MACN/6C,KAAMg7C,QAGJvpC,GAAK,GAET,IAAKlmC,EAAI,EAAGmI,EAAI4J,EAAEpS,OAAQK,EAAImI,EAAGnI,IAC/BkmC,GAAGn0B,EAAE/R,IAAMA,EAIb,MAAO,CACL6xD,EAAGC,EACHud,EAAGl9D,EACHJ,EAAGm0B,GACHx+B,SAAU,WACR,MAAO,MAAQtJ,KAAKyzD,EAAEnqD,WAAa,QAAUtJ,KAAKixE,EAAE3nE,WAAa,QAAUtJ,KAAK2T,CAClF,EAEJ,CAEA,SAASq9D,WAAWlnE,GAElB,IAmBIlI,EAAG4F,EAAGlB,EAnBNk+B,KAAO16B,EAAEk5B,MAAM,GACf0B,QAAU56B,EAAEk5B,MAAM,GAElBj5B,EAAI5J,KAAK0G,IAAI29B,KAAME,SAEnBtP,OAAStrB,EAAEm9B,QACX1vB,MAAQzN,EAAEo9B,OACVI,IAAMx9B,EAAEq9B,KAERuqC,QAAU,GACVC,OAAS,GACTC,KAAO,GACPT,MAAQ,CAAC3sC,KAAMz6B,GAEf8nE,QAAU,GACVC,OAAS,GACTC,KAAO,GACPV,MAAQ,CAACtnE,EAAG26B,SAIZstC,KAAO,GACPC,KAAO,GAEX,IAAKrwE,EAAI,EAAGA,EAAI4iC,KAAM5iC,IACpBowE,KAAKpwE,GAAKA,EACVqwE,KAAKrwE,GAAKA,EAIZ,IAaIwV,MAAQ,WAEV,IAAI86D,IAAM,IAAI7B,IAEV7oE,EAAIg9B,OAENotC,KAAK9jE,KAAK4jE,QAAQnwE,QAElBmwE,QAAQ5jE,KAAK,GACb6jE,OAAO7jE,KAAKtG,IAIduqE,KAAKjkE,KAAK+jE,QAAQtwE,QAElB,IAAIonC,GAAKrB,IAAI9/B,GACTohC,GAAKtB,IAAI9/B,EAAI,GAEjB,IAAKlB,EAAIqiC,GAAIriC,EAAIsiC,GAAItiC,IAEnB1E,EAAI2V,MAAMjR,GAEV4rE,IAAIt8D,IAAIo8D,KAAKpwE,GAAIwzB,OAAO9uB,IAItBkB,EAAI,GAEN0qE,IAAI56D,QAAQ,EAAG9P,EAAI,GAAG,SAAUlB,EAAG6rE,KAEjCnrC,aAAaoD,YAAY9jC,EAAGorE,QAASC,OAAQC,MAAM,SAAUhwE,EAAGwwE,KAE1DxwE,EAAI0E,GAEN4rE,IAAI1B,WAAW5uE,EAAG2yC,WAAW6N,eAAegwB,IAAKD,MAErD,GACF,IAIF,IAtDqCjyE,EAAG8C,EAEpCqnC,GACAC,GAmDAt2B,GAAKxM,EACL+pE,IAAMW,IAAI/rD,IAAI3e,GACd8pE,MAAQ1wE,IAAI2wE,KAEhBW,IAAI56D,QAAQ9P,EAAI,EAAGg9B,KAAO,GAAG,SAAUtkC,EAAGiU,GAExC,IAAIq9D,KAAO5wE,IAAIuT,GAEXghC,OAAOq8B,KAAMF,SAEft9D,GAAK9T,EAELoxE,MAAQE,KAERD,IAAMp9D,EAEV,IAEI3M,IAAMwM,KAERgzB,aAAa5B,UAAU59B,EAAGwM,GAAIm9D,MAAM,GAAIO,QAASC,OAAQC,MAGzD5qC,aAAa5B,UAAU59B,EAAGwM,GAAIq9D,MAAM,GAAIQ,QAASC,OAAQC,MAGzDG,IAAIxB,KAAKlpE,EAAGwM,IAhF0BhR,EAkFvBgR,GAhFbq2B,GAAK4nC,KAF4B/xE,EAkFvBsH,GA/EV8iC,GAAK2nC,KAAKjvE,GAEdgvE,KAAK3nC,IAAMrnC,EACXgvE,KAAK1nC,IAAMpqC,EAEX+xE,KAAK/xE,GAAKoqC,GACV2nC,KAAKjvE,GAAKqnC,IA6EV6nC,IAAI56D,QAAQ,EAAGktB,KAAO,GAAG,SAAUtkC,EAAGiU,GAEhCjU,GAAKsH,GAEPqqE,QAAQ/jE,KAAKqG,GACb29D,OAAOhkE,KAAK5N,KAGZiU,EAAIq2C,aAAar2C,EAAGo9D,KAEfhqC,YAAYpzB,EAAG,KAElBu9D,QAAQ5jE,KAAKqG,GACbw9D,OAAO7jE,KAAK5N,IAGlB,GACF,EAEA,IAAKsH,EAAI,EAAGA,EAAIk9B,QAASl9B,IACvB4P,QAOF,OAHA26D,KAAKjkE,KAAK+jE,QAAQtwE,QAClBqwE,KAAK9jE,KAAK4jE,QAAQnwE,QAEX,CACLkyD,EAAG,IAAIzsB,aAAa,CAClB5R,OAAQs8C,QACRn6D,MAAOo6D,OACPrqC,IAAKsqC,KACLv7C,KAAM86C,QAERF,EAAG,IAAIjqC,aAAa,CAClB5R,OAAQy8C,QACRt6D,MAAOu6D,OACPxqC,IAAKyqC,KACL17C,KAAMg7C,QAER19D,EAAGq+D,KACH1oE,SAAU,WACR,MAAO,MAAQtJ,KAAKyzD,EAAEnqD,WAAa,QAAUtJ,KAAKixE,EAAE3nE,WAAa,QAAUtJ,KAAK2T,CAClF,EAEJ,KChZS0+D,mBAAqB,CAC9B12B,yBACA9U,wBACAyrC,gBCA2B,CAC3B74B,gBACAG,sBACA24B,gBCN2B,CAC3BC,gBCM2B,CAC3BltC,wBACAurC,gBACApmC,yBACAgP,gBACAG,sBACA+B,yBACA9U,wBACA8nC,mBACA9jC,mBACAkW,2BACAuF,qBACAhgB,kBACAuf,uBACAirB,WDnBAjmC,mBACAsa,qBACAmB,qBACAhgB,kBACAuf,uBACA4sB,UEZoC,gBAF3B,MACQ,CAAC,QAAS,SAAU,WAAY,WAAY,aAAc,QACX/7D,OAChE,IAAI,MACG,OACC,SACE,SACA,WACE,KAERA,KA2BJ,OAAO0E,MArCE,MAqCU,CACjBwlC,IAAK,SAAa1gD,GAChB,OAAO+U,MAAM/U,EACf,EACA,iBAAkB,SAAaA,GAC7B,IAAIm2B,KAYJ,QATEA,KADE,YAASn2B,GACJA,EAAEm2B,OACAxb,MAAMC,QAAQ5a,IACvBA,EAAIk+B,OAAOl+B,IACFm2B,OAGF,IAGI90B,QACX,KAAK,EAEH,OAAO0T,MAAM/U,GAEf,KAAK,EAEH,GAAgB,IAAZm2B,KAAK,GACP,OAAOphB,MAAM/U,EAAEyQ,UAAU,IAEzB,MAAM,IAAIotB,WAAW,gCAAuC,cAAO1H,MAAQ,KAG/E,KAAK,EAGD,IAAImO,KAAOnO,KAAK,GACZ8qB,KAAO9qB,KAAK,GAEhB,GAAImO,OAAS2c,KACX,OAqBZ,SAAc/iB,OAAQoG,KAAM2c,MAC1B,GAAa,IAAT3c,KAEF,OAAOvvB,MAAMmpB,OAAO,GAAG,IAClB,GAAa,IAAToG,KAGT,OAAOvzB,SAASyjC,SAAStW,OAAO,GAAG,GAAIA,OAAO,GAAG,IAAKsW,SAAStW,OAAO,GAAG,GAAIA,OAAO,GAAG,KAOvF,IAJA,IAAIs0C,OAASC,IAAIv0C,QAEboY,IAAMk8B,OAAOzB,EAAE,GAAG,GAEb9nC,GAAK,EAAGA,GAAK3E,KAAM2E,KAC1BqN,IAAM9B,SAAS8B,IAAKk8B,OAAOzB,EAAE9nC,IAAIA,KASnC,IAJA,IAAIypC,WAAa,EACbhxE,EAAI,EACJixE,QAAU,KAED,CACX,KAAOA,QAAQjxE,IACbA,IAGF,GAAIA,GAAK4iC,KAAM,MAIf,IAHA,IAAIh9B,EAAI5F,EACJwX,SAAW,GAEPy5D,QAAQH,OAAO/+D,EAAEnM,KACvBqrE,QAAQH,OAAO/+D,EAAEnM,KAAM,EACvBA,EAAIkrE,OAAO/+D,EAAEnM,GACb4R,WAGEA,SAAW,GAAM,GACnBw5D,YAEJ,CAEA,OAAOA,WAAa,GAAM,EAAIp8B,IAAMjC,WAAWiC,IAEnD,CAnEmBs8B,CAAK5yE,EAAE+U,QAAQtE,UAAW6zB,MAEjC,MAAM,IAAIzG,WAAW,gCAAuC,cAAO1H,MAAQ,KAIjF,QAEE,MAAM,IAAI0H,WAAW,yCAAgD,cAAO1H,MAAQ,KAE1F,GAyDF,KH/HAslB,yBACA4F,qBACA1W,mBACAsa,qBACA7e,kBACAuf,uBACAktB,UIlBoC,gBAF3B,MACQ,CAAC,QAAS,SAAU,eAAgB,YAAa,WAAY,aAAc,MAAO,WAAY,QAC/Cr8D,OAChE,IAAI,MACG,OACC,aACM,UACH,SACD,WACE,IACP,SACK,KAENA,KAsBJ,OAAO0E,MAnCE,MAmCU,CACjB,iBAAkB,SAAqBlb,GACrC,IAAIm2B,KAAO,YAASn2B,GAAKA,EAAEm2B,OAAS,gBAAUn2B,GAE9C,OAAQm2B,KAAK90B,QACX,KAAK,EAEH,GAAgB,IAAZ80B,KAAK,GACP,OAAI,YAASn2B,GACJk+B,OAAO,CAACosB,aAAa,EAAGtqD,EAAEyQ,UAAU,MAEpC,CAAC65C,aAAa,EAAGtqD,EAAE,KAG5B,MAAM,IAAI69B,WAAW,gCAAuC,cAAO1H,MAAQ,KAG/E,KAAK,EAGD,IAAImO,KAAOnO,KAAK,GACZ8qB,KAAO9qB,KAAK,GAEhB,GAAImO,OAAS2c,KACX,OAAI,YAASjhD,GACJk+B,OAAO40C,KAAK9yE,EAAEyQ,UAAW6zB,KAAM2c,MAAOjhD,EAAEqiC,WAGxCywC,KAAK9yE,EAAGskC,KAAM2c,MAGvB,MAAM,IAAIpjB,WAAW,gCAAuC,cAAO1H,MAAQ,KAIjF,QAEE,MAAM,IAAI0H,WAAW,yCAAgD,cAAO1H,MAAQ,KAE1F,EACAuqB,IAAK,SAAa1gD,GAEhB,OAAOsqD,aAAa,EAAGtqD,EACzB,IAWF,SAAS8yE,KAAKC,IAAKzuC,KAAM2c,MACvB,IAAI1+C,EAAGwF,EAAGu+B,EAAGvqB,MAAOtY,KAEpB,GAAa,IAAT6gC,KAAY,CAId,GAAc,KAFdvoB,MAAQg3D,IAAI,GAAG,IAGb,MAAMlsE,MAAM,iDAGd,MAAO,CAAC,CAACyjD,aAAa,EAAGvuC,QAC3B,CAAO,GAAa,IAATuoB,KAAY,CAErB,IAAIriC,EAAIq0C,IAAIy8B,KAEZ,GAAU,IAAN9wE,EACF,MAAM4E,MAAM,iDAGd,MAAO,CAAC,CAACyjD,aAAayoB,IAAI,GAAG,GAAI9wE,GAAIqoD,aAAajW,WAAW0+B,IAAI,GAAG,IAAK9wE,IAAK,CAACqoD,aAAajW,WAAW0+B,IAAI,GAAG,IAAK9wE,GAAIqoD,aAAayoB,IAAI,GAAG,GAAI9wE,IACjJ,CAOE,IAAIoW,EAAI06D,IAAIp1D,SAEZ,IAAKpb,EAAI,EAAGA,EAAI+hC,KAAM/hC,IACpB8V,EAAE9V,GAAK8V,EAAE9V,GAAGob,SAOd,IAFA,IAAIrF,EAAImtC,SAASnhB,MAAM7zB,UAEd9O,EAAI,EAAGA,EAAIs/C,KAAMt/C,IAAK,CAE7B,IAAIqxE,KAAOtyE,IAAI2X,EAAE1W,GAAGA,IAChBsxE,KAAOtxE,EAGX,IAFAY,EAAIZ,EAAI,EAEDY,EAAI+hC,MACL5jC,IAAI2X,EAAE9V,GAAGZ,IAAMqxE,OACjBA,KAAOtyE,IAAI2X,EAAE9V,GAAGZ,IAChBsxE,KAAO1wE,GAGTA,IAGF,GAAa,IAATywE,KACF,MAAMnsE,MAAM,kDAGdtE,EAAI0wE,QAEMtxE,IACR8B,KAAO4U,EAAE1W,GACT0W,EAAE1W,GAAK0W,EAAE9V,GACT8V,EAAE9V,GAAKkB,KACPA,KAAO6U,EAAE3W,GACT2W,EAAE3W,GAAK2W,EAAE/V,GACT+V,EAAE/V,GAAKkB,MAIT,IAAIyvE,GAAK76D,EAAE1W,GACPwxE,GAAK76D,EAAE3W,GAEX,IAAKY,EAAI,EAAGA,EAAI+hC,KAAM/hC,IAAK,CACzB,IAAI6wE,GAAK/6D,EAAE9V,GACP8wE,GAAK/6D,EAAE/V,GAEX,GAAIA,IAAMZ,GAER,GAAc,IAAVyxE,GAAGzxE,GAAU,CAIf,IAHA2kC,EAAIgkB,aAAajW,WAAW++B,GAAGzxE,IAAKuxE,GAAGvxE,IAGlCoG,EAAIpG,EAAGoG,EAAIk5C,KAAMl5C,IACpBqrE,GAAGrrE,GAAKk6C,UAAUmxB,GAAGrrE,GAAIysC,SAASlO,EAAG4sC,GAAGnrE,KAG1C,IAAKA,EAAI,EAAGA,EAAIk5C,KAAMl5C,IACpBsrE,GAAGtrE,GAAKk6C,UAAUoxB,GAAGtrE,GAAIysC,SAASlO,EAAG6sC,GAAGprE,IAE5C,MACK,CAKL,IAFAu+B,EAAI4sC,GAAGvxE,GAEFoG,EAAIpG,EAAGoG,EAAIk5C,KAAMl5C,IACpBqrE,GAAGrrE,GAAKuiD,aAAa8oB,GAAGrrE,GAAIu+B,GAG9B,IAAKv+B,EAAI,EAAGA,EAAIk5C,KAAMl5C,IACpBsrE,GAAGtrE,GAAKuiD,aAAa+oB,GAAGtrE,GAAIu+B,EAEhC,CACF,CACF,CAEA,OAAOhuB,CAEX,ML1LAqyB,mBACAsa,qBACA7e,kBACAktC,aMZuC,gBAF9B,SACQ,CAAC,QAAS,SAAU,WAAY,cAAe,eAAgB,QACb98D,OACnE,IAAI,MACG,OACC,SACE,YACG,aACC,KAEVA,KACAqpC,YAAcf,kBAAkB,CAClC5jC,MACAmsB,cAEEiX,YAAcN,kBAAkB,CAClC9iC,QAkCF,OAAOA,MAAM,SAAUkZ,OAAO,CAE5B,iCAAkC,SAAgCp0B,EAAG8C,GAKnE,OAAO0xC,SAASx0C,EAAGw2C,IAAI1zC,GACzB,EACA,mBAAoB,SAAwB9C,EAAG8C,GAC7C,OAAOw7C,YAAYt+C,EAAG8C,EAAGwnD,cAAc,EACzC,EACA,oBAAqB,SAAyBtqD,EAAG8C,GAC/C,OAAO+8C,YAAY7/C,EAAG8C,EAAGwnD,cAAc,EACzC,EACA,aAAc,SAAkBtqD,EAAG8C,GAEjC,OAAOw7C,YAAYpgB,OAAOl+B,GAAI8C,EAAGwnD,cAAc,GAAO75C,SACxD,EACA,sBAAuB,SAAwBzQ,EAAG8C,GAChD,OAAO0xC,SAASx0C,EAAGw2C,IAAI1zC,GACzB,GACCwnD,aAAapuC,YAAY,KCxEnBq3D,kBAAmC,gBAFnC,cACQ,CAAC,QAAS,gBAC6C/8D,OACxE,IAAI,MACG,aAEHA,KAqBJ,OAAO,SAAqBqlC,YAAaC,aAAcriC,SAAUsiC,SAE/D,IAAIC,MAAQH,YAAYhZ,MACpBoZ,MAAQJ,YAAY/Y,MACpBoZ,IAAML,YAAY9Y,UAElBoZ,QAAUL,aAAa/U,QACvBqV,OAASN,aAAa9U,OACtBqV,KAAOP,aAAa7U,KACpBqV,MAAQR,aAAahZ,MACrByZ,IAAMT,aAAa/Y,UAEvB,GAAIkZ,MAAM56C,SAAWi7C,MAAMj7C,OACzB,MAAM,IAAIu3B,eAAeqjB,MAAM56C,OAAQi7C,MAAMj7C,QAI/C,GAAI46C,MAAM,KAAOK,MAAM,IAAML,MAAM,KAAOK,MAAM,GAC9C,MAAM,IAAIze,WAAW,iCAAmCoe,MAAQ,0BAA4BK,MAAQ,KAItG,IAAKH,QACH,MAAM,IAAIt1C,MAAM,sEAIlB,IAGI21C,GAHAlY,KAAO2X,MAAM,GACbzX,QAAUyX,MAAM,GAIhB7xC,GAAKi9B,YAELC,KAAO,EAEPmV,GAAKhjC,SAEU,iBAARyiC,KAAoBA,MAAQK,MAErCC,GAAKN,IAEL9xC,GAAK8Q,MAAMc,KAAKqrB,YAAa,CAACmV,GAAIA,KAElClV,KAAOpsB,MAAMoB,QAAQ,EAAGkgC,IAExBC,GAAKvhC,MAAMc,KAAKvC,SAAU,CAAC+iC,GAAIA,MAQjC,IAJA,IAAIuC,QAAU,GACVC,OAAS,GACTC,KAAO,GAEF33C,EAAI,EAAGA,EAAIk9B,QAASl9B,IAAK,CAEhC23C,KAAK33C,GAAK03C,OAAO39C,OAEjB,IAAK,IAAIonC,GAAK4T,KAAK/0C,GAAIohC,GAAK2T,KAAK/0C,EAAI,GAAIlB,EAAIqiC,GAAIriC,EAAIsiC,GAAItiC,IAAK,CAE5D,IAAI1E,EAAI06C,OAAOh2C,GAEXq+C,IAAM1I,QAAUU,GAAGN,QAAQ/1C,GAAI41C,MAAMt6C,GAAG4F,IAAMm1C,GAAGT,MAAMt6C,GAAG4F,GAAI60C,QAAQ/1C,IAErEgE,GAAGq6C,IAAKnd,QAEX0X,OAAOpxC,KAAKlM,GACZq9C,QAAQnxC,KAAK62C,KAEjB,CACF,CAKA,OAFAxF,KAAKza,SAAWwa,OAAO39C,OAEhBy6C,aAAalT,mBAAmB,CACrC1T,OAAQ6pB,QACR1nC,MAAO2nC,OACP5X,IAAK6X,KACL9oB,KAAM,CAACmO,KAAME,SACblC,SAAUka,IAEd,CAAC,ICtGQg3B,gBAAkB,CAC3BpuC,wBACAuB,wBACAgE,mBACAvE,kBACAqtC,UCHoC,gBAF3B,MACQ,CAAC,QAAS,SAAU,cAAe,gBACYj9D,OAChE,IAAI,MACG,OACC,YACK,aAETA,KACAk9D,YAAcH,kBAAkB,CAClCr4D,MACAmsB,cAEE6W,YAActC,kBAAkB,CAClC1gC,QAEEqrC,YAAcT,kBAAkB,CAClC5qC,MACAmsB,cAEEwY,YAAcf,kBAAkB,CAClC5jC,MACAmsB,cAEE+W,YAAchB,kBAAkB,CAClCliC,MACA0nB,cAEEyb,YAAcb,kBAAkB,CAClCtiC,QAEEojC,YAAcN,kBAAkB,CAClC9iC,QAsCF,OAAOA,MAtEE,MAsEU,CACjB,iBAAkBk+B,UAClB,uBAAwB,SAA4Bp5C,EAAG8C,GACrD,GAAIA,EAAE8I,QACJ,MAAM,IAAI/E,MAAM,+CAGlB,OAAO/D,EAAEoG,SAAWlJ,EAAIA,EAAEgO,IAAIlL,EAChC,EACA,qBAAsB,SAA0B9C,EAAG8C,GACjD,GAAIA,EAAE8N,QAAQ,GAAK,EACjB,MAAM,IAAI/J,MAAM,+CAIlB,OAAO7G,EAAE4Q,QAAQ,IAAM,EAAI5Q,EAAEgO,IAAIlL,GAAK9C,EAAEgO,IAAIlL,GAAGsL,IAAItL,GAAGkL,IAAIlL,EAC5D,EACA,6BAA8B,SAAkC9C,EAAG8C,GACjE,OAAOyjD,YAAYvmD,EAAG8C,EAAGhD,MAAM,EACjC,EACA,4BAA6B,SAAiCE,EAAG8C,GAC/D,OAAO4wE,YAAY5wE,EAAG9C,EAAGF,MAAM,EACjC,EACA,4BAA6B,SAAiCE,EAAG8C,GAC/D,OAAOo7C,YAAYl+C,EAAG8C,EAAGhD,MAAM,EACjC,EACA,2BAA4B,SAAgCE,EAAG8C,GAC7D,OAAOu7C,YAAYr+C,EAAG8C,EAAGhD,KAC3B,EACA,eAAgB,SAAoBE,EAAG8C,GAErC,OAAOhD,KAAKo+B,OAAOl+B,GAAIk+B,OAAOp7B,IAAI2N,SACpC,EACA,gBAAiB,SAAqBzQ,EAAG8C,GAEvC,OAAOhD,KAAKo+B,OAAOl+B,GAAI8C,EACzB,EACA,gBAAiB,SAAqB9C,EAAG8C,GAEvC,OAAOhD,KAAKE,EAAGk+B,OAAOp7B,GACxB,EACA,oBAAqB,SAAyB9C,EAAG8C,GAC/C,OAAO+8C,YAAY7/C,EAAG8C,EAAGhD,MAAM,EACjC,EACA,mBAAoB,SAAwBE,EAAG8C,GAC7C,OAAOw7C,YAAYt+C,EAAG8C,EAAGhD,MAAM,EACjC,EACA,oBAAqB,SAAyBE,EAAG8C,GAC/C,OAAOs7C,YAAYt7C,EAAG9C,EAAGF,MAAM,EACjC,EACA,mBAAoB,SAAwBE,EAAG8C,GAC7C,OAAOw7C,YAAYx7C,EAAG9C,EAAGF,MAAM,EACjC,EACA,aAAc,SAAkBE,EAAG8C,GAEjC,OAAOw7C,YAAYpgB,OAAOl+B,GAAI8C,EAAGhD,MAAM,GAAO2Q,SAChD,EACA,aAAc,SAAkBzQ,EAAG8C,GAEjC,OAAOw7C,YAAYpgB,OAAOp7B,GAAI9C,EAAGF,MAAM,GAAM2Q,SAC/C,GACA,KCpIJ,MAAM,UC4CC,SAAS,cAAOkjE,UAAW5/D,QAChC,IAAI6/D,eAAiBh+D,SAAS,CAAC,EAAGqoB,eAAgBlqB,QAGlD,GAA6B,mBAAlB8B,OAAO4E,OAChB,MAAM,IAAI5T,MAAM,iHAIlB,ICtDoBmN,IAEhB6/D,QDoDAp4C,MCtDgBznB,IDsDK,CAEvB8d,SACAE,UACAD,YACAG,WACAC,OACA2hD,SAAQ,YACRl5D,QACAwX,SAAQ,YACR2hD,aAAY,gBACZ1hD,cACAC,eACAC,QACAC,QACAC,UACAC,YACAC,OACAC,WACAC,OACAC,SACAC,SACAC,OACAC,YACAC,eACAE,YACAC,iBACAC,YACAC,kBACAC,eACAC,yBACAC,eACAC,YACAR,OACAS,aACAC,eACAC,kBACAC,YACAC,aACAC,SC3FE4/C,QAAU,IAAI,aAElB7/D,IAAIwF,GAAKq6D,QAAQr6D,GAAGsyB,KAAK+nC,SACzB7/D,IAAI+F,IAAM85D,QAAQ95D,IAAI+xB,KAAK+nC,SAC3B7/D,IAAI4F,KAAOi6D,QAAQj6D,KAAKkyB,KAAK+nC,SAC7B7/D,IAAIgG,KAAO65D,QAAQ75D,KAAK8xB,KAAK+nC,SACtB7/D,KDwFPynB,KAAK1nB,OAASyqB,cAAco1C,eAAgBn4C,KAAKzhB,MACjDyhB,KAAKW,WAAa,CAChBN,UAAW,CAAC,EACZQ,kBAAmB,CACjBvoB,OAAQ0nB,KAAK1nB,SAqDjB,IAAI2nB,kBAAoB,CAAC,EAUrBs4C,eAAiBz4C,eARrB,WACE,IAAK,IAAIsE,KAAOrrB,UAAUnT,OAAQoR,KAAO,IAAIkI,MAAMklB,MAAOE,KAAO,EAAGA,KAAOF,KAAME,OAC/EttB,KAAKstB,MAAQvrB,UAAUurB,MAGzB,OAAOtE,KAAKvgB,MAAMzD,MAAMgkB,KAAKvgB,MAAOzI,KACtC,GA/CA,EAiDoDgpB,KAAMC,mBA0B1D,OAzBAD,KAAKw4C,OAASD,eAGdv4C,KAAKjiB,GAAG,UAAU,KAChB0b,OAAOwG,mBAAmBtkB,SAAQ3X,UAC5BA,SAAWA,QAAQ21B,MAAQ31B,QAAQ21B,KAAK8+C,wBAG1CF,eAAev0E,QAAS,CACtBw8B,UAAU,GAEd,GACA,IAIJR,KAAKhhB,OAAS,cAAOqxB,KAAK,KAAM6nC,WAEhCl4C,KAAKh8B,QAAU,gBAGfg8B,KAAKw4C,OAAO/+C,OAAOV,YAAYm/C,aAC/Bl4C,KAAKJ,eAAiBA,eACtBI,KAAK7C,eAAiBA,eACtB6C,KAAK04C,WAAa,sBACX14C,IACT,CD7LqB,CAAO,CACxByyC,qBACAI,gBACA6D,mBACAltB,qBACAuuB,kBAKSxvE,MAAQ,CAACowE,IAAaxvE,UAAY,KAC3C,MAAMyvE,QAAUp0E,KAAKiC,IAAI,GAAI0C,WAC7B,OAAO3E,KAAK+D,MAAMowE,IAAMC,SAAWA,OAAO,EAGjCC,mBAAqB,CAACv4D,MAAew4D,eAAiB,KAC/D,MAAMh6B,MARW,CAACA,OAAkBA,MAAMrnC,QAAQ,mBAAoB,IAAIA,QAAQ,MAAO,KAQ3EshE,CAAaz4D,OAE3B,OAAqB,IAAjBw+B,MAAMl5C,QAA0B,OAAVk5C,MAAuB,KAC1Cv2C,MAAMo8B,SAASma,OAAQg6B,eAAe,EGzB1C,SAASE,sBAAyBC,SAAmC5yE,OAAQ,GAChF,OAAO,OAAP,wBACO4yE,UAAQ,CACXC,WACID,SAASE,SAAWF,SAASz6D,KACvBnY,MACK26B,KAAK36B,MAAM4yE,SAASz6D,MACpBy6D,SAASz6D,KACd,MAElB,CC2GA,IAAY46D,oBAMAC,cAMAC,cAMAC,cAMAC,cAOAC,UAmBAC,QAKAC,oBAvDZ,SAAYP,qBACR,8BACA,wCACA,6CACH,CAJD,CAAYA,sBAAAA,oBAAmB,KAM/B,SAAYC,eACR,0BACA,4BACA,2BACH,CAJD,CAAYA,gBAAAA,cAAa,KAMzB,SAAYC,eACR,wCACA,wCACA,yBACH,CAJD,CAAYA,gBAAAA,cAAa,KAMzB,SAAYC,eACR,sCACA,kCACA,6BACH,CAJD,CAAYA,gBAAAA,cAAa,KAMzB,SAAYC,eACR,wBACA,8BACA,8BACA,+BACH,CALD,CAAYA,gBAAAA,cAAa,KAOzB,SAAYC,WACR,0BACA,0BACA,4BACA,0BACA,4BACA,kCACA,gCACA,gCACA,gCACA,kCACA,gCACA,8BACA,oBACA,kCACA,wBACA,iCACH,CAjBD,CAAYA,YAAAA,UAAS,KAmBrB,SAAYC,SACR,kBACA,mBACH,CAHD,CAAYA,UAAAA,QAAO,KAKnB,SAAYC,oBACR,+CACA,2CACA,+CACA,8CACH,CALD,CAAYA,qBAAAA,mBAAkB,y3CCrKvB,MAAMC,gBASTvtE,YAAYwtE,WALZ,4CAeQ,KAAAC,mBAAqB,CAAOC,aAAkBhgD,aAAgC,UAAD,gCAEjF,aADkB,uBAAA11B,KAAI,iCAEjBy1E,mBAAmBC,aAAc/4C,KAAK/D,UAAUlD,aAChD3K,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAQA,KAAA2+D,cAAgB,CAAOD,aAAkBE,aAAwB,UAAD,gCAC5D,MAAMlgD,WAA8B,CAAEkgD,YACtC,OAAO51E,KAAKy1E,mBAAmBC,aAAchgD,WACjD,IAQA,KAAAmgD,aAAe,CAAOH,aAAkBI,YAA0B,UAAD,gCAC7D,MAAMpgD,WAA8B,CAAEogD,WACtC,OAAO91E,KAAKy1E,mBAAmBC,aAAchgD,WACjD,IAQA,KAAAqgD,gBAAkB,CAAOL,aAAkBM,eAA0B,UAAD,gCAChE,MAAMtgD,WAA8B,CAAEsgD,cACtC,OAAOh2E,KAAKy1E,mBAAmBC,aAAchgD,WACjD,IAQA,KAAAugD,eAAiB,CAAOP,aAAkBQ,cAA4B,UAAD,gCACjE,MAAMxgD,WAA8B,CAAEwgD,aACtC,OAAOl2E,KAAKy1E,mBAAmBC,aAAchgD,WACjD,IAQA,KAAAygD,gBAAkB,CAAOT,aAAkBU,eAAyB,UAAD,gCAC/D,MAAM1gD,WAA8B,CAAE0gD,cACtC,OAAOp2E,KAAKy1E,mBAAmBC,aAAchgD,WACjD,IAQA,KAAA2gD,sBAAwB,CAAOX,aAAkBY,iBAA4B,UAAD,gCACxE,MAAM5gD,WAA8B,CAAE4gD,gBACtC,OAAOt2E,KAAKy1E,mBAAmBC,aAAchgD,WACjD,IAQQ,KAAA6gD,gBAAkB,CAAOb,aAAkBc,SAAyB,UAAD,gCAEvE,aADkB,uBAAAx2E,KAAI,iCAEjBu2E,gBAAgBb,aAAc/4C,KAAK/D,UAAU49C,SAC7CzrD,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAQA,KAAAy/D,aAAe,CAAOf,aAAkBc,SAAmB,UAAD,gCACtD,MAAME,aAA6B,CAAEC,UAAWH,QAChD,OAAOx2E,KAAKu2E,gBAAgBb,aAAcgB,aAC9C,IAQA,KAAAE,iBAAmB,CAAOlB,aAAkBc,SAAmB,UAAD,gCAC1D,MAAME,aAA6B,CAAEG,QAASL,QAC9C,OAAOx2E,KAAKu2E,gBAAgBb,aAAcgB,aAC9C,IAQA,KAAAI,oBAAsB,CAAOpB,aAAkBc,SAAmB,UAAD,gCAC7D,MAAME,aAA6B,CAAEK,WAAYP,QACjD,OAAOx2E,KAAKu2E,gBAAgBb,aAAcgB,aAC9C,IAQA,KAAAM,kBAAoB,CAAOtB,aAAkBc,SAAmB,UAAD,gCAC3D,MAAME,aAA6B,CAAEO,SAAUT,QAC/C,OAAOx2E,KAAKu2E,gBAAgBb,aAAcgB,aAC9C,IAQA,KAAAQ,qBAAuB,CAAOxB,aAAkBc,SAAmB,UAAD,gCAC9D,MAAME,aAA6B,CAAES,YAAaX,QAClD,OAAOx2E,KAAKu2E,gBAAgBb,aAAcgB,aAC9C,IApJI,uBAAA12E,KAAI,2BAAcw1E,UAAS,IAC/B,u8CCIG,MAAM4B,gBASTpvE,YAAYwtE,WALZ,4CAmBA,KAAA6B,UAAY,IAAY,wDAEpB,aADkB,qCAAAr3E,KAAI,iCACXq3E,YAAYtsD,MAAM/T,QAAW29D,sBAAmC39D,SAC/E,IAMA,KAAAsgE,kBAAoB,IAAY,wDAE5B,aADkB,qCAAAt3E,KAAI,iCACXs3E,oBAAoBvsD,MAAM/T,QAAW29D,sBAAmC39D,SACvF,IAOA,KAAAugE,kBAA2BC,QAAe,wDAEtC,aADkB,qCAAAx3E,KAAI,iCACXu3E,kBAAkBC,QAAQzsD,MAAM/T,QAAW29D,sBAAmC39D,SAC7F,IAOA,KAAAygE,eAAwBhgE,MAAiB,wDAErC,aADkB,qCAAAzX,KAAI,iCACXy3E,eAAehgE,MAAMsT,MAAM/T,QAAW29D,sBAAiC39D,SACtF,IAOA,KAAA0gE,aAAsBzwD,IAAW,wDAE7B,aADkB,qCAAAjnB,KAAI,iCACX03E,aAAazwD,IAAI8D,MAAM/T,QAAW29D,sBAAiC39D,SAClF,IAMA,KAAA2gE,mCAAqC,IAAY,wDAE7C,aADkB,qCAAA33E,KAAI,iCAEjB23E,qCACA5sD,MAAM/T,QAAW29D,sBAAyC39D,SACnE,IAQA,KAAA4gE,4BAA8B,CAAOC,QAAaC,WAAkB,wDAEhE,aADkB,qCAAA93E,KAAI,iCAEjB43E,4BAA4BC,QAASC,UACrC/sD,MAAM/T,QAAW29D,sBAAuC39D,SACjE,IAOA,KAAA+gE,oBAA6BD,UAAiB,wDAE1C,aADkB,qCAAA93E,KAAI,iCACX+3E,oBAAoBD,UAAU/sD,MAAM/T,QAAW29D,sBAAyC39D,SACvG,IAOA,KAAAghE,eAAwBH,SAAgB,wDAEpC,aADkB,qCAAA73E,KAAI,iCACXg4E,eAAeH,SAAS9sD,MAAM/T,QAAW29D,sBAA4B39D,SACpF,IAOA,KAAAihE,YAAqBJ,SAAgB,wDAEjC,aADkB,qCAAA73E,KAAI,iCACXk4E,aAAa,CAACL,UAAU9sD,MAAM/T,QAAW29D,sBAA4B39D,SACpF,IAOA,KAAAmhE,qBAA8BC,UAAmB,wDAE7C,aADkB,qCAAAp4E,KAAI,iCACXk4E,aAAaE,UAAUrtD,MAAM/T,QAAW29D,sBAA4B39D,SACnF,IAQA,KAAAqhE,cAAgB,CAAOC,WAAoBC,iBAAyB,wDAEhE,aADkB,qCAAAv4E,KAAI,iCACXq4E,cAAcC,WAAYC,gBAAgBxtD,MAAM/T,QAAW29D,sBAA4B39D,SACtG,IAQA,KAAAwhE,eAAiB,CAAOX,QAAav4C,SAA+B,wDAEhE,aADkB,qCAAAt/B,KAAI,iCACXw4E,eAAeX,QAASv4C,QAAQvU,MAAM/T,QAAW29D,sBAA4B39D,SAC5F,IAQA,KAAAyhE,eAAiB,CAAOZ,QAAa57D,QAAkB,wDACnD,MAAM1Y,UAAY,qCAAAvD,KAAI,gCAChB04E,KAAOlE,mBAAmBv4D,OAChC,OAAa,OAATy8D,MAAiBA,OAASv1E,IACnB,KAGJI,IACFk1E,eAAeZ,QAAS91E,WAAW22E,KAAKpvE,aACxCyhB,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAQA,KAAA2hE,iBAAmB,CAAOd,QAAa57D,QAAkB,wDACrD,MAAM1Y,UAAY,qCAAAvD,KAAI,gCAChB04E,KAAOlE,mBAAmBv4D,OAChC,OAAa,OAATy8D,MAAiBA,OAASv1E,IACnB,KAGJI,IACFo1E,iBAAiBd,QAAS91E,WAAW22E,KAAKpvE,aAC1CyhB,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAQA,KAAA4hE,cAAgB,CAAOf,QAAa57D,QAAkB,wDAClD,MAAM1Y,UAAY,qCAAAvD,KAAI,gCAChB04E,KAAOlE,mBAAmBv4D,OAChC,OAAa,OAATy8D,MAAiBA,OAASv1E,IACnB,KAGJI,IACFq1E,cAAcf,QAAS91E,WAAW22E,KAAKpvE,aACvCyhB,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAQA,KAAA6hE,UAAY,CAAOhB,QAAa57D,QAAkB,wDAC9C,MAAM1Y,UAAY,qCAAAvD,KAAI,gCAChB04E,KAAOlE,mBAAmBv4D,OAEhC,OAAa,OAATy8D,MAAiBA,OAASv1E,IACnB,KAEJI,IACFs1E,UAAUhB,QAAS91E,WAAW22E,KAAKpvE,aACnCyhB,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAQA,KAAA8hE,UAAY,CAAOjB,QAAa57D,QAAkB,wDAC9C,MAAM1Y,UAAY,qCAAAvD,KAAI,gCAChB04E,KAAOlE,mBAAmBv4D,OAEhC,OAAa,OAATy8D,MAAiBA,OAASv1E,IACnB,KAGJI,IACFu1E,UAAUjB,QAAS91E,WAAW22E,KAAKpvE,aACnCyhB,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAQA,KAAA+hE,aAAe,CAAOlB,QAAamB,YAAsB,wDAErD,aADkB,qCAAAh5E,KAAI,iCACXi5E,YAAYpB,QAASmB,WAAWjuD,MAAM/T,QAAW29D,sBAA4B39D,SAC5F,IAOA,KAAAkiE,WAAoBrB,SAAgB,wDAEhC,aADkB,qCAAA73E,KAAI,iCACXk5E,WAAWrB,SAAS9sD,MAAM/T,QAAW29D,sBAA4B39D,SAChF,IAMA,KAAAmiE,YAAqBtB,SAAgB,wDAEjC,aADkB,qCAAA73E,KAAI,iCACXm5E,YAAYtB,SAAS9sD,MAAM/T,QAAW29D,sBAA4B39D,SACjF,IAOA,KAAAoiE,YAAqBvB,SAAgB,wDAEjC,aADkB,qCAAA73E,KAAI,iCACXo5E,YAAYvB,SAAS9sD,MAAM/T,QAAW29D,sBAA4B39D,SACjF,IAOA,KAAAqiE,mBAA4BxB,SAAgB,wDAExC,aADkB,qCAAA73E,KAAI,iCACXq5E,mBAAmBxB,SAAS9sD,MAAM/T,QAAW29D,sBAA4B39D,SACxF,IAOA,KAAAsiE,gBAAyBzB,SAAgB,wDAErC,aADkB,qCAAA73E,KAAI,iCACXs5E,gBAAgBzB,SAAS9sD,MAAM/T,QAAW29D,sBAA4B39D,SACrF,IAOA,KAAAuiE,iBAA0B1B,SAAgB,wDAEtC,aADkB,qCAAA73E,KAAI,iCACXu5E,iBAAiB1B,SAAS9sD,MAAM/T,QAAW29D,sBAA4B39D,SACtF,IAOA,KAAAwiE,uBAAgC3B,SAAgB,wDAE5C,aADkB,qCAAA73E,KAAI,iCACXw5E,uBAAuB3B,SAAS9sD,MAAM/T,QAAW29D,sBAA4B39D,SAC5F,IAQA,KAAAyiE,mBAAqB,CAAO5B,QAAa57D,QAAmB,wDAExD,aADkB,qCAAAjc,KAAI,iCACXy5E,mBAAmB5B,QAAS57D,OAAO8O,MAAM/T,QAAW29D,sBAA4B39D,SAC/F,IAOA,KAAA0iE,YAAqB7B,SAAgB,wDAEjC,aADkB,qCAAA73E,KAAI,iCACX05E,YAAY7B,SAAS9sD,MAAM/T,QAAW29D,sBAA4B39D,SACjF,IAYA,KAAA2iE,SAAW,CAAOC,UAA0B15E,EAAW8C,EAAW62E,MAAeC,SAAmB,wDAEhG,aADkB,qCAAA95E,KAAI,iCACX25E,SAASC,UAAW15E,EAAG8C,EAAG62E,MAAOC,QAAQ/uD,MAAM/T,QAAW29D,sBAA8B39D,SACvG,IAYA,KAAA+iE,cAAgB,CAAOC,UAAsB95E,EAAW8C,EAAW62E,MAAeC,SAAmB,wDAEjG,aADkB,qCAAA95E,KAAI,iCACX25E,SAASK,UAAW95E,EAAG8C,EAAG62E,MAAOC,QAAQ/uD,MAAM/T,QAAW29D,sBAA8B39D,SACvG,IAQQ,KAAAijE,kBAAoB,CAAOC,aAAkBxuD,MAAiC,wDAClF,MAAMnoB,UAAY,qCAAAvD,KAAI,gCAChBm6E,QAAkB,OAARzuD,IAAeiR,KAAK/D,UAAUlN,KAAO,KACrD,OAAOnoB,IAAI62E,eAAeF,aAAcC,SAASpvD,MAAM/T,QAAW29D,sBAA4B39D,SAClG,IAMA,KAAAqjE,kBAA2BH,cAAyB,wDAChD,OAAOl6E,KAAKi6E,kBAAkBC,aAAc,KAChD,IASA,KAAAI,sBAAwB,CAAOJ,aAAkBK,YAAqBC,aAAuB,wDACzF,MAAM9uD,IAAiC,CACnC+uD,QAASD,WACTD,YACAG,WAAY3F,oBAAoB4F,WAEpC,OAAO36E,KAAKi6E,kBAAkBC,aAAcxuD,IAChD,IASA,KAAAkvD,gBAAkB,CAAOV,aAAkBW,MAAgB,wDACvD,MAAMnvD,IAA2B,CAAEmvD,IAAUH,WAAY3F,oBAAoB8F,KAC7E,OAAO76E,KAAKi6E,kBAAkBC,aAAcxuD,IAChD,IAQA,KAAAovD,qBAAuB,CAAOZ,aAAkBa,UAAqB,wDAEjE,aADkB,qCAAA/6E,KAAI,iCACX86E,qBAAqBZ,aAAca,SAAShwD,MAAM/T,QAAW29D,sBAA4B39D,SACxG,IAOA,KAAAgkE,6BAA+B,CAAOnD,QAAaoD,uBAAkC,wDAEjF,aADkB,qCAAAj7E,KAAI,iCAEjBg7E,6BAA6BnD,QAASoD,sBACtClwD,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAQA,KAAAkkE,qBAAuB,CAAOrD,QAAasD,gBAAiC,wDAExE,aADkB,qCAAAn7E,KAAI,iCACXk7E,qBAAqBrD,QAASsD,eAAepwD,MAAM/T,QAAW29D,sBAA4B39D,SACzG,IAQA,KAAAokE,kBAAoB,CAAOvD,QAAa57D,QAAkB,wDACtD,MAAM1Y,UAAY,qCAAAvD,KAAI,gCAEhB04E,KAAOlE,mBAAmBv4D,OAChC,OAAa,OAATy8D,MAAiBA,OAASv1E,IACnB,KAGJI,IACF63E,kBAAkBvD,QAAS91E,WAAW22E,KAAKpvE,aAC3CyhB,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAQA,KAAAqkE,kBAAoB,CAAOxD,QAAa57D,QAAkB,wDACtD,MAAM1Y,UAAY,qCAAAvD,KAAI,gCAEhB04E,KAAOlE,mBAAmBv4D,OAChC,OAAa,OAATy8D,MAAiBA,OAASv1E,IACnB,KAGJI,IACF83E,kBAAkBxD,QAAS91E,WAAW22E,KAAKpvE,aAC3CyhB,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAQA,KAAAskE,qBAAuB,CAAOzD,QAAa57D,QAAmB,wDAE1D,aADkB,qCAAAjc,KAAI,iCACXs7E,qBAAqBzD,QAAS57D,OAAO8O,MAAM/T,QAAW29D,sBAA4B39D,SACjG,IAOA,KAAAukE,oBAA6B1D,SAAgB,wDAEzC,aADkB,qCAAA73E,KAAI,iCACXu7E,oBAAoB1D,SAAS9sD,MAAM/T,QAAW29D,sBAA4B39D,SACzF,IAOA,KAAAwkE,oBAA6B3D,SAAgB,wDAEzC,aADkB,qCAAA73E,KAAI,iCACXw7E,oBAAoB3D,SAAS9sD,MAAM/T,QAAW29D,sBAA4B39D,SACzF,IAOA,KAAAykE,uBAAgC5D,SAAgB,wDAE5C,aADkB,qCAAA73E,KAAI,iCACXy7E,uBAAuB5D,SAAS9sD,MAAM/T,QAAW29D,sBAA4B39D,SAC5F,IAQA,KAAA0kE,wBAA0B,CAAOhG,aAAkBE,aAAwB,wDACvE,OAAO51E,KAAK27E,gBAAgBhG,cAAcD,aAAcE,WAC5D,IAQA,KAAAgG,uBAAyB,CAAOlG,aAAkBI,YAA0B,wDACxE,OAAO91E,KAAK27E,gBAAgB9F,aAAaH,aAAcI,UAC3D,IAQA,KAAA+F,0BAA4B,CAAOnG,aAAkBM,eAA0B,wDAC3E,OAAOh2E,KAAK27E,gBAAgB5F,gBAAgBL,aAAcM,aAC9D,IAQA,KAAA8F,yBAA2B,CAAOpG,aAAkBQ,cAA4B,wDAC5E,OAAOl2E,KAAK27E,gBAAgB1F,eAAeP,aAAcQ,YAC7D,IAQA,KAAA6F,0BAA4B,CAAOrG,aAAkBU,eAAyB,wDAC1E,OAAOp2E,KAAK27E,gBAAgBxF,gBAAgBT,aAAcU,aAC9D,IAQA,KAAA4F,kBAAoB,CAAOnE,QAAaoE,YAAyB,wDAE7D,aADkB,qCAAAj8E,KAAI,iCACXg8E,kBAAkBnE,QAASoE,WAAWlxD,MAAM/T,QAAW29D,sBAA4B39D,SAClG,IAOA,KAAAklE,cAAuBrE,SAAgB,wDAEnC,aADkB,qCAAA73E,KAAI,iCACXk8E,cAAcrE,SAAS9sD,MAAM/T,QAAW29D,sBAA4B39D,SACnF,IAMA,KAAAmlE,cAAgB,IAAY,wDAExB,aADkB,qCAAAn8E,KAAI,iCACXm8E,gBAAgBpxD,MAAM/T,QAAW29D,sBAA4B39D,SAC5E,IAOA,KAAAolE,cAAuBvE,SAAgB,wDAEnC,aADkB,qCAAA73E,KAAI,iCACXo8E,cAAcvE,SAAS9sD,MAAM/T,QAAW29D,sBAA4B39D,SACnF,IAMA,KAAAqlE,eAAiB,IAAY,wDAEzB,aADkB,qCAAAr8E,KAAI,iCACXq8E,iBAAiBtxD,MAAM/T,QAAW29D,sBAA4B39D,SAC7E,IA/mBI,qCAAAhX,KAAI,2BAAcw1E,UAAS,KAC3Bx1E,KAAK27E,gBAAkB,IAAIpG,gBAAgB,qCAAAv1E,KAAI,gCACnD,u9CC5BG,MAAMs8E,oBASTt0E,YAAYu0E,UALZ,gDAaA,KAAAC,8BAAgC,IAAY,4DAExC,aADkB,yCAAAx8E,KAAI,qCAEjBw8E,gCACAzxD,MAAM/T,QAAW29D,sBAAsD39D,SAChF,IAQA,KAAAylE,sBAAwB,CAAO5E,QAAaC,WAAkB,4DAE1D,aADkB,yCAAA93E,KAAI,qCAEjBy8E,sBAA8B5E,QAASC,UACvC/sD,MAAM/T,QAAW29D,sBAAoD39D,SAC9E,IAOA,KAAA0lE,wBAAiC5E,UAAiB,4DAE9C,aADkB,yCAAA93E,KAAI,qCAEjB08E,wBAAwB5E,UACxB/sD,MAAM/T,QAAW29D,sBAAoD39D,SAC9E,IAOA,KAAA2lE,kBAA2BC,WAA4C,4DAEnE,aADkB,yCAAA58E,KAAI,qCAEjB28E,kBAAkBhgD,KAAK/D,UAAUgkD,YACjC7xD,MAAM/T,QACH29D,sBAAqB,+BAAoC39D,QAAM,CAAEmD,KAAMwiB,KAAK/D,UAAUgkD,eAElG,IAMA,KAAAC,cAAgB,IAAY,4DAExB,aADkB,yCAAA78E,KAAI,qCACX68E,gBAAgB9xD,MAAM/T,QAAW29D,sBAA4B39D,SAC5E,IAMA,KAAA8lE,eAAiB,IAAY,4DAEzB,aADkB,yCAAA98E,KAAI,qCACX88E,iBAAiB/xD,MAAM/T,QAAW29D,sBAA4B39D,SAC7E,IAOA,KAAA+lE,oBAA6BC,UAAqB,4DAE9C,aADkB,yCAAAh9E,KAAI,qCACX+8E,oBAAoBC,SACnC,IAOA,KAAAC,qBAA8BD,UAAqB,4DAE/C,aADkB,yCAAAh9E,KAAI,qCACXi9E,qBAAqBD,UAAUjyD,MAAM/T,QAAW29D,sBAA4B39D,SAC3F,IAOA,KAAAkmE,oBAA6BrF,SAAgB,4DAEzC,aADkB,yCAAA73E,KAAI,qCACXk9E,oBAAoBrF,QACnC,IAMA,KAAAsF,eAAiB,IAAY,4DAEzB,aADkB,yCAAAn9E,KAAI,qCACXm9E,gBACf,IA5GI,yCAAAn9E,KAAI,+BAAcu8E,SAAQ,IAC9B,y+CCTG,MAAMa,iBAUTp1E,YAAYwtE,WANZ,6CACA,2CAcA,KAAA6H,WAAa,IAAY,yDAErB,aADkB,sCAAAr9E,KAAI,kCACXq9E,aAAatyD,MAAM/T,QAAW29D,sBAAgC39D,SAC7E,IAOA,KAAAsmE,cAAuBr2D,IAAW,yDAE9B,aADkB,sCAAAjnB,KAAI,kCACXs9E,cAAcr2D,IAAI8D,MAAM/T,QAAW29D,sBAA8B39D,SAChF,IAOA,KAAAumE,gBAAyB9lE,MAAiB,yDAEtC,aADkB,sCAAAzX,KAAI,kCACXu9E,gBAAgB9lE,MAAMsT,MAAM/T,QAAW29D,sBAA8B39D,SACpF,IAMA,KAAAwmE,kBAAoB,IAAY,yDAE5B,aADkB,sCAAAx9E,KAAI,kCACXw9E,oBAAoBzyD,MAAM/T,QAAW29D,sBAA8B39D,SAClF,IAOA,KAAAymE,aAAsB3F,UAAiB,yDAEnC,aADkB,sCAAA93E,KAAI,kCACXy9E,aAAa3F,UAAU/sD,MAAM/T,QAAW29D,sBAA4B39D,SACnF,IAOA,KAAA0mE,UAAmBC,UAAiB,yDAEhC,aADkB,sCAAA39E,KAAI,kCACX09E,UAAUC,UAAU5yD,MAAM/T,QAAW29D,sBAA8B39D,SAClF,IAQA,KAAA4mE,cAAgB,CAAO9F,SAAc+F,aAAuB,yDAExD,aADkB,sCAAA79E,KAAI,kCACX89E,aAAahG,SAAU+F,YAAY9yD,MAAM/T,QAAW29D,sBAA4B39D,SAC/F,IAOA,KAAA+mE,aAAsBjG,UAAiB,yDAEnC,aADkB,sCAAA93E,KAAI,kCACX+9E,aAAajG,UAAU/sD,MAAM/T,QAAW29D,sBAA4B39D,SACnF,IAOA,KAAAgnE,gBAAyBlG,UAAiB,yDAEtC,aADkB,sCAAA93E,KAAI,kCACXg+E,gBAAgBlG,UAAU/sD,MAAM/T,QAAW29D,sBAA8B39D,SACxF,IAOA,KAAAinE,YAAqBnG,UAAiB,yDAElC,aADkB,sCAAA93E,KAAI,kCACXi+E,YAAYnG,UAAU/sD,MAAM/T,QAAW29D,sBAA4B39D,SAClF,IAQA,KAAAknE,gBAAkB,CAAOpG,SAAc77D,QAAkB,yDACrD,MAAM1Y,UAAY,sCAAAvD,KAAI,iCAChB04E,KAAOlE,mBAAmBv4D,OAChC,OAAa,OAATy8D,MAAiBA,OAASv1E,IACnB,KAEJI,IACF26E,gBAAgBpG,SAAU/1E,WAAW22E,KAAKpvE,aAC1CyhB,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAQA,KAAAmnE,eAAiB,CAAOrG,SAAc77D,QAAkB,yDACpD,MAAM1Y,UAAY,sCAAAvD,KAAI,iCAChB04E,KAAOlE,mBAAmBv4D,OAChC,OAAa,OAATy8D,MAAiBA,OAASv1E,IACnB,KAGJI,IACF46E,eAAerG,SAAU/1E,WAAW22E,KAAKpvE,aACzCyhB,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAOA,KAAAonE,kBAA2BtG,UAAiB,yDAExC,aADkB,sCAAA93E,KAAI,kCACXo+E,kBAAkBtG,UAAU/sD,MAAM/T,QAAW29D,sBAA4B39D,SACxF,IAOA,KAAAqnE,iBAA0BvG,UAAiB,yDAEvC,aADkB,sCAAA93E,KAAI,kCACXq+E,iBAAiBvG,UAAU/sD,MAAM/T,QAAW29D,sBAA4B39D,SACvF,IAMA,KAAAsnE,0BAA4B,IAAY,yDAEpC,aADkB,sCAAAt+E,KAAI,gCACXu+E,kBAAkBxzD,MAAM/T,SAAU,OAAC,OAAsB,QAAtB,GAACA,cAAqB,UAAKA,MAA+B,GAC5G,IArKI,sCAAAhX,KAAI,4BAAcw1E,UAAS,KAC3B,sCAAAx1E,KAAI,0BAAYw1E,UAAuC,IAC3D,8GCvBQgJ,kBAOAC,mBAKAC,WAGAC,SAUAC,44CChBL,MAAMC,eAST72E,YAAYwtE,WALZ,2CAaA,KAAAsJ,SAAW,IAAY,uDAEnB,aADkB,oCAAA9+E,KAAI,gCACX8+E,WAAW/zD,MAAM/T,QAAW29D,sBAA8B39D,SACzE,IAOA,KAAA+nE,YAAqBvH,QAAe,uDAEhC,aADkB,oCAAAx3E,KAAI,gCACX++E,YAAYvH,QAAQzsD,MAAM/T,QAAW29D,sBAA4B39D,SAChF,IASA,KAAAgoE,aAAe,CAAOxH,OAAYv7D,QAAkB,uDAChD,MAAM1Y,UAAY,oCAAAvD,KAAI,+BAChB04E,KAAOlE,mBAAmBv4D,OAEhC,OAAa,OAATy8D,MAAiBA,OAASv1E,IACnB,KAGJI,IACFy7E,aAAaxH,OAAQz1E,WAAW22E,KAAKpvE,aACrCyhB,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IASA,KAAAioE,cAAgB,CAAOzH,OAAYv7D,QAAkB,uDACjD,MAAM1Y,UAAY,oCAAAvD,KAAI,+BAChB04E,KAAOlE,mBAAmBv4D,OAEhC,OAAa,OAATy8D,MAAiBA,OAASv1E,IACnB,KAGJI,IACF07E,cAAczH,OAAQz1E,WAAW22E,KAAKpvE,aACtCyhB,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IA5DI,oCAAAhX,KAAI,0BAAcw1E,UAAS,IAC/B,wCCbG,MAAM0J,gBAAb,cAOI,KAAAC,oBAAsB,CAAC7K,IAAaxvE,YAChC6vE,sBAA8B,CAC1Bx6D,KAAMjH,OAAOshE,mBAAmBF,IAAKxvE,YACrCgwE,SAAS,EACTsK,OAAQ,IACRvK,WAAY,OASpB,KAAA3wE,MAAQ,CAACowE,IAAaxvE,YAClB6vE,sBAA8B,CAC1Bx6D,KAAMjH,OAAOhP,MAAMowE,IAAKxvE,YACxBgwE,SAAS,EACTsK,OAAQ,IACRvK,WAAY,MAExB,EC5BO,MAAMwK,qBASTr3E,YAAYiM,QAQZ,KAAAgb,iBAAoBqwD,UAChB,MAAMC,SAAWv/E,KAAKiU,OAAOgb,iBAC7BswD,UAAYA,SAAS5iD,KAAK36B,MAAMs9E,SAAS,EAO7C,KAAAE,mBAAsB5C,YAClB,MAAM2C,SAAWv/E,KAAKiU,OAAOgc,yBAC7BsvD,UAAYA,SAAS5iD,KAAK36B,MAAM46E,WAAW,EAO/C,KAAA6C,2BAA8BC,yBAC1B,MAAMH,SAAWv/E,KAAKiU,OAAO8b,0BAC7BwvD,UAAYA,SAAS5iD,KAAK36B,MAAM09E,wBAAwB,EAO5D,KAAA/vD,kCAAqC+F,aACjC,MAAM6pD,SAAWv/E,KAAKiU,OAAO0b,kCAC7B4vD,UAAYA,SAAS5iD,KAAK36B,MAAM0zB,YAAY,EAOhD,KAAAjG,6BAAgCkwD,QAC5B,MAAMJ,SAAWv/E,KAAKiU,OAAOwb,6BAC7B8vD,UAAYA,SAAS5iD,KAAK36B,MAAM29E,OAAO,EAO3C,KAAApwD,8BAAiCowD,QAC7B,MAAMJ,SAAWv/E,KAAKiU,OAAOsb,8BAC7BgwD,UAAYA,SAAS5iD,KAAK36B,MAAM29E,OAAO,EAM3C,KAAAxwD,eAAiB,KACb,MAAMowD,SAAWv/E,KAAKiU,OAAOkb,eAC7BowD,UAAYA,UAAU,EAM1B,KAAAlwD,iBAAmB,KACf,MAAMkwD,SAAWv/E,KAAKiU,OAAOob,iBAC7BkwD,UAAYA,UAAU,EAO1B,KAAA1vD,uBAAyB,KACrB,MAAM0vD,SAAWv/E,KAAKiU,OAAO4b,uBAC7B0vD,UAAYA,UAAU,EAO1B,KAAAlvD,sBAAyBuvD,gBACrB,MAAML,SAAWv/E,KAAKiU,OAAOoc,sBAC7BkvD,UAAYA,SAAS5iD,KAAK36B,MAAM49E,eAAe,EAOnD,KAAAzvD,sBAAyB0vD,OACrB,MAAMN,SAAWv/E,KAAKiU,OAAOkc,sBAC7BovD,UAAYA,SAASM,KAAiB,EAO1C,KAAAtvD,mBAAsBuvD,YAClB,MAAMP,SAAWv/E,KAAKiU,OAAO8rE,wBAC7BR,UAAYA,SAAS5iD,KAAK36B,MAAM89E,WAAW,EAO/C,KAAArvD,8BAAiCuvD,SAC7B,MAAMT,SAAWv/E,KAAKiU,OAAOwc,8BAC7B8uD,UAAYA,SAAS5iD,KAAK36B,MAAMg+E,QAAQ,EAO5C,KAAArvD,2BAA8BsvD,SAC1B,MAAMV,SAAWv/E,KAAKiU,OAAO0c,2BAC7B4uD,UAAYA,SAAS5iD,KAAK36B,MAAMi+E,QAAQ,EAO5C,KAAApvD,gBAAmBqvD,SACf,MAAMX,SAAWv/E,KAAKiU,OAAO4c,gBAC7B0uD,UAAYA,SAAS5iD,KAAK36B,MAAMk+E,QAAQ,EAO5C,KAAAnvD,yBAA4BovD,kBACxB,MAAMZ,SAAWv/E,KAAKiU,OAAO8c,yBAC7BwuD,UAAYA,SAAS5iD,KAAK36B,MAAMm+E,iBAAiB,EAOrD,KAAAlvD,yBAA4BmvD,kBACxB,MAAMb,SAAWv/E,KAAKiU,OAAOgd,yBAC7BsuD,UAAYA,SAAS5iD,KAAK36B,MAAMo+E,iBAAiB,EAOrD,KAAAjvD,eAAkBkvD,QACd,MAAMd,SAAWv/E,KAAKiU,OAAOkd,eAC7BouD,UAAYA,SAAS5iD,KAAK36B,MAAMq+E,OAAO,EAO3C,KAAAhvD,0BAA6BymD,WACzB,MAAMyH,SAAWv/E,KAAKiU,OAAOod,0BAC7BkuD,UAAYA,SAASzH,SAAS,EAWlC,KAAAvmD,iBAAoB+uD,UAChB,MAAMf,SAAWv/E,KAAKiU,OAAOsd,iBAC7BguD,UAAYA,SAAS5iD,KAAK36B,MAAMs+E,SAAS,EAO7C,KAAA3uD,cAAiB4uD,YACb,MAAMhB,SAAWv/E,KAAKiU,OAAO0d,cAC7B4tD,UAAYA,SAAS5iD,KAAK36B,MAAMu+E,WAAW,EAa/C,KAAA9uD,iBAAoBD,iBAChB,MAAM+tD,SAAWv/E,KAAKiU,OAAOwd,iBAC7B8tD,UAAYA,SAAS5iD,KAAK36B,MAAMwvB,gBAAgB,EAQpD,KAAAK,kBAAqB2uD,WACjB,MAAMjB,SAAWv/E,KAAKiU,OAAO4d,kBAC7B0tD,UAAYA,SAAS5iD,KAAK36B,MAAMw+E,UAAU,EAO9C,KAAAzuD,2BAA8B2kD,eAC1B,MAAM6I,SAAWv/E,KAAKiU,OAAO8d,2BAC7BwtD,UAAYA,SAAS5iD,KAAK36B,MAAM00E,cAAc,EAjO9C12E,KAAKiU,OAASA,MAClB,GHlBJ,SAAYuqE,mBACR,mCACA,mCACA,gCACA,kCACA,gDACH,CAND,CAAYA,oBAAAA,kBAAiB,KAO7B,SAAYC,oBACR,gDACA,6CACH,CAHD,CAAYA,qBAAAA,mBAAkB,KAK9B,SAAYC,YACR,oEACH,CAFD,CAAYA,aAAAA,WAAU,KAGtB,SAAYC,UACR,yBACA,qBACA,qBACA,kCACA,gCACA,2BACA,iCACA,gCACH,CATD,CAAYA,WAAAA,SAAQ,KAUpB,SAAYC,iBACR,0BACA,0BACA,0BACA,yBACH,CALD,CAAYA,kBAAAA,gBAAe,+6CIdpB,MAAM6B,mBASTz4E,YAAYwtE,WALZ,+CAaA,KAAAkL,wBAA0B,IAAY,2DAElC,aADkB,wCAAA1gF,KAAI,oCACX0gF,0BAA0B31D,MAAM/T,QAAW29D,sBAAqC39D,SAC/F,IAOA,KAAA2pE,aAAsBC,KAAgC,2DAClD,MAAMr9E,UAAY,wCAAAvD,KAAI,mCACtB,MAAmB,iBAAR4gF,IAAyBr9E,IAAIo9E,aAAaC,KAC9Cr9E,IAAIo9E,aAAahkD,KAAK/D,UAAUgoD,MAAM71D,MAAM/T,QAAW29D,sBAA4B39D,SAC9F,IAUA,KAAA6pE,gBAAkB,CAAOtqD,OAAyBuhD,WAAiB,wEAC/D,IAAIpvD,MAA8B,KAC9Bo4D,qBAAsC,KACtCC,aAAe,GAEnB,MAAMC,uBAAyBhhF,KAAK0gF,0BAC9BO,UCvDa,EAAC1qD,OAAgBuhD,WACxC,GAAG4G,WAAWwC,iCAAiC3qD,0BAC3CuhD,eAAAA,SAAY,+CDqDMqJ,CAAY5qD,OAAQuhD,UACtC,IACI,MAAMlD,eAAiBwM,MAAMH,UAAW,CACpC3hD,OAAQ,OACR+hD,QAAS,CACL,eAAgB,oBAEpBC,KAAuC,QAAhC,GAAAN,iBAAiB7mE,YAAe,UAAI,OAE1C4Q,MAAM5Q,MAASA,KAAKsjB,SACpB8jD,OAAOjiE,MAEAoJ,MADApJ,IAAIqJ,KACI,CAAEA,KAAMrJ,IAAIqJ,KAAMD,MAAOpJ,IAAIyH,SAAWzH,KAExC,CAAEqJ,KAAM,IAAKD,MAAOpJ,IAAIyH,SAAWzH,KAExCoJ,SAEf,IAAIksD,oBAAQ,EAARA,SAAUlsD,QAASA,MACnB,OAAOisD,sBACH,CACIG,SAAS,EACT36D,KAAM4mE,aACNr4D,MACA02D,OAAQxK,SAASwK,OACjBvK,WAAY,OAEhB,GAGRiM,sBAAuBlM,oBAAQ,EAARA,SAAU4M,WAAY9C,WAAWwC,UAAWtM,oBAAQ,EAARA,SAAU4M,WAAY,KAEzFT,cAAenM,oBAAQ,EAARA,SAAU6M,aAAc/C,WAAWwC,UAAWtM,oBAAQ,EAARA,SAAU6M,aAAc,GAErF,IAAIC,mBAA4Dh5D,MAEhE,IACIg5D,yBAA2B1hF,KAAK2hF,uBAAuBb,sBACzD,MAAOxhE,KACLoJ,MAAQpJ,IAIZ,OAD2B,IAAvBoiE,qBAA6Bh5D,MAAQg5D,oBAE9B/M,sBADPjsD,MAEI,CACIosD,SAAS,EACT36D,KAAM,GACNuO,MACA02D,OAAmB,QAAX,GAAA12D,iBAAK,EAALA,MAAOC,YAAI,UAAI,IACvBksD,WAAY,MAMpB,CACIC,SAAS,EACTsK,OAAQ,IACRjlE,KAAM4mE,aACNlM,WAAY,OARZ,GAYV,MAAOv1D,KAEL,OADAoJ,MAAQpJ,IACDq1D,sBACH,CACIG,SAAS,EACT36D,KAAM4mE,aACNr4D,MACA02D,OAAmB,QAAX,GAAA12D,iBAAK,EAALA,MAAOC,YAAI,UAAI,IACvBksD,WAAY,OAEhB,GAGZ,IAOA,KAAA8M,uBAAgCC,UAA8C,2DAC1E,IACI,MAAMhN,eAAiBwM,MAAMQ,UACxB72D,MAAM5Q,MAASA,OACfonE,OAAOjiE,KAAQA,MACpB,OAAyB,OAArBs1D,oBAAQ,EAARA,SAAUwK,gBACJ,IAAIv2D,SAASC,SAAYmE,WAAWnE,QAAS,aACtC9oB,KAAK2hF,uBAAuBC,WAI/C,MAAOtiE,KACL,OAAOA,IAEf,IAvII,wCAAAtf,KAAI,8BAAcw1E,UAAS,IAC/B,08CEdG,MAAMqM,gBAST75E,YAAYwtE,WALZ,4CAaA,KAAAsM,QAAU,IAAY,wDAElB,aADkB,qCAAA9hF,KAAI,iCACX8hF,UAAU/2D,MAAM/T,QAAW29D,sBAAmC39D,SAC7E,IAMA,KAAA+qE,iBAAmB,IAAY,wDAE3B,aADkB,qCAAA/hF,KAAI,iCACX+hF,mBAAmBh3D,MAAM/T,QAAW29D,sBAA4B39D,SAC/E,IAMA,KAAAgrE,YAAc,IAAY,wDAEtB,aADkB,qCAAAhiF,KAAI,iCACXgiF,cAAcj3D,MAAM/T,QAAW29D,sBAA4B39D,SAC1E,IAMA,KAAAirE,aAAe,IAAY,wDAEvB,aADkB,qCAAAjiF,KAAI,iCACXiiF,eAAel3D,MAAM/T,QAAW29D,sBAA4B39D,SAC3E,IArCI,qCAAAhX,KAAI,2BAAcw1E,UAAS,IAC/B,m9CCXG,MAAM0M,mBASTl6E,YAAYwtE,WALZ,+CAaA,KAAA2M,aAAe,IAAY,2DAEvB,aADkB,wCAAAniF,KAAI,oCACXmiF,eAAep3D,MAAM/T,QAAW29D,sBAAkC39D,SACjF,IAOA,KAAAorE,gBAAyBC,YAAuB,2DAE5C,aADkB,wCAAAriF,KAAI,oCACXoiF,gBAAgBC,YAAYt3D,MAAM/T,QAAW29D,sBAAgC39D,SAC5F,IAOA,KAAAsrE,kBAA2BC,cAAyB,2DAEhD,aADkB,wCAAAviF,KAAI,oCACXsiF,kBAAkBC,cAAcx3D,MAAM/T,QAAW29D,sBAAgC39D,SAChG,IAMA,KAAAwrE,YAAc,CAAO7E,SAAkB8E,eAA+B,2DAElE,aADkB,wCAAAziF,KAAI,oCACXwiF,YAAY7E,SAAU8E,cAAc13D,MAAM/T,QAAW29D,sBAA8B39D,SAClG,IAMA,KAAA0rE,gBAAyBC,aAA0B,2DAE/C,aADkB,wCAAA3iF,KAAI,oCACX0iF,gBAAgBC,aAAa53D,MAAM/T,QAAW29D,sBAA4B39D,SACzF,IAMA,KAAA4rE,gBAAkB,CAAOP,WAAoB5qE,OAAiB,2DAE1D,aADkB,wCAAAzX,KAAI,oCACX4iF,gBAAgBP,WAAY5qE,MAAMsT,MAAM/T,QAAW29D,sBAA4B39D,SAC9F,IAMA,KAAA6rE,iBAAmB,CAAOR,WAAoBS,QAAkB,2DAE5D,aADkB,wCAAA9iF,KAAI,oCACX6iF,iBAAiBR,WAAYS,OAAO/3D,MAAM/T,QAAW29D,sBAA4B39D,SAChG,IAMA,KAAA+rE,gBAAkB,CAAOV,WAAoBtmE,OAAuB,2DAEhE,aADkB,wCAAA/b,KAAI,oCACX+iF,gBAAgBV,WAAYtmE,MAAMgP,MAAM/T,QAAW29D,sBAA4B39D,SAC9F,IAMA,KAAAgsE,iBAAmB,CAAOX,WAAoBpmE,QAAkB,2DAE5D,aADkB,wCAAAjc,KAAI,oCACXgjF,iBAAiBX,WAAYpmE,OAAO8O,MAAM/T,QAAW29D,sBAA4B39D,SAChG,IAMA,KAAAisE,kBAA2BZ,YAAuB,2DAE9C,aADkB,wCAAAriF,KAAI,oCACXijF,kBAAkBZ,YAAYt3D,MAAM/T,QAAW29D,sBAA8B39D,SAC5F,IAMA,KAAAksE,eAAiB,CAAOC,UAAmBR,cAA0B,2DAEjE,aADkB,wCAAA3iF,KAAI,oCACXkjF,eAAeC,UAAWR,aAAa53D,MAAM/T,QAAW29D,sBAA8B39D,SACrG,IAMA,KAAAosE,gBAAyBC,SAAoB,2DAEzC,aADkB,wCAAArjF,KAAI,oCACXojF,gBAAgBC,SAASt4D,MAAM/T,QAAW29D,sBAA4B39D,SACrF,IAMA,KAAAssE,aAAe,CAAOjB,WAAoB1E,SAAkBrF,aAAuB,2DAE/E,aADkB,wCAAAt4E,KAAI,oCACXsjF,aAAajB,WAAY1E,SAAUrF,YAAYvtD,MAAM/T,QAAW29D,sBAA4B39D,SAC3G,IAMA,KAAAusE,cAAuBC,gBAAkC,2DAErD,aADkB,wCAAAxjF,KAAI,oCAEjBujF,cAAcC,eAAeC,MAAOD,eAAeniD,OAAQmiD,eAAeE,OAC1E34D,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAMA,KAAA2sE,oBAAsB,CAAOtB,WAAoBuB,WAAsB,2DAEnE,aADkB,wCAAA5jF,KAAI,oCACX2jF,oBAAoBtB,WAAYuB,UAAU74D,MAAM/T,QAAW29D,sBAA4B39D,SACtG,IAMA,KAAA6sE,sBAAwB,CAAOxB,WAAoByB,aAAwB,2DAEvE,aADkB,wCAAA9jF,KAAI,oCACX6jF,sBAAsBxB,WAAYyB,YAAY/4D,MAAM/T,QAAW29D,sBAA4B39D,SAC1G,IAMA,KAAA+sE,sBAAwB,CAAO1B,WAAoB2B,aAAwB,2DAEvE,aADkB,wCAAAhkF,KAAI,oCACX+jF,sBAAsB1B,WAAY2B,YAAYj5D,MAAM/T,QAAW29D,sBAA4B39D,SAC1G,IAOQ,KAAAitE,qBAAuB,CAAO5B,WAAoB32D,MAAoC,2DAC1F,MAAMnoB,UAAY,wCAAAvD,KAAI,mCAChBm6E,QAAkB,OAARzuD,IAAeiR,KAAK/D,UAAUlN,KAAO,KACrD,OAAOnoB,IAAI2gF,kBAAkB7B,WAAYlI,SAASpvD,MAAM/T,QAAW29D,sBAA4B39D,SACnG,IAOA,KAAAktE,kBAAoB,CAAO7B,WAAoB32D,MAA6B,2DACxE,OAAO1rB,KAAKikF,qBAAqB5B,WAAY32D,IACjD,IAMA,KAAAy4D,qBAA8B9B,YAAuB,2DACjD,OAAOriF,KAAKikF,qBAAqB5B,WAAY,KACjD,IA1LI,wCAAAriF,KAAI,8BAAcw1E,UAAS,IAC/B,s8CCXG,MAAM4O,eASTp8E,YAAYwtE,WALZ,2CAaQ,KAAA6O,QAAiBxE,MAAmB,uDAExC,aADkB,oCAAA7/E,KAAI,gCACXqkF,QAAQxE,MAAM90D,MAAM/T,QAAW29D,sBAA4B39D,SAC1E,IAKA,KAAAstE,gBAAkB,IAAY,uDAE1B,aADkB,oCAAAtkF,KAAI,gCACXskF,kBAAkBv5D,MAAM/T,QAAW29D,sBAAgC39D,SAClF,IAKA,KAAAutE,cAAgB,IAAY,uDACxB,OAAOvkF,KAAKqkF,QAAQ1F,SAAS6F,OACjC,IAKA,KAAAC,YAAc,IAAY,uDACtB,OAAOzkF,KAAKqkF,QAAQ1F,SAAS+F,KACjC,IAKA,KAAAC,YAAc,IAAY,6DAChB3kF,KAAKqkF,QAAQ1F,SAASiG,KAChC,IAKA,KAAAC,iBAAmB,IAAY,uDAC3B,OAAO7kF,KAAKqkF,QAAQ1F,SAASmG,WACjC,IAKA,KAAAC,kBAAoB,IAAY,uDAC5B,OAAO/kF,KAAKqkF,QAAQ1F,SAASqG,YACjC,IAKA,KAAAC,iBAAmB,IAAY,uDAC3B,OAAOjlF,KAAKqkF,QAAQ1F,SAASuG,WACjC,IAKA,KAAAC,oBAAsB,IAAY,uDAC9B,OAAOnlF,KAAKqkF,QAAQ1F,SAASyG,cACjC,IAKA,KAAAC,oBAAsB,IAAY,uDAC9B,OAAOrlF,KAAKqkF,QAAQ1F,SAAS2G,cACjC,IA1EI,oCAAAtlF,KAAI,0BAAcw1E,UAAS,IAC/B,89CCZG,MAAM+P,sBASTv9E,YAAYu0E,UALZ,kDAaA,KAAAiJ,KAAO,IAAY,8DAEf,aADkB,2CAAAxlF,KAAI,uCACXwlF,OAAOz6D,MAAM/T,QAAW29D,sBAA4B39D,SACnE,IAMA,KAAAyuE,KAAO,IAAY,8DAEf,aADkB,2CAAAzlF,KAAI,uCACXylF,OAAO16D,MAAM/T,QAAW29D,sBAA4B39D,SACnE,IAnBI,2CAAAhX,KAAI,iCAAcu8E,SAAQ,IAC9B,69CCVG,MAAMmJ,oBAST19E,YAAYwtE,WALZ,gDAaA,KAAAmQ,uBAAgCC,OAA+B,4DAE3D,aADkB,yCAAA5lF,KAAI,qCAEjB6lF,6BAA6BlpD,KAAK/D,UAAUgtD,QAC5C76D,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IASA,KAAA8uE,yBAA2B,IAAY,4DAEnC,aADkB,yCAAA9lF,KAAI,qCACX+lF,yBAAyBh7D,MAAM/T,QAAW29D,sBAA4B39D,SACrF,IAMA,KAAAgvE,qBAAuB,IAAY,4DAE/B,aADkB,yCAAAhmF,KAAI,qCAEjBgmF,uBACAj7D,MAAM/T,QAAW29D,sBAAyC39D,SACnE,IAnCI,yCAAAhX,KAAI,+BAAcw1E,UAAS,IAC/B,+9CCXG,MAAMyQ,qBASTj+E,YAAYwtE,WALZ,iDAaA,KAAA0Q,UAAY,IAAY,6DAEpB,aADkB,0CAAAlmF,KAAI,sCACXkmF,YAAYn7D,MAAM/T,QAAW29D,sBAAuC39D,SACnF,IAOA,KAAAmvE,aAAsBC,SAAoB,6DAEtC,aADkB,0CAAApmF,KAAI,sCACXmmF,aAAaC,SAASr7D,MAAM/T,QAAW29D,sBAAqC39D,SAC3F,IAMA,KAAAqvE,YAAc,IAAY,6DAEtB,aADkB,0CAAArmF,KAAI,sCACXqmF,cAAct7D,MAAM/T,QAAW29D,sBAA8B39D,SAC5E,IAOA,KAAAsvE,eAAwBF,SAAoB,6DAExC,aADkB,0CAAApmF,KAAI,sCACXsmF,eAAeF,SAASr7D,MAAM/T,QAAW29D,sBAA8B39D,SACtF,IAQA,KAAAuvE,WAAa,CAAO7C,MAAe8C,WAAuB,6DAEtD,aADkB,0CAAAxmF,KAAI,sCACXumF,WAAW7C,MAAO8C,UAAUz7D,MAAM/T,QAAW29D,sBAA4B39D,SACxF,IAQA,KAAAyvE,YAAc,CAAOx/D,GAAYxP,OAAiB,6DAE9C,aADkB,0CAAAzX,KAAI,sCACXymF,YAAYx/D,GAAIxP,MAAMsT,MAAM/T,QAAW29D,sBAA4B39D,SAClF,IAQA,KAAA0vE,YAAc,CAAOz/D,GAAY0/D,QAAuB,6DAEpD,aADkB,0CAAA3mF,KAAI,sCACX0mF,YAAYz/D,GAAI0V,KAAK/D,UAAU+tD,QAAQ57D,MAAM/T,QAAW29D,sBAA4B39D,SACnG,IAOA,KAAA4vE,YAAqB3/D,IAAe,6DAEhC,aADkB,0CAAAjnB,KAAI,sCACX4mF,YAAY3/D,IAAI8D,MAAM/T,QAAW29D,sBAA4B39D,SAC5E,IAlFI,0CAAAhX,KAAI,gCAAcw1E,UAAS,IAC/B,g/CCXG,MAAMqR,yBAST7+E,YAAYwtE,WALZ,qDAaA,KAAAsR,mBAAqB,IAAY,iEAE7B,aADkB,8CAAA9mF,KAAI,0CACX8mF,qBAAqB/7D,MAAM/T,QAAW29D,sBAAwC39D,SAC7F,IAOA,KAAA+vE,sBAA+BC,kBAA6B,iEAExD,aADkB,8CAAAhnF,KAAI,0CAEjB+mF,sBAAsBC,kBACtBj8D,MAAM/T,QAAW29D,sBAAsC39D,SAChE,IAMA,KAAAiwE,qBAAuB,IAAY,iEAE/B,aADkB,8CAAAjnF,KAAI,0CACXinF,uBAAuBl8D,MAAM/T,QAAW29D,sBAA8B39D,SACrF,IAOA,KAAAkwE,wBAAiCF,kBAA6B,iEAE1D,aADkB,8CAAAhnF,KAAI,0CACXknF,wBAAwBF,kBAAkBj8D,MAAM/T,QAAW29D,sBAA8B39D,SACxG,IAQA,KAAAmwE,qBAAuB,CAAOlgE,GAAYmgE,iBAAyC,iEAE/E,aADkB,8CAAApnF,KAAI,0CAEjBmnF,qBAAqBlgE,GAAI0V,KAAK/D,UAAUwuD,iBACxCr8D,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAQA,KAAAqwE,qBAAuB,CAAOpgE,GAAYxP,OAAiB,iEAEvD,aADkB,8CAAAzX,KAAI,0CACXqnF,qBAAqBpgE,GAAIxP,MAAMsT,MAAM/T,QAAW29D,sBAA4B39D,SAC3F,IAOA,KAAAswE,qBAA8BrgE,IAAe,iEAEzC,aADkB,8CAAAjnB,KAAI,0CACXsnF,qBAAqBrgE,IAAI8D,MAAM/T,QAAW29D,sBAA4B39D,SACrF,IAQA,KAAAuwE,oBAAsB,CAAO7D,MAAe8D,oBAAgC,iEAExE,aADkB,8CAAAxnF,KAAI,0CACXunF,oBAAoB7D,MAAO8D,mBAAmBz8D,MAAM/T,QAAW29D,sBAA4B39D,SAC1G,IAtFI,8CAAAhX,KAAI,oCAAcw1E,UAAS,IAC/B,yFCnBQiS,oBAKAC,UAKAC,OAMAC,UA4BAC,4BAkCAC,uBAKAC,uBAIAC,mBA+BAC,06CC5GL,MAAMC,wBASTlgF,YAAYwtE,WALZ,oDAcA,KAAA2S,SAAkBhyE,KAA6C,gEAE3D,aADkB,6CAAAnW,KAAI,yCACXooF,eAAejyE,KAAK4U,MAAM/T,QAAW29D,sBAA8B39D,SAClF,IAOA,KAAAqxE,SAAW,CAAOlyE,IAA0C8F,QAAkB,gEAE1E,aADkB,6CAAAjc,KAAI,yCACXsoF,eAAenyE,IAAK8F,OAAO8O,MAAM/T,QAAW29D,sBAA4B39D,SACvF,IArBI,6CAAAhX,KAAI,mCAAcw1E,UAAS,IAC/B,iDDrBJ,SAAYiS,qBACR,uDACA,kEACH,CAHD,CAAYA,sBAAAA,oBAAmB,KAK/B,SAAYC,WACR,sBACA,iCACH,CAHD,CAAYA,YAAAA,UAAS,KAKrB,SAAYC,QACR,mBACA,2BACA,cACH,CAJD,CAAYA,SAAAA,OAAM,KAMlB,SAAYC,WACR,0BACA,2BACH,CAHD,CAAYA,YAAAA,UAAS,KA4BrB,SAAYC,6BACR,qCACH,CAFD,CAAYA,8BAAAA,4BAA2B,KAIhC,MAAMU,iBAITvgF,YACIwgF,MACAC,gBACAC,QACAC,aAEA3oF,KAAKyX,KAAO,GAAG+wE,SAASC,kBACxBzoF,KAAKic,MAAQ,GAAGysE,WAAWC,aAC/B,GAkBJ,SAAYb,wBACR,qCACA,0CACH,CAHD,CAAYA,yBAAAA,uBAAsB,KAKlC,SAAYC,wBACR,qCACH,CAFD,CAAYA,yBAAAA,uBAAsB,KAIlC,SAAYC,oBAKR,qCAKA,mCAMA,qCAMA,iCAMA,gCACH,CA7BD,CAAYA,qBAAAA,mBAAkB,KA+B9B,SAAYC,oBASR,+CAKA,6CAOA,mDAMA,sCACH,CA5BD,CAAYA,qBAAAA,mBAAkB,+EEtHlBW,q7CCwBL,MAAMC,yBAUT7gF,YAAYwtE,WANZ,qDACA,mDAiBA,KAAAsT,MAAQ,CAAOvO,YAAqBwO,aAA4B38C,UAAsB,iEAElF,aADkB,8CAAApsC,KAAI,0CAEjBgpF,oBAAoBzO,YAAa59C,KAAK/D,UAAUmwD,cAAepsD,KAAK/D,UAAUwT,UAC9ErhB,MAAM/T,QAAW29D,sBAAwC39D,SAClE,IASA,KAAAiyE,OAAS,CAAO1O,YAAqB2O,UAAoB,iEAErD,aADkB,8CAAAlpF,KAAI,0CACXmpF,qBAAqB5O,YAAa2O,SAASn+D,MAAM/T,QAAW29D,sBAA6B39D,SACxG,IAWA,KAAAoyE,SAAW,CACP7O,YACA2O,QACAG,aACAj9C,UACsB,iEAEtB,aADkB,8CAAApsC,KAAI,wCAEjBspF,uBAAuB/O,YAAa2O,QAASG,aAAc1sD,KAAK/D,UAAUwT,UAC1ErhB,MAAM/T,SAAU,OAAC,OAAsB,QAAtB,GAACA,cAAqB,UAAKA,MAA+B,GACpF,IASA,KAAAuyE,OAAS,CAAOhP,YAAqB2O,QAAiBM,OAAqB,iEAEvE,aADkB,8CAAAxpF,KAAI,0CAEjBypF,qBAAqBlP,YAAa2O,QAASM,MAC3Cz+D,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAOA,KAAAk5D,OAAS,CAAOqK,YAAqB2O,UAAoB,iEAErD,aADkB,8CAAAlpF,KAAI,0CACX0pF,qBAAqBnP,YAAa2O,SAASn+D,MAAM/T,QAAW29D,sBAA4B39D,SACvG,IASA,KAAAhC,KAAO,CAAOulE,YAAqB2O,QAAiBS,UAAoB,iEAEpE,aADkB,8CAAA3pF,KAAI,0CAEjB4pF,mBAAmBrP,YAAa2O,QAASS,SACzC5+D,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAQA,KAAA6yE,gBAAyBtP,aAAwB,iEAE7C,aADkB,8CAAAv6E,KAAI,0CAEjB8pF,8BAA8BvP,aAC9BxvD,MAAM/T,QAAW29D,sBAAwC39D,SAClE,IAQA,KAAA+yE,mBAA4BxP,aAAwB,iEAEhD,aADkB,8CAAAv6E,KAAI,0CAEjBgqF,iCAAiCzP,aACjCxvD,MAAM/T,QAAW29D,sBAAwC39D,SAClE,IAOA,KAAAizE,gBAAyB1P,aAAwB,iEAE7C,aADkB,8CAAAv6E,KAAI,0CAEjBkqF,8BAA8B3P,aAC9BxvD,MAAM/T,QAAW29D,sBAA6C39D,SACvE,IAMA,KAAAmzE,yBAA4BC,gBACpBA,iBAAmB3C,oBAAoB4C,KAAa3C,UAAU2C,KAC9DD,iBAAmB3C,oBAAoB6C,WAAmB5C,UAAU4C,gBAAxE,EArIA,8CAAAtqF,KAAI,oCAAcw1E,UAAS,KAC3B,8CAAAx1E,KAAI,kCAAYw1E,UAAuC,IAC3D,gGDrCJ,SAAYoT,4BACR,0EACA,+DACA,mEACA,8DACH,CALD,CAAYA,6BAAAA,2BAA0B,08CEQ/B,MAAM2B,eASTviF,YAAYwtE,WALZ,2CAaA,KAAAgV,SAAW,IAAY,uDAEnB,aADkB,oCAAAxqF,KAAI,gCACXwqF,WAAWz/D,MAAM/T,QAAW29D,sBAAsC39D,SACjF,IAOA,KAAAyzE,YAAqBC,QAAe,uDAEhC,aADkB,oCAAA1qF,KAAI,gCACXyqF,YAAYC,QAAQ3/D,MAAM/T,QAAW29D,sBAAoC39D,SACxF,IAQA,KAAA2zE,eAAiB,IAAY,uDAEzB,aADkB,oCAAA3qF,KAAI,gCACX2qF,iBAAiB5/D,MAAM/T,QAAW29D,sBAAoC39D,SACrF,IAOA,KAAA4zE,WAAoB3jE,IAAW,uDAE3B,aADkB,oCAAAjnB,KAAI,gCACX4qF,WAAW3jE,IAAI8D,MAAM/T,QAAW29D,sBAA4B39D,SAC3E,IAQA,KAAA6zE,QAAU,CAAOtQ,YAAiBuQ,OAA0B,uDAExD,aADkB,oCAAA9qF,KAAI,gCACX6qF,QAAQtQ,YAAa59C,KAAK/D,UAAUkyD,OAAO//D,MAAM/T,QAAW29D,sBAA4B39D,SACvG,IAOA,KAAA+zE,WAAoBC,SAAoB,uDAEpC,aADkB,oCAAAhrF,KAAI,gCACX+qF,WAAWC,SAASjgE,MAAM/T,QAAW29D,sBAA+B39D,SACnF,IA9DI,oCAAAhX,KAAI,0BAAcw1E,UAAS,IAC/B,ohDCIG,MAAMyV,oBASTjjF,YAAYwtE,WALZ,gDAeA,KAAA0V,kBAA2BC,cAAwC,4DAE/D,aADkB,yCAAAnrF,KAAI,qCAEjBkrF,kBAAkBvuD,KAAK/D,UAAUuyD,eACjCpgE,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAQA,KAAAo0E,UAAY,CACR7Q,YACA8Q,wBACC,4DACD,MAAM9nF,UAAY,yCAAAvD,KAAI,oCAMtB,aAJMA,KAAKsrF,sBAAsB/Q,mBAE3B8Q,sBAAsB,IAAIE,sBAAsBhR,YAAah3E,MAE5DA,IAAIioF,6BAA6BjR,aAAaxvD,MAAM/T,QAAW29D,sBAA4B39D,SACtG,IAOA,KAAAy0E,SAAkBlR,aAAwB,4DAEtC,aADkB,yCAAAv6E,KAAI,qCACX0rF,kBAAkBnR,aAAaxvD,MAAM/T,QAAW29D,sBAAsC39D,SACrG,IASA,KAAAs0E,sBAAwB,CAAO/Q,YAAqBoR,oBAAsB,MAAwC,4DAE9G,IAAI5+D,QAAU5sB,KAAK2G,IAAI6kF,oBAAqB,KAG5C5+D,QAAU5sB,KAAK0G,IAAIkmB,QAAS,KAG5B,IAAI6+D,QAAU,EAEd,IAGI,KANa,IAMNA,QAAqB7+D,SAAS,CACjC,MAAM/V,aAAehX,KAAKyrF,SAASlR,aAEnC,GACIvjE,OAAO89D,SACP99D,OAAO69D,aACN79D,OAAO69D,WAAW94D,OAASisE,mBAAmB6D,SAC3C70E,OAAO69D,WAAW94D,OAASisE,mBAAmB8D,OAElD,OAAOnX,sBACH,CAAEx6D,KAAM,KAAM26D,SAAS,EAAMpsD,WAAOvnB,EAAWi+E,OAAQ,EAAGvK,gBAAY1zE,IACtE,SAIF,IAAI0nB,SAASC,SAAYmE,WAAWnE,QArBjC,OAsBT8iE,WAEN,MAAOtsE,KACL,OAAOq1D,sBACH,CACIx6D,KAAM,KACN26D,SAAS,EACTpsD,MAAO,uCAAuCpJ,MAC9C8/D,OAAQ,IACRvK,gBAAY1zE,IAEhB,GAIR,OAAOwzE,sBACH,CACIx6D,KAAM,KACN26D,SAAS,EACTpsD,MAAO,kCACP02D,OAAQ,IACRvK,gBAAY1zE,IAEhB,EAER,IA1GI,yCAAAnB,KAAI,+BAAcw1E,UAAS,IAC/B,6CA+GJ,MAAM+V,sBAUFvjF,YAAYuyE,YAAqBh3E,KANjC,oDACA,4CAeA,KAAAwoF,WAAoB1gE,SAA8B,4DAC9C,OAAO,yCAAArrB,KAAI,gCACNgsF,oBAAoB,yCAAAhsF,KAAI,wCAAe28B,KAAK/D,UAAUvN,UACtDN,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IASA,KAAAi1E,YAAqBC,UAAiC,4DAOlD,OAAOvX,4BANc,yCAAA30E,KAAI,gCAAMmsF,qBAC3B,yCAAAnsF,KAAI,wCACJksF,SAASpvE,KAAI,SAAUhT,GACnB,OAAO6yB,KAAK/D,UAAU9uB,EAC1B,KAGR,IAOA,KAAAsiF,cAAuB5hB,OAAkB,4DACrC,OAAO,yCAAAxqE,KAAI,gCACNqsF,qCAAqC,yCAAArsF,KAAI,wCAAewqE,OACxDz/C,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IASA,KAAAs1E,cAAgB,CAAOC,WAAoBC,cAAwB,4DAC/D,OAAO,yCAAAxsF,KAAI,gCACNysF,qCAAqC,yCAAAzsF,KAAI,wCAAeusF,WAAYC,aACpEzhE,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAtDI,yCAAAhX,KAAI,mCAAgBu6E,YAAW,KAC/B,yCAAAv6E,KAAI,2BAAQuD,IAAG,IACnB,ujDCtIG,MAAMmpF,wBAUT1kF,YAAYwtE,WANZ,oDACA,kDAiBA,KAAAsT,MAAQ,CAAOvO,YAAqBwO,aAA4B38C,UAAsB,gEAElF,aADkB,6CAAApsC,KAAI,yCAEjB2sF,mBAAmBpS,YAAa59C,KAAK/D,UAAUmwD,cAAepsD,KAAK/D,UAAUwT,UAC7ErhB,MAAM/T,QAAW29D,sBAAuC39D,SACjE,IASA,KAAAiyE,OAAS,CAAO1O,YAAqBmQ,SAAmB,gEAEpD,aADkB,6CAAA1qF,KAAI,yCACX4sF,oBAAoBrS,YAAamQ,QAAQ3/D,MAAM/T,QAAW29D,sBAA4B39D,SACrG,IAWA,KAAAoyE,SAAW,CACP7O,YACAsS,OACAxD,aACAj9C,UACsB,gEAEtB,aADkB,6CAAApsC,KAAI,uCAEjB8sF,sBAAsBvS,YAAasS,OAAQxD,aAAc1sD,KAAK/D,UAAUwT,UACxErhB,MAAM/T,SAAU,OAAC,OAAsB,QAAtB,GAACA,cAAqB,UAAKA,MAA+B,GACpF,IASA,KAAAuyE,OAAS,CAAOhP,YAAqBsS,OAAgBrD,OAAqB,gEAEtE,aADkB,6CAAAxpF,KAAI,yCACX+sF,oBAAoBxS,YAAasS,OAAQrD,MAAMz+D,MAAM/T,QAAW29D,sBAA4B39D,SAC3G,IAOA,KAAAk5D,OAAS,CAAOqK,YAAqBsS,SAAmB,gEAEpD,aADkB,6CAAA7sF,KAAI,yCACXgtF,oBAAoBzS,YAAasS,QAAQ9hE,MAAM/T,QAAW29D,sBAA4B39D,SACrG,IASA,KAAAhC,KAAO,CAAOulE,YAAqBsS,OAAgBlD,UAAoB,gEAEnE,aADkB,6CAAA3pF,KAAI,yCAEjBitF,kBAAkB1S,YAAasS,OAAQlD,SACvC5+D,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAQA,KAAA6yE,gBAAyBtP,aAAwB,gEAE7C,aADkB,6CAAAv6E,KAAI,yCAEjBktF,6BAA6B3S,aAC7BxvD,MAAM/T,QAAW29D,sBAAwC39D,SAClE,IAQA,KAAA+yE,mBAA4BxP,aAAwB,gEAEhD,aADkB,6CAAAv6E,KAAI,yCAEjBmtF,gCAAgC5S,aAChCxvD,MAAM/T,QAAW29D,sBAAwC39D,SAClE,IAOA,KAAAizE,gBAAyB1P,aAAwB,gEAE7C,aADkB,6CAAAv6E,KAAI,yCAEjBotF,6BAA6B7S,aAC7BxvD,MAAM/T,QAAW29D,sBAA6C39D,SACvE,IAMA,KAAAq2E,wBAA2BjD,gBACnBA,iBAAmB3C,oBAAoB4C,KAAa3C,UAAU2C,KAC9DD,iBAAmB3C,oBAAoB6C,WAAmB5C,UAAU4C,gBAAxE,EAnIA,6CAAAtqF,KAAI,mCAAcw1E,UAAS,KAC3B,6CAAAx1E,KAAI,iCAAYw1E,UAAuC,IAC3D,ghDC3BG,MAAM8X,qBASTtlF,YAAYwtE,WALZ,iDAeA,KAAA+X,2BAA6B,CAAOrT,aAAkBmI,aAAuB,6DACzE,MAAM9+E,UAAY,0CAAAvD,KAAI,qCAChB0rB,IAAgC,CAAE22D,WAAwB3H,WAAY3F,oBAAoByY,UAChG,OAAOjqF,IACF62E,eAAeF,aAAcv9C,KAAK/D,UAAUlN,MAC5CX,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAQA,KAAAy2E,mBAA4BpL,YAAmB,6DAE3C,aADkB,0CAAAriF,KAAI,sCACXytF,mBAAmBpL,YAAYt3D,MAAM/T,QAAW29D,sBAA4B39D,SAC3F,IAOA,KAAA02E,kBAA2B7V,SAAgB,6DAEvC,aADkB,0CAAA73E,KAAI,sCACX0tF,kBAAkB7V,SAAS9sD,MAAM/T,QAAW29D,sBAA4B39D,SACvF,IAMA,KAAA22E,iBAAmB,IAAY,6DAE3B,aADkB,0CAAA3tF,KAAI,sCACX2tF,mBAAmB5iE,MAAM/T,QAAW29D,sBAA4B39D,SAC/E,IA7CI,0CAAAhX,KAAI,gCAAcw1E,UAAS,IAC/B,g/CCbG,MAAMoY,yBAST5lF,YAAYwtE,WALZ,qDAaA,KAAAqY,mBAAqB,IAAY,iEAE7B,aADkB,8CAAA7tF,KAAI,0CACX6tF,qBAAqB9iE,MAAM/T,QAAW29D,sBAAwC39D,SAC7F,IAOA,KAAA82E,sBAA+BC,kBAAyB,iEAEpD,aADkB,8CAAA/tF,KAAI,0CAEjB8tF,sBAAsBC,kBACtBhjE,MAAM/T,QAAW29D,sBAAsC39D,SAChE,IAMA,KAAAg3E,qBAAuB,IAAY,iEAE/B,aADkB,8CAAAhuF,KAAI,0CACXguF,uBAAuBjjE,MAAM/T,QAAW29D,sBAA8B39D,SACrF,IAQA,KAAAi3E,qBAAuB,CAAOhnE,GAAQinE,iBAAyC,iEAE3E,aADkB,8CAAAluF,KAAI,0CAEjBiuF,qBAAqBhnE,GAAI0V,KAAK/D,UAAUs1D,iBACxCnjE,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IAOA,KAAAm3E,qBAA8BlnE,IAAW,iEAErC,aADkB,8CAAAjnB,KAAI,0CACXmuF,qBAAqBlnE,IAAI8D,MAAM/T,QAAW29D,sBAA4B39D,SACrF,IAOA,KAAAo3E,wBAAiCL,kBAAyB,iEAEtD,aADkB,8CAAA/tF,KAAI,0CACXouF,wBAAwBL,kBAAkBhjE,MAAM/T,QAAW29D,sBAA8B39D,SACxG,IAQA,KAAAq3E,qBAAuB,CAAOpnE,GAAQxP,OAAiB,iEAEnD,aADkB,8CAAAzX,KAAI,0CACXquF,qBAAqBpnE,GAAIxP,MAAMsT,MAAM/T,QAAW29D,sBAA4B39D,SAC3F,IA3EI,8CAAAhX,KAAI,oCAAcw1E,UAAS,IAC/B,kFCwDQ8Y,qBAiDAC,oBAgEAC,+4CCrLL,MAAMC,iBASTzmF,YAAYwtE,WALZ,6CAoBA,KAAAkZ,WAAa,CACTlX,OACAnI,KACA9mC,IACAsxC,MACAC,SACC,yDAED,aADkB,sCAAA95E,KAAI,kCACX0uF,WAAWlX,OAAQnI,KAAM9mC,IAAKsxC,MAAOC,QAAQ/uD,MAAM/T,QAAW29D,sBAA4B39D,SACzG,IAMA,KAAA23E,kBAAoB,IAAY,yDAE5B,aADkB,sCAAA3uF,KAAI,kCACX2uF,oBAAoB5jE,MAAM/T,QAAW29D,sBAA8B39D,SAClF,IAMA,KAAA43E,kBAA2BC,aAAwB,yDAE/C,aADkB,sCAAA7uF,KAAI,kCACX4uF,kBAAkBC,aAAa9jE,MAAM/T,QAAW29D,sBAA4B39D,SAC3F,IAzCI,sCAAAhX,KAAI,4BAAcw1E,UAAS,IAC/B,0CDyDJ,SAAY8Y,sBACR,+BACA,mDACA,wCACH,CAJD,CAAYA,uBAAAA,qBAAoB,KAiDhC,SAAYC,qBACR,8BACA,iCACH,CAHD,CAAYA,sBAAAA,oBAAmB,KAgE/B,SAAYC,cACR,+BACA,gCACH,CAHD,CAAYA,eAAAA,aAAY,qCE1LZM,gBAWAC,gBAKAC,UAMAC,WAaAC,8BCoBAC,WCzDAC,wBAkBAC,aCfAC,YAKAC,UAOAC,aAKAC,KAKAC,UA2EAC,gBAOAC,0BAMAC,mBCjHAC,UAqEAC,eCnEAC,kBCAAC,iBCGAC,o5CCGL,MAAMC,iBASTnoF,YAAYwtE,WALZ,6CAaA,KAAA4a,aAAe,IAAY,yDAEvB,aADkB,sCAAApwF,KAAI,kCACXowF,eAAerlE,MAAM/T,QAAW29D,sBAA0B39D,SACzE,IAOA,KAAAq5E,aAAsBC,UAAiB,yDAEnC,aADkB,sCAAAtwF,KAAI,kCACXqwF,aAAaC,UAAUvlE,MAAM/T,QAAW29D,sBAA4B39D,SACnF,IAQA,KAAAu5E,mBAAqB,CAAOD,SAAcE,SAAmB,yDAEzD,aADkB,sCAAAxwF,KAAI,kCACXuwF,mBAAmBD,SAAUE,QAAQzlE,MAAM/T,QAAW29D,sBAA4B39D,SACjG,IAQA,KAAAy5E,qBAAuB,CAAOH,SAAcI,WAA8B,yDAEtE,aADkB,sCAAA1wF,KAAI,kCAEjBywF,qBAAqBH,SAAU3zD,KAAK/D,UAAU83D,WAC9C3lE,MAAM/T,QAAW29D,sBAA4B39D,SACtD,IA5CI,sCAAAhX,KAAI,4BAAcw1E,UAAS,IAC/B,ECqHJ,IAAImb,mDTtIJ,SAAY7B,iBACR,0BACA,4BACA,8BACA,gCACA,kCACA,oCACA,wCACA,yCACH,CATD,CAAYA,kBAAAA,gBAAe,KAW3B,SAAYC,iBACR,wCACA,mCACH,CAHD,CAAYA,kBAAAA,gBAAe,KAK3B,SAAYC,WACR,0BACA,4BACA,+BACH,CAJD,CAAYA,YAAAA,UAAS,KAMrB,SAAYC,YACR,iCACA,yBACA,6BACA,6BACA,uBACA,qCACA,+BACA,6BACA,2BACA,sBACH,CAXD,CAAYA,aAAAA,WAAU,KAatB,SAAYC,+BACR,8CACA,4CACA,oDACA,oDACA,4CACA,sDACA,kDACA,sDACA,4CACA,yCACH,CAXD,CAAYA,gCAAAA,8BAA6B,KCoBzC,SAAYC,YACR,qBACA,wBACH,CAHD,CAAYA,aAAAA,WAAU,KCzDtB,SAAYC,yBACR,kCACA,uDACH,CAHD,CAAYA,0BAAAA,wBAAuB,KAkBnC,SAAYC,cACR,mCACA,iCACA,2BACA,0BACH,CALD,CAAYA,eAAAA,aAAY,KCfxB,SAAYC,aACR,wBACA,4BACA,6BACH,CAJD,CAAYA,cAAAA,YAAW,KAKvB,SAAYC,WACR,sBACA,0BACA,wBACA,2BACH,CALD,CAAYA,YAAAA,UAAS,KAOrB,SAAYC,cACR,uBACA,6BACA,4BACH,CAJD,CAAYA,eAAAA,aAAY,KAKxB,SAAYC,MACR,+BACA,+BACA,oBACH,CAJD,CAAYA,OAAAA,KAAI,KAKhB,SAAYC,WACR,oCACA,gCACA,yBACH,CAJD,CAAYA,YAAAA,UAAS,KA2ErB,SAAYC,iBACR,4BACA,gCACA,8BACA,iCACH,CALD,CAAYA,kBAAAA,gBAAe,KAO3B,SAAYC,2BACR,4CACA,sDACA,iDACH,CAJD,CAAYA,4BAAAA,0BAAyB,KAMrC,SAAYC,oBACR,gDACA,gDACA,yCACA,0CACA,wCACA,kDACA,4CACA,0CACA,kDACA,sDACA,qDACA,yCACA,6CACA,0CACA,iCACA,yDACA,8CACA,uDACA,0CACA,oCACH,CArBD,CAAYA,qBAAAA,mBAAkB,KCjH9B,SAAYC,WACR,oBACA,sBACA,oBACA,sBACA,oBACA,oBACA,8BACA,4BACA,yBACH,CAVD,CAAYA,YAAAA,UAAS,KAqErB,SAAYC,gBAIR,6BAIA,kCACH,CATD,CAAYA,iBAAAA,eAAc,KCnE1B,SAAYC,mBACR,+CACA,gDACH,CAHD,CAAYA,oBAAAA,kBAAiB,KCA7B,SAAYC,kBACR,qCACA,qCACH,CAHD,CAAYA,mBAAAA,iBAAgB,KCG5B,SAAYC,mBAIR,gEAMA,0CAKA,oDAMA,kDAKA,6DACH,CA3BD,CAAYA,oBAAAA,kBAAiB,KEuItB,MAAMU,IAuCT5oF,YAAYiM,QAqCZ,KAAA48E,WAAa,KACT,UACI7wF,KAAKiU,OAAO2Z,YAhFE,sDAiFd,CACIqB,iBAAkBjvB,KAAK8wF,WAAW7hE,iBAClCE,eAAgBnvB,KAAK8wF,WAAW3hE,eAChCE,iBAAkBrvB,KAAK8wF,WAAWzhE,iBAClCE,8BAA+BvvB,KAAK8wF,WAAWvhE,8BAC/CE,6BAA8BzvB,KAAK8wF,WAAWrhE,6BAC9CE,kCAAmC3vB,KAAK8wF,WAAWnhE,kCACnDE,uBAAwB7vB,KAAK8wF,WAAWjhE,uBACxCE,0BAA2B/vB,KAAK8wF,WAAWrR,2BAC3CxvD,yBAA0BjwB,KAAK8wF,WAAWtR,mBAC1CnvD,sBAAuBrwB,KAAK8wF,WAAWzgE,sBACvCF,sBAAuBnwB,KAAK8wF,WAAW3gE,sBACvCI,mBAAoBvwB,KAAK8wF,WAAWvgE,mBACpCE,8BAA+BzwB,KAAK8wF,WAAWrgE,8BAC/CE,2BAA4B3wB,KAAK8wF,WAAWngE,2BAC5CE,gBAAiB7wB,KAAK8wF,WAAWjgE,gBACjCE,yBAA0B/wB,KAAK8wF,WAAW//D,yBAC1CE,yBAA0BjxB,KAAK8wF,WAAW7/D,yBAC1CE,eAAgBnxB,KAAK8wF,WAAW3/D,eAChCE,0BAA2BrxB,KAAK8wF,WAAWz/D,0BAC3CE,iBAAkBvxB,KAAK8wF,WAAWv/D,iBAClCE,iBAAkBzxB,KAAK8wF,WAAWr/D,iBAClCE,cAAe3xB,KAAK8wF,WAAWn/D,cAC/BE,kBAAmB7xB,KAAK8wF,WAAWj/D,kBACnCE,2BAA4B/xB,KAAK8wF,WAAW/+D,4BAEhD/xB,KAAKquB,cACLruB,KAAKiU,OAAOqa,UAEhBtuB,KAAKw1E,UAAYmb,sBAAU,EAAVA,WAAY9jE,QAAQ9B,MAAMyqD,WAChCA,YAGXx1E,KAAK+wF,OAAS,IAAIZ,iBAAiBnwF,KAAKw1E,WACxCx1E,KAAKgxF,OAAS,IAAI5T,iBAAiBp9E,KAAKw1E,WACxCx1E,KAAK2/E,MAAQ,IAAIvI,gBAAgBp3E,KAAKw1E,WACtCx1E,KAAK48E,UAAY,IAAIN,oBAAoBt8E,KAAKw1E,WAC9Cx1E,KAAKisB,SAAW,IAAIw0D,mBAAmBzgF,KAAKw1E,WAC5Cx1E,KAAKixF,cAAgB,IAAI/I,wBAAwBloF,KAAKw1E,WACtDx1E,KAAKwtF,SAAW,IAAItL,mBAAmBliF,KAAKw1E,WAC5Cx1E,KAAKkxF,MAAQ,IAAIhS,gBACjBl/E,KAAK6/E,KAAO,IAAIuE,eAAepkF,KAAKw1E,WACpCx1E,KAAKmxF,KAAO,IAAItS,eAAe7+E,KAAKw1E,WACpCx1E,KAAKsrB,MAAQ,IAAIu2D,gBAAgB7hF,KAAKw1E,WACtCx1E,KAAKoxF,YAAc,IAAI7L,sBAAsBvlF,KAAKw1E,WAClDx1E,KAAKqxF,cAAgB,IAAI3L,oBAAoB1lF,KAAKw1E,WAClDx1E,KAAKsxF,WAAa,IAAIrL,qBAAqBjmF,KAAKw1E,WAChDx1E,KAAKonF,eAAiB,IAAIP,yBAAyB7mF,KAAKw1E,WACxDx1E,KAAKkuF,eAAiB,IAAIN,yBAAyB5tF,KAAKw1E,WACxDx1E,KAAKuxF,eAAiB,IAAI1I,yBAAyB7oF,KAAKw1E,WACxDx1E,KAAKwxF,cAAgB,IAAI9E,wBAAwB1sF,KAAKw1E,WACtDx1E,KAAK26E,UAAY,IAAIsQ,oBAAoBjrF,KAAKw1E,WAC9Cx1E,KAAK8qF,KAAO,IAAIP,eAAevqF,KAAKw1E,WACpCx1E,KAAKyxF,WAAa,IAAInE,qBAAqBttF,KAAKw1E,WAChDx1E,KAAK0xF,OAAS,IAAIjD,iBAAiBzuF,KAAKw1E,WACxCx1E,KAAK2xF,MAAQ,IAAIpc,gBAAgBv1E,KAAKw1E,WAKtCx1E,KAAKixF,cAAc5I,SAASO,2BAA2BgJ,sBAAuB,4BAQ9E5xF,KAAKixF,cAAc5I,SACfO,2BAA2BiJ,wBAC3B7xF,KAAKiU,OAAO69E,cAAgBtD,aAAahrB,SAC5C,EAGL,KAAAn1C,cAAiB0jE,gBACbpB,WAAaoB,aAAa,EAlH1B/xF,KAAKiU,OAASA,OACdjU,KAAK2wF,WAAaA,WAClB3wF,KAAKw1E,UAAYmb,sBAAU,EAAVA,WAAY9jE,QAAQ9B,MAAMoO,OAChCA,QAGXn5B,KAAK+wF,OAAS,IAAIZ,iBAAiBnwF,KAAKw1E,WACxCx1E,KAAKgxF,OAAS,IAAI5T,iBAAiBp9E,KAAKw1E,WACxCx1E,KAAK2/E,MAAQ,IAAIvI,gBAAgBp3E,KAAKw1E,WACtCx1E,KAAK2xF,MAAQ,IAAIpc,gBAAgBv1E,KAAKw1E,WACtCx1E,KAAK26E,UAAY,IAAIsQ,oBAAoBjrF,KAAKw1E,WAC9Cx1E,KAAKuxF,eAAiB,IAAI1I,yBAAyB7oF,KAAKw1E,WACxDx1E,KAAKwxF,cAAgB,IAAI9E,wBAAwB1sF,KAAKw1E,WACtDx1E,KAAK48E,UAAY,IAAIN,oBAAoBt8E,KAAKw1E,WAC9Cx1E,KAAKisB,SAAW,IAAIw0D,mBAAmBzgF,KAAKw1E,WAC5Cx1E,KAAKixF,cAAgB,IAAI/I,wBAAwBloF,KAAKw1E,WACtDx1E,KAAKwtF,SAAW,IAAItL,mBAAmBliF,KAAKw1E,WAC5Cx1E,KAAKkxF,MAAQ,IAAIhS,gBACjBl/E,KAAK8wF,WAAa,IAAIzR,qBAAqBr/E,KAAKiU,QAChDjU,KAAK6/E,KAAO,IAAIuE,eAAepkF,KAAKw1E,WACpCx1E,KAAKmxF,KAAO,IAAItS,eAAe7+E,KAAKw1E,WACpCx1E,KAAKsrB,MAAQ,IAAIu2D,gBAAgB7hF,KAAKw1E,WACtCx1E,KAAKoxF,YAAc,IAAI7L,sBAAsBvlF,KAAKw1E,WAClDx1E,KAAKqxF,cAAgB,IAAI3L,oBAAoB1lF,KAAKw1E,WAClDx1E,KAAKsxF,WAAa,IAAIrL,qBAAqBjmF,KAAKw1E,WAChDx1E,KAAKonF,eAAiB,IAAIP,yBAAyB7mF,KAAKw1E,WACxDx1E,KAAKkuF,eAAiB,IAAIN,yBAAyB5tF,KAAKw1E,WACxDx1E,KAAK8qF,KAAO,IAAIP,eAAevqF,KAAKw1E,WACpCx1E,KAAKyxF,WAAa,IAAInE,qBAAqBttF,KAAKw1E,WAChDx1E,KAAK0xF,OAAS,IAAIjD,iBAAiBzuF,KAAKw1E,UAC5C,EAwFJ","sources":["webpack://ChiliEditorSDK/webpack/universalModuleDefinition","webpack://ChiliEditorSDK/./node_modules/complex.js/complex.js","webpack://ChiliEditorSDK/./node_modules/decimal.js/decimal.js","webpack://ChiliEditorSDK/./node_modules/escape-latex/dist/index.js","webpack://ChiliEditorSDK/./node_modules/fraction.js/fraction.js","webpack://ChiliEditorSDK/./node_modules/tiny-emitter/index.js","webpack://ChiliEditorSDK/./node_modules/typed-function/typed-function.js","webpack://ChiliEditorSDK/webpack/bootstrap","webpack://ChiliEditorSDK/webpack/runtime/define property getters","webpack://ChiliEditorSDK/webpack/runtime/hasOwnProperty shorthand","webpack://ChiliEditorSDK/webpack/runtime/make namespace object","webpack://ChiliEditorSDK/./node_modules/penpal/lib/enums.js","webpack://ChiliEditorSDK/./node_modules/penpal/lib/createDestructor.js","webpack://ChiliEditorSDK/./node_modules/penpal/lib/parent/getOriginFromSrc.js","webpack://ChiliEditorSDK/./node_modules/penpal/lib/errorSerialization.js","webpack://ChiliEditorSDK/./node_modules/penpal/lib/generateId.js","webpack://ChiliEditorSDK/./node_modules/penpal/lib/methodSerialization.js","webpack://ChiliEditorSDK/./node_modules/penpal/lib/connectCallSender.js","webpack://ChiliEditorSDK/./node_modules/penpal/lib/parent/handleAckMessageFactory.js","webpack://ChiliEditorSDK/./node_modules/penpal/lib/connectCallReceiver.js","webpack://ChiliEditorSDK/./node_modules/penpal/lib/parent/connectToChild.js","webpack://ChiliEditorSDK/./node_modules/penpal/lib/createLogger.js","webpack://ChiliEditorSDK/./node_modules/penpal/lib/parent/validateIframeHasSrcOrSrcDoc.js","webpack://ChiliEditorSDK/./node_modules/penpal/lib/parent/handleSynMessageFactory.js","webpack://ChiliEditorSDK/./node_modules/penpal/lib/startConnectionTimeout.js","webpack://ChiliEditorSDK/./node_modules/penpal/lib/parent/monitorIframeRemoval.js","webpack://ChiliEditorSDK/./src/interactions/connector.ts","webpack://ChiliEditorSDK/./node_modules/mathjs/node_modules/@babel/runtime/helpers/esm/extends.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/is.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/object.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/factory.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/number.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/bignumber/formatter.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/string.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/error/DimensionError.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/error/IndexError.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/array.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/error/ArgumentsError.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/core/function/import.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/core/config.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/core/function/config.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/keywords.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/customs.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/map.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/Node.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNode.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixClass.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/Matrix.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/DenseMatrix.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDenseMatrixClass.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBigNumberClass.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/bignumber/BigNumber.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComplexClass.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/complex/Complex.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFractionClass.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/fraction/Fraction.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/core/function/typed.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTyped.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/bignumber/nearlyEqual.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/relational/equalScalar.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/complex.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqualScalar.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/SparseMatrix.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSparseMatrixClass.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/function/matrix.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrix.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/matrix/subset.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubset.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/transform/utils/errorTransform.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/utils/access.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/AccessorNode.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAccessorNode.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesArrayNode.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/ArrayNode.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/operators.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/AssignmentNode.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAssignmentNode.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/utils/assign.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBlockNode.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResultSet.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/resultset/ResultSet.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/BlockNode.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConditionalNode.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/ConditionalNode.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/latex.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/ConstantNode.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConstantNode.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFunctionAssignmentNode.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/FunctionAssignmentNode.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/collection.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/plain/number/arithmetic.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/arithmetic/abs.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAbs.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAddScalar.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/arithmetic/addScalar.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBignumber.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/bignumber/function/bignumber.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFraction.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/fraction/function/fraction.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/number.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNumber.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/noop.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/utils/numeric.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNumeric.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDivideScalar.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/arithmetic/divideScalar.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm03.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm07.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm12.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm13.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm14.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/relational/equal.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqual.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/matrix/zeros.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesZeros.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/node_modules/@babel/runtime/helpers/esm/defineProperty.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm11.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/arithmetic/round.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRound.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/arithmetic/ceil.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCeil.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/arithmetic/floor.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFix.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFloor.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/arithmetic/fix.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFormat.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/string/format.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNumeric.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/utils/isNumeric.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultiplyScalar.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/arithmetic/multiplyScalar.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/matrix/identity.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIdentity.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConj.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/complex/conj.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSize.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/matrix/size.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDot.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/matrix/dot.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/arithmetic/multiply.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultiply.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/arithmetic/pow.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPow.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnaryMinus.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/arithmetic/unaryMinus.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm01.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm05.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm10.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/arithmetic/subtract.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubtract.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/lruQueue.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/function.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/bignumber/constants.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/unit/Unit.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnitClass.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/SymbolNode.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSymbolNode.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/scope.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/FunctionNode.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFunctionNode.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexNode.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeClass.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/Range.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/IndexNode.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/ObjectNode.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesObjectNode.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/OperatorNode.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOperatorNode.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParenthesisNode.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/ParenthesisNode.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeNode.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/RangeNode.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRelationalNode.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/node/RelationalNode.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/parse.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEvaluate.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParse.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/expression/function/evaluate.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm04.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAdd.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/arithmetic/add.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLarger.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/relational/larger.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFibonacciHeapClass.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSmaller.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/relational/smaller.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/FibonacciHeap.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/Spa.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSpaClass.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/algebra/decomposition/lup.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDivide.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInv.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDet.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLup.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/matrix/det.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/matrix/inv.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/arithmetic/divide.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/type/matrix/utils/algorithm02.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMod.generated.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/function/arithmetic/mod.js","webpack://ChiliEditorSDK/./src/utils/getCalculatedValue.ts","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/core/create.js","webpack://ChiliEditorSDK/./node_modules/mathjs/lib/esm/utils/emitter.js","webpack://ChiliEditorSDK/./src/utils/EditorResponseData.ts","webpack://ChiliEditorSDK/./src/types/FrameTypes.ts","webpack://ChiliEditorSDK/./src/controllers/ShapeController.ts","webpack://ChiliEditorSDK/./src/controllers/FrameController.ts","webpack://ChiliEditorSDK/./src/controllers/AnimationController.ts","webpack://ChiliEditorSDK/./src/controllers/LayoutController.ts","webpack://ChiliEditorSDK/./src/utils/enums.ts","webpack://ChiliEditorSDK/./src/controllers/PageController.ts","webpack://ChiliEditorSDK/./src/controllers/UtilsController.ts","webpack://ChiliEditorSDK/./src/controllers/SubscriberController.ts","webpack://ChiliEditorSDK/./src/controllers/DocumentController.ts","webpack://ChiliEditorSDK/./src/utils/getFetchUrl.ts","webpack://ChiliEditorSDK/./src/controllers/DebugController.ts","webpack://ChiliEditorSDK/./src/controllers/VariableController.ts","webpack://ChiliEditorSDK/./src/controllers/ToolController.ts","webpack://ChiliEditorSDK/./src/controllers/UndoManagerController.ts","webpack://ChiliEditorSDK/./src/controllers/TextStyleController.ts","webpack://ChiliEditorSDK/./src/controllers/ColorStyleController.ts","webpack://ChiliEditorSDK/./src/controllers/ParagraphStyleController.ts","webpack://ChiliEditorSDK/./src/types/ConnectorTypes.ts","webpack://ChiliEditorSDK/./src/controllers/ConfigurationController.ts","webpack://ChiliEditorSDK/./src/types/ConfigurationTypes.ts","webpack://ChiliEditorSDK/./src/controllers/MediaConnectorController.ts","webpack://ChiliEditorSDK/./src/controllers/FontController.ts","webpack://ChiliEditorSDK/./src/controllers/ConnectorController.ts","webpack://ChiliEditorSDK/./src/controllers/FontConnectorController.ts","webpack://ChiliEditorSDK/./src/controllers/ExperimentController.ts","webpack://ChiliEditorSDK/./src/controllers/CharacterStyleController.ts","webpack://ChiliEditorSDK/./src/types/DocumentTypes.ts","webpack://ChiliEditorSDK/./src/controllers/CanvasController.ts","webpack://ChiliEditorSDK/./src/types/AnimationTypes.ts","webpack://ChiliEditorSDK/./src/types/LayoutTypes.ts","webpack://ChiliEditorSDK/./src/types/VariableTypes.ts","webpack://ChiliEditorSDK/./src/types/TextStyleTypes.ts","webpack://ChiliEditorSDK/./src/types/ColorStyleTypes.ts","webpack://ChiliEditorSDK/./src/types/MediaConnectorTypes.ts","webpack://ChiliEditorSDK/./src/types/FontConnectorTypes.ts","webpack://ChiliEditorSDK/./src/types/ActionTypes.ts","webpack://ChiliEditorSDK/./src/controllers/ActionController.ts","webpack://ChiliEditorSDK/./src/index.ts"],"sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine(\"ChiliEditorSDK\", [], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"ChiliEditorSDK\"] = factory();\n\telse\n\t\troot[\"ChiliEditorSDK\"] = factory();\n})(this, () => {\nreturn ","/**\n * @license Complex.js v2.0.15 12/05/2020\n *\n * Copyright (c) 2020, Robert Eisele (robert@xarg.org)\n * Dual licensed under the MIT or GPL Version 2 licenses.\n **/\n\n/**\n *\n * This class allows the manipulation of complex numbers.\n * You can pass a complex number in different formats. Either as object, double, string or two integer parameters.\n *\n * Object form\n * { re: <real>, im: <imaginary> }\n * { arg: <angle>, abs: <radius> }\n * { phi: <angle>, r: <radius> }\n *\n * Array / Vector form\n * [ real, imaginary ]\n *\n * Double form\n * 99.3 - Single double value\n *\n * String form\n * '23.1337' - Simple real number\n * '15+3i' - a simple complex number\n * '3-i' - a simple complex number\n *\n * Example:\n *\n * var c = new Complex('99.3+8i');\n * c.mul({r: 3, i: 9}).div(4.9).sub(3, 2);\n *\n */\n\n(function(root) {\n\n 'use strict';\n\n var cosh = function(x) {\n return (Math.exp(x) + Math.exp(-x)) * 0.5;\n };\n\n var sinh = function(x) {\n return (Math.exp(x) - Math.exp(-x)) * 0.5;\n };\n\n /**\n * Calculates cos(x) - 1 using Taylor series if x is small (-¼π ≤ x ≤ ¼π).\n *\n * @param {number} x\n * @returns {number} cos(x) - 1\n */\n var cosm1 = function(x) {\n\n var b = Math.PI / 4;\n if (-b > x || x > b) {\n return Math.cos(x) - 1.0;\n }\n\n /* Calculate horner form of polynomial of taylor series in Q\n var fac = 1, alt = 1, pol = {};\n for (var i = 0; i <= 16; i++) {\n fac*= i || 1;\n if (i % 2 == 0) {\n pol[i] = new Fraction(1, alt * fac);\n alt = -alt;\n }\n }\n console.log(new Polynomial(pol).toHorner()); // (((((((1/20922789888000x^2-1/87178291200)x^2+1/479001600)x^2-1/3628800)x^2+1/40320)x^2-1/720)x^2+1/24)x^2-1/2)x^2+1\n */\n\n var xx = x * x;\n return xx * (\n xx * (\n xx * (\n xx * (\n xx * (\n xx * (\n xx * (\n xx / 20922789888000\n - 1 / 87178291200)\n + 1 / 479001600)\n - 1 / 3628800)\n + 1 / 40320)\n - 1 / 720)\n + 1 / 24)\n - 1 / 2);\n };\n\n var hypot = function(x, y) {\n\n var a = Math.abs(x);\n var b = Math.abs(y);\n\n if (a < 3000 && b < 3000) {\n return Math.sqrt(a * a + b * b);\n }\n\n if (a < b) {\n a = b;\n b = x / y;\n } else {\n b = y / x;\n }\n return a * Math.sqrt(1 + b * b);\n };\n\n var parser_exit = function() {\n throw SyntaxError('Invalid Param');\n };\n\n /**\n * Calculates log(sqrt(a^2+b^2)) in a way to avoid overflows\n *\n * @param {number} a\n * @param {number} b\n * @returns {number}\n */\n function logHypot(a, b) {\n\n var _a = Math.abs(a);\n var _b = Math.abs(b);\n\n if (a === 0) {\n return Math.log(_b);\n }\n\n if (b === 0) {\n return Math.log(_a);\n }\n\n if (_a < 3000 && _b < 3000) {\n return Math.log(a * a + b * b) * 0.5;\n }\n\n /* I got 4 ideas to compute this property without overflow:\n *\n * Testing 1000000 times with random samples for a,b ∈ [1, 1000000000] against a big decimal library to get an error estimate\n *\n * 1. Only eliminate the square root: (OVERALL ERROR: 3.9122483030951116e-11)\n\n Math.log(a * a + b * b) / 2\n\n *\n *\n * 2. Try to use the non-overflowing pythagoras: (OVERALL ERROR: 8.889760039210159e-10)\n\n var fn = function(a, b) {\n a = Math.abs(a);\n b = Math.abs(b);\n var t = Math.min(a, b);\n a = Math.max(a, b);\n t = t / a;\n\n return Math.log(a) + Math.log(1 + t * t) / 2;\n };\n\n * 3. Abuse the identity cos(atan(y/x) = x / sqrt(x^2+y^2): (OVERALL ERROR: 3.4780178737037204e-10)\n\n Math.log(a / Math.cos(Math.atan2(b, a)))\n\n * 4. Use 3. and apply log rules: (OVERALL ERROR: 1.2014087502620896e-9)\n\n Math.log(a) - Math.log(Math.cos(Math.atan2(b, a)))\n\n */\n\n return Math.log(a / Math.cos(Math.atan2(b, a)));\n }\n\n var parse = function(a, b) {\n\n var z = { 're': 0, 'im': 0 };\n\n if (a === undefined || a === null) {\n z['re'] =\n z['im'] = 0;\n } else if (b !== undefined) {\n z['re'] = a;\n z['im'] = b;\n } else\n switch (typeof a) {\n\n case 'object':\n\n if ('im' in a && 're' in a) {\n z['re'] = a['re'];\n z['im'] = a['im'];\n } else if ('abs' in a && 'arg' in a) {\n if (!Number.isFinite(a['abs']) && Number.isFinite(a['arg'])) {\n return Complex['INFINITY'];\n }\n z['re'] = a['abs'] * Math.cos(a['arg']);\n z['im'] = a['abs'] * Math.sin(a['arg']);\n } else if ('r' in a && 'phi' in a) {\n if (!Number.isFinite(a['r']) && Number.isFinite(a['phi'])) {\n return Complex['INFINITY'];\n }\n z['re'] = a['r'] * Math.cos(a['phi']);\n z['im'] = a['r'] * Math.sin(a['phi']);\n } else if (a.length === 2) { // Quick array check\n z['re'] = a[0];\n z['im'] = a[1];\n } else {\n parser_exit();\n }\n break;\n\n case 'string':\n\n z['im'] = /* void */\n z['re'] = 0;\n\n var tokens = a.match(/\\d+\\.?\\d*e[+-]?\\d+|\\d+\\.?\\d*|\\.\\d+|./g);\n var plus = 1;\n var minus = 0;\n\n if (tokens === null) {\n parser_exit();\n }\n\n for (var i = 0; i < tokens.length; i++) {\n\n var c = tokens[i];\n\n if (c === ' ' || c === '\\t' || c === '\\n') {\n /* void */\n } else if (c === '+') {\n plus++;\n } else if (c === '-') {\n minus++;\n } else if (c === 'i' || c === 'I') {\n\n if (plus + minus === 0) {\n parser_exit();\n }\n\n if (tokens[i + 1] !== ' ' && !isNaN(tokens[i + 1])) {\n z['im'] += parseFloat((minus % 2 ? '-' : '') + tokens[i + 1]);\n i++;\n } else {\n z['im'] += parseFloat((minus % 2 ? '-' : '') + '1');\n }\n plus = minus = 0;\n\n } else {\n\n if (plus + minus === 0 || isNaN(c)) {\n parser_exit();\n }\n\n if (tokens[i + 1] === 'i' || tokens[i + 1] === 'I') {\n z['im'] += parseFloat((minus % 2 ? '-' : '') + c);\n i++;\n } else {\n z['re'] += parseFloat((minus % 2 ? '-' : '') + c);\n }\n plus = minus = 0;\n }\n }\n\n // Still something on the stack\n if (plus + minus > 0) {\n parser_exit();\n }\n break;\n\n case 'number':\n z['im'] = 0;\n z['re'] = a;\n break;\n\n default:\n parser_exit();\n }\n\n if (isNaN(z['re']) || isNaN(z['im'])) {\n // If a calculation is NaN, we treat it as NaN and don't throw\n //parser_exit();\n }\n\n return z;\n };\n\n /**\n * @constructor\n * @returns {Complex}\n */\n function Complex(a, b) {\n\n if (!(this instanceof Complex)) {\n return new Complex(a, b);\n }\n\n var z = parse(a, b);\n\n this['re'] = z['re'];\n this['im'] = z['im'];\n }\n\n Complex.prototype = {\n\n 're': 0,\n 'im': 0,\n\n /**\n * Calculates the sign of a complex number, which is a normalized complex\n *\n * @returns {Complex}\n */\n 'sign': function() {\n\n var abs = this['abs']();\n\n return new Complex(\n this['re'] / abs,\n this['im'] / abs);\n },\n\n /**\n * Adds two complex numbers\n *\n * @returns {Complex}\n */\n 'add': function(a, b) {\n\n var z = new Complex(a, b);\n\n // Infinity + Infinity = NaN\n if (this['isInfinite']() && z['isInfinite']()) {\n return Complex['NAN'];\n }\n\n // Infinity + z = Infinity { where z != Infinity }\n if (this['isInfinite']() || z['isInfinite']()) {\n return Complex['INFINITY'];\n }\n\n return new Complex(\n this['re'] + z['re'],\n this['im'] + z['im']);\n },\n\n /**\n * Subtracts two complex numbers\n *\n * @returns {Complex}\n */\n 'sub': function(a, b) {\n\n var z = new Complex(a, b);\n\n // Infinity - Infinity = NaN\n if (this['isInfinite']() && z['isInfinite']()) {\n return Complex['NAN'];\n }\n\n // Infinity - z = Infinity { where z != Infinity }\n if (this['isInfinite']() || z['isInfinite']()) {\n return Complex['INFINITY'];\n }\n\n return new Complex(\n this['re'] - z['re'],\n this['im'] - z['im']);\n },\n\n /**\n * Multiplies two complex numbers\n *\n * @returns {Complex}\n */\n 'mul': function(a, b) {\n\n var z = new Complex(a, b);\n\n // Infinity * 0 = NaN\n if ((this['isInfinite']() && z['isZero']()) || (this['isZero']() && z['isInfinite']())) {\n return Complex['NAN'];\n }\n\n // Infinity * z = Infinity { where z != 0 }\n if (this['isInfinite']() || z['isInfinite']()) {\n return Complex['INFINITY'];\n }\n\n // Short circuit for real values\n if (z['im'] === 0 && this['im'] === 0) {\n return new Complex(this['re'] * z['re'], 0);\n }\n\n return new Complex(\n this['re'] * z['re'] - this['im'] * z['im'],\n this['re'] * z['im'] + this['im'] * z['re']);\n },\n\n /**\n * Divides two complex numbers\n *\n * @returns {Complex}\n */\n 'div': function(a, b) {\n\n var z = new Complex(a, b);\n\n // 0 / 0 = NaN and Infinity / Infinity = NaN\n if ((this['isZero']() && z['isZero']()) || (this['isInfinite']() && z['isInfinite']())) {\n return Complex['NAN'];\n }\n\n // Infinity / 0 = Infinity\n if (this['isInfinite']() || z['isZero']()) {\n return Complex['INFINITY'];\n }\n\n // 0 / Infinity = 0\n if (this['isZero']() || z['isInfinite']()) {\n return Complex['ZERO'];\n }\n\n a = this['re'];\n b = this['im'];\n\n var c = z['re'];\n var d = z['im'];\n var t, x;\n\n if (0 === d) {\n // Divisor is real\n return new Complex(a / c, b / c);\n }\n\n if (Math.abs(c) < Math.abs(d)) {\n\n x = c / d;\n t = c * x + d;\n\n return new Complex(\n (a * x + b) / t,\n (b * x - a) / t);\n\n } else {\n\n x = d / c;\n t = d * x + c;\n\n return new Complex(\n (a + b * x) / t,\n (b - a * x) / t);\n }\n },\n\n /**\n * Calculate the power of two complex numbers\n *\n * @returns {Complex}\n */\n 'pow': function(a, b) {\n\n var z = new Complex(a, b);\n\n a = this['re'];\n b = this['im'];\n\n if (z['isZero']()) {\n return Complex['ONE'];\n }\n\n // If the exponent is real\n if (z['im'] === 0) {\n\n if (b === 0 && a > 0) {\n\n return new Complex(Math.pow(a, z['re']), 0);\n\n } else if (a === 0) { // If base is fully imaginary\n\n switch ((z['re'] % 4 + 4) % 4) {\n case 0:\n return new Complex(Math.pow(b, z['re']), 0);\n case 1:\n return new Complex(0, Math.pow(b, z['re']));\n case 2:\n return new Complex(-Math.pow(b, z['re']), 0);\n case 3:\n return new Complex(0, -Math.pow(b, z['re']));\n }\n }\n }\n\n /* I couldn't find a good formula, so here is a derivation and optimization\n *\n * z_1^z_2 = (a + bi)^(c + di)\n * = exp((c + di) * log(a + bi)\n * = pow(a^2 + b^2, (c + di) / 2) * exp(i(c + di)atan2(b, a))\n * =>...\n * Re = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * cos(d * log(a^2 + b^2) / 2 + c * atan2(b, a))\n * Im = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * sin(d * log(a^2 + b^2) / 2 + c * atan2(b, a))\n *\n * =>...\n * Re = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * cos(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))\n * Im = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * sin(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))\n *\n * =>\n * Re = exp(c * logsq2 - d * arg(z_1)) * cos(d * logsq2 + c * arg(z_1))\n * Im = exp(c * logsq2 - d * arg(z_1)) * sin(d * logsq2 + c * arg(z_1))\n *\n */\n\n if (a === 0 && b === 0 && z['re'] > 0 && z['im'] >= 0) {\n return Complex['ZERO'];\n }\n\n var arg = Math.atan2(b, a);\n var loh = logHypot(a, b);\n\n a = Math.exp(z['re'] * loh - z['im'] * arg);\n b = z['im'] * loh + z['re'] * arg;\n return new Complex(\n a * Math.cos(b),\n a * Math.sin(b));\n },\n\n /**\n * Calculate the complex square root\n *\n * @returns {Complex}\n */\n 'sqrt': function() {\n\n var a = this['re'];\n var b = this['im'];\n var r = this['abs']();\n\n var re, im;\n\n if (a >= 0) {\n\n if (b === 0) {\n return new Complex(Math.sqrt(a), 0);\n }\n\n re = 0.5 * Math.sqrt(2.0 * (r + a));\n } else {\n re = Math.abs(b) / Math.sqrt(2 * (r - a));\n }\n\n if (a <= 0) {\n im = 0.5 * Math.sqrt(2.0 * (r - a));\n } else {\n im = Math.abs(b) / Math.sqrt(2 * (r + a));\n }\n\n return new Complex(re, b < 0 ? -im : im);\n },\n\n /**\n * Calculate the complex exponent\n *\n * @returns {Complex}\n */\n 'exp': function() {\n\n var tmp = Math.exp(this['re']);\n\n if (this['im'] === 0) {\n //return new Complex(tmp, 0);\n }\n return new Complex(\n tmp * Math.cos(this['im']),\n tmp * Math.sin(this['im']));\n },\n\n /**\n * Calculate the complex exponent and subtracts one.\n *\n * This may be more accurate than `Complex(x).exp().sub(1)` if\n * `x` is small.\n *\n * @returns {Complex}\n */\n 'expm1': function() {\n\n /**\n * exp(a + i*b) - 1\n = exp(a) * (cos(b) + j*sin(b)) - 1\n = expm1(a)*cos(b) + cosm1(b) + j*exp(a)*sin(b)\n */\n\n var a = this['re'];\n var b = this['im'];\n\n return new Complex(\n Math.expm1(a) * Math.cos(b) + cosm1(b),\n Math.exp(a) * Math.sin(b));\n },\n\n /**\n * Calculate the natural log\n *\n * @returns {Complex}\n */\n 'log': function() {\n\n var a = this['re'];\n var b = this['im'];\n\n if (b === 0 && a > 0) {\n //return new Complex(Math.log(a), 0);\n }\n\n return new Complex(\n logHypot(a, b),\n Math.atan2(b, a));\n },\n\n /**\n * Calculate the magnitude of the complex number\n *\n * @returns {number}\n */\n 'abs': function() {\n\n return hypot(this['re'], this['im']);\n },\n\n /**\n * Calculate the angle of the complex number\n *\n * @returns {number}\n */\n 'arg': function() {\n\n return Math.atan2(this['im'], this['re']);\n },\n\n /**\n * Calculate the sine of the complex number\n *\n * @returns {Complex}\n */\n 'sin': function() {\n\n // sin(c) = (e^b - e^(-b)) / (2i)\n\n var a = this['re'];\n var b = this['im'];\n\n return new Complex(\n Math.sin(a) * cosh(b),\n Math.cos(a) * sinh(b));\n },\n\n /**\n * Calculate the cosine\n *\n * @returns {Complex}\n */\n 'cos': function() {\n\n // cos(z) = (e^b + e^(-b)) / 2\n\n var a = this['re'];\n var b = this['im'];\n\n return new Complex(\n Math.cos(a) * cosh(b),\n -Math.sin(a) * sinh(b));\n },\n\n /**\n * Calculate the tangent\n *\n * @returns {Complex}\n */\n 'tan': function() {\n\n // tan(c) = (e^(ci) - e^(-ci)) / (i(e^(ci) + e^(-ci)))\n\n var a = 2 * this['re'];\n var b = 2 * this['im'];\n var d = Math.cos(a) + cosh(b);\n\n return new Complex(\n Math.sin(a) / d,\n sinh(b) / d);\n },\n\n /**\n * Calculate the cotangent\n *\n * @returns {Complex}\n */\n 'cot': function() {\n\n // cot(c) = i(e^(ci) + e^(-ci)) / (e^(ci) - e^(-ci))\n\n var a = 2 * this['re'];\n var b = 2 * this['im'];\n var d = Math.cos(a) - cosh(b);\n\n return new Complex(\n -Math.sin(a) / d,\n sinh(b) / d);\n },\n\n /**\n * Calculate the secant\n *\n * @returns {Complex}\n */\n 'sec': function() {\n\n // sec(c) = 2 / (e^(ci) + e^(-ci))\n\n var a = this['re'];\n var b = this['im'];\n var d = 0.5 * cosh(2 * b) + 0.5 * Math.cos(2 * a);\n\n return new Complex(\n Math.cos(a) * cosh(b) / d,\n Math.sin(a) * sinh(b) / d);\n },\n\n /**\n * Calculate the cosecans\n *\n * @returns {Complex}\n */\n 'csc': function() {\n\n // csc(c) = 2i / (e^(ci) - e^(-ci))\n\n var a = this['re'];\n var b = this['im'];\n var d = 0.5 * cosh(2 * b) - 0.5 * Math.cos(2 * a);\n\n return new Complex(\n Math.sin(a) * cosh(b) / d,\n -Math.cos(a) * sinh(b) / d);\n },\n\n /**\n * Calculate the complex arcus sinus\n *\n * @returns {Complex}\n */\n 'asin': function() {\n\n // asin(c) = -i * log(ci + sqrt(1 - c^2))\n\n var a = this['re'];\n var b = this['im'];\n\n var t1 = new Complex(\n b * b - a * a + 1,\n -2 * a * b)['sqrt']();\n\n var t2 = new Complex(\n t1['re'] - b,\n t1['im'] + a)['log']();\n\n return new Complex(t2['im'], -t2['re']);\n },\n\n /**\n * Calculate the complex arcus cosinus\n *\n * @returns {Complex}\n */\n 'acos': function() {\n\n // acos(c) = i * log(c - i * sqrt(1 - c^2))\n\n var a = this['re'];\n var b = this['im'];\n\n var t1 = new Complex(\n b * b - a * a + 1,\n -2 * a * b)['sqrt']();\n\n var t2 = new Complex(\n t1['re'] - b,\n t1['im'] + a)['log']();\n\n return new Complex(Math.PI / 2 - t2['im'], t2['re']);\n },\n\n /**\n * Calculate the complex arcus tangent\n *\n * @returns {Complex}\n */\n 'atan': function() {\n\n // atan(c) = i / 2 log((i + x) / (i - x))\n\n var a = this['re'];\n var b = this['im'];\n\n if (a === 0) {\n\n if (b === 1) {\n return new Complex(0, Infinity);\n }\n\n if (b === -1) {\n return new Complex(0, -Infinity);\n }\n }\n\n var d = a * a + (1.0 - b) * (1.0 - b);\n\n var t1 = new Complex(\n (1 - b * b - a * a) / d,\n -2 * a / d).log();\n\n return new Complex(-0.5 * t1['im'], 0.5 * t1['re']);\n },\n\n /**\n * Calculate the complex arcus cotangent\n *\n * @returns {Complex}\n */\n 'acot': function() {\n\n // acot(c) = i / 2 log((c - i) / (c + i))\n\n var a = this['re'];\n var b = this['im'];\n\n if (b === 0) {\n return new Complex(Math.atan2(1, a), 0);\n }\n\n var d = a * a + b * b;\n return (d !== 0)\n ? new Complex(\n a / d,\n -b / d).atan()\n : new Complex(\n (a !== 0) ? a / 0 : 0,\n (b !== 0) ? -b / 0 : 0).atan();\n },\n\n /**\n * Calculate the complex arcus secant\n *\n * @returns {Complex}\n */\n 'asec': function() {\n\n // asec(c) = -i * log(1 / c + sqrt(1 - i / c^2))\n\n var a = this['re'];\n var b = this['im'];\n\n if (a === 0 && b === 0) {\n return new Complex(0, Infinity);\n }\n\n var d = a * a + b * b;\n return (d !== 0)\n ? new Complex(\n a / d,\n -b / d).acos()\n : new Complex(\n (a !== 0) ? a / 0 : 0,\n (b !== 0) ? -b / 0 : 0).acos();\n },\n\n /**\n * Calculate the complex arcus cosecans\n *\n * @returns {Complex}\n */\n 'acsc': function() {\n\n // acsc(c) = -i * log(i / c + sqrt(1 - 1 / c^2))\n\n var a = this['re'];\n var b = this['im'];\n\n if (a === 0 && b === 0) {\n return new Complex(Math.PI / 2, Infinity);\n }\n\n var d = a * a + b * b;\n return (d !== 0)\n ? new Complex(\n a / d,\n -b / d).asin()\n : new Complex(\n (a !== 0) ? a / 0 : 0,\n (b !== 0) ? -b / 0 : 0).asin();\n },\n\n /**\n * Calculate the complex sinh\n *\n * @returns {Complex}\n */\n 'sinh': function() {\n\n // sinh(c) = (e^c - e^-c) / 2\n\n var a = this['re'];\n var b = this['im'];\n\n return new Complex(\n sinh(a) * Math.cos(b),\n cosh(a) * Math.sin(b));\n },\n\n /**\n * Calculate the complex cosh\n *\n * @returns {Complex}\n */\n 'cosh': function() {\n\n // cosh(c) = (e^c + e^-c) / 2\n\n var a = this['re'];\n var b = this['im'];\n\n return new Complex(\n cosh(a) * Math.cos(b),\n sinh(a) * Math.sin(b));\n },\n\n /**\n * Calculate the complex tanh\n *\n * @returns {Complex}\n */\n 'tanh': function() {\n\n // tanh(c) = (e^c - e^-c) / (e^c + e^-c)\n\n var a = 2 * this['re'];\n var b = 2 * this['im'];\n var d = cosh(a) + Math.cos(b);\n\n return new Complex(\n sinh(a) / d,\n Math.sin(b) / d);\n },\n\n /**\n * Calculate the complex coth\n *\n * @returns {Complex}\n */\n 'coth': function() {\n\n // coth(c) = (e^c + e^-c) / (e^c - e^-c)\n\n var a = 2 * this['re'];\n var b = 2 * this['im'];\n var d = cosh(a) - Math.cos(b);\n\n return new Complex(\n sinh(a) / d,\n -Math.sin(b) / d);\n },\n\n /**\n * Calculate the complex coth\n *\n * @returns {Complex}\n */\n 'csch': function() {\n\n // csch(c) = 2 / (e^c - e^-c)\n\n var a = this['re'];\n var b = this['im'];\n var d = Math.cos(2 * b) - cosh(2 * a);\n\n return new Complex(\n -2 * sinh(a) * Math.cos(b) / d,\n 2 * cosh(a) * Math.sin(b) / d);\n },\n\n /**\n * Calculate the complex sech\n *\n * @returns {Complex}\n */\n 'sech': function() {\n\n // sech(c) = 2 / (e^c + e^-c)\n\n var a = this['re'];\n var b = this['im'];\n var d = Math.cos(2 * b) + cosh(2 * a);\n\n return new Complex(\n 2 * cosh(a) * Math.cos(b) / d,\n -2 * sinh(a) * Math.sin(b) / d);\n },\n\n /**\n * Calculate the complex asinh\n *\n * @returns {Complex}\n */\n 'asinh': function() {\n\n // asinh(c) = log(c + sqrt(c^2 + 1))\n\n var tmp = this['im'];\n this['im'] = -this['re'];\n this['re'] = tmp;\n var res = this['asin']();\n\n this['re'] = -this['im'];\n this['im'] = tmp;\n tmp = res['re'];\n\n res['re'] = -res['im'];\n res['im'] = tmp;\n return res;\n },\n\n /**\n * Calculate the complex acosh\n *\n * @returns {Complex}\n */\n 'acosh': function() {\n\n // acosh(c) = log(c + sqrt(c^2 - 1))\n\n var res = this['acos']();\n if (res['im'] <= 0) {\n var tmp = res['re'];\n res['re'] = -res['im'];\n res['im'] = tmp;\n } else {\n var tmp = res['im'];\n res['im'] = -res['re'];\n res['re'] = tmp;\n }\n return res;\n },\n\n /**\n * Calculate the complex atanh\n *\n * @returns {Complex}\n */\n 'atanh': function() {\n\n // atanh(c) = log((1+c) / (1-c)) / 2\n\n var a = this['re'];\n var b = this['im'];\n\n var noIM = a > 1 && b === 0;\n var oneMinus = 1 - a;\n var onePlus = 1 + a;\n var d = oneMinus * oneMinus + b * b;\n\n var x = (d !== 0)\n ? new Complex(\n (onePlus * oneMinus - b * b) / d,\n (b * oneMinus + onePlus * b) / d)\n : new Complex(\n (a !== -1) ? (a / 0) : 0,\n (b !== 0) ? (b / 0) : 0);\n\n var temp = x['re'];\n x['re'] = logHypot(x['re'], x['im']) / 2;\n x['im'] = Math.atan2(x['im'], temp) / 2;\n if (noIM) {\n x['im'] = -x['im'];\n }\n return x;\n },\n\n /**\n * Calculate the complex acoth\n *\n * @returns {Complex}\n */\n 'acoth': function() {\n\n // acoth(c) = log((c+1) / (c-1)) / 2\n\n var a = this['re'];\n var b = this['im'];\n\n if (a === 0 && b === 0) {\n return new Complex(0, Math.PI / 2);\n }\n\n var d = a * a + b * b;\n return (d !== 0)\n ? new Complex(\n a / d,\n -b / d).atanh()\n : new Complex(\n (a !== 0) ? a / 0 : 0,\n (b !== 0) ? -b / 0 : 0).atanh();\n },\n\n /**\n * Calculate the complex acsch\n *\n * @returns {Complex}\n */\n 'acsch': function() {\n\n // acsch(c) = log((1+sqrt(1+c^2))/c)\n\n var a = this['re'];\n var b = this['im'];\n\n if (b === 0) {\n\n return new Complex(\n (a !== 0)\n ? Math.log(a + Math.sqrt(a * a + 1))\n : Infinity, 0);\n }\n\n var d = a * a + b * b;\n return (d !== 0)\n ? new Complex(\n a / d,\n -b / d).asinh()\n : new Complex(\n (a !== 0) ? a / 0 : 0,\n (b !== 0) ? -b / 0 : 0).asinh();\n },\n\n /**\n * Calculate the complex asech\n *\n * @returns {Complex}\n */\n 'asech': function() {\n\n // asech(c) = log((1+sqrt(1-c^2))/c)\n\n var a = this['re'];\n var b = this['im'];\n\n if (this['isZero']()) {\n return Complex['INFINITY'];\n }\n\n var d = a * a + b * b;\n return (d !== 0)\n ? new Complex(\n a / d,\n -b / d).acosh()\n : new Complex(\n (a !== 0) ? a / 0 : 0,\n (b !== 0) ? -b / 0 : 0).acosh();\n },\n\n /**\n * Calculate the complex inverse 1/z\n *\n * @returns {Complex}\n */\n 'inverse': function() {\n\n // 1 / 0 = Infinity and 1 / Infinity = 0\n if (this['isZero']()) {\n return Complex['INFINITY'];\n }\n\n if (this['isInfinite']()) {\n return Complex['ZERO'];\n }\n\n var a = this['re'];\n var b = this['im'];\n\n var d = a * a + b * b;\n\n return new Complex(a / d, -b / d);\n },\n\n /**\n * Returns the complex conjugate\n *\n * @returns {Complex}\n */\n 'conjugate': function() {\n\n return new Complex(this['re'], -this['im']);\n },\n\n /**\n * Gets the negated complex number\n *\n * @returns {Complex}\n */\n 'neg': function() {\n\n return new Complex(-this['re'], -this['im']);\n },\n\n /**\n * Ceils the actual complex number\n *\n * @returns {Complex}\n */\n 'ceil': function(places) {\n\n places = Math.pow(10, places || 0);\n\n return new Complex(\n Math.ceil(this['re'] * places) / places,\n Math.ceil(this['im'] * places) / places);\n },\n\n /**\n * Floors the actual complex number\n *\n * @returns {Complex}\n */\n 'floor': function(places) {\n\n places = Math.pow(10, places || 0);\n\n return new Complex(\n Math.floor(this['re'] * places) / places,\n Math.floor(this['im'] * places) / places);\n },\n\n /**\n * Ceils the actual complex number\n *\n * @returns {Complex}\n */\n 'round': function(places) {\n\n places = Math.pow(10, places || 0);\n\n return new Complex(\n Math.round(this['re'] * places) / places,\n Math.round(this['im'] * places) / places);\n },\n\n /**\n * Compares two complex numbers\n *\n * **Note:** new Complex(Infinity).equals(Infinity) === false\n *\n * @returns {boolean}\n */\n 'equals': function(a, b) {\n\n var z = new Complex(a, b);\n\n return Math.abs(z['re'] - this['re']) <= Complex['EPSILON'] &&\n Math.abs(z['im'] - this['im']) <= Complex['EPSILON'];\n },\n\n /**\n * Clones the actual object\n *\n * @returns {Complex}\n */\n 'clone': function() {\n\n return new Complex(this['re'], this['im']);\n },\n\n /**\n * Gets a string of the actual complex number\n *\n * @returns {string}\n */\n 'toString': function() {\n\n var a = this['re'];\n var b = this['im'];\n var ret = \"\";\n\n if (this['isNaN']()) {\n return 'NaN';\n }\n\n if (this['isInfinite']()) {\n return 'Infinity';\n }\n\n if (Math.abs(a) < Complex['EPSILON']) {\n a = 0;\n }\n\n if (Math.abs(b) < Complex['EPSILON']) {\n b = 0;\n }\n\n // If is real number\n if (b === 0) {\n return ret + a;\n }\n\n if (a !== 0) {\n ret += a;\n ret += \" \";\n if (b < 0) {\n b = -b;\n ret += \"-\";\n } else {\n ret += \"+\";\n }\n ret += \" \";\n } else if (b < 0) {\n b = -b;\n ret += \"-\";\n }\n\n if (1 !== b) { // b is the absolute imaginary part\n ret += b;\n }\n return ret + \"i\";\n },\n\n /**\n * Returns the actual number as a vector\n *\n * @returns {Array}\n */\n 'toVector': function() {\n\n return [this['re'], this['im']];\n },\n\n /**\n * Returns the actual real value of the current object\n *\n * @returns {number|null}\n */\n 'valueOf': function() {\n\n if (this['im'] === 0) {\n return this['re'];\n }\n return null;\n },\n\n /**\n * Determines whether a complex number is not on the Riemann sphere.\n *\n * @returns {boolean}\n */\n 'isNaN': function() {\n return isNaN(this['re']) || isNaN(this['im']);\n },\n\n /**\n * Determines whether or not a complex number is at the zero pole of the\n * Riemann sphere.\n *\n * @returns {boolean}\n */\n 'isZero': function() {\n return this['im'] === 0 && this['re'] === 0;\n },\n\n /**\n * Determines whether a complex number is not at the infinity pole of the\n * Riemann sphere.\n *\n * @returns {boolean}\n */\n 'isFinite': function() {\n return isFinite(this['re']) && isFinite(this['im']);\n },\n\n /**\n * Determines whether or not a complex number is at the infinity pole of the\n * Riemann sphere.\n *\n * @returns {boolean}\n */\n 'isInfinite': function() {\n return !(this['isNaN']() || this['isFinite']());\n }\n };\n\n Complex['ZERO'] = new Complex(0, 0);\n Complex['ONE'] = new Complex(1, 0);\n Complex['I'] = new Complex(0, 1);\n Complex['PI'] = new Complex(Math.PI, 0);\n Complex['E'] = new Complex(Math.E, 0);\n Complex['INFINITY'] = new Complex(Infinity, Infinity);\n Complex['NAN'] = new Complex(NaN, NaN);\n Complex['EPSILON'] = 1e-15;\n\n if (typeof define === 'function' && define['amd']) {\n define([], function() {\n return Complex;\n });\n } else if (typeof exports === 'object') {\n Object.defineProperty(Complex, \"__esModule\", { 'value': true });\n Complex['default'] = Complex;\n Complex['Complex'] = Complex;\n module['exports'] = Complex;\n } else {\n root['Complex'] = Complex;\n }\n\n})(this);\n",";(function (globalScope) {\r\n 'use strict';\r\n\r\n\r\n /*\r\n * decimal.js v10.3.1\r\n * An arbitrary-precision Decimal type for JavaScript.\r\n * https://github.com/MikeMcl/decimal.js\r\n * Copyright (c) 2021 Michael Mclaughlin <M8ch88l@gmail.com>\r\n * MIT Licence\r\n */\r\n\r\n\r\n // ----------------------------------- EDITABLE DEFAULTS ------------------------------------ //\r\n\r\n\r\n // The maximum exponent magnitude.\r\n // The limit on the value of `toExpNeg`, `toExpPos`, `minE` and `maxE`.\r\n var EXP_LIMIT = 9e15, // 0 to 9e15\r\n\r\n // The limit on the value of `precision`, and on the value of the first argument to\r\n // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n MAX_DIGITS = 1e9, // 0 to 1e9\r\n\r\n // Base conversion alphabet.\r\n NUMERALS = '0123456789abcdef',\r\n\r\n // The natural logarithm of 10 (1025 digits).\r\n LN10 = '2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058',\r\n\r\n // Pi (1025 digits).\r\n PI = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789',\r\n\r\n\r\n // The initial configuration properties of the Decimal constructor.\r\n DEFAULTS = {\r\n\r\n // These values must be integers within the stated ranges (inclusive).\r\n // Most of these values can be changed at run-time using the `Decimal.config` method.\r\n\r\n // The maximum number of significant digits of the result of a calculation or base conversion.\r\n // E.g. `Decimal.config({ precision: 20 });`\r\n precision: 20, // 1 to MAX_DIGITS\r\n\r\n // The rounding mode used when rounding to `precision`.\r\n //\r\n // ROUND_UP 0 Away from zero.\r\n // ROUND_DOWN 1 Towards zero.\r\n // ROUND_CEIL 2 Towards +Infinity.\r\n // ROUND_FLOOR 3 Towards -Infinity.\r\n // ROUND_HALF_UP 4 Towards nearest neighbour. If equidistant, up.\r\n // ROUND_HALF_DOWN 5 Towards nearest neighbour. If equidistant, down.\r\n // ROUND_HALF_EVEN 6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n // ROUND_HALF_CEIL 7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n //\r\n // E.g.\r\n // `Decimal.rounding = 4;`\r\n // `Decimal.rounding = Decimal.ROUND_HALF_UP;`\r\n rounding: 4, // 0 to 8\r\n\r\n // The modulo mode used when calculating the modulus: a mod n.\r\n // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n // The remainder (r) is calculated as: r = a - n * q.\r\n //\r\n // UP 0 The remainder is positive if the dividend is negative, else is negative.\r\n // DOWN 1 The remainder has the same sign as the dividend (JavaScript %).\r\n // FLOOR 3 The remainder has the same sign as the divisor (Python %).\r\n // HALF_EVEN 6 The IEEE 754 remainder function.\r\n // EUCLID 9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.\r\n //\r\n // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian\r\n // division (9) are commonly used for the modulus operation. The other rounding modes can also\r\n // be used, but they may not give useful results.\r\n modulo: 1, // 0 to 9\r\n\r\n // The exponent value at and beneath which `toString` returns exponential notation.\r\n // JavaScript numbers: -7\r\n toExpNeg: -7, // 0 to -EXP_LIMIT\r\n\r\n // The exponent value at and above which `toString` returns exponential notation.\r\n // JavaScript numbers: 21\r\n toExpPos: 21, // 0 to EXP_LIMIT\r\n\r\n // The minimum exponent value, beneath which underflow to zero occurs.\r\n // JavaScript numbers: -324 (5e-324)\r\n minE: -EXP_LIMIT, // -1 to -EXP_LIMIT\r\n\r\n // The maximum exponent value, above which overflow to Infinity occurs.\r\n // JavaScript numbers: 308 (1.7976931348623157e+308)\r\n maxE: EXP_LIMIT, // 1 to EXP_LIMIT\r\n\r\n // Whether to use cryptographically-secure random number generation, if available.\r\n crypto: false // true/false\r\n },\r\n\r\n\r\n // ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //\r\n\r\n\r\n Decimal, inexact, noConflict, quadrant,\r\n external = true,\r\n\r\n decimalError = '[DecimalError] ',\r\n invalidArgument = decimalError + 'Invalid argument: ',\r\n precisionLimitExceeded = decimalError + 'Precision limit exceeded',\r\n cryptoUnavailable = decimalError + 'crypto unavailable',\r\n tag = '[object Decimal]',\r\n\r\n mathfloor = Math.floor,\r\n mathpow = Math.pow,\r\n\r\n isBinary = /^0b([01]+(\\.[01]*)?|\\.[01]+)(p[+-]?\\d+)?$/i,\r\n isHex = /^0x([0-9a-f]+(\\.[0-9a-f]*)?|\\.[0-9a-f]+)(p[+-]?\\d+)?$/i,\r\n isOctal = /^0o([0-7]+(\\.[0-7]*)?|\\.[0-7]+)(p[+-]?\\d+)?$/i,\r\n isDecimal = /^(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i,\r\n\r\n BASE = 1e7,\r\n LOG_BASE = 7,\r\n MAX_SAFE_INTEGER = 9007199254740991,\r\n\r\n LN10_PRECISION = LN10.length - 1,\r\n PI_PRECISION = PI.length - 1,\r\n\r\n // Decimal.prototype object\r\n P = { toStringTag: tag };\r\n\r\n\r\n // Decimal prototype methods\r\n\r\n\r\n /*\r\n * absoluteValue abs\r\n * ceil\r\n * clampedTo clamp\r\n * comparedTo cmp\r\n * cosine cos\r\n * cubeRoot cbrt\r\n * decimalPlaces dp\r\n * dividedBy div\r\n * dividedToIntegerBy divToInt\r\n * equals eq\r\n * floor\r\n * greaterThan gt\r\n * greaterThanOrEqualTo gte\r\n * hyperbolicCosine cosh\r\n * hyperbolicSine sinh\r\n * hyperbolicTangent tanh\r\n * inverseCosine acos\r\n * inverseHyperbolicCosine acosh\r\n * inverseHyperbolicSine asinh\r\n * inverseHyperbolicTangent atanh\r\n * inverseSine asin\r\n * inverseTangent atan\r\n * isFinite\r\n * isInteger isInt\r\n * isNaN\r\n * isNegative isNeg\r\n * isPositive isPos\r\n * isZero\r\n * lessThan lt\r\n * lessThanOrEqualTo lte\r\n * logarithm log\r\n * [maximum] [max]\r\n * [minimum] [min]\r\n * minus sub\r\n * modulo mod\r\n * naturalExponential exp\r\n * naturalLogarithm ln\r\n * negated neg\r\n * plus add\r\n * precision sd\r\n * round\r\n * sine sin\r\n * squareRoot sqrt\r\n * tangent tan\r\n * times mul\r\n * toBinary\r\n * toDecimalPlaces toDP\r\n * toExponential\r\n * toFixed\r\n * toFraction\r\n * toHexadecimal toHex\r\n * toNearest\r\n * toNumber\r\n * toOctal\r\n * toPower pow\r\n * toPrecision\r\n * toSignificantDigits toSD\r\n * toString\r\n * truncated trunc\r\n * valueOf toJSON\r\n */\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the absolute value of this Decimal.\r\n *\r\n */\r\n P.absoluteValue = P.abs = function () {\r\n var x = new this.constructor(this);\r\n if (x.s < 0) x.s = 1;\r\n return finalise(x);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n * direction of positive Infinity.\r\n *\r\n */\r\n P.ceil = function () {\r\n return finalise(new this.constructor(this), this.e + 1, 2);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the value of this Decimal clamped to the range\r\n * delineated by `min` and `max`.\r\n *\r\n * min {number|string|Decimal}\r\n * max {number|string|Decimal}\r\n *\r\n */\r\n P.clampedTo = P.clamp = function (min, max) {\r\n var k,\r\n x = this,\r\n Ctor = x.constructor;\r\n min = new Ctor(min);\r\n max = new Ctor(max);\r\n if (!min.s || !max.s) return new Ctor(NaN);\r\n if (min.gt(max)) throw Error(invalidArgument + max);\r\n k = x.cmp(min);\r\n return k < 0 ? min : x.cmp(max) > 0 ? max : new Ctor(x);\r\n };\r\n\r\n\r\n /*\r\n * Return\r\n * 1 if the value of this Decimal is greater than the value of `y`,\r\n * -1 if the value of this Decimal is less than the value of `y`,\r\n * 0 if they have the same value,\r\n * NaN if the value of either Decimal is NaN.\r\n *\r\n */\r\n P.comparedTo = P.cmp = function (y) {\r\n var i, j, xdL, ydL,\r\n x = this,\r\n xd = x.d,\r\n yd = (y = new x.constructor(y)).d,\r\n xs = x.s,\r\n ys = y.s;\r\n\r\n // Either NaN or ±Infinity?\r\n if (!xd || !yd) {\r\n return !xs || !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;\r\n }\r\n\r\n // Either zero?\r\n if (!xd[0] || !yd[0]) return xd[0] ? xs : yd[0] ? -ys : 0;\r\n\r\n // Signs differ?\r\n if (xs !== ys) return xs;\r\n\r\n // Compare exponents.\r\n if (x.e !== y.e) return x.e > y.e ^ xs < 0 ? 1 : -1;\r\n\r\n xdL = xd.length;\r\n ydL = yd.length;\r\n\r\n // Compare digit by digit.\r\n for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {\r\n if (xd[i] !== yd[i]) return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;\r\n }\r\n\r\n // Compare lengths.\r\n return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the cosine of the value in radians of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n *\r\n * cos(0) = 1\r\n * cos(-0) = 1\r\n * cos(Infinity) = NaN\r\n * cos(-Infinity) = NaN\r\n * cos(NaN) = NaN\r\n *\r\n */\r\n P.cosine = P.cos = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.d) return new Ctor(NaN);\r\n\r\n // cos(0) = cos(-0) = 1\r\n if (!x.d[0]) return new Ctor(1);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n Ctor.rounding = 1;\r\n\r\n x = cosine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return finalise(quadrant == 2 || quadrant == 3 ? x.neg() : x, pr, rm, true);\r\n };\r\n\r\n\r\n /*\r\n *\r\n * Return a new Decimal whose value is the cube root of the value of this Decimal, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * cbrt(0) = 0\r\n * cbrt(-0) = -0\r\n * cbrt(1) = 1\r\n * cbrt(-1) = -1\r\n * cbrt(N) = N\r\n * cbrt(-I) = -I\r\n * cbrt(I) = I\r\n *\r\n * Math.cbrt(x) = (x < 0 ? -Math.pow(-x, 1/3) : Math.pow(x, 1/3))\r\n *\r\n */\r\n P.cubeRoot = P.cbrt = function () {\r\n var e, m, n, r, rep, s, sd, t, t3, t3plusx,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n external = false;\r\n\r\n // Initial estimate.\r\n s = x.s * mathpow(x.s * x, 1 / 3);\r\n\r\n // Math.cbrt underflow/overflow?\r\n // Pass x to Math.pow as integer, then adjust the exponent of the result.\r\n if (!s || Math.abs(s) == 1 / 0) {\r\n n = digitsToString(x.d);\r\n e = x.e;\r\n\r\n // Adjust n exponent so it is a multiple of 3 away from x exponent.\r\n if (s = (e - n.length + 1) % 3) n += (s == 1 || s == -2 ? '0' : '00');\r\n s = mathpow(n, 1 / 3);\r\n\r\n // Rarely, e may be one less than the result exponent value.\r\n e = mathfloor((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2));\r\n\r\n if (s == 1 / 0) {\r\n n = '5e' + e;\r\n } else {\r\n n = s.toExponential();\r\n n = n.slice(0, n.indexOf('e') + 1) + e;\r\n }\r\n\r\n r = new Ctor(n);\r\n r.s = x.s;\r\n } else {\r\n r = new Ctor(s.toString());\r\n }\r\n\r\n sd = (e = Ctor.precision) + 3;\r\n\r\n // Halley's method.\r\n // TODO? Compare Newton's method.\r\n for (;;) {\r\n t = r;\r\n t3 = t.times(t).times(t);\r\n t3plusx = t3.plus(x);\r\n r = divide(t3plusx.plus(x).times(t), t3plusx.plus(t3), sd + 2, 1);\r\n\r\n // TODO? Replace with for-loop and checkRoundingDigits.\r\n if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n n = n.slice(sd - 3, sd + 1);\r\n\r\n // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or 4999\r\n // , i.e. approaching a rounding boundary, continue the iteration.\r\n if (n == '9999' || !rep && n == '4999') {\r\n\r\n // On the first iteration only, check to see if rounding up gives the exact result as the\r\n // nines may infinitely repeat.\r\n if (!rep) {\r\n finalise(t, e + 1, 0);\r\n\r\n if (t.times(t).times(t).eq(x)) {\r\n r = t;\r\n break;\r\n }\r\n }\r\n\r\n sd += 4;\r\n rep = 1;\r\n } else {\r\n\r\n // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n // If not, then there are further digits and m will be truthy.\r\n if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n // Truncate to the first rounding digit.\r\n finalise(r, e + 1, 1);\r\n m = !r.times(r).times(r).eq(x);\r\n }\r\n\r\n break;\r\n }\r\n }\r\n }\r\n\r\n external = true;\r\n\r\n return finalise(r, e, Ctor.rounding, m);\r\n };\r\n\r\n\r\n /*\r\n * Return the number of decimal places of the value of this Decimal.\r\n *\r\n */\r\n P.decimalPlaces = P.dp = function () {\r\n var w,\r\n d = this.d,\r\n n = NaN;\r\n\r\n if (d) {\r\n w = d.length - 1;\r\n n = (w - mathfloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n // Subtract the number of trailing zeros of the last word.\r\n w = d[w];\r\n if (w) for (; w % 10 == 0; w /= 10) n--;\r\n if (n < 0) n = 0;\r\n }\r\n\r\n return n;\r\n };\r\n\r\n\r\n /*\r\n * n / 0 = I\r\n * n / N = N\r\n * n / I = 0\r\n * 0 / n = 0\r\n * 0 / 0 = N\r\n * 0 / N = N\r\n * 0 / I = 0\r\n * N / n = N\r\n * N / 0 = N\r\n * N / N = N\r\n * N / I = N\r\n * I / n = I\r\n * I / 0 = I\r\n * I / N = N\r\n * I / I = N\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal divided by `y`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n */\r\n P.dividedBy = P.div = function (y) {\r\n return divide(this, new this.constructor(y));\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the integer part of dividing the value of this Decimal\r\n * by the value of `y`, rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n */\r\n P.dividedToIntegerBy = P.divToInt = function (y) {\r\n var x = this,\r\n Ctor = x.constructor;\r\n return finalise(divide(x, new Ctor(y), 0, 1, 1), Ctor.precision, Ctor.rounding);\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.\r\n *\r\n */\r\n P.equals = P.eq = function (y) {\r\n return this.cmp(y) === 0;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n * direction of negative Infinity.\r\n *\r\n */\r\n P.floor = function () {\r\n return finalise(new this.constructor(this), this.e + 1, 3);\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Decimal is greater than the value of `y`, otherwise return\r\n * false.\r\n *\r\n */\r\n P.greaterThan = P.gt = function (y) {\r\n return this.cmp(y) > 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Decimal is greater than or equal to the value of `y`,\r\n * otherwise return false.\r\n *\r\n */\r\n P.greaterThanOrEqualTo = P.gte = function (y) {\r\n var k = this.cmp(y);\r\n return k == 1 || k === 0;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the hyperbolic cosine of the value in radians of this\r\n * Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [1, Infinity]\r\n *\r\n * cosh(x) = 1 + x^2/2! + x^4/4! + x^6/6! + ...\r\n *\r\n * cosh(0) = 1\r\n * cosh(-0) = 1\r\n * cosh(Infinity) = Infinity\r\n * cosh(-Infinity) = Infinity\r\n * cosh(NaN) = NaN\r\n *\r\n * x time taken (ms) result\r\n * 1000 9 9.8503555700852349694e+433\r\n * 10000 25 4.4034091128314607936e+4342\r\n * 100000 171 1.4033316802130615897e+43429\r\n * 1000000 3817 1.5166076984010437725e+434294\r\n * 10000000 abandoned after 2 minute wait\r\n *\r\n * TODO? Compare performance of cosh(x) = 0.5 * (exp(x) + exp(-x))\r\n *\r\n */\r\n P.hyperbolicCosine = P.cosh = function () {\r\n var k, n, pr, rm, len,\r\n x = this,\r\n Ctor = x.constructor,\r\n one = new Ctor(1);\r\n\r\n if (!x.isFinite()) return new Ctor(x.s ? 1 / 0 : NaN);\r\n if (x.isZero()) return one;\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n Ctor.rounding = 1;\r\n len = x.d.length;\r\n\r\n // Argument reduction: cos(4x) = 1 - 8cos^2(x) + 8cos^4(x) + 1\r\n // i.e. cos(x) = 1 - cos^2(x/4)(8 - 8cos^2(x/4))\r\n\r\n // Estimate the optimum number of times to use the argument reduction.\r\n // TODO? Estimation reused from cosine() and may not be optimal here.\r\n if (len < 32) {\r\n k = Math.ceil(len / 3);\r\n n = (1 / tinyPow(4, k)).toString();\r\n } else {\r\n k = 16;\r\n n = '2.3283064365386962890625e-10';\r\n }\r\n\r\n x = taylorSeries(Ctor, 1, x.times(n), new Ctor(1), true);\r\n\r\n // Reverse argument reduction\r\n var cosh2_x,\r\n i = k,\r\n d8 = new Ctor(8);\r\n for (; i--;) {\r\n cosh2_x = x.times(x);\r\n x = one.minus(cosh2_x.times(d8.minus(cosh2_x.times(d8))));\r\n }\r\n\r\n return finalise(x, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the hyperbolic sine of the value in radians of this\r\n * Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n *\r\n * sinh(x) = x + x^3/3! + x^5/5! + x^7/7! + ...\r\n *\r\n * sinh(0) = 0\r\n * sinh(-0) = -0\r\n * sinh(Infinity) = Infinity\r\n * sinh(-Infinity) = -Infinity\r\n * sinh(NaN) = NaN\r\n *\r\n * x time taken (ms)\r\n * 10 2 ms\r\n * 100 5 ms\r\n * 1000 14 ms\r\n * 10000 82 ms\r\n * 100000 886 ms 1.4033316802130615897e+43429\r\n * 200000 2613 ms\r\n * 300000 5407 ms\r\n * 400000 8824 ms\r\n * 500000 13026 ms 8.7080643612718084129e+217146\r\n * 1000000 48543 ms\r\n *\r\n * TODO? Compare performance of sinh(x) = 0.5 * (exp(x) - exp(-x))\r\n *\r\n */\r\n P.hyperbolicSine = P.sinh = function () {\r\n var k, pr, rm, len,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n Ctor.rounding = 1;\r\n len = x.d.length;\r\n\r\n if (len < 3) {\r\n x = taylorSeries(Ctor, 2, x, x, true);\r\n } else {\r\n\r\n // Alternative argument reduction: sinh(3x) = sinh(x)(3 + 4sinh^2(x))\r\n // i.e. sinh(x) = sinh(x/3)(3 + 4sinh^2(x/3))\r\n // 3 multiplications and 1 addition\r\n\r\n // Argument reduction: sinh(5x) = sinh(x)(5 + sinh^2(x)(20 + 16sinh^2(x)))\r\n // i.e. sinh(x) = sinh(x/5)(5 + sinh^2(x/5)(20 + 16sinh^2(x/5)))\r\n // 4 multiplications and 2 additions\r\n\r\n // Estimate the optimum number of times to use the argument reduction.\r\n k = 1.4 * Math.sqrt(len);\r\n k = k > 16 ? 16 : k | 0;\r\n\r\n x = x.times(1 / tinyPow(5, k));\r\n x = taylorSeries(Ctor, 2, x, x, true);\r\n\r\n // Reverse argument reduction\r\n var sinh2_x,\r\n d5 = new Ctor(5),\r\n d16 = new Ctor(16),\r\n d20 = new Ctor(20);\r\n for (; k--;) {\r\n sinh2_x = x.times(x);\r\n x = x.times(d5.plus(sinh2_x.times(d16.times(sinh2_x).plus(d20))));\r\n }\r\n }\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return finalise(x, pr, rm, true);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the hyperbolic tangent of the value in radians of this\r\n * Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n *\r\n * tanh(x) = sinh(x) / cosh(x)\r\n *\r\n * tanh(0) = 0\r\n * tanh(-0) = -0\r\n * tanh(Infinity) = 1\r\n * tanh(-Infinity) = -1\r\n * tanh(NaN) = NaN\r\n *\r\n */\r\n P.hyperbolicTangent = P.tanh = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite()) return new Ctor(x.s);\r\n if (x.isZero()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + 7;\r\n Ctor.rounding = 1;\r\n\r\n return divide(x.sinh(), x.cosh(), Ctor.precision = pr, Ctor.rounding = rm);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the arccosine (inverse cosine) in radians of the value of\r\n * this Decimal.\r\n *\r\n * Domain: [-1, 1]\r\n * Range: [0, pi]\r\n *\r\n * acos(x) = pi/2 - asin(x)\r\n *\r\n * acos(0) = pi/2\r\n * acos(-0) = pi/2\r\n * acos(1) = 0\r\n * acos(-1) = pi\r\n * acos(1/2) = pi/3\r\n * acos(-1/2) = 2*pi/3\r\n * acos(|x| > 1) = NaN\r\n * acos(NaN) = NaN\r\n *\r\n */\r\n P.inverseCosine = P.acos = function () {\r\n var halfPi,\r\n x = this,\r\n Ctor = x.constructor,\r\n k = x.abs().cmp(1),\r\n pr = Ctor.precision,\r\n rm = Ctor.rounding;\r\n\r\n if (k !== -1) {\r\n return k === 0\r\n // |x| is 1\r\n ? x.isNeg() ? getPi(Ctor, pr, rm) : new Ctor(0)\r\n // |x| > 1 or x is NaN\r\n : new Ctor(NaN);\r\n }\r\n\r\n if (x.isZero()) return getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n // TODO? Special case acos(0.5) = pi/3 and acos(-0.5) = 2*pi/3\r\n\r\n Ctor.precision = pr + 6;\r\n Ctor.rounding = 1;\r\n\r\n x = x.asin();\r\n halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return halfPi.minus(x);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic cosine in radians of the\r\n * value of this Decimal.\r\n *\r\n * Domain: [1, Infinity]\r\n * Range: [0, Infinity]\r\n *\r\n * acosh(x) = ln(x + sqrt(x^2 - 1))\r\n *\r\n * acosh(x < 1) = NaN\r\n * acosh(NaN) = NaN\r\n * acosh(Infinity) = Infinity\r\n * acosh(-Infinity) = NaN\r\n * acosh(0) = NaN\r\n * acosh(-0) = NaN\r\n * acosh(1) = 0\r\n * acosh(-1) = NaN\r\n *\r\n */\r\n P.inverseHyperbolicCosine = P.acosh = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (x.lte(1)) return new Ctor(x.eq(1) ? 0 : NaN);\r\n if (!x.isFinite()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + Math.max(Math.abs(x.e), x.sd()) + 4;\r\n Ctor.rounding = 1;\r\n external = false;\r\n\r\n x = x.times(x).minus(1).sqrt().plus(x);\r\n\r\n external = true;\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return x.ln();\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic sine in radians of the value\r\n * of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n *\r\n * asinh(x) = ln(x + sqrt(x^2 + 1))\r\n *\r\n * asinh(NaN) = NaN\r\n * asinh(Infinity) = Infinity\r\n * asinh(-Infinity) = -Infinity\r\n * asinh(0) = 0\r\n * asinh(-0) = -0\r\n *\r\n */\r\n P.inverseHyperbolicSine = P.asinh = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + 2 * Math.max(Math.abs(x.e), x.sd()) + 6;\r\n Ctor.rounding = 1;\r\n external = false;\r\n\r\n x = x.times(x).plus(1).sqrt().plus(x);\r\n\r\n external = true;\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return x.ln();\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic tangent in radians of the\r\n * value of this Decimal.\r\n *\r\n * Domain: [-1, 1]\r\n * Range: [-Infinity, Infinity]\r\n *\r\n * atanh(x) = 0.5 * ln((1 + x) / (1 - x))\r\n *\r\n * atanh(|x| > 1) = NaN\r\n * atanh(NaN) = NaN\r\n * atanh(Infinity) = NaN\r\n * atanh(-Infinity) = NaN\r\n * atanh(0) = 0\r\n * atanh(-0) = -0\r\n * atanh(1) = Infinity\r\n * atanh(-1) = -Infinity\r\n *\r\n */\r\n P.inverseHyperbolicTangent = P.atanh = function () {\r\n var pr, rm, wpr, xsd,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite()) return new Ctor(NaN);\r\n if (x.e >= 0) return new Ctor(x.abs().eq(1) ? x.s / 0 : x.isZero() ? x : NaN);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n xsd = x.sd();\r\n\r\n if (Math.max(xsd, pr) < 2 * -x.e - 1) return finalise(new Ctor(x), pr, rm, true);\r\n\r\n Ctor.precision = wpr = xsd - x.e;\r\n\r\n x = divide(x.plus(1), new Ctor(1).minus(x), wpr + pr, 1);\r\n\r\n Ctor.precision = pr + 4;\r\n Ctor.rounding = 1;\r\n\r\n x = x.ln();\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return x.times(0.5);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the arcsine (inverse sine) in radians of the value of this\r\n * Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-pi/2, pi/2]\r\n *\r\n * asin(x) = 2*atan(x/(1 + sqrt(1 - x^2)))\r\n *\r\n * asin(0) = 0\r\n * asin(-0) = -0\r\n * asin(1/2) = pi/6\r\n * asin(-1/2) = -pi/6\r\n * asin(1) = pi/2\r\n * asin(-1) = -pi/2\r\n * asin(|x| > 1) = NaN\r\n * asin(NaN) = NaN\r\n *\r\n * TODO? Compare performance of Taylor series.\r\n *\r\n */\r\n P.inverseSine = P.asin = function () {\r\n var halfPi, k,\r\n pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (x.isZero()) return new Ctor(x);\r\n\r\n k = x.abs().cmp(1);\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n\r\n if (k !== -1) {\r\n\r\n // |x| is 1\r\n if (k === 0) {\r\n halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n halfPi.s = x.s;\r\n return halfPi;\r\n }\r\n\r\n // |x| > 1 or x is NaN\r\n return new Ctor(NaN);\r\n }\r\n\r\n // TODO? Special case asin(1/2) = pi/6 and asin(-1/2) = -pi/6\r\n\r\n Ctor.precision = pr + 6;\r\n Ctor.rounding = 1;\r\n\r\n x = x.div(new Ctor(1).minus(x.times(x)).sqrt().plus(1)).atan();\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return x.times(2);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the arctangent (inverse tangent) in radians of the value\r\n * of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-pi/2, pi/2]\r\n *\r\n * atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n *\r\n * atan(0) = 0\r\n * atan(-0) = -0\r\n * atan(1) = pi/4\r\n * atan(-1) = -pi/4\r\n * atan(Infinity) = pi/2\r\n * atan(-Infinity) = -pi/2\r\n * atan(NaN) = NaN\r\n *\r\n */\r\n P.inverseTangent = P.atan = function () {\r\n var i, j, k, n, px, t, r, wpr, x2,\r\n x = this,\r\n Ctor = x.constructor,\r\n pr = Ctor.precision,\r\n rm = Ctor.rounding;\r\n\r\n if (!x.isFinite()) {\r\n if (!x.s) return new Ctor(NaN);\r\n if (pr + 4 <= PI_PRECISION) {\r\n r = getPi(Ctor, pr + 4, rm).times(0.5);\r\n r.s = x.s;\r\n return r;\r\n }\r\n } else if (x.isZero()) {\r\n return new Ctor(x);\r\n } else if (x.abs().eq(1) && pr + 4 <= PI_PRECISION) {\r\n r = getPi(Ctor, pr + 4, rm).times(0.25);\r\n r.s = x.s;\r\n return r;\r\n }\r\n\r\n Ctor.precision = wpr = pr + 10;\r\n Ctor.rounding = 1;\r\n\r\n // TODO? if (x >= 1 && pr <= PI_PRECISION) atan(x) = halfPi * x.s - atan(1 / x);\r\n\r\n // Argument reduction\r\n // Ensure |x| < 0.42\r\n // atan(x) = 2 * atan(x / (1 + sqrt(1 + x^2)))\r\n\r\n k = Math.min(28, wpr / LOG_BASE + 2 | 0);\r\n\r\n for (i = k; i; --i) x = x.div(x.times(x).plus(1).sqrt().plus(1));\r\n\r\n external = false;\r\n\r\n j = Math.ceil(wpr / LOG_BASE);\r\n n = 1;\r\n x2 = x.times(x);\r\n r = new Ctor(x);\r\n px = x;\r\n\r\n // atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n for (; i !== -1;) {\r\n px = px.times(x2);\r\n t = r.minus(px.div(n += 2));\r\n\r\n px = px.times(x2);\r\n r = t.plus(px.div(n += 2));\r\n\r\n if (r.d[j] !== void 0) for (i = j; r.d[i] === t.d[i] && i--;);\r\n }\r\n\r\n if (k) r = r.times(2 << (k - 1));\r\n\r\n external = true;\r\n\r\n return finalise(r, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Decimal is a finite number, otherwise return false.\r\n *\r\n */\r\n P.isFinite = function () {\r\n return !!this.d;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Decimal is an integer, otherwise return false.\r\n *\r\n */\r\n P.isInteger = P.isInt = function () {\r\n return !!this.d && mathfloor(this.e / LOG_BASE) > this.d.length - 2;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Decimal is NaN, otherwise return false.\r\n *\r\n */\r\n P.isNaN = function () {\r\n return !this.s;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Decimal is negative, otherwise return false.\r\n *\r\n */\r\n P.isNegative = P.isNeg = function () {\r\n return this.s < 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Decimal is positive, otherwise return false.\r\n *\r\n */\r\n P.isPositive = P.isPos = function () {\r\n return this.s > 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Decimal is 0 or -0, otherwise return false.\r\n *\r\n */\r\n P.isZero = function () {\r\n return !!this.d && this.d[0] === 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Decimal is less than `y`, otherwise return false.\r\n *\r\n */\r\n P.lessThan = P.lt = function (y) {\r\n return this.cmp(y) < 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.\r\n *\r\n */\r\n P.lessThanOrEqualTo = P.lte = function (y) {\r\n return this.cmp(y) < 1;\r\n };\r\n\r\n\r\n /*\r\n * Return the logarithm of the value of this Decimal to the specified base, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * If no base is specified, return log[10](arg).\r\n *\r\n * log[base](arg) = ln(arg) / ln(base)\r\n *\r\n * The result will always be correctly rounded if the base of the log is 10, and 'almost always'\r\n * otherwise:\r\n *\r\n * Depending on the rounding mode, the result may be incorrectly rounded if the first fifteen\r\n * rounding digits are [49]99999999999999 or [50]00000000000000. In that case, the maximum error\r\n * between the result and the correctly rounded result will be one ulp (unit in the last place).\r\n *\r\n * log[-b](a) = NaN\r\n * log[0](a) = NaN\r\n * log[1](a) = NaN\r\n * log[NaN](a) = NaN\r\n * log[Infinity](a) = NaN\r\n * log[b](0) = -Infinity\r\n * log[b](-0) = -Infinity\r\n * log[b](-a) = NaN\r\n * log[b](1) = 0\r\n * log[b](Infinity) = Infinity\r\n * log[b](NaN) = NaN\r\n *\r\n * [base] {number|string|Decimal} The base of the logarithm.\r\n *\r\n */\r\n P.logarithm = P.log = function (base) {\r\n var isBase10, d, denominator, k, inf, num, sd, r,\r\n arg = this,\r\n Ctor = arg.constructor,\r\n pr = Ctor.precision,\r\n rm = Ctor.rounding,\r\n guard = 5;\r\n\r\n // Default base is 10.\r\n if (base == null) {\r\n base = new Ctor(10);\r\n isBase10 = true;\r\n } else {\r\n base = new Ctor(base);\r\n d = base.d;\r\n\r\n // Return NaN if base is negative, or non-finite, or is 0 or 1.\r\n if (base.s < 0 || !d || !d[0] || base.eq(1)) return new Ctor(NaN);\r\n\r\n isBase10 = base.eq(10);\r\n }\r\n\r\n d = arg.d;\r\n\r\n // Is arg negative, non-finite, 0 or 1?\r\n if (arg.s < 0 || !d || !d[0] || arg.eq(1)) {\r\n return new Ctor(d && !d[0] ? -1 / 0 : arg.s != 1 ? NaN : d ? 0 : 1 / 0);\r\n }\r\n\r\n // The result will have a non-terminating decimal expansion if base is 10 and arg is not an\r\n // integer power of 10.\r\n if (isBase10) {\r\n if (d.length > 1) {\r\n inf = true;\r\n } else {\r\n for (k = d[0]; k % 10 === 0;) k /= 10;\r\n inf = k !== 1;\r\n }\r\n }\r\n\r\n external = false;\r\n sd = pr + guard;\r\n num = naturalLogarithm(arg, sd);\r\n denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n\r\n // The result will have 5 rounding digits.\r\n r = divide(num, denominator, sd, 1);\r\n\r\n // If at a rounding boundary, i.e. the result's rounding digits are [49]9999 or [50]0000,\r\n // calculate 10 further digits.\r\n //\r\n // If the result is known to have an infinite decimal expansion, repeat this until it is clear\r\n // that the result is above or below the boundary. Otherwise, if after calculating the 10\r\n // further digits, the last 14 are nines, round up and assume the result is exact.\r\n // Also assume the result is exact if the last 14 are zero.\r\n //\r\n // Example of a result that will be incorrectly rounded:\r\n // log[1048576](4503599627370502) = 2.60000000000000009610279511444746...\r\n // The above result correctly rounded using ROUND_CEIL to 1 decimal place should be 2.7, but it\r\n // will be given as 2.6 as there are 15 zeros immediately after the requested decimal place, so\r\n // the exact result would be assumed to be 2.6, which rounded using ROUND_CEIL to 1 decimal\r\n // place is still 2.6.\r\n if (checkRoundingDigits(r.d, k = pr, rm)) {\r\n\r\n do {\r\n sd += 10;\r\n num = naturalLogarithm(arg, sd);\r\n denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n r = divide(num, denominator, sd, 1);\r\n\r\n if (!inf) {\r\n\r\n // Check for 14 nines from the 2nd rounding digit, as the first may be 4.\r\n if (+digitsToString(r.d).slice(k + 1, k + 15) + 1 == 1e14) {\r\n r = finalise(r, pr + 1, 0);\r\n }\r\n\r\n break;\r\n }\r\n } while (checkRoundingDigits(r.d, k += 10, rm));\r\n }\r\n\r\n external = true;\r\n\r\n return finalise(r, pr, rm);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the maximum of the arguments and the value of this Decimal.\r\n *\r\n * arguments {number|string|Decimal}\r\n *\r\n P.max = function () {\r\n Array.prototype.push.call(arguments, this);\r\n return maxOrMin(this.constructor, arguments, 'lt');\r\n };\r\n */\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the minimum of the arguments and the value of this Decimal.\r\n *\r\n * arguments {number|string|Decimal}\r\n *\r\n P.min = function () {\r\n Array.prototype.push.call(arguments, this);\r\n return maxOrMin(this.constructor, arguments, 'gt');\r\n };\r\n */\r\n\r\n\r\n /*\r\n * n - 0 = n\r\n * n - N = N\r\n * n - I = -I\r\n * 0 - n = -n\r\n * 0 - 0 = 0\r\n * 0 - N = N\r\n * 0 - I = -I\r\n * N - n = N\r\n * N - 0 = N\r\n * N - N = N\r\n * N - I = N\r\n * I - n = I\r\n * I - 0 = I\r\n * I - N = N\r\n * I - I = N\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal minus `y`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n */\r\n P.minus = P.sub = function (y) {\r\n var d, e, i, j, k, len, pr, rm, xd, xe, xLTy, yd,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n y = new Ctor(y);\r\n\r\n // If either is not finite...\r\n if (!x.d || !y.d) {\r\n\r\n // Return NaN if either is NaN.\r\n if (!x.s || !y.s) y = new Ctor(NaN);\r\n\r\n // Return y negated if x is finite and y is ±Infinity.\r\n else if (x.d) y.s = -y.s;\r\n\r\n // Return x if y is finite and x is ±Infinity.\r\n // Return x if both are ±Infinity with different signs.\r\n // Return NaN if both are ±Infinity with the same sign.\r\n else y = new Ctor(y.d || x.s !== y.s ? x : NaN);\r\n\r\n return y;\r\n }\r\n\r\n // If signs differ...\r\n if (x.s != y.s) {\r\n y.s = -y.s;\r\n return x.plus(y);\r\n }\r\n\r\n xd = x.d;\r\n yd = y.d;\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n\r\n // If either is zero...\r\n if (!xd[0] || !yd[0]) {\r\n\r\n // Return y negated if x is zero and y is non-zero.\r\n if (yd[0]) y.s = -y.s;\r\n\r\n // Return x if y is zero and x is non-zero.\r\n else if (xd[0]) y = new Ctor(x);\r\n\r\n // Return zero if both are zero.\r\n // From IEEE 754 (2008) 6.3: 0 - 0 = -0 - -0 = -0 when rounding to -Infinity.\r\n else return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n return external ? finalise(y, pr, rm) : y;\r\n }\r\n\r\n // x and y are finite, non-zero numbers with the same sign.\r\n\r\n // Calculate base 1e7 exponents.\r\n e = mathfloor(y.e / LOG_BASE);\r\n xe = mathfloor(x.e / LOG_BASE);\r\n\r\n xd = xd.slice();\r\n k = xe - e;\r\n\r\n // If base 1e7 exponents differ...\r\n if (k) {\r\n xLTy = k < 0;\r\n\r\n if (xLTy) {\r\n d = xd;\r\n k = -k;\r\n len = yd.length;\r\n } else {\r\n d = yd;\r\n e = xe;\r\n len = xd.length;\r\n }\r\n\r\n // Numbers with massively different exponents would result in a very high number of\r\n // zeros needing to be prepended, but this can be avoided while still ensuring correct\r\n // rounding by limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.\r\n i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;\r\n\r\n if (k > i) {\r\n k = i;\r\n d.length = 1;\r\n }\r\n\r\n // Prepend zeros to equalise exponents.\r\n d.reverse();\r\n for (i = k; i--;) d.push(0);\r\n d.reverse();\r\n\r\n // Base 1e7 exponents equal.\r\n } else {\r\n\r\n // Check digits to determine which is the bigger number.\r\n\r\n i = xd.length;\r\n len = yd.length;\r\n xLTy = i < len;\r\n if (xLTy) len = i;\r\n\r\n for (i = 0; i < len; i++) {\r\n if (xd[i] != yd[i]) {\r\n xLTy = xd[i] < yd[i];\r\n break;\r\n }\r\n }\r\n\r\n k = 0;\r\n }\r\n\r\n if (xLTy) {\r\n d = xd;\r\n xd = yd;\r\n yd = d;\r\n y.s = -y.s;\r\n }\r\n\r\n len = xd.length;\r\n\r\n // Append zeros to `xd` if shorter.\r\n // Don't add zeros to `yd` if shorter as subtraction only needs to start at `yd` length.\r\n for (i = yd.length - len; i > 0; --i) xd[len++] = 0;\r\n\r\n // Subtract yd from xd.\r\n for (i = yd.length; i > k;) {\r\n\r\n if (xd[--i] < yd[i]) {\r\n for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;\r\n --xd[j];\r\n xd[i] += BASE;\r\n }\r\n\r\n xd[i] -= yd[i];\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (; xd[--len] === 0;) xd.pop();\r\n\r\n // Remove leading zeros and adjust exponent accordingly.\r\n for (; xd[0] === 0; xd.shift()) --e;\r\n\r\n // Zero?\r\n if (!xd[0]) return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n y.d = xd;\r\n y.e = getBase10Exponent(xd, e);\r\n\r\n return external ? finalise(y, pr, rm) : y;\r\n };\r\n\r\n\r\n /*\r\n * n % 0 = N\r\n * n % N = N\r\n * n % I = n\r\n * 0 % n = 0\r\n * -0 % n = -0\r\n * 0 % 0 = N\r\n * 0 % N = N\r\n * 0 % I = 0\r\n * N % n = N\r\n * N % 0 = N\r\n * N % N = N\r\n * N % I = N\r\n * I % n = N\r\n * I % 0 = N\r\n * I % N = N\r\n * I % I = N\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal modulo `y`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * The result depends on the modulo mode.\r\n *\r\n */\r\n P.modulo = P.mod = function (y) {\r\n var q,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n y = new Ctor(y);\r\n\r\n // Return NaN if x is ±Infinity or NaN, or y is NaN or ±0.\r\n if (!x.d || !y.s || y.d && !y.d[0]) return new Ctor(NaN);\r\n\r\n // Return x if y is ±Infinity or x is ±0.\r\n if (!y.d || x.d && !x.d[0]) {\r\n return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);\r\n }\r\n\r\n // Prevent rounding of intermediate calculations.\r\n external = false;\r\n\r\n if (Ctor.modulo == 9) {\r\n\r\n // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n // result = x - q * y where 0 <= result < abs(y)\r\n q = divide(x, y.abs(), 0, 3, 1);\r\n q.s *= y.s;\r\n } else {\r\n q = divide(x, y, 0, Ctor.modulo, 1);\r\n }\r\n\r\n q = q.times(y);\r\n\r\n external = true;\r\n\r\n return x.minus(q);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the natural exponential of the value of this Decimal,\r\n * i.e. the base e raised to the power the value of this Decimal, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n */\r\n P.naturalExponential = P.exp = function () {\r\n return naturalExponential(this);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the natural logarithm of the value of this Decimal,\r\n * rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n */\r\n P.naturalLogarithm = P.ln = function () {\r\n return naturalLogarithm(this);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by\r\n * -1.\r\n *\r\n */\r\n P.negated = P.neg = function () {\r\n var x = new this.constructor(this);\r\n x.s = -x.s;\r\n return finalise(x);\r\n };\r\n\r\n\r\n /*\r\n * n + 0 = n\r\n * n + N = N\r\n * n + I = I\r\n * 0 + n = n\r\n * 0 + 0 = 0\r\n * 0 + N = N\r\n * 0 + I = I\r\n * N + n = N\r\n * N + 0 = N\r\n * N + N = N\r\n * N + I = N\r\n * I + n = I\r\n * I + 0 = I\r\n * I + N = N\r\n * I + I = I\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal plus `y`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n */\r\n P.plus = P.add = function (y) {\r\n var carry, d, e, i, k, len, pr, rm, xd, yd,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n y = new Ctor(y);\r\n\r\n // If either is not finite...\r\n if (!x.d || !y.d) {\r\n\r\n // Return NaN if either is NaN.\r\n if (!x.s || !y.s) y = new Ctor(NaN);\r\n\r\n // Return x if y is finite and x is ±Infinity.\r\n // Return x if both are ±Infinity with the same sign.\r\n // Return NaN if both are ±Infinity with different signs.\r\n // Return y if x is finite and y is ±Infinity.\r\n else if (!x.d) y = new Ctor(y.d || x.s === y.s ? x : NaN);\r\n\r\n return y;\r\n }\r\n\r\n // If signs differ...\r\n if (x.s != y.s) {\r\n y.s = -y.s;\r\n return x.minus(y);\r\n }\r\n\r\n xd = x.d;\r\n yd = y.d;\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n\r\n // If either is zero...\r\n if (!xd[0] || !yd[0]) {\r\n\r\n // Return x if y is zero.\r\n // Return y if y is non-zero.\r\n if (!yd[0]) y = new Ctor(x);\r\n\r\n return external ? finalise(y, pr, rm) : y;\r\n }\r\n\r\n // x and y are finite, non-zero numbers with the same sign.\r\n\r\n // Calculate base 1e7 exponents.\r\n k = mathfloor(x.e / LOG_BASE);\r\n e = mathfloor(y.e / LOG_BASE);\r\n\r\n xd = xd.slice();\r\n i = k - e;\r\n\r\n // If base 1e7 exponents differ...\r\n if (i) {\r\n\r\n if (i < 0) {\r\n d = xd;\r\n i = -i;\r\n len = yd.length;\r\n } else {\r\n d = yd;\r\n e = k;\r\n len = xd.length;\r\n }\r\n\r\n // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.\r\n k = Math.ceil(pr / LOG_BASE);\r\n len = k > len ? k + 1 : len + 1;\r\n\r\n if (i > len) {\r\n i = len;\r\n d.length = 1;\r\n }\r\n\r\n // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.\r\n d.reverse();\r\n for (; i--;) d.push(0);\r\n d.reverse();\r\n }\r\n\r\n len = xd.length;\r\n i = yd.length;\r\n\r\n // If yd is longer than xd, swap xd and yd so xd points to the longer array.\r\n if (len - i < 0) {\r\n i = len;\r\n d = yd;\r\n yd = xd;\r\n xd = d;\r\n }\r\n\r\n // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.\r\n for (carry = 0; i;) {\r\n carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;\r\n xd[i] %= BASE;\r\n }\r\n\r\n if (carry) {\r\n xd.unshift(carry);\r\n ++e;\r\n }\r\n\r\n // Remove trailing zeros.\r\n // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n for (len = xd.length; xd[--len] == 0;) xd.pop();\r\n\r\n y.d = xd;\r\n y.e = getBase10Exponent(xd, e);\r\n\r\n return external ? finalise(y, pr, rm) : y;\r\n };\r\n\r\n\r\n /*\r\n * Return the number of significant digits of the value of this Decimal.\r\n *\r\n * [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.\r\n *\r\n */\r\n P.precision = P.sd = function (z) {\r\n var k,\r\n x = this;\r\n\r\n if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);\r\n\r\n if (x.d) {\r\n k = getPrecision(x.d);\r\n if (z && x.e + 1 > k) k = x.e + 1;\r\n } else {\r\n k = NaN;\r\n }\r\n\r\n return k;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a whole number using\r\n * rounding mode `rounding`.\r\n *\r\n */\r\n P.round = function () {\r\n var x = this,\r\n Ctor = x.constructor;\r\n\r\n return finalise(new Ctor(x), x.e + 1, Ctor.rounding);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the sine of the value in radians of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n *\r\n * sin(x) = x - x^3/3! + x^5/5! - ...\r\n *\r\n * sin(0) = 0\r\n * sin(-0) = -0\r\n * sin(Infinity) = NaN\r\n * sin(-Infinity) = NaN\r\n * sin(NaN) = NaN\r\n *\r\n */\r\n P.sine = P.sin = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite()) return new Ctor(NaN);\r\n if (x.isZero()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n Ctor.rounding = 1;\r\n\r\n x = sine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return finalise(quadrant > 2 ? x.neg() : x, pr, rm, true);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the square root of this Decimal, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * sqrt(-n) = N\r\n * sqrt(N) = N\r\n * sqrt(-I) = N\r\n * sqrt(I) = I\r\n * sqrt(0) = 0\r\n * sqrt(-0) = -0\r\n *\r\n */\r\n P.squareRoot = P.sqrt = function () {\r\n var m, n, sd, r, rep, t,\r\n x = this,\r\n d = x.d,\r\n e = x.e,\r\n s = x.s,\r\n Ctor = x.constructor;\r\n\r\n // Negative/NaN/Infinity/zero?\r\n if (s !== 1 || !d || !d[0]) {\r\n return new Ctor(!s || s < 0 && (!d || d[0]) ? NaN : d ? x : 1 / 0);\r\n }\r\n\r\n external = false;\r\n\r\n // Initial estimate.\r\n s = Math.sqrt(+x);\r\n\r\n // Math.sqrt underflow/overflow?\r\n // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n if (s == 0 || s == 1 / 0) {\r\n n = digitsToString(d);\r\n\r\n if ((n.length + e) % 2 == 0) n += '0';\r\n s = Math.sqrt(n);\r\n e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n if (s == 1 / 0) {\r\n n = '5e' + e;\r\n } else {\r\n n = s.toExponential();\r\n n = n.slice(0, n.indexOf('e') + 1) + e;\r\n }\r\n\r\n r = new Ctor(n);\r\n } else {\r\n r = new Ctor(s.toString());\r\n }\r\n\r\n sd = (e = Ctor.precision) + 3;\r\n\r\n // Newton-Raphson iteration.\r\n for (;;) {\r\n t = r;\r\n r = t.plus(divide(x, t, sd + 2, 1)).times(0.5);\r\n\r\n // TODO? Replace with for-loop and checkRoundingDigits.\r\n if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n n = n.slice(sd - 3, sd + 1);\r\n\r\n // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or\r\n // 4999, i.e. approaching a rounding boundary, continue the iteration.\r\n if (n == '9999' || !rep && n == '4999') {\r\n\r\n // On the first iteration only, check to see if rounding up gives the exact result as the\r\n // nines may infinitely repeat.\r\n if (!rep) {\r\n finalise(t, e + 1, 0);\r\n\r\n if (t.times(t).eq(x)) {\r\n r = t;\r\n break;\r\n }\r\n }\r\n\r\n sd += 4;\r\n rep = 1;\r\n } else {\r\n\r\n // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n // If not, then there are further digits and m will be truthy.\r\n if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n // Truncate to the first rounding digit.\r\n finalise(r, e + 1, 1);\r\n m = !r.times(r).eq(x);\r\n }\r\n\r\n break;\r\n }\r\n }\r\n }\r\n\r\n external = true;\r\n\r\n return finalise(r, e, Ctor.rounding, m);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the tangent of the value in radians of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n *\r\n * tan(0) = 0\r\n * tan(-0) = -0\r\n * tan(Infinity) = NaN\r\n * tan(-Infinity) = NaN\r\n * tan(NaN) = NaN\r\n *\r\n */\r\n P.tangent = P.tan = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite()) return new Ctor(NaN);\r\n if (x.isZero()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + 10;\r\n Ctor.rounding = 1;\r\n\r\n x = x.sin();\r\n x.s = 1;\r\n x = divide(x, new Ctor(1).minus(x.times(x)).sqrt(), pr + 10, 0);\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return finalise(quadrant == 2 || quadrant == 4 ? x.neg() : x, pr, rm, true);\r\n };\r\n\r\n\r\n /*\r\n * n * 0 = 0\r\n * n * N = N\r\n * n * I = I\r\n * 0 * n = 0\r\n * 0 * 0 = 0\r\n * 0 * N = N\r\n * 0 * I = N\r\n * N * n = N\r\n * N * 0 = N\r\n * N * N = N\r\n * N * I = N\r\n * I * n = I\r\n * I * 0 = N\r\n * I * N = N\r\n * I * I = I\r\n *\r\n * Return a new Decimal whose value is this Decimal times `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n */\r\n P.times = P.mul = function (y) {\r\n var carry, e, i, k, r, rL, t, xdL, ydL,\r\n x = this,\r\n Ctor = x.constructor,\r\n xd = x.d,\r\n yd = (y = new Ctor(y)).d;\r\n\r\n y.s *= x.s;\r\n\r\n // If either is NaN, ±Infinity or ±0...\r\n if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n return new Ctor(!y.s || xd && !xd[0] && !yd || yd && !yd[0] && !xd\r\n\r\n // Return NaN if either is NaN.\r\n // Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.\r\n ? NaN\r\n\r\n // Return ±Infinity if either is ±Infinity.\r\n // Return ±0 if either is ±0.\r\n : !xd || !yd ? y.s / 0 : y.s * 0);\r\n }\r\n\r\n e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);\r\n xdL = xd.length;\r\n ydL = yd.length;\r\n\r\n // Ensure xd points to the longer array.\r\n if (xdL < ydL) {\r\n r = xd;\r\n xd = yd;\r\n yd = r;\r\n rL = xdL;\r\n xdL = ydL;\r\n ydL = rL;\r\n }\r\n\r\n // Initialise the result array with zeros.\r\n r = [];\r\n rL = xdL + ydL;\r\n for (i = rL; i--;) r.push(0);\r\n\r\n // Multiply!\r\n for (i = ydL; --i >= 0;) {\r\n carry = 0;\r\n for (k = xdL + i; k > i;) {\r\n t = r[k] + yd[i] * xd[k - i - 1] + carry;\r\n r[k--] = t % BASE | 0;\r\n carry = t / BASE | 0;\r\n }\r\n\r\n r[k] = (r[k] + carry) % BASE | 0;\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (; !r[--rL];) r.pop();\r\n\r\n if (carry) ++e;\r\n else r.shift();\r\n\r\n y.d = r;\r\n y.e = getBase10Exponent(r, e);\r\n\r\n return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Decimal in base 2, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n *\r\n * If the optional `sd` argument is present then return binary exponential notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\n P.toBinary = function (sd, rm) {\r\n return toStringBinary(this, 2, sd, rm);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`\r\n * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.\r\n *\r\n * If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\n P.toDecimalPlaces = P.toDP = function (dp, rm) {\r\n var x = this,\r\n Ctor = x.constructor;\r\n\r\n x = new Ctor(x);\r\n if (dp === void 0) return x;\r\n\r\n checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n\r\n return finalise(x, dp + x.e + 1, rm);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Decimal in exponential notation rounded to\r\n * `dp` fixed decimal places using rounding mode `rounding`.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\n P.toExponential = function (dp, rm) {\r\n var str,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (dp === void 0) {\r\n str = finiteToString(x, true);\r\n } else {\r\n checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n\r\n x = finalise(new Ctor(x), dp + 1, rm);\r\n str = finiteToString(x, true, dp + 1);\r\n }\r\n\r\n return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Decimal in normal (fixed-point) notation to\r\n * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is\r\n * omitted.\r\n *\r\n * As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n * (-0).toFixed(3) is '0.000'.\r\n * (-0.5).toFixed(0) is '-0'.\r\n *\r\n */\r\n P.toFixed = function (dp, rm) {\r\n var str, y,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (dp === void 0) {\r\n str = finiteToString(x);\r\n } else {\r\n checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n\r\n y = finalise(new Ctor(x), dp + x.e + 1, rm);\r\n str = finiteToString(y, false, dp + y.e + 1);\r\n }\r\n\r\n // To determine whether to add the minus sign look at the value before it was rounded,\r\n // i.e. look at `x` rather than `y`.\r\n return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n };\r\n\r\n\r\n /*\r\n * Return an array representing the value of this Decimal as a simple fraction with an integer\r\n * numerator and an integer denominator.\r\n *\r\n * The denominator will be a positive non-zero value less than or equal to the specified maximum\r\n * denominator. If a maximum denominator is not specified, the denominator will be the lowest\r\n * value necessary to represent the number exactly.\r\n *\r\n * [maxD] {number|string|Decimal} Maximum denominator. Integer >= 1 and < Infinity.\r\n *\r\n */\r\n P.toFraction = function (maxD) {\r\n var d, d0, d1, d2, e, k, n, n0, n1, pr, q, r,\r\n x = this,\r\n xd = x.d,\r\n Ctor = x.constructor;\r\n\r\n if (!xd) return new Ctor(x);\r\n\r\n n1 = d0 = new Ctor(1);\r\n d1 = n0 = new Ctor(0);\r\n\r\n d = new Ctor(d1);\r\n e = d.e = getPrecision(xd) - x.e - 1;\r\n k = e % LOG_BASE;\r\n d.d[0] = mathpow(10, k < 0 ? LOG_BASE + k : k);\r\n\r\n if (maxD == null) {\r\n\r\n // d is 10**e, the minimum max-denominator needed.\r\n maxD = e > 0 ? d : n1;\r\n } else {\r\n n = new Ctor(maxD);\r\n if (!n.isInt() || n.lt(n1)) throw Error(invalidArgument + n);\r\n maxD = n.gt(d) ? (e > 0 ? d : n1) : n;\r\n }\r\n\r\n external = false;\r\n n = new Ctor(digitsToString(xd));\r\n pr = Ctor.precision;\r\n Ctor.precision = e = xd.length * LOG_BASE * 2;\r\n\r\n for (;;) {\r\n q = divide(n, d, 0, 1, 1);\r\n d2 = d0.plus(q.times(d1));\r\n if (d2.cmp(maxD) == 1) break;\r\n d0 = d1;\r\n d1 = d2;\r\n d2 = n1;\r\n n1 = n0.plus(q.times(d2));\r\n n0 = d2;\r\n d2 = d;\r\n d = n.minus(q.times(d2));\r\n n = d2;\r\n }\r\n\r\n d2 = divide(maxD.minus(d0), d1, 0, 1, 1);\r\n n0 = n0.plus(d2.times(n1));\r\n d0 = d0.plus(d2.times(d1));\r\n n0.s = n1.s = x.s;\r\n\r\n // Determine which fraction is closer to x, n0/d0 or n1/d1?\r\n r = divide(n1, d1, e, 1).minus(x).abs().cmp(divide(n0, d0, e, 1).minus(x).abs()) < 1\r\n ? [n1, d1] : [n0, d0];\r\n\r\n Ctor.precision = pr;\r\n external = true;\r\n\r\n return r;\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Decimal in base 16, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n *\r\n * If the optional `sd` argument is present then return binary exponential notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\n P.toHexadecimal = P.toHex = function (sd, rm) {\r\n return toStringBinary(this, 16, sd, rm);\r\n };\r\n\r\n\r\n /*\r\n * Returns a new Decimal whose value is the nearest multiple of `y` in the direction of rounding\r\n * mode `rm`, or `Decimal.rounding` if `rm` is omitted, to the value of this Decimal.\r\n *\r\n * The return value will always have the same sign as this Decimal, unless either this Decimal\r\n * or `y` is NaN, in which case the return value will be also be NaN.\r\n *\r\n * The return value is not affected by the value of `precision`.\r\n *\r\n * y {number|string|Decimal} The magnitude to round to a multiple of.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * 'toNearest() rounding mode not an integer: {rm}'\r\n * 'toNearest() rounding mode out of range: {rm}'\r\n *\r\n */\r\n P.toNearest = function (y, rm) {\r\n var x = this,\r\n Ctor = x.constructor;\r\n\r\n x = new Ctor(x);\r\n\r\n if (y == null) {\r\n\r\n // If x is not finite, return x.\r\n if (!x.d) return x;\r\n\r\n y = new Ctor(1);\r\n rm = Ctor.rounding;\r\n } else {\r\n y = new Ctor(y);\r\n if (rm === void 0) {\r\n rm = Ctor.rounding;\r\n } else {\r\n checkInt32(rm, 0, 8);\r\n }\r\n\r\n // If x is not finite, return x if y is not NaN, else NaN.\r\n if (!x.d) return y.s ? x : y;\r\n\r\n // If y is not finite, return Infinity with the sign of x if y is Infinity, else NaN.\r\n if (!y.d) {\r\n if (y.s) y.s = x.s;\r\n return y;\r\n }\r\n }\r\n\r\n // If y is not zero, calculate the nearest multiple of y to x.\r\n if (y.d[0]) {\r\n external = false;\r\n x = divide(x, y, 0, rm, 1).times(y);\r\n external = true;\r\n finalise(x);\r\n\r\n // If y is zero, return zero with the sign of x.\r\n } else {\r\n y.s = x.s;\r\n x = y;\r\n }\r\n\r\n return x;\r\n };\r\n\r\n\r\n /*\r\n * Return the value of this Decimal converted to a number primitive.\r\n * Zero keeps its sign.\r\n *\r\n */\r\n P.toNumber = function () {\r\n return +this;\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Decimal in base 8, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n *\r\n * If the optional `sd` argument is present then return binary exponential notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\n P.toOctal = function (sd, rm) {\r\n return toStringBinary(this, 8, sd, rm);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the value of this Decimal raised to the power `y`, rounded\r\n * to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * ECMAScript compliant.\r\n *\r\n * pow(x, NaN) = NaN\r\n * pow(x, ±0) = 1\r\n\r\n * pow(NaN, non-zero) = NaN\r\n * pow(abs(x) > 1, +Infinity) = +Infinity\r\n * pow(abs(x) > 1, -Infinity) = +0\r\n * pow(abs(x) == 1, ±Infinity) = NaN\r\n * pow(abs(x) < 1, +Infinity) = +0\r\n * pow(abs(x) < 1, -Infinity) = +Infinity\r\n * pow(+Infinity, y > 0) = +Infinity\r\n * pow(+Infinity, y < 0) = +0\r\n * pow(-Infinity, odd integer > 0) = -Infinity\r\n * pow(-Infinity, even integer > 0) = +Infinity\r\n * pow(-Infinity, odd integer < 0) = -0\r\n * pow(-Infinity, even integer < 0) = +0\r\n * pow(+0, y > 0) = +0\r\n * pow(+0, y < 0) = +Infinity\r\n * pow(-0, odd integer > 0) = -0\r\n * pow(-0, even integer > 0) = +0\r\n * pow(-0, odd integer < 0) = -Infinity\r\n * pow(-0, even integer < 0) = +Infinity\r\n * pow(finite x < 0, finite non-integer) = NaN\r\n *\r\n * For non-integer or very large exponents pow(x, y) is calculated using\r\n *\r\n * x^y = exp(y*ln(x))\r\n *\r\n * Assuming the first 15 rounding digits are each equally likely to be any digit 0-9, the\r\n * probability of an incorrectly rounded result\r\n * P([49]9{14} | [50]0{14}) = 2 * 0.2 * 10^-14 = 4e-15 = 1/2.5e+14\r\n * i.e. 1 in 250,000,000,000,000\r\n *\r\n * If a result is incorrectly rounded the maximum error will be 1 ulp (unit in last place).\r\n *\r\n * y {number|string|Decimal} The power to which to raise this Decimal.\r\n *\r\n */\r\n P.toPower = P.pow = function (y) {\r\n var e, k, pr, r, rm, s,\r\n x = this,\r\n Ctor = x.constructor,\r\n yn = +(y = new Ctor(y));\r\n\r\n // Either ±Infinity, NaN or ±0?\r\n if (!x.d || !y.d || !x.d[0] || !y.d[0]) return new Ctor(mathpow(+x, yn));\r\n\r\n x = new Ctor(x);\r\n\r\n if (x.eq(1)) return x;\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n\r\n if (y.eq(1)) return finalise(x, pr, rm);\r\n\r\n // y exponent\r\n e = mathfloor(y.e / LOG_BASE);\r\n\r\n // If y is a small integer use the 'exponentiation by squaring' algorithm.\r\n if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {\r\n r = intPow(Ctor, x, k, pr);\r\n return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);\r\n }\r\n\r\n s = x.s;\r\n\r\n // if x is negative\r\n if (s < 0) {\r\n\r\n // if y is not an integer\r\n if (e < y.d.length - 1) return new Ctor(NaN);\r\n\r\n // Result is positive if x is negative and the last digit of integer y is even.\r\n if ((y.d[e] & 1) == 0) s = 1;\r\n\r\n // if x.eq(-1)\r\n if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {\r\n x.s = s;\r\n return x;\r\n }\r\n }\r\n\r\n // Estimate result exponent.\r\n // x^y = 10^e, where e = y * log10(x)\r\n // log10(x) = log10(x_significand) + x_exponent\r\n // log10(x_significand) = ln(x_significand) / ln(10)\r\n k = mathpow(+x, yn);\r\n e = k == 0 || !isFinite(k)\r\n ? mathfloor(yn * (Math.log('0.' + digitsToString(x.d)) / Math.LN10 + x.e + 1))\r\n : new Ctor(k + '').e;\r\n\r\n // Exponent estimate may be incorrect e.g. x: 0.999999999999999999, y: 2.29, e: 0, r.e: -1.\r\n\r\n // Overflow/underflow?\r\n if (e > Ctor.maxE + 1 || e < Ctor.minE - 1) return new Ctor(e > 0 ? s / 0 : 0);\r\n\r\n external = false;\r\n Ctor.rounding = x.s = 1;\r\n\r\n // Estimate the extra guard digits needed to ensure five correct rounding digits from\r\n // naturalLogarithm(x). Example of failure without these extra digits (precision: 10):\r\n // new Decimal(2.32456).pow('2087987436534566.46411')\r\n // should be 1.162377823e+764914905173815, but is 1.162355823e+764914905173815\r\n k = Math.min(12, (e + '').length);\r\n\r\n // r = x^y = exp(y*ln(x))\r\n r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);\r\n\r\n // r may be Infinity, e.g. (0.9999999999999999).pow(-1e+40)\r\n if (r.d) {\r\n\r\n // Truncate to the required precision plus five rounding digits.\r\n r = finalise(r, pr + 5, 1);\r\n\r\n // If the rounding digits are [49]9999 or [50]0000 increase the precision by 10 and recalculate\r\n // the result.\r\n if (checkRoundingDigits(r.d, pr, rm)) {\r\n e = pr + 10;\r\n\r\n // Truncate to the increased precision plus five rounding digits.\r\n r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);\r\n\r\n // Check for 14 nines from the 2nd rounding digit (the first rounding digit may be 4 or 9).\r\n if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {\r\n r = finalise(r, pr + 1, 0);\r\n }\r\n }\r\n }\r\n\r\n r.s = s;\r\n external = true;\r\n Ctor.rounding = rm;\r\n\r\n return finalise(r, pr, rm);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Decimal rounded to `sd` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * Return exponential notation if `sd` is less than the number of digits necessary to represent\r\n * the integer part of the value in normal notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\n P.toPrecision = function (sd, rm) {\r\n var str,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (sd === void 0) {\r\n str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n } else {\r\n checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n\r\n x = finalise(new Ctor(x), sd, rm);\r\n str = finiteToString(x, sd <= x.e || x.e <= Ctor.toExpNeg, sd);\r\n }\r\n\r\n return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`\r\n * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if\r\n * omitted.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * 'toSD() digits out of range: {sd}'\r\n * 'toSD() digits not an integer: {sd}'\r\n * 'toSD() rounding mode not an integer: {rm}'\r\n * 'toSD() rounding mode out of range: {rm}'\r\n *\r\n */\r\n P.toSignificantDigits = P.toSD = function (sd, rm) {\r\n var x = this,\r\n Ctor = x.constructor;\r\n\r\n if (sd === void 0) {\r\n sd = Ctor.precision;\r\n rm = Ctor.rounding;\r\n } else {\r\n checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n }\r\n\r\n return finalise(new Ctor(x), sd, rm);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Decimal.\r\n *\r\n * Return exponential notation if this Decimal has a positive exponent equal to or greater than\r\n * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.\r\n *\r\n */\r\n P.toString = function () {\r\n var x = this,\r\n Ctor = x.constructor,\r\n str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n\r\n return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the value of this Decimal truncated to a whole number.\r\n *\r\n */\r\n P.truncated = P.trunc = function () {\r\n return finalise(new this.constructor(this), this.e + 1, 1);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this Decimal.\r\n * Unlike `toString`, negative zero will include the minus sign.\r\n *\r\n */\r\n P.valueOf = P.toJSON = function () {\r\n var x = this,\r\n Ctor = x.constructor,\r\n str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n\r\n return x.isNeg() ? '-' + str : str;\r\n };\r\n\r\n\r\n // Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.\r\n\r\n\r\n /*\r\n * digitsToString P.cubeRoot, P.logarithm, P.squareRoot, P.toFraction, P.toPower,\r\n * finiteToString, naturalExponential, naturalLogarithm\r\n * checkInt32 P.toDecimalPlaces, P.toExponential, P.toFixed, P.toNearest,\r\n * P.toPrecision, P.toSignificantDigits, toStringBinary, random\r\n * checkRoundingDigits P.logarithm, P.toPower, naturalExponential, naturalLogarithm\r\n * convertBase toStringBinary, parseOther\r\n * cos P.cos\r\n * divide P.atanh, P.cubeRoot, P.dividedBy, P.dividedToIntegerBy,\r\n * P.logarithm, P.modulo, P.squareRoot, P.tan, P.tanh, P.toFraction,\r\n * P.toNearest, toStringBinary, naturalExponential, naturalLogarithm,\r\n * taylorSeries, atan2, parseOther\r\n * finalise P.absoluteValue, P.atan, P.atanh, P.ceil, P.cos, P.cosh,\r\n * P.cubeRoot, P.dividedToIntegerBy, P.floor, P.logarithm, P.minus,\r\n * P.modulo, P.negated, P.plus, P.round, P.sin, P.sinh, P.squareRoot,\r\n * P.tan, P.times, P.toDecimalPlaces, P.toExponential, P.toFixed,\r\n * P.toNearest, P.toPower, P.toPrecision, P.toSignificantDigits,\r\n * P.truncated, divide, getLn10, getPi, naturalExponential,\r\n * naturalLogarithm, ceil, floor, round, trunc\r\n * finiteToString P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf,\r\n * toStringBinary\r\n * getBase10Exponent P.minus, P.plus, P.times, parseOther\r\n * getLn10 P.logarithm, naturalLogarithm\r\n * getPi P.acos, P.asin, P.atan, toLessThanHalfPi, atan2\r\n * getPrecision P.precision, P.toFraction\r\n * getZeroString digitsToString, finiteToString\r\n * intPow P.toPower, parseOther\r\n * isOdd toLessThanHalfPi\r\n * maxOrMin max, min\r\n * naturalExponential P.naturalExponential, P.toPower\r\n * naturalLogarithm P.acosh, P.asinh, P.atanh, P.logarithm, P.naturalLogarithm,\r\n * P.toPower, naturalExponential\r\n * nonFiniteToString finiteToString, toStringBinary\r\n * parseDecimal Decimal\r\n * parseOther Decimal\r\n * sin P.sin\r\n * taylorSeries P.cosh, P.sinh, cos, sin\r\n * toLessThanHalfPi P.cos, P.sin\r\n * toStringBinary P.toBinary, P.toHexadecimal, P.toOctal\r\n * truncate intPow\r\n *\r\n * Throws: P.logarithm, P.precision, P.toFraction, checkInt32, getLn10, getPi,\r\n * naturalLogarithm, config, parseOther, random, Decimal\r\n */\r\n\r\n\r\n function digitsToString(d) {\r\n var i, k, ws,\r\n indexOfLastWord = d.length - 1,\r\n str = '',\r\n w = d[0];\r\n\r\n if (indexOfLastWord > 0) {\r\n str += w;\r\n for (i = 1; i < indexOfLastWord; i++) {\r\n ws = d[i] + '';\r\n k = LOG_BASE - ws.length;\r\n if (k) str += getZeroString(k);\r\n str += ws;\r\n }\r\n\r\n w = d[i];\r\n ws = w + '';\r\n k = LOG_BASE - ws.length;\r\n if (k) str += getZeroString(k);\r\n } else if (w === 0) {\r\n return '0';\r\n }\r\n\r\n // Remove trailing zeros of last w.\r\n for (; w % 10 === 0;) w /= 10;\r\n\r\n return str + w;\r\n }\r\n\r\n\r\n function checkInt32(i, min, max) {\r\n if (i !== ~~i || i < min || i > max) {\r\n throw Error(invalidArgument + i);\r\n }\r\n }\r\n\r\n\r\n /*\r\n * Check 5 rounding digits if `repeating` is null, 4 otherwise.\r\n * `repeating == null` if caller is `log` or `pow`,\r\n * `repeating != null` if caller is `naturalLogarithm` or `naturalExponential`.\r\n */\r\n function checkRoundingDigits(d, i, rm, repeating) {\r\n var di, k, r, rd;\r\n\r\n // Get the length of the first word of the array d.\r\n for (k = d[0]; k >= 10; k /= 10) --i;\r\n\r\n // Is the rounding digit in the first word of d?\r\n if (--i < 0) {\r\n i += LOG_BASE;\r\n di = 0;\r\n } else {\r\n di = Math.ceil((i + 1) / LOG_BASE);\r\n i %= LOG_BASE;\r\n }\r\n\r\n // i is the index (0 - 6) of the rounding digit.\r\n // E.g. if within the word 3487563 the first rounding digit is 5,\r\n // then i = 4, k = 1000, rd = 3487563 % 1000 = 563\r\n k = mathpow(10, LOG_BASE - i);\r\n rd = d[di] % k | 0;\r\n\r\n if (repeating == null) {\r\n if (i < 3) {\r\n if (i == 0) rd = rd / 100 | 0;\r\n else if (i == 1) rd = rd / 10 | 0;\r\n r = rm < 4 && rd == 99999 || rm > 3 && rd == 49999 || rd == 50000 || rd == 0;\r\n } else {\r\n r = (rm < 4 && rd + 1 == k || rm > 3 && rd + 1 == k / 2) &&\r\n (d[di + 1] / k / 100 | 0) == mathpow(10, i - 2) - 1 ||\r\n (rd == k / 2 || rd == 0) && (d[di + 1] / k / 100 | 0) == 0;\r\n }\r\n } else {\r\n if (i < 4) {\r\n if (i == 0) rd = rd / 1000 | 0;\r\n else if (i == 1) rd = rd / 100 | 0;\r\n else if (i == 2) rd = rd / 10 | 0;\r\n r = (repeating || rm < 4) && rd == 9999 || !repeating && rm > 3 && rd == 4999;\r\n } else {\r\n r = ((repeating || rm < 4) && rd + 1 == k ||\r\n (!repeating && rm > 3) && rd + 1 == k / 2) &&\r\n (d[di + 1] / k / 1000 | 0) == mathpow(10, i - 3) - 1;\r\n }\r\n }\r\n\r\n return r;\r\n }\r\n\r\n\r\n // Convert string of `baseIn` to an array of numbers of `baseOut`.\r\n // Eg. convertBase('255', 10, 16) returns [15, 15].\r\n // Eg. convertBase('ff', 16, 10) returns [2, 5, 5].\r\n function convertBase(str, baseIn, baseOut) {\r\n var j,\r\n arr = [0],\r\n arrL,\r\n i = 0,\r\n strL = str.length;\r\n\r\n for (; i < strL;) {\r\n for (arrL = arr.length; arrL--;) arr[arrL] *= baseIn;\r\n arr[0] += NUMERALS.indexOf(str.charAt(i++));\r\n for (j = 0; j < arr.length; j++) {\r\n if (arr[j] > baseOut - 1) {\r\n if (arr[j + 1] === void 0) arr[j + 1] = 0;\r\n arr[j + 1] += arr[j] / baseOut | 0;\r\n arr[j] %= baseOut;\r\n }\r\n }\r\n }\r\n\r\n return arr.reverse();\r\n }\r\n\r\n\r\n /*\r\n * cos(x) = 1 - x^2/2! + x^4/4! - ...\r\n * |x| < pi/2\r\n *\r\n */\r\n function cosine(Ctor, x) {\r\n var k, len, y;\r\n\r\n if (x.isZero()) return x;\r\n\r\n // Argument reduction: cos(4x) = 8*(cos^4(x) - cos^2(x)) + 1\r\n // i.e. cos(x) = 8*(cos^4(x/4) - cos^2(x/4)) + 1\r\n\r\n // Estimate the optimum number of times to use the argument reduction.\r\n len = x.d.length;\r\n if (len < 32) {\r\n k = Math.ceil(len / 3);\r\n y = (1 / tinyPow(4, k)).toString();\r\n } else {\r\n k = 16;\r\n y = '2.3283064365386962890625e-10';\r\n }\r\n\r\n Ctor.precision += k;\r\n\r\n x = taylorSeries(Ctor, 1, x.times(y), new Ctor(1));\r\n\r\n // Reverse argument reduction\r\n for (var i = k; i--;) {\r\n var cos2x = x.times(x);\r\n x = cos2x.times(cos2x).minus(cos2x).times(8).plus(1);\r\n }\r\n\r\n Ctor.precision -= k;\r\n\r\n return x;\r\n }\r\n\r\n\r\n /*\r\n * Perform division in the specified base.\r\n */\r\n var divide = (function () {\r\n\r\n // Assumes non-zero x and k, and hence non-zero result.\r\n function multiplyInteger(x, k, base) {\r\n var temp,\r\n carry = 0,\r\n i = x.length;\r\n\r\n for (x = x.slice(); i--;) {\r\n temp = x[i] * k + carry;\r\n x[i] = temp % base | 0;\r\n carry = temp / base | 0;\r\n }\r\n\r\n if (carry) x.unshift(carry);\r\n\r\n return x;\r\n }\r\n\r\n function compare(a, b, aL, bL) {\r\n var i, r;\r\n\r\n if (aL != bL) {\r\n r = aL > bL ? 1 : -1;\r\n } else {\r\n for (i = r = 0; i < aL; i++) {\r\n if (a[i] != b[i]) {\r\n r = a[i] > b[i] ? 1 : -1;\r\n break;\r\n }\r\n }\r\n }\r\n\r\n return r;\r\n }\r\n\r\n function subtract(a, b, aL, base) {\r\n var i = 0;\r\n\r\n // Subtract b from a.\r\n for (; aL--;) {\r\n a[aL] -= i;\r\n i = a[aL] < b[aL] ? 1 : 0;\r\n a[aL] = i * base + a[aL] - b[aL];\r\n }\r\n\r\n // Remove leading zeros.\r\n for (; !a[0] && a.length > 1;) a.shift();\r\n }\r\n\r\n return function (x, y, pr, rm, dp, base) {\r\n var cmp, e, i, k, logBase, more, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0,\r\n yL, yz,\r\n Ctor = x.constructor,\r\n sign = x.s == y.s ? 1 : -1,\r\n xd = x.d,\r\n yd = y.d;\r\n\r\n // Either NaN, Infinity or 0?\r\n if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n return new Ctor(// Return NaN if either NaN, or both Infinity or 0.\r\n !x.s || !y.s || (xd ? yd && xd[0] == yd[0] : !yd) ? NaN :\r\n\r\n // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.\r\n xd && xd[0] == 0 || !yd ? sign * 0 : sign / 0);\r\n }\r\n\r\n if (base) {\r\n logBase = 1;\r\n e = x.e - y.e;\r\n } else {\r\n base = BASE;\r\n logBase = LOG_BASE;\r\n e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);\r\n }\r\n\r\n yL = yd.length;\r\n xL = xd.length;\r\n q = new Ctor(sign);\r\n qd = q.d = [];\r\n\r\n // Result exponent may be one less than e.\r\n // The digit array of a Decimal from toStringBinary may have trailing zeros.\r\n for (i = 0; yd[i] == (xd[i] || 0); i++);\r\n\r\n if (yd[i] > (xd[i] || 0)) e--;\r\n\r\n if (pr == null) {\r\n sd = pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n } else if (dp) {\r\n sd = pr + (x.e - y.e) + 1;\r\n } else {\r\n sd = pr;\r\n }\r\n\r\n if (sd < 0) {\r\n qd.push(1);\r\n more = true;\r\n } else {\r\n\r\n // Convert precision in number of base 10 digits to base 1e7 digits.\r\n sd = sd / logBase + 2 | 0;\r\n i = 0;\r\n\r\n // divisor < 1e7\r\n if (yL == 1) {\r\n k = 0;\r\n yd = yd[0];\r\n sd++;\r\n\r\n // k is the carry.\r\n for (; (i < xL || k) && sd--; i++) {\r\n t = k * base + (xd[i] || 0);\r\n qd[i] = t / yd | 0;\r\n k = t % yd | 0;\r\n }\r\n\r\n more = k || i < xL;\r\n\r\n // divisor >= 1e7\r\n } else {\r\n\r\n // Normalise xd and yd so highest order digit of yd is >= base/2\r\n k = base / (yd[0] + 1) | 0;\r\n\r\n if (k > 1) {\r\n yd = multiplyInteger(yd, k, base);\r\n xd = multiplyInteger(xd, k, base);\r\n yL = yd.length;\r\n xL = xd.length;\r\n }\r\n\r\n xi = yL;\r\n rem = xd.slice(0, yL);\r\n remL = rem.length;\r\n\r\n // Add zeros to make remainder as long as divisor.\r\n for (; remL < yL;) rem[remL++] = 0;\r\n\r\n yz = yd.slice();\r\n yz.unshift(0);\r\n yd0 = yd[0];\r\n\r\n if (yd[1] >= base / 2) ++yd0;\r\n\r\n do {\r\n k = 0;\r\n\r\n // Compare divisor and remainder.\r\n cmp = compare(yd, rem, yL, remL);\r\n\r\n // If divisor < remainder.\r\n if (cmp < 0) {\r\n\r\n // Calculate trial digit, k.\r\n rem0 = rem[0];\r\n if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n // k will be how many times the divisor goes into the current remainder.\r\n k = rem0 / yd0 | 0;\r\n\r\n // Algorithm:\r\n // 1. product = divisor * trial digit (k)\r\n // 2. if product > remainder: product -= divisor, k--\r\n // 3. remainder -= product\r\n // 4. if product was < remainder at 2:\r\n // 5. compare new remainder and divisor\r\n // 6. If remainder > divisor: remainder -= divisor, k++\r\n\r\n if (k > 1) {\r\n if (k >= base) k = base - 1;\r\n\r\n // product = divisor * trial digit.\r\n prod = multiplyInteger(yd, k, base);\r\n prodL = prod.length;\r\n remL = rem.length;\r\n\r\n // Compare product and remainder.\r\n cmp = compare(prod, rem, prodL, remL);\r\n\r\n // product > remainder.\r\n if (cmp == 1) {\r\n k--;\r\n\r\n // Subtract divisor from product.\r\n subtract(prod, yL < prodL ? yz : yd, prodL, base);\r\n }\r\n } else {\r\n\r\n // cmp is -1.\r\n // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1\r\n // to avoid it. If k is 1 there is a need to compare yd and rem again below.\r\n if (k == 0) cmp = k = 1;\r\n prod = yd.slice();\r\n }\r\n\r\n prodL = prod.length;\r\n if (prodL < remL) prod.unshift(0);\r\n\r\n // Subtract product from remainder.\r\n subtract(rem, prod, remL, base);\r\n\r\n // If product was < previous remainder.\r\n if (cmp == -1) {\r\n remL = rem.length;\r\n\r\n // Compare divisor and new remainder.\r\n cmp = compare(yd, rem, yL, remL);\r\n\r\n // If divisor < new remainder, subtract divisor from remainder.\r\n if (cmp < 1) {\r\n k++;\r\n\r\n // Subtract divisor from remainder.\r\n subtract(rem, yL < remL ? yz : yd, remL, base);\r\n }\r\n }\r\n\r\n remL = rem.length;\r\n } else if (cmp === 0) {\r\n k++;\r\n rem = [0];\r\n } // if cmp === 1, k will be 0\r\n\r\n // Add the next digit, k, to the result array.\r\n qd[i++] = k;\r\n\r\n // Update the remainder.\r\n if (cmp && rem[0]) {\r\n rem[remL++] = xd[xi] || 0;\r\n } else {\r\n rem = [xd[xi]];\r\n remL = 1;\r\n }\r\n\r\n } while ((xi++ < xL || rem[0] !== void 0) && sd--);\r\n\r\n more = rem[0] !== void 0;\r\n }\r\n\r\n // Leading zero?\r\n if (!qd[0]) qd.shift();\r\n }\r\n\r\n // logBase is 1 when divide is being used for base conversion.\r\n if (logBase == 1) {\r\n q.e = e;\r\n inexact = more;\r\n } else {\r\n\r\n // To calculate q.e, first get the number of digits of qd[0].\r\n for (i = 1, k = qd[0]; k >= 10; k /= 10) i++;\r\n q.e = i + e * logBase - 1;\r\n\r\n finalise(q, dp ? pr + q.e + 1 : pr, rm, more);\r\n }\r\n\r\n return q;\r\n };\r\n })();\r\n\r\n\r\n /*\r\n * Round `x` to `sd` significant digits using rounding mode `rm`.\r\n * Check for over/under-flow.\r\n */\r\n function finalise(x, sd, rm, isTruncated) {\r\n var digits, i, j, k, rd, roundUp, w, xd, xdi,\r\n Ctor = x.constructor;\r\n\r\n // Don't round if sd is null or undefined.\r\n out: if (sd != null) {\r\n xd = x.d;\r\n\r\n // Infinity/NaN.\r\n if (!xd) return x;\r\n\r\n // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n // w: the word of xd containing rd, a base 1e7 number.\r\n // xdi: the index of w within xd.\r\n // digits: the number of digits of w.\r\n // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if\r\n // they had leading zeros)\r\n // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).\r\n\r\n // Get the length of the first word of the digits array xd.\r\n for (digits = 1, k = xd[0]; k >= 10; k /= 10) digits++;\r\n i = sd - digits;\r\n\r\n // Is the rounding digit in the first word of xd?\r\n if (i < 0) {\r\n i += LOG_BASE;\r\n j = sd;\r\n w = xd[xdi = 0];\r\n\r\n // Get the rounding digit at index j of w.\r\n rd = w / mathpow(10, digits - j - 1) % 10 | 0;\r\n } else {\r\n xdi = Math.ceil((i + 1) / LOG_BASE);\r\n k = xd.length;\r\n if (xdi >= k) {\r\n if (isTruncated) {\r\n\r\n // Needed by `naturalExponential`, `naturalLogarithm` and `squareRoot`.\r\n for (; k++ <= xdi;) xd.push(0);\r\n w = rd = 0;\r\n digits = 1;\r\n i %= LOG_BASE;\r\n j = i - LOG_BASE + 1;\r\n } else {\r\n break out;\r\n }\r\n } else {\r\n w = k = xd[xdi];\r\n\r\n // Get the number of digits of w.\r\n for (digits = 1; k >= 10; k /= 10) digits++;\r\n\r\n // Get the index of rd within w.\r\n i %= LOG_BASE;\r\n\r\n // Get the index of rd within w, adjusted for leading zeros.\r\n // The number of leading zeros of w is given by LOG_BASE - digits.\r\n j = i - LOG_BASE + digits;\r\n\r\n // Get the rounding digit at index j of w.\r\n rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 | 0;\r\n }\r\n }\r\n\r\n // Are there any non-zero digits after the rounding digit?\r\n isTruncated = isTruncated || sd < 0 ||\r\n xd[xdi + 1] !== void 0 || (j < 0 ? w : w % mathpow(10, digits - j - 1));\r\n\r\n // The expression `w % mathpow(10, digits - j - 1)` returns all the digits of w to the right\r\n // of the digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression\r\n // will give 714.\r\n\r\n roundUp = rm < 4\r\n ? (rd || isTruncated) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n : rd > 5 || rd == 5 && (rm == 4 || isTruncated || rm == 6 &&\r\n\r\n // Check whether the digit to the left of the rounding digit is odd.\r\n ((i > 0 ? j > 0 ? w / mathpow(10, digits - j) : 0 : xd[xdi - 1]) % 10) & 1 ||\r\n rm == (x.s < 0 ? 8 : 7));\r\n\r\n if (sd < 1 || !xd[0]) {\r\n xd.length = 0;\r\n if (roundUp) {\r\n\r\n // Convert sd to decimal places.\r\n sd -= x.e + 1;\r\n\r\n // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);\r\n x.e = -sd || 0;\r\n } else {\r\n\r\n // Zero.\r\n xd[0] = x.e = 0;\r\n }\r\n\r\n return x;\r\n }\r\n\r\n // Remove excess digits.\r\n if (i == 0) {\r\n xd.length = xdi;\r\n k = 1;\r\n xdi--;\r\n } else {\r\n xd.length = xdi + 1;\r\n k = mathpow(10, LOG_BASE - i);\r\n\r\n // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n // j > 0 means i > number of leading zeros of w.\r\n xd[xdi] = j > 0 ? (w / mathpow(10, digits - j) % mathpow(10, j) | 0) * k : 0;\r\n }\r\n\r\n if (roundUp) {\r\n for (;;) {\r\n\r\n // Is the digit to be rounded up in the first word of xd?\r\n if (xdi == 0) {\r\n\r\n // i will be the length of xd[0] before k is added.\r\n for (i = 1, j = xd[0]; j >= 10; j /= 10) i++;\r\n j = xd[0] += k;\r\n for (k = 1; j >= 10; j /= 10) k++;\r\n\r\n // if i != k the length has increased.\r\n if (i != k) {\r\n x.e++;\r\n if (xd[0] == BASE) xd[0] = 1;\r\n }\r\n\r\n break;\r\n } else {\r\n xd[xdi] += k;\r\n if (xd[xdi] != BASE) break;\r\n xd[xdi--] = 0;\r\n k = 1;\r\n }\r\n }\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (i = xd.length; xd[--i] === 0;) xd.pop();\r\n }\r\n\r\n if (external) {\r\n\r\n // Overflow?\r\n if (x.e > Ctor.maxE) {\r\n\r\n // Infinity.\r\n x.d = null;\r\n x.e = NaN;\r\n\r\n // Underflow?\r\n } else if (x.e < Ctor.minE) {\r\n\r\n // Zero.\r\n x.e = 0;\r\n x.d = [0];\r\n // Ctor.underflow = true;\r\n } // else Ctor.underflow = false;\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n function finiteToString(x, isExp, sd) {\r\n if (!x.isFinite()) return nonFiniteToString(x);\r\n var k,\r\n e = x.e,\r\n str = digitsToString(x.d),\r\n len = str.length;\r\n\r\n if (isExp) {\r\n if (sd && (k = sd - len) > 0) {\r\n str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);\r\n } else if (len > 1) {\r\n str = str.charAt(0) + '.' + str.slice(1);\r\n }\r\n\r\n str = str + (x.e < 0 ? 'e' : 'e+') + x.e;\r\n } else if (e < 0) {\r\n str = '0.' + getZeroString(-e - 1) + str;\r\n if (sd && (k = sd - len) > 0) str += getZeroString(k);\r\n } else if (e >= len) {\r\n str += getZeroString(e + 1 - len);\r\n if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);\r\n } else {\r\n if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);\r\n if (sd && (k = sd - len) > 0) {\r\n if (e + 1 === len) str += '.';\r\n str += getZeroString(k);\r\n }\r\n }\r\n\r\n return str;\r\n }\r\n\r\n\r\n // Calculate the base 10 exponent from the base 1e7 exponent.\r\n function getBase10Exponent(digits, e) {\r\n var w = digits[0];\r\n\r\n // Add the number of digits of the first word of the digits array.\r\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\r\n return e;\r\n }\r\n\r\n\r\n function getLn10(Ctor, sd, pr) {\r\n if (sd > LN10_PRECISION) {\r\n\r\n // Reset global state in case the exception is caught.\r\n external = true;\r\n if (pr) Ctor.precision = pr;\r\n throw Error(precisionLimitExceeded);\r\n }\r\n return finalise(new Ctor(LN10), sd, 1, true);\r\n }\r\n\r\n\r\n function getPi(Ctor, sd, rm) {\r\n if (sd > PI_PRECISION) throw Error(precisionLimitExceeded);\r\n return finalise(new Ctor(PI), sd, rm, true);\r\n }\r\n\r\n\r\n function getPrecision(digits) {\r\n var w = digits.length - 1,\r\n len = w * LOG_BASE + 1;\r\n\r\n w = digits[w];\r\n\r\n // If non-zero...\r\n if (w) {\r\n\r\n // Subtract the number of trailing zeros of the last word.\r\n for (; w % 10 == 0; w /= 10) len--;\r\n\r\n // Add the number of digits of the first word.\r\n for (w = digits[0]; w >= 10; w /= 10) len++;\r\n }\r\n\r\n return len;\r\n }\r\n\r\n\r\n function getZeroString(k) {\r\n var zs = '';\r\n for (; k--;) zs += '0';\r\n return zs;\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the value of Decimal `x` to the power `n`, where `n` is an\r\n * integer of type number.\r\n *\r\n * Implements 'exponentiation by squaring'. Called by `pow` and `parseOther`.\r\n *\r\n */\r\n function intPow(Ctor, x, n, pr) {\r\n var isTruncated,\r\n r = new Ctor(1),\r\n\r\n // Max n of 9007199254740991 takes 53 loop iterations.\r\n // Maximum digits array length; leaves [28, 34] guard digits.\r\n k = Math.ceil(pr / LOG_BASE + 4);\r\n\r\n external = false;\r\n\r\n for (;;) {\r\n if (n % 2) {\r\n r = r.times(x);\r\n if (truncate(r.d, k)) isTruncated = true;\r\n }\r\n\r\n n = mathfloor(n / 2);\r\n if (n === 0) {\r\n\r\n // To ensure correct rounding when r.d is truncated, increment the last word if it is zero.\r\n n = r.d.length - 1;\r\n if (isTruncated && r.d[n] === 0) ++r.d[n];\r\n break;\r\n }\r\n\r\n x = x.times(x);\r\n truncate(x.d, k);\r\n }\r\n\r\n external = true;\r\n\r\n return r;\r\n }\r\n\r\n\r\n function isOdd(n) {\r\n return n.d[n.d.length - 1] & 1;\r\n }\r\n\r\n\r\n /*\r\n * Handle `max` and `min`. `ltgt` is 'lt' or 'gt'.\r\n */\r\n function maxOrMin(Ctor, args, ltgt) {\r\n var y,\r\n x = new Ctor(args[0]),\r\n i = 0;\r\n\r\n for (; ++i < args.length;) {\r\n y = new Ctor(args[i]);\r\n if (!y.s) {\r\n x = y;\r\n break;\r\n } else if (x[ltgt](y)) {\r\n x = y;\r\n }\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the natural exponential of `x` rounded to `sd` significant\r\n * digits.\r\n *\r\n * Taylor/Maclaurin series.\r\n *\r\n * exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...\r\n *\r\n * Argument reduction:\r\n * Repeat x = x / 32, k += 5, until |x| < 0.1\r\n * exp(x) = exp(x / 2^k)^(2^k)\r\n *\r\n * Previously, the argument was initially reduced by\r\n * exp(x) = exp(r) * 10^k where r = x - k * ln10, k = floor(x / ln10)\r\n * to first put r in the range [0, ln10], before dividing by 32 until |x| < 0.1, but this was\r\n * found to be slower than just dividing repeatedly by 32 as above.\r\n *\r\n * Max integer argument: exp('20723265836946413') = 6.3e+9000000000000000\r\n * Min integer argument: exp('-20723265836946411') = 1.2e-9000000000000000\r\n * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)\r\n *\r\n * exp(Infinity) = Infinity\r\n * exp(-Infinity) = 0\r\n * exp(NaN) = NaN\r\n * exp(±0) = 1\r\n *\r\n * exp(x) is non-terminating for any finite, non-zero x.\r\n *\r\n * The result will always be correctly rounded.\r\n *\r\n */\r\n function naturalExponential(x, sd) {\r\n var denominator, guard, j, pow, sum, t, wpr,\r\n rep = 0,\r\n i = 0,\r\n k = 0,\r\n Ctor = x.constructor,\r\n rm = Ctor.rounding,\r\n pr = Ctor.precision;\r\n\r\n // 0/NaN/Infinity?\r\n if (!x.d || !x.d[0] || x.e > 17) {\r\n\r\n return new Ctor(x.d\r\n ? !x.d[0] ? 1 : x.s < 0 ? 0 : 1 / 0\r\n : x.s ? x.s < 0 ? 0 : x : 0 / 0);\r\n }\r\n\r\n if (sd == null) {\r\n external = false;\r\n wpr = pr;\r\n } else {\r\n wpr = sd;\r\n }\r\n\r\n t = new Ctor(0.03125);\r\n\r\n // while abs(x) >= 0.1\r\n while (x.e > -2) {\r\n\r\n // x = x / 2^5\r\n x = x.times(t);\r\n k += 5;\r\n }\r\n\r\n // Use 2 * log10(2^k) + 5 (empirically derived) to estimate the increase in precision\r\n // necessary to ensure the first 4 rounding digits are correct.\r\n guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;\r\n wpr += guard;\r\n denominator = pow = sum = new Ctor(1);\r\n Ctor.precision = wpr;\r\n\r\n for (;;) {\r\n pow = finalise(pow.times(x), wpr, 1);\r\n denominator = denominator.times(++i);\r\n t = sum.plus(divide(pow, denominator, wpr, 1));\r\n\r\n if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n j = k;\r\n while (j--) sum = finalise(sum.times(sum), wpr, 1);\r\n\r\n // Check to see if the first 4 rounding digits are [49]999.\r\n // If so, repeat the summation with a higher precision, otherwise\r\n // e.g. with precision: 18, rounding: 1\r\n // exp(18.404272462595034083567793919843761) = 98372560.1229999999 (should be 98372560.123)\r\n // `wpr - guard` is the index of first rounding digit.\r\n if (sd == null) {\r\n\r\n if (rep < 3 && checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n Ctor.precision = wpr += 10;\r\n denominator = pow = t = new Ctor(1);\r\n i = 0;\r\n rep++;\r\n } else {\r\n return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n }\r\n } else {\r\n Ctor.precision = pr;\r\n return sum;\r\n }\r\n }\r\n\r\n sum = t;\r\n }\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the natural logarithm of `x` rounded to `sd` significant\r\n * digits.\r\n *\r\n * ln(-n) = NaN\r\n * ln(0) = -Infinity\r\n * ln(-0) = -Infinity\r\n * ln(1) = 0\r\n * ln(Infinity) = Infinity\r\n * ln(-Infinity) = NaN\r\n * ln(NaN) = NaN\r\n *\r\n * ln(n) (n != 1) is non-terminating.\r\n *\r\n */\r\n function naturalLogarithm(y, sd) {\r\n var c, c0, denominator, e, numerator, rep, sum, t, wpr, x1, x2,\r\n n = 1,\r\n guard = 10,\r\n x = y,\r\n xd = x.d,\r\n Ctor = x.constructor,\r\n rm = Ctor.rounding,\r\n pr = Ctor.precision;\r\n\r\n // Is x negative or Infinity, NaN, 0 or 1?\r\n if (x.s < 0 || !xd || !xd[0] || !x.e && xd[0] == 1 && xd.length == 1) {\r\n return new Ctor(xd && !xd[0] ? -1 / 0 : x.s != 1 ? NaN : xd ? 0 : x);\r\n }\r\n\r\n if (sd == null) {\r\n external = false;\r\n wpr = pr;\r\n } else {\r\n wpr = sd;\r\n }\r\n\r\n Ctor.precision = wpr += guard;\r\n c = digitsToString(xd);\r\n c0 = c.charAt(0);\r\n\r\n if (Math.abs(e = x.e) < 1.5e15) {\r\n\r\n // Argument reduction.\r\n // The series converges faster the closer the argument is to 1, so using\r\n // ln(a^b) = b * ln(a), ln(a) = ln(a^b) / b\r\n // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,\r\n // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can\r\n // later be divided by this number, then separate out the power of 10 using\r\n // ln(a*10^b) = ln(a) + b*ln(10).\r\n\r\n // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).\r\n //while (c0 < 9 && c0 != 1 || c0 == 1 && c.charAt(1) > 1) {\r\n // max n is 6 (gives 0.7 - 1.3)\r\n while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {\r\n x = x.times(y);\r\n c = digitsToString(x.d);\r\n c0 = c.charAt(0);\r\n n++;\r\n }\r\n\r\n e = x.e;\r\n\r\n if (c0 > 1) {\r\n x = new Ctor('0.' + c);\r\n e++;\r\n } else {\r\n x = new Ctor(c0 + '.' + c.slice(1));\r\n }\r\n } else {\r\n\r\n // The argument reduction method above may result in overflow if the argument y is a massive\r\n // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this\r\n // function using ln(x*10^e) = ln(x) + e*ln(10).\r\n t = getLn10(Ctor, wpr + 2, pr).times(e + '');\r\n x = naturalLogarithm(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);\r\n Ctor.precision = pr;\r\n\r\n return sd == null ? finalise(x, pr, rm, external = true) : x;\r\n }\r\n\r\n // x1 is x reduced to a value near 1.\r\n x1 = x;\r\n\r\n // Taylor series.\r\n // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)\r\n // where x = (y - 1)/(y + 1) (|x| < 1)\r\n sum = numerator = x = divide(x.minus(1), x.plus(1), wpr, 1);\r\n x2 = finalise(x.times(x), wpr, 1);\r\n denominator = 3;\r\n\r\n for (;;) {\r\n numerator = finalise(numerator.times(x2), wpr, 1);\r\n t = sum.plus(divide(numerator, new Ctor(denominator), wpr, 1));\r\n\r\n if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n sum = sum.times(2);\r\n\r\n // Reverse the argument reduction. Check that e is not 0 because, besides preventing an\r\n // unnecessary calculation, -0 + 0 = +0 and to ensure correct rounding -0 needs to stay -0.\r\n if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));\r\n sum = divide(sum, new Ctor(n), wpr, 1);\r\n\r\n // Is rm > 3 and the first 4 rounding digits 4999, or rm < 4 (or the summation has\r\n // been repeated previously) and the first 4 rounding digits 9999?\r\n // If so, restart the summation with a higher precision, otherwise\r\n // e.g. with precision: 12, rounding: 1\r\n // ln(135520028.6126091714265381533) = 18.7246299999 when it should be 18.72463.\r\n // `wpr - guard` is the index of first rounding digit.\r\n if (sd == null) {\r\n if (checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n Ctor.precision = wpr += guard;\r\n t = numerator = x = divide(x1.minus(1), x1.plus(1), wpr, 1);\r\n x2 = finalise(x.times(x), wpr, 1);\r\n denominator = rep = 1;\r\n } else {\r\n return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n }\r\n } else {\r\n Ctor.precision = pr;\r\n return sum;\r\n }\r\n }\r\n\r\n sum = t;\r\n denominator += 2;\r\n }\r\n }\r\n\r\n\r\n // ±Infinity, NaN.\r\n function nonFiniteToString(x) {\r\n // Unsigned.\r\n return String(x.s * x.s / 0);\r\n }\r\n\r\n\r\n /*\r\n * Parse the value of a new Decimal `x` from string `str`.\r\n */\r\n function parseDecimal(x, str) {\r\n var e, i, len;\r\n\r\n // Decimal point?\r\n if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n // Exponential form?\r\n if ((i = str.search(/e/i)) > 0) {\r\n\r\n // Determine exponent.\r\n if (e < 0) e = i;\r\n e += +str.slice(i + 1);\r\n str = str.substring(0, i);\r\n } else if (e < 0) {\r\n\r\n // Integer.\r\n e = str.length;\r\n }\r\n\r\n // Determine leading zeros.\r\n for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n // Determine trailing zeros.\r\n for (len = str.length; str.charCodeAt(len - 1) === 48; --len);\r\n str = str.slice(i, len);\r\n\r\n if (str) {\r\n len -= i;\r\n x.e = e = e - i - 1;\r\n x.d = [];\r\n\r\n // Transform base\r\n\r\n // e is the base 10 exponent.\r\n // i is where to slice str to get the first word of the digits array.\r\n i = (e + 1) % LOG_BASE;\r\n if (e < 0) i += LOG_BASE;\r\n\r\n if (i < len) {\r\n if (i) x.d.push(+str.slice(0, i));\r\n for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));\r\n str = str.slice(i);\r\n i = LOG_BASE - str.length;\r\n } else {\r\n i -= len;\r\n }\r\n\r\n for (; i--;) str += '0';\r\n x.d.push(+str);\r\n\r\n if (external) {\r\n\r\n // Overflow?\r\n if (x.e > x.constructor.maxE) {\r\n\r\n // Infinity.\r\n x.d = null;\r\n x.e = NaN;\r\n\r\n // Underflow?\r\n } else if (x.e < x.constructor.minE) {\r\n\r\n // Zero.\r\n x.e = 0;\r\n x.d = [0];\r\n // x.constructor.underflow = true;\r\n } // else x.constructor.underflow = false;\r\n }\r\n } else {\r\n\r\n // Zero.\r\n x.e = 0;\r\n x.d = [0];\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n /*\r\n * Parse the value of a new Decimal `x` from a string `str`, which is not a decimal value.\r\n */\r\n function parseOther(x, str) {\r\n var base, Ctor, divisor, i, isFloat, len, p, xd, xe;\r\n\r\n if (str.indexOf('_') > -1) {\r\n str = str.replace(/(\\d)_(?=\\d)/g, '$1');\r\n if (isDecimal.test(str)) return parseDecimal(x, str);\r\n } else if (str === 'Infinity' || str === 'NaN') {\r\n if (!+str) x.s = NaN;\r\n x.e = NaN;\r\n x.d = null;\r\n return x;\r\n }\r\n\r\n if (isHex.test(str)) {\r\n base = 16;\r\n str = str.toLowerCase();\r\n } else if (isBinary.test(str)) {\r\n base = 2;\r\n } else if (isOctal.test(str)) {\r\n base = 8;\r\n } else {\r\n throw Error(invalidArgument + str);\r\n }\r\n\r\n // Is there a binary exponent part?\r\n i = str.search(/p/i);\r\n\r\n if (i > 0) {\r\n p = +str.slice(i + 1);\r\n str = str.substring(2, i);\r\n } else {\r\n str = str.slice(2);\r\n }\r\n\r\n // Convert `str` as an integer then divide the result by `base` raised to a power such that the\r\n // fraction part will be restored.\r\n i = str.indexOf('.');\r\n isFloat = i >= 0;\r\n Ctor = x.constructor;\r\n\r\n if (isFloat) {\r\n str = str.replace('.', '');\r\n len = str.length;\r\n i = len - i;\r\n\r\n // log[10](16) = 1.2041... , log[10](88) = 1.9444....\r\n divisor = intPow(Ctor, new Ctor(base), i, i * 2);\r\n }\r\n\r\n xd = convertBase(str, base, BASE);\r\n xe = xd.length - 1;\r\n\r\n // Remove trailing zeros.\r\n for (i = xe; xd[i] === 0; --i) xd.pop();\r\n if (i < 0) return new Ctor(x.s * 0);\r\n x.e = getBase10Exponent(xd, xe);\r\n x.d = xd;\r\n external = false;\r\n\r\n // At what precision to perform the division to ensure exact conversion?\r\n // maxDecimalIntegerPartDigitCount = ceil(log[10](b) * otherBaseIntegerPartDigitCount)\r\n // log[10](2) = 0.30103, log[10](8) = 0.90309, log[10](16) = 1.20412\r\n // E.g. ceil(1.2 * 3) = 4, so up to 4 decimal digits are needed to represent 3 hex int digits.\r\n // maxDecimalFractionPartDigitCount = {Hex:4|Oct:3|Bin:1} * otherBaseFractionPartDigitCount\r\n // Therefore using 4 * the number of digits of str will always be enough.\r\n if (isFloat) x = divide(x, divisor, len * 4);\r\n\r\n // Multiply by the binary exponent part if present.\r\n if (p) x = x.times(Math.abs(p) < 54 ? mathpow(2, p) : Decimal.pow(2, p));\r\n external = true;\r\n\r\n return x;\r\n }\r\n\r\n\r\n /*\r\n * sin(x) = x - x^3/3! + x^5/5! - ...\r\n * |x| < pi/2\r\n *\r\n */\r\n function sine(Ctor, x) {\r\n var k,\r\n len = x.d.length;\r\n\r\n if (len < 3) {\r\n return x.isZero() ? x : taylorSeries(Ctor, 2, x, x);\r\n }\r\n\r\n // Argument reduction: sin(5x) = 16*sin^5(x) - 20*sin^3(x) + 5*sin(x)\r\n // i.e. sin(x) = 16*sin^5(x/5) - 20*sin^3(x/5) + 5*sin(x/5)\r\n // and sin(x) = sin(x/5)(5 + sin^2(x/5)(16sin^2(x/5) - 20))\r\n\r\n // Estimate the optimum number of times to use the argument reduction.\r\n k = 1.4 * Math.sqrt(len);\r\n k = k > 16 ? 16 : k | 0;\r\n\r\n x = x.times(1 / tinyPow(5, k));\r\n x = taylorSeries(Ctor, 2, x, x);\r\n\r\n // Reverse argument reduction\r\n var sin2_x,\r\n d5 = new Ctor(5),\r\n d16 = new Ctor(16),\r\n d20 = new Ctor(20);\r\n for (; k--;) {\r\n sin2_x = x.times(x);\r\n x = x.times(d5.plus(sin2_x.times(d16.times(sin2_x).minus(d20))));\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n // Calculate Taylor series for `cos`, `cosh`, `sin` and `sinh`.\r\n function taylorSeries(Ctor, n, x, y, isHyperbolic) {\r\n var j, t, u, x2,\r\n i = 1,\r\n pr = Ctor.precision,\r\n k = Math.ceil(pr / LOG_BASE);\r\n\r\n external = false;\r\n x2 = x.times(x);\r\n u = new Ctor(y);\r\n\r\n for (;;) {\r\n t = divide(u.times(x2), new Ctor(n++ * n++), pr, 1);\r\n u = isHyperbolic ? y.plus(t) : y.minus(t);\r\n y = divide(t.times(x2), new Ctor(n++ * n++), pr, 1);\r\n t = u.plus(y);\r\n\r\n if (t.d[k] !== void 0) {\r\n for (j = k; t.d[j] === u.d[j] && j--;);\r\n if (j == -1) break;\r\n }\r\n\r\n j = u;\r\n u = y;\r\n y = t;\r\n t = j;\r\n i++;\r\n }\r\n\r\n external = true;\r\n t.d.length = k + 1;\r\n\r\n return t;\r\n }\r\n\r\n\r\n // Exponent e must be positive and non-zero.\r\n function tinyPow(b, e) {\r\n var n = b;\r\n while (--e) n *= b;\r\n return n;\r\n }\r\n\r\n\r\n // Return the absolute value of `x` reduced to less than or equal to half pi.\r\n function toLessThanHalfPi(Ctor, x) {\r\n var t,\r\n isNeg = x.s < 0,\r\n pi = getPi(Ctor, Ctor.precision, 1),\r\n halfPi = pi.times(0.5);\r\n\r\n x = x.abs();\r\n\r\n if (x.lte(halfPi)) {\r\n quadrant = isNeg ? 4 : 1;\r\n return x;\r\n }\r\n\r\n t = x.divToInt(pi);\r\n\r\n if (t.isZero()) {\r\n quadrant = isNeg ? 3 : 2;\r\n } else {\r\n x = x.minus(t.times(pi));\r\n\r\n // 0 <= x < pi\r\n if (x.lte(halfPi)) {\r\n quadrant = isOdd(t) ? (isNeg ? 2 : 3) : (isNeg ? 4 : 1);\r\n return x;\r\n }\r\n\r\n quadrant = isOdd(t) ? (isNeg ? 1 : 4) : (isNeg ? 3 : 2);\r\n }\r\n\r\n return x.minus(pi).abs();\r\n }\r\n\r\n\r\n /*\r\n * Return the value of Decimal `x` as a string in base `baseOut`.\r\n *\r\n * If the optional `sd` argument is present include a binary exponent suffix.\r\n */\r\n function toStringBinary(x, baseOut, sd, rm) {\r\n var base, e, i, k, len, roundUp, str, xd, y,\r\n Ctor = x.constructor,\r\n isExp = sd !== void 0;\r\n\r\n if (isExp) {\r\n checkInt32(sd, 1, MAX_DIGITS);\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n } else {\r\n sd = Ctor.precision;\r\n rm = Ctor.rounding;\r\n }\r\n\r\n if (!x.isFinite()) {\r\n str = nonFiniteToString(x);\r\n } else {\r\n str = finiteToString(x);\r\n i = str.indexOf('.');\r\n\r\n // Use exponential notation according to `toExpPos` and `toExpNeg`? No, but if required:\r\n // maxBinaryExponent = floor((decimalExponent + 1) * log[2](10))\r\n // minBinaryExponent = floor(decimalExponent * log[2](10))\r\n // log[2](10) = 3.321928094887362347870319429489390175864\r\n\r\n if (isExp) {\r\n base = 2;\r\n if (baseOut == 16) {\r\n sd = sd * 4 - 3;\r\n } else if (baseOut == 8) {\r\n sd = sd * 3 - 2;\r\n }\r\n } else {\r\n base = baseOut;\r\n }\r\n\r\n // Convert the number as an integer then divide the result by its base raised to a power such\r\n // that the fraction part will be restored.\r\n\r\n // Non-integer.\r\n if (i >= 0) {\r\n str = str.replace('.', '');\r\n y = new Ctor(1);\r\n y.e = str.length - i;\r\n y.d = convertBase(finiteToString(y), 10, base);\r\n y.e = y.d.length;\r\n }\r\n\r\n xd = convertBase(str, 10, base);\r\n e = len = xd.length;\r\n\r\n // Remove trailing zeros.\r\n for (; xd[--len] == 0;) xd.pop();\r\n\r\n if (!xd[0]) {\r\n str = isExp ? '0p+0' : '0';\r\n } else {\r\n if (i < 0) {\r\n e--;\r\n } else {\r\n x = new Ctor(x);\r\n x.d = xd;\r\n x.e = e;\r\n x = divide(x, y, sd, rm, 0, base);\r\n xd = x.d;\r\n e = x.e;\r\n roundUp = inexact;\r\n }\r\n\r\n // The rounding digit, i.e. the digit after the digit that may be rounded up.\r\n i = xd[sd];\r\n k = base / 2;\r\n roundUp = roundUp || xd[sd + 1] !== void 0;\r\n\r\n roundUp = rm < 4\r\n ? (i !== void 0 || roundUp) && (rm === 0 || rm === (x.s < 0 ? 3 : 2))\r\n : i > k || i === k && (rm === 4 || roundUp || rm === 6 && xd[sd - 1] & 1 ||\r\n rm === (x.s < 0 ? 8 : 7));\r\n\r\n xd.length = sd;\r\n\r\n if (roundUp) {\r\n\r\n // Rounding up may mean the previous digit has to be rounded up and so on.\r\n for (; ++xd[--sd] > base - 1;) {\r\n xd[sd] = 0;\r\n if (!sd) {\r\n ++e;\r\n xd.unshift(1);\r\n }\r\n }\r\n }\r\n\r\n // Determine trailing zeros.\r\n for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n // E.g. [4, 11, 15] becomes 4bf.\r\n for (i = 0, str = ''; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n\r\n // Add binary exponent suffix?\r\n if (isExp) {\r\n if (len > 1) {\r\n if (baseOut == 16 || baseOut == 8) {\r\n i = baseOut == 16 ? 4 : 3;\r\n for (--len; len % i; len++) str += '0';\r\n xd = convertBase(str, base, baseOut);\r\n for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n // xd[0] will always be be 1\r\n for (i = 1, str = '1.'; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n } else {\r\n str = str.charAt(0) + '.' + str.slice(1);\r\n }\r\n }\r\n\r\n str = str + (e < 0 ? 'p' : 'p+') + e;\r\n } else if (e < 0) {\r\n for (; ++e;) str = '0' + str;\r\n str = '0.' + str;\r\n } else {\r\n if (++e > len) for (e -= len; e-- ;) str += '0';\r\n else if (e < len) str = str.slice(0, e) + '.' + str.slice(e);\r\n }\r\n }\r\n\r\n str = (baseOut == 16 ? '0x' : baseOut == 2 ? '0b' : baseOut == 8 ? '0o' : '') + str;\r\n }\r\n\r\n return x.s < 0 ? '-' + str : str;\r\n }\r\n\r\n\r\n // Does not strip trailing zeros.\r\n function truncate(arr, len) {\r\n if (arr.length > len) {\r\n arr.length = len;\r\n return true;\r\n }\r\n }\r\n\r\n\r\n // Decimal methods\r\n\r\n\r\n /*\r\n * abs\r\n * acos\r\n * acosh\r\n * add\r\n * asin\r\n * asinh\r\n * atan\r\n * atanh\r\n * atan2\r\n * cbrt\r\n * ceil\r\n * clamp\r\n * clone\r\n * config\r\n * cos\r\n * cosh\r\n * div\r\n * exp\r\n * floor\r\n * hypot\r\n * ln\r\n * log\r\n * log2\r\n * log10\r\n * max\r\n * min\r\n * mod\r\n * mul\r\n * pow\r\n * random\r\n * round\r\n * set\r\n * sign\r\n * sin\r\n * sinh\r\n * sqrt\r\n * sub\r\n * sum\r\n * tan\r\n * tanh\r\n * trunc\r\n */\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the absolute value of `x`.\r\n *\r\n * x {number|string|Decimal}\r\n *\r\n */\r\n function abs(x) {\r\n return new this(x).abs();\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the arccosine in radians of `x`.\r\n *\r\n * x {number|string|Decimal}\r\n *\r\n */\r\n function acos(x) {\r\n return new this(x).acos();\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic cosine of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal} A value in radians.\r\n *\r\n */\r\n function acosh(x) {\r\n return new this(x).acosh();\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the sum of `x` and `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal}\r\n * y {number|string|Decimal}\r\n *\r\n */\r\n function add(x, y) {\r\n return new this(x).plus(y);\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the arcsine in radians of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal}\r\n *\r\n */\r\n function asin(x) {\r\n return new this(x).asin();\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic sine of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal} A value in radians.\r\n *\r\n */\r\n function asinh(x) {\r\n return new this(x).asinh();\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the arctangent in radians of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal}\r\n *\r\n */\r\n function atan(x) {\r\n return new this(x).atan();\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic tangent of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal} A value in radians.\r\n *\r\n */\r\n function atanh(x) {\r\n return new this(x).atanh();\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the arctangent in radians of `y/x` in the range -pi to pi\r\n * (inclusive), rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-pi, pi]\r\n *\r\n * y {number|string|Decimal} The y-coordinate.\r\n * x {number|string|Decimal} The x-coordinate.\r\n *\r\n * atan2(±0, -0) = ±pi\r\n * atan2(±0, +0) = ±0\r\n * atan2(±0, -x) = ±pi for x > 0\r\n * atan2(±0, x) = ±0 for x > 0\r\n * atan2(-y, ±0) = -pi/2 for y > 0\r\n * atan2(y, ±0) = pi/2 for y > 0\r\n * atan2(±y, -Infinity) = ±pi for finite y > 0\r\n * atan2(±y, +Infinity) = ±0 for finite y > 0\r\n * atan2(±Infinity, x) = ±pi/2 for finite x\r\n * atan2(±Infinity, -Infinity) = ±3*pi/4\r\n * atan2(±Infinity, +Infinity) = ±pi/4\r\n * atan2(NaN, x) = NaN\r\n * atan2(y, NaN) = NaN\r\n *\r\n */\r\n function atan2(y, x) {\r\n y = new this(y);\r\n x = new this(x);\r\n var r,\r\n pr = this.precision,\r\n rm = this.rounding,\r\n wpr = pr + 4;\r\n\r\n // Either NaN\r\n if (!y.s || !x.s) {\r\n r = new this(NaN);\r\n\r\n // Both ±Infinity\r\n } else if (!y.d && !x.d) {\r\n r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);\r\n r.s = y.s;\r\n\r\n // x is ±Infinity or y is ±0\r\n } else if (!x.d || y.isZero()) {\r\n r = x.s < 0 ? getPi(this, pr, rm) : new this(0);\r\n r.s = y.s;\r\n\r\n // y is ±Infinity or x is ±0\r\n } else if (!y.d || x.isZero()) {\r\n r = getPi(this, wpr, 1).times(0.5);\r\n r.s = y.s;\r\n\r\n // Both non-zero and finite\r\n } else if (x.s < 0) {\r\n this.precision = wpr;\r\n this.rounding = 1;\r\n r = this.atan(divide(y, x, wpr, 1));\r\n x = getPi(this, wpr, 1);\r\n this.precision = pr;\r\n this.rounding = rm;\r\n r = y.s < 0 ? r.minus(x) : r.plus(x);\r\n } else {\r\n r = this.atan(divide(y, x, wpr, 1));\r\n }\r\n\r\n return r;\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the cube root of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal}\r\n *\r\n */\r\n function cbrt(x) {\r\n return new this(x).cbrt();\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is `x` rounded to an integer using `ROUND_CEIL`.\r\n *\r\n * x {number|string|Decimal}\r\n *\r\n */\r\n function ceil(x) {\r\n return finalise(x = new this(x), x.e + 1, 2);\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is `x` clamped to the range delineated by `min` and `max`.\r\n *\r\n * x {number|string|Decimal}\r\n * min {number|string|Decimal}\r\n * max {number|string|Decimal}\r\n *\r\n */\r\n function clamp(x, min, max) {\r\n return new this(x).clamp(min, max);\r\n }\r\n\r\n\r\n /*\r\n * Configure global settings for a Decimal constructor.\r\n *\r\n * `obj` is an object with one or more of the following properties,\r\n *\r\n * precision {number}\r\n * rounding {number}\r\n * toExpNeg {number}\r\n * toExpPos {number}\r\n * maxE {number}\r\n * minE {number}\r\n * modulo {number}\r\n * crypto {boolean|number}\r\n * defaults {true}\r\n *\r\n * E.g. Decimal.config({ precision: 20, rounding: 4 })\r\n *\r\n */\r\n function config(obj) {\r\n if (!obj || typeof obj !== 'object') throw Error(decimalError + 'Object expected');\r\n var i, p, v,\r\n useDefaults = obj.defaults === true,\r\n ps = [\r\n 'precision', 1, MAX_DIGITS,\r\n 'rounding', 0, 8,\r\n 'toExpNeg', -EXP_LIMIT, 0,\r\n 'toExpPos', 0, EXP_LIMIT,\r\n 'maxE', 0, EXP_LIMIT,\r\n 'minE', -EXP_LIMIT, 0,\r\n 'modulo', 0, 9\r\n ];\r\n\r\n for (i = 0; i < ps.length; i += 3) {\r\n if (p = ps[i], useDefaults) this[p] = DEFAULTS[p];\r\n if ((v = obj[p]) !== void 0) {\r\n if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;\r\n else throw Error(invalidArgument + p + ': ' + v);\r\n }\r\n }\r\n\r\n if (p = 'crypto', useDefaults) this[p] = DEFAULTS[p];\r\n if ((v = obj[p]) !== void 0) {\r\n if (v === true || v === false || v === 0 || v === 1) {\r\n if (v) {\r\n if (typeof crypto != 'undefined' && crypto &&\r\n (crypto.getRandomValues || crypto.randomBytes)) {\r\n this[p] = true;\r\n } else {\r\n throw Error(cryptoUnavailable);\r\n }\r\n } else {\r\n this[p] = false;\r\n }\r\n } else {\r\n throw Error(invalidArgument + p + ': ' + v);\r\n }\r\n }\r\n\r\n return this;\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the cosine of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal} A value in radians.\r\n *\r\n */\r\n function cos(x) {\r\n return new this(x).cos();\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the hyperbolic cosine of `x`, rounded to precision\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal} A value in radians.\r\n *\r\n */\r\n function cosh(x) {\r\n return new this(x).cosh();\r\n }\r\n\r\n\r\n /*\r\n * Create and return a Decimal constructor with the same configuration properties as this Decimal\r\n * constructor.\r\n *\r\n */\r\n function clone(obj) {\r\n var i, p, ps;\r\n\r\n /*\r\n * The Decimal constructor and exported function.\r\n * Return a new Decimal instance.\r\n *\r\n * v {number|string|Decimal} A numeric value.\r\n *\r\n */\r\n function Decimal(v) {\r\n var e, i, t,\r\n x = this;\r\n\r\n // Decimal called without new.\r\n if (!(x instanceof Decimal)) return new Decimal(v);\r\n\r\n // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor\r\n // which points to Object.\r\n x.constructor = Decimal;\r\n\r\n // Duplicate.\r\n if (isDecimalInstance(v)) {\r\n x.s = v.s;\r\n\r\n if (external) {\r\n if (!v.d || v.e > Decimal.maxE) {\r\n\r\n // Infinity.\r\n x.e = NaN;\r\n x.d = null;\r\n } else if (v.e < Decimal.minE) {\r\n\r\n // Zero.\r\n x.e = 0;\r\n x.d = [0];\r\n } else {\r\n x.e = v.e;\r\n x.d = v.d.slice();\r\n }\r\n } else {\r\n x.e = v.e;\r\n x.d = v.d ? v.d.slice() : v.d;\r\n }\r\n\r\n return;\r\n }\r\n\r\n t = typeof v;\r\n\r\n if (t === 'number') {\r\n if (v === 0) {\r\n x.s = 1 / v < 0 ? -1 : 1;\r\n x.e = 0;\r\n x.d = [0];\r\n return;\r\n }\r\n\r\n if (v < 0) {\r\n v = -v;\r\n x.s = -1;\r\n } else {\r\n x.s = 1;\r\n }\r\n\r\n // Fast path for small integers.\r\n if (v === ~~v && v < 1e7) {\r\n for (e = 0, i = v; i >= 10; i /= 10) e++;\r\n\r\n if (external) {\r\n if (e > Decimal.maxE) {\r\n x.e = NaN;\r\n x.d = null;\r\n } else if (e < Decimal.minE) {\r\n x.e = 0;\r\n x.d = [0];\r\n } else {\r\n x.e = e;\r\n x.d = [v];\r\n }\r\n } else {\r\n x.e = e;\r\n x.d = [v];\r\n }\r\n\r\n return;\r\n\r\n // Infinity, NaN.\r\n } else if (v * 0 !== 0) {\r\n if (!v) x.s = NaN;\r\n x.e = NaN;\r\n x.d = null;\r\n return;\r\n }\r\n\r\n return parseDecimal(x, v.toString());\r\n\r\n } else if (t !== 'string') {\r\n throw Error(invalidArgument + v);\r\n }\r\n\r\n // Minus sign?\r\n if ((i = v.charCodeAt(0)) === 45) {\r\n v = v.slice(1);\r\n x.s = -1;\r\n } else {\r\n // Plus sign?\r\n if (i === 43) v = v.slice(1);\r\n x.s = 1;\r\n }\r\n\r\n return isDecimal.test(v) ? parseDecimal(x, v) : parseOther(x, v);\r\n }\r\n\r\n Decimal.prototype = P;\r\n\r\n Decimal.ROUND_UP = 0;\r\n Decimal.ROUND_DOWN = 1;\r\n Decimal.ROUND_CEIL = 2;\r\n Decimal.ROUND_FLOOR = 3;\r\n Decimal.ROUND_HALF_UP = 4;\r\n Decimal.ROUND_HALF_DOWN = 5;\r\n Decimal.ROUND_HALF_EVEN = 6;\r\n Decimal.ROUND_HALF_CEIL = 7;\r\n Decimal.ROUND_HALF_FLOOR = 8;\r\n Decimal.EUCLID = 9;\r\n\r\n Decimal.config = Decimal.set = config;\r\n Decimal.clone = clone;\r\n Decimal.isDecimal = isDecimalInstance;\r\n\r\n Decimal.abs = abs;\r\n Decimal.acos = acos;\r\n Decimal.acosh = acosh; // ES6\r\n Decimal.add = add;\r\n Decimal.asin = asin;\r\n Decimal.asinh = asinh; // ES6\r\n Decimal.atan = atan;\r\n Decimal.atanh = atanh; // ES6\r\n Decimal.atan2 = atan2;\r\n Decimal.cbrt = cbrt; // ES6\r\n Decimal.ceil = ceil;\r\n Decimal.clamp = clamp;\r\n Decimal.cos = cos;\r\n Decimal.cosh = cosh; // ES6\r\n Decimal.div = div;\r\n Decimal.exp = exp;\r\n Decimal.floor = floor;\r\n Decimal.hypot = hypot; // ES6\r\n Decimal.ln = ln;\r\n Decimal.log = log;\r\n Decimal.log10 = log10; // ES6\r\n Decimal.log2 = log2; // ES6\r\n Decimal.max = max;\r\n Decimal.min = min;\r\n Decimal.mod = mod;\r\n Decimal.mul = mul;\r\n Decimal.pow = pow;\r\n Decimal.random = random;\r\n Decimal.round = round;\r\n Decimal.sign = sign; // ES6\r\n Decimal.sin = sin;\r\n Decimal.sinh = sinh; // ES6\r\n Decimal.sqrt = sqrt;\r\n Decimal.sub = sub;\r\n Decimal.sum = sum;\r\n Decimal.tan = tan;\r\n Decimal.tanh = tanh; // ES6\r\n Decimal.trunc = trunc; // ES6\r\n\r\n if (obj === void 0) obj = {};\r\n if (obj) {\r\n if (obj.defaults !== true) {\r\n ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'maxE', 'minE', 'modulo', 'crypto'];\r\n for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];\r\n }\r\n }\r\n\r\n Decimal.config(obj);\r\n\r\n return Decimal;\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is `x` divided by `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal}\r\n * y {number|string|Decimal}\r\n *\r\n */\r\n function div(x, y) {\r\n return new this(x).div(y);\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the natural exponential of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal} The power to which to raise the base of the natural log.\r\n *\r\n */\r\n function exp(x) {\r\n return new this(x).exp();\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is `x` round to an integer using `ROUND_FLOOR`.\r\n *\r\n * x {number|string|Decimal}\r\n *\r\n */\r\n function floor(x) {\r\n return finalise(x = new this(x), x.e + 1, 3);\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the square root of the sum of the squares of the arguments,\r\n * rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * hypot(a, b, ...) = sqrt(a^2 + b^2 + ...)\r\n *\r\n * arguments {number|string|Decimal}\r\n *\r\n */\r\n function hypot() {\r\n var i, n,\r\n t = new this(0);\r\n\r\n external = false;\r\n\r\n for (i = 0; i < arguments.length;) {\r\n n = new this(arguments[i++]);\r\n if (!n.d) {\r\n if (n.s) {\r\n external = true;\r\n return new this(1 / 0);\r\n }\r\n t = n;\r\n } else if (t.d) {\r\n t = t.plus(n.times(n));\r\n }\r\n }\r\n\r\n external = true;\r\n\r\n return t.sqrt();\r\n }\r\n\r\n\r\n /*\r\n * Return true if object is a Decimal instance (where Decimal is any Decimal constructor),\r\n * otherwise return false.\r\n *\r\n */\r\n function isDecimalInstance(obj) {\r\n return obj instanceof Decimal || obj && obj.toStringTag === tag || false;\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the natural logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal}\r\n *\r\n */\r\n function ln(x) {\r\n return new this(x).ln();\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the log of `x` to the base `y`, or to base 10 if no base\r\n * is specified, rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * log[y](x)\r\n *\r\n * x {number|string|Decimal} The argument of the logarithm.\r\n * y {number|string|Decimal} The base of the logarithm.\r\n *\r\n */\r\n function log(x, y) {\r\n return new this(x).log(y);\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the base 2 logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal}\r\n *\r\n */\r\n function log2(x) {\r\n return new this(x).log(2);\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the base 10 logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal}\r\n *\r\n */\r\n function log10(x) {\r\n return new this(x).log(10);\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the maximum of the arguments.\r\n *\r\n * arguments {number|string|Decimal}\r\n *\r\n */\r\n function max() {\r\n return maxOrMin(this, arguments, 'lt');\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the minimum of the arguments.\r\n *\r\n * arguments {number|string|Decimal}\r\n *\r\n */\r\n function min() {\r\n return maxOrMin(this, arguments, 'gt');\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is `x` modulo `y`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal}\r\n * y {number|string|Decimal}\r\n *\r\n */\r\n function mod(x, y) {\r\n return new this(x).mod(y);\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is `x` multiplied by `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal}\r\n * y {number|string|Decimal}\r\n *\r\n */\r\n function mul(x, y) {\r\n return new this(x).mul(y);\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is `x` raised to the power `y`, rounded to precision\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal} The base.\r\n * y {number|string|Decimal} The exponent.\r\n *\r\n */\r\n function pow(x, y) {\r\n return new this(x).pow(y);\r\n }\r\n\r\n\r\n /*\r\n * Returns a new Decimal with a random value equal to or greater than 0 and less than 1, and with\r\n * `sd`, or `Decimal.precision` if `sd` is omitted, significant digits (or less if trailing zeros\r\n * are produced).\r\n *\r\n * [sd] {number} Significant digits. Integer, 0 to MAX_DIGITS inclusive.\r\n *\r\n */\r\n function random(sd) {\r\n var d, e, k, n,\r\n i = 0,\r\n r = new this(1),\r\n rd = [];\r\n\r\n if (sd === void 0) sd = this.precision;\r\n else checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n k = Math.ceil(sd / LOG_BASE);\r\n\r\n if (!this.crypto) {\r\n for (; i < k;) rd[i++] = Math.random() * 1e7 | 0;\r\n\r\n // Browsers supporting crypto.getRandomValues.\r\n } else if (crypto.getRandomValues) {\r\n d = crypto.getRandomValues(new Uint32Array(k));\r\n\r\n for (; i < k;) {\r\n n = d[i];\r\n\r\n // 0 <= n < 4294967296\r\n // Probability n >= 4.29e9, is 4967296 / 4294967296 = 0.00116 (1 in 865).\r\n if (n >= 4.29e9) {\r\n d[i] = crypto.getRandomValues(new Uint32Array(1))[0];\r\n } else {\r\n\r\n // 0 <= n <= 4289999999\r\n // 0 <= (n % 1e7) <= 9999999\r\n rd[i++] = n % 1e7;\r\n }\r\n }\r\n\r\n // Node.js supporting crypto.randomBytes.\r\n } else if (crypto.randomBytes) {\r\n\r\n // buffer\r\n d = crypto.randomBytes(k *= 4);\r\n\r\n for (; i < k;) {\r\n\r\n // 0 <= n < 2147483648\r\n n = d[i] + (d[i + 1] << 8) + (d[i + 2] << 16) + ((d[i + 3] & 0x7f) << 24);\r\n\r\n // Probability n >= 2.14e9, is 7483648 / 2147483648 = 0.0035 (1 in 286).\r\n if (n >= 2.14e9) {\r\n crypto.randomBytes(4).copy(d, i);\r\n } else {\r\n\r\n // 0 <= n <= 2139999999\r\n // 0 <= (n % 1e7) <= 9999999\r\n rd.push(n % 1e7);\r\n i += 4;\r\n }\r\n }\r\n\r\n i = k / 4;\r\n } else {\r\n throw Error(cryptoUnavailable);\r\n }\r\n\r\n k = rd[--i];\r\n sd %= LOG_BASE;\r\n\r\n // Convert trailing digits to zeros according to sd.\r\n if (k && sd) {\r\n n = mathpow(10, LOG_BASE - sd);\r\n rd[i] = (k / n | 0) * n;\r\n }\r\n\r\n // Remove trailing words which are zero.\r\n for (; rd[i] === 0; i--) rd.pop();\r\n\r\n // Zero?\r\n if (i < 0) {\r\n e = 0;\r\n rd = [0];\r\n } else {\r\n e = -1;\r\n\r\n // Remove leading words which are zero and adjust exponent accordingly.\r\n for (; rd[0] === 0; e -= LOG_BASE) rd.shift();\r\n\r\n // Count the digits of the first word of rd to determine leading zeros.\r\n for (k = 1, n = rd[0]; n >= 10; n /= 10) k++;\r\n\r\n // Adjust the exponent for leading zeros of the first word of rd.\r\n if (k < LOG_BASE) e -= LOG_BASE - k;\r\n }\r\n\r\n r.e = e;\r\n r.d = rd;\r\n\r\n return r;\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is `x` rounded to an integer using rounding mode `rounding`.\r\n *\r\n * To emulate `Math.round`, set rounding to 7 (ROUND_HALF_CEIL).\r\n *\r\n * x {number|string|Decimal}\r\n *\r\n */\r\n function round(x) {\r\n return finalise(x = new this(x), x.e + 1, this.rounding);\r\n }\r\n\r\n\r\n /*\r\n * Return\r\n * 1 if x > 0,\r\n * -1 if x < 0,\r\n * 0 if x is 0,\r\n * -0 if x is -0,\r\n * NaN otherwise\r\n *\r\n * x {number|string|Decimal}\r\n *\r\n */\r\n function sign(x) {\r\n x = new this(x);\r\n return x.d ? (x.d[0] ? x.s : 0 * x.s) : x.s || NaN;\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the sine of `x`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal} A value in radians.\r\n *\r\n */\r\n function sin(x) {\r\n return new this(x).sin();\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the hyperbolic sine of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal} A value in radians.\r\n *\r\n */\r\n function sinh(x) {\r\n return new this(x).sinh();\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the square root of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal}\r\n *\r\n */\r\n function sqrt(x) {\r\n return new this(x).sqrt();\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is `x` minus `y`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal}\r\n * y {number|string|Decimal}\r\n *\r\n */\r\n function sub(x, y) {\r\n return new this(x).sub(y);\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the sum of the arguments, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * Only the result is rounded, not the intermediate calculations.\r\n *\r\n * arguments {number|string|Decimal}\r\n *\r\n */\r\n function sum() {\r\n var i = 0,\r\n args = arguments,\r\n x = new this(args[i]);\r\n\r\n external = false;\r\n for (; x.s && ++i < args.length;) x = x.plus(args[i]);\r\n external = true;\r\n\r\n return finalise(x, this.precision, this.rounding);\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the tangent of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal} A value in radians.\r\n *\r\n */\r\n function tan(x) {\r\n return new this(x).tan();\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the hyperbolic tangent of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|Decimal} A value in radians.\r\n *\r\n */\r\n function tanh(x) {\r\n return new this(x).tanh();\r\n }\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is `x` truncated to an integer.\r\n *\r\n * x {number|string|Decimal}\r\n *\r\n */\r\n function trunc(x) {\r\n return finalise(x = new this(x), x.e + 1, 1);\r\n }\r\n\r\n\r\n // Create and configure initial Decimal constructor.\r\n Decimal = clone(DEFAULTS);\r\n Decimal.prototype.constructor = Decimal;\r\n Decimal['default'] = Decimal.Decimal = Decimal;\r\n\r\n // Create the internal constants from their string values.\r\n LN10 = new Decimal(LN10);\r\n PI = new Decimal(PI);\r\n\r\n\r\n // Export.\r\n\r\n\r\n // AMD.\r\n if (typeof define == 'function' && define.amd) {\r\n define(function () {\r\n return Decimal;\r\n });\r\n\r\n // Node and other environments that support module.exports.\r\n } else if (typeof module != 'undefined' && module.exports) {\r\n if (typeof Symbol == 'function' && typeof Symbol.iterator == 'symbol') {\r\n P[Symbol['for']('nodejs.util.inspect.custom')] = P.toString;\r\n P[Symbol.toStringTag] = 'Decimal';\r\n }\r\n\r\n module.exports = Decimal;\r\n\r\n // Browser.\r\n } else {\r\n if (!globalScope) {\r\n globalScope = typeof self != 'undefined' && self && self.self == self ? self : window;\r\n }\r\n\r\n noConflict = globalScope.Decimal;\r\n Decimal.noConflict = function () {\r\n globalScope.Decimal = noConflict;\r\n return Decimal;\r\n };\r\n\r\n globalScope.Decimal = Decimal;\r\n }\r\n})(this);\r\n","\"use strict\";\n\n// Map the characters to escape to their escaped values. The list is derived\n// from http://www.cespedes.org/blog/85/how-to-escape-latex-special-characters\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar defaultEscapes = {\n \"{\": \"\\\\{\",\n \"}\": \"\\\\}\",\n \"\\\\\": \"\\\\textbackslash{}\",\n \"#\": \"\\\\#\",\n $: \"\\\\$\",\n \"%\": \"\\\\%\",\n \"&\": \"\\\\&\",\n \"^\": \"\\\\textasciicircum{}\",\n _: \"\\\\_\",\n \"~\": \"\\\\textasciitilde{}\"\n};\nvar formatEscapes = {\n \"\\u2013\": \"\\\\--\",\n \"\\u2014\": \"\\\\---\",\n \" \": \"~\",\n \"\\t\": \"\\\\qquad{}\",\n \"\\r\\n\": \"\\\\newline{}\",\n \"\\n\": \"\\\\newline{}\"\n};\n\nvar defaultEscapeMapFn = function defaultEscapeMapFn(defaultEscapes, formatEscapes) {\n return _extends({}, defaultEscapes, formatEscapes);\n};\n\n/**\n * Escape a string to be used in LaTeX documents.\n * @param {string} str the string to be escaped.\n * @param {boolean} params.preserveFormatting whether formatting escapes should\n * be performed (default: false).\n * @param {function} params.escapeMapFn the function to modify the escape maps.\n * @return {string} the escaped string, ready to be used in LaTeX.\n */\nmodule.exports = function (str) {\n var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n _ref$preserveFormatti = _ref.preserveFormatting,\n preserveFormatting = _ref$preserveFormatti === undefined ? false : _ref$preserveFormatti,\n _ref$escapeMapFn = _ref.escapeMapFn,\n escapeMapFn = _ref$escapeMapFn === undefined ? defaultEscapeMapFn : _ref$escapeMapFn;\n\n var runningStr = String(str);\n var result = \"\";\n\n var escapes = escapeMapFn(_extends({}, defaultEscapes), preserveFormatting ? _extends({}, formatEscapes) : {});\n var escapeKeys = Object.keys(escapes); // as it is reused later on\n\n // Algorithm: Go through the string character by character, if it matches\n // with one of the special characters then we'll replace it with the escaped\n // version.\n\n var _loop = function _loop() {\n var specialCharFound = false;\n escapeKeys.forEach(function (key, index) {\n if (specialCharFound) {\n return;\n }\n if (runningStr.length >= key.length && runningStr.slice(0, key.length) === key) {\n result += escapes[escapeKeys[index]];\n runningStr = runningStr.slice(key.length, runningStr.length);\n specialCharFound = true;\n }\n });\n if (!specialCharFound) {\n result += runningStr.slice(0, 1);\n runningStr = runningStr.slice(1, runningStr.length);\n }\n };\n\n while (runningStr) {\n _loop();\n }\n return result;\n};","/**\n * @license Fraction.js v4.1.2 23/05/2021\n * https://www.xarg.org/2014/03/rational-numbers-in-javascript/\n *\n * Copyright (c) 2021, Robert Eisele (robert@xarg.org)\n * Dual licensed under the MIT or GPL Version 2 licenses.\n **/\n\n\n/**\n *\n * This class offers the possibility to calculate fractions.\n * You can pass a fraction in different formats. Either as array, as double, as string or as an integer.\n *\n * Array/Object form\n * [ 0 => <nominator>, 1 => <denominator> ]\n * [ n => <nominator>, d => <denominator> ]\n *\n * Integer form\n * - Single integer value\n *\n * Double form\n * - Single double value\n *\n * String form\n * 123.456 - a simple double\n * 123/456 - a string fraction\n * 123.'456' - a double with repeating decimal places\n * 123.(456) - synonym\n * 123.45'6' - a double with repeating last place\n * 123.45(6) - synonym\n *\n * Example:\n *\n * var f = new Fraction(\"9.4'31'\");\n * f.mul([-4, 3]).div(4.9);\n *\n */\n\n(function(root) {\n\n \"use strict\";\n\n // Maximum search depth for cyclic rational numbers. 2000 should be more than enough.\n // Example: 1/7 = 0.(142857) has 6 repeating decimal places.\n // If MAX_CYCLE_LEN gets reduced, long cycles will not be detected and toString() only gets the first 10 digits\n var MAX_CYCLE_LEN = 2000;\n\n // Parsed data to avoid calling \"new\" all the time\n var P = {\n \"s\": 1,\n \"n\": 0,\n \"d\": 1\n };\n\n function createError(name) {\n\n function errorConstructor() {\n var temp = Error.apply(this, arguments);\n temp['name'] = this['name'] = name;\n this['stack'] = temp['stack'];\n this['message'] = temp['message'];\n }\n\n /**\n * Error constructor\n *\n * @constructor\n */\n function IntermediateInheritor() { }\n IntermediateInheritor.prototype = Error.prototype;\n errorConstructor.prototype = new IntermediateInheritor();\n\n return errorConstructor;\n }\n\n var DivisionByZero = Fraction['DivisionByZero'] = createError('DivisionByZero');\n var InvalidParameter = Fraction['InvalidParameter'] = createError('InvalidParameter');\n\n function assign(n, s) {\n\n if (isNaN(n = parseInt(n, 10))) {\n throwInvalidParam();\n }\n return n * s;\n }\n\n function throwInvalidParam() {\n throw new InvalidParameter();\n }\n\n function factorize(num) {\n\n var factors = {};\n\n var n = num;\n var i = 2;\n var s = 4;\n\n while (s <= n) {\n\n while (n % i === 0) {\n n /= i;\n factors[i] = (factors[i] || 0) + 1;\n }\n s += 1 + 2 * i++;\n }\n\n if (n !== num) {\n if (n > 1)\n factors[n] = (factors[n] || 0) + 1;\n } else {\n factors[num] = (factors[num] || 0) + 1;\n }\n return factors;\n }\n\n var parse = function(p1, p2) {\n\n var n = 0, d = 1, s = 1;\n var v = 0, w = 0, x = 0, y = 1, z = 1;\n\n var A = 0, B = 1;\n var C = 1, D = 1;\n\n var N = 10000000;\n var M;\n\n if (p1 === undefined || p1 === null) {\n /* void */\n } else if (p2 !== undefined) {\n n = p1;\n d = p2;\n s = n * d;\n } else\n switch (typeof p1) {\n\n case \"object\":\n {\n if (\"d\" in p1 && \"n\" in p1) {\n n = p1[\"n\"];\n d = p1[\"d\"];\n if (\"s\" in p1)\n n *= p1[\"s\"];\n } else if (0 in p1) {\n n = p1[0];\n if (1 in p1)\n d = p1[1];\n } else {\n throwInvalidParam();\n }\n s = n * d;\n break;\n }\n case \"number\":\n {\n if (p1 < 0) {\n s = p1;\n p1 = -p1;\n }\n\n if (p1 % 1 === 0) {\n n = p1;\n } else if (p1 > 0) { // check for != 0, scale would become NaN (log(0)), which converges really slow\n\n if (p1 >= 1) {\n z = Math.pow(10, Math.floor(1 + Math.log(p1) / Math.LN10));\n p1 /= z;\n }\n\n // Using Farey Sequences\n // http://www.johndcook.com/blog/2010/10/20/best-rational-approximation/\n\n while (B <= N && D <= N) {\n M = (A + C) / (B + D);\n\n if (p1 === M) {\n if (B + D <= N) {\n n = A + C;\n d = B + D;\n } else if (D > B) {\n n = C;\n d = D;\n } else {\n n = A;\n d = B;\n }\n break;\n\n } else {\n\n if (p1 > M) {\n A += C;\n B += D;\n } else {\n C += A;\n D += B;\n }\n\n if (B > N) {\n n = C;\n d = D;\n } else {\n n = A;\n d = B;\n }\n }\n }\n n *= z;\n } else if (isNaN(p1) || isNaN(p2)) {\n d = n = NaN;\n }\n break;\n }\n case \"string\":\n {\n B = p1.match(/\\d+|./g);\n\n if (B === null)\n throwInvalidParam();\n\n if (B[A] === '-') {// Check for minus sign at the beginning\n s = -1;\n A++;\n } else if (B[A] === '+') {// Check for plus sign at the beginning\n A++;\n }\n\n if (B.length === A + 1) { // Check if it's just a simple number \"1234\"\n w = assign(B[A++], s);\n } else if (B[A + 1] === '.' || B[A] === '.') { // Check if it's a decimal number\n\n if (B[A] !== '.') { // Handle 0.5 and .5\n v = assign(B[A++], s);\n }\n A++;\n\n // Check for decimal places\n if (A + 1 === B.length || B[A + 1] === '(' && B[A + 3] === ')' || B[A + 1] === \"'\" && B[A + 3] === \"'\") {\n w = assign(B[A], s);\n y = Math.pow(10, B[A].length);\n A++;\n }\n\n // Check for repeating places\n if (B[A] === '(' && B[A + 2] === ')' || B[A] === \"'\" && B[A + 2] === \"'\") {\n x = assign(B[A + 1], s);\n z = Math.pow(10, B[A + 1].length) - 1;\n A += 3;\n }\n\n } else if (B[A + 1] === '/' || B[A + 1] === ':') { // Check for a simple fraction \"123/456\" or \"123:456\"\n w = assign(B[A], s);\n y = assign(B[A + 2], 1);\n A += 3;\n } else if (B[A + 3] === '/' && B[A + 1] === ' ') { // Check for a complex fraction \"123 1/2\"\n v = assign(B[A], s);\n w = assign(B[A + 2], s);\n y = assign(B[A + 4], 1);\n A += 5;\n }\n\n if (B.length <= A) { // Check for more tokens on the stack\n d = y * z;\n s = /* void */\n n = x + d * v + z * w;\n break;\n }\n\n /* Fall through on error */\n }\n default:\n throwInvalidParam();\n }\n\n if (d === 0) {\n throw new DivisionByZero();\n }\n\n P[\"s\"] = s < 0 ? -1 : 1;\n P[\"n\"] = Math.abs(n);\n P[\"d\"] = Math.abs(d);\n };\n\n function modpow(b, e, m) {\n\n var r = 1;\n for (; e > 0; b = (b * b) % m, e >>= 1) {\n\n if (e & 1) {\n r = (r * b) % m;\n }\n }\n return r;\n }\n\n\n function cycleLen(n, d) {\n\n for (; d % 2 === 0;\n d /= 2) {\n }\n\n for (; d % 5 === 0;\n d /= 5) {\n }\n\n if (d === 1) // Catch non-cyclic numbers\n return 0;\n\n // If we would like to compute really large numbers quicker, we could make use of Fermat's little theorem:\n // 10^(d-1) % d == 1\n // However, we don't need such large numbers and MAX_CYCLE_LEN should be the capstone,\n // as we want to translate the numbers to strings.\n\n var rem = 10 % d;\n var t = 1;\n\n for (; rem !== 1; t++) {\n rem = rem * 10 % d;\n\n if (t > MAX_CYCLE_LEN)\n return 0; // Returning 0 here means that we don't print it as a cyclic number. It's likely that the answer is `d-1`\n }\n return t;\n }\n\n\n function cycleStart(n, d, len) {\n\n var rem1 = 1;\n var rem2 = modpow(10, len, d);\n\n for (var t = 0; t < 300; t++) { // s < ~log10(Number.MAX_VALUE)\n // Solve 10^s == 10^(s+t) (mod d)\n\n if (rem1 === rem2)\n return t;\n\n rem1 = rem1 * 10 % d;\n rem2 = rem2 * 10 % d;\n }\n return 0;\n }\n\n function gcd(a, b) {\n\n if (!a)\n return b;\n if (!b)\n return a;\n\n while (1) {\n a %= b;\n if (!a)\n return b;\n b %= a;\n if (!b)\n return a;\n }\n };\n\n /**\n * Module constructor\n *\n * @constructor\n * @param {number|Fraction=} a\n * @param {number=} b\n */\n function Fraction(a, b) {\n\n if (!(this instanceof Fraction)) {\n return new Fraction(a, b);\n }\n\n parse(a, b);\n\n a = gcd(P[\"d\"], P[\"n\"]); // Abuse variable a\n\n this[\"s\"] = P[\"s\"];\n this[\"n\"] = P[\"n\"] / a;\n this[\"d\"] = P[\"d\"] / a;\n }\n\n Fraction.prototype = {\n\n \"s\": 1,\n \"n\": 0,\n \"d\": 1,\n\n /**\n * Calculates the absolute value\n *\n * Ex: new Fraction(-4).abs() => 4\n **/\n \"abs\": function() {\n\n return new Fraction(this[\"n\"], this[\"d\"]);\n },\n\n /**\n * Inverts the sign of the current fraction\n *\n * Ex: new Fraction(-4).neg() => 4\n **/\n \"neg\": function() {\n\n return new Fraction(-this[\"s\"] * this[\"n\"], this[\"d\"]);\n },\n\n /**\n * Adds two rational numbers\n *\n * Ex: new Fraction({n: 2, d: 3}).add(\"14.9\") => 467 / 30\n **/\n \"add\": function(a, b) {\n\n parse(a, b);\n return new Fraction(\n this[\"s\"] * this[\"n\"] * P[\"d\"] + P[\"s\"] * this[\"d\"] * P[\"n\"],\n this[\"d\"] * P[\"d\"]\n );\n },\n\n /**\n * Subtracts two rational numbers\n *\n * Ex: new Fraction({n: 2, d: 3}).add(\"14.9\") => -427 / 30\n **/\n \"sub\": function(a, b) {\n\n parse(a, b);\n return new Fraction(\n this[\"s\"] * this[\"n\"] * P[\"d\"] - P[\"s\"] * this[\"d\"] * P[\"n\"],\n this[\"d\"] * P[\"d\"]\n );\n },\n\n /**\n * Multiplies two rational numbers\n *\n * Ex: new Fraction(\"-17.(345)\").mul(3) => 5776 / 111\n **/\n \"mul\": function(a, b) {\n\n parse(a, b);\n return new Fraction(\n this[\"s\"] * P[\"s\"] * this[\"n\"] * P[\"n\"],\n this[\"d\"] * P[\"d\"]\n );\n },\n\n /**\n * Divides two rational numbers\n *\n * Ex: new Fraction(\"-17.(345)\").inverse().div(3)\n **/\n \"div\": function(a, b) {\n\n parse(a, b);\n return new Fraction(\n this[\"s\"] * P[\"s\"] * this[\"n\"] * P[\"d\"],\n this[\"d\"] * P[\"n\"]\n );\n },\n\n /**\n * Clones the actual object\n *\n * Ex: new Fraction(\"-17.(345)\").clone()\n **/\n \"clone\": function() {\n return new Fraction(this);\n },\n\n /**\n * Calculates the modulo of two rational numbers - a more precise fmod\n *\n * Ex: new Fraction('4.(3)').mod([7, 8]) => (13/3) % (7/8) = (5/6)\n **/\n \"mod\": function(a, b) {\n\n if (isNaN(this['n']) || isNaN(this['d'])) {\n return new Fraction(NaN);\n }\n\n if (a === undefined) {\n return new Fraction(this[\"s\"] * this[\"n\"] % this[\"d\"], 1);\n }\n\n parse(a, b);\n if (0 === P[\"n\"] && 0 === this[\"d\"]) {\n Fraction(0, 0); // Throw DivisionByZero\n }\n\n /*\n * First silly attempt, kinda slow\n *\n return that[\"sub\"]({\n \"n\": num[\"n\"] * Math.floor((this.n / this.d) / (num.n / num.d)),\n \"d\": num[\"d\"],\n \"s\": this[\"s\"]\n });*/\n\n /*\n * New attempt: a1 / b1 = a2 / b2 * q + r\n * => b2 * a1 = a2 * b1 * q + b1 * b2 * r\n * => (b2 * a1 % a2 * b1) / (b1 * b2)\n */\n return new Fraction(\n this[\"s\"] * (P[\"d\"] * this[\"n\"]) % (P[\"n\"] * this[\"d\"]),\n P[\"d\"] * this[\"d\"]\n );\n },\n\n /**\n * Calculates the fractional gcd of two rational numbers\n *\n * Ex: new Fraction(5,8).gcd(3,7) => 1/56\n */\n \"gcd\": function(a, b) {\n\n parse(a, b);\n\n // gcd(a / b, c / d) = gcd(a, c) / lcm(b, d)\n\n return new Fraction(gcd(P[\"n\"], this[\"n\"]) * gcd(P[\"d\"], this[\"d\"]), P[\"d\"] * this[\"d\"]);\n },\n\n /**\n * Calculates the fractional lcm of two rational numbers\n *\n * Ex: new Fraction(5,8).lcm(3,7) => 15\n */\n \"lcm\": function(a, b) {\n\n parse(a, b);\n\n // lcm(a / b, c / d) = lcm(a, c) / gcd(b, d)\n\n if (P[\"n\"] === 0 && this[\"n\"] === 0) {\n return new Fraction;\n }\n return new Fraction(P[\"n\"] * this[\"n\"], gcd(P[\"n\"], this[\"n\"]) * gcd(P[\"d\"], this[\"d\"]));\n },\n\n /**\n * Calculates the ceil of a rational number\n *\n * Ex: new Fraction('4.(3)').ceil() => (5 / 1)\n **/\n \"ceil\": function(places) {\n\n places = Math.pow(10, places || 0);\n\n if (isNaN(this[\"n\"]) || isNaN(this[\"d\"])) {\n return new Fraction(NaN);\n }\n return new Fraction(Math.ceil(places * this[\"s\"] * this[\"n\"] / this[\"d\"]), places);\n },\n\n /**\n * Calculates the floor of a rational number\n *\n * Ex: new Fraction('4.(3)').floor() => (4 / 1)\n **/\n \"floor\": function(places) {\n\n places = Math.pow(10, places || 0);\n\n if (isNaN(this[\"n\"]) || isNaN(this[\"d\"])) {\n return new Fraction(NaN);\n }\n return new Fraction(Math.floor(places * this[\"s\"] * this[\"n\"] / this[\"d\"]), places);\n },\n\n /**\n * Rounds a rational numbers\n *\n * Ex: new Fraction('4.(3)').round() => (4 / 1)\n **/\n \"round\": function(places) {\n\n places = Math.pow(10, places || 0);\n\n if (isNaN(this[\"n\"]) || isNaN(this[\"d\"])) {\n return new Fraction(NaN);\n }\n return new Fraction(Math.round(places * this[\"s\"] * this[\"n\"] / this[\"d\"]), places);\n },\n\n /**\n * Gets the inverse of the fraction, means numerator and denominator are exchanged\n *\n * Ex: new Fraction([-3, 4]).inverse() => -4 / 3\n **/\n \"inverse\": function() {\n\n return new Fraction(this[\"s\"] * this[\"d\"], this[\"n\"]);\n },\n\n /**\n * Calculates the fraction to some rational exponent, if possible\n *\n * Ex: new Fraction(-1,2).pow(-3) => -8\n */\n \"pow\": function(a, b) {\n\n parse(a, b);\n\n // Trivial case when exp is an integer\n\n if (P['d'] === 1) {\n\n if (P['s'] < 0) {\n return new Fraction(Math.pow(this['s'] * this[\"d\"], P['n']), Math.pow(this[\"n\"], P['n']));\n } else {\n return new Fraction(Math.pow(this['s'] * this[\"n\"], P['n']), Math.pow(this[\"d\"], P['n']));\n }\n }\n\n // Negative roots become complex\n // (-a/b)^(c/d) = x\n // <=> (-1)^(c/d) * (a/b)^(c/d) = x\n // <=> (cos(pi) + i*sin(pi))^(c/d) * (a/b)^(c/d) = x # rotate 1 by 180°\n // <=> (cos(c*pi/d) + i*sin(c*pi/d)) * (a/b)^(c/d) = x # DeMoivre's formula in Q ( https://proofwiki.org/wiki/De_Moivre%27s_Formula/Rational_Index )\n // From which follows that only for c=0 the root is non-complex. c/d is a reduced fraction, so that sin(c/dpi)=0 occurs for d=1, which is handled by our trivial case.\n if (this['s'] < 0) return null;\n\n // Now prime factor n and d\n var N = factorize(this['n']);\n var D = factorize(this['d']);\n\n // Exponentiate and take root for n and d individually\n var n = 1;\n var d = 1;\n for (var k in N) {\n if (k === '1') continue;\n if (k === '0') {\n n = 0;\n break;\n }\n N[k]*= P['n'];\n\n if (N[k] % P['d'] === 0) {\n N[k]/= P['d'];\n } else return null;\n n*= Math.pow(k, N[k]);\n }\n\n for (var k in D) {\n if (k === '1') continue;\n D[k]*= P['n'];\n\n if (D[k] % P['d'] === 0) {\n D[k]/= P['d'];\n } else return null;\n d*= Math.pow(k, D[k]);\n }\n\n if (P['s'] < 0) {\n return new Fraction(d, n);\n }\n return new Fraction(n, d);\n },\n\n /**\n * Check if two rational numbers are the same\n *\n * Ex: new Fraction(19.6).equals([98, 5]);\n **/\n \"equals\": function(a, b) {\n\n parse(a, b);\n return this[\"s\"] * this[\"n\"] * P[\"d\"] === P[\"s\"] * P[\"n\"] * this[\"d\"]; // Same as compare() === 0\n },\n\n /**\n * Check if two rational numbers are the same\n *\n * Ex: new Fraction(19.6).equals([98, 5]);\n **/\n \"compare\": function(a, b) {\n\n parse(a, b);\n var t = (this[\"s\"] * this[\"n\"] * P[\"d\"] - P[\"s\"] * P[\"n\"] * this[\"d\"]);\n return (0 < t) - (t < 0);\n },\n\n \"simplify\": function(eps) {\n\n // First naive implementation, needs improvement\n\n if (isNaN(this['n']) || isNaN(this['d'])) {\n return this;\n }\n\n var cont = this['abs']()['toContinued']();\n\n eps = eps || 0.001;\n\n function rec(a) {\n if (a.length === 1)\n return new Fraction(a[0]);\n return rec(a.slice(1))['inverse']()['add'](a[0]);\n }\n\n for (var i = 0; i < cont.length; i++) {\n var tmp = rec(cont.slice(0, i + 1));\n if (tmp['sub'](this['abs']())['abs']().valueOf() < eps) {\n return tmp['mul'](this['s']);\n }\n }\n return this;\n },\n\n /**\n * Check if two rational numbers are divisible\n *\n * Ex: new Fraction(19.6).divisible(1.5);\n */\n \"divisible\": function(a, b) {\n\n parse(a, b);\n return !(!(P[\"n\"] * this[\"d\"]) || ((this[\"n\"] * P[\"d\"]) % (P[\"n\"] * this[\"d\"])));\n },\n\n /**\n * Returns a decimal representation of the fraction\n *\n * Ex: new Fraction(\"100.'91823'\").valueOf() => 100.91823918239183\n **/\n 'valueOf': function() {\n\n return this[\"s\"] * this[\"n\"] / this[\"d\"];\n },\n\n /**\n * Returns a string-fraction representation of a Fraction object\n *\n * Ex: new Fraction(\"1.'3'\").toFraction() => \"4 1/3\"\n **/\n 'toFraction': function(excludeWhole) {\n\n var whole, str = \"\";\n var n = this[\"n\"];\n var d = this[\"d\"];\n if (this[\"s\"] < 0) {\n str += '-';\n }\n\n if (d === 1) {\n str += n;\n } else {\n\n if (excludeWhole && (whole = Math.floor(n / d)) > 0) {\n str += whole;\n str += \" \";\n n %= d;\n }\n\n str += n;\n str += '/';\n str += d;\n }\n return str;\n },\n\n /**\n * Returns a latex representation of a Fraction object\n *\n * Ex: new Fraction(\"1.'3'\").toLatex() => \"\\frac{4}{3}\"\n **/\n 'toLatex': function(excludeWhole) {\n\n var whole, str = \"\";\n var n = this[\"n\"];\n var d = this[\"d\"];\n if (this[\"s\"] < 0) {\n str += '-';\n }\n\n if (d === 1) {\n str += n;\n } else {\n\n if (excludeWhole && (whole = Math.floor(n / d)) > 0) {\n str += whole;\n n %= d;\n }\n\n str += \"\\\\frac{\";\n str += n;\n str += '}{';\n str += d;\n str += '}';\n }\n return str;\n },\n\n /**\n * Returns an array of continued fraction elements\n *\n * Ex: new Fraction(\"7/8\").toContinued() => [0,1,7]\n */\n 'toContinued': function() {\n\n var t;\n var a = this['n'];\n var b = this['d'];\n var res = [];\n\n if (isNaN(a) || isNaN(b)) {\n return res;\n }\n\n do {\n res.push(Math.floor(a / b));\n t = a % b;\n a = b;\n b = t;\n } while (a !== 1);\n\n return res;\n },\n\n /**\n * Creates a string representation of a fraction with all digits\n *\n * Ex: new Fraction(\"100.'91823'\").toString() => \"100.(91823)\"\n **/\n 'toString': function(dec) {\n\n var g;\n var N = this[\"n\"];\n var D = this[\"d\"];\n\n if (isNaN(N) || isNaN(D)) {\n return \"NaN\";\n }\n\n dec = dec || 15; // 15 = decimal places when no repetation\n\n var cycLen = cycleLen(N, D); // Cycle length\n var cycOff = cycleStart(N, D, cycLen); // Cycle start\n\n var str = this['s'] === -1 ? \"-\" : \"\";\n\n str += N / D | 0;\n\n N %= D;\n N *= 10;\n\n if (N)\n str += \".\";\n\n if (cycLen) {\n\n for (var i = cycOff; i--;) {\n str += N / D | 0;\n N %= D;\n N *= 10;\n }\n str += \"(\";\n for (var i = cycLen; i--;) {\n str += N / D | 0;\n N %= D;\n N *= 10;\n }\n str += \")\";\n } else {\n for (var i = dec; N && i--;) {\n str += N / D | 0;\n N %= D;\n N *= 10;\n }\n }\n return str;\n }\n };\n\n if (typeof define === \"function\" && define[\"amd\"]) {\n define([], function() {\n return Fraction;\n });\n } else if (typeof exports === \"object\") {\n Object.defineProperty(Fraction, \"__esModule\", { 'value': true });\n Fraction['default'] = Fraction;\n Fraction['Fraction'] = Fraction;\n module['exports'] = Fraction;\n } else {\n root['Fraction'] = Fraction;\n }\n\n})(this);\n","function E () {\n // Keep this empty so it's easier to inherit from\n // (via https://github.com/lipsmack from https://github.com/scottcorgan/tiny-emitter/issues/3)\n}\n\nE.prototype = {\n on: function (name, callback, ctx) {\n var e = this.e || (this.e = {});\n\n (e[name] || (e[name] = [])).push({\n fn: callback,\n ctx: ctx\n });\n\n return this;\n },\n\n once: function (name, callback, ctx) {\n var self = this;\n function listener () {\n self.off(name, listener);\n callback.apply(ctx, arguments);\n };\n\n listener._ = callback\n return this.on(name, listener, ctx);\n },\n\n emit: function (name) {\n var data = [].slice.call(arguments, 1);\n var evtArr = ((this.e || (this.e = {}))[name] || []).slice();\n var i = 0;\n var len = evtArr.length;\n\n for (i; i < len; i++) {\n evtArr[i].fn.apply(evtArr[i].ctx, data);\n }\n\n return this;\n },\n\n off: function (name, callback) {\n var e = this.e || (this.e = {});\n var evts = e[name];\n var liveEvents = [];\n\n if (evts && callback) {\n for (var i = 0, len = evts.length; i < len; i++) {\n if (evts[i].fn !== callback && evts[i].fn._ !== callback)\n liveEvents.push(evts[i]);\n }\n }\n\n // Remove event from queue to prevent memory leak\n // Suggested by https://github.com/lazd\n // Ref: https://github.com/scottcorgan/tiny-emitter/commit/c6ebfaa9bc973b33d110a84a307742b7cf94c953#commitcomment-5024910\n\n (liveEvents.length)\n ? e[name] = liveEvents\n : delete e[name];\n\n return this;\n }\n};\n\nmodule.exports = E;\nmodule.exports.TinyEmitter = E;\n","/**\n * typed-function\n *\n * Type checking for JavaScript functions\n *\n * https://github.com/josdejong/typed-function\n */\n'use strict';\n\n(function (root, factory) {\n if (typeof define === 'function' && define.amd) {\n // AMD. Register as an anonymous module.\n define([], factory);\n } else if (typeof exports === 'object') {\n // OldNode. Does not work with strict CommonJS, but\n // only CommonJS-like environments that support module.exports,\n // like OldNode.\n module.exports = factory();\n } else {\n // Browser globals (root is window)\n root.typed = factory();\n }\n}(this, function () {\n\n function ok () {\n return true;\n }\n\n function notOk () {\n return false;\n }\n\n function undef () {\n return undefined;\n }\n\n /**\n * @typedef {{\n * params: Param[],\n * fn: function\n * }} Signature\n *\n * @typedef {{\n * types: Type[],\n * restParam: boolean\n * }} Param\n *\n * @typedef {{\n * name: string,\n * typeIndex: number,\n * test: function,\n * conversion?: ConversionDef,\n * conversionIndex: number,\n * }} Type\n *\n * @typedef {{\n * from: string,\n * to: string,\n * convert: function (*) : *\n * }} ConversionDef\n *\n * @typedef {{\n * name: string,\n * test: function(*) : boolean\n * }} TypeDef\n */\n\n // create a new instance of typed-function\n function create () {\n // data type tests\n var _types = [\n { name: 'number', test: function (x) { return typeof x === 'number' } },\n { name: 'string', test: function (x) { return typeof x === 'string' } },\n { name: 'boolean', test: function (x) { return typeof x === 'boolean' } },\n { name: 'Function', test: function (x) { return typeof x === 'function'} },\n { name: 'Array', test: Array.isArray },\n { name: 'Date', test: function (x) { return x instanceof Date } },\n { name: 'RegExp', test: function (x) { return x instanceof RegExp } },\n { name: 'Object', test: function (x) {\n return typeof x === 'object' && x !== null && x.constructor === Object\n }},\n { name: 'null', test: function (x) { return x === null } },\n { name: 'undefined', test: function (x) { return x === undefined } }\n ];\n\n var anyType = {\n name: 'any',\n test: ok\n }\n\n // types which need to be ignored\n var _ignore = [];\n\n // type conversions\n var _conversions = [];\n\n // This is a temporary object, will be replaced with a typed function at the end\n var typed = {\n types: _types,\n conversions: _conversions,\n ignore: _ignore\n };\n\n /**\n * Find the test function for a type\n * @param {String} typeName\n * @return {TypeDef} Returns the type definition when found,\n * Throws a TypeError otherwise\n */\n function findTypeByName (typeName) {\n var entry = findInArray(typed.types, function (entry) {\n return entry.name === typeName;\n });\n\n if (entry) {\n return entry;\n }\n\n if (typeName === 'any') { // special baked-in case 'any'\n return anyType;\n }\n\n var hint = findInArray(typed.types, function (entry) {\n return entry.name.toLowerCase() === typeName.toLowerCase();\n });\n\n throw new TypeError('Unknown type \"' + typeName + '\"' +\n (hint ? ('. Did you mean \"' + hint.name + '\"?') : ''));\n }\n\n /**\n * Find the index of a type definition. Handles special case 'any'\n * @param {TypeDef} type\n * @return {number}\n */\n function findTypeIndex(type) {\n if (type === anyType) {\n return 999;\n }\n\n return typed.types.indexOf(type);\n }\n\n /**\n * Find a type that matches a value.\n * @param {*} value\n * @return {string} Returns the name of the first type for which\n * the type test matches the value.\n */\n function findTypeName(value) {\n var entry = findInArray(typed.types, function (entry) {\n return entry.test(value);\n });\n\n if (entry) {\n return entry.name;\n }\n\n throw new TypeError('Value has unknown type. Value: ' + value);\n }\n\n /**\n * Find a specific signature from a (composed) typed function, for example:\n *\n * typed.find(fn, ['number', 'string'])\n * typed.find(fn, 'number, string')\n *\n * Function find only only works for exact matches.\n *\n * @param {Function} fn A typed-function\n * @param {string | string[]} signature Signature to be found, can be\n * an array or a comma separated string.\n * @return {Function} Returns the matching signature, or\n * throws an error when no signature\n * is found.\n */\n function find (fn, signature) {\n if (!fn.signatures) {\n throw new TypeError('Function is no typed-function');\n }\n\n // normalize input\n var arr;\n if (typeof signature === 'string') {\n arr = signature.split(',');\n for (var i = 0; i < arr.length; i++) {\n arr[i] = arr[i].trim();\n }\n }\n else if (Array.isArray(signature)) {\n arr = signature;\n }\n else {\n throw new TypeError('String array or a comma separated string expected');\n }\n\n var str = arr.join(',');\n\n // find an exact match\n var match = fn.signatures[str];\n if (match) {\n return match;\n }\n\n // TODO: extend find to match non-exact signatures\n\n throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + arr.join(', ') + '))');\n }\n\n /**\n * Convert a given value to another data type.\n * @param {*} value\n * @param {string} type\n */\n function convert (value, type) {\n var from = findTypeName(value);\n\n // check conversion is needed\n if (type === from) {\n return value;\n }\n\n for (var i = 0; i < typed.conversions.length; i++) {\n var conversion = typed.conversions[i];\n if (conversion.from === from && conversion.to === type) {\n return conversion.convert(value);\n }\n }\n\n throw new Error('Cannot convert from ' + from + ' to ' + type);\n }\n \n /**\n * Stringify parameters in a normalized way\n * @param {Param[]} params\n * @return {string}\n */\n function stringifyParams (params) {\n return params\n .map(function (param) {\n var typeNames = param.types.map(getTypeName);\n\n return (param.restParam ? '...' : '') + typeNames.join('|');\n })\n .join(',');\n }\n\n /**\n * Parse a parameter, like \"...number | boolean\"\n * @param {string} param\n * @param {ConversionDef[]} conversions\n * @return {Param} param\n */\n function parseParam (param, conversions) {\n var restParam = param.indexOf('...') === 0;\n var types = (!restParam)\n ? param\n : (param.length > 3)\n ? param.slice(3)\n : 'any';\n\n var typeNames = types.split('|').map(trim)\n .filter(notEmpty)\n .filter(notIgnore);\n\n var matchingConversions = filterConversions(conversions, typeNames);\n\n var exactTypes = typeNames.map(function (typeName) {\n var type = findTypeByName(typeName);\n\n return {\n name: typeName,\n typeIndex: findTypeIndex(type),\n test: type.test,\n conversion: null,\n conversionIndex: -1\n };\n });\n\n var convertibleTypes = matchingConversions.map(function (conversion) {\n var type = findTypeByName(conversion.from);\n\n return {\n name: conversion.from,\n typeIndex: findTypeIndex(type),\n test: type.test,\n conversion: conversion,\n conversionIndex: conversions.indexOf(conversion)\n };\n });\n\n return {\n types: exactTypes.concat(convertibleTypes),\n restParam: restParam\n };\n }\n\n /**\n * Parse a signature with comma separated parameters,\n * like \"number | boolean, ...string\"\n * @param {string} signature\n * @param {function} fn\n * @param {ConversionDef[]} conversions\n * @return {Signature | null} signature\n */\n function parseSignature (signature, fn, conversions) {\n var params = [];\n\n if (signature.trim() !== '') {\n params = signature\n .split(',')\n .map(trim)\n .map(function (param, index, array) {\n var parsedParam = parseParam(param, conversions);\n\n if (parsedParam.restParam && (index !== array.length - 1)) {\n throw new SyntaxError('Unexpected rest parameter \"' + param + '\": ' +\n 'only allowed for the last parameter');\n }\n\n return parsedParam;\n });\n }\n\n if (params.some(isInvalidParam)) {\n // invalid signature: at least one parameter has no types\n // (they may have been filtered)\n return null;\n }\n\n return {\n params: params,\n fn: fn\n };\n }\n\n /**\n * Test whether a set of params contains a restParam\n * @param {Param[]} params\n * @return {boolean} Returns true when the last parameter is a restParam\n */\n function hasRestParam(params) {\n var param = last(params)\n return param ? param.restParam : false;\n }\n\n /**\n * Test whether a parameter contains conversions\n * @param {Param} param\n * @return {boolean} Returns true when at least one of the parameters\n * contains a conversion.\n */\n function hasConversions(param) {\n return param.types.some(function (type) {\n return type.conversion != null;\n });\n }\n\n /**\n * Create a type test for a single parameter, which can have one or multiple\n * types.\n * @param {Param} param\n * @return {function(x: *) : boolean} Returns a test function\n */\n function compileTest(param) {\n if (!param || param.types.length === 0) {\n // nothing to do\n return ok;\n }\n else if (param.types.length === 1) {\n return findTypeByName(param.types[0].name).test;\n }\n else if (param.types.length === 2) {\n var test0 = findTypeByName(param.types[0].name).test;\n var test1 = findTypeByName(param.types[1].name).test;\n return function or(x) {\n return test0(x) || test1(x);\n }\n }\n else { // param.types.length > 2\n var tests = param.types.map(function (type) {\n return findTypeByName(type.name).test;\n })\n return function or(x) {\n for (var i = 0; i < tests.length; i++) {\n if (tests[i](x)) {\n return true;\n }\n }\n return false;\n }\n }\n }\n\n /**\n * Create a test for all parameters of a signature\n * @param {Param[]} params\n * @return {function(args: Array<*>) : boolean}\n */\n function compileTests(params) {\n var tests, test0, test1;\n\n if (hasRestParam(params)) {\n // variable arguments like '...number'\n tests = initial(params).map(compileTest);\n var varIndex = tests.length;\n var lastTest = compileTest(last(params));\n var testRestParam = function (args) {\n for (var i = varIndex; i < args.length; i++) {\n if (!lastTest(args[i])) {\n return false;\n }\n }\n return true;\n }\n\n return function testArgs(args) {\n for (var i = 0; i < tests.length; i++) {\n if (!tests[i](args[i])) {\n return false;\n }\n }\n return testRestParam(args) && (args.length >= varIndex + 1);\n };\n }\n else {\n // no variable arguments\n if (params.length === 0) {\n return function testArgs(args) {\n return args.length === 0;\n };\n }\n else if (params.length === 1) {\n test0 = compileTest(params[0]);\n return function testArgs(args) {\n return test0(args[0]) && args.length === 1;\n };\n }\n else if (params.length === 2) {\n test0 = compileTest(params[0]);\n test1 = compileTest(params[1]);\n return function testArgs(args) {\n return test0(args[0]) && test1(args[1]) && args.length === 2;\n };\n }\n else { // arguments.length > 2\n tests = params.map(compileTest);\n return function testArgs(args) {\n for (var i = 0; i < tests.length; i++) {\n if (!tests[i](args[i])) {\n return false;\n }\n }\n return args.length === tests.length;\n };\n }\n }\n }\n\n /**\n * Find the parameter at a specific index of a signature.\n * Handles rest parameters.\n * @param {Signature} signature\n * @param {number} index\n * @return {Param | null} Returns the matching parameter when found,\n * null otherwise.\n */\n function getParamAtIndex(signature, index) {\n return index < signature.params.length\n ? signature.params[index]\n : hasRestParam(signature.params)\n ? last(signature.params)\n : null\n }\n\n /**\n * Get all type names of a parameter\n * @param {Signature} signature\n * @param {number} index\n * @param {boolean} excludeConversions\n * @return {string[]} Returns an array with type names\n */\n function getExpectedTypeNames (signature, index, excludeConversions) {\n var param = getParamAtIndex(signature, index);\n var types = param\n ? excludeConversions\n ? param.types.filter(isExactType)\n : param.types\n : [];\n\n return types.map(getTypeName);\n }\n\n /**\n * Returns the name of a type\n * @param {Type} type\n * @return {string} Returns the type name\n */\n function getTypeName(type) {\n return type.name;\n }\n\n /**\n * Test whether a type is an exact type or conversion\n * @param {Type} type\n * @return {boolean} Returns true when\n */\n function isExactType(type) {\n return type.conversion === null || type.conversion === undefined;\n }\n\n /**\n * Helper function for creating error messages: create an array with\n * all available types on a specific argument index.\n * @param {Signature[]} signatures\n * @param {number} index\n * @return {string[]} Returns an array with available types\n */\n function mergeExpectedParams(signatures, index) {\n var typeNames = uniq(flatMap(signatures, function (signature) {\n return getExpectedTypeNames(signature, index, false);\n }));\n\n return (typeNames.indexOf('any') !== -1) ? ['any'] : typeNames;\n }\n\n /**\n * Create\n * @param {string} name The name of the function\n * @param {array.<*>} args The actual arguments passed to the function\n * @param {Signature[]} signatures A list with available signatures\n * @return {TypeError} Returns a type error with additional data\n * attached to it in the property `data`\n */\n function createError(name, args, signatures) {\n var err, expected;\n var _name = name || 'unnamed';\n\n // test for wrong type at some index\n var matchingSignatures = signatures;\n var index;\n for (index = 0; index < args.length; index++) {\n var nextMatchingDefs = matchingSignatures.filter(function (signature) {\n var test = compileTest(getParamAtIndex(signature, index));\n return (index < signature.params.length || hasRestParam(signature.params)) &&\n test(args[index]);\n });\n\n if (nextMatchingDefs.length === 0) {\n // no matching signatures anymore, throw error \"wrong type\"\n expected = mergeExpectedParams(matchingSignatures, index);\n if (expected.length > 0) {\n var actualType = findTypeName(args[index]);\n\n err = new TypeError('Unexpected type of argument in function ' + _name +\n ' (expected: ' + expected.join(' or ') +\n ', actual: ' + actualType + ', index: ' + index + ')');\n err.data = {\n category: 'wrongType',\n fn: _name,\n index: index,\n actual: actualType,\n expected: expected\n }\n return err;\n }\n }\n else {\n matchingSignatures = nextMatchingDefs;\n }\n }\n\n // test for too few arguments\n var lengths = matchingSignatures.map(function (signature) {\n return hasRestParam(signature.params) ? Infinity : signature.params.length;\n });\n if (args.length < Math.min.apply(null, lengths)) {\n expected = mergeExpectedParams(matchingSignatures, index);\n err = new TypeError('Too few arguments in function ' + _name +\n ' (expected: ' + expected.join(' or ') +\n ', index: ' + args.length + ')');\n err.data = {\n category: 'tooFewArgs',\n fn: _name,\n index: args.length,\n expected: expected\n }\n return err;\n }\n\n // test for too many arguments\n var maxLength = Math.max.apply(null, lengths);\n if (args.length > maxLength) {\n err = new TypeError('Too many arguments in function ' + _name +\n ' (expected: ' + maxLength + ', actual: ' + args.length + ')');\n err.data = {\n category: 'tooManyArgs',\n fn: _name,\n index: args.length,\n expectedLength: maxLength\n }\n return err;\n }\n\n err = new TypeError('Arguments of type \"' + args.join(', ') +\n '\" do not match any of the defined signatures of function ' + _name + '.');\n err.data = {\n category: 'mismatch',\n actual: args.map(findTypeName)\n }\n return err;\n }\n\n /**\n * Find the lowest index of all exact types of a parameter (no conversions)\n * @param {Param} param\n * @return {number} Returns the index of the lowest type in typed.types\n */\n function getLowestTypeIndex (param) {\n var min = 999;\n\n for (var i = 0; i < param.types.length; i++) {\n if (isExactType(param.types[i])) {\n min = Math.min(min, param.types[i].typeIndex);\n }\n }\n\n return min;\n }\n\n /**\n * Find the lowest index of the conversion of all types of the parameter\n * having a conversion\n * @param {Param} param\n * @return {number} Returns the lowest index of the conversions of this type\n */\n function getLowestConversionIndex (param) {\n var min = 999;\n\n for (var i = 0; i < param.types.length; i++) {\n if (!isExactType(param.types[i])) {\n min = Math.min(min, param.types[i].conversionIndex);\n }\n }\n\n return min;\n }\n\n /**\n * Compare two params\n * @param {Param} param1\n * @param {Param} param2\n * @return {number} returns a negative number when param1 must get a lower\n * index than param2, a positive number when the opposite,\n * or zero when both are equal\n */\n function compareParams (param1, param2) {\n var c;\n\n // compare having a rest parameter or not\n c = param1.restParam - param2.restParam;\n if (c !== 0) {\n return c;\n }\n\n // compare having conversions or not\n c = hasConversions(param1) - hasConversions(param2);\n if (c !== 0) {\n return c;\n }\n\n // compare the index of the types\n c = getLowestTypeIndex(param1) - getLowestTypeIndex(param2);\n if (c !== 0) {\n return c;\n }\n\n // compare the index of any conversion\n return getLowestConversionIndex(param1) - getLowestConversionIndex(param2);\n }\n\n /**\n * Compare two signatures\n * @param {Signature} signature1\n * @param {Signature} signature2\n * @return {number} returns a negative number when param1 must get a lower\n * index than param2, a positive number when the opposite,\n * or zero when both are equal\n */\n function compareSignatures (signature1, signature2) {\n var len = Math.min(signature1.params.length, signature2.params.length);\n var i;\n var c;\n\n // compare whether the params have conversions at all or not\n c = signature1.params.some(hasConversions) - signature2.params.some(hasConversions)\n if (c !== 0) {\n return c;\n }\n\n // next compare whether the params have conversions one by one\n for (i = 0; i < len; i++) {\n c = hasConversions(signature1.params[i]) - hasConversions(signature2.params[i]);\n if (c !== 0) {\n return c;\n }\n }\n\n // compare the types of the params one by one\n for (i = 0; i < len; i++) {\n c = compareParams(signature1.params[i], signature2.params[i]);\n if (c !== 0) {\n return c;\n }\n }\n\n // compare the number of params\n return signature1.params.length - signature2.params.length;\n }\n\n /**\n * Get params containing all types that can be converted to the defined types.\n *\n * @param {ConversionDef[]} conversions\n * @param {string[]} typeNames\n * @return {ConversionDef[]} Returns the conversions that are available\n * for every type (if any)\n */\n function filterConversions(conversions, typeNames) {\n var matches = {};\n\n conversions.forEach(function (conversion) {\n if (typeNames.indexOf(conversion.from) === -1 &&\n typeNames.indexOf(conversion.to) !== -1 &&\n !matches[conversion.from]) {\n matches[conversion.from] = conversion;\n }\n });\n\n return Object.keys(matches).map(function (from) {\n return matches[from];\n });\n }\n\n /**\n * Preprocess arguments before calling the original function:\n * - if needed convert the parameters\n * - in case of rest parameters, move the rest parameters into an Array\n * @param {Param[]} params\n * @param {function} fn\n * @return {function} Returns a wrapped function\n */\n function compileArgsPreprocessing(params, fn) {\n var fnConvert = fn;\n\n // TODO: can we make this wrapper function smarter/simpler?\n\n if (params.some(hasConversions)) {\n var restParam = hasRestParam(params);\n var compiledConversions = params.map(compileArgConversion)\n\n fnConvert = function convertArgs() {\n var args = [];\n var last = restParam ? arguments.length - 1 : arguments.length;\n for (var i = 0; i < last; i++) {\n args[i] = compiledConversions[i](arguments[i]);\n }\n if (restParam) {\n args[last] = arguments[last].map(compiledConversions[last]);\n }\n\n return fn.apply(this, args);\n }\n }\n\n var fnPreprocess = fnConvert;\n if (hasRestParam(params)) {\n var offset = params.length - 1;\n\n fnPreprocess = function preprocessRestParams () {\n return fnConvert.apply(this,\n slice(arguments, 0, offset).concat([slice(arguments, offset)]));\n }\n }\n\n return fnPreprocess;\n }\n\n /**\n * Compile conversion for a parameter to the right type\n * @param {Param} param\n * @return {function} Returns the wrapped function that will convert arguments\n *\n */\n function compileArgConversion(param) {\n var test0, test1, conversion0, conversion1;\n var tests = [];\n var conversions = [];\n\n param.types.forEach(function (type) {\n if (type.conversion) {\n tests.push(findTypeByName(type.conversion.from).test);\n conversions.push(type.conversion.convert);\n }\n });\n\n // create optimized conversion functions depending on the number of conversions\n switch (conversions.length) {\n case 0:\n return function convertArg(arg) {\n return arg;\n }\n\n case 1:\n test0 = tests[0]\n conversion0 = conversions[0];\n return function convertArg(arg) {\n if (test0(arg)) {\n return conversion0(arg)\n }\n return arg;\n }\n\n case 2:\n test0 = tests[0]\n test1 = tests[1]\n conversion0 = conversions[0];\n conversion1 = conversions[1];\n return function convertArg(arg) {\n if (test0(arg)) {\n return conversion0(arg)\n }\n if (test1(arg)) {\n return conversion1(arg)\n }\n return arg;\n }\n\n default:\n return function convertArg(arg) {\n for (var i = 0; i < conversions.length; i++) {\n if (tests[i](arg)) {\n return conversions[i](arg);\n }\n }\n return arg;\n }\n }\n }\n\n /**\n * Convert an array with signatures into a map with signatures,\n * where signatures with union types are split into separate signatures\n *\n * Throws an error when there are conflicting types\n *\n * @param {Signature[]} signatures\n * @return {Object.<string, function>} Returns a map with signatures\n * as key and the original function\n * of this signature as value.\n */\n function createSignaturesMap(signatures) {\n var signaturesMap = {};\n signatures.forEach(function (signature) {\n if (!signature.params.some(hasConversions)) {\n splitParams(signature.params, true).forEach(function (params) {\n signaturesMap[stringifyParams(params)] = signature.fn;\n });\n }\n });\n\n return signaturesMap;\n }\n\n /**\n * Split params with union types in to separate params.\n *\n * For example:\n *\n * splitParams([['Array', 'Object'], ['string', 'RegExp'])\n * // returns:\n * // [\n * // ['Array', 'string'],\n * // ['Array', 'RegExp'],\n * // ['Object', 'string'],\n * // ['Object', 'RegExp']\n * // ]\n *\n * @param {Param[]} params\n * @param {boolean} ignoreConversionTypes\n * @return {Param[]}\n */\n function splitParams(params, ignoreConversionTypes) {\n function _splitParams(params, index, types) {\n if (index < params.length) {\n var param = params[index]\n var filteredTypes = ignoreConversionTypes\n ? param.types.filter(isExactType)\n : param.types;\n var typeGroups\n\n if (param.restParam) {\n // split the types of a rest parameter in two:\n // one with only exact types, and one with exact types and conversions\n var exactTypes = filteredTypes.filter(isExactType)\n typeGroups = exactTypes.length < filteredTypes.length\n ? [exactTypes, filteredTypes]\n : [filteredTypes]\n\n }\n else {\n // split all the types of a regular parameter into one type per group\n typeGroups = filteredTypes.map(function (type) {\n return [type]\n })\n }\n\n // recurse over the groups with types\n return flatMap(typeGroups, function (typeGroup) {\n return _splitParams(params, index + 1, types.concat([typeGroup]));\n });\n\n }\n else {\n // we've reached the end of the parameters. Now build a new Param\n var splittedParams = types.map(function (type, typeIndex) {\n return {\n types: type,\n restParam: (typeIndex === params.length - 1) && hasRestParam(params)\n }\n });\n\n return [splittedParams];\n }\n }\n\n return _splitParams(params, 0, []);\n }\n\n /**\n * Test whether two signatures have a conflicting signature\n * @param {Signature} signature1\n * @param {Signature} signature2\n * @return {boolean} Returns true when the signatures conflict, false otherwise.\n */\n function hasConflictingParams(signature1, signature2) {\n var ii = Math.max(signature1.params.length, signature2.params.length);\n\n for (var i = 0; i < ii; i++) {\n var typesNames1 = getExpectedTypeNames(signature1, i, true);\n var typesNames2 = getExpectedTypeNames(signature2, i, true);\n\n if (!hasOverlap(typesNames1, typesNames2)) {\n return false;\n }\n }\n\n var len1 = signature1.params.length;\n var len2 = signature2.params.length;\n var restParam1 = hasRestParam(signature1.params);\n var restParam2 = hasRestParam(signature2.params);\n\n return restParam1\n ? restParam2 ? (len1 === len2) : (len2 >= len1)\n : restParam2 ? (len1 >= len2) : (len1 === len2)\n }\n\n /**\n * Create a typed function\n * @param {String} name The name for the typed function\n * @param {Object.<string, function>} signaturesMap\n * An object with one or\n * multiple signatures as key, and the\n * function corresponding to the\n * signature as value.\n * @return {function} Returns the created typed function.\n */\n function createTypedFunction(name, signaturesMap) {\n if (Object.keys(signaturesMap).length === 0) {\n throw new SyntaxError('No signatures provided');\n }\n\n // parse the signatures, and check for conflicts\n var parsedSignatures = [];\n Object.keys(signaturesMap)\n .map(function (signature) {\n return parseSignature(signature, signaturesMap[signature], typed.conversions);\n })\n .filter(notNull)\n .forEach(function (parsedSignature) {\n // check whether this parameter conflicts with already parsed signatures\n var conflictingSignature = findInArray(parsedSignatures, function (s) {\n return hasConflictingParams(s, parsedSignature)\n });\n if (conflictingSignature) {\n throw new TypeError('Conflicting signatures \"' +\n stringifyParams(conflictingSignature.params) + '\" and \"' +\n stringifyParams(parsedSignature.params) + '\".');\n }\n\n parsedSignatures.push(parsedSignature);\n });\n\n // split and filter the types of the signatures, and then order them\n var signatures = flatMap(parsedSignatures, function (parsedSignature) {\n var params = parsedSignature ? splitParams(parsedSignature.params, false) : []\n\n return params.map(function (params) {\n return {\n params: params,\n fn: parsedSignature.fn\n };\n });\n }).filter(notNull);\n\n signatures.sort(compareSignatures);\n\n // we create a highly optimized checks for the first couple of signatures with max 2 arguments\n var ok0 = signatures[0] && signatures[0].params.length <= 2 && !hasRestParam(signatures[0].params);\n var ok1 = signatures[1] && signatures[1].params.length <= 2 && !hasRestParam(signatures[1].params);\n var ok2 = signatures[2] && signatures[2].params.length <= 2 && !hasRestParam(signatures[2].params);\n var ok3 = signatures[3] && signatures[3].params.length <= 2 && !hasRestParam(signatures[3].params);\n var ok4 = signatures[4] && signatures[4].params.length <= 2 && !hasRestParam(signatures[4].params);\n var ok5 = signatures[5] && signatures[5].params.length <= 2 && !hasRestParam(signatures[5].params);\n var allOk = ok0 && ok1 && ok2 && ok3 && ok4 && ok5;\n\n // compile the tests\n var tests = signatures.map(function (signature) {\n return compileTests(signature.params);\n });\n\n var test00 = ok0 ? compileTest(signatures[0].params[0]) : notOk;\n var test10 = ok1 ? compileTest(signatures[1].params[0]) : notOk;\n var test20 = ok2 ? compileTest(signatures[2].params[0]) : notOk;\n var test30 = ok3 ? compileTest(signatures[3].params[0]) : notOk;\n var test40 = ok4 ? compileTest(signatures[4].params[0]) : notOk;\n var test50 = ok5 ? compileTest(signatures[5].params[0]) : notOk;\n\n var test01 = ok0 ? compileTest(signatures[0].params[1]) : notOk;\n var test11 = ok1 ? compileTest(signatures[1].params[1]) : notOk;\n var test21 = ok2 ? compileTest(signatures[2].params[1]) : notOk;\n var test31 = ok3 ? compileTest(signatures[3].params[1]) : notOk;\n var test41 = ok4 ? compileTest(signatures[4].params[1]) : notOk;\n var test51 = ok5 ? compileTest(signatures[5].params[1]) : notOk;\n\n // compile the functions\n var fns = signatures.map(function(signature) {\n return compileArgsPreprocessing(signature.params, signature.fn);\n });\n\n var fn0 = ok0 ? fns[0] : undef;\n var fn1 = ok1 ? fns[1] : undef;\n var fn2 = ok2 ? fns[2] : undef;\n var fn3 = ok3 ? fns[3] : undef;\n var fn4 = ok4 ? fns[4] : undef;\n var fn5 = ok5 ? fns[5] : undef;\n\n var len0 = ok0 ? signatures[0].params.length : -1;\n var len1 = ok1 ? signatures[1].params.length : -1;\n var len2 = ok2 ? signatures[2].params.length : -1;\n var len3 = ok3 ? signatures[3].params.length : -1;\n var len4 = ok4 ? signatures[4].params.length : -1;\n var len5 = ok5 ? signatures[5].params.length : -1;\n\n // simple and generic, but also slow\n var iStart = allOk ? 6 : 0;\n var iEnd = signatures.length;\n var generic = function generic() {\n 'use strict';\n\n for (var i = iStart; i < iEnd; i++) {\n if (tests[i](arguments)) {\n return fns[i].apply(this, arguments);\n }\n }\n\n throw createError(name, arguments, signatures);\n }\n\n // create the typed function\n // fast, specialized version. Falls back to the slower, generic one if needed\n var fn = function fn(arg0, arg1) {\n 'use strict';\n\n if (arguments.length === len0 && test00(arg0) && test01(arg1)) { return fn0.apply(fn, arguments); }\n if (arguments.length === len1 && test10(arg0) && test11(arg1)) { return fn1.apply(fn, arguments); }\n if (arguments.length === len2 && test20(arg0) && test21(arg1)) { return fn2.apply(fn, arguments); }\n if (arguments.length === len3 && test30(arg0) && test31(arg1)) { return fn3.apply(fn, arguments); }\n if (arguments.length === len4 && test40(arg0) && test41(arg1)) { return fn4.apply(fn, arguments); }\n if (arguments.length === len5 && test50(arg0) && test51(arg1)) { return fn5.apply(fn, arguments); }\n\n return generic.apply(fn, arguments);\n }\n\n // attach name the typed function\n try {\n Object.defineProperty(fn, 'name', {value: name});\n }\n catch (err) {\n // old browsers do not support Object.defineProperty and some don't support setting the name property\n // the function name is not essential for the functioning, it's mostly useful for debugging,\n // so it's fine to have unnamed functions.\n }\n\n // attach signatures to the function\n fn.signatures = createSignaturesMap(signatures);\n\n return fn;\n }\n\n /**\n * Test whether a type should be NOT be ignored\n * @param {string} typeName\n * @return {boolean}\n */\n function notIgnore(typeName) {\n return typed.ignore.indexOf(typeName) === -1;\n }\n\n /**\n * trim a string\n * @param {string} str\n * @return {string}\n */\n function trim(str) {\n return str.trim();\n }\n\n /**\n * Test whether a string is not empty\n * @param {string} str\n * @return {boolean}\n */\n function notEmpty(str) {\n return !!str;\n }\n\n /**\n * test whether a value is not strict equal to null\n * @param {*} value\n * @return {boolean}\n */\n function notNull(value) {\n return value !== null;\n }\n\n /**\n * Test whether a parameter has no types defined\n * @param {Param} param\n * @return {boolean}\n */\n function isInvalidParam (param) {\n return param.types.length === 0;\n }\n\n /**\n * Return all but the last items of an array\n * @param {Array} arr\n * @return {Array}\n */\n function initial(arr) {\n return arr.slice(0, arr.length - 1);\n }\n\n /**\n * return the last item of an array\n * @param {Array} arr\n * @return {*}\n */\n function last(arr) {\n return arr[arr.length - 1];\n }\n\n /**\n * Slice an array or function Arguments\n * @param {Array | Arguments | IArguments} arr\n * @param {number} start\n * @param {number} [end]\n * @return {Array}\n */\n function slice(arr, start, end) {\n return Array.prototype.slice.call(arr, start, end);\n }\n\n /**\n * Test whether an array contains some item\n * @param {Array} array\n * @param {*} item\n * @return {boolean} Returns true if array contains item, false if not.\n */\n function contains(array, item) {\n return array.indexOf(item) !== -1;\n }\n\n /**\n * Test whether two arrays have overlapping items\n * @param {Array} array1\n * @param {Array} array2\n * @return {boolean} Returns true when at least one item exists in both arrays\n */\n function hasOverlap(array1, array2) {\n for (var i = 0; i < array1.length; i++) {\n if (contains(array2, array1[i])) {\n return true;\n }\n }\n\n return false;\n }\n\n /**\n * Return the first item from an array for which test(arr[i]) returns true\n * @param {Array} arr\n * @param {function} test\n * @return {* | undefined} Returns the first matching item\n * or undefined when there is no match\n */\n function findInArray(arr, test) {\n for (var i = 0; i < arr.length; i++) {\n if (test(arr[i])) {\n return arr[i];\n }\n }\n return undefined;\n }\n\n /**\n * Filter unique items of an array with strings\n * @param {string[]} arr\n * @return {string[]}\n */\n function uniq(arr) {\n var entries = {}\n for (var i = 0; i < arr.length; i++) {\n entries[arr[i]] = true;\n }\n return Object.keys(entries);\n }\n\n /**\n * Flat map the result invoking a callback for every item in an array.\n * https://gist.github.com/samgiles/762ee337dff48623e729\n * @param {Array} arr\n * @param {function} callback\n * @return {Array}\n */\n function flatMap(arr, callback) {\n return Array.prototype.concat.apply([], arr.map(callback));\n }\n\n /**\n * Retrieve the function name from a set of typed functions,\n * and check whether the name of all functions match (if given)\n * @param {function[]} fns\n */\n function getName (fns) {\n var name = '';\n\n for (var i = 0; i < fns.length; i++) {\n var fn = fns[i];\n\n // check whether the names are the same when defined\n if ((typeof fn.signatures === 'object' || typeof fn.signature === 'string') && fn.name !== '') {\n if (name === '') {\n name = fn.name;\n }\n else if (name !== fn.name) {\n var err = new Error('Function names do not match (expected: ' + name + ', actual: ' + fn.name + ')');\n err.data = {\n actual: fn.name,\n expected: name\n };\n throw err;\n }\n }\n }\n\n return name;\n }\n\n // extract and merge all signatures of a list with typed functions\n function extractSignatures(fns) {\n var err;\n var signaturesMap = {};\n\n function validateUnique(_signature, _fn) {\n if (signaturesMap.hasOwnProperty(_signature) && _fn !== signaturesMap[_signature]) {\n err = new Error('Signature \"' + _signature + '\" is defined twice');\n err.data = {signature: _signature};\n throw err;\n // else: both signatures point to the same function, that's fine\n }\n }\n\n for (var i = 0; i < fns.length; i++) {\n var fn = fns[i];\n\n // test whether this is a typed-function\n if (typeof fn.signatures === 'object') {\n // merge the signatures\n for (var signature in fn.signatures) {\n if (fn.signatures.hasOwnProperty(signature)) {\n validateUnique(signature, fn.signatures[signature]);\n signaturesMap[signature] = fn.signatures[signature];\n }\n }\n }\n else if (typeof fn.signature === 'string') {\n validateUnique(fn.signature, fn);\n signaturesMap[fn.signature] = fn;\n }\n else {\n err = new TypeError('Function is no typed-function (index: ' + i + ')');\n err.data = {index: i};\n throw err;\n }\n }\n\n return signaturesMap;\n }\n\n typed = createTypedFunction('typed', {\n 'string, Object': createTypedFunction,\n 'Object': function (signaturesMap) {\n // find existing name\n var fns = [];\n for (var signature in signaturesMap) {\n if (signaturesMap.hasOwnProperty(signature)) {\n fns.push(signaturesMap[signature]);\n }\n }\n var name = getName(fns);\n return createTypedFunction(name, signaturesMap);\n },\n '...Function': function (fns) {\n return createTypedFunction(getName(fns), extractSignatures(fns));\n },\n 'string, ...Function': function (name, fns) {\n return createTypedFunction(name, extractSignatures(fns));\n }\n });\n\n typed.create = create;\n typed.types = _types;\n typed.conversions = _conversions;\n typed.ignore = _ignore;\n typed.convert = convert;\n typed.find = find;\n\n /**\n * add a type\n * @param {{name: string, test: function}} type\n * @param {boolean} [beforeObjectTest=true]\n * If true, the new test will be inserted before\n * the test with name 'Object' (if any), since\n * tests for Object match Array and classes too.\n */\n typed.addType = function (type, beforeObjectTest) {\n if (!type || typeof type.name !== 'string' || typeof type.test !== 'function') {\n throw new TypeError('Object with properties {name: string, test: function} expected');\n }\n\n if (beforeObjectTest !== false) {\n for (var i = 0; i < typed.types.length; i++) {\n if (typed.types[i].name === 'Object') {\n typed.types.splice(i, 0, type);\n return\n }\n }\n }\n\n typed.types.push(type);\n };\n\n // add a conversion\n typed.addConversion = function (conversion) {\n if (!conversion\n || typeof conversion.from !== 'string'\n || typeof conversion.to !== 'string'\n || typeof conversion.convert !== 'function') {\n throw new TypeError('Object with properties {from: string, to: string, convert: function} expected');\n }\n\n typed.conversions.push(conversion);\n };\n\n return typed;\n }\n\n return create();\n}));\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","export var MessageType;\n(function (MessageType) {\n MessageType[\"Call\"] = \"call\";\n MessageType[\"Reply\"] = \"reply\";\n MessageType[\"Syn\"] = \"syn\";\n MessageType[\"SynAck\"] = \"synAck\";\n MessageType[\"Ack\"] = \"ack\";\n})(MessageType || (MessageType = {}));\nexport var Resolution;\n(function (Resolution) {\n Resolution[\"Fulfilled\"] = \"fulfilled\";\n Resolution[\"Rejected\"] = \"rejected\";\n})(Resolution || (Resolution = {}));\nexport var ErrorCode;\n(function (ErrorCode) {\n ErrorCode[\"ConnectionDestroyed\"] = \"ConnectionDestroyed\";\n ErrorCode[\"ConnectionTimeout\"] = \"ConnectionTimeout\";\n ErrorCode[\"NoIframeSrc\"] = \"NoIframeSrc\";\n})(ErrorCode || (ErrorCode = {}));\nexport var NativeErrorName;\n(function (NativeErrorName) {\n NativeErrorName[\"DataCloneError\"] = \"DataCloneError\";\n})(NativeErrorName || (NativeErrorName = {}));\nexport var NativeEventType;\n(function (NativeEventType) {\n NativeEventType[\"Message\"] = \"message\";\n})(NativeEventType || (NativeEventType = {}));\n","export default (localName, log) => {\n const callbacks = [];\n let destroyed = false;\n return {\n destroy(error) {\n if (!destroyed) {\n destroyed = true;\n log(`${localName}: Destroying connection`);\n callbacks.forEach((callback) => {\n callback(error);\n });\n }\n },\n onDestroy(callback) {\n destroyed ? callback() : callbacks.push(callback);\n },\n };\n};\n","const DEFAULT_PORT_BY_PROTOCOL = {\n 'http:': '80',\n 'https:': '443',\n};\nconst URL_REGEX = /^(https?:)?\\/\\/([^/:]+)?(:(\\d+))?/;\nconst opaqueOriginSchemes = ['file:', 'data:'];\n/**\n * Converts a src value into an origin.\n */\nexport default (src) => {\n if (src && opaqueOriginSchemes.find((scheme) => src.startsWith(scheme))) {\n // The origin of the child document is an opaque origin and its\n // serialization is \"null\"\n // https://html.spec.whatwg.org/multipage/origin.html#origin\n return 'null';\n }\n // Note that if src is undefined, then srcdoc is being used instead of src\n // and we can follow this same logic below to get the origin of the parent,\n // which is the origin that we will need to use.\n const location = document.location;\n const regexResult = URL_REGEX.exec(src);\n let protocol;\n let hostname;\n let port;\n if (regexResult) {\n // It's an absolute URL. Use the parsed info.\n // regexResult[1] will be undefined if the URL starts with //\n protocol = regexResult[1] ? regexResult[1] : location.protocol;\n hostname = regexResult[2];\n port = regexResult[4];\n }\n else {\n // It's a relative path. Use the current location's info.\n protocol = location.protocol;\n hostname = location.hostname;\n port = location.port;\n }\n // If the port is the default for the protocol, we don't want to add it to the origin string\n // or it won't match the message's event.origin.\n const portSuffix = port && port !== DEFAULT_PORT_BY_PROTOCOL[protocol] ? `:${port}` : '';\n return `${protocol}//${hostname}${portSuffix}`;\n};\n","/**\n * Converts an error object into a plain object.\n */\nexport const serializeError = ({ name, message, stack, }) => ({\n name,\n message,\n stack,\n});\n/**\n * Converts a plain object into an error object.\n */\nexport const deserializeError = (obj) => {\n const deserializedError = new Error();\n // @ts-ignore\n Object.keys(obj).forEach((key) => (deserializedError[key] = obj[key]));\n return deserializedError;\n};\n","let id = 0;\n/**\n * @return {number} A unique ID (not universally unique)\n */\nexport default () => ++id;\n","const KEY_PATH_DELIMITER = '.';\nconst keyPathToSegments = (keyPath) => keyPath ? keyPath.split(KEY_PATH_DELIMITER) : [];\nconst segmentsToKeyPath = (segments) => segments.join(KEY_PATH_DELIMITER);\nconst createKeyPath = (key, prefix) => {\n const segments = keyPathToSegments(prefix || '');\n segments.push(key);\n return segmentsToKeyPath(segments);\n};\n/**\n * Given a `keyPath`, set it to be `value` on `subject`, creating any intermediate\n * objects along the way.\n *\n * @param {Object} subject The object on which to set value.\n * @param {string} keyPath The key path at which to set value.\n * @param {Object} value The value to store at the given key path.\n * @returns {Object} Updated subject.\n */\nexport const setAtKeyPath = (subject, keyPath, value) => {\n const segments = keyPathToSegments(keyPath);\n segments.reduce((prevSubject, key, idx) => {\n if (typeof prevSubject[key] === 'undefined') {\n prevSubject[key] = {};\n }\n if (idx === segments.length - 1) {\n prevSubject[key] = value;\n }\n return prevSubject[key];\n }, subject);\n return subject;\n};\n/**\n * Given a dictionary of (nested) keys to function, flatten them to a map\n * from key path to function.\n *\n * @param {Object} methods The (potentially nested) object to serialize.\n * @param {string} prefix A string with which to prefix entries. Typically not intended to be used by consumers.\n * @returns {Object} An map from key path in `methods` to functions.\n */\nexport const serializeMethods = (methods, prefix) => {\n const flattenedMethods = {};\n Object.keys(methods).forEach((key) => {\n const value = methods[key];\n const keyPath = createKeyPath(key, prefix);\n if (typeof value === 'object') {\n // Recurse into any nested children.\n Object.assign(flattenedMethods, serializeMethods(value, keyPath));\n }\n if (typeof value === 'function') {\n // If we've found a method, expose it.\n flattenedMethods[keyPath] = value;\n }\n });\n return flattenedMethods;\n};\n/**\n * Given a map of key paths to functions, unpack the key paths to an object.\n *\n * @param {Object} flattenedMethods A map of key paths to functions to unpack.\n * @returns {Object} A (potentially nested) map of functions.\n */\nexport const deserializeMethods = (flattenedMethods) => {\n const methods = {};\n for (const keyPath in flattenedMethods) {\n setAtKeyPath(methods, keyPath, flattenedMethods[keyPath]);\n }\n return methods;\n};\n","import generateId from './generateId';\nimport { deserializeError } from './errorSerialization';\nimport { deserializeMethods } from './methodSerialization';\nimport { ErrorCode, MessageType, NativeEventType, Resolution } from './enums';\n/**\n * Augments an object with methods that match those defined by the remote. When these methods are\n * called, a \"call\" message will be sent to the remote, the remote's corresponding method will be\n * executed, and the method's return value will be returned via a message.\n * @param {Object} callSender Sender object that should be augmented with methods.\n * @param {Object} info Information about the local and remote windows.\n * @param {Array} methodKeyPaths Key paths of methods available to be called on the remote.\n * @param {Promise} destructionPromise A promise resolved when destroy() is called on the penpal\n * connection.\n * @returns {Object} The call sender object with methods that may be called.\n */\nexport default (callSender, info, methodKeyPaths, destroyConnection, log) => {\n const { localName, local, remote, originForSending, originForReceiving, } = info;\n let destroyed = false;\n log(`${localName}: Connecting call sender`);\n const createMethodProxy = (methodName) => {\n return (...args) => {\n log(`${localName}: Sending ${methodName}() call`);\n // This handles the case where the iframe has been removed from the DOM\n // (and therefore its window closed), the consumer has not yet\n // called destroy(), and the user calls a method exposed by\n // the remote. We detect the iframe has been removed and force\n // a destroy() immediately so that the consumer sees the error saying\n // the connection has been destroyed. We wrap this check in a try catch\n // because Edge throws an \"Object expected\" error when accessing\n // contentWindow.closed on a contentWindow from an iframe that's been\n // removed from the DOM.\n let iframeRemoved;\n try {\n if (remote.closed) {\n iframeRemoved = true;\n }\n }\n catch (e) {\n iframeRemoved = true;\n }\n if (iframeRemoved) {\n destroyConnection();\n }\n if (destroyed) {\n const error = new Error(`Unable to send ${methodName}() call due ` + `to destroyed connection`);\n error.code = ErrorCode.ConnectionDestroyed;\n throw error;\n }\n return new Promise((resolve, reject) => {\n const id = generateId();\n const handleMessageEvent = (event) => {\n if (event.source !== remote ||\n event.data.penpal !== MessageType.Reply ||\n event.data.id !== id) {\n return;\n }\n if (event.origin !== originForReceiving) {\n log(`${localName} received message from origin ${event.origin} which did not match expected origin ${originForReceiving}`);\n return;\n }\n const replyMessage = event.data;\n log(`${localName}: Received ${methodName}() reply`);\n local.removeEventListener(NativeEventType.Message, handleMessageEvent);\n let returnValue = replyMessage.returnValue;\n if (replyMessage.returnValueIsError) {\n returnValue = deserializeError(returnValue);\n }\n (replyMessage.resolution === Resolution.Fulfilled ? resolve : reject)(returnValue);\n };\n local.addEventListener(NativeEventType.Message, handleMessageEvent);\n const callMessage = {\n penpal: MessageType.Call,\n id,\n methodName,\n args,\n };\n remote.postMessage(callMessage, originForSending);\n });\n };\n };\n // Wrap each method in a proxy which sends it to the corresponding receiver.\n const flattenedMethods = methodKeyPaths.reduce((api, name) => {\n api[name] = createMethodProxy(name);\n return api;\n }, {});\n // Unpack the structure of the provided methods object onto the CallSender, exposing\n // the methods in the same shape they were provided.\n Object.assign(callSender, deserializeMethods(flattenedMethods));\n return () => {\n destroyed = true;\n };\n};\n","import connectCallReceiver from '../connectCallReceiver';\nimport connectCallSender from '../connectCallSender';\n/**\n * Handles an ACK handshake message.\n */\nexport default (serializedMethods, childOrigin, originForSending, destructor, log) => {\n const { destroy, onDestroy } = destructor;\n let destroyCallReceiver;\n let receiverMethodNames;\n // We resolve the promise with the call sender. If the child reconnects\n // (for example, after refreshing or navigating to another page that\n // uses Penpal, we'll update the call sender with methods that match the\n // latest provided by the child.\n const callSender = {};\n return (event) => {\n if (event.origin !== childOrigin) {\n log(`Parent: Handshake - Received ACK message from origin ${event.origin} which did not match expected origin ${childOrigin}`);\n return;\n }\n log('Parent: Handshake - Received ACK');\n const info = {\n localName: 'Parent',\n local: window,\n remote: event.source,\n originForSending: originForSending,\n originForReceiving: childOrigin,\n };\n // If the child reconnected, we need to destroy the prior call receiver\n // before setting up a new one.\n if (destroyCallReceiver) {\n destroyCallReceiver();\n }\n destroyCallReceiver = connectCallReceiver(info, serializedMethods, log);\n onDestroy(destroyCallReceiver);\n // If the child reconnected, we need to remove the methods from the\n // previous call receiver off the sender.\n if (receiverMethodNames) {\n receiverMethodNames.forEach((receiverMethodName) => {\n delete callSender[receiverMethodName];\n });\n }\n receiverMethodNames = event.data.methodNames;\n const destroyCallSender = connectCallSender(callSender, info, receiverMethodNames, destroy, log);\n onDestroy(destroyCallSender);\n return callSender;\n };\n};\n","import { serializeError } from './errorSerialization';\nimport { MessageType, NativeEventType, NativeErrorName, Resolution, } from './enums';\n/**\n * Listens for \"call\" messages coming from the remote, executes the corresponding method, and\n * responds with the return value.\n */\nexport default (info, serializedMethods, log) => {\n const { localName, local, remote, originForSending, originForReceiving, } = info;\n let destroyed = false;\n const handleMessageEvent = (event) => {\n if (event.source !== remote || event.data.penpal !== MessageType.Call) {\n return;\n }\n if (event.origin !== originForReceiving) {\n log(`${localName} received message from origin ${event.origin} which did not match expected origin ${originForReceiving}`);\n return;\n }\n const callMessage = event.data;\n const { methodName, args, id } = callMessage;\n log(`${localName}: Received ${methodName}() call`);\n const createPromiseHandler = (resolution) => {\n return (returnValue) => {\n log(`${localName}: Sending ${methodName}() reply`);\n if (destroyed) {\n // It's possible to throw an error here, but it would need to be thrown asynchronously\n // and would only be catchable using window.onerror. This is because the consumer\n // is merely returning a value from their method and not calling any function\n // that they could wrap in a try-catch. Even if the consumer were to catch the error,\n // the value of doing so is questionable. Instead, we'll just log a message.\n log(`${localName}: Unable to send ${methodName}() reply due to destroyed connection`);\n return;\n }\n const message = {\n penpal: MessageType.Reply,\n id,\n resolution,\n returnValue,\n };\n if (resolution === Resolution.Rejected &&\n returnValue instanceof Error) {\n message.returnValue = serializeError(returnValue);\n message.returnValueIsError = true;\n }\n try {\n remote.postMessage(message, originForSending);\n }\n catch (err) {\n // If a consumer attempts to send an object that's not cloneable (e.g., window),\n // we want to ensure the receiver's promise gets rejected.\n if (err.name === NativeErrorName.DataCloneError) {\n const errorReplyMessage = {\n penpal: MessageType.Reply,\n id,\n resolution: Resolution.Rejected,\n returnValue: serializeError(err),\n returnValueIsError: true,\n };\n remote.postMessage(errorReplyMessage, originForSending);\n }\n throw err;\n }\n };\n };\n new Promise((resolve) => resolve(serializedMethods[methodName].apply(serializedMethods, args))).then(createPromiseHandler(Resolution.Fulfilled), createPromiseHandler(Resolution.Rejected));\n };\n local.addEventListener(NativeEventType.Message, handleMessageEvent);\n return () => {\n destroyed = true;\n local.removeEventListener(NativeEventType.Message, handleMessageEvent);\n };\n};\n","import { MessageType, NativeEventType } from '../enums';\nimport createDestructor from '../createDestructor';\nimport createLogger from '../createLogger';\nimport getOriginFromSrc from './getOriginFromSrc';\nimport handleAckMessageFactory from './handleAckMessageFactory';\nimport handleSynMessageFactory from './handleSynMessageFactory';\nimport { serializeMethods } from '../methodSerialization';\nimport monitorIframeRemoval from './monitorIframeRemoval';\nimport startConnectionTimeout from '../startConnectionTimeout';\nimport validateIframeHasSrcOrSrcDoc from './validateIframeHasSrcOrSrcDoc';\n/**\n * Attempts to establish communication with an iframe.\n */\nexport default (options) => {\n let { iframe, methods = {}, childOrigin, timeout, debug = false } = options;\n const log = createLogger(debug);\n const destructor = createDestructor('Parent', log);\n const { onDestroy, destroy } = destructor;\n if (!childOrigin) {\n validateIframeHasSrcOrSrcDoc(iframe);\n childOrigin = getOriginFromSrc(iframe.src);\n }\n // If event.origin is \"null\", the remote protocol is file: or data: and we\n // must post messages with \"*\" as targetOrigin when sending messages.\n // https://developer.mozilla.org/en-US/docs/Web/API/Window/postMessage#Using_window.postMessage_in_extensions\n const originForSending = childOrigin === 'null' ? '*' : childOrigin;\n const serializedMethods = serializeMethods(methods);\n const handleSynMessage = handleSynMessageFactory(log, serializedMethods, childOrigin, originForSending);\n const handleAckMessage = handleAckMessageFactory(serializedMethods, childOrigin, originForSending, destructor, log);\n const promise = new Promise((resolve, reject) => {\n const stopConnectionTimeout = startConnectionTimeout(timeout, destroy);\n const handleMessage = (event) => {\n if (event.source !== iframe.contentWindow || !event.data) {\n return;\n }\n if (event.data.penpal === MessageType.Syn) {\n handleSynMessage(event);\n return;\n }\n if (event.data.penpal === MessageType.Ack) {\n const callSender = handleAckMessage(event);\n if (callSender) {\n stopConnectionTimeout();\n resolve(callSender);\n }\n return;\n }\n };\n window.addEventListener(NativeEventType.Message, handleMessage);\n log('Parent: Awaiting handshake');\n monitorIframeRemoval(iframe, destructor);\n onDestroy((error) => {\n window.removeEventListener(NativeEventType.Message, handleMessage);\n if (error) {\n reject(error);\n }\n });\n });\n return {\n promise,\n destroy() {\n // Don't allow consumer to pass an error into destroy.\n destroy();\n },\n };\n};\n","export default (debug) => {\n /**\n * Logs a message if debug is enabled.\n */\n return (...args) => {\n if (debug) {\n console.log('[Penpal]', ...args); // eslint-disable-line no-console\n }\n };\n};\n","import { ErrorCode } from '../enums';\nexport default (iframe) => {\n if (!iframe.src && !iframe.srcdoc) {\n const error = new Error('Iframe must have src or srcdoc property defined.');\n error.code = ErrorCode.NoIframeSrc;\n throw error;\n }\n};\n","import { MessageType } from '../enums';\n/**\n * Handles a SYN handshake message.\n */\nexport default (log, serializedMethods, childOrigin, originForSending) => {\n return (event) => {\n if (event.origin !== childOrigin) {\n log(`Parent: Handshake - Received SYN message from origin ${event.origin} which did not match expected origin ${childOrigin}`);\n return;\n }\n log('Parent: Handshake - Received SYN, responding with SYN-ACK');\n const synAckMessage = {\n penpal: MessageType.SynAck,\n methodNames: Object.keys(serializedMethods),\n };\n event.source.postMessage(synAckMessage, originForSending);\n };\n};\n","import { ErrorCode } from './enums';\n/**\n * Starts a timeout and calls the callback with an error\n * if the timeout completes before the stop function is called.\n */\nexport default (timeout, callback) => {\n let timeoutId;\n if (timeout !== undefined) {\n timeoutId = window.setTimeout(() => {\n const error = new Error(`Connection timed out after ${timeout}ms`);\n error.code = ErrorCode.ConnectionTimeout;\n callback(error);\n }, timeout);\n }\n return () => {\n clearTimeout(timeoutId);\n };\n};\n","const CHECK_IFRAME_IN_DOC_INTERVAL = 60000;\n/**\n * Monitors for iframe removal and destroys connection if iframe\n * is found to have been removed from DOM. This is to prevent memory\n * leaks when the iframe is removed from the document and the consumer\n * hasn't called destroy(). Without this, event listeners attached to\n * the window would stick around and since the event handlers have a\n * reference to the iframe in their closures, the iframe would stick\n * around too.\n */\nexport default (iframe, destructor) => {\n const { destroy, onDestroy } = destructor;\n const checkIframeInDocIntervalId = setInterval(() => {\n if (!iframe.isConnected) {\n clearInterval(checkIframeInDocIntervalId);\n destroy();\n }\n }, CHECK_IFRAME_IN_DOC_INTERVAL);\n onDestroy(() => {\n clearInterval(checkIframeInDocIntervalId);\n });\n};\n","import { Connection, connectToChild } from 'penpal';\n\nexport const validateEditorLink = (editorLink: string) => {\n const linkValidator = new RegExp(/^(?:http(s)?:\\/\\/)?[\\w.-]+(?:\\.[\\w.-]+)+[\\w]+\\/$/);\n let link = '';\n if (linkValidator.test(editorLink)) {\n link = editorLink;\n } else if (editorLink.indexOf('/index.html') > -1) {\n link = editorLink.replace('/index.html', '/');\n } else if (editorLink.charAt(-1) !== '/') {\n link = `${editorLink}/`;\n }\n return link;\n};\n\nexport const setupFrame = (iframe: HTMLIFrameElement, editorLink: string) => {\n const link = validateEditorLink(editorLink);\n const html = `<html>\n <head>\n <base href=\"/\" />\n <meta charset=\"UTF-8\"/> \n \n <meta name=\"assetBase\" content=\"${link}\">\n </head>\n <body> \n <script async src=\"${link}init.js\"></script>\n <script async src=\"https://unpkg.com/penpal@6.1.0/dist/penpal.min.js\"></script>\n <script async src=\"${link}main.dart.js\"></script> \n </body>\n </html>\n `;\n\n // eslint-disable-next-line no-param-reassign\n iframe.srcdoc = 'test';\n\n let iframeDoc: Document = iframe.ownerDocument;\n if (iframe.contentWindow) {\n iframeDoc = iframe.contentWindow.document;\n }\n iframeDoc.open();\n iframeDoc.write(html);\n iframeDoc.close();\n};\ninterface ConfigParameterTypes {\n onActionsChanged: (state: string) => void;\n onStateChanged: (state: string) => void;\n onDocumentLoaded: () => void;\n onSelectedFrameContentChanged: (state: string) => void;\n onSelectedFrameLayoutChanged: (state: string) => void;\n onSelectedLayoutPropertiesChanged: (state: string) => void;\n onPageSelectionChanged: () => void;\n onScrubberPositionChanged: (state: string) => void;\n onFrameAnimationsChanged: (state: string) => void;\n onVariableListChanged: (state: string) => void;\n onSelectedToolChanged: (state: string) => void;\n onUndoStateChanged: (state: string) => void;\n onSelectedLayoutFramesChanged: (state: string) => void;\n onSelectedTextStyleChanged: (styles: string) => void;\n onColorsChanged: (colors: string) => void;\n onParagraphStylesChanged: (paragraphStyles: string) => void;\n onCharacterStylesChanged: (characterStyles: string) => void;\n onFontsChanged: (fonts: string) => void;\n onSelectedLayoutIdChanged: (layoutId: string) => void;\n onLayoutsChanged: (layouts: string) => void;\n onConnectorEvent: (state: string) => void;\n onZoomChanged: (scaleFactor: string) => void;\n onPageSizeChanged: (scaleFactor: string) => void;\n onShapeCornerRadiusChanged: (cornerRadius: string) => void;\n}\n\nconst Connect = (\n editorLink: string,\n params: ConfigParameterTypes,\n setConnection: (connection: Connection) => void,\n editorId = 'chili-editor',\n) => {\n const editorSelectorId = `#${editorId}`;\n const iframe = document.createElement('iframe');\n iframe.setAttribute('srcdoc', ' ');\n iframe.setAttribute('title', 'Chili-Editor');\n iframe.setAttribute('style', 'width: 100%; height: 100%;');\n iframe.setAttribute('frameBorder', '0');\n iframe.setAttribute('referrerpolicy', 'origin');\n\n const setupNewFrame = () => {\n const iframeContainer = document.querySelector(editorSelectorId);\n if (iframeContainer) {\n iframeContainer?.appendChild(iframe);\n setupFrame(iframe, editorLink);\n }\n };\n\n if (document.readyState === 'complete' || document.readyState === 'interactive') {\n setupNewFrame();\n } else {\n document.addEventListener('DOMContentLoaded', () => {\n setupNewFrame();\n });\n }\n setConnection(\n connectToChild({\n // The iframe to which a connection should be made\n iframe,\n // All the methods that we want to expose to the child should be inside the methods object\n // f.e. stateChange(documentJson)\n methods: {\n actionsChanged: params.onActionsChanged,\n stateChanged: params.onStateChanged,\n documentLoaded: params.onDocumentLoaded,\n selectedFrameContent: params.onSelectedFrameContentChanged,\n selectedFrameLayout: params.onSelectedFrameLayoutChanged,\n selectedLayoutProperties: params.onSelectedLayoutPropertiesChanged,\n openLayoutPropertiesPanel: params.onPageSelectionChanged,\n scrubberPositionChanged: params.onScrubberPositionChanged,\n frameAnimationsChanged: params.onFrameAnimationsChanged,\n selectedToolChanged: params.onSelectedToolChanged,\n variableListChanged: params.onVariableListChanged,\n undoStackStateChanged: params.onUndoStateChanged,\n selectedLayoutFramesChanged: params.onSelectedLayoutFramesChanged,\n selectedTextStyleChanged: params.onSelectedTextStyleChanged,\n colorsChanged: params.onColorsChanged,\n paragraphStylesChanged: params.onParagraphStylesChanged,\n characterStylesChanged: params.onCharacterStylesChanged,\n fontsChanged: params.onFontsChanged,\n selectedLayoutId: params.onSelectedLayoutIdChanged,\n layoutListChanged: params.onLayoutsChanged,\n connectorEvent: params.onConnectorEvent,\n zoomChanged: params.onZoomChanged,\n pageSizeChanged: params.onPageSizeChanged,\n shapeCornerRadiusChanged: params.onShapeCornerRadiusChanged,\n },\n }),\n );\n};\nexport default Connect;\n","export default function _extends() {\n _extends = Object.assign || function (target) {\n for (var i = 1; i < arguments.length; i++) {\n var source = arguments[i];\n\n for (var key in source) {\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n target[key] = source[key];\n }\n }\n }\n\n return target;\n };\n\n return _extends.apply(this, arguments);\n}","// type checks for all known types\n//\n// note that:\n//\n// - check by duck-typing on a property like `isUnit`, instead of checking instanceof.\n// instanceof cannot be used because that would not allow to pass data from\n// one instance of math.js to another since each has it's own instance of Unit.\n// - check the `isUnit` property via the constructor, so there will be no\n// matches for \"fake\" instances like plain objects with a property `isUnit`.\n// That is important for security reasons.\n// - It must not be possible to override the type checks used internally,\n// for security reasons, so these functions are not exposed in the expression\n// parser.\nexport function isNumber(x) {\n return typeof x === 'number';\n}\nexport function isBigNumber(x) {\n if (!x || typeof x !== 'object' || typeof x.constructor !== 'function') {\n return false;\n }\n\n if (x.isBigNumber === true && typeof x.constructor.prototype === 'object' && x.constructor.prototype.isBigNumber === true) {\n return true;\n }\n\n if (typeof x.constructor.isDecimal === 'function' && x.constructor.isDecimal(x) === true) {\n return true;\n }\n\n return false;\n}\nexport function isComplex(x) {\n return x && typeof x === 'object' && Object.getPrototypeOf(x).isComplex === true || false;\n}\nexport function isFraction(x) {\n return x && typeof x === 'object' && Object.getPrototypeOf(x).isFraction === true || false;\n}\nexport function isUnit(x) {\n return x && x.constructor.prototype.isUnit === true || false;\n}\nexport function isString(x) {\n return typeof x === 'string';\n}\nexport var isArray = Array.isArray;\nexport function isMatrix(x) {\n return x && x.constructor.prototype.isMatrix === true || false;\n}\n/**\n * Test whether a value is a collection: an Array or Matrix\n * @param {*} x\n * @returns {boolean} isCollection\n */\n\nexport function isCollection(x) {\n return Array.isArray(x) || isMatrix(x);\n}\nexport function isDenseMatrix(x) {\n return x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isSparseMatrix(x) {\n return x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isRange(x) {\n return x && x.constructor.prototype.isRange === true || false;\n}\nexport function isIndex(x) {\n return x && x.constructor.prototype.isIndex === true || false;\n}\nexport function isBoolean(x) {\n return typeof x === 'boolean';\n}\nexport function isResultSet(x) {\n return x && x.constructor.prototype.isResultSet === true || false;\n}\nexport function isHelp(x) {\n return x && x.constructor.prototype.isHelp === true || false;\n}\nexport function isFunction(x) {\n return typeof x === 'function';\n}\nexport function isDate(x) {\n return x instanceof Date;\n}\nexport function isRegExp(x) {\n return x instanceof RegExp;\n}\nexport function isObject(x) {\n return !!(x && typeof x === 'object' && x.constructor === Object && !isComplex(x) && !isFraction(x));\n}\nexport function isNull(x) {\n return x === null;\n}\nexport function isUndefined(x) {\n return x === undefined;\n}\nexport function isAccessorNode(x) {\n return x && x.isAccessorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isArrayNode(x) {\n return x && x.isArrayNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isAssignmentNode(x) {\n return x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isBlockNode(x) {\n return x && x.isBlockNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConditionalNode(x) {\n return x && x.isConditionalNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConstantNode(x) {\n return x && x.isConstantNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isFunctionAssignmentNode(x) {\n return x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isFunctionNode(x) {\n return x && x.isFunctionNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isIndexNode(x) {\n return x && x.isIndexNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isNode(x) {\n return x && x.isNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isObjectNode(x) {\n return x && x.isObjectNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isOperatorNode(x) {\n return x && x.isOperatorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isParenthesisNode(x) {\n return x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isRangeNode(x) {\n return x && x.isRangeNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isSymbolNode(x) {\n return x && x.isSymbolNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isChain(x) {\n return x && x.constructor.prototype.isChain === true || false;\n}\nexport function typeOf(x) {\n var t = typeof x;\n\n if (t === 'object') {\n // JavaScript types\n if (x === null) return 'null';\n if (Array.isArray(x)) return 'Array';\n if (x instanceof Date) return 'Date';\n if (x instanceof RegExp) return 'RegExp'; // math.js types\n\n if (isBigNumber(x)) return 'BigNumber';\n if (isComplex(x)) return 'Complex';\n if (isFraction(x)) return 'Fraction';\n if (isMatrix(x)) return 'Matrix';\n if (isUnit(x)) return 'Unit';\n if (isIndex(x)) return 'Index';\n if (isRange(x)) return 'Range';\n if (isResultSet(x)) return 'ResultSet';\n if (isNode(x)) return x.type;\n if (isChain(x)) return 'Chain';\n if (isHelp(x)) return 'Help';\n return 'Object';\n }\n\n if (t === 'function') return 'Function';\n return t; // can be 'string', 'number', 'boolean', ...\n}","import { isBigNumber } from './is.js';\n/**\n * Clone an object\n *\n * clone(x)\n *\n * Can clone any primitive type, array, and object.\n * If x has a function clone, this function will be invoked to clone the object.\n *\n * @param {*} x\n * @return {*} clone\n */\n\nexport function clone(x) {\n var type = typeof x; // immutable primitive types\n\n if (type === 'number' || type === 'string' || type === 'boolean' || x === null || x === undefined) {\n return x;\n } // use clone function of the object when available\n\n\n if (typeof x.clone === 'function') {\n return x.clone();\n } // array\n\n\n if (Array.isArray(x)) {\n return x.map(function (value) {\n return clone(value);\n });\n }\n\n if (x instanceof Date) return new Date(x.valueOf());\n if (isBigNumber(x)) return x; // bignumbers are immutable\n\n if (x instanceof RegExp) throw new TypeError('Cannot clone ' + x); // TODO: clone a RegExp\n // object\n\n return mapObject(x, clone);\n}\n/**\n * Apply map to all properties of an object\n * @param {Object} object\n * @param {function} callback\n * @return {Object} Returns a copy of the object with mapped properties\n */\n\nexport function mapObject(object, callback) {\n var clone = {};\n\n for (var key in object) {\n if (hasOwnProperty(object, key)) {\n clone[key] = callback(object[key]);\n }\n }\n\n return clone;\n}\n/**\n * Extend object a with the properties of object b\n * @param {Object} a\n * @param {Object} b\n * @return {Object} a\n */\n\nexport function extend(a, b) {\n for (var prop in b) {\n if (hasOwnProperty(b, prop)) {\n a[prop] = b[prop];\n }\n }\n\n return a;\n}\n/**\n * Deep extend an object a with the properties of object b\n * @param {Object} a\n * @param {Object} b\n * @returns {Object}\n */\n\nexport function deepExtend(a, b) {\n // TODO: add support for Arrays to deepExtend\n if (Array.isArray(b)) {\n throw new TypeError('Arrays are not supported by deepExtend');\n }\n\n for (var prop in b) {\n // We check against prop not being in Object.prototype or Function.prototype\n // to prevent polluting for example Object.__proto__.\n if (hasOwnProperty(b, prop) && !(prop in Object.prototype) && !(prop in Function.prototype)) {\n if (b[prop] && b[prop].constructor === Object) {\n if (a[prop] === undefined) {\n a[prop] = {};\n }\n\n if (a[prop] && a[prop].constructor === Object) {\n deepExtend(a[prop], b[prop]);\n } else {\n a[prop] = b[prop];\n }\n } else if (Array.isArray(b[prop])) {\n throw new TypeError('Arrays are not supported by deepExtend');\n } else {\n a[prop] = b[prop];\n }\n }\n }\n\n return a;\n}\n/**\n * Deep test equality of all fields in two pairs of arrays or objects.\n * Compares values and functions strictly (ie. 2 is not the same as '2').\n * @param {Array | Object} a\n * @param {Array | Object} b\n * @returns {boolean}\n */\n\nexport function deepStrictEqual(a, b) {\n var prop, i, len;\n\n if (Array.isArray(a)) {\n if (!Array.isArray(b)) {\n return false;\n }\n\n if (a.length !== b.length) {\n return false;\n }\n\n for (i = 0, len = a.length; i < len; i++) {\n if (!deepStrictEqual(a[i], b[i])) {\n return false;\n }\n }\n\n return true;\n } else if (typeof a === 'function') {\n return a === b;\n } else if (a instanceof Object) {\n if (Array.isArray(b) || !(b instanceof Object)) {\n return false;\n }\n\n for (prop in a) {\n // noinspection JSUnfilteredForInLoop\n if (!(prop in b) || !deepStrictEqual(a[prop], b[prop])) {\n return false;\n }\n }\n\n for (prop in b) {\n // noinspection JSUnfilteredForInLoop\n if (!(prop in a)) {\n return false;\n }\n }\n\n return true;\n } else {\n return a === b;\n }\n}\n/**\n * Recursively flatten a nested object.\n * @param {Object} nestedObject\n * @return {Object} Returns the flattened object\n */\n\nexport function deepFlatten(nestedObject) {\n var flattenedObject = {};\n\n _deepFlatten(nestedObject, flattenedObject);\n\n return flattenedObject;\n} // helper function used by deepFlatten\n\nfunction _deepFlatten(nestedObject, flattenedObject) {\n for (var prop in nestedObject) {\n if (hasOwnProperty(nestedObject, prop)) {\n var value = nestedObject[prop];\n\n if (typeof value === 'object' && value !== null) {\n _deepFlatten(value, flattenedObject);\n } else {\n flattenedObject[prop] = value;\n }\n }\n }\n}\n/**\n * Test whether the current JavaScript engine supports Object.defineProperty\n * @returns {boolean} returns true if supported\n */\n\n\nexport function canDefineProperty() {\n // test needed for broken IE8 implementation\n try {\n if (Object.defineProperty) {\n Object.defineProperty({}, 'x', {\n get: function get() {}\n });\n return true;\n }\n } catch (e) {}\n\n return false;\n}\n/**\n * Attach a lazy loading property to a constant.\n * The given function `fn` is called once when the property is first requested.\n *\n * @param {Object} object Object where to add the property\n * @param {string} prop Property name\n * @param {Function} valueResolver Function returning the property value. Called\n * without arguments.\n */\n\nexport function lazy(object, prop, valueResolver) {\n var _uninitialized = true;\n\n var _value;\n\n Object.defineProperty(object, prop, {\n get: function get() {\n if (_uninitialized) {\n _value = valueResolver();\n _uninitialized = false;\n }\n\n return _value;\n },\n set: function set(value) {\n _value = value;\n _uninitialized = false;\n },\n configurable: true,\n enumerable: true\n });\n}\n/**\n * Traverse a path into an object.\n * When a namespace is missing, it will be created\n * @param {Object} object\n * @param {string | string[]} path A dot separated string like 'name.space'\n * @return {Object} Returns the object at the end of the path\n */\n\nexport function traverse(object, path) {\n if (path && typeof path === 'string') {\n return traverse(object, path.split('.'));\n }\n\n var obj = object;\n\n if (path) {\n for (var i = 0; i < path.length; i++) {\n var key = path[i];\n\n if (!(key in obj)) {\n obj[key] = {};\n }\n\n obj = obj[key];\n }\n }\n\n return obj;\n}\n/**\n * A safe hasOwnProperty\n * @param {Object} object\n * @param {string} property\n */\n\nexport function hasOwnProperty(object, property) {\n return object && Object.hasOwnProperty.call(object, property);\n}\n/**\n * Test whether an object is a factory. a factory has fields:\n *\n * - factory: function (type: Object, config: Object, load: function, typed: function [, math: Object]) (required)\n * - name: string (optional)\n * - path: string A dot separated path (optional)\n * - math: boolean If true (false by default), the math namespace is passed\n * as fifth argument of the factory function\n *\n * @param {*} object\n * @returns {boolean}\n */\n\nexport function isLegacyFactory(object) {\n return object && typeof object.factory === 'function';\n}\n/**\n * Get a nested property from an object\n * @param {Object} object\n * @param {string | string[]} path\n * @returns {Object}\n */\n\nexport function get(object, path) {\n if (typeof path === 'string') {\n if (isPath(path)) {\n return get(object, path.split('.'));\n } else {\n return object[path];\n }\n }\n\n var child = object;\n\n for (var i = 0; i < path.length; i++) {\n var key = path[i];\n child = child ? child[key] : undefined;\n }\n\n return child;\n}\n/**\n * Set a nested property in an object\n * Mutates the object itself\n * If the path doesn't exist, it will be created\n * @param {Object} object\n * @param {string | string[]} path\n * @param {*} value\n * @returns {Object}\n */\n\nexport function set(object, path, value) {\n if (typeof path === 'string') {\n if (isPath(path)) {\n return set(object, path.split('.'), value);\n } else {\n object[path] = value;\n return object;\n }\n }\n\n var child = object;\n\n for (var i = 0; i < path.length - 1; i++) {\n var key = path[i];\n\n if (child[key] === undefined) {\n child[key] = {};\n }\n\n child = child[key];\n }\n\n if (path.length > 0) {\n var lastKey = path[path.length - 1];\n child[lastKey] = value;\n }\n\n return object;\n}\n/**\n * Create an object composed of the picked object properties\n * @param {Object} object\n * @param {string[]} properties\n * @param {function} [transform] Optional value to transform a value when picking it\n * @return {Object}\n */\n\nexport function pick(object, properties, transform) {\n var copy = {};\n\n for (var i = 0; i < properties.length; i++) {\n var key = properties[i];\n var value = get(object, key);\n\n if (value !== undefined) {\n set(copy, key, transform ? transform(value, key) : value);\n }\n }\n\n return copy;\n}\n/**\n * Shallow version of pick, creating an object composed of the picked object properties\n * but not for nested properties\n * @param {Object} object\n * @param {string[]} properties\n * @return {Object}\n */\n\nexport function pickShallow(object, properties) {\n var copy = {};\n\n for (var i = 0; i < properties.length; i++) {\n var key = properties[i];\n var value = object[key];\n\n if (value !== undefined) {\n copy[key] = value;\n }\n }\n\n return copy;\n}\nexport function values(object) {\n return Object.keys(object).map(key => object[key]);\n} // helper function to test whether a string contains a path like 'user.name'\n\nfunction isPath(str) {\n return str.indexOf('.') !== -1;\n}","import { contains } from './array.js';\nimport { pickShallow } from './object.js';\n/**\n * Create a factory function, which can be used to inject dependencies.\n *\n * The created functions are memoized, a consecutive call of the factory\n * with the exact same inputs will return the same function instance.\n * The memoized cache is exposed on `factory.cache` and can be cleared\n * if needed.\n *\n * Example:\n *\n * const name = 'log'\n * const dependencies = ['config', 'typed', 'divideScalar', 'Complex']\n *\n * export const createLog = factory(name, dependencies, ({ typed, config, divideScalar, Complex }) => {\n * // ... create the function log here and return it\n * }\n *\n * @param {string} name Name of the function to be created\n * @param {string[]} dependencies The names of all required dependencies\n * @param {function} create Callback function called with an object with all dependencies\n * @param {Object} [meta] Optional object with meta information that will be attached\n * to the created factory function as property `meta`.\n * @returns {function}\n */\n\nexport function factory(name, dependencies, create, meta) {\n function assertAndCreate(scope) {\n // we only pass the requested dependencies to the factory function\n // to prevent functions to rely on dependencies that are not explicitly\n // requested.\n var deps = pickShallow(scope, dependencies.map(stripOptionalNotation));\n assertDependencies(name, dependencies, scope);\n return create(deps);\n }\n\n assertAndCreate.isFactory = true;\n assertAndCreate.fn = name;\n assertAndCreate.dependencies = dependencies.slice().sort();\n\n if (meta) {\n assertAndCreate.meta = meta;\n }\n\n return assertAndCreate;\n}\n/**\n * Sort all factories such that when loading in order, the dependencies are resolved.\n *\n * @param {Array} factories\n * @returns {Array} Returns a new array with the sorted factories.\n */\n\nexport function sortFactories(factories) {\n var factoriesByName = {};\n factories.forEach(factory => {\n factoriesByName[factory.fn] = factory;\n });\n\n function containsDependency(factory, dependency) {\n // TODO: detect circular references\n if (isFactory(factory)) {\n if (contains(factory.dependencies, dependency.fn || dependency.name)) {\n return true;\n }\n\n if (factory.dependencies.some(d => containsDependency(factoriesByName[d], dependency))) {\n return true;\n }\n }\n\n return false;\n }\n\n var sorted = [];\n\n function addFactory(factory) {\n var index = 0;\n\n while (index < sorted.length && !containsDependency(sorted[index], factory)) {\n index++;\n }\n\n sorted.splice(index, 0, factory);\n } // sort regular factory functions\n\n\n factories.filter(isFactory).forEach(addFactory); // sort legacy factory functions AFTER the regular factory functions\n\n factories.filter(factory => !isFactory(factory)).forEach(addFactory);\n return sorted;\n} // TODO: comment or cleanup if unused in the end\n\nexport function create(factories) {\n var scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n sortFactories(factories).forEach(factory => factory(scope));\n return scope;\n}\n/**\n * Test whether an object is a factory. This is the case when it has\n * properties name, dependencies, and a function create.\n * @param {*} obj\n * @returns {boolean}\n */\n\nexport function isFactory(obj) {\n return typeof obj === 'function' && typeof obj.fn === 'string' && Array.isArray(obj.dependencies);\n}\n/**\n * Assert that all dependencies of a list with dependencies are available in the provided scope.\n *\n * Will throw an exception when there are dependencies missing.\n *\n * @param {string} name Name for the function to be created. Used to generate a useful error message\n * @param {string[]} dependencies\n * @param {Object} scope\n */\n\nexport function assertDependencies(name, dependencies, scope) {\n var allDefined = dependencies.filter(dependency => !isOptionalDependency(dependency)) // filter optionals\n .every(dependency => scope[dependency] !== undefined);\n\n if (!allDefined) {\n var missingDependencies = dependencies.filter(dependency => scope[dependency] === undefined); // TODO: create a custom error class for this, a MathjsError or something like that\n\n throw new Error(\"Cannot create function \\\"\".concat(name, \"\\\", \") + \"some dependencies are missing: \".concat(missingDependencies.map(d => \"\\\"\".concat(d, \"\\\"\")).join(', '), \".\"));\n }\n}\nexport function isOptionalDependency(dependency) {\n return dependency && dependency[0] === '?';\n}\nexport function stripOptionalNotation(dependency) {\n return dependency && dependency[0] === '?' ? dependency.slice(1) : dependency;\n}","import { isNumber } from './is.js';\n/**\n * @typedef {{sign: '+' | '-' | '', coefficients: number[], exponent: number}} SplitValue\n */\n\n/**\n * Check if a number is integer\n * @param {number | boolean} value\n * @return {boolean} isInteger\n */\n\nexport function isInteger(value) {\n if (typeof value === 'boolean') {\n return true;\n }\n\n return isFinite(value) ? value === Math.round(value) : false;\n}\n/**\n * Calculate the sign of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var sign = /* #__PURE__ */Math.sign || function (x) {\n if (x > 0) {\n return 1;\n } else if (x < 0) {\n return -1;\n } else {\n return 0;\n }\n};\n/**\n * Calculate the base-2 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var log2 = /* #__PURE__ */Math.log2 || function log2(x) {\n return Math.log(x) / Math.LN2;\n};\n/**\n * Calculate the base-10 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var log10 = /* #__PURE__ */Math.log10 || function log10(x) {\n return Math.log(x) / Math.LN10;\n};\n/**\n * Calculate the natural logarithm of a number + 1\n * @param {number} x\n * @returns {number}\n */\n\nexport var log1p = /* #__PURE__ */Math.log1p || function (x) {\n return Math.log(x + 1);\n};\n/**\n * Calculate cubic root for a number\n *\n * Code from es6-shim.js:\n * https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1564-L1577\n *\n * @param {number} x\n * @returns {number} Returns the cubic root of x\n */\n\nexport var cbrt = /* #__PURE__ */Math.cbrt || function cbrt(x) {\n if (x === 0) {\n return x;\n }\n\n var negate = x < 0;\n var result;\n\n if (negate) {\n x = -x;\n }\n\n if (isFinite(x)) {\n result = Math.exp(Math.log(x) / 3); // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods\n\n result = (x / (result * result) + 2 * result) / 3;\n } else {\n result = x;\n }\n\n return negate ? -result : result;\n};\n/**\n * Calculates exponentiation minus 1\n * @param {number} x\n * @return {number} res\n */\n\nexport var expm1 = /* #__PURE__ */Math.expm1 || function expm1(x) {\n return x >= 2e-4 || x <= -2e-4 ? Math.exp(x) - 1 : x + x * x / 2 + x * x * x / 6;\n};\n/**\n * Formats a number in a given base\n * @param {number} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\n\nfunction formatNumberToBase(n, base, size) {\n var prefixes = {\n 2: '0b',\n 8: '0o',\n 16: '0x'\n };\n var prefix = prefixes[base];\n var suffix = '';\n\n if (size) {\n if (size < 1) {\n throw new Error('size must be in greater than 0');\n }\n\n if (!isInteger(size)) {\n throw new Error('size must be an integer');\n }\n\n if (n > 2 ** (size - 1) - 1 || n < -(2 ** (size - 1))) {\n throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n }\n\n if (!isInteger(n)) {\n throw new Error('Value must be an integer');\n }\n\n if (n < 0) {\n n = n + 2 ** size;\n }\n\n suffix = \"i\".concat(size);\n }\n\n var sign = '';\n\n if (n < 0) {\n n = -n;\n sign = '-';\n }\n\n return \"\".concat(sign).concat(prefix).concat(n.toString(base)).concat(suffix);\n}\n/**\n * Convert a number to a formatted string representation.\n *\n * Syntax:\n *\n * format(value)\n * format(value, options)\n * format(value, precision)\n * format(value, fn)\n *\n * Where:\n *\n * {number} value The value to be formatted\n * {Object} options An object with formatting options. Available options:\n * {string} notation\n * Number notation. Choose from:\n * 'fixed' Always use regular number notation.\n * For example '123.40' and '14000000'\n * 'exponential' Always use exponential notation.\n * For example '1.234e+2' and '1.4e+7'\n * 'engineering' Always use engineering notation.\n * For example '123.4e+0' and '14.0e+6'\n * 'auto' (default) Regular number notation for numbers\n * having an absolute value between\n * `lowerExp` and `upperExp` bounds, and\n * uses exponential notation elsewhere.\n * Lower bound is included, upper bound\n * is excluded.\n * For example '123.4' and '1.4e7'.\n * 'bin', 'oct, or\n * 'hex' Format the number using binary, octal,\n * or hexadecimal notation.\n * For example '0b1101' and '0x10fe'.\n * {number} wordSize The word size in bits to use for formatting\n * in binary, octal, or hexadecimal notation.\n * To be used only with 'bin', 'oct', or 'hex'\n * values for 'notation' option. When this option\n * is defined the value is formatted as a signed\n * twos complement integer of the given word size\n * and the size suffix is appended to the output.\n * For example\n * format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n * Default value is undefined.\n * {number} precision A number between 0 and 16 to round\n * the digits of the number.\n * In case of notations 'exponential',\n * 'engineering', and 'auto',\n * `precision` defines the total\n * number of significant digits returned.\n * In case of notation 'fixed',\n * `precision` defines the number of\n * significant digits after the decimal\n * point.\n * `precision` is undefined by default,\n * not rounding any digits.\n * {number} lowerExp Exponent determining the lower boundary\n * for formatting a value with an exponent\n * when `notation='auto`.\n * Default value is `-3`.\n * {number} upperExp Exponent determining the upper boundary\n * for formatting a value with an exponent\n * when `notation='auto`.\n * Default value is `5`.\n * {Function} fn A custom formatting function. Can be used to override the\n * built-in notations. Function `fn` is called with `value` as\n * parameter and must return a string. Is useful for example to\n * format all values inside a matrix in a particular way.\n *\n * Examples:\n *\n * format(6.4) // '6.4'\n * format(1240000) // '1.24e6'\n * format(1/3) // '0.3333333333333333'\n * format(1/3, 3) // '0.333'\n * format(21385, 2) // '21000'\n * format(12.071, {notation: 'fixed'}) // '12'\n * format(2.3, {notation: 'fixed', precision: 2}) // '2.30'\n * format(52.8, {notation: 'exponential'}) // '5.28e+1'\n * format(12345678, {notation: 'engineering'}) // '12.345678e+6'\n *\n * @param {number} value\n * @param {Object | Function | number} [options]\n * @return {string} str The formatted value\n */\n\n\nexport function format(value, options) {\n if (typeof options === 'function') {\n // handle format(value, fn)\n return options(value);\n } // handle special cases\n\n\n if (value === Infinity) {\n return 'Infinity';\n } else if (value === -Infinity) {\n return '-Infinity';\n } else if (isNaN(value)) {\n return 'NaN';\n } // default values for options\n\n\n var notation = 'auto';\n var precision;\n var wordSize;\n\n if (options) {\n // determine notation from options\n if (options.notation) {\n notation = options.notation;\n } // determine precision from options\n\n\n if (isNumber(options)) {\n precision = options;\n } else if (isNumber(options.precision)) {\n precision = options.precision;\n }\n\n if (options.wordSize) {\n wordSize = options.wordSize;\n\n if (typeof wordSize !== 'number') {\n throw new Error('Option \"wordSize\" must be a number');\n }\n }\n } // handle the various notations\n\n\n switch (notation) {\n case 'fixed':\n return toFixed(value, precision);\n\n case 'exponential':\n return toExponential(value, precision);\n\n case 'engineering':\n return toEngineering(value, precision);\n\n case 'bin':\n return formatNumberToBase(value, 2, wordSize);\n\n case 'oct':\n return formatNumberToBase(value, 8, wordSize);\n\n case 'hex':\n return formatNumberToBase(value, 16, wordSize);\n\n case 'auto':\n // remove trailing zeros after the decimal point\n return toPrecision(value, precision, options && options).replace(/((\\.\\d*?)(0+))($|e)/, function () {\n var digits = arguments[2];\n var e = arguments[4];\n return digits !== '.' ? digits + e : e;\n });\n\n default:\n throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n }\n}\n/**\n * Split a number into sign, coefficients, and exponent\n * @param {number | string} value\n * @return {SplitValue}\n * Returns an object containing sign, coefficients, and exponent\n */\n\nexport function splitNumber(value) {\n // parse the input value\n var match = String(value).toLowerCase().match(/^(-?)(\\d+\\.?\\d*)(e([+-]?\\d+))?$/);\n\n if (!match) {\n throw new SyntaxError('Invalid number ' + value);\n }\n\n var sign = match[1];\n var digits = match[2];\n var exponent = parseFloat(match[4] || '0');\n var dot = digits.indexOf('.');\n exponent += dot !== -1 ? dot - 1 : digits.length - 1;\n var coefficients = digits.replace('.', '') // remove the dot (must be removed before removing leading zeros)\n .replace(/^0*/, function (zeros) {\n // remove leading zeros, add their count to the exponent\n exponent -= zeros.length;\n return '';\n }).replace(/0*$/, '') // remove trailing zeros\n .split('').map(function (d) {\n return parseInt(d);\n });\n\n if (coefficients.length === 0) {\n coefficients.push(0);\n exponent++;\n }\n\n return {\n sign: sign,\n coefficients: coefficients,\n exponent: exponent\n };\n}\n/**\n * Format a number in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {number | string} value\n * @param {number} [precision] Optional number of significant figures to return.\n */\n\nexport function toEngineering(value, precision) {\n if (isNaN(value) || !isFinite(value)) {\n return String(value);\n }\n\n var split = splitNumber(value);\n var rounded = roundDigits(split, precision);\n var e = rounded.exponent;\n var c = rounded.coefficients; // find nearest lower multiple of 3 for exponent\n\n var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;\n\n if (isNumber(precision)) {\n // add zeroes to give correct sig figs\n while (precision > c.length || e - newExp + 1 > c.length) {\n c.push(0);\n }\n } else {\n // concatenate coefficients with necessary zeros\n // add zeros if necessary (for example: 1e+8 -> 100e+6)\n var missingZeros = Math.abs(e - newExp) - (c.length - 1);\n\n for (var i = 0; i < missingZeros; i++) {\n c.push(0);\n }\n } // find difference in exponents\n\n\n var expDiff = Math.abs(e - newExp);\n var decimalIdx = 1; // push decimal index over by expDiff times\n\n while (expDiff > 0) {\n decimalIdx++;\n expDiff--;\n } // if all coefficient values are zero after the decimal point and precision is unset, don't add a decimal value.\n // otherwise concat with the rest of the coefficients\n\n\n var decimals = c.slice(decimalIdx).join('');\n var decimalVal = isNumber(precision) && decimals.length || decimals.match(/[1-9]/) ? '.' + decimals : '';\n var str = c.slice(0, decimalIdx).join('') + decimalVal + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\n return rounded.sign + str;\n}\n/**\n * Format a number with fixed notation.\n * @param {number | string} value\n * @param {number} [precision=undefined] Optional number of decimals after the\n * decimal point. null by default.\n */\n\nexport function toFixed(value, precision) {\n if (isNaN(value) || !isFinite(value)) {\n return String(value);\n }\n\n var splitValue = splitNumber(value);\n var rounded = typeof precision === 'number' ? roundDigits(splitValue, splitValue.exponent + 1 + precision) : splitValue;\n var c = rounded.coefficients;\n var p = rounded.exponent + 1; // exponent may have changed\n // append zeros if needed\n\n var pp = p + (precision || 0);\n\n if (c.length < pp) {\n c = c.concat(zeros(pp - c.length));\n } // prepend zeros if needed\n\n\n if (p < 0) {\n c = zeros(-p + 1).concat(c);\n p = 1;\n } // insert a dot if needed\n\n\n if (p < c.length) {\n c.splice(p, 0, p === 0 ? '0.' : '.');\n }\n\n return rounded.sign + c.join('');\n}\n/**\n * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'\n * @param {number | string} value\n * @param {number} [precision] Number of digits in formatted output.\n * If not provided, the maximum available digits\n * is used.\n */\n\nexport function toExponential(value, precision) {\n if (isNaN(value) || !isFinite(value)) {\n return String(value);\n } // round if needed, else create a clone\n\n\n var split = splitNumber(value);\n var rounded = precision ? roundDigits(split, precision) : split;\n var c = rounded.coefficients;\n var e = rounded.exponent; // append zeros if needed\n\n if (c.length < precision) {\n c = c.concat(zeros(precision - c.length));\n } // format as `C.CCCe+EEE` or `C.CCCe-EEE`\n\n\n var first = c.shift();\n return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;\n}\n/**\n * Format a number with a certain precision\n * @param {number | string} value\n * @param {number} [precision=undefined] Optional number of digits.\n * @param {{lowerExp: number | undefined, upperExp: number | undefined}} [options]\n * By default:\n * lowerExp = -3 (incl)\n * upper = +5 (excl)\n * @return {string}\n */\n\nexport function toPrecision(value, precision, options) {\n if (isNaN(value) || !isFinite(value)) {\n return String(value);\n } // determine lower and upper bound for exponential notation.\n\n\n var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;\n var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5;\n var split = splitNumber(value);\n var rounded = precision ? roundDigits(split, precision) : split;\n\n if (rounded.exponent < lowerExp || rounded.exponent >= upperExp) {\n // exponential notation\n return toExponential(value, precision);\n } else {\n var c = rounded.coefficients;\n var e = rounded.exponent; // append trailing zeros\n\n if (c.length < precision) {\n c = c.concat(zeros(precision - c.length));\n } // append trailing zeros\n // TODO: simplify the next statement\n\n\n c = c.concat(zeros(e - c.length + 1 + (c.length < precision ? precision - c.length : 0))); // prepend zeros\n\n c = zeros(-e).concat(c);\n var dot = e > 0 ? e : 0;\n\n if (dot < c.length - 1) {\n c.splice(dot + 1, 0, '.');\n }\n\n return rounded.sign + c.join('');\n }\n}\n/**\n * Round the number of digits of a number *\n * @param {SplitValue} split A value split with .splitNumber(value)\n * @param {number} precision A positive integer\n * @return {SplitValue}\n * Returns an object containing sign, coefficients, and exponent\n * with rounded digits\n */\n\nexport function roundDigits(split, precision) {\n // create a clone\n var rounded = {\n sign: split.sign,\n coefficients: split.coefficients,\n exponent: split.exponent\n };\n var c = rounded.coefficients; // prepend zeros if needed\n\n while (precision <= 0) {\n c.unshift(0);\n rounded.exponent++;\n precision++;\n }\n\n if (c.length > precision) {\n var removed = c.splice(precision, c.length - precision);\n\n if (removed[0] >= 5) {\n var i = precision - 1;\n c[i]++;\n\n while (c[i] === 10) {\n c.pop();\n\n if (i === 0) {\n c.unshift(0);\n rounded.exponent++;\n i++;\n }\n\n i--;\n c[i]++;\n }\n }\n }\n\n return rounded;\n}\n/**\n * Create an array filled with zeros.\n * @param {number} length\n * @return {Array}\n */\n\nfunction zeros(length) {\n var arr = [];\n\n for (var i = 0; i < length; i++) {\n arr.push(0);\n }\n\n return arr;\n}\n/**\n * Count the number of significant digits of a number.\n *\n * For example:\n * 2.34 returns 3\n * 0.0034 returns 2\n * 120.5e+30 returns 4\n *\n * @param {number} value\n * @return {number} digits Number of significant digits\n */\n\n\nexport function digits(value) {\n return value.toExponential().replace(/e.*$/, '') // remove exponential notation\n .replace(/^0\\.?0*|\\./, '') // remove decimal point and leading zeros\n .length;\n}\n/**\n * Minimum number added to one that makes the result different than one\n */\n\nexport var DBL_EPSILON = Number.EPSILON || 2.2204460492503130808472633361816E-16;\n/**\n * Compares two floating point numbers.\n * @param {number} x First value to compare\n * @param {number} y Second value to compare\n * @param {number} [epsilon] The maximum relative difference between x and y\n * If epsilon is undefined or null, the function will\n * test whether x and y are exactly equal.\n * @return {boolean} whether the two numbers are nearly equal\n*/\n\nexport function nearlyEqual(x, y, epsilon) {\n // if epsilon is null or undefined, test whether x and y are exactly equal\n if (epsilon === null || epsilon === undefined) {\n return x === y;\n }\n\n if (x === y) {\n return true;\n } // NaN\n\n\n if (isNaN(x) || isNaN(y)) {\n return false;\n } // at this point x and y should be finite\n\n\n if (isFinite(x) && isFinite(y)) {\n // check numbers are very close, needed when comparing numbers near zero\n var diff = Math.abs(x - y);\n\n if (diff < DBL_EPSILON) {\n return true;\n } else {\n // use relative error\n return diff <= Math.max(Math.abs(x), Math.abs(y)) * epsilon;\n }\n } // Infinite and Number or negative Infinite and positive Infinite cases\n\n\n return false;\n}\n/**\n * Calculate the hyperbolic arccos of a number\n * @param {number} x\n * @return {number}\n */\n\nexport var acosh = Math.acosh || function (x) {\n return Math.log(Math.sqrt(x * x - 1) + x);\n};\nexport var asinh = Math.asinh || function (x) {\n return Math.log(Math.sqrt(x * x + 1) + x);\n};\n/**\n * Calculate the hyperbolic arctangent of a number\n * @param {number} x\n * @return {number}\n */\n\nexport var atanh = Math.atanh || function (x) {\n return Math.log((1 + x) / (1 - x)) / 2;\n};\n/**\n * Calculate the hyperbolic cosine of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var cosh = Math.cosh || function (x) {\n return (Math.exp(x) + Math.exp(-x)) / 2;\n};\n/**\n * Calculate the hyperbolic sine of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var sinh = Math.sinh || function (x) {\n return (Math.exp(x) - Math.exp(-x)) / 2;\n};\n/**\n * Calculate the hyperbolic tangent of a number\n * @param {number} x\n * @returns {number}\n */\n\nexport var tanh = Math.tanh || function (x) {\n var e = Math.exp(2 * x);\n return (e - 1) / (e + 1);\n};","import { isInteger } from '../number.js';\n/**\n * Formats a BigNumber in a given base\n * @param {BigNumber} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\n\nfunction formatBigNumberToBase(n, base, size) {\n var BigNumberCtor = n.constructor;\n var big2 = new BigNumberCtor(2);\n var suffix = '';\n\n if (size) {\n if (size < 1) {\n throw new Error('size must be in greater than 0');\n }\n\n if (!isInteger(size)) {\n throw new Error('size must be an integer');\n }\n\n if (n.greaterThan(big2.pow(size - 1).sub(1)) || n.lessThan(big2.pow(size - 1).mul(-1))) {\n throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n }\n\n if (!n.isInteger()) {\n throw new Error('Value must be an integer');\n }\n\n if (n.lessThan(0)) {\n n = n.add(big2.pow(size));\n }\n\n suffix = \"i\".concat(size);\n }\n\n switch (base) {\n case 2:\n return \"\".concat(n.toBinary()).concat(suffix);\n\n case 8:\n return \"\".concat(n.toOctal()).concat(suffix);\n\n case 16:\n return \"\".concat(n.toHexadecimal()).concat(suffix);\n\n default:\n throw new Error(\"Base \".concat(base, \" not supported \"));\n }\n}\n/**\n * Convert a BigNumber to a formatted string representation.\n *\n * Syntax:\n *\n * format(value)\n * format(value, options)\n * format(value, precision)\n * format(value, fn)\n *\n * Where:\n *\n * {number} value The value to be formatted\n * {Object} options An object with formatting options. Available options:\n * {string} notation\n * Number notation. Choose from:\n * 'fixed' Always use regular number notation.\n * For example '123.40' and '14000000'\n * 'exponential' Always use exponential notation.\n * For example '1.234e+2' and '1.4e+7'\n * 'auto' (default) Regular number notation for numbers\n * having an absolute value between\n * `lower` and `upper` bounds, and uses\n * exponential notation elsewhere.\n * Lower bound is included, upper bound\n * is excluded.\n * For example '123.4' and '1.4e7'.\n * 'bin', 'oct, or\n * 'hex' Format the number using binary, octal,\n * or hexadecimal notation.\n * For example '0b1101' and '0x10fe'.\n * {number} wordSize The word size in bits to use for formatting\n * in binary, octal, or hexadecimal notation.\n * To be used only with 'bin', 'oct', or 'hex'\n * values for 'notation' option. When this option\n * is defined the value is formatted as a signed\n * twos complement integer of the given word size\n * and the size suffix is appended to the output.\n * For example\n * format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n * Default value is undefined.\n * {number} precision A number between 0 and 16 to round\n * the digits of the number.\n * In case of notations 'exponential',\n * 'engineering', and 'auto',\n * `precision` defines the total\n * number of significant digits returned.\n * In case of notation 'fixed',\n * `precision` defines the number of\n * significant digits after the decimal\n * point.\n * `precision` is undefined by default.\n * {number} lowerExp Exponent determining the lower boundary\n * for formatting a value with an exponent\n * when `notation='auto`.\n * Default value is `-3`.\n * {number} upperExp Exponent determining the upper boundary\n * for formatting a value with an exponent\n * when `notation='auto`.\n * Default value is `5`.\n * {Function} fn A custom formatting function. Can be used to override the\n * built-in notations. Function `fn` is called with `value` as\n * parameter and must return a string. Is useful for example to\n * format all values inside a matrix in a particular way.\n *\n * Examples:\n *\n * format(6.4) // '6.4'\n * format(1240000) // '1.24e6'\n * format(1/3) // '0.3333333333333333'\n * format(1/3, 3) // '0.333'\n * format(21385, 2) // '21000'\n * format(12e8, {notation: 'fixed'}) // returns '1200000000'\n * format(2.3, {notation: 'fixed', precision: 4}) // returns '2.3000'\n * format(52.8, {notation: 'exponential'}) // returns '5.28e+1'\n * format(12400, {notation: 'engineering'}) // returns '12.400e+3'\n *\n * @param {BigNumber} value\n * @param {Object | Function | number} [options]\n * @return {string} str The formatted value\n */\n\n\nexport function format(value, options) {\n if (typeof options === 'function') {\n // handle format(value, fn)\n return options(value);\n } // handle special cases\n\n\n if (!value.isFinite()) {\n return value.isNaN() ? 'NaN' : value.gt(0) ? 'Infinity' : '-Infinity';\n } // default values for options\n\n\n var notation = 'auto';\n var precision;\n var wordSize;\n\n if (options !== undefined) {\n // determine notation from options\n if (options.notation) {\n notation = options.notation;\n } // determine precision from options\n\n\n if (typeof options === 'number') {\n precision = options;\n } else if (options.precision) {\n precision = options.precision;\n }\n\n if (options.wordSize) {\n wordSize = options.wordSize;\n\n if (typeof wordSize !== 'number') {\n throw new Error('Option \"wordSize\" must be a number');\n }\n }\n } // handle the various notations\n\n\n switch (notation) {\n case 'fixed':\n return toFixed(value, precision);\n\n case 'exponential':\n return toExponential(value, precision);\n\n case 'engineering':\n return toEngineering(value, precision);\n\n case 'bin':\n return formatBigNumberToBase(value, 2, wordSize);\n\n case 'oct':\n return formatBigNumberToBase(value, 8, wordSize);\n\n case 'hex':\n return formatBigNumberToBase(value, 16, wordSize);\n\n case 'auto':\n {\n // determine lower and upper bound for exponential notation.\n // TODO: implement support for upper and lower to be BigNumbers themselves\n var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;\n var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5; // handle special case zero\n\n if (value.isZero()) return '0'; // determine whether or not to output exponential notation\n\n var str;\n var rounded = value.toSignificantDigits(precision);\n var exp = rounded.e;\n\n if (exp >= lowerExp && exp < upperExp) {\n // normal number notation\n str = rounded.toFixed();\n } else {\n // exponential notation\n str = toExponential(value, precision);\n } // remove trailing zeros after the decimal point\n\n\n return str.replace(/((\\.\\d*?)(0+))($|e)/, function () {\n var digits = arguments[2];\n var e = arguments[4];\n return digits !== '.' ? digits + e : e;\n });\n }\n\n default:\n throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n }\n}\n/**\n * Format a BigNumber in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {BigNumber | string} value\n * @param {number} [precision] Optional number of significant figures to return.\n */\n\nexport function toEngineering(value, precision) {\n // find nearest lower multiple of 3 for exponent\n var e = value.e;\n var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3; // find difference in exponents, and calculate the value without exponent\n\n var valueWithoutExp = value.mul(Math.pow(10, -newExp));\n var valueStr = valueWithoutExp.toPrecision(precision);\n\n if (valueStr.indexOf('e') !== -1) {\n valueStr = valueWithoutExp.toString();\n }\n\n return valueStr + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\n}\n/**\n * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'\n * @param {BigNumber} value\n * @param {number} [precision] Number of digits in formatted output.\n * If not provided, the maximum available digits\n * is used.\n * @returns {string} str\n */\n\nexport function toExponential(value, precision) {\n if (precision !== undefined) {\n return value.toExponential(precision - 1); // Note the offset of one\n } else {\n return value.toExponential();\n }\n}\n/**\n * Format a number with fixed notation.\n * @param {BigNumber} value\n * @param {number} [precision=undefined] Optional number of decimals after the\n * decimal point. Undefined by default.\n */\n\nexport function toFixed(value, precision) {\n return value.toFixed(precision);\n}","import { isBigNumber, isString, typeOf } from './is.js';\nimport { format as formatNumber } from './number.js';\nimport { format as formatBigNumber } from './bignumber/formatter.js';\n/**\n * Check if a text ends with a certain string.\n * @param {string} text\n * @param {string} search\n */\n\nexport function endsWith(text, search) {\n var start = text.length - search.length;\n var end = text.length;\n return text.substring(start, end) === search;\n}\n/**\n * Format a value of any type into a string.\n *\n * Usage:\n * math.format(value)\n * math.format(value, precision)\n *\n * When value is a function:\n *\n * - When the function has a property `syntax`, it returns this\n * syntax description.\n * - In other cases, a string `'function'` is returned.\n *\n * When `value` is an Object:\n *\n * - When the object contains a property `format` being a function, this\n * function is invoked as `value.format(options)` and the result is returned.\n * - When the object has its own `toString` method, this method is invoked\n * and the result is returned.\n * - In other cases the function will loop over all object properties and\n * return JSON object notation like '{\"a\": 2, \"b\": 3}'.\n *\n * Example usage:\n * math.format(2/7) // '0.2857142857142857'\n * math.format(math.pi, 3) // '3.14'\n * math.format(new Complex(2, 3)) // '2 + 3i'\n * math.format('hello') // '\"hello\"'\n *\n * @param {*} value Value to be stringified\n * @param {Object | number | Function} [options] Formatting options. See\n * lib/utils/number:format for a\n * description of the available\n * options.\n * @return {string} str\n */\n\nexport function format(value, options) {\n if (typeof value === 'number') {\n return formatNumber(value, options);\n }\n\n if (isBigNumber(value)) {\n return formatBigNumber(value, options);\n } // note: we use unsafe duck-typing here to check for Fractions, this is\n // ok here since we're only invoking toString or concatenating its values\n\n\n if (looksLikeFraction(value)) {\n if (!options || options.fraction !== 'decimal') {\n // output as ratio, like '1/3'\n return value.s * value.n + '/' + value.d;\n } else {\n // output as decimal, like '0.(3)'\n return value.toString();\n }\n }\n\n if (Array.isArray(value)) {\n return formatArray(value, options);\n }\n\n if (isString(value)) {\n return '\"' + value + '\"';\n }\n\n if (typeof value === 'function') {\n return value.syntax ? String(value.syntax) : 'function';\n }\n\n if (value && typeof value === 'object') {\n if (typeof value.format === 'function') {\n return value.format(options);\n } else if (value && value.toString(options) !== {}.toString()) {\n // this object has a non-native toString method, use that one\n return value.toString(options);\n } else {\n var entries = Object.keys(value).map(key => {\n return '\"' + key + '\": ' + format(value[key], options);\n });\n return '{' + entries.join(', ') + '}';\n }\n }\n\n return String(value);\n}\n/**\n * Stringify a value into a string enclosed in double quotes.\n * Unescaped double quotes and backslashes inside the value are escaped.\n * @param {*} value\n * @return {string}\n */\n\nexport function stringify(value) {\n var text = String(value);\n var escaped = '';\n var i = 0;\n\n while (i < text.length) {\n var c = text.charAt(i);\n\n if (c === '\\\\') {\n escaped += c;\n i++;\n c = text.charAt(i);\n\n if (c === '' || '\"\\\\/bfnrtu'.indexOf(c) === -1) {\n escaped += '\\\\'; // no valid escape character -> escape it\n }\n\n escaped += c;\n } else if (c === '\"') {\n escaped += '\\\\\"';\n } else {\n escaped += c;\n }\n\n i++;\n }\n\n return '\"' + escaped + '\"';\n}\n/**\n * Escape special HTML characters\n * @param {*} value\n * @return {string}\n */\n\nexport function escape(value) {\n var text = String(value);\n text = text.replace(/&/g, '&').replace(/\"/g, '"').replace(/'/g, ''').replace(/</g, '<').replace(/>/g, '>');\n return text;\n}\n/**\n * Recursively format an n-dimensional matrix\n * Example output: \"[[1, 2], [3, 4]]\"\n * @param {Array} array\n * @param {Object | number | Function} [options] Formatting options. See\n * lib/utils/number:format for a\n * description of the available\n * options.\n * @returns {string} str\n */\n\nfunction formatArray(array, options) {\n if (Array.isArray(array)) {\n var str = '[';\n var len = array.length;\n\n for (var i = 0; i < len; i++) {\n if (i !== 0) {\n str += ', ';\n }\n\n str += formatArray(array[i], options);\n }\n\n str += ']';\n return str;\n } else {\n return format(array, options);\n }\n}\n/**\n * Check whether a value looks like a Fraction (unsafe duck-type check)\n * @param {*} value\n * @return {boolean}\n */\n\n\nfunction looksLikeFraction(value) {\n return value && typeof value === 'object' && typeof value.s === 'number' && typeof value.n === 'number' && typeof value.d === 'number' || false;\n}\n/**\n * Compare two strings\n * @param {string} x\n * @param {string} y\n * @returns {number}\n */\n\n\nexport function compareText(x, y) {\n // we don't want to convert numbers to string, only accept string input\n if (!isString(x)) {\n throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(x) + ', index: 0)');\n }\n\n if (!isString(y)) {\n throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(y) + ', index: 1)');\n }\n\n return x === y ? 0 : x > y ? 1 : -1;\n}","/**\n * Create a range error with the message:\n * 'Dimension mismatch (<actual size> != <expected size>)'\n * @param {number | number[]} actual The actual size\n * @param {number | number[]} expected The expected size\n * @param {string} [relation='!='] Optional relation between actual\n * and expected size: '!=', '<', etc.\n * @extends RangeError\n */\nexport function DimensionError(actual, expected, relation) {\n if (!(this instanceof DimensionError)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n\n this.actual = actual;\n this.expected = expected;\n this.relation = relation;\n this.message = 'Dimension mismatch (' + (Array.isArray(actual) ? '[' + actual.join(', ') + ']' : actual) + ' ' + (this.relation || '!=') + ' ' + (Array.isArray(expected) ? '[' + expected.join(', ') + ']' : expected) + ')';\n this.stack = new Error().stack;\n}\nDimensionError.prototype = new RangeError();\nDimensionError.prototype.constructor = RangeError;\nDimensionError.prototype.name = 'DimensionError';\nDimensionError.prototype.isDimensionError = true;","/**\n * Create a range error with the message:\n * 'Index out of range (index < min)'\n * 'Index out of range (index < max)'\n *\n * @param {number} index The actual index\n * @param {number} [min=0] Minimum index (included)\n * @param {number} [max] Maximum index (excluded)\n * @extends RangeError\n */\nexport function IndexError(index, min, max) {\n if (!(this instanceof IndexError)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n\n this.index = index;\n\n if (arguments.length < 3) {\n this.min = 0;\n this.max = min;\n } else {\n this.min = min;\n this.max = max;\n }\n\n if (this.min !== undefined && this.index < this.min) {\n this.message = 'Index out of range (' + this.index + ' < ' + this.min + ')';\n } else if (this.max !== undefined && this.index >= this.max) {\n this.message = 'Index out of range (' + this.index + ' > ' + (this.max - 1) + ')';\n } else {\n this.message = 'Index out of range (' + this.index + ')';\n }\n\n this.stack = new Error().stack;\n}\nIndexError.prototype = new RangeError();\nIndexError.prototype.constructor = RangeError;\nIndexError.prototype.name = 'IndexError';\nIndexError.prototype.isIndexError = true;","import { isInteger } from './number.js';\nimport { isNumber } from './is.js';\nimport { format } from './string.js';\nimport { DimensionError } from '../error/DimensionError.js';\nimport { IndexError } from '../error/IndexError.js';\n/**\n * Calculate the size of a multi dimensional array.\n * This function checks the size of the first entry, it does not validate\n * whether all dimensions match. (use function `validate` for that)\n * @param {Array} x\n * @Return {Number[]} size\n */\n\nexport function arraySize(x) {\n var s = [];\n\n while (Array.isArray(x)) {\n s.push(x.length);\n x = x[0];\n }\n\n return s;\n}\n/**\n * Recursively validate whether each element in a multi dimensional array\n * has a size corresponding to the provided size array.\n * @param {Array} array Array to be validated\n * @param {number[]} size Array with the size of each dimension\n * @param {number} dim Current dimension\n * @throws DimensionError\n * @private\n */\n\nfunction _validate(array, size, dim) {\n var i;\n var len = array.length;\n\n if (len !== size[dim]) {\n throw new DimensionError(len, size[dim]);\n }\n\n if (dim < size.length - 1) {\n // recursively validate each child array\n var dimNext = dim + 1;\n\n for (i = 0; i < len; i++) {\n var child = array[i];\n\n if (!Array.isArray(child)) {\n throw new DimensionError(size.length - 1, size.length, '<');\n }\n\n _validate(array[i], size, dimNext);\n }\n } else {\n // last dimension. none of the childs may be an array\n for (i = 0; i < len; i++) {\n if (Array.isArray(array[i])) {\n throw new DimensionError(size.length + 1, size.length, '>');\n }\n }\n }\n}\n/**\n * Validate whether each element in a multi dimensional array has\n * a size corresponding to the provided size array.\n * @param {Array} array Array to be validated\n * @param {number[]} size Array with the size of each dimension\n * @throws DimensionError\n */\n\n\nexport function validate(array, size) {\n var isScalar = size.length === 0;\n\n if (isScalar) {\n // scalar\n if (Array.isArray(array)) {\n throw new DimensionError(array.length, 0);\n }\n } else {\n // array\n _validate(array, size, 0);\n }\n}\n/**\n * Test whether index is an integer number with index >= 0 and index < length\n * when length is provided\n * @param {number} index Zero-based index\n * @param {number} [length] Length of the array\n */\n\nexport function validateIndex(index, length) {\n if (!isNumber(index) || !isInteger(index)) {\n throw new TypeError('Index must be an integer (value: ' + index + ')');\n }\n\n if (index < 0 || typeof length === 'number' && index >= length) {\n throw new IndexError(index, length);\n }\n}\n/**\n * Resize a multi dimensional array. The resized array is returned.\n * @param {Array} array Array to be resized\n * @param {Array.<number>} size Array with the size of each dimension\n * @param {*} [defaultValue=0] Value to be filled in in new entries,\n * zero by default. Specify for example `null`,\n * to clearly see entries that are not explicitly\n * set.\n * @return {Array} array The resized array\n */\n\nexport function resize(array, size, defaultValue) {\n // TODO: add support for scalars, having size=[] ?\n // check the type of the arguments\n if (!Array.isArray(array) || !Array.isArray(size)) {\n throw new TypeError('Array expected');\n }\n\n if (size.length === 0) {\n throw new Error('Resizing to scalar is not supported');\n } // check whether size contains positive integers\n\n\n size.forEach(function (value) {\n if (!isNumber(value) || !isInteger(value) || value < 0) {\n throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(size) + ')');\n }\n }); // recursively resize the array\n\n var _defaultValue = defaultValue !== undefined ? defaultValue : 0;\n\n _resize(array, size, 0, _defaultValue);\n\n return array;\n}\n/**\n * Recursively resize a multi dimensional array\n * @param {Array} array Array to be resized\n * @param {number[]} size Array with the size of each dimension\n * @param {number} dim Current dimension\n * @param {*} [defaultValue] Value to be filled in in new entries,\n * undefined by default.\n * @private\n */\n\nfunction _resize(array, size, dim, defaultValue) {\n var i;\n var elem;\n var oldLen = array.length;\n var newLen = size[dim];\n var minLen = Math.min(oldLen, newLen); // apply new length\n\n array.length = newLen;\n\n if (dim < size.length - 1) {\n // non-last dimension\n var dimNext = dim + 1; // resize existing child arrays\n\n for (i = 0; i < minLen; i++) {\n // resize child array\n elem = array[i];\n\n if (!Array.isArray(elem)) {\n elem = [elem]; // add a dimension\n\n array[i] = elem;\n }\n\n _resize(elem, size, dimNext, defaultValue);\n } // create new child arrays\n\n\n for (i = minLen; i < newLen; i++) {\n // get child array\n elem = [];\n array[i] = elem; // resize new child array\n\n _resize(elem, size, dimNext, defaultValue);\n }\n } else {\n // last dimension\n // remove dimensions of existing values\n for (i = 0; i < minLen; i++) {\n while (Array.isArray(array[i])) {\n array[i] = array[i][0];\n }\n } // fill new elements with the default value\n\n\n for (i = minLen; i < newLen; i++) {\n array[i] = defaultValue;\n }\n }\n}\n/**\n * Re-shape a multi dimensional array to fit the specified dimensions\n * @param {Array} array Array to be reshaped\n * @param {Array.<number>} sizes List of sizes for each dimension\n * @returns {Array} Array whose data has been formatted to fit the\n * specified dimensions\n *\n * @throws {DimensionError} If the product of the new dimension sizes does\n * not equal that of the old ones\n */\n\n\nexport function reshape(array, sizes) {\n var flatArray = flatten(array);\n var currentLength = flatArray.length;\n\n if (!Array.isArray(array) || !Array.isArray(sizes)) {\n throw new TypeError('Array expected');\n }\n\n if (sizes.length === 0) {\n throw new DimensionError(0, currentLength, '!=');\n }\n\n sizes = processSizesWildcard(sizes, currentLength);\n var newLength = product(sizes);\n\n if (currentLength !== newLength) {\n throw new DimensionError(newLength, currentLength, '!=');\n }\n\n try {\n return _reshape(flatArray, sizes);\n } catch (e) {\n if (e instanceof DimensionError) {\n throw new DimensionError(newLength, currentLength, '!=');\n }\n\n throw e;\n }\n}\n/**\n * Replaces the wildcard -1 in the sizes array.\n * @param {Array.<number>} sizes List of sizes for each dimension. At most on wildcard.\n * @param {number} currentLength Number of elements in the array.\n * @throws {Error} If more than one wildcard or unable to replace it.\n * @returns {Array.<number>} The sizes array with wildcard replaced.\n */\n\nexport function processSizesWildcard(sizes, currentLength) {\n var newLength = product(sizes);\n var processedSizes = sizes.slice();\n var WILDCARD = -1;\n var wildCardIndex = sizes.indexOf(WILDCARD);\n var isMoreThanOneWildcard = sizes.indexOf(WILDCARD, wildCardIndex + 1) >= 0;\n\n if (isMoreThanOneWildcard) {\n throw new Error('More than one wildcard in sizes');\n }\n\n var hasWildcard = wildCardIndex >= 0;\n var canReplaceWildcard = currentLength % newLength === 0;\n\n if (hasWildcard) {\n if (canReplaceWildcard) {\n processedSizes[wildCardIndex] = -currentLength / newLength;\n } else {\n throw new Error('Could not replace wildcard, since ' + currentLength + ' is no multiple of ' + -newLength);\n }\n }\n\n return processedSizes;\n}\n/**\n * Computes the product of all array elements.\n * @param {Array<number>} array Array of factors\n * @returns {number} Product of all elements\n */\n\nfunction product(array) {\n return array.reduce((prev, curr) => prev * curr, 1);\n}\n/**\n * Iteratively re-shape a multi dimensional array to fit the specified dimensions\n * @param {Array} array Array to be reshaped\n * @param {Array.<number>} sizes List of sizes for each dimension\n * @returns {Array} Array whose data has been formatted to fit the\n * specified dimensions\n */\n\n\nfunction _reshape(array, sizes) {\n // testing if there are enough elements for the requested shape\n var tmpArray = array;\n var tmpArray2; // for each dimensions starting by the last one and ignoring the first one\n\n for (var sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {\n var size = sizes[sizeIndex];\n tmpArray2 = []; // aggregate the elements of the current tmpArray in elements of the requested size\n\n var length = tmpArray.length / size;\n\n for (var i = 0; i < length; i++) {\n tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size));\n } // set it as the new tmpArray for the next loop turn or for return\n\n\n tmpArray = tmpArray2;\n }\n\n return tmpArray;\n}\n/**\n * Squeeze a multi dimensional array\n * @param {Array} array\n * @param {Array} [size]\n * @returns {Array} returns the array itself\n */\n\n\nexport function squeeze(array, size) {\n var s = size || arraySize(array); // squeeze outer dimensions\n\n while (Array.isArray(array) && array.length === 1) {\n array = array[0];\n s.shift();\n } // find the first dimension to be squeezed\n\n\n var dims = s.length;\n\n while (s[dims - 1] === 1) {\n dims--;\n } // squeeze inner dimensions\n\n\n if (dims < s.length) {\n array = _squeeze(array, dims, 0);\n s.length = dims;\n }\n\n return array;\n}\n/**\n * Recursively squeeze a multi dimensional array\n * @param {Array} array\n * @param {number} dims Required number of dimensions\n * @param {number} dim Current dimension\n * @returns {Array | *} Returns the squeezed array\n * @private\n */\n\nfunction _squeeze(array, dims, dim) {\n var i, ii;\n\n if (dim < dims) {\n var next = dim + 1;\n\n for (i = 0, ii = array.length; i < ii; i++) {\n array[i] = _squeeze(array[i], dims, next);\n }\n } else {\n while (Array.isArray(array)) {\n array = array[0];\n }\n }\n\n return array;\n}\n/**\n * Unsqueeze a multi dimensional array: add dimensions when missing\n *\n * Paramter `size` will be mutated to match the new, unqueezed matrix size.\n *\n * @param {Array} array\n * @param {number} dims Desired number of dimensions of the array\n * @param {number} [outer] Number of outer dimensions to be added\n * @param {Array} [size] Current size of array.\n * @returns {Array} returns the array itself\n * @private\n */\n\n\nexport function unsqueeze(array, dims, outer, size) {\n var s = size || arraySize(array); // unsqueeze outer dimensions\n\n if (outer) {\n for (var i = 0; i < outer; i++) {\n array = [array];\n s.unshift(1);\n }\n } // unsqueeze inner dimensions\n\n\n array = _unsqueeze(array, dims, 0);\n\n while (s.length < dims) {\n s.push(1);\n }\n\n return array;\n}\n/**\n * Recursively unsqueeze a multi dimensional array\n * @param {Array} array\n * @param {number} dims Required number of dimensions\n * @param {number} dim Current dimension\n * @returns {Array | *} Returns the squeezed array\n * @private\n */\n\nfunction _unsqueeze(array, dims, dim) {\n var i, ii;\n\n if (Array.isArray(array)) {\n var next = dim + 1;\n\n for (i = 0, ii = array.length; i < ii; i++) {\n array[i] = _unsqueeze(array[i], dims, next);\n }\n } else {\n for (var d = dim; d < dims; d++) {\n array = [array];\n }\n }\n\n return array;\n}\n/**\n * Flatten a multi dimensional array, put all elements in a one dimensional\n * array\n * @param {Array} array A multi dimensional array\n * @return {Array} The flattened array (1 dimensional)\n */\n\n\nexport function flatten(array) {\n if (!Array.isArray(array)) {\n // if not an array, return as is\n return array;\n }\n\n var flat = [];\n array.forEach(function callback(value) {\n if (Array.isArray(value)) {\n value.forEach(callback); // traverse through sub-arrays recursively\n } else {\n flat.push(value);\n }\n });\n return flat;\n}\n/**\n * A safe map\n * @param {Array} array\n * @param {function} callback\n */\n\nexport function map(array, callback) {\n return Array.prototype.map.call(array, callback);\n}\n/**\n * A safe forEach\n * @param {Array} array\n * @param {function} callback\n */\n\nexport function forEach(array, callback) {\n Array.prototype.forEach.call(array, callback);\n}\n/**\n * A safe filter\n * @param {Array} array\n * @param {function} callback\n */\n\nexport function filter(array, callback) {\n if (arraySize(array).length !== 1) {\n throw new Error('Only one dimensional matrices supported');\n }\n\n return Array.prototype.filter.call(array, callback);\n}\n/**\n * Filter values in a callback given a regular expression\n * @param {Array} array\n * @param {RegExp} regexp\n * @return {Array} Returns the filtered array\n * @private\n */\n\nexport function filterRegExp(array, regexp) {\n if (arraySize(array).length !== 1) {\n throw new Error('Only one dimensional matrices supported');\n }\n\n return Array.prototype.filter.call(array, entry => regexp.test(entry));\n}\n/**\n * A safe join\n * @param {Array} array\n * @param {string} separator\n */\n\nexport function join(array, separator) {\n return Array.prototype.join.call(array, separator);\n}\n/**\n * Assign a numeric identifier to every element of a sorted array\n * @param {Array} a An array\n * @return {Array} An array of objects containing the original value and its identifier\n */\n\nexport function identify(a) {\n if (!Array.isArray(a)) {\n throw new TypeError('Array input expected');\n }\n\n if (a.length === 0) {\n return a;\n }\n\n var b = [];\n var count = 0;\n b[0] = {\n value: a[0],\n identifier: 0\n };\n\n for (var i = 1; i < a.length; i++) {\n if (a[i] === a[i - 1]) {\n count++;\n } else {\n count = 0;\n }\n\n b.push({\n value: a[i],\n identifier: count\n });\n }\n\n return b;\n}\n/**\n * Remove the numeric identifier from the elements\n * @param {array} a An array\n * @return {array} An array of values without identifiers\n */\n\nexport function generalize(a) {\n if (!Array.isArray(a)) {\n throw new TypeError('Array input expected');\n }\n\n if (a.length === 0) {\n return a;\n }\n\n var b = [];\n\n for (var i = 0; i < a.length; i++) {\n b.push(a[i].value);\n }\n\n return b;\n}\n/**\n * Check the datatype of a given object\n * This is a low level implementation that should only be used by\n * parent Matrix classes such as SparseMatrix or DenseMatrix\n * This method does not validate Array Matrix shape\n * @param {Array} array\n * @param {function} typeOf Callback function to use to determine the type of a value\n * @return {string}\n */\n\nexport function getArrayDataType(array, typeOf) {\n var type; // to hold type info\n\n var length = 0; // to hold length value to ensure it has consistent sizes\n\n for (var i = 0; i < array.length; i++) {\n var item = array[i];\n var isArray = Array.isArray(item); // Saving the target matrix row size\n\n if (i === 0 && isArray) {\n length = item.length;\n } // If the current item is an array but the length does not equal the targetVectorSize\n\n\n if (isArray && item.length !== length) {\n return undefined;\n }\n\n var itemType = isArray ? getArrayDataType(item, typeOf) // recurse into a nested array\n : typeOf(item);\n\n if (type === undefined) {\n type = itemType; // first item\n } else if (type !== itemType) {\n return 'mixed';\n } else {// we're good, everything has the same type so far\n }\n }\n\n return type;\n}\n/**\n * Return the last item from an array\n * @param array\n * @returns {*}\n */\n\nexport function last(array) {\n return array[array.length - 1];\n}\n/**\n * Get all but the last element of array.\n */\n\nexport function initial(array) {\n return array.slice(0, array.length - 1);\n}\n/**\n * Test whether an array or string contains an item\n * @param {Array | string} array\n * @param {*} item\n * @return {boolean}\n */\n\nexport function contains(array, item) {\n return array.indexOf(item) !== -1;\n}","/**\n * Create a syntax error with the message:\n * 'Wrong number of arguments in function <fn> (<count> provided, <min>-<max> expected)'\n * @param {string} fn Function name\n * @param {number} count Actual argument count\n * @param {number} min Minimum required argument count\n * @param {number} [max] Maximum required argument count\n * @extends Error\n */\nexport function ArgumentsError(fn, count, min, max) {\n if (!(this instanceof ArgumentsError)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n\n this.fn = fn;\n this.count = count;\n this.min = min;\n this.max = max;\n this.message = 'Wrong number of arguments in function ' + fn + ' (' + count + ' provided, ' + min + (max !== undefined && max !== null ? '-' + max : '') + ' expected)';\n this.stack = new Error().stack;\n}\nArgumentsError.prototype = new Error();\nArgumentsError.prototype.constructor = Error;\nArgumentsError.prototype.name = 'ArgumentsError';\nArgumentsError.prototype.isArgumentsError = true;","import { isBigNumber, isComplex, isFraction, isMatrix, isUnit } from '../../utils/is.js';\nimport { isFactory, stripOptionalNotation } from '../../utils/factory.js';\nimport { hasOwnProperty, lazy } from '../../utils/object.js';\nimport { contains } from '../../utils/array.js';\nimport { ArgumentsError } from '../../error/ArgumentsError.js';\nexport function importFactory(typed, load, math, importedFactories) {\n /**\n * Import functions from an object or a module.\n *\n * This function is only available on a mathjs instance created using `create`.\n *\n * Syntax:\n *\n * math.import(functions)\n * math.import(functions, options)\n *\n * Where:\n *\n * - `functions: Object`\n * An object with functions or factories to be imported.\n * - `options: Object` An object with import options. Available options:\n * - `override: boolean`\n * If true, existing functions will be overwritten. False by default.\n * - `silent: boolean`\n * If true, the function will not throw errors on duplicates or invalid\n * types. False by default.\n * - `wrap: boolean`\n * If true, the functions will be wrapped in a wrapper function\n * which converts data types like Matrix to primitive data types like Array.\n * The wrapper is needed when extending math.js with libraries which do not\n * support these data type. False by default.\n *\n * Examples:\n *\n * import { create, all } from 'mathjs'\n * import * as numbers from 'numbers'\n *\n * // create a mathjs instance\n * const math = create(all)\n *\n * // define new functions and variables\n * math.import({\n * myvalue: 42,\n * hello: function (name) {\n * return 'hello, ' + name + '!'\n * }\n * })\n *\n * // use the imported function and variable\n * math.myvalue * 2 // 84\n * math.hello('user') // 'hello, user!'\n *\n * // import the npm module 'numbers'\n * // (must be installed first with `npm install numbers`)\n * math.import(numbers, {wrap: true})\n *\n * math.fibonacci(7) // returns 13\n *\n * @param {Object | Array} functions Object with functions to be imported.\n * @param {Object} [options] Import options.\n */\n function mathImport(functions, options) {\n var num = arguments.length;\n\n if (num !== 1 && num !== 2) {\n throw new ArgumentsError('import', num, 1, 2);\n }\n\n if (!options) {\n options = {};\n }\n\n function flattenImports(flatValues, value, name) {\n if (Array.isArray(value)) {\n value.forEach(item => flattenImports(flatValues, item));\n } else if (typeof value === 'object') {\n for (var _name in value) {\n if (hasOwnProperty(value, _name)) {\n flattenImports(flatValues, value[_name], _name);\n }\n }\n } else if (isFactory(value) || name !== undefined) {\n var flatName = isFactory(value) ? isTransformFunctionFactory(value) ? value.fn + '.transform' // TODO: this is ugly\n : value.fn : name; // we allow importing the same function twice if it points to the same implementation\n\n if (hasOwnProperty(flatValues, flatName) && flatValues[flatName] !== value && !options.silent) {\n throw new Error('Cannot import \"' + flatName + '\" twice');\n }\n\n flatValues[flatName] = value;\n } else {\n if (!options.silent) {\n throw new TypeError('Factory, Object, or Array expected');\n }\n }\n }\n\n var flatValues = {};\n flattenImports(flatValues, functions);\n\n for (var name in flatValues) {\n if (hasOwnProperty(flatValues, name)) {\n // console.log('import', name)\n var value = flatValues[name];\n\n if (isFactory(value)) {\n // we ignore name here and enforce the name of the factory\n // maybe at some point we do want to allow overriding it\n // in that case we can implement an option overrideFactoryNames: true\n _importFactory(value, options);\n } else if (isSupportedType(value)) {\n _import(name, value, options);\n } else {\n if (!options.silent) {\n throw new TypeError('Factory, Object, or Array expected');\n }\n }\n }\n }\n }\n /**\n * Add a property to the math namespace\n * @param {string} name\n * @param {*} value\n * @param {Object} options See import for a description of the options\n * @private\n */\n\n\n function _import(name, value, options) {\n // TODO: refactor this function, it's to complicated and contains duplicate code\n if (options.wrap && typeof value === 'function') {\n // create a wrapper around the function\n value = _wrap(value);\n } // turn a plain function with a typed-function signature into a typed-function\n\n\n if (hasTypedFunctionSignature(value)) {\n value = typed(name, {\n [value.signature]: value\n });\n }\n\n if (isTypedFunction(math[name]) && isTypedFunction(value)) {\n if (options.override) {\n // give the typed function the right name\n value = typed(name, value.signatures);\n } else {\n // merge the existing and typed function\n value = typed(math[name], value);\n }\n\n math[name] = value;\n delete importedFactories[name];\n\n _importTransform(name, value);\n\n math.emit('import', name, function resolver() {\n return value;\n });\n return;\n }\n\n if (math[name] === undefined || options.override) {\n math[name] = value;\n delete importedFactories[name];\n\n _importTransform(name, value);\n\n math.emit('import', name, function resolver() {\n return value;\n });\n return;\n }\n\n if (!options.silent) {\n throw new Error('Cannot import \"' + name + '\": already exists');\n }\n }\n\n function _importTransform(name, value) {\n if (value && typeof value.transform === 'function') {\n math.expression.transform[name] = value.transform;\n\n if (allowedInExpressions(name)) {\n math.expression.mathWithTransform[name] = value.transform;\n }\n } else {\n // remove existing transform\n delete math.expression.transform[name];\n\n if (allowedInExpressions(name)) {\n math.expression.mathWithTransform[name] = value;\n }\n }\n }\n\n function _deleteTransform(name) {\n delete math.expression.transform[name];\n\n if (allowedInExpressions(name)) {\n math.expression.mathWithTransform[name] = math[name];\n } else {\n delete math.expression.mathWithTransform[name];\n }\n }\n /**\n * Create a wrapper a round an function which converts the arguments\n * to their primitive values (like convert a Matrix to Array)\n * @param {Function} fn\n * @return {Function} Returns the wrapped function\n * @private\n */\n\n\n function _wrap(fn) {\n var wrapper = function wrapper() {\n var args = [];\n\n for (var i = 0, len = arguments.length; i < len; i++) {\n var arg = arguments[i];\n args[i] = arg && arg.valueOf();\n }\n\n return fn.apply(math, args);\n };\n\n if (fn.transform) {\n wrapper.transform = fn.transform;\n }\n\n return wrapper;\n }\n /**\n * Import an instance of a factory into math.js\n * @param {function(scope: object)} factory\n * @param {Object} options See import for a description of the options\n * @param {string} [name=factory.name] Optional custom name\n * @private\n */\n\n\n function _importFactory(factory, options) {\n var name = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : factory.fn;\n\n if (contains(name, '.')) {\n throw new Error('Factory name should not contain a nested path. ' + 'Name: ' + JSON.stringify(name));\n }\n\n var namespace = isTransformFunctionFactory(factory) ? math.expression.transform : math;\n var existingTransform = (name in math.expression.transform);\n var existing = hasOwnProperty(namespace, name) ? namespace[name] : undefined;\n\n var resolver = function resolver() {\n // collect all dependencies, handle finding both functions and classes and other special cases\n var dependencies = {};\n factory.dependencies.map(stripOptionalNotation).forEach(dependency => {\n if (contains(dependency, '.')) {\n throw new Error('Factory dependency should not contain a nested path. ' + 'Name: ' + JSON.stringify(dependency));\n }\n\n if (dependency === 'math') {\n dependencies.math = math;\n } else if (dependency === 'mathWithTransform') {\n dependencies.mathWithTransform = math.expression.mathWithTransform;\n } else if (dependency === 'classes') {\n // special case for json reviver\n dependencies.classes = math;\n } else {\n dependencies[dependency] = math[dependency];\n }\n });\n var instance = /* #__PURE__ */factory(dependencies);\n\n if (instance && typeof instance.transform === 'function') {\n throw new Error('Transforms cannot be attached to factory functions. ' + 'Please create a separate function for it with exports.path=\"expression.transform\"');\n }\n\n if (existing === undefined || options.override) {\n return instance;\n }\n\n if (isTypedFunction(existing) && isTypedFunction(instance)) {\n // merge the existing and new typed function\n return typed(existing, instance);\n }\n\n if (options.silent) {\n // keep existing, ignore imported function\n return existing;\n } else {\n throw new Error('Cannot import \"' + name + '\": already exists');\n }\n }; // TODO: add unit test with non-lazy factory\n\n\n if (!factory.meta || factory.meta.lazy !== false) {\n lazy(namespace, name, resolver); // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)\n\n if (existing && existingTransform) {\n _deleteTransform(name);\n } else {\n if (isTransformFunctionFactory(factory) || factoryAllowedInExpressions(factory)) {\n lazy(math.expression.mathWithTransform, name, () => namespace[name]);\n }\n }\n } else {\n namespace[name] = resolver(); // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)\n\n if (existing && existingTransform) {\n _deleteTransform(name);\n } else {\n if (isTransformFunctionFactory(factory) || factoryAllowedInExpressions(factory)) {\n lazy(math.expression.mathWithTransform, name, () => namespace[name]);\n }\n }\n } // TODO: improve factories, store a list with imports instead which can be re-played\n\n\n importedFactories[name] = factory;\n math.emit('import', name, resolver);\n }\n /**\n * Check whether given object is a type which can be imported\n * @param {Function | number | string | boolean | null | Unit | Complex} object\n * @return {boolean}\n * @private\n */\n\n\n function isSupportedType(object) {\n return typeof object === 'function' || typeof object === 'number' || typeof object === 'string' || typeof object === 'boolean' || object === null || isUnit(object) || isComplex(object) || isBigNumber(object) || isFraction(object) || isMatrix(object) || Array.isArray(object);\n }\n /**\n * Test whether a given thing is a typed-function\n * @param {*} fn\n * @return {boolean} Returns true when `fn` is a typed-function\n */\n\n\n function isTypedFunction(fn) {\n return typeof fn === 'function' && typeof fn.signatures === 'object';\n }\n\n function hasTypedFunctionSignature(fn) {\n return typeof fn === 'function' && typeof fn.signature === 'string';\n }\n\n function allowedInExpressions(name) {\n return !hasOwnProperty(unsafe, name);\n }\n\n function factoryAllowedInExpressions(factory) {\n return factory.fn.indexOf('.') === -1 && // FIXME: make checking on path redundant, check on meta data instead\n !hasOwnProperty(unsafe, factory.fn) && (!factory.meta || !factory.meta.isClass);\n }\n\n function isTransformFunctionFactory(factory) {\n return factory !== undefined && factory.meta !== undefined && factory.meta.isTransformFunction === true || false;\n } // namespaces and functions not available in the parser for safety reasons\n\n\n var unsafe = {\n expression: true,\n type: true,\n docs: true,\n error: true,\n json: true,\n chain: true // chain method not supported. Note that there is a unit chain too.\n\n };\n return mathImport;\n}","export var DEFAULT_CONFIG = {\n // minimum relative difference between two compared values,\n // used by all comparison functions\n epsilon: 1e-12,\n // type of default matrix output. Choose 'matrix' (default) or 'array'\n matrix: 'Matrix',\n // type of default number output. Choose 'number' (default) 'BigNumber', or 'Fraction\n number: 'number',\n // number of significant digits in BigNumbers\n precision: 64,\n // predictable output type of functions. When true, output type depends only\n // on the input types. When false (default), output type can vary depending\n // on input values. For example `math.sqrt(-4)` returns `complex('2i')` when\n // predictable is false, and returns `NaN` when true.\n predictable: false,\n // random seed for seeded pseudo random number generation\n // null = randomly seed\n randomSeed: null\n};","import { clone, mapObject, deepExtend } from '../../utils/object.js';\nimport { DEFAULT_CONFIG } from '../config.js';\nexport var MATRIX_OPTIONS = ['Matrix', 'Array']; // valid values for option matrix\n\nexport var NUMBER_OPTIONS = ['number', 'BigNumber', 'Fraction']; // valid values for option number\n\nexport function configFactory(config, emit) {\n /**\n * Set configuration options for math.js, and get current options.\n * Will emit a 'config' event, with arguments (curr, prev, changes).\n *\n * This function is only available on a mathjs instance created using `create`.\n *\n * Syntax:\n *\n * math.config(config: Object): Object\n *\n * Examples:\n *\n *\n * import { create, all } from 'mathjs'\n *\n * // create a mathjs instance\n * const math = create(all)\n *\n * math.config().number // outputs 'number'\n * math.evaluate('0.4') // outputs number 0.4\n * math.config({number: 'Fraction'})\n * math.evaluate('0.4') // outputs Fraction 2/5\n *\n * @param {Object} [options] Available options:\n * {number} epsilon\n * Minimum relative difference between two\n * compared values, used by all comparison functions.\n * {string} matrix\n * A string 'Matrix' (default) or 'Array'.\n * {string} number\n * A string 'number' (default), 'BigNumber', or 'Fraction'\n * {number} precision\n * The number of significant digits for BigNumbers.\n * Not applicable for Numbers.\n * {string} parenthesis\n * How to display parentheses in LaTeX and string\n * output.\n * {string} randomSeed\n * Random seed for seeded pseudo random number generator.\n * Set to null to randomly seed.\n * @return {Object} Returns the current configuration\n */\n function _config(options) {\n if (options) {\n var prev = mapObject(config, clone); // validate some of the options\n\n validateOption(options, 'matrix', MATRIX_OPTIONS);\n validateOption(options, 'number', NUMBER_OPTIONS); // merge options\n\n deepExtend(config, options);\n var curr = mapObject(config, clone);\n var changes = mapObject(options, clone); // emit 'config' event\n\n emit('config', curr, prev, changes);\n return curr;\n } else {\n return mapObject(config, clone);\n }\n } // attach the valid options to the function so they can be extended\n\n\n _config.MATRIX_OPTIONS = MATRIX_OPTIONS;\n _config.NUMBER_OPTIONS = NUMBER_OPTIONS; // attach the config properties as readonly properties to the config function\n\n Object.keys(DEFAULT_CONFIG).forEach(key => {\n Object.defineProperty(_config, key, {\n get: () => config[key],\n enumerable: true,\n configurable: true\n });\n });\n return _config;\n}\n/**\n * Test whether an Array contains a specific item.\n * @param {Array.<string>} array\n * @param {string} item\n * @return {boolean}\n */\n\nfunction contains(array, item) {\n return array.indexOf(item) !== -1;\n}\n/**\n * Validate an option\n * @param {Object} options Object with options\n * @param {string} name Name of the option to validate\n * @param {Array.<string>} values Array with valid values for this option\n */\n\n\nfunction validateOption(options, name, values) {\n if (options[name] !== undefined && !contains(values, options[name])) {\n // unknown value\n console.warn('Warning: Unknown value \"' + options[name] + '\" for configuration option \"' + name + '\". ' + 'Available options: ' + values.map(value => JSON.stringify(value)).join(', ') + '.');\n }\n}","// Reserved keywords not allowed to use in the parser\nexport var keywords = new Set(['end']);","import { hasOwnProperty } from './object.js';\n/**\n * Get a property of a plain object\n * Throws an error in case the object is not a plain object or the\n * property is not defined on the object itself\n * @param {Object} object\n * @param {string} prop\n * @return {*} Returns the property value when safe\n */\n\nfunction getSafeProperty(object, prop) {\n // only allow getting safe properties of a plain object\n if (isPlainObject(object) && isSafeProperty(object, prop)) {\n return object[prop];\n }\n\n if (typeof object[prop] === 'function' && isSafeMethod(object, prop)) {\n throw new Error('Cannot access method \"' + prop + '\" as a property');\n }\n\n throw new Error('No access to property \"' + prop + '\"');\n}\n/**\n * Set a property on a plain object.\n * Throws an error in case the object is not a plain object or the\n * property would override an inherited property like .constructor or .toString\n * @param {Object} object\n * @param {string} prop\n * @param {*} value\n * @return {*} Returns the value\n */\n// TODO: merge this function into access.js?\n\n\nfunction setSafeProperty(object, prop, value) {\n // only allow setting safe properties of a plain object\n if (isPlainObject(object) && isSafeProperty(object, prop)) {\n object[prop] = value;\n return value;\n }\n\n throw new Error('No access to property \"' + prop + '\"');\n}\n\nfunction getSafeProperties(object) {\n return Object.keys(object).filter(prop => hasOwnProperty(object, prop));\n}\n\nfunction hasSafeProperty(object, prop) {\n return prop in object;\n}\n/**\n * Test whether a property is safe to use for an object.\n * For example .toString and .constructor are not safe\n * @param {string} prop\n * @return {boolean} Returns true when safe\n */\n\n\nfunction isSafeProperty(object, prop) {\n if (!object || typeof object !== 'object') {\n return false;\n } // SAFE: whitelisted\n // e.g length\n\n\n if (hasOwnProperty(safeNativeProperties, prop)) {\n return true;\n } // UNSAFE: inherited from Object prototype\n // e.g constructor\n\n\n if (prop in Object.prototype) {\n // 'in' is used instead of hasOwnProperty for nodejs v0.10\n // which is inconsistent on root prototypes. It is safe\n // here because Object.prototype is a root object\n return false;\n } // UNSAFE: inherited from Function prototype\n // e.g call, apply\n\n\n if (prop in Function.prototype) {\n // 'in' is used instead of hasOwnProperty for nodejs v0.10\n // which is inconsistent on root prototypes. It is safe\n // here because Function.prototype is a root object\n return false;\n }\n\n return true;\n}\n/**\n * Validate whether a method is safe.\n * Throws an error when that's not the case.\n * @param {Object} object\n * @param {string} method\n */\n// TODO: merge this function into assign.js?\n\n\nfunction validateSafeMethod(object, method) {\n if (!isSafeMethod(object, method)) {\n throw new Error('No access to method \"' + method + '\"');\n }\n}\n/**\n * Check whether a method is safe.\n * Throws an error when that's not the case (for example for `constructor`).\n * @param {Object} object\n * @param {string} method\n * @return {boolean} Returns true when safe, false otherwise\n */\n\n\nfunction isSafeMethod(object, method) {\n if (object === null || object === undefined || typeof object[method] !== 'function') {\n return false;\n } // UNSAFE: ghosted\n // e.g overridden toString\n // Note that IE10 doesn't support __proto__ and we can't do this check there.\n\n\n if (hasOwnProperty(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {\n return false;\n } // SAFE: whitelisted\n // e.g toString\n\n\n if (hasOwnProperty(safeNativeMethods, method)) {\n return true;\n } // UNSAFE: inherited from Object prototype\n // e.g constructor\n\n\n if (method in Object.prototype) {\n // 'in' is used instead of hasOwnProperty for nodejs v0.10\n // which is inconsistent on root prototypes. It is safe\n // here because Object.prototype is a root object\n return false;\n } // UNSAFE: inherited from Function prototype\n // e.g call, apply\n\n\n if (method in Function.prototype) {\n // 'in' is used instead of hasOwnProperty for nodejs v0.10\n // which is inconsistent on root prototypes. It is safe\n // here because Function.prototype is a root object\n return false;\n }\n\n return true;\n}\n\nfunction isPlainObject(object) {\n return typeof object === 'object' && object && object.constructor === Object;\n}\n\nvar safeNativeProperties = {\n length: true,\n name: true\n};\nvar safeNativeMethods = {\n toString: true,\n valueOf: true,\n toLocaleString: true\n};\nexport { getSafeProperty };\nexport { setSafeProperty };\nexport { isSafeProperty };\nexport { hasSafeProperty };\nexport { getSafeProperties };\nexport { validateSafeMethod };\nexport { isSafeMethod };\nexport { isPlainObject };","import { setSafeProperty, hasSafeProperty, getSafeProperty } from './customs.js';\nimport { isObject } from './is.js';\n/**\n * A map facade on a bare object.\n *\n * The small number of methods needed to implement a scope,\n * forwarding on to the SafeProperty functions. Over time, the codebase\n * will stop using this method, as all objects will be Maps, rather than\n * more security prone objects.\n */\n\nexport class ObjectWrappingMap {\n constructor(object) {\n this.wrappedObject = object;\n }\n\n keys() {\n return Object.keys(this.wrappedObject);\n }\n\n get(key) {\n return getSafeProperty(this.wrappedObject, key);\n }\n\n set(key, value) {\n setSafeProperty(this.wrappedObject, key, value);\n return this;\n }\n\n has(key) {\n return hasSafeProperty(this.wrappedObject, key);\n }\n\n}\n/**\n * Creates an empty map, or whatever your platform's polyfill is.\n *\n * @returns an empty Map or Map like object.\n */\n\nexport function createEmptyMap() {\n return new Map();\n}\n/**\n * Creates a Map from the given object.\n *\n * @param { Map | { [key: string]: unknown } | undefined } mapOrObject\n * @returns\n */\n\nexport function createMap(mapOrObject) {\n if (!mapOrObject) {\n return createEmptyMap();\n }\n\n if (isMap(mapOrObject)) {\n return mapOrObject;\n }\n\n if (isObject(mapOrObject)) {\n return new ObjectWrappingMap(mapOrObject);\n }\n\n throw new Error('createMap can create maps from objects or Maps');\n}\n/**\n * Unwraps a map into an object.\n *\n * @param {Map} map\n * @returns { [key: string]: unknown }\n */\n\nexport function toObject(map) {\n if (map instanceof ObjectWrappingMap) {\n return map.wrappedObject;\n }\n\n var object = {};\n\n for (var key of map.keys()) {\n var value = map.get(key);\n setSafeProperty(object, key, value);\n }\n\n return object;\n}\n/**\n * Returns `true` if the passed object appears to be a Map (i.e. duck typing).\n *\n * Methods looked for are `get`, `set`, `keys` and `has`.\n *\n * @param {Map | object} object\n * @returns\n */\n\nexport function isMap(object) {\n // We can use the fast instanceof, or a slower duck typing check.\n // The duck typing method needs to cover enough methods to not be confused with DenseMatrix.\n if (!object) {\n return false;\n }\n\n return object instanceof Map || object instanceof ObjectWrappingMap || typeof object.set === 'function' && typeof object.get === 'function' && typeof object.keys === 'function' && typeof object.has === 'function';\n}\n/**\n * Copies the contents of key-value pairs from each `objects` in to `map`.\n *\n * Object is `objects` can be a `Map` or object.\n *\n * This is the `Map` analog to `Object.assign`.\n */\n\nexport function assign(map) {\n for (var _len = arguments.length, objects = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n objects[_key - 1] = arguments[_key];\n }\n\n for (var args of objects) {\n if (!args) {\n continue;\n }\n\n if (isMap(args)) {\n for (var key of args.keys()) {\n map.set(key, args.get(key));\n }\n } else if (isObject(args)) {\n for (var _key2 of Object.keys(args)) {\n map.set(_key2, args[_key2]);\n }\n }\n }\n\n return map;\n}","import { isNode } from '../../utils/is.js';\nimport { keywords } from '../keywords.js';\nimport { deepStrictEqual } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMap } from '../../utils/map.js';\nvar name = 'Node';\nvar dependencies = ['mathWithTransform'];\nexport var createNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n mathWithTransform\n } = _ref;\n\n /**\n * Node\n */\n function Node() {\n if (!(this instanceof Node)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n }\n /**\n * Evaluate the node\n * @param {Object} [scope] Scope to read/write variables\n * @return {*} Returns the result\n */\n\n\n Node.prototype.evaluate = function (scope) {\n return this.compile().evaluate(scope);\n };\n\n Node.prototype.type = 'Node';\n Node.prototype.isNode = true;\n Node.prototype.comment = '';\n /**\n * Compile the node into an optimized, evauatable JavaScript function\n * @return {{evaluate: function([Object])}} object\n * Returns an object with a function 'evaluate',\n * which can be invoked as expr.evaluate([scope: Object]),\n * where scope is an optional object with\n * variables.\n */\n\n Node.prototype.compile = function () {\n var expr = this._compile(mathWithTransform, {});\n\n var args = {};\n var context = null;\n\n function evaluate(scope) {\n var s = createMap(scope);\n\n _validateScope(s);\n\n return expr(s, args, context);\n }\n\n return {\n evaluate\n };\n };\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n\n\n Node.prototype._compile = function (math, argNames) {\n throw new Error('Method _compile should be implemented by type ' + this.type);\n };\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n\n\n Node.prototype.forEach = function (callback) {\n // must be implemented by each of the Node implementations\n throw new Error('Cannot run forEach on a Node interface');\n };\n /**\n * Create a new Node having it's childs be the results of calling\n * the provided callback function for each of the childs of the original node.\n * @param {function(child: Node, path: string, parent: Node): Node} callback\n * @returns {OperatorNode} Returns a transformed copy of the node\n */\n\n\n Node.prototype.map = function (callback) {\n // must be implemented by each of the Node implementations\n throw new Error('Cannot run map on a Node interface');\n };\n /**\n * Validate whether an object is a Node, for use with map\n * @param {Node} node\n * @returns {Node} Returns the input if it's a node, else throws an Error\n * @protected\n */\n\n\n Node.prototype._ifNode = function (node) {\n if (!isNode(node)) {\n throw new TypeError('Callback function must return a Node');\n }\n\n return node;\n };\n /**\n * Recursively traverse all nodes in a node tree. Executes given callback for\n * this node and each of its child nodes.\n * @param {function(node: Node, path: string, parent: Node)} callback\n * A callback called for every node in the node tree.\n */\n\n\n Node.prototype.traverse = function (callback) {\n // execute callback for itself\n // eslint-disable-next-line\n callback(this, null, null); // recursively traverse over all childs of a node\n\n function _traverse(node, callback) {\n node.forEach(function (child, path, parent) {\n callback(child, path, parent);\n\n _traverse(child, callback);\n });\n }\n\n _traverse(this, callback);\n };\n /**\n * Recursively transform a node tree via a transform function.\n *\n * For example, to replace all nodes of type SymbolNode having name 'x' with a\n * ConstantNode with value 2:\n *\n * const res = Node.transform(function (node, path, parent) {\n * if (node && node.isSymbolNode) && (node.name === 'x')) {\n * return new ConstantNode(2)\n * }\n * else {\n * return node\n * }\n * })\n *\n * @param {function(node: Node, path: string, parent: Node) : Node} callback\n * A mapping function accepting a node, and returning\n * a replacement for the node or the original node.\n * Signature: callback(node: Node, index: string, parent: Node) : Node\n * @return {Node} Returns the original node or its replacement\n */\n\n\n Node.prototype.transform = function (callback) {\n function _transform(child, path, parent) {\n var replacement = callback(child, path, parent);\n\n if (replacement !== child) {\n // stop iterating when the node is replaced\n return replacement;\n }\n\n return child.map(_transform);\n }\n\n return _transform(this, null, null);\n };\n /**\n * Find any node in the node tree matching given filter function. For example, to\n * find all nodes of type SymbolNode having name 'x':\n *\n * const results = Node.filter(function (node) {\n * return (node && node.isSymbolNode) && (node.name === 'x')\n * })\n *\n * @param {function(node: Node, path: string, parent: Node) : Node} callback\n * A test function returning true when a node matches, and false\n * otherwise. Function signature:\n * callback(node: Node, index: string, parent: Node) : boolean\n * @return {Node[]} nodes An array with nodes matching given filter criteria\n */\n\n\n Node.prototype.filter = function (callback) {\n var nodes = [];\n this.traverse(function (node, path, parent) {\n if (callback(node, path, parent)) {\n nodes.push(node);\n }\n });\n return nodes;\n };\n /**\n * Create a shallow clone of this node\n * @return {Node}\n */\n\n\n Node.prototype.clone = function () {\n // must be implemented by each of the Node implementations\n throw new Error('Cannot clone a Node interface');\n };\n /**\n * Create a deep clone of this node\n * @return {Node}\n */\n\n\n Node.prototype.cloneDeep = function () {\n return this.map(function (node) {\n return node.cloneDeep();\n });\n };\n /**\n * Deep compare this node with another node.\n * @param {Node} other\n * @return {boolean} Returns true when both nodes are of the same type and\n * contain the same values (as do their childs)\n */\n\n\n Node.prototype.equals = function (other) {\n return other ? deepStrictEqual(this, other) : false;\n };\n /**\n * Get string representation. (wrapper function)\n *\n * This function can get an object of the following form:\n * {\n * handler: //This can be a callback function of the form\n * // \"function callback(node, options)\"or\n * // a map that maps function names (used in FunctionNodes)\n * // to callbacks\n * parenthesis: \"keep\" //the parenthesis option (This is optional)\n * }\n *\n * @param {Object} [options]\n * @return {string}\n */\n\n\n Node.prototype.toString = function (options) {\n var customString = this._getCustomString(options);\n\n if (typeof customString !== 'undefined') {\n return customString;\n }\n\n return this._toString(options);\n };\n /**\n * Get a JSON representation of the node\n * Both .toJSON() and the static .fromJSON(json) should be implemented by all\n * implementations of Node\n * @returns {Object}\n */\n\n\n Node.prototype.toJSON = function () {\n throw new Error('Cannot serialize object: toJSON not implemented by ' + this.type);\n };\n /**\n * Get HTML representation. (wrapper function)\n *\n * This function can get an object of the following form:\n * {\n * handler: //This can be a callback function of the form\n * // \"function callback(node, options)\" or\n * // a map that maps function names (used in FunctionNodes)\n * // to callbacks\n * parenthesis: \"keep\" //the parenthesis option (This is optional)\n * }\n *\n * @param {Object} [options]\n * @return {string}\n */\n\n\n Node.prototype.toHTML = function (options) {\n var customString = this._getCustomString(options);\n\n if (typeof customString !== 'undefined') {\n return customString;\n }\n\n return this.toHTML(options);\n };\n /**\n * Internal function to generate the string output.\n * This has to be implemented by every Node\n *\n * @throws {Error}\n */\n\n\n Node.prototype._toString = function () {\n // must be implemented by each of the Node implementations\n throw new Error('_toString not implemented for ' + this.type);\n };\n /**\n * Get LaTeX representation. (wrapper function)\n *\n * This function can get an object of the following form:\n * {\n * handler: //This can be a callback function of the form\n * // \"function callback(node, options)\"or\n * // a map that maps function names (used in FunctionNodes)\n * // to callbacks\n * parenthesis: \"keep\" //the parenthesis option (This is optional)\n * }\n *\n * @param {Object} [options]\n * @return {string}\n */\n\n\n Node.prototype.toTex = function (options) {\n var customString = this._getCustomString(options);\n\n if (typeof customString !== 'undefined') {\n return customString;\n }\n\n return this._toTex(options);\n };\n /**\n * Internal function to generate the LaTeX output.\n * This has to be implemented by every Node\n *\n * @param {Object} [options]\n * @throws {Error}\n */\n\n\n Node.prototype._toTex = function (options) {\n // must be implemented by each of the Node implementations\n throw new Error('_toTex not implemented for ' + this.type);\n };\n /**\n * Helper used by `to...` functions.\n */\n\n\n Node.prototype._getCustomString = function (options) {\n if (options && typeof options === 'object') {\n switch (typeof options.handler) {\n case 'object':\n case 'undefined':\n return;\n\n case 'function':\n return options.handler(this, options);\n\n default:\n throw new TypeError('Object or function expected as callback');\n }\n }\n };\n /**\n * Get identifier.\n * @return {string}\n */\n\n\n Node.prototype.getIdentifier = function () {\n return this.type;\n };\n /**\n * Get the content of the current Node.\n * @return {Node} node\n **/\n\n\n Node.prototype.getContent = function () {\n return this;\n };\n /**\n * Validate the symbol names of a scope.\n * Throws an error when the scope contains an illegal symbol.\n * @param {Object} scope\n */\n\n\n function _validateScope(scope) {\n for (var symbol of [...keywords]) {\n if (scope.has(symbol)) {\n throw new Error('Scope contains an illegal symbol, \"' + symbol + '\" is a reserved keyword');\n }\n }\n }\n\n return Node;\n}, {\n isClass: true,\n isNode: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createNode } from '../../factoriesAny.js';\nexport var NodeDependencies = {\n createNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createMatrixClass } from '../../factoriesAny.js';\nexport var MatrixDependencies = {\n createMatrixClass\n};","import { factory } from '../../utils/factory.js';\nvar name = 'Matrix';\nvar dependencies = [];\nexport var createMatrixClass = /* #__PURE__ */factory(name, dependencies, () => {\n /**\n * @constructor Matrix\n *\n * A Matrix is a wrapper around an Array. A matrix can hold a multi dimensional\n * array. A matrix can be constructed as:\n *\n * let matrix = math.matrix(data)\n *\n * Matrix contains the functions to resize, get and set values, get the size,\n * clone the matrix and to convert the matrix to a vector, array, or scalar.\n * Furthermore, one can iterate over the matrix using map and forEach.\n * The internal Array of the Matrix can be accessed using the function valueOf.\n *\n * Example usage:\n *\n * let matrix = math.matrix([[1, 2], [3, 4]])\n * matix.size() // [2, 2]\n * matrix.resize([3, 2], 5)\n * matrix.valueOf() // [[1, 2], [3, 4], [5, 5]]\n * matrix.subset([1,2]) // 3 (indexes are zero-based)\n *\n */\n function Matrix() {\n if (!(this instanceof Matrix)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n }\n /**\n * Attach type information\n */\n\n\n Matrix.prototype.type = 'Matrix';\n Matrix.prototype.isMatrix = true;\n /**\n * Get the storage format used by the matrix.\n *\n * Usage:\n * const format = matrix.storage() // retrieve storage format\n *\n * @return {string} The storage format.\n */\n\n Matrix.prototype.storage = function () {\n // must be implemented by each of the Matrix implementations\n throw new Error('Cannot invoke storage on a Matrix interface');\n };\n /**\n * Get the datatype of the data stored in the matrix.\n *\n * Usage:\n * const format = matrix.datatype() // retrieve matrix datatype\n *\n * @return {string} The datatype.\n */\n\n\n Matrix.prototype.datatype = function () {\n // must be implemented by each of the Matrix implementations\n throw new Error('Cannot invoke datatype on a Matrix interface');\n };\n /**\n * Create a new Matrix With the type of the current matrix instance\n * @param {Array | Object} data\n * @param {string} [datatype]\n */\n\n\n Matrix.prototype.create = function (data, datatype) {\n throw new Error('Cannot invoke create on a Matrix interface');\n };\n /**\n * Get a subset of the matrix, or replace a subset of the matrix.\n *\n * Usage:\n * const subset = matrix.subset(index) // retrieve subset\n * const value = matrix.subset(index, replacement) // replace subset\n *\n * @param {Index} index\n * @param {Array | Matrix | *} [replacement]\n * @param {*} [defaultValue=0] Default value, filled in on new entries when\n * the matrix is resized. If not provided,\n * new matrix elements will be filled with zeros.\n */\n\n\n Matrix.prototype.subset = function (index, replacement, defaultValue) {\n // must be implemented by each of the Matrix implementations\n throw new Error('Cannot invoke subset on a Matrix interface');\n };\n /**\n * Get a single element from the matrix.\n * @param {number[]} index Zero-based index\n * @return {*} value\n */\n\n\n Matrix.prototype.get = function (index) {\n // must be implemented by each of the Matrix implementations\n throw new Error('Cannot invoke get on a Matrix interface');\n };\n /**\n * Replace a single element in the matrix.\n * @param {number[]} index Zero-based index\n * @param {*} value\n * @param {*} [defaultValue] Default value, filled in on new entries when\n * the matrix is resized. If not provided,\n * new matrix elements will be left undefined.\n * @return {Matrix} self\n */\n\n\n Matrix.prototype.set = function (index, value, defaultValue) {\n // must be implemented by each of the Matrix implementations\n throw new Error('Cannot invoke set on a Matrix interface');\n };\n /**\n * Resize the matrix to the given size. Returns a copy of the matrix when\n * `copy=true`, otherwise return the matrix itself (resize in place).\n *\n * @param {number[]} size The new size the matrix should have.\n * @param {*} [defaultValue=0] Default value, filled in on new entries.\n * If not provided, the matrix elements will\n * be filled with zeros.\n * @param {boolean} [copy] Return a resized copy of the matrix\n *\n * @return {Matrix} The resized matrix\n */\n\n\n Matrix.prototype.resize = function (size, defaultValue) {\n // must be implemented by each of the Matrix implementations\n throw new Error('Cannot invoke resize on a Matrix interface');\n };\n /**\n * Reshape the matrix to the given size. Returns a copy of the matrix when\n * `copy=true`, otherwise return the matrix itself (reshape in place).\n *\n * @param {number[]} size The new size the matrix should have.\n * @param {boolean} [copy] Return a reshaped copy of the matrix\n *\n * @return {Matrix} The reshaped matrix\n */\n\n\n Matrix.prototype.reshape = function (size, defaultValue) {\n // must be implemented by each of the Matrix implementations\n throw new Error('Cannot invoke reshape on a Matrix interface');\n };\n /**\n * Create a clone of the matrix\n * @return {Matrix} clone\n */\n\n\n Matrix.prototype.clone = function () {\n // must be implemented by each of the Matrix implementations\n throw new Error('Cannot invoke clone on a Matrix interface');\n };\n /**\n * Retrieve the size of the matrix.\n * @returns {number[]} size\n */\n\n\n Matrix.prototype.size = function () {\n // must be implemented by each of the Matrix implementations\n throw new Error('Cannot invoke size on a Matrix interface');\n };\n /**\n * Create a new matrix with the results of the callback function executed on\n * each entry of the matrix.\n * @param {Function} callback The callback function is invoked with three\n * parameters: the value of the element, the index\n * of the element, and the Matrix being traversed.\n * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n *\n * @return {Matrix} matrix\n */\n\n\n Matrix.prototype.map = function (callback, skipZeros) {\n // must be implemented by each of the Matrix implementations\n throw new Error('Cannot invoke map on a Matrix interface');\n };\n /**\n * Execute a callback function on each entry of the matrix.\n * @param {Function} callback The callback function is invoked with three\n * parameters: the value of the element, the index\n * of the element, and the Matrix being traversed.\n */\n\n\n Matrix.prototype.forEach = function (callback) {\n // must be implemented by each of the Matrix implementations\n throw new Error('Cannot invoke forEach on a Matrix interface');\n };\n /**\n * Iterate over the matrix elements\n * @return {Iterable<{ value, index: number[] }>}\n */\n\n\n Matrix.prototype[Symbol.iterator] = function () {\n // must be implemented by each of the Matrix implementations\n throw new Error('Cannot iterate a Matrix interface');\n };\n /**\n * Create an Array with a copy of the data of the Matrix\n * @returns {Array} array\n */\n\n\n Matrix.prototype.toArray = function () {\n // must be implemented by each of the Matrix implementations\n throw new Error('Cannot invoke toArray on a Matrix interface');\n };\n /**\n * Get the primitive value of the Matrix: a multidimensional array\n * @returns {Array} array\n */\n\n\n Matrix.prototype.valueOf = function () {\n // must be implemented by each of the Matrix implementations\n throw new Error('Cannot invoke valueOf on a Matrix interface');\n };\n /**\n * Get a string representation of the matrix, with optional formatting options.\n * @param {Object | number | Function} [options] Formatting options. See\n * lib/utils/number:format for a\n * description of the available\n * options.\n * @returns {string} str\n */\n\n\n Matrix.prototype.format = function (options) {\n // must be implemented by each of the Matrix implementations\n throw new Error('Cannot invoke format on a Matrix interface');\n };\n /**\n * Get a string representation of the matrix\n * @returns {string} str\n */\n\n\n Matrix.prototype.toString = function () {\n // must be implemented by each of the Matrix implementations\n throw new Error('Cannot invoke toString on a Matrix interface');\n };\n\n return Matrix;\n}, {\n isClass: true\n});","import { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';\nimport { arraySize, getArrayDataType, processSizesWildcard, reshape, resize, unsqueeze, validate, validateIndex } from '../../utils/array.js';\nimport { format } from '../../utils/string.js';\nimport { isInteger } from '../../utils/number.js';\nimport { clone, deepStrictEqual } from '../../utils/object.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'DenseMatrix';\nvar dependencies = ['Matrix'];\nexport var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n Matrix\n } = _ref;\n\n /**\n * Dense Matrix implementation. A regular, dense matrix, supporting multi-dimensional matrices. This is the default matrix type.\n * @class DenseMatrix\n * @enum {{ value, index: number[] }}\n */\n function DenseMatrix(data, datatype) {\n if (!(this instanceof DenseMatrix)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n\n if (datatype && !isString(datatype)) {\n throw new Error('Invalid datatype: ' + datatype);\n }\n\n if (isMatrix(data)) {\n // check data is a DenseMatrix\n if (data.type === 'DenseMatrix') {\n // clone data & size\n this._data = clone(data._data);\n this._size = clone(data._size);\n this._datatype = datatype || data._datatype;\n } else {\n // build data from existing matrix\n this._data = data.toArray();\n this._size = data.size();\n this._datatype = datatype || data._datatype;\n }\n } else if (data && isArray(data.data) && isArray(data.size)) {\n // initialize fields from JSON representation\n this._data = data.data;\n this._size = data.size; // verify the dimensions of the array\n\n validate(this._data, this._size);\n this._datatype = datatype || data.datatype;\n } else if (isArray(data)) {\n // replace nested Matrices with Arrays\n this._data = preprocess(data); // get the dimensions of the array\n\n this._size = arraySize(this._data); // verify the dimensions of the array, TODO: compute size while processing array\n\n validate(this._data, this._size); // data type unknown\n\n this._datatype = datatype;\n } else if (data) {\n // unsupported type\n throw new TypeError('Unsupported type of data (' + typeOf(data) + ')');\n } else {\n // nothing provided\n this._data = [];\n this._size = [0];\n this._datatype = datatype;\n }\n }\n\n DenseMatrix.prototype = new Matrix();\n /**\n * Create a new DenseMatrix\n */\n\n DenseMatrix.prototype.createDenseMatrix = function (data, datatype) {\n return new DenseMatrix(data, datatype);\n };\n /**\n * Attach type information\n */\n\n\n DenseMatrix.prototype.type = 'DenseMatrix';\n DenseMatrix.prototype.isDenseMatrix = true;\n /**\n * Get the matrix type\n *\n * Usage:\n * const matrixType = matrix.getDataType() // retrieves the matrix type\n *\n * @memberOf DenseMatrix\n * @return {string} type information; if multiple types are found from the Matrix, it will return \"mixed\"\n */\n\n DenseMatrix.prototype.getDataType = function () {\n return getArrayDataType(this._data, typeOf);\n };\n /**\n * Get the storage format used by the matrix.\n *\n * Usage:\n * const format = matrix.storage() // retrieve storage format\n *\n * @memberof DenseMatrix\n * @return {string} The storage format.\n */\n\n\n DenseMatrix.prototype.storage = function () {\n return 'dense';\n };\n /**\n * Get the datatype of the data stored in the matrix.\n *\n * Usage:\n * const format = matrix.datatype() // retrieve matrix datatype\n *\n * @memberof DenseMatrix\n * @return {string} The datatype.\n */\n\n\n DenseMatrix.prototype.datatype = function () {\n return this._datatype;\n };\n /**\n * Create a new DenseMatrix\n * @memberof DenseMatrix\n * @param {Array} data\n * @param {string} [datatype]\n */\n\n\n DenseMatrix.prototype.create = function (data, datatype) {\n return new DenseMatrix(data, datatype);\n };\n /**\n * Get a subset of the matrix, or replace a subset of the matrix.\n *\n * Usage:\n * const subset = matrix.subset(index) // retrieve subset\n * const value = matrix.subset(index, replacement) // replace subset\n *\n * @memberof DenseMatrix\n * @param {Index} index\n * @param {Array | Matrix | *} [replacement]\n * @param {*} [defaultValue=0] Default value, filled in on new entries when\n * the matrix is resized. If not provided,\n * new matrix elements will be filled with zeros.\n */\n\n\n DenseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n switch (arguments.length) {\n case 1:\n return _get(this, index);\n // intentional fall through\n\n case 2:\n case 3:\n return _set(this, index, replacement, defaultValue);\n\n default:\n throw new SyntaxError('Wrong number of arguments');\n }\n };\n /**\n * Get a single element from the matrix.\n * @memberof DenseMatrix\n * @param {number[]} index Zero-based index\n * @return {*} value\n */\n\n\n DenseMatrix.prototype.get = function (index) {\n if (!isArray(index)) {\n throw new TypeError('Array expected');\n }\n\n if (index.length !== this._size.length) {\n throw new DimensionError(index.length, this._size.length);\n } // check index\n\n\n for (var x = 0; x < index.length; x++) {\n validateIndex(index[x], this._size[x]);\n }\n\n var data = this._data;\n\n for (var i = 0, ii = index.length; i < ii; i++) {\n var indexI = index[i];\n validateIndex(indexI, data.length);\n data = data[indexI];\n }\n\n return data;\n };\n /**\n * Replace a single element in the matrix.\n * @memberof DenseMatrix\n * @param {number[]} index Zero-based index\n * @param {*} value\n * @param {*} [defaultValue] Default value, filled in on new entries when\n * the matrix is resized. If not provided,\n * new matrix elements will be left undefined.\n * @return {DenseMatrix} self\n */\n\n\n DenseMatrix.prototype.set = function (index, value, defaultValue) {\n if (!isArray(index)) {\n throw new TypeError('Array expected');\n }\n\n if (index.length < this._size.length) {\n throw new DimensionError(index.length, this._size.length, '<');\n }\n\n var i, ii, indexI; // enlarge matrix when needed\n\n var size = index.map(function (i) {\n return i + 1;\n });\n\n _fit(this, size, defaultValue); // traverse over the dimensions\n\n\n var data = this._data;\n\n for (i = 0, ii = index.length - 1; i < ii; i++) {\n indexI = index[i];\n validateIndex(indexI, data.length);\n data = data[indexI];\n } // set new value\n\n\n indexI = index[index.length - 1];\n validateIndex(indexI, data.length);\n data[indexI] = value;\n return this;\n };\n /**\n * Get a submatrix of this matrix\n * @memberof DenseMatrix\n * @param {DenseMatrix} matrix\n * @param {Index} index Zero-based index\n * @private\n */\n\n\n function _get(matrix, index) {\n if (!isIndex(index)) {\n throw new TypeError('Invalid index');\n }\n\n var isScalar = index.isScalar();\n\n if (isScalar) {\n // return a scalar\n return matrix.get(index.min());\n } else {\n // validate dimensions\n var size = index.size();\n\n if (size.length !== matrix._size.length) {\n throw new DimensionError(size.length, matrix._size.length);\n } // validate if any of the ranges in the index is out of range\n\n\n var min = index.min();\n var max = index.max();\n\n for (var i = 0, ii = matrix._size.length; i < ii; i++) {\n validateIndex(min[i], matrix._size[i]);\n validateIndex(max[i], matrix._size[i]);\n } // retrieve submatrix\n // TODO: more efficient when creating an empty matrix and setting _data and _size manually\n\n\n return new DenseMatrix(_getSubmatrix(matrix._data, index, size.length, 0), matrix._datatype);\n }\n }\n /**\n * Recursively get a submatrix of a multi dimensional matrix.\n * Index is not checked for correct number or length of dimensions.\n * @memberof DenseMatrix\n * @param {Array} data\n * @param {Index} index\n * @param {number} dims Total number of dimensions\n * @param {number} dim Current dimension\n * @return {Array} submatrix\n * @private\n */\n\n\n function _getSubmatrix(data, index, dims, dim) {\n var last = dim === dims - 1;\n var range = index.dimension(dim);\n\n if (last) {\n return range.map(function (i) {\n validateIndex(i, data.length);\n return data[i];\n }).valueOf();\n } else {\n return range.map(function (i) {\n validateIndex(i, data.length);\n var child = data[i];\n return _getSubmatrix(child, index, dims, dim + 1);\n }).valueOf();\n }\n }\n /**\n * Replace a submatrix in this matrix\n * Indexes are zero-based.\n * @memberof DenseMatrix\n * @param {DenseMatrix} matrix\n * @param {Index} index\n * @param {DenseMatrix | Array | *} submatrix\n * @param {*} defaultValue Default value, filled in on new entries when\n * the matrix is resized.\n * @return {DenseMatrix} matrix\n * @private\n */\n\n\n function _set(matrix, index, submatrix, defaultValue) {\n if (!index || index.isIndex !== true) {\n throw new TypeError('Invalid index');\n } // get index size and check whether the index contains a single value\n\n\n var iSize = index.size();\n var isScalar = index.isScalar(); // calculate the size of the submatrix, and convert it into an Array if needed\n\n var sSize;\n\n if (isMatrix(submatrix)) {\n sSize = submatrix.size();\n submatrix = submatrix.valueOf();\n } else {\n sSize = arraySize(submatrix);\n }\n\n if (isScalar) {\n // set a scalar\n // check whether submatrix is a scalar\n if (sSize.length !== 0) {\n throw new TypeError('Scalar expected');\n }\n\n matrix.set(index.min(), submatrix, defaultValue);\n } else {\n // set a submatrix\n // validate dimensions\n if (iSize.length < matrix._size.length) {\n throw new DimensionError(iSize.length, matrix._size.length, '<');\n }\n\n if (sSize.length < iSize.length) {\n // calculate number of missing outer dimensions\n var i = 0;\n var outer = 0;\n\n while (iSize[i] === 1 && sSize[i] === 1) {\n i++;\n }\n\n while (iSize[i] === 1) {\n outer++;\n i++;\n } // unsqueeze both outer and inner dimensions\n\n\n submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);\n } // check whether the size of the submatrix matches the index size\n\n\n if (!deepStrictEqual(iSize, sSize)) {\n throw new DimensionError(iSize, sSize, '>');\n } // enlarge matrix when needed\n\n\n var size = index.max().map(function (i) {\n return i + 1;\n });\n\n _fit(matrix, size, defaultValue); // insert the sub matrix\n\n\n var dims = iSize.length;\n var dim = 0;\n\n _setSubmatrix(matrix._data, index, submatrix, dims, dim);\n }\n\n return matrix;\n }\n /**\n * Replace a submatrix of a multi dimensional matrix.\n * @memberof DenseMatrix\n * @param {Array} data\n * @param {Index} index\n * @param {Array} submatrix\n * @param {number} dims Total number of dimensions\n * @param {number} dim\n * @private\n */\n\n\n function _setSubmatrix(data, index, submatrix, dims, dim) {\n var last = dim === dims - 1;\n var range = index.dimension(dim);\n\n if (last) {\n range.forEach(function (dataIndex, subIndex) {\n validateIndex(dataIndex);\n data[dataIndex] = submatrix[subIndex[0]];\n });\n } else {\n range.forEach(function (dataIndex, subIndex) {\n validateIndex(dataIndex);\n\n _setSubmatrix(data[dataIndex], index, submatrix[subIndex[0]], dims, dim + 1);\n });\n }\n }\n /**\n * Resize the matrix to the given size. Returns a copy of the matrix when\n * `copy=true`, otherwise return the matrix itself (resize in place).\n *\n * @memberof DenseMatrix\n * @param {number[] || Matrix} size The new size the matrix should have.\n * @param {*} [defaultValue=0] Default value, filled in on new entries.\n * If not provided, the matrix elements will\n * be filled with zeros.\n * @param {boolean} [copy] Return a resized copy of the matrix\n *\n * @return {Matrix} The resized matrix\n */\n\n\n DenseMatrix.prototype.resize = function (size, defaultValue, copy) {\n // validate arguments\n if (!isCollection(size)) {\n throw new TypeError('Array or Matrix expected');\n } // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n\n\n var sizeArray = size.valueOf().map(value => {\n return Array.isArray(value) && value.length === 1 ? value[0] : value;\n }); // matrix to resize\n\n var m = copy ? this.clone() : this; // resize matrix\n\n return _resize(m, sizeArray, defaultValue);\n };\n\n function _resize(matrix, size, defaultValue) {\n // check size\n if (size.length === 0) {\n // first value in matrix\n var v = matrix._data; // go deep\n\n while (isArray(v)) {\n v = v[0];\n }\n\n return v;\n } // resize matrix\n\n\n matrix._size = size.slice(0); // copy the array\n\n matrix._data = resize(matrix._data, matrix._size, defaultValue); // return matrix\n\n return matrix;\n }\n /**\n * Reshape the matrix to the given size. Returns a copy of the matrix when\n * `copy=true`, otherwise return the matrix itself (reshape in place).\n *\n * NOTE: This might be better suited to copy by default, instead of modifying\n * in place. For now, it operates in place to remain consistent with\n * resize().\n *\n * @memberof DenseMatrix\n * @param {number[]} size The new size the matrix should have.\n * @param {boolean} [copy] Return a reshaped copy of the matrix\n *\n * @return {Matrix} The reshaped matrix\n */\n\n\n DenseMatrix.prototype.reshape = function (size, copy) {\n var m = copy ? this.clone() : this;\n m._data = reshape(m._data, size);\n\n var currentLength = m._size.reduce((length, size) => length * size);\n\n m._size = processSizesWildcard(size, currentLength);\n return m;\n };\n /**\n * Enlarge the matrix when it is smaller than given size.\n * If the matrix is larger or equal sized, nothing is done.\n * @memberof DenseMatrix\n * @param {DenseMatrix} matrix The matrix to be resized\n * @param {number[]} size\n * @param {*} defaultValue Default value, filled in on new entries.\n * @private\n */\n\n\n function _fit(matrix, size, defaultValue) {\n var // copy the array\n newSize = matrix._size.slice(0);\n\n var changed = false; // add dimensions when needed\n\n while (newSize.length < size.length) {\n newSize.push(0);\n changed = true;\n } // enlarge size when needed\n\n\n for (var i = 0, ii = size.length; i < ii; i++) {\n if (size[i] > newSize[i]) {\n newSize[i] = size[i];\n changed = true;\n }\n }\n\n if (changed) {\n // resize only when size is changed\n _resize(matrix, newSize, defaultValue);\n }\n }\n /**\n * Create a clone of the matrix\n * @memberof DenseMatrix\n * @return {DenseMatrix} clone\n */\n\n\n DenseMatrix.prototype.clone = function () {\n var m = new DenseMatrix({\n data: clone(this._data),\n size: clone(this._size),\n datatype: this._datatype\n });\n return m;\n };\n /**\n * Retrieve the size of the matrix.\n * @memberof DenseMatrix\n * @returns {number[]} size\n */\n\n\n DenseMatrix.prototype.size = function () {\n return this._size.slice(0); // return a clone of _size\n };\n /**\n * Create a new matrix with the results of the callback function executed on\n * each entry of the matrix.\n * @memberof DenseMatrix\n * @param {Function} callback The callback function is invoked with three\n * parameters: the value of the element, the index\n * of the element, and the Matrix being traversed.\n *\n * @return {DenseMatrix} matrix\n */\n\n\n DenseMatrix.prototype.map = function (callback) {\n // matrix instance\n var me = this;\n\n var recurse = function recurse(value, index) {\n if (isArray(value)) {\n return value.map(function (child, i) {\n return recurse(child, index.concat(i));\n });\n } else {\n return callback(value, index, me);\n }\n }; // determine the new datatype when the original matrix has datatype defined\n // TODO: should be done in matrix constructor instead\n\n\n var data = recurse(this._data, []);\n var datatype = this._datatype !== undefined ? getArrayDataType(data, typeOf) : undefined;\n return new DenseMatrix(data, datatype);\n };\n /**\n * Execute a callback function on each entry of the matrix.\n * @memberof DenseMatrix\n * @param {Function} callback The callback function is invoked with three\n * parameters: the value of the element, the index\n * of the element, and the Matrix being traversed.\n */\n\n\n DenseMatrix.prototype.forEach = function (callback) {\n // matrix instance\n var me = this;\n\n var recurse = function recurse(value, index) {\n if (isArray(value)) {\n value.forEach(function (child, i) {\n recurse(child, index.concat(i));\n });\n } else {\n callback(value, index, me);\n }\n };\n\n recurse(this._data, []);\n };\n /**\n * Iterate over the matrix elements\n * @return {Iterable<{ value, index: number[] }>}\n */\n\n\n DenseMatrix.prototype[Symbol.iterator] = function* () {\n var recurse = function* recurse(value, index) {\n if (isArray(value)) {\n for (var i = 0; i < value.length; i++) {\n yield* recurse(value[i], index.concat(i));\n }\n } else {\n yield {\n value,\n index\n };\n }\n };\n\n yield* recurse(this._data, []);\n };\n /**\n * Returns an array containing the rows of a 2D matrix\n * @returns {Array<Matrix>}\n */\n\n\n DenseMatrix.prototype.rows = function () {\n var result = [];\n var s = this.size();\n\n if (s.length !== 2) {\n throw new TypeError('Rows can only be returned for a 2D matrix.');\n }\n\n var data = this._data;\n\n for (var row of data) {\n result.push(new DenseMatrix([row], this._datatype));\n }\n\n return result;\n };\n /**\n * Returns an array containing the columns of a 2D matrix\n * @returns {Array<Matrix>}\n */\n\n\n DenseMatrix.prototype.columns = function () {\n var _this = this;\n\n var result = [];\n var s = this.size();\n\n if (s.length !== 2) {\n throw new TypeError('Rows can only be returned for a 2D matrix.');\n }\n\n var data = this._data;\n\n var _loop = function _loop(i) {\n var col = data.map(row => [row[i]]);\n result.push(new DenseMatrix(col, _this._datatype));\n };\n\n for (var i = 0; i < s[1]; i++) {\n _loop(i);\n }\n\n return result;\n };\n /**\n * Create an Array with a copy of the data of the DenseMatrix\n * @memberof DenseMatrix\n * @returns {Array} array\n */\n\n\n DenseMatrix.prototype.toArray = function () {\n return clone(this._data);\n };\n /**\n * Get the primitive value of the DenseMatrix: a multidimensional array\n * @memberof DenseMatrix\n * @returns {Array} array\n */\n\n\n DenseMatrix.prototype.valueOf = function () {\n return this._data;\n };\n /**\n * Get a string representation of the matrix, with optional formatting options.\n * @memberof DenseMatrix\n * @param {Object | number | Function} [options] Formatting options. See\n * lib/utils/number:format for a\n * description of the available\n * options.\n * @returns {string} str\n */\n\n\n DenseMatrix.prototype.format = function (options) {\n return format(this._data, options);\n };\n /**\n * Get a string representation of the matrix\n * @memberof DenseMatrix\n * @returns {string} str\n */\n\n\n DenseMatrix.prototype.toString = function () {\n return format(this._data);\n };\n /**\n * Get a JSON representation of the matrix\n * @memberof DenseMatrix\n * @returns {Object}\n */\n\n\n DenseMatrix.prototype.toJSON = function () {\n return {\n mathjs: 'DenseMatrix',\n data: this._data,\n size: this._size,\n datatype: this._datatype\n };\n };\n /**\n * Get the kth Matrix diagonal.\n *\n * @memberof DenseMatrix\n * @param {number | BigNumber} [k=0] The kth diagonal where the vector will retrieved.\n *\n * @returns {Matrix} The matrix with the diagonal values.\n */\n\n\n DenseMatrix.prototype.diagonal = function (k) {\n // validate k if any\n if (k) {\n // convert BigNumber to a number\n if (isBigNumber(k)) {\n k = k.toNumber();\n } // is must be an integer\n\n\n if (!isNumber(k) || !isInteger(k)) {\n throw new TypeError('The parameter k must be an integer number');\n }\n } else {\n // default value\n k = 0;\n }\n\n var kSuper = k > 0 ? k : 0;\n var kSub = k < 0 ? -k : 0; // rows & columns\n\n var rows = this._size[0];\n var columns = this._size[1]; // number diagonal values\n\n var n = Math.min(rows - kSub, columns - kSuper); // x is a matrix get diagonal from matrix\n\n var data = []; // loop rows\n\n for (var i = 0; i < n; i++) {\n data[i] = this._data[i + kSub][i + kSuper];\n } // create DenseMatrix\n\n\n return new DenseMatrix({\n data: data,\n size: [n],\n datatype: this._datatype\n });\n };\n /**\n * Create a diagonal matrix.\n *\n * @memberof DenseMatrix\n * @param {Array} size The matrix size.\n * @param {number | Matrix | Array } value The values for the diagonal.\n * @param {number | BigNumber} [k=0] The kth diagonal where the vector will be filled in.\n * @param {number} [defaultValue] The default value for non-diagonal\n * @param {string} [datatype] The datatype for the diagonal\n *\n * @returns {DenseMatrix}\n */\n\n\n DenseMatrix.diagonal = function (size, value, k, defaultValue) {\n if (!isArray(size)) {\n throw new TypeError('Array expected, size parameter');\n }\n\n if (size.length !== 2) {\n throw new Error('Only two dimensions matrix are supported');\n } // map size & validate\n\n\n size = size.map(function (s) {\n // check it is a big number\n if (isBigNumber(s)) {\n // convert it\n s = s.toNumber();\n } // validate arguments\n\n\n if (!isNumber(s) || !isInteger(s) || s < 1) {\n throw new Error('Size values must be positive integers');\n }\n\n return s;\n }); // validate k if any\n\n if (k) {\n // convert BigNumber to a number\n if (isBigNumber(k)) {\n k = k.toNumber();\n } // is must be an integer\n\n\n if (!isNumber(k) || !isInteger(k)) {\n throw new TypeError('The parameter k must be an integer number');\n }\n } else {\n // default value\n k = 0;\n }\n\n var kSuper = k > 0 ? k : 0;\n var kSub = k < 0 ? -k : 0; // rows and columns\n\n var rows = size[0];\n var columns = size[1]; // number of non-zero items\n\n var n = Math.min(rows - kSub, columns - kSuper); // value extraction function\n\n var _value; // check value\n\n\n if (isArray(value)) {\n // validate array\n if (value.length !== n) {\n // number of values in array must be n\n throw new Error('Invalid value array length');\n } // define function\n\n\n _value = function _value(i) {\n // return value @ i\n return value[i];\n };\n } else if (isMatrix(value)) {\n // matrix size\n var ms = value.size(); // validate matrix\n\n if (ms.length !== 1 || ms[0] !== n) {\n // number of values in array must be n\n throw new Error('Invalid matrix length');\n } // define function\n\n\n _value = function _value(i) {\n // return value @ i\n return value.get([i]);\n };\n } else {\n // define function\n _value = function _value() {\n // return value\n return value;\n };\n } // discover default value if needed\n\n\n if (!defaultValue) {\n // check first value in array\n defaultValue = isBigNumber(_value(0)) ? _value(0).mul(0) // trick to create a BigNumber with value zero\n : 0;\n } // empty array\n\n\n var data = []; // check we need to resize array\n\n if (size.length > 0) {\n // resize array\n data = resize(data, size, defaultValue); // fill diagonal\n\n for (var d = 0; d < n; d++) {\n data[d + kSub][d + kSuper] = _value(d);\n }\n } // create DenseMatrix\n\n\n return new DenseMatrix({\n data: data,\n size: [rows, columns]\n });\n };\n /**\n * Generate a matrix from a JSON object\n * @memberof DenseMatrix\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"DenseMatrix\", data: [], size: []}`,\n * where mathjs is optional\n * @returns {DenseMatrix}\n */\n\n\n DenseMatrix.fromJSON = function (json) {\n return new DenseMatrix(json);\n };\n /**\n * Swap rows i and j in Matrix.\n *\n * @memberof DenseMatrix\n * @param {number} i Matrix row index 1\n * @param {number} j Matrix row index 2\n *\n * @return {Matrix} The matrix reference\n */\n\n\n DenseMatrix.prototype.swapRows = function (i, j) {\n // check index\n if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) {\n throw new Error('Row index must be positive integers');\n } // check dimensions\n\n\n if (this._size.length !== 2) {\n throw new Error('Only two dimensional matrix is supported');\n } // validate index\n\n\n validateIndex(i, this._size[0]);\n validateIndex(j, this._size[0]); // swap rows\n\n DenseMatrix._swapRows(i, j, this._data); // return current instance\n\n\n return this;\n };\n /**\n * Swap rows i and j in Dense Matrix data structure.\n *\n * @param {number} i Matrix row index 1\n * @param {number} j Matrix row index 2\n * @param {Array} data Matrix data\n */\n\n\n DenseMatrix._swapRows = function (i, j, data) {\n // swap values i <-> j\n var vi = data[i];\n data[i] = data[j];\n data[j] = vi;\n };\n /**\n * Preprocess data, which can be an Array or DenseMatrix with nested Arrays and\n * Matrices. Replaces all nested Matrices with Arrays\n * @memberof DenseMatrix\n * @param {Array} data\n * @return {Array} data\n */\n\n\n function preprocess(data) {\n for (var i = 0, ii = data.length; i < ii; i++) {\n var elem = data[i];\n\n if (isArray(elem)) {\n data[i] = preprocess(elem);\n } else if (elem && elem.isMatrix === true) {\n data[i] = preprocess(elem.valueOf());\n }\n }\n\n return data;\n }\n\n return DenseMatrix;\n}, {\n isClass: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { MatrixDependencies } from './dependenciesMatrixClass.generated.js';\nimport { createDenseMatrixClass } from '../../factoriesAny.js';\nexport var DenseMatrixDependencies = {\n MatrixDependencies,\n createDenseMatrixClass\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createBigNumberClass } from '../../factoriesAny.js';\nexport var BigNumberDependencies = {\n createBigNumberClass\n};","import Decimal from 'decimal.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'BigNumber';\nvar dependencies = ['?on', 'config'];\nexport var createBigNumberClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n on,\n config\n } = _ref;\n var BigNumber = Decimal.clone({\n precision: config.precision,\n modulo: Decimal.EUCLID\n });\n BigNumber.prototype = Object.create(BigNumber.prototype);\n /**\n * Attach type information\n */\n\n BigNumber.prototype.type = 'BigNumber';\n BigNumber.prototype.isBigNumber = true;\n /**\n * Get a JSON representation of a BigNumber containing\n * type information\n * @returns {Object} Returns a JSON object structured as:\n * `{\"mathjs\": \"BigNumber\", \"value\": \"0.2\"}`\n */\n\n BigNumber.prototype.toJSON = function () {\n return {\n mathjs: 'BigNumber',\n value: this.toString()\n };\n };\n /**\n * Instantiate a BigNumber from a JSON object\n * @param {Object} json a JSON object structured as:\n * `{\"mathjs\": \"BigNumber\", \"value\": \"0.2\"}`\n * @return {BigNumber}\n */\n\n\n BigNumber.fromJSON = function (json) {\n return new BigNumber(json.value);\n };\n\n if (on) {\n // listen for changed in the configuration, automatically apply changed precision\n on('config', function (curr, prev) {\n if (curr.precision !== prev.precision) {\n BigNumber.config({\n precision: curr.precision\n });\n }\n });\n }\n\n return BigNumber;\n}, {\n isClass: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createComplexClass } from '../../factoriesAny.js';\nexport var ComplexDependencies = {\n createComplexClass\n};","import Complex from 'complex.js';\nimport { format } from '../../utils/number.js';\nimport { isNumber, isUnit } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Complex';\nvar dependencies = [];\nexport var createComplexClass = /* #__PURE__ */factory(name, dependencies, () => {\n /**\n * Attach type information\n */\n Complex.prototype.type = 'Complex';\n Complex.prototype.isComplex = true;\n /**\n * Get a JSON representation of the complex number\n * @returns {Object} Returns a JSON object structured as:\n * `{\"mathjs\": \"Complex\", \"re\": 2, \"im\": 3}`\n */\n\n Complex.prototype.toJSON = function () {\n return {\n mathjs: 'Complex',\n re: this.re,\n im: this.im\n };\n };\n /*\n * Return the value of the complex number in polar notation\n * The angle phi will be set in the interval of [-pi, pi].\n * @return {{r: number, phi: number}} Returns and object with properties r and phi.\n */\n\n\n Complex.prototype.toPolar = function () {\n return {\n r: this.abs(),\n phi: this.arg()\n };\n };\n /**\n * Get a string representation of the complex number,\n * with optional formatting options.\n * @param {Object | number | Function} [options] Formatting options. See\n * lib/utils/number:format for a\n * description of the available\n * options.\n * @return {string} str\n */\n\n\n Complex.prototype.format = function (options) {\n var str = '';\n var im = this.im;\n var re = this.re;\n var strRe = format(this.re, options);\n var strIm = format(this.im, options); // round either re or im when smaller than the configured precision\n\n var precision = isNumber(options) ? options : options ? options.precision : null;\n\n if (precision !== null) {\n var epsilon = Math.pow(10, -precision);\n\n if (Math.abs(re / im) < epsilon) {\n re = 0;\n }\n\n if (Math.abs(im / re) < epsilon) {\n im = 0;\n }\n }\n\n if (im === 0) {\n // real value\n str = strRe;\n } else if (re === 0) {\n // purely complex value\n if (im === 1) {\n str = 'i';\n } else if (im === -1) {\n str = '-i';\n } else {\n str = strIm + 'i';\n }\n } else {\n // complex value\n if (im < 0) {\n if (im === -1) {\n str = strRe + ' - i';\n } else {\n str = strRe + ' - ' + strIm.substring(1) + 'i';\n }\n } else {\n if (im === 1) {\n str = strRe + ' + i';\n } else {\n str = strRe + ' + ' + strIm + 'i';\n }\n }\n }\n\n return str;\n };\n /**\n * Create a complex number from polar coordinates\n *\n * Usage:\n *\n * Complex.fromPolar(r: number, phi: number) : Complex\n * Complex.fromPolar({r: number, phi: number}) : Complex\n *\n * @param {*} args...\n * @return {Complex}\n */\n\n\n Complex.fromPolar = function (args) {\n switch (arguments.length) {\n case 1:\n {\n var arg = arguments[0];\n\n if (typeof arg === 'object') {\n return Complex(arg);\n } else {\n throw new TypeError('Input has to be an object with r and phi keys.');\n }\n }\n\n case 2:\n {\n var r = arguments[0];\n var phi = arguments[1];\n\n if (isNumber(r)) {\n if (isUnit(phi) && phi.hasBase('ANGLE')) {\n // convert unit to a number in radians\n phi = phi.toNumber('rad');\n }\n\n if (isNumber(phi)) {\n return new Complex({\n r: r,\n phi: phi\n });\n }\n\n throw new TypeError('Phi is not a number nor an angle unit.');\n } else {\n throw new TypeError('Radius r is not a number.');\n }\n }\n\n default:\n throw new SyntaxError('Wrong number of arguments in function fromPolar');\n }\n };\n\n Complex.prototype.valueOf = Complex.prototype.toString;\n /**\n * Create a Complex number from a JSON object\n * @param {Object} json A JSON Object structured as\n * {\"mathjs\": \"Complex\", \"re\": 2, \"im\": 3}\n * All properties are optional, default values\n * for `re` and `im` are 0.\n * @return {Complex} Returns a new Complex number\n */\n\n Complex.fromJSON = function (json) {\n return new Complex(json);\n };\n /**\n * Compare two complex numbers, `a` and `b`:\n *\n * - Returns 1 when the real part of `a` is larger than the real part of `b`\n * - Returns -1 when the real part of `a` is smaller than the real part of `b`\n * - Returns 1 when the real parts are equal\n * and the imaginary part of `a` is larger than the imaginary part of `b`\n * - Returns -1 when the real parts are equal\n * and the imaginary part of `a` is smaller than the imaginary part of `b`\n * - Returns 0 when both real and imaginary parts are equal.\n *\n * @params {Complex} a\n * @params {Complex} b\n * @returns {number} Returns the comparison result: -1, 0, or 1\n */\n\n\n Complex.compare = function (a, b) {\n if (a.re > b.re) {\n return 1;\n }\n\n if (a.re < b.re) {\n return -1;\n }\n\n if (a.im > b.im) {\n return 1;\n }\n\n if (a.im < b.im) {\n return -1;\n }\n\n return 0;\n };\n\n return Complex;\n}, {\n isClass: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createFractionClass } from '../../factoriesAny.js';\nexport var FractionDependencies = {\n createFractionClass\n};","import Fraction from 'fraction.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Fraction';\nvar dependencies = [];\nexport var createFractionClass = /* #__PURE__ */factory(name, dependencies, () => {\n /**\n * Attach type information\n */\n Fraction.prototype.type = 'Fraction';\n Fraction.prototype.isFraction = true;\n /**\n * Get a JSON representation of a Fraction containing type information\n * @returns {Object} Returns a JSON object structured as:\n * `{\"mathjs\": \"Fraction\", \"n\": 3, \"d\": 8}`\n */\n\n Fraction.prototype.toJSON = function () {\n return {\n mathjs: 'Fraction',\n n: this.s * this.n,\n d: this.d\n };\n };\n /**\n * Instantiate a Fraction from a JSON object\n * @param {Object} json a JSON object structured as:\n * `{\"mathjs\": \"Fraction\", \"n\": 3, \"d\": 8}`\n * @return {BigNumber}\n */\n\n\n Fraction.fromJSON = function (json) {\n return new Fraction(json);\n };\n\n return Fraction;\n}, {\n isClass: true\n});","/**\n * Create a typed-function which checks the types of the arguments and\n * can match them against multiple provided signatures. The typed-function\n * automatically converts inputs in order to find a matching signature.\n * Typed functions throw informative errors in case of wrong input arguments.\n *\n * See the library [typed-function](https://github.com/josdejong/typed-function)\n * for detailed documentation.\n *\n * Syntax:\n *\n * math.typed(name, signatures) : function\n * math.typed(signatures) : function\n *\n * Examples:\n *\n * // create a typed function with multiple types per argument (type union)\n * const fn2 = typed({\n * 'number | boolean': function (b) {\n * return 'b is a number or boolean'\n * },\n * 'string, number | boolean': function (a, b) {\n * return 'a is a string, b is a number or boolean'\n * }\n * })\n *\n * // create a typed function with an any type argument\n * const log = typed({\n * 'string, any': function (event, data) {\n * console.log('event: ' + event + ', data: ' + JSON.stringify(data))\n * }\n * })\n *\n * @param {string} [name] Optional name for the typed-function\n * @param {Object<string, function>} signatures Object with one or multiple function signatures\n * @returns {function} The created typed-function.\n */\nimport { isAccessorNode, isArray, isArrayNode, isAssignmentNode, isBigNumber, isBlockNode, isBoolean, isChain, isComplex, isConditionalNode, isConstantNode, isDate, isDenseMatrix, isFraction, isFunction, isFunctionAssignmentNode, isFunctionNode, isHelp, isIndex, isIndexNode, isMatrix, isNode, isNull, isNumber, isObject, isObjectNode, isOperatorNode, isParenthesisNode, isRange, isRangeNode, isRegExp, isResultSet, isSparseMatrix, isString, isSymbolNode, isUndefined, isUnit } from '../../utils/is.js';\nimport typedFunction from 'typed-function';\nimport { digits } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { isMap } from '../../utils/map.js'; // returns a new instance of typed-function\n\nvar _createTyped2 = function _createTyped() {\n // initially, return the original instance of typed-function\n // consecutively, return a new instance from typed.create.\n _createTyped2 = typedFunction.create;\n return typedFunction;\n};\n\nvar dependencies = ['?BigNumber', '?Complex', '?DenseMatrix', '?Fraction'];\n/**\n * Factory function for creating a new typed instance\n * @param {Object} dependencies Object with data types like Complex and BigNumber\n * @returns {Function}\n */\n\nexport var createTyped = /* #__PURE__ */factory('typed', dependencies, function createTyped(_ref) {\n var {\n BigNumber,\n Complex,\n DenseMatrix,\n Fraction\n } = _ref;\n\n // TODO: typed-function must be able to silently ignore signatures with unknown data types\n // get a new instance of typed-function\n var typed = _createTyped2(); // define all types. The order of the types determines in which order function\n // arguments are type-checked (so for performance it's important to put the\n // most used types first).\n\n\n typed.types = [{\n name: 'number',\n test: isNumber\n }, {\n name: 'Complex',\n test: isComplex\n }, {\n name: 'BigNumber',\n test: isBigNumber\n }, {\n name: 'Fraction',\n test: isFraction\n }, {\n name: 'Unit',\n test: isUnit\n }, {\n name: 'string',\n test: isString\n }, {\n name: 'Chain',\n test: isChain\n }, {\n name: 'Array',\n test: isArray\n }, {\n name: 'Matrix',\n test: isMatrix\n }, {\n name: 'DenseMatrix',\n test: isDenseMatrix\n }, {\n name: 'SparseMatrix',\n test: isSparseMatrix\n }, {\n name: 'Range',\n test: isRange\n }, {\n name: 'Index',\n test: isIndex\n }, {\n name: 'boolean',\n test: isBoolean\n }, {\n name: 'ResultSet',\n test: isResultSet\n }, {\n name: 'Help',\n test: isHelp\n }, {\n name: 'function',\n test: isFunction\n }, {\n name: 'Date',\n test: isDate\n }, {\n name: 'RegExp',\n test: isRegExp\n }, {\n name: 'null',\n test: isNull\n }, {\n name: 'undefined',\n test: isUndefined\n }, {\n name: 'AccessorNode',\n test: isAccessorNode\n }, {\n name: 'ArrayNode',\n test: isArrayNode\n }, {\n name: 'AssignmentNode',\n test: isAssignmentNode\n }, {\n name: 'BlockNode',\n test: isBlockNode\n }, {\n name: 'ConditionalNode',\n test: isConditionalNode\n }, {\n name: 'ConstantNode',\n test: isConstantNode\n }, {\n name: 'FunctionNode',\n test: isFunctionNode\n }, {\n name: 'FunctionAssignmentNode',\n test: isFunctionAssignmentNode\n }, {\n name: 'IndexNode',\n test: isIndexNode\n }, {\n name: 'Node',\n test: isNode\n }, {\n name: 'ObjectNode',\n test: isObjectNode\n }, {\n name: 'OperatorNode',\n test: isOperatorNode\n }, {\n name: 'ParenthesisNode',\n test: isParenthesisNode\n }, {\n name: 'RangeNode',\n test: isRangeNode\n }, {\n name: 'SymbolNode',\n test: isSymbolNode\n }, {\n name: 'Map',\n test: isMap\n }, {\n name: 'Object',\n test: isObject\n } // order 'Object' last, it matches on other classes too\n ];\n typed.conversions = [{\n from: 'number',\n to: 'BigNumber',\n convert: function convert(x) {\n if (!BigNumber) {\n throwNoBignumber(x);\n } // note: conversion from number to BigNumber can fail if x has >15 digits\n\n\n if (digits(x) > 15) {\n throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' + '(value: ' + x + '). ' + 'Use function bignumber(x) to convert to BigNumber.');\n }\n\n return new BigNumber(x);\n }\n }, {\n from: 'number',\n to: 'Complex',\n convert: function convert(x) {\n if (!Complex) {\n throwNoComplex(x);\n }\n\n return new Complex(x, 0);\n }\n }, {\n from: 'number',\n to: 'string',\n convert: function convert(x) {\n return x + '';\n }\n }, {\n from: 'BigNumber',\n to: 'Complex',\n convert: function convert(x) {\n if (!Complex) {\n throwNoComplex(x);\n }\n\n return new Complex(x.toNumber(), 0);\n }\n }, {\n from: 'Fraction',\n to: 'BigNumber',\n convert: function convert(x) {\n throw new TypeError('Cannot implicitly convert a Fraction to BigNumber or vice versa. ' + 'Use function bignumber(x) to convert to BigNumber or fraction(x) to convert to Fraction.');\n }\n }, {\n from: 'Fraction',\n to: 'Complex',\n convert: function convert(x) {\n if (!Complex) {\n throwNoComplex(x);\n }\n\n return new Complex(x.valueOf(), 0);\n }\n }, {\n from: 'number',\n to: 'Fraction',\n convert: function convert(x) {\n if (!Fraction) {\n throwNoFraction(x);\n }\n\n var f = new Fraction(x);\n\n if (f.valueOf() !== x) {\n throw new TypeError('Cannot implicitly convert a number to a Fraction when there will be a loss of precision ' + '(value: ' + x + '). ' + 'Use function fraction(x) to convert to Fraction.');\n }\n\n return f;\n }\n }, {\n // FIXME: add conversion from Fraction to number, for example for `sqrt(fraction(1,3))`\n // from: 'Fraction',\n // to: 'number',\n // convert: function (x) {\n // return x.valueOf()\n // }\n // }, {\n from: 'string',\n to: 'number',\n convert: function convert(x) {\n var n = Number(x);\n\n if (isNaN(n)) {\n throw new Error('Cannot convert \"' + x + '\" to a number');\n }\n\n return n;\n }\n }, {\n from: 'string',\n to: 'BigNumber',\n convert: function convert(x) {\n if (!BigNumber) {\n throwNoBignumber(x);\n }\n\n try {\n return new BigNumber(x);\n } catch (err) {\n throw new Error('Cannot convert \"' + x + '\" to BigNumber');\n }\n }\n }, {\n from: 'string',\n to: 'Fraction',\n convert: function convert(x) {\n if (!Fraction) {\n throwNoFraction(x);\n }\n\n try {\n return new Fraction(x);\n } catch (err) {\n throw new Error('Cannot convert \"' + x + '\" to Fraction');\n }\n }\n }, {\n from: 'string',\n to: 'Complex',\n convert: function convert(x) {\n if (!Complex) {\n throwNoComplex(x);\n }\n\n try {\n return new Complex(x);\n } catch (err) {\n throw new Error('Cannot convert \"' + x + '\" to Complex');\n }\n }\n }, {\n from: 'boolean',\n to: 'number',\n convert: function convert(x) {\n return +x;\n }\n }, {\n from: 'boolean',\n to: 'BigNumber',\n convert: function convert(x) {\n if (!BigNumber) {\n throwNoBignumber(x);\n }\n\n return new BigNumber(+x);\n }\n }, {\n from: 'boolean',\n to: 'Fraction',\n convert: function convert(x) {\n if (!Fraction) {\n throwNoFraction(x);\n }\n\n return new Fraction(+x);\n }\n }, {\n from: 'boolean',\n to: 'string',\n convert: function convert(x) {\n return String(x);\n }\n }, {\n from: 'Array',\n to: 'Matrix',\n convert: function convert(array) {\n if (!DenseMatrix) {\n throwNoMatrix();\n }\n\n return new DenseMatrix(array);\n }\n }, {\n from: 'Matrix',\n to: 'Array',\n convert: function convert(matrix) {\n return matrix.valueOf();\n }\n }];\n return typed;\n});\n\nfunction throwNoBignumber(x) {\n throw new Error(\"Cannot convert value \".concat(x, \" into a BigNumber: no class 'BigNumber' provided\"));\n}\n\nfunction throwNoComplex(x) {\n throw new Error(\"Cannot convert value \".concat(x, \" into a Complex number: no class 'Complex' provided\"));\n}\n\nfunction throwNoMatrix() {\n throw new Error('Cannot convert array into a Matrix: no class \\'DenseMatrix\\' provided');\n}\n\nfunction throwNoFraction(x) {\n throw new Error(\"Cannot convert value \".concat(x, \" into a Fraction, no class 'Fraction' provided.\"));\n}","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';\nimport { ComplexDependencies } from './dependenciesComplexClass.generated.js';\nimport { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';\nimport { FractionDependencies } from './dependenciesFractionClass.generated.js';\nimport { createTyped } from '../../factoriesAny.js';\nexport var typedDependencies = {\n BigNumberDependencies,\n ComplexDependencies,\n DenseMatrixDependencies,\n FractionDependencies,\n createTyped\n};","/**\n * Compares two BigNumbers.\n * @param {BigNumber} x First value to compare\n * @param {BigNumber} y Second value to compare\n * @param {number} [epsilon] The maximum relative difference between x and y\n * If epsilon is undefined or null, the function will\n * test whether x and y are exactly equal.\n * @return {boolean} whether the two numbers are nearly equal\n */\nexport function nearlyEqual(x, y, epsilon) {\n // if epsilon is null or undefined, test whether x and y are exactly equal\n if (epsilon === null || epsilon === undefined) {\n return x.eq(y);\n } // use \"==\" operator, handles infinities\n\n\n if (x.eq(y)) {\n return true;\n } // NaN\n\n\n if (x.isNaN() || y.isNaN()) {\n return false;\n } // at this point x and y should be finite\n\n\n if (x.isFinite() && y.isFinite()) {\n // check numbers are very close, needed when comparing numbers near zero\n var diff = x.minus(y).abs();\n\n if (diff.isZero()) {\n return true;\n } else {\n // use relative error\n var max = x.constructor.max(x.abs(), y.abs());\n return diff.lte(max.times(epsilon));\n }\n } // Infinite and Number or negative Infinite and positive Infinite cases\n\n\n return false;\n}","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { complexEquals } from '../../utils/complex.js';\nvar name = 'equalScalar';\nvar dependencies = ['typed', 'config'];\nexport var createEqualScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n config\n } = _ref;\n\n /**\n * Test whether two scalar values are nearly equal.\n *\n * @param {number | BigNumber | Fraction | boolean | Complex | Unit} x First value to compare\n * @param {number | BigNumber | Fraction | boolean | Complex} y Second value to compare\n * @return {boolean} Returns true when the compared values are equal, else returns false\n * @private\n */\n return typed(name, {\n 'boolean, boolean': function booleanBoolean(x, y) {\n return x === y;\n },\n 'number, number': function numberNumber(x, y) {\n return nearlyEqual(x, y, config.epsilon);\n },\n 'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n return x.eq(y) || bigNearlyEqual(x, y, config.epsilon);\n },\n 'Fraction, Fraction': function FractionFraction(x, y) {\n return x.equals(y);\n },\n 'Complex, Complex': function ComplexComplex(x, y) {\n return complexEquals(x, y, config.epsilon);\n },\n 'Unit, Unit': function UnitUnit(x, y) {\n if (!x.equalBase(y)) {\n throw new Error('Cannot compare units with different base');\n }\n\n return this(x.value, y.value);\n }\n });\n});\nexport var createEqualScalarNumber = factory(name, ['typed', 'config'], _ref2 => {\n var {\n typed,\n config\n } = _ref2;\n return typed(name, {\n 'number, number': function numberNumber(x, y) {\n return nearlyEqual(x, y, config.epsilon);\n }\n });\n});","import { nearlyEqual } from './number.js';\n/**\n * Test whether two complex values are equal provided a given epsilon.\n * Does not use or change the global Complex.EPSILON setting\n * @param {Complex} x\n * @param {Complex} y\n * @param {number} epsilon\n * @returns {boolean}\n */\n\nexport function complexEquals(x, y, epsilon) {\n return nearlyEqual(x.re, y.re, epsilon) && nearlyEqual(x.im, y.im, epsilon);\n}","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createEqualScalar } from '../../factoriesAny.js';\nexport var equalScalarDependencies = {\n typedDependencies,\n createEqualScalar\n};","import { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';\nimport { isInteger } from '../../utils/number.js';\nimport { format } from '../../utils/string.js';\nimport { clone, deepStrictEqual } from '../../utils/object.js';\nimport { arraySize, getArrayDataType, processSizesWildcard, unsqueeze, validateIndex } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nvar name = 'SparseMatrix';\nvar dependencies = ['typed', 'equalScalar', 'Matrix'];\nexport var createSparseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n equalScalar,\n Matrix\n } = _ref;\n\n /**\n * Sparse Matrix implementation. This type implements\n * a [Compressed Column Storage](https://en.wikipedia.org/wiki/Sparse_matrix#Compressed_sparse_column_(CSC_or_CCS))\n * format for two-dimensional sparse matrices.\n * @class SparseMatrix\n */\n function SparseMatrix(data, datatype) {\n if (!(this instanceof SparseMatrix)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n\n if (datatype && !isString(datatype)) {\n throw new Error('Invalid datatype: ' + datatype);\n }\n\n if (isMatrix(data)) {\n // create from matrix\n _createFromMatrix(this, data, datatype);\n } else if (data && isArray(data.index) && isArray(data.ptr) && isArray(data.size)) {\n // initialize fields\n this._values = data.values;\n this._index = data.index;\n this._ptr = data.ptr;\n this._size = data.size;\n this._datatype = datatype || data.datatype;\n } else if (isArray(data)) {\n // create from array\n _createFromArray(this, data, datatype);\n } else if (data) {\n // unsupported type\n throw new TypeError('Unsupported type of data (' + typeOf(data) + ')');\n } else {\n // nothing provided\n this._values = [];\n this._index = [];\n this._ptr = [0];\n this._size = [0, 0];\n this._datatype = datatype;\n }\n }\n\n function _createFromMatrix(matrix, source, datatype) {\n // check matrix type\n if (source.type === 'SparseMatrix') {\n // clone arrays\n matrix._values = source._values ? clone(source._values) : undefined;\n matrix._index = clone(source._index);\n matrix._ptr = clone(source._ptr);\n matrix._size = clone(source._size);\n matrix._datatype = datatype || source._datatype;\n } else {\n // build from matrix data\n _createFromArray(matrix, source.valueOf(), datatype || source._datatype);\n }\n }\n\n function _createFromArray(matrix, data, datatype) {\n // initialize fields\n matrix._values = [];\n matrix._index = [];\n matrix._ptr = [];\n matrix._datatype = datatype; // discover rows & columns, do not use math.size() to avoid looping array twice\n\n var rows = data.length;\n var columns = 0; // equal signature to use\n\n var eq = equalScalar; // zero value\n\n var zero = 0;\n\n if (isString(datatype)) {\n // find signature that matches (datatype, datatype)\n eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar; // convert 0 to the same datatype\n\n zero = typed.convert(0, datatype);\n } // check we have rows (empty array)\n\n\n if (rows > 0) {\n // column index\n var j = 0;\n\n do {\n // store pointer to values index\n matrix._ptr.push(matrix._index.length); // loop rows\n\n\n for (var i = 0; i < rows; i++) {\n // current row\n var row = data[i]; // check row is an array\n\n if (isArray(row)) {\n // update columns if needed (only on first column)\n if (j === 0 && columns < row.length) {\n columns = row.length;\n } // check row has column\n\n\n if (j < row.length) {\n // value\n var v = row[j]; // check value != 0\n\n if (!eq(v, zero)) {\n // store value\n matrix._values.push(v); // index\n\n\n matrix._index.push(i);\n }\n }\n } else {\n // update columns if needed (only on first column)\n if (j === 0 && columns < 1) {\n columns = 1;\n } // check value != 0 (row is a scalar)\n\n\n if (!eq(row, zero)) {\n // store value\n matrix._values.push(row); // index\n\n\n matrix._index.push(i);\n }\n }\n } // increment index\n\n\n j++;\n } while (j < columns);\n } // store number of values in ptr\n\n\n matrix._ptr.push(matrix._index.length); // size\n\n\n matrix._size = [rows, columns];\n }\n\n SparseMatrix.prototype = new Matrix();\n /**\n * Create a new SparseMatrix\n */\n\n SparseMatrix.prototype.createSparseMatrix = function (data, datatype) {\n return new SparseMatrix(data, datatype);\n };\n /**\n * Attach type information\n */\n\n\n SparseMatrix.prototype.type = 'SparseMatrix';\n SparseMatrix.prototype.isSparseMatrix = true;\n /**\n * Get the matrix type\n *\n * Usage:\n * const matrixType = matrix.getDataType() // retrieves the matrix type\n *\n * @memberOf SparseMatrix\n * @return {string} type information; if multiple types are found from the Matrix, it will return \"mixed\"\n */\n\n SparseMatrix.prototype.getDataType = function () {\n return getArrayDataType(this._values, typeOf);\n };\n /**\n * Get the storage format used by the matrix.\n *\n * Usage:\n * const format = matrix.storage() // retrieve storage format\n *\n * @memberof SparseMatrix\n * @return {string} The storage format.\n */\n\n\n SparseMatrix.prototype.storage = function () {\n return 'sparse';\n };\n /**\n * Get the datatype of the data stored in the matrix.\n *\n * Usage:\n * const format = matrix.datatype() // retrieve matrix datatype\n *\n * @memberof SparseMatrix\n * @return {string} The datatype.\n */\n\n\n SparseMatrix.prototype.datatype = function () {\n return this._datatype;\n };\n /**\n * Create a new SparseMatrix\n * @memberof SparseMatrix\n * @param {Array} data\n * @param {string} [datatype]\n */\n\n\n SparseMatrix.prototype.create = function (data, datatype) {\n return new SparseMatrix(data, datatype);\n };\n /**\n * Get the matrix density.\n *\n * Usage:\n * const density = matrix.density() // retrieve matrix density\n *\n * @memberof SparseMatrix\n * @return {number} The matrix density.\n */\n\n\n SparseMatrix.prototype.density = function () {\n // rows & columns\n var rows = this._size[0];\n var columns = this._size[1]; // calculate density\n\n return rows !== 0 && columns !== 0 ? this._index.length / (rows * columns) : 0;\n };\n /**\n * Get a subset of the matrix, or replace a subset of the matrix.\n *\n * Usage:\n * const subset = matrix.subset(index) // retrieve subset\n * const value = matrix.subset(index, replacement) // replace subset\n *\n * @memberof SparseMatrix\n * @param {Index} index\n * @param {Array | Matrix | *} [replacement]\n * @param {*} [defaultValue=0] Default value, filled in on new entries when\n * the matrix is resized. If not provided,\n * new matrix elements will be filled with zeros.\n */\n\n\n SparseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n // check it is a pattern matrix\n if (!this._values) {\n throw new Error('Cannot invoke subset on a Pattern only matrix');\n } // check arguments\n\n\n switch (arguments.length) {\n case 1:\n return _getsubset(this, index);\n // intentional fall through\n\n case 2:\n case 3:\n return _setsubset(this, index, replacement, defaultValue);\n\n default:\n throw new SyntaxError('Wrong number of arguments');\n }\n };\n\n function _getsubset(matrix, idx) {\n // check idx\n if (!isIndex(idx)) {\n throw new TypeError('Invalid index');\n }\n\n var isScalar = idx.isScalar();\n\n if (isScalar) {\n // return a scalar\n return matrix.get(idx.min());\n } // validate dimensions\n\n\n var size = idx.size();\n\n if (size.length !== matrix._size.length) {\n throw new DimensionError(size.length, matrix._size.length);\n } // vars\n\n\n var i, ii, k, kk; // validate if any of the ranges in the index is out of range\n\n var min = idx.min();\n var max = idx.max();\n\n for (i = 0, ii = matrix._size.length; i < ii; i++) {\n validateIndex(min[i], matrix._size[i]);\n validateIndex(max[i], matrix._size[i]);\n } // matrix arrays\n\n\n var mvalues = matrix._values;\n var mindex = matrix._index;\n var mptr = matrix._ptr; // rows & columns dimensions for result matrix\n\n var rows = idx.dimension(0);\n var columns = idx.dimension(1); // workspace & permutation vector\n\n var w = [];\n var pv = []; // loop rows in resulting matrix\n\n rows.forEach(function (i, r) {\n // update permutation vector\n pv[i] = r[0]; // mark i in workspace\n\n w[i] = true;\n }); // result matrix arrays\n\n var values = mvalues ? [] : undefined;\n var index = [];\n var ptr = []; // loop columns in result matrix\n\n columns.forEach(function (j) {\n // update ptr\n ptr.push(index.length); // loop values in column j\n\n for (k = mptr[j], kk = mptr[j + 1]; k < kk; k++) {\n // row\n i = mindex[k]; // check row is in result matrix\n\n if (w[i] === true) {\n // push index\n index.push(pv[i]); // check we need to process values\n\n if (values) {\n values.push(mvalues[k]);\n }\n }\n }\n }); // update ptr\n\n ptr.push(index.length); // return matrix\n\n return new SparseMatrix({\n values: values,\n index: index,\n ptr: ptr,\n size: size,\n datatype: matrix._datatype\n });\n }\n\n function _setsubset(matrix, index, submatrix, defaultValue) {\n // check index\n if (!index || index.isIndex !== true) {\n throw new TypeError('Invalid index');\n } // get index size and check whether the index contains a single value\n\n\n var iSize = index.size();\n var isScalar = index.isScalar(); // calculate the size of the submatrix, and convert it into an Array if needed\n\n var sSize;\n\n if (isMatrix(submatrix)) {\n // submatrix size\n sSize = submatrix.size(); // use array representation\n\n submatrix = submatrix.toArray();\n } else {\n // get submatrix size (array, scalar)\n sSize = arraySize(submatrix);\n } // check index is a scalar\n\n\n if (isScalar) {\n // verify submatrix is a scalar\n if (sSize.length !== 0) {\n throw new TypeError('Scalar expected');\n } // set value\n\n\n matrix.set(index.min(), submatrix, defaultValue);\n } else {\n // validate dimensions, index size must be one or two dimensions\n if (iSize.length !== 1 && iSize.length !== 2) {\n throw new DimensionError(iSize.length, matrix._size.length, '<');\n } // check submatrix and index have the same dimensions\n\n\n if (sSize.length < iSize.length) {\n // calculate number of missing outer dimensions\n var i = 0;\n var outer = 0;\n\n while (iSize[i] === 1 && sSize[i] === 1) {\n i++;\n }\n\n while (iSize[i] === 1) {\n outer++;\n i++;\n } // unsqueeze both outer and inner dimensions\n\n\n submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);\n } // check whether the size of the submatrix matches the index size\n\n\n if (!deepStrictEqual(iSize, sSize)) {\n throw new DimensionError(iSize, sSize, '>');\n } // insert the sub matrix\n\n\n if (iSize.length === 1) {\n // if the replacement index only has 1 dimension, go trough each one and set its value\n var range = index.dimension(0);\n range.forEach(function (dataIndex, subIndex) {\n validateIndex(dataIndex);\n matrix.set([dataIndex, 0], submatrix[subIndex[0]], defaultValue);\n });\n } else {\n // if the replacement index has 2 dimensions, go through each one and set the value in the correct index\n var firstDimensionRange = index.dimension(0);\n var secondDimensionRange = index.dimension(1);\n firstDimensionRange.forEach(function (firstDataIndex, firstSubIndex) {\n validateIndex(firstDataIndex);\n secondDimensionRange.forEach(function (secondDataIndex, secondSubIndex) {\n validateIndex(secondDataIndex);\n matrix.set([firstDataIndex, secondDataIndex], submatrix[firstSubIndex[0]][secondSubIndex[0]], defaultValue);\n });\n });\n }\n }\n\n return matrix;\n }\n /**\n * Get a single element from the matrix.\n * @memberof SparseMatrix\n * @param {number[]} index Zero-based index\n * @return {*} value\n */\n\n\n SparseMatrix.prototype.get = function (index) {\n if (!isArray(index)) {\n throw new TypeError('Array expected');\n }\n\n if (index.length !== this._size.length) {\n throw new DimensionError(index.length, this._size.length);\n } // check it is a pattern matrix\n\n\n if (!this._values) {\n throw new Error('Cannot invoke get on a Pattern only matrix');\n } // row and column\n\n\n var i = index[0];\n var j = index[1]; // check i, j are valid\n\n validateIndex(i, this._size[0]);\n validateIndex(j, this._size[1]); // find value index\n\n var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index); // check k is prior to next column k and it is in the correct row\n\n\n if (k < this._ptr[j + 1] && this._index[k] === i) {\n return this._values[k];\n }\n\n return 0;\n };\n /**\n * Replace a single element in the matrix.\n * @memberof SparseMatrix\n * @param {number[]} index Zero-based index\n * @param {*} v\n * @param {*} [defaultValue] Default value, filled in on new entries when\n * the matrix is resized. If not provided,\n * new matrix elements will be set to zero.\n * @return {SparseMatrix} self\n */\n\n\n SparseMatrix.prototype.set = function (index, v, defaultValue) {\n if (!isArray(index)) {\n throw new TypeError('Array expected');\n }\n\n if (index.length !== this._size.length) {\n throw new DimensionError(index.length, this._size.length);\n } // check it is a pattern matrix\n\n\n if (!this._values) {\n throw new Error('Cannot invoke set on a Pattern only matrix');\n } // row and column\n\n\n var i = index[0];\n var j = index[1]; // rows & columns\n\n var rows = this._size[0];\n var columns = this._size[1]; // equal signature to use\n\n var eq = equalScalar; // zero value\n\n var zero = 0;\n\n if (isString(this._datatype)) {\n // find signature that matches (datatype, datatype)\n eq = typed.find(equalScalar, [this._datatype, this._datatype]) || equalScalar; // convert 0 to the same datatype\n\n zero = typed.convert(0, this._datatype);\n } // check we need to resize matrix\n\n\n if (i > rows - 1 || j > columns - 1) {\n // resize matrix\n _resize(this, Math.max(i + 1, rows), Math.max(j + 1, columns), defaultValue); // update rows & columns\n\n\n rows = this._size[0];\n columns = this._size[1];\n } // check i, j are valid\n\n\n validateIndex(i, rows);\n validateIndex(j, columns); // find value index\n\n var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index); // check k is prior to next column k and it is in the correct row\n\n\n if (k < this._ptr[j + 1] && this._index[k] === i) {\n // check value != 0\n if (!eq(v, zero)) {\n // update value\n this._values[k] = v;\n } else {\n // remove value from matrix\n _remove(k, j, this._values, this._index, this._ptr);\n }\n } else {\n // insert value @ (i, j)\n _insert(k, i, j, v, this._values, this._index, this._ptr);\n }\n\n return this;\n };\n\n function _getValueIndex(i, top, bottom, index) {\n // check row is on the bottom side\n if (bottom - top === 0) {\n return bottom;\n } // loop rows [top, bottom[\n\n\n for (var r = top; r < bottom; r++) {\n // check we found value index\n if (index[r] === i) {\n return r;\n }\n } // we did not find row\n\n\n return top;\n }\n\n function _remove(k, j, values, index, ptr) {\n // remove value @ k\n values.splice(k, 1);\n index.splice(k, 1); // update pointers\n\n for (var x = j + 1; x < ptr.length; x++) {\n ptr[x]--;\n }\n }\n\n function _insert(k, i, j, v, values, index, ptr) {\n // insert value\n values.splice(k, 0, v); // update row for k\n\n index.splice(k, 0, i); // update column pointers\n\n for (var x = j + 1; x < ptr.length; x++) {\n ptr[x]++;\n }\n }\n /**\n * Resize the matrix to the given size. Returns a copy of the matrix when\n * `copy=true`, otherwise return the matrix itself (resize in place).\n *\n * @memberof SparseMatrix\n * @param {number[] | Matrix} size The new size the matrix should have.\n * Since sparse matrices are always two-dimensional,\n * size must be two numbers in either an array or a matrix\n * @param {*} [defaultValue=0] Default value, filled in on new entries.\n * If not provided, the matrix elements will\n * be filled with zeros.\n * @param {boolean} [copy] Return a resized copy of the matrix\n *\n * @return {Matrix} The resized matrix\n */\n\n\n SparseMatrix.prototype.resize = function (size, defaultValue, copy) {\n // validate arguments\n if (!isCollection(size)) {\n throw new TypeError('Array or Matrix expected');\n } // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n\n\n var sizeArray = size.valueOf().map(value => {\n return Array.isArray(value) && value.length === 1 ? value[0] : value;\n });\n\n if (sizeArray.length !== 2) {\n throw new Error('Only two dimensions matrix are supported');\n } // check sizes\n\n\n sizeArray.forEach(function (value) {\n if (!isNumber(value) || !isInteger(value) || value < 0) {\n throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(sizeArray) + ')');\n }\n }); // matrix to resize\n\n var m = copy ? this.clone() : this; // resize matrix\n\n return _resize(m, sizeArray[0], sizeArray[1], defaultValue);\n };\n\n function _resize(matrix, rows, columns, defaultValue) {\n // value to insert at the time of growing matrix\n var value = defaultValue || 0; // equal signature to use\n\n var eq = equalScalar; // zero value\n\n var zero = 0;\n\n if (isString(matrix._datatype)) {\n // find signature that matches (datatype, datatype)\n eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar; // convert 0 to the same datatype\n\n zero = typed.convert(0, matrix._datatype); // convert value to the same datatype\n\n value = typed.convert(value, matrix._datatype);\n } // should we insert the value?\n\n\n var ins = !eq(value, zero); // old columns and rows\n\n var r = matrix._size[0];\n var c = matrix._size[1];\n var i, j, k; // check we need to increase columns\n\n if (columns > c) {\n // loop new columns\n for (j = c; j < columns; j++) {\n // update matrix._ptr for current column\n matrix._ptr[j] = matrix._values.length; // check we need to insert matrix._values\n\n if (ins) {\n // loop rows\n for (i = 0; i < r; i++) {\n // add new matrix._values\n matrix._values.push(value); // update matrix._index\n\n\n matrix._index.push(i);\n }\n }\n } // store number of matrix._values in matrix._ptr\n\n\n matrix._ptr[columns] = matrix._values.length;\n } else if (columns < c) {\n // truncate matrix._ptr\n matrix._ptr.splice(columns + 1, c - columns); // truncate matrix._values and matrix._index\n\n\n matrix._values.splice(matrix._ptr[columns], matrix._values.length);\n\n matrix._index.splice(matrix._ptr[columns], matrix._index.length);\n } // update columns\n\n\n c = columns; // check we need to increase rows\n\n if (rows > r) {\n // check we have to insert values\n if (ins) {\n // inserts\n var n = 0; // loop columns\n\n for (j = 0; j < c; j++) {\n // update matrix._ptr for current column\n matrix._ptr[j] = matrix._ptr[j] + n; // where to insert matrix._values\n\n k = matrix._ptr[j + 1] + n; // pointer\n\n var p = 0; // loop new rows, initialize pointer\n\n for (i = r; i < rows; i++, p++) {\n // add value\n matrix._values.splice(k + p, 0, value); // update matrix._index\n\n\n matrix._index.splice(k + p, 0, i); // increment inserts\n\n\n n++;\n }\n } // store number of matrix._values in matrix._ptr\n\n\n matrix._ptr[c] = matrix._values.length;\n }\n } else if (rows < r) {\n // deletes\n var d = 0; // loop columns\n\n for (j = 0; j < c; j++) {\n // update matrix._ptr for current column\n matrix._ptr[j] = matrix._ptr[j] - d; // where matrix._values start for next column\n\n var k0 = matrix._ptr[j];\n var k1 = matrix._ptr[j + 1] - d; // loop matrix._index\n\n for (k = k0; k < k1; k++) {\n // row\n i = matrix._index[k]; // check we need to delete value and matrix._index\n\n if (i > rows - 1) {\n // remove value\n matrix._values.splice(k, 1); // remove item from matrix._index\n\n\n matrix._index.splice(k, 1); // increase deletes\n\n\n d++;\n }\n }\n } // update matrix._ptr for current column\n\n\n matrix._ptr[j] = matrix._values.length;\n } // update matrix._size\n\n\n matrix._size[0] = rows;\n matrix._size[1] = columns; // return matrix\n\n return matrix;\n }\n /**\n * Reshape the matrix to the given size. Returns a copy of the matrix when\n * `copy=true`, otherwise return the matrix itself (reshape in place).\n *\n * NOTE: This might be better suited to copy by default, instead of modifying\n * in place. For now, it operates in place to remain consistent with\n * resize().\n *\n * @memberof SparseMatrix\n * @param {number[]} sizes The new size the matrix should have.\n * Since sparse matrices are always two-dimensional,\n * size must be two numbers in either an array or a matrix\n * @param {boolean} [copy] Return a reshaped copy of the matrix\n *\n * @return {Matrix} The reshaped matrix\n */\n\n\n SparseMatrix.prototype.reshape = function (sizes, copy) {\n // validate arguments\n if (!isArray(sizes)) {\n throw new TypeError('Array expected');\n }\n\n if (sizes.length !== 2) {\n throw new Error('Sparse matrices can only be reshaped in two dimensions');\n } // check sizes\n\n\n sizes.forEach(function (value) {\n if (!isNumber(value) || !isInteger(value) || value <= -2 || value === 0) {\n throw new TypeError('Invalid size, must contain positive integers or -1 ' + '(size: ' + format(sizes) + ')');\n }\n });\n var currentLength = this._size[0] * this._size[1];\n sizes = processSizesWildcard(sizes, currentLength);\n var newLength = sizes[0] * sizes[1]; // m * n must not change\n\n if (currentLength !== newLength) {\n throw new Error('Reshaping sparse matrix will result in the wrong number of elements');\n } // matrix to reshape\n\n\n var m = copy ? this.clone() : this; // return unchanged if the same shape\n\n if (this._size[0] === sizes[0] && this._size[1] === sizes[1]) {\n return m;\n } // Convert to COO format (generate a column index)\n\n\n var colIndex = [];\n\n for (var i = 0; i < m._ptr.length; i++) {\n for (var j = 0; j < m._ptr[i + 1] - m._ptr[i]; j++) {\n colIndex.push(i);\n }\n } // Clone the values array\n\n\n var values = m._values.slice(); // Clone the row index array\n\n\n var rowIndex = m._index.slice(); // Transform the (row, column) indices\n\n\n for (var _i = 0; _i < m._index.length; _i++) {\n var r1 = rowIndex[_i];\n var c1 = colIndex[_i];\n var flat = r1 * m._size[1] + c1;\n colIndex[_i] = flat % sizes[1];\n rowIndex[_i] = Math.floor(flat / sizes[1]);\n } // Now reshaping is supposed to preserve the row-major order, BUT these sparse matrices are stored\n // in column-major order, so we have to reorder the value array now. One option is to use a multisort,\n // sorting several arrays based on some other array.\n // OR, we could easily just:\n // 1. Remove all values from the matrix\n\n\n m._values.length = 0;\n m._index.length = 0;\n m._ptr.length = sizes[1] + 1;\n m._size = sizes.slice();\n\n for (var _i2 = 0; _i2 < m._ptr.length; _i2++) {\n m._ptr[_i2] = 0;\n } // 2. Re-insert all elements in the proper order (simplified code from SparseMatrix.prototype.set)\n // This step is probably the most time-consuming\n\n\n for (var h = 0; h < values.length; h++) {\n var _i3 = rowIndex[h];\n var _j = colIndex[h];\n var v = values[h];\n\n var k = _getValueIndex(_i3, m._ptr[_j], m._ptr[_j + 1], m._index);\n\n _insert(k, _i3, _j, v, m._values, m._index, m._ptr);\n } // The value indices are inserted out of order, but apparently that's... still OK?\n\n\n return m;\n };\n /**\n * Create a clone of the matrix\n * @memberof SparseMatrix\n * @return {SparseMatrix} clone\n */\n\n\n SparseMatrix.prototype.clone = function () {\n var m = new SparseMatrix({\n values: this._values ? clone(this._values) : undefined,\n index: clone(this._index),\n ptr: clone(this._ptr),\n size: clone(this._size),\n datatype: this._datatype\n });\n return m;\n };\n /**\n * Retrieve the size of the matrix.\n * @memberof SparseMatrix\n * @returns {number[]} size\n */\n\n\n SparseMatrix.prototype.size = function () {\n return this._size.slice(0); // copy the Array\n };\n /**\n * Create a new matrix with the results of the callback function executed on\n * each entry of the matrix.\n * @memberof SparseMatrix\n * @param {Function} callback The callback function is invoked with three\n * parameters: the value of the element, the index\n * of the element, and the Matrix being traversed.\n * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n *\n * @return {SparseMatrix} matrix\n */\n\n\n SparseMatrix.prototype.map = function (callback, skipZeros) {\n // check it is a pattern matrix\n if (!this._values) {\n throw new Error('Cannot invoke map on a Pattern only matrix');\n } // matrix instance\n\n\n var me = this; // rows and columns\n\n var rows = this._size[0];\n var columns = this._size[1]; // invoke callback\n\n var invoke = function invoke(v, i, j) {\n // invoke callback\n return callback(v, [i, j], me);\n }; // invoke _map\n\n\n return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros);\n };\n /**\n * Create a new matrix with the results of the callback function executed on the interval\n * [minRow..maxRow, minColumn..maxColumn].\n */\n\n\n function _map(matrix, minRow, maxRow, minColumn, maxColumn, callback, skipZeros) {\n // result arrays\n var values = [];\n var index = [];\n var ptr = []; // equal signature to use\n\n var eq = equalScalar; // zero value\n\n var zero = 0;\n\n if (isString(matrix._datatype)) {\n // find signature that matches (datatype, datatype)\n eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar; // convert 0 to the same datatype\n\n zero = typed.convert(0, matrix._datatype);\n } // invoke callback\n\n\n var invoke = function invoke(v, x, y) {\n // invoke callback\n v = callback(v, x, y); // check value != 0\n\n if (!eq(v, zero)) {\n // store value\n values.push(v); // index\n\n index.push(x);\n }\n }; // loop columns\n\n\n for (var j = minColumn; j <= maxColumn; j++) {\n // store pointer to values index\n ptr.push(values.length); // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n\n var k0 = matrix._ptr[j];\n var k1 = matrix._ptr[j + 1];\n\n if (skipZeros) {\n // loop k within [k0, k1[\n for (var k = k0; k < k1; k++) {\n // row index\n var i = matrix._index[k]; // check i is in range\n\n if (i >= minRow && i <= maxRow) {\n // value @ k\n invoke(matrix._values[k], i - minRow, j - minColumn);\n }\n }\n } else {\n // create a cache holding all defined values\n var _values = {};\n\n for (var _k = k0; _k < k1; _k++) {\n var _i4 = matrix._index[_k];\n _values[_i4] = matrix._values[_k];\n } // loop over all rows (indexes can be unordered so we can't use that),\n // and either read the value or zero\n\n\n for (var _i5 = minRow; _i5 <= maxRow; _i5++) {\n var value = _i5 in _values ? _values[_i5] : 0;\n invoke(value, _i5 - minRow, j - minColumn);\n }\n }\n } // store number of values in ptr\n\n\n ptr.push(values.length); // return sparse matrix\n\n return new SparseMatrix({\n values: values,\n index: index,\n ptr: ptr,\n size: [maxRow - minRow + 1, maxColumn - minColumn + 1]\n });\n }\n /**\n * Execute a callback function on each entry of the matrix.\n * @memberof SparseMatrix\n * @param {Function} callback The callback function is invoked with three\n * parameters: the value of the element, the index\n * of the element, and the Matrix being traversed.\n * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n * If false, the indices are guaranteed to be in order,\n * if true, the indices can be unordered.\n */\n\n\n SparseMatrix.prototype.forEach = function (callback, skipZeros) {\n // check it is a pattern matrix\n if (!this._values) {\n throw new Error('Cannot invoke forEach on a Pattern only matrix');\n } // matrix instance\n\n\n var me = this; // rows and columns\n\n var rows = this._size[0];\n var columns = this._size[1]; // loop columns\n\n for (var j = 0; j < columns; j++) {\n // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n var k0 = this._ptr[j];\n var k1 = this._ptr[j + 1];\n\n if (skipZeros) {\n // loop k within [k0, k1[\n for (var k = k0; k < k1; k++) {\n // row index\n var i = this._index[k]; // value @ k\n\n callback(this._values[k], [i, j], me);\n }\n } else {\n // create a cache holding all defined values\n var values = {};\n\n for (var _k2 = k0; _k2 < k1; _k2++) {\n var _i6 = this._index[_k2];\n values[_i6] = this._values[_k2];\n } // loop over all rows (indexes can be unordered so we can't use that),\n // and either read the value or zero\n\n\n for (var _i7 = 0; _i7 < rows; _i7++) {\n var value = _i7 in values ? values[_i7] : 0;\n callback(value, [_i7, j], me);\n }\n }\n }\n };\n /**\n * Iterate over the matrix elements, skipping zeros\n * @return {Iterable<{ value, index: number[] }>}\n */\n\n\n SparseMatrix.prototype[Symbol.iterator] = function* () {\n if (!this._values) {\n throw new Error('Cannot iterate a Pattern only matrix');\n }\n\n var columns = this._size[1];\n\n for (var j = 0; j < columns; j++) {\n var k0 = this._ptr[j];\n var k1 = this._ptr[j + 1];\n\n for (var k = k0; k < k1; k++) {\n // row index\n var i = this._index[k];\n yield {\n value: this._values[k],\n index: [i, j]\n };\n }\n }\n };\n /**\n * Create an Array with a copy of the data of the SparseMatrix\n * @memberof SparseMatrix\n * @returns {Array} array\n */\n\n\n SparseMatrix.prototype.toArray = function () {\n return _toArray(this._values, this._index, this._ptr, this._size, true);\n };\n /**\n * Get the primitive value of the SparseMatrix: a two dimensions array\n * @memberof SparseMatrix\n * @returns {Array} array\n */\n\n\n SparseMatrix.prototype.valueOf = function () {\n return _toArray(this._values, this._index, this._ptr, this._size, false);\n };\n\n function _toArray(values, index, ptr, size, copy) {\n // rows and columns\n var rows = size[0];\n var columns = size[1]; // result\n\n var a = []; // vars\n\n var i, j; // initialize array\n\n for (i = 0; i < rows; i++) {\n a[i] = [];\n\n for (j = 0; j < columns; j++) {\n a[i][j] = 0;\n }\n } // loop columns\n\n\n for (j = 0; j < columns; j++) {\n // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n var k0 = ptr[j];\n var k1 = ptr[j + 1]; // loop k within [k0, k1[\n\n for (var k = k0; k < k1; k++) {\n // row index\n i = index[k]; // set value (use one for pattern matrix)\n\n a[i][j] = values ? copy ? clone(values[k]) : values[k] : 1;\n }\n }\n\n return a;\n }\n /**\n * Get a string representation of the matrix, with optional formatting options.\n * @memberof SparseMatrix\n * @param {Object | number | Function} [options] Formatting options. See\n * lib/utils/number:format for a\n * description of the available\n * options.\n * @returns {string} str\n */\n\n\n SparseMatrix.prototype.format = function (options) {\n // rows and columns\n var rows = this._size[0];\n var columns = this._size[1]; // density\n\n var density = this.density(); // rows & columns\n\n var str = 'Sparse Matrix [' + format(rows, options) + ' x ' + format(columns, options) + '] density: ' + format(density, options) + '\\n'; // loop columns\n\n for (var j = 0; j < columns; j++) {\n // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n var k0 = this._ptr[j];\n var k1 = this._ptr[j + 1]; // loop k within [k0, k1[\n\n for (var k = k0; k < k1; k++) {\n // row index\n var i = this._index[k]; // append value\n\n str += '\\n (' + format(i, options) + ', ' + format(j, options) + ') ==> ' + (this._values ? format(this._values[k], options) : 'X');\n }\n }\n\n return str;\n };\n /**\n * Get a string representation of the matrix\n * @memberof SparseMatrix\n * @returns {string} str\n */\n\n\n SparseMatrix.prototype.toString = function () {\n return format(this.toArray());\n };\n /**\n * Get a JSON representation of the matrix\n * @memberof SparseMatrix\n * @returns {Object}\n */\n\n\n SparseMatrix.prototype.toJSON = function () {\n return {\n mathjs: 'SparseMatrix',\n values: this._values,\n index: this._index,\n ptr: this._ptr,\n size: this._size,\n datatype: this._datatype\n };\n };\n /**\n * Get the kth Matrix diagonal.\n *\n * @memberof SparseMatrix\n * @param {number | BigNumber} [k=0] The kth diagonal where the vector will retrieved.\n *\n * @returns {Matrix} The matrix vector with the diagonal values.\n */\n\n\n SparseMatrix.prototype.diagonal = function (k) {\n // validate k if any\n if (k) {\n // convert BigNumber to a number\n if (isBigNumber(k)) {\n k = k.toNumber();\n } // is must be an integer\n\n\n if (!isNumber(k) || !isInteger(k)) {\n throw new TypeError('The parameter k must be an integer number');\n }\n } else {\n // default value\n k = 0;\n }\n\n var kSuper = k > 0 ? k : 0;\n var kSub = k < 0 ? -k : 0; // rows & columns\n\n var rows = this._size[0];\n var columns = this._size[1]; // number diagonal values\n\n var n = Math.min(rows - kSub, columns - kSuper); // diagonal arrays\n\n var values = [];\n var index = [];\n var ptr = []; // initial ptr value\n\n ptr[0] = 0; // loop columns\n\n for (var j = kSuper; j < columns && values.length < n; j++) {\n // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n var k0 = this._ptr[j];\n var k1 = this._ptr[j + 1]; // loop x within [k0, k1[\n\n for (var x = k0; x < k1; x++) {\n // row index\n var i = this._index[x]; // check row\n\n if (i === j - kSuper + kSub) {\n // value on this column\n values.push(this._values[x]); // store row\n\n index[values.length - 1] = i - kSub; // exit loop\n\n break;\n }\n }\n } // close ptr\n\n\n ptr.push(values.length); // return matrix\n\n return new SparseMatrix({\n values: values,\n index: index,\n ptr: ptr,\n size: [n, 1]\n });\n };\n /**\n * Generate a matrix from a JSON object\n * @memberof SparseMatrix\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"SparseMatrix\", \"values\": [], \"index\": [], \"ptr\": [], \"size\": []}`,\n * where mathjs is optional\n * @returns {SparseMatrix}\n */\n\n\n SparseMatrix.fromJSON = function (json) {\n return new SparseMatrix(json);\n };\n /**\n * Create a diagonal matrix.\n *\n * @memberof SparseMatrix\n * @param {Array} size The matrix size.\n * @param {number | Array | Matrix } value The values for the diagonal.\n * @param {number | BigNumber} [k=0] The kth diagonal where the vector will be filled in.\n * @param {number} [defaultValue] The default value for non-diagonal\n * @param {string} [datatype] The Matrix datatype, values must be of this datatype.\n *\n * @returns {SparseMatrix}\n */\n\n\n SparseMatrix.diagonal = function (size, value, k, defaultValue, datatype) {\n if (!isArray(size)) {\n throw new TypeError('Array expected, size parameter');\n }\n\n if (size.length !== 2) {\n throw new Error('Only two dimensions matrix are supported');\n } // map size & validate\n\n\n size = size.map(function (s) {\n // check it is a big number\n if (isBigNumber(s)) {\n // convert it\n s = s.toNumber();\n } // validate arguments\n\n\n if (!isNumber(s) || !isInteger(s) || s < 1) {\n throw new Error('Size values must be positive integers');\n }\n\n return s;\n }); // validate k if any\n\n if (k) {\n // convert BigNumber to a number\n if (isBigNumber(k)) {\n k = k.toNumber();\n } // is must be an integer\n\n\n if (!isNumber(k) || !isInteger(k)) {\n throw new TypeError('The parameter k must be an integer number');\n }\n } else {\n // default value\n k = 0;\n } // equal signature to use\n\n\n var eq = equalScalar; // zero value\n\n var zero = 0;\n\n if (isString(datatype)) {\n // find signature that matches (datatype, datatype)\n eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar; // convert 0 to the same datatype\n\n zero = typed.convert(0, datatype);\n }\n\n var kSuper = k > 0 ? k : 0;\n var kSub = k < 0 ? -k : 0; // rows and columns\n\n var rows = size[0];\n var columns = size[1]; // number of non-zero items\n\n var n = Math.min(rows - kSub, columns - kSuper); // value extraction function\n\n var _value; // check value\n\n\n if (isArray(value)) {\n // validate array\n if (value.length !== n) {\n // number of values in array must be n\n throw new Error('Invalid value array length');\n } // define function\n\n\n _value = function _value(i) {\n // return value @ i\n return value[i];\n };\n } else if (isMatrix(value)) {\n // matrix size\n var ms = value.size(); // validate matrix\n\n if (ms.length !== 1 || ms[0] !== n) {\n // number of values in array must be n\n throw new Error('Invalid matrix length');\n } // define function\n\n\n _value = function _value(i) {\n // return value @ i\n return value.get([i]);\n };\n } else {\n // define function\n _value = function _value() {\n // return value\n return value;\n };\n } // create arrays\n\n\n var values = [];\n var index = [];\n var ptr = []; // loop items\n\n for (var j = 0; j < columns; j++) {\n // number of rows with value\n ptr.push(values.length); // diagonal index\n\n var i = j - kSuper; // check we need to set diagonal value\n\n if (i >= 0 && i < n) {\n // get value @ i\n var v = _value(i); // check for zero\n\n\n if (!eq(v, zero)) {\n // column\n index.push(i + kSub); // add value\n\n values.push(v);\n }\n }\n } // last value should be number of values\n\n\n ptr.push(values.length); // create SparseMatrix\n\n return new SparseMatrix({\n values: values,\n index: index,\n ptr: ptr,\n size: [rows, columns]\n });\n };\n /**\n * Swap rows i and j in Matrix.\n *\n * @memberof SparseMatrix\n * @param {number} i Matrix row index 1\n * @param {number} j Matrix row index 2\n *\n * @return {Matrix} The matrix reference\n */\n\n\n SparseMatrix.prototype.swapRows = function (i, j) {\n // check index\n if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) {\n throw new Error('Row index must be positive integers');\n } // check dimensions\n\n\n if (this._size.length !== 2) {\n throw new Error('Only two dimensional matrix is supported');\n } // validate index\n\n\n validateIndex(i, this._size[0]);\n validateIndex(j, this._size[0]); // swap rows\n\n SparseMatrix._swapRows(i, j, this._size[1], this._values, this._index, this._ptr); // return current instance\n\n\n return this;\n };\n /**\n * Loop rows with data in column j.\n *\n * @param {number} j Column\n * @param {Array} values Matrix values\n * @param {Array} index Matrix row indeces\n * @param {Array} ptr Matrix column pointers\n * @param {Function} callback Callback function invoked for every row in column j\n */\n\n\n SparseMatrix._forEachRow = function (j, values, index, ptr, callback) {\n // indeces for column j\n var k0 = ptr[j];\n var k1 = ptr[j + 1]; // loop\n\n for (var k = k0; k < k1; k++) {\n // invoke callback\n callback(index[k], values[k]);\n }\n };\n /**\n * Swap rows x and y in Sparse Matrix data structures.\n *\n * @param {number} x Matrix row index 1\n * @param {number} y Matrix row index 2\n * @param {number} columns Number of columns in matrix\n * @param {Array} values Matrix values\n * @param {Array} index Matrix row indeces\n * @param {Array} ptr Matrix column pointers\n */\n\n\n SparseMatrix._swapRows = function (x, y, columns, values, index, ptr) {\n // loop columns\n for (var j = 0; j < columns; j++) {\n // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n var k0 = ptr[j];\n var k1 = ptr[j + 1]; // find value index @ x\n\n var kx = _getValueIndex(x, k0, k1, index); // find value index @ x\n\n\n var ky = _getValueIndex(y, k0, k1, index); // check both rows exist in matrix\n\n\n if (kx < k1 && ky < k1 && index[kx] === x && index[ky] === y) {\n // swap values (check for pattern matrix)\n if (values) {\n var v = values[kx];\n values[kx] = values[ky];\n values[ky] = v;\n } // next column\n\n\n continue;\n } // check x row exist & no y row\n\n\n if (kx < k1 && index[kx] === x && (ky >= k1 || index[ky] !== y)) {\n // value @ x (check for pattern matrix)\n var vx = values ? values[kx] : undefined; // insert value @ y\n\n index.splice(ky, 0, y);\n\n if (values) {\n values.splice(ky, 0, vx);\n } // remove value @ x (adjust array index if needed)\n\n\n index.splice(ky <= kx ? kx + 1 : kx, 1);\n\n if (values) {\n values.splice(ky <= kx ? kx + 1 : kx, 1);\n } // next column\n\n\n continue;\n } // check y row exist & no x row\n\n\n if (ky < k1 && index[ky] === y && (kx >= k1 || index[kx] !== x)) {\n // value @ y (check for pattern matrix)\n var vy = values ? values[ky] : undefined; // insert value @ x\n\n index.splice(kx, 0, x);\n\n if (values) {\n values.splice(kx, 0, vy);\n } // remove value @ y (adjust array index if needed)\n\n\n index.splice(kx <= ky ? ky + 1 : ky, 1);\n\n if (values) {\n values.splice(kx <= ky ? ky + 1 : ky, 1);\n }\n }\n }\n };\n\n return SparseMatrix;\n}, {\n isClass: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { MatrixDependencies } from './dependenciesMatrixClass.generated.js';\nimport { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createSparseMatrixClass } from '../../factoriesAny.js';\nexport var SparseMatrixDependencies = {\n MatrixDependencies,\n equalScalarDependencies,\n typedDependencies,\n createSparseMatrixClass\n};","import { factory } from '../../../utils/factory.js';\nvar name = 'matrix';\nvar dependencies = ['typed', 'Matrix', 'DenseMatrix', 'SparseMatrix'];\nexport var createMatrix = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n Matrix,\n DenseMatrix,\n SparseMatrix\n } = _ref;\n\n /**\n * Create a Matrix. The function creates a new `math.Matrix` object from\n * an `Array`. A Matrix has utility functions to manipulate the data in the\n * matrix, like getting the size and getting or setting values in the matrix.\n * Supported storage formats are 'dense' and 'sparse'.\n *\n * Syntax:\n *\n * math.matrix() // creates an empty matrix using default storage format (dense).\n * math.matrix(data) // creates a matrix with initial data using default storage format (dense).\n * math.matrix('dense') // creates an empty matrix using the given storage format.\n * math.matrix(data, 'dense') // creates a matrix with initial data using the given storage format.\n * math.matrix(data, 'sparse') // creates a sparse matrix with initial data.\n * math.matrix(data, 'sparse', 'number') // creates a sparse matrix with initial data, number data type.\n *\n * Examples:\n *\n * let m = math.matrix([[1, 2], [3, 4]])\n * m.size() // Array [2, 2]\n * m.resize([3, 2], 5)\n * m.valueOf() // Array [[1, 2], [3, 4], [5, 5]]\n * m.get([1, 0]) // number 3\n *\n * See also:\n *\n * bignumber, boolean, complex, index, number, string, unit, sparse\n *\n * @param {Array | Matrix} [data] A multi dimensional array\n * @param {string} [format] The Matrix storage format, either `'dense'` or `'sparse'`\n * @param {string} [datatype] Type of the values\n *\n * @return {Matrix} The created matrix\n */\n return typed(name, {\n '': function _() {\n return _create([]);\n },\n string: function string(format) {\n return _create([], format);\n },\n 'string, string': function stringString(format, datatype) {\n return _create([], format, datatype);\n },\n Array: function Array(data) {\n return _create(data);\n },\n Matrix: function Matrix(data) {\n return _create(data, data.storage());\n },\n 'Array | Matrix, string': _create,\n 'Array | Matrix, string, string': _create\n });\n /**\n * Create a new Matrix with given storage format\n * @param {Array} data\n * @param {string} [format]\n * @param {string} [datatype]\n * @returns {Matrix} Returns a new Matrix\n * @private\n */\n\n function _create(data, format, datatype) {\n // get storage format constructor\n if (format === 'dense' || format === 'default' || format === undefined) {\n return new DenseMatrix(data, datatype);\n }\n\n if (format === 'sparse') {\n return new SparseMatrix(data, datatype);\n }\n\n throw new TypeError('Unknown matrix type ' + JSON.stringify(format) + '.');\n }\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';\nimport { MatrixDependencies } from './dependenciesMatrixClass.generated.js';\nimport { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createMatrix } from '../../factoriesAny.js';\nexport var matrixDependencies = {\n DenseMatrixDependencies,\n MatrixDependencies,\n SparseMatrixDependencies,\n typedDependencies,\n createMatrix\n};","import { isIndex } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { validateIndex } from '../../utils/array.js';\nimport { getSafeProperty, setSafeProperty } from '../../utils/customs.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'subset';\nvar dependencies = ['typed', 'matrix'];\nexport var createSubset = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n matrix\n } = _ref;\n\n /**\n * Get or set a subset of a matrix or string.\n *\n * Syntax:\n * math.subset(value, index) // retrieve a subset\n * math.subset(value, index, replacement [, defaultValue]) // replace a subset\n *\n * Examples:\n *\n * // get a subset\n * const d = [[1, 2], [3, 4]]\n * math.subset(d, math.index(1, 0)) // returns 3\n * math.subset(d, math.index([0, 1], 1)) // returns [[2], [4]]\n *\n * // replace a subset\n * const e = []\n * const f = math.subset(e, math.index(0, [0, 2]), [5, 6]) // f = [[5, 6]]\n * const g = math.subset(f, math.index(1, 1), 7, 0) // g = [[5, 6], [0, 7]]\n *\n * See also:\n *\n * size, resize, squeeze, index\n *\n * @param {Array | Matrix | string} matrix An array, matrix, or string\n * @param {Index} index An index containing ranges for each\n * dimension\n * @param {*} [replacement] An array, matrix, or scalar.\n * If provided, the subset is replaced with replacement.\n * If not provided, the subset is returned\n * @param {*} [defaultValue=undefined] Default value, filled in on new entries when\n * the matrix is resized. If not provided,\n * math.matrix elements will be left undefined.\n * @return {Array | Matrix | string} Either the retrieved subset or the updated matrix.\n */\n return typed(name, {\n // get subset\n 'Array, Index': function ArrayIndex(value, index) {\n var m = matrix(value);\n var subset = m.subset(index); // returns a Matrix\n\n return index.isScalar() ? subset : subset.valueOf(); // return an Array (like the input)\n },\n 'Matrix, Index': function MatrixIndex(value, index) {\n return value.subset(index);\n },\n 'Object, Index': _getObjectProperty,\n 'string, Index': _getSubstring,\n // set subset\n 'Array, Index, any': function ArrayIndexAny(value, index, replacement) {\n return matrix(clone(value)).subset(index, replacement, undefined).valueOf();\n },\n 'Array, Index, any, any': function ArrayIndexAnyAny(value, index, replacement, defaultValue) {\n return matrix(clone(value)).subset(index, replacement, defaultValue).valueOf();\n },\n 'Matrix, Index, any': function MatrixIndexAny(value, index, replacement) {\n return value.clone().subset(index, replacement);\n },\n 'Matrix, Index, any, any': function MatrixIndexAnyAny(value, index, replacement, defaultValue) {\n return value.clone().subset(index, replacement, defaultValue);\n },\n 'string, Index, string': _setSubstring,\n 'string, Index, string, string': _setSubstring,\n 'Object, Index, any': _setObjectProperty\n });\n});\n/**\n * Retrieve a subset of a string\n * @param {string} str string from which to get a substring\n * @param {Index} index An index containing ranges for each dimension\n * @returns {string} substring\n * @private\n */\n\nfunction _getSubstring(str, index) {\n if (!isIndex(index)) {\n // TODO: better error message\n throw new TypeError('Index expected');\n }\n\n if (index.size().length !== 1) {\n throw new DimensionError(index.size().length, 1);\n } // validate whether the range is out of range\n\n\n var strLen = str.length;\n validateIndex(index.min()[0], strLen);\n validateIndex(index.max()[0], strLen);\n var range = index.dimension(0);\n var substr = '';\n range.forEach(function (v) {\n substr += str.charAt(v);\n });\n return substr;\n}\n/**\n * Replace a substring in a string\n * @param {string} str string to be replaced\n * @param {Index} index An index containing ranges for each dimension\n * @param {string} replacement Replacement string\n * @param {string} [defaultValue] Default value to be uses when resizing\n * the string. is ' ' by default\n * @returns {string} result\n * @private\n */\n\n\nfunction _setSubstring(str, index, replacement, defaultValue) {\n if (!index || index.isIndex !== true) {\n // TODO: better error message\n throw new TypeError('Index expected');\n }\n\n if (index.size().length !== 1) {\n throw new DimensionError(index.size().length, 1);\n }\n\n if (defaultValue !== undefined) {\n if (typeof defaultValue !== 'string' || defaultValue.length !== 1) {\n throw new TypeError('Single character expected as defaultValue');\n }\n } else {\n defaultValue = ' ';\n }\n\n var range = index.dimension(0);\n var len = range.size()[0];\n\n if (len !== replacement.length) {\n throw new DimensionError(range.size()[0], replacement.length);\n } // validate whether the range is out of range\n\n\n var strLen = str.length;\n validateIndex(index.min()[0]);\n validateIndex(index.max()[0]); // copy the string into an array with characters\n\n var chars = [];\n\n for (var i = 0; i < strLen; i++) {\n chars[i] = str.charAt(i);\n }\n\n range.forEach(function (v, i) {\n chars[v] = replacement.charAt(i[0]);\n }); // initialize undefined characters with a space\n\n if (chars.length > strLen) {\n for (var _i = strLen - 1, _len = chars.length; _i < _len; _i++) {\n if (!chars[_i]) {\n chars[_i] = defaultValue;\n }\n }\n }\n\n return chars.join('');\n}\n/**\n * Retrieve a property from an object\n * @param {Object} object\n * @param {Index} index\n * @return {*} Returns the value of the property\n * @private\n */\n\n\nfunction _getObjectProperty(object, index) {\n if (index.size().length !== 1) {\n throw new DimensionError(index.size(), 1);\n }\n\n var key = index.dimension(0);\n\n if (typeof key !== 'string') {\n throw new TypeError('String expected as index to retrieve an object property');\n }\n\n return getSafeProperty(object, key);\n}\n/**\n * Set a property on an object\n * @param {Object} object\n * @param {Index} index\n * @param {*} replacement\n * @return {*} Returns the updated object\n * @private\n */\n\n\nfunction _setObjectProperty(object, index, replacement) {\n if (index.size().length !== 1) {\n throw new DimensionError(index.size(), 1);\n }\n\n var key = index.dimension(0);\n\n if (typeof key !== 'string') {\n throw new TypeError('String expected as index to retrieve an object property');\n } // clone the object, and apply the property to the clone\n\n\n var updated = clone(object);\n setSafeProperty(updated, key, replacement);\n return updated;\n}","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createSubset } from '../../factoriesAny.js';\nexport var subsetDependencies = {\n matrixDependencies,\n typedDependencies,\n createSubset\n};","import { IndexError } from '../../../error/IndexError.js';\n/**\n * Transform zero-based indices to one-based indices in errors\n * @param {Error} err\n * @returns {Error | IndexError} Returns the transformed error\n */\n\nexport function errorTransform(err) {\n if (err && err.isIndexError) {\n return new IndexError(err.index + 1, err.min + 1, err.max !== undefined ? err.max + 1 : undefined);\n }\n\n return err;\n}","import { errorTransform } from '../../transform/utils/errorTransform.js';\nimport { getSafeProperty } from '../../../utils/customs.js';\nexport function accessFactory(_ref) {\n var {\n subset\n } = _ref;\n\n /**\n * Retrieve part of an object:\n *\n * - Retrieve a property from an object\n * - Retrieve a part of a string\n * - Retrieve a matrix subset\n *\n * @param {Object | Array | Matrix | string} object\n * @param {Index} index\n * @return {Object | Array | Matrix | string} Returns the subset\n */\n return function access(object, index) {\n try {\n if (Array.isArray(object)) {\n return subset(object, index);\n } else if (object && typeof object.subset === 'function') {\n // Matrix\n return object.subset(index);\n } else if (typeof object === 'string') {\n // TODO: move getStringSubset into a separate util file, use that\n return subset(object, index);\n } else if (typeof object === 'object') {\n if (!index.isObjectProperty()) {\n throw new TypeError('Cannot apply a numeric index as object property');\n }\n\n return getSafeProperty(object, index.getObjectProperty());\n } else {\n throw new TypeError('Cannot apply index: unsupported type of object');\n }\n } catch (err) {\n throw errorTransform(err);\n }\n };\n}","import { isAccessorNode, isArrayNode, isConstantNode, isFunctionNode, isIndexNode, isNode, isObjectNode, isParenthesisNode, isSymbolNode } from '../../utils/is.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { accessFactory } from './utils/access.js';\nvar name = 'AccessorNode';\nvar dependencies = ['subset', 'Node'];\nexport var createAccessorNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n subset,\n Node\n } = _ref;\n var access = accessFactory({\n subset\n });\n /**\n * @constructor AccessorNode\n * @extends {Node}\n * Access an object property or get a matrix subset\n *\n * @param {Node} object The object from which to retrieve\n * a property or subset.\n * @param {IndexNode} index IndexNode containing ranges\n */\n\n function AccessorNode(object, index) {\n if (!(this instanceof AccessorNode)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n\n if (!isNode(object)) {\n throw new TypeError('Node expected for parameter \"object\"');\n }\n\n if (!isIndexNode(index)) {\n throw new TypeError('IndexNode expected for parameter \"index\"');\n }\n\n this.object = object || null;\n this.index = index; // readonly property name\n\n Object.defineProperty(this, 'name', {\n get: function () {\n if (this.index) {\n return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';\n } else {\n return this.object.name || '';\n }\n }.bind(this),\n set: function set() {\n throw new Error('Cannot assign a new name, name is read-only');\n }\n });\n }\n\n AccessorNode.prototype = new Node();\n AccessorNode.prototype.type = 'AccessorNode';\n AccessorNode.prototype.isAccessorNode = true;\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n\n AccessorNode.prototype._compile = function (math, argNames) {\n var evalObject = this.object._compile(math, argNames);\n\n var evalIndex = this.index._compile(math, argNames);\n\n if (this.index.isObjectProperty()) {\n var prop = this.index.getObjectProperty();\n return function evalAccessorNode(scope, args, context) {\n // get a property from an object evaluated using the scope.\n return getSafeProperty(evalObject(scope, args, context), prop);\n };\n } else {\n return function evalAccessorNode(scope, args, context) {\n var object = evalObject(scope, args, context);\n var index = evalIndex(scope, args, object); // we pass object here instead of context\n\n return access(object, index);\n };\n }\n };\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n\n\n AccessorNode.prototype.forEach = function (callback) {\n callback(this.object, 'object', this);\n callback(this.index, 'index', this);\n };\n /**\n * Create a new AccessorNode having it's childs be the results of calling\n * the provided callback function for each of the childs of the original node.\n * @param {function(child: Node, path: string, parent: Node): Node} callback\n * @returns {AccessorNode} Returns a transformed copy of the node\n */\n\n\n AccessorNode.prototype.map = function (callback) {\n return new AccessorNode(this._ifNode(callback(this.object, 'object', this)), this._ifNode(callback(this.index, 'index', this)));\n };\n /**\n * Create a clone of this node, a shallow copy\n * @return {AccessorNode}\n */\n\n\n AccessorNode.prototype.clone = function () {\n return new AccessorNode(this.object, this.index);\n };\n /**\n * Get string representation\n * @param {Object} options\n * @return {string}\n */\n\n\n AccessorNode.prototype._toString = function (options) {\n var object = this.object.toString(options);\n\n if (needParenthesis(this.object)) {\n object = '(' + object + ')';\n }\n\n return object + this.index.toString(options);\n };\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string}\n */\n\n\n AccessorNode.prototype.toHTML = function (options) {\n var object = this.object.toHTML(options);\n\n if (needParenthesis(this.object)) {\n object = '(' + object + ')';\n }\n\n return object + this.index.toHTML(options);\n };\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string}\n */\n\n\n AccessorNode.prototype._toTex = function (options) {\n var object = this.object.toTex(options);\n\n if (needParenthesis(this.object)) {\n object = '\\\\left(\\' + object + \\'\\\\right)';\n }\n\n return object + this.index.toTex(options);\n };\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n\n\n AccessorNode.prototype.toJSON = function () {\n return {\n mathjs: 'AccessorNode',\n object: this.object,\n index: this.index\n };\n };\n /**\n * Instantiate an AccessorNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"AccessorNode\", object: ..., index: ...}`,\n * where mathjs is optional\n * @returns {AccessorNode}\n */\n\n\n AccessorNode.fromJSON = function (json) {\n return new AccessorNode(json.object, json.index);\n };\n /**\n * Are parenthesis needed?\n * @private\n */\n\n\n function needParenthesis(node) {\n // TODO: maybe make a method on the nodes which tells whether they need parenthesis?\n return !(isAccessorNode(node) || isArrayNode(node) || isConstantNode(node) || isFunctionNode(node) || isObjectNode(node) || isParenthesisNode(node) || isSymbolNode(node));\n }\n\n return AccessorNode;\n}, {\n isClass: true,\n isNode: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { subsetDependencies } from './dependenciesSubset.generated.js';\nimport { createAccessorNode } from '../../factoriesAny.js';\nexport var AccessorNodeDependencies = {\n NodeDependencies,\n subsetDependencies,\n createAccessorNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createArrayNode } from '../../factoriesAny.js';\nexport var ArrayNodeDependencies = {\n NodeDependencies,\n createArrayNode\n};","import { isArrayNode, isNode } from '../../utils/is.js';\nimport { map } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ArrayNode';\nvar dependencies = ['Node'];\nexport var createArrayNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n Node\n } = _ref;\n\n /**\n * @constructor ArrayNode\n * @extends {Node}\n * Holds an 1-dimensional array with items\n * @param {Node[]} [items] 1 dimensional array with items\n */\n function ArrayNode(items) {\n if (!(this instanceof ArrayNode)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n\n this.items = items || []; // validate input\n\n if (!Array.isArray(this.items) || !this.items.every(isNode)) {\n throw new TypeError('Array containing Nodes expected');\n }\n }\n\n ArrayNode.prototype = new Node();\n ArrayNode.prototype.type = 'ArrayNode';\n ArrayNode.prototype.isArrayNode = true;\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n\n ArrayNode.prototype._compile = function (math, argNames) {\n var evalItems = map(this.items, function (item) {\n return item._compile(math, argNames);\n });\n var asMatrix = math.config.matrix !== 'Array';\n\n if (asMatrix) {\n var matrix = math.matrix;\n return function evalArrayNode(scope, args, context) {\n return matrix(map(evalItems, function (evalItem) {\n return evalItem(scope, args, context);\n }));\n };\n } else {\n return function evalArrayNode(scope, args, context) {\n return map(evalItems, function (evalItem) {\n return evalItem(scope, args, context);\n });\n };\n }\n };\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n\n\n ArrayNode.prototype.forEach = function (callback) {\n for (var i = 0; i < this.items.length; i++) {\n var node = this.items[i];\n callback(node, 'items[' + i + ']', this);\n }\n };\n /**\n * Create a new ArrayNode having it's childs be the results of calling\n * the provided callback function for each of the childs of the original node.\n * @param {function(child: Node, path: string, parent: Node): Node} callback\n * @returns {ArrayNode} Returns a transformed copy of the node\n */\n\n\n ArrayNode.prototype.map = function (callback) {\n var items = [];\n\n for (var i = 0; i < this.items.length; i++) {\n items[i] = this._ifNode(callback(this.items[i], 'items[' + i + ']', this));\n }\n\n return new ArrayNode(items);\n };\n /**\n * Create a clone of this node, a shallow copy\n * @return {ArrayNode}\n */\n\n\n ArrayNode.prototype.clone = function () {\n return new ArrayNode(this.items.slice(0));\n };\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n\n\n ArrayNode.prototype._toString = function (options) {\n var items = this.items.map(function (node) {\n return node.toString(options);\n });\n return '[' + items.join(', ') + ']';\n };\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n\n\n ArrayNode.prototype.toJSON = function () {\n return {\n mathjs: 'ArrayNode',\n items: this.items\n };\n };\n /**\n * Instantiate an ArrayNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"ArrayNode\", items: [...]}`,\n * where mathjs is optional\n * @returns {ArrayNode}\n */\n\n\n ArrayNode.fromJSON = function (json) {\n return new ArrayNode(json.items);\n };\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n\n\n ArrayNode.prototype.toHTML = function (options) {\n var items = this.items.map(function (node) {\n return node.toHTML(options);\n });\n return '[' + items.join(',') + ']';\n };\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n ArrayNode.prototype._toTex = function (options) {\n function itemsToTex(items, nested) {\n var mixedItems = items.some(isArrayNode) && !items.every(isArrayNode);\n var itemsFormRow = nested || mixedItems;\n var itemSep = itemsFormRow ? '&' : '\\\\\\\\';\n var itemsTex = items.map(function (node) {\n if (node.items) {\n return itemsToTex(node.items, !nested);\n } else {\n return node.toTex(options);\n }\n }).join(itemSep);\n return mixedItems || !itemsFormRow || itemsFormRow && !nested ? '\\\\begin{bmatrix}' + itemsTex + '\\\\end{bmatrix}' : itemsTex;\n }\n\n return itemsToTex(this.items, false);\n };\n\n return ArrayNode;\n}, {\n isClass: true,\n isNode: true\n});","// list of identifiers of nodes in order of their precedence\n// also contains information about left/right associativity\n// and which other operator the operator is associative with\n// Example:\n// addition is associative with addition and subtraction, because:\n// (a+b)+c=a+(b+c)\n// (a+b)-c=a+(b-c)\n//\n// postfix operators are left associative, prefix operators\n// are right associative\n//\n// It's also possible to set the following properties:\n// latexParens: if set to false, this node doesn't need to be enclosed\n// in parentheses when using LaTeX\n// latexLeftParens: if set to false, this !OperatorNode's!\n// left argument doesn't need to be enclosed\n// in parentheses\n// latexRightParens: the same for the right argument\nimport { hasOwnProperty } from '../utils/object.js';\nexport var properties = [{\n // assignment\n AssignmentNode: {},\n FunctionAssignmentNode: {}\n}, {\n // conditional expression\n ConditionalNode: {\n latexLeftParens: false,\n latexRightParens: false,\n latexParens: false // conditionals don't need parentheses in LaTeX because\n // they are 2 dimensional\n\n }\n}, {\n // logical or\n 'OperatorNode:or': {\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // logical xor\n 'OperatorNode:xor': {\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // logical and\n 'OperatorNode:and': {\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // bitwise or\n 'OperatorNode:bitOr': {\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // bitwise xor\n 'OperatorNode:bitXor': {\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // bitwise and\n 'OperatorNode:bitAnd': {\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // relational operators\n 'OperatorNode:equal': {\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:unequal': {\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:smaller': {\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:larger': {\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:smallerEq': {\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:largerEq': {\n associativity: 'left',\n associativeWith: []\n },\n RelationalNode: {\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // bitshift operators\n 'OperatorNode:leftShift': {\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:rightArithShift': {\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:rightLogShift': {\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // unit conversion\n 'OperatorNode:to': {\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // range\n RangeNode: {}\n}, {\n // addition, subtraction\n 'OperatorNode:add': {\n associativity: 'left',\n associativeWith: ['OperatorNode:add', 'OperatorNode:subtract']\n },\n 'OperatorNode:subtract': {\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // multiply, divide, modulus\n 'OperatorNode:multiply': {\n associativity: 'left',\n associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']\n },\n 'OperatorNode:divide': {\n associativity: 'left',\n associativeWith: [],\n latexLeftParens: false,\n latexRightParens: false,\n latexParens: false // fractions don't require parentheses because\n // they're 2 dimensional, so parens aren't needed\n // in LaTeX\n\n },\n 'OperatorNode:dotMultiply': {\n associativity: 'left',\n associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'OperatorNode:dotMultiply', 'OperatorNode:doDivide']\n },\n 'OperatorNode:dotDivide': {\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:mod': {\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // unary prefix operators\n 'OperatorNode:unaryPlus': {\n associativity: 'right'\n },\n 'OperatorNode:unaryMinus': {\n associativity: 'right'\n },\n 'OperatorNode:bitNot': {\n associativity: 'right'\n },\n 'OperatorNode:not': {\n associativity: 'right'\n }\n}, {\n // exponentiation\n 'OperatorNode:pow': {\n associativity: 'right',\n associativeWith: [],\n latexRightParens: false // the exponent doesn't need parentheses in\n // LaTeX because it's 2 dimensional\n // (it's on top)\n\n },\n 'OperatorNode:dotPow': {\n associativity: 'right',\n associativeWith: []\n }\n}, {\n // factorial\n 'OperatorNode:factorial': {\n associativity: 'left'\n }\n}, {\n // matrix transpose\n 'OperatorNode:transpose': {\n associativity: 'left'\n }\n}];\n/**\n * Get the precedence of a Node.\n * Higher number for higher precedence, starting with 0.\n * Returns null if the precedence is undefined.\n *\n * @param {Node} _node\n * @param {string} parenthesis\n * @return {number | null}\n */\n\nexport function getPrecedence(_node, parenthesis) {\n var node = _node;\n\n if (parenthesis !== 'keep') {\n // ParenthesisNodes are only ignored when not in 'keep' mode\n node = _node.getContent();\n }\n\n var identifier = node.getIdentifier();\n\n for (var i = 0; i < properties.length; i++) {\n if (identifier in properties[i]) {\n return i;\n }\n }\n\n return null;\n}\n/**\n * Get the associativity of an operator (left or right).\n * Returns a string containing 'left' or 'right' or null if\n * the associativity is not defined.\n *\n * @param {Node} _node\n * @param {string} parenthesis\n * @return {string|null}\n * @throws {Error}\n */\n\nexport function getAssociativity(_node, parenthesis) {\n var node = _node;\n\n if (parenthesis !== 'keep') {\n // ParenthesisNodes are only ignored when not in 'keep' mode\n node = _node.getContent();\n }\n\n var identifier = node.getIdentifier();\n var index = getPrecedence(node, parenthesis);\n\n if (index === null) {\n // node isn't in the list\n return null;\n }\n\n var property = properties[index][identifier];\n\n if (hasOwnProperty(property, 'associativity')) {\n if (property.associativity === 'left') {\n return 'left';\n }\n\n if (property.associativity === 'right') {\n return 'right';\n } // associativity is invalid\n\n\n throw Error('\\'' + identifier + '\\' has the invalid associativity \\'' + property.associativity + '\\'.');\n } // associativity is undefined\n\n\n return null;\n}\n/**\n * Check if an operator is associative with another operator.\n * Returns either true or false or null if not defined.\n *\n * @param {Node} nodeA\n * @param {Node} nodeB\n * @param {string} parenthesis\n * @return {boolean | null}\n */\n\nexport function isAssociativeWith(nodeA, nodeB, parenthesis) {\n // ParenthesisNodes are only ignored when not in 'keep' mode\n var a = parenthesis !== 'keep' ? nodeA.getContent() : nodeA;\n var b = parenthesis !== 'keep' ? nodeA.getContent() : nodeB;\n var identifierA = a.getIdentifier();\n var identifierB = b.getIdentifier();\n var index = getPrecedence(a, parenthesis);\n\n if (index === null) {\n // node isn't in the list\n return null;\n }\n\n var property = properties[index][identifierA];\n\n if (hasOwnProperty(property, 'associativeWith') && property.associativeWith instanceof Array) {\n for (var i = 0; i < property.associativeWith.length; i++) {\n if (property.associativeWith[i] === identifierB) {\n return true;\n }\n }\n\n return false;\n } // associativeWith is not defined\n\n\n return null;\n}","import { isAccessorNode, isIndexNode, isNode, isSymbolNode } from '../../utils/is.js';\nimport { getSafeProperty, setSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { accessFactory } from './utils/access.js';\nimport { assignFactory } from './utils/assign.js';\nimport { getPrecedence } from '../operators.js';\nvar name = 'AssignmentNode';\nvar dependencies = ['subset', '?matrix', // FIXME: should not be needed at all, should be handled by subset\n'Node'];\nexport var createAssignmentNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n subset,\n matrix,\n Node\n } = _ref;\n var access = accessFactory({\n subset\n });\n var assign = assignFactory({\n subset,\n matrix\n });\n /**\n * @constructor AssignmentNode\n * @extends {Node}\n *\n * Define a symbol, like `a=3.2`, update a property like `a.b=3.2`, or\n * replace a subset of a matrix like `A[2,2]=42`.\n *\n * Syntax:\n *\n * new AssignmentNode(symbol, value)\n * new AssignmentNode(object, index, value)\n *\n * Usage:\n *\n * new AssignmentNode(new SymbolNode('a'), new ConstantNode(2)) // a=2\n * new AssignmentNode(new SymbolNode('a'), new IndexNode('b'), new ConstantNode(2)) // a.b=2\n * new AssignmentNode(new SymbolNode('a'), new IndexNode(1, 2), new ConstantNode(3)) // a[1,2]=3\n *\n * @param {SymbolNode | AccessorNode} object Object on which to assign a value\n * @param {IndexNode} [index=null] Index, property name or matrix\n * index. Optional. If not provided\n * and `object` is a SymbolNode,\n * the property is assigned to the\n * global scope.\n * @param {Node} value The value to be assigned\n */\n\n function AssignmentNode(object, index, value) {\n if (!(this instanceof AssignmentNode)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n\n this.object = object;\n this.index = value ? index : null;\n this.value = value || index; // validate input\n\n if (!isSymbolNode(object) && !isAccessorNode(object)) {\n throw new TypeError('SymbolNode or AccessorNode expected as \"object\"');\n }\n\n if (isSymbolNode(object) && object.name === 'end') {\n throw new Error('Cannot assign to symbol \"end\"');\n }\n\n if (this.index && !isIndexNode(this.index)) {\n // index is optional\n throw new TypeError('IndexNode expected as \"index\"');\n }\n\n if (!isNode(this.value)) {\n throw new TypeError('Node expected as \"value\"');\n } // readonly property name\n\n\n Object.defineProperty(this, 'name', {\n get: function () {\n if (this.index) {\n return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';\n } else {\n return this.object.name || '';\n }\n }.bind(this),\n set: function set() {\n throw new Error('Cannot assign a new name, name is read-only');\n }\n });\n }\n\n AssignmentNode.prototype = new Node();\n AssignmentNode.prototype.type = 'AssignmentNode';\n AssignmentNode.prototype.isAssignmentNode = true;\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n\n AssignmentNode.prototype._compile = function (math, argNames) {\n var evalObject = this.object._compile(math, argNames);\n\n var evalIndex = this.index ? this.index._compile(math, argNames) : null;\n\n var evalValue = this.value._compile(math, argNames);\n\n var name = this.object.name;\n\n if (!this.index) {\n // apply a variable to the scope, for example `a=2`\n if (!isSymbolNode(this.object)) {\n throw new TypeError('SymbolNode expected as object');\n }\n\n return function evalAssignmentNode(scope, args, context) {\n var value = evalValue(scope, args, context);\n scope.set(name, value);\n return value;\n };\n } else if (this.index.isObjectProperty()) {\n // apply an object property for example `a.b=2`\n var prop = this.index.getObjectProperty();\n return function evalAssignmentNode(scope, args, context) {\n var object = evalObject(scope, args, context);\n var value = evalValue(scope, args, context);\n setSafeProperty(object, prop, value);\n return value;\n };\n } else if (isSymbolNode(this.object)) {\n // update a matrix subset, for example `a[2]=3`\n return function evalAssignmentNode(scope, args, context) {\n var childObject = evalObject(scope, args, context);\n var value = evalValue(scope, args, context);\n var index = evalIndex(scope, args, childObject); // Important: we pass childObject instead of context\n\n scope.set(name, assign(childObject, index, value));\n return value;\n };\n } else {\n // isAccessorNode(node.object) === true\n // update a matrix subset, for example `a.b[2]=3`\n // we will not use the compile function of the AccessorNode, but compile it\n // ourselves here as we need the parent object of the AccessorNode:\n // wee need to apply the updated object to parent object\n var evalParentObject = this.object.object._compile(math, argNames);\n\n if (this.object.index.isObjectProperty()) {\n var parentProp = this.object.index.getObjectProperty();\n return function evalAssignmentNode(scope, args, context) {\n var parent = evalParentObject(scope, args, context);\n var childObject = getSafeProperty(parent, parentProp);\n var index = evalIndex(scope, args, childObject); // Important: we pass childObject instead of context\n\n var value = evalValue(scope, args, context);\n setSafeProperty(parent, parentProp, assign(childObject, index, value));\n return value;\n };\n } else {\n // if some parameters use the 'end' parameter, we need to calculate the size\n var evalParentIndex = this.object.index._compile(math, argNames);\n\n return function evalAssignmentNode(scope, args, context) {\n var parent = evalParentObject(scope, args, context);\n var parentIndex = evalParentIndex(scope, args, parent); // Important: we pass parent instead of context\n\n var childObject = access(parent, parentIndex);\n var index = evalIndex(scope, args, childObject); // Important: we pass childObject instead of context\n\n var value = evalValue(scope, args, context);\n assign(parent, parentIndex, assign(childObject, index, value));\n return value;\n };\n }\n }\n };\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n\n\n AssignmentNode.prototype.forEach = function (callback) {\n callback(this.object, 'object', this);\n\n if (this.index) {\n callback(this.index, 'index', this);\n }\n\n callback(this.value, 'value', this);\n };\n /**\n * Create a new AssignmentNode having it's childs be the results of calling\n * the provided callback function for each of the childs of the original node.\n * @param {function(child: Node, path: string, parent: Node): Node} callback\n * @returns {AssignmentNode} Returns a transformed copy of the node\n */\n\n\n AssignmentNode.prototype.map = function (callback) {\n var object = this._ifNode(callback(this.object, 'object', this));\n\n var index = this.index ? this._ifNode(callback(this.index, 'index', this)) : null;\n\n var value = this._ifNode(callback(this.value, 'value', this));\n\n return new AssignmentNode(object, index, value);\n };\n /**\n * Create a clone of this node, a shallow copy\n * @return {AssignmentNode}\n */\n\n\n AssignmentNode.prototype.clone = function () {\n return new AssignmentNode(this.object, this.index, this.value);\n };\n /*\n * Is parenthesis needed?\n * @param {node} node\n * @param {string} [parenthesis='keep']\n * @private\n */\n\n\n function needParenthesis(node, parenthesis) {\n if (!parenthesis) {\n parenthesis = 'keep';\n }\n\n var precedence = getPrecedence(node, parenthesis);\n var exprPrecedence = getPrecedence(node.value, parenthesis);\n return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;\n }\n /**\n * Get string representation\n * @param {Object} options\n * @return {string}\n */\n\n\n AssignmentNode.prototype._toString = function (options) {\n var object = this.object.toString(options);\n var index = this.index ? this.index.toString(options) : '';\n var value = this.value.toString(options);\n\n if (needParenthesis(this, options && options.parenthesis)) {\n value = '(' + value + ')';\n }\n\n return object + index + ' = ' + value;\n };\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n\n\n AssignmentNode.prototype.toJSON = function () {\n return {\n mathjs: 'AssignmentNode',\n object: this.object,\n index: this.index,\n value: this.value\n };\n };\n /**\n * Instantiate an AssignmentNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"AssignmentNode\", object: ..., index: ..., value: ...}`,\n * where mathjs is optional\n * @returns {AssignmentNode}\n */\n\n\n AssignmentNode.fromJSON = function (json) {\n return new AssignmentNode(json.object, json.index, json.value);\n };\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string}\n */\n\n\n AssignmentNode.prototype.toHTML = function (options) {\n var object = this.object.toHTML(options);\n var index = this.index ? this.index.toHTML(options) : '';\n var value = this.value.toHTML(options);\n\n if (needParenthesis(this, options && options.parenthesis)) {\n value = '(' + value + ')';\n }\n\n return object + index + '=' + value;\n };\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string}\n */\n\n\n AssignmentNode.prototype._toTex = function (options) {\n var object = this.object.toTex(options);\n var index = this.index ? this.index.toTex(options) : '';\n var value = this.value.toTex(options);\n\n if (needParenthesis(this, options && options.parenthesis)) {\n value = \"\\\\left(\".concat(value, \"\\\\right)\");\n }\n\n return object + index + ':=' + value;\n };\n\n return AssignmentNode;\n}, {\n isClass: true,\n isNode: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { subsetDependencies } from './dependenciesSubset.generated.js';\nimport { createAssignmentNode } from '../../factoriesAny.js';\nexport var AssignmentNodeDependencies = {\n matrixDependencies,\n NodeDependencies,\n subsetDependencies,\n createAssignmentNode\n};","import { errorTransform } from '../../transform/utils/errorTransform.js';\nimport { setSafeProperty } from '../../../utils/customs.js';\nexport function assignFactory(_ref) {\n var {\n subset,\n matrix\n } = _ref;\n\n /**\n * Replace part of an object:\n *\n * - Assign a property to an object\n * - Replace a part of a string\n * - Replace a matrix subset\n *\n * @param {Object | Array | Matrix | string} object\n * @param {Index} index\n * @param {*} value\n * @return {Object | Array | Matrix | string} Returns the original object\n * except in case of a string\n */\n // TODO: change assign to return the value instead of the object\n return function assign(object, index, value) {\n try {\n if (Array.isArray(object)) {\n // we use matrix.subset here instead of the function subset because we must not clone the contents\n return matrix(object).subset(index, value).valueOf();\n } else if (object && typeof object.subset === 'function') {\n // Matrix\n return object.subset(index, value);\n } else if (typeof object === 'string') {\n // TODO: move setStringSubset into a separate util file, use that\n return subset(object, index, value);\n } else if (typeof object === 'object') {\n if (!index.isObjectProperty()) {\n throw TypeError('Cannot apply a numeric index as object property');\n }\n\n setSafeProperty(object, index.getObjectProperty(), value);\n return object;\n } else {\n throw new TypeError('Cannot apply index: unsupported type of object');\n }\n } catch (err) {\n throw errorTransform(err);\n }\n };\n}","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { ResultSetDependencies } from './dependenciesResultSet.generated.js';\nimport { createBlockNode } from '../../factoriesAny.js';\nexport var BlockNodeDependencies = {\n NodeDependencies,\n ResultSetDependencies,\n createBlockNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createResultSet } from '../../factoriesAny.js';\nexport var ResultSetDependencies = {\n createResultSet\n};","import { factory } from '../../utils/factory.js';\nvar name = 'ResultSet';\nvar dependencies = [];\nexport var createResultSet = /* #__PURE__ */factory(name, dependencies, () => {\n /**\n * A ResultSet contains a list or results\n * @class ResultSet\n * @param {Array} entries\n * @constructor ResultSet\n */\n function ResultSet(entries) {\n if (!(this instanceof ResultSet)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n\n this.entries = entries || [];\n }\n /**\n * Attach type information\n */\n\n\n ResultSet.prototype.type = 'ResultSet';\n ResultSet.prototype.isResultSet = true;\n /**\n * Returns the array with results hold by this ResultSet\n * @memberof ResultSet\n * @returns {Array} entries\n */\n\n ResultSet.prototype.valueOf = function () {\n return this.entries;\n };\n /**\n * Returns the stringified results of the ResultSet\n * @memberof ResultSet\n * @returns {string} string\n */\n\n\n ResultSet.prototype.toString = function () {\n return '[' + this.entries.join(', ') + ']';\n };\n /**\n * Get a JSON representation of the ResultSet\n * @memberof ResultSet\n * @returns {Object} Returns a JSON object structured as:\n * `{\"mathjs\": \"ResultSet\", \"entries\": [...]}`\n */\n\n\n ResultSet.prototype.toJSON = function () {\n return {\n mathjs: 'ResultSet',\n entries: this.entries\n };\n };\n /**\n * Instantiate a ResultSet from a JSON object\n * @memberof ResultSet\n * @param {Object} json A JSON object structured as:\n * `{\"mathjs\": \"ResultSet\", \"entries\": [...]}`\n * @return {ResultSet}\n */\n\n\n ResultSet.fromJSON = function (json) {\n return new ResultSet(json.entries);\n };\n\n return ResultSet;\n}, {\n isClass: true\n});","import { isNode } from '../../utils/is.js';\nimport { forEach, map } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'BlockNode';\nvar dependencies = ['ResultSet', 'Node'];\nexport var createBlockNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n ResultSet,\n Node\n } = _ref;\n\n /**\n * @constructor BlockNode\n * @extends {Node}\n * Holds a set with blocks\n * @param {Array.<{node: Node} | {node: Node, visible: boolean}>} blocks\n * An array with blocks, where a block is constructed as an Object\n * with properties block, which is a Node, and visible, which is\n * a boolean. The property visible is optional and is true by default\n */\n function BlockNode(blocks) {\n if (!(this instanceof BlockNode)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n } // validate input, copy blocks\n\n\n if (!Array.isArray(blocks)) throw new Error('Array expected');\n this.blocks = blocks.map(function (block) {\n var node = block && block.node;\n var visible = block && block.visible !== undefined ? block.visible : true;\n if (!isNode(node)) throw new TypeError('Property \"node\" must be a Node');\n if (typeof visible !== 'boolean') throw new TypeError('Property \"visible\" must be a boolean');\n return {\n node: node,\n visible: visible\n };\n });\n }\n\n BlockNode.prototype = new Node();\n BlockNode.prototype.type = 'BlockNode';\n BlockNode.prototype.isBlockNode = true;\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n\n BlockNode.prototype._compile = function (math, argNames) {\n var evalBlocks = map(this.blocks, function (block) {\n return {\n evaluate: block.node._compile(math, argNames),\n visible: block.visible\n };\n });\n return function evalBlockNodes(scope, args, context) {\n var results = [];\n forEach(evalBlocks, function evalBlockNode(block) {\n var result = block.evaluate(scope, args, context);\n\n if (block.visible) {\n results.push(result);\n }\n });\n return new ResultSet(results);\n };\n };\n /**\n * Execute a callback for each of the child blocks of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n\n\n BlockNode.prototype.forEach = function (callback) {\n for (var i = 0; i < this.blocks.length; i++) {\n callback(this.blocks[i].node, 'blocks[' + i + '].node', this);\n }\n };\n /**\n * Create a new BlockNode having it's childs be the results of calling\n * the provided callback function for each of the childs of the original node.\n * @param {function(child: Node, path: string, parent: Node): Node} callback\n * @returns {BlockNode} Returns a transformed copy of the node\n */\n\n\n BlockNode.prototype.map = function (callback) {\n var blocks = [];\n\n for (var i = 0; i < this.blocks.length; i++) {\n var block = this.blocks[i];\n\n var node = this._ifNode(callback(block.node, 'blocks[' + i + '].node', this));\n\n blocks[i] = {\n node: node,\n visible: block.visible\n };\n }\n\n return new BlockNode(blocks);\n };\n /**\n * Create a clone of this node, a shallow copy\n * @return {BlockNode}\n */\n\n\n BlockNode.prototype.clone = function () {\n var blocks = this.blocks.map(function (block) {\n return {\n node: block.node,\n visible: block.visible\n };\n });\n return new BlockNode(blocks);\n };\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n\n\n BlockNode.prototype._toString = function (options) {\n return this.blocks.map(function (param) {\n return param.node.toString(options) + (param.visible ? '' : ';');\n }).join('\\n');\n };\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n\n\n BlockNode.prototype.toJSON = function () {\n return {\n mathjs: 'BlockNode',\n blocks: this.blocks\n };\n };\n /**\n * Instantiate an BlockNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"BlockNode\", blocks: [{node: ..., visible: false}, ...]}`,\n * where mathjs is optional\n * @returns {BlockNode}\n */\n\n\n BlockNode.fromJSON = function (json) {\n return new BlockNode(json.blocks);\n };\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n\n\n BlockNode.prototype.toHTML = function (options) {\n return this.blocks.map(function (param) {\n return param.node.toHTML(options) + (param.visible ? '' : ';');\n }).join(' ');\n };\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n BlockNode.prototype._toTex = function (options) {\n return this.blocks.map(function (param) {\n return param.node.toTex(options) + (param.visible ? '' : ';');\n }).join('\\\\;\\\\;\\n');\n };\n\n return BlockNode;\n}, {\n isClass: true,\n isNode: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createConditionalNode } from '../../factoriesAny.js';\nexport var ConditionalNodeDependencies = {\n NodeDependencies,\n createConditionalNode\n};","import { isBigNumber, isComplex, isNode, isUnit, typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { getPrecedence } from '../operators.js';\nvar name = 'ConditionalNode';\nvar dependencies = ['Node'];\nexport var createConditionalNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n Node\n } = _ref;\n\n /**\n * A lazy evaluating conditional operator: 'condition ? trueExpr : falseExpr'\n *\n * @param {Node} condition Condition, must result in a boolean\n * @param {Node} trueExpr Expression evaluated when condition is true\n * @param {Node} falseExpr Expression evaluated when condition is true\n *\n * @constructor ConditionalNode\n * @extends {Node}\n */\n function ConditionalNode(condition, trueExpr, falseExpr) {\n if (!(this instanceof ConditionalNode)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n\n if (!isNode(condition)) throw new TypeError('Parameter condition must be a Node');\n if (!isNode(trueExpr)) throw new TypeError('Parameter trueExpr must be a Node');\n if (!isNode(falseExpr)) throw new TypeError('Parameter falseExpr must be a Node');\n this.condition = condition;\n this.trueExpr = trueExpr;\n this.falseExpr = falseExpr;\n }\n\n ConditionalNode.prototype = new Node();\n ConditionalNode.prototype.type = 'ConditionalNode';\n ConditionalNode.prototype.isConditionalNode = true;\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n\n ConditionalNode.prototype._compile = function (math, argNames) {\n var evalCondition = this.condition._compile(math, argNames);\n\n var evalTrueExpr = this.trueExpr._compile(math, argNames);\n\n var evalFalseExpr = this.falseExpr._compile(math, argNames);\n\n return function evalConditionalNode(scope, args, context) {\n return testCondition(evalCondition(scope, args, context)) ? evalTrueExpr(scope, args, context) : evalFalseExpr(scope, args, context);\n };\n };\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n\n\n ConditionalNode.prototype.forEach = function (callback) {\n callback(this.condition, 'condition', this);\n callback(this.trueExpr, 'trueExpr', this);\n callback(this.falseExpr, 'falseExpr', this);\n };\n /**\n * Create a new ConditionalNode having it's childs be the results of calling\n * the provided callback function for each of the childs of the original node.\n * @param {function(child: Node, path: string, parent: Node): Node} callback\n * @returns {ConditionalNode} Returns a transformed copy of the node\n */\n\n\n ConditionalNode.prototype.map = function (callback) {\n return new ConditionalNode(this._ifNode(callback(this.condition, 'condition', this)), this._ifNode(callback(this.trueExpr, 'trueExpr', this)), this._ifNode(callback(this.falseExpr, 'falseExpr', this)));\n };\n /**\n * Create a clone of this node, a shallow copy\n * @return {ConditionalNode}\n */\n\n\n ConditionalNode.prototype.clone = function () {\n return new ConditionalNode(this.condition, this.trueExpr, this.falseExpr);\n };\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n ConditionalNode.prototype._toString = function (options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var precedence = getPrecedence(this, parenthesis); // Enclose Arguments in parentheses if they are an OperatorNode\n // or have lower or equal precedence\n // NOTE: enclosing all OperatorNodes in parentheses is a decision\n // purely based on aesthetics and readability\n\n var condition = this.condition.toString(options);\n var conditionPrecedence = getPrecedence(this.condition, parenthesis);\n\n if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {\n condition = '(' + condition + ')';\n }\n\n var trueExpr = this.trueExpr.toString(options);\n var truePrecedence = getPrecedence(this.trueExpr, parenthesis);\n\n if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {\n trueExpr = '(' + trueExpr + ')';\n }\n\n var falseExpr = this.falseExpr.toString(options);\n var falsePrecedence = getPrecedence(this.falseExpr, parenthesis);\n\n if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {\n falseExpr = '(' + falseExpr + ')';\n }\n\n return condition + ' ? ' + trueExpr + ' : ' + falseExpr;\n };\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n\n\n ConditionalNode.prototype.toJSON = function () {\n return {\n mathjs: 'ConditionalNode',\n condition: this.condition,\n trueExpr: this.trueExpr,\n falseExpr: this.falseExpr\n };\n };\n /**\n * Instantiate an ConditionalNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"ConditionalNode\", \"condition\": ..., \"trueExpr\": ..., \"falseExpr\": ...}`,\n * where mathjs is optional\n * @returns {ConditionalNode}\n */\n\n\n ConditionalNode.fromJSON = function (json) {\n return new ConditionalNode(json.condition, json.trueExpr, json.falseExpr);\n };\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n ConditionalNode.prototype.toHTML = function (options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var precedence = getPrecedence(this, parenthesis); // Enclose Arguments in parentheses if they are an OperatorNode\n // or have lower or equal precedence\n // NOTE: enclosing all OperatorNodes in parentheses is a decision\n // purely based on aesthetics and readability\n\n var condition = this.condition.toHTML(options);\n var conditionPrecedence = getPrecedence(this.condition, parenthesis);\n\n if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {\n condition = '(' + condition + ')';\n }\n\n var trueExpr = this.trueExpr.toHTML(options);\n var truePrecedence = getPrecedence(this.trueExpr, parenthesis);\n\n if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {\n trueExpr = '(' + trueExpr + ')';\n }\n\n var falseExpr = this.falseExpr.toHTML(options);\n var falsePrecedence = getPrecedence(this.falseExpr, parenthesis);\n\n if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {\n falseExpr = '(' + falseExpr + ')';\n }\n\n return condition + '?' + trueExpr + ':' + falseExpr;\n };\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n ConditionalNode.prototype._toTex = function (options) {\n return '\\\\begin{cases} {' + this.trueExpr.toTex(options) + '}, &\\\\quad{\\\\text{if }\\\\;' + this.condition.toTex(options) + '}\\\\\\\\{' + this.falseExpr.toTex(options) + '}, &\\\\quad{\\\\text{otherwise}}\\\\end{cases}';\n };\n /**\n * Test whether a condition is met\n * @param {*} condition\n * @returns {boolean} true if condition is true or non-zero, else false\n */\n\n\n function testCondition(condition) {\n if (typeof condition === 'number' || typeof condition === 'boolean' || typeof condition === 'string') {\n return !!condition;\n }\n\n if (condition) {\n if (isBigNumber(condition)) {\n return !condition.isZero();\n }\n\n if (isComplex(condition)) {\n return !!(condition.re || condition.im);\n }\n\n if (isUnit(condition)) {\n return !!condition.value;\n }\n }\n\n if (condition === null || condition === undefined) {\n return false;\n }\n\n throw new TypeError('Unsupported type of condition \"' + typeOf(condition) + '\"');\n }\n\n return ConditionalNode;\n}, {\n isClass: true,\n isNode: true\n});","/* eslint no-template-curly-in-string: \"off\" */\nimport escapeLatexLib from 'escape-latex';\nimport { hasOwnProperty } from './object.js';\nexport var latexSymbols = {\n // GREEK LETTERS\n Alpha: 'A',\n alpha: '\\\\alpha',\n Beta: 'B',\n beta: '\\\\beta',\n Gamma: '\\\\Gamma',\n gamma: '\\\\gamma',\n Delta: '\\\\Delta',\n delta: '\\\\delta',\n Epsilon: 'E',\n epsilon: '\\\\epsilon',\n varepsilon: '\\\\varepsilon',\n Zeta: 'Z',\n zeta: '\\\\zeta',\n Eta: 'H',\n eta: '\\\\eta',\n Theta: '\\\\Theta',\n theta: '\\\\theta',\n vartheta: '\\\\vartheta',\n Iota: 'I',\n iota: '\\\\iota',\n Kappa: 'K',\n kappa: '\\\\kappa',\n varkappa: '\\\\varkappa',\n Lambda: '\\\\Lambda',\n lambda: '\\\\lambda',\n Mu: 'M',\n mu: '\\\\mu',\n Nu: 'N',\n nu: '\\\\nu',\n Xi: '\\\\Xi',\n xi: '\\\\xi',\n Omicron: 'O',\n omicron: 'o',\n Pi: '\\\\Pi',\n pi: '\\\\pi',\n varpi: '\\\\varpi',\n Rho: 'P',\n rho: '\\\\rho',\n varrho: '\\\\varrho',\n Sigma: '\\\\Sigma',\n sigma: '\\\\sigma',\n varsigma: '\\\\varsigma',\n Tau: 'T',\n tau: '\\\\tau',\n Upsilon: '\\\\Upsilon',\n upsilon: '\\\\upsilon',\n Phi: '\\\\Phi',\n phi: '\\\\phi',\n varphi: '\\\\varphi',\n Chi: 'X',\n chi: '\\\\chi',\n Psi: '\\\\Psi',\n psi: '\\\\psi',\n Omega: '\\\\Omega',\n omega: '\\\\omega',\n // logic\n true: '\\\\mathrm{True}',\n false: '\\\\mathrm{False}',\n // other\n i: 'i',\n // TODO use \\i ??\n inf: '\\\\infty',\n Inf: '\\\\infty',\n infinity: '\\\\infty',\n Infinity: '\\\\infty',\n oo: '\\\\infty',\n lim: '\\\\lim',\n undefined: '\\\\mathbf{?}'\n};\nexport var latexOperators = {\n transpose: '^\\\\top',\n ctranspose: '^H',\n factorial: '!',\n pow: '^',\n dotPow: '.^\\\\wedge',\n // TODO find ideal solution\n unaryPlus: '+',\n unaryMinus: '-',\n bitNot: '\\\\~',\n // TODO find ideal solution\n not: '\\\\neg',\n multiply: '\\\\cdot',\n divide: '\\\\frac',\n // TODO how to handle that properly?\n dotMultiply: '.\\\\cdot',\n // TODO find ideal solution\n dotDivide: '.:',\n // TODO find ideal solution\n mod: '\\\\mod',\n add: '+',\n subtract: '-',\n to: '\\\\rightarrow',\n leftShift: '<<',\n rightArithShift: '>>',\n rightLogShift: '>>>',\n equal: '=',\n unequal: '\\\\neq',\n smaller: '<',\n larger: '>',\n smallerEq: '\\\\leq',\n largerEq: '\\\\geq',\n bitAnd: '\\\\&',\n bitXor: '\\\\underline{|}',\n bitOr: '|',\n and: '\\\\wedge',\n xor: '\\\\veebar',\n or: '\\\\vee'\n};\nexport var latexFunctions = {\n // arithmetic\n abs: {\n 1: '\\\\left|${args[0]}\\\\right|'\n },\n add: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.add, \"${args[1]}\\\\right)\")\n },\n cbrt: {\n 1: '\\\\sqrt[3]{${args[0]}}'\n },\n ceil: {\n 1: '\\\\left\\\\lceil${args[0]}\\\\right\\\\rceil'\n },\n cube: {\n 1: '\\\\left(${args[0]}\\\\right)^3'\n },\n divide: {\n 2: '\\\\frac{${args[0]}}{${args[1]}}'\n },\n dotDivide: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.dotDivide, \"${args[1]}\\\\right)\")\n },\n dotMultiply: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.dotMultiply, \"${args[1]}\\\\right)\")\n },\n dotPow: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.dotPow, \"${args[1]}\\\\right)\")\n },\n exp: {\n 1: '\\\\exp\\\\left(${args[0]}\\\\right)'\n },\n expm1: \"\\\\left(e\".concat(latexOperators.pow, \"{${args[0]}}-1\\\\right)\"),\n fix: {\n 1: '\\\\mathrm{${name}}\\\\left(${args[0]}\\\\right)'\n },\n floor: {\n 1: '\\\\left\\\\lfloor${args[0]}\\\\right\\\\rfloor'\n },\n gcd: '\\\\gcd\\\\left(${args}\\\\right)',\n hypot: '\\\\hypot\\\\left(${args}\\\\right)',\n log: {\n 1: '\\\\ln\\\\left(${args[0]}\\\\right)',\n 2: '\\\\log_{${args[1]}}\\\\left(${args[0]}\\\\right)'\n },\n log10: {\n 1: '\\\\log_{10}\\\\left(${args[0]}\\\\right)'\n },\n log1p: {\n 1: '\\\\ln\\\\left(${args[0]}+1\\\\right)',\n 2: '\\\\log_{${args[1]}}\\\\left(${args[0]}+1\\\\right)'\n },\n log2: '\\\\log_{2}\\\\left(${args[0]}\\\\right)',\n mod: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.mod, \"${args[1]}\\\\right)\")\n },\n multiply: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.multiply, \"${args[1]}\\\\right)\")\n },\n norm: {\n 1: '\\\\left\\\\|${args[0]}\\\\right\\\\|',\n 2: undefined // use default template\n\n },\n nthRoot: {\n 2: '\\\\sqrt[${args[1]}]{${args[0]}}'\n },\n nthRoots: {\n 2: '\\\\{y : $y^{args[1]} = {${args[0]}}\\\\}'\n },\n pow: {\n 2: \"\\\\left(${args[0]}\\\\right)\".concat(latexOperators.pow, \"{${args[1]}}\")\n },\n round: {\n 1: '\\\\left\\\\lfloor${args[0]}\\\\right\\\\rceil',\n 2: undefined // use default template\n\n },\n sign: {\n 1: '\\\\mathrm{${name}}\\\\left(${args[0]}\\\\right)'\n },\n sqrt: {\n 1: '\\\\sqrt{${args[0]}}'\n },\n square: {\n 1: '\\\\left(${args[0]}\\\\right)^2'\n },\n subtract: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.subtract, \"${args[1]}\\\\right)\")\n },\n unaryMinus: {\n 1: \"\".concat(latexOperators.unaryMinus, \"\\\\left(${args[0]}\\\\right)\")\n },\n unaryPlus: {\n 1: \"\".concat(latexOperators.unaryPlus, \"\\\\left(${args[0]}\\\\right)\")\n },\n // bitwise\n bitAnd: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.bitAnd, \"${args[1]}\\\\right)\")\n },\n bitNot: {\n 1: latexOperators.bitNot + '\\\\left(${args[0]}\\\\right)'\n },\n bitOr: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.bitOr, \"${args[1]}\\\\right)\")\n },\n bitXor: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.bitXor, \"${args[1]}\\\\right)\")\n },\n leftShift: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.leftShift, \"${args[1]}\\\\right)\")\n },\n rightArithShift: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.rightArithShift, \"${args[1]}\\\\right)\")\n },\n rightLogShift: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.rightLogShift, \"${args[1]}\\\\right)\")\n },\n // combinatorics\n bellNumbers: {\n 1: '\\\\mathrm{B}_{${args[0]}}'\n },\n catalan: {\n 1: '\\\\mathrm{C}_{${args[0]}}'\n },\n stirlingS2: {\n 2: '\\\\mathrm{S}\\\\left(${args}\\\\right)'\n },\n // complex\n arg: {\n 1: '\\\\arg\\\\left(${args[0]}\\\\right)'\n },\n conj: {\n 1: '\\\\left(${args[0]}\\\\right)^*'\n },\n im: {\n 1: '\\\\Im\\\\left\\\\lbrace${args[0]}\\\\right\\\\rbrace'\n },\n re: {\n 1: '\\\\Re\\\\left\\\\lbrace${args[0]}\\\\right\\\\rbrace'\n },\n // logical\n and: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.and, \"${args[1]}\\\\right)\")\n },\n not: {\n 1: latexOperators.not + '\\\\left(${args[0]}\\\\right)'\n },\n or: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.or, \"${args[1]}\\\\right)\")\n },\n xor: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.xor, \"${args[1]}\\\\right)\")\n },\n // matrix\n cross: {\n 2: '\\\\left(${args[0]}\\\\right)\\\\times\\\\left(${args[1]}\\\\right)'\n },\n ctranspose: {\n 1: \"\\\\left(${args[0]}\\\\right)\".concat(latexOperators.ctranspose)\n },\n det: {\n 1: '\\\\det\\\\left(${args[0]}\\\\right)'\n },\n dot: {\n 2: '\\\\left(${args[0]}\\\\cdot${args[1]}\\\\right)'\n },\n expm: {\n 1: '\\\\exp\\\\left(${args[0]}\\\\right)'\n },\n inv: {\n 1: '\\\\left(${args[0]}\\\\right)^{-1}'\n },\n sqrtm: {\n 1: \"{${args[0]}}\".concat(latexOperators.pow, \"{\\\\frac{1}{2}}\")\n },\n trace: {\n 1: '\\\\mathrm{tr}\\\\left(${args[0]}\\\\right)'\n },\n transpose: {\n 1: \"\\\\left(${args[0]}\\\\right)\".concat(latexOperators.transpose)\n },\n // probability\n combinations: {\n 2: '\\\\binom{${args[0]}}{${args[1]}}'\n },\n combinationsWithRep: {\n 2: '\\\\left(\\\\!\\\\!{\\\\binom{${args[0]}}{${args[1]}}}\\\\!\\\\!\\\\right)'\n },\n factorial: {\n 1: \"\\\\left(${args[0]}\\\\right)\".concat(latexOperators.factorial)\n },\n gamma: {\n 1: '\\\\Gamma\\\\left(${args[0]}\\\\right)'\n },\n // relational\n equal: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.equal, \"${args[1]}\\\\right)\")\n },\n larger: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.larger, \"${args[1]}\\\\right)\")\n },\n largerEq: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.largerEq, \"${args[1]}\\\\right)\")\n },\n smaller: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.smaller, \"${args[1]}\\\\right)\")\n },\n smallerEq: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.smallerEq, \"${args[1]}\\\\right)\")\n },\n unequal: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.unequal, \"${args[1]}\\\\right)\")\n },\n // special\n erf: {\n 1: 'erf\\\\left(${args[0]}\\\\right)'\n },\n // statistics\n max: '\\\\max\\\\left(${args}\\\\right)',\n min: '\\\\min\\\\left(${args}\\\\right)',\n variance: '\\\\mathrm{Var}\\\\left(${args}\\\\right)',\n // trigonometry\n acos: {\n 1: '\\\\cos^{-1}\\\\left(${args[0]}\\\\right)'\n },\n acosh: {\n 1: '\\\\cosh^{-1}\\\\left(${args[0]}\\\\right)'\n },\n acot: {\n 1: '\\\\cot^{-1}\\\\left(${args[0]}\\\\right)'\n },\n acoth: {\n 1: '\\\\coth^{-1}\\\\left(${args[0]}\\\\right)'\n },\n acsc: {\n 1: '\\\\csc^{-1}\\\\left(${args[0]}\\\\right)'\n },\n acsch: {\n 1: '\\\\mathrm{csch}^{-1}\\\\left(${args[0]}\\\\right)'\n },\n asec: {\n 1: '\\\\sec^{-1}\\\\left(${args[0]}\\\\right)'\n },\n asech: {\n 1: '\\\\mathrm{sech}^{-1}\\\\left(${args[0]}\\\\right)'\n },\n asin: {\n 1: '\\\\sin^{-1}\\\\left(${args[0]}\\\\right)'\n },\n asinh: {\n 1: '\\\\sinh^{-1}\\\\left(${args[0]}\\\\right)'\n },\n atan: {\n 1: '\\\\tan^{-1}\\\\left(${args[0]}\\\\right)'\n },\n atan2: {\n 2: '\\\\mathrm{atan2}\\\\left(${args}\\\\right)'\n },\n atanh: {\n 1: '\\\\tanh^{-1}\\\\left(${args[0]}\\\\right)'\n },\n cos: {\n 1: '\\\\cos\\\\left(${args[0]}\\\\right)'\n },\n cosh: {\n 1: '\\\\cosh\\\\left(${args[0]}\\\\right)'\n },\n cot: {\n 1: '\\\\cot\\\\left(${args[0]}\\\\right)'\n },\n coth: {\n 1: '\\\\coth\\\\left(${args[0]}\\\\right)'\n },\n csc: {\n 1: '\\\\csc\\\\left(${args[0]}\\\\right)'\n },\n csch: {\n 1: '\\\\mathrm{csch}\\\\left(${args[0]}\\\\right)'\n },\n sec: {\n 1: '\\\\sec\\\\left(${args[0]}\\\\right)'\n },\n sech: {\n 1: '\\\\mathrm{sech}\\\\left(${args[0]}\\\\right)'\n },\n sin: {\n 1: '\\\\sin\\\\left(${args[0]}\\\\right)'\n },\n sinh: {\n 1: '\\\\sinh\\\\left(${args[0]}\\\\right)'\n },\n tan: {\n 1: '\\\\tan\\\\left(${args[0]}\\\\right)'\n },\n tanh: {\n 1: '\\\\tanh\\\\left(${args[0]}\\\\right)'\n },\n // unit\n to: {\n 2: \"\\\\left(${args[0]}\".concat(latexOperators.to, \"${args[1]}\\\\right)\")\n },\n // utils\n numeric: function numeric(node, options) {\n // Not sure if this is strictly right but should work correctly for the vast majority of use cases.\n return node.args[0].toTex();\n },\n // type\n number: {\n 0: '0',\n 1: '\\\\left(${args[0]}\\\\right)',\n 2: '\\\\left(\\\\left(${args[0]}\\\\right)${args[1]}\\\\right)'\n },\n string: {\n 0: '\\\\mathtt{\"\"}',\n 1: '\\\\mathrm{string}\\\\left(${args[0]}\\\\right)'\n },\n bignumber: {\n 0: '0',\n 1: '\\\\left(${args[0]}\\\\right)'\n },\n complex: {\n 0: '0',\n 1: '\\\\left(${args[0]}\\\\right)',\n 2: \"\\\\left(\\\\left(${args[0]}\\\\right)+\".concat(latexSymbols.i, \"\\\\cdot\\\\left(${args[1]}\\\\right)\\\\right)\")\n },\n matrix: {\n 0: '\\\\begin{bmatrix}\\\\end{bmatrix}',\n 1: '\\\\left(${args[0]}\\\\right)',\n 2: '\\\\left(${args[0]}\\\\right)'\n },\n sparse: {\n 0: '\\\\begin{bsparse}\\\\end{bsparse}',\n 1: '\\\\left(${args[0]}\\\\right)'\n },\n unit: {\n 1: '\\\\left(${args[0]}\\\\right)',\n 2: '\\\\left(\\\\left(${args[0]}\\\\right)${args[1]}\\\\right)'\n }\n};\nexport var defaultTemplate = '\\\\mathrm{${name}}\\\\left(${args}\\\\right)';\nvar latexUnits = {\n deg: '^\\\\circ'\n};\nexport function escapeLatex(string) {\n return escapeLatexLib(string, {\n preserveFormatting: true\n });\n} // @param {string} name\n// @param {boolean} isUnit\n\nexport function toSymbol(name, isUnit) {\n isUnit = typeof isUnit === 'undefined' ? false : isUnit;\n\n if (isUnit) {\n if (hasOwnProperty(latexUnits, name)) {\n return latexUnits[name];\n }\n\n return '\\\\mathrm{' + escapeLatex(name) + '}';\n }\n\n if (hasOwnProperty(latexSymbols, name)) {\n return latexSymbols[name];\n }\n\n return escapeLatex(name);\n}","import { format } from '../../utils/string.js';\nimport { typeOf } from '../../utils/is.js';\nimport { escapeLatex } from '../../utils/latex.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ConstantNode';\nvar dependencies = ['Node'];\nexport var createConstantNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n Node\n } = _ref;\n\n /**\n * A ConstantNode holds a constant value like a number or string.\n *\n * Usage:\n *\n * new ConstantNode(2.3)\n * new ConstantNode('hello')\n *\n * @param {*} value Value can be any type (number, BigNumber, string, ...)\n * @constructor ConstantNode\n * @extends {Node}\n */\n function ConstantNode(value) {\n if (!(this instanceof ConstantNode)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n\n this.value = value;\n }\n\n ConstantNode.prototype = new Node();\n ConstantNode.prototype.type = 'ConstantNode';\n ConstantNode.prototype.isConstantNode = true;\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n\n ConstantNode.prototype._compile = function (math, argNames) {\n var value = this.value;\n return function evalConstantNode() {\n return value;\n };\n };\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n\n\n ConstantNode.prototype.forEach = function (callback) {// nothing to do, we don't have childs\n };\n /**\n * Create a new ConstantNode having it's childs be the results of calling\n * the provided callback function for each of the childs of the original node.\n * @param {function(child: Node, path: string, parent: Node) : Node} callback\n * @returns {ConstantNode} Returns a clone of the node\n */\n\n\n ConstantNode.prototype.map = function (callback) {\n return this.clone();\n };\n /**\n * Create a clone of this node, a shallow copy\n * @return {ConstantNode}\n */\n\n\n ConstantNode.prototype.clone = function () {\n return new ConstantNode(this.value);\n };\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n ConstantNode.prototype._toString = function (options) {\n return format(this.value, options);\n };\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n ConstantNode.prototype.toHTML = function (options) {\n var value = this._toString(options);\n\n switch (typeOf(this.value)) {\n case 'number':\n case 'BigNumber':\n case 'Fraction':\n return '' + value + '';\n\n case 'string':\n return '' + value + '';\n\n case 'boolean':\n return '' + value + '';\n\n case 'null':\n return '' + value + '';\n\n case 'undefined':\n return '' + value + '';\n\n default:\n return '' + value + '';\n }\n };\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n\n\n ConstantNode.prototype.toJSON = function () {\n return {\n mathjs: 'ConstantNode',\n value: this.value\n };\n };\n /**\n * Instantiate a ConstantNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"SymbolNode\", value: 2.3}`,\n * where mathjs is optional\n * @returns {ConstantNode}\n */\n\n\n ConstantNode.fromJSON = function (json) {\n return new ConstantNode(json.value);\n };\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n ConstantNode.prototype._toTex = function (options) {\n var value = this._toString(options);\n\n switch (typeOf(this.value)) {\n case 'string':\n return '\\\\mathtt{' + escapeLatex(value) + '}';\n\n case 'number':\n case 'BigNumber':\n {\n if (!isFinite(this.value)) {\n return this.value.valueOf() < 0 ? '-\\\\infty' : '\\\\infty';\n }\n\n var index = value.toLowerCase().indexOf('e');\n\n if (index !== -1) {\n return value.substring(0, index) + '\\\\cdot10^{' + value.substring(index + 1) + '}';\n }\n }\n return value;\n\n case 'Fraction':\n return this.value.toLatex();\n\n default:\n return value;\n }\n };\n\n return ConstantNode;\n}, {\n isClass: true,\n isNode: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createConstantNode } from '../../factoriesAny.js';\nexport var ConstantNodeDependencies = {\n NodeDependencies,\n createConstantNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createFunctionAssignmentNode } from '../../factoriesAny.js';\nexport var FunctionAssignmentNodeDependencies = {\n NodeDependencies,\n typedDependencies,\n createFunctionAssignmentNode\n};","import { isNode } from '../../utils/is.js';\nimport { keywords } from '../keywords.js';\nimport { escape } from '../../utils/string.js';\nimport { forEach, join } from '../../utils/array.js';\nimport { toSymbol } from '../../utils/latex.js';\nimport { getPrecedence } from '../operators.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'FunctionAssignmentNode';\nvar dependencies = ['typed', 'Node'];\nexport var createFunctionAssignmentNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n Node\n } = _ref;\n\n /**\n * @constructor FunctionAssignmentNode\n * @extends {Node}\n * Function assignment\n *\n * @param {string} name Function name\n * @param {string[] | Array.<{name: string, type: string}>} params\n * Array with function parameter names, or an\n * array with objects containing the name\n * and type of the parameter\n * @param {Node} expr The function expression\n */\n function FunctionAssignmentNode(name, params, expr) {\n if (!(this instanceof FunctionAssignmentNode)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n } // validate input\n\n\n if (typeof name !== 'string') throw new TypeError('String expected for parameter \"name\"');\n if (!Array.isArray(params)) throw new TypeError('Array containing strings or objects expected for parameter \"params\"');\n if (!isNode(expr)) throw new TypeError('Node expected for parameter \"expr\"');\n if (keywords.has(name)) throw new Error('Illegal function name, \"' + name + '\" is a reserved keyword');\n this.name = name;\n this.params = params.map(function (param) {\n return param && param.name || param;\n });\n this.types = params.map(function (param) {\n return param && param.type || 'any';\n });\n this.expr = expr;\n }\n\n FunctionAssignmentNode.prototype = new Node();\n FunctionAssignmentNode.prototype.type = 'FunctionAssignmentNode';\n FunctionAssignmentNode.prototype.isFunctionAssignmentNode = true;\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n\n FunctionAssignmentNode.prototype._compile = function (math, argNames) {\n var childArgNames = Object.create(argNames);\n forEach(this.params, function (param) {\n childArgNames[param] = true;\n }); // compile the function expression with the child args\n\n var evalExpr = this.expr._compile(math, childArgNames);\n\n var name = this.name;\n var params = this.params;\n var signature = join(this.types, ',');\n var syntax = name + '(' + join(this.params, ', ') + ')';\n return function evalFunctionAssignmentNode(scope, args, context) {\n var signatures = {};\n\n signatures[signature] = function () {\n var childArgs = Object.create(args);\n\n for (var i = 0; i < params.length; i++) {\n childArgs[params[i]] = arguments[i];\n }\n\n return evalExpr(scope, childArgs, context);\n };\n\n var fn = typed(name, signatures);\n fn.syntax = syntax;\n scope.set(name, fn);\n return fn;\n };\n };\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n\n\n FunctionAssignmentNode.prototype.forEach = function (callback) {\n callback(this.expr, 'expr', this);\n };\n /**\n * Create a new FunctionAssignmentNode having it's childs be the results of calling\n * the provided callback function for each of the childs of the original node.\n * @param {function(child: Node, path: string, parent: Node): Node} callback\n * @returns {FunctionAssignmentNode} Returns a transformed copy of the node\n */\n\n\n FunctionAssignmentNode.prototype.map = function (callback) {\n var expr = this._ifNode(callback(this.expr, 'expr', this));\n\n return new FunctionAssignmentNode(this.name, this.params.slice(0), expr);\n };\n /**\n * Create a clone of this node, a shallow copy\n * @return {FunctionAssignmentNode}\n */\n\n\n FunctionAssignmentNode.prototype.clone = function () {\n return new FunctionAssignmentNode(this.name, this.params.slice(0), this.expr);\n };\n /**\n * Is parenthesis needed?\n * @param {Node} node\n * @param {Object} parenthesis\n * @private\n */\n\n\n function needParenthesis(node, parenthesis) {\n var precedence = getPrecedence(node, parenthesis);\n var exprPrecedence = getPrecedence(node.expr, parenthesis);\n return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;\n }\n /**\n * get string representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n FunctionAssignmentNode.prototype._toString = function (options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var expr = this.expr.toString(options);\n\n if (needParenthesis(this, parenthesis)) {\n expr = '(' + expr + ')';\n }\n\n return this.name + '(' + this.params.join(', ') + ') = ' + expr;\n };\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n\n\n FunctionAssignmentNode.prototype.toJSON = function () {\n var types = this.types;\n return {\n mathjs: 'FunctionAssignmentNode',\n name: this.name,\n params: this.params.map(function (param, index) {\n return {\n name: param,\n type: types[index]\n };\n }),\n expr: this.expr\n };\n };\n /**\n * Instantiate an FunctionAssignmentNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"FunctionAssignmentNode\", name: ..., params: ..., expr: ...}`,\n * where mathjs is optional\n * @returns {FunctionAssignmentNode}\n */\n\n\n FunctionAssignmentNode.fromJSON = function (json) {\n return new FunctionAssignmentNode(json.name, json.params, json.expr);\n };\n /**\n * get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n FunctionAssignmentNode.prototype.toHTML = function (options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var params = [];\n\n for (var i = 0; i < this.params.length; i++) {\n params.push('' + escape(this.params[i]) + '');\n }\n\n var expr = this.expr.toHTML(options);\n\n if (needParenthesis(this, parenthesis)) {\n expr = '(' + expr + ')';\n }\n\n return '' + escape(this.name) + '' + '(' + params.join(',') + ')=' + expr;\n };\n /**\n * get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n FunctionAssignmentNode.prototype._toTex = function (options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var expr = this.expr.toTex(options);\n\n if (needParenthesis(this, parenthesis)) {\n expr = \"\\\\left(\".concat(expr, \"\\\\right)\");\n }\n\n return '\\\\mathrm{' + this.name + '}\\\\left(' + this.params.map(toSymbol).join(',') + '\\\\right):=' + expr;\n };\n\n return FunctionAssignmentNode;\n}, {\n isClass: true,\n isNode: true\n});","import { isCollection, isMatrix } from './is.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { arraySize } from './array.js';\n/**\n * Test whether an array contains collections\n * @param {Array} array\n * @returns {boolean} Returns true when the array contains one or multiple\n * collections (Arrays or Matrices). Returns false otherwise.\n */\n\nexport function containsCollections(array) {\n for (var i = 0; i < array.length; i++) {\n if (isCollection(array[i])) {\n return true;\n }\n }\n\n return false;\n}\n/**\n * Recursively loop over all elements in a given multi dimensional array\n * and invoke the callback on each of the elements.\n * @param {Array | Matrix} array\n * @param {Function} callback The callback method is invoked with one\n * parameter: the current element in the array\n */\n\nexport function deepForEach(array, callback) {\n if (isMatrix(array)) {\n array = array.valueOf();\n }\n\n for (var i = 0, ii = array.length; i < ii; i++) {\n var value = array[i];\n\n if (Array.isArray(value)) {\n deepForEach(value, callback);\n } else {\n callback(value);\n }\n }\n}\n/**\n * Execute the callback function element wise for each element in array and any\n * nested array\n * Returns an array with the results\n * @param {Array | Matrix} array\n * @param {Function} callback The callback is called with two parameters:\n * value1 and value2, which contain the current\n * element of both arrays.\n * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n *\n * @return {Array | Matrix} res\n */\n\nexport function deepMap(array, callback, skipZeros) {\n if (array && typeof array.map === 'function') {\n // TODO: replace array.map with a for loop to improve performance\n return array.map(function (x) {\n return deepMap(x, callback, skipZeros);\n });\n } else {\n return callback(array);\n }\n}\n/**\n * Reduce a given matrix or array to a new matrix or\n * array with one less dimension, applying the given\n * callback in the selected dimension.\n * @param {Array | Matrix} mat\n * @param {number} dim\n * @param {Function} callback\n * @return {Array | Matrix} res\n */\n\nexport function reduce(mat, dim, callback) {\n var size = Array.isArray(mat) ? arraySize(mat) : mat.size();\n\n if (dim < 0 || dim >= size.length) {\n // TODO: would be more clear when throwing a DimensionError here\n throw new IndexError(dim, size.length);\n }\n\n if (isMatrix(mat)) {\n return mat.create(_reduce(mat.valueOf(), dim, callback));\n } else {\n return _reduce(mat, dim, callback);\n }\n}\n/**\n * Recursively reduce a matrix\n * @param {Array} mat\n * @param {number} dim\n * @param {Function} callback\n * @returns {Array} ret\n * @private\n */\n\nfunction _reduce(mat, dim, callback) {\n var i, ret, val, tran;\n\n if (dim <= 0) {\n if (!Array.isArray(mat[0])) {\n val = mat[0];\n\n for (i = 1; i < mat.length; i++) {\n val = callback(val, mat[i]);\n }\n\n return val;\n } else {\n tran = _switch(mat);\n ret = [];\n\n for (i = 0; i < tran.length; i++) {\n ret[i] = _reduce(tran[i], dim - 1, callback);\n }\n\n return ret;\n }\n } else {\n ret = [];\n\n for (i = 0; i < mat.length; i++) {\n ret[i] = _reduce(mat[i], dim - 1, callback);\n }\n\n return ret;\n }\n}\n/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\n\n\nfunction _switch(mat) {\n var I = mat.length;\n var J = mat[0].length;\n var i, j;\n var ret = [];\n\n for (j = 0; j < J; j++) {\n var tmp = [];\n\n for (i = 0; i < I; i++) {\n tmp.push(mat[i][j]);\n }\n\n ret.push(tmp);\n }\n\n return ret;\n} // TODO: document function scatter\n\n\nexport function scatter(a, j, w, x, u, mark, cindex, f, inverse, update, value) {\n // a arrays\n var avalues = a._values;\n var aindex = a._index;\n var aptr = a._ptr; // vars\n\n var k, k0, k1, i; // check we need to process values (pattern matrix)\n\n if (x) {\n // values in j\n for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n // row\n i = aindex[k]; // check value exists in current j\n\n if (w[i] !== mark) {\n // i is new entry in j\n w[i] = mark; // add i to pattern of C\n\n cindex.push(i); // x(i) = A, check we need to call function this time\n\n if (update) {\n // copy value to workspace calling callback function\n x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k]); // function was called on current row\n\n u[i] = mark;\n } else {\n // copy value to workspace\n x[i] = avalues[k];\n }\n } else {\n // i exists in C already\n x[i] = inverse ? f(avalues[k], x[i]) : f(x[i], avalues[k]); // function was called on current row\n\n u[i] = mark;\n }\n }\n } else {\n // values in j\n for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n // row\n i = aindex[k]; // check value exists in current j\n\n if (w[i] !== mark) {\n // i is new entry in j\n w[i] = mark; // add i to pattern of C\n\n cindex.push(i);\n } else {\n // indicate function was called on current row\n u[i] = mark;\n }\n }\n }\n}","import { isInteger, log2, log10, cbrt, expm1, sign, toFixed, log1p } from '../../utils/number.js';\nvar n1 = 'number';\nvar n2 = 'number, number';\nexport function absNumber(a) {\n return Math.abs(a);\n}\nabsNumber.signature = n1;\nexport function addNumber(a, b) {\n return a + b;\n}\naddNumber.signature = n2;\nexport function subtractNumber(a, b) {\n return a - b;\n}\nsubtractNumber.signature = n2;\nexport function multiplyNumber(a, b) {\n return a * b;\n}\nmultiplyNumber.signature = n2;\nexport function divideNumber(a, b) {\n return a / b;\n}\ndivideNumber.signature = n2;\nexport function unaryMinusNumber(x) {\n return -x;\n}\nunaryMinusNumber.signature = n1;\nexport function unaryPlusNumber(x) {\n return x;\n}\nunaryPlusNumber.signature = n1;\nexport function cbrtNumber(x) {\n return cbrt(x);\n}\ncbrtNumber.signature = n1;\nexport function ceilNumber(x) {\n return Math.ceil(x);\n}\nceilNumber.signature = n1;\nexport function cubeNumber(x) {\n return x * x * x;\n}\ncubeNumber.signature = n1;\nexport function expNumber(x) {\n return Math.exp(x);\n}\nexpNumber.signature = n1;\nexport function expm1Number(x) {\n return expm1(x);\n}\nexpm1Number.signature = n1;\nexport function fixNumber(x) {\n return x > 0 ? Math.floor(x) : Math.ceil(x);\n}\nfixNumber.signature = n1;\nexport function floorNumber(x) {\n return Math.floor(x);\n}\nfloorNumber.signature = n1;\n/**\n * Calculate gcd for numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the greatest common denominator of a and b\n */\n\nexport function gcdNumber(a, b) {\n if (!isInteger(a) || !isInteger(b)) {\n throw new Error('Parameters in function gcd must be integer numbers');\n } // https://en.wikipedia.org/wiki/Euclidean_algorithm\n\n\n var r;\n\n while (b !== 0) {\n r = a % b;\n a = b;\n b = r;\n }\n\n return a < 0 ? -a : a;\n}\ngcdNumber.signature = n2;\n/**\n * Calculate lcm for two numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the least common multiple of a and b\n */\n\nexport function lcmNumber(a, b) {\n if (!isInteger(a) || !isInteger(b)) {\n throw new Error('Parameters in function lcm must be integer numbers');\n }\n\n if (a === 0 || b === 0) {\n return 0;\n } // https://en.wikipedia.org/wiki/Euclidean_algorithm\n // evaluate lcm here inline to reduce overhead\n\n\n var t;\n var prod = a * b;\n\n while (b !== 0) {\n t = b;\n b = a % t;\n a = t;\n }\n\n return Math.abs(prod / a);\n}\nlcmNumber.signature = n2;\n/**\n * Calculate the logarithm of a value.\n * @param {number} x\n * @return {number}\n */\n\nexport function logNumber(x) {\n return Math.log(x);\n}\nlogNumber.signature = n1;\n/**\n * Calculate the 10-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\n\nexport function log10Number(x) {\n return log10(x);\n}\nlog10Number.signature = n1;\n/**\n * Calculate the 2-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\n\nexport function log2Number(x) {\n return log2(x);\n}\nlog2Number.signature = n1;\n/**\n * Calculate the natural logarithm of a `number+1`\n * @param {number} x\n * @returns {number}\n */\n\nexport function log1pNumber(x) {\n return log1p(x);\n}\nlog1pNumber.signature = n1;\n/**\n * Calculate the modulus of two numbers\n * @param {number} x\n * @param {number} y\n * @returns {number} res\n * @private\n */\n\nexport function modNumber(x, y) {\n if (y > 0) {\n // We don't use JavaScript's % operator here as this doesn't work\n // correctly for x < 0 and x === 0\n // see https://en.wikipedia.org/wiki/Modulo_operation\n return x - y * Math.floor(x / y);\n } else if (y === 0) {\n return x;\n } else {\n // y < 0\n // TODO: implement mod for a negative divisor\n throw new Error('Cannot calculate mod for a negative divisor');\n }\n}\nmodNumber.signature = n2;\n/**\n * Calculate the nth root of a, solve x^root == a\n * http://rosettacode.org/wiki/Nth_root#JavaScript\n * @param {number} a\n * @param {number} root\n * @private\n */\n\nexport function nthRootNumber(a, root) {\n var inv = root < 0;\n\n if (inv) {\n root = -root;\n }\n\n if (root === 0) {\n throw new Error('Root must be non-zero');\n }\n\n if (a < 0 && Math.abs(root) % 2 !== 1) {\n throw new Error('Root must be odd when a is negative.');\n } // edge cases zero and infinity\n\n\n if (a === 0) {\n return inv ? Infinity : 0;\n }\n\n if (!isFinite(a)) {\n return inv ? 0 : a;\n }\n\n var x = Math.pow(Math.abs(a), 1 / root); // If a < 0, we require that root is an odd integer,\n // so (-1) ^ (1/root) = -1\n\n x = a < 0 ? -x : x;\n return inv ? 1 / x : x; // Very nice algorithm, but fails with nthRoot(-2, 3).\n // Newton's method has some well-known problems at times:\n // https://en.wikipedia.org/wiki/Newton%27s_method#Failure_analysis\n\n /*\n let x = 1 // Initial guess\n let xPrev = 1\n let i = 0\n const iMax = 10000\n do {\n const delta = (a / Math.pow(x, root - 1) - x) / root\n xPrev = x\n x = x + delta\n i++\n }\n while (xPrev !== x && i < iMax)\n if (xPrev !== x) {\n throw new Error('Function nthRoot failed to converge')\n }\n return inv ? 1 / x : x\n */\n}\nnthRootNumber.signature = n2;\nexport function signNumber(x) {\n return sign(x);\n}\nsignNumber.signature = n1;\nexport function sqrtNumber(x) {\n return Math.sqrt(x);\n}\nsqrtNumber.signature = n1;\nexport function squareNumber(x) {\n return x * x;\n}\nsquareNumber.signature = n1;\n/**\n * Calculate xgcd for two numbers\n * @param {number} a\n * @param {number} b\n * @return {number} result\n * @private\n */\n\nexport function xgcdNumber(a, b) {\n // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n var t; // used to swap two variables\n\n var q; // quotient\n\n var r; // remainder\n\n var x = 0;\n var lastx = 1;\n var y = 1;\n var lasty = 0;\n\n if (!isInteger(a) || !isInteger(b)) {\n throw new Error('Parameters in function xgcd must be integer numbers');\n }\n\n while (b) {\n q = Math.floor(a / b);\n r = a - q * b;\n t = x;\n x = lastx - q * x;\n lastx = t;\n t = y;\n y = lasty - q * y;\n lasty = t;\n a = b;\n b = r;\n }\n\n var res;\n\n if (a < 0) {\n res = [-a, -lastx, -lasty];\n } else {\n res = [a, a ? lastx : 0, lasty];\n }\n\n return res;\n}\nxgcdNumber.signature = n2;\n/**\n * Calculates the power of x to y, x^y, for two numbers.\n * @param {number} x\n * @param {number} y\n * @return {number} res\n */\n\nexport function powNumber(x, y) {\n // x^Infinity === 0 if -1 < x < 1\n // A real number 0 is returned instead of complex(0)\n if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {\n return 0;\n }\n\n return Math.pow(x, y);\n}\npowNumber.signature = n2;\n/**\n * round a number to the given number of decimals, or to zero if decimals is\n * not provided\n * @param {number} value\n * @param {number} decimals number of decimals, between 0 and 15 (0 by default)\n * @return {number} roundedValue\n */\n\nexport function roundNumber(value) {\n var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n return parseFloat(toFixed(value, decimals));\n}\nroundNumber.signature = n2;\n/**\n * Calculate the norm of a number, the absolute value.\n * @param {number} x\n * @return {number}\n */\n\nexport function normNumber(x) {\n return Math.abs(x);\n}\nnormNumber.signature = n1;","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { absNumber } from '../../plain/number/index.js';\nvar name = 'abs';\nvar dependencies = ['typed'];\nexport var createAbs = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\n\n /**\n * Calculate the absolute value of a number. For matrices, the function is\n * evaluated element wise.\n *\n * Syntax:\n *\n * math.abs(x)\n *\n * Examples:\n *\n * math.abs(3.5) // returns number 3.5\n * math.abs(-4.2) // returns number 4.2\n *\n * math.abs([3, -5, -1, 0, 2]) // returns Array [3, 5, 1, 0, 2]\n *\n * See also:\n *\n * sign\n *\n * @param {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x\n * A number or matrix for which to get the absolute value\n * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}\n * Absolute value of `x`\n */\n return typed(name, {\n number: absNumber,\n Complex: function Complex(x) {\n return x.abs();\n },\n BigNumber: function BigNumber(x) {\n return x.abs();\n },\n Fraction: function Fraction(x) {\n return x.abs();\n },\n 'Array | Matrix': function ArrayMatrix(x) {\n // deep map collection, skip zeros since abs(0) = 0\n return deepMap(x, this, true);\n },\n Unit: function Unit(x) {\n return x.abs();\n }\n });\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createAbs } from '../../factoriesAny.js';\nexport var absDependencies = {\n typedDependencies,\n createAbs\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createAddScalar } from '../../factoriesAny.js';\nexport var addScalarDependencies = {\n typedDependencies,\n createAddScalar\n};","import { factory } from '../../utils/factory.js';\nimport { addNumber } from '../../plain/number/index.js';\nvar name = 'addScalar';\nvar dependencies = ['typed'];\nexport var createAddScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\n\n /**\n * Add two scalar values, `x + y`.\n * This function is meant for internal use: it is used by the public function\n * `add`\n *\n * This function does not support collections (Array or Matrix).\n *\n * @param {number | BigNumber | Fraction | Complex | Unit} x First value to add\n * @param {number | BigNumber | Fraction | Complex} y Second value to add\n * @return {number | BigNumber | Fraction | Complex | Unit} Sum of `x` and `y`\n * @private\n */\n return typed(name, {\n 'number, number': addNumber,\n 'Complex, Complex': function ComplexComplex(x, y) {\n return x.add(y);\n },\n 'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n return x.plus(y);\n },\n 'Fraction, Fraction': function FractionFraction(x, y) {\n return x.add(y);\n },\n 'Unit, Unit': function UnitUnit(x, y) {\n if (x.value === null || x.value === undefined) throw new Error('Parameter x contains a unit with undefined value');\n if (y.value === null || y.value === undefined) throw new Error('Parameter y contains a unit with undefined value');\n if (!x.equalBase(y)) throw new Error('Units do not match');\n var res = x.clone();\n res.value = this(res.value, y.value);\n res.fixPrefix = false;\n return res;\n }\n });\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createBignumber } from '../../factoriesAny.js';\nexport var bignumberDependencies = {\n BigNumberDependencies,\n typedDependencies,\n createBignumber\n};","import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'bignumber';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createBignumber = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n BigNumber\n } = _ref;\n\n /**\n * Create a BigNumber, which can store numbers with arbitrary precision.\n * When a matrix is provided, all elements will be converted to BigNumber.\n *\n * Syntax:\n *\n * math.bignumber(x)\n *\n * Examples:\n *\n * 0.1 + 0.2 // returns number 0.30000000000000004\n * math.bignumber(0.1) + math.bignumber(0.2) // returns BigNumber 0.3\n *\n *\n * 7.2e500 // returns number Infinity\n * math.bignumber('7.2e500') // returns BigNumber 7.2e500\n *\n * See also:\n *\n * boolean, complex, index, matrix, string, unit\n *\n * @param {number | string | Fraction | BigNumber | Array | Matrix | boolean | null} [value] Value for the big number,\n * 0 by default.\n * @returns {BigNumber} The created bignumber\n */\n return typed('bignumber', {\n '': function _() {\n return new BigNumber(0);\n },\n number: function number(x) {\n // convert to string to prevent errors in case of >15 digits\n return new BigNumber(x + '');\n },\n string: function string(x) {\n var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);\n\n if (wordSizeSuffixMatch) {\n // x has a word size suffix\n var size = wordSizeSuffixMatch[2];\n var n = BigNumber(wordSizeSuffixMatch[1]);\n var twoPowSize = new BigNumber(2).pow(Number(size));\n\n if (n.gt(twoPowSize.sub(1))) {\n throw new SyntaxError(\"String \\\"\".concat(x, \"\\\" is out of range\"));\n }\n\n var twoPowSizeSubOne = new BigNumber(2).pow(Number(size) - 1);\n\n if (n.gte(twoPowSizeSubOne)) {\n return n.sub(twoPowSize);\n } else {\n return n;\n }\n }\n\n return new BigNumber(x);\n },\n BigNumber: function BigNumber(x) {\n // we assume a BigNumber is immutable\n return x;\n },\n Fraction: function Fraction(x) {\n return new BigNumber(x.n).div(x.d).times(x.s);\n },\n null: function _null(x) {\n return new BigNumber(0);\n },\n 'Array | Matrix': function ArrayMatrix(x) {\n return deepMap(x, this);\n }\n });\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { FractionDependencies } from './dependenciesFractionClass.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createFraction } from '../../factoriesAny.js';\nexport var fractionDependencies = {\n FractionDependencies,\n typedDependencies,\n createFraction\n};","import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'fraction';\nvar dependencies = ['typed', 'Fraction'];\nexport var createFraction = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n Fraction\n } = _ref;\n\n /**\n * Create a fraction convert a value to a fraction.\n *\n * Syntax:\n * math.fraction(numerator, denominator)\n * math.fraction({n: numerator, d: denominator})\n * math.fraction(matrix: Array | Matrix) Turn all matrix entries\n * into fractions\n *\n * Examples:\n *\n * math.fraction(1, 3)\n * math.fraction('2/3')\n * math.fraction({n: 2, d: 3})\n * math.fraction([0.2, 0.25, 1.25])\n *\n * See also:\n *\n * bignumber, number, string, unit\n *\n * @param {number | string | Fraction | BigNumber | Array | Matrix} [args]\n * Arguments specifying the numerator and denominator of\n * the fraction\n * @return {Fraction | Array | Matrix} Returns a fraction\n */\n return typed('fraction', {\n number: function number(x) {\n if (!isFinite(x) || isNaN(x)) {\n throw new Error(x + ' cannot be represented as a fraction');\n }\n\n return new Fraction(x);\n },\n string: function string(x) {\n return new Fraction(x);\n },\n 'number, number': function numberNumber(numerator, denominator) {\n return new Fraction(numerator, denominator);\n },\n null: function _null(x) {\n return new Fraction(0);\n },\n BigNumber: function BigNumber(x) {\n return new Fraction(x.toString());\n },\n Fraction: function Fraction(x) {\n return x; // fractions are immutable\n },\n Object: function Object(x) {\n return new Fraction(x);\n },\n 'Array | Matrix': function ArrayMatrix(x) {\n return deepMap(x, this);\n }\n });\n});","import { factory } from '../utils/factory.js';\nimport { deepMap } from '../utils/collection.js';\nvar name = 'number';\nvar dependencies = ['typed'];\n/**\n * Separates the radix, integer part, and fractional part of a non decimal number string\n * @param {string} input string to parse\n * @returns {object} the parts of the string or null if not a valid input\n */\n\nfunction getNonDecimalNumberParts(input) {\n var nonDecimalWithRadixMatch = input.match(/(0[box])([0-9a-fA-F]*)\\.([0-9a-fA-F]*)/);\n\n if (nonDecimalWithRadixMatch) {\n var radix = {\n '0b': 2,\n '0o': 8,\n '0x': 16\n }[nonDecimalWithRadixMatch[1]];\n var integerPart = nonDecimalWithRadixMatch[2];\n var fractionalPart = nonDecimalWithRadixMatch[3];\n return {\n input,\n radix,\n integerPart,\n fractionalPart\n };\n } else {\n return null;\n }\n}\n/**\n * Makes a number from a radix, and integer part, and a fractional part\n * @param {parts} [x] parts of the number string (from getNonDecimalNumberParts)\n * @returns {number} the number\n */\n\n\nfunction makeNumberFromNonDecimalParts(parts) {\n var n = parseInt(parts.integerPart, parts.radix);\n var f = 0;\n\n for (var i = 0; i < parts.fractionalPart.length; i++) {\n var digitValue = parseInt(parts.fractionalPart[i], parts.radix);\n f += digitValue / Math.pow(parts.radix, i + 1);\n }\n\n var result = n + f;\n\n if (isNaN(result)) {\n throw new SyntaxError('String \"' + parts.input + '\" is no valid number');\n }\n\n return result;\n}\n\nexport var createNumber = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\n\n /**\n * Create a number or convert a string, boolean, or unit to a number.\n * When value is a matrix, all elements will be converted to number.\n *\n * Syntax:\n *\n * math.number(value)\n * math.number(unit, valuelessUnit)\n *\n * Examples:\n *\n * math.number(2) // returns number 2\n * math.number('7.2') // returns number 7.2\n * math.number(true) // returns number 1\n * math.number([true, false, true, true]) // returns [1, 0, 1, 1]\n * math.number(math.unit('52cm'), 'm') // returns 0.52\n *\n * See also:\n *\n * bignumber, boolean, complex, index, matrix, string, unit\n *\n * @param {string | number | BigNumber | Fraction | boolean | Array | Matrix | Unit | null} [value] Value to be converted\n * @param {Unit | string} [valuelessUnit] A valueless unit, used to convert a unit to a number\n * @return {number | Array | Matrix} The created number\n */\n var number = typed('number', {\n '': function _() {\n return 0;\n },\n number: function number(x) {\n return x;\n },\n string: function string(x) {\n if (x === 'NaN') return NaN;\n var nonDecimalNumberParts = getNonDecimalNumberParts(x);\n\n if (nonDecimalNumberParts) {\n return makeNumberFromNonDecimalParts(nonDecimalNumberParts);\n }\n\n var size = 0;\n var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);\n\n if (wordSizeSuffixMatch) {\n // x includes a size suffix like 0xffffi32, so we extract\n // the suffix and remove it from x\n size = Number(wordSizeSuffixMatch[2]);\n x = wordSizeSuffixMatch[1];\n }\n\n var num = Number(x);\n\n if (isNaN(num)) {\n throw new SyntaxError('String \"' + x + '\" is no valid number');\n }\n\n if (wordSizeSuffixMatch) {\n // x is a signed bin, oct, or hex literal\n // num is the value of string x if x is interpreted as unsigned\n if (num > 2 ** size - 1) {\n // literal is too large for size suffix\n throw new SyntaxError(\"String \\\"\".concat(x, \"\\\" is out of range\"));\n } // check if the bit at index size - 1 is set and if so do the twos complement\n\n\n if (num >= 2 ** (size - 1)) {\n num = num - 2 ** size;\n }\n }\n\n return num;\n },\n BigNumber: function BigNumber(x) {\n return x.toNumber();\n },\n Fraction: function Fraction(x) {\n return x.valueOf();\n },\n Unit: function Unit(x) {\n throw new Error('Second argument with valueless unit expected');\n },\n null: function _null(x) {\n return 0;\n },\n 'Unit, string | Unit': function UnitStringUnit(unit, valuelessUnit) {\n return unit.toNumber(valuelessUnit);\n },\n 'Array | Matrix': function ArrayMatrix(x) {\n return deepMap(x, this);\n }\n }); // reviver function to parse a JSON object like:\n //\n // {\"mathjs\":\"number\",\"value\":\"2.3\"}\n //\n // into a number 2.3\n\n number.fromJSON = function (json) {\n return parseFloat(json.value);\n };\n\n return number;\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createNumber } from '../../factoriesAny.js';\nexport var numberDependencies = {\n typedDependencies,\n createNumber\n};","export function noBignumber() {\n throw new Error('No \"bignumber\" implementation available');\n}\nexport function noFraction() {\n throw new Error('No \"fraction\" implementation available');\n}\nexport function noMatrix() {\n throw new Error('No \"matrix\" implementation available');\n}\nexport function noIndex() {\n throw new Error('No \"index\" implementation available');\n}\nexport function noSubset() {\n throw new Error('No \"matrix\" implementation available');\n}","import { typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { noBignumber, noFraction } from '../../utils/noop.js';\nvar name = 'numeric';\nvar dependencies = ['number', '?bignumber', '?fraction'];\nexport var createNumeric = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n number: _number,\n bignumber,\n fraction\n } = _ref;\n var validInputTypes = {\n string: true,\n number: true,\n BigNumber: true,\n Fraction: true\n }; // Load the conversion functions for each output type\n\n var validOutputTypes = {\n number: x => _number(x),\n BigNumber: bignumber ? x => bignumber(x) : noBignumber,\n Fraction: fraction ? x => fraction(x) : noFraction\n };\n /**\n * Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.\n *\n * Syntax:\n *\n * math.numeric(x)\n *\n * Examples:\n *\n * math.numeric('4') // returns number 4\n * math.numeric('4', 'number') // returns number 4\n * math.numeric('4', 'BigNumber') // returns BigNumber 4\n * math.numeric('4', 'Fraction') // returns Fraction 4\n * math.numeric(4, 'Fraction') // returns Fraction 4\n * math.numeric(math.fraction(2, 5), 'number') // returns number 0.4\n *\n * See also:\n *\n * number, fraction, bignumber, string, format\n *\n * @param {string | number | BigNumber | Fraction } value\n * A numeric value or a string containing a numeric value\n * @param {string} outputType\n * Desired numeric output type.\n * Available values: 'number', 'BigNumber', or 'Fraction'\n * @return {number | BigNumber | Fraction}\n * Returns an instance of the numeric in the requested type\n */\n\n return function numeric(value, outputType) {\n var inputType = typeOf(value);\n\n if (!(inputType in validInputTypes)) {\n throw new TypeError('Cannot convert ' + value + ' of type \"' + inputType + '\"; valid input types are ' + Object.keys(validInputTypes).join(', '));\n }\n\n if (!(outputType in validOutputTypes)) {\n throw new TypeError('Cannot convert ' + value + ' to type \"' + outputType + '\"; valid output types are ' + Object.keys(validOutputTypes).join(', '));\n }\n\n if (outputType === inputType) {\n return value;\n } else {\n return validOutputTypes[outputType](value);\n }\n };\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { bignumberDependencies } from './dependenciesBignumber.generated.js';\nimport { fractionDependencies } from './dependenciesFraction.generated.js';\nimport { numberDependencies } from './dependenciesNumber.generated.js';\nimport { createNumeric } from '../../factoriesAny.js';\nexport var numericDependencies = {\n bignumberDependencies,\n fractionDependencies,\n numberDependencies,\n createNumeric\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { numericDependencies } from './dependenciesNumeric.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createDivideScalar } from '../../factoriesAny.js';\nexport var divideScalarDependencies = {\n numericDependencies,\n typedDependencies,\n createDivideScalar\n};","import { factory } from '../../utils/factory.js';\nimport { typeOf } from '../../utils/is.js';\nvar name = 'divideScalar';\nvar dependencies = ['typed', 'numeric'];\nexport var createDivideScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n numeric\n } = _ref;\n\n /**\n * Divide two scalar values, `x / y`.\n * This function is meant for internal use: it is used by the public functions\n * `divide` and `inv`.\n *\n * This function does not support collections (Array or Matrix).\n *\n * @param {number | BigNumber | Fraction | Complex | Unit} x Numerator\n * @param {number | BigNumber | Fraction | Complex} y Denominator\n * @return {number | BigNumber | Fraction | Complex | Unit} Quotient, `x / y`\n * @private\n */\n return typed(name, {\n 'number, number': function numberNumber(x, y) {\n return x / y;\n },\n 'Complex, Complex': function ComplexComplex(x, y) {\n return x.div(y);\n },\n 'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n return x.div(y);\n },\n 'Fraction, Fraction': function FractionFraction(x, y) {\n return x.div(y);\n },\n 'Unit, number | Fraction | BigNumber': function UnitNumberFractionBigNumber(x, y) {\n var res = x.clone(); // TODO: move the divide function to Unit.js, it uses internals of Unit\n\n var one = numeric(1, typeOf(y));\n res.value = this(res.value === null ? res._normalize(one) : res.value, y);\n return res;\n },\n 'number | Fraction | BigNumber, Unit': function numberFractionBigNumberUnit(x, y) {\n var res = y.clone();\n res = res.pow(-1); // TODO: move the divide function to Unit.js, it uses internals of Unit\n\n var one = numeric(1, typeOf(x));\n res.value = this(x, y.value === null ? y._normalize(one) : y.value);\n return res;\n },\n 'Unit, Unit': function UnitUnit(x, y) {\n return x.divide(y);\n }\n });\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm03';\nvar dependencies = ['typed'];\nexport var createAlgorithm03 = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\n\n /**\n * Iterates over SparseMatrix items and invokes the callback function f(Dij, Sij).\n * Callback function invoked M*N times.\n *\n *\n * ┌ f(Dij, Sij) ; S(i,j) !== 0\n * C(i,j) = ┤\n * └ f(Dij, 0) ; otherwise\n *\n *\n * @param {Matrix} denseMatrix The DenseMatrix instance (D)\n * @param {Matrix} sparseMatrix The SparseMatrix instance (C)\n * @param {Function} callback The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)\n * @param {boolean} inverse A true value indicates callback should be invoked f(Sij,Dij)\n *\n * @return {Matrix} DenseMatrix (C)\n *\n * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571\n */\n return function algorithm03(denseMatrix, sparseMatrix, callback, inverse) {\n // dense matrix arrays\n var adata = denseMatrix._data;\n var asize = denseMatrix._size;\n var adt = denseMatrix._datatype; // sparse matrix arrays\n\n var bvalues = sparseMatrix._values;\n var bindex = sparseMatrix._index;\n var bptr = sparseMatrix._ptr;\n var bsize = sparseMatrix._size;\n var bdt = sparseMatrix._datatype; // validate dimensions\n\n if (asize.length !== bsize.length) {\n throw new DimensionError(asize.length, bsize.length);\n } // check rows & columns\n\n\n if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n } // sparse matrix cannot be a Pattern matrix\n\n\n if (!bvalues) {\n throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n } // rows & columns\n\n\n var rows = asize[0];\n var columns = asize[1]; // datatype\n\n var dt; // zero value\n\n var zero = 0; // callback signature to use\n\n var cf = callback; // process data types\n\n if (typeof adt === 'string' && adt === bdt) {\n // datatype\n dt = adt; // convert 0 to the same datatype\n\n zero = typed.convert(0, dt); // callback\n\n cf = typed.find(callback, [dt, dt]);\n } // result (DenseMatrix)\n\n\n var cdata = []; // initialize dense matrix\n\n for (var z = 0; z < rows; z++) {\n // initialize row\n cdata[z] = [];\n } // workspace\n\n\n var x = []; // marks indicating we have a value in x for a given column\n\n var w = []; // loop columns in b\n\n for (var j = 0; j < columns; j++) {\n // column mark\n var mark = j + 1; // values in column j\n\n for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n // row\n var i = bindex[k]; // update workspace\n\n x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);\n w[i] = mark;\n } // process workspace\n\n\n for (var y = 0; y < rows; y++) {\n // check we have a calculated value for current row\n if (w[y] === mark) {\n // use calculated value\n cdata[y][j] = x[y];\n } else {\n // calculate value\n cdata[y][j] = inverse ? cf(zero, adata[y][j]) : cf(adata[y][j], zero);\n }\n }\n } // return dense matrix\n\n\n return denseMatrix.createDenseMatrix({\n data: cdata,\n size: [rows, columns],\n datatype: dt\n });\n };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm07';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createAlgorithm07 = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n DenseMatrix\n } = _ref;\n\n /**\n * Iterates over SparseMatrix A and SparseMatrix B items (zero and nonzero) and invokes the callback function f(Aij, Bij).\n * Callback function invoked MxN times.\n *\n * C(i,j) = f(Aij, Bij)\n *\n * @param {Matrix} a The SparseMatrix instance (A)\n * @param {Matrix} b The SparseMatrix instance (B)\n * @param {Function} callback The f(Aij,Bij) operation to invoke\n *\n * @return {Matrix} DenseMatrix (C)\n *\n * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n */\n return function algorithm07(a, b, callback) {\n // sparse matrix arrays\n var asize = a._size;\n var adt = a._datatype; // sparse matrix arrays\n\n var bsize = b._size;\n var bdt = b._datatype; // validate dimensions\n\n if (asize.length !== bsize.length) {\n throw new DimensionError(asize.length, bsize.length);\n } // check rows & columns\n\n\n if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n } // rows & columns\n\n\n var rows = asize[0];\n var columns = asize[1]; // datatype\n\n var dt; // zero value\n\n var zero = 0; // callback signature to use\n\n var cf = callback; // process data types\n\n if (typeof adt === 'string' && adt === bdt) {\n // datatype\n dt = adt; // convert 0 to the same datatype\n\n zero = typed.convert(0, dt); // callback\n\n cf = typed.find(callback, [dt, dt]);\n } // vars\n\n\n var i, j; // result arrays\n\n var cdata = []; // initialize c\n\n for (i = 0; i < rows; i++) {\n cdata[i] = [];\n } // workspaces\n\n\n var xa = [];\n var xb = []; // marks indicating we have a value in x for a given column\n\n var wa = [];\n var wb = []; // loop columns\n\n for (j = 0; j < columns; j++) {\n // columns mark\n var mark = j + 1; // scatter the values of A(:,j) into workspace\n\n _scatter(a, j, wa, xa, mark); // scatter the values of B(:,j) into workspace\n\n\n _scatter(b, j, wb, xb, mark); // loop rows\n\n\n for (i = 0; i < rows; i++) {\n // matrix values @ i,j\n var va = wa[i] === mark ? xa[i] : zero;\n var vb = wb[i] === mark ? xb[i] : zero; // invoke callback\n\n cdata[i][j] = cf(va, vb);\n }\n } // return dense matrix\n\n\n return new DenseMatrix({\n data: cdata,\n size: [rows, columns],\n datatype: dt\n });\n };\n\n function _scatter(m, j, w, x, mark) {\n // a arrays\n var values = m._values;\n var index = m._index;\n var ptr = m._ptr; // loop values in column j\n\n for (var k = ptr[j], k1 = ptr[j + 1]; k < k1; k++) {\n // row\n var i = index[k]; // update workspace\n\n w[i] = mark;\n x[i] = values[k];\n }\n }\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'algorithm12';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createAlgorithm12 = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n DenseMatrix\n } = _ref;\n\n /**\n * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).\n * Callback function invoked MxN times.\n *\n *\n * ┌ f(Sij, b) ; S(i,j) !== 0\n * C(i,j) = ┤\n * └ f(0, b) ; otherwise\n *\n *\n * @param {Matrix} s The SparseMatrix instance (S)\n * @param {Scalar} b The Scalar value\n * @param {Function} callback The f(Aij,b) operation to invoke\n * @param {boolean} inverse A true value indicates callback should be invoked f(b,Sij)\n *\n * @return {Matrix} DenseMatrix (C)\n *\n * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n */\n return function algorithm12(s, b, callback, inverse) {\n // sparse matrix arrays\n var avalues = s._values;\n var aindex = s._index;\n var aptr = s._ptr;\n var asize = s._size;\n var adt = s._datatype; // sparse matrix cannot be a Pattern matrix\n\n if (!avalues) {\n throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n } // rows & columns\n\n\n var rows = asize[0];\n var columns = asize[1]; // datatype\n\n var dt; // callback signature to use\n\n var cf = callback; // process data types\n\n if (typeof adt === 'string') {\n // datatype\n dt = adt; // convert b to the same datatype\n\n b = typed.convert(b, dt); // callback\n\n cf = typed.find(callback, [dt, dt]);\n } // result arrays\n\n\n var cdata = []; // workspaces\n\n var x = []; // marks indicating we have a value in x for a given column\n\n var w = []; // loop columns\n\n for (var j = 0; j < columns; j++) {\n // columns mark\n var mark = j + 1; // values in j\n\n for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n // row\n var r = aindex[k]; // update workspace\n\n x[r] = avalues[k];\n w[r] = mark;\n } // loop rows\n\n\n for (var i = 0; i < rows; i++) {\n // initialize C on first column\n if (j === 0) {\n // create row array\n cdata[i] = [];\n } // check sparse matrix has a value @ i,j\n\n\n if (w[i] === mark) {\n // invoke callback, update C\n cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);\n } else {\n // dense matrix value @ i, j\n cdata[i][j] = inverse ? cf(b, 0) : cf(0, b);\n }\n }\n } // return dense matrix\n\n\n return new DenseMatrix({\n data: cdata,\n size: [rows, columns],\n datatype: dt\n });\n };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm13';\nvar dependencies = ['typed'];\nexport var createAlgorithm13 = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\n\n /**\n * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, Bij..z).\n * Callback function invoked MxN times.\n *\n * C(i,j,...z) = f(Aij..z, Bij..z)\n *\n * @param {Matrix} a The DenseMatrix instance (A)\n * @param {Matrix} b The DenseMatrix instance (B)\n * @param {Function} callback The f(Aij..z,Bij..z) operation to invoke\n *\n * @return {Matrix} DenseMatrix (C)\n *\n * https://github.com/josdejong/mathjs/pull/346#issuecomment-97658658\n */\n return function algorithm13(a, b, callback) {\n // a arrays\n var adata = a._data;\n var asize = a._size;\n var adt = a._datatype; // b arrays\n\n var bdata = b._data;\n var bsize = b._size;\n var bdt = b._datatype; // c arrays\n\n var csize = []; // validate dimensions\n\n if (asize.length !== bsize.length) {\n throw new DimensionError(asize.length, bsize.length);\n } // validate each one of the dimension sizes\n\n\n for (var s = 0; s < asize.length; s++) {\n // must match\n if (asize[s] !== bsize[s]) {\n throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n } // update dimension in c\n\n\n csize[s] = asize[s];\n } // datatype\n\n\n var dt; // callback signature to use\n\n var cf = callback; // process data types\n\n if (typeof adt === 'string' && adt === bdt) {\n // datatype\n dt = adt; // callback\n\n cf = typed.find(callback, [dt, dt]);\n } // populate cdata, iterate through dimensions\n\n\n var cdata = csize.length > 0 ? _iterate(cf, 0, csize, csize[0], adata, bdata) : []; // c matrix\n\n return a.createDenseMatrix({\n data: cdata,\n size: csize,\n datatype: dt\n });\n }; // recursive function\n\n function _iterate(f, level, s, n, av, bv) {\n // initialize array for this level\n var cv = []; // check we reach the last level\n\n if (level === s.length - 1) {\n // loop arrays in last level\n for (var i = 0; i < n; i++) {\n // invoke callback and store value\n cv[i] = f(av[i], bv[i]);\n }\n } else {\n // iterate current level\n for (var j = 0; j < n; j++) {\n // iterate next level\n cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv[j]);\n }\n }\n\n return cv;\n }\n});","import { factory } from '../../../utils/factory.js';\nimport { clone } from '../../../utils/object.js';\nvar name = 'algorithm14';\nvar dependencies = ['typed'];\nexport var createAlgorithm14 = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\n\n /**\n * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, b).\n * Callback function invoked MxN times.\n *\n * C(i,j,...z) = f(Aij..z, b)\n *\n * @param {Matrix} a The DenseMatrix instance (A)\n * @param {Scalar} b The Scalar value\n * @param {Function} callback The f(Aij..z,b) operation to invoke\n * @param {boolean} inverse A true value indicates callback should be invoked f(b,Aij..z)\n *\n * @return {Matrix} DenseMatrix (C)\n *\n * https://github.com/josdejong/mathjs/pull/346#issuecomment-97659042\n */\n return function algorithm14(a, b, callback, inverse) {\n // a arrays\n var adata = a._data;\n var asize = a._size;\n var adt = a._datatype; // datatype\n\n var dt; // callback signature to use\n\n var cf = callback; // process data types\n\n if (typeof adt === 'string') {\n // datatype\n dt = adt; // convert b to the same datatype\n\n b = typed.convert(b, dt); // callback\n\n cf = typed.find(callback, [dt, dt]);\n } // populate cdata, iterate through dimensions\n\n\n var cdata = asize.length > 0 ? _iterate(cf, 0, asize, asize[0], adata, b, inverse) : []; // c matrix\n\n return a.createDenseMatrix({\n data: cdata,\n size: clone(asize),\n datatype: dt\n });\n }; // recursive function\n\n function _iterate(f, level, s, n, av, bv, inverse) {\n // initialize array for this level\n var cv = []; // check we reach the last level\n\n if (level === s.length - 1) {\n // loop arrays in last level\n for (var i = 0; i < n; i++) {\n // invoke callback and store value\n cv[i] = inverse ? f(bv, av[i]) : f(av[i], bv);\n }\n } else {\n // iterate current level\n for (var j = 0; j < n; j++) {\n // iterate next level\n cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv, inverse);\n }\n }\n\n return cv;\n }\n});","import { factory } from '../../utils/factory.js';\nimport { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';\nimport { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js';\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';\nvar name = 'equal';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];\nexport var createEqual = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n matrix,\n equalScalar,\n DenseMatrix\n } = _ref;\n var algorithm03 = createAlgorithm03({\n typed\n });\n var algorithm07 = createAlgorithm07({\n typed,\n DenseMatrix\n });\n var algorithm12 = createAlgorithm12({\n typed,\n DenseMatrix\n });\n var algorithm13 = createAlgorithm13({\n typed\n });\n var algorithm14 = createAlgorithm14({\n typed\n });\n /**\n * Test whether two values are equal.\n *\n * The function tests whether the relative difference between x and y is\n * smaller than the configured epsilon. The function cannot be used to\n * compare values smaller than approximately 2.22e-16.\n *\n * For matrices, the function is evaluated element wise.\n * In case of complex numbers, x.re must equal y.re, and x.im must equal y.im.\n *\n * Values `null` and `undefined` are compared strictly, thus `null` is only\n * equal to `null` and nothing else, and `undefined` is only equal to\n * `undefined` and nothing else. Strings are compared by their numerical value.\n *\n * Syntax:\n *\n * math.equal(x, y)\n *\n * Examples:\n *\n * math.equal(2 + 2, 3) // returns false\n * math.equal(2 + 2, 4) // returns true\n *\n * const a = math.unit('50 cm')\n * const b = math.unit('5 m')\n * math.equal(a, b) // returns true\n *\n * const c = [2, 5, 1]\n * const d = [2, 7, 1]\n *\n * math.equal(c, d) // returns [true, false, true]\n * math.deepEqual(c, d) // returns false\n *\n * math.equal(\"1000\", \"1e3\") // returns true\n * math.equal(0, null) // returns false\n *\n * See also:\n *\n * unequal, smaller, smallerEq, larger, largerEq, compare, deepEqual, equalText\n *\n * @param {number | BigNumber | boolean | Complex | Unit | string | Array | Matrix} x First value to compare\n * @param {number | BigNumber | boolean | Complex | Unit | string | Array | Matrix} y Second value to compare\n * @return {boolean | Array | Matrix} Returns true when the compared values are equal, else returns false\n */\n\n return typed(name, {\n 'any, any': function anyAny(x, y) {\n // strict equality for null and undefined?\n if (x === null) {\n return y === null;\n }\n\n if (y === null) {\n return x === null;\n }\n\n if (x === undefined) {\n return y === undefined;\n }\n\n if (y === undefined) {\n return x === undefined;\n }\n\n return equalScalar(x, y);\n },\n 'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n return algorithm07(x, y, equalScalar);\n },\n 'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n return algorithm03(y, x, equalScalar, true);\n },\n 'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n return algorithm03(x, y, equalScalar, false);\n },\n 'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n return algorithm13(x, y, equalScalar);\n },\n 'Array, Array': function ArrayArray(x, y) {\n // use matrix implementation\n return this(matrix(x), matrix(y)).valueOf();\n },\n 'Array, Matrix': function ArrayMatrix(x, y) {\n // use matrix implementation\n return this(matrix(x), y);\n },\n 'Matrix, Array': function MatrixArray(x, y) {\n // use matrix implementation\n return this(x, matrix(y));\n },\n 'SparseMatrix, any': function SparseMatrixAny(x, y) {\n return algorithm12(x, y, equalScalar, false);\n },\n 'DenseMatrix, any': function DenseMatrixAny(x, y) {\n return algorithm14(x, y, equalScalar, false);\n },\n 'any, SparseMatrix': function anySparseMatrix(x, y) {\n return algorithm12(y, x, equalScalar, true);\n },\n 'any, DenseMatrix': function anyDenseMatrix(x, y) {\n return algorithm14(y, x, equalScalar, true);\n },\n 'Array, any': function ArrayAny(x, y) {\n // use matrix implementation\n return algorithm14(matrix(x), y, equalScalar, false).valueOf();\n },\n 'any, Array': function anyArray(x, y) {\n // use matrix implementation\n return algorithm14(matrix(y), x, equalScalar, true).valueOf();\n }\n });\n});\nexport var createEqualNumber = factory(name, ['typed', 'equalScalar'], _ref2 => {\n var {\n typed,\n equalScalar\n } = _ref2;\n return typed(name, {\n 'any, any': function anyAny(x, y) {\n // strict equality for null and undefined?\n if (x === null) {\n return y === null;\n }\n\n if (y === null) {\n return x === null;\n }\n\n if (x === undefined) {\n return y === undefined;\n }\n\n if (y === undefined) {\n return x === undefined;\n }\n\n return equalScalar(x, y);\n }\n });\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';\nimport { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createEqual } from '../../factoriesAny.js';\nexport var equalDependencies = {\n DenseMatrixDependencies,\n equalScalarDependencies,\n matrixDependencies,\n typedDependencies,\n createEqual\n};","import { isBigNumber } from '../../utils/is.js';\nimport { isInteger } from '../../utils/number.js';\nimport { resize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'zeros';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber'];\nexport var createZeros = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n config,\n matrix,\n BigNumber\n } = _ref;\n\n /**\n * Create a matrix filled with zeros. The created matrix can have one or\n * multiple dimensions.\n *\n * Syntax:\n *\n * math.zeros(m)\n * math.zeros(m, format)\n * math.zeros(m, n)\n * math.zeros(m, n, format)\n * math.zeros([m, n])\n * math.zeros([m, n], format)\n *\n * Examples:\n *\n * math.zeros(3) // returns [0, 0, 0]\n * math.zeros(3, 2) // returns [[0, 0], [0, 0], [0, 0]]\n * math.zeros(3, 'dense') // returns [0, 0, 0]\n *\n * const A = [[1, 2, 3], [4, 5, 6]]\n * math.zeros(math.size(A)) // returns [[0, 0, 0], [0, 0, 0]]\n *\n * See also:\n *\n * ones, identity, size, range\n *\n * @param {...number | Array} size The size of each dimension of the matrix\n * @param {string} [format] The Matrix storage format\n *\n * @return {Array | Matrix} A matrix filled with zeros\n */\n return typed(name, {\n '': function _() {\n return config.matrix === 'Array' ? _zeros([]) : _zeros([], 'default');\n },\n // math.zeros(m, n, p, ..., format)\n // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this\n '...number | BigNumber | string': function numberBigNumberString(size) {\n var last = size[size.length - 1];\n\n if (typeof last === 'string') {\n var format = size.pop();\n return _zeros(size, format);\n } else if (config.matrix === 'Array') {\n return _zeros(size);\n } else {\n return _zeros(size, 'default');\n }\n },\n Array: _zeros,\n Matrix: function Matrix(size) {\n var format = size.storage();\n return _zeros(size.valueOf(), format);\n },\n 'Array | Matrix, string': function ArrayMatrixString(size, format) {\n return _zeros(size.valueOf(), format);\n }\n });\n /**\n * Create an Array or Matrix with zeros\n * @param {Array} size\n * @param {string} [format='default']\n * @return {Array | Matrix}\n * @private\n */\n\n function _zeros(size, format) {\n var hasBigNumbers = _normalize(size);\n\n var defaultValue = hasBigNumbers ? new BigNumber(0) : 0;\n\n _validate(size);\n\n if (format) {\n // return a matrix\n var m = matrix(format);\n\n if (size.length > 0) {\n return m.resize(size, defaultValue);\n }\n\n return m;\n } else {\n // return an Array\n var arr = [];\n\n if (size.length > 0) {\n return resize(arr, size, defaultValue);\n }\n\n return arr;\n }\n } // replace BigNumbers with numbers, returns true if size contained BigNumbers\n\n\n function _normalize(size) {\n var hasBigNumbers = false;\n size.forEach(function (value, index, arr) {\n if (isBigNumber(value)) {\n hasBigNumbers = true;\n arr[index] = value.toNumber();\n }\n });\n return hasBigNumbers;\n } // validate arguments\n\n\n function _validate(size) {\n size.forEach(function (value) {\n if (typeof value !== 'number' || !isInteger(value) || value < 0) {\n throw new Error('Parameters in function zeros must be positive integers');\n }\n });\n }\n}); // TODO: zeros contains almost the same code as ones. Reuse this?","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createZeros } from '../../factoriesAny.js';\nexport var zerosDependencies = {\n BigNumberDependencies,\n matrixDependencies,\n typedDependencies,\n createZeros\n};","export default function _defineProperty(obj, key, value) {\n if (key in obj) {\n Object.defineProperty(obj, key, {\n value: value,\n enumerable: true,\n configurable: true,\n writable: true\n });\n } else {\n obj[key] = value;\n }\n\n return obj;\n}","import { factory } from '../../../utils/factory.js';\nvar name = 'algorithm11';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm11 = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n equalScalar\n } = _ref;\n\n /**\n * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).\n * Callback function invoked NZ times (number of nonzero items in S).\n *\n *\n * ┌ f(Sij, b) ; S(i,j) !== 0\n * C(i,j) = ┤\n * └ 0 ; otherwise\n *\n *\n * @param {Matrix} s The SparseMatrix instance (S)\n * @param {Scalar} b The Scalar value\n * @param {Function} callback The f(Aij,b) operation to invoke\n * @param {boolean} inverse A true value indicates callback should be invoked f(b,Sij)\n *\n * @return {Matrix} SparseMatrix (C)\n *\n * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n */\n return function algorithm11(s, b, callback, inverse) {\n // sparse matrix arrays\n var avalues = s._values;\n var aindex = s._index;\n var aptr = s._ptr;\n var asize = s._size;\n var adt = s._datatype; // sparse matrix cannot be a Pattern matrix\n\n if (!avalues) {\n throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n } // rows & columns\n\n\n var rows = asize[0];\n var columns = asize[1]; // datatype\n\n var dt; // equal signature to use\n\n var eq = equalScalar; // zero value\n\n var zero = 0; // callback signature to use\n\n var cf = callback; // process data types\n\n if (typeof adt === 'string') {\n // datatype\n dt = adt; // find signature that matches (dt, dt)\n\n eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n zero = typed.convert(0, dt); // convert b to the same datatype\n\n b = typed.convert(b, dt); // callback\n\n cf = typed.find(callback, [dt, dt]);\n } // result arrays\n\n\n var cvalues = [];\n var cindex = [];\n var cptr = []; // loop columns\n\n for (var j = 0; j < columns; j++) {\n // initialize ptr\n cptr[j] = cindex.length; // values in j\n\n for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n // row\n var i = aindex[k]; // invoke callback\n\n var v = inverse ? cf(b, avalues[k]) : cf(avalues[k], b); // check value is zero\n\n if (!eq(v, zero)) {\n // push index & value\n cindex.push(i);\n cvalues.push(v);\n }\n }\n } // update ptr\n\n\n cptr[columns] = cindex.length; // return sparse matrix\n\n return s.createSparseMatrix({\n values: cvalues,\n index: cindex,\n ptr: cptr,\n size: [rows, columns],\n datatype: dt\n });\n };\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\n\nimport { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { isInteger } from '../../utils/number.js';\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';\nimport { roundNumber } from '../../plain/number/index.js';\nvar NO_INT = 'Number of decimals in function round must be an integer';\nvar name = 'round';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'BigNumber', 'DenseMatrix'];\nexport var createRound = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n matrix,\n equalScalar,\n zeros,\n BigNumber,\n DenseMatrix\n } = _ref;\n var algorithm11 = createAlgorithm11({\n typed,\n equalScalar\n });\n var algorithm12 = createAlgorithm12({\n typed,\n DenseMatrix\n });\n var algorithm14 = createAlgorithm14({\n typed\n });\n /**\n * Round a value towards the nearest integer.\n * For matrices, the function is evaluated element wise.\n *\n * Syntax:\n *\n * math.round(x)\n * math.round(x, n)\n *\n * Examples:\n *\n * math.round(3.22) // returns number 3\n * math.round(3.82) // returns number 4\n * math.round(-4.2) // returns number -4\n * math.round(-4.7) // returns number -5\n * math.round(3.22, 1) // returns number 3.2\n * math.round(3.88, 1) // returns number 3.9\n * math.round(-4.21, 1) // returns number -4.2\n * math.round(-4.71, 1) // returns number -4.7\n * math.round(math.pi, 3) // returns number 3.142\n * math.round(123.45678, 2) // returns number 123.46\n *\n * const c = math.complex(3.2, -2.7)\n * math.round(c) // returns Complex 3 - 3i\n *\n * math.round([3.2, 3.8, -4.7]) // returns Array [3, 4, -5]\n *\n * See also:\n *\n * ceil, fix, floor\n *\n * @param {number | BigNumber | Fraction | Complex | Array | Matrix} x Number to be rounded\n * @param {number | BigNumber | Array} [n=0] Number of decimals\n * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value\n */\n\n return typed(name, _objectSpread(_objectSpread({}, roundNumberSignatures), {}, {\n Complex: function Complex(x) {\n return x.round();\n },\n 'Complex, number': function ComplexNumber(x, n) {\n if (n % 1) {\n throw new TypeError(NO_INT);\n }\n\n return x.round(n);\n },\n 'Complex, BigNumber': function ComplexBigNumber(x, n) {\n if (!n.isInteger()) {\n throw new TypeError(NO_INT);\n }\n\n var _n = n.toNumber();\n\n return x.round(_n);\n },\n 'number, BigNumber': function numberBigNumber(x, n) {\n if (!n.isInteger()) {\n throw new TypeError(NO_INT);\n }\n\n return new BigNumber(x).toDecimalPlaces(n.toNumber());\n },\n BigNumber: function BigNumber(x) {\n return x.toDecimalPlaces(0);\n },\n 'BigNumber, BigNumber': function BigNumberBigNumber(x, n) {\n if (!n.isInteger()) {\n throw new TypeError(NO_INT);\n }\n\n return x.toDecimalPlaces(n.toNumber());\n },\n Fraction: function Fraction(x) {\n return x.round();\n },\n 'Fraction, number': function FractionNumber(x, n) {\n if (n % 1) {\n throw new TypeError(NO_INT);\n }\n\n return x.round(n);\n },\n 'Array | Matrix': function ArrayMatrix(x) {\n // deep map collection, skip zeros since round(0) = 0\n return deepMap(x, this, true);\n },\n 'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n return algorithm11(x, y, this, false);\n },\n 'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n return algorithm14(x, y, this, false);\n },\n 'number | Complex | BigNumber, SparseMatrix': function numberComplexBigNumberSparseMatrix(x, y) {\n // check scalar is zero\n if (equalScalar(x, 0)) {\n // do not execute algorithm, result will be a zero matrix\n return zeros(y.size(), y.storage());\n }\n\n return algorithm12(y, x, this, true);\n },\n 'number | Complex | BigNumber, DenseMatrix': function numberComplexBigNumberDenseMatrix(x, y) {\n // check scalar is zero\n if (equalScalar(x, 0)) {\n // do not execute algorithm, result will be a zero matrix\n return zeros(y.size(), y.storage());\n }\n\n return algorithm14(y, x, this, true);\n },\n 'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n // use matrix implementation\n return algorithm14(matrix(x), y, this, false).valueOf();\n },\n 'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {\n // use matrix implementation\n return algorithm14(matrix(y), x, this, true).valueOf();\n }\n }));\n});\nvar roundNumberSignatures = {\n number: roundNumber,\n 'number, number': function numberNumber(x, n) {\n if (!isInteger(n)) {\n throw new TypeError(NO_INT);\n }\n\n if (n < 0 || n > 15) {\n throw new Error('Number of decimals in function round must be in the range of 0-15');\n }\n\n return roundNumber(x, n);\n }\n};\nexport var createRoundNumber = /* #__PURE__ */factory(name, ['typed'], _ref2 => {\n var {\n typed\n } = _ref2;\n return typed(name, roundNumberSignatures);\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';\nimport { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';\nimport { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { zerosDependencies } from './dependenciesZeros.generated.js';\nimport { createRound } from '../../factoriesAny.js';\nexport var roundDependencies = {\n BigNumberDependencies,\n DenseMatrixDependencies,\n equalScalarDependencies,\n matrixDependencies,\n typedDependencies,\n zerosDependencies,\n createRound\n};","import Decimal from 'decimal.js';\nimport { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { ceilNumber } from '../../plain/number/index.js';\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';\nvar name = 'ceil';\nvar dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar'];\nexport var createCeil = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n config,\n round,\n matrix,\n equalScalar\n } = _ref;\n var algorithm11 = createAlgorithm11({\n typed,\n equalScalar\n });\n var algorithm14 = createAlgorithm14({\n typed\n });\n /**\n * Round a value towards plus infinity\n * If `x` is complex, both real and imaginary part are rounded towards plus infinity.\n * For matrices, the function is evaluated element wise.\n *\n * Syntax:\n *\n * math.ceil(x)\n * math.ceil(x, n)\n *\n * Examples:\n *\n * math.ceil(3.2) // returns number 4\n * math.ceil(3.8) // returns number 4\n * math.ceil(-4.2) // returns number -4\n * math.ceil(-4.7) // returns number -4\n *\n * math.ceil(3.212, 2) // returns number 3.22\n * math.ceil(3.288, 2) // returns number 3.29\n * math.ceil(-4.212, 2) // returns number -4.21\n * math.ceil(-4.782, 2) // returns number -4.78\n *\n * const c = math.complex(3.24, -2.71)\n * math.ceil(c) // returns Complex 4 - 2i\n * math.ceil(c, 1) // returns Complex 3.3 - 2.7i\n *\n * math.ceil([3.2, 3.8, -4.7]) // returns Array [4, 4, -4]\n * math.ceil([3.21, 3.82, -4.71], 1) // returns Array [3.3, 3.9, -4.7]\n *\n * See also:\n *\n * floor, fix, round\n *\n * @param {number | BigNumber | Fraction | Complex | Array | Matrix} x Number to be rounded\n * @param {number | BigNumber | Array} [n=0] Number of decimals\n * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value\n */\n\n return typed('ceil', {\n number: function number(x) {\n if (nearlyEqual(x, round(x), config.epsilon)) {\n return round(x);\n } else {\n return ceilNumber(x);\n }\n },\n 'number, number': function numberNumber(x, n) {\n if (nearlyEqual(x, round(x, n), config.epsilon)) {\n return round(x, n);\n } else {\n var [number, exponent] = \"\".concat(x, \"e\").split('e');\n var result = Math.ceil(Number(\"\".concat(number, \"e\").concat(Number(exponent) + n)));\n [number, exponent] = \"\".concat(result, \"e\").split('e');\n return Number(\"\".concat(number, \"e\").concat(Number(exponent) - n));\n }\n },\n Complex: function Complex(x) {\n return x.ceil();\n },\n 'Complex, number': function ComplexNumber(x, n) {\n return x.ceil(n);\n },\n BigNumber: function BigNumber(x) {\n if (bigNearlyEqual(x, round(x), config.epsilon)) {\n return round(x);\n } else {\n return x.ceil();\n }\n },\n 'BigNumber, BigNumber': function BigNumberBigNumber(x, n) {\n if (bigNearlyEqual(x, round(x, n), config.epsilon)) {\n return round(x, n);\n } else {\n return x.toDecimalPlaces(n.toNumber(), Decimal.ROUND_CEIL);\n }\n },\n Fraction: function Fraction(x) {\n return x.ceil();\n },\n 'Fraction, number': function FractionNumber(x, n) {\n return x.ceil(n);\n },\n 'Array | Matrix': function ArrayMatrix(x) {\n // deep map collection, skip zeros since ceil(0) = 0\n return deepMap(x, this, true);\n },\n 'Array | Matrix, number': function ArrayMatrixNumber(x, n) {\n // deep map collection, skip zeros since ceil(0) = 0\n return deepMap(x, i => this(i, n), true);\n },\n 'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n return algorithm11(x, y, this, false);\n },\n 'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n return algorithm14(x, y, this, false);\n },\n 'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {\n // use matrix implementation\n return algorithm14(matrix(y), x, this, true).valueOf();\n }\n });\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { roundDependencies } from './dependenciesRound.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createCeil } from '../../factoriesAny.js';\nexport var ceilDependencies = {\n equalScalarDependencies,\n matrixDependencies,\n roundDependencies,\n typedDependencies,\n createCeil\n};","import Decimal from 'decimal.js';\nimport { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';\nvar name = 'floor';\nvar dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar'];\nexport var createFloor = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n config,\n round,\n matrix,\n equalScalar\n } = _ref;\n var algorithm11 = createAlgorithm11({\n typed,\n equalScalar\n });\n var algorithm14 = createAlgorithm14({\n typed\n });\n /**\n * Round a value towards minus infinity.\n * For matrices, the function is evaluated element wise.\n *\n * Syntax:\n *\n * math.floor(x)\n * math.floor(x, n)\n *\n * Examples:\n *\n * math.floor(3.2) // returns number 3\n * math.floor(3.8) // returns number 3\n * math.floor(-4.2) // returns number -5\n * math.floor(-4.7) // returns number -5\n *\n * math.floor(3.212, 2) // returns number 3.21\n * math.floor(3.288, 2) // returns number 3.28\n * math.floor(-4.212, 2) // returns number -4.22\n * math.floor(-4.782, 2) // returns number -4.79\n *\n * const c = math.complex(3.24, -2.71)\n * math.floor(c) // returns Complex 3 - 3i\n * math.floor(c, 1) // returns Complex 3.2 - 2.8i\n *\n * math.floor([3.2, 3.8, -4.7]) // returns Array [3, 3, -5]\n * math.floor([3.21, 3.82, -4.71], 1) // returns Array [3.2, 3.8, -4.8]\n *\n * See also:\n *\n * ceil, fix, round\n *\n * @param {number | BigNumber | Fraction | Complex | Array | Matrix} x Number to be rounded\n * @param {number | BigNumber | Array} [n=0] Number of decimals\n * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value\n */\n\n return typed('floor', {\n number: function number(x) {\n if (nearlyEqual(x, round(x), config.epsilon)) {\n return round(x);\n } else {\n return Math.floor(x);\n }\n },\n 'number, number': function numberNumber(x, n) {\n if (nearlyEqual(x, round(x, n), config.epsilon)) {\n return round(x, n);\n } else {\n var [number, exponent] = \"\".concat(x, \"e\").split('e');\n var result = Math.floor(Number(\"\".concat(number, \"e\").concat(Number(exponent) + n)));\n [number, exponent] = \"\".concat(result, \"e\").split('e');\n return Number(\"\".concat(number, \"e\").concat(Number(exponent) - n));\n }\n },\n Complex: function Complex(x) {\n return x.floor();\n },\n 'Complex, number': function ComplexNumber(x, n) {\n return x.floor(n);\n },\n BigNumber: function BigNumber(x) {\n if (bigNearlyEqual(x, round(x), config.epsilon)) {\n return round(x);\n } else {\n return x.floor();\n }\n },\n 'BigNumber, BigNumber': function BigNumberBigNumber(x, n) {\n if (bigNearlyEqual(x, round(x, n), config.epsilon)) {\n return round(x, n);\n } else {\n return x.toDecimalPlaces(n.toNumber(), Decimal.ROUND_FLOOR);\n }\n },\n Fraction: function Fraction(x) {\n return x.floor();\n },\n 'Fraction, number': function FractionNumber(x, n) {\n return x.floor(n);\n },\n 'Array | Matrix': function ArrayMatrix(x) {\n // deep map collection, skip zeros since floor(0) = 0\n return deepMap(x, this, true);\n },\n 'Array | Matrix, number': function ArrayMatrixNumber(x, n) {\n // deep map collection, skip zeros since ceil(0) = 0\n return deepMap(x, i => this(i, n), true);\n },\n 'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n return algorithm11(x, y, this, false);\n },\n 'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n return algorithm14(x, y, this, false);\n },\n 'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {\n // use matrix implementation\n return algorithm14(matrix(y), x, this, true).valueOf();\n }\n });\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { ComplexDependencies } from './dependenciesComplexClass.generated.js';\nimport { ceilDependencies } from './dependenciesCeil.generated.js';\nimport { floorDependencies } from './dependenciesFloor.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createFix } from '../../factoriesAny.js';\nexport var fixDependencies = {\n ComplexDependencies,\n ceilDependencies,\n floorDependencies,\n matrixDependencies,\n typedDependencies,\n createFix\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { roundDependencies } from './dependenciesRound.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createFloor } from '../../factoriesAny.js';\nexport var floorDependencies = {\n equalScalarDependencies,\n matrixDependencies,\n roundDependencies,\n typedDependencies,\n createFloor\n};","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';\nvar name = 'fix';\nvar dependencies = ['typed', 'Complex', 'matrix', 'ceil', 'floor'];\nexport var createFix = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n Complex: _Complex,\n matrix,\n ceil,\n floor\n } = _ref;\n var algorithm14 = createAlgorithm14({\n typed\n });\n /**\n * Round a value towards zero.\n * For matrices, the function is evaluated element wise.\n *\n * Syntax:\n *\n * math.fix(x)\n *\n * Examples:\n *\n * math.fix(3.2) // returns number 3\n * math.fix(3.8) // returns number 3\n * math.fix(-4.2) // returns number -4\n * math.fix(-4.7) // returns number -4\n *\n * math.fix(3.12, 1) // returns number 3.1\n * math.fix(3.18, 1) // returns number 3.1\n * math.fix(-4.12, 1) // returns number -4.1\n * math.fix(-4.17, 1) // returns number -4.1\n *\n * const c = math.complex(3.22, -2.78)\n * math.fix(c) // returns Complex 3 - 2i\n * math.fix(c, 1) // returns Complex 3.2 - 2.7i\n *\n * math.fix([3.2, 3.8, -4.7]) // returns Array [3, 3, -4]\n * math.fix([3.2, 3.8, -4.7], 1) // returns Array [3.2, 3.8, -4.7]\n *\n * See also:\n *\n * ceil, floor, round\n *\n * @param {number | BigNumber | Fraction | Complex | Array | Matrix} x Number to be rounded\n * @param {number | BigNumber | Array} [n=0] Number of decimals\n * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value\n */\n\n return typed('fix', {\n number: function number(x) {\n return x > 0 ? floor(x) : ceil(x);\n },\n 'number, number | BigNumber': function numberNumberBigNumber(x, n) {\n return x > 0 ? floor(x, n) : ceil(x, n);\n },\n Complex: function Complex(x) {\n return new _Complex(x.re > 0 ? Math.floor(x.re) : Math.ceil(x.re), x.im > 0 ? Math.floor(x.im) : Math.ceil(x.im));\n },\n 'Complex, number | BigNumber': function ComplexNumberBigNumber(x, n) {\n return new _Complex(x.re > 0 ? floor(x.re, n) : ceil(x.re, n), x.im > 0 ? floor(x.im, n) : ceil(x.im, n));\n },\n BigNumber: function BigNumber(x) {\n return x.isNegative() ? ceil(x) : floor(x);\n },\n 'BigNumber, number | BigNumber': function BigNumberNumberBigNumber(x, n) {\n return x.isNegative() ? ceil(x, n) : floor(x, n);\n },\n Fraction: function Fraction(x) {\n return x.s < 0 ? x.ceil() : x.floor();\n },\n 'Fraction, number | BigNumber': function FractionNumberBigNumber(x, n) {\n return x.s < 0 ? x.ceil(n) : x.floor(n);\n },\n 'Array | Matrix': function ArrayMatrix(x) {\n // deep map collection, skip zeros since fix(0) = 0\n return deepMap(x, this, true);\n },\n 'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(x, n) {\n // deep map collection, skip zeros since fix(0) = 0\n return deepMap(x, i => this(i, n), true);\n },\n 'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {\n // use matrix implementation\n return algorithm14(matrix(y), x, this, true).valueOf();\n }\n });\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createFormat } from '../../factoriesAny.js';\nexport var formatDependencies = {\n typedDependencies,\n createFormat\n};","import { format as formatString } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'format';\nvar dependencies = ['typed'];\nexport var createFormat = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\n\n /**\n * Format a value of any type into a string.\n *\n * Syntax:\n *\n * math.format(value)\n * math.format(value, options)\n * math.format(value, precision)\n * math.format(value, callback)\n *\n * Where:\n *\n * - `value: *`\n * The value to be formatted\n * - `options: Object`\n * An object with formatting options. Available options:\n * - `notation: string`\n * Number notation. Choose from:\n * - 'fixed'\n * Always use regular number notation.\n * For example '123.40' and '14000000'\n * - 'exponential'\n * Always use exponential notation.\n * For example '1.234e+2' and '1.4e+7'\n * - 'engineering'\n * Always use engineering notation: always have exponential notation,\n * and select the exponent to be a multiple of 3.\n * For example '123.4e+0' and '14.0e+6'\n * - 'auto' (default)\n * Regular number notation for numbers having an absolute value between\n * `lower` and `upper` bounds, and uses exponential notation elsewhere.\n * Lower bound is included, upper bound is excluded.\n * For example '123.4' and '1.4e7'.\n * - 'bin', 'oct, or 'hex'\n * Format the number using binary, octal, or hexadecimal notation.\n * For example '0b1101' and '0x10fe'.\n * - `wordSize: number`\n * The word size in bits to use for formatting in binary, octal, or\n * hexadecimal notation. To be used only with 'bin', 'oct', or 'hex'\n * values for 'notation' option. When this option is defined the value\n * is formatted as a signed twos complement integer of the given word\n * size and the size suffix is appended to the output.\n * For example format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n * Default value is undefined.\n * - `precision: number`\n * Limit the number of digits of the formatted value.\n * For regular numbers, must be a number between 0 and 16.\n * For bignumbers, the maximum depends on the configured precision,\n * see function `config()`.\n * In case of notations 'exponential', 'engineering', and 'auto', `precision`\n * defines the total number of significant digits returned.\n * In case of notation 'fixed', `precision` defines the number of\n * significant digits after the decimal point.\n * `precision` is undefined by default.\n * - `lowerExp: number`\n * Exponent determining the lower boundary for formatting a value with\n * an exponent when `notation='auto`. Default value is `-3`.\n * - `upperExp: number`\n * Exponent determining the upper boundary for formatting a value with\n * an exponent when `notation='auto`. Default value is `5`.\n * - `fraction: string`. Available values: 'ratio' (default) or 'decimal'.\n * For example `format(fraction(1, 3))` will output '1/3' when 'ratio' is\n * configured, and will output `0.(3)` when 'decimal' is configured.\n * - `callback: function`\n * A custom formatting function, invoked for all numeric elements in `value`,\n * for example all elements of a matrix, or the real and imaginary\n * parts of a complex number. This callback can be used to override the\n * built-in numeric notation with any type of formatting. Function `callback`\n * is called with `value` as parameter and must return a string.\n *\n * When `value` is an Object:\n *\n * - When the object contains a property `format` being a function, this function\n * is invoked as `value.format(options)` and the result is returned.\n * - When the object has its own `toString` method, this method is invoked\n * and the result is returned.\n * - In other cases the function will loop over all object properties and\n * return JSON object notation like '{\"a\": 2, \"b\": 3}'.\n *\n * When value is a function:\n *\n * - When the function has a property `syntax`, it returns this\n * syntax description.\n * - In other cases, a string `'function'` is returned.\n *\n * Examples:\n *\n * math.format(6.4) // returns '6.4'\n * math.format(1240000) // returns '1.24e6'\n * math.format(1/3) // returns '0.3333333333333333'\n * math.format(1/3, 3) // returns '0.333'\n * math.format(21385, 2) // returns '21000'\n * math.format(12e8, {notation: 'fixed'}) // returns '1200000000'\n * math.format(2.3, {notation: 'fixed', precision: 4}) // returns '2.3000'\n * math.format(52.8, {notation: 'exponential'}) // returns '5.28e+1'\n * math.format(12400,{notation: 'engineering'}) // returns '12.400e+3'\n * math.format(2000, {lowerExp: -2, upperExp: 2}) // returns '2e+3'\n *\n * function formatCurrency(value) {\n * // return currency notation with two digits:\n * return '$' + value.toFixed(2)\n *\n * // you could also use math.format inside the callback:\n * // return '$' + math.format(value, {notation: 'fixed', precision: 2})\n * }\n * math.format([2.1, 3, 0.016], formatCurrency} // returns '[$2.10, $3.00, $0.02]'\n *\n * See also:\n *\n * print\n *\n * @param {*} value Value to be stringified\n * @param {Object | Function | number} [options] Formatting options\n * @return {string} The formatted value\n */\n return typed(name, {\n any: formatString,\n 'any, Object | function | number': formatString\n });\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createIsNumeric } from '../../factoriesAny.js';\nexport var isNumericDependencies = {\n typedDependencies,\n createIsNumeric\n};","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'isNumeric';\nvar dependencies = ['typed'];\nexport var createIsNumeric = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\n\n /**\n * Test whether a value is an numeric value.\n *\n * The function is evaluated element-wise in case of Array or Matrix input.\n *\n * Syntax:\n *\n * math.isNumeric(x)\n *\n * Examples:\n *\n * math.isNumeric(2) // returns true\n * math.isNumeric('2') // returns false\n * math.hasNumericValue('2') // returns true\n * math.isNumeric(0) // returns true\n * math.isNumeric(math.bignumber(500)) // returns true\n * math.isNumeric(math.fraction(4)) // returns true\n * math.isNumeric(math.complex('2-4i') // returns false\n * math.isNumeric([2.3, 'foo', false]) // returns [true, false, true]\n *\n * See also:\n *\n * isZero, isPositive, isNegative, isInteger, hasNumericValue\n *\n * @param {*} x Value to be tested\n * @return {boolean} Returns true when `x` is a `number`, `BigNumber`,\n * `Fraction`, or `boolean`. Returns false for other types.\n * Throws an error in case of unknown types.\n */\n return typed(name, {\n 'number | BigNumber | Fraction | boolean': function numberBigNumberFractionBoolean() {\n return true;\n },\n 'Complex | Unit | string | null | undefined | Node': function ComplexUnitStringNullUndefinedNode() {\n return false;\n },\n 'Array | Matrix': function ArrayMatrix(x) {\n return deepMap(x, this);\n }\n });\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createMultiplyScalar } from '../../factoriesAny.js';\nexport var multiplyScalarDependencies = {\n typedDependencies,\n createMultiplyScalar\n};","import { factory } from '../../utils/factory.js';\nimport { multiplyNumber } from '../../plain/number/index.js';\nvar name = 'multiplyScalar';\nvar dependencies = ['typed'];\nexport var createMultiplyScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\n\n /**\n * Multiply two scalar values, `x * y`.\n * This function is meant for internal use: it is used by the public function\n * `multiply`\n *\n * This function does not support collections (Array or Matrix).\n *\n * @param {number | BigNumber | Fraction | Complex | Unit} x First value to multiply\n * @param {number | BigNumber | Fraction | Complex} y Second value to multiply\n * @return {number | BigNumber | Fraction | Complex | Unit} Multiplication of `x` and `y`\n * @private\n */\n return typed('multiplyScalar', {\n 'number, number': multiplyNumber,\n 'Complex, Complex': function ComplexComplex(x, y) {\n return x.mul(y);\n },\n 'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n return x.times(y);\n },\n 'Fraction, Fraction': function FractionFraction(x, y) {\n return x.mul(y);\n },\n 'number | Fraction | BigNumber | Complex, Unit': function numberFractionBigNumberComplexUnit(x, y) {\n var res = y.clone();\n res.value = res.value === null ? res._normalize(x) : this(res.value, x);\n return res;\n },\n 'Unit, number | Fraction | BigNumber | Complex': function UnitNumberFractionBigNumberComplex(x, y) {\n var res = x.clone();\n res.value = res.value === null ? res._normalize(y) : this(res.value, y);\n return res;\n },\n 'Unit, Unit': function UnitUnit(x, y) {\n return x.multiply(y);\n }\n });\n});","import { isBigNumber } from '../../utils/is.js';\nimport { resize } from '../../utils/array.js';\nimport { isInteger } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'identity';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix'];\nexport var createIdentity = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n config,\n matrix,\n BigNumber,\n DenseMatrix,\n SparseMatrix\n } = _ref;\n\n /**\n * Create a 2-dimensional identity matrix with size m x n or n x n.\n * The matrix has ones on the diagonal and zeros elsewhere.\n *\n * Syntax:\n *\n * math.identity(n)\n * math.identity(n, format)\n * math.identity(m, n)\n * math.identity(m, n, format)\n * math.identity([m, n])\n * math.identity([m, n], format)\n *\n * Examples:\n *\n * math.identity(3) // returns [[1, 0, 0], [0, 1, 0], [0, 0, 1]]\n * math.identity(3, 2) // returns [[1, 0], [0, 1], [0, 0]]\n *\n * const A = [[1, 2, 3], [4, 5, 6]]\n * math.identity(math.size(A)) // returns [[1, 0, 0], [0, 1, 0]]\n *\n * See also:\n *\n * diag, ones, zeros, size, range\n *\n * @param {...number | Matrix | Array} size The size for the matrix\n * @param {string} [format] The Matrix storage format\n *\n * @return {Matrix | Array | number} A matrix with ones on the diagonal.\n */\n return typed(name, {\n '': function _() {\n return config.matrix === 'Matrix' ? matrix([]) : [];\n },\n string: function string(format) {\n return matrix(format);\n },\n 'number | BigNumber': function numberBigNumber(rows) {\n return _identity(rows, rows, config.matrix === 'Matrix' ? 'dense' : undefined);\n },\n 'number | BigNumber, string': function numberBigNumberString(rows, format) {\n return _identity(rows, rows, format);\n },\n 'number | BigNumber, number | BigNumber': function numberBigNumberNumberBigNumber(rows, cols) {\n return _identity(rows, cols, config.matrix === 'Matrix' ? 'dense' : undefined);\n },\n 'number | BigNumber, number | BigNumber, string': function numberBigNumberNumberBigNumberString(rows, cols, format) {\n return _identity(rows, cols, format);\n },\n Array: function Array(size) {\n return _identityVector(size);\n },\n 'Array, string': function ArrayString(size, format) {\n return _identityVector(size, format);\n },\n Matrix: function Matrix(size) {\n return _identityVector(size.valueOf(), size.storage());\n },\n 'Matrix, string': function MatrixString(size, format) {\n return _identityVector(size.valueOf(), format);\n }\n });\n\n function _identityVector(size, format) {\n switch (size.length) {\n case 0:\n return format ? matrix(format) : [];\n\n case 1:\n return _identity(size[0], size[0], format);\n\n case 2:\n return _identity(size[0], size[1], format);\n\n default:\n throw new Error('Vector containing two values expected');\n }\n }\n /**\n * Create an identity matrix\n * @param {number | BigNumber} rows\n * @param {number | BigNumber} cols\n * @param {string} [format]\n * @returns {Matrix}\n * @private\n */\n\n\n function _identity(rows, cols, format) {\n // BigNumber constructor with the right precision\n var Big = isBigNumber(rows) || isBigNumber(cols) ? BigNumber : null;\n if (isBigNumber(rows)) rows = rows.toNumber();\n if (isBigNumber(cols)) cols = cols.toNumber();\n\n if (!isInteger(rows) || rows < 1) {\n throw new Error('Parameters in function identity must be positive integers');\n }\n\n if (!isInteger(cols) || cols < 1) {\n throw new Error('Parameters in function identity must be positive integers');\n }\n\n var one = Big ? new BigNumber(1) : 1;\n var defaultValue = Big ? new Big(0) : 0;\n var size = [rows, cols]; // check we need to return a matrix\n\n if (format) {\n // create diagonal matrix (use optimized implementation for storage format)\n if (format === 'sparse') {\n return SparseMatrix.diagonal(size, one, 0, defaultValue);\n }\n\n if (format === 'dense') {\n return DenseMatrix.diagonal(size, one, 0, defaultValue);\n }\n\n throw new TypeError(\"Unknown matrix type \\\"\".concat(format, \"\\\"\"));\n } // create and resize array\n\n\n var res = resize([], size, defaultValue); // fill in ones on the diagonal\n\n var minimum = rows < cols ? rows : cols; // fill diagonal\n\n for (var d = 0; d < minimum; d++) {\n res[d][d] = one;\n }\n\n return res;\n }\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';\nimport { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';\nimport { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createIdentity } from '../../factoriesAny.js';\nexport var identityDependencies = {\n BigNumberDependencies,\n DenseMatrixDependencies,\n SparseMatrixDependencies,\n matrixDependencies,\n typedDependencies,\n createIdentity\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createConj } from '../../factoriesAny.js';\nexport var conjDependencies = {\n typedDependencies,\n createConj\n};","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'conj';\nvar dependencies = ['typed'];\nexport var createConj = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\n\n /**\n * Compute the complex conjugate of a complex value.\n * If `x = a+bi`, the complex conjugate of `x` is `a - bi`.\n *\n * For matrices, the function is evaluated element wise.\n *\n * Syntax:\n *\n * math.conj(x)\n *\n * Examples:\n *\n * math.conj(math.complex('2 + 3i')) // returns Complex 2 - 3i\n * math.conj(math.complex('2 - 3i')) // returns Complex 2 + 3i\n * math.conj(math.complex('-5.2i')) // returns Complex 5.2i\n *\n * See also:\n *\n * re, im, arg, abs\n *\n * @param {number | BigNumber | Complex | Array | Matrix} x\n * A complex number or array with complex numbers\n * @return {number | BigNumber | Complex | Array | Matrix}\n * The complex conjugate of x\n */\n return typed(name, {\n number: function number(x) {\n return x;\n },\n BigNumber: function BigNumber(x) {\n return x;\n },\n Complex: function Complex(x) {\n return x.conjugate();\n },\n 'Array | Matrix': function ArrayMatrix(x) {\n return deepMap(x, this);\n }\n });\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createSize } from '../../factoriesAny.js';\nexport var sizeDependencies = {\n matrixDependencies,\n typedDependencies,\n createSize\n};","import { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { noMatrix } from '../../utils/noop.js';\nvar name = 'size';\nvar dependencies = ['typed', 'config', '?matrix'];\nexport var createSize = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n config,\n matrix\n } = _ref;\n\n /**\n * Calculate the size of a matrix or scalar.\n *\n * Syntax:\n *\n * math.size(x)\n *\n * Examples:\n *\n * math.size(2.3) // returns []\n * math.size('hello world') // returns [11]\n *\n * const A = [[1, 2, 3], [4, 5, 6]]\n * math.size(A) // returns [2, 3]\n * math.size(math.range(1,6)) // returns [5]\n *\n * See also:\n *\n * count, resize, squeeze, subset\n *\n * @param {boolean | number | Complex | Unit | string | Array | Matrix} x A matrix\n * @return {Array | Matrix} A vector with size of `x`.\n */\n return typed(name, {\n Matrix: function Matrix(x) {\n return x.create(x.size());\n },\n Array: arraySize,\n string: function string(x) {\n return config.matrix === 'Array' ? [x.length] : matrix([x.length]);\n },\n 'number | Complex | BigNumber | Unit | boolean | null': function numberComplexBigNumberUnitBooleanNull(x) {\n // scalar\n return config.matrix === 'Array' ? [] : matrix ? matrix([]) : noMatrix();\n }\n });\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { addScalarDependencies } from './dependenciesAddScalar.generated.js';\nimport { conjDependencies } from './dependenciesConj.generated.js';\nimport { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';\nimport { sizeDependencies } from './dependenciesSize.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createDot } from '../../factoriesAny.js';\nexport var dotDependencies = {\n addScalarDependencies,\n conjDependencies,\n multiplyScalarDependencies,\n sizeDependencies,\n typedDependencies,\n createDot\n};","import { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nvar name = 'dot';\nvar dependencies = ['typed', 'addScalar', 'multiplyScalar', 'conj', 'size'];\nexport var createDot = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n addScalar,\n multiplyScalar,\n conj,\n size\n } = _ref;\n\n /**\n * Calculate the dot product of two vectors. The dot product of\n * `A = [a1, a2, ..., an]` and `B = [b1, b2, ..., bn]` is defined as:\n *\n * dot(A, B) = conj(a1) * b1 + conj(a2) * b2 + ... + conj(an) * bn\n *\n * Syntax:\n *\n * math.dot(x, y)\n *\n * Examples:\n *\n * math.dot([2, 4, 1], [2, 2, 3]) // returns number 15\n * math.multiply([2, 4, 1], [2, 2, 3]) // returns number 15\n *\n * See also:\n *\n * multiply, cross\n *\n * @param {Array | Matrix} x First vector\n * @param {Array | Matrix} y Second vector\n * @return {number} Returns the dot product of `x` and `y`\n */\n return typed(name, {\n 'Array | DenseMatrix, Array | DenseMatrix': _denseDot,\n 'SparseMatrix, SparseMatrix': _sparseDot\n });\n\n function _validateDim(x, y) {\n var xSize = _size(x);\n\n var ySize = _size(y);\n\n var xLen, yLen;\n\n if (xSize.length === 1) {\n xLen = xSize[0];\n } else if (xSize.length === 2 && xSize[1] === 1) {\n xLen = xSize[0];\n } else {\n throw new RangeError('Expected a column vector, instead got a matrix of size (' + xSize.join(', ') + ')');\n }\n\n if (ySize.length === 1) {\n yLen = ySize[0];\n } else if (ySize.length === 2 && ySize[1] === 1) {\n yLen = ySize[0];\n } else {\n throw new RangeError('Expected a column vector, instead got a matrix of size (' + ySize.join(', ') + ')');\n }\n\n if (xLen !== yLen) throw new RangeError('Vectors must have equal length (' + xLen + ' != ' + yLen + ')');\n if (xLen === 0) throw new RangeError('Cannot calculate the dot product of empty vectors');\n return xLen;\n }\n\n function _denseDot(a, b) {\n var N = _validateDim(a, b);\n\n var adata = isMatrix(a) ? a._data : a;\n var adt = isMatrix(a) ? a._datatype : undefined;\n var bdata = isMatrix(b) ? b._data : b;\n var bdt = isMatrix(b) ? b._datatype : undefined; // are these 2-dimensional column vectors? (as opposed to 1-dimensional vectors)\n\n var aIsColumn = _size(a).length === 2;\n var bIsColumn = _size(b).length === 2;\n var add = addScalar;\n var mul = multiplyScalar; // process data types\n\n if (adt && bdt && adt === bdt && typeof adt === 'string') {\n var dt = adt; // find signatures that matches (dt, dt)\n\n add = typed.find(addScalar, [dt, dt]);\n mul = typed.find(multiplyScalar, [dt, dt]);\n } // both vectors 1-dimensional\n\n\n if (!aIsColumn && !bIsColumn) {\n var c = mul(conj(adata[0]), bdata[0]);\n\n for (var i = 1; i < N; i++) {\n c = add(c, mul(conj(adata[i]), bdata[i]));\n }\n\n return c;\n } // a is 1-dim, b is column\n\n\n if (!aIsColumn && bIsColumn) {\n var _c = mul(conj(adata[0]), bdata[0][0]);\n\n for (var _i = 1; _i < N; _i++) {\n _c = add(_c, mul(conj(adata[_i]), bdata[_i][0]));\n }\n\n return _c;\n } // a is column, b is 1-dim\n\n\n if (aIsColumn && !bIsColumn) {\n var _c2 = mul(conj(adata[0][0]), bdata[0]);\n\n for (var _i2 = 1; _i2 < N; _i2++) {\n _c2 = add(_c2, mul(conj(adata[_i2][0]), bdata[_i2]));\n }\n\n return _c2;\n } // both vectors are column\n\n\n if (aIsColumn && bIsColumn) {\n var _c3 = mul(conj(adata[0][0]), bdata[0][0]);\n\n for (var _i3 = 1; _i3 < N; _i3++) {\n _c3 = add(_c3, mul(conj(adata[_i3][0]), bdata[_i3][0]));\n }\n\n return _c3;\n }\n }\n\n function _sparseDot(x, y) {\n _validateDim(x, y);\n\n var xindex = x._index;\n var xvalues = x._values;\n var yindex = y._index;\n var yvalues = y._values; // TODO optimize add & mul using datatype\n\n var c = 0;\n var add = addScalar;\n var mul = multiplyScalar;\n var i = 0;\n var j = 0;\n\n while (i < xindex.length && j < yindex.length) {\n var I = xindex[i];\n var J = yindex[j];\n\n if (I < J) {\n i++;\n continue;\n }\n\n if (I > J) {\n j++;\n continue;\n }\n\n if (I === J) {\n c = add(c, mul(xvalues[i], yvalues[j]));\n i++;\n j++;\n }\n }\n\n return c;\n } // TODO remove this once #1771 is fixed\n\n\n function _size(x) {\n return isMatrix(x) ? x.size() : size(x);\n }\n});","import { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nimport { extend } from '../../utils/object.js';\nimport { arraySize } from '../../utils/array.js';\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';\nvar name = 'multiply';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'multiplyScalar', 'equalScalar', 'dot'];\nexport var createMultiply = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n matrix,\n addScalar,\n multiplyScalar,\n equalScalar,\n dot\n } = _ref;\n var algorithm11 = createAlgorithm11({\n typed,\n equalScalar\n });\n var algorithm14 = createAlgorithm14({\n typed\n });\n\n function _validateMatrixDimensions(size1, size2) {\n // check left operand dimensions\n switch (size1.length) {\n case 1:\n // check size2\n switch (size2.length) {\n case 1:\n // Vector x Vector\n if (size1[0] !== size2[0]) {\n // throw error\n throw new RangeError('Dimension mismatch in multiplication. Vectors must have the same length');\n }\n\n break;\n\n case 2:\n // Vector x Matrix\n if (size1[0] !== size2[0]) {\n // throw error\n throw new RangeError('Dimension mismatch in multiplication. Vector length (' + size1[0] + ') must match Matrix rows (' + size2[0] + ')');\n }\n\n break;\n\n default:\n throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');\n }\n\n break;\n\n case 2:\n // check size2\n switch (size2.length) {\n case 1:\n // Matrix x Vector\n if (size1[1] !== size2[0]) {\n // throw error\n throw new RangeError('Dimension mismatch in multiplication. Matrix columns (' + size1[1] + ') must match Vector length (' + size2[0] + ')');\n }\n\n break;\n\n case 2:\n // Matrix x Matrix\n if (size1[1] !== size2[0]) {\n // throw error\n throw new RangeError('Dimension mismatch in multiplication. Matrix A columns (' + size1[1] + ') must match Matrix B rows (' + size2[0] + ')');\n }\n\n break;\n\n default:\n throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');\n }\n\n break;\n\n default:\n throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix A has ' + size1.length + ' dimensions)');\n }\n }\n /**\n * C = A * B\n *\n * @param {Matrix} a Dense Vector (N)\n * @param {Matrix} b Dense Vector (N)\n *\n * @return {number} Scalar value\n */\n\n\n function _multiplyVectorVector(a, b, n) {\n // check empty vector\n if (n === 0) {\n throw new Error('Cannot multiply two empty vectors');\n }\n\n return dot(a, b);\n }\n /**\n * C = A * B\n *\n * @param {Matrix} a Dense Vector (M)\n * @param {Matrix} b Matrix (MxN)\n *\n * @return {Matrix} Dense Vector (N)\n */\n\n\n function _multiplyVectorMatrix(a, b) {\n // process storage\n if (b.storage() !== 'dense') {\n throw new Error('Support for SparseMatrix not implemented');\n }\n\n return _multiplyVectorDenseMatrix(a, b);\n }\n /**\n * C = A * B\n *\n * @param {Matrix} a Dense Vector (M)\n * @param {Matrix} b Dense Matrix (MxN)\n *\n * @return {Matrix} Dense Vector (N)\n */\n\n\n function _multiplyVectorDenseMatrix(a, b) {\n // a dense\n var adata = a._data;\n var asize = a._size;\n var adt = a._datatype; // b dense\n\n var bdata = b._data;\n var bsize = b._size;\n var bdt = b._datatype; // rows & columns\n\n var alength = asize[0];\n var bcolumns = bsize[1]; // datatype\n\n var dt; // addScalar signature to use\n\n var af = addScalar; // multiplyScalar signature to use\n\n var mf = multiplyScalar; // process data types\n\n if (adt && bdt && adt === bdt && typeof adt === 'string') {\n // datatype\n dt = adt; // find signatures that matches (dt, dt)\n\n af = typed.find(addScalar, [dt, dt]);\n mf = typed.find(multiplyScalar, [dt, dt]);\n } // result\n\n\n var c = []; // loop matrix columns\n\n for (var j = 0; j < bcolumns; j++) {\n // sum (do not initialize it with zero)\n var sum = mf(adata[0], bdata[0][j]); // loop vector\n\n for (var i = 1; i < alength; i++) {\n // multiply & accumulate\n sum = af(sum, mf(adata[i], bdata[i][j]));\n }\n\n c[j] = sum;\n } // return matrix\n\n\n return a.createDenseMatrix({\n data: c,\n size: [bcolumns],\n datatype: dt\n });\n }\n /**\n * C = A * B\n *\n * @param {Matrix} a Matrix (MxN)\n * @param {Matrix} b Dense Vector (N)\n *\n * @return {Matrix} Dense Vector (M)\n */\n\n\n var _multiplyMatrixVector = typed('_multiplyMatrixVector', {\n 'DenseMatrix, any': _multiplyDenseMatrixVector,\n 'SparseMatrix, any': _multiplySparseMatrixVector\n });\n /**\n * C = A * B\n *\n * @param {Matrix} a Matrix (MxN)\n * @param {Matrix} b Matrix (NxC)\n *\n * @return {Matrix} Matrix (MxC)\n */\n\n\n var _multiplyMatrixMatrix = typed('_multiplyMatrixMatrix', {\n 'DenseMatrix, DenseMatrix': _multiplyDenseMatrixDenseMatrix,\n 'DenseMatrix, SparseMatrix': _multiplyDenseMatrixSparseMatrix,\n 'SparseMatrix, DenseMatrix': _multiplySparseMatrixDenseMatrix,\n 'SparseMatrix, SparseMatrix': _multiplySparseMatrixSparseMatrix\n });\n /**\n * C = A * B\n *\n * @param {Matrix} a DenseMatrix (MxN)\n * @param {Matrix} b Dense Vector (N)\n *\n * @return {Matrix} Dense Vector (M)\n */\n\n\n function _multiplyDenseMatrixVector(a, b) {\n // a dense\n var adata = a._data;\n var asize = a._size;\n var adt = a._datatype; // b dense\n\n var bdata = b._data;\n var bdt = b._datatype; // rows & columns\n\n var arows = asize[0];\n var acolumns = asize[1]; // datatype\n\n var dt; // addScalar signature to use\n\n var af = addScalar; // multiplyScalar signature to use\n\n var mf = multiplyScalar; // process data types\n\n if (adt && bdt && adt === bdt && typeof adt === 'string') {\n // datatype\n dt = adt; // find signatures that matches (dt, dt)\n\n af = typed.find(addScalar, [dt, dt]);\n mf = typed.find(multiplyScalar, [dt, dt]);\n } // result\n\n\n var c = []; // loop matrix a rows\n\n for (var i = 0; i < arows; i++) {\n // current row\n var row = adata[i]; // sum (do not initialize it with zero)\n\n var sum = mf(row[0], bdata[0]); // loop matrix a columns\n\n for (var j = 1; j < acolumns; j++) {\n // multiply & accumulate\n sum = af(sum, mf(row[j], bdata[j]));\n }\n\n c[i] = sum;\n } // return matrix\n\n\n return a.createDenseMatrix({\n data: c,\n size: [arows],\n datatype: dt\n });\n }\n /**\n * C = A * B\n *\n * @param {Matrix} a DenseMatrix (MxN)\n * @param {Matrix} b DenseMatrix (NxC)\n *\n * @return {Matrix} DenseMatrix (MxC)\n */\n\n\n function _multiplyDenseMatrixDenseMatrix(a, b) {\n // a dense\n var adata = a._data;\n var asize = a._size;\n var adt = a._datatype; // b dense\n\n var bdata = b._data;\n var bsize = b._size;\n var bdt = b._datatype; // rows & columns\n\n var arows = asize[0];\n var acolumns = asize[1];\n var bcolumns = bsize[1]; // datatype\n\n var dt; // addScalar signature to use\n\n var af = addScalar; // multiplyScalar signature to use\n\n var mf = multiplyScalar; // process data types\n\n if (adt && bdt && adt === bdt && typeof adt === 'string') {\n // datatype\n dt = adt; // find signatures that matches (dt, dt)\n\n af = typed.find(addScalar, [dt, dt]);\n mf = typed.find(multiplyScalar, [dt, dt]);\n } // result\n\n\n var c = []; // loop matrix a rows\n\n for (var i = 0; i < arows; i++) {\n // current row\n var row = adata[i]; // initialize row array\n\n c[i] = []; // loop matrix b columns\n\n for (var j = 0; j < bcolumns; j++) {\n // sum (avoid initializing sum to zero)\n var sum = mf(row[0], bdata[0][j]); // loop matrix a columns\n\n for (var x = 1; x < acolumns; x++) {\n // multiply & accumulate\n sum = af(sum, mf(row[x], bdata[x][j]));\n }\n\n c[i][j] = sum;\n }\n } // return matrix\n\n\n return a.createDenseMatrix({\n data: c,\n size: [arows, bcolumns],\n datatype: dt\n });\n }\n /**\n * C = A * B\n *\n * @param {Matrix} a DenseMatrix (MxN)\n * @param {Matrix} b SparseMatrix (NxC)\n *\n * @return {Matrix} SparseMatrix (MxC)\n */\n\n\n function _multiplyDenseMatrixSparseMatrix(a, b) {\n // a dense\n var adata = a._data;\n var asize = a._size;\n var adt = a._datatype; // b sparse\n\n var bvalues = b._values;\n var bindex = b._index;\n var bptr = b._ptr;\n var bsize = b._size;\n var bdt = b._datatype; // validate b matrix\n\n if (!bvalues) {\n throw new Error('Cannot multiply Dense Matrix times Pattern only Matrix');\n } // rows & columns\n\n\n var arows = asize[0];\n var bcolumns = bsize[1]; // datatype\n\n var dt; // addScalar signature to use\n\n var af = addScalar; // multiplyScalar signature to use\n\n var mf = multiplyScalar; // equalScalar signature to use\n\n var eq = equalScalar; // zero value\n\n var zero = 0; // process data types\n\n if (adt && bdt && adt === bdt && typeof adt === 'string') {\n // datatype\n dt = adt; // find signatures that matches (dt, dt)\n\n af = typed.find(addScalar, [dt, dt]);\n mf = typed.find(multiplyScalar, [dt, dt]);\n eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n zero = typed.convert(0, dt);\n } // result\n\n\n var cvalues = [];\n var cindex = [];\n var cptr = []; // c matrix\n\n var c = b.createSparseMatrix({\n values: cvalues,\n index: cindex,\n ptr: cptr,\n size: [arows, bcolumns],\n datatype: dt\n }); // loop b columns\n\n for (var jb = 0; jb < bcolumns; jb++) {\n // update ptr\n cptr[jb] = cindex.length; // indeces in column jb\n\n var kb0 = bptr[jb];\n var kb1 = bptr[jb + 1]; // do not process column jb if no data exists\n\n if (kb1 > kb0) {\n // last row mark processed\n var last = 0; // loop a rows\n\n for (var i = 0; i < arows; i++) {\n // column mark\n var mark = i + 1; // C[i, jb]\n\n var cij = void 0; // values in b column j\n\n for (var kb = kb0; kb < kb1; kb++) {\n // row\n var ib = bindex[kb]; // check value has been initialized\n\n if (last !== mark) {\n // first value in column jb\n cij = mf(adata[i][ib], bvalues[kb]); // update mark\n\n last = mark;\n } else {\n // accumulate value\n cij = af(cij, mf(adata[i][ib], bvalues[kb]));\n }\n } // check column has been processed and value != 0\n\n\n if (last === mark && !eq(cij, zero)) {\n // push row & value\n cindex.push(i);\n cvalues.push(cij);\n }\n }\n }\n } // update ptr\n\n\n cptr[bcolumns] = cindex.length; // return sparse matrix\n\n return c;\n }\n /**\n * C = A * B\n *\n * @param {Matrix} a SparseMatrix (MxN)\n * @param {Matrix} b Dense Vector (N)\n *\n * @return {Matrix} SparseMatrix (M, 1)\n */\n\n\n function _multiplySparseMatrixVector(a, b) {\n // a sparse\n var avalues = a._values;\n var aindex = a._index;\n var aptr = a._ptr;\n var adt = a._datatype; // validate a matrix\n\n if (!avalues) {\n throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');\n } // b dense\n\n\n var bdata = b._data;\n var bdt = b._datatype; // rows & columns\n\n var arows = a._size[0];\n var brows = b._size[0]; // result\n\n var cvalues = [];\n var cindex = [];\n var cptr = []; // datatype\n\n var dt; // addScalar signature to use\n\n var af = addScalar; // multiplyScalar signature to use\n\n var mf = multiplyScalar; // equalScalar signature to use\n\n var eq = equalScalar; // zero value\n\n var zero = 0; // process data types\n\n if (adt && bdt && adt === bdt && typeof adt === 'string') {\n // datatype\n dt = adt; // find signatures that matches (dt, dt)\n\n af = typed.find(addScalar, [dt, dt]);\n mf = typed.find(multiplyScalar, [dt, dt]);\n eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n zero = typed.convert(0, dt);\n } // workspace\n\n\n var x = []; // vector with marks indicating a value x[i] exists in a given column\n\n var w = []; // update ptr\n\n cptr[0] = 0; // rows in b\n\n for (var ib = 0; ib < brows; ib++) {\n // b[ib]\n var vbi = bdata[ib]; // check b[ib] != 0, avoid loops\n\n if (!eq(vbi, zero)) {\n // A values & index in ib column\n for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n // a row\n var ia = aindex[ka]; // check value exists in current j\n\n if (!w[ia]) {\n // ia is new entry in j\n w[ia] = true; // add i to pattern of C\n\n cindex.push(ia); // x(ia) = A\n\n x[ia] = mf(vbi, avalues[ka]);\n } else {\n // i exists in C already\n x[ia] = af(x[ia], mf(vbi, avalues[ka]));\n }\n }\n }\n } // copy values from x to column jb of c\n\n\n for (var p1 = cindex.length, p = 0; p < p1; p++) {\n // row\n var ic = cindex[p]; // copy value\n\n cvalues[p] = x[ic];\n } // update ptr\n\n\n cptr[1] = cindex.length; // return sparse matrix\n\n return a.createSparseMatrix({\n values: cvalues,\n index: cindex,\n ptr: cptr,\n size: [arows, 1],\n datatype: dt\n });\n }\n /**\n * C = A * B\n *\n * @param {Matrix} a SparseMatrix (MxN)\n * @param {Matrix} b DenseMatrix (NxC)\n *\n * @return {Matrix} SparseMatrix (MxC)\n */\n\n\n function _multiplySparseMatrixDenseMatrix(a, b) {\n // a sparse\n var avalues = a._values;\n var aindex = a._index;\n var aptr = a._ptr;\n var adt = a._datatype; // validate a matrix\n\n if (!avalues) {\n throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');\n } // b dense\n\n\n var bdata = b._data;\n var bdt = b._datatype; // rows & columns\n\n var arows = a._size[0];\n var brows = b._size[0];\n var bcolumns = b._size[1]; // datatype\n\n var dt; // addScalar signature to use\n\n var af = addScalar; // multiplyScalar signature to use\n\n var mf = multiplyScalar; // equalScalar signature to use\n\n var eq = equalScalar; // zero value\n\n var zero = 0; // process data types\n\n if (adt && bdt && adt === bdt && typeof adt === 'string') {\n // datatype\n dt = adt; // find signatures that matches (dt, dt)\n\n af = typed.find(addScalar, [dt, dt]);\n mf = typed.find(multiplyScalar, [dt, dt]);\n eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n zero = typed.convert(0, dt);\n } // result\n\n\n var cvalues = [];\n var cindex = [];\n var cptr = []; // c matrix\n\n var c = a.createSparseMatrix({\n values: cvalues,\n index: cindex,\n ptr: cptr,\n size: [arows, bcolumns],\n datatype: dt\n }); // workspace\n\n var x = []; // vector with marks indicating a value x[i] exists in a given column\n\n var w = []; // loop b columns\n\n for (var jb = 0; jb < bcolumns; jb++) {\n // update ptr\n cptr[jb] = cindex.length; // mark in workspace for current column\n\n var mark = jb + 1; // rows in jb\n\n for (var ib = 0; ib < brows; ib++) {\n // b[ib, jb]\n var vbij = bdata[ib][jb]; // check b[ib, jb] != 0, avoid loops\n\n if (!eq(vbij, zero)) {\n // A values & index in ib column\n for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n // a row\n var ia = aindex[ka]; // check value exists in current j\n\n if (w[ia] !== mark) {\n // ia is new entry in j\n w[ia] = mark; // add i to pattern of C\n\n cindex.push(ia); // x(ia) = A\n\n x[ia] = mf(vbij, avalues[ka]);\n } else {\n // i exists in C already\n x[ia] = af(x[ia], mf(vbij, avalues[ka]));\n }\n }\n }\n } // copy values from x to column jb of c\n\n\n for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {\n // row\n var ic = cindex[p]; // copy value\n\n cvalues[p] = x[ic];\n }\n } // update ptr\n\n\n cptr[bcolumns] = cindex.length; // return sparse matrix\n\n return c;\n }\n /**\n * C = A * B\n *\n * @param {Matrix} a SparseMatrix (MxN)\n * @param {Matrix} b SparseMatrix (NxC)\n *\n * @return {Matrix} SparseMatrix (MxC)\n */\n\n\n function _multiplySparseMatrixSparseMatrix(a, b) {\n // a sparse\n var avalues = a._values;\n var aindex = a._index;\n var aptr = a._ptr;\n var adt = a._datatype; // b sparse\n\n var bvalues = b._values;\n var bindex = b._index;\n var bptr = b._ptr;\n var bdt = b._datatype; // rows & columns\n\n var arows = a._size[0];\n var bcolumns = b._size[1]; // flag indicating both matrices (a & b) contain data\n\n var values = avalues && bvalues; // datatype\n\n var dt; // addScalar signature to use\n\n var af = addScalar; // multiplyScalar signature to use\n\n var mf = multiplyScalar; // process data types\n\n if (adt && bdt && adt === bdt && typeof adt === 'string') {\n // datatype\n dt = adt; // find signatures that matches (dt, dt)\n\n af = typed.find(addScalar, [dt, dt]);\n mf = typed.find(multiplyScalar, [dt, dt]);\n } // result\n\n\n var cvalues = values ? [] : undefined;\n var cindex = [];\n var cptr = []; // c matrix\n\n var c = a.createSparseMatrix({\n values: cvalues,\n index: cindex,\n ptr: cptr,\n size: [arows, bcolumns],\n datatype: dt\n }); // workspace\n\n var x = values ? [] : undefined; // vector with marks indicating a value x[i] exists in a given column\n\n var w = []; // variables\n\n var ka, ka0, ka1, kb, kb0, kb1, ia, ib; // loop b columns\n\n for (var jb = 0; jb < bcolumns; jb++) {\n // update ptr\n cptr[jb] = cindex.length; // mark in workspace for current column\n\n var mark = jb + 1; // B values & index in j\n\n for (kb0 = bptr[jb], kb1 = bptr[jb + 1], kb = kb0; kb < kb1; kb++) {\n // b row\n ib = bindex[kb]; // check we need to process values\n\n if (values) {\n // loop values in a[:,ib]\n for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n // row\n ia = aindex[ka]; // check value exists in current j\n\n if (w[ia] !== mark) {\n // ia is new entry in j\n w[ia] = mark; // add i to pattern of C\n\n cindex.push(ia); // x(ia) = A\n\n x[ia] = mf(bvalues[kb], avalues[ka]);\n } else {\n // i exists in C already\n x[ia] = af(x[ia], mf(bvalues[kb], avalues[ka]));\n }\n }\n } else {\n // loop values in a[:,ib]\n for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n // row\n ia = aindex[ka]; // check value exists in current j\n\n if (w[ia] !== mark) {\n // ia is new entry in j\n w[ia] = mark; // add i to pattern of C\n\n cindex.push(ia);\n }\n }\n }\n } // check we need to process matrix values (pattern matrix)\n\n\n if (values) {\n // copy values from x to column jb of c\n for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {\n // row\n var ic = cindex[p]; // copy value\n\n cvalues[p] = x[ic];\n }\n }\n } // update ptr\n\n\n cptr[bcolumns] = cindex.length; // return sparse matrix\n\n return c;\n }\n /**\n * Multiply two or more values, `x * y`.\n * For matrices, the matrix product is calculated.\n *\n * Syntax:\n *\n * math.multiply(x, y)\n * math.multiply(x, y, z, ...)\n *\n * Examples:\n *\n * math.multiply(4, 5.2) // returns number 20.8\n * math.multiply(2, 3, 4) // returns number 24\n *\n * const a = math.complex(2, 3)\n * const b = math.complex(4, 1)\n * math.multiply(a, b) // returns Complex 5 + 14i\n *\n * const c = [[1, 2], [4, 3]]\n * const d = [[1, 2, 3], [3, -4, 7]]\n * math.multiply(c, d) // returns Array [[7, -6, 17], [13, -4, 33]]\n *\n * const e = math.unit('2.1 km')\n * math.multiply(3, e) // returns Unit 6.3 km\n *\n * See also:\n *\n * divide, prod, cross, dot\n *\n * @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First value to multiply\n * @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second value to multiply\n * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Multiplication of `x` and `y`\n */\n\n\n return typed(name, extend({\n // we extend the signatures of multiplyScalar with signatures dealing with matrices\n 'Array, Array': function ArrayArray(x, y) {\n // check dimensions\n _validateMatrixDimensions(arraySize(x), arraySize(y)); // use dense matrix implementation\n\n\n var m = this(matrix(x), matrix(y)); // return array or scalar\n\n return isMatrix(m) ? m.valueOf() : m;\n },\n 'Matrix, Matrix': function MatrixMatrix(x, y) {\n // dimensions\n var xsize = x.size();\n var ysize = y.size(); // check dimensions\n\n _validateMatrixDimensions(xsize, ysize); // process dimensions\n\n\n if (xsize.length === 1) {\n // process y dimensions\n if (ysize.length === 1) {\n // Vector * Vector\n return _multiplyVectorVector(x, y, xsize[0]);\n } // Vector * Matrix\n\n\n return _multiplyVectorMatrix(x, y);\n } // process y dimensions\n\n\n if (ysize.length === 1) {\n // Matrix * Vector\n return _multiplyMatrixVector(x, y);\n } // Matrix * Matrix\n\n\n return _multiplyMatrixMatrix(x, y);\n },\n 'Matrix, Array': function MatrixArray(x, y) {\n // use Matrix * Matrix implementation\n return this(x, matrix(y));\n },\n 'Array, Matrix': function ArrayMatrix(x, y) {\n // use Matrix * Matrix implementation\n return this(matrix(x, y.storage()), y);\n },\n 'SparseMatrix, any': function SparseMatrixAny(x, y) {\n return algorithm11(x, y, multiplyScalar, false);\n },\n 'DenseMatrix, any': function DenseMatrixAny(x, y) {\n return algorithm14(x, y, multiplyScalar, false);\n },\n 'any, SparseMatrix': function anySparseMatrix(x, y) {\n return algorithm11(y, x, multiplyScalar, true);\n },\n 'any, DenseMatrix': function anyDenseMatrix(x, y) {\n return algorithm14(y, x, multiplyScalar, true);\n },\n 'Array, any': function ArrayAny(x, y) {\n // use matrix implementation\n return algorithm14(matrix(x), y, multiplyScalar, false).valueOf();\n },\n 'any, Array': function anyArray(x, y) {\n // use matrix implementation\n return algorithm14(matrix(y), x, multiplyScalar, true).valueOf();\n },\n 'any, any': multiplyScalar,\n 'any, any, ...any': function anyAnyAny(x, y, rest) {\n var result = this(x, y);\n\n for (var i = 0; i < rest.length; i++) {\n result = this(result, rest[i]);\n }\n\n return result;\n }\n }, multiplyScalar.signatures));\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { addScalarDependencies } from './dependenciesAddScalar.generated.js';\nimport { dotDependencies } from './dependenciesDot.generated.js';\nimport { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createMultiply } from '../../factoriesAny.js';\nexport var multiplyDependencies = {\n addScalarDependencies,\n dotDependencies,\n equalScalarDependencies,\n matrixDependencies,\n multiplyScalarDependencies,\n typedDependencies,\n createMultiply\n};","import { factory } from '../../utils/factory.js';\nimport { isInteger } from '../../utils/number.js';\nimport { arraySize as size } from '../../utils/array.js';\nimport { powNumber } from '../../plain/number/index.js';\nvar name = 'pow';\nvar dependencies = ['typed', 'config', 'identity', 'multiply', 'matrix', 'fraction', 'number', 'Complex'];\nexport var createPow = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n config,\n identity,\n multiply,\n matrix,\n number,\n fraction,\n Complex\n } = _ref;\n\n /**\n * Calculates the power of x to y, `x ^ y`.\n * Matrix exponentiation is supported for square matrices `x`, and positive\n * integer exponents `y`.\n *\n * For cubic roots of negative numbers, the function returns the principal\n * root by default. In order to let the function return the real root,\n * math.js can be configured with `math.config({predictable: true})`.\n * To retrieve all cubic roots of a value, use `math.cbrt(x, true)`.\n *\n * Syntax:\n *\n * math.pow(x, y)\n *\n * Examples:\n *\n * math.pow(2, 3) // returns number 8\n *\n * const a = math.complex(2, 3)\n * math.pow(a, 2) // returns Complex -5 + 12i\n *\n * const b = [[1, 2], [4, 3]]\n * math.pow(b, 2) // returns Array [[9, 8], [16, 17]]\n *\n * See also:\n *\n * multiply, sqrt, cbrt, nthRoot\n *\n * @param {number | BigNumber | Complex | Unit | Array | Matrix} x The base\n * @param {number | BigNumber | Complex} y The exponent\n * @return {number | BigNumber | Complex | Array | Matrix} The value of `x` to the power `y`\n */\n return typed(name, {\n 'number, number': _pow,\n 'Complex, Complex': function ComplexComplex(x, y) {\n return x.pow(y);\n },\n 'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n if (y.isInteger() || x >= 0 || config.predictable) {\n return x.pow(y);\n } else {\n return new Complex(x.toNumber(), 0).pow(y.toNumber(), 0);\n }\n },\n 'Fraction, Fraction': function FractionFraction(x, y) {\n var result = x.pow(y);\n\n if (result != null) {\n return result;\n }\n\n if (config.predictable) {\n throw new Error('Result of pow is non-rational and cannot be expressed as a fraction');\n } else {\n return _pow(x.valueOf(), y.valueOf());\n }\n },\n 'Array, number': _powArray,\n 'Array, BigNumber': function ArrayBigNumber(x, y) {\n return _powArray(x, y.toNumber());\n },\n 'Matrix, number': _powMatrix,\n 'Matrix, BigNumber': function MatrixBigNumber(x, y) {\n return _powMatrix(x, y.toNumber());\n },\n 'Unit, number | BigNumber': function UnitNumberBigNumber(x, y) {\n return x.pow(y);\n }\n });\n /**\n * Calculates the power of x to y, x^y, for two numbers.\n * @param {number} x\n * @param {number} y\n * @return {number | Complex} res\n * @private\n */\n\n function _pow(x, y) {\n // Alternatively could define a 'realmode' config option or something, but\n // 'predictable' will work for now\n if (config.predictable && !isInteger(y) && x < 0) {\n // Check to see if y can be represented as a fraction\n try {\n var yFrac = fraction(y);\n var yNum = number(yFrac);\n\n if (y === yNum || Math.abs((y - yNum) / y) < 1e-14) {\n if (yFrac.d % 2 === 1) {\n return (yFrac.n % 2 === 0 ? 1 : -1) * Math.pow(-x, y);\n }\n }\n } catch (ex) {// fraction() throws an error if y is Infinity, etc.\n } // Unable to express y as a fraction, so continue on\n\n } // **for predictable mode** x^Infinity === NaN if x < -1\n // N.B. this behavour is different from `Math.pow` which gives\n // (-2)^Infinity === Infinity\n\n\n if (config.predictable && (x < -1 && y === Infinity || x > -1 && x < 0 && y === -Infinity)) {\n return NaN;\n }\n\n if (isInteger(y) || x >= 0 || config.predictable) {\n return powNumber(x, y);\n } else {\n // TODO: the following infinity checks are duplicated from powNumber. Deduplicate this somehow\n // x^Infinity === 0 if -1 < x < 1\n // A real number 0 is returned instead of complex(0)\n if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {\n return 0;\n }\n\n return new Complex(x, 0).pow(y, 0);\n }\n }\n /**\n * Calculate the power of a 2d array\n * @param {Array} x must be a 2 dimensional, square matrix\n * @param {number} y a positive, integer value\n * @returns {Array}\n * @private\n */\n\n\n function _powArray(x, y) {\n if (!isInteger(y) || y < 0) {\n throw new TypeError('For A^b, b must be a positive integer (value is ' + y + ')');\n } // verify that A is a 2 dimensional square matrix\n\n\n var s = size(x);\n\n if (s.length !== 2) {\n throw new Error('For A^b, A must be 2 dimensional (A has ' + s.length + ' dimensions)');\n }\n\n if (s[0] !== s[1]) {\n throw new Error('For A^b, A must be square (size is ' + s[0] + 'x' + s[1] + ')');\n }\n\n var res = identity(s[0]).valueOf();\n var px = x;\n\n while (y >= 1) {\n if ((y & 1) === 1) {\n res = multiply(px, res);\n }\n\n y >>= 1;\n px = multiply(px, px);\n }\n\n return res;\n }\n /**\n * Calculate the power of a 2d matrix\n * @param {Matrix} x must be a 2 dimensional, square matrix\n * @param {number} y a positive, integer value\n * @returns {Matrix}\n * @private\n */\n\n\n function _powMatrix(x, y) {\n return matrix(_powArray(x.valueOf(), y));\n }\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { ComplexDependencies } from './dependenciesComplexClass.generated.js';\nimport { fractionDependencies } from './dependenciesFraction.generated.js';\nimport { identityDependencies } from './dependenciesIdentity.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { multiplyDependencies } from './dependenciesMultiply.generated.js';\nimport { numberDependencies } from './dependenciesNumber.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createPow } from '../../factoriesAny.js';\nexport var powDependencies = {\n ComplexDependencies,\n fractionDependencies,\n identityDependencies,\n matrixDependencies,\n multiplyDependencies,\n numberDependencies,\n typedDependencies,\n createPow\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createUnaryMinus } from '../../factoriesAny.js';\nexport var unaryMinusDependencies = {\n typedDependencies,\n createUnaryMinus\n};","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { unaryMinusNumber } from '../../plain/number/index.js';\nvar name = 'unaryMinus';\nvar dependencies = ['typed'];\nexport var createUnaryMinus = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\n\n /**\n * Inverse the sign of a value, apply a unary minus operation.\n *\n * For matrices, the function is evaluated element wise. Boolean values and\n * strings will be converted to a number. For complex numbers, both real and\n * complex value are inverted.\n *\n * Syntax:\n *\n * math.unaryMinus(x)\n *\n * Examples:\n *\n * math.unaryMinus(3.5) // returns -3.5\n * math.unaryMinus(-4.2) // returns 4.2\n *\n * See also:\n *\n * add, subtract, unaryPlus\n *\n * @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Number to be inverted.\n * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Returns the value with inverted sign.\n */\n return typed(name, {\n number: unaryMinusNumber,\n Complex: function Complex(x) {\n return x.neg();\n },\n BigNumber: function BigNumber(x) {\n return x.neg();\n },\n Fraction: function Fraction(x) {\n return x.neg();\n },\n Unit: function Unit(x) {\n var res = x.clone();\n res.value = this(x.value);\n return res;\n },\n 'Array | Matrix': function ArrayMatrix(x) {\n // deep map collection, skip zeros since unaryMinus(0) = 0\n return deepMap(x, this, true);\n } // TODO: add support for string\n\n });\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm01';\nvar dependencies = ['typed'];\nexport var createAlgorithm01 = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\n\n /**\n * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).\n * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).\n *\n *\n * ┌ f(Dij, Sij) ; S(i,j) !== 0\n * C(i,j) = ┤\n * └ Dij ; otherwise\n *\n *\n * @param {Matrix} denseMatrix The DenseMatrix instance (D)\n * @param {Matrix} sparseMatrix The SparseMatrix instance (S)\n * @param {Function} callback The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)\n * @param {boolean} inverse A true value indicates callback should be invoked f(Sij,Dij)\n *\n * @return {Matrix} DenseMatrix (C)\n *\n * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571\n */\n return function algorithm1(denseMatrix, sparseMatrix, callback, inverse) {\n // dense matrix arrays\n var adata = denseMatrix._data;\n var asize = denseMatrix._size;\n var adt = denseMatrix._datatype; // sparse matrix arrays\n\n var bvalues = sparseMatrix._values;\n var bindex = sparseMatrix._index;\n var bptr = sparseMatrix._ptr;\n var bsize = sparseMatrix._size;\n var bdt = sparseMatrix._datatype; // validate dimensions\n\n if (asize.length !== bsize.length) {\n throw new DimensionError(asize.length, bsize.length);\n } // check rows & columns\n\n\n if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n } // sparse matrix cannot be a Pattern matrix\n\n\n if (!bvalues) {\n throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n } // rows & columns\n\n\n var rows = asize[0];\n var columns = asize[1]; // process data types\n\n var dt = typeof adt === 'string' && adt === bdt ? adt : undefined; // callback function\n\n var cf = dt ? typed.find(callback, [dt, dt]) : callback; // vars\n\n var i, j; // result (DenseMatrix)\n\n var cdata = []; // initialize c\n\n for (i = 0; i < rows; i++) {\n cdata[i] = [];\n } // workspace\n\n\n var x = []; // marks indicating we have a value in x for a given column\n\n var w = []; // loop columns in b\n\n for (j = 0; j < columns; j++) {\n // column mark\n var mark = j + 1; // values in column j\n\n for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n // row\n i = bindex[k]; // update workspace\n\n x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]); // mark i as updated\n\n w[i] = mark;\n } // loop rows\n\n\n for (i = 0; i < rows; i++) {\n // check row is in workspace\n if (w[i] === mark) {\n // c[i][j] was already calculated\n cdata[i][j] = x[i];\n } else {\n // item does not exist in S\n cdata[i][j] = adata[i][j];\n }\n }\n } // return dense matrix\n\n\n return denseMatrix.createDenseMatrix({\n data: cdata,\n size: [rows, columns],\n datatype: dt\n });\n };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm05';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm05 = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n equalScalar\n } = _ref;\n\n /**\n * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n * Callback function invoked MAX(NNZA, NNZB) times\n *\n *\n * ┌ f(Aij, Bij) ; A(i,j) !== 0 || B(i,j) !== 0\n * C(i,j) = ┤\n * └ 0 ; otherwise\n *\n *\n * @param {Matrix} a The SparseMatrix instance (A)\n * @param {Matrix} b The SparseMatrix instance (B)\n * @param {Function} callback The f(Aij,Bij) operation to invoke\n *\n * @return {Matrix} SparseMatrix (C)\n *\n * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n */\n return function algorithm05(a, b, callback) {\n // sparse matrix arrays\n var avalues = a._values;\n var aindex = a._index;\n var aptr = a._ptr;\n var asize = a._size;\n var adt = a._datatype; // sparse matrix arrays\n\n var bvalues = b._values;\n var bindex = b._index;\n var bptr = b._ptr;\n var bsize = b._size;\n var bdt = b._datatype; // validate dimensions\n\n if (asize.length !== bsize.length) {\n throw new DimensionError(asize.length, bsize.length);\n } // check rows & columns\n\n\n if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n } // rows & columns\n\n\n var rows = asize[0];\n var columns = asize[1]; // datatype\n\n var dt; // equal signature to use\n\n var eq = equalScalar; // zero value\n\n var zero = 0; // callback signature to use\n\n var cf = callback; // process data types\n\n if (typeof adt === 'string' && adt === bdt) {\n // datatype\n dt = adt; // find signature that matches (dt, dt)\n\n eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n zero = typed.convert(0, dt); // callback\n\n cf = typed.find(callback, [dt, dt]);\n } // result arrays\n\n\n var cvalues = avalues && bvalues ? [] : undefined;\n var cindex = [];\n var cptr = []; // workspaces\n\n var xa = cvalues ? [] : undefined;\n var xb = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column\n\n var wa = [];\n var wb = []; // vars\n\n var i, j, k, k1; // loop columns\n\n for (j = 0; j < columns; j++) {\n // update cptr\n cptr[j] = cindex.length; // columns mark\n\n var mark = j + 1; // loop values A(:,j)\n\n for (k = aptr[j], k1 = aptr[j + 1]; k < k1; k++) {\n // row\n i = aindex[k]; // push index\n\n cindex.push(i); // update workspace\n\n wa[i] = mark; // check we need to process values\n\n if (xa) {\n xa[i] = avalues[k];\n }\n } // loop values B(:,j)\n\n\n for (k = bptr[j], k1 = bptr[j + 1]; k < k1; k++) {\n // row\n i = bindex[k]; // check row existed in A\n\n if (wa[i] !== mark) {\n // push index\n cindex.push(i);\n } // update workspace\n\n\n wb[i] = mark; // check we need to process values\n\n if (xb) {\n xb[i] = bvalues[k];\n }\n } // check we need to process values (non pattern matrix)\n\n\n if (cvalues) {\n // initialize first index in j\n k = cptr[j]; // loop index in j\n\n while (k < cindex.length) {\n // row\n i = cindex[k]; // marks\n\n var wai = wa[i];\n var wbi = wb[i]; // check Aij or Bij are nonzero\n\n if (wai === mark || wbi === mark) {\n // matrix values @ i,j\n var va = wai === mark ? xa[i] : zero;\n var vb = wbi === mark ? xb[i] : zero; // Cij\n\n var vc = cf(va, vb); // check for zero\n\n if (!eq(vc, zero)) {\n // push value\n cvalues.push(vc); // increment pointer\n\n k++;\n } else {\n // remove value @ i, do not increment pointer\n cindex.splice(k, 1);\n }\n }\n }\n }\n } // update cptr\n\n\n cptr[columns] = cindex.length; // return sparse matrix\n\n return a.createSparseMatrix({\n values: cvalues,\n index: cindex,\n ptr: cptr,\n size: [rows, columns],\n datatype: dt\n });\n };\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'algorithm10';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createAlgorithm10 = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n DenseMatrix\n } = _ref;\n\n /**\n * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).\n * Callback function invoked NZ times (number of nonzero items in S).\n *\n *\n * ┌ f(Sij, b) ; S(i,j) !== 0\n * C(i,j) = ┤\n * └ b ; otherwise\n *\n *\n * @param {Matrix} s The SparseMatrix instance (S)\n * @param {Scalar} b The Scalar value\n * @param {Function} callback The f(Aij,b) operation to invoke\n * @param {boolean} inverse A true value indicates callback should be invoked f(b,Sij)\n *\n * @return {Matrix} DenseMatrix (C)\n *\n * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n */\n return function algorithm10(s, b, callback, inverse) {\n // sparse matrix arrays\n var avalues = s._values;\n var aindex = s._index;\n var aptr = s._ptr;\n var asize = s._size;\n var adt = s._datatype; // sparse matrix cannot be a Pattern matrix\n\n if (!avalues) {\n throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n } // rows & columns\n\n\n var rows = asize[0];\n var columns = asize[1]; // datatype\n\n var dt; // callback signature to use\n\n var cf = callback; // process data types\n\n if (typeof adt === 'string') {\n // datatype\n dt = adt; // convert b to the same datatype\n\n b = typed.convert(b, dt); // callback\n\n cf = typed.find(callback, [dt, dt]);\n } // result arrays\n\n\n var cdata = []; // workspaces\n\n var x = []; // marks indicating we have a value in x for a given column\n\n var w = []; // loop columns\n\n for (var j = 0; j < columns; j++) {\n // columns mark\n var mark = j + 1; // values in j\n\n for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n // row\n var r = aindex[k]; // update workspace\n\n x[r] = avalues[k];\n w[r] = mark;\n } // loop rows\n\n\n for (var i = 0; i < rows; i++) {\n // initialize C on first column\n if (j === 0) {\n // create row array\n cdata[i] = [];\n } // check sparse matrix has a value @ i,j\n\n\n if (w[i] === mark) {\n // invoke callback, update C\n cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);\n } else {\n // dense matrix value @ i, j\n cdata[i][j] = b;\n }\n }\n } // return dense matrix\n\n\n return new DenseMatrix({\n data: cdata,\n size: [rows, columns],\n datatype: dt\n });\n };\n});","import { factory } from '../../utils/factory.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js';\nimport { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';\nimport { createAlgorithm05 } from '../../type/matrix/utils/algorithm05.js';\nimport { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js';\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';\nvar name = 'subtract';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'addScalar', 'unaryMinus', 'DenseMatrix'];\nexport var createSubtract = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n matrix,\n equalScalar,\n addScalar,\n unaryMinus,\n DenseMatrix\n } = _ref;\n // TODO: split function subtract in two: subtract and subtractScalar\n var algorithm01 = createAlgorithm01({\n typed\n });\n var algorithm03 = createAlgorithm03({\n typed\n });\n var algorithm05 = createAlgorithm05({\n typed,\n equalScalar\n });\n var algorithm10 = createAlgorithm10({\n typed,\n DenseMatrix\n });\n var algorithm13 = createAlgorithm13({\n typed\n });\n var algorithm14 = createAlgorithm14({\n typed\n });\n /**\n * Subtract two values, `x - y`.\n * For matrices, the function is evaluated element wise.\n *\n * Syntax:\n *\n * math.subtract(x, y)\n *\n * Examples:\n *\n * math.subtract(5.3, 2) // returns number 3.3\n *\n * const a = math.complex(2, 3)\n * const b = math.complex(4, 1)\n * math.subtract(a, b) // returns Complex -2 + 2i\n *\n * math.subtract([5, 7, 4], 4) // returns Array [1, 3, 0]\n *\n * const c = math.unit('2.1 km')\n * const d = math.unit('500m')\n * math.subtract(c, d) // returns Unit 1.6 km\n *\n * See also:\n *\n * add\n *\n * @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x\n * Initial value\n * @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y\n * Value to subtract from `x`\n * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}\n * Subtraction of `x` and `y`\n */\n\n return typed(name, {\n 'number, number': function numberNumber(x, y) {\n return x - y;\n },\n 'Complex, Complex': function ComplexComplex(x, y) {\n return x.sub(y);\n },\n 'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n return x.minus(y);\n },\n 'Fraction, Fraction': function FractionFraction(x, y) {\n return x.sub(y);\n },\n 'Unit, Unit': function UnitUnit(x, y) {\n if (x.value === null) {\n throw new Error('Parameter x contains a unit with undefined value');\n }\n\n if (y.value === null) {\n throw new Error('Parameter y contains a unit with undefined value');\n }\n\n if (!x.equalBase(y)) {\n throw new Error('Units do not match');\n }\n\n var res = x.clone();\n res.value = this(res.value, y.value);\n res.fixPrefix = false;\n return res;\n },\n 'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n checkEqualDimensions(x, y);\n return algorithm05(x, y, this);\n },\n 'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n checkEqualDimensions(x, y);\n return algorithm03(y, x, this, true);\n },\n 'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n checkEqualDimensions(x, y);\n return algorithm01(x, y, this, false);\n },\n 'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n checkEqualDimensions(x, y);\n return algorithm13(x, y, this);\n },\n 'Array, Array': function ArrayArray(x, y) {\n // use matrix implementation\n return this(matrix(x), matrix(y)).valueOf();\n },\n 'Array, Matrix': function ArrayMatrix(x, y) {\n // use matrix implementation\n return this(matrix(x), y);\n },\n 'Matrix, Array': function MatrixArray(x, y) {\n // use matrix implementation\n return this(x, matrix(y));\n },\n 'SparseMatrix, any': function SparseMatrixAny(x, y) {\n return algorithm10(x, unaryMinus(y), addScalar);\n },\n 'DenseMatrix, any': function DenseMatrixAny(x, y) {\n return algorithm14(x, y, this);\n },\n 'any, SparseMatrix': function anySparseMatrix(x, y) {\n return algorithm10(y, x, this, true);\n },\n 'any, DenseMatrix': function anyDenseMatrix(x, y) {\n return algorithm14(y, x, this, true);\n },\n 'Array, any': function ArrayAny(x, y) {\n // use matrix implementation\n return algorithm14(matrix(x), y, this, false).valueOf();\n },\n 'any, Array': function anyArray(x, y) {\n // use matrix implementation\n return algorithm14(matrix(y), x, this, true).valueOf();\n }\n });\n});\n/**\n * Check whether matrix x and y have the same number of dimensions.\n * Throws a DimensionError when dimensions are not equal\n * @param {Matrix} x\n * @param {Matrix} y\n */\n\nfunction checkEqualDimensions(x, y) {\n var xsize = x.size();\n var ysize = y.size();\n\n if (xsize.length !== ysize.length) {\n throw new DimensionError(xsize.length, ysize.length);\n }\n}","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';\nimport { addScalarDependencies } from './dependenciesAddScalar.generated.js';\nimport { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';\nimport { createSubtract } from '../../factoriesAny.js';\nexport var subtractDependencies = {\n DenseMatrixDependencies,\n addScalarDependencies,\n equalScalarDependencies,\n matrixDependencies,\n typedDependencies,\n unaryMinusDependencies,\n createSubtract\n};","// (c) 2018, Mariusz Nowak\n// SPDX-License-Identifier: ISC\n// Derived from https://github.com/medikoo/lru-queue\nexport function lruQueue(limit) {\n var size = 0;\n var base = 1;\n var queue = Object.create(null);\n var map = Object.create(null);\n var index = 0;\n\n var del = function del(id) {\n var oldIndex = map[id];\n if (!oldIndex) return;\n delete queue[oldIndex];\n delete map[id];\n --size;\n if (base !== oldIndex) return;\n\n if (!size) {\n index = 0;\n base = 1;\n return;\n }\n\n while (!hasOwnProperty.call(queue, ++base)) {\n continue;\n }\n };\n\n limit = Math.abs(limit);\n return {\n hit: function hit(id) {\n var oldIndex = map[id];\n var nuIndex = ++index;\n queue[nuIndex] = id;\n map[id] = nuIndex;\n\n if (!oldIndex) {\n ++size;\n if (size <= limit) return undefined;\n id = queue[base];\n del(id);\n return id;\n }\n\n delete queue[oldIndex];\n if (base !== oldIndex) return undefined;\n\n while (!hasOwnProperty.call(queue, ++base)) {\n continue;\n }\n\n return undefined;\n },\n delete: del,\n clear: function clear() {\n size = index = 0;\n base = 1;\n queue = Object.create(null);\n map = Object.create(null);\n }\n };\n}\n;","// function utils\nimport { lruQueue } from './lruQueue.js';\n/**\n * Memoize a given function by caching the computed result.\n * The cache of a memoized function can be cleared by deleting the `cache`\n * property of the function.\n *\n * @param {function} fn The function to be memoized.\n * Must be a pure function.\n * @param {Object} [options]\n * @param {function(args: Array): string} [options.hasher]\n * A custom hash builder. Is JSON.stringify by default.\n * @param {number | undefined} [options.limit]\n * Maximum number of values that may be cached. Undefined indicates\n * unlimited (default)\n * @return {function} Returns the memoized function\n */\n\nexport function memoize(fn) {\n var {\n hasher,\n limit\n } = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n limit = limit == null ? Number.POSITIVE_INFINITY : limit;\n hasher = hasher == null ? JSON.stringify : hasher;\n return function memoize() {\n if (typeof memoize.cache !== 'object') {\n memoize.cache = {\n values: new Map(),\n lru: lruQueue(limit || Number.POSITIVE_INFINITY)\n };\n }\n\n var args = [];\n\n for (var i = 0; i < arguments.length; i++) {\n args[i] = arguments[i];\n }\n\n var hash = hasher(args);\n\n if (memoize.cache.values.has(hash)) {\n memoize.cache.lru.hit(hash);\n return memoize.cache.values.get(hash);\n }\n\n var newVal = fn.apply(fn, args);\n memoize.cache.values.set(hash, newVal);\n memoize.cache.values.delete(memoize.cache.lru.hit(hash));\n return newVal;\n };\n}\n/**\n * Memoize a given function by caching all results and the arguments,\n * and comparing against the arguments of previous results before\n * executing again.\n * This is less performant than `memoize` which calculates a hash,\n * which is very fast to compare. Use `memoizeCompare` only when it is\n * not possible to create a unique serializable hash from the function\n * arguments.\n * The isEqual function must compare two sets of arguments\n * and return true when equal (can be a deep equality check for example).\n * @param {function} fn\n * @param {function(a: *, b: *) : boolean} isEqual\n * @returns {function}\n */\n\nexport function memoizeCompare(fn, isEqual) {\n var memoize = function memoize() {\n var args = [];\n\n for (var i = 0; i < arguments.length; i++) {\n args[i] = arguments[i];\n }\n\n for (var c = 0; c < memoize.cache.length; c++) {\n var cached = memoize.cache[c];\n\n if (isEqual(args, cached.args)) {\n // TODO: move this cache entry to the top so recently used entries move up?\n return cached.res;\n }\n }\n\n var res = fn.apply(fn, args);\n memoize.cache.unshift({\n args,\n res\n });\n return res;\n };\n\n memoize.cache = [];\n return memoize;\n}\n/**\n * Find the maximum number of arguments expected by a typed function.\n * @param {function} fn A typed function\n * @return {number} Returns the maximum number of expected arguments.\n * Returns -1 when no signatures where found on the function.\n */\n\nexport function maxArgumentCount(fn) {\n return Object.keys(fn.signatures || {}).reduce(function (args, signature) {\n var count = (signature.match(/,/g) || []).length + 1;\n return Math.max(args, count);\n }, -1);\n}","import { memoize } from '../function.js';\n/**\n * Calculate BigNumber e\n * @param {function} BigNumber BigNumber constructor\n * @returns {BigNumber} Returns e\n */\n\nexport var createBigNumberE = memoize(function (BigNumber) {\n return new BigNumber(1).exp();\n}, {\n hasher\n});\n/**\n * Calculate BigNumber golden ratio, phi = (1+sqrt(5))/2\n * @param {function} BigNumber BigNumber constructor\n * @returns {BigNumber} Returns phi\n */\n\nexport var createBigNumberPhi = memoize(function (BigNumber) {\n return new BigNumber(1).plus(new BigNumber(5).sqrt()).div(2);\n}, {\n hasher\n});\n/**\n * Calculate BigNumber pi.\n * @param {function} BigNumber BigNumber constructor\n * @returns {BigNumber} Returns pi\n */\n\nexport var createBigNumberPi = memoize(function (BigNumber) {\n return BigNumber.acos(-1);\n}, {\n hasher\n});\n/**\n * Calculate BigNumber tau, tau = 2 * pi\n * @param {function} BigNumber BigNumber constructor\n * @returns {BigNumber} Returns tau\n */\n\nexport var createBigNumberTau = memoize(function (BigNumber) {\n return createBigNumberPi(BigNumber).times(2);\n}, {\n hasher\n});\n/**\n * Create a hash for a BigNumber constructor function. The created has is\n * the configured precision\n * @param {Array} args Supposed to contain a single entry with\n * a BigNumber constructor\n * @return {number} precision\n * @private\n */\n\nfunction hasher(args) {\n return args[0].precision;\n}","import _extends from \"@babel/runtime/helpers/extends\";\nimport _defineProperty from \"@babel/runtime/helpers/defineProperty\";\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\n\nimport { isComplex, isUnit, typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { memoize } from '../../utils/function.js';\nimport { endsWith } from '../../utils/string.js';\nimport { clone, hasOwnProperty } from '../../utils/object.js';\nimport { createBigNumberPi as createPi } from '../../utils/bignumber/constants.js';\nvar name = 'Unit';\nvar dependencies = ['?on', 'config', 'addScalar', 'subtract', 'multiplyScalar', 'divideScalar', 'pow', 'abs', 'fix', 'round', 'equal', 'isNumeric', 'format', 'number', 'Complex', 'BigNumber', 'Fraction'];\nexport var createUnitClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n on,\n config,\n addScalar,\n subtract,\n multiplyScalar,\n divideScalar,\n pow,\n abs,\n fix,\n round,\n equal,\n isNumeric,\n format,\n number,\n Complex,\n BigNumber: _BigNumber,\n Fraction: _Fraction\n } = _ref;\n var toNumber = number;\n /**\n * A unit can be constructed in the following ways:\n *\n * const a = new Unit(value, name)\n * const b = new Unit(null, name)\n * const c = Unit.parse(str)\n *\n * Example usage:\n *\n * const a = new Unit(5, 'cm') // 50 mm\n * const b = Unit.parse('23 kg') // 23 kg\n * const c = math.in(a, new Unit(null, 'm') // 0.05 m\n * const d = new Unit(9.81, \"m/s^2\") // 9.81 m/s^2\n *\n * @class Unit\n * @constructor Unit\n * @param {number | BigNumber | Fraction | Complex | boolean} [value] A value like 5.2\n * @param {string} [name] A unit name like \"cm\" or \"inch\", or a derived unit of the form: \"u1[^ex1] [u2[^ex2] ...] [/ u3[^ex3] [u4[^ex4]]]\", such as \"kg m^2/s^2\", where each unit appearing after the forward slash is taken to be in the denominator. \"kg m^2 s^-2\" is a synonym and is also acceptable. Any of the units can include a prefix.\n */\n\n function Unit(value, name) {\n if (!(this instanceof Unit)) {\n throw new Error('Constructor must be called with the new operator');\n }\n\n if (!(value === null || value === undefined || isNumeric(value) || isComplex(value))) {\n throw new TypeError('First parameter in Unit constructor must be number, BigNumber, Fraction, Complex, or undefined');\n }\n\n if (name !== undefined && (typeof name !== 'string' || name === '')) {\n throw new TypeError('Second parameter in Unit constructor must be a string');\n }\n\n if (name !== undefined) {\n var u = Unit.parse(name);\n this.units = u.units;\n this.dimensions = u.dimensions;\n } else {\n this.units = [{\n unit: UNIT_NONE,\n prefix: PREFIXES.NONE,\n // link to a list with supported prefixes\n power: 0\n }];\n this.dimensions = [];\n\n for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n this.dimensions[i] = 0;\n }\n }\n\n this.value = value !== undefined && value !== null ? this._normalize(value) : null;\n this.fixPrefix = false; // if true, function format will not search for the\n // best prefix but leave it as initially provided.\n // fixPrefix is set true by the method Unit.to\n // The justification behind this is that if the constructor is explicitly called,\n // the caller wishes the units to be returned exactly as he supplied.\n\n this.skipAutomaticSimplification = true;\n }\n /**\n * Attach type information\n */\n\n\n Unit.prototype.type = 'Unit';\n Unit.prototype.isUnit = true; // private variables and functions for the Unit parser\n\n var text, index, c;\n\n function skipWhitespace() {\n while (c === ' ' || c === '\\t') {\n next();\n }\n }\n\n function isDigitDot(c) {\n return c >= '0' && c <= '9' || c === '.';\n }\n\n function isDigit(c) {\n return c >= '0' && c <= '9';\n }\n\n function next() {\n index++;\n c = text.charAt(index);\n }\n\n function revert(oldIndex) {\n index = oldIndex;\n c = text.charAt(index);\n }\n\n function parseNumber() {\n var number = '';\n var oldIndex = index;\n\n if (c === '+') {\n next();\n } else if (c === '-') {\n number += c;\n next();\n }\n\n if (!isDigitDot(c)) {\n // a + or - must be followed by a digit\n revert(oldIndex);\n return null;\n } // get number, can have a single dot\n\n\n if (c === '.') {\n number += c;\n next();\n\n if (!isDigit(c)) {\n // this is no legal number, it is just a dot\n revert(oldIndex);\n return null;\n }\n } else {\n while (isDigit(c)) {\n number += c;\n next();\n }\n\n if (c === '.') {\n number += c;\n next();\n }\n }\n\n while (isDigit(c)) {\n number += c;\n next();\n } // check for exponential notation like \"2.3e-4\" or \"1.23e50\"\n\n\n if (c === 'E' || c === 'e') {\n // The grammar branches here. This could either be part of an exponent or the start of a unit that begins with the letter e, such as \"4exabytes\"\n var tentativeNumber = '';\n var tentativeIndex = index;\n tentativeNumber += c;\n next();\n\n if (c === '+' || c === '-') {\n tentativeNumber += c;\n next();\n } // Scientific notation MUST be followed by an exponent (otherwise we assume it is not scientific notation)\n\n\n if (!isDigit(c)) {\n // The e or E must belong to something else, so return the number without the e or E.\n revert(tentativeIndex);\n return number;\n } // We can now safely say that this is scientific notation.\n\n\n number = number + tentativeNumber;\n\n while (isDigit(c)) {\n number += c;\n next();\n }\n }\n\n return number;\n }\n\n function parseUnit() {\n var unitName = ''; // Alphanumeric characters only; matches [a-zA-Z0-9]\n\n while (isDigit(c) || Unit.isValidAlpha(c)) {\n unitName += c;\n next();\n } // Must begin with [a-zA-Z]\n\n\n var firstC = unitName.charAt(0);\n\n if (Unit.isValidAlpha(firstC)) {\n return unitName;\n } else {\n return null;\n }\n }\n\n function parseCharacter(toFind) {\n if (c === toFind) {\n next();\n return toFind;\n } else {\n return null;\n }\n }\n /**\n * Parse a string into a unit. The value of the unit is parsed as number,\n * BigNumber, or Fraction depending on the math.js config setting `number`.\n *\n * Throws an exception if the provided string does not contain a valid unit or\n * cannot be parsed.\n * @memberof Unit\n * @param {string} str A string like \"5.2 inch\", \"4e2 cm/s^2\"\n * @return {Unit} unit\n */\n\n\n Unit.parse = function (str, options) {\n options = options || {};\n text = str;\n index = -1;\n c = '';\n\n if (typeof text !== 'string') {\n throw new TypeError('Invalid argument in Unit.parse, string expected');\n }\n\n var unit = new Unit();\n unit.units = [];\n var powerMultiplierCurrent = 1;\n var expectingUnit = false; // A unit should follow this pattern:\n // [number] ...[ [*/] unit[^number] ]\n // unit[^number] ... [ [*/] unit[^number] ]\n // Rules:\n // number is any floating point number.\n // unit is any alphanumeric string beginning with an alpha. Units with names like e3 should be avoided because they look like the exponent of a floating point number!\n // The string may optionally begin with a number.\n // Each unit may optionally be followed by ^number.\n // Whitespace or a forward slash is recommended between consecutive units, although the following technically is parseable:\n // 2m^2kg/s^2\n // it is not good form. If a unit starts with e, then it could be confused as a floating point number:\n // 4erg\n\n next();\n skipWhitespace(); // Optional number at the start of the string\n\n var valueStr = parseNumber();\n var value = null;\n\n if (valueStr) {\n if (config.number === 'BigNumber') {\n value = new _BigNumber(valueStr);\n } else if (config.number === 'Fraction') {\n try {\n // not all numbers can be turned in Fractions, for example very small numbers not\n value = new _Fraction(valueStr);\n } catch (err) {\n value = parseFloat(valueStr);\n }\n } else {\n // number\n value = parseFloat(valueStr);\n }\n\n skipWhitespace(); // Whitespace is not required here\n // handle multiplication or division right after the value, like '1/s'\n\n if (parseCharacter('*')) {\n powerMultiplierCurrent = 1;\n expectingUnit = true;\n } else if (parseCharacter('/')) {\n powerMultiplierCurrent = -1;\n expectingUnit = true;\n }\n } // Stack to keep track of powerMultipliers applied to each parentheses group\n\n\n var powerMultiplierStack = []; // Running product of all elements in powerMultiplierStack\n\n var powerMultiplierStackProduct = 1;\n\n while (true) {\n skipWhitespace(); // Check for and consume opening parentheses, pushing powerMultiplierCurrent to the stack\n // A '(' will always appear directly before a unit.\n\n while (c === '(') {\n powerMultiplierStack.push(powerMultiplierCurrent);\n powerMultiplierStackProduct *= powerMultiplierCurrent;\n powerMultiplierCurrent = 1;\n next();\n skipWhitespace();\n } // Is there something here?\n\n\n var uStr = void 0;\n\n if (c) {\n var oldC = c;\n uStr = parseUnit();\n\n if (uStr === null) {\n throw new SyntaxError('Unexpected \"' + oldC + '\" in \"' + text + '\" at index ' + index.toString());\n }\n } else {\n // End of input.\n break;\n } // Verify the unit exists and get the prefix (if any)\n\n\n var res = _findUnit(uStr);\n\n if (res === null) {\n // Unit not found.\n throw new SyntaxError('Unit \"' + uStr + '\" not found.');\n }\n\n var power = powerMultiplierCurrent * powerMultiplierStackProduct; // Is there a \"^ number\"?\n\n skipWhitespace();\n\n if (parseCharacter('^')) {\n skipWhitespace();\n var p = parseNumber();\n\n if (p === null) {\n // No valid number found for the power!\n throw new SyntaxError('In \"' + str + '\", \"^\" must be followed by a floating-point number');\n }\n\n power *= p;\n } // Add the unit to the list\n\n\n unit.units.push({\n unit: res.unit,\n prefix: res.prefix,\n power: power\n });\n\n for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n unit.dimensions[i] += (res.unit.dimensions[i] || 0) * power;\n } // Check for and consume closing parentheses, popping from the stack.\n // A ')' will always follow a unit.\n\n\n skipWhitespace();\n\n while (c === ')') {\n if (powerMultiplierStack.length === 0) {\n throw new SyntaxError('Unmatched \")\" in \"' + text + '\" at index ' + index.toString());\n }\n\n powerMultiplierStackProduct /= powerMultiplierStack.pop();\n next();\n skipWhitespace();\n } // \"*\" and \"/\" should mean we are expecting something to come next.\n // Is there a forward slash? If so, negate powerMultiplierCurrent. The next unit or paren group is in the denominator.\n\n\n expectingUnit = false;\n\n if (parseCharacter('*')) {\n // explicit multiplication\n powerMultiplierCurrent = 1;\n expectingUnit = true;\n } else if (parseCharacter('/')) {\n // division\n powerMultiplierCurrent = -1;\n expectingUnit = true;\n } else {\n // implicit multiplication\n powerMultiplierCurrent = 1;\n } // Replace the unit into the auto unit system\n\n\n if (res.unit.base) {\n var baseDim = res.unit.base.key;\n UNIT_SYSTEMS.auto[baseDim] = {\n unit: res.unit,\n prefix: res.prefix\n };\n }\n } // Has the string been entirely consumed?\n\n\n skipWhitespace();\n\n if (c) {\n throw new SyntaxError('Could not parse: \"' + str + '\"');\n } // Is there a trailing slash?\n\n\n if (expectingUnit) {\n throw new SyntaxError('Trailing characters: \"' + str + '\"');\n } // Is the parentheses stack empty?\n\n\n if (powerMultiplierStack.length !== 0) {\n throw new SyntaxError('Unmatched \"(\" in \"' + text + '\"');\n } // Are there any units at all?\n\n\n if (unit.units.length === 0 && !options.allowNoUnits) {\n throw new SyntaxError('\"' + str + '\" contains no units');\n }\n\n unit.value = value !== undefined ? unit._normalize(value) : null;\n return unit;\n };\n /**\n * create a copy of this unit\n * @memberof Unit\n * @return {Unit} Returns a cloned version of the unit\n */\n\n\n Unit.prototype.clone = function () {\n var unit = new Unit();\n unit.fixPrefix = this.fixPrefix;\n unit.skipAutomaticSimplification = this.skipAutomaticSimplification;\n unit.value = clone(this.value);\n unit.dimensions = this.dimensions.slice(0);\n unit.units = [];\n\n for (var i = 0; i < this.units.length; i++) {\n unit.units[i] = {};\n\n for (var p in this.units[i]) {\n if (hasOwnProperty(this.units[i], p)) {\n unit.units[i][p] = this.units[i][p];\n }\n }\n }\n\n return unit;\n };\n /**\n * Return whether the unit is derived (such as m/s, or cm^2, but not N)\n * @memberof Unit\n * @return {boolean} True if the unit is derived\n */\n\n\n Unit.prototype._isDerived = function () {\n if (this.units.length === 0) {\n return false;\n }\n\n return this.units.length > 1 || Math.abs(this.units[0].power - 1.0) > 1e-15;\n };\n /**\n * Normalize a value, based on its currently set unit(s)\n * @memberof Unit\n * @param {number | BigNumber | Fraction | boolean} value\n * @return {number | BigNumber | Fraction | boolean} normalized value\n * @private\n */\n\n\n Unit.prototype._normalize = function (value) {\n var unitValue, unitOffset, unitPower, unitPrefixValue;\n var convert;\n\n if (value === null || value === undefined || this.units.length === 0) {\n return value;\n } else if (this._isDerived()) {\n // This is a derived unit, so do not apply offsets.\n // For example, with J kg^-1 degC^-1 you would NOT want to apply the offset.\n var res = value;\n convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed\n\n for (var i = 0; i < this.units.length; i++) {\n unitValue = convert(this.units[i].unit.value);\n unitPrefixValue = convert(this.units[i].prefix.value);\n unitPower = convert(this.units[i].power);\n res = multiplyScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));\n }\n\n return res;\n } else {\n // This is a single unit of power 1, like kg or degC\n convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed\n\n unitValue = convert(this.units[0].unit.value);\n unitOffset = convert(this.units[0].unit.offset);\n unitPrefixValue = convert(this.units[0].prefix.value);\n return multiplyScalar(addScalar(value, unitOffset), multiplyScalar(unitValue, unitPrefixValue));\n }\n };\n /**\n * Denormalize a value, based on its currently set unit(s)\n * @memberof Unit\n * @param {number} value\n * @param {number} [prefixValue] Optional prefix value to be used (ignored if this is a derived unit)\n * @return {number} denormalized value\n * @private\n */\n\n\n Unit.prototype._denormalize = function (value, prefixValue) {\n var unitValue, unitOffset, unitPower, unitPrefixValue;\n var convert;\n\n if (value === null || value === undefined || this.units.length === 0) {\n return value;\n } else if (this._isDerived()) {\n // This is a derived unit, so do not apply offsets.\n // For example, with J kg^-1 degC^-1 you would NOT want to apply the offset.\n // Also, prefixValue is ignored--but we will still use the prefix value stored in each unit, since kg is usually preferable to g unless the user decides otherwise.\n var res = value;\n convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed\n\n for (var i = 0; i < this.units.length; i++) {\n unitValue = convert(this.units[i].unit.value);\n unitPrefixValue = convert(this.units[i].prefix.value);\n unitPower = convert(this.units[i].power);\n res = divideScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));\n }\n\n return res;\n } else {\n // This is a single unit of power 1, like kg or degC\n convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed\n\n unitValue = convert(this.units[0].unit.value);\n unitPrefixValue = convert(this.units[0].prefix.value);\n unitOffset = convert(this.units[0].unit.offset);\n\n if (prefixValue === undefined || prefixValue === null) {\n return subtract(divideScalar(divideScalar(value, unitValue), unitPrefixValue), unitOffset);\n } else {\n return subtract(divideScalar(divideScalar(value, unitValue), prefixValue), unitOffset);\n }\n }\n };\n /**\n * Find a unit from a string\n * @memberof Unit\n * @param {string} str A string like 'cm' or 'inch'\n * @returns {Object | null} result When found, an object with fields unit and\n * prefix is returned. Else, null is returned.\n * @private\n */\n\n\n var _findUnit = memoize(str => {\n // First, match units names exactly. For example, a user could define 'mm' as 10^-4 m, which is silly, but then we would want 'mm' to match the user-defined unit.\n if (hasOwnProperty(UNITS, str)) {\n var unit = UNITS[str];\n var prefix = unit.prefixes[''];\n return {\n unit,\n prefix\n };\n }\n\n for (var _name in UNITS) {\n if (hasOwnProperty(UNITS, _name)) {\n if (endsWith(str, _name)) {\n var _unit = UNITS[_name];\n var prefixLen = str.length - _name.length;\n var prefixName = str.substring(0, prefixLen);\n\n var _prefix = hasOwnProperty(_unit.prefixes, prefixName) ? _unit.prefixes[prefixName] : undefined;\n\n if (_prefix !== undefined) {\n // store unit, prefix, and value\n return {\n unit: _unit,\n prefix: _prefix\n };\n }\n }\n }\n }\n\n return null;\n }, {\n hasher: args => args[0],\n limit: 100\n });\n /**\n * Test if the given expression is a unit.\n * The unit can have a prefix but cannot have a value.\n * @memberof Unit\n * @param {string} name A string to be tested whether it is a value less unit.\n * The unit can have prefix, like \"cm\"\n * @return {boolean} true if the given string is a unit\n */\n\n\n Unit.isValuelessUnit = function (name) {\n return _findUnit(name) !== null;\n };\n /**\n * check if this unit has given base unit\n * If this unit is a derived unit, this will ALWAYS return false, since by definition base units are not derived.\n * @memberof Unit\n * @param {BASE_UNITS | string | undefined} base\n */\n\n\n Unit.prototype.hasBase = function (base) {\n if (typeof base === 'string') {\n base = BASE_UNITS[base];\n }\n\n if (!base) {\n return false;\n } // All dimensions must be the same\n\n\n for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n if (Math.abs((this.dimensions[i] || 0) - (base.dimensions[i] || 0)) > 1e-12) {\n return false;\n }\n }\n\n return true;\n };\n /**\n * Check if this unit has a base or bases equal to another base or bases\n * For derived units, the exponent on each base also must match\n * @memberof Unit\n * @param {Unit} other\n * @return {boolean} true if equal base\n */\n\n\n Unit.prototype.equalBase = function (other) {\n // All dimensions must be the same\n for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n if (Math.abs((this.dimensions[i] || 0) - (other.dimensions[i] || 0)) > 1e-12) {\n return false;\n }\n }\n\n return true;\n };\n /**\n * Check if this unit equals another unit\n * @memberof Unit\n * @param {Unit} other\n * @return {boolean} true if both units are equal\n */\n\n\n Unit.prototype.equals = function (other) {\n return this.equalBase(other) && equal(this.value, other.value);\n };\n /**\n * Multiply this unit with another one\n * @memberof Unit\n * @param {Unit} other\n * @return {Unit} product of this unit and the other unit\n */\n\n\n Unit.prototype.multiply = function (other) {\n var res = this.clone();\n\n for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n // Dimensions arrays may be of different lengths. Default to 0.\n res.dimensions[i] = (this.dimensions[i] || 0) + (other.dimensions[i] || 0);\n } // Append other's units list onto res\n\n\n for (var _i = 0; _i < other.units.length; _i++) {\n // Make a shallow copy of every unit\n var inverted = _objectSpread({}, other.units[_i]);\n\n res.units.push(inverted);\n } // If at least one operand has a value, then the result should also have a value\n\n\n if (this.value !== null || other.value !== null) {\n var valThis = this.value === null ? this._normalize(1) : this.value;\n var valOther = other.value === null ? other._normalize(1) : other.value;\n res.value = multiplyScalar(valThis, valOther);\n } else {\n res.value = null;\n }\n\n res.skipAutomaticSimplification = false;\n return getNumericIfUnitless(res);\n };\n /**\n * Divide this unit by another one\n * @memberof Unit\n * @param {Unit} other\n * @return {Unit} result of dividing this unit by the other unit\n */\n\n\n Unit.prototype.divide = function (other) {\n var res = this.clone();\n\n for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n // Dimensions arrays may be of different lengths. Default to 0.\n res.dimensions[i] = (this.dimensions[i] || 0) - (other.dimensions[i] || 0);\n } // Invert and append other's units list onto res\n\n\n for (var _i2 = 0; _i2 < other.units.length; _i2++) {\n // Make a shallow copy of every unit\n var inverted = _objectSpread(_objectSpread({}, other.units[_i2]), {}, {\n power: -other.units[_i2].power\n });\n\n res.units.push(inverted);\n } // If at least one operand has a value, the result should have a value\n\n\n if (this.value !== null || other.value !== null) {\n var valThis = this.value === null ? this._normalize(1) : this.value;\n var valOther = other.value === null ? other._normalize(1) : other.value;\n res.value = divideScalar(valThis, valOther);\n } else {\n res.value = null;\n }\n\n res.skipAutomaticSimplification = false;\n return getNumericIfUnitless(res);\n };\n /**\n * Calculate the power of a unit\n * @memberof Unit\n * @param {number | Fraction | BigNumber} p\n * @returns {Unit} The result: this^p\n */\n\n\n Unit.prototype.pow = function (p) {\n var res = this.clone();\n\n for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n // Dimensions arrays may be of different lengths. Default to 0.\n res.dimensions[i] = (this.dimensions[i] || 0) * p;\n } // Adjust the power of each unit in the list\n\n\n for (var _i3 = 0; _i3 < res.units.length; _i3++) {\n res.units[_i3].power *= p;\n }\n\n if (res.value !== null) {\n res.value = pow(res.value, p); // only allow numeric output, we don't want to return a Complex number\n // if (!isNumeric(res.value)) {\n // res.value = NaN\n // }\n // Update: Complex supported now\n } else {\n res.value = null;\n }\n\n res.skipAutomaticSimplification = false;\n return getNumericIfUnitless(res);\n };\n /**\n * Return the numeric value of this unit if it is dimensionless, has a value, and config.predictable == false; or the original unit otherwise\n * @param {Unit} unit\n * @returns {number | Fraction | BigNumber | Unit} The numeric value of the unit if conditions are met, or the original unit otherwise\n */\n\n\n function getNumericIfUnitless(unit) {\n if (unit.equalBase(BASE_UNITS.NONE) && unit.value !== null && !config.predictable) {\n return unit.value;\n } else {\n return unit;\n }\n }\n /**\n * Calculate the absolute value of a unit\n * @memberof Unit\n * @param {number | Fraction | BigNumber} x\n * @returns {Unit} The result: |x|, absolute value of x\n */\n\n\n Unit.prototype.abs = function () {\n // This gives correct, but unexpected, results for units with an offset.\n // For example, abs(-283.15 degC) = -263.15 degC !!!\n var ret = this.clone();\n ret.value = ret.value !== null ? abs(ret.value) : null;\n\n for (var i in ret.units) {\n if (ret.units[i].unit.name === 'VA' || ret.units[i].unit.name === 'VAR') {\n ret.units[i].unit = UNITS.W;\n }\n }\n\n return ret;\n };\n /**\n * Convert the unit to a specific unit name.\n * @memberof Unit\n * @param {string | Unit} valuelessUnit A unit without value. Can have prefix, like \"cm\"\n * @returns {Unit} Returns a clone of the unit with a fixed prefix and unit.\n */\n\n\n Unit.prototype.to = function (valuelessUnit) {\n var other;\n var value = this.value === null ? this._normalize(1) : this.value;\n\n if (typeof valuelessUnit === 'string') {\n // other = new Unit(null, valuelessUnit)\n other = Unit.parse(valuelessUnit);\n\n if (!this.equalBase(other)) {\n throw new Error(\"Units do not match ('\".concat(other.toString(), \"' != '\").concat(this.toString(), \"')\"));\n }\n\n if (other.value !== null) {\n throw new Error('Cannot convert to a unit with a value');\n }\n\n other.value = clone(value);\n other.fixPrefix = true;\n other.skipAutomaticSimplification = true;\n return other;\n } else if (isUnit(valuelessUnit)) {\n if (!this.equalBase(valuelessUnit)) {\n throw new Error(\"Units do not match ('\".concat(valuelessUnit.toString(), \"' != '\").concat(this.toString(), \"')\"));\n }\n\n if (valuelessUnit.value !== null) {\n throw new Error('Cannot convert to a unit with a value');\n }\n\n other = valuelessUnit.clone();\n other.value = clone(value);\n other.fixPrefix = true;\n other.skipAutomaticSimplification = true;\n return other;\n } else {\n throw new Error('String or Unit expected as parameter');\n }\n };\n /**\n * Return the value of the unit when represented with given valueless unit\n * @memberof Unit\n * @param {string | Unit} valuelessUnit For example 'cm' or 'inch'\n * @return {number} Returns the unit value as number.\n */\n // TODO: deprecate Unit.toNumber? It's always better to use toNumeric\n\n\n Unit.prototype.toNumber = function (valuelessUnit) {\n return toNumber(this.toNumeric(valuelessUnit));\n };\n /**\n * Return the value of the unit in the original numeric type\n * @memberof Unit\n * @param {string | Unit} valuelessUnit For example 'cm' or 'inch'\n * @return {number | BigNumber | Fraction} Returns the unit value\n */\n\n\n Unit.prototype.toNumeric = function (valuelessUnit) {\n var other;\n\n if (valuelessUnit) {\n // Allow getting the numeric value without converting to a different unit\n other = this.to(valuelessUnit);\n } else {\n other = this.clone();\n }\n\n if (other._isDerived() || other.units.length === 0) {\n return other._denormalize(other.value);\n } else {\n return other._denormalize(other.value, other.units[0].prefix.value);\n }\n };\n /**\n * Get a string representation of the unit.\n * @memberof Unit\n * @return {string}\n */\n\n\n Unit.prototype.toString = function () {\n return this.format();\n };\n /**\n * Get a JSON representation of the unit\n * @memberof Unit\n * @returns {Object} Returns a JSON object structured as:\n * `{\"mathjs\": \"Unit\", \"value\": 2, \"unit\": \"cm\", \"fixPrefix\": false}`\n */\n\n\n Unit.prototype.toJSON = function () {\n return {\n mathjs: 'Unit',\n value: this._denormalize(this.value),\n unit: this.formatUnits(),\n fixPrefix: this.fixPrefix\n };\n };\n /**\n * Instantiate a Unit from a JSON object\n * @memberof Unit\n * @param {Object} json A JSON object structured as:\n * `{\"mathjs\": \"Unit\", \"value\": 2, \"unit\": \"cm\", \"fixPrefix\": false}`\n * @return {Unit}\n */\n\n\n Unit.fromJSON = function (json) {\n var unit = new Unit(json.value, json.unit);\n unit.fixPrefix = json.fixPrefix || false;\n return unit;\n };\n /**\n * Returns the string representation of the unit.\n * @memberof Unit\n * @return {string}\n */\n\n\n Unit.prototype.valueOf = Unit.prototype.toString;\n /**\n * Simplify this Unit's unit list and return a new Unit with the simplified list.\n * The returned Unit will contain a list of the \"best\" units for formatting.\n */\n\n Unit.prototype.simplify = function () {\n var ret = this.clone();\n var proposedUnitList = []; // Search for a matching base\n\n var matchingBase;\n\n for (var key in currentUnitSystem) {\n if (hasOwnProperty(currentUnitSystem, key)) {\n if (ret.hasBase(BASE_UNITS[key])) {\n matchingBase = key;\n break;\n }\n }\n }\n\n if (matchingBase === 'NONE') {\n ret.units = [];\n } else {\n var matchingUnit;\n\n if (matchingBase) {\n // Does the unit system have a matching unit?\n if (hasOwnProperty(currentUnitSystem, matchingBase)) {\n matchingUnit = currentUnitSystem[matchingBase];\n }\n }\n\n if (matchingUnit) {\n ret.units = [{\n unit: matchingUnit.unit,\n prefix: matchingUnit.prefix,\n power: 1.0\n }];\n } else {\n // Multiple units or units with powers are formatted like this:\n // 5 (kg m^2) / (s^3 mol)\n // Build an representation from the base units of the current unit system\n var missingBaseDim = false;\n\n for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n var baseDim = BASE_DIMENSIONS[i];\n\n if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {\n if (hasOwnProperty(currentUnitSystem, baseDim)) {\n proposedUnitList.push({\n unit: currentUnitSystem[baseDim].unit,\n prefix: currentUnitSystem[baseDim].prefix,\n power: ret.dimensions[i] || 0\n });\n } else {\n missingBaseDim = true;\n }\n }\n } // Is the proposed unit list \"simpler\" than the existing one?\n\n\n if (proposedUnitList.length < ret.units.length && !missingBaseDim) {\n // Replace this unit list with the proposed list\n ret.units = proposedUnitList;\n }\n }\n }\n\n return ret;\n };\n /**\n * Returns a new Unit in the SI system with the same value as this one\n */\n\n\n Unit.prototype.toSI = function () {\n var ret = this.clone();\n var proposedUnitList = []; // Multiple units or units with powers are formatted like this:\n // 5 (kg m^2) / (s^3 mol)\n // Build an representation from the base units of the SI unit system\n\n for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n var baseDim = BASE_DIMENSIONS[i];\n\n if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {\n if (hasOwnProperty(UNIT_SYSTEMS.si, baseDim)) {\n proposedUnitList.push({\n unit: UNIT_SYSTEMS.si[baseDim].unit,\n prefix: UNIT_SYSTEMS.si[baseDim].prefix,\n power: ret.dimensions[i] || 0\n });\n } else {\n throw new Error('Cannot express custom unit ' + baseDim + ' in SI units');\n }\n }\n } // Replace this unit list with the proposed list\n\n\n ret.units = proposedUnitList;\n ret.fixPrefix = true;\n ret.skipAutomaticSimplification = true;\n return ret;\n };\n /**\n * Get a string representation of the units of this Unit, without the value. The unit list is formatted as-is without first being simplified.\n * @memberof Unit\n * @return {string}\n */\n\n\n Unit.prototype.formatUnits = function () {\n var strNum = '';\n var strDen = '';\n var nNum = 0;\n var nDen = 0;\n\n for (var i = 0; i < this.units.length; i++) {\n if (this.units[i].power > 0) {\n nNum++;\n strNum += ' ' + this.units[i].prefix.name + this.units[i].unit.name;\n\n if (Math.abs(this.units[i].power - 1.0) > 1e-15) {\n strNum += '^' + this.units[i].power;\n }\n } else if (this.units[i].power < 0) {\n nDen++;\n }\n }\n\n if (nDen > 0) {\n for (var _i4 = 0; _i4 < this.units.length; _i4++) {\n if (this.units[_i4].power < 0) {\n if (nNum > 0) {\n strDen += ' ' + this.units[_i4].prefix.name + this.units[_i4].unit.name;\n\n if (Math.abs(this.units[_i4].power + 1.0) > 1e-15) {\n strDen += '^' + -this.units[_i4].power;\n }\n } else {\n strDen += ' ' + this.units[_i4].prefix.name + this.units[_i4].unit.name;\n strDen += '^' + this.units[_i4].power;\n }\n }\n }\n } // Remove leading \" \"\n\n\n strNum = strNum.substr(1);\n strDen = strDen.substr(1); // Add parans for better copy/paste back into evaluate, for example, or for better pretty print formatting\n\n if (nNum > 1 && nDen > 0) {\n strNum = '(' + strNum + ')';\n }\n\n if (nDen > 1 && nNum > 0) {\n strDen = '(' + strDen + ')';\n }\n\n var str = strNum;\n\n if (nNum > 0 && nDen > 0) {\n str += ' / ';\n }\n\n str += strDen;\n return str;\n };\n /**\n * Get a string representation of the Unit, with optional formatting options.\n * @memberof Unit\n * @param {Object | number | Function} [options] Formatting options. See\n * lib/utils/number:format for a\n * description of the available\n * options.\n * @return {string}\n */\n\n\n Unit.prototype.format = function (options) {\n // Simplfy the unit list, unless it is valueless or was created directly in the\n // constructor or as the result of to or toSI\n var simp = this.skipAutomaticSimplification || this.value === null ? this.clone() : this.simplify(); // Apply some custom logic for handling VA and VAR. The goal is to express the value of the unit as a real value, if possible. Otherwise, use a real-valued unit instead of a complex-valued one.\n\n var isImaginary = false;\n\n if (typeof simp.value !== 'undefined' && simp.value !== null && isComplex(simp.value)) {\n // TODO: Make this better, for example, use relative magnitude of re and im rather than absolute\n isImaginary = Math.abs(simp.value.re) < 1e-14;\n }\n\n for (var i in simp.units) {\n if (hasOwnProperty(simp.units, i)) {\n if (simp.units[i].unit) {\n if (simp.units[i].unit.name === 'VA' && isImaginary) {\n simp.units[i].unit = UNITS.VAR;\n } else if (simp.units[i].unit.name === 'VAR' && !isImaginary) {\n simp.units[i].unit = UNITS.VA;\n }\n }\n }\n } // Now apply the best prefix\n // Units must have only one unit and not have the fixPrefix flag set\n\n\n if (simp.units.length === 1 && !simp.fixPrefix) {\n // Units must have integer powers, otherwise the prefix will change the\n // outputted value by not-an-integer-power-of-ten\n if (Math.abs(simp.units[0].power - Math.round(simp.units[0].power)) < 1e-14) {\n // Apply the best prefix\n simp.units[0].prefix = simp._bestPrefix();\n }\n }\n\n var value = simp._denormalize(simp.value);\n\n var str = simp.value !== null ? format(value, options || {}) : '';\n var unitStr = simp.formatUnits();\n\n if (simp.value && isComplex(simp.value)) {\n str = '(' + str + ')'; // Surround complex values with ( ) to enable better parsing\n }\n\n if (unitStr.length > 0 && str.length > 0) {\n str += ' ';\n }\n\n str += unitStr;\n return str;\n };\n /**\n * Calculate the best prefix using current value.\n * @memberof Unit\n * @returns {Object} prefix\n * @private\n */\n\n\n Unit.prototype._bestPrefix = function () {\n if (this.units.length !== 1) {\n throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!');\n }\n\n if (Math.abs(this.units[0].power - Math.round(this.units[0].power)) >= 1e-14) {\n throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!');\n } // find the best prefix value (resulting in the value of which\n // the absolute value of the log10 is closest to zero,\n // though with a little offset of 1.2 for nicer values: you get a\n // sequence 1mm 100mm 500mm 0.6m 1m 10m 100m 500m 0.6km 1km ...\n // Note: the units value can be any numeric type, but to find the best\n // prefix it's enough to work with limited precision of a regular number\n // Update: using mathjs abs since we also allow complex numbers\n\n\n var absValue = this.value !== null ? abs(this.value) : 0;\n var absUnitValue = abs(this.units[0].unit.value);\n var bestPrefix = this.units[0].prefix;\n\n if (absValue === 0) {\n return bestPrefix;\n }\n\n var power = this.units[0].power;\n var bestDiff = Math.log(absValue / Math.pow(bestPrefix.value * absUnitValue, power)) / Math.LN10 - 1.2;\n if (bestDiff > -2.200001 && bestDiff < 1.800001) return bestPrefix; // Allow the original prefix\n\n bestDiff = Math.abs(bestDiff);\n var prefixes = this.units[0].unit.prefixes;\n\n for (var p in prefixes) {\n if (hasOwnProperty(prefixes, p)) {\n var prefix = prefixes[p];\n\n if (prefix.scientific) {\n var diff = Math.abs(Math.log(absValue / Math.pow(prefix.value * absUnitValue, power)) / Math.LN10 - 1.2);\n\n if (diff < bestDiff || diff === bestDiff && prefix.name.length < bestPrefix.name.length) {\n // choose the prefix with the smallest diff, or if equal, choose the one\n // with the shortest name (can happen with SHORTLONG for example)\n bestPrefix = prefix;\n bestDiff = diff;\n }\n }\n }\n }\n\n return bestPrefix;\n };\n /**\n * Returns an array of units whose sum is equal to this unit\n * @memberof Unit\n * @param {Array} [parts] An array of strings or valueless units.\n *\n * Example:\n *\n * const u = new Unit(1, 'm')\n * u.splitUnit(['feet', 'inch'])\n * [ 3 feet, 3.3700787401575 inch ]\n *\n * @return {Array} An array of units.\n */\n\n\n Unit.prototype.splitUnit = function (parts) {\n var x = this.clone();\n var ret = [];\n\n for (var i = 0; i < parts.length; i++) {\n // Convert x to the requested unit\n x = x.to(parts[i]);\n if (i === parts.length - 1) break; // Get the numeric value of this unit\n\n var xNumeric = x.toNumeric(); // Check to see if xNumeric is nearly equal to an integer,\n // since fix can incorrectly round down if there is round-off error\n\n var xRounded = round(xNumeric);\n var xFixed = void 0;\n var isNearlyEqual = equal(xRounded, xNumeric);\n\n if (isNearlyEqual) {\n xFixed = xRounded;\n } else {\n xFixed = fix(x.toNumeric());\n }\n\n var y = new Unit(xFixed, parts[i].toString());\n ret.push(y);\n x = subtract(x, y);\n } // This little bit fixes a bug where the remainder should be 0 but is a little bit off.\n // But instead of comparing x, the remainder, with zero--we will compare the sum of\n // all the parts so far with the original value. If they are nearly equal,\n // we set the remainder to 0.\n\n\n var testSum = 0;\n\n for (var _i5 = 0; _i5 < ret.length; _i5++) {\n testSum = addScalar(testSum, ret[_i5].value);\n }\n\n if (equal(testSum, this.value)) {\n x.value = 0;\n }\n\n ret.push(x);\n return ret;\n };\n\n var PREFIXES = {\n NONE: {\n '': {\n name: '',\n value: 1,\n scientific: true\n }\n },\n SHORT: {\n '': {\n name: '',\n value: 1,\n scientific: true\n },\n da: {\n name: 'da',\n value: 1e1,\n scientific: false\n },\n h: {\n name: 'h',\n value: 1e2,\n scientific: false\n },\n k: {\n name: 'k',\n value: 1e3,\n scientific: true\n },\n M: {\n name: 'M',\n value: 1e6,\n scientific: true\n },\n G: {\n name: 'G',\n value: 1e9,\n scientific: true\n },\n T: {\n name: 'T',\n value: 1e12,\n scientific: true\n },\n P: {\n name: 'P',\n value: 1e15,\n scientific: true\n },\n E: {\n name: 'E',\n value: 1e18,\n scientific: true\n },\n Z: {\n name: 'Z',\n value: 1e21,\n scientific: true\n },\n Y: {\n name: 'Y',\n value: 1e24,\n scientific: true\n },\n d: {\n name: 'd',\n value: 1e-1,\n scientific: false\n },\n c: {\n name: 'c',\n value: 1e-2,\n scientific: false\n },\n m: {\n name: 'm',\n value: 1e-3,\n scientific: true\n },\n u: {\n name: 'u',\n value: 1e-6,\n scientific: true\n },\n n: {\n name: 'n',\n value: 1e-9,\n scientific: true\n },\n p: {\n name: 'p',\n value: 1e-12,\n scientific: true\n },\n f: {\n name: 'f',\n value: 1e-15,\n scientific: true\n },\n a: {\n name: 'a',\n value: 1e-18,\n scientific: true\n },\n z: {\n name: 'z',\n value: 1e-21,\n scientific: true\n },\n y: {\n name: 'y',\n value: 1e-24,\n scientific: true\n }\n },\n LONG: {\n '': {\n name: '',\n value: 1,\n scientific: true\n },\n deca: {\n name: 'deca',\n value: 1e1,\n scientific: false\n },\n hecto: {\n name: 'hecto',\n value: 1e2,\n scientific: false\n },\n kilo: {\n name: 'kilo',\n value: 1e3,\n scientific: true\n },\n mega: {\n name: 'mega',\n value: 1e6,\n scientific: true\n },\n giga: {\n name: 'giga',\n value: 1e9,\n scientific: true\n },\n tera: {\n name: 'tera',\n value: 1e12,\n scientific: true\n },\n peta: {\n name: 'peta',\n value: 1e15,\n scientific: true\n },\n exa: {\n name: 'exa',\n value: 1e18,\n scientific: true\n },\n zetta: {\n name: 'zetta',\n value: 1e21,\n scientific: true\n },\n yotta: {\n name: 'yotta',\n value: 1e24,\n scientific: true\n },\n deci: {\n name: 'deci',\n value: 1e-1,\n scientific: false\n },\n centi: {\n name: 'centi',\n value: 1e-2,\n scientific: false\n },\n milli: {\n name: 'milli',\n value: 1e-3,\n scientific: true\n },\n micro: {\n name: 'micro',\n value: 1e-6,\n scientific: true\n },\n nano: {\n name: 'nano',\n value: 1e-9,\n scientific: true\n },\n pico: {\n name: 'pico',\n value: 1e-12,\n scientific: true\n },\n femto: {\n name: 'femto',\n value: 1e-15,\n scientific: true\n },\n atto: {\n name: 'atto',\n value: 1e-18,\n scientific: true\n },\n zepto: {\n name: 'zepto',\n value: 1e-21,\n scientific: true\n },\n yocto: {\n name: 'yocto',\n value: 1e-24,\n scientific: true\n }\n },\n SQUARED: {\n '': {\n name: '',\n value: 1,\n scientific: true\n },\n da: {\n name: 'da',\n value: 1e2,\n scientific: false\n },\n h: {\n name: 'h',\n value: 1e4,\n scientific: false\n },\n k: {\n name: 'k',\n value: 1e6,\n scientific: true\n },\n M: {\n name: 'M',\n value: 1e12,\n scientific: true\n },\n G: {\n name: 'G',\n value: 1e18,\n scientific: true\n },\n T: {\n name: 'T',\n value: 1e24,\n scientific: true\n },\n P: {\n name: 'P',\n value: 1e30,\n scientific: true\n },\n E: {\n name: 'E',\n value: 1e36,\n scientific: true\n },\n Z: {\n name: 'Z',\n value: 1e42,\n scientific: true\n },\n Y: {\n name: 'Y',\n value: 1e48,\n scientific: true\n },\n d: {\n name: 'd',\n value: 1e-2,\n scientific: false\n },\n c: {\n name: 'c',\n value: 1e-4,\n scientific: false\n },\n m: {\n name: 'm',\n value: 1e-6,\n scientific: true\n },\n u: {\n name: 'u',\n value: 1e-12,\n scientific: true\n },\n n: {\n name: 'n',\n value: 1e-18,\n scientific: true\n },\n p: {\n name: 'p',\n value: 1e-24,\n scientific: true\n },\n f: {\n name: 'f',\n value: 1e-30,\n scientific: true\n },\n a: {\n name: 'a',\n value: 1e-36,\n scientific: true\n },\n z: {\n name: 'z',\n value: 1e-42,\n scientific: true\n },\n y: {\n name: 'y',\n value: 1e-48,\n scientific: true\n }\n },\n CUBIC: {\n '': {\n name: '',\n value: 1,\n scientific: true\n },\n da: {\n name: 'da',\n value: 1e3,\n scientific: false\n },\n h: {\n name: 'h',\n value: 1e6,\n scientific: false\n },\n k: {\n name: 'k',\n value: 1e9,\n scientific: true\n },\n M: {\n name: 'M',\n value: 1e18,\n scientific: true\n },\n G: {\n name: 'G',\n value: 1e27,\n scientific: true\n },\n T: {\n name: 'T',\n value: 1e36,\n scientific: true\n },\n P: {\n name: 'P',\n value: 1e45,\n scientific: true\n },\n E: {\n name: 'E',\n value: 1e54,\n scientific: true\n },\n Z: {\n name: 'Z',\n value: 1e63,\n scientific: true\n },\n Y: {\n name: 'Y',\n value: 1e72,\n scientific: true\n },\n d: {\n name: 'd',\n value: 1e-3,\n scientific: false\n },\n c: {\n name: 'c',\n value: 1e-6,\n scientific: false\n },\n m: {\n name: 'm',\n value: 1e-9,\n scientific: true\n },\n u: {\n name: 'u',\n value: 1e-18,\n scientific: true\n },\n n: {\n name: 'n',\n value: 1e-27,\n scientific: true\n },\n p: {\n name: 'p',\n value: 1e-36,\n scientific: true\n },\n f: {\n name: 'f',\n value: 1e-45,\n scientific: true\n },\n a: {\n name: 'a',\n value: 1e-54,\n scientific: true\n },\n z: {\n name: 'z',\n value: 1e-63,\n scientific: true\n },\n y: {\n name: 'y',\n value: 1e-72,\n scientific: true\n }\n },\n BINARY_SHORT_SI: {\n '': {\n name: '',\n value: 1,\n scientific: true\n },\n k: {\n name: 'k',\n value: 1e3,\n scientific: true\n },\n M: {\n name: 'M',\n value: 1e6,\n scientific: true\n },\n G: {\n name: 'G',\n value: 1e9,\n scientific: true\n },\n T: {\n name: 'T',\n value: 1e12,\n scientific: true\n },\n P: {\n name: 'P',\n value: 1e15,\n scientific: true\n },\n E: {\n name: 'E',\n value: 1e18,\n scientific: true\n },\n Z: {\n name: 'Z',\n value: 1e21,\n scientific: true\n },\n Y: {\n name: 'Y',\n value: 1e24,\n scientific: true\n }\n },\n BINARY_SHORT_IEC: {\n '': {\n name: '',\n value: 1,\n scientific: true\n },\n Ki: {\n name: 'Ki',\n value: 1024,\n scientific: true\n },\n Mi: {\n name: 'Mi',\n value: Math.pow(1024, 2),\n scientific: true\n },\n Gi: {\n name: 'Gi',\n value: Math.pow(1024, 3),\n scientific: true\n },\n Ti: {\n name: 'Ti',\n value: Math.pow(1024, 4),\n scientific: true\n },\n Pi: {\n name: 'Pi',\n value: Math.pow(1024, 5),\n scientific: true\n },\n Ei: {\n name: 'Ei',\n value: Math.pow(1024, 6),\n scientific: true\n },\n Zi: {\n name: 'Zi',\n value: Math.pow(1024, 7),\n scientific: true\n },\n Yi: {\n name: 'Yi',\n value: Math.pow(1024, 8),\n scientific: true\n }\n },\n BINARY_LONG_SI: {\n '': {\n name: '',\n value: 1,\n scientific: true\n },\n kilo: {\n name: 'kilo',\n value: 1e3,\n scientific: true\n },\n mega: {\n name: 'mega',\n value: 1e6,\n scientific: true\n },\n giga: {\n name: 'giga',\n value: 1e9,\n scientific: true\n },\n tera: {\n name: 'tera',\n value: 1e12,\n scientific: true\n },\n peta: {\n name: 'peta',\n value: 1e15,\n scientific: true\n },\n exa: {\n name: 'exa',\n value: 1e18,\n scientific: true\n },\n zetta: {\n name: 'zetta',\n value: 1e21,\n scientific: true\n },\n yotta: {\n name: 'yotta',\n value: 1e24,\n scientific: true\n }\n },\n BINARY_LONG_IEC: {\n '': {\n name: '',\n value: 1,\n scientific: true\n },\n kibi: {\n name: 'kibi',\n value: 1024,\n scientific: true\n },\n mebi: {\n name: 'mebi',\n value: Math.pow(1024, 2),\n scientific: true\n },\n gibi: {\n name: 'gibi',\n value: Math.pow(1024, 3),\n scientific: true\n },\n tebi: {\n name: 'tebi',\n value: Math.pow(1024, 4),\n scientific: true\n },\n pebi: {\n name: 'pebi',\n value: Math.pow(1024, 5),\n scientific: true\n },\n exi: {\n name: 'exi',\n value: Math.pow(1024, 6),\n scientific: true\n },\n zebi: {\n name: 'zebi',\n value: Math.pow(1024, 7),\n scientific: true\n },\n yobi: {\n name: 'yobi',\n value: Math.pow(1024, 8),\n scientific: true\n }\n },\n BTU: {\n '': {\n name: '',\n value: 1,\n scientific: true\n },\n MM: {\n name: 'MM',\n value: 1e6,\n scientific: true\n }\n }\n };\n PREFIXES.SHORTLONG = _extends({}, PREFIXES.SHORT, PREFIXES.LONG);\n PREFIXES.BINARY_SHORT = _extends({}, PREFIXES.BINARY_SHORT_SI, PREFIXES.BINARY_SHORT_IEC);\n PREFIXES.BINARY_LONG = _extends({}, PREFIXES.BINARY_LONG_SI, PREFIXES.BINARY_LONG_IEC);\n /* Internally, each unit is represented by a value and a dimension array. The elements of the dimensions array have the following meaning:\n * Index Dimension\n * ----- ---------\n * 0 Length\n * 1 Mass\n * 2 Time\n * 3 Current\n * 4 Temperature\n * 5 Luminous intensity\n * 6 Amount of substance\n * 7 Angle\n * 8 Bit (digital)\n * For example, the unit \"298.15 K\" is a pure temperature and would have a value of 298.15 and a dimension array of [0, 0, 0, 0, 1, 0, 0, 0, 0]. The unit \"1 cal / (gm °C)\" can be written in terms of the 9 fundamental dimensions as [length^2] / ([time^2] * [temperature]), and would a value of (after conversion to SI) 4184.0 and a dimensions array of [2, 0, -2, 0, -1, 0, 0, 0, 0].\n *\n */\n\n var BASE_DIMENSIONS = ['MASS', 'LENGTH', 'TIME', 'CURRENT', 'TEMPERATURE', 'LUMINOUS_INTENSITY', 'AMOUNT_OF_SUBSTANCE', 'ANGLE', 'BIT'];\n var BASE_UNITS = {\n NONE: {\n dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 0]\n },\n MASS: {\n dimensions: [1, 0, 0, 0, 0, 0, 0, 0, 0]\n },\n LENGTH: {\n dimensions: [0, 1, 0, 0, 0, 0, 0, 0, 0]\n },\n TIME: {\n dimensions: [0, 0, 1, 0, 0, 0, 0, 0, 0]\n },\n CURRENT: {\n dimensions: [0, 0, 0, 1, 0, 0, 0, 0, 0]\n },\n TEMPERATURE: {\n dimensions: [0, 0, 0, 0, 1, 0, 0, 0, 0]\n },\n LUMINOUS_INTENSITY: {\n dimensions: [0, 0, 0, 0, 0, 1, 0, 0, 0]\n },\n AMOUNT_OF_SUBSTANCE: {\n dimensions: [0, 0, 0, 0, 0, 0, 1, 0, 0]\n },\n FORCE: {\n dimensions: [1, 1, -2, 0, 0, 0, 0, 0, 0]\n },\n SURFACE: {\n dimensions: [0, 2, 0, 0, 0, 0, 0, 0, 0]\n },\n VOLUME: {\n dimensions: [0, 3, 0, 0, 0, 0, 0, 0, 0]\n },\n ENERGY: {\n dimensions: [1, 2, -2, 0, 0, 0, 0, 0, 0]\n },\n POWER: {\n dimensions: [1, 2, -3, 0, 0, 0, 0, 0, 0]\n },\n PRESSURE: {\n dimensions: [1, -1, -2, 0, 0, 0, 0, 0, 0]\n },\n ELECTRIC_CHARGE: {\n dimensions: [0, 0, 1, 1, 0, 0, 0, 0, 0]\n },\n ELECTRIC_CAPACITANCE: {\n dimensions: [-1, -2, 4, 2, 0, 0, 0, 0, 0]\n },\n ELECTRIC_POTENTIAL: {\n dimensions: [1, 2, -3, -1, 0, 0, 0, 0, 0]\n },\n ELECTRIC_RESISTANCE: {\n dimensions: [1, 2, -3, -2, 0, 0, 0, 0, 0]\n },\n ELECTRIC_INDUCTANCE: {\n dimensions: [1, 2, -2, -2, 0, 0, 0, 0, 0]\n },\n ELECTRIC_CONDUCTANCE: {\n dimensions: [-1, -2, 3, 2, 0, 0, 0, 0, 0]\n },\n MAGNETIC_FLUX: {\n dimensions: [1, 2, -2, -1, 0, 0, 0, 0, 0]\n },\n MAGNETIC_FLUX_DENSITY: {\n dimensions: [1, 0, -2, -1, 0, 0, 0, 0, 0]\n },\n FREQUENCY: {\n dimensions: [0, 0, -1, 0, 0, 0, 0, 0, 0]\n },\n ANGLE: {\n dimensions: [0, 0, 0, 0, 0, 0, 0, 1, 0]\n },\n BIT: {\n dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 1]\n }\n };\n\n for (var key in BASE_UNITS) {\n if (hasOwnProperty(BASE_UNITS, key)) {\n BASE_UNITS[key].key = key;\n }\n }\n\n var BASE_UNIT_NONE = {};\n var UNIT_NONE = {\n name: '',\n base: BASE_UNIT_NONE,\n value: 1,\n offset: 0,\n dimensions: BASE_DIMENSIONS.map(x => 0)\n };\n var UNITS = {\n // length\n meter: {\n name: 'meter',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0\n },\n inch: {\n name: 'inch',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.NONE,\n value: 0.0254,\n offset: 0\n },\n foot: {\n name: 'foot',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.NONE,\n value: 0.3048,\n offset: 0\n },\n yard: {\n name: 'yard',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.NONE,\n value: 0.9144,\n offset: 0\n },\n mile: {\n name: 'mile',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.NONE,\n value: 1609.344,\n offset: 0\n },\n link: {\n name: 'link',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.NONE,\n value: 0.201168,\n offset: 0\n },\n rod: {\n name: 'rod',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.NONE,\n value: 5.0292,\n offset: 0\n },\n chain: {\n name: 'chain',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.NONE,\n value: 20.1168,\n offset: 0\n },\n angstrom: {\n name: 'angstrom',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.NONE,\n value: 1e-10,\n offset: 0\n },\n m: {\n name: 'm',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n in: {\n name: 'in',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.NONE,\n value: 0.0254,\n offset: 0\n },\n ft: {\n name: 'ft',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.NONE,\n value: 0.3048,\n offset: 0\n },\n yd: {\n name: 'yd',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.NONE,\n value: 0.9144,\n offset: 0\n },\n mi: {\n name: 'mi',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.NONE,\n value: 1609.344,\n offset: 0\n },\n li: {\n name: 'li',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.NONE,\n value: 0.201168,\n offset: 0\n },\n rd: {\n name: 'rd',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.NONE,\n value: 5.029210,\n offset: 0\n },\n ch: {\n name: 'ch',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.NONE,\n value: 20.1168,\n offset: 0\n },\n mil: {\n name: 'mil',\n base: BASE_UNITS.LENGTH,\n prefixes: PREFIXES.NONE,\n value: 0.0000254,\n offset: 0\n },\n // 1/1000 inch\n // Surface\n m2: {\n name: 'm2',\n base: BASE_UNITS.SURFACE,\n prefixes: PREFIXES.SQUARED,\n value: 1,\n offset: 0\n },\n sqin: {\n name: 'sqin',\n base: BASE_UNITS.SURFACE,\n prefixes: PREFIXES.NONE,\n value: 0.00064516,\n offset: 0\n },\n // 645.16 mm2\n sqft: {\n name: 'sqft',\n base: BASE_UNITS.SURFACE,\n prefixes: PREFIXES.NONE,\n value: 0.09290304,\n offset: 0\n },\n // 0.09290304 m2\n sqyd: {\n name: 'sqyd',\n base: BASE_UNITS.SURFACE,\n prefixes: PREFIXES.NONE,\n value: 0.83612736,\n offset: 0\n },\n // 0.83612736 m2\n sqmi: {\n name: 'sqmi',\n base: BASE_UNITS.SURFACE,\n prefixes: PREFIXES.NONE,\n value: 2589988.110336,\n offset: 0\n },\n // 2.589988110336 km2\n sqrd: {\n name: 'sqrd',\n base: BASE_UNITS.SURFACE,\n prefixes: PREFIXES.NONE,\n value: 25.29295,\n offset: 0\n },\n // 25.29295 m2\n sqch: {\n name: 'sqch',\n base: BASE_UNITS.SURFACE,\n prefixes: PREFIXES.NONE,\n value: 404.6873,\n offset: 0\n },\n // 404.6873 m2\n sqmil: {\n name: 'sqmil',\n base: BASE_UNITS.SURFACE,\n prefixes: PREFIXES.NONE,\n value: 6.4516e-10,\n offset: 0\n },\n // 6.4516 * 10^-10 m2\n acre: {\n name: 'acre',\n base: BASE_UNITS.SURFACE,\n prefixes: PREFIXES.NONE,\n value: 4046.86,\n offset: 0\n },\n // 4046.86 m2\n hectare: {\n name: 'hectare',\n base: BASE_UNITS.SURFACE,\n prefixes: PREFIXES.NONE,\n value: 10000,\n offset: 0\n },\n // 10000 m2\n // Volume\n m3: {\n name: 'm3',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.CUBIC,\n value: 1,\n offset: 0\n },\n L: {\n name: 'L',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.SHORT,\n value: 0.001,\n offset: 0\n },\n // litre\n l: {\n name: 'l',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.SHORT,\n value: 0.001,\n offset: 0\n },\n // litre\n litre: {\n name: 'litre',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.LONG,\n value: 0.001,\n offset: 0\n },\n cuin: {\n name: 'cuin',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 1.6387064e-5,\n offset: 0\n },\n // 1.6387064e-5 m3\n cuft: {\n name: 'cuft',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.028316846592,\n offset: 0\n },\n // 28.316 846 592 L\n cuyd: {\n name: 'cuyd',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.764554857984,\n offset: 0\n },\n // 764.554 857 984 L\n teaspoon: {\n name: 'teaspoon',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.000005,\n offset: 0\n },\n // 5 mL\n tablespoon: {\n name: 'tablespoon',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.000015,\n offset: 0\n },\n // 15 mL\n // {name: 'cup', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.000240, offset: 0}, // 240 mL // not possible, we have already another cup\n drop: {\n name: 'drop',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 5e-8,\n offset: 0\n },\n // 0.05 mL = 5e-8 m3\n gtt: {\n name: 'gtt',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 5e-8,\n offset: 0\n },\n // 0.05 mL = 5e-8 m3\n // Liquid volume\n minim: {\n name: 'minim',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.00000006161152,\n offset: 0\n },\n // 0.06161152 mL\n fluiddram: {\n name: 'fluiddram',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.0000036966911,\n offset: 0\n },\n // 3.696691 mL\n fluidounce: {\n name: 'fluidounce',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.00002957353,\n offset: 0\n },\n // 29.57353 mL\n gill: {\n name: 'gill',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.0001182941,\n offset: 0\n },\n // 118.2941 mL\n cc: {\n name: 'cc',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 1e-6,\n offset: 0\n },\n // 1e-6 L\n cup: {\n name: 'cup',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.0002365882,\n offset: 0\n },\n // 236.5882 mL\n pint: {\n name: 'pint',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.0004731765,\n offset: 0\n },\n // 473.1765 mL\n quart: {\n name: 'quart',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.0009463529,\n offset: 0\n },\n // 946.3529 mL\n gallon: {\n name: 'gallon',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.003785412,\n offset: 0\n },\n // 3.785412 L\n beerbarrel: {\n name: 'beerbarrel',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.1173478,\n offset: 0\n },\n // 117.3478 L\n oilbarrel: {\n name: 'oilbarrel',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.1589873,\n offset: 0\n },\n // 158.9873 L\n hogshead: {\n name: 'hogshead',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.2384810,\n offset: 0\n },\n // 238.4810 L\n // {name: 'min', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.00000006161152, offset: 0}, // 0.06161152 mL // min is already in use as minute\n fldr: {\n name: 'fldr',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.0000036966911,\n offset: 0\n },\n // 3.696691 mL\n floz: {\n name: 'floz',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.00002957353,\n offset: 0\n },\n // 29.57353 mL\n gi: {\n name: 'gi',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.0001182941,\n offset: 0\n },\n // 118.2941 mL\n cp: {\n name: 'cp',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.0002365882,\n offset: 0\n },\n // 236.5882 mL\n pt: {\n name: 'pt',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.0004731765,\n offset: 0\n },\n // 473.1765 mL\n qt: {\n name: 'qt',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.0009463529,\n offset: 0\n },\n // 946.3529 mL\n gal: {\n name: 'gal',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.003785412,\n offset: 0\n },\n // 3.785412 L\n bbl: {\n name: 'bbl',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.1173478,\n offset: 0\n },\n // 117.3478 L\n obl: {\n name: 'obl',\n base: BASE_UNITS.VOLUME,\n prefixes: PREFIXES.NONE,\n value: 0.1589873,\n offset: 0\n },\n // 158.9873 L\n // {name: 'hogshead', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.2384810, offset: 0}, // 238.4810 L // TODO: hh?\n // Mass\n g: {\n name: 'g',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.SHORT,\n value: 0.001,\n offset: 0\n },\n gram: {\n name: 'gram',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.LONG,\n value: 0.001,\n offset: 0\n },\n ton: {\n name: 'ton',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.SHORT,\n value: 907.18474,\n offset: 0\n },\n t: {\n name: 't',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.SHORT,\n value: 1000,\n offset: 0\n },\n tonne: {\n name: 'tonne',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.LONG,\n value: 1000,\n offset: 0\n },\n grain: {\n name: 'grain',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.NONE,\n value: 64.79891e-6,\n offset: 0\n },\n dram: {\n name: 'dram',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.NONE,\n value: 1.7718451953125e-3,\n offset: 0\n },\n ounce: {\n name: 'ounce',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.NONE,\n value: 28.349523125e-3,\n offset: 0\n },\n poundmass: {\n name: 'poundmass',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.NONE,\n value: 453.59237e-3,\n offset: 0\n },\n hundredweight: {\n name: 'hundredweight',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.NONE,\n value: 45.359237,\n offset: 0\n },\n stick: {\n name: 'stick',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.NONE,\n value: 115e-3,\n offset: 0\n },\n stone: {\n name: 'stone',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.NONE,\n value: 6.35029318,\n offset: 0\n },\n gr: {\n name: 'gr',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.NONE,\n value: 64.79891e-6,\n offset: 0\n },\n dr: {\n name: 'dr',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.NONE,\n value: 1.7718451953125e-3,\n offset: 0\n },\n oz: {\n name: 'oz',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.NONE,\n value: 28.349523125e-3,\n offset: 0\n },\n lbm: {\n name: 'lbm',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.NONE,\n value: 453.59237e-3,\n offset: 0\n },\n cwt: {\n name: 'cwt',\n base: BASE_UNITS.MASS,\n prefixes: PREFIXES.NONE,\n value: 45.359237,\n offset: 0\n },\n // Time\n s: {\n name: 's',\n base: BASE_UNITS.TIME,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n min: {\n name: 'min',\n base: BASE_UNITS.TIME,\n prefixes: PREFIXES.NONE,\n value: 60,\n offset: 0\n },\n h: {\n name: 'h',\n base: BASE_UNITS.TIME,\n prefixes: PREFIXES.NONE,\n value: 3600,\n offset: 0\n },\n second: {\n name: 'second',\n base: BASE_UNITS.TIME,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0\n },\n sec: {\n name: 'sec',\n base: BASE_UNITS.TIME,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0\n },\n minute: {\n name: 'minute',\n base: BASE_UNITS.TIME,\n prefixes: PREFIXES.NONE,\n value: 60,\n offset: 0\n },\n hour: {\n name: 'hour',\n base: BASE_UNITS.TIME,\n prefixes: PREFIXES.NONE,\n value: 3600,\n offset: 0\n },\n day: {\n name: 'day',\n base: BASE_UNITS.TIME,\n prefixes: PREFIXES.NONE,\n value: 86400,\n offset: 0\n },\n week: {\n name: 'week',\n base: BASE_UNITS.TIME,\n prefixes: PREFIXES.NONE,\n value: 7 * 86400,\n offset: 0\n },\n month: {\n name: 'month',\n base: BASE_UNITS.TIME,\n prefixes: PREFIXES.NONE,\n value: 2629800,\n // 1/12th of Julian year\n offset: 0\n },\n year: {\n name: 'year',\n base: BASE_UNITS.TIME,\n prefixes: PREFIXES.NONE,\n value: 31557600,\n // Julian year\n offset: 0\n },\n decade: {\n name: 'decade',\n base: BASE_UNITS.TIME,\n prefixes: PREFIXES.NONE,\n value: 315576000,\n // Julian decade\n offset: 0\n },\n century: {\n name: 'century',\n base: BASE_UNITS.TIME,\n prefixes: PREFIXES.NONE,\n value: 3155760000,\n // Julian century\n offset: 0\n },\n millennium: {\n name: 'millennium',\n base: BASE_UNITS.TIME,\n prefixes: PREFIXES.NONE,\n value: 31557600000,\n // Julian millennium\n offset: 0\n },\n // Frequency\n hertz: {\n name: 'Hertz',\n base: BASE_UNITS.FREQUENCY,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0,\n reciprocal: true\n },\n Hz: {\n name: 'Hz',\n base: BASE_UNITS.FREQUENCY,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0,\n reciprocal: true\n },\n // Angle\n rad: {\n name: 'rad',\n base: BASE_UNITS.ANGLE,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n radian: {\n name: 'radian',\n base: BASE_UNITS.ANGLE,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0\n },\n // deg = rad / (2*pi) * 360 = rad / 0.017453292519943295769236907684888\n deg: {\n name: 'deg',\n base: BASE_UNITS.ANGLE,\n prefixes: PREFIXES.SHORT,\n value: null,\n // will be filled in by calculateAngleValues()\n offset: 0\n },\n degree: {\n name: 'degree',\n base: BASE_UNITS.ANGLE,\n prefixes: PREFIXES.LONG,\n value: null,\n // will be filled in by calculateAngleValues()\n offset: 0\n },\n // grad = rad / (2*pi) * 400 = rad / 0.015707963267948966192313216916399\n grad: {\n name: 'grad',\n base: BASE_UNITS.ANGLE,\n prefixes: PREFIXES.SHORT,\n value: null,\n // will be filled in by calculateAngleValues()\n offset: 0\n },\n gradian: {\n name: 'gradian',\n base: BASE_UNITS.ANGLE,\n prefixes: PREFIXES.LONG,\n value: null,\n // will be filled in by calculateAngleValues()\n offset: 0\n },\n // cycle = rad / (2*pi) = rad / 6.2831853071795864769252867665793\n cycle: {\n name: 'cycle',\n base: BASE_UNITS.ANGLE,\n prefixes: PREFIXES.NONE,\n value: null,\n // will be filled in by calculateAngleValues()\n offset: 0\n },\n // arcsec = rad / (3600 * (360 / 2 * pi)) = rad / 0.0000048481368110953599358991410235795\n arcsec: {\n name: 'arcsec',\n base: BASE_UNITS.ANGLE,\n prefixes: PREFIXES.NONE,\n value: null,\n // will be filled in by calculateAngleValues()\n offset: 0\n },\n // arcmin = rad / (60 * (360 / 2 * pi)) = rad / 0.00029088820866572159615394846141477\n arcmin: {\n name: 'arcmin',\n base: BASE_UNITS.ANGLE,\n prefixes: PREFIXES.NONE,\n value: null,\n // will be filled in by calculateAngleValues()\n offset: 0\n },\n // Electric current\n A: {\n name: 'A',\n base: BASE_UNITS.CURRENT,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n ampere: {\n name: 'ampere',\n base: BASE_UNITS.CURRENT,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0\n },\n // Temperature\n // K(C) = °C + 273.15\n // K(F) = (°F + 459.67) / 1.8\n // K(R) = °R / 1.8\n K: {\n name: 'K',\n base: BASE_UNITS.TEMPERATURE,\n prefixes: PREFIXES.NONE,\n value: 1,\n offset: 0\n },\n degC: {\n name: 'degC',\n base: BASE_UNITS.TEMPERATURE,\n prefixes: PREFIXES.NONE,\n value: 1,\n offset: 273.15\n },\n degF: {\n name: 'degF',\n base: BASE_UNITS.TEMPERATURE,\n prefixes: PREFIXES.NONE,\n value: 1 / 1.8,\n offset: 459.67\n },\n degR: {\n name: 'degR',\n base: BASE_UNITS.TEMPERATURE,\n prefixes: PREFIXES.NONE,\n value: 1 / 1.8,\n offset: 0\n },\n kelvin: {\n name: 'kelvin',\n base: BASE_UNITS.TEMPERATURE,\n prefixes: PREFIXES.NONE,\n value: 1,\n offset: 0\n },\n celsius: {\n name: 'celsius',\n base: BASE_UNITS.TEMPERATURE,\n prefixes: PREFIXES.NONE,\n value: 1,\n offset: 273.15\n },\n fahrenheit: {\n name: 'fahrenheit',\n base: BASE_UNITS.TEMPERATURE,\n prefixes: PREFIXES.NONE,\n value: 1 / 1.8,\n offset: 459.67\n },\n rankine: {\n name: 'rankine',\n base: BASE_UNITS.TEMPERATURE,\n prefixes: PREFIXES.NONE,\n value: 1 / 1.8,\n offset: 0\n },\n // amount of substance\n mol: {\n name: 'mol',\n base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n mole: {\n name: 'mole',\n base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0\n },\n // luminous intensity\n cd: {\n name: 'cd',\n base: BASE_UNITS.LUMINOUS_INTENSITY,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n candela: {\n name: 'candela',\n base: BASE_UNITS.LUMINOUS_INTENSITY,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0\n },\n // TODO: units STERADIAN\n // {name: 'sr', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},\n // {name: 'steradian', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},\n // Force\n N: {\n name: 'N',\n base: BASE_UNITS.FORCE,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n newton: {\n name: 'newton',\n base: BASE_UNITS.FORCE,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0\n },\n dyn: {\n name: 'dyn',\n base: BASE_UNITS.FORCE,\n prefixes: PREFIXES.SHORT,\n value: 0.00001,\n offset: 0\n },\n dyne: {\n name: 'dyne',\n base: BASE_UNITS.FORCE,\n prefixes: PREFIXES.LONG,\n value: 0.00001,\n offset: 0\n },\n lbf: {\n name: 'lbf',\n base: BASE_UNITS.FORCE,\n prefixes: PREFIXES.NONE,\n value: 4.4482216152605,\n offset: 0\n },\n poundforce: {\n name: 'poundforce',\n base: BASE_UNITS.FORCE,\n prefixes: PREFIXES.NONE,\n value: 4.4482216152605,\n offset: 0\n },\n kip: {\n name: 'kip',\n base: BASE_UNITS.FORCE,\n prefixes: PREFIXES.LONG,\n value: 4448.2216,\n offset: 0\n },\n kilogramforce: {\n name: 'kilogramforce',\n base: BASE_UNITS.FORCE,\n prefixes: PREFIXES.NONE,\n value: 9.80665,\n offset: 0\n },\n // Energy\n J: {\n name: 'J',\n base: BASE_UNITS.ENERGY,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n joule: {\n name: 'joule',\n base: BASE_UNITS.ENERGY,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n erg: {\n name: 'erg',\n base: BASE_UNITS.ENERGY,\n prefixes: PREFIXES.NONE,\n value: 1e-7,\n offset: 0\n },\n Wh: {\n name: 'Wh',\n base: BASE_UNITS.ENERGY,\n prefixes: PREFIXES.SHORT,\n value: 3600,\n offset: 0\n },\n BTU: {\n name: 'BTU',\n base: BASE_UNITS.ENERGY,\n prefixes: PREFIXES.BTU,\n value: 1055.05585262,\n offset: 0\n },\n eV: {\n name: 'eV',\n base: BASE_UNITS.ENERGY,\n prefixes: PREFIXES.SHORT,\n value: 1.602176565e-19,\n offset: 0\n },\n electronvolt: {\n name: 'electronvolt',\n base: BASE_UNITS.ENERGY,\n prefixes: PREFIXES.LONG,\n value: 1.602176565e-19,\n offset: 0\n },\n // Power\n W: {\n name: 'W',\n base: BASE_UNITS.POWER,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n watt: {\n name: 'watt',\n base: BASE_UNITS.POWER,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0\n },\n hp: {\n name: 'hp',\n base: BASE_UNITS.POWER,\n prefixes: PREFIXES.NONE,\n value: 745.6998715386,\n offset: 0\n },\n // Electrical power units\n VAR: {\n name: 'VAR',\n base: BASE_UNITS.POWER,\n prefixes: PREFIXES.SHORT,\n value: Complex.I,\n offset: 0\n },\n VA: {\n name: 'VA',\n base: BASE_UNITS.POWER,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n // Pressure\n Pa: {\n name: 'Pa',\n base: BASE_UNITS.PRESSURE,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n psi: {\n name: 'psi',\n base: BASE_UNITS.PRESSURE,\n prefixes: PREFIXES.NONE,\n value: 6894.75729276459,\n offset: 0\n },\n atm: {\n name: 'atm',\n base: BASE_UNITS.PRESSURE,\n prefixes: PREFIXES.NONE,\n value: 101325,\n offset: 0\n },\n bar: {\n name: 'bar',\n base: BASE_UNITS.PRESSURE,\n prefixes: PREFIXES.SHORTLONG,\n value: 100000,\n offset: 0\n },\n torr: {\n name: 'torr',\n base: BASE_UNITS.PRESSURE,\n prefixes: PREFIXES.NONE,\n value: 133.322,\n offset: 0\n },\n mmHg: {\n name: 'mmHg',\n base: BASE_UNITS.PRESSURE,\n prefixes: PREFIXES.NONE,\n value: 133.322,\n offset: 0\n },\n mmH2O: {\n name: 'mmH2O',\n base: BASE_UNITS.PRESSURE,\n prefixes: PREFIXES.NONE,\n value: 9.80665,\n offset: 0\n },\n cmH2O: {\n name: 'cmH2O',\n base: BASE_UNITS.PRESSURE,\n prefixes: PREFIXES.NONE,\n value: 98.0665,\n offset: 0\n },\n // Electric charge\n coulomb: {\n name: 'coulomb',\n base: BASE_UNITS.ELECTRIC_CHARGE,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0\n },\n C: {\n name: 'C',\n base: BASE_UNITS.ELECTRIC_CHARGE,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n // Electric capacitance\n farad: {\n name: 'farad',\n base: BASE_UNITS.ELECTRIC_CAPACITANCE,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0\n },\n F: {\n name: 'F',\n base: BASE_UNITS.ELECTRIC_CAPACITANCE,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n // Electric potential\n volt: {\n name: 'volt',\n base: BASE_UNITS.ELECTRIC_POTENTIAL,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0\n },\n V: {\n name: 'V',\n base: BASE_UNITS.ELECTRIC_POTENTIAL,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n // Electric resistance\n ohm: {\n name: 'ohm',\n base: BASE_UNITS.ELECTRIC_RESISTANCE,\n prefixes: PREFIXES.SHORTLONG,\n // Both Mohm and megaohm are acceptable\n value: 1,\n offset: 0\n },\n\n /*\n * Unicode breaks in browsers if charset is not specified\n Ω: {\n name: 'Ω',\n base: BASE_UNITS.ELECTRIC_RESISTANCE,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n */\n // Electric inductance\n henry: {\n name: 'henry',\n base: BASE_UNITS.ELECTRIC_INDUCTANCE,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0\n },\n H: {\n name: 'H',\n base: BASE_UNITS.ELECTRIC_INDUCTANCE,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n // Electric conductance\n siemens: {\n name: 'siemens',\n base: BASE_UNITS.ELECTRIC_CONDUCTANCE,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0\n },\n S: {\n name: 'S',\n base: BASE_UNITS.ELECTRIC_CONDUCTANCE,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n // Magnetic flux\n weber: {\n name: 'weber',\n base: BASE_UNITS.MAGNETIC_FLUX,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0\n },\n Wb: {\n name: 'Wb',\n base: BASE_UNITS.MAGNETIC_FLUX,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n // Magnetic flux density\n tesla: {\n name: 'tesla',\n base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,\n prefixes: PREFIXES.LONG,\n value: 1,\n offset: 0\n },\n T: {\n name: 'T',\n base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,\n prefixes: PREFIXES.SHORT,\n value: 1,\n offset: 0\n },\n // Binary\n b: {\n name: 'b',\n base: BASE_UNITS.BIT,\n prefixes: PREFIXES.BINARY_SHORT,\n value: 1,\n offset: 0\n },\n bits: {\n name: 'bits',\n base: BASE_UNITS.BIT,\n prefixes: PREFIXES.BINARY_LONG,\n value: 1,\n offset: 0\n },\n B: {\n name: 'B',\n base: BASE_UNITS.BIT,\n prefixes: PREFIXES.BINARY_SHORT,\n value: 8,\n offset: 0\n },\n bytes: {\n name: 'bytes',\n base: BASE_UNITS.BIT,\n prefixes: PREFIXES.BINARY_LONG,\n value: 8,\n offset: 0\n }\n }; // aliases (formerly plurals)\n\n var ALIASES = {\n meters: 'meter',\n inches: 'inch',\n feet: 'foot',\n yards: 'yard',\n miles: 'mile',\n links: 'link',\n rods: 'rod',\n chains: 'chain',\n angstroms: 'angstrom',\n lt: 'l',\n litres: 'litre',\n liter: 'litre',\n liters: 'litre',\n teaspoons: 'teaspoon',\n tablespoons: 'tablespoon',\n minims: 'minim',\n fluiddrams: 'fluiddram',\n fluidounces: 'fluidounce',\n gills: 'gill',\n cups: 'cup',\n pints: 'pint',\n quarts: 'quart',\n gallons: 'gallon',\n beerbarrels: 'beerbarrel',\n oilbarrels: 'oilbarrel',\n hogsheads: 'hogshead',\n gtts: 'gtt',\n grams: 'gram',\n tons: 'ton',\n tonnes: 'tonne',\n grains: 'grain',\n drams: 'dram',\n ounces: 'ounce',\n poundmasses: 'poundmass',\n hundredweights: 'hundredweight',\n sticks: 'stick',\n lb: 'lbm',\n lbs: 'lbm',\n kips: 'kip',\n kgf: 'kilogramforce',\n acres: 'acre',\n hectares: 'hectare',\n sqfeet: 'sqft',\n sqyard: 'sqyd',\n sqmile: 'sqmi',\n sqmiles: 'sqmi',\n mmhg: 'mmHg',\n mmh2o: 'mmH2O',\n cmh2o: 'cmH2O',\n seconds: 'second',\n secs: 'second',\n minutes: 'minute',\n mins: 'minute',\n hours: 'hour',\n hr: 'hour',\n hrs: 'hour',\n days: 'day',\n weeks: 'week',\n months: 'month',\n years: 'year',\n decades: 'decade',\n centuries: 'century',\n millennia: 'millennium',\n hertz: 'hertz',\n radians: 'radian',\n degrees: 'degree',\n gradians: 'gradian',\n cycles: 'cycle',\n arcsecond: 'arcsec',\n arcseconds: 'arcsec',\n arcminute: 'arcmin',\n arcminutes: 'arcmin',\n BTUs: 'BTU',\n watts: 'watt',\n joules: 'joule',\n amperes: 'ampere',\n coulombs: 'coulomb',\n volts: 'volt',\n ohms: 'ohm',\n farads: 'farad',\n webers: 'weber',\n teslas: 'tesla',\n electronvolts: 'electronvolt',\n moles: 'mole',\n bit: 'bits',\n byte: 'bytes'\n };\n /**\n * Calculate the values for the angle units.\n * Value is calculated as number or BigNumber depending on the configuration\n * @param {{number: 'number' | 'BigNumber'}} config\n */\n\n function calculateAngleValues(config) {\n if (config.number === 'BigNumber') {\n var pi = createPi(_BigNumber);\n UNITS.rad.value = new _BigNumber(1);\n UNITS.deg.value = pi.div(180); // 2 * pi / 360\n\n UNITS.grad.value = pi.div(200); // 2 * pi / 400\n\n UNITS.cycle.value = pi.times(2); // 2 * pi\n\n UNITS.arcsec.value = pi.div(648000); // 2 * pi / 360 / 3600\n\n UNITS.arcmin.value = pi.div(10800); // 2 * pi / 360 / 60\n } else {\n // number\n UNITS.rad.value = 1;\n UNITS.deg.value = Math.PI / 180; // 2 * pi / 360\n\n UNITS.grad.value = Math.PI / 200; // 2 * pi / 400\n\n UNITS.cycle.value = Math.PI * 2; // 2 * pi\n\n UNITS.arcsec.value = Math.PI / 648000; // 2 * pi / 360 / 3600\n\n UNITS.arcmin.value = Math.PI / 10800; // 2 * pi / 360 / 60\n } // copy to the full names of the angles\n\n\n UNITS.radian.value = UNITS.rad.value;\n UNITS.degree.value = UNITS.deg.value;\n UNITS.gradian.value = UNITS.grad.value;\n } // apply the angle values now\n\n\n calculateAngleValues(config);\n\n if (on) {\n // recalculate the values on change of configuration\n on('config', function (curr, prev) {\n if (curr.number !== prev.number) {\n calculateAngleValues(curr);\n }\n });\n }\n /**\n * A unit system is a set of dimensionally independent base units plus a set of derived units, formed by multiplication and division of the base units, that are by convention used with the unit system.\n * A user perhaps could issue a command to select a preferred unit system, or use the default (see below).\n * Auto unit system: The default unit system is updated on the fly anytime a unit is parsed. The corresponding unit in the default unit system is updated, so that answers are given in the same units the user supplies.\n */\n\n\n var UNIT_SYSTEMS = {\n si: {\n // Base units\n NONE: {\n unit: UNIT_NONE,\n prefix: PREFIXES.NONE['']\n },\n LENGTH: {\n unit: UNITS.m,\n prefix: PREFIXES.SHORT['']\n },\n MASS: {\n unit: UNITS.g,\n prefix: PREFIXES.SHORT.k\n },\n TIME: {\n unit: UNITS.s,\n prefix: PREFIXES.SHORT['']\n },\n CURRENT: {\n unit: UNITS.A,\n prefix: PREFIXES.SHORT['']\n },\n TEMPERATURE: {\n unit: UNITS.K,\n prefix: PREFIXES.SHORT['']\n },\n LUMINOUS_INTENSITY: {\n unit: UNITS.cd,\n prefix: PREFIXES.SHORT['']\n },\n AMOUNT_OF_SUBSTANCE: {\n unit: UNITS.mol,\n prefix: PREFIXES.SHORT['']\n },\n ANGLE: {\n unit: UNITS.rad,\n prefix: PREFIXES.SHORT['']\n },\n BIT: {\n unit: UNITS.bits,\n prefix: PREFIXES.SHORT['']\n },\n // Derived units\n FORCE: {\n unit: UNITS.N,\n prefix: PREFIXES.SHORT['']\n },\n ENERGY: {\n unit: UNITS.J,\n prefix: PREFIXES.SHORT['']\n },\n POWER: {\n unit: UNITS.W,\n prefix: PREFIXES.SHORT['']\n },\n PRESSURE: {\n unit: UNITS.Pa,\n prefix: PREFIXES.SHORT['']\n },\n ELECTRIC_CHARGE: {\n unit: UNITS.C,\n prefix: PREFIXES.SHORT['']\n },\n ELECTRIC_CAPACITANCE: {\n unit: UNITS.F,\n prefix: PREFIXES.SHORT['']\n },\n ELECTRIC_POTENTIAL: {\n unit: UNITS.V,\n prefix: PREFIXES.SHORT['']\n },\n ELECTRIC_RESISTANCE: {\n unit: UNITS.ohm,\n prefix: PREFIXES.SHORT['']\n },\n ELECTRIC_INDUCTANCE: {\n unit: UNITS.H,\n prefix: PREFIXES.SHORT['']\n },\n ELECTRIC_CONDUCTANCE: {\n unit: UNITS.S,\n prefix: PREFIXES.SHORT['']\n },\n MAGNETIC_FLUX: {\n unit: UNITS.Wb,\n prefix: PREFIXES.SHORT['']\n },\n MAGNETIC_FLUX_DENSITY: {\n unit: UNITS.T,\n prefix: PREFIXES.SHORT['']\n },\n FREQUENCY: {\n unit: UNITS.Hz,\n prefix: PREFIXES.SHORT['']\n }\n }\n }; // Clone to create the other unit systems\n\n UNIT_SYSTEMS.cgs = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));\n UNIT_SYSTEMS.cgs.LENGTH = {\n unit: UNITS.m,\n prefix: PREFIXES.SHORT.c\n };\n UNIT_SYSTEMS.cgs.MASS = {\n unit: UNITS.g,\n prefix: PREFIXES.SHORT['']\n };\n UNIT_SYSTEMS.cgs.FORCE = {\n unit: UNITS.dyn,\n prefix: PREFIXES.SHORT['']\n };\n UNIT_SYSTEMS.cgs.ENERGY = {\n unit: UNITS.erg,\n prefix: PREFIXES.NONE['']\n }; // there are wholly 4 unique cgs systems for electricity and magnetism,\n // so let's not worry about it unless somebody complains\n\n UNIT_SYSTEMS.us = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));\n UNIT_SYSTEMS.us.LENGTH = {\n unit: UNITS.ft,\n prefix: PREFIXES.NONE['']\n };\n UNIT_SYSTEMS.us.MASS = {\n unit: UNITS.lbm,\n prefix: PREFIXES.NONE['']\n };\n UNIT_SYSTEMS.us.TEMPERATURE = {\n unit: UNITS.degF,\n prefix: PREFIXES.NONE['']\n };\n UNIT_SYSTEMS.us.FORCE = {\n unit: UNITS.lbf,\n prefix: PREFIXES.NONE['']\n };\n UNIT_SYSTEMS.us.ENERGY = {\n unit: UNITS.BTU,\n prefix: PREFIXES.BTU['']\n };\n UNIT_SYSTEMS.us.POWER = {\n unit: UNITS.hp,\n prefix: PREFIXES.NONE['']\n };\n UNIT_SYSTEMS.us.PRESSURE = {\n unit: UNITS.psi,\n prefix: PREFIXES.NONE['']\n }; // Add additional unit systems here.\n // Choose a unit system to seed the auto unit system.\n\n UNIT_SYSTEMS.auto = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si)); // Set the current unit system\n\n var currentUnitSystem = UNIT_SYSTEMS.auto;\n /**\n * Set a unit system for formatting derived units.\n * @param {string} [name] The name of the unit system.\n */\n\n Unit.setUnitSystem = function (name) {\n if (hasOwnProperty(UNIT_SYSTEMS, name)) {\n currentUnitSystem = UNIT_SYSTEMS[name];\n } else {\n throw new Error('Unit system ' + name + ' does not exist. Choices are: ' + Object.keys(UNIT_SYSTEMS).join(', '));\n }\n };\n /**\n * Return the current unit system.\n * @return {string} The current unit system.\n */\n\n\n Unit.getUnitSystem = function () {\n for (var _key in UNIT_SYSTEMS) {\n if (hasOwnProperty(UNIT_SYSTEMS, _key)) {\n if (UNIT_SYSTEMS[_key] === currentUnitSystem) {\n return _key;\n }\n }\n }\n };\n /**\n * Converters to convert from number to an other numeric type like BigNumber\n * or Fraction\n */\n\n\n Unit.typeConverters = {\n BigNumber: function BigNumber(x) {\n return new _BigNumber(x + ''); // stringify to prevent constructor error\n },\n Fraction: function Fraction(x) {\n return new _Fraction(x);\n },\n Complex: function Complex(x) {\n return x;\n },\n number: function number(x) {\n return x;\n }\n };\n /**\n * Retrieve the right convertor function corresponding with the type\n * of provided exampleValue.\n *\n * @param {string} type A string 'number', 'BigNumber', or 'Fraction'\n * In case of an unknown type,\n * @return {Function}\n */\n\n Unit._getNumberConverter = function (type) {\n if (!Unit.typeConverters[type]) {\n throw new TypeError('Unsupported type \"' + type + '\"');\n }\n\n return Unit.typeConverters[type];\n }; // Add dimensions to each built-in unit\n\n\n for (var _key2 in UNITS) {\n if (hasOwnProperty(UNITS, _key2)) {\n var unit = UNITS[_key2];\n unit.dimensions = unit.base.dimensions;\n }\n } // Create aliases\n\n\n for (var _name2 in ALIASES) {\n if (hasOwnProperty(ALIASES, _name2)) {\n var _unit2 = UNITS[ALIASES[_name2]];\n var alias = {};\n\n for (var _key3 in _unit2) {\n if (hasOwnProperty(_unit2, _key3)) {\n alias[_key3] = _unit2[_key3];\n }\n }\n\n alias.name = _name2;\n UNITS[_name2] = alias;\n }\n }\n /**\n * Checks if a character is a valid latin letter (upper or lower case).\n * Note that this function can be overridden, for example to allow support of other alphabets.\n * @param {string} c Tested character\n */\n\n\n Unit.isValidAlpha = function isValidAlpha(c) {\n return /^[a-zA-Z]$/.test(c);\n };\n\n function assertUnitNameIsValid(name) {\n for (var i = 0; i < name.length; i++) {\n c = name.charAt(i);\n\n if (i === 0 && !Unit.isValidAlpha(c)) {\n throw new Error('Invalid unit name (must begin with alpha character): \"' + name + '\"');\n }\n\n if (i > 0 && !(Unit.isValidAlpha(c) || isDigit(c))) {\n throw new Error('Invalid unit name (only alphanumeric characters are allowed): \"' + name + '\"');\n }\n }\n }\n /**\n * Wrapper around createUnitSingle.\n * Example:\n * createUnit({\n * foo: { },\n * bar: {\n * definition: 'kg/foo',\n * aliases: ['ba', 'barr', 'bars'],\n * offset: 200\n * },\n * baz: '4 bar'\n * },\n * {\n * override: true\n * })\n * @param {object} obj Object map. Each key becomes a unit which is defined by its value.\n * @param {object} options\n */\n\n\n Unit.createUnit = function (obj, options) {\n if (typeof obj !== 'object') {\n throw new TypeError(\"createUnit expects first parameter to be of type 'Object'\");\n } // Remove all units and aliases we are overriding\n\n\n if (options && options.override) {\n for (var _key4 in obj) {\n if (hasOwnProperty(obj, _key4)) {\n Unit.deleteUnit(_key4);\n }\n\n if (obj[_key4].aliases) {\n for (var i = 0; i < obj[_key4].aliases.length; i++) {\n Unit.deleteUnit(obj[_key4].aliases[i]);\n }\n }\n }\n } // TODO: traverse multiple times until all units have been added\n\n\n var lastUnit;\n\n for (var _key5 in obj) {\n if (hasOwnProperty(obj, _key5)) {\n lastUnit = Unit.createUnitSingle(_key5, obj[_key5]);\n }\n }\n\n return lastUnit;\n };\n /**\n * Create a user-defined unit and register it with the Unit type.\n * Example:\n * createUnitSingle('knot', '0.514444444 m/s')\n * createUnitSingle('acre', new Unit(43560, 'ft^2'))\n *\n * @param {string} name The name of the new unit. Must be unique. Example: 'knot'\n * @param {string, Unit, Object} definition Definition of the unit in terms\n * of existing units. For example, '0.514444444 m / s'. Can be a Unit, a string,\n * or an Object. If an Object, may have the following properties:\n * - definition {string|Unit} The definition of this unit.\n * - prefixes {string} \"none\", \"short\", \"long\", \"binary_short\", or \"binary_long\".\n * The default is \"none\".\n * - aliases {Array} Array of strings. Example: ['knots', 'kt', 'kts']\n * - offset {Numeric} An offset to apply when converting from the unit. For\n * example, the offset for celsius is 273.15 and the offset for farhenheit\n * is 459.67. Default is 0.\n * - baseName {string} If the unit's dimension does not match that of any other\n * base unit, the name of the newly create base unit. Otherwise, this property\n * has no effect.\n *\n * @param {Object} options (optional) An object containing any of the following\n * properties:\n * - override {boolean} Whether this unit should be allowed to override existing\n * units.\n *\n * @return {Unit}\n */\n\n\n Unit.createUnitSingle = function (name, obj, options) {\n if (typeof obj === 'undefined' || obj === null) {\n obj = {};\n }\n\n if (typeof name !== 'string') {\n throw new TypeError(\"createUnitSingle expects first parameter to be of type 'string'\");\n } // Check collisions with existing units\n\n\n if (hasOwnProperty(UNITS, name)) {\n throw new Error('Cannot create unit \"' + name + '\": a unit with that name already exists');\n } // TODO: Validate name for collisions with other built-in functions (like abs or cos, for example), and for acceptable variable names. For example, '42' is probably not a valid unit. Nor is '%', since it is also an operator.\n\n\n assertUnitNameIsValid(name);\n var defUnit = null; // The Unit from which the new unit will be created.\n\n var aliases = [];\n var offset = 0;\n var definition;\n var prefixes;\n var baseName;\n\n if (obj && obj.type === 'Unit') {\n defUnit = obj.clone();\n } else if (typeof obj === 'string') {\n if (obj !== '') {\n definition = obj;\n }\n } else if (typeof obj === 'object') {\n definition = obj.definition;\n prefixes = obj.prefixes;\n offset = obj.offset;\n baseName = obj.baseName;\n\n if (obj.aliases) {\n aliases = obj.aliases.valueOf(); // aliases could be a Matrix, so convert to Array\n }\n } else {\n throw new TypeError('Cannot create unit \"' + name + '\" from \"' + obj.toString() + '\": expecting \"string\" or \"Unit\" or \"Object\"');\n }\n\n if (aliases) {\n for (var i = 0; i < aliases.length; i++) {\n if (hasOwnProperty(UNITS, aliases[i])) {\n throw new Error('Cannot create alias \"' + aliases[i] + '\": a unit with that name already exists');\n }\n }\n }\n\n if (definition && typeof definition === 'string' && !defUnit) {\n try {\n defUnit = Unit.parse(definition, {\n allowNoUnits: true\n });\n } catch (ex) {\n ex.message = 'Could not create unit \"' + name + '\" from \"' + definition + '\": ' + ex.message;\n throw ex;\n }\n } else if (definition && definition.type === 'Unit') {\n defUnit = definition.clone();\n }\n\n aliases = aliases || [];\n offset = offset || 0;\n\n if (prefixes && prefixes.toUpperCase) {\n prefixes = PREFIXES[prefixes.toUpperCase()] || PREFIXES.NONE;\n } else {\n prefixes = PREFIXES.NONE;\n } // If defUnit is null, it is because the user did not\n // specify a defintion. So create a new base dimension.\n\n\n var newUnit = {};\n\n if (!defUnit) {\n // Add a new base dimension\n baseName = baseName || name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo\n\n if (BASE_DIMENSIONS.indexOf(baseName) >= 0) {\n throw new Error('Cannot create new base unit \"' + name + '\": a base unit with that name already exists (and cannot be overridden)');\n }\n\n BASE_DIMENSIONS.push(baseName); // Push 0 onto existing base units\n\n for (var b in BASE_UNITS) {\n if (hasOwnProperty(BASE_UNITS, b)) {\n BASE_UNITS[b].dimensions[BASE_DIMENSIONS.length - 1] = 0;\n }\n } // Add the new base unit\n\n\n var newBaseUnit = {\n dimensions: []\n };\n\n for (var _i6 = 0; _i6 < BASE_DIMENSIONS.length; _i6++) {\n newBaseUnit.dimensions[_i6] = 0;\n }\n\n newBaseUnit.dimensions[BASE_DIMENSIONS.length - 1] = 1;\n newBaseUnit.key = baseName;\n BASE_UNITS[baseName] = newBaseUnit;\n newUnit = {\n name: name,\n value: 1,\n dimensions: BASE_UNITS[baseName].dimensions.slice(0),\n prefixes: prefixes,\n offset: offset,\n base: BASE_UNITS[baseName]\n };\n currentUnitSystem[baseName] = {\n unit: newUnit,\n prefix: PREFIXES.NONE['']\n };\n } else {\n newUnit = {\n name: name,\n value: defUnit.value,\n dimensions: defUnit.dimensions.slice(0),\n prefixes: prefixes,\n offset: offset\n }; // Create a new base if no matching base exists\n\n var anyMatch = false;\n\n for (var _i7 in BASE_UNITS) {\n if (hasOwnProperty(BASE_UNITS, _i7)) {\n var match = true;\n\n for (var j = 0; j < BASE_DIMENSIONS.length; j++) {\n if (Math.abs((newUnit.dimensions[j] || 0) - (BASE_UNITS[_i7].dimensions[j] || 0)) > 1e-12) {\n match = false;\n break;\n }\n }\n\n if (match) {\n anyMatch = true;\n newUnit.base = BASE_UNITS[_i7];\n break;\n }\n }\n }\n\n if (!anyMatch) {\n baseName = baseName || name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo\n // Add the new base unit\n\n var _newBaseUnit = {\n dimensions: defUnit.dimensions.slice(0)\n };\n _newBaseUnit.key = baseName;\n BASE_UNITS[baseName] = _newBaseUnit;\n currentUnitSystem[baseName] = {\n unit: newUnit,\n prefix: PREFIXES.NONE['']\n };\n newUnit.base = BASE_UNITS[baseName];\n }\n }\n\n Unit.UNITS[name] = newUnit;\n\n for (var _i8 = 0; _i8 < aliases.length; _i8++) {\n var aliasName = aliases[_i8];\n var _alias = {};\n\n for (var _key6 in newUnit) {\n if (hasOwnProperty(newUnit, _key6)) {\n _alias[_key6] = newUnit[_key6];\n }\n }\n\n _alias.name = aliasName;\n Unit.UNITS[aliasName] = _alias;\n } // delete the memoization cache, since adding a new unit to the array\n // invalidates all old results\n\n\n delete _findUnit.cache;\n return new Unit(null, name);\n };\n\n Unit.deleteUnit = function (name) {\n delete Unit.UNITS[name];\n }; // expose arrays with prefixes, dimensions, units, systems\n\n\n Unit.PREFIXES = PREFIXES;\n Unit.BASE_DIMENSIONS = BASE_DIMENSIONS;\n Unit.BASE_UNITS = BASE_UNITS;\n Unit.UNIT_SYSTEMS = UNIT_SYSTEMS;\n Unit.UNITS = UNITS;\n return Unit;\n}, {\n isClass: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';\nimport { ComplexDependencies } from './dependenciesComplexClass.generated.js';\nimport { FractionDependencies } from './dependenciesFractionClass.generated.js';\nimport { absDependencies } from './dependenciesAbs.generated.js';\nimport { addScalarDependencies } from './dependenciesAddScalar.generated.js';\nimport { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';\nimport { equalDependencies } from './dependenciesEqual.generated.js';\nimport { fixDependencies } from './dependenciesFix.generated.js';\nimport { formatDependencies } from './dependenciesFormat.generated.js';\nimport { isNumericDependencies } from './dependenciesIsNumeric.generated.js';\nimport { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';\nimport { numberDependencies } from './dependenciesNumber.generated.js';\nimport { powDependencies } from './dependenciesPow.generated.js';\nimport { roundDependencies } from './dependenciesRound.generated.js';\nimport { subtractDependencies } from './dependenciesSubtract.generated.js';\nimport { createUnitClass } from '../../factoriesAny.js';\nexport var UnitDependencies = {\n BigNumberDependencies,\n ComplexDependencies,\n FractionDependencies,\n absDependencies,\n addScalarDependencies,\n divideScalarDependencies,\n equalDependencies,\n fixDependencies,\n formatDependencies,\n isNumericDependencies,\n multiplyScalarDependencies,\n numberDependencies,\n powDependencies,\n roundDependencies,\n subtractDependencies,\n createUnitClass\n};","import { escape } from '../../utils/string.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { toSymbol } from '../../utils/latex.js';\nvar name = 'SymbolNode';\nvar dependencies = ['math', '?Unit', 'Node'];\nexport var createSymbolNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n math,\n Unit,\n Node\n } = _ref;\n\n /**\n * Check whether some name is a valueless unit like \"inch\".\n * @param {string} name\n * @return {boolean}\n */\n function isValuelessUnit(name) {\n return Unit ? Unit.isValuelessUnit(name) : false;\n }\n /**\n * @constructor SymbolNode\n * @extends {Node}\n * A symbol node can hold and resolve a symbol\n * @param {string} name\n * @extends {Node}\n */\n\n\n function SymbolNode(name) {\n if (!(this instanceof SymbolNode)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n } // validate input\n\n\n if (typeof name !== 'string') throw new TypeError('String expected for parameter \"name\"');\n this.name = name;\n }\n\n SymbolNode.prototype = new Node();\n SymbolNode.prototype.type = 'SymbolNode';\n SymbolNode.prototype.isSymbolNode = true;\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n\n SymbolNode.prototype._compile = function (math, argNames) {\n var name = this.name;\n\n if (argNames[name] === true) {\n // this is a FunctionAssignment argument\n // (like an x when inside the expression of a function assignment `f(x) = ...`)\n return function (scope, args, context) {\n return args[name];\n };\n } else if (name in math) {\n return function (scope, args, context) {\n return scope.has(name) ? scope.get(name) : getSafeProperty(math, name);\n };\n } else {\n var isUnit = isValuelessUnit(name);\n return function (scope, args, context) {\n return scope.has(name) ? scope.get(name) : isUnit ? new Unit(null, name) : SymbolNode.onUndefinedSymbol(name);\n };\n }\n };\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n\n\n SymbolNode.prototype.forEach = function (callback) {// nothing to do, we don't have childs\n };\n /**\n * Create a new SymbolNode having it's childs be the results of calling\n * the provided callback function for each of the childs of the original node.\n * @param {function(child: Node, path: string, parent: Node) : Node} callback\n * @returns {SymbolNode} Returns a clone of the node\n */\n\n\n SymbolNode.prototype.map = function (callback) {\n return this.clone();\n };\n /**\n * Throws an error 'Undefined symbol {name}'\n * @param {string} name\n */\n\n\n SymbolNode.onUndefinedSymbol = function (name) {\n throw new Error('Undefined symbol ' + name);\n };\n /**\n * Create a clone of this node, a shallow copy\n * @return {SymbolNode}\n */\n\n\n SymbolNode.prototype.clone = function () {\n return new SymbolNode(this.name);\n };\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n\n\n SymbolNode.prototype._toString = function (options) {\n return this.name;\n };\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n\n\n SymbolNode.prototype.toHTML = function (options) {\n var name = escape(this.name);\n\n if (name === 'true' || name === 'false') {\n return '' + name + '';\n } else if (name === 'i') {\n return '' + name + '';\n } else if (name === 'Infinity') {\n return '' + name + '';\n } else if (name === 'NaN') {\n return '' + name + '';\n } else if (name === 'null') {\n return '' + name + '';\n } else if (name === 'undefined') {\n return '' + name + '';\n }\n\n return '' + name + '';\n };\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n\n\n SymbolNode.prototype.toJSON = function () {\n return {\n mathjs: 'SymbolNode',\n name: this.name\n };\n };\n /**\n * Instantiate a SymbolNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"SymbolNode\", name: \"x\"}`,\n * where mathjs is optional\n * @returns {SymbolNode}\n */\n\n\n SymbolNode.fromJSON = function (json) {\n return new SymbolNode(json.name);\n };\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n\n\n SymbolNode.prototype._toTex = function (options) {\n var isUnit = false;\n\n if (typeof math[this.name] === 'undefined' && isValuelessUnit(this.name)) {\n isUnit = true;\n }\n\n var symbol = toSymbol(this.name, isUnit);\n\n if (symbol[0] === '\\\\') {\n // no space needed if the symbol starts with '\\'\n return symbol;\n } // the space prevents symbols from breaking stuff like '\\cdot' if it's written right before the symbol\n\n\n return ' ' + symbol;\n };\n\n return SymbolNode;\n}, {\n isClass: true,\n isNode: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { UnitDependencies } from './dependenciesUnitClass.generated.js';\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createSymbolNode } from '../../factoriesAny.js';\nexport var SymbolNodeDependencies = {\n UnitDependencies,\n NodeDependencies,\n createSymbolNode\n};","import { createEmptyMap, assign } from './map.js';\n/**\n * Create a new scope which can access the parent scope,\n * but does not affect it when written. This is suitable for variable definitions\n * within a block node, or function definition.\n *\n * If parent scope has a createSubScope method, it delegates to that. Otherwise,\n * creates an empty map, and copies the parent scope to it, adding in\n * the remaining `args`.\n *\n * @param {Map} parentScope\n * @param {...any} args\n * @returns {Map}\n */\n\nexport function createSubScope(parentScope) {\n for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n args[_key - 1] = arguments[_key];\n }\n\n if (typeof parentScope.createSubScope === 'function') {\n return assign(parentScope.createSubScope(), ...args);\n }\n\n return assign(createEmptyMap(), parentScope, ...args);\n}","import { isAccessorNode, isFunctionAssignmentNode, isIndexNode, isNode, isSymbolNode } from '../../utils/is.js';\nimport { escape } from '../../utils/string.js';\nimport { hasOwnProperty } from '../../utils/object.js';\nimport { getSafeProperty, validateSafeMethod } from '../../utils/customs.js';\nimport { createSubScope } from '../../utils/scope.js';\nimport { factory } from '../../utils/factory.js';\nimport { defaultTemplate, latexFunctions } from '../../utils/latex.js';\nvar name = 'FunctionNode';\nvar dependencies = ['math', 'Node', 'SymbolNode'];\nexport var createFunctionNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n math,\n Node,\n SymbolNode\n } = _ref;\n\n /**\n * @constructor FunctionNode\n * @extends {./Node}\n * invoke a list with arguments on a node\n * @param {./Node | string} fn Node resolving with a function on which to invoke\n * the arguments, typically a SymboNode or AccessorNode\n * @param {./Node[]} args\n */\n function FunctionNode(fn, args) {\n if (!(this instanceof FunctionNode)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n\n if (typeof fn === 'string') {\n fn = new SymbolNode(fn);\n } // validate input\n\n\n if (!isNode(fn)) throw new TypeError('Node expected as parameter \"fn\"');\n\n if (!Array.isArray(args) || !args.every(isNode)) {\n throw new TypeError('Array containing Nodes expected for parameter \"args\"');\n }\n\n this.fn = fn;\n this.args = args || []; // readonly property name\n\n Object.defineProperty(this, 'name', {\n get: function () {\n return this.fn.name || '';\n }.bind(this),\n set: function set() {\n throw new Error('Cannot assign a new name, name is read-only');\n }\n });\n }\n\n FunctionNode.prototype = new Node();\n FunctionNode.prototype.type = 'FunctionNode';\n FunctionNode.prototype.isFunctionNode = true;\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n\n FunctionNode.prototype._compile = function (math, argNames) {\n if (!(this instanceof FunctionNode)) {\n throw new TypeError('No valid FunctionNode');\n } // compile arguments\n\n\n var evalArgs = this.args.map(arg => arg._compile(math, argNames));\n\n if (isSymbolNode(this.fn)) {\n // we can statically determine whether the function has an rawArgs property\n var _name = this.fn.name;\n var fn = _name in math ? getSafeProperty(math, _name) : undefined;\n var isRaw = typeof fn === 'function' && fn.rawArgs === true;\n\n var resolveFn = scope => {\n if (scope.has(_name)) {\n return scope.get(_name);\n }\n\n if (_name in math) {\n return getSafeProperty(math, _name);\n }\n\n return FunctionNode.onUndefinedFunction(_name);\n };\n\n if (isRaw) {\n // pass unevaluated parameters (nodes) to the function\n // \"raw\" evaluation\n var rawArgs = this.args;\n return function evalFunctionNode(scope, args, context) {\n var fn = resolveFn(scope);\n return fn(rawArgs, math, createSubScope(scope, args), scope);\n };\n } else {\n // \"regular\" evaluation\n switch (evalArgs.length) {\n case 0:\n return function evalFunctionNode(scope, args, context) {\n var fn = resolveFn(scope);\n return fn();\n };\n\n case 1:\n return function evalFunctionNode(scope, args, context) {\n var fn = resolveFn(scope);\n var evalArg0 = evalArgs[0];\n return fn(evalArg0(scope, args, context));\n };\n\n case 2:\n return function evalFunctionNode(scope, args, context) {\n var fn = resolveFn(scope);\n var evalArg0 = evalArgs[0];\n var evalArg1 = evalArgs[1];\n return fn(evalArg0(scope, args, context), evalArg1(scope, args, context));\n };\n\n default:\n return function evalFunctionNode(scope, args, context) {\n var fn = resolveFn(scope);\n var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n return fn(...values);\n };\n }\n }\n } else if (isAccessorNode(this.fn) && isIndexNode(this.fn.index) && this.fn.index.isObjectProperty()) {\n // execute the function with the right context: the object of the AccessorNode\n var evalObject = this.fn.object._compile(math, argNames);\n\n var prop = this.fn.index.getObjectProperty();\n var _rawArgs = this.args;\n return function evalFunctionNode(scope, args, context) {\n var object = evalObject(scope, args, context);\n validateSafeMethod(object, prop);\n var isRaw = object[prop] && object[prop].rawArgs;\n\n if (isRaw) {\n return object[prop](_rawArgs, math, createSubScope(scope, args), scope); // \"raw\" evaluation\n } else {\n // \"regular\" evaluation\n var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n return object[prop].apply(object, values);\n }\n };\n } else {\n // node.fn.isAccessorNode && !node.fn.index.isObjectProperty()\n // we have to dynamically determine whether the function has a rawArgs property\n var evalFn = this.fn._compile(math, argNames);\n\n var _rawArgs2 = this.args;\n return function evalFunctionNode(scope, args, context) {\n var fn = evalFn(scope, args, context);\n var isRaw = fn && fn.rawArgs;\n\n if (isRaw) {\n return fn(_rawArgs2, math, createSubScope(scope, args), scope); // \"raw\" evaluation\n } else {\n // \"regular\" evaluation\n var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n return fn.apply(fn, values);\n }\n };\n }\n };\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n\n\n FunctionNode.prototype.forEach = function (callback) {\n callback(this.fn, 'fn', this);\n\n for (var i = 0; i < this.args.length; i++) {\n callback(this.args[i], 'args[' + i + ']', this);\n }\n };\n /**\n * Create a new FunctionNode having it's childs be the results of calling\n * the provided callback function for each of the childs of the original node.\n * @param {function(child: Node, path: string, parent: Node): Node} callback\n * @returns {FunctionNode} Returns a transformed copy of the node\n */\n\n\n FunctionNode.prototype.map = function (callback) {\n var fn = this._ifNode(callback(this.fn, 'fn', this));\n\n var args = [];\n\n for (var i = 0; i < this.args.length; i++) {\n args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));\n }\n\n return new FunctionNode(fn, args);\n };\n /**\n * Create a clone of this node, a shallow copy\n * @return {FunctionNode}\n */\n\n\n FunctionNode.prototype.clone = function () {\n return new FunctionNode(this.fn, this.args.slice(0));\n };\n /**\n * Throws an error 'Undefined function {name}'\n * @param {string} name\n */\n\n\n FunctionNode.onUndefinedFunction = function (name) {\n throw new Error('Undefined function ' + name);\n }; // backup Node's toString function\n // @private\n\n\n var nodeToString = FunctionNode.prototype.toString;\n /**\n * Get string representation. (wrapper function)\n * This overrides parts of Node's toString function.\n * If callback is an object containing callbacks, it\n * calls the correct callback for the current node,\n * otherwise it falls back to calling Node's toString\n * function.\n *\n * @param {Object} options\n * @return {string} str\n * @override\n */\n\n FunctionNode.prototype.toString = function (options) {\n var customString;\n var name = this.fn.toString(options);\n\n if (options && typeof options.handler === 'object' && hasOwnProperty(options.handler, name)) {\n // callback is a map of callback functions\n customString = options.handler[name](this, options);\n }\n\n if (typeof customString !== 'undefined') {\n return customString;\n } // fall back to Node's toString\n\n\n return nodeToString.call(this, options);\n };\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n FunctionNode.prototype._toString = function (options) {\n var args = this.args.map(function (arg) {\n return arg.toString(options);\n });\n var fn = isFunctionAssignmentNode(this.fn) ? '(' + this.fn.toString(options) + ')' : this.fn.toString(options); // format the arguments like \"add(2, 4.2)\"\n\n return fn + '(' + args.join(', ') + ')';\n };\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n\n\n FunctionNode.prototype.toJSON = function () {\n return {\n mathjs: 'FunctionNode',\n fn: this.fn,\n args: this.args\n };\n };\n /**\n * Instantiate an AssignmentNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"FunctionNode\", fn: ..., args: ...}`,\n * where mathjs is optional\n * @returns {FunctionNode}\n */\n\n\n FunctionNode.fromJSON = function (json) {\n return new FunctionNode(json.fn, json.args);\n };\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n FunctionNode.prototype.toHTML = function (options) {\n var args = this.args.map(function (arg) {\n return arg.toHTML(options);\n }); // format the arguments like \"add(2, 4.2)\"\n\n return '' + escape(this.fn) + '(' + args.join(',') + ')';\n };\n /*\n * Expand a LaTeX template\n *\n * @param {string} template\n * @param {Node} node\n * @param {Object} options\n * @private\n **/\n\n\n function expandTemplate(template, node, options) {\n var latex = ''; // Match everything of the form ${identifier} or ${identifier[2]} or $$\n // while submatching identifier and 2 (in the second case)\n\n var regex = /\\$(?:\\{([a-z_][a-z_0-9]*)(?:\\[([0-9]+)\\])?\\}|\\$)/gi;\n var inputPos = 0; // position in the input string\n\n var match;\n\n while ((match = regex.exec(template)) !== null) {\n // go through all matches\n // add everything in front of the match to the LaTeX string\n latex += template.substring(inputPos, match.index);\n inputPos = match.index;\n\n if (match[0] === '$$') {\n // escaped dollar sign\n latex += '$';\n inputPos++;\n } else {\n // template parameter\n inputPos += match[0].length;\n var property = node[match[1]];\n\n if (!property) {\n throw new ReferenceError('Template: Property ' + match[1] + ' does not exist.');\n }\n\n if (match[2] === undefined) {\n // no square brackets\n switch (typeof property) {\n case 'string':\n latex += property;\n break;\n\n case 'object':\n if (isNode(property)) {\n latex += property.toTex(options);\n } else if (Array.isArray(property)) {\n // make array of Nodes into comma separated list\n latex += property.map(function (arg, index) {\n if (isNode(arg)) {\n return arg.toTex(options);\n }\n\n throw new TypeError('Template: ' + match[1] + '[' + index + '] is not a Node.');\n }).join(',');\n } else {\n throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');\n }\n\n break;\n\n default:\n throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');\n }\n } else {\n // with square brackets\n if (isNode(property[match[2]] && property[match[2]])) {\n latex += property[match[2]].toTex(options);\n } else {\n throw new TypeError('Template: ' + match[1] + '[' + match[2] + '] is not a Node.');\n }\n }\n }\n }\n\n latex += template.slice(inputPos); // append rest of the template\n\n return latex;\n } // backup Node's toTex function\n // @private\n\n\n var nodeToTex = FunctionNode.prototype.toTex;\n /**\n * Get LaTeX representation. (wrapper function)\n * This overrides parts of Node's toTex function.\n * If callback is an object containing callbacks, it\n * calls the correct callback for the current node,\n * otherwise it falls back to calling Node's toTex\n * function.\n *\n * @param {Object} options\n * @return {string}\n */\n\n FunctionNode.prototype.toTex = function (options) {\n var customTex;\n\n if (options && typeof options.handler === 'object' && hasOwnProperty(options.handler, this.name)) {\n // callback is a map of callback functions\n customTex = options.handler[this.name](this, options);\n }\n\n if (typeof customTex !== 'undefined') {\n return customTex;\n } // fall back to Node's toTex\n\n\n return nodeToTex.call(this, options);\n };\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n FunctionNode.prototype._toTex = function (options) {\n var args = this.args.map(function (arg) {\n // get LaTeX of the arguments\n return arg.toTex(options);\n });\n var latexConverter;\n\n if (latexFunctions[this.name]) {\n latexConverter = latexFunctions[this.name];\n } // toTex property on the function itself\n\n\n if (math[this.name] && (typeof math[this.name].toTex === 'function' || typeof math[this.name].toTex === 'object' || typeof math[this.name].toTex === 'string')) {\n // .toTex is a callback function\n latexConverter = math[this.name].toTex;\n }\n\n var customToTex;\n\n switch (typeof latexConverter) {\n case 'function':\n // a callback function\n customToTex = latexConverter(this, options);\n break;\n\n case 'string':\n // a template string\n customToTex = expandTemplate(latexConverter, this, options);\n break;\n\n case 'object':\n // an object with different \"converters\" for different numbers of arguments\n switch (typeof latexConverter[args.length]) {\n case 'function':\n customToTex = latexConverter[args.length](this, options);\n break;\n\n case 'string':\n customToTex = expandTemplate(latexConverter[args.length], this, options);\n break;\n }\n\n }\n\n if (typeof customToTex !== 'undefined') {\n return customToTex;\n }\n\n return expandTemplate(defaultTemplate, this, options);\n };\n /**\n * Get identifier.\n * @return {string}\n */\n\n\n FunctionNode.prototype.getIdentifier = function () {\n return this.type + ':' + this.name;\n };\n\n return FunctionNode;\n}, {\n isClass: true,\n isNode: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';\nimport { createFunctionNode } from '../../factoriesAny.js';\nexport var FunctionNodeDependencies = {\n NodeDependencies,\n SymbolNodeDependencies,\n createFunctionNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { RangeDependencies } from './dependenciesRangeClass.generated.js';\nimport { sizeDependencies } from './dependenciesSize.generated.js';\nimport { createIndexNode } from '../../factoriesAny.js';\nexport var IndexNodeDependencies = {\n NodeDependencies,\n RangeDependencies,\n sizeDependencies,\n createIndexNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createRangeClass } from '../../factoriesAny.js';\nexport var RangeDependencies = {\n createRangeClass\n};","import { isBigNumber } from '../../utils/is.js';\nimport { format, sign } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Range';\nvar dependencies = [];\nexport var createRangeClass = /* #__PURE__ */factory(name, dependencies, () => {\n /**\n * Create a range. A range has a start, step, and end, and contains functions\n * to iterate over the range.\n *\n * A range can be constructed as:\n *\n * const range = new Range(start, end)\n * const range = new Range(start, end, step)\n *\n * To get the result of the range:\n * range.forEach(function (x) {\n * console.log(x)\n * })\n * range.map(function (x) {\n * return math.sin(x)\n * })\n * range.toArray()\n *\n * Example usage:\n *\n * const c = new Range(2, 6) // 2:1:5\n * c.toArray() // [2, 3, 4, 5]\n * const d = new Range(2, -3, -1) // 2:-1:-2\n * d.toArray() // [2, 1, 0, -1, -2]\n *\n * @class Range\n * @constructor Range\n * @param {number} start included lower bound\n * @param {number} end excluded upper bound\n * @param {number} [step] step size, default value is 1\n */\n function Range(start, end, step) {\n if (!(this instanceof Range)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n\n var hasStart = start !== null && start !== undefined;\n var hasEnd = end !== null && end !== undefined;\n var hasStep = step !== null && step !== undefined;\n\n if (hasStart) {\n if (isBigNumber(start)) {\n start = start.toNumber();\n } else if (typeof start !== 'number') {\n throw new TypeError('Parameter start must be a number');\n }\n }\n\n if (hasEnd) {\n if (isBigNumber(end)) {\n end = end.toNumber();\n } else if (typeof end !== 'number') {\n throw new TypeError('Parameter end must be a number');\n }\n }\n\n if (hasStep) {\n if (isBigNumber(step)) {\n step = step.toNumber();\n } else if (typeof step !== 'number') {\n throw new TypeError('Parameter step must be a number');\n }\n }\n\n this.start = hasStart ? parseFloat(start) : 0;\n this.end = hasEnd ? parseFloat(end) : 0;\n this.step = hasStep ? parseFloat(step) : 1;\n }\n /**\n * Attach type information\n */\n\n\n Range.prototype.type = 'Range';\n Range.prototype.isRange = true;\n /**\n * Parse a string into a range,\n * The string contains the start, optional step, and end, separated by a colon.\n * If the string does not contain a valid range, null is returned.\n * For example str='0:2:11'.\n * @memberof Range\n * @param {string} str\n * @return {Range | null} range\n */\n\n Range.parse = function (str) {\n if (typeof str !== 'string') {\n return null;\n }\n\n var args = str.split(':');\n var nums = args.map(function (arg) {\n return parseFloat(arg);\n });\n var invalid = nums.some(function (num) {\n return isNaN(num);\n });\n\n if (invalid) {\n return null;\n }\n\n switch (nums.length) {\n case 2:\n return new Range(nums[0], nums[1]);\n\n case 3:\n return new Range(nums[0], nums[2], nums[1]);\n\n default:\n return null;\n }\n };\n /**\n * Create a clone of the range\n * @return {Range} clone\n */\n\n\n Range.prototype.clone = function () {\n return new Range(this.start, this.end, this.step);\n };\n /**\n * Retrieve the size of the range.\n * Returns an array containing one number, the number of elements in the range.\n * @memberof Range\n * @returns {number[]} size\n */\n\n\n Range.prototype.size = function () {\n var len = 0;\n var start = this.start;\n var step = this.step;\n var end = this.end;\n var diff = end - start;\n\n if (sign(step) === sign(diff)) {\n len = Math.ceil(diff / step);\n } else if (diff === 0) {\n len = 0;\n }\n\n if (isNaN(len)) {\n len = 0;\n }\n\n return [len];\n };\n /**\n * Calculate the minimum value in the range\n * @memberof Range\n * @return {number | undefined} min\n */\n\n\n Range.prototype.min = function () {\n var size = this.size()[0];\n\n if (size > 0) {\n if (this.step > 0) {\n // positive step\n return this.start;\n } else {\n // negative step\n return this.start + (size - 1) * this.step;\n }\n } else {\n return undefined;\n }\n };\n /**\n * Calculate the maximum value in the range\n * @memberof Range\n * @return {number | undefined} max\n */\n\n\n Range.prototype.max = function () {\n var size = this.size()[0];\n\n if (size > 0) {\n if (this.step > 0) {\n // positive step\n return this.start + (size - 1) * this.step;\n } else {\n // negative step\n return this.start;\n }\n } else {\n return undefined;\n }\n };\n /**\n * Execute a callback function for each value in the range.\n * @memberof Range\n * @param {function} callback The callback method is invoked with three\n * parameters: the value of the element, the index\n * of the element, and the Range being traversed.\n */\n\n\n Range.prototype.forEach = function (callback) {\n var x = this.start;\n var step = this.step;\n var end = this.end;\n var i = 0;\n\n if (step > 0) {\n while (x < end) {\n callback(x, [i], this);\n x += step;\n i++;\n }\n } else if (step < 0) {\n while (x > end) {\n callback(x, [i], this);\n x += step;\n i++;\n }\n }\n };\n /**\n * Execute a callback function for each value in the Range, and return the\n * results as an array\n * @memberof Range\n * @param {function} callback The callback method is invoked with three\n * parameters: the value of the element, the index\n * of the element, and the Matrix being traversed.\n * @returns {Array} array\n */\n\n\n Range.prototype.map = function (callback) {\n var array = [];\n this.forEach(function (value, index, obj) {\n array[index[0]] = callback(value, index, obj);\n });\n return array;\n };\n /**\n * Create an Array with a copy of the Ranges data\n * @memberof Range\n * @returns {Array} array\n */\n\n\n Range.prototype.toArray = function () {\n var array = [];\n this.forEach(function (value, index) {\n array[index[0]] = value;\n });\n return array;\n };\n /**\n * Get the primitive value of the Range, a one dimensional array\n * @memberof Range\n * @returns {Array} array\n */\n\n\n Range.prototype.valueOf = function () {\n // TODO: implement a caching mechanism for range.valueOf()\n return this.toArray();\n };\n /**\n * Get a string representation of the range, with optional formatting options.\n * Output is formatted as 'start:step:end', for example '2:6' or '0:0.2:11'\n * @memberof Range\n * @param {Object | number | function} [options] Formatting options. See\n * lib/utils/number:format for a\n * description of the available\n * options.\n * @returns {string} str\n */\n\n\n Range.prototype.format = function (options) {\n var str = format(this.start, options);\n\n if (this.step !== 1) {\n str += ':' + format(this.step, options);\n }\n\n str += ':' + format(this.end, options);\n return str;\n };\n /**\n * Get a string representation of the range.\n * @memberof Range\n * @returns {string}\n */\n\n\n Range.prototype.toString = function () {\n return this.format();\n };\n /**\n * Get a JSON representation of the range\n * @memberof Range\n * @returns {Object} Returns a JSON object structured as:\n * `{\"mathjs\": \"Range\", \"start\": 2, \"end\": 4, \"step\": 1}`\n */\n\n\n Range.prototype.toJSON = function () {\n return {\n mathjs: 'Range',\n start: this.start,\n end: this.end,\n step: this.step\n };\n };\n /**\n * Instantiate a Range from a JSON object\n * @memberof Range\n * @param {Object} json A JSON object structured as:\n * `{\"mathjs\": \"Range\", \"start\": 2, \"end\": 4, \"step\": 1}`\n * @return {Range}\n */\n\n\n Range.fromJSON = function (json) {\n return new Range(json.start, json.end, json.step);\n };\n\n return Range;\n}, {\n isClass: true\n});","import { isBigNumber, isConstantNode, isNode, isRangeNode, isSymbolNode } from '../../utils/is.js';\nimport { map } from '../../utils/array.js';\nimport { escape } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nvar name = 'IndexNode';\nvar dependencies = ['Range', 'Node', 'size'];\nexport var createIndexNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n Range,\n Node,\n size\n } = _ref;\n\n /**\n * @constructor IndexNode\n * @extends Node\n *\n * Describes a subset of a matrix or an object property.\n * Cannot be used on its own, needs to be used within an AccessorNode or\n * AssignmentNode.\n *\n * @param {Node[]} dimensions\n * @param {boolean} [dotNotation=false] Optional property describing whether\n * this index was written using dot\n * notation like `a.b`, or using bracket\n * notation like `a[\"b\"]` (default).\n * Used to stringify an IndexNode.\n */\n function IndexNode(dimensions, dotNotation) {\n if (!(this instanceof IndexNode)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n\n this.dimensions = dimensions;\n this.dotNotation = dotNotation || false; // validate input\n\n if (!Array.isArray(dimensions) || !dimensions.every(isNode)) {\n throw new TypeError('Array containing Nodes expected for parameter \"dimensions\"');\n }\n\n if (this.dotNotation && !this.isObjectProperty()) {\n throw new Error('dotNotation only applicable for object properties');\n }\n }\n\n IndexNode.prototype = new Node();\n IndexNode.prototype.type = 'IndexNode';\n IndexNode.prototype.isIndexNode = true;\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n\n IndexNode.prototype._compile = function (math, argNames) {\n // TODO: implement support for bignumber (currently bignumbers are silently\n // reduced to numbers when changing the value to zero-based)\n // TODO: Optimization: when the range values are ConstantNodes,\n // we can beforehand resolve the zero-based value\n // optimization for a simple object property\n var evalDimensions = map(this.dimensions, function (range, i) {\n if (isRangeNode(range)) {\n if (range.needsEnd()) {\n // create a range containing end (like '4:end')\n var childArgNames = Object.create(argNames);\n childArgNames.end = true;\n\n var evalStart = range.start._compile(math, childArgNames);\n\n var evalEnd = range.end._compile(math, childArgNames);\n\n var evalStep = range.step ? range.step._compile(math, childArgNames) : function () {\n return 1;\n };\n return function evalDimension(scope, args, context) {\n var s = size(context).valueOf();\n var childArgs = Object.create(args);\n childArgs.end = s[i];\n return createRange(evalStart(scope, childArgs, context), evalEnd(scope, childArgs, context), evalStep(scope, childArgs, context));\n };\n } else {\n // create range\n var _evalStart = range.start._compile(math, argNames);\n\n var _evalEnd = range.end._compile(math, argNames);\n\n var _evalStep = range.step ? range.step._compile(math, argNames) : function () {\n return 1;\n };\n\n return function evalDimension(scope, args, context) {\n return createRange(_evalStart(scope, args, context), _evalEnd(scope, args, context), _evalStep(scope, args, context));\n };\n }\n } else if (isSymbolNode(range) && range.name === 'end') {\n // SymbolNode 'end'\n var _childArgNames = Object.create(argNames);\n\n _childArgNames.end = true;\n\n var evalRange = range._compile(math, _childArgNames);\n\n return function evalDimension(scope, args, context) {\n var s = size(context).valueOf();\n var childArgs = Object.create(args);\n childArgs.end = s[i];\n return evalRange(scope, childArgs, context);\n };\n } else {\n // ConstantNode\n var _evalRange = range._compile(math, argNames);\n\n return function evalDimension(scope, args, context) {\n return _evalRange(scope, args, context);\n };\n }\n });\n var index = getSafeProperty(math, 'index');\n return function evalIndexNode(scope, args, context) {\n var dimensions = map(evalDimensions, function (evalDimension) {\n return evalDimension(scope, args, context);\n });\n return index(...dimensions);\n };\n };\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n\n\n IndexNode.prototype.forEach = function (callback) {\n for (var i = 0; i < this.dimensions.length; i++) {\n callback(this.dimensions[i], 'dimensions[' + i + ']', this);\n }\n };\n /**\n * Create a new IndexNode having it's childs be the results of calling\n * the provided callback function for each of the childs of the original node.\n * @param {function(child: Node, path: string, parent: Node): Node} callback\n * @returns {IndexNode} Returns a transformed copy of the node\n */\n\n\n IndexNode.prototype.map = function (callback) {\n var dimensions = [];\n\n for (var i = 0; i < this.dimensions.length; i++) {\n dimensions[i] = this._ifNode(callback(this.dimensions[i], 'dimensions[' + i + ']', this));\n }\n\n return new IndexNode(dimensions, this.dotNotation);\n };\n /**\n * Create a clone of this node, a shallow copy\n * @return {IndexNode}\n */\n\n\n IndexNode.prototype.clone = function () {\n return new IndexNode(this.dimensions.slice(0), this.dotNotation);\n };\n /**\n * Test whether this IndexNode contains a single property name\n * @return {boolean}\n */\n\n\n IndexNode.prototype.isObjectProperty = function () {\n return this.dimensions.length === 1 && isConstantNode(this.dimensions[0]) && typeof this.dimensions[0].value === 'string';\n };\n /**\n * Returns the property name if IndexNode contains a property.\n * If not, returns null.\n * @return {string | null}\n */\n\n\n IndexNode.prototype.getObjectProperty = function () {\n return this.isObjectProperty() ? this.dimensions[0].value : null;\n };\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n IndexNode.prototype._toString = function (options) {\n // format the parameters like \"[1, 0:5]\"\n return this.dotNotation ? '.' + this.getObjectProperty() : '[' + this.dimensions.join(', ') + ']';\n };\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n\n\n IndexNode.prototype.toJSON = function () {\n return {\n mathjs: 'IndexNode',\n dimensions: this.dimensions,\n dotNotation: this.dotNotation\n };\n };\n /**\n * Instantiate an IndexNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"IndexNode\", dimensions: [...], dotNotation: false}`,\n * where mathjs is optional\n * @returns {IndexNode}\n */\n\n\n IndexNode.fromJSON = function (json) {\n return new IndexNode(json.dimensions, json.dotNotation);\n };\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n IndexNode.prototype.toHTML = function (options) {\n // format the parameters like \"[1, 0:5]\"\n var dimensions = [];\n\n for (var i = 0; i < this.dimensions.length; i++) {\n dimensions[i] = this.dimensions[i].toHTML();\n }\n\n if (this.dotNotation) {\n return '.' + '' + escape(this.getObjectProperty()) + '';\n } else {\n return '[' + dimensions.join(',') + ']';\n }\n };\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n IndexNode.prototype._toTex = function (options) {\n var dimensions = this.dimensions.map(function (range) {\n return range.toTex(options);\n });\n return this.dotNotation ? '.' + this.getObjectProperty() + '' : '_{' + dimensions.join(',') + '}';\n }; // helper function to create a Range from start, step and end\n\n\n function createRange(start, end, step) {\n return new Range(isBigNumber(start) ? start.toNumber() : start, isBigNumber(end) ? end.toNumber() : end, isBigNumber(step) ? step.toNumber() : step);\n }\n\n return IndexNode;\n}, {\n isClass: true,\n isNode: true\n});","import { isNode } from '../../utils/is.js';\nimport { escape, stringify } from '../../utils/string.js';\nimport { isSafeProperty } from '../../utils/customs.js';\nimport { hasOwnProperty } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ObjectNode';\nvar dependencies = ['Node'];\nexport var createObjectNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n Node\n } = _ref;\n\n /**\n * @constructor ObjectNode\n * @extends {Node}\n * Holds an object with keys/values\n * @param {Object.<string, Node>} [properties] object with key/value pairs\n */\n function ObjectNode(properties) {\n if (!(this instanceof ObjectNode)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n\n this.properties = properties || {}; // validate input\n\n if (properties) {\n if (!(typeof properties === 'object') || !Object.keys(properties).every(function (key) {\n return isNode(properties[key]);\n })) {\n throw new TypeError('Object containing Nodes expected');\n }\n }\n }\n\n ObjectNode.prototype = new Node();\n ObjectNode.prototype.type = 'ObjectNode';\n ObjectNode.prototype.isObjectNode = true;\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n\n ObjectNode.prototype._compile = function (math, argNames) {\n var evalEntries = {};\n\n for (var key in this.properties) {\n if (hasOwnProperty(this.properties, key)) {\n // we stringify/parse the key here to resolve unicode characters,\n // so you cannot create a key like {\"co\\\\u006Estructor\": null}\n var stringifiedKey = stringify(key);\n var parsedKey = JSON.parse(stringifiedKey);\n\n if (!isSafeProperty(this.properties, parsedKey)) {\n throw new Error('No access to property \"' + parsedKey + '\"');\n }\n\n evalEntries[parsedKey] = this.properties[key]._compile(math, argNames);\n }\n }\n\n return function evalObjectNode(scope, args, context) {\n var obj = {};\n\n for (var _key in evalEntries) {\n if (hasOwnProperty(evalEntries, _key)) {\n obj[_key] = evalEntries[_key](scope, args, context);\n }\n }\n\n return obj;\n };\n };\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n\n\n ObjectNode.prototype.forEach = function (callback) {\n for (var key in this.properties) {\n if (hasOwnProperty(this.properties, key)) {\n callback(this.properties[key], 'properties[' + stringify(key) + ']', this);\n }\n }\n };\n /**\n * Create a new ObjectNode having it's childs be the results of calling\n * the provided callback function for each of the childs of the original node.\n * @param {function(child: Node, path: string, parent: Node): Node} callback\n * @returns {ObjectNode} Returns a transformed copy of the node\n */\n\n\n ObjectNode.prototype.map = function (callback) {\n var properties = {};\n\n for (var key in this.properties) {\n if (hasOwnProperty(this.properties, key)) {\n properties[key] = this._ifNode(callback(this.properties[key], 'properties[' + stringify(key) + ']', this));\n }\n }\n\n return new ObjectNode(properties);\n };\n /**\n * Create a clone of this node, a shallow copy\n * @return {ObjectNode}\n */\n\n\n ObjectNode.prototype.clone = function () {\n var properties = {};\n\n for (var key in this.properties) {\n if (hasOwnProperty(this.properties, key)) {\n properties[key] = this.properties[key];\n }\n }\n\n return new ObjectNode(properties);\n };\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n\n\n ObjectNode.prototype._toString = function (options) {\n var entries = [];\n\n for (var key in this.properties) {\n if (hasOwnProperty(this.properties, key)) {\n entries.push(stringify(key) + ': ' + this.properties[key].toString(options));\n }\n }\n\n return '{' + entries.join(', ') + '}';\n };\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n\n\n ObjectNode.prototype.toJSON = function () {\n return {\n mathjs: 'ObjectNode',\n properties: this.properties\n };\n };\n /**\n * Instantiate an OperatorNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"ObjectNode\", \"properties\": {...}}`,\n * where mathjs is optional\n * @returns {ObjectNode}\n */\n\n\n ObjectNode.fromJSON = function (json) {\n return new ObjectNode(json.properties);\n };\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n\n\n ObjectNode.prototype.toHTML = function (options) {\n var entries = [];\n\n for (var key in this.properties) {\n if (hasOwnProperty(this.properties, key)) {\n entries.push('' + escape(key) + '' + ':' + this.properties[key].toHTML(options));\n }\n }\n\n return '{' + entries.join(',') + '}';\n };\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n ObjectNode.prototype._toTex = function (options) {\n var entries = [];\n\n for (var key in this.properties) {\n if (hasOwnProperty(this.properties, key)) {\n entries.push('\\\\mathbf{' + key + ':} & ' + this.properties[key].toTex(options) + '\\\\\\\\');\n }\n }\n\n return \"\\\\left\\\\{\\\\begin{array}{ll}\".concat(entries.join('\\n'), \"\\\\end{array}\\\\right\\\\}\");\n };\n\n return ObjectNode;\n}, {\n isClass: true,\n isNode: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createObjectNode } from '../../factoriesAny.js';\nexport var ObjectNodeDependencies = {\n NodeDependencies,\n createObjectNode\n};","import { isNode } from '../../utils/is.js';\nimport { map } from '../../utils/array.js';\nimport { escape } from '../../utils/string.js';\nimport { getSafeProperty, isSafeMethod } from '../../utils/customs.js';\nimport { getAssociativity, getPrecedence, isAssociativeWith, properties } from '../operators.js';\nimport { latexOperators } from '../../utils/latex.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'OperatorNode';\nvar dependencies = ['Node'];\nexport var createOperatorNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n Node\n } = _ref;\n\n /**\n * @constructor OperatorNode\n * @extends {Node}\n * An operator with two arguments, like 2+3\n *\n * @param {string} op Operator name, for example '+'\n * @param {string} fn Function name, for example 'add'\n * @param {Node[]} args Operator arguments\n * @param {boolean} [implicit] Is this an implicit multiplication?\n * @param {boolean} [isPercentage] Is this an percentage Operation?\n */\n function OperatorNode(op, fn, args, implicit, isPercentage) {\n if (!(this instanceof OperatorNode)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n } // validate input\n\n\n if (typeof op !== 'string') {\n throw new TypeError('string expected for parameter \"op\"');\n }\n\n if (typeof fn !== 'string') {\n throw new TypeError('string expected for parameter \"fn\"');\n }\n\n if (!Array.isArray(args) || !args.every(isNode)) {\n throw new TypeError('Array containing Nodes expected for parameter \"args\"');\n }\n\n this.implicit = implicit === true;\n this.isPercentage = isPercentage === true;\n this.op = op;\n this.fn = fn;\n this.args = args || [];\n }\n\n OperatorNode.prototype = new Node();\n OperatorNode.prototype.type = 'OperatorNode';\n OperatorNode.prototype.isOperatorNode = true;\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n\n OperatorNode.prototype._compile = function (math, argNames) {\n // validate fn\n if (typeof this.fn !== 'string' || !isSafeMethod(math, this.fn)) {\n if (!math[this.fn]) {\n throw new Error('Function ' + this.fn + ' missing in provided namespace \"math\"');\n } else {\n throw new Error('No access to function \"' + this.fn + '\"');\n }\n }\n\n var fn = getSafeProperty(math, this.fn);\n var evalArgs = map(this.args, function (arg) {\n return arg._compile(math, argNames);\n });\n\n if (evalArgs.length === 1) {\n var evalArg0 = evalArgs[0];\n return function evalOperatorNode(scope, args, context) {\n return fn(evalArg0(scope, args, context));\n };\n } else if (evalArgs.length === 2) {\n var _evalArg = evalArgs[0];\n var evalArg1 = evalArgs[1];\n return function evalOperatorNode(scope, args, context) {\n return fn(_evalArg(scope, args, context), evalArg1(scope, args, context));\n };\n } else {\n return function evalOperatorNode(scope, args, context) {\n return fn.apply(null, map(evalArgs, function (evalArg) {\n return evalArg(scope, args, context);\n }));\n };\n }\n };\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n\n\n OperatorNode.prototype.forEach = function (callback) {\n for (var i = 0; i < this.args.length; i++) {\n callback(this.args[i], 'args[' + i + ']', this);\n }\n };\n /**\n * Create a new OperatorNode having it's childs be the results of calling\n * the provided callback function for each of the childs of the original node.\n * @param {function(child: Node, path: string, parent: Node): Node} callback\n * @returns {OperatorNode} Returns a transformed copy of the node\n */\n\n\n OperatorNode.prototype.map = function (callback) {\n var args = [];\n\n for (var i = 0; i < this.args.length; i++) {\n args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));\n }\n\n return new OperatorNode(this.op, this.fn, args, this.implicit, this.isPercentage);\n };\n /**\n * Create a clone of this node, a shallow copy\n * @return {OperatorNode}\n */\n\n\n OperatorNode.prototype.clone = function () {\n return new OperatorNode(this.op, this.fn, this.args.slice(0), this.implicit, this.isPercentage);\n };\n /**\n * Check whether this is an unary OperatorNode:\n * has exactly one argument, like `-a`.\n * @return {boolean} Returns true when an unary operator node, false otherwise.\n */\n\n\n OperatorNode.prototype.isUnary = function () {\n return this.args.length === 1;\n };\n /**\n * Check whether this is a binary OperatorNode:\n * has exactly two arguments, like `a + b`.\n * @return {boolean} Returns true when a binary operator node, false otherwise.\n */\n\n\n OperatorNode.prototype.isBinary = function () {\n return this.args.length === 2;\n };\n /**\n * Calculate which parentheses are necessary. Gets an OperatorNode\n * (which is the root of the tree) and an Array of Nodes\n * (this.args) and returns an array where 'true' means that an argument\n * has to be enclosed in parentheses whereas 'false' means the opposite.\n *\n * @param {OperatorNode} root\n * @param {string} parenthesis\n * @param {Node[]} args\n * @param {boolean} latex\n * @return {boolean[]}\n * @private\n */\n\n\n function calculateNecessaryParentheses(root, parenthesis, implicit, args, latex) {\n // precedence of the root OperatorNode\n var precedence = getPrecedence(root, parenthesis);\n var associativity = getAssociativity(root, parenthesis);\n\n if (parenthesis === 'all' || args.length > 2 && root.getIdentifier() !== 'OperatorNode:add' && root.getIdentifier() !== 'OperatorNode:multiply') {\n return args.map(function (arg) {\n switch (arg.getContent().type) {\n // Nodes that don't need extra parentheses\n case 'ArrayNode':\n case 'ConstantNode':\n case 'SymbolNode':\n case 'ParenthesisNode':\n return false;\n\n default:\n return true;\n }\n });\n }\n\n var result;\n\n switch (args.length) {\n case 0:\n result = [];\n break;\n\n case 1:\n // unary operators\n {\n // precedence of the operand\n var operandPrecedence = getPrecedence(args[0], parenthesis); // handle special cases for LaTeX, where some of the parentheses aren't needed\n\n if (latex && operandPrecedence !== null) {\n var operandIdentifier;\n var rootIdentifier;\n\n if (parenthesis === 'keep') {\n operandIdentifier = args[0].getIdentifier();\n rootIdentifier = root.getIdentifier();\n } else {\n // Ignore Parenthesis Nodes when not in 'keep' mode\n operandIdentifier = args[0].getContent().getIdentifier();\n rootIdentifier = root.getContent().getIdentifier();\n }\n\n if (properties[precedence][rootIdentifier].latexLeftParens === false) {\n result = [false];\n break;\n }\n\n if (properties[operandPrecedence][operandIdentifier].latexParens === false) {\n result = [false];\n break;\n }\n }\n\n if (operandPrecedence === null) {\n // if the operand has no defined precedence, no parens are needed\n result = [false];\n break;\n }\n\n if (operandPrecedence <= precedence) {\n // if the operands precedence is lower, parens are needed\n result = [true];\n break;\n } // otherwise, no parens needed\n\n\n result = [false];\n }\n break;\n\n case 2:\n // binary operators\n {\n var lhsParens; // left hand side needs parenthesis?\n // precedence of the left hand side\n\n var lhsPrecedence = getPrecedence(args[0], parenthesis); // is the root node associative with the left hand side\n\n var assocWithLhs = isAssociativeWith(root, args[0], parenthesis);\n\n if (lhsPrecedence === null) {\n // if the left hand side has no defined precedence, no parens are needed\n // FunctionNode for example\n lhsParens = false;\n } else if (lhsPrecedence === precedence && associativity === 'right' && !assocWithLhs) {\n // In case of equal precedence, if the root node is left associative\n // parens are **never** necessary for the left hand side.\n // If it is right associative however, parens are necessary\n // if the root node isn't associative with the left hand side\n lhsParens = true;\n } else if (lhsPrecedence < precedence) {\n lhsParens = true;\n } else {\n lhsParens = false;\n }\n\n var rhsParens; // right hand side needs parenthesis?\n // precedence of the right hand side\n\n var rhsPrecedence = getPrecedence(args[1], parenthesis); // is the root node associative with the right hand side?\n\n var assocWithRhs = isAssociativeWith(root, args[1], parenthesis);\n\n if (rhsPrecedence === null) {\n // if the right hand side has no defined precedence, no parens are needed\n // FunctionNode for example\n rhsParens = false;\n } else if (rhsPrecedence === precedence && associativity === 'left' && !assocWithRhs) {\n // In case of equal precedence, if the root node is right associative\n // parens are **never** necessary for the right hand side.\n // If it is left associative however, parens are necessary\n // if the root node isn't associative with the right hand side\n rhsParens = true;\n } else if (rhsPrecedence < precedence) {\n rhsParens = true;\n } else {\n rhsParens = false;\n } // handle special cases for LaTeX, where some of the parentheses aren't needed\n\n\n if (latex) {\n var _rootIdentifier;\n\n var lhsIdentifier;\n var rhsIdentifier;\n\n if (parenthesis === 'keep') {\n _rootIdentifier = root.getIdentifier();\n lhsIdentifier = root.args[0].getIdentifier();\n rhsIdentifier = root.args[1].getIdentifier();\n } else {\n // Ignore ParenthesisNodes when not in 'keep' mode\n _rootIdentifier = root.getContent().getIdentifier();\n lhsIdentifier = root.args[0].getContent().getIdentifier();\n rhsIdentifier = root.args[1].getContent().getIdentifier();\n }\n\n if (lhsPrecedence !== null) {\n if (properties[precedence][_rootIdentifier].latexLeftParens === false) {\n lhsParens = false;\n }\n\n if (properties[lhsPrecedence][lhsIdentifier].latexParens === false) {\n lhsParens = false;\n }\n }\n\n if (rhsPrecedence !== null) {\n if (properties[precedence][_rootIdentifier].latexRightParens === false) {\n rhsParens = false;\n }\n\n if (properties[rhsPrecedence][rhsIdentifier].latexParens === false) {\n rhsParens = false;\n }\n }\n }\n\n result = [lhsParens, rhsParens];\n }\n break;\n\n default:\n if (root.getIdentifier() === 'OperatorNode:add' || root.getIdentifier() === 'OperatorNode:multiply') {\n result = args.map(function (arg) {\n var argPrecedence = getPrecedence(arg, parenthesis);\n var assocWithArg = isAssociativeWith(root, arg, parenthesis);\n var argAssociativity = getAssociativity(arg, parenthesis);\n\n if (argPrecedence === null) {\n // if the argument has no defined precedence, no parens are needed\n return false;\n } else if (precedence === argPrecedence && associativity === argAssociativity && !assocWithArg) {\n return true;\n } else if (argPrecedence < precedence) {\n return true;\n }\n\n return false;\n });\n }\n\n break;\n } // handles an edge case of 'auto' parentheses with implicit multiplication of ConstantNode\n // In that case print parentheses for ParenthesisNodes even though they normally wouldn't be\n // printed.\n\n\n if (args.length >= 2 && root.getIdentifier() === 'OperatorNode:multiply' && root.implicit && parenthesis === 'auto' && implicit === 'hide') {\n result = args.map(function (arg, index) {\n var isParenthesisNode = arg.getIdentifier() === 'ParenthesisNode';\n\n if (result[index] || isParenthesisNode) {\n // put in parenthesis?\n return true;\n }\n\n return false;\n });\n }\n\n return result;\n }\n /**\n * Get string representation.\n * @param {Object} options\n * @return {string} str\n */\n\n\n OperatorNode.prototype._toString = function (options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var implicit = options && options.implicit ? options.implicit : 'hide';\n var args = this.args;\n var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);\n\n if (args.length === 1) {\n // unary operators\n var assoc = getAssociativity(this, parenthesis);\n var operand = args[0].toString(options);\n\n if (parens[0]) {\n operand = '(' + operand + ')';\n } // for example for \"not\", we want a space between operand and argument\n\n\n var opIsNamed = /[a-zA-Z]+/.test(this.op);\n\n if (assoc === 'right') {\n // prefix operator\n return this.op + (opIsNamed ? ' ' : '') + operand;\n } else if (assoc === 'left') {\n // postfix\n return operand + (opIsNamed ? ' ' : '') + this.op;\n } // fall back to postfix\n\n\n return operand + this.op;\n } else if (args.length === 2) {\n var lhs = args[0].toString(options); // left hand side\n\n var rhs = args[1].toString(options); // right hand side\n\n if (parens[0]) {\n // left hand side in parenthesis?\n lhs = '(' + lhs + ')';\n }\n\n if (parens[1]) {\n // right hand side in parenthesis?\n rhs = '(' + rhs + ')';\n }\n\n if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {\n return lhs + ' ' + rhs;\n }\n\n return lhs + ' ' + this.op + ' ' + rhs;\n } else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {\n var stringifiedArgs = args.map(function (arg, index) {\n arg = arg.toString(options);\n\n if (parens[index]) {\n // put in parenthesis?\n arg = '(' + arg + ')';\n }\n\n return arg;\n });\n\n if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {\n return stringifiedArgs.join(' ');\n }\n\n return stringifiedArgs.join(' ' + this.op + ' ');\n } else {\n // fallback to formatting as a function call\n return this.fn + '(' + this.args.join(', ') + ')';\n }\n };\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n\n\n OperatorNode.prototype.toJSON = function () {\n return {\n mathjs: 'OperatorNode',\n op: this.op,\n fn: this.fn,\n args: this.args,\n implicit: this.implicit,\n isPercentage: this.isPercentage\n };\n };\n /**\n * Instantiate an OperatorNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"OperatorNode\", \"op\": \"+\", \"fn\": \"add\", \"args\": [...], \"implicit\": false, \"isPercentage\":false}`,\n * where mathjs is optional\n * @returns {OperatorNode}\n */\n\n\n OperatorNode.fromJSON = function (json) {\n return new OperatorNode(json.op, json.fn, json.args, json.implicit, json.isPercentage);\n };\n /**\n * Get HTML representation.\n * @param {Object} options\n * @return {string} str\n */\n\n\n OperatorNode.prototype.toHTML = function (options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var implicit = options && options.implicit ? options.implicit : 'hide';\n var args = this.args;\n var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);\n\n if (args.length === 1) {\n // unary operators\n var assoc = getAssociativity(this, parenthesis);\n var operand = args[0].toHTML(options);\n\n if (parens[0]) {\n operand = '(' + operand + ')';\n }\n\n if (assoc === 'right') {\n // prefix operator\n return '' + escape(this.op) + '' + operand;\n } else {\n // postfix when assoc === 'left' or undefined\n return operand + '' + escape(this.op) + '';\n }\n } else if (args.length === 2) {\n // binary operatoes\n var lhs = args[0].toHTML(options); // left hand side\n\n var rhs = args[1].toHTML(options); // right hand side\n\n if (parens[0]) {\n // left hand side in parenthesis?\n lhs = '(' + lhs + ')';\n }\n\n if (parens[1]) {\n // right hand side in parenthesis?\n rhs = '(' + rhs + ')';\n }\n\n if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {\n return lhs + '' + rhs;\n }\n\n return lhs + '' + escape(this.op) + '' + rhs;\n } else {\n var stringifiedArgs = args.map(function (arg, index) {\n arg = arg.toHTML(options);\n\n if (parens[index]) {\n // put in parenthesis?\n arg = '(' + arg + ')';\n }\n\n return arg;\n });\n\n if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {\n if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {\n return stringifiedArgs.join('');\n }\n\n return stringifiedArgs.join('' + escape(this.op) + '');\n } else {\n // fallback to formatting as a function call\n return '' + escape(this.fn) + '(' + stringifiedArgs.join(',') + ')';\n }\n }\n };\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n OperatorNode.prototype._toTex = function (options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var implicit = options && options.implicit ? options.implicit : 'hide';\n var args = this.args;\n var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, true);\n var op = latexOperators[this.fn];\n op = typeof op === 'undefined' ? this.op : op; // fall back to using this.op\n\n if (args.length === 1) {\n // unary operators\n var assoc = getAssociativity(this, parenthesis);\n var operand = args[0].toTex(options);\n\n if (parens[0]) {\n operand = \"\\\\left(\".concat(operand, \"\\\\right)\");\n }\n\n if (assoc === 'right') {\n // prefix operator\n return op + operand;\n } else if (assoc === 'left') {\n // postfix operator\n return operand + op;\n } // fall back to postfix\n\n\n return operand + op;\n } else if (args.length === 2) {\n // binary operators\n var lhs = args[0]; // left hand side\n\n var lhsTex = lhs.toTex(options);\n\n if (parens[0]) {\n lhsTex = \"\\\\left(\".concat(lhsTex, \"\\\\right)\");\n }\n\n var rhs = args[1]; // right hand side\n\n var rhsTex = rhs.toTex(options);\n\n if (parens[1]) {\n rhsTex = \"\\\\left(\".concat(rhsTex, \"\\\\right)\");\n } // handle some exceptions (due to the way LaTeX works)\n\n\n var lhsIdentifier;\n\n if (parenthesis === 'keep') {\n lhsIdentifier = lhs.getIdentifier();\n } else {\n // Ignore ParenthesisNodes if in 'keep' mode\n lhsIdentifier = lhs.getContent().getIdentifier();\n }\n\n switch (this.getIdentifier()) {\n case 'OperatorNode:divide':\n // op contains '\\\\frac' at this point\n return op + '{' + lhsTex + '}' + '{' + rhsTex + '}';\n\n case 'OperatorNode:pow':\n lhsTex = '{' + lhsTex + '}';\n rhsTex = '{' + rhsTex + '}';\n\n switch (lhsIdentifier) {\n case 'ConditionalNode': //\n\n case 'OperatorNode:divide':\n lhsTex = \"\\\\left(\".concat(lhsTex, \"\\\\right)\");\n }\n\n break;\n\n case 'OperatorNode:multiply':\n if (this.implicit && implicit === 'hide') {\n return lhsTex + '~' + rhsTex;\n }\n\n }\n\n return lhsTex + op + rhsTex;\n } else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {\n var texifiedArgs = args.map(function (arg, index) {\n arg = arg.toTex(options);\n\n if (parens[index]) {\n arg = \"\\\\left(\".concat(arg, \"\\\\right)\");\n }\n\n return arg;\n });\n\n if (this.getIdentifier() === 'OperatorNode:multiply' && this.implicit) {\n return texifiedArgs.join('~');\n }\n\n return texifiedArgs.join(op);\n } else {\n // fall back to formatting as a function call\n // as this is a fallback, it doesn't use\n // fancy function names\n return '\\\\mathrm{' + this.fn + '}\\\\left(' + args.map(function (arg) {\n return arg.toTex(options);\n }).join(',') + '\\\\right)';\n }\n };\n /**\n * Get identifier.\n * @return {string}\n */\n\n\n OperatorNode.prototype.getIdentifier = function () {\n return this.type + ':' + this.fn;\n };\n\n return OperatorNode;\n}, {\n isClass: true,\n isNode: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createOperatorNode } from '../../factoriesAny.js';\nexport var OperatorNodeDependencies = {\n NodeDependencies,\n createOperatorNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createParenthesisNode } from '../../factoriesAny.js';\nexport var ParenthesisNodeDependencies = {\n NodeDependencies,\n createParenthesisNode\n};","import { isNode } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ParenthesisNode';\nvar dependencies = ['Node'];\nexport var createParenthesisNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n Node\n } = _ref;\n\n /**\n * @constructor ParenthesisNode\n * @extends {Node}\n * A parenthesis node describes manual parenthesis from the user input\n * @param {Node} content\n * @extends {Node}\n */\n function ParenthesisNode(content) {\n if (!(this instanceof ParenthesisNode)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n } // validate input\n\n\n if (!isNode(content)) {\n throw new TypeError('Node expected for parameter \"content\"');\n }\n\n this.content = content;\n }\n\n ParenthesisNode.prototype = new Node();\n ParenthesisNode.prototype.type = 'ParenthesisNode';\n ParenthesisNode.prototype.isParenthesisNode = true;\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n\n ParenthesisNode.prototype._compile = function (math, argNames) {\n return this.content._compile(math, argNames);\n };\n /**\n * Get the content of the current Node.\n * @return {Node} content\n * @override\n **/\n\n\n ParenthesisNode.prototype.getContent = function () {\n return this.content.getContent();\n };\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n\n\n ParenthesisNode.prototype.forEach = function (callback) {\n callback(this.content, 'content', this);\n };\n /**\n * Create a new ParenthesisNode having it's childs be the results of calling\n * the provided callback function for each of the childs of the original node.\n * @param {function(child: Node, path: string, parent: Node) : Node} callback\n * @returns {ParenthesisNode} Returns a clone of the node\n */\n\n\n ParenthesisNode.prototype.map = function (callback) {\n var content = callback(this.content, 'content', this);\n return new ParenthesisNode(content);\n };\n /**\n * Create a clone of this node, a shallow copy\n * @return {ParenthesisNode}\n */\n\n\n ParenthesisNode.prototype.clone = function () {\n return new ParenthesisNode(this.content);\n };\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n\n\n ParenthesisNode.prototype._toString = function (options) {\n if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {\n return '(' + this.content.toString(options) + ')';\n }\n\n return this.content.toString(options);\n };\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n\n\n ParenthesisNode.prototype.toJSON = function () {\n return {\n mathjs: 'ParenthesisNode',\n content: this.content\n };\n };\n /**\n * Instantiate an ParenthesisNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"ParenthesisNode\", \"content\": ...}`,\n * where mathjs is optional\n * @returns {ParenthesisNode}\n */\n\n\n ParenthesisNode.fromJSON = function (json) {\n return new ParenthesisNode(json.content);\n };\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n\n\n ParenthesisNode.prototype.toHTML = function (options) {\n if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {\n return '(' + this.content.toHTML(options) + ')';\n }\n\n return this.content.toHTML(options);\n };\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n\n\n ParenthesisNode.prototype._toTex = function (options) {\n if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {\n return \"\\\\left(\".concat(this.content.toTex(options), \"\\\\right)\");\n }\n\n return this.content.toTex(options);\n };\n\n return ParenthesisNode;\n}, {\n isClass: true,\n isNode: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createRangeNode } from '../../factoriesAny.js';\nexport var RangeNodeDependencies = {\n NodeDependencies,\n createRangeNode\n};","import { isNode, isSymbolNode } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { getPrecedence } from '../operators.js';\nvar name = 'RangeNode';\nvar dependencies = ['Node'];\nexport var createRangeNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n Node\n } = _ref;\n\n /**\n * @constructor RangeNode\n * @extends {Node}\n * create a range\n * @param {Node} start included lower-bound\n * @param {Node} end included upper-bound\n * @param {Node} [step] optional step\n */\n function RangeNode(start, end, step) {\n if (!(this instanceof RangeNode)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n } // validate inputs\n\n\n if (!isNode(start)) throw new TypeError('Node expected');\n if (!isNode(end)) throw new TypeError('Node expected');\n if (step && !isNode(step)) throw new TypeError('Node expected');\n if (arguments.length > 3) throw new Error('Too many arguments');\n this.start = start; // included lower-bound\n\n this.end = end; // included upper-bound\n\n this.step = step || null; // optional step\n }\n\n RangeNode.prototype = new Node();\n RangeNode.prototype.type = 'RangeNode';\n RangeNode.prototype.isRangeNode = true;\n /**\n * Check whether the RangeNode needs the `end` symbol to be defined.\n * This end is the size of the Matrix in current dimension.\n * @return {boolean}\n */\n\n RangeNode.prototype.needsEnd = function () {\n // find all `end` symbols in this RangeNode\n var endSymbols = this.filter(function (node) {\n return isSymbolNode(node) && node.name === 'end';\n });\n return endSymbols.length > 0;\n };\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n\n\n RangeNode.prototype._compile = function (math, argNames) {\n var range = math.range;\n\n var evalStart = this.start._compile(math, argNames);\n\n var evalEnd = this.end._compile(math, argNames);\n\n if (this.step) {\n var evalStep = this.step._compile(math, argNames);\n\n return function evalRangeNode(scope, args, context) {\n return range(evalStart(scope, args, context), evalEnd(scope, args, context), evalStep(scope, args, context));\n };\n } else {\n return function evalRangeNode(scope, args, context) {\n return range(evalStart(scope, args, context), evalEnd(scope, args, context));\n };\n }\n };\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n\n\n RangeNode.prototype.forEach = function (callback) {\n callback(this.start, 'start', this);\n callback(this.end, 'end', this);\n\n if (this.step) {\n callback(this.step, 'step', this);\n }\n };\n /**\n * Create a new RangeNode having it's childs be the results of calling\n * the provided callback function for each of the childs of the original node.\n * @param {function(child: Node, path: string, parent: Node): Node} callback\n * @returns {RangeNode} Returns a transformed copy of the node\n */\n\n\n RangeNode.prototype.map = function (callback) {\n return new RangeNode(this._ifNode(callback(this.start, 'start', this)), this._ifNode(callback(this.end, 'end', this)), this.step && this._ifNode(callback(this.step, 'step', this)));\n };\n /**\n * Create a clone of this node, a shallow copy\n * @return {RangeNode}\n */\n\n\n RangeNode.prototype.clone = function () {\n return new RangeNode(this.start, this.end, this.step && this.step);\n };\n /**\n * Calculate the necessary parentheses\n * @param {Node} node\n * @param {string} parenthesis\n * @return {Object} parentheses\n * @private\n */\n\n\n function calculateNecessaryParentheses(node, parenthesis) {\n var precedence = getPrecedence(node, parenthesis);\n var parens = {};\n var startPrecedence = getPrecedence(node.start, parenthesis);\n parens.start = startPrecedence !== null && startPrecedence <= precedence || parenthesis === 'all';\n\n if (node.step) {\n var stepPrecedence = getPrecedence(node.step, parenthesis);\n parens.step = stepPrecedence !== null && stepPrecedence <= precedence || parenthesis === 'all';\n }\n\n var endPrecedence = getPrecedence(node.end, parenthesis);\n parens.end = endPrecedence !== null && endPrecedence <= precedence || parenthesis === 'all';\n return parens;\n }\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n RangeNode.prototype._toString = function (options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var parens = calculateNecessaryParentheses(this, parenthesis); // format string as start:step:stop\n\n var str;\n var start = this.start.toString(options);\n\n if (parens.start) {\n start = '(' + start + ')';\n }\n\n str = start;\n\n if (this.step) {\n var step = this.step.toString(options);\n\n if (parens.step) {\n step = '(' + step + ')';\n }\n\n str += ':' + step;\n }\n\n var end = this.end.toString(options);\n\n if (parens.end) {\n end = '(' + end + ')';\n }\n\n str += ':' + end;\n return str;\n };\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n\n\n RangeNode.prototype.toJSON = function () {\n return {\n mathjs: 'RangeNode',\n start: this.start,\n end: this.end,\n step: this.step\n };\n };\n /**\n * Instantiate an RangeNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"RangeNode\", \"start\": ..., \"end\": ..., \"step\": ...}`,\n * where mathjs is optional\n * @returns {RangeNode}\n */\n\n\n RangeNode.fromJSON = function (json) {\n return new RangeNode(json.start, json.end, json.step);\n };\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n RangeNode.prototype.toHTML = function (options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var parens = calculateNecessaryParentheses(this, parenthesis); // format string as start:step:stop\n\n var str;\n var start = this.start.toHTML(options);\n\n if (parens.start) {\n start = '(' + start + ')';\n }\n\n str = start;\n\n if (this.step) {\n var step = this.step.toHTML(options);\n\n if (parens.step) {\n step = '(' + step + ')';\n }\n\n str += ':' + step;\n }\n\n var end = this.end.toHTML(options);\n\n if (parens.end) {\n end = '(' + end + ')';\n }\n\n str += ':' + end;\n return str;\n };\n /**\n * Get LaTeX representation\n * @params {Object} options\n * @return {string} str\n */\n\n\n RangeNode.prototype._toTex = function (options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var parens = calculateNecessaryParentheses(this, parenthesis);\n var str = this.start.toTex(options);\n\n if (parens.start) {\n str = \"\\\\left(\".concat(str, \"\\\\right)\");\n }\n\n if (this.step) {\n var step = this.step.toTex(options);\n\n if (parens.step) {\n step = \"\\\\left(\".concat(step, \"\\\\right)\");\n }\n\n str += ':' + step;\n }\n\n var end = this.end.toTex(options);\n\n if (parens.end) {\n end = \"\\\\left(\".concat(end, \"\\\\right)\");\n }\n\n str += ':' + end;\n return str;\n };\n\n return RangeNode;\n}, {\n isClass: true,\n isNode: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createRelationalNode } from '../../factoriesAny.js';\nexport var RelationalNodeDependencies = {\n NodeDependencies,\n createRelationalNode\n};","import { getPrecedence } from '../operators.js';\nimport { escape } from '../../utils/string.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { latexOperators } from '../../utils/latex.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'RelationalNode';\nvar dependencies = ['Node'];\nexport var createRelationalNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n Node\n } = _ref;\n\n /**\n * A node representing a chained conditional expression, such as 'x > y > z'\n *\n * @param {String[]} conditionals An array of conditional operators used to compare the parameters\n * @param {Node[]} params The parameters that will be compared\n *\n * @constructor RelationalNode\n * @extends {Node}\n */\n function RelationalNode(conditionals, params) {\n if (!(this instanceof RelationalNode)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n\n if (!Array.isArray(conditionals)) throw new TypeError('Parameter conditionals must be an array');\n if (!Array.isArray(params)) throw new TypeError('Parameter params must be an array');\n if (conditionals.length !== params.length - 1) throw new TypeError('Parameter params must contain exactly one more element than parameter conditionals');\n this.conditionals = conditionals;\n this.params = params;\n }\n\n RelationalNode.prototype = new Node();\n RelationalNode.prototype.type = 'RelationalNode';\n RelationalNode.prototype.isRelationalNode = true;\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n\n RelationalNode.prototype._compile = function (math, argNames) {\n var self = this;\n var compiled = this.params.map(p => p._compile(math, argNames));\n return function evalRelationalNode(scope, args, context) {\n var evalLhs;\n var evalRhs = compiled[0](scope, args, context);\n\n for (var i = 0; i < self.conditionals.length; i++) {\n evalLhs = evalRhs;\n evalRhs = compiled[i + 1](scope, args, context);\n var condFn = getSafeProperty(math, self.conditionals[i]);\n\n if (!condFn(evalLhs, evalRhs)) {\n return false;\n }\n }\n\n return true;\n };\n };\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n\n\n RelationalNode.prototype.forEach = function (callback) {\n this.params.forEach((n, i) => callback(n, 'params[' + i + ']', this), this);\n };\n /**\n * Create a new RelationalNode having its childs be the results of calling\n * the provided callback function for each of the childs of the original node.\n * @param {function(child: Node, path: string, parent: Node): Node} callback\n * @returns {RelationalNode} Returns a transformed copy of the node\n */\n\n\n RelationalNode.prototype.map = function (callback) {\n return new RelationalNode(this.conditionals.slice(), this.params.map((n, i) => this._ifNode(callback(n, 'params[' + i + ']', this)), this));\n };\n /**\n * Create a clone of this node, a shallow copy\n * @return {RelationalNode}\n */\n\n\n RelationalNode.prototype.clone = function () {\n return new RelationalNode(this.conditionals, this.params);\n };\n /**\n * Get string representation.\n * @param {Object} options\n * @return {string} str\n */\n\n\n RelationalNode.prototype._toString = function (options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var precedence = getPrecedence(this, parenthesis);\n var paramStrings = this.params.map(function (p, index) {\n var paramPrecedence = getPrecedence(p, parenthesis);\n return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '(' + p.toString(options) + ')' : p.toString(options);\n });\n var operatorMap = {\n equal: '==',\n unequal: '!=',\n smaller: '<',\n larger: '>',\n smallerEq: '<=',\n largerEq: '>='\n };\n var ret = paramStrings[0];\n\n for (var i = 0; i < this.conditionals.length; i++) {\n ret += ' ' + operatorMap[this.conditionals[i]] + ' ' + paramStrings[i + 1];\n }\n\n return ret;\n };\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n\n\n RelationalNode.prototype.toJSON = function () {\n return {\n mathjs: 'RelationalNode',\n conditionals: this.conditionals,\n params: this.params\n };\n };\n /**\n * Instantiate a RelationalNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"RelationalNode\", \"condition\": ..., \"trueExpr\": ..., \"falseExpr\": ...}`,\n * where mathjs is optional\n * @returns {RelationalNode}\n */\n\n\n RelationalNode.fromJSON = function (json) {\n return new RelationalNode(json.conditionals, json.params);\n };\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n RelationalNode.prototype.toHTML = function (options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var precedence = getPrecedence(this, parenthesis);\n var paramStrings = this.params.map(function (p, index) {\n var paramPrecedence = getPrecedence(p, parenthesis);\n return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '(' + p.toHTML(options) + ')' : p.toHTML(options);\n });\n var operatorMap = {\n equal: '==',\n unequal: '!=',\n smaller: '<',\n larger: '>',\n smallerEq: '<=',\n largerEq: '>='\n };\n var ret = paramStrings[0];\n\n for (var i = 0; i < this.conditionals.length; i++) {\n ret += '' + escape(operatorMap[this.conditionals[i]]) + '' + paramStrings[i + 1];\n }\n\n return ret;\n };\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n\n\n RelationalNode.prototype._toTex = function (options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var precedence = getPrecedence(this, parenthesis);\n var paramStrings = this.params.map(function (p, index) {\n var paramPrecedence = getPrecedence(p, parenthesis);\n return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '\\\\left(' + p.toTex(options) + '\\right)' : p.toTex(options);\n });\n var ret = paramStrings[0];\n\n for (var i = 0; i < this.conditionals.length; i++) {\n ret += latexOperators[this.conditionals[i]] + paramStrings[i + 1];\n }\n\n return ret;\n };\n\n return RelationalNode;\n}, {\n isClass: true,\n isNode: true\n});","import _extends from \"@babel/runtime/helpers/extends\";\nimport { factory } from '../utils/factory.js';\nimport { isAccessorNode, isConstantNode, isFunctionNode, isOperatorNode, isSymbolNode } from '../utils/is.js';\nimport { deepMap } from '../utils/collection.js';\nimport { hasOwnProperty } from '../utils/object.js';\nvar name = 'parse';\nvar dependencies = ['typed', 'numeric', 'config', 'AccessorNode', 'ArrayNode', 'AssignmentNode', 'BlockNode', 'ConditionalNode', 'ConstantNode', 'FunctionAssignmentNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'RangeNode', 'RelationalNode', 'SymbolNode'];\nexport var createParse = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n numeric,\n config,\n AccessorNode,\n ArrayNode,\n AssignmentNode,\n BlockNode,\n ConditionalNode,\n ConstantNode,\n FunctionAssignmentNode,\n FunctionNode,\n IndexNode,\n ObjectNode,\n OperatorNode,\n ParenthesisNode,\n RangeNode,\n RelationalNode,\n SymbolNode\n } = _ref;\n\n /**\n * Parse an expression. Returns a node tree, which can be evaluated by\n * invoking node.evaluate().\n *\n * Note the evaluating arbitrary expressions may involve security risks,\n * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.\n *\n * Syntax:\n *\n * math.parse(expr)\n * math.parse(expr, options)\n * math.parse([expr1, expr2, expr3, ...])\n * math.parse([expr1, expr2, expr3, ...], options)\n *\n * Example:\n *\n * const node1 = math.parse('sqrt(3^2 + 4^2)')\n * node1.compile().evaluate() // 5\n *\n * let scope = {a:3, b:4}\n * const node2 = math.parse('a * b') // 12\n * const code2 = node2.compile()\n * code2.evaluate(scope) // 12\n * scope.a = 5\n * code2.evaluate(scope) // 20\n *\n * const nodes = math.parse(['a = 3', 'b = 4', 'a * b'])\n * nodes[2].compile().evaluate() // 12\n *\n * See also:\n *\n * evaluate, compile\n *\n * @param {string | string[] | Matrix} expr Expression to be parsed\n * @param {{nodes: Object<string, Node>}} [options] Available options:\n * - `nodes` a set of custom nodes\n * @return {Node | Node[]} node\n * @throws {Error}\n */\n var parse = typed(name, {\n string: function string(expression) {\n return parseStart(expression, {});\n },\n 'Array | Matrix': function ArrayMatrix(expressions) {\n return parseMultiple(expressions, {});\n },\n 'string, Object': function stringObject(expression, options) {\n var extraNodes = options.nodes !== undefined ? options.nodes : {};\n return parseStart(expression, extraNodes);\n },\n 'Array | Matrix, Object': parseMultiple\n });\n\n function parseMultiple(expressions) {\n var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n var extraNodes = options.nodes !== undefined ? options.nodes : {}; // parse an array or matrix with expressions\n\n return deepMap(expressions, function (elem) {\n if (typeof elem !== 'string') throw new TypeError('String expected');\n return parseStart(elem, extraNodes);\n });\n } // token types enumeration\n\n\n var TOKENTYPE = {\n NULL: 0,\n DELIMITER: 1,\n NUMBER: 2,\n SYMBOL: 3,\n UNKNOWN: 4\n }; // map with all delimiters\n\n var DELIMITERS = {\n ',': true,\n '(': true,\n ')': true,\n '[': true,\n ']': true,\n '{': true,\n '}': true,\n '\"': true,\n '\\'': true,\n ';': true,\n '+': true,\n '-': true,\n '*': true,\n '.*': true,\n '/': true,\n './': true,\n '%': true,\n '^': true,\n '.^': true,\n '~': true,\n '!': true,\n '&': true,\n '|': true,\n '^|': true,\n '=': true,\n ':': true,\n '?': true,\n '==': true,\n '!=': true,\n '<': true,\n '>': true,\n '<=': true,\n '>=': true,\n '<<': true,\n '>>': true,\n '>>>': true\n }; // map with all named delimiters\n\n var NAMED_DELIMITERS = {\n mod: true,\n to: true,\n in: true,\n and: true,\n xor: true,\n or: true,\n not: true\n };\n var CONSTANTS = {\n true: true,\n false: false,\n null: null,\n undefined: undefined\n };\n var NUMERIC_CONSTANTS = ['NaN', 'Infinity'];\n\n function initialState() {\n return {\n extraNodes: {},\n // current extra nodes, must be careful not to mutate\n expression: '',\n // current expression\n comment: '',\n // last parsed comment\n index: 0,\n // current index in expr\n token: '',\n // current token\n tokenType: TOKENTYPE.NULL,\n // type of the token\n nestingLevel: 0,\n // level of nesting inside parameters, used to ignore newline characters\n conditionalLevel: null // when a conditional is being parsed, the level of the conditional is stored here\n\n };\n }\n /**\n * View upto `length` characters of the expression starting at the current character.\n *\n * @param {Object} state\n * @param {number} [length=1] Number of characters to view\n * @returns {string}\n * @private\n */\n\n\n function currentString(state, length) {\n return state.expression.substr(state.index, length);\n }\n /**\n * View the current character. Returns '' if end of expression is reached.\n *\n * @param {Object} state\n * @returns {string}\n * @private\n */\n\n\n function currentCharacter(state) {\n return currentString(state, 1);\n }\n /**\n * Get the next character from the expression.\n * The character is stored into the char c. If the end of the expression is\n * reached, the function puts an empty string in c.\n * @private\n */\n\n\n function next(state) {\n state.index++;\n }\n /**\n * Preview the previous character from the expression.\n * @return {string} cNext\n * @private\n */\n\n\n function prevCharacter(state) {\n return state.expression.charAt(state.index - 1);\n }\n /**\n * Preview the next character from the expression.\n * @return {string} cNext\n * @private\n */\n\n\n function nextCharacter(state) {\n return state.expression.charAt(state.index + 1);\n }\n /**\n * Get next token in the current string expr.\n * The token and token type are available as token and tokenType\n * @private\n */\n\n\n function getToken(state) {\n state.tokenType = TOKENTYPE.NULL;\n state.token = '';\n state.comment = ''; // skip over whitespaces\n // space, tab, and newline when inside parameters\n\n while (parse.isWhitespace(currentCharacter(state), state.nestingLevel)) {\n next(state);\n } // skip comment\n\n\n if (currentCharacter(state) === '#') {\n while (currentCharacter(state) !== '\\n' && currentCharacter(state) !== '') {\n state.comment += currentCharacter(state);\n next(state);\n }\n } // check for end of expression\n\n\n if (currentCharacter(state) === '') {\n // token is still empty\n state.tokenType = TOKENTYPE.DELIMITER;\n return;\n } // check for new line character\n\n\n if (currentCharacter(state) === '\\n' && !state.nestingLevel) {\n state.tokenType = TOKENTYPE.DELIMITER;\n state.token = currentCharacter(state);\n next(state);\n return;\n }\n\n var c1 = currentCharacter(state);\n var c2 = currentString(state, 2);\n var c3 = currentString(state, 3);\n\n if (c3.length === 3 && DELIMITERS[c3]) {\n state.tokenType = TOKENTYPE.DELIMITER;\n state.token = c3;\n next(state);\n next(state);\n next(state);\n return;\n } // check for delimiters consisting of 2 characters\n\n\n if (c2.length === 2 && DELIMITERS[c2]) {\n state.tokenType = TOKENTYPE.DELIMITER;\n state.token = c2;\n next(state);\n next(state);\n return;\n } // check for delimiters consisting of 1 character\n\n\n if (DELIMITERS[c1]) {\n state.tokenType = TOKENTYPE.DELIMITER;\n state.token = c1;\n next(state);\n return;\n } // check for a number\n\n\n if (parse.isDigitDot(c1)) {\n state.tokenType = TOKENTYPE.NUMBER; // check for binary, octal, or hex\n\n var _c = currentString(state, 2);\n\n if (_c === '0b' || _c === '0o' || _c === '0x') {\n state.token += currentCharacter(state);\n next(state);\n state.token += currentCharacter(state);\n next(state);\n\n while (parse.isHexDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n\n if (currentCharacter(state) === '.') {\n // this number has a radix point\n state.token += '.';\n next(state); // get the digits after the radix\n\n while (parse.isHexDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n } else if (currentCharacter(state) === 'i') {\n // this number has a word size suffix\n state.token += 'i';\n next(state); // get the word size\n\n while (parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n }\n\n return;\n } // get number, can have a single dot\n\n\n if (currentCharacter(state) === '.') {\n state.token += currentCharacter(state);\n next(state);\n\n if (!parse.isDigit(currentCharacter(state))) {\n // this is no number, it is just a dot (can be dot notation)\n state.tokenType = TOKENTYPE.DELIMITER;\n return;\n }\n } else {\n while (parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n\n if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n }\n\n while (parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n } // check for exponential notation like \"2.3e-4\", \"1.23e50\" or \"2e+4\"\n\n\n if (currentCharacter(state) === 'E' || currentCharacter(state) === 'e') {\n if (parse.isDigit(nextCharacter(state)) || nextCharacter(state) === '-' || nextCharacter(state) === '+') {\n state.token += currentCharacter(state);\n next(state);\n\n if (currentCharacter(state) === '+' || currentCharacter(state) === '-') {\n state.token += currentCharacter(state);\n next(state);\n } // Scientific notation MUST be followed by an exponent\n\n\n if (!parse.isDigit(currentCharacter(state))) {\n throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"');\n }\n\n while (parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n\n if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {\n throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"');\n }\n } else if (nextCharacter(state) === '.') {\n next(state);\n throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"');\n }\n }\n\n return;\n } // check for variables, functions, named operators\n\n\n if (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state))) {\n while (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n\n if (hasOwnProperty(NAMED_DELIMITERS, state.token)) {\n state.tokenType = TOKENTYPE.DELIMITER;\n } else {\n state.tokenType = TOKENTYPE.SYMBOL;\n }\n\n return;\n } // something unknown is found, wrong characters -> a syntax error\n\n\n state.tokenType = TOKENTYPE.UNKNOWN;\n\n while (currentCharacter(state) !== '') {\n state.token += currentCharacter(state);\n next(state);\n }\n\n throw createSyntaxError(state, 'Syntax error in part \"' + state.token + '\"');\n }\n /**\n * Get next token and skip newline tokens\n */\n\n\n function getTokenSkipNewline(state) {\n do {\n getToken(state);\n } while (state.token === '\\n'); // eslint-disable-line no-unmodified-loop-condition\n\n }\n /**\n * Open parameters.\n * New line characters will be ignored until closeParams(state) is called\n */\n\n\n function openParams(state) {\n state.nestingLevel++;\n }\n /**\n * Close parameters.\n * New line characters will no longer be ignored\n */\n\n\n function closeParams(state) {\n state.nestingLevel--;\n }\n /**\n * Checks whether the current character `c` is a valid alpha character:\n *\n * - A latin letter (upper or lower case) Ascii: a-z, A-Z\n * - An underscore Ascii: _\n * - A dollar sign Ascii: $\n * - A latin letter with accents Unicode: \\u00C0 - \\u02AF\n * - A greek letter Unicode: \\u0370 - \\u03FF\n * - A mathematical alphanumeric symbol Unicode: \\u{1D400} - \\u{1D7FF} excluding invalid code points\n *\n * The previous and next characters are needed to determine whether\n * this character is part of a unicode surrogate pair.\n *\n * @param {string} c Current character in the expression\n * @param {string} cPrev Previous character\n * @param {string} cNext Next character\n * @return {boolean}\n */\n\n\n parse.isAlpha = function isAlpha(c, cPrev, cNext) {\n return parse.isValidLatinOrGreek(c) || parse.isValidMathSymbol(c, cNext) || parse.isValidMathSymbol(cPrev, c);\n };\n /**\n * Test whether a character is a valid latin, greek, or letter-like character\n * @param {string} c\n * @return {boolean}\n */\n\n\n parse.isValidLatinOrGreek = function isValidLatinOrGreek(c) {\n return /^[a-zA-Z_$\\u00C0-\\u02AF\\u0370-\\u03FF\\u2100-\\u214F]$/.test(c);\n };\n /**\n * Test whether two given 16 bit characters form a surrogate pair of a\n * unicode math symbol.\n *\n * https://unicode-table.com/en/\n * https://www.wikiwand.com/en/Mathematical_operators_and_symbols_in_Unicode\n *\n * Note: In ES6 will be unicode aware:\n * https://stackoverflow.com/questions/280712/javascript-unicode-regexes\n * https://mathiasbynens.be/notes/es6-unicode-regex\n *\n * @param {string} high\n * @param {string} low\n * @return {boolean}\n */\n\n\n parse.isValidMathSymbol = function isValidMathSymbol(high, low) {\n return /^[\\uD835]$/.test(high) && /^[\\uDC00-\\uDFFF]$/.test(low) && /^[^\\uDC55\\uDC9D\\uDCA0\\uDCA1\\uDCA3\\uDCA4\\uDCA7\\uDCA8\\uDCAD\\uDCBA\\uDCBC\\uDCC4\\uDD06\\uDD0B\\uDD0C\\uDD15\\uDD1D\\uDD3A\\uDD3F\\uDD45\\uDD47-\\uDD49\\uDD51\\uDEA6\\uDEA7\\uDFCC\\uDFCD]$/.test(low);\n };\n /**\n * Check whether given character c is a white space character: space, tab, or enter\n * @param {string} c\n * @param {number} nestingLevel\n * @return {boolean}\n */\n\n\n parse.isWhitespace = function isWhitespace(c, nestingLevel) {\n // TODO: also take '\\r' carriage return as newline? Or does that give problems on mac?\n return c === ' ' || c === '\\t' || c === '\\n' && nestingLevel > 0;\n };\n /**\n * Test whether the character c is a decimal mark (dot).\n * This is the case when it's not the start of a delimiter '.*', './', or '.^'\n * @param {string} c\n * @param {string} cNext\n * @return {boolean}\n */\n\n\n parse.isDecimalMark = function isDecimalMark(c, cNext) {\n return c === '.' && cNext !== '/' && cNext !== '*' && cNext !== '^';\n };\n /**\n * checks if the given char c is a digit or dot\n * @param {string} c a string with one character\n * @return {boolean}\n */\n\n\n parse.isDigitDot = function isDigitDot(c) {\n return c >= '0' && c <= '9' || c === '.';\n };\n /**\n * checks if the given char c is a digit\n * @param {string} c a string with one character\n * @return {boolean}\n */\n\n\n parse.isDigit = function isDigit(c) {\n return c >= '0' && c <= '9';\n };\n /**\n * checks if the given char c is a hex digit\n * @param {string} c a string with one character\n * @return {boolean}\n */\n\n\n parse.isHexDigit = function isHexDigit(c) {\n return c >= '0' && c <= '9' || c >= 'a' && c <= 'f' || c >= 'A' && c <= 'F';\n };\n /**\n * Start of the parse levels below, in order of precedence\n * @return {Node} node\n * @private\n */\n\n\n function parseStart(expression, extraNodes) {\n var state = initialState();\n\n _extends(state, {\n expression,\n extraNodes\n });\n\n getToken(state);\n var node = parseBlock(state); // check for garbage at the end of the expression\n // an expression ends with a empty character '' and tokenType DELIMITER\n\n if (state.token !== '') {\n if (state.tokenType === TOKENTYPE.DELIMITER) {\n // user entered a not existing operator like \"//\"\n // TODO: give hints for aliases, for example with \"<>\" give as hint \" did you mean !== ?\"\n throw createError(state, 'Unexpected operator ' + state.token);\n } else {\n throw createSyntaxError(state, 'Unexpected part \"' + state.token + '\"');\n }\n }\n\n return node;\n }\n /**\n * Parse a block with expressions. Expressions can be separated by a newline\n * character '\\n', or by a semicolon ';'. In case of a semicolon, no output\n * of the preceding line is returned.\n * @return {Node} node\n * @private\n */\n\n\n function parseBlock(state) {\n var node;\n var blocks = [];\n var visible;\n\n if (state.token !== '' && state.token !== '\\n' && state.token !== ';') {\n node = parseAssignment(state);\n node.comment = state.comment;\n } // TODO: simplify this loop\n\n\n while (state.token === '\\n' || state.token === ';') {\n // eslint-disable-line no-unmodified-loop-condition\n if (blocks.length === 0 && node) {\n visible = state.token !== ';';\n blocks.push({\n node: node,\n visible: visible\n });\n }\n\n getToken(state);\n\n if (state.token !== '\\n' && state.token !== ';' && state.token !== '') {\n node = parseAssignment(state);\n node.comment = state.comment;\n visible = state.token !== ';';\n blocks.push({\n node: node,\n visible: visible\n });\n }\n }\n\n if (blocks.length > 0) {\n return new BlockNode(blocks);\n } else {\n if (!node) {\n node = new ConstantNode(undefined);\n node.comment = state.comment;\n }\n\n return node;\n }\n }\n /**\n * Assignment of a function or variable,\n * - can be a variable like 'a=2.3'\n * - or a updating an existing variable like 'matrix(2,3:5)=[6,7,8]'\n * - defining a function like 'f(x) = x^2'\n * @return {Node} node\n * @private\n */\n\n\n function parseAssignment(state) {\n var name, args, value, valid;\n var node = parseConditional(state);\n\n if (state.token === '=') {\n if (isSymbolNode(node)) {\n // parse a variable assignment like 'a = 2/3'\n name = node.name;\n getTokenSkipNewline(state);\n value = parseAssignment(state);\n return new AssignmentNode(new SymbolNode(name), value);\n } else if (isAccessorNode(node)) {\n // parse a matrix subset assignment like 'A[1,2] = 4'\n getTokenSkipNewline(state);\n value = parseAssignment(state);\n return new AssignmentNode(node.object, node.index, value);\n } else if (isFunctionNode(node) && isSymbolNode(node.fn)) {\n // parse function assignment like 'f(x) = x^2'\n valid = true;\n args = [];\n name = node.name;\n node.args.forEach(function (arg, index) {\n if (isSymbolNode(arg)) {\n args[index] = arg.name;\n } else {\n valid = false;\n }\n });\n\n if (valid) {\n getTokenSkipNewline(state);\n value = parseAssignment(state);\n return new FunctionAssignmentNode(name, args, value);\n }\n }\n\n throw createSyntaxError(state, 'Invalid left hand side of assignment operator =');\n }\n\n return node;\n }\n /**\n * conditional operation\n *\n * condition ? truePart : falsePart\n *\n * Note: conditional operator is right-associative\n *\n * @return {Node} node\n * @private\n */\n\n\n function parseConditional(state) {\n var node = parseLogicalOr(state);\n\n while (state.token === '?') {\n // eslint-disable-line no-unmodified-loop-condition\n // set a conditional level, the range operator will be ignored as long\n // as conditionalLevel === state.nestingLevel.\n var prev = state.conditionalLevel;\n state.conditionalLevel = state.nestingLevel;\n getTokenSkipNewline(state);\n var condition = node;\n var trueExpr = parseAssignment(state);\n if (state.token !== ':') throw createSyntaxError(state, 'False part of conditional expression expected');\n state.conditionalLevel = null;\n getTokenSkipNewline(state);\n var falseExpr = parseAssignment(state); // Note: check for conditional operator again, right associativity\n\n node = new ConditionalNode(condition, trueExpr, falseExpr); // restore the previous conditional level\n\n state.conditionalLevel = prev;\n }\n\n return node;\n }\n /**\n * logical or, 'x or y'\n * @return {Node} node\n * @private\n */\n\n\n function parseLogicalOr(state) {\n var node = parseLogicalXor(state);\n\n while (state.token === 'or') {\n // eslint-disable-line no-unmodified-loop-condition\n getTokenSkipNewline(state);\n node = new OperatorNode('or', 'or', [node, parseLogicalXor(state)]);\n }\n\n return node;\n }\n /**\n * logical exclusive or, 'x xor y'\n * @return {Node} node\n * @private\n */\n\n\n function parseLogicalXor(state) {\n var node = parseLogicalAnd(state);\n\n while (state.token === 'xor') {\n // eslint-disable-line no-unmodified-loop-condition\n getTokenSkipNewline(state);\n node = new OperatorNode('xor', 'xor', [node, parseLogicalAnd(state)]);\n }\n\n return node;\n }\n /**\n * logical and, 'x and y'\n * @return {Node} node\n * @private\n */\n\n\n function parseLogicalAnd(state) {\n var node = parseBitwiseOr(state);\n\n while (state.token === 'and') {\n // eslint-disable-line no-unmodified-loop-condition\n getTokenSkipNewline(state);\n node = new OperatorNode('and', 'and', [node, parseBitwiseOr(state)]);\n }\n\n return node;\n }\n /**\n * bitwise or, 'x | y'\n * @return {Node} node\n * @private\n */\n\n\n function parseBitwiseOr(state) {\n var node = parseBitwiseXor(state);\n\n while (state.token === '|') {\n // eslint-disable-line no-unmodified-loop-condition\n getTokenSkipNewline(state);\n node = new OperatorNode('|', 'bitOr', [node, parseBitwiseXor(state)]);\n }\n\n return node;\n }\n /**\n * bitwise exclusive or (xor), 'x ^| y'\n * @return {Node} node\n * @private\n */\n\n\n function parseBitwiseXor(state) {\n var node = parseBitwiseAnd(state);\n\n while (state.token === '^|') {\n // eslint-disable-line no-unmodified-loop-condition\n getTokenSkipNewline(state);\n node = new OperatorNode('^|', 'bitXor', [node, parseBitwiseAnd(state)]);\n }\n\n return node;\n }\n /**\n * bitwise and, 'x & y'\n * @return {Node} node\n * @private\n */\n\n\n function parseBitwiseAnd(state) {\n var node = parseRelational(state);\n\n while (state.token === '&') {\n // eslint-disable-line no-unmodified-loop-condition\n getTokenSkipNewline(state);\n node = new OperatorNode('&', 'bitAnd', [node, parseRelational(state)]);\n }\n\n return node;\n }\n /**\n * Parse a chained conditional, like 'a > b >= c'\n * @return {Node} node\n */\n\n\n function parseRelational(state) {\n var params = [parseShift(state)];\n var conditionals = [];\n var operators = {\n '==': 'equal',\n '!=': 'unequal',\n '<': 'smaller',\n '>': 'larger',\n '<=': 'smallerEq',\n '>=': 'largerEq'\n };\n\n while (hasOwnProperty(operators, state.token)) {\n // eslint-disable-line no-unmodified-loop-condition\n var cond = {\n name: state.token,\n fn: operators[state.token]\n };\n conditionals.push(cond);\n getTokenSkipNewline(state);\n params.push(parseShift(state));\n }\n\n if (params.length === 1) {\n return params[0];\n } else if (params.length === 2) {\n return new OperatorNode(conditionals[0].name, conditionals[0].fn, params);\n } else {\n return new RelationalNode(conditionals.map(c => c.fn), params);\n }\n }\n /**\n * Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift\n * @return {Node} node\n * @private\n */\n\n\n function parseShift(state) {\n var node, name, fn, params;\n node = parseConversion(state);\n var operators = {\n '<<': 'leftShift',\n '>>': 'rightArithShift',\n '>>>': 'rightLogShift'\n };\n\n while (hasOwnProperty(operators, state.token)) {\n name = state.token;\n fn = operators[name];\n getTokenSkipNewline(state);\n params = [node, parseConversion(state)];\n node = new OperatorNode(name, fn, params);\n }\n\n return node;\n }\n /**\n * conversion operators 'to' and 'in'\n * @return {Node} node\n * @private\n */\n\n\n function parseConversion(state) {\n var node, name, fn, params;\n node = parseRange(state);\n var operators = {\n to: 'to',\n in: 'to' // alias of 'to'\n\n };\n\n while (hasOwnProperty(operators, state.token)) {\n name = state.token;\n fn = operators[name];\n getTokenSkipNewline(state);\n\n if (name === 'in' && state.token === '') {\n // end of expression -> this is the unit 'in' ('inch')\n node = new OperatorNode('*', 'multiply', [node, new SymbolNode('in')], true);\n } else {\n // operator 'a to b' or 'a in b'\n params = [node, parseRange(state)];\n node = new OperatorNode(name, fn, params);\n }\n }\n\n return node;\n }\n /**\n * parse range, \"start:end\", \"start:step:end\", \":\", \"start:\", \":end\", etc\n * @return {Node} node\n * @private\n */\n\n\n function parseRange(state) {\n var node;\n var params = [];\n\n if (state.token === ':') {\n // implicit start=1 (one-based)\n node = new ConstantNode(1);\n } else {\n // explicit start\n node = parseAddSubtract(state);\n }\n\n if (state.token === ':' && state.conditionalLevel !== state.nestingLevel) {\n // we ignore the range operator when a conditional operator is being processed on the same level\n params.push(node); // parse step and end\n\n while (state.token === ':' && params.length < 3) {\n // eslint-disable-line no-unmodified-loop-condition\n getTokenSkipNewline(state);\n\n if (state.token === ')' || state.token === ']' || state.token === ',' || state.token === '') {\n // implicit end\n params.push(new SymbolNode('end'));\n } else {\n // explicit end\n params.push(parseAddSubtract(state));\n }\n }\n\n if (params.length === 3) {\n // params = [start, step, end]\n node = new RangeNode(params[0], params[2], params[1]); // start, end, step\n } else {\n // length === 2\n // params = [start, end]\n node = new RangeNode(params[0], params[1]); // start, end\n }\n }\n\n return node;\n }\n /**\n * add or subtract\n * @return {Node} node\n * @private\n */\n\n\n function parseAddSubtract(state) {\n var node, name, fn, params;\n node = parseMultiplyDivide(state);\n var operators = {\n '+': 'add',\n '-': 'subtract'\n };\n\n while (hasOwnProperty(operators, state.token)) {\n name = state.token;\n fn = operators[name];\n getTokenSkipNewline(state);\n var rightNode = parseMultiplyDivide(state);\n\n if (rightNode.isPercentage) {\n params = [node, new OperatorNode('*', 'multiply', [node, rightNode])];\n } else {\n params = [node, rightNode];\n }\n\n node = new OperatorNode(name, fn, params);\n }\n\n return node;\n }\n /**\n * multiply, divide, modulus\n * @return {Node} node\n * @private\n */\n\n\n function parseMultiplyDivide(state) {\n var node, last, name, fn;\n node = parseImplicitMultiplication(state);\n last = node;\n var operators = {\n '*': 'multiply',\n '.*': 'dotMultiply',\n '/': 'divide',\n './': 'dotDivide'\n };\n\n while (true) {\n if (hasOwnProperty(operators, state.token)) {\n // explicit operators\n name = state.token;\n fn = operators[name];\n getTokenSkipNewline(state);\n last = parseImplicitMultiplication(state);\n node = new OperatorNode(name, fn, [node, last]);\n } else {\n break;\n }\n }\n\n return node;\n }\n /**\n * implicit multiplication\n * @return {Node} node\n * @private\n */\n\n\n function parseImplicitMultiplication(state) {\n var node, last;\n node = parseRule2(state);\n last = node;\n\n while (true) {\n if (state.tokenType === TOKENTYPE.SYMBOL || state.token === 'in' && isConstantNode(node) || state.tokenType === TOKENTYPE.NUMBER && !isConstantNode(last) && (!isOperatorNode(last) || last.op === '!') || state.token === '(') {\n // parse implicit multiplication\n //\n // symbol: implicit multiplication like '2a', '(2+3)a', 'a b'\n // number: implicit multiplication like '(2+3)2'\n // parenthesis: implicit multiplication like '2(3+4)', '(3+4)(1+2)'\n last = parseRule2(state);\n node = new OperatorNode('*', 'multiply', [node, last], true\n /* implicit */\n );\n } else {\n break;\n }\n }\n\n return node;\n }\n /**\n * Infamous \"rule 2\" as described in https://github.com/josdejong/mathjs/issues/792#issuecomment-361065370\n * Explicit division gets higher precedence than implicit multiplication\n * when the division matches this pattern: [number] / [number] [symbol]\n * @return {Node} node\n * @private\n */\n\n\n function parseRule2(state) {\n var node = parsePercentage(state);\n var last = node;\n var tokenStates = [];\n\n while (true) {\n // Match the \"number /\" part of the pattern \"number / number symbol\"\n if (state.token === '/' && isConstantNode(last)) {\n // Look ahead to see if the next token is a number\n tokenStates.push(_extends({}, state));\n getTokenSkipNewline(state); // Match the \"number / number\" part of the pattern\n\n if (state.tokenType === TOKENTYPE.NUMBER) {\n // Look ahead again\n tokenStates.push(_extends({}, state));\n getTokenSkipNewline(state); // Match the \"symbol\" part of the pattern, or a left parenthesis\n\n if (state.tokenType === TOKENTYPE.SYMBOL || state.token === '(') {\n // We've matched the pattern \"number / number symbol\".\n // Rewind once and build the \"number / number\" node; the symbol will be consumed later\n _extends(state, tokenStates.pop());\n\n tokenStates.pop();\n last = parsePercentage(state);\n node = new OperatorNode('/', 'divide', [node, last]);\n } else {\n // Not a match, so rewind\n tokenStates.pop();\n\n _extends(state, tokenStates.pop());\n\n break;\n }\n } else {\n // Not a match, so rewind\n _extends(state, tokenStates.pop());\n\n break;\n }\n } else {\n break;\n }\n }\n\n return node;\n }\n /**\n * percentage or mod\n * @return {Node} node\n * @private\n */\n\n\n function parsePercentage(state) {\n var node, name, fn, params;\n node = parseUnary(state);\n var operators = {\n '%': 'mod',\n mod: 'mod'\n };\n\n while (hasOwnProperty(operators, state.token)) {\n name = state.token;\n fn = operators[name];\n getTokenSkipNewline(state);\n\n if (name === '%' && state.tokenType === TOKENTYPE.DELIMITER && state.token !== '(') {\n // If the expression contains only %, then treat that as /100\n node = new OperatorNode('/', 'divide', [node, new ConstantNode(100)], false, true);\n } else {\n params = [node, parseUnary(state)];\n node = new OperatorNode(name, fn, params);\n }\n }\n\n return node;\n }\n /**\n * Unary plus and minus, and logical and bitwise not\n * @return {Node} node\n * @private\n */\n\n\n function parseUnary(state) {\n var name, params, fn;\n var operators = {\n '-': 'unaryMinus',\n '+': 'unaryPlus',\n '~': 'bitNot',\n not: 'not'\n };\n\n if (hasOwnProperty(operators, state.token)) {\n fn = operators[state.token];\n name = state.token;\n getTokenSkipNewline(state);\n params = [parseUnary(state)];\n return new OperatorNode(name, fn, params);\n }\n\n return parsePow(state);\n }\n /**\n * power\n * Note: power operator is right associative\n * @return {Node} node\n * @private\n */\n\n\n function parsePow(state) {\n var node, name, fn, params;\n node = parseLeftHandOperators(state);\n\n if (state.token === '^' || state.token === '.^') {\n name = state.token;\n fn = name === '^' ? 'pow' : 'dotPow';\n getTokenSkipNewline(state);\n params = [node, parseUnary(state)]; // Go back to unary, we can have '2^-3'\n\n node = new OperatorNode(name, fn, params);\n }\n\n return node;\n }\n /**\n * Left hand operators: factorial x!, ctranspose x'\n * @return {Node} node\n * @private\n */\n\n\n function parseLeftHandOperators(state) {\n var node, name, fn, params;\n node = parseCustomNodes(state);\n var operators = {\n '!': 'factorial',\n '\\'': 'ctranspose'\n };\n\n while (hasOwnProperty(operators, state.token)) {\n name = state.token;\n fn = operators[name];\n getToken(state);\n params = [node];\n node = new OperatorNode(name, fn, params);\n node = parseAccessors(state, node);\n }\n\n return node;\n }\n /**\n * Parse a custom node handler. A node handler can be used to process\n * nodes in a custom way, for example for handling a plot.\n *\n * A handler must be passed as second argument of the parse function.\n * - must extend math.Node\n * - must contain a function _compile(defs: Object) : string\n * - must contain a function find(filter: Object) : Node[]\n * - must contain a function toString() : string\n * - the constructor is called with a single argument containing all parameters\n *\n * For example:\n *\n * nodes = {\n * 'plot': PlotHandler\n * }\n *\n * The constructor of the handler is called as:\n *\n * node = new PlotHandler(params)\n *\n * The handler will be invoked when evaluating an expression like:\n *\n * node = math.parse('plot(sin(x), x)', nodes)\n *\n * @return {Node} node\n * @private\n */\n\n\n function parseCustomNodes(state) {\n var params = [];\n\n if (state.tokenType === TOKENTYPE.SYMBOL && hasOwnProperty(state.extraNodes, state.token)) {\n var CustomNode = state.extraNodes[state.token];\n getToken(state); // parse parameters\n\n if (state.token === '(') {\n params = [];\n openParams(state);\n getToken(state);\n\n if (state.token !== ')') {\n params.push(parseAssignment(state)); // parse a list with parameters\n\n while (state.token === ',') {\n // eslint-disable-line no-unmodified-loop-condition\n getToken(state);\n params.push(parseAssignment(state));\n }\n }\n\n if (state.token !== ')') {\n throw createSyntaxError(state, 'Parenthesis ) expected');\n }\n\n closeParams(state);\n getToken(state);\n } // create a new custom node\n // noinspection JSValidateTypes\n\n\n return new CustomNode(params);\n }\n\n return parseSymbol(state);\n }\n /**\n * parse symbols: functions, variables, constants, units\n * @return {Node} node\n * @private\n */\n\n\n function parseSymbol(state) {\n var node, name;\n\n if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {\n name = state.token;\n getToken(state);\n\n if (hasOwnProperty(CONSTANTS, name)) {\n // true, false, null, ...\n node = new ConstantNode(CONSTANTS[name]);\n } else if (NUMERIC_CONSTANTS.indexOf(name) !== -1) {\n // NaN, Infinity\n node = new ConstantNode(numeric(name, 'number'));\n } else {\n node = new SymbolNode(name);\n } // parse function parameters and matrix index\n\n\n node = parseAccessors(state, node);\n return node;\n }\n\n return parseDoubleQuotesString(state);\n }\n /**\n * parse accessors:\n * - function invocation in round brackets (...), for example sqrt(2)\n * - index enclosed in square brackets [...], for example A[2,3]\n * - dot notation for properties, like foo.bar\n * @param {Object} state\n * @param {Node} node Node on which to apply the parameters. If there\n * are no parameters in the expression, the node\n * itself is returned\n * @param {string[]} [types] Filter the types of notations\n * can be ['(', '[', '.']\n * @return {Node} node\n * @private\n */\n\n\n function parseAccessors(state, node, types) {\n var params;\n\n while ((state.token === '(' || state.token === '[' || state.token === '.') && (!types || types.indexOf(state.token) !== -1)) {\n // eslint-disable-line no-unmodified-loop-condition\n params = [];\n\n if (state.token === '(') {\n if (isSymbolNode(node) || isAccessorNode(node)) {\n // function invocation like fn(2, 3) or obj.fn(2, 3)\n openParams(state);\n getToken(state);\n\n if (state.token !== ')') {\n params.push(parseAssignment(state)); // parse a list with parameters\n\n while (state.token === ',') {\n // eslint-disable-line no-unmodified-loop-condition\n getToken(state);\n params.push(parseAssignment(state));\n }\n }\n\n if (state.token !== ')') {\n throw createSyntaxError(state, 'Parenthesis ) expected');\n }\n\n closeParams(state);\n getToken(state);\n node = new FunctionNode(node, params);\n } else {\n // implicit multiplication like (2+3)(4+5) or sqrt(2)(1+2)\n // don't parse it here but let it be handled by parseImplicitMultiplication\n // with correct precedence\n return node;\n }\n } else if (state.token === '[') {\n // index notation like variable[2, 3]\n openParams(state);\n getToken(state);\n\n if (state.token !== ']') {\n params.push(parseAssignment(state)); // parse a list with parameters\n\n while (state.token === ',') {\n // eslint-disable-line no-unmodified-loop-condition\n getToken(state);\n params.push(parseAssignment(state));\n }\n }\n\n if (state.token !== ']') {\n throw createSyntaxError(state, 'Parenthesis ] expected');\n }\n\n closeParams(state);\n getToken(state);\n node = new AccessorNode(node, new IndexNode(params));\n } else {\n // dot notation like variable.prop\n getToken(state);\n\n if (state.tokenType !== TOKENTYPE.SYMBOL) {\n throw createSyntaxError(state, 'Property name expected after dot');\n }\n\n params.push(new ConstantNode(state.token));\n getToken(state);\n var dotNotation = true;\n node = new AccessorNode(node, new IndexNode(params, dotNotation));\n }\n }\n\n return node;\n }\n /**\n * Parse a double quotes string.\n * @return {Node} node\n * @private\n */\n\n\n function parseDoubleQuotesString(state) {\n var node, str;\n\n if (state.token === '\"') {\n str = parseDoubleQuotesStringToken(state); // create constant\n\n node = new ConstantNode(str); // parse index parameters\n\n node = parseAccessors(state, node);\n return node;\n }\n\n return parseSingleQuotesString(state);\n }\n /**\n * Parse a string surrounded by double quotes \"...\"\n * @return {string}\n */\n\n\n function parseDoubleQuotesStringToken(state) {\n var str = '';\n\n while (currentCharacter(state) !== '' && currentCharacter(state) !== '\"') {\n if (currentCharacter(state) === '\\\\') {\n // escape character, immediately process the next\n // character to prevent stopping at a next '\\\"'\n str += currentCharacter(state);\n next(state);\n }\n\n str += currentCharacter(state);\n next(state);\n }\n\n getToken(state);\n\n if (state.token !== '\"') {\n throw createSyntaxError(state, 'End of string \" expected');\n }\n\n getToken(state);\n return JSON.parse('\"' + str + '\"'); // unescape escaped characters\n }\n /**\n * Parse a single quotes string.\n * @return {Node} node\n * @private\n */\n\n\n function parseSingleQuotesString(state) {\n var node, str;\n\n if (state.token === '\\'') {\n str = parseSingleQuotesStringToken(state); // create constant\n\n node = new ConstantNode(str); // parse index parameters\n\n node = parseAccessors(state, node);\n return node;\n }\n\n return parseMatrix(state);\n }\n /**\n * Parse a string surrounded by single quotes '...'\n * @return {string}\n */\n\n\n function parseSingleQuotesStringToken(state) {\n var str = '';\n\n while (currentCharacter(state) !== '' && currentCharacter(state) !== '\\'') {\n if (currentCharacter(state) === '\\\\') {\n // escape character, immediately process the next\n // character to prevent stopping at a next '\\''\n str += currentCharacter(state);\n next(state);\n }\n\n str += currentCharacter(state);\n next(state);\n }\n\n getToken(state);\n\n if (state.token !== '\\'') {\n throw createSyntaxError(state, 'End of string \\' expected');\n }\n\n getToken(state);\n return JSON.parse('\"' + str + '\"'); // unescape escaped characters\n }\n /**\n * parse the matrix\n * @return {Node} node\n * @private\n */\n\n\n function parseMatrix(state) {\n var array, params, rows, cols;\n\n if (state.token === '[') {\n // matrix [...]\n openParams(state);\n getToken(state);\n\n if (state.token !== ']') {\n // this is a non-empty matrix\n var row = parseRow(state);\n\n if (state.token === ';') {\n // 2 dimensional array\n rows = 1;\n params = [row]; // the rows of the matrix are separated by dot-comma's\n\n while (state.token === ';') {\n // eslint-disable-line no-unmodified-loop-condition\n getToken(state);\n params[rows] = parseRow(state);\n rows++;\n }\n\n if (state.token !== ']') {\n throw createSyntaxError(state, 'End of matrix ] expected');\n }\n\n closeParams(state);\n getToken(state); // check if the number of columns matches in all rows\n\n cols = params[0].items.length;\n\n for (var r = 1; r < rows; r++) {\n if (params[r].items.length !== cols) {\n throw createError(state, 'Column dimensions mismatch ' + '(' + params[r].items.length + ' !== ' + cols + ')');\n }\n }\n\n array = new ArrayNode(params);\n } else {\n // 1 dimensional vector\n if (state.token !== ']') {\n throw createSyntaxError(state, 'End of matrix ] expected');\n }\n\n closeParams(state);\n getToken(state);\n array = row;\n }\n } else {\n // this is an empty matrix \"[ ]\"\n closeParams(state);\n getToken(state);\n array = new ArrayNode([]);\n }\n\n return parseAccessors(state, array);\n }\n\n return parseObject(state);\n }\n /**\n * Parse a single comma-separated row from a matrix, like 'a, b, c'\n * @return {ArrayNode} node\n */\n\n\n function parseRow(state) {\n var params = [parseAssignment(state)];\n var len = 1;\n\n while (state.token === ',') {\n // eslint-disable-line no-unmodified-loop-condition\n getToken(state); // parse expression\n\n params[len] = parseAssignment(state);\n len++;\n }\n\n return new ArrayNode(params);\n }\n /**\n * parse an object, enclosed in angle brackets{...}, for example {value: 2}\n * @return {Node} node\n * @private\n */\n\n\n function parseObject(state) {\n if (state.token === '{') {\n openParams(state);\n var key;\n var properties = {};\n\n do {\n getToken(state);\n\n if (state.token !== '}') {\n // parse key\n if (state.token === '\"') {\n key = parseDoubleQuotesStringToken(state);\n } else if (state.token === '\\'') {\n key = parseSingleQuotesStringToken(state);\n } else if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {\n key = state.token;\n getToken(state);\n } else {\n throw createSyntaxError(state, 'Symbol or string expected as object key');\n } // parse key/value separator\n\n\n if (state.token !== ':') {\n throw createSyntaxError(state, 'Colon : expected after object key');\n }\n\n getToken(state); // parse key\n\n properties[key] = parseAssignment(state);\n }\n } while (state.token === ','); // eslint-disable-line no-unmodified-loop-condition\n\n\n if (state.token !== '}') {\n throw createSyntaxError(state, 'Comma , or bracket } expected after object value');\n }\n\n closeParams(state);\n getToken(state);\n var node = new ObjectNode(properties); // parse index parameters\n\n node = parseAccessors(state, node);\n return node;\n }\n\n return parseNumber(state);\n }\n /**\n * parse a number\n * @return {Node} node\n * @private\n */\n\n\n function parseNumber(state) {\n var numberStr;\n\n if (state.tokenType === TOKENTYPE.NUMBER) {\n // this is a number\n numberStr = state.token;\n getToken(state);\n return new ConstantNode(numeric(numberStr, config.number));\n }\n\n return parseParentheses(state);\n }\n /**\n * parentheses\n * @return {Node} node\n * @private\n */\n\n\n function parseParentheses(state) {\n var node; // check if it is a parenthesized expression\n\n if (state.token === '(') {\n // parentheses (...)\n openParams(state);\n getToken(state);\n node = parseAssignment(state); // start again\n\n if (state.token !== ')') {\n throw createSyntaxError(state, 'Parenthesis ) expected');\n }\n\n closeParams(state);\n getToken(state);\n node = new ParenthesisNode(node);\n node = parseAccessors(state, node);\n return node;\n }\n\n return parseEnd(state);\n }\n /**\n * Evaluated when the expression is not yet ended but expected to end\n * @return {Node} res\n * @private\n */\n\n\n function parseEnd(state) {\n if (state.token === '') {\n // syntax error or unexpected end of expression\n throw createSyntaxError(state, 'Unexpected end of expression');\n } else {\n throw createSyntaxError(state, 'Value expected');\n }\n }\n /**\n * Shortcut for getting the current row value (one based)\n * Returns the line of the currently handled expression\n * @private\n */\n\n /* TODO: implement keeping track on the row number\n function row () {\n return null\n }\n */\n\n /**\n * Shortcut for getting the current col value (one based)\n * Returns the column (position) where the last state.token starts\n * @private\n */\n\n\n function col(state) {\n return state.index - state.token.length + 1;\n }\n /**\n * Create an error\n * @param {Object} state\n * @param {string} message\n * @return {SyntaxError} instantiated error\n * @private\n */\n\n\n function createSyntaxError(state, message) {\n var c = col(state);\n var error = new SyntaxError(message + ' (char ' + c + ')');\n error.char = c;\n return error;\n }\n /**\n * Create an error\n * @param {Object} state\n * @param {string} message\n * @return {Error} instantiated error\n * @private\n */\n\n\n function createError(state, message) {\n var c = col(state);\n var error = new SyntaxError(message + ' (char ' + c + ')');\n error.char = c;\n return error;\n }\n\n return parse;\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { parseDependencies } from './dependenciesParse.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createEvaluate } from '../../factoriesAny.js';\nexport var evaluateDependencies = {\n parseDependencies,\n typedDependencies,\n createEvaluate\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';\nimport { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';\nimport { AssignmentNodeDependencies } from './dependenciesAssignmentNode.generated.js';\nimport { BlockNodeDependencies } from './dependenciesBlockNode.generated.js';\nimport { ConditionalNodeDependencies } from './dependenciesConditionalNode.generated.js';\nimport { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';\nimport { FunctionAssignmentNodeDependencies } from './dependenciesFunctionAssignmentNode.generated.js';\nimport { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';\nimport { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';\nimport { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';\nimport { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';\nimport { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';\nimport { RangeNodeDependencies } from './dependenciesRangeNode.generated.js';\nimport { RelationalNodeDependencies } from './dependenciesRelationalNode.generated.js';\nimport { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';\nimport { numericDependencies } from './dependenciesNumeric.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createParse } from '../../factoriesAny.js';\nexport var parseDependencies = {\n AccessorNodeDependencies,\n ArrayNodeDependencies,\n AssignmentNodeDependencies,\n BlockNodeDependencies,\n ConditionalNodeDependencies,\n ConstantNodeDependencies,\n FunctionAssignmentNodeDependencies,\n FunctionNodeDependencies,\n IndexNodeDependencies,\n ObjectNodeDependencies,\n OperatorNodeDependencies,\n ParenthesisNodeDependencies,\n RangeNodeDependencies,\n RelationalNodeDependencies,\n SymbolNodeDependencies,\n numericDependencies,\n typedDependencies,\n createParse\n};","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { createEmptyMap } from '../../utils/map.js';\nvar name = 'evaluate';\nvar dependencies = ['typed', 'parse'];\nexport var createEvaluate = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n parse\n } = _ref;\n\n /**\n * Evaluate an expression.\n *\n * Note the evaluating arbitrary expressions may involve security risks,\n * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.\n *\n * Syntax:\n *\n * math.evaluate(expr)\n * math.evaluate(expr, scope)\n * math.evaluate([expr1, expr2, expr3, ...])\n * math.evaluate([expr1, expr2, expr3, ...], scope)\n *\n * Example:\n *\n * math.evaluate('(2+3)/4') // 1.25\n * math.evaluate('sqrt(3^2 + 4^2)') // 5\n * math.evaluate('sqrt(-4)') // 2i\n * math.evaluate(['a=3', 'b=4', 'a*b']) // [3, 4, 12]\n *\n * let scope = {a:3, b:4}\n * math.evaluate('a * b', scope) // 12\n *\n * See also:\n *\n * parse, compile\n *\n * @param {string | string[] | Matrix} expr The expression to be evaluated\n * @param {Object} [scope] Scope to read/write variables\n * @return {*} The result of the expression\n * @throws {Error}\n */\n return typed(name, {\n string: function string(expr) {\n var scope = createEmptyMap();\n return parse(expr).compile().evaluate(scope);\n },\n 'string, Map | Object': function stringMapObject(expr, scope) {\n return parse(expr).compile().evaluate(scope);\n },\n 'Array | Matrix': function ArrayMatrix(expr) {\n var scope = createEmptyMap();\n return deepMap(expr, function (entry) {\n return parse(entry).compile().evaluate(scope);\n });\n },\n 'Array | Matrix, Map | Object': function ArrayMatrixMapObject(expr, scope) {\n return deepMap(expr, function (entry) {\n return parse(entry).compile().evaluate(scope);\n });\n }\n });\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm04';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm04 = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n equalScalar\n } = _ref;\n\n /**\n * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n * Callback function invoked MAX(NNZA, NNZB) times\n *\n *\n * ┌ f(Aij, Bij) ; A(i,j) !== 0 && B(i,j) !== 0\n * C(i,j) = ┤ A(i,j) ; A(i,j) !== 0\n * └ B(i,j) ; B(i,j) !== 0\n *\n *\n * @param {Matrix} a The SparseMatrix instance (A)\n * @param {Matrix} b The SparseMatrix instance (B)\n * @param {Function} callback The f(Aij,Bij) operation to invoke\n *\n * @return {Matrix} SparseMatrix (C)\n *\n * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n */\n return function algorithm04(a, b, callback) {\n // sparse matrix arrays\n var avalues = a._values;\n var aindex = a._index;\n var aptr = a._ptr;\n var asize = a._size;\n var adt = a._datatype; // sparse matrix arrays\n\n var bvalues = b._values;\n var bindex = b._index;\n var bptr = b._ptr;\n var bsize = b._size;\n var bdt = b._datatype; // validate dimensions\n\n if (asize.length !== bsize.length) {\n throw new DimensionError(asize.length, bsize.length);\n } // check rows & columns\n\n\n if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n } // rows & columns\n\n\n var rows = asize[0];\n var columns = asize[1]; // datatype\n\n var dt; // equal signature to use\n\n var eq = equalScalar; // zero value\n\n var zero = 0; // callback signature to use\n\n var cf = callback; // process data types\n\n if (typeof adt === 'string' && adt === bdt) {\n // datatype\n dt = adt; // find signature that matches (dt, dt)\n\n eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n zero = typed.convert(0, dt); // callback\n\n cf = typed.find(callback, [dt, dt]);\n } // result arrays\n\n\n var cvalues = avalues && bvalues ? [] : undefined;\n var cindex = [];\n var cptr = []; // workspace\n\n var xa = avalues && bvalues ? [] : undefined;\n var xb = avalues && bvalues ? [] : undefined; // marks indicating we have a value in x for a given column\n\n var wa = [];\n var wb = []; // vars\n\n var i, j, k, k0, k1; // loop columns\n\n for (j = 0; j < columns; j++) {\n // update cptr\n cptr[j] = cindex.length; // columns mark\n\n var mark = j + 1; // loop A(:,j)\n\n for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n // row\n i = aindex[k]; // update c\n\n cindex.push(i); // update workspace\n\n wa[i] = mark; // check we need to process values\n\n if (xa) {\n xa[i] = avalues[k];\n }\n } // loop B(:,j)\n\n\n for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n // row\n i = bindex[k]; // check row exists in A\n\n if (wa[i] === mark) {\n // update record in xa @ i\n if (xa) {\n // invoke callback\n var v = cf(xa[i], bvalues[k]); // check for zero\n\n if (!eq(v, zero)) {\n // update workspace\n xa[i] = v;\n } else {\n // remove mark (index will be removed later)\n wa[i] = null;\n }\n }\n } else {\n // update c\n cindex.push(i); // update workspace\n\n wb[i] = mark; // check we need to process values\n\n if (xb) {\n xb[i] = bvalues[k];\n }\n }\n } // check we need to process values (non pattern matrix)\n\n\n if (xa && xb) {\n // initialize first index in j\n k = cptr[j]; // loop index in j\n\n while (k < cindex.length) {\n // row\n i = cindex[k]; // check workspace has value @ i\n\n if (wa[i] === mark) {\n // push value (Aij != 0 || (Aij != 0 && Bij != 0))\n cvalues[k] = xa[i]; // increment pointer\n\n k++;\n } else if (wb[i] === mark) {\n // push value (bij != 0)\n cvalues[k] = xb[i]; // increment pointer\n\n k++;\n } else {\n // remove index @ k\n cindex.splice(k, 1);\n }\n }\n }\n } // update cptr\n\n\n cptr[columns] = cindex.length; // return sparse matrix\n\n return a.createSparseMatrix({\n values: cvalues,\n index: cindex,\n ptr: cptr,\n size: [rows, columns],\n datatype: dt\n });\n };\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';\nimport { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';\nimport { addScalarDependencies } from './dependenciesAddScalar.generated.js';\nimport { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createAdd } from '../../factoriesAny.js';\nexport var addDependencies = {\n DenseMatrixDependencies,\n SparseMatrixDependencies,\n addScalarDependencies,\n equalScalarDependencies,\n matrixDependencies,\n typedDependencies,\n createAdd\n};","import { factory } from '../../utils/factory.js';\nimport { extend } from '../../utils/object.js';\nimport { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js';\nimport { createAlgorithm04 } from '../../type/matrix/utils/algorithm04.js';\nimport { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js';\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';\nvar name = 'add';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'equalScalar', 'DenseMatrix', 'SparseMatrix'];\nexport var createAdd = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n matrix,\n addScalar,\n equalScalar,\n DenseMatrix,\n SparseMatrix\n } = _ref;\n var algorithm01 = createAlgorithm01({\n typed\n });\n var algorithm04 = createAlgorithm04({\n typed,\n equalScalar\n });\n var algorithm10 = createAlgorithm10({\n typed,\n DenseMatrix\n });\n var algorithm13 = createAlgorithm13({\n typed\n });\n var algorithm14 = createAlgorithm14({\n typed\n });\n /**\n * Add two or more values, `x + y`.\n * For matrices, the function is evaluated element wise.\n *\n * Syntax:\n *\n * math.add(x, y)\n * math.add(x, y, z, ...)\n *\n * Examples:\n *\n * math.add(2, 3) // returns number 5\n * math.add(2, 3, 4) // returns number 9\n *\n * const a = math.complex(2, 3)\n * const b = math.complex(-4, 1)\n * math.add(a, b) // returns Complex -2 + 4i\n *\n * math.add([1, 2, 3], 4) // returns Array [5, 6, 7]\n *\n * const c = math.unit('5 cm')\n * const d = math.unit('2.1 mm')\n * math.add(c, d) // returns Unit 52.1 mm\n *\n * math.add(\"2.3\", \"4\") // returns number 6.3\n *\n * See also:\n *\n * subtract, sum\n *\n * @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First value to add\n * @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second value to add\n * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Sum of `x` and `y`\n */\n\n return typed(name, extend({\n // we extend the signatures of addScalar with signatures dealing with matrices\n 'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n return algorithm13(x, y, addScalar);\n },\n 'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n return algorithm01(x, y, addScalar, false);\n },\n 'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n return algorithm01(y, x, addScalar, true);\n },\n 'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n return algorithm04(x, y, addScalar);\n },\n 'Array, Array': function ArrayArray(x, y) {\n // use matrix implementation\n return this(matrix(x), matrix(y)).valueOf();\n },\n 'Array, Matrix': function ArrayMatrix(x, y) {\n // use matrix implementation\n return this(matrix(x), y);\n },\n 'Matrix, Array': function MatrixArray(x, y) {\n // use matrix implementation\n return this(x, matrix(y));\n },\n 'DenseMatrix, any': function DenseMatrixAny(x, y) {\n return algorithm14(x, y, addScalar, false);\n },\n 'SparseMatrix, any': function SparseMatrixAny(x, y) {\n return algorithm10(x, y, addScalar, false);\n },\n 'any, DenseMatrix': function anyDenseMatrix(x, y) {\n return algorithm14(y, x, addScalar, true);\n },\n 'any, SparseMatrix': function anySparseMatrix(x, y) {\n return algorithm10(y, x, addScalar, true);\n },\n 'Array, any': function ArrayAny(x, y) {\n // use matrix implementation\n return algorithm14(matrix(x), y, addScalar, false).valueOf();\n },\n 'any, Array': function anyArray(x, y) {\n // use matrix implementation\n return algorithm14(matrix(y), x, addScalar, true).valueOf();\n },\n 'any, any': addScalar,\n 'any, any, ...any': function anyAnyAny(x, y, rest) {\n var result = this(x, y);\n\n for (var i = 0; i < rest.length; i++) {\n result = this(result, rest[i]);\n }\n\n return result;\n }\n }, addScalar.signatures));\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createLarger } from '../../factoriesAny.js';\nexport var largerDependencies = {\n DenseMatrixDependencies,\n matrixDependencies,\n typedDependencies,\n createLarger\n};","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';\nimport { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js';\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';\nvar name = 'larger';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];\nexport var createLarger = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n config,\n matrix,\n DenseMatrix\n } = _ref;\n var algorithm03 = createAlgorithm03({\n typed\n });\n var algorithm07 = createAlgorithm07({\n typed,\n DenseMatrix\n });\n var algorithm12 = createAlgorithm12({\n typed,\n DenseMatrix\n });\n var algorithm13 = createAlgorithm13({\n typed\n });\n var algorithm14 = createAlgorithm14({\n typed\n });\n /**\n * Test whether value x is larger than y.\n *\n * The function returns true when x is larger than y and the relative\n * difference between x and y is larger than the configured epsilon. The\n * function cannot be used to compare values smaller than approximately 2.22e-16.\n *\n * For matrices, the function is evaluated element wise.\n * Strings are compared by their numerical value.\n *\n * Syntax:\n *\n * math.larger(x, y)\n *\n * Examples:\n *\n * math.larger(2, 3) // returns false\n * math.larger(5, 2 + 2) // returns true\n *\n * const a = math.unit('5 cm')\n * const b = math.unit('2 inch')\n * math.larger(a, b) // returns false\n *\n * See also:\n *\n * equal, unequal, smaller, smallerEq, largerEq, compare\n *\n * @param {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n * @param {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n * @return {boolean | Array | Matrix} Returns true when the x is larger than y, else returns false\n */\n\n return typed(name, {\n 'boolean, boolean': function booleanBoolean(x, y) {\n return x > y;\n },\n 'number, number': function numberNumber(x, y) {\n return x > y && !nearlyEqual(x, y, config.epsilon);\n },\n 'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n return x.gt(y) && !bigNearlyEqual(x, y, config.epsilon);\n },\n 'Fraction, Fraction': function FractionFraction(x, y) {\n return x.compare(y) === 1;\n },\n 'Complex, Complex': function ComplexComplex() {\n throw new TypeError('No ordering relation is defined for complex numbers');\n },\n 'Unit, Unit': function UnitUnit(x, y) {\n if (!x.equalBase(y)) {\n throw new Error('Cannot compare units with different base');\n }\n\n return this(x.value, y.value);\n },\n 'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n return algorithm07(x, y, this);\n },\n 'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n return algorithm03(y, x, this, true);\n },\n 'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n return algorithm03(x, y, this, false);\n },\n 'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n return algorithm13(x, y, this);\n },\n 'Array, Array': function ArrayArray(x, y) {\n // use matrix implementation\n return this(matrix(x), matrix(y)).valueOf();\n },\n 'Array, Matrix': function ArrayMatrix(x, y) {\n // use matrix implementation\n return this(matrix(x), y);\n },\n 'Matrix, Array': function MatrixArray(x, y) {\n // use matrix implementation\n return this(x, matrix(y));\n },\n 'SparseMatrix, any': function SparseMatrixAny(x, y) {\n return algorithm12(x, y, this, false);\n },\n 'DenseMatrix, any': function DenseMatrixAny(x, y) {\n return algorithm14(x, y, this, false);\n },\n 'any, SparseMatrix': function anySparseMatrix(x, y) {\n return algorithm12(y, x, this, true);\n },\n 'any, DenseMatrix': function anyDenseMatrix(x, y) {\n return algorithm14(y, x, this, true);\n },\n 'Array, any': function ArrayAny(x, y) {\n // use matrix implementation\n return algorithm14(matrix(x), y, this, false).valueOf();\n },\n 'any, Array': function anyArray(x, y) {\n // use matrix implementation\n return algorithm14(matrix(y), x, this, true).valueOf();\n }\n });\n});\nexport var createLargerNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {\n var {\n typed,\n config\n } = _ref2;\n return typed(name, {\n 'number, number': function numberNumber(x, y) {\n return x > y && !nearlyEqual(x, y, config.epsilon);\n }\n });\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { largerDependencies } from './dependenciesLarger.generated.js';\nimport { smallerDependencies } from './dependenciesSmaller.generated.js';\nimport { createFibonacciHeapClass } from '../../factoriesAny.js';\nexport var FibonacciHeapDependencies = {\n largerDependencies,\n smallerDependencies,\n createFibonacciHeapClass\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createSmaller } from '../../factoriesAny.js';\nexport var smallerDependencies = {\n DenseMatrixDependencies,\n matrixDependencies,\n typedDependencies,\n createSmaller\n};","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';\nimport { createAlgorithm07 } from '../../type/matrix/utils/algorithm07.js';\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';\nvar name = 'smaller';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix'];\nexport var createSmaller = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n config,\n matrix,\n DenseMatrix\n } = _ref;\n var algorithm03 = createAlgorithm03({\n typed\n });\n var algorithm07 = createAlgorithm07({\n typed,\n DenseMatrix\n });\n var algorithm12 = createAlgorithm12({\n typed,\n DenseMatrix\n });\n var algorithm13 = createAlgorithm13({\n typed\n });\n var algorithm14 = createAlgorithm14({\n typed\n });\n /**\n * Test whether value x is smaller than y.\n *\n * The function returns true when x is smaller than y and the relative\n * difference between x and y is smaller than the configured epsilon. The\n * function cannot be used to compare values smaller than approximately 2.22e-16.\n *\n * For matrices, the function is evaluated element wise.\n * Strings are compared by their numerical value.\n *\n * Syntax:\n *\n * math.smaller(x, y)\n *\n * Examples:\n *\n * math.smaller(2, 3) // returns true\n * math.smaller(5, 2 * 2) // returns false\n *\n * const a = math.unit('5 cm')\n * const b = math.unit('2 inch')\n * math.smaller(a, b) // returns true\n *\n * See also:\n *\n * equal, unequal, smallerEq, smaller, smallerEq, compare\n *\n * @param {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n * @param {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false\n */\n\n return typed(name, {\n 'boolean, boolean': function booleanBoolean(x, y) {\n return x < y;\n },\n 'number, number': function numberNumber(x, y) {\n return x < y && !nearlyEqual(x, y, config.epsilon);\n },\n 'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n return x.lt(y) && !bigNearlyEqual(x, y, config.epsilon);\n },\n 'Fraction, Fraction': function FractionFraction(x, y) {\n return x.compare(y) === -1;\n },\n 'Complex, Complex': function ComplexComplex(x, y) {\n throw new TypeError('No ordering relation is defined for complex numbers');\n },\n 'Unit, Unit': function UnitUnit(x, y) {\n if (!x.equalBase(y)) {\n throw new Error('Cannot compare units with different base');\n }\n\n return this(x.value, y.value);\n },\n 'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n return algorithm07(x, y, this);\n },\n 'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n return algorithm03(y, x, this, true);\n },\n 'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n return algorithm03(x, y, this, false);\n },\n 'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n return algorithm13(x, y, this);\n },\n 'Array, Array': function ArrayArray(x, y) {\n // use matrix implementation\n return this(matrix(x), matrix(y)).valueOf();\n },\n 'Array, Matrix': function ArrayMatrix(x, y) {\n // use matrix implementation\n return this(matrix(x), y);\n },\n 'Matrix, Array': function MatrixArray(x, y) {\n // use matrix implementation\n return this(x, matrix(y));\n },\n 'SparseMatrix, any': function SparseMatrixAny(x, y) {\n return algorithm12(x, y, this, false);\n },\n 'DenseMatrix, any': function DenseMatrixAny(x, y) {\n return algorithm14(x, y, this, false);\n },\n 'any, SparseMatrix': function anySparseMatrix(x, y) {\n return algorithm12(y, x, this, true);\n },\n 'any, DenseMatrix': function anyDenseMatrix(x, y) {\n return algorithm14(y, x, this, true);\n },\n 'Array, any': function ArrayAny(x, y) {\n // use matrix implementation\n return algorithm14(matrix(x), y, this, false).valueOf();\n },\n 'any, Array': function anyArray(x, y) {\n // use matrix implementation\n return algorithm14(matrix(y), x, this, true).valueOf();\n }\n });\n});\nexport var createSmallerNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {\n var {\n typed,\n config\n } = _ref2;\n return typed(name, {\n 'number, number': function numberNumber(x, y) {\n return x < y && !nearlyEqual(x, y, config.epsilon);\n }\n });\n});","import { factory } from '../../utils/factory.js';\nvar name = 'FibonacciHeap';\nvar dependencies = ['smaller', 'larger'];\nexport var createFibonacciHeapClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n smaller,\n larger\n } = _ref;\n var oneOverLogPhi = 1.0 / Math.log((1.0 + Math.sqrt(5.0)) / 2.0);\n /**\n * Fibonacci Heap implementation, used interally for Matrix math.\n * @class FibonacciHeap\n * @constructor FibonacciHeap\n */\n\n function FibonacciHeap() {\n if (!(this instanceof FibonacciHeap)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n } // initialize fields\n\n\n this._minimum = null;\n this._size = 0;\n }\n /**\n * Attach type information\n */\n\n\n FibonacciHeap.prototype.type = 'FibonacciHeap';\n FibonacciHeap.prototype.isFibonacciHeap = true;\n /**\n * Inserts a new data element into the heap. No heap consolidation is\n * performed at this time, the new node is simply inserted into the root\n * list of this heap. Running time: O(1) actual.\n * @memberof FibonacciHeap\n */\n\n FibonacciHeap.prototype.insert = function (key, value) {\n // create node\n var node = {\n key: key,\n value: value,\n degree: 0\n }; // check we have a node in the minimum\n\n if (this._minimum) {\n // minimum node\n var minimum = this._minimum; // update left & right of node\n\n node.left = minimum;\n node.right = minimum.right;\n minimum.right = node;\n node.right.left = node; // update minimum node in heap if needed\n\n if (smaller(key, minimum.key)) {\n // node has a smaller key, use it as minimum\n this._minimum = node;\n }\n } else {\n // set left & right\n node.left = node;\n node.right = node; // this is the first node\n\n this._minimum = node;\n } // increment number of nodes in heap\n\n\n this._size++; // return node\n\n return node;\n };\n /**\n * Returns the number of nodes in heap. Running time: O(1) actual.\n * @memberof FibonacciHeap\n */\n\n\n FibonacciHeap.prototype.size = function () {\n return this._size;\n };\n /**\n * Removes all elements from this heap.\n * @memberof FibonacciHeap\n */\n\n\n FibonacciHeap.prototype.clear = function () {\n this._minimum = null;\n this._size = 0;\n };\n /**\n * Returns true if the heap is empty, otherwise false.\n * @memberof FibonacciHeap\n */\n\n\n FibonacciHeap.prototype.isEmpty = function () {\n return this._size === 0;\n };\n /**\n * Extracts the node with minimum key from heap. Amortized running\n * time: O(log n).\n * @memberof FibonacciHeap\n */\n\n\n FibonacciHeap.prototype.extractMinimum = function () {\n // node to remove\n var node = this._minimum; // check we have a minimum\n\n if (node === null) {\n return node;\n } // current minimum\n\n\n var minimum = this._minimum; // get number of children\n\n var numberOfChildren = node.degree; // pointer to the first child\n\n var x = node.child; // for each child of node do...\n\n while (numberOfChildren > 0) {\n // store node in right side\n var tempRight = x.right; // remove x from child list\n\n x.left.right = x.right;\n x.right.left = x.left; // add x to root list of heap\n\n x.left = minimum;\n x.right = minimum.right;\n minimum.right = x;\n x.right.left = x; // set Parent[x] to null\n\n x.parent = null;\n x = tempRight;\n numberOfChildren--;\n } // remove node from root list of heap\n\n\n node.left.right = node.right;\n node.right.left = node.left; // update minimum\n\n if (node === node.right) {\n // empty\n minimum = null;\n } else {\n // update minimum\n minimum = node.right; // we need to update the pointer to the root with minimum key\n\n minimum = _findMinimumNode(minimum, this._size);\n } // decrement size of heap\n\n\n this._size--; // update minimum\n\n this._minimum = minimum; // return node\n\n return node;\n };\n /**\n * Removes a node from the heap given the reference to the node. The trees\n * in the heap will be consolidated, if necessary. This operation may fail\n * to remove the correct element if there are nodes with key value -Infinity.\n * Running time: O(log n) amortized.\n * @memberof FibonacciHeap\n */\n\n\n FibonacciHeap.prototype.remove = function (node) {\n // decrease key value\n this._minimum = _decreaseKey(this._minimum, node, -1); // remove the smallest\n\n this.extractMinimum();\n };\n /**\n * Decreases the key value for a heap node, given the new value to take on.\n * The structure of the heap may be changed and will not be consolidated.\n * Running time: O(1) amortized.\n * @memberof FibonacciHeap\n */\n\n\n function _decreaseKey(minimum, node, key) {\n // set node key\n node.key = key; // get parent node\n\n var parent = node.parent;\n\n if (parent && smaller(node.key, parent.key)) {\n // remove node from parent\n _cut(minimum, node, parent); // remove all nodes from parent to the root parent\n\n\n _cascadingCut(minimum, parent);\n } // update minimum node if needed\n\n\n if (smaller(node.key, minimum.key)) {\n minimum = node;\n } // return minimum\n\n\n return minimum;\n }\n /**\n * The reverse of the link operation: removes node from the child list of parent.\n * This method assumes that min is non-null. Running time: O(1).\n * @memberof FibonacciHeap\n */\n\n\n function _cut(minimum, node, parent) {\n // remove node from parent children and decrement Degree[parent]\n node.left.right = node.right;\n node.right.left = node.left;\n parent.degree--; // reset y.child if necessary\n\n if (parent.child === node) {\n parent.child = node.right;\n } // remove child if degree is 0\n\n\n if (parent.degree === 0) {\n parent.child = null;\n } // add node to root list of heap\n\n\n node.left = minimum;\n node.right = minimum.right;\n minimum.right = node;\n node.right.left = node; // set parent[node] to null\n\n node.parent = null; // set mark[node] to false\n\n node.mark = false;\n }\n /**\n * Performs a cascading cut operation. This cuts node from its parent and then\n * does the same for its parent, and so on up the tree.\n * Running time: O(log n); O(1) excluding the recursion.\n * @memberof FibonacciHeap\n */\n\n\n function _cascadingCut(minimum, node) {\n // store parent node\n var parent = node.parent; // if there's a parent...\n\n if (!parent) {\n return;\n } // if node is unmarked, set it marked\n\n\n if (!node.mark) {\n node.mark = true;\n } else {\n // it's marked, cut it from parent\n _cut(minimum, node, parent); // cut its parent as well\n\n\n _cascadingCut(parent);\n }\n }\n /**\n * Make the first node a child of the second one. Running time: O(1) actual.\n * @memberof FibonacciHeap\n */\n\n\n var _linkNodes = function _linkNodes(node, parent) {\n // remove node from root list of heap\n node.left.right = node.right;\n node.right.left = node.left; // make node a Child of parent\n\n node.parent = parent;\n\n if (!parent.child) {\n parent.child = node;\n node.right = node;\n node.left = node;\n } else {\n node.left = parent.child;\n node.right = parent.child.right;\n parent.child.right = node;\n node.right.left = node;\n } // increase degree[parent]\n\n\n parent.degree++; // set mark[node] false\n\n node.mark = false;\n };\n\n function _findMinimumNode(minimum, size) {\n // to find trees of the same degree efficiently we use an array of length O(log n) in which we keep a pointer to one root of each degree\n var arraySize = Math.floor(Math.log(size) * oneOverLogPhi) + 1; // create list with initial capacity\n\n var array = new Array(arraySize); // find the number of root nodes.\n\n var numRoots = 0;\n var x = minimum;\n\n if (x) {\n numRoots++;\n x = x.right;\n\n while (x !== minimum) {\n numRoots++;\n x = x.right;\n }\n } // vars\n\n\n var y; // For each node in root list do...\n\n while (numRoots > 0) {\n // access this node's degree..\n var d = x.degree; // get next node\n\n var next = x.right; // check if there is a node already in array with the same degree\n\n while (true) {\n // get node with the same degree is any\n y = array[d];\n\n if (!y) {\n break;\n } // make one node with the same degree a child of the other, do this based on the key value.\n\n\n if (larger(x.key, y.key)) {\n var temp = y;\n y = x;\n x = temp;\n } // make y a child of x\n\n\n _linkNodes(y, x); // we have handled this degree, go to next one.\n\n\n array[d] = null;\n d++;\n } // save this node for later when we might encounter another of the same degree.\n\n\n array[d] = x; // move forward through list.\n\n x = next;\n numRoots--;\n } // Set min to null (effectively losing the root list) and reconstruct the root list from the array entries in array[].\n\n\n minimum = null; // loop nodes in array\n\n for (var i = 0; i < arraySize; i++) {\n // get current node\n y = array[i];\n\n if (!y) {\n continue;\n } // check if we have a linked list\n\n\n if (minimum) {\n // First remove node from root list.\n y.left.right = y.right;\n y.right.left = y.left; // now add to root list, again.\n\n y.left = minimum;\n y.right = minimum.right;\n minimum.right = y;\n y.right.left = y; // check if this is a new min.\n\n if (smaller(y.key, minimum.key)) {\n minimum = y;\n }\n } else {\n minimum = y;\n }\n }\n\n return minimum;\n }\n\n return FibonacciHeap;\n}, {\n isClass: true\n});","import { factory } from '../../utils/factory.js';\nvar name = 'Spa';\nvar dependencies = ['addScalar', 'equalScalar', 'FibonacciHeap'];\nexport var createSpaClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n addScalar,\n equalScalar,\n FibonacciHeap\n } = _ref;\n\n /**\n * An ordered Sparse Accumulator is a representation for a sparse vector that includes a dense array\n * of the vector elements and an ordered list of non-zero elements.\n */\n function Spa() {\n if (!(this instanceof Spa)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n } // allocate vector, TODO use typed arrays\n\n\n this._values = [];\n this._heap = new FibonacciHeap();\n }\n /**\n * Attach type information\n */\n\n\n Spa.prototype.type = 'Spa';\n Spa.prototype.isSpa = true;\n /**\n * Set the value for index i.\n *\n * @param {number} i The index\n * @param {number | BigNumber | Complex} The value at index i\n */\n\n Spa.prototype.set = function (i, v) {\n // check we have a value @ i\n if (!this._values[i]) {\n // insert in heap\n var node = this._heap.insert(i, v); // set the value @ i\n\n\n this._values[i] = node;\n } else {\n // update the value @ i\n this._values[i].value = v;\n }\n };\n\n Spa.prototype.get = function (i) {\n var node = this._values[i];\n\n if (node) {\n return node.value;\n }\n\n return 0;\n };\n\n Spa.prototype.accumulate = function (i, v) {\n // node @ i\n var node = this._values[i];\n\n if (!node) {\n // insert in heap\n node = this._heap.insert(i, v); // initialize value\n\n this._values[i] = node;\n } else {\n // accumulate value\n node.value = addScalar(node.value, v);\n }\n };\n\n Spa.prototype.forEach = function (from, to, callback) {\n // references\n var heap = this._heap;\n var values = this._values; // nodes\n\n var nodes = []; // node with minimum key, save it\n\n var node = heap.extractMinimum();\n\n if (node) {\n nodes.push(node);\n } // extract nodes from heap (ordered)\n\n\n while (node && node.key <= to) {\n // check it is in range\n if (node.key >= from) {\n // check value is not zero\n if (!equalScalar(node.value, 0)) {\n // invoke callback\n callback(node.key, node.value, this);\n }\n } // extract next node, save it\n\n\n node = heap.extractMinimum();\n\n if (node) {\n nodes.push(node);\n }\n } // reinsert all nodes in heap\n\n\n for (var i = 0; i < nodes.length; i++) {\n // current node\n var n = nodes[i]; // insert node in heap\n\n node = heap.insert(n.key, n.value); // update values\n\n values[node.key] = node;\n }\n };\n\n Spa.prototype.swap = function (i, j) {\n // node @ i and j\n var nodei = this._values[i];\n var nodej = this._values[j]; // check we need to insert indeces\n\n if (!nodei && nodej) {\n // insert in heap\n nodei = this._heap.insert(i, nodej.value); // remove from heap\n\n this._heap.remove(nodej); // set values\n\n\n this._values[i] = nodei;\n this._values[j] = undefined;\n } else if (nodei && !nodej) {\n // insert in heap\n nodej = this._heap.insert(j, nodei.value); // remove from heap\n\n this._heap.remove(nodei); // set values\n\n\n this._values[j] = nodej;\n this._values[i] = undefined;\n } else if (nodei && nodej) {\n // swap values\n var v = nodei.value;\n nodei.value = nodej.value;\n nodej.value = v;\n }\n };\n\n return Spa;\n}, {\n isClass: true\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { FibonacciHeapDependencies } from './dependenciesFibonacciHeapClass.generated.js';\nimport { addScalarDependencies } from './dependenciesAddScalar.generated.js';\nimport { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';\nimport { createSpaClass } from '../../factoriesAny.js';\nexport var SpaDependencies = {\n FibonacciHeapDependencies,\n addScalarDependencies,\n equalScalarDependencies,\n createSpaClass\n};","import { clone } from '../../../utils/object.js';\nimport { factory } from '../../../utils/factory.js';\nvar name = 'lup';\nvar dependencies = ['typed', 'matrix', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtract', 'larger', 'equalScalar', 'unaryMinus', 'DenseMatrix', 'SparseMatrix', 'Spa'];\nexport var createLup = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n matrix,\n abs,\n addScalar,\n divideScalar,\n multiplyScalar,\n subtract,\n larger,\n equalScalar,\n unaryMinus,\n DenseMatrix,\n SparseMatrix,\n Spa\n } = _ref;\n\n /**\n * Calculate the Matrix LU decomposition with partial pivoting. Matrix `A` is decomposed in two matrices (`L`, `U`) and a\n * row permutation vector `p` where `A[p,:] = L * U`\n *\n * Syntax:\n *\n * math.lup(A)\n *\n * Example:\n *\n * const m = [[2, 1], [1, 4]]\n * const r = math.lup(m)\n * // r = {\n * // L: [[1, 0], [0.5, 1]],\n * // U: [[2, 1], [0, 3.5]],\n * // P: [0, 1]\n * // }\n *\n * See also:\n *\n * slu, lsolve, lusolve, usolve\n *\n * @param {Matrix | Array} A A two dimensional matrix or array for which to get the LUP decomposition.\n *\n * @return {{L: Array | Matrix, U: Array | Matrix, P: Array.<number>}} The lower triangular matrix, the upper triangular matrix and the permutation matrix.\n */\n return typed(name, {\n DenseMatrix: function DenseMatrix(m) {\n return _denseLUP(m);\n },\n SparseMatrix: function SparseMatrix(m) {\n return _sparseLUP(m);\n },\n Array: function Array(a) {\n // create dense matrix from array\n var m = matrix(a); // lup, use matrix implementation\n\n var r = _denseLUP(m); // result\n\n\n return {\n L: r.L.valueOf(),\n U: r.U.valueOf(),\n p: r.p\n };\n }\n });\n\n function _denseLUP(m) {\n // rows & columns\n var rows = m._size[0];\n var columns = m._size[1]; // minimum rows and columns\n\n var n = Math.min(rows, columns); // matrix array, clone original data\n\n var data = clone(m._data); // l matrix arrays\n\n var ldata = [];\n var lsize = [rows, n]; // u matrix arrays\n\n var udata = [];\n var usize = [n, columns]; // vars\n\n var i, j, k; // permutation vector\n\n var p = [];\n\n for (i = 0; i < rows; i++) {\n p[i] = i;\n } // loop columns\n\n\n for (j = 0; j < columns; j++) {\n // skip first column in upper triangular matrix\n if (j > 0) {\n // loop rows\n for (i = 0; i < rows; i++) {\n // min i,j\n var min = Math.min(i, j); // v[i, j]\n\n var s = 0; // loop up to min\n\n for (k = 0; k < min; k++) {\n // s = l[i, k] - data[k, j]\n s = addScalar(s, multiplyScalar(data[i][k], data[k][j]));\n }\n\n data[i][j] = subtract(data[i][j], s);\n }\n } // row with larger value in cvector, row >= j\n\n\n var pi = j;\n var pabsv = 0;\n var vjj = 0; // loop rows\n\n for (i = j; i < rows; i++) {\n // data @ i, j\n var v = data[i][j]; // absolute value\n\n var absv = abs(v); // value is greater than pivote value\n\n if (larger(absv, pabsv)) {\n // store row\n pi = i; // update max value\n\n pabsv = absv; // value @ [j, j]\n\n vjj = v;\n }\n } // swap rows (j <-> pi)\n\n\n if (j !== pi) {\n // swap values j <-> pi in p\n p[j] = [p[pi], p[pi] = p[j]][0]; // swap j <-> pi in data\n\n DenseMatrix._swapRows(j, pi, data);\n } // check column is in lower triangular matrix\n\n\n if (j < rows) {\n // loop rows (lower triangular matrix)\n for (i = j + 1; i < rows; i++) {\n // value @ i, j\n var vij = data[i][j];\n\n if (!equalScalar(vij, 0)) {\n // update data\n data[i][j] = divideScalar(data[i][j], vjj);\n }\n }\n }\n } // loop columns\n\n\n for (j = 0; j < columns; j++) {\n // loop rows\n for (i = 0; i < rows; i++) {\n // initialize row in arrays\n if (j === 0) {\n // check row exists in upper triangular matrix\n if (i < columns) {\n // U\n udata[i] = [];\n } // L\n\n\n ldata[i] = [];\n } // check we are in the upper triangular matrix\n\n\n if (i < j) {\n // check row exists in upper triangular matrix\n if (i < columns) {\n // U\n udata[i][j] = data[i][j];\n } // check column exists in lower triangular matrix\n\n\n if (j < rows) {\n // L\n ldata[i][j] = 0;\n }\n\n continue;\n } // diagonal value\n\n\n if (i === j) {\n // check row exists in upper triangular matrix\n if (i < columns) {\n // U\n udata[i][j] = data[i][j];\n } // check column exists in lower triangular matrix\n\n\n if (j < rows) {\n // L\n ldata[i][j] = 1;\n }\n\n continue;\n } // check row exists in upper triangular matrix\n\n\n if (i < columns) {\n // U\n udata[i][j] = 0;\n } // check column exists in lower triangular matrix\n\n\n if (j < rows) {\n // L\n ldata[i][j] = data[i][j];\n }\n }\n } // l matrix\n\n\n var l = new DenseMatrix({\n data: ldata,\n size: lsize\n }); // u matrix\n\n var u = new DenseMatrix({\n data: udata,\n size: usize\n }); // p vector\n\n var pv = [];\n\n for (i = 0, n = p.length; i < n; i++) {\n pv[p[i]] = i;\n } // return matrices\n\n\n return {\n L: l,\n U: u,\n p: pv,\n toString: function toString() {\n return 'L: ' + this.L.toString() + '\\nU: ' + this.U.toString() + '\\nP: ' + this.p;\n }\n };\n }\n\n function _sparseLUP(m) {\n // rows & columns\n var rows = m._size[0];\n var columns = m._size[1]; // minimum rows and columns\n\n var n = Math.min(rows, columns); // matrix arrays (will not be modified, thanks to permutation vector)\n\n var values = m._values;\n var index = m._index;\n var ptr = m._ptr; // l matrix arrays\n\n var lvalues = [];\n var lindex = [];\n var lptr = [];\n var lsize = [rows, n]; // u matrix arrays\n\n var uvalues = [];\n var uindex = [];\n var uptr = [];\n var usize = [n, columns]; // vars\n\n var i, j, k; // permutation vectors, (current index -> original index) and (original index -> current index)\n\n var pvCo = [];\n var pvOc = [];\n\n for (i = 0; i < rows; i++) {\n pvCo[i] = i;\n pvOc[i] = i;\n } // swap indices in permutation vectors (condition x < y)!\n\n\n var swapIndeces = function swapIndeces(x, y) {\n // find pv indeces getting data from x and y\n var kx = pvOc[x];\n var ky = pvOc[y]; // update permutation vector current -> original\n\n pvCo[kx] = y;\n pvCo[ky] = x; // update permutation vector original -> current\n\n pvOc[x] = ky;\n pvOc[y] = kx;\n }; // loop columns\n\n\n var _loop = function _loop() {\n // sparse accumulator\n var spa = new Spa(); // check lower triangular matrix has a value @ column j\n\n if (j < rows) {\n // update ptr\n lptr.push(lvalues.length); // first value in j column for lower triangular matrix\n\n lvalues.push(1);\n lindex.push(j);\n } // update ptr\n\n\n uptr.push(uvalues.length); // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n\n var k0 = ptr[j];\n var k1 = ptr[j + 1]; // copy column j into sparse accumulator\n\n for (k = k0; k < k1; k++) {\n // row\n i = index[k]; // copy column values into sparse accumulator (use permutation vector)\n\n spa.set(pvCo[i], values[k]);\n } // skip first column in upper triangular matrix\n\n\n if (j > 0) {\n // loop rows in column j (above diagonal)\n spa.forEach(0, j - 1, function (k, vkj) {\n // loop rows in column k (L)\n SparseMatrix._forEachRow(k, lvalues, lindex, lptr, function (i, vik) {\n // check row is below k\n if (i > k) {\n // update spa value\n spa.accumulate(i, unaryMinus(multiplyScalar(vik, vkj)));\n }\n });\n });\n } // row with larger value in spa, row >= j\n\n\n var pi = j;\n var vjj = spa.get(j);\n var pabsv = abs(vjj); // loop values in spa (order by row, below diagonal)\n\n spa.forEach(j + 1, rows - 1, function (x, v) {\n // absolute value\n var absv = abs(v); // value is greater than pivote value\n\n if (larger(absv, pabsv)) {\n // store row\n pi = x; // update max value\n\n pabsv = absv; // value @ [j, j]\n\n vjj = v;\n }\n }); // swap rows (j <-> pi)\n\n if (j !== pi) {\n // swap values j <-> pi in L\n SparseMatrix._swapRows(j, pi, lsize[1], lvalues, lindex, lptr); // swap values j <-> pi in U\n\n\n SparseMatrix._swapRows(j, pi, usize[1], uvalues, uindex, uptr); // swap values in spa\n\n\n spa.swap(j, pi); // update permutation vector (swap values @ j, pi)\n\n swapIndeces(j, pi);\n } // loop values in spa (order by row)\n\n\n spa.forEach(0, rows - 1, function (x, v) {\n // check we are above diagonal\n if (x <= j) {\n // update upper triangular matrix\n uvalues.push(v);\n uindex.push(x);\n } else {\n // update value\n v = divideScalar(v, vjj); // check value is non zero\n\n if (!equalScalar(v, 0)) {\n // update lower triangular matrix\n lvalues.push(v);\n lindex.push(x);\n }\n }\n });\n };\n\n for (j = 0; j < columns; j++) {\n _loop();\n } // update ptrs\n\n\n uptr.push(uvalues.length);\n lptr.push(lvalues.length); // return matrices\n\n return {\n L: new SparseMatrix({\n values: lvalues,\n index: lindex,\n ptr: lptr,\n size: lsize\n }),\n U: new SparseMatrix({\n values: uvalues,\n index: uindex,\n ptr: uptr,\n size: usize\n }),\n p: pvCo,\n toString: function toString() {\n return 'L: ' + this.L.toString() + '\\nU: ' + this.U.toString() + '\\nP: ' + this.p;\n }\n };\n }\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';\nimport { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';\nimport { invDependencies } from './dependenciesInv.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { multiplyDependencies } from './dependenciesMultiply.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createDivide } from '../../factoriesAny.js';\nexport var divideDependencies = {\n divideScalarDependencies,\n equalScalarDependencies,\n invDependencies,\n matrixDependencies,\n multiplyDependencies,\n typedDependencies,\n createDivide\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { absDependencies } from './dependenciesAbs.generated.js';\nimport { addScalarDependencies } from './dependenciesAddScalar.generated.js';\nimport { detDependencies } from './dependenciesDet.generated.js';\nimport { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';\nimport { identityDependencies } from './dependenciesIdentity.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { multiplyDependencies } from './dependenciesMultiply.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';\nimport { createInv } from '../../factoriesAny.js';\nexport var invDependencies = {\n absDependencies,\n addScalarDependencies,\n detDependencies,\n divideScalarDependencies,\n identityDependencies,\n matrixDependencies,\n multiplyDependencies,\n typedDependencies,\n unaryMinusDependencies,\n createInv\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { lupDependencies } from './dependenciesLup.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { multiplyDependencies } from './dependenciesMultiply.generated.js';\nimport { subtractDependencies } from './dependenciesSubtract.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';\nimport { createDet } from '../../factoriesAny.js';\nexport var detDependencies = {\n lupDependencies,\n matrixDependencies,\n multiplyDependencies,\n subtractDependencies,\n typedDependencies,\n unaryMinusDependencies,\n createDet\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';\nimport { SpaDependencies } from './dependenciesSpaClass.generated.js';\nimport { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';\nimport { absDependencies } from './dependenciesAbs.generated.js';\nimport { addScalarDependencies } from './dependenciesAddScalar.generated.js';\nimport { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';\nimport { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';\nimport { largerDependencies } from './dependenciesLarger.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';\nimport { subtractDependencies } from './dependenciesSubtract.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';\nimport { createLup } from '../../factoriesAny.js';\nexport var lupDependencies = {\n DenseMatrixDependencies,\n SpaDependencies,\n SparseMatrixDependencies,\n absDependencies,\n addScalarDependencies,\n divideScalarDependencies,\n equalScalarDependencies,\n largerDependencies,\n matrixDependencies,\n multiplyScalarDependencies,\n subtractDependencies,\n typedDependencies,\n unaryMinusDependencies,\n createLup\n};","import { isMatrix } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { format } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'det';\nvar dependencies = ['typed', 'matrix', 'subtract', 'multiply', 'unaryMinus', 'lup'];\nexport var createDet = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n matrix,\n subtract,\n multiply,\n unaryMinus,\n lup\n } = _ref;\n\n /**\n * Calculate the determinant of a matrix.\n *\n * Syntax:\n *\n * math.det(x)\n *\n * Examples:\n *\n * math.det([[1, 2], [3, 4]]) // returns -2\n *\n * const A = [\n * [-2, 2, 3],\n * [-1, 1, 3],\n * [2, 0, -1]\n * ]\n * math.det(A) // returns 6\n *\n * See also:\n *\n * inv\n *\n * @param {Array | Matrix} x A matrix\n * @return {number} The determinant of `x`\n */\n return typed(name, {\n any: function any(x) {\n return clone(x);\n },\n 'Array | Matrix': function det(x) {\n var size;\n\n if (isMatrix(x)) {\n size = x.size();\n } else if (Array.isArray(x)) {\n x = matrix(x);\n size = x.size();\n } else {\n // a scalar\n size = [];\n }\n\n switch (size.length) {\n case 0:\n // scalar\n return clone(x);\n\n case 1:\n // vector\n if (size[0] === 1) {\n return clone(x.valueOf()[0]);\n } else {\n throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n }\n\n case 2:\n {\n // two dimensional array\n var rows = size[0];\n var cols = size[1];\n\n if (rows === cols) {\n return _det(x.clone().valueOf(), rows, cols);\n } else {\n throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n }\n }\n\n default:\n // multi dimensional array\n throw new RangeError('Matrix must be two dimensional ' + '(size: ' + format(size) + ')');\n }\n }\n });\n /**\n * Calculate the determinant of a matrix\n * @param {Array[]} matrix A square, two dimensional matrix\n * @param {number} rows Number of rows of the matrix (zero-based)\n * @param {number} cols Number of columns of the matrix (zero-based)\n * @returns {number} det\n * @private\n */\n\n function _det(matrix, rows, cols) {\n if (rows === 1) {\n // this is a 1 x 1 matrix\n return clone(matrix[0][0]);\n } else if (rows === 2) {\n // this is a 2 x 2 matrix\n // the determinant of [a11,a12;a21,a22] is det = a11*a22-a21*a12\n return subtract(multiply(matrix[0][0], matrix[1][1]), multiply(matrix[1][0], matrix[0][1]));\n } else {\n // Compute the LU decomposition\n var decomp = lup(matrix); // The determinant is the product of the diagonal entries of U (and those of L, but they are all 1)\n\n var det = decomp.U[0][0];\n\n for (var _i = 1; _i < rows; _i++) {\n det = multiply(det, decomp.U[_i][_i]);\n } // The determinant will be multiplied by 1 or -1 depending on the parity of the permutation matrix.\n // This can be determined by counting the cycles. This is roughly a linear time algorithm.\n\n\n var evenCycles = 0;\n var i = 0;\n var visited = [];\n\n while (true) {\n while (visited[i]) {\n i++;\n }\n\n if (i >= rows) break;\n var j = i;\n var cycleLen = 0;\n\n while (!visited[decomp.p[j]]) {\n visited[decomp.p[j]] = true;\n j = decomp.p[j];\n cycleLen++;\n }\n\n if (cycleLen % 2 === 0) {\n evenCycles++;\n }\n }\n\n return evenCycles % 2 === 0 ? det : unaryMinus(det);\n }\n }\n});","import { isMatrix } from '../../utils/is.js';\nimport { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { format } from '../../utils/string.js';\nvar name = 'inv';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'addScalar', 'multiply', 'unaryMinus', 'det', 'identity', 'abs'];\nexport var createInv = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n matrix,\n divideScalar,\n addScalar,\n multiply,\n unaryMinus,\n det,\n identity,\n abs\n } = _ref;\n\n /**\n * Calculate the inverse of a square matrix.\n *\n * Syntax:\n *\n * math.inv(x)\n *\n * Examples:\n *\n * math.inv([[1, 2], [3, 4]]) // returns [[-2, 1], [1.5, -0.5]]\n * math.inv(4) // returns 0.25\n * 1 / 4 // returns 0.25\n *\n * See also:\n *\n * det, transpose\n *\n * @param {number | Complex | Array | Matrix} x Matrix to be inversed\n * @return {number | Complex | Array | Matrix} The inverse of `x`.\n */\n return typed(name, {\n 'Array | Matrix': function ArrayMatrix(x) {\n var size = isMatrix(x) ? x.size() : arraySize(x);\n\n switch (size.length) {\n case 1:\n // vector\n if (size[0] === 1) {\n if (isMatrix(x)) {\n return matrix([divideScalar(1, x.valueOf()[0])]);\n } else {\n return [divideScalar(1, x[0])];\n }\n } else {\n throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n }\n\n case 2:\n // two dimensional array\n {\n var rows = size[0];\n var cols = size[1];\n\n if (rows === cols) {\n if (isMatrix(x)) {\n return matrix(_inv(x.valueOf(), rows, cols), x.storage());\n } else {\n // return an Array\n return _inv(x, rows, cols);\n }\n } else {\n throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n }\n }\n\n default:\n // multi dimensional array\n throw new RangeError('Matrix must be two dimensional ' + '(size: ' + format(size) + ')');\n }\n },\n any: function any(x) {\n // scalar\n return divideScalar(1, x); // FIXME: create a BigNumber one when configured for bignumbers\n }\n });\n /**\n * Calculate the inverse of a square matrix\n * @param {Array[]} mat A square matrix\n * @param {number} rows Number of rows\n * @param {number} cols Number of columns, must equal rows\n * @return {Array[]} inv Inverse matrix\n * @private\n */\n\n function _inv(mat, rows, cols) {\n var r, s, f, value, temp;\n\n if (rows === 1) {\n // this is a 1 x 1 matrix\n value = mat[0][0];\n\n if (value === 0) {\n throw Error('Cannot calculate inverse, determinant is zero');\n }\n\n return [[divideScalar(1, value)]];\n } else if (rows === 2) {\n // this is a 2 x 2 matrix\n var d = det(mat);\n\n if (d === 0) {\n throw Error('Cannot calculate inverse, determinant is zero');\n }\n\n return [[divideScalar(mat[1][1], d), divideScalar(unaryMinus(mat[0][1]), d)], [divideScalar(unaryMinus(mat[1][0]), d), divideScalar(mat[0][0], d)]];\n } else {\n // this is a matrix of 3 x 3 or larger\n // calculate inverse using gauss-jordan elimination\n // https://en.wikipedia.org/wiki/Gaussian_elimination\n // http://mathworld.wolfram.com/MatrixInverse.html\n // http://math.uww.edu/~mcfarlat/inverse.htm\n // make a copy of the matrix (only the arrays, not of the elements)\n var A = mat.concat();\n\n for (r = 0; r < rows; r++) {\n A[r] = A[r].concat();\n } // create an identity matrix which in the end will contain the\n // matrix inverse\n\n\n var B = identity(rows).valueOf(); // loop over all columns, and perform row reductions\n\n for (var c = 0; c < cols; c++) {\n // Pivoting: Swap row c with row r, where row r contains the largest element A[r][c]\n var ABig = abs(A[c][c]);\n var rBig = c;\n r = c + 1;\n\n while (r < rows) {\n if (abs(A[r][c]) > ABig) {\n ABig = abs(A[r][c]);\n rBig = r;\n }\n\n r++;\n }\n\n if (ABig === 0) {\n throw Error('Cannot calculate inverse, determinant is zero');\n }\n\n r = rBig;\n\n if (r !== c) {\n temp = A[c];\n A[c] = A[r];\n A[r] = temp;\n temp = B[c];\n B[c] = B[r];\n B[r] = temp;\n } // eliminate non-zero values on the other rows at column c\n\n\n var Ac = A[c];\n var Bc = B[c];\n\n for (r = 0; r < rows; r++) {\n var Ar = A[r];\n var Br = B[r];\n\n if (r !== c) {\n // eliminate value at column c and row r\n if (Ar[c] !== 0) {\n f = divideScalar(unaryMinus(Ar[c]), Ac[c]); // add (f * row c) to row r to eliminate the value\n // at column c\n\n for (s = c; s < cols; s++) {\n Ar[s] = addScalar(Ar[s], multiply(f, Ac[s]));\n }\n\n for (s = 0; s < cols; s++) {\n Br[s] = addScalar(Br[s], multiply(f, Bc[s]));\n }\n }\n } else {\n // normalize value at Acc to 1,\n // divide each value on row r with the value at Acc\n f = Ac[c];\n\n for (s = c; s < cols; s++) {\n Ar[s] = divideScalar(Ar[s], f);\n }\n\n for (s = 0; s < cols; s++) {\n Br[s] = divideScalar(Br[s], f);\n }\n }\n }\n }\n\n return B;\n }\n }\n});","import { factory } from '../../utils/factory.js';\nimport { extend } from '../../utils/object.js';\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';\nvar name = 'divide';\nvar dependencies = ['typed', 'matrix', 'multiply', 'equalScalar', 'divideScalar', 'inv'];\nexport var createDivide = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n matrix,\n multiply,\n equalScalar,\n divideScalar,\n inv\n } = _ref;\n var algorithm11 = createAlgorithm11({\n typed,\n equalScalar\n });\n var algorithm14 = createAlgorithm14({\n typed\n });\n /**\n * Divide two values, `x / y`.\n * To divide matrices, `x` is multiplied with the inverse of `y`: `x * inv(y)`.\n *\n * Syntax:\n *\n * math.divide(x, y)\n *\n * Examples:\n *\n * math.divide(2, 3) // returns number 0.6666666666666666\n *\n * const a = math.complex(5, 14)\n * const b = math.complex(4, 1)\n * math.divide(a, b) // returns Complex 2 + 3i\n *\n * const c = [[7, -6], [13, -4]]\n * const d = [[1, 2], [4, 3]]\n * math.divide(c, d) // returns Array [[-9, 4], [-11, 6]]\n *\n * const e = math.unit('18 km')\n * math.divide(e, 4.5) // returns Unit 4 km\n *\n * See also:\n *\n * multiply\n *\n * @param {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Numerator\n * @param {number | BigNumber | Fraction | Complex | Array | Matrix} y Denominator\n * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Quotient, `x / y`\n */\n\n return typed('divide', extend({\n // we extend the signatures of divideScalar with signatures dealing with matrices\n 'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(x, y) {\n // TODO: implement matrix right division using pseudo inverse\n // https://www.mathworks.nl/help/matlab/ref/mrdivide.html\n // https://www.gnu.org/software/octave/doc/interpreter/Arithmetic-Ops.html\n // https://stackoverflow.com/questions/12263932/how-does-gnu-octave-matrix-division-work-getting-unexpected-behaviour\n return multiply(x, inv(y));\n },\n 'DenseMatrix, any': function DenseMatrixAny(x, y) {\n return algorithm14(x, y, divideScalar, false);\n },\n 'SparseMatrix, any': function SparseMatrixAny(x, y) {\n return algorithm11(x, y, divideScalar, false);\n },\n 'Array, any': function ArrayAny(x, y) {\n // use matrix implementation\n return algorithm14(matrix(x), y, divideScalar, false).valueOf();\n },\n 'any, Array | Matrix': function anyArrayMatrix(x, y) {\n return multiply(x, inv(y));\n }\n }, divideScalar.signatures));\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'algorithm02';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createAlgorithm02 = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n equalScalar\n } = _ref;\n\n /**\n * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).\n * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).\n *\n *\n * ┌ f(Dij, Sij) ; S(i,j) !== 0\n * C(i,j) = ┤\n * └ 0 ; otherwise\n *\n *\n * @param {Matrix} denseMatrix The DenseMatrix instance (D)\n * @param {Matrix} sparseMatrix The SparseMatrix instance (S)\n * @param {Function} callback The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)\n * @param {boolean} inverse A true value indicates callback should be invoked f(Sij,Dij)\n *\n * @return {Matrix} SparseMatrix (C)\n *\n * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571\n */\n return function algorithm02(denseMatrix, sparseMatrix, callback, inverse) {\n // dense matrix arrays\n var adata = denseMatrix._data;\n var asize = denseMatrix._size;\n var adt = denseMatrix._datatype; // sparse matrix arrays\n\n var bvalues = sparseMatrix._values;\n var bindex = sparseMatrix._index;\n var bptr = sparseMatrix._ptr;\n var bsize = sparseMatrix._size;\n var bdt = sparseMatrix._datatype; // validate dimensions\n\n if (asize.length !== bsize.length) {\n throw new DimensionError(asize.length, bsize.length);\n } // check rows & columns\n\n\n if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n } // sparse matrix cannot be a Pattern matrix\n\n\n if (!bvalues) {\n throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n } // rows & columns\n\n\n var rows = asize[0];\n var columns = asize[1]; // datatype\n\n var dt; // equal signature to use\n\n var eq = equalScalar; // zero value\n\n var zero = 0; // callback signature to use\n\n var cf = callback; // process data types\n\n if (typeof adt === 'string' && adt === bdt) {\n // datatype\n dt = adt; // find signature that matches (dt, dt)\n\n eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n zero = typed.convert(0, dt); // callback\n\n cf = typed.find(callback, [dt, dt]);\n } // result (SparseMatrix)\n\n\n var cvalues = [];\n var cindex = [];\n var cptr = []; // loop columns in b\n\n for (var j = 0; j < columns; j++) {\n // update cptr\n cptr[j] = cindex.length; // values in column j\n\n for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n // row\n var i = bindex[k]; // update C(i,j)\n\n var cij = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]); // check for nonzero\n\n if (!eq(cij, zero)) {\n // push i & v\n cindex.push(i);\n cvalues.push(cij);\n }\n }\n } // update cptr\n\n\n cptr[columns] = cindex.length; // return sparse matrix\n\n return sparseMatrix.createSparseMatrix({\n values: cvalues,\n index: cindex,\n ptr: cptr,\n size: [rows, columns],\n datatype: dt\n });\n };\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';\nimport { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createMod } from '../../factoriesAny.js';\nexport var modDependencies = {\n DenseMatrixDependencies,\n equalScalarDependencies,\n matrixDependencies,\n typedDependencies,\n createMod\n};","import { factory } from '../../utils/factory.js';\nimport { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js';\nimport { createAlgorithm03 } from '../../type/matrix/utils/algorithm03.js';\nimport { createAlgorithm05 } from '../../type/matrix/utils/algorithm05.js';\nimport { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';\nimport { createAlgorithm12 } from '../../type/matrix/utils/algorithm12.js';\nimport { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';\nimport { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';\nimport { modNumber } from '../../plain/number/index.js';\nvar name = 'mod';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];\nexport var createMod = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed,\n matrix,\n equalScalar,\n DenseMatrix\n } = _ref;\n var algorithm02 = createAlgorithm02({\n typed,\n equalScalar\n });\n var algorithm03 = createAlgorithm03({\n typed\n });\n var algorithm05 = createAlgorithm05({\n typed,\n equalScalar\n });\n var algorithm11 = createAlgorithm11({\n typed,\n equalScalar\n });\n var algorithm12 = createAlgorithm12({\n typed,\n DenseMatrix\n });\n var algorithm13 = createAlgorithm13({\n typed\n });\n var algorithm14 = createAlgorithm14({\n typed\n });\n /**\n * Calculates the modulus, the remainder of an integer division.\n *\n * For matrices, the function is evaluated element wise.\n *\n * The modulus is defined as:\n *\n * x - y * floor(x / y)\n *\n * See https://en.wikipedia.org/wiki/Modulo_operation.\n *\n * Syntax:\n *\n * math.mod(x, y)\n *\n * Examples:\n *\n * math.mod(8, 3) // returns 2\n * math.mod(11, 2) // returns 1\n *\n * function isOdd(x) {\n * return math.mod(x, 2) != 0\n * }\n *\n * isOdd(2) // returns false\n * isOdd(3) // returns true\n *\n * See also:\n *\n * divide\n *\n * @param {number | BigNumber | Fraction | Array | Matrix} x Dividend\n * @param {number | BigNumber | Fraction | Array | Matrix} y Divisor\n * @return {number | BigNumber | Fraction | Array | Matrix} Returns the remainder of `x` divided by `y`.\n */\n\n return typed(name, {\n 'number, number': modNumber,\n 'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n if (y.isNeg()) {\n throw new Error('Cannot calculate mod for a negative divisor');\n }\n\n return y.isZero() ? x : x.mod(y);\n },\n 'Fraction, Fraction': function FractionFraction(x, y) {\n if (y.compare(0) < 0) {\n throw new Error('Cannot calculate mod for a negative divisor');\n } // Workaround suggested in Fraction.js library to calculate correct modulo for negative dividend\n\n\n return x.compare(0) >= 0 ? x.mod(y) : x.mod(y).add(y).mod(y);\n },\n 'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n return algorithm05(x, y, this, false);\n },\n 'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n return algorithm02(y, x, this, true);\n },\n 'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n return algorithm03(x, y, this, false);\n },\n 'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n return algorithm13(x, y, this);\n },\n 'Array, Array': function ArrayArray(x, y) {\n // use matrix implementation\n return this(matrix(x), matrix(y)).valueOf();\n },\n 'Array, Matrix': function ArrayMatrix(x, y) {\n // use matrix implementation\n return this(matrix(x), y);\n },\n 'Matrix, Array': function MatrixArray(x, y) {\n // use matrix implementation\n return this(x, matrix(y));\n },\n 'SparseMatrix, any': function SparseMatrixAny(x, y) {\n return algorithm11(x, y, this, false);\n },\n 'DenseMatrix, any': function DenseMatrixAny(x, y) {\n return algorithm14(x, y, this, false);\n },\n 'any, SparseMatrix': function anySparseMatrix(x, y) {\n return algorithm12(y, x, this, true);\n },\n 'any, DenseMatrix': function anyDenseMatrix(x, y) {\n return algorithm14(y, x, this, true);\n },\n 'Array, any': function ArrayAny(x, y) {\n // use matrix implementation\n return algorithm14(matrix(x), y, this, false).valueOf();\n },\n 'any, Array': function anyArray(x, y) {\n // use matrix implementation\n return algorithm14(matrix(y), x, this, true).valueOf();\n }\n });\n});","import {\n create,\n evaluateDependencies,\n addDependencies,\n divideDependencies,\n multiplyDependencies,\n modDependencies,\n} from 'mathjs';\nconst { evaluate } = create({\n evaluateDependencies,\n addDependencies,\n divideDependencies,\n multiplyDependencies,\n modDependencies,\n});\n\nconst cleanupInput = (input: string) => input.replace(/[^0-9,\\-+/*.%]/gi, '').replace(/,/gi, '.');\n\nexport const round = (val: number, precision = 2) => {\n const hunderd = Math.pow(10, precision);\n return Math.round(val * hunderd) / hunderd;\n};\n\nexport const getCalculatedValue = (value: string, roundPrecision = 2) => {\n const input = cleanupInput(value);\n\n if (input.length === 0 || input === null) return null;\n return round(evaluate(input), roundPrecision);\n};\n","import _extends from \"@babel/runtime/helpers/extends\";\nimport './../utils/polyfills.js';\nimport { deepFlatten, isLegacyFactory, values } from '../utils/object.js';\nimport * as emitter from './../utils/emitter.js';\nimport { importFactory } from './function/import.js';\nimport { configFactory } from './function/config.js';\nimport { factory, isFactory } from '../utils/factory.js';\nimport { isAccessorNode, isArray, isArrayNode, isAssignmentNode, isBigNumber, isBlockNode, isBoolean, isChain, isCollection, isComplex, isConditionalNode, isConstantNode, isDate, isDenseMatrix, isFraction, isFunction, isFunctionAssignmentNode, isFunctionNode, isHelp, isIndex, isIndexNode, isMatrix, isNode, isNull, isNumber, isObject, isObjectNode, isOperatorNode, isParenthesisNode, isRange, isRangeNode, isRegExp, isResultSet, isSparseMatrix, isString, isSymbolNode, isUndefined, isUnit } from '../utils/is.js';\nimport { ArgumentsError } from '../error/ArgumentsError.js';\nimport { DimensionError } from '../error/DimensionError.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { DEFAULT_CONFIG } from './config.js';\n/**\n * Create a mathjs instance from given factory functions and optionally config\n *\n * Usage:\n *\n * const mathjs1 = create({ createAdd, createMultiply, ...})\n * const config = { number: 'BigNumber' }\n * const mathjs2 = create(all, config)\n *\n * @param {Object} [factories] An object with factory functions\n * The object can contain nested objects,\n * all nested objects will be flattened.\n * @param {Object} [config] Available options:\n * {number} epsilon\n * Minimum relative difference between two\n * compared values, used by all comparison functions.\n * {string} matrix\n * A string 'Matrix' (default) or 'Array'.\n * {string} number\n * A string 'number' (default), 'BigNumber', or 'Fraction'\n * {number} precision\n * The number of significant digits for BigNumbers.\n * Not applicable for Numbers.\n * {boolean} predictable\n * Predictable output type of functions. When true,\n * output type depends only on the input types. When\n * false (default), output type can vary depending\n * on input values. For example `math.sqrt(-4)`\n * returns `complex('2i')` when predictable is false, and\n * returns `NaN` when true.\n * {string} randomSeed\n * Random seed for seeded pseudo random number generator.\n * Set to null to randomly seed.\n * @returns {Object} Returns a bare-bone math.js instance containing\n * functions:\n * - `import` to add new functions\n * - `config` to change configuration\n * - `on`, `off`, `once`, `emit` for events\n */\n\nexport function create(factories, config) {\n var configInternal = _extends({}, DEFAULT_CONFIG, config); // simple test for ES5 support\n\n\n if (typeof Object.create !== 'function') {\n throw new Error('ES5 not supported by this JavaScript engine. ' + 'Please load the es5-shim and es5-sham library for compatibility.');\n } // create the mathjs instance\n\n\n var math = emitter.mixin({\n // only here for backward compatibility for legacy factory functions\n isNumber,\n isComplex,\n isBigNumber,\n isFraction,\n isUnit,\n isString,\n isArray,\n isMatrix,\n isCollection,\n isDenseMatrix,\n isSparseMatrix,\n isRange,\n isIndex,\n isBoolean,\n isResultSet,\n isHelp,\n isFunction,\n isDate,\n isRegExp,\n isObject,\n isNull,\n isUndefined,\n isAccessorNode,\n isArrayNode,\n isAssignmentNode,\n isBlockNode,\n isConditionalNode,\n isConstantNode,\n isFunctionAssignmentNode,\n isFunctionNode,\n isIndexNode,\n isNode,\n isObjectNode,\n isOperatorNode,\n isParenthesisNode,\n isRangeNode,\n isSymbolNode,\n isChain\n }); // load config function and apply provided config\n\n math.config = configFactory(configInternal, math.emit);\n math.expression = {\n transform: {},\n mathWithTransform: {\n config: math.config\n }\n }; // cached factories and instances used by function load\n\n var legacyFactories = [];\n var legacyInstances = [];\n /**\n * Load a function or data type from a factory.\n * If the function or data type already exists, the existing instance is\n * returned.\n * @param {Function} factory\n * @returns {*}\n */\n\n function load(factory) {\n if (isFactory(factory)) {\n return factory(math);\n }\n\n var firstProperty = factory[Object.keys(factory)[0]];\n\n if (isFactory(firstProperty)) {\n return firstProperty(math);\n }\n\n if (!isLegacyFactory(factory)) {\n console.warn('Factory object with properties `type`, `name`, and `factory` expected', factory);\n throw new Error('Factory object with properties `type`, `name`, and `factory` expected');\n }\n\n var index = legacyFactories.indexOf(factory);\n var instance;\n\n if (index === -1) {\n // doesn't yet exist\n if (factory.math === true) {\n // pass with math namespace\n instance = factory.factory(math.type, configInternal, load, math.typed, math);\n } else {\n instance = factory.factory(math.type, configInternal, load, math.typed);\n } // append to the cache\n\n\n legacyFactories.push(factory);\n legacyInstances.push(instance);\n } else {\n // already existing function, return the cached instance\n instance = legacyInstances[index];\n }\n\n return instance;\n }\n\n var importedFactories = {}; // load the import function\n\n function lazyTyped() {\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n return math.typed.apply(math.typed, args);\n }\n\n var internalImport = importFactory(lazyTyped, load, math, importedFactories);\n math.import = internalImport; // listen for changes in config, import all functions again when changed\n // TODO: move this listener into the import function?\n\n math.on('config', () => {\n values(importedFactories).forEach(factory => {\n if (factory && factory.meta && factory.meta.recreateOnConfigChange) {\n // FIXME: only re-create when the current instance is the same as was initially created\n // FIXME: delete the functions/constants before importing them again?\n internalImport(factory, {\n override: true\n });\n }\n });\n }); // the create function exposed on the mathjs instance is bound to\n // the factory functions passed before\n\n math.create = create.bind(null, factories); // export factory function\n\n math.factory = factory; // import the factory functions like createAdd as an array instead of object,\n // else they will get a different naming (`createAdd` instead of `add`).\n\n math.import(values(deepFlatten(factories)));\n math.ArgumentsError = ArgumentsError;\n math.DimensionError = DimensionError;\n math.IndexError = IndexError;\n return math;\n}","import Emitter from 'tiny-emitter';\n/**\n * Extend given object with emitter functions `on`, `off`, `once`, `emit`\n * @param {Object} obj\n * @return {Object} obj\n */\n\nexport function mixin(obj) {\n // create event emitter\n var emitter = new Emitter(); // bind methods to obj (we don't want to expose the emitter.e Array...)\n\n obj.on = emitter.on.bind(emitter);\n obj.off = emitter.off.bind(emitter);\n obj.once = emitter.once.bind(emitter);\n obj.emit = emitter.emit.bind(emitter);\n return obj;\n}","import { EditorResponse } from '../types/CommonTypes';\n\nexport function getEditorResponseData<T>(response: EditorResponse<unknown>, parse = true): EditorResponse<T> {\n return {\n ...response,\n parsedData:\n response.success && response.data\n ? parse\n ? (JSON.parse(response.data as string) as T)\n : (response.data as unknown as T)\n : null,\n };\n}\n\nexport function castToEditorResponse(toCast: unknown): EditorResponse<unknown> {\n return {\n status: 200,\n success: true,\n parsedData: null,\n data: JSON.stringify(toCast),\n };\n}\n","// FramePropertiesDto\nimport { ColorUsage } from './ColorStyleTypes';\nimport { Id, PropertyState } from './CommonTypes';\nimport { ShapeType } from './ShapeTypes';\n\nexport type FrameLayoutType = {\n frameId: Id;\n layoutId: Id;\n x: PropertyState<number>;\n y: PropertyState<number>;\n width: PropertyState<number>;\n height: PropertyState<number>;\n rotationDegrees: PropertyState<number>;\n scaleX: PropertyState<number>;\n scaleY: PropertyState<number>;\n included: PropertyState<boolean>;\n fitMode: PropertyState<FitMode>;\n hasImageCrop: PropertyState<boolean>;\n minCopyfitting: PropertyState<number>;\n maxCopyfitting: PropertyState<number>;\n enableCopyfitting: PropertyState<boolean>;\n} | null;\n\n//Frame.image\nexport type FrameType = {\n frameId: Id;\n frameName: string;\n frameType: FrameTypeEnum;\n // `imageUrl` is not generic: should be removed from model\n imageUrl: string;\n blendMode: string;\n constrainProportions: boolean;\n};\n\nexport type Frame = TextFrame | ImageFrame | ShapeFrame;\n\nexport type ImageFrameVariableSource = {\n sourceType: ImageSourceTypeEnum.variable;\n variableId: string;\n};\n\nexport type ImageFrameUrlSource = {\n sourceType: ImageSourceTypeEnum.url;\n url: string;\n};\n\nexport type ImageFrameConnectorSource = {\n assetId: string;\n connectorId: string;\n sourceType: ImageSourceTypeEnum.connector;\n};\n\nexport type ImageFrameSource = ImageFrameUrlSource | ImageFrameConnectorSource | ImageFrameVariableSource;\n\n// used by new getter methods\nexport type ImageFrame = {\n frameId: Id;\n frameName: string;\n frameType: FrameTypeEnum.image;\n src?: ImageFrameSource;\n blendMode: BlendMode;\n constrainProportions: boolean;\n crop?: CropSettings | NoCropSettings;\n};\n\nexport type ShapeFrame = {\n frameId: Id;\n frameName: string;\n frameType: FrameTypeEnum.shape;\n blendMode: BlendMode;\n constrainProportions: boolean;\n shapeProperties: {\n enableFill: boolean;\n fillColor: ColorUsage;\n enableStroke: boolean;\n strokeWeight: number;\n strokeColor: ColorUsage;\n allCornersSame: boolean;\n };\n src: {\n shapeType: ShapeType;\n };\n};\n\nexport type TextFrame = {\n frameId: Id;\n frameName: string;\n frameType: FrameTypeEnum.text;\n textContent: string;\n paddingLeft: number;\n paddingTop: number;\n paddingRight: number;\n paddingBottom: number;\n numberOfColumn: number;\n columnGap: number;\n textDirection: TextDirection;\n flowDirection: FlowDirection;\n verticalAlign: VerticalAlign;\n textStroke: boolean;\n textStrokeWeight: number;\n textStrokeColor: number;\n hasClippingPath: boolean;\n blendMode: BlendMode;\n constrainProportions: boolean;\n};\n\nexport type CropSettings = {\n left: number;\n top: number;\n width: number;\n height: number;\n rotationDegrees: number;\n type: 'default';\n};\n\nexport type NoCropSettings = {\n type: 'noCrop';\n};\n\nexport enum ImageSourceTypeEnum {\n url = 'url',\n variable = 'variable',\n connector = 'assetProvider',\n}\n\nexport enum FrameTypeEnum {\n text = 'text',\n image = 'image',\n shape = 'shape',\n}\n\nexport enum TextDirection {\n leftToRight = 'leftToRight',\n rightToLeft = 'rightToLeft',\n weak = 'weak',\n}\n\nexport enum FlowDirection {\n horizontal = 'horizontal',\n vertical = 'vertical',\n onPath = 'onPath',\n}\n\nexport enum VerticalAlign {\n top = 'top',\n bottom = 'bottom',\n middle = 'middle',\n justify = 'justify',\n}\n\nexport enum BlendMode {\n normal = 'normal',\n screen = 'screen',\n overlay = 'overlay',\n darken = 'darken',\n lighten = 'lighten',\n colorDodge = 'colorDodge',\n colorBurn = 'colorBurn',\n hardLight = 'hardLight',\n softLight = 'softLight',\n difference = 'difference',\n exclusion = 'exclusion',\n multiply = 'multiply',\n hue = 'hue',\n saturation = 'saturation',\n color = 'color',\n luminosity = 'luminosity',\n}\n\nexport enum FitMode {\n fit = 'fit',\n fill = 'fill',\n}\n\nexport enum UpdateZIndexMethod {\n bringToFront = 'bringToFront',\n sendToBack = 'sendToBack',\n bringForward = 'bringForward',\n sendBackward = 'sendBackward',\n}\n","import { EditorAPI, Id } from '../types/CommonTypes';\nimport { ColorUsage } from '../types/ColorStyleTypes';\nimport { CornerRadius, ShapeProperties } from '../types/ShapeTypes';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\n\n/**\n * The ShapeController is responsible for all communication regarding Shapes.\n * Methods inside this controller can be called by `window.SDK.shape.{method-name}`\n */\nexport class ShapeController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n }\n\n /**\n * This method updates properties of the shape\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param properties A property to update\n * @returns\n */\n private setShapeProperties = async (shapeFrameId: Id, properties: ShapeProperties) => {\n const res = await this.#editorAPI;\n return res\n .setShapeProperties(shapeFrameId, JSON.stringify(properties))\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will set the visibility of the shape fill.\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param enableFill Whether the shape fill is visible.\n * @returns\n */\n setEnableFill = async (shapeFrameId: Id, enableFill: boolean) => {\n const properties: ShapeProperties = { enableFill: enableFill };\n return this.setShapeProperties(shapeFrameId, properties);\n };\n\n /**\n * This method will set the shape fill color of a specified shape frame.\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param fillColor The new shape fill color that you want to set to the shapeFrame.\n * @returns\n */\n setFillColor = async (shapeFrameId: Id, fillColor: ColorUsage) => {\n const properties: ShapeProperties = { fillColor: fillColor };\n return this.setShapeProperties(shapeFrameId, properties);\n };\n\n /**\n * This method will set the visibility of the shape stroke.\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param enableStroke Whether the shape stroke is visible.\n * @returns\n */\n setEnableStroke = async (shapeFrameId: Id, enableStroke: boolean) => {\n const properties: ShapeProperties = { enableStroke: enableStroke };\n return this.setShapeProperties(shapeFrameId, properties);\n };\n\n /**\n * This method will set the shape stroke color of a specified shape frame.\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param strokeColor The new shape stroke color that you want to set to the shapeFrame.\n * @returns\n */\n setStrokeColor = async (shapeFrameId: Id, strokeColor: ColorUsage) => {\n const properties: ShapeProperties = { strokeColor: strokeColor };\n return this.setShapeProperties(shapeFrameId, properties);\n };\n\n /**\n * This method will set the shape stroke weight of a specified shape frame.\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param strokeWeight The new shape stroke weight that you want to set to the shapeFrame.\n * @returns\n */\n setStrokeWeight = async (shapeFrameId: Id, strokeWeight: number) => {\n const properties: ShapeProperties = { strokeWeight: strokeWeight };\n return this.setShapeProperties(shapeFrameId, properties);\n };\n\n /**\n * This method will set the flag to change the way the rectangle shape corners will be changed: all at once or separately.\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param allCornersSame The new flag that you want to set to the shapeFrame.\n * @returns\n */\n setFlagAllCornersSame = async (shapeFrameId: Id, allCornersSame: boolean) => {\n const properties: ShapeProperties = { allCornersSame: allCornersSame };\n return this.setShapeProperties(shapeFrameId, properties);\n };\n\n /**\n * This method updates radii of the rectangle and polygon shapes\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param radius A radius object to update a desired corner;\n * @returns\n */\n private setShapeCorners = async (shapeFrameId: Id, radius: CornerRadius) => {\n const res = await this.#editorAPI;\n return res\n .setShapeCorners(shapeFrameId, JSON.stringify(radius))\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will set the radius for all corners of the rectangle and polygon shapes\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param radius A radius to update all corners at once;\n * @returns\n */\n setRadiusAll = async (shapeFrameId: Id, radius: number) => {\n const cornerRadius: CornerRadius = { radiusAll: radius };\n return this.setShapeCorners(shapeFrameId, cornerRadius);\n };\n\n /**\n * This method will set the radius for the top left corner of the rectangle shape\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param radius A radius to update the top left corner;\n * @returns\n */\n setRadiusTopLeft = async (shapeFrameId: Id, radius: number) => {\n const cornerRadius: CornerRadius = { topLeft: radius };\n return this.setShapeCorners(shapeFrameId, cornerRadius);\n };\n\n /**\n * This method will set the radius for the bottom left corner of the rectangle shape\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param radius A radius to update the bottom left corner;\n * @returns\n */\n setRadiusBottomLeft = async (shapeFrameId: Id, radius: number) => {\n const cornerRadius: CornerRadius = { bottomLeft: radius };\n return this.setShapeCorners(shapeFrameId, cornerRadius);\n };\n\n /**\n * This method will set the radius for the top right corner of the rectangle shape\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param radius A radius to update the top right corner;\n * @returns\n */\n setRadiusTopRight = async (shapeFrameId: Id, radius: number) => {\n const cornerRadius: CornerRadius = { topRight: radius };\n return this.setShapeCorners(shapeFrameId, cornerRadius);\n };\n\n /**\n * This method will set the radius for the bottom right corner of the rectangle shape\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param radius A radius to update the bottom right corner;\n * @returns\n */\n setRadiusBottomRight = async (shapeFrameId: Id, radius: number) => {\n const cornerRadius: CornerRadius = { bottomRight: radius };\n return this.setShapeCorners(shapeFrameId, cornerRadius);\n };\n}\n","import type { EditorAPI, Id } from '../types/CommonTypes';\nimport { getCalculatedValue } from '../utils/getCalculatedValue';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\nimport {\n BlendMode,\n FitMode,\n FrameLayoutType,\n FrameType,\n FrameTypeEnum,\n ImageFrameConnectorSource,\n ImageFrameSource,\n ImageFrameUrlSource,\n ImageSourceTypeEnum,\n UpdateZIndexMethod,\n VerticalAlign,\n} from '../types/FrameTypes';\nimport { ColorUsage } from '../types/ColorStyleTypes';\nimport { ShapeType } from '../types/ShapeTypes';\nimport { ShapeController } from './ShapeController';\n\n/**\n * The FrameController is responsible for all communication regarding Frames.\n * Methods inside this controller can be called by `window.SDK.frame.{method-name}`\n */\nexport class FrameController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n this.shapeController = new ShapeController(this.#editorAPI);\n }\n\n /**\n * This variable helps to redirect shapes related methods to newly introduced ShapeController\n * to avoid any breaking changes\n */\n private shapeController: ShapeController;\n /**\n * This method returns the list of frames\n * @returns\n */\n getFrames = async () => {\n const res = await this.#editorAPI;\n return res.getFrames().then((result) => getEditorResponseData<FrameType[]>(result));\n };\n\n /**\n * This method returns the list of selected frames\n * @returns\n */\n getSelectedFrames = async () => {\n const res = await this.#editorAPI;\n return res.getSelectedFrames().then((result) => getEditorResponseData<FrameType[]>(result));\n };\n\n /**\n * This method returns the list of frames by pageId\n * @param pageId The ID of a specific page\n * @returns\n */\n getFramesByPageId = async (pageId: Id) => {\n const res = await this.#editorAPI;\n return res.getFramesByPageId(pageId).then((result) => getEditorResponseData<FrameType[]>(result));\n };\n\n /**\n * This method returns a frame by its name\n * @param name The name of a specific frame\n * @returns\n */\n getFrameByName = async (name: string) => {\n const res = await this.#editorAPI;\n return res.getFrameByName(name).then((result) => getEditorResponseData<FrameType>(result));\n };\n\n /**\n * This method returns a frame by its id\n * @param id The ID of a specific frame\n * @returns\n */\n getFrameById = async (id: Id) => {\n const res = await this.#editorAPI;\n return res.getFrameById(id).then((result) => getEditorResponseData<FrameType>(result));\n };\n\n /**\n * This method returns all frame properties on current layout\n * @returns\n */\n getFramePropertiesOnSelectedLayout = async () => {\n const res = await this.#editorAPI;\n return res\n .getFramePropertiesOnSelectedLayout()\n .then((result) => getEditorResponseData<FrameLayoutType[]>(result));\n };\n\n /**\n * This method returns frame properties for a given frame and layout\n * @param frameId The ID of a specific frame\n * @param layoutId The ID of a specific layout\n * @returns\n */\n getFramePropertiesByFrameId = async (frameId: Id, layoutId?: Id) => {\n const res = await this.#editorAPI;\n return res\n .getFramePropertiesByFrameId(frameId, layoutId)\n .then((result) => getEditorResponseData<FrameLayoutType>(result));\n };\n\n /**\n * This method returns frame properties for a given layout\n * @param layoutId The ID of a specific layout\n * @returns\n */\n getFramesProperties = async (layoutId: Id) => {\n const res = await this.#editorAPI;\n return res.getFramesProperties(layoutId).then((result) => getEditorResponseData<FrameLayoutType[]>(result));\n };\n\n /**\n * This method will reset the frame size (width and height) to the frame's original value\n * @param frameId The ID of a specific frame\n * @returns\n */\n resetFrameSize = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.resetFrameSize(frameId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will select a specific frame\n * @param frameId The ID of a specific frame\n * @returns\n */\n selectFrame = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.selectFrames([frameId]).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will select multipleFrames\n * @param frameIds An array of all IDs you want to select\n * @returns\n */\n selectMultipleFrames = async (frameIds: Id[]) => {\n const res = await this.#editorAPI;\n return res.selectFrames(frameIds).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method changes the order of frames in the z-index list.\n * @param orderIndex The index in the list to move to\n * @param frameIdsToMove An array of all IDs you want to move to the given index\n * @returns\n */\n reorderFrames = async (orderIndex: number, frameIdsToMove: Id[]) => {\n const res = await this.#editorAPI;\n return res.reorderFrames(orderIndex, frameIdsToMove).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will update the z-index of a frame.\n * @param frameId The ID of the frame you want to change the z-index of\n * @param method The z-index update method to perform\n * @returns\n */\n setFrameZIndex = async (frameId: Id, method: UpdateZIndexMethod) => {\n const res = await this.#editorAPI;\n return res.setFrameZIndex(frameId, method).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will set the height of a specific frame\n * @param frameId The ID of a specific frame\n * @param value The string value that will be calculated (f.e. 1+1 will result in 2) The notation is in pixels\n * @returns\n */\n setFrameHeight = async (frameId: Id, value: string) => {\n const res = await this.#editorAPI;\n const calc = getCalculatedValue(value);\n if (calc === null || calc === Infinity) {\n return null;\n }\n\n return res\n .setFrameHeight(frameId, parseFloat(calc.toString()))\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will set the rotation angle of a specific frame\n * @param frameId The ID of a specific frame\n * @param value The string value that will be calculated (f.e. 1+1 will result in 2) The notation is in pixels\n * @returns\n */\n setFrameRotation = async (frameId: Id, value: string) => {\n const res = await this.#editorAPI;\n const calc = getCalculatedValue(value);\n if (calc === null || calc === Infinity) {\n return null;\n }\n\n return res\n .setFrameRotation(frameId, parseFloat(calc.toString()))\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will set the width of a specific frame\n * @param frameId The ID of a specific frame\n * @param value The string value that will be calculated (f.e. 1+1 will result in 2) The notation is in pixels\n * @returns\n */\n setFrameWidth = async (frameId: Id, value: string) => {\n const res = await this.#editorAPI;\n const calc = getCalculatedValue(value);\n if (calc === null || calc === Infinity) {\n return null;\n }\n\n return res\n .setFrameWidth(frameId, parseFloat(calc.toString()))\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will set the x value of a specific frame\n * @param frameId The ID of a specific frame\n * @param value The string value that will be calculated (f.e. 1+1 will result in 2) The notation is in pixels\n * @returns\n */\n setFrameX = async (frameId: Id, value: string) => {\n const res = await this.#editorAPI;\n const calc = getCalculatedValue(value);\n\n if (calc === null || calc === Infinity) {\n return null;\n }\n return res\n .setFrameX(frameId, parseFloat(calc.toString()))\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will set the y value of a specific frame\n * @param frameId The ID of a specific frame\n * @param value The string value that will be calculated (f.e. 1+1 will result in 2) The notation is in pixels\n * @returns\n */\n setFrameY = async (frameId: Id, value: string) => {\n const res = await this.#editorAPI;\n const calc = getCalculatedValue(value);\n\n if (calc === null || calc === Infinity) {\n return null;\n }\n\n return res\n .setFrameY(frameId, parseFloat(calc.toString()))\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will update the name of a specific frame\n * @param frameId The ID of a specific frame\n * @param frameName The new name that the frame should receive\n * @returns\n */\n setFrameName = async (frameId: Id, frameName: string) => {\n const res = await this.#editorAPI;\n return res.renameFrame(frameId, frameName).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will reset properties of a specific frame to their original values\n * @param frameId The ID of the frame that needs to get reset\n * @returns\n */\n resetFrame = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.resetFrame(frameId).then((result) => getEditorResponseData<null>(result));\n };\n /**\n * This method will reset the x value of a specific frame to its original value\n * @param frameId The ID of the frame that needs to get reset\n * @returns\n */\n resetFrameX = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.resetFrameX(frameId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will reset the y value of a specific frame to its original value\n * @param frameId The ID of the frame that needs to get reset\n * @returns\n */\n resetFrameY = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.resetFrameY(frameId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will reset the rotation value of a specific frame to its original value\n * @param frameId The ID of the frame that needs to get reset\n * @returns\n */\n resetFrameRotation = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.resetFrameRotation(frameId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will reset the width of a specific frame to its original value\n * @param frameId The ID of the frame that needs to get reset\n * @returns\n */\n resetFrameWidth = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.resetFrameWidth(frameId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will reset the height of a specific frame to its original value\n * @param frameId The ID of the frame that needs to get reset\n * @returns\n */\n resetFrameHeight = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.resetFrameHeight(frameId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will reset the fitMode property of a specific frame to its original value\n * @param frameId The ID of the frame that needs to get reset\n * @returns\n */\n resetImageFrameFitMode = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.resetImageFrameFitMode(frameId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will set the visibility property of a specified frame. If set to false the frame will be invisible and vice versa.\n * @param frameId The ID of the frame that needs to get updated\n * @param value True means the frame gets visible, false means the frame gets invisible\n * @returns\n */\n setFrameVisibility = async (frameId: Id, value: boolean) => {\n const res = await this.#editorAPI;\n return res.setFrameVisibility(frameId, value).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will remove a specific frame using the Id.\n * @param frameId The ID of the frame that needs to be deleted\n * @returns\n */\n removeFrame = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.removeFrame(frameId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will add a new frame of 'frameType' to the template positioned on the requested\n * coordinates.\n * @param frameType The type of frame to create\n * @param x X coordinate of the new frame within the template\n * @param y Y coordinate of the new frame within the template\n * @param width Width of the new frame within the template\n * @param height Height of the new frame within the template\n * @returns The newly created frame's ID\n */\n addFrame = async (frameType: FrameTypeEnum, x: number, y: number, width: number, height: number) => {\n const res = await this.#editorAPI;\n return res.addFrame(frameType, x, y, width, height).then((result) => getEditorResponseData<string>(result));\n };\n\n /**\n * This method will add a new frame of 'shapeType' type to the template positioned on the requested\n * coordinates.\n * @param shapeType The type of frame to create\n * @param x X coordinate of the new frame within the template\n * @param y Y coordinate of the new frame within the template\n * @param width Width of the new frame within the template\n * @param height Height of the new frame within the template\n * @returns The newly created frame's ID\n */\n addShapeFrame = async (shapeType: ShapeType, x: number, y: number, width: number, height: number) => {\n const res = await this.#editorAPI;\n return res.addFrame(shapeType, x, y, width, height).then((result) => getEditorResponseData<string>(result));\n };\n\n /**\n * This method sets or removes the image source to the ImageFrame\n * @param imageFrameId The ID of the imageFrame where an image needs to be assigned to\n * @param src A new image source\n * @returns\n */\n private updateImageSource = async (imageFrameId: Id, src: ImageFrameSource | null) => {\n const res = await this.#editorAPI;\n const srcJson = src !== null ? JSON.stringify(src) : null;\n return res.setImageSource(imageFrameId, srcJson).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method removes the image source from the ImageFrame\n * @param imageFrameId The ID of the imageFrame where an image needs to be removed from\n */\n removeImageSource = async (imageFrameId: string) => {\n return this.updateImageSource(imageFrameId, null);\n };\n\n /**\n * This method will assign an image from a mediaConnector to the correct ImageFrame\n * @param imageFrameId The ID of the imageFrame where an image needs to be assigned to\n * @param connectorId Unique Id of the media connector\n * @param resourceId Unique Id of the asset that you want to assign to the imageFrame\n * @returns\n */\n setImageFromConnector = async (imageFrameId: Id, connectorId: string, resourceId: string) => {\n const src: ImageFrameConnectorSource = {\n assetId: resourceId,\n connectorId: connectorId,\n sourceType: ImageSourceTypeEnum.connector,\n };\n return this.updateImageSource(imageFrameId, src);\n };\n\n /**\n * This method will assign an image from url to the correct ImageFrame\n * Make sure the url can be accessed by the editor.\n * @param imageFrameId The ID of the imageFrame where an image needs to be assigned to\n * @param url A valid image uri\n * @returns\n */\n setImageFromUrl = async (imageFrameId: Id, url: string) => {\n const src: ImageFrameUrlSource = { url: url, sourceType: ImageSourceTypeEnum.url };\n return this.updateImageSource(imageFrameId, src);\n };\n\n /**\n * This method will set the fitMode property of a specified image frame.\n * @param imageFrameId The ID of the imageFrame that needs to get updated.\n * @param fitMode The new fitMode that you want to set to the imageFrame.\n * @returns\n */\n setImageFrameFitMode = async (imageFrameId: Id, fitMode: FitMode) => {\n const res = await this.#editorAPI;\n return res.setImageFrameFitMode(imageFrameId, fitMode).then((result) => getEditorResponseData<null>(result));\n };\n /**\n * This method will set the constrainProportions property of a specified frame.\n * @param frameId The ID of the frame that needs to get updated.\n * @param constrainProportions The new constraint that you want to set to the frame.\n * @returns\n */\n setFrameConstrainProportions = async (frameId: Id, constrainProportions: boolean) => {\n const res = await this.#editorAPI;\n return res\n .setFrameConstrainProportions(frameId, constrainProportions)\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will set the vertical alignment property of a specified frame.\n * @param frameId The ID of the frame that needs to get updated\n * @param verticalAlign The new vertical alignment to be set to the frame.\n * @returns\n */\n setVerticalAlignment = async (frameId: Id, verticalAlign: VerticalAlign) => {\n const res = await this.#editorAPI;\n return res.setVerticalAlignment(frameId, verticalAlign).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will set the min copyFitting property of a specified frame.\n * @param frameId The ID of the frame that needs to get updated\n * @param value The new min copyFitting value to be set to the frame.\n * @returns\n */\n setMinCopyfitting = async (frameId: Id, value: string) => {\n const res = await this.#editorAPI;\n\n const calc = getCalculatedValue(value);\n if (calc === null || calc === Infinity) {\n return null;\n }\n\n return res\n .setMinCopyfitting(frameId, parseFloat(calc.toString()))\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will set the max copyFitting property of a specified frame.\n * @param frameId The ID of the frame that needs to get updated\n * @param value The new max copyFitting value to be set to the frame.\n * @returns\n */\n setMaxCopyfitting = async (frameId: Id, value: string) => {\n const res = await this.#editorAPI;\n\n const calc = getCalculatedValue(value);\n if (calc === null || calc === Infinity) {\n return null;\n }\n\n return res\n .setMaxCopyfitting(frameId, parseFloat(calc.toString()))\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will enable copyFitting on a specified frame.\n * @param frameId The ID of the frame that needs to get updated\n * @param value The new value to be set to the frame.\n * @returns\n */\n setEnableCopyfitting = async (frameId: Id, value: boolean) => {\n const res = await this.#editorAPI;\n return res.setEnableCopyfitting(frameId, value).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will reset the frame minCopyfitting to the frame's original value\n * @param frameId The ID of a specific frame\n * @returns\n */\n resetMinCopyfitting = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.resetMinCopyfitting(frameId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will reset the frame maxCopyfitting to the frame's original value\n * @param frameId The ID of a specific frame\n * @returns\n */\n resetMaxCopyfitting = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.resetMaxCopyfitting(frameId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will reset the frame enableCopyfitting to the frame's original value\n * @param frameId The ID of a specific frame\n * @returns\n */\n resetEnableCopyfitting = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.resetEnableCopyfitting(frameId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will set the visibility of the shape fill.\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param enableFill Whether the shape fill is visible.\n * @returns\n */\n setShapeFrameEnableFill = async (shapeFrameId: Id, enableFill: boolean) => {\n return this.shapeController.setEnableFill(shapeFrameId, enableFill);\n };\n\n /**\n * This method will set the shape fill color of a specified shape frame.\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param fillColor The new shape fill color that you want to set to the shapeFrame.\n * @returns\n */\n setShapeFrameFillColor = async (shapeFrameId: Id, fillColor: ColorUsage) => {\n return this.shapeController.setFillColor(shapeFrameId, fillColor);\n };\n\n /**\n * This method will set the visibility of the shape stroke.\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param enableStroke Whether the shape stroke is visible.\n * @returns\n */\n setShapeFrameEnableStroke = async (shapeFrameId: Id, enableStroke: boolean) => {\n return this.shapeController.setEnableStroke(shapeFrameId, enableStroke);\n };\n\n /**\n * This method will set the shape stroke color of a specified shape frame.\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param strokeColor The new shape stroke color that you want to set to the shapeFrame.\n * @returns\n */\n setShapeFrameStrokeColor = async (shapeFrameId: Id, strokeColor: ColorUsage) => {\n return this.shapeController.setStrokeColor(shapeFrameId, strokeColor);\n };\n\n /**\n * This method will set the shape stroke weight of a specified shape frame.\n * @param shapeFrameId The ID of the shapeFrame that needs to get updated.\n * @param strokeWeight The new shape stroke weight that you want to set to the shapeFrame.\n * @returns\n */\n setShapeFrameStrokeWeight = async (shapeFrameId: Id, strokeWeight: number) => {\n return this.shapeController.setStrokeWeight(shapeFrameId, strokeWeight);\n };\n\n /**\n * This method will set the blend mode of a specified shape frame\n * @param frameId The ID of a specific frame\n * @param blendMode The blend mode\n * @returns\n */\n setFrameBlendMode = async (frameId: Id, blendMode: BlendMode) => {\n const res = await this.#editorAPI;\n return res.setFrameBlendMode(frameId, blendMode).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will make the specified image frame go into cropping mode.\n * @param frameId The ID of a specific image frame\n * @returns\n */\n enterCropMode = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.enterCropMode(frameId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will exit cropping mode while saving the applied crop.\n * @returns\n */\n applyCropMode = async () => {\n const res = await this.#editorAPI;\n return res.applyCropMode().then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will reset the currently applied crop mode and apply the last selected fit mode again.\n * @param frameId The ID of a specific image frame\n * @returns\n */\n resetCropMode = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.resetCropMode(frameId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will exit cropping mode without saving the applied crop.\n * @returns\n */\n cancelCropMode = async () => {\n const res = await this.#editorAPI;\n return res.cancelCropMode().then((result) => getEditorResponseData<null>(result));\n };\n}\n","import { FrameAnimationPropertiesType } from '../types/AnimationTypes';\nimport { EditorAPI, Id } from '../types/CommonTypes';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\n\n/**\n * The AnimationController is responsible for all communication regarding Animations.\n * Methods inside this controller can be called by `window.SDK.animation.{method-name}`\n */\nexport class AnimationController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(children: EditorAPI) {\n this.#editorAPI = children;\n }\n\n /**\n * This method returns all animations on current layout\n * @returns\n */\n getAnimationsOnSelectedLayout = async () => {\n const res = await this.#editorAPI;\n return res\n .getAnimationsOnSelectedLayout()\n .then((result) => getEditorResponseData<FrameAnimationPropertiesType[]>(result));\n };\n\n /**\n * This method returns an animation for a given frame and layout\n * @param frameId The ID of a specific frame\n * @param layoutId The ID of a specific layout\n * @returns\n */\n getAnimationByFrameId = async (frameId: Id, layoutId?: Id) => {\n const res = await this.#editorAPI;\n return res\n .getAnimationByFrameId<string>(frameId, layoutId)\n .then((result) => getEditorResponseData<FrameAnimationPropertiesType>(result));\n };\n\n /**\n * This method returns the animations for a given layout\n * @param layoutId The ID of a specific layout\n * @returns\n */\n getAnimationsByLayoutId = async (layoutId: Id) => {\n const res = await this.#editorAPI;\n return res\n .getAnimationsByLayoutId(layoutId)\n .then((result) => getEditorResponseData<FrameAnimationPropertiesType>(result));\n };\n\n /**\n * This method sets the animation state for a certain Frame\n * @param animation\n * @returns\n */\n setFrameAnimation = async (animation: FrameAnimationPropertiesType) => {\n const res = await this.#editorAPI;\n return res\n .setFrameAnimation(JSON.stringify(animation))\n .then((result) =>\n getEditorResponseData<FrameAnimationPropertiesType>({ ...result, data: JSON.stringify(animation) }),\n );\n };\n\n /**\n * This method triggers the animation to play\n * @returns\n */\n playAnimation = async () => {\n const res = await this.#editorAPI;\n return res.playAnimation().then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method triggers the animation to pause\n * @returns\n */\n pauseAnimation = async () => {\n const res = await this.#editorAPI;\n return res.pauseAnimation().then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method sets the animation time to a certain time, expressed in miliseconds\n * @param timeInMS The time expressed in miliseconds\n * @returns\n */\n setScrubberPosition = async (timeInMS: number) => {\n const res = await this.#editorAPI;\n return res.setScrubberPosition(timeInMS);\n };\n\n /**\n * This method sets the total and maximum duration of the animation\n * @param timeInMS The time expressed in miliseconds\n * @returns\n */\n setAnimationDuration = async (timeInMS: number) => {\n const res = await this.#editorAPI;\n return res.setAnimationDuration(timeInMS).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method resets the animation to its initial state\n * @param frameId The id of a certain frame\n * @returns\n */\n resetFrameAnimation = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.resetFrameAnimation(frameId);\n };\n\n /**\n * This method resets the layout's animations and animation duration to its initial state\n * @returns\n */\n resetAnimation = async () => {\n const res = await this.#editorAPI;\n return res.resetAnimation();\n };\n}\n","import type { EditorAPI, EditorRawAPI, EditorResponse, Id } from '../types/CommonTypes';\nimport { getCalculatedValue } from '../utils/getCalculatedValue';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\nimport { Layout } from '../types/LayoutTypes';\nimport { CallSender } from 'penpal';\n\n/**\n * The LayoutController is responsible for all communication regarding Layouts.\n * Methods inside this controller can be called by `window.SDK.layout.{method-name}`\n */\nexport class LayoutController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n #blobAPI: EditorRawAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n this.#blobAPI = editorAPI as CallSender as EditorRawAPI;\n }\n\n /**\n * This method returns the list of layouts\n * @returns\n */\n getLayouts = async () => {\n const res = await this.#editorAPI;\n return res.getLayouts().then((result) => getEditorResponseData<Layout[]>(result));\n };\n\n /**\n * This method returns a layout by its id\n * @param id The ID of a specific layout\n * @returns\n */\n getLayoutById = async (id: Id) => {\n const res = await this.#editorAPI;\n return res.getLayoutById(id).then((result) => getEditorResponseData<Layout>(result));\n };\n\n /**\n * This method returns a layout by its name\n * @param name The name of a specific layout\n * @returns\n */\n getLayoutByName = async (name: string) => {\n const res = await this.#editorAPI;\n return res.getLayoutByName(name).then((result) => getEditorResponseData<Layout>(result));\n };\n\n /**\n * This method returns the selected layout\n * @returns\n */\n getSelectedLayout = async () => {\n const res = await this.#editorAPI;\n return res.getSelectedLayout().then((result) => getEditorResponseData<Layout>(result));\n };\n\n /**\n * This method will remove a specific layout\n * @param layoutId The ID of a specific layout\n * @returns\n */\n removeLayout = async (layoutId: Id) => {\n const res = await this.#editorAPI;\n return res.removeLayout(layoutId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will add a new child layout (a new layout is always child of a root / parentlayout)\n * @param parentId The ID of a specific layout, being the parent\n * @returns\n */\n addLayout = async (parentId: Id) => {\n const res = await this.#editorAPI;\n return res.addLayout(parentId).then((result) => getEditorResponseData<number>(result));\n };\n\n /**\n * This method will update the name of a specific layout\n * @param layoutId The ID of a specific layout\n * @param layoutName The new name that the layout should receive\n * @returns\n */\n setLayoutName = async (layoutId: Id, layoutName: string) => {\n const res = await this.#editorAPI;\n return res.renameLayout(layoutId, layoutName).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will select a specific layout\n * @param layoutId The ID of a specific layout\n * @returns\n */\n selectLayout = async (layoutId: Id) => {\n const res = await this.#editorAPI;\n return res.selectLayout(layoutId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will duplicate a specific layout\n * @param layoutId The ID of a specific layout\n * @returns\n */\n duplicateLayout = async (layoutId: Id) => {\n const res = await this.#editorAPI;\n return res.duplicateLayout(layoutId).then((result) => getEditorResponseData<number>(result));\n };\n\n /**\n * This method will reset a specific layout to its original value\n * @param layoutId The ID of a specific layout\n * @returns\n */\n resetLayout = async (layoutId: Id) => {\n const res = await this.#editorAPI;\n return res.resetLayout(layoutId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will set the height of the layout to a specific value\n * @param layoutId The ID of a specific layout\n * @param value The string value that will be calculated (f.e. 1+1 will result in 2) The notation is in pixels\n * @returns\n */\n setLayoutHeight = async (layoutId: Id, value: string) => {\n const res = await this.#editorAPI;\n const calc = getCalculatedValue(value);\n if (calc === null || calc === Infinity) {\n return null;\n }\n return res\n .setLayoutHeight(layoutId, parseFloat(calc.toString()))\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will set the width of the layout to a specific value\n * @param layoutId The ID of a specific layout\n * @param value The string value that will be calculated (f.e. 1+1 will result in 2) The notation is in pixels\n * @returns\n */\n setLayoutWidth = async (layoutId: Id, value: string) => {\n const res = await this.#editorAPI;\n const calc = getCalculatedValue(value);\n if (calc === null || calc === Infinity) {\n return null;\n }\n\n return res\n .setLayoutWidth(layoutId, parseFloat(calc.toString()))\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will reset the height of a specific layout to its original value\n * @param layoutId The ID of a specific layout\n * @returns\n */\n resetLayoutHeight = async (layoutId: Id) => {\n const res = await this.#editorAPI;\n return res.resetLayoutHeight(layoutId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will reset the width of a specific layout to its original value\n * @param layoutId The ID of a specific layout\n * @returns\n */\n resetLayoutWidth = async (layoutId: Id) => {\n const res = await this.#editorAPI;\n return res.resetLayoutWidth(layoutId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method returns a UInt8Array containing a PNG encoded image of the currently selected layout.\n * @returns UInt8Array snapshot of the current layout\n */\n getSelectedLayoutSnapshot = async () => {\n const res = await this.#blobAPI;\n return res.getPageSnapshot().then((result) => (result as Uint8Array) ?? (result as EditorResponse<null>));\n };\n}\n","export enum FrameProperyNames {\n FRAME_X = 'frameX',\n FRAME_Y = 'frameY',\n WIDTH = 'width',\n HEIGHT = 'height',\n FRAME_ROTATION = 'frameRotation',\n}\nexport enum LayoutProperyNames {\n LAYOUT_HEIGHT = 'layoutHeight',\n LAYOUT_WIDTH = 'layoutWidth',\n}\n\nexport enum renderURLs {\n BASE_URL = 'https://rendering.chili-publish-sandbox.online',\n}\nexport enum ToolType {\n SELECT = 'select',\n ZOOM = 'zoom',\n HAND = 'hand',\n IMAGE_FRAME = 'imageFrame',\n TEXT_FRAME = 'textFrame',\n SHAPE_RECT = 'rect',\n SHAPE_ELLIPSE = 'ellipse',\n SHAPE_POLYGON = 'polygon',\n}\nexport enum DownloadFormats {\n MP4 = 'mp4',\n GIF = 'gif',\n PNG = 'png',\n JPG = 'jpg',\n}\n","import { EditorAPI, Id } from '../types/CommonTypes';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\nimport { Page } from '../types/PageTypes';\nimport { getCalculatedValue } from '../utils/getCalculatedValue';\n\n/**\n * The PageController is responsible for all communication regarding Pages.\n * Methods inside this controller can be called by `window.SDK.page.{method-name}`\n */\nexport class PageController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n }\n\n /**\n * This method returns the list of pages\n * @returns\n */\n getPages = async () => {\n const res = await this.#editorAPI;\n return res.getPages().then((result) => getEditorResponseData<Page[]>(result));\n };\n\n /**\n * This method returns a page by its id\n * @param pageId The ID of a specific page\n * @returns\n */\n getPageById = async (pageId: Id) => {\n const res = await this.#editorAPI;\n return res.getPageById(pageId).then((result) => getEditorResponseData<Page>(result));\n };\n\n /**\n * This method will set the width of the page to a specific value.\n * This only works if the document is a project.\n * @param pageId The ID of a specific page\n * @param value The string value that will be calculated (f.e. 1+1 will result in 2) The notation is in pixels\n * @returns\n */\n setPageWidth = async (pageId: Id, value: string) => {\n const res = await this.#editorAPI;\n const calc = getCalculatedValue(value);\n\n if (calc === null || calc === Infinity) {\n return null;\n }\n\n return res\n .setPageWidth(pageId, parseFloat(calc.toString()))\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will set the height of the page to a specific value.\n * This only works if the document is a project.\n * @param pageId The ID of a specific page\n * @param value The string value that will be calculated (f.e. 1+1 will result in 2) The notation is in pixels\n * @returns\n */\n setPageHeight = async (pageId: Id, value: string) => {\n const res = await this.#editorAPI;\n const calc = getCalculatedValue(value);\n\n if (calc === null || calc === Infinity) {\n return null;\n }\n\n return res\n .setPageHeight(pageId, parseFloat(calc.toString()))\n .then((result) => getEditorResponseData<null>(result));\n };\n}\n","import { getCalculatedValue, round } from '../utils/getCalculatedValue';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\n\n/**\n * The UtilsController exposes a set of usefull utilities that can be used to make some repeated tasks a bit easier\n * Methods inside this controller can be called by `window.SDK.utils.{method-name}`\n */\nexport class UtilsController {\n /**\n * This method can calculate what's inside a string that represents a calculation (f.e. \"1 + 5 - 2\" will result in 4)\n * @param val the string value that needs to be calculated\n * @param precision the precision that the calculation should round to (f.e. if the return value is 5.012 and precision is 2, the endresult should be 5.01) 2 is also the default\n * @returns The calculated value or null in case that it can't be calculated\n */\n calculateFromString = (val: string, precision?: number) =>\n getEditorResponseData<number>({\n data: String(getCalculatedValue(val, precision)),\n success: true,\n status: 200,\n parsedData: null,\n });\n\n /**\n * This method can round a value to a certain precision, default is 2\n * @param val the value that needs to be rounded\n * @param precision the precision of the rounding operation\n * @returns The rounded value as a number\n */\n round = (val: number, precision?: number) =>\n getEditorResponseData<number>({\n data: String(round(val, precision)),\n success: true,\n status: 200,\n parsedData: null,\n });\n}\n","import { ConfigType } from '../types/CommonTypes';\nimport { ToolType } from '../utils/enums';\n\n/**\n * The SubscriberController is responsible for all listeners which can influence the aplication-state from outside.\n * Callbacks inside this controller can be set by `window.SDK.subscriber.{method-name}`\n */\nexport class SubscriberController {\n /**\n * @ignore\n */\n private config: ConfigType;\n\n /**\n * @ignore\n */\n constructor(config: ConfigType) {\n this.config = config;\n }\n\n /**\n * Listener on actions, if this changes, this listener will get triggered with the updates\n * @param actions Stringified array of DocumentAction type\n */\n onActionsChanged = (actions: string) => {\n const callBack = this.config.onActionsChanged;\n callBack && callBack(JSON.parse(actions));\n };\n\n /**\n * Listener on when a certain animation gets changed\n * @param animation Stringified array of FrameAnimationType\n */\n onAnimationChanged = (animation: string) => {\n const callBack = this.config.onFrameAnimationsChanged;\n callBack && callBack(JSON.parse(animation));\n };\n\n /**\n * Listener on the playbackstate of the animation, it contains the current time of the playback (in miliseconds) and a flag that describes if the animation is currently playing\n * @param animationPlaybackState Stringified array of AnimationPlaybackType\n */\n onAnimationPlaybackChanged = (animationPlaybackState: string) => {\n const callBack = this.config.onScrubberPositionChanged;\n callBack && callBack(JSON.parse(animationPlaybackState));\n };\n\n /**\n * Listener on the state of the currently selected layout, if its properties are changed, this listener will get triggered with the new properties\n * @param properties Stringified object of LayoutPropertiesType\n */\n onSelectedLayoutPropertiesChanged = (properties: string) => {\n const callBack = this.config.onSelectedLayoutPropertiesChanged;\n callBack && callBack(JSON.parse(properties));\n };\n\n /**\n * Listener on the state of the currently selected frame, if this changes, this listener will get triggered with the updates\n * @param layout Stringified object of FrameLayoutType\n */\n onSelectedFrameLayoutChanged = (frame: string) => {\n const callBack = this.config.onSelectedFrameLayoutChanged;\n callBack && callBack(JSON.parse(frame));\n };\n\n /**\n * Listener on the state of the currently selected frame, it contains some basic information on the type of frame it is\n * @param layout Stringified object of FrameType\n */\n onSelectedFrameContentChanged = (frame: string) => {\n const callBack = this.config.onSelectedFrameContentChanged;\n callBack && callBack(JSON.parse(frame));\n };\n\n /**\n * A listener on the general state of the document, gets triggered everytime a change is done on the document.\n */\n onStateChanged = () => {\n const callBack = this.config.onStateChanged;\n callBack && callBack();\n };\n\n /**\n * A listener on when the document is fully loaded.\n */\n onDocumentLoaded = () => {\n const callBack = this.config.onDocumentLoaded;\n callBack && callBack();\n };\n\n\n /**\n * To be implemented, gets triggered when clicking on the pageTitle on the canvas.\n */\n onPageSelectionChanged = () => {\n const callBack = this.config.onPageSelectionChanged;\n callBack && callBack();\n };\n\n /**\n * Listener on when variables change\n * @param variablesJson Stringified array of Variable\n */\n onVariableListChanged = (variablesJson: string) => {\n const callBack = this.config.onVariableListChanged;\n callBack && callBack(JSON.parse(variablesJson));\n };\n\n /**\n * Listener on when the tool has changed by the canvas\n * @param tool The string representation of a certain tool\n */\n onSelectedToolChanged = (tool: string) => {\n const callBack = this.config.onSelectedToolChanged;\n callBack && callBack(tool as ToolType);\n };\n\n /**\n * Listener on state changes\n * @param undoState Stringified object of UndoState\n */\n onUndoStateChanged = (undoState: string) => {\n const callBack = this.config.onUndoStackStateChanged;\n callBack && callBack(JSON.parse(undoState));\n };\n\n /**\n * Listener on the state of the currently selected layout's frames, if this changes, this listener will get triggered with the updates\n * @param frames Stringified object of Frames\n */\n onSelectedLayoutFramesChanged = (frames: string) => {\n const callBack = this.config.onSelectedLayoutFramesChanged;\n callBack && callBack(JSON.parse(frames));\n };\n\n /**\n * Listener on the state of the currently selected text's styles, if this changes, this listener will get triggered with the updates\n * @param styles Stringified object of styles\n */\n onSelectedTextStyleChanged = (styles: string) => {\n const callBack = this.config.onSelectedTextStyleChanged;\n callBack && callBack(JSON.parse(styles));\n };\n\n /**\n * Listener on the state of the currently selected color's styles, if this changes, this listener will get triggered with the updates\n * @param colors Stringified object of colors\n */\n onColorsChanged = (colors: string) => {\n const callBack = this.config.onColorsChanged;\n callBack && callBack(JSON.parse(colors));\n };\n\n /**\n * Listener on paragraph styles, if this changes, this listener will get triggered with the updates\n * @param paragraphStyles Stringified object of paragraph styles\n */\n onParagraphStylesChanged = (paragraphStyles: string) => {\n const callBack = this.config.onParagraphStylesChanged;\n callBack && callBack(JSON.parse(paragraphStyles));\n };\n\n /**\n * Listener on character styles, if this changes, this listener will get triggered with the updates\n * @param characterStyles Stringified object of character styles\n */\n onCharacterStylesChanged = (characterStyles: string) => {\n const callBack = this.config.onCharacterStylesChanged;\n callBack && callBack(JSON.parse(characterStyles));\n };\n\n /**\n * Listener on fonts, if this changes, this listener will get triggered with the updates\n * @param fonts Stringified object of fonts\n */\n onFontsChanged = (fonts: string) => {\n const callBack = this.config.onFontsChanged;\n callBack && callBack(JSON.parse(fonts));\n };\n\n /**\n * Listener on selected layout id, this listener will get triggered when a different layout is selected.\n * @param layoutId the currently selected layout id\n */\n onSelectedLayoutIdChanged = (layoutId: string) => {\n const callBack = this.config.onSelectedLayoutIdChanged;\n callBack && callBack(layoutId);\n };\n\n /**\n * Listener on layouts, this listener will get triggered when a (sub)layout is\n * - added\n * - removed\n * - renamed\n * - duplicted\n * @param layouts Stringified object of layouts\n */\n onLayoutsChanged = (layouts: string) => {\n const callBack = this.config.onLayoutsChanged;\n callBack && callBack(JSON.parse(layouts));\n };\n\n /**\n * Listener on scale factor of the canvas, this listener will get triggered when a zoom is applied to the canvas\n * @param zoomEvent Stringified scale factor\n */\n onZoomChanged = (zoomEvent: string) => {\n const callBack = this.config.onZoomChanged;\n callBack && callBack(JSON.parse(zoomEvent));\n };\n\n /**\n * Listener on connector events, this listener will get triggered when a connector emits one of those events\n * - reloadRequired\n * - authChanged\n * - unloaded\n * - stateChanged\n *\n * stateChanged - this event will be triggered by connector states: loading, loaded, running, ready, error\n * @param connectorEvent Stringified object of ConnectorEvent\n */\n onConnectorEvent = (connectorEvent: string) => {\n const callBack = this.config.onConnectorEvent;\n callBack && callBack(JSON.parse(connectorEvent));\n };\n\n /**\n * Listener on page size, this listener will get triggered when the page size is changed, while the document is a `project`.\n * This will not emit anything if your document is a `template`.\n * @param pageSize Stringified object of the PageSize\n */\n onPageSizeChanged = (pageSize: string) => {\n const callBack = this.config.onPageSizeChanged;\n callBack && callBack(JSON.parse(pageSize));\n };\n\n /**\n * Listener on corner radii of rectangle and polygon shapes, this listener will get triggered when any corner radius is changed\n * @param cornerRadius Stringified object of the CornerRadius\n */\n onShapeCornerRadiusChanged = (cornerRadius: string) => {\n const callBack = this.config.onShapeCornerRadiusChanged;\n callBack && callBack(JSON.parse(cornerRadius));\n };\n}\n","import { EditorAPI, Id } from '../types/CommonTypes';\nimport type { ChiliDocument, DocumentError } from '../types/DocumentTypes';\nimport { renderURLs, DownloadFormats } from '../utils/enums';\n\nimport { getFetchURL } from '../utils/getFetchUrl';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\n/**\n * The DocumentController is responsible for all communication regarding the Document.\n * Methods inside this controller can be called by `window.SDK.document.{method-name}`\n */\n\nexport class DocumentController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n }\n\n /**\n * This method retrieves the current document state from the editor\n * @returns The JSON document in the form of a string\n */\n getCurrentDocumentState = async () => {\n const res = await this.#editorAPI;\n return res.getCurrentDocumentState().then((result) => getEditorResponseData<ChiliDocument>(result));\n };\n\n /**\n * This method will load a provided document in the ChiliDocument format\n * @param doc The document to load in\n * @returns The document loaded inside of the canvas\n */\n loadDocument = async (doc: ChiliDocument | string) => {\n const res = await this.#editorAPI;\n if (typeof doc === 'string') return res.loadDocument(doc);\n return res.loadDocument(JSON.stringify(doc)).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will call an external api to create a download url\n * The video will be generated in the dimensions (and resolution) of the layout.\n * This means that any upscaling (e.g. playing the video full screen on a 4k monitor) will result in interpolation (= quality loss).\n * @param format The format of a downloadable url\n * @param layoutId id of layout to be downloaded\n * @returns the download link\n */\n getDownloadLink = async (format: DownloadFormats, layoutId: Id) => {\n let error: DocumentError | null = null;\n let PREPARE_DOWNLOAD_URL: string | null = null;\n let DOWNLOAD_URL = '';\n\n const documentResponse = await this.getCurrentDocumentState();\n const FETCH_URL = getFetchURL(format, layoutId);\n try {\n const response = await fetch(FETCH_URL, {\n method: 'POST',\n headers: {\n 'Content-Type': 'application/json',\n },\n body: (documentResponse.data as string) ?? null,\n })\n .then((data) => data.json())\n .catch((err) => {\n if (err.code) {\n error = { code: err.code, error: err.message || err };\n } else {\n error = { code: 400, error: err.message || err };\n }\n return error;\n });\n if (response?.error || error) {\n return getEditorResponseData<string>(\n {\n success: false,\n data: DOWNLOAD_URL,\n error,\n status: response.status,\n parsedData: null,\n },\n false,\n );\n }\n PREPARE_DOWNLOAD_URL = response?.resultUrl ? renderURLs.BASE_URL + response?.resultUrl : null;\n\n DOWNLOAD_URL = response?.downloadUrl ? renderURLs.BASE_URL + response?.downloadUrl : '';\n\n let isFileDownloadable: true | DocumentError | null | unknown = error;\n\n try {\n isFileDownloadable = await this.startPollingOnEndpoint(PREPARE_DOWNLOAD_URL as string);\n } catch (err) {\n error = err as unknown as DocumentError;\n }\n\n if (isFileDownloadable !== true) error = isFileDownloadable as DocumentError;\n if (error) {\n return getEditorResponseData<string>(\n {\n success: false,\n data: '',\n error,\n status: error?.code ?? 400,\n parsedData: null,\n },\n false,\n );\n }\n return getEditorResponseData<string>(\n {\n success: true,\n status: 200,\n data: DOWNLOAD_URL,\n parsedData: null,\n },\n false,\n );\n } catch (err) {\n error = err as DocumentError;\n return getEditorResponseData<string>(\n {\n success: false,\n data: DOWNLOAD_URL,\n error,\n status: error?.code ?? 400,\n parsedData: null,\n },\n false,\n );\n }\n };\n\n /**\n * This method will call an external api endpoint, untill the api endpoint returns a status code 200\n * @param endpoint api endpoint to start polling on\n * @returns true when the endpoint call has successfully been resolved\n */\n startPollingOnEndpoint = async (endpoint: string): Promise<true | unknown> => {\n try {\n const response = await fetch(endpoint)\n .then((data) => data)\n .catch((err) => err);\n if (response?.status === 202) {\n await new Promise((resolve) => setTimeout(resolve, 2000));\n return await this.startPollingOnEndpoint(endpoint);\n } else {\n return true;\n }\n } catch (err) {\n return err;\n }\n };\n}\n","import { Id } from '../types/CommonTypes';\nimport { renderURLs } from './enums';\n\nexport const getFetchURL = (format: string, layoutId: Id) =>\n `${renderURLs.BASE_URL}/rendering?outputType=${format}&fps=30&layoutId=${\n layoutId ?? 0\n }&pixelRatio=1&encoding=rawRgba&socket=false`;\n","import { EditorAPI } from '../types/CommonTypes';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\nimport { DebugData } from '../types/DebugTypes';\n\n/**\n * The DebugController is responsible for all communication regarding Debugging.\n * Methods inside this controller can be called by `window.SDK.debug.{method-name}`\n */\nexport class DebugController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n }\n\n /**\n * This method returns all debug logs\n * @returns\n */\n getLogs = async () => {\n const res = await this.#editorAPI;\n return res.getLogs().then((result) => getEditorResponseData<DebugData[]>(result));\n };\n\n /**\n * This method toggles the showcase of debug panel\n * @returns\n */\n toggleDebugPanel = async () => {\n const res = await this.#editorAPI;\n return res.toggleDebugPanel().then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method enables the debugging\n * @returns\n */\n enableDebug = async () => {\n const res = await this.#editorAPI;\n return res.enableDebug().then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method disables the debugging\n * @returns\n */\n disableDebug = async () => {\n const res = await this.#editorAPI;\n return res.disableDebug().then((result) => getEditorResponseData<null>(result));\n };\n}\n","import { EditorAPI } from '../types/CommonTypes';\nimport { Variable, VariableMoves, ImageVariableSource, VariableType } from '../types/VariableTypes';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\n\n/**\n * The VariableController is responsible for all communication regarding the variables.\n * Methods inside this controller can be called by `window.SDK.variable.{method-name}`\n */\nexport class VariableController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n }\n\n /**\n * This method returns the list of variables\n * @returns\n */\n getVariables = async () => {\n const res = await this.#editorAPI;\n return res.getVariables().then((result) => getEditorResponseData<Variable[]>(result));\n };\n\n /**\n * This method returns a variable by id\n * @param variableId The ID of a specific variable\n * @returns\n */\n getVariableById = async (variableId: string) => {\n const res = await this.#editorAPI;\n return res.getVariableById(variableId).then((result) => getEditorResponseData<Variable>(result));\n };\n\n /**\n * This method returns a variable by name\n * @param variableName The name of a specific variable\n * @returns\n */\n getVariableByName = async (variableName: string) => {\n const res = await this.#editorAPI;\n return res.getVariableByName(variableName).then((result) => getEditorResponseData<Variable>(result));\n };\n\n /**\n * This method adds a new variable\n * @returns The new created variable id\n */\n addVariable = async (parentId: string, variableType: VariableType) => {\n const res = await this.#editorAPI;\n return res.addVariable(parentId, variableType).then((result) => getEditorResponseData<string>(result));\n };\n\n /**\n * This method removes a list of variables\n * @returns\n */\n removeVariables = async (variableIds: string[]) => {\n const res = await this.#editorAPI;\n return res.removeVariables(variableIds).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method sets a new name for a variable\n * @returns\n */\n setVariableName = async (variableId: string, name: string) => {\n const res = await this.#editorAPI;\n return res.setVariableName(variableId, name).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method sets a new label for a variable\n * @returns\n */\n setVariableLabel = async (variableId: string, label: string) => {\n const res = await this.#editorAPI;\n return res.setVariableLabel(variableId, label).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method sets a new type for a variable\n * @returns\n */\n setVariableType = async (variableId: string, type: VariableType) => {\n const res = await this.#editorAPI;\n return res.setVariableType(variableId, type).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method sets a new value for a variable\n * @returns\n */\n setVariableValue = async (variableId: string, value: string) => {\n const res = await this.#editorAPI;\n return res.setVariableValue(variableId, value).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method creates a copy of a variable\n * @returns\n */\n duplicateVariable = async (variableId: string) => {\n const res = await this.#editorAPI;\n return res.duplicateVariable(variableId).then((result) => getEditorResponseData<string>(result));\n };\n\n /**\n * This method aggregates the provided variables into a new group\n * @returns\n */\n groupVariables = async (groupName: string, variableIds: string[]) => {\n const res = await this.#editorAPI;\n return res.groupVariables(groupName, variableIds).then((result) => getEditorResponseData<string>(result));\n };\n\n /**\n * This method dissolves the specified group\n * @returns\n */\n ungroupVariable = async (groupId: string) => {\n const res = await this.#editorAPI;\n return res.ungroupVariable(groupId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method moves a variable's position\n * @returns\n */\n moveVariable = async (variableId: string, parentId: string, orderIndex: number) => {\n const res = await this.#editorAPI;\n return res.moveVariable(variableId, parentId, orderIndex).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method changes positions of variables\n * @returns\n */\n moveVariables = async (movedVariables: VariableMoves) => {\n const res = await this.#editorAPI;\n return res\n .moveVariables(movedVariables.moves, movedVariables.parent, movedVariables.order)\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method sets isHidden flag for a variable\n * @returns\n */\n setVariableIsHidden = async (variableId: string, isHidden: boolean) => {\n const res = await this.#editorAPI;\n return res.setVariableIsHidden(variableId, isHidden).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method sets isRequired flag for a variable\n * @returns\n */\n setVariableIsRequired = async (variableId: string, isRequired: boolean) => {\n const res = await this.#editorAPI;\n return res.setVariableIsRequired(variableId, isRequired).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method sets isReadonly flag for a variable\n * @returns\n */\n setVariableIsReadonly = async (variableId: string, isReadonly: boolean) => {\n const res = await this.#editorAPI;\n return res.setVariableIsReadonly(variableId, isReadonly).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method sets or removes the variable source\n * @param variableId The ID of the variable to update\n * @param src The new variable source\n */\n private updateVariableSource = async (variableId: string, src: ImageVariableSource | null) => {\n const res = await this.#editorAPI;\n const srcJson = src !== null ? JSON.stringify(src) : null;\n return res.setVariableSource(variableId, srcJson).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method sets the variable source\n * @param variableId The ID of the variable to update\n * @param src The new variable source\n */\n setVariableSource = async (variableId: string, src: ImageVariableSource) => {\n return this.updateVariableSource(variableId, src);\n };\n\n /**\n * This method removes the variable source\n * @param variableId The ID of the variable to update\n */\n removeVariableSource = async (variableId: string) => {\n return this.updateVariableSource(variableId, null);\n };\n}\n","import { EditorAPI } from '../types/CommonTypes';\nimport { ToolType } from '../utils/enums';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\n\n/**\n * The ToolController is responsible for all communication regarding the tools.\n * Methods inside this controller can be called by `window.SDK.tool.{method-name}`\n */\nexport class ToolController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n }\n\n /**\n * This method sets the currently used tool\n * @param tool\n */\n private setTool = async (tool: ToolType) => {\n const res = await this.#editorAPI;\n return res.setTool(tool).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method returns selected tool\n */\n getSelectedTool = async () => {\n const res = await this.#editorAPI;\n return res.getSelectedTool().then((result) => getEditorResponseData<ToolType>(result));\n };\n\n /**\n * This method sets the used tool to a Pointer tool\n */\n setSelectTool = async () => {\n return this.setTool(ToolType.SELECT);\n };\n\n /**\n * This method sets the used tool to a Move tool\n */\n setHandTool = async () => {\n return this.setTool(ToolType.HAND);\n };\n\n /**\n * This method sets the used tool to a Zoom tool\n */\n setZoomTool = async () => {\n await this.setTool(ToolType.ZOOM);\n };\n\n /**\n * This method sets the used tool to a TextFrame tool\n */\n setTextFrameTool = async () => {\n return this.setTool(ToolType.TEXT_FRAME);\n };\n\n /**\n * This method sets the used tool to a ImageFrame tool\n */\n setImageFrameTool = async () => {\n return this.setTool(ToolType.IMAGE_FRAME);\n };\n\n /**\n * This method sets the used tool to a ShapeRectangle tool\n */\n setShapeRectTool = async () => {\n return this.setTool(ToolType.SHAPE_RECT);\n };\n\n /**\n * This method sets the used tool to a ShapeEllipse tool\n */\n setShapeEllipseTool = async () => {\n return this.setTool(ToolType.SHAPE_ELLIPSE);\n };\n\n /**\n * This method sets the used tool to a ShapePolygon tool\n */\n setShapePolygonTool = async () => {\n return this.setTool(ToolType.SHAPE_POLYGON);\n };\n}\n","import { EditorAPI } from '../types/CommonTypes';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\n\n/**\n * The UndoManagerController is responsible for all communication regarding the Undo-Manager.\n * Methods inside this controller can be called by `window.SDK.undoManager.{method-name}`\n */\nexport class UndoManagerController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(children: EditorAPI) {\n this.#editorAPI = children;\n }\n\n /**\n * This method undoes the last operation\n * @returns\n */\n undo = async () => {\n const res = await this.#editorAPI;\n return res.undo().then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method redoes the last operation\n * @returns\n */\n redo = async () => {\n const res = await this.#editorAPI;\n return res.redo().then((result) => getEditorResponseData<null>(result));\n };\n}\n","import { EditorAPI } from '../types/CommonTypes';\nimport { SelectedTextStyle, TextStyleUpdateType } from '../types/TextStyleTypes';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\n\n/**\n * The TextStyleController is responsible for all communication regarding text styles.\n * Methods inside this controller can be called by `window.SDK.textStyle.{method-name}`\n */\nexport class TextStyleController {\n /**\n * @ignore\n */\n readonly #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n }\n\n /**\n * This method updates a selected Text's style properties\n * @returns\n */\n setTextStyleProperties = async (style: TextStyleUpdateType) => {\n const res = await this.#editorAPI;\n return res\n .selectedTextStyleDeltaUpdate(JSON.stringify(style))\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method clears a selected Text's style properties\n * If the text is selected, then the inline style properties will be cleared\n * If the text is not selected and user tried to change any style property, the temporary style will be cleared\n * if there is no text selection and there is no temporary style, the inline paragraph properties will be cleared\n * @returns\n */\n clearTextStyleProperties = async () => {\n const res = await this.#editorAPI;\n return res.selectedTextStyleClean().then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method gets a selected Text's style properties\n * @returns\n */\n getSelectedTextStyle = async () => {\n const res = await this.#editorAPI;\n return res\n .getSelectedTextStyle()\n .then((result) => getEditorResponseData<SelectedTextStyle>(result));\n };\n}\n","import { EditorAPI } from '../types/CommonTypes';\nimport { ColorUpdate, DocumentColor } from '../types/ColorStyleTypes';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\n\n/**\n * The ColorStyleController is responsible for all communication regarding color styles.\n * Methods inside this controller can be called by `window.SDK.colorStyle.{method-name}`\n */\nexport class ColorStyleController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n }\n\n /**\n * This method returns the list of colors\n * @returns\n */\n getColors = async () => {\n const res = await this.#editorAPI;\n return res.getColors().then((result) => getEditorResponseData<DocumentColor[]>(result));\n };\n\n /**\n * This method returns a color by id\n * @param colorId The ID of a specific color\n * @returns\n */\n getColorById = async (colorId: string) => {\n const res = await this.#editorAPI;\n return res.getColorById(colorId).then((result) => getEditorResponseData<DocumentColor>(result));\n };\n\n /**\n * This method create a new color\n * @returns the new created color id\n */\n createColor = async () => {\n const res = await this.#editorAPI;\n return res.createColor().then((result) => getEditorResponseData<string>(result));\n };\n\n /**\n * This method duplicates a color\n * @param colorId The ID of a specific color\n * @returns the new color id\n */\n duplicateColor = async (colorId: string) => {\n const res = await this.#editorAPI;\n return res.duplicateColor(colorId).then((result) => getEditorResponseData<string>(result));\n };\n\n /**\n * This method changes positions of colors\n * @param order The position of the colors\n * @param colorIds The list of color ids\n * @returns\n */\n moveColors = async (order: number, colorIds: string[]) => {\n const res = await this.#editorAPI;\n return res.moveColors(order, colorIds).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method renames a color\n * @param id The ID of a specific color\n * @param name The new name of the color\n * @returns\n */\n renameColor = async (id: string, name: string) => {\n const res = await this.#editorAPI;\n return res.renameColor(id, name).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method updates a color\n * @param id The ID of a specific color\n * @param color The new color properties\n * @returns\n */\n updateColor = async (id: string, color: ColorUpdate) => {\n const res = await this.#editorAPI;\n return res.updateColor(id, JSON.stringify(color)).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method removes a color\n * @param id The ID of a specific color\n * @returns\n */\n removeColor = async (id: string) => {\n const res = await this.#editorAPI;\n return res.removeColor(id).then((result) => getEditorResponseData<null>(result));\n };\n}\n","import { EditorAPI } from '../types/CommonTypes';\nimport { ParagraphStyle, ParagraphStyleUpdate } from '../types/ParagraphStyleTypes';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\n\n/**\n * The ParagraphStyleController is responsible for all communication regarding paragraph styles.\n * Methods inside this controller can be called by `window.SDK.paragraphStyle.{method-name}`\n */\nexport class ParagraphStyleController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n }\n\n /**\n * This method returns the list of paragraph styles\n * @returns\n */\n getParagraphStyles = async () => {\n const res = await this.#editorAPI;\n return res.getParagraphStyles().then((result) => getEditorResponseData<ParagraphStyle[]>(result));\n };\n\n /**\n * This method returns a paragraph style by id\n * @param paragraphStyleId The ID of a specific paragraph style\n * @returns\n */\n getParagraphStyleById = async (paragraphStyleId: string) => {\n const res = await this.#editorAPI;\n return res\n .getParagraphStyleById(paragraphStyleId)\n .then((result) => getEditorResponseData<ParagraphStyle>(result));\n };\n\n /**\n * This method create a new paragraph style\n * @returns the new created paragraph style id\n */\n createParagraphStyle = async () => {\n const res = await this.#editorAPI;\n return res.createParagraphStyle().then((result) => getEditorResponseData<string>(result));\n };\n\n /**\n * This method duplicates a paragraph style\n * @param paragraphStyleId The ID of a specific paragraph style\n * @returns the new paragraph style id\n */\n duplicateParagraphStyle = async (paragraphStyleId: string) => {\n const res = await this.#editorAPI;\n return res.duplicateParagraphStyle(paragraphStyleId).then((result) => getEditorResponseData<string>(result));\n };\n\n /**\n * This method updates a paragraph style\n * @param id The ID of a specific paragraph style\n * @param paragraphStyle The new paragraph style properties\n * @returns\n */\n updateParagraphStyle = async (id: string, paragraphStyle: ParagraphStyleUpdate) => {\n const res = await this.#editorAPI;\n return res\n .updateParagraphStyle(id, JSON.stringify(paragraphStyle))\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method renames a paragraph style\n * @param id The ID of a specific paragraph style\n * @param name The new name of the paragraph style\n * @returns\n */\n renameParagraphStyle = async (id: string, name: string) => {\n const res = await this.#editorAPI;\n return res.renameParagraphStyle(id, name).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method removes a paragraph style\n * @param id The ID of a specific paragraph style\n * @returns\n */\n removeParagraphStyle = async (id: string) => {\n const res = await this.#editorAPI;\n return res.removeParagraphStyle(id).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method changes positions of paragraph styles\n * @param order The position of the paragraph styles\n * @param paragraphStyleIds The list of paragraph styles ids\n * @returns\n */\n moveParagraphStyles = async (order: number, paragraphStyleIds: string[]) => {\n const res = await this.#editorAPI;\n return res.moveParagraphStyles(order, paragraphStyleIds).then((result) => getEditorResponseData<null>(result));\n };\n}\n","export enum DeprecatedMediaType {\n file = 0,\n collection = 1,\n}\n\nexport enum MediaType {\n file = 'file',\n collection = 'collection',\n}\n\nexport enum SortBy {\n name = 'name',\n path = 'relativePath',\n id = 'id',\n}\n\nexport enum SortOrder {\n ascending = 'asc',\n descending = 'desc',\n}\n\nexport type QueryOptions = {\n filter?: string[] | null;\n collection?: string | null;\n pageToken?: string | null;\n pageSize?: number | null;\n sortBy?: SortBy | null;\n sortOrder?: SortOrder | null;\n};\n\nexport type ConnectorCapabilities = {\n filtering?: boolean;\n upload?: boolean;\n query?: boolean;\n remove?: boolean;\n copy?: boolean;\n};\n\nexport type ConnectorRegistration = {\n id: string;\n source: ConnectorRegistrationSource;\n url: string;\n};\n\nexport enum ConnectorRegistrationSource {\n url = 'url',\n}\n\nexport class ConnectorMapping {\n name: string;\n value: string;\n\n constructor(\n mapTo: ConnectorMappingTarget,\n contextProperty: string,\n mapFrom: ConnectorMappingSource,\n sourceValue: string,\n ) {\n this.name = `${mapTo}.${contextProperty}`;\n this.value = `${mapFrom}.${sourceValue}`;\n }\n}\n\nexport type ConnectorState = {\n id: string;\n type: ConnectorStateType;\n};\n\nexport type ConnectorEvent = {\n id: string;\n type: ConnectorEventType;\n};\n\nexport type QueryPage<T> = {\n nextPageToken?: string;\n data: T[];\n};\n\nexport enum ConnectorMappingTarget {\n query = 'query',\n download = 'download',\n}\n\nexport enum ConnectorMappingSource {\n variable = 'var',\n}\n\nexport enum ConnectorStateType {\n /**\n * Connector loading process has started.\n * Any SDK methods that required the connector id, will start working now.\n */\n loading = 'loading',\n\n /**\n * Connector loading completed.\n */\n loaded = 'loaded',\n\n /**\n * Connector is running in QuickJS.\n */\n\n running = 'running',\n\n /**\n * Connector is fully configured and has the correct authentication information.\n * At this point the connector is ready to make requests.\n */\n ready = 'ready',\n\n /**\n * Something went wrong, the connector is in error state.\n * Check the error message for more information.\n */\n error = 'error',\n}\n\nexport enum ConnectorEventType {\n /**\n * This event will be triggered by the following state changes of the connector\n * - loading\n * - loaded\n * - running\n * - ready\n * - error\n */\n stateChanged = 'stateChanged',\n\n /**\n * Authentication information is changed\n */\n authChanged = 'authChanged',\n\n /**\n * Connector configuration changed that requires the connector to be reloaded in QuickJS.\n * This will trigger multiple 'stateChanged' events while it is reloading.\n * Wait until 'ready'-stateChanged event is received to start using the connector again.\n */\n reloadRequired = 'reloadRequired',\n\n /**\n * Connector is unregistered and no longer exists inside the editor engine.\n * Don't use the 'connectorId' after receiving this event.\n */\n unloaded = 'unloaded',\n}\n","import { EditorAPI } from '../types/CommonTypes';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\nimport { WellKnownConfigurationKeys } from '../types/ConfigurationTypes';\n\n/**\n * The ConfigurationController allows setting editor session data. This data is not stored in the document and\n * can only be used at runtime. Amongst others, the configuration store is available to the editor connectors and\n * Javascript actions running in the editor.\n * Methods inside this controller can be called by `window.SDK.configuration.{method-name}`\n */\nexport class ConfigurationController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n }\n\n /**\n * This method returns the value for a given configuration key. If a value was not found in the configuration store\n * this method returns an error. The key cannot be null.\n * @returns\n */\n getValue = async (key: WellKnownConfigurationKeys | string) => {\n const res = await this.#editorAPI;\n return res.getConfigValue(key).then((result) => getEditorResponseData<string>(result));\n };\n\n /**\n * This method sets, or overrides the value for a given key. Null values are not allowed for both key and value,\n * using them will result in an error.\n * @returns\n */\n setValue = async (key: WellKnownConfigurationKeys | string, value: string) => {\n const res = await this.#editorAPI;\n return res.setConfigValue(key, value).then((result) => getEditorResponseData<null>(result));\n };\n}\n","export enum WellKnownConfigurationKeys {\n GraFxStudioEnvironmentApiUrl = 'ENVIRONMENT_API',\n GraFxStudioSdkVersion = 'SDK_VERSION',\n GraFxStudioDocumentType = 'DOCUMENT_TYPE',\n GraFxStudioTemplateId = 'TEMPLATE_ID',\n}\n","import { ConnectorOptions, EditorAPI, EditorRawAPI, EditorResponse, MetaData } from '../types/CommonTypes';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\nimport {\n DeprecatedMediaType,\n ConnectorCapabilities,\n MediaType,\n QueryOptions,\n QueryPage,\n} from '../types/ConnectorTypes';\nimport { CallSender } from 'penpal';\nimport { Media, MediaDownloadType } from '../types/MediaConnectorTypes';\n\n/**\n * The MediaConnectorController is responsible for all communication regarding media connectors.\n * Methods inside this controller can be called by `window.SDK.mediaConnector.{method-name}`\n *\n * The way CHILI Studio handles different sources of media is called 'MediaConnectors'. A MediaConnectors is an\n * implementation of a set of capabilities we need to interact with a certain Digital Asset Management system.\n * In essence a connector is the combination of a Javascript snippet and some metadata. The Javascript snippet\n * is loaded in the studio engine using a sandboxed Javascript execution engine (QuickJs). This allows us to\n * execute the media connector both on web using webassembly and on the server side during e.g. animation output\n * generation.\n * This controller is an interface to the running connector instance inside the studio engine.\n */\nexport class MediaConnectorController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n #blobAPI: EditorRawAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n this.#blobAPI = editorAPI as CallSender as EditorRawAPI;\n }\n\n /**\n * Query a specific MediaConnector for data using both standardized queryOptions and the dynamic\n * context as parameters. This call returns an array of Media items.\n * @param connectorId unique Id of the media connector\n * @param queryOptions stringified instance of `QueryOptions`\n * @param context stringified `Map<string, string>` of dynamic options\n */\n query = async (connectorId: string, queryOptions: QueryOptions, context: MetaData) => {\n const res = await this.#editorAPI;\n return res\n .mediaConnectorQuery(connectorId, JSON.stringify(queryOptions), JSON.stringify(context))\n .then((result) => getEditorResponseData<QueryPage<Media>>(result));\n };\n\n /**\n * Returns a single media using a specific MediaConnector.\n *\n * The connector needs to list `detail` as a supported capability.\n * @param connectorId unique Id of the Media connector\n * @param mediaId unique id of the Media\n */\n detail = async (connectorId: string, mediaId: string) => {\n const res = await this.#editorAPI;\n return res.mediaConnectorDetail(connectorId, mediaId).then((result) => getEditorResponseData<Media>(result));\n };\n\n /**\n * The combination of a `connectorId` and `mediaId` is typically enough for a media connector to\n * perform the download of this asset. The `download` endpoint is capable of relaying this information to the\n * media connector instance running in the editor engine.\n * @param connectorId unique Id of the media connector\n * @param mediaId unique Id of the media to download\n * @param downloadType hint to the media connector about desired quality of the downloaded media\n * @param context dynamic map of additional options potentially used by the connector\n */\n download = async (\n connectorId: string,\n mediaId: string,\n downloadType: MediaDownloadType,\n context: MetaData,\n ): Promise<Uint8Array> => {\n const res = await this.#blobAPI;\n return res\n .mediaConnectorDownload(connectorId, mediaId, downloadType, JSON.stringify(context))\n .then((result) => (result as Uint8Array) ?? (result as EditorResponse<null>));\n };\n\n /**\n * Depending on the connector capabilities, this api method allows you to upload new media to the\n * connector's backend.\n * @param connectorId unique Id of the media connector\n * @param mediaId unique Id of the media to upload\n * @param blob byte array representation of the media to upload\n */\n upload = async (connectorId: string, mediaId: string, blob: Uint8Array) => {\n const res = await this.#editorAPI;\n return res\n .mediaConnectorUpload(connectorId, mediaId, blob)\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * Depending on the connector capabilities, removes media identified by `mediaId` from the connector's backend storage\n * @param connectorId unique Id of the media connector\n * @param mediaId unique Id of the media to download\n */\n remove = async (connectorId: string, mediaId: string) => {\n const res = await this.#editorAPI;\n return res.mediaConnectorRemove(connectorId, mediaId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * Depending on the connector capabilities, copies media identified by `mediaId` to a new media item on the\n * connector's backend\n * @param connectorId unique Id of the media connector\n * @param mediaId unique Id of the media to download\n * @param newName name of the copied media on the connector's backend\n */\n copy = async (connectorId: string, mediaId: string, newName: string) => {\n const res = await this.#editorAPI;\n return res\n .mediaConnectorCopy(connectorId, mediaId, newName)\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * All connectors have a certain set of queryOptions they allow to be passed in the query context. This\n * method allows you to discover what options are available for a given connector. If you want to use any of these\n * options, they need to be passed in the `context` parameter of the `query` api method.\n * @param connectorId unique Id of the media connector\n */\n getQueryOptions = async (connectorId: string) => {\n const res = await this.#editorAPI;\n return res\n .mediaConnectorGetQueryOptions(connectorId)\n .then((result) => getEditorResponseData<ConnectorOptions>(result));\n };\n\n /**\n * All connectors have a certain set of downloadOptions they allow to be passed in the download context. This\n * method allows you to discover what options are available for a given connector. If you want to use any of these\n * options, they need to be passed in the `context` parameter of the `download` api method.\n * @param connectorId unique Id of the media connector\n */\n getDownloadOptions = async (connectorId: string) => {\n const res = await this.#editorAPI;\n return res\n .mediaConnectorGetDownloadOptions(connectorId)\n .then((result) => getEditorResponseData<ConnectorOptions>(result));\n };\n\n /**\n * This method returns what capabilities the selected connector has. It gives an indication what methods can\n * be used successfully for a certain connector.\n * @param connectorId unique Id of the media connector\n */\n getCapabilities = async (connectorId: string) => {\n const res = await this.#editorAPI;\n return res\n .mediaConnectorGetCapabilities(connectorId)\n .then((result) => getEditorResponseData<ConnectorCapabilities>(result));\n };\n\n /**\n * This method will parse the deprecatedMediaType to the new media type. This method will be removed once the deprecatedMediaType is out of use\n * @param deprecatedType is 0 or 1\n */\n parseDeprecatedMediaType = (deprecatedType: DeprecatedMediaType) => {\n if (deprecatedType === DeprecatedMediaType.file) return MediaType.file;\n if (deprecatedType === DeprecatedMediaType.collection) return MediaType.collection;\n };\n}\n","import { EditorAPI, Id } from '../types/CommonTypes';\r\nimport { AddDocumentFont, DocumentFont } from '../types/FontTypes';\r\nimport { getEditorResponseData } from '../utils/EditorResponseData';\r\n\r\n/**\r\n * The FontController is responsible for all communication regarding font styles.\r\n * Methods inside this controller can be called by `window.SDK.font.{method-name}`\r\n */\r\nexport class FontController {\r\n /**\r\n * @ignore\r\n */\r\n #editorAPI: EditorAPI;\r\n\r\n /**\r\n * @ignore\r\n */\r\n constructor(editorAPI: EditorAPI) {\r\n this.#editorAPI = editorAPI;\r\n }\r\n\r\n /**\r\n * This method returns the list of fonts\r\n * @returns\r\n */\r\n getFonts = async () => {\r\n const res = await this.#editorAPI;\r\n return res.getFonts().then((result) => getEditorResponseData<DocumentFont[]>(result));\r\n };\r\n\r\n /**\r\n * This method returns a font by id\r\n * @param fontId The ID of a specific font\r\n * @returns\r\n */\r\n getFontById = async (fontId: Id) => {\r\n const res = await this.#editorAPI;\r\n return res.getFontById(fontId).then((result) => getEditorResponseData<DocumentFont>(result));\r\n };\r\n\r\n /**\r\n * This method returns the default font.\r\n * Be aware that the default font will not change during the entire lifetime of the SDK session.\r\n * It is not necessary to call this more than once in an integration, this value can be safely stored during the lifetime of this SDK session.\r\n * @returns\r\n */\r\n getDefaultFont = async () => {\r\n const res = await this.#editorAPI;\r\n return res.getDefaultFont().then((result) => getEditorResponseData<DocumentFont>(result));\r\n };\r\n\r\n /**\r\n * This method removes a font\r\n * @param id The ID of a specific font\r\n * @returns\r\n */\r\n removeFont = async (id: Id) => {\r\n const res = await this.#editorAPI;\r\n return res.removeFont(id).then((result) => getEditorResponseData<null>(result));\r\n };\r\n\r\n /**\r\n * This method adds a font\r\n * @param connectorId unique Id of the font connector\r\n * @param font The font object\r\n * @returns\r\n */\r\n addFont = async (connectorId: Id, font: AddDocumentFont) => {\r\n const res = await this.#editorAPI;\r\n return res.addFont(connectorId, JSON.stringify(font)).then((result) => getEditorResponseData<null>(result));\r\n };\r\n\r\n /**\r\n * Check if the font is used anywhere in the document\r\n * @param fontKey The ID of the font to check\r\n * @returns Whether the font is used\r\n */\r\n isFontUsed = async (fontKey: string) => {\r\n const res = await this.#editorAPI;\r\n return res.isFontUsed(fontKey).then((result) => getEditorResponseData<boolean>(result));\r\n };\r\n}\r\n","import { ConnectorOptions, EditorAPI, EditorResponse } from '../types/CommonTypes';\r\nimport {\r\n ConnectorState,\r\n ConnectorStateType,\r\n ConnectorMapping,\r\n ConnectorRegistration,\r\n} from '../types/ConnectorTypes';\r\nimport { getEditorResponseData } from '../utils/EditorResponseData';\r\n\r\n/**\r\n * The ConnectorController manages lifetime of all available connectors, regardless of the type, in the\r\n * document. Use it to add/remove connectors to a template, or set specific configuration.\r\n *\r\n * The way CHILI Studio handles different sources of resouces is called 'Connectors'. A Connectors is an\r\n * implementation of a set of capabilities we need to interact with a certain external resource management system.\r\n * In essence a connector is the combination of a Javascript snippet and some metadata. The Javascript snippet\r\n * is loaded in the studio engine using a sandboxed Javascript execution engine (QuickJs). This allows us to\r\n * execute the media connector both on web using webassembly and on the server side during e.g. animation output\r\n * generation.\r\n * This controller is an interface to the running connector instance inside the studio engine. The engine will\r\n * automatically register the 'grafx-media' and 'grafx-font' connectors. Custom connectors need to be registered\r\n * manually.\r\n */\r\nexport class ConnectorController {\r\n /**\r\n * @ignore\r\n */\r\n #editorAPI: EditorAPI;\r\n\r\n /**\r\n * @ignore\r\n */\r\n constructor(editorAPI: EditorAPI) {\r\n this.#editorAPI = editorAPI;\r\n }\r\n\r\n /**\r\n * Registers a new connector in the SDK. After successful registration, depending\r\n * on the connector type, the connector can be configured and used in the template\r\n * Remember to add custom authentication information after registering the connector\r\n * @param registration registration object containing all details about the connector\r\n */\r\n registerConnector = async (registration: ConnectorRegistration) => {\r\n const res = await this.#editorAPI;\r\n return res\r\n .registerConnector(JSON.stringify(registration))\r\n .then((result) => getEditorResponseData<null>(result));\r\n };\r\n\r\n /**\r\n * Configures a registered connector. A configurator helper is passed as an argument\r\n * of the callback for you to setup your connector.\r\n * @param connectorId Id of your registered connector\r\n * @param configurationCallback callback to setup the connector\r\n */\r\n configure = async (\r\n connectorId: string,\r\n configurationCallback: (configurator: ConnectorConfigurator) => Promise<void>,\r\n ) => {\r\n const res = await this.#editorAPI;\r\n // wait for connector to be ready\r\n await this.waitForConnectorReady(connectorId);\r\n // execute callback\r\n await configurationCallback(new ConnectorConfigurator(connectorId, res));\r\n // invalidate connector in engine\r\n return res.updateConnectorConfiguration(connectorId).then((result) => getEditorResponseData<null>(result));\r\n };\r\n\r\n /**\r\n * Gets the current state a connector is in, to wait until a connector is ready to be used, use the 'waitForConnectorReady'\r\n * method in this controller.\r\n * @param connectorId Id of your registered connector you want to make sure it is loaded\r\n */\r\n getState = async (connectorId: string) => {\r\n const res = await this.#editorAPI;\r\n return res.getConnectorState(connectorId).then((result) => getEditorResponseData<ConnectorState>(result));\r\n };\r\n\r\n /**\r\n * Connectors are loaded asynchronously in the editor engine, this causes some challenges while configuring them. To make sure\r\n * an action on the connector will be available, it's advised to await this method. After the Promise resolves we are sure\r\n * the connector is up and running. This is used internally by the configure method to ensure correct execution. It's especially\r\n * usefull during startup of the SDK / rigth after the loadDocument call.\r\n * @param connectorId Id of your registered connector you want to make sure it is loaded\r\n */\r\n waitForConnectorReady = async (connectorId: string, timeoutMilliseconds = 2000): Promise<EditorResponse<null>> => {\r\n // minimum timeout is 500ms\r\n let timeout = Math.max(timeoutMilliseconds, 500);\r\n\r\n // maximum timeout is 5000ms\r\n timeout = Math.min(timeout, 5000);\r\n\r\n const waitTime = 100;\r\n let retries = 0;\r\n\r\n try {\r\n // using while loop will prevent stackoverflow issues when using recursion\r\n // wait for maximum 2 seconds to fail\r\n while (retries * waitTime < timeout) {\r\n const result = await this.getState(connectorId);\r\n\r\n if (\r\n result.success &&\r\n result.parsedData &&\r\n (result.parsedData.type === ConnectorStateType.running ||\r\n result.parsedData.type === ConnectorStateType.ready)\r\n ) {\r\n return getEditorResponseData<null>(\r\n { data: null, success: true, error: undefined, status: 0, parsedData: undefined },\r\n false,\r\n );\r\n }\r\n\r\n await new Promise((resolve) => setTimeout(resolve, waitTime));\r\n retries++;\r\n }\r\n } catch (err) {\r\n return getEditorResponseData<null>(\r\n {\r\n data: null,\r\n success: false,\r\n error: `Error while getting connector state ${err}`,\r\n status: 50000,\r\n parsedData: undefined,\r\n },\r\n false,\r\n );\r\n }\r\n\r\n return getEditorResponseData<null>(\r\n {\r\n data: null,\r\n success: false,\r\n error: `Timed out waiting for connector`,\r\n status: 50000,\r\n parsedData: undefined,\r\n },\r\n false,\r\n );\r\n };\r\n}\r\n\r\n/**\r\n * Helper to setup your connector\r\n */\r\nclass ConnectorConfigurator {\r\n /**\r\n * @ignore\r\n */\r\n #connectorId: string;\r\n #res: EditorAPI;\r\n\r\n /**\r\n * @ignore\r\n */\r\n constructor(connectorId: string, res: EditorAPI) {\r\n this.#connectorId = connectorId;\r\n this.#res = res;\r\n }\r\n\r\n /**\r\n * Allows to customize the context data a connector can work with. The options data\r\n * will be available using the context parameter in the connector implementation code.\r\n * @param options object containing key value data to pass to connector context\r\n */\r\n setOptions = async (options: ConnectorOptions) => {\r\n return this.#res\r\n .setConnectorOptions(this.#connectorId, JSON.stringify(options))\r\n .then((result) => getEditorResponseData<null>(result));\r\n };\r\n\r\n /**\r\n * Allows to map document data (variables, selectedFrame, etc) to connector context data.\r\n * By defining the mappings, we can trigger redownload of assets (dynamic asset provider)\r\n * or populate filters for the query endpoint. The mapped data will be available using\r\n * the context parameter in the connector implementation code.\r\n * @param mappings collection of mappings to set to this connector\r\n */\r\n setMappings = async (mappings: ConnectorMapping[]) => {\r\n const result = await this.#res.setConnectorMappings(\r\n this.#connectorId,\r\n mappings.map(function (m) {\r\n return JSON.stringify(m);\r\n }),\r\n );\r\n return getEditorResponseData<null>(result);\r\n };\r\n\r\n /**\r\n * This method sets the CHILI GraFx Access Token in the Authentication HTTP header for the 'chili' authentication type.\r\n * The CHILI Token will be used to authenticate every grafx connector http call.\r\n * @param token token for the CHILI authentication\r\n */\r\n setChiliToken = async (token: string) => {\r\n return this.#res\r\n .connectorAuthenticationSetChiliToken(this.#connectorId, token)\r\n .then((result) => getEditorResponseData<null>(result));\r\n };\r\n\r\n /**\r\n * This method sets the HTTP headers for the 'staticKey' authentication type.\r\n * These additional headers will be added to all connector http calls.\r\n * Can only be used after a connector has been registered. (if you are using a grafx connector no registration is needed)\r\n * @param headerName name of the header\r\n * @param headerValue value of the header\r\n */\r\n setHttpHeader = async (headerName: string, headerValue: string) => {\r\n return this.#res\r\n .connectorAuthenticationSetHttpHeader(this.#connectorId, headerName, headerValue)\r\n .then((result) => getEditorResponseData<null>(result));\r\n };\r\n}\r\n","import { ConnectorOptions, EditorAPI, EditorRawAPI, EditorResponse, MetaData } from '../types/CommonTypes';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\nimport {\n DeprecatedMediaType,\n ConnectorCapabilities,\n MediaType,\n QueryOptions,\n QueryPage,\n} from '../types/ConnectorTypes';\nimport { Font, FontDownloadType } from '../types/FontConnectorTypes';\nimport { CallSender } from 'penpal';\n\n/**\n * The FontConnectorController is responsible for all communication regarding Font connectors.\n * Methods inside this controller can be called by `window.SDK.FontConnector.{method-name}`\n *\n * The way CHILI Studio handles different sources of Font is called 'FontConnectors'. A FontConnectors is an\n * implementation of a set of capabilities we need to interact with a certain Digital Asset Management system.\n * In essence a connector is the combination of a Javascript snippet and some metadata. The Javascript snippet\n * is loaded in the studio engine using a sandboxed Javascript execution engine (QuickJs). This allows us to\n * execute the Font connector both on web using webassembly and on the server side during e.g. animation output\n * generation.\n * This controller is an interface to the running connector instance inside the studio engine.\n */\nexport class FontConnectorController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n #blobAPI: EditorRawAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n this.#blobAPI = editorAPI as CallSender as EditorRawAPI;\n }\n\n /**\n * Query a specific FontConnector for data using both standardized queryOptions and the dynamic\n * context as parameters. This call returns an array of Font items.\n * @param connectorId unique Id of the Font connector\n * @param queryOptions stringified instance of `QueryOptions`\n * @param context stringified `Map<string, string>` of dynamic options\n */\n query = async (connectorId: string, queryOptions: QueryOptions, context: MetaData) => {\n const res = await this.#editorAPI;\n return res\n .fontConnectorQuery(connectorId, JSON.stringify(queryOptions), JSON.stringify(context))\n .then((result) => getEditorResponseData<QueryPage>(result));\n };\n\n /**\n * Returns a single font using a specific FontConnector.\n *\n * The connector needs to list `detail` as a supported capability.\n * @param connectorId unique Id of the Font connector\n * @param fontId unique id of the Font\n */\n detail = async (connectorId: string, fontId: string) => {\n const res = await this.#editorAPI;\n return res.fontConnectorDetail(connectorId, fontId).then((result) => getEditorResponseData(result));\n };\n\n /**\n * The combination of a `connectorId` and `FontId` is typically enough for a Font connector to\n * perform the download of this asset. The `download` endpoint is capable of relaying this information to the\n * Font connector instance running in the editor engine.\n * @param connectorId unique Id of the Font connector\n * @param FontId unique Id of the Font to download\n * @param downloadType hint to the Font connector about desired quality of the downloaded Font\n * @param context dynamic map of additional options potentially used by the connector\n */\n download = async (\n connectorId: string,\n FontId: string,\n downloadType: FontDownloadType,\n context: MetaData,\n ): Promise<Uint8Array> => {\n const res = await this.#blobAPI;\n return res\n .fontConnectorDownload(connectorId, FontId, downloadType, JSON.stringify(context))\n .then((result) => (result as Uint8Array) ?? (result as EditorResponse<null>));\n };\n\n /**\n * Depending on the connector capabilities, this api method allows you to upload new Font to the\n * connector's backend.\n * @param connectorId unique Id of the Font connector\n * @param FontId unique Id of the Font to upload\n * @param blob byte array representation of the Font to upload\n */\n upload = async (connectorId: string, FontId: string, blob: Uint8Array) => {\n const res = await this.#editorAPI;\n return res.fontConnectorUpload(connectorId, FontId, blob).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * Depending on the connector capabilities, removes Font identified by `FontId` from the connector's backend storage\n * @param connectorId unique Id of the Font connector\n * @param FontId unique Id of the Font to download\n */\n remove = async (connectorId: string, FontId: string) => {\n const res = await this.#editorAPI;\n return res.fontConnectorRemove(connectorId, FontId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * Depending on the connector capabilities, copies Font identified by `FontId` to a new Font item on the\n * connector's backend\n * @param connectorId unique Id of the Font connector\n * @param FontId unique Id of the Font to download\n * @param newName name of the copied Font on the connector's backend\n */\n copy = async (connectorId: string, FontId: string, newName: string) => {\n const res = await this.#editorAPI;\n return res\n .fontConnectorCopy(connectorId, FontId, newName)\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * All connectors have a certain set of queryOptions they allow to be passed in the query context. This\n * method allows you to discover what options are available for a given connector. If you want to use any of these\n * options, they need to be passed in the `context` parameter of the `query` api method.\n * @param connectorId unique Id of the Font connector\n */\n getQueryOptions = async (connectorId: string) => {\n const res = await this.#editorAPI;\n return res\n .fontConnectorGetQueryOptions(connectorId)\n .then((result) => getEditorResponseData<ConnectorOptions>(result));\n };\n\n /**\n * All connectors have a certain set of downloadOptions they allow to be passed in the download context. This\n * method allows you to discover what options are available for a given connector. If you want to use any of these\n * options, they need to be passed in the `context` parameter of the `download` api method.\n * @param connectorId unique Id of the Font connector\n */\n getDownloadOptions = async (connectorId: string) => {\n const res = await this.#editorAPI;\n return res\n .fontConnectorGetDownloadOptions(connectorId)\n .then((result) => getEditorResponseData<ConnectorOptions>(result));\n };\n\n /**\n * This method returns what capabilities the selected connector has. It gives an indication what methods can\n * be used successfully for a certain connector.\n * @param connectorId unique Id of the Font connector\n */\n getCapabilities = async (connectorId: string) => {\n const res = await this.#editorAPI;\n return res\n .fontConnectorGetCapabilities(connectorId)\n .then((result) => getEditorResponseData<ConnectorCapabilities>(result));\n };\n\n /**\n * This method will parse the deprecatedFontType to the new Font type. This method will be removed once the deprecatedFontType is out of use\n * @param deprecatedType is 0 or 1\n */\n parseDeprecatedFontType = (deprecatedType: DeprecatedMediaType) => {\n if (deprecatedType === DeprecatedMediaType.file) return MediaType.file;\n if (deprecatedType === DeprecatedMediaType.collection) return MediaType.collection;\n };\n}\n","import { EditorAPI, Id } from '../types/CommonTypes';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\nimport { ImageSourceTypeEnum, ImageFrameVariableSource } from '../types/FrameTypes';\n\n/**\n * The ExperimentController contains all SDK functions that are considered for addition,\n * or functions we want to keep open for changing definitions. This is a sneak peak\n * into future versions of the SDK. Never build production code relying on functions in\n * this controller.\n */\nexport class ExperimentController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n }\n\n /**\n * This method will assign an image from a variable to the correct ImageFrame\n * @param imageFrameId The ID of the imageFrame where an image needs to be assigned to\n * @param variableId The ID of the variable which contains the image\n * @returns\n */\n insertImageVariableToFrame = async (imageFrameId: Id, variableId: string) => {\n const res = await this.#editorAPI;\n const src: ImageFrameVariableSource = { variableId: variableId, sourceType: ImageSourceTypeEnum.variable };\n return res\n .setImageSource(imageFrameId, JSON.stringify(src))\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will insert a text variable in the selected frame. Calling this method\n * requires that the selected frame is in text editing mode.\n * @param variableId The ID of the variable to be inserted.\n * @returns\n */\n insertTextVariable = async (variableId: Id) => {\n const res = await this.#editorAPI;\n return res.insertTextVariable(variableId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will enter text editing mode on the provided frame.\n * @param frameId The ID frame to enter text edit mode on.\n * @returns\n */\n enterTextEditMode = async (frameId: Id) => {\n const res = await this.#editorAPI;\n return res.enterTextEditMode(frameId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method will exit text editing mode.\n * @returns\n */\n exitTextEditMode = async () => {\n const res = await this.#editorAPI;\n return res.exitTextEditMode().then((result) => getEditorResponseData<null>(result));\n };\n}\n","import { EditorAPI, Id } from '../types/CommonTypes';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\nimport { CharacterStyle, CharacterStyleUpdate } from '../types/CharacterStyleTypes';\n\n/**\n * The CharacterStyleController is responsible for all communication regarding character styles.\n * Methods inside this controller can be called by `window.SDK.characterStyle.{method-name}`\n */\nexport class CharacterStyleController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n }\n\n /**\n * This method returns the list of character styles\n * @returns\n */\n getCharacterStyles = async () => {\n const res = await this.#editorAPI;\n return res.getCharacterStyles().then((result) => getEditorResponseData<CharacterStyle[]>(result));\n };\n\n /**\n * This method returns a character style by id\n * @param characterStyleId The ID of a specific character style\n * @returns\n */\n getCharacterStyleById = async (characterStyleId: Id) => {\n const res = await this.#editorAPI;\n return res\n .getCharacterStyleById(characterStyleId)\n .then((result) => getEditorResponseData<CharacterStyle>(result));\n };\n\n /**\n * This method creates a new character style\n * @returns the new created character style id\n */\n createCharacterStyle = async () => {\n const res = await this.#editorAPI;\n return res.createCharacterStyle().then((result) => getEditorResponseData<string>(result));\n };\n\n /**\n * This method updates a character style\n * @param id The ID of a specific character style\n * @param characterStyle The new character style properties\n * @returns\n */\n updateCharacterStyle = async (id: Id, characterStyle: CharacterStyleUpdate) => {\n const res = await this.#editorAPI;\n return res\n .updateCharacterStyle(id, JSON.stringify(characterStyle))\n .then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method removes a character style\n * @param id The ID of a specific character style\n * @returns\n */\n removeCharacterStyle = async (id: Id) => {\n const res = await this.#editorAPI;\n return res.removeCharacterStyle(id).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method duplicates a character style\n * @param characterStyleId The ID of a specific character style\n * @returns\n */\n duplicateCharacterStyle = async (characterStyleId: Id) => {\n const res = await this.#editorAPI;\n return res.duplicateCharacterStyle(characterStyleId).then((result) => getEditorResponseData<string>(result));\n };\n\n /**\n * This method renames a character style\n * @param id The ID of a specific character style\n * @param name The new name of the character style\n * @returns\n */\n renameCharacterStyle = async (id: Id, name: string) => {\n const res = await this.#editorAPI;\n return res.renameCharacterStyle(id, name).then((result) => getEditorResponseData<null>(result));\n };\n}\n","import { BasicAnimationsEmphasisType, BasicAnimationsIntroType, BasicAnimationsOutroType } from './AnimationTypes';\nimport { DocumentColor } from './ColorStyleTypes';\nimport { Id } from './CommonTypes';\nimport { BlendMode, FrameTypeEnum } from './FrameTypes';\nimport { LayoutType } from './LayoutTypes';\nimport { ParagraphStyle } from './ParagraphStyleTypes';\nimport { Variable } from './VariableTypes';\nimport { CharacterStyle } from './CharacterStyleTypes';\nimport { DocumentAction } from './ActionTypes';\nimport { ShapeProperties, ShapeType } from './ShapeTypes';\n\nexport type DocumentError = { error: Record<string, unknown>; code: number };\n\nexport type UndoState = {\n canUndo: boolean;\n canRedo: boolean;\n undoItemName: OperationName;\n redoItemName: OperationName;\n};\n\nexport type OperationName = { translationKey: number; name: string };\n\n/**\n * This type should give a clear indication of how the JSON document is structured. This could help you with building a test document yourself.\n */\nexport interface ChiliDocument {\n selectedLayoutId: string;\n properties?: TemplateDocumentProperties | ProjectDocumentProperties;\n pages: DocumentPage[];\n layouts: (ChildLayout | TopLayout)[];\n styleKit: DocumentStyleKit;\n variables: Variable[];\n actions: DocumentAction[];\n}\n\nexport interface DocumentPage {\n pageId: string;\n pageNumber: number;\n frames: (ImageFrame | TextFrame | ShapeFrame)[];\n}\n\nexport interface DocumentFrame {\n frameId: string;\n frameName: string;\n frameType: FrameTypeEnum;\n blendMode: BlendMode;\n constrainProportions: boolean;\n}\n\nexport interface ImageFrame extends DocumentFrame {\n src: VariableImageFrameSource | AssetProviderImageFrameSource | UrlImageFrameSource;\n}\n\nexport interface ShapeFrame extends DocumentFrame {\n shapeType: ShapeType;\n shapeProperties: ShapeProperties;\n}\n\nexport interface TextFrame extends DocumentFrame {\n textContent: string;\n paddingLeft: number;\n paddingTop: number;\n paddingRight: number;\n paddingBottom: number;\n numberOfColumns: number;\n columnGap: number;\n textDirection: string;\n flowDirection: string;\n verticalAlign: string;\n textStroke: boolean;\n textStrokeWeight: number;\n textStrokeColor: number;\n hasClippingPath: boolean;\n}\n\nexport enum ImageFrameSourceType {\n url = 'url',\n assetProvider = 'assetProvider',\n variable = 'variable',\n}\n\nexport interface ImageFrameSource {\n sourceType: ImageFrameSourceType;\n}\n\nexport interface UrlImageFrameSource extends ImageFrameSource {\n url: string;\n}\n\nexport interface AssetProviderImageFrameSource extends ImageFrameSource {\n providerId: string;\n assetId: string;\n}\n\nexport interface VariableImageFrameSource extends ImageFrameSource {\n variableId: string;\n}\n\nexport interface Layout {\n layoutId: string;\n layoutName: string;\n frameProperties: (ChildFrameProperty | TopFrameProperty)[];\n width?: number;\n height?: number;\n childLayouts: string[];\n layoutType: LayoutType;\n frameAnimations?: FrameAnimation[];\n timelineLengthMs?: number;\n animated?: boolean;\n}\n\nexport interface TopLayout extends Layout {\n frameAnimations: FrameAnimation[];\n timelineLengthMs: number;\n animated: boolean;\n parentLayoutId: Id;\n width: number;\n height: number;\n}\n\nexport interface ChildLayout extends Layout {\n parentLayoutId: Id;\n}\n\nexport enum FramePropertiesType {\n top = 'top',\n child = 'child',\n}\nexport interface FrameProperty {\n frameId: Id;\n x?: number;\n y?: number;\n width?: number;\n height?: number;\n rotationDegrees?: number;\n rotationOriginY?: number;\n scaleX?: number;\n scaleY?: number;\n included?: boolean;\n framePropertiesType: FramePropertiesType;\n}\n\nexport type ChildFrameProperty = FrameProperty;\nexport interface TopFrameProperty extends FrameProperty {\n x: number;\n y: number;\n width: number;\n height: number;\n rotationDegrees: number;\n rotationOriginY: number;\n scaleX: number;\n scaleY: number;\n included: boolean;\n}\n\nexport interface FrameAnimation {\n frameId: Id;\n from: number;\n to: number;\n basicAnimations: BasicAnimations;\n}\n\nexport interface BasicAnimations {\n intro?: BasicAnimationsIntroType;\n emphasis?: BasicAnimationsEmphasisType;\n outro?: BasicAnimationsOutroType;\n}\n\nexport interface DocumentStyleKit {\n colors: DocumentColor[];\n characterStyles: DocumentCharacterStyle[];\n paragraphStyles: DocumentParagraphStyle[];\n}\n\nexport type DocumentCharacterStyle = CharacterStyle;\nexport type DocumentParagraphStyle = ParagraphStyle;\n\nexport interface DocumentVariable extends Variable {\n parentId: Id;\n name: string;\n label: string;\n isHidden: boolean;\n isReadonly: boolean;\n isRequired: boolean;\n value: string;\n defaultValue: string;\n}\n\nexport enum DocumentType {\n project = 'project',\n template = 'template',\n}\n\nexport interface DocumentProperties {\n type: DocumentType;\n}\n\nexport type TemplateDocumentProperties = DocumentProperties;\n\nexport interface ProjectDocumentProperties extends DocumentProperties {\n templateId: string;\n}\n","import { EditorAPI, Id } from '../types/CommonTypes';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\n\n/**\n * The CanvasController is responsible for all Canvas-related functionality.\n * Methods inside this controller can be called by `window.SDK.canvas.{method-name}`\n */\nexport class CanvasController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n }\n\n /**\n * This method fits the page to the given rectangle or the viewport available\n * Optional parameters `left`, `top`, `width` and `height` are needed to define the rectangle to fit the page to\n * If any or all of them aren't provided the page will fit the whole viewport available\n * @param pageId The ID of a specific page\n * @param left\n * @param top\n * @param width\n * @param height\n * @returns\n */\n zoomToPage = async (\n pageId?: Id | null,\n left?: number | null,\n top?: number | null,\n width?: number | null,\n height?: number | null,\n ) => {\n const res = await this.#editorAPI;\n return res.zoomToPage(pageId, left, top, width, height).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method gets the scale factor of the canvas\n * @returns scale factor in percents\n */\n getZoomPercentage = async () => {\n const res = await this.#editorAPI;\n return res.getZoomPercentage().then((result) => getEditorResponseData<number>(result));\n };\n\n /**\n * This method sets the scale factor to the canvas and re-centers the page\n * @param scaleFactor scale factor in percents\n */\n setZoomPercentage = async (scaleFactor: number) => {\n const res = await this.#editorAPI;\n return res.setZoomPercentage(scaleFactor).then((result) => getEditorResponseData<null>(result));\n };\n}\n","import { Id } from './CommonTypes';\n\nexport enum SlideDirections {\n top = 'top',\n left = 'left',\n right = 'right',\n bottom = 'bottom',\n topLeft = 'topLeft',\n topRight = 'topRight',\n bottomLeft = 'bottomLeft',\n bottomRight = 'bottomRight',\n}\n\nexport enum ShakeDirections {\n horizontal = 'horizontal',\n vertical = 'vertical',\n}\n\nexport enum EaseTypes {\n easeIn = 'easeIn',\n easeOut = 'easeOut',\n easeInOut = 'easeInOut',\n}\n\nexport enum TweenTypes {\n quadratic = 'Quadratic',\n cubic = 'Cubic',\n quartic = 'Quartic',\n quintic = 'Quintic',\n sine = 'Sine',\n exponential = 'Exponential',\n circular = 'Circular',\n elastic = 'Elastic',\n bounce = 'Bounce',\n back = 'Back',\n}\n\nexport enum BasicAnimationsEmphasisStyles {\n bounce = 'bounce',\n flash = 'flash',\n headshake = 'headShake',\n heartbeat = 'heartbeat',\n pulse = 'pulse',\n rubberBand = 'rubberBand',\n vertical = 'vertical',\n horizontal = 'horizontal',\n swing = 'swing',\n tada = 'tada',\n}\n\nexport type EaseTweenCombinationType = `${EaseTypes}${TweenTypes}` | 'noEase';\n\nexport type BasicAnimationsIntroOutroStylesType = {\n slide?: {\n slideDirection: SlideDirections;\n offsetPercent: number;\n };\n rotation?: {\n angleDegrees: number;\n numberOfRotations?: number;\n };\n scale?: {\n scalePercent: number;\n };\n fade?: boolean;\n};\n\nexport type BasicAnimationsIntroType = {\n from: number;\n to: number;\n ease: EaseTweenCombinationType;\n styles: BasicAnimationsIntroOutroStylesType;\n};\n\nexport type BasicAnimationsEmphasisType = {\n from: number;\n to: number;\n ease: EaseTweenCombinationType;\n styles: {\n bounce?: boolean;\n flash?: boolean;\n pulse?: boolean;\n rubberBand?: boolean;\n shake?: {\n shakeDirection: ShakeDirections;\n };\n vertical?: boolean;\n horizontal?: boolean;\n headshake?: boolean;\n swing?: boolean;\n tada?: boolean;\n heartbeat?: boolean;\n };\n};\n\nexport type BasicAnimationsOutroType = {\n from: number;\n to: number;\n ease: EaseTweenCombinationType;\n styles: BasicAnimationsIntroOutroStylesType;\n};\n\nexport type BasicAnimationsType = {\n intro?: BasicAnimationsIntroType;\n emphasis?: BasicAnimationsEmphasisType;\n outro?: BasicAnimationsOutroType;\n};\n\nexport type FrameAnimationPropertiesType = {\n frameId: Id;\n from: number;\n to: number;\n basicAnimations: BasicAnimationsType;\n advancedAnimations?: unknown; // TBI\n};\nexport type FrameAnimationType = {\n animation: FrameAnimationPropertiesType;\n isOverride: boolean;\n};\n\nexport type AnimationPlaybackType = {\n currentAnimationTimeMs: number;\n animationIsPlaying: boolean;\n} | null;\n","import { Id, PropertyState } from './CommonTypes';\n\nexport type LayoutPropertiesType = {\n layoutId: Id;\n\n width: { value: number; isOverride: boolean };\n height: { value: number; isOverride: boolean };\n timelineLengthMs: { value: number; isOverride: boolean };\n [key: string]: number | string | Record<string, unknown>;\n} | null;\n\nexport type FrameProperties = {\n frameId: Id;\n framePropertiesType: string;\n height: number | null;\n included: boolean | null;\n rotationDegrees: number | null;\n scaleX: number | null;\n scaleY: number | null;\n width: number | null;\n x: number | null;\n y: number | null;\n};\n\nexport type LayoutWithFrameProperties = {\n layoutId: Id;\n layoutName: string;\n parentLayoutId?: Id;\n frameProperties: FrameProperties[];\n width: number | null;\n height: number | null;\n childLayouts: Id[];\n layoutType: LayoutType;\n timelineLengthMs?: number;\n children?: LayoutWithFrameProperties[];\n};\n\n// used by new getter methods\nexport type Layout = {\n layoutId: Id;\n layoutName: string;\n parentLayoutId?: Id;\n width: PropertyState<number>;\n height: PropertyState<number>;\n childLayouts: Id[];\n timelineLengthMs?: number;\n};\n\n// used by onLayoutsChanged\nexport type LayoutListItemType = {\n layoutId: string;\n layoutName: string;\n layoutType: LayoutType;\n parentLayoutId?: string | null;\n childLayouts: string[];\n};\n\nexport enum LayoutType {\n top = 'top',\n child = 'child',\n}\n","export enum ImageVariableSourceType {\n url = 'url',\n mediaConnector = 'mediaConnector',\n}\n\nexport interface UrlImageVariableSource {\n sourceType: ImageVariableSourceType;\n url: string;\n}\n\nexport interface MediaConnectorImageVariableSource {\n sourceType: ImageVariableSourceType;\n connectorId: string;\n assetId: string;\n}\n\nexport type ImageVariableSource = UrlImageVariableSource | MediaConnectorImageVariableSource;\n\nexport enum VariableType {\n shorttext = 'shorttext',\n longtext = 'longtext',\n image = 'image',\n group = 'group',\n}\n\nexport interface Variable {\n id: string;\n type: VariableType;\n parentId?: string;\n name: string;\n label: string;\n isHidden: boolean;\n isReadonly: boolean;\n isRequired: boolean;\n}\n\nexport interface ImageVariable extends Variable {\n occurrences: number;\n src?: ImageVariableSource;\n}\n\nexport interface ShortTextVariable extends Variable {\n occurrences: number;\n value: string;\n}\n\nexport type LongTextVariable = ShortTextVariable;\n\nexport type GroupVariable = Variable;\n\nexport type VariableMoves = {\n moves: string[];\n order: number;\n parent: string;\n};\n","import { VerticalAlign } from './FrameTypes';\nimport { ColorUsage } from './ColorStyleTypes';\n\nexport enum FontWeights {\n BOLD = 'Bold',\n ITALIC = 'Italic',\n REGULAR = 'Regular',\n}\nexport enum Alignment {\n LEFT = 'left',\n CENTER = 'center',\n RIGHT = 'right',\n JUSTIFY = 'justify',\n}\n\nexport enum TextPosition {\n TOP = 'top',\n CENTER = 'center',\n BOTTOM = 'bottom',\n}\nexport enum Case {\n TO_LOWER_CASE = 'lowercase',\n TO_UPPER_CASE = 'uppercase',\n NORMAL = 'normal',\n}\nexport enum Scripting {\n SUPERSCRIPT = 'superscript',\n SUBSCRIPT = 'subscript',\n NORMAL = 'normal',\n}\n\nexport type DisplayColor = ColorUsage & {\n isApplied: boolean;\n};\nexport interface TextProperties {\n fontKey?: string;\n fontStyle?: FontWeights;\n fontSize?: number;\n textAlign?: Alignment;\n verticalAlign?: VerticalAlign;\n underline?: boolean;\n lineThrough?: boolean;\n letterSpacing?: string;\n lineHeight?: number;\n SUB_SUPER_SCRIPT?: Scripting;\n typographicCase?: Case;\n color?: DisplayColor;\n [key: string]: number | string | Record<string, unknown> | null | boolean | undefined;\n}\n\nexport interface TextStyle {\n paragraph?: string;\n character?: string;\n [key: string]: number | string | Record<string, unknown> | null | boolean | undefined;\n}\nexport type TextStyleUpdateType = {\n [key in keyof typeof SelectedTextStyles]?: {\n value: number | string | boolean;\n };\n};\n\nexport interface AppearanceProperties {\n blendMode?: string;\n opacity?: string;\n useFill?: boolean;\n useStroke?: boolean;\n useDropShadow?: boolean;\n fillColor?: string;\n strokeColor?: string;\n dropShadowColor?: string;\n}\n\nexport interface SelectedTextStyle {\n paragraphStyleId?: string;\n characterStyleId?: string;\n fontKey?: string;\n fontSize: number;\n typographicCase: Case;\n kerningOn: boolean;\n subSuperScript: Scripting;\n trackingLeft: string;\n trackingRight: string;\n paragraphStartIndent: string;\n paragraphEndIndent: string;\n paragraphSpaceBefore: string;\n paragraphSpaceAfter: string;\n textIndent: string;\n alignToBaseLine: boolean;\n baselineShiftValue: string;\n lineHeight: number;\n verticalAlign: VerticalAlign;\n copyfittingScale: number;\n textAlign: HorizontalAlign;\n textAlignLast: HorizontalAlign;\n textOverprint: boolean;\n color: DisplayColor;\n underline: boolean;\n lineThrough: boolean;\n}\n\nexport enum HorizontalAlign {\n left = 'left',\n center = 'center',\n right = 'right',\n justify = 'justify',\n}\n\nexport enum SelectedTextStyleSections {\n STYLE = 'textStyle',\n PROPERTIES = 'textProperties',\n APPEARANCE = 'appearance',\n}\n\nexport enum SelectedTextStyles {\n PARAGRAPH = 'paragraphStyleId',\n CHARACTER = 'characterStyleId',\n FONT_FAMILY = 'fontKey',\n FONT_STYLE = 'fontStyle',\n FONT_SIZE = 'fontSize',\n LETTER_SPACING = 'letterSpacing',\n LINE_HEIGHT = 'lineHeight',\n TEXT_ALIGN = 'textAlign',\n VERTICAL_ALIGN = 'verticalAlign',\n TYPOGRAPHIC_CASE = 'typographicCase',\n SUB_SUPER_SCRIPT = 'subSuperScript',\n UNDERLINE = 'underline',\n LINETHROUGH = 'lineThrough',\n FILL_COLOR = 'fillColor',\n COLOR = 'color',\n FILL_COLOR_APPLIED = 'fillColorApplied',\n STROKE_COLOR = 'strokeColor',\n DROP_SHADOW_COLOR = 'dropShadowColor',\n BLEND_MODE = 'blendMode',\n OPACITY = 'opacity',\n}\n\nexport interface UpdateStyleType {\n path: { value: number | string | Record<string, unknown> | null | boolean | undefined };\n}\n","export enum ColorType {\n rgb = 'rgb',\n cmyk = 'cmyk',\n lab = 'lab',\n gray = 'gray',\n xyz = 'xyz',\n hls = 'hls',\n spotCmyk = 'spotCmyk',\n spotRgb = 'spotRgb',\n custom = 'custom',\n}\n\nexport type ColorUpdate = {\n r: number;\n g: number;\n b: number;\n colorType: ColorType;\n};\n\nexport type Color = {\n colorType: ColorType;\n r: number;\n g: number;\n b: number;\n displayValue?: string;\n};\n\nexport type DocumentColor = {\n id: string;\n name: string;\n color: Color;\n};\n\nexport type ColorUsageUpdate = {\n /**\n * Reference to the stylekit color, can only be used if it is a stylekit color.\n */\n colorId?: string;\n /**\n * The local color object, can only be used if it is a local color.\n */\n color?: ColorUpdate;\n usageType: ColorUsageType;\n /**\n * Opacity of the color (0-100) where 0 = fully transparent.\n */\n opacity?: number;\n /**\n * Indicates if the color will be applied or not.\n */\n isApplied?: boolean;\n};\n\nexport type ColorUsage = {\n /**\n * Reference to the stylekit color, can only be used if it is a stylekit color.\n */\n colorId?: string;\n /**\n * The local color object, can only be used if it is a local color.\n */\n color?: Color;\n usageType: ColorUsageType;\n /**\n * Opacity of the color (0-100) where 0 = fully transparent.\n */\n opacity?: number;\n};\n\nexport enum ColorUsageType {\n /**\n * The color is defined locally on the object\n */\n local = 'local',\n /**\n * THe color is referencing a stylekit color\n */\n stylekit = 'stylekit',\n}\n","import { MediaType } from './ConnectorTypes';\n\nexport enum MediaDownloadType {\n LowResolutionWeb = 'lowresWeb',\n HighResolutionWeb = 'highresWeb',\n}\n\nexport type Media = {\n id: string;\n name: string;\n relativePath: string;\n type: MediaType;\n extension: string | null;\n metaData: {\n [key: string]: string;\n };\n};\n\nexport type MediaPage = {\n pageSize: number;\n nextPageToken?: string;\n data: Media[];\n};\n","import { MediaType } from './ConnectorTypes';\n\nexport enum FontDownloadType {\n Preview = 'lowresWeb',\n Download = 'outputPdf',\n}\n\nexport type Font = {\n id: string;\n name: string;\n family: string | null;\n style: string | null;\n relativePath: string;\n type: MediaType;\n extension: string | null;\n metaData: Map<string, string>;\n};\n\nexport type FontPage = {\n pageSize: number;\n nextPageToken?: string;\n data: Font[];\n};\n","import { Id } from './CommonTypes';\n\n/**\n * Editor Events that Actions can react to.\n */\nexport enum ActionEditorEvent {\n /**\n * Indicates the selected layout changed.\n */\n selectedLayoutChanged = 'selectedLayoutChanged',\n\n /**\n * Indicates a frame was moved, resized, rotated.\n * Note: this does not trigger when a different layout is selected.\n */\n frameMoved = 'frameMoved',\n\n /**\n * Indicates the size of a page has changed.\n */\n pageSizeChanged = 'pageSizeChanged',\n\n /**\n * Indicates the document is fully initialized, actions can safely be executed.\n * Note: the other events will only be triggered after a document is fully initialized.\n */\n documentLoaded = 'documentLoaded',\n\n /**\n * Indicates the value of a variable changed.\n */\n variableValueChanged = 'variableValueChanged',\n}\n\n/**\n * Action used by the document.\n */\nexport interface DocumentAction {\n /**\n * Unique Id of the action.\n */\n id: Id;\n\n /**\n * Unique action name\n */\n actionName: string;\n\n /**\n * All the triggers this action will react to.\n */\n triggers: ActionTrigger[];\n\n /**\n * The JavaScript based action script.\n */\n script: string;\n}\n\n/**\n * Trigger used to fire an action.\n */\nexport interface ActionTrigger {\n /**\n * The event the action should react to.\n */\n event: ActionEditorEvent;\n\n /**\n * The entity ID's this trigger should react to.\n * Leaving this `undefined`, will make this trigger react to all entities.\n */\n triggers?: Id[];\n}\n","import { ActionTrigger } from '../types/ActionTypes';\nimport { EditorAPI, Id } from '../types/CommonTypes';\nimport { getEditorResponseData } from '../utils/EditorResponseData';\n\n/**\n * The ActionController is responsible for all Actions-related functionality.\n * Methods inside this controller can be called by `window.SDK.action.{method-name}`\n */\nexport class ActionController {\n /**\n * @ignore\n */\n #editorAPI: EditorAPI;\n\n /**\n * @ignore\n */\n constructor(editorAPI: EditorAPI) {\n this.#editorAPI = editorAPI;\n }\n\n /**\n * This method creates a new action.\n * @returns The ID of the newly created action.\n */\n createAction = async () => {\n const res = await this.#editorAPI;\n return res.createAction().then((result) => getEditorResponseData<Id>(result));\n };\n\n /**\n * This method removes the action.\n * @param actionId The ID of a specific action\n * @returns\n */\n removeAction = async (actionId: Id) => {\n const res = await this.#editorAPI;\n return res.removeAction(actionId).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method updates the script the action uses.\n * @param actionId The ID of a specific action\n * @param script The JavaScript based action script\n * @returns\n */\n updateActionScript = async (actionId: Id, script: string) => {\n const res = await this.#editorAPI;\n return res.updateActionScript(actionId, script).then((result) => getEditorResponseData<null>(result));\n };\n\n /**\n * This method updates the triggers on which the action will react.\n * @param actionId The ID of a specific action\n * @param triggers The triggers this action should react on.\n * @returns\n */\n updateActionTriggers = async (actionId: Id, triggers: ActionTrigger[]) => {\n const res = await this.#editorAPI;\n return res\n .updateActionTriggers(actionId, JSON.stringify(triggers))\n .then((result) => getEditorResponseData<null>(result));\n };\n}\n","import { Connection } from 'penpal';\nimport Connect from './interactions/connector';\nimport { FrameController } from './controllers/FrameController';\nimport { AnimationController } from './controllers/AnimationController';\nimport { LayoutController } from './controllers/LayoutController';\nimport { PageController } from './controllers/PageController';\nimport { UtilsController } from './controllers/UtilsController';\nimport { SubscriberController } from './controllers/SubscriberController';\nimport { DocumentController } from './controllers/DocumentController';\nimport { DebugController } from './controllers/DebugController';\n\nimport type { ConfigType, EditorAPI } from './types/CommonTypes';\nimport { VariableController } from './controllers/VariableController';\nimport { ToolController } from './controllers/ToolController';\nimport { UndoManagerController } from './controllers/UndoManagerController';\nimport { TextStyleController } from './controllers/TextStyleController';\nimport { ColorStyleController } from './controllers/ColorStyleController';\nimport { ParagraphStyleController } from './controllers/ParagraphStyleController';\nimport { ConfigurationController } from './controllers/ConfigurationController';\nimport { MediaConnectorController } from './controllers/MediaConnectorController';\nimport { WellKnownConfigurationKeys } from './types/ConfigurationTypes';\nimport packageInfo from '../package.json';\nimport engineInfo from '../editor-engine.json';\nimport { FontController } from './controllers/FontController';\nimport { ConnectorController } from './controllers/ConnectorController';\nimport { FontConnectorController } from './controllers/FontConnectorController';\nimport { ExperimentController } from './controllers/ExperimentController';\nimport { CharacterStyleController } from './controllers/CharacterStyleController';\nimport { CanvasController } from './controllers/CanvasController';\nimport { DocumentType } from './types/DocumentTypes';\nimport { ActionController } from './controllers/ActionController';\nimport { ShapeController } from './controllers/ShapeController';\n\nexport { FrameProperyNames, LayoutProperyNames, ToolType, DownloadFormats } from './utils/enums';\n\nexport {\n SlideDirections,\n ShakeDirections,\n EaseTypes,\n TweenTypes,\n BasicAnimationsEmphasisStyles,\n} from './types/AnimationTypes';\nexport { LayoutType } from './types/LayoutTypes';\nexport {\n BlendMode,\n FrameTypeEnum,\n VerticalAlign,\n TextDirection,\n FlowDirection,\n FitMode,\n UpdateZIndexMethod,\n ImageSourceTypeEnum,\n} from './types/FrameTypes';\nexport { VariableType, ImageVariableSourceType } from './types/VariableTypes';\n\nexport type {\n LayoutPropertiesType,\n FrameProperties,\n LayoutWithFrameProperties,\n LayoutListItemType,\n} from './types/LayoutTypes';\nexport type {\n FrameLayoutType,\n FrameType,\n Frame,\n TextFrame,\n ImageFrame,\n ShapeFrame,\n ImageFrameSource,\n ImageFrameVariableSource,\n ImageFrameUrlSource,\n} from './types/FrameTypes';\nexport type {\n Variable,\n GroupVariable,\n ImageVariable,\n LongTextVariable,\n ShortTextVariable,\n VariableMoves,\n UrlImageVariableSource,\n MediaConnectorImageVariableSource,\n ImageVariableSource,\n} from './types/VariableTypes';\nexport type { Color, DocumentColor, ColorUpdate } from './types/ColorStyleTypes';\n\nexport type { DocumentError } from './types/DocumentTypes';\nexport type {\n FrameAnimationType,\n FrameAnimationPropertiesType,\n EaseTweenCombinationType,\n AnimationPlaybackType,\n BasicAnimationsType,\n} from './types/AnimationTypes';\nexport type {\n ConfigType,\n InitialStateType,\n PageType,\n EditorResponse,\n SelectedLayoutFrame,\n MetaData,\n Id,\n} from './types/CommonTypes';\n\nexport type {\n TextProperties,\n TextStyle,\n AppearanceProperties,\n TextStyleUpdateType,\n UpdateStyleType,\n DisplayColor,\n} from './types/TextStyleTypes';\n\nexport type { ParagraphStyle, ParagraphStyleUpdate } from './types/ParagraphStyleTypes';\nexport type { CharacterStyle, CharacterStyleUpdate } from './types/CharacterStyleTypes';\nexport type { ColorUsage, ColorUsageUpdate, ColorUsageType } from './types/ColorStyleTypes';\n\nexport type { DocumentFont, AddDocumentFont } from './types/FontTypes';\n\nexport {\n SelectedTextStyleSections,\n SelectedTextStyles,\n FontWeights,\n Alignment,\n TextPosition,\n Case,\n Scripting,\n} from './types/TextStyleTypes';\nexport { ColorType } from './types/ColorStyleTypes';\nexport * from './types/MediaConnectorTypes';\nexport * from './types/FontConnectorTypes';\nexport * from './types/ConnectorTypes';\n\nexport { WellKnownConfigurationKeys } from './types/ConfigurationTypes';\n\nexport * from './types/ActionTypes';\n\nlet connection: Connection;\n\nconst FIXED_EDITOR_LINK = 'https://studio-cdn.chiligrafx.com/editor/' + engineInfo.current + '/web';\n\nexport class SDK {\n config: ConfigType;\n connection: Connection;\n\n /**\n * @ignore\n */\n editorAPI: EditorAPI;\n\n action: ActionController;\n layout: LayoutController;\n frame: FrameController;\n shape: ShapeController;\n connector: ConnectorController;\n mediaConnector: MediaConnectorController;\n fontConnector: FontConnectorController;\n animation: AnimationController;\n document: DocumentController;\n configuration: ConfigurationController;\n variable: VariableController;\n utils: UtilsController;\n tool: ToolController;\n page: PageController;\n debug: DebugController;\n undoManager: UndoManagerController;\n textSelection: TextStyleController;\n paragraphStyle: ParagraphStyleController;\n characterStyle: CharacterStyleController;\n colorStyle: ColorStyleController;\n font: FontController;\n experiment: ExperimentController;\n canvas: CanvasController;\n\n private subscriber: SubscriberController;\n\n /**\n * The SDK should be configured clientside and it exposes all controllers to work with in other applications\n * @param config The configuration object where the SDK and editor can get configured\n */\n constructor(config: ConfigType) {\n this.config = config;\n this.connection = connection;\n this.editorAPI = connection?.promise.then((child) => {\n return child;\n }) as unknown as EditorAPI;\n\n this.action = new ActionController(this.editorAPI);\n this.layout = new LayoutController(this.editorAPI);\n this.frame = new FrameController(this.editorAPI);\n this.shape = new ShapeController(this.editorAPI);\n this.connector = new ConnectorController(this.editorAPI);\n this.mediaConnector = new MediaConnectorController(this.editorAPI);\n this.fontConnector = new FontConnectorController(this.editorAPI);\n this.animation = new AnimationController(this.editorAPI);\n this.document = new DocumentController(this.editorAPI);\n this.configuration = new ConfigurationController(this.editorAPI);\n this.variable = new VariableController(this.editorAPI);\n this.utils = new UtilsController();\n this.subscriber = new SubscriberController(this.config);\n this.tool = new ToolController(this.editorAPI);\n this.page = new PageController(this.editorAPI);\n this.debug = new DebugController(this.editorAPI);\n this.undoManager = new UndoManagerController(this.editorAPI);\n this.textSelection = new TextStyleController(this.editorAPI);\n this.colorStyle = new ColorStyleController(this.editorAPI);\n this.paragraphStyle = new ParagraphStyleController(this.editorAPI);\n this.characterStyle = new CharacterStyleController(this.editorAPI);\n this.font = new FontController(this.editorAPI);\n this.experiment = new ExperimentController(this.editorAPI);\n this.canvas = new CanvasController(this.editorAPI);\n }\n\n /**\n * This method will initiate the editor, running this will result in the editor restarting\n * It will generate an iframe in the document\n */\n loadEditor = () => {\n Connect(\n this.config.editorLink || FIXED_EDITOR_LINK,\n {\n onActionsChanged: this.subscriber.onActionsChanged,\n onStateChanged: this.subscriber.onStateChanged,\n onDocumentLoaded: this.subscriber.onDocumentLoaded,\n onSelectedFrameContentChanged: this.subscriber.onSelectedFrameContentChanged,\n onSelectedFrameLayoutChanged: this.subscriber.onSelectedFrameLayoutChanged,\n onSelectedLayoutPropertiesChanged: this.subscriber.onSelectedLayoutPropertiesChanged,\n onPageSelectionChanged: this.subscriber.onPageSelectionChanged,\n onScrubberPositionChanged: this.subscriber.onAnimationPlaybackChanged,\n onFrameAnimationsChanged: this.subscriber.onAnimationChanged,\n onVariableListChanged: this.subscriber.onVariableListChanged,\n onSelectedToolChanged: this.subscriber.onSelectedToolChanged,\n onUndoStateChanged: this.subscriber.onUndoStateChanged,\n onSelectedLayoutFramesChanged: this.subscriber.onSelectedLayoutFramesChanged,\n onSelectedTextStyleChanged: this.subscriber.onSelectedTextStyleChanged,\n onColorsChanged: this.subscriber.onColorsChanged,\n onParagraphStylesChanged: this.subscriber.onParagraphStylesChanged,\n onCharacterStylesChanged: this.subscriber.onCharacterStylesChanged,\n onFontsChanged: this.subscriber.onFontsChanged,\n onSelectedLayoutIdChanged: this.subscriber.onSelectedLayoutIdChanged,\n onLayoutsChanged: this.subscriber.onLayoutsChanged,\n onConnectorEvent: this.subscriber.onConnectorEvent,\n onZoomChanged: this.subscriber.onZoomChanged,\n onPageSizeChanged: this.subscriber.onPageSizeChanged,\n onShapeCornerRadiusChanged: this.subscriber.onShapeCornerRadiusChanged,\n },\n this.setConnection,\n this.config.editorId,\n );\n this.editorAPI = connection?.promise.then((editorAPI) => {\n return editorAPI;\n }) as unknown as EditorAPI;\n\n this.action = new ActionController(this.editorAPI);\n this.layout = new LayoutController(this.editorAPI);\n this.frame = new FrameController(this.editorAPI);\n this.animation = new AnimationController(this.editorAPI);\n this.document = new DocumentController(this.editorAPI);\n this.configuration = new ConfigurationController(this.editorAPI);\n this.variable = new VariableController(this.editorAPI);\n this.utils = new UtilsController();\n this.tool = new ToolController(this.editorAPI);\n this.page = new PageController(this.editorAPI);\n this.debug = new DebugController(this.editorAPI);\n this.undoManager = new UndoManagerController(this.editorAPI);\n this.textSelection = new TextStyleController(this.editorAPI);\n this.colorStyle = new ColorStyleController(this.editorAPI);\n this.paragraphStyle = new ParagraphStyleController(this.editorAPI);\n this.characterStyle = new CharacterStyleController(this.editorAPI);\n this.mediaConnector = new MediaConnectorController(this.editorAPI);\n this.fontConnector = new FontConnectorController(this.editorAPI);\n this.connector = new ConnectorController(this.editorAPI);\n this.font = new FontController(this.editorAPI);\n this.experiment = new ExperimentController(this.editorAPI);\n this.canvas = new CanvasController(this.editorAPI);\n this.shape = new ShapeController(this.editorAPI);\n\n // as soon as the editor loads, provide it with the SDK version\n // used to make it start. This enables engine compatibility checks\n // on the Flutter side\n this.configuration.setValue(WellKnownConfigurationKeys.GraFxStudioSdkVersion, packageInfo.version);\n\n // Makes the engine aware which document type it should render, if this call\n // isn't made, the engine will fall back to the type specified in the document.\n //\n // Loading a template JSON and setting the engine to `project` will cause\n // the document JSON structure to be converted to a project on save.\n // Using `getCurrentDocumentState` will also output the converted document.\n this.configuration.setValue(\n WellKnownConfigurationKeys.GraFxStudioDocumentType,\n this.config.documentType || DocumentType.template,\n );\n };\n\n setConnection = (newConnection: Connection) => {\n connection = newConnection;\n };\n}\n\nexport default SDK;\n"],"names":["root","factory","exports","module","define","amd","this","cosh","x","Math","exp","sinh","parser_exit","SyntaxError","logHypot","a","b","_a","abs","_b","log","cos","atan2","Complex","z","undefined","Number","isFinite","sin","length","tokens","match","plus","minus","i","c","isNaN","parseFloat","parse","prototype","t","d","pow","arg","loh","re","im","r","sqrt","tmp","expm1","PI","xx","cosm1","y","t1","t2","Infinity","atan","acos","asin","res","noIM","oneMinus","onePlus","temp","atanh","asinh","acosh","places","ceil","floor","round","ret","E","NaN","globalScope","Decimal","inexact","quadrant","EXP_LIMIT","NUMERALS","LN10","DEFAULTS","precision","rounding","modulo","toExpNeg","toExpPos","minE","maxE","crypto","external","invalidArgument","decimalError","tag","mathfloor","mathpow","isBinary","isHex","isOctal","isDecimal","BASE","LN10_PRECISION","PI_PRECISION","P","toStringTag","digitsToString","k","ws","indexOfLastWord","str","w","getZeroString","checkInt32","min","max","Error","checkRoundingDigits","rm","repeating","di","rd","convertBase","baseIn","baseOut","j","arrL","arr","strL","indexOf","charAt","reverse","absoluteValue","constructor","s","finalise","e","clampedTo","clamp","Ctor","gt","cmp","comparedTo","xdL","ydL","xd","yd","xs","ys","cosine","pr","sd","len","isZero","tinyPow","toString","taylorSeries","times","cos2x","toLessThanHalfPi","neg","cubeRoot","cbrt","m","n","rep","t3","t3plusx","toExponential","slice","divide","eq","decimalPlaces","dp","dividedBy","div","dividedToIntegerBy","divToInt","equals","greaterThan","greaterThanOrEqualTo","gte","hyperbolicCosine","one","cosh2_x","d8","hyperbolicSine","sinh2_x","d5","d16","d20","hyperbolicTangent","tanh","inverseCosine","halfPi","isNeg","getPi","inverseHyperbolicCosine","lte","ln","inverseHyperbolicSine","inverseHyperbolicTangent","wpr","xsd","inverseSine","inverseTangent","px","x2","isInteger","isInt","isNegative","isPositive","isPos","lessThan","lt","lessThanOrEqualTo","logarithm","base","isBase10","denominator","inf","num","naturalLogarithm","getLn10","sub","xe","xLTy","push","pop","shift","getBase10Exponent","mod","q","naturalExponential","negated","add","carry","unshift","getPrecision","sine","sin2_x","squareRoot","tangent","tan","mul","rL","toBinary","toStringBinary","toDecimalPlaces","toDP","finiteToString","toFixed","toFraction","maxD","d0","d1","d2","n0","n1","toHexadecimal","toHex","toNearest","toNumber","toOctal","toPower","yn","intPow","toPrecision","toSignificantDigits","toSD","truncated","trunc","valueOf","toJSON","multiplyInteger","compare","aL","bL","subtract","logBase","more","prod","prodL","qd","rem","remL","rem0","xi","xL","yd0","yL","yz","sign","isTruncated","digits","roundUp","xdi","out","isExp","nonFiniteToString","zs","truncate","isOdd","maxOrMin","args","ltgt","guard","sum","c0","numerator","x1","String","parseDecimal","replace","search","substring","charCodeAt","parseOther","divisor","isFloat","p","test","toLowerCase","isHyperbolic","u","pi","config","obj","v","useDefaults","defaults","ps","getRandomValues","randomBytes","hypot","arguments","isDecimalInstance","log2","log10","random","Uint32Array","copy","clone","ROUND_UP","ROUND_DOWN","ROUND_CEIL","ROUND_FLOOR","ROUND_HALF_UP","ROUND_HALF_DOWN","ROUND_HALF_EVEN","ROUND_HALF_CEIL","ROUND_HALF_FLOOR","EUCLID","set","hasOwnProperty","_extends","Object","assign","target","source","key","call","defaultEscapes","$","_","formatEscapes","defaultEscapeMapFn","_ref","_ref$preserveFormatti","preserveFormatting","_ref$escapeMapFn","escapeMapFn","runningStr","result","escapes","escapeKeys","keys","_loop","specialCharFound","forEach","index","createError","name","errorConstructor","apply","IntermediateInheritor","DivisionByZero","Fraction","InvalidParameter","parseInt","throwInvalidParam","factorize","factors","p1","p2","M","A","B","C","D","N","gcd","eps","cont","rec","excludeWhole","whole","dec","cycLen","cycleLen","cycOff","rem1","rem2","modpow","cycleStart","on","callback","ctx","fn","once","self","listener","off","emit","data","evtArr","evts","liveEvents","TinyEmitter","ok","notOk","undef","create","_types","Array","isArray","Date","RegExp","anyType","_ignore","_conversions","typed","types","conversions","ignore","findTypeByName","typeName","entry","findInArray","hint","TypeError","findTypeIndex","type","findTypeName","value","find","signature","signatures","split","trim","join","convert","from","conversion","to","stringifyParams","params","map","param","typeNames","getTypeName","restParam","parseParam","filter","notEmpty","notIgnore","matchingConversions","filterConversions","exactTypes","typeIndex","conversionIndex","convertibleTypes","concat","parseSignature","array","parsedParam","some","isInvalidParam","hasRestParam","last","hasConversions","compileTest","test0","test1","tests","compileTests","varIndex","initial","lastTest","testRestParam","getParamAtIndex","getExpectedTypeNames","excludeConversions","isExactType","mergeExpectedParams","uniq","flatMap","err","expected","_name","matchingSignatures","nextMatchingDefs","actualType","category","actual","lengths","maxLength","expectedLength","getLowestTypeIndex","getLowestConversionIndex","compareParams","param1","param2","compareSignatures","signature1","signature2","matches","compileArgsPreprocessing","fnConvert","compiledConversions","compileArgConversion","fnPreprocess","offset","conversion0","conversion1","createSignaturesMap","signaturesMap","splitParams","ignoreConversionTypes","_splitParams","typeGroups","filteredTypes","typeGroup","hasConflictingParams","ii","hasOverlap","len1","len2","restParam1","restParam2","createTypedFunction","parsedSignatures","notNull","parsedSignature","conflictingSignature","sort","ok0","ok1","ok2","ok3","ok4","ok5","allOk","test00","test10","test20","test30","test40","test50","test01","test11","test21","test31","test41","test51","fns","fn0","fn1","fn2","fn3","fn4","fn5","len0","len3","len4","len5","iStart","iEnd","generic","arg0","arg1","defineProperty","start","end","contains","item","array1","array2","entries","getName","extractSignatures","validateUnique","_signature","_fn","addType","beforeObjectTest","splice","addConversion","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","__webpack_modules__","definition","o","enumerable","get","prop","Symbol","Resolution","ErrorCode","NativeErrorName","MessageType","NativeEventType","DEFAULT_PORT_BY_PROTOCOL","URL_REGEX","opaqueOriginSchemes","serializeError","message","stack","id","keyPathToSegments","keyPath","setAtKeyPath","subject","segments","reduce","prevSubject","idx","methods","prefix","flattenedMethods","segmentsToKeyPath","createKeyPath","callSender","info","methodKeyPaths","destroyConnection","destroyed","localName","createMethodProxy","methodName","iframeRemoved","remote","closed","error","code","ConnectionDestroyed","Promise","resolve","reject","generateId","handleMessageEvent","event","penpal","origin","originForReceiving","replyMessage","local","removeEventListener","returnValue","returnValueIsError","deserializedError","deserializeError","resolution","Fulfilled","addEventListener","callMessage","postMessage","originForSending","api","deserializeMethods","serializedMethods","childOrigin","destructor","destroyCallReceiver","receiverMethodNames","window","createPromiseHandler","Rejected","DataCloneError","errorReplyMessage","then","onDestroy","receiverMethodName","methodNames","destroyCallSender","destroy","options","debug","console","callbacks","iframe","src","srcdoc","NoIframeSrc","validateIframeHasSrcOrSrcDoc","scheme","startsWith","location","document","regexResult","exec","protocol","hostname","port","getOriginFromSrc","handleSynMessage","synAckMessage","handleSynMessageFactory","handleAckMessage","handleAckMessageFactory","promise","stopConnectionTimeout","timeout","timeoutId","setTimeout","ConnectionTimeout","clearTimeout","handleMessage","contentWindow","checkIframeInDocIntervalId","setInterval","isConnected","clearInterval","monitorIframeRemoval","setupFrame","editorLink","link","validateEditorLink","html","iframeDoc","ownerDocument","open","write","close","setConnection","editorId","editorSelectorId","createElement","setAttribute","setupNewFrame","iframeContainer","querySelector","appendChild","readyState","connectToChild","actionsChanged","onActionsChanged","stateChanged","onStateChanged","documentLoaded","onDocumentLoaded","selectedFrameContent","onSelectedFrameContentChanged","selectedFrameLayout","onSelectedFrameLayoutChanged","selectedLayoutProperties","onSelectedLayoutPropertiesChanged","openLayoutPropertiesPanel","onPageSelectionChanged","scrubberPositionChanged","onScrubberPositionChanged","frameAnimationsChanged","onFrameAnimationsChanged","selectedToolChanged","onSelectedToolChanged","variableListChanged","onVariableListChanged","undoStackStateChanged","onUndoStateChanged","selectedLayoutFramesChanged","onSelectedLayoutFramesChanged","selectedTextStyleChanged","onSelectedTextStyleChanged","colorsChanged","onColorsChanged","paragraphStylesChanged","onParagraphStylesChanged","characterStylesChanged","onCharacterStylesChanged","fontsChanged","onFontsChanged","selectedLayoutId","onSelectedLayoutIdChanged","layoutListChanged","onLayoutsChanged","connectorEvent","onConnectorEvent","zoomChanged","onZoomChanged","pageSizeChanged","onPageSizeChanged","shapeCornerRadiusChanged","onShapeCornerRadiusChanged","isNumber","isBigNumber","isComplex","getPrototypeOf","isFraction","isUnit","isMatrix","isDenseMatrix","isSparseMatrix","isRange","isIndex","isBoolean","isResultSet","isHelp","isFunction","isDate","isRegExp","isObject","isNull","isUndefined","isAccessorNode","isNode","isArrayNode","isAssignmentNode","isBlockNode","isConditionalNode","isConstantNode","isFunctionAssignmentNode","isFunctionNode","isIndexNode","isObjectNode","isOperatorNode","isParenthesisNode","isRangeNode","isSymbolNode","isChain","mapObject","object","extend","deepExtend","Function","deepStrictEqual","deepFlatten","nestedObject","flattenedObject","_deepFlatten","lazy","valueResolver","_value","_uninitialized","configurable","property","values","dependencies","meta","assertAndCreate","scope","deps","properties","pickShallow","stripOptionalNotation","dependency","isOptionalDependency","every","missingDependencies","assertDependencies","isFactory","log1p","formatNumberToBase","size","suffix","format","wordSize","notation","rounded","roundDigits","splitNumber","exponent","coefficients","newExp","missingZeros","expDiff","decimalIdx","decimals","decimalVal","toEngineering","lowerExp","upperExp","zeros","dot","splitValue","pp","first","DBL_EPSILON","EPSILON","epsilon","diff","formatBigNumberToBase","big2","BigNumberCtor","valueWithoutExp","valueStr","endsWith","text","looksLikeFraction","fraction","formatArray","syntax","stringify","escaped","DimensionError","relation","_validate","dim","dimNext","child","validate","validateIndex","resize","defaultValue","_resize","elem","oldLen","newLen","minLen","reshape","sizes","flatArray","flat","flatten","currentLength","newLength","product","processSizesWildcard","tmpArray2","tmpArray","sizeIndex","_reshape","processedSizes","wildCardIndex","prev","curr","unsqueeze","dims","outer","_unsqueeze","next","separator","getArrayDataType","typeOf","itemType","ArgumentsError","count","importFactory","load","math","importedFactories","_import","wrap","wrapper","transform","_wrap","isTypedFunction","override","_importTransform","silent","expression","allowedInExpressions","mathWithTransform","_deleteTransform","_importFactory","JSON","namespace","isTransformFunctionFactory","existingTransform","existing","resolver","classes","instance","factoryAllowedInExpressions","isSupportedType","unsafe","isClass","isTransformFunction","docs","json","chain","functions","flattenImports","flatValues","flatName","RangeError","isDimensionError","isIndexError","isArgumentsError","DEFAULT_CONFIG","matrix","number","predictable","randomSeed","MATRIX_OPTIONS","NUMBER_OPTIONS","configFactory","_config","validateOption","changes","warn","keywords","Set","getSafeProperty","isPlainObject","isSafeProperty","isSafeMethod","safeNativeProperties","method","safeNativeMethods","toLocaleString","ObjectWrappingMap","wrappedObject","has","createEmptyMap","Map","isMap","_len","objects","_key","_key2","NodeDependencies","createNode","Node","evaluate","compile","comment","expr","_compile","mapOrObject","createMap","symbol","_validateScope","argNames","_ifNode","node","traverse","_traverse","path","parent","_transform","replacement","nodes","cloneDeep","other","customString","_getCustomString","_toString","toHTML","toTex","_toTex","handler","getIdentifier","getContent","MatrixDependencies","createMatrixClass","Matrix","storage","datatype","subset","skipZeros","iterator","toArray","createDenseMatrixClass","DenseMatrix","_data","_size","_datatype","preprocess","_get","isScalar","_getSubmatrix","range","dimension","_set","submatrix","sSize","iSize","_fit","_setSubmatrix","dataIndex","subIndex","newSize","changed","createDenseMatrix","getDataType","indexI","sizeArray","me","recurse","rows","row","columns","_this","col","mathjs","diagonal","kSuper","kSub","ms","fromJSON","swapRows","_swapRows","vi","DenseMatrixDependencies","BigNumberDependencies","createBigNumberClass","BigNumber","ComplexDependencies","createComplexClass","phi","strRe","strIm","hasBase","FractionDependencies","createFractionClass","_createTyped2","throwNoBignumber","throwNoComplex","throwNoFraction","typedDependencies","createTyped","f","throwNoMatrix","createEqualScalar","complexEquals","equalBase","equalScalarDependencies","_ref2","createSparseMatrixClass","SparseMatrix","_values","_index","_ptr","_createFromArray","_createFromMatrix","ptr","equalScalar","zero","_getsubset","kk","mvalues","mindex","mptr","pv","_setsubset","firstDimensionRange","secondDimensionRange","firstDataIndex","firstSubIndex","secondDataIndex","secondSubIndex","_getValueIndex","top","bottom","_insert","ins","k0","k1","_toArray","createSparseMatrix","density","_remove","colIndex","rowIndex","_i","r1","c1","_i2","h","_i3","_j","minRow","maxRow","minColumn","maxColumn","invoke","_k","_i5","_map","_k2","_i7","_forEachRow","kx","ky","vx","vy","SparseMatrixDependencies","createMatrix","_create","string","matrixDependencies","_getSubstring","strLen","substr","_setSubstring","chars","_getObjectProperty","_setObjectProperty","updated","subsetDependencies","createSubset","errorTransform","accessFactory","isObjectProperty","getObjectProperty","AccessorNodeDependencies","createAccessorNode","access","AccessorNode","bind","needParenthesis","evalObject","evalIndex","context","ArrayNodeDependencies","createArrayNode","ArrayNode","items","evalItems","evalItem","itemsToTex","nested","mixedItems","itemsFormRow","itemSep","itemsTex","AssignmentNode","FunctionAssignmentNode","ConditionalNode","latexLeftParens","latexRightParens","latexParens","associativity","associativeWith","RelationalNode","RangeNode","getPrecedence","_node","parenthesis","identifier","getAssociativity","isAssociativeWith","nodeA","nodeB","identifierA","identifierB","AssignmentNodeDependencies","createAssignmentNode","assignFactory","precedence","exprPrecedence","evalValue","childObject","evalParentObject","parentProp","evalParentIndex","parentIndex","BlockNodeDependencies","ResultSetDependencies","createResultSet","ResultSet","createBlockNode","BlockNode","blocks","block","visible","evalBlocks","results","ConditionalNodeDependencies","createConditionalNode","condition","trueExpr","falseExpr","evalCondition","evalTrueExpr","evalFalseExpr","testCondition","conditionPrecedence","truePrecedence","falsePrecedence","latexSymbols","Alpha","alpha","Beta","beta","Gamma","gamma","Delta","delta","Epsilon","varepsilon","Zeta","zeta","Eta","eta","Theta","theta","vartheta","Iota","iota","Kappa","kappa","varkappa","Lambda","lambda","Mu","mu","Nu","nu","Xi","Omicron","omicron","Pi","varpi","Rho","rho","varrho","Sigma","sigma","varsigma","Tau","tau","Upsilon","upsilon","Phi","varphi","Chi","chi","Psi","psi","Omega","omega","true","false","Inf","infinity","oo","lim","latexOperators","transpose","ctranspose","factorial","dotPow","unaryPlus","unaryMinus","bitNot","not","multiply","dotMultiply","dotDivide","leftShift","rightArithShift","rightLogShift","equal","unequal","smaller","larger","smallerEq","largerEq","bitAnd","bitXor","bitOr","and","xor","or","latexFunctions","cube","fix","norm","nthRoot","nthRoots","square","bellNumbers","catalan","stirlingS2","conj","cross","det","expm","inv","sqrtm","trace","combinations","combinationsWithRep","erf","variance","acot","acoth","acsc","acsch","asec","asech","cot","coth","csc","csch","sec","sech","numeric","bignumber","complex","sparse","unit","latexUnits","deg","escapeLatex","toSymbol","ConstantNodeDependencies","createConstantNode","ConstantNode","toLatex","FunctionAssignmentNodeDependencies","createFunctionAssignmentNode","childArgNames","evalExpr","childArgs","deepMap","n2","absNumber","addNumber","multiplyNumber","unaryMinusNumber","ceilNumber","modNumber","powNumber","roundNumber","absDependencies","createAbs","Unit","addScalarDependencies","createAddScalar","fixPrefix","bignumberDependencies","createBignumber","wordSizeSuffixMatch","twoPowSize","twoPowSizeSubOne","null","fractionDependencies","createFraction","numberDependencies","createNumber","input","nonDecimalWithRadixMatch","nonDecimalNumberParts","radix","integerPart","fractionalPart","parts","makeNumberFromNonDecimalParts","valuelessUnit","noBignumber","noFraction","createNumeric","_number","validInputTypes","validOutputTypes","outputType","inputType","numericDependencies","divideScalarDependencies","createDivideScalar","_normalize","createAlgorithm03","denseMatrix","sparseMatrix","inverse","adata","asize","adt","bvalues","bindex","bptr","bsize","bdt","dt","cf","cdata","mark","createAlgorithm07","xa","xb","wa","wb","_scatter","va","vb","createAlgorithm12","avalues","aindex","aptr","createAlgorithm13","bdata","csize","_iterate","level","av","bv","cv","createAlgorithm14","createEqual","algorithm03","algorithm07","algorithm12","algorithm13","algorithm14","equalDependencies","createZeros","_zeros","hasBigNumbers","zerosDependencies","_defineProperty","writable","createAlgorithm11","cvalues","cindex","cptr","ownKeys","enumerableOnly","getOwnPropertySymbols","symbols","sym","getOwnPropertyDescriptor","_objectSpread","getOwnPropertyDescriptors","defineProperties","NO_INT","createRound","algorithm11","roundNumberSignatures","_n","roundDependencies","createCeil","ceilDependencies","createFloor","fixDependencies","floorDependencies","createFix","_Complex","formatDependencies","createFormat","any","isNumericDependencies","createIsNumeric","multiplyScalarDependencies","createMultiplyScalar","createIdentity","_identity","cols","_identityVector","Big","minimum","identityDependencies","conjDependencies","createConj","conjugate","sizeDependencies","createSize","noMatrix","dotDependencies","createDot","_validateDim","aIsColumn","bIsColumn","addScalar","multiplyScalar","_c","_c2","_c3","xindex","xvalues","yindex","yvalues","I","J","xLen","yLen","xSize","ySize","createMultiply","_validateMatrixDimensions","size1","size2","_multiplyVectorMatrix","alength","bcolumns","af","mf","_multiplyVectorDenseMatrix","_multiplyMatrixVector","arows","acolumns","brows","ib","vbi","ka0","ka1","ka","ia","ic","_multiplyMatrixMatrix","jb","kb0","kb1","cij","kb","vbij","p0","xsize","ysize","_multiplyVectorVector","rest","multiplyDependencies","createPow","_pow","_powArray","_powMatrix","yFrac","yNum","ex","identity","powDependencies","unaryMinusDependencies","createUnaryMinus","createAlgorithm01","createAlgorithm05","wai","wbi","vc","createAlgorithm10","checkEqualDimensions","subtractDependencies","createSubtract","algorithm01","algorithm05","algorithm10","lruQueue","limit","queue","del","oldIndex","hit","nuIndex","delete","clear","memoize","POSITIVE_INFINITY","hasher","cache","lru","hash","newVal","createBigNumberPi","createUnitClass","_BigNumber","_Fraction","isNumeric","units","dimensions","UNIT_NONE","PREFIXES","NONE","power","BASE_DIMENSIONS","skipAutomaticSimplification","skipWhitespace","isDigit","revert","parseNumber","isDigitDot","tentativeNumber","tentativeIndex","parseUnit","unitName","isValidAlpha","firstC","parseCharacter","toFind","powerMultiplierCurrent","expectingUnit","powerMultiplierStack","powerMultiplierStackProduct","uStr","oldC","_findUnit","baseDim","UNIT_SYSTEMS","auto","allowNoUnits","_isDerived","unitValue","unitOffset","unitPower","unitPrefixValue","_getNumberConverter","_denormalize","prefixValue","divideScalar","UNITS","prefixes","_unit","prefixLen","prefixName","_prefix","getNumericIfUnitless","BASE_UNITS","isValuelessUnit","inverted","valThis","valOther","W","toNumeric","formatUnits","simplify","matchingBase","matchingUnit","proposedUnitList","currentUnitSystem","missingBaseDim","toSI","si","strNum","strDen","nNum","nDen","_i4","simp","isImaginary","VAR","VA","_bestPrefix","unitStr","absValue","absUnitValue","bestPrefix","bestDiff","scientific","splitUnit","xNumeric","xRounded","testSum","SHORT","da","G","T","Z","Y","LONG","deca","hecto","kilo","mega","giga","tera","peta","exa","zetta","yotta","deci","centi","milli","micro","nano","pico","femto","atto","zepto","yocto","SQUARED","CUBIC","BINARY_SHORT_SI","BINARY_SHORT_IEC","Ki","Mi","Gi","Ti","Ei","Zi","Yi","BINARY_LONG_SI","BINARY_LONG_IEC","kibi","mebi","gibi","tebi","pebi","exi","zebi","yobi","BTU","MM","SHORTLONG","BINARY_SHORT","BINARY_LONG","MASS","LENGTH","TIME","CURRENT","TEMPERATURE","LUMINOUS_INTENSITY","AMOUNT_OF_SUBSTANCE","FORCE","SURFACE","VOLUME","ENERGY","POWER","PRESSURE","ELECTRIC_CHARGE","ELECTRIC_CAPACITANCE","ELECTRIC_POTENTIAL","ELECTRIC_RESISTANCE","ELECTRIC_INDUCTANCE","ELECTRIC_CONDUCTANCE","MAGNETIC_FLUX","MAGNETIC_FLUX_DENSITY","FREQUENCY","ANGLE","BIT","meter","inch","foot","yard","mile","rod","angstrom","in","ft","mi","li","ch","mil","m2","sqin","sqft","sqyd","sqmi","sqrd","sqch","sqmil","acre","hectare","m3","L","l","litre","cuin","cuft","cuyd","teaspoon","tablespoon","drop","gtt","minim","fluiddram","fluidounce","gill","cc","cup","pint","quart","gallon","beerbarrel","oilbarrel","hogshead","fldr","floz","gi","cp","pt","qt","gal","bbl","obl","g","gram","ton","tonne","grain","dram","ounce","poundmass","hundredweight","stick","stone","gr","dr","oz","lbm","cwt","second","minute","hour","day","week","month","year","decade","century","millennium","hertz","reciprocal","Hz","rad","radian","degree","grad","gradian","cycle","arcsec","arcmin","ampere","K","degC","degF","degR","kelvin","celsius","fahrenheit","rankine","mol","mole","cd","candela","newton","dyn","dyne","lbf","poundforce","kip","kilogramforce","joule","erg","Wh","eV","electronvolt","watt","hp","Pa","atm","bar","torr","mmHg","mmH2O","cmH2O","coulomb","farad","F","volt","V","ohm","henry","H","siemens","S","weber","Wb","tesla","bits","bytes","ALIASES","meters","inches","feet","yards","miles","links","rods","chains","angstroms","litres","liter","liters","teaspoons","tablespoons","minims","fluiddrams","fluidounces","gills","cups","pints","quarts","gallons","beerbarrels","oilbarrels","hogsheads","gtts","grams","tons","tonnes","grains","drams","ounces","poundmasses","hundredweights","sticks","lb","lbs","kips","kgf","acres","hectares","sqfeet","sqyard","sqmile","sqmiles","mmhg","mmh2o","cmh2o","seconds","secs","minutes","mins","hours","hr","hrs","days","weeks","months","years","decades","centuries","millennia","radians","degrees","gradians","cycles","arcsecond","arcseconds","arcminute","arcminutes","BTUs","watts","joules","amperes","coulombs","volts","ohms","farads","webers","teslas","electronvolts","moles","bit","byte","calculateAngleValues","cgs","us","setUnitSystem","getUnitSystem","typeConverters","_name2","_unit2","alias","_key3","createUnit","_key4","deleteUnit","aliases","lastUnit","_key5","createUnitSingle","assertUnitNameIsValid","baseName","defUnit","toUpperCase","newUnit","anyMatch","_newBaseUnit","newBaseUnit","_i6","_i8","aliasName","_alias","_key6","UnitDependencies","createSymbolNode","SymbolNode","onUndefinedSymbol","SymbolNodeDependencies","createSubScope","parentScope","createFunctionNode","FunctionNode","evalArgs","_rawArgs","validateSafeMethod","rawArgs","evalArg","evalFn","_rawArgs2","isRaw","resolveFn","onUndefinedFunction","evalArg0","evalArg1","nodeToString","expandTemplate","template","latex","regex","inputPos","ReferenceError","nodeToTex","customTex","latexConverter","customToTex","FunctionNodeDependencies","IndexNodeDependencies","RangeDependencies","createRangeClass","Range","step","hasStart","hasEnd","hasStep","nums","createIndexNode","IndexNode","dotNotation","createRange","evalDimensions","needsEnd","evalStart","evalEnd","evalStep","_evalStart","_evalEnd","_evalStep","_childArgNames","evalRange","_evalRange","evalDimension","createObjectNode","ObjectNode","evalEntries","stringifiedKey","parsedKey","ObjectNodeDependencies","createOperatorNode","OperatorNode","op","implicit","isPercentage","calculateNecessaryParentheses","operandPrecedence","operandIdentifier","rootIdentifier","lhsParens","rhsParens","lhsPrecedence","assocWithLhs","_rootIdentifier","lhsIdentifier","rhsIdentifier","rhsPrecedence","assocWithRhs","argPrecedence","assocWithArg","argAssociativity","_evalArg","isUnary","parens","assoc","operand","opIsNamed","lhs","rhs","stringifiedArgs","lhsTex","rhsTex","texifiedArgs","OperatorNodeDependencies","ParenthesisNodeDependencies","createParenthesisNode","ParenthesisNode","content","RangeNodeDependencies","createRangeNode","startPrecedence","stepPrecedence","endPrecedence","RelationalNodeDependencies","createRelationalNode","conditionals","isRelationalNode","compiled","evalLhs","evalRhs","condFn","paramStrings","paramPrecedence","operatorMap","createParse","parseStart","expressions","parseMultiple","extraNodes","TOKENTYPE","DELIMITERS","NAMED_DELIMITERS","CONSTANTS","NUMERIC_CONSTANTS","currentString","state","currentCharacter","prevCharacter","nextCharacter","getToken","tokenType","token","isWhitespace","nestingLevel","c2","c3","isHexDigit","isDecimalMark","createSyntaxError","isAlpha","getTokenSkipNewline","openParams","closeParams","conditionalLevel","parseAssignment","parseBlock","valid","parseLogicalXor","parseLogicalOr","parseConditional","parseLogicalAnd","parseBitwiseOr","parseBitwiseXor","parseBitwiseAnd","parseRelational","parseShift","operators","cond","parseConversion","parseRange","parseAddSubtract","parseMultiplyDivide","rightNode","parseImplicitMultiplication","parseRule2","parsePercentage","tokenStates","parseUnary","CustomNode","parseAccessors","parseDoubleQuotesStringToken","parseSingleQuotesStringToken","parseRow","numberStr","parseEnd","parseParentheses","parseObject","parseMatrix","parseSingleQuotesString","parseDoubleQuotesString","parseSymbol","parseCustomNodes","parseLeftHandOperators","parsePow","char","cPrev","cNext","isValidLatinOrGreek","isValidMathSymbol","high","low","evaluateDependencies","parseDependencies","createEvaluate","createAlgorithm04","addDependencies","createAdd","algorithm04","largerDependencies","createLarger","FibonacciHeapDependencies","smallerDependencies","createSmaller","createFibonacciHeapClass","oneOverLogPhi","FibonacciHeap","_minimum","_cut","left","right","_cascadingCut","isFibonacciHeap","insert","isEmpty","extractMinimum","numberOfChildren","tempRight","arraySize","numRoots","_linkNodes","_findMinimumNode","remove","_decreaseKey","createSpaClass","Spa","_heap","isSpa","accumulate","heap","swap","nodei","nodej","SpaDependencies","createLup","_denseLUP","_sparseLUP","U","ldata","lsize","udata","usize","pabsv","vjj","absv","vij","lvalues","lindex","lptr","uvalues","uindex","uptr","pvCo","pvOc","spa","vkj","vik","divideDependencies","invDependencies","detDependencies","lupDependencies","createDet","decomp","lup","evenCycles","visited","_det","createInv","_inv","mat","ABig","rBig","Ac","Bc","Ar","Br","createDivide","createAlgorithm02","modDependencies","createMod","algorithm02","factories","configInternal","emitter","isString","isCollection","internalImport","import","recreateOnConfigChange","IndexError","val","hunderd","getCalculatedValue","roundPrecision","cleanupInput","getEditorResponseData","response","parsedData","success","ImageSourceTypeEnum","FrameTypeEnum","TextDirection","FlowDirection","VerticalAlign","BlendMode","FitMode","UpdateZIndexMethod","ShapeController","editorAPI","setShapeProperties","shapeFrameId","setEnableFill","enableFill","setFillColor","fillColor","setEnableStroke","enableStroke","setStrokeColor","strokeColor","setStrokeWeight","strokeWeight","setFlagAllCornersSame","allCornersSame","setShapeCorners","radius","setRadiusAll","cornerRadius","radiusAll","setRadiusTopLeft","topLeft","setRadiusBottomLeft","bottomLeft","setRadiusTopRight","topRight","setRadiusBottomRight","bottomRight","FrameController","getFrames","getSelectedFrames","getFramesByPageId","pageId","getFrameByName","getFrameById","getFramePropertiesOnSelectedLayout","getFramePropertiesByFrameId","frameId","layoutId","getFramesProperties","resetFrameSize","selectFrame","selectFrames","selectMultipleFrames","frameIds","reorderFrames","orderIndex","frameIdsToMove","setFrameZIndex","setFrameHeight","calc","setFrameRotation","setFrameWidth","setFrameX","setFrameY","setFrameName","frameName","renameFrame","resetFrame","resetFrameX","resetFrameY","resetFrameRotation","resetFrameWidth","resetFrameHeight","resetImageFrameFitMode","setFrameVisibility","removeFrame","addFrame","frameType","width","height","addShapeFrame","shapeType","updateImageSource","imageFrameId","srcJson","setImageSource","removeImageSource","setImageFromConnector","connectorId","resourceId","assetId","sourceType","connector","setImageFromUrl","url","setImageFrameFitMode","fitMode","setFrameConstrainProportions","constrainProportions","setVerticalAlignment","verticalAlign","setMinCopyfitting","setMaxCopyfitting","setEnableCopyfitting","resetMinCopyfitting","resetMaxCopyfitting","resetEnableCopyfitting","setShapeFrameEnableFill","shapeController","setShapeFrameFillColor","setShapeFrameEnableStroke","setShapeFrameStrokeColor","setShapeFrameStrokeWeight","setFrameBlendMode","blendMode","enterCropMode","applyCropMode","resetCropMode","cancelCropMode","AnimationController","children","getAnimationsOnSelectedLayout","getAnimationByFrameId","getAnimationsByLayoutId","setFrameAnimation","animation","playAnimation","pauseAnimation","setScrubberPosition","timeInMS","setAnimationDuration","resetFrameAnimation","resetAnimation","LayoutController","getLayouts","getLayoutById","getLayoutByName","getSelectedLayout","removeLayout","addLayout","parentId","setLayoutName","layoutName","renameLayout","selectLayout","duplicateLayout","resetLayout","setLayoutHeight","setLayoutWidth","resetLayoutHeight","resetLayoutWidth","getSelectedLayoutSnapshot","getPageSnapshot","FrameProperyNames","LayoutProperyNames","renderURLs","ToolType","DownloadFormats","PageController","getPages","getPageById","setPageWidth","setPageHeight","UtilsController","calculateFromString","status","SubscriberController","actions","callBack","onAnimationChanged","onAnimationPlaybackChanged","animationPlaybackState","frame","variablesJson","tool","undoState","onUndoStackStateChanged","frames","styles","colors","paragraphStyles","characterStyles","fonts","layouts","zoomEvent","pageSize","DocumentController","getCurrentDocumentState","loadDocument","doc","getDownloadLink","PREPARE_DOWNLOAD_URL","DOWNLOAD_URL","documentResponse","FETCH_URL","BASE_URL","getFetchURL","fetch","headers","body","catch","resultUrl","downloadUrl","isFileDownloadable","startPollingOnEndpoint","endpoint","DebugController","getLogs","toggleDebugPanel","enableDebug","disableDebug","VariableController","getVariables","getVariableById","variableId","getVariableByName","variableName","addVariable","variableType","removeVariables","variableIds","setVariableName","setVariableLabel","label","setVariableType","setVariableValue","duplicateVariable","groupVariables","groupName","ungroupVariable","groupId","moveVariable","moveVariables","movedVariables","moves","order","setVariableIsHidden","isHidden","setVariableIsRequired","isRequired","setVariableIsReadonly","isReadonly","updateVariableSource","setVariableSource","removeVariableSource","ToolController","setTool","getSelectedTool","setSelectTool","SELECT","setHandTool","HAND","setZoomTool","ZOOM","setTextFrameTool","TEXT_FRAME","setImageFrameTool","IMAGE_FRAME","setShapeRectTool","SHAPE_RECT","setShapeEllipseTool","SHAPE_ELLIPSE","setShapePolygonTool","SHAPE_POLYGON","UndoManagerController","undo","redo","TextStyleController","setTextStyleProperties","style","selectedTextStyleDeltaUpdate","clearTextStyleProperties","selectedTextStyleClean","getSelectedTextStyle","ColorStyleController","getColors","getColorById","colorId","createColor","duplicateColor","moveColors","colorIds","renameColor","updateColor","color","removeColor","ParagraphStyleController","getParagraphStyles","getParagraphStyleById","paragraphStyleId","createParagraphStyle","duplicateParagraphStyle","updateParagraphStyle","paragraphStyle","renameParagraphStyle","removeParagraphStyle","moveParagraphStyles","paragraphStyleIds","DeprecatedMediaType","MediaType","SortBy","SortOrder","ConnectorRegistrationSource","ConnectorMappingTarget","ConnectorMappingSource","ConnectorStateType","ConnectorEventType","ConfigurationController","getValue","getConfigValue","setValue","setConfigValue","ConnectorMapping","mapTo","contextProperty","mapFrom","sourceValue","WellKnownConfigurationKeys","MediaConnectorController","query","queryOptions","mediaConnectorQuery","detail","mediaId","mediaConnectorDetail","download","downloadType","mediaConnectorDownload","upload","blob","mediaConnectorUpload","mediaConnectorRemove","newName","mediaConnectorCopy","getQueryOptions","mediaConnectorGetQueryOptions","getDownloadOptions","mediaConnectorGetDownloadOptions","getCapabilities","mediaConnectorGetCapabilities","parseDeprecatedMediaType","deprecatedType","file","collection","FontController","getFonts","getFontById","fontId","getDefaultFont","removeFont","addFont","font","isFontUsed","fontKey","ConnectorController","registerConnector","registration","configure","configurationCallback","waitForConnectorReady","ConnectorConfigurator","updateConnectorConfiguration","getState","getConnectorState","timeoutMilliseconds","retries","running","ready","setOptions","setConnectorOptions","setMappings","mappings","setConnectorMappings","setChiliToken","connectorAuthenticationSetChiliToken","setHttpHeader","headerName","headerValue","connectorAuthenticationSetHttpHeader","FontConnectorController","fontConnectorQuery","fontConnectorDetail","FontId","fontConnectorDownload","fontConnectorUpload","fontConnectorRemove","fontConnectorCopy","fontConnectorGetQueryOptions","fontConnectorGetDownloadOptions","fontConnectorGetCapabilities","parseDeprecatedFontType","ExperimentController","insertImageVariableToFrame","variable","insertTextVariable","enterTextEditMode","exitTextEditMode","CharacterStyleController","getCharacterStyles","getCharacterStyleById","characterStyleId","createCharacterStyle","updateCharacterStyle","characterStyle","removeCharacterStyle","duplicateCharacterStyle","renameCharacterStyle","ImageFrameSourceType","FramePropertiesType","DocumentType","CanvasController","zoomToPage","getZoomPercentage","setZoomPercentage","scaleFactor","SlideDirections","ShakeDirections","EaseTypes","TweenTypes","BasicAnimationsEmphasisStyles","LayoutType","ImageVariableSourceType","VariableType","FontWeights","Alignment","TextPosition","Case","Scripting","HorizontalAlign","SelectedTextStyleSections","SelectedTextStyles","ColorType","ColorUsageType","MediaDownloadType","FontDownloadType","ActionEditorEvent","ActionController","createAction","removeAction","actionId","updateActionScript","script","updateActionTriggers","triggers","connection","SDK","loadEditor","subscriber","action","layout","configuration","utils","page","undoManager","textSelection","colorStyle","mediaConnector","fontConnector","experiment","canvas","shape","GraFxStudioSdkVersion","GraFxStudioDocumentType","documentType","newConnection"],"sourceRoot":""}