{"version":3,"mappings":";orEAQA,MAAAA,GAAeC,GAAOC,EAAU,EAAE,OAAO,CACvC,KAAM,eACN,MAAO,CACL,YAAa,CAAC,OAAQ,MAAM,EAC5B,aAAc,MACf,EACD,SAAU,CACR,qBAAsB,CACpB,OAAO,OAAO,KAAK,WAAW,CAC/B,EAED,aAAc,CACZ,OAAO,KAAK,oBAAsB,CAChC,cAAe,EAAI,KAAK,oBAAsB,IAAM,GAC5D,EAAU,MACL,EAED,eAAgB,CACd,OAAK,KAAK,YACH,KAAK,eAAe,MAAO,CAChC,MAAO,KAAK,YACZ,YAAa,qBACrB,CAAO,EAJ6B,CAAE,CAKtC,CAEG,EACD,QAAS,CACP,YAAa,CACX,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,wBACb,MAAO,KAAK,YACpB,EAASC,GAAQ,IAAI,CAAC,CACtB,CAEG,EAED,OAAOC,EAAG,CACR,OAAOA,EAAE,MAAO,CACd,YAAa,eACb,MAAO,KAAK,iBACZ,GAAI,KAAK,UACV,EAAE,CAAC,KAAK,cAAe,KAAK,WAAY,EAAC,CAC9C,CAEA,CAAC,ECvCKC,GAAe,OAAO,QAAW,aAAe,yBAA0B,OAGjEC,GAAAL,GAAOD,GAAaO,EAAS,EAAE,OAAO,CACnD,KAAM,QACN,WAAY,CACVC,YACD,EACD,MAAO,CACL,IAAK,OACL,QAAS,QACT,MAAO,QACP,SAAU,OACV,QAAS,OACT,QAAS,CACP,KAAM,OAGN,QAAS,KAAO,CACd,KAAM,OACN,WAAY,OACZ,UAAW,MACZ,EACF,EACD,SAAU,CACR,KAAM,OACN,QAAS,eACV,EACD,MAAO,OACP,IAAK,CACH,KAAM,CAAC,OAAQ,MAAM,EACrB,QAAS,EACV,EACD,OAAQ,OACR,WAAY,CACV,KAAM,CAAC,QAAS,MAAM,EACtB,QAAS,iBACf,CACG,EAED,MAAO,CACL,MAAO,CACL,WAAY,GACZ,MAAO,KACP,UAAW,GACX,sBAAuB,OACvB,aAAc,OACd,SAAU,EACX,CACF,EAED,SAAU,CACR,qBAAsB,CACpB,OAAO,OAAO,KAAK,cAAc,QAAU,KAAK,qBAAqB,CACtE,EAED,eAAgB,CACd,OAAO,KAAK,KAAO,OAAO,KAAK,KAAQ,SAAW,CAChD,IAAK,KAAK,IAAI,IACd,OAAQ,KAAK,QAAU,KAAK,IAAI,OAChC,QAAS,KAAK,SAAW,KAAK,IAAI,QAClC,OAAQ,OAAO,KAAK,aAAe,KAAK,IAAI,MAAM,CAC1D,EAAU,CACF,IAAK,KAAK,IACV,OAAQ,KAAK,OACb,QAAS,KAAK,QACd,OAAQ,OAAO,KAAK,aAAe,CAAC,CACrC,CACF,EAED,eAAgB,CACd,GAAI,EAAE,KAAK,cAAc,KAAO,KAAK,cAAc,SAAW,KAAK,UAAW,MAAO,CAAE,EACvF,MAAMC,EAAkB,CAAE,EACpBC,EAAM,KAAK,UAAY,KAAK,cAAc,QAAU,KAAK,WAC3D,KAAK,UAAUD,EAAgB,KAAK,mBAAmB,KAAK,QAAQ,GAAG,EACvEC,GAAKD,EAAgB,KAAK,QAAQC,CAAG,IAAI,EAC7C,MAAMC,EAAQ,KAAK,eAAe,MAAO,CACvC,YAAa,iBACb,MAAO,CACL,0BAA2B,KAAK,UAChC,0BAA2B,KAAK,QAChC,wBAAyB,CAAC,KAAK,OAChC,EACD,MAAO,CACL,gBAAiBF,EAAgB,KAAK,IAAI,EAC1C,mBAAoB,KAAK,QAC1B,EACD,IAAK,CAAC,KAAK,SACnB,CAAO,EAGD,OAAK,KAAK,WACH,KAAK,eAAe,aAAc,CACvC,MAAO,CACL,KAAM,KAAK,WACX,KAAM,QAChB,CACA,EAAS,CAACE,CAAK,CAAC,EANmBA,CAOnC,CAEG,EACD,MAAO,CACL,KAAM,CAEC,KAAK,UAAsD,KAAK,UAAW,EAA3D,KAAK,KAAK,OAAW,OAAW,EAAI,CAC1D,EAED,4BAA6B,QAC9B,EAED,SAAU,CACR,KAAK,KAAM,CACZ,EAED,QAAS,CACP,KAAKC,EAASC,EAAUC,EAAgB,CAItC,GAAI,EAAAT,IAAgB,CAACS,GAAkB,CAAC,KAAK,OAE7C,IAAI,KAAK,cAAc,QAAS,CAC9B,MAAMC,EAAU,IAAI,MACpBA,EAAQ,IAAM,KAAK,cAAc,QACjC,KAAK,YAAYA,EAAS,IAAI,CACtC,CAIU,KAAK,cAAc,KAAK,KAAK,UAAW,EAC7C,EAED,QAAS,CACP,KAAK,OAAQ,EACb,KAAK,UAAY,GACjB,KAAK,MAAM,OAAQ,KAAK,GAAG,EAEvB,KAAK,QAAU,KAAK,cAAc,IAAI,SAAS,MAAM,GAAK,KAAK,cAAc,IAAI,WAAW,oBAAoB,KAC9G,KAAK,MAAM,eAAiB,KAAK,MAAM,cACzC,KAAK,aAAe,KAAK,MAAM,aAC/B,KAAK,sBAAwB,KAAK,MAAM,aAAe,KAAK,MAAM,eAElE,KAAK,sBAAwB,EAGlC,EAED,SAAU,CACR,KAAK,SAAW,GAChB,KAAK,MAAM,QAAS,KAAK,GAAG,CAC7B,EAED,QAAS,CAEH,KAAK,QAAO,KAAK,WAAa,KAAK,MAAM,YAAc,KAAK,MAAM,IACvE,EAED,WAAY,CACV,MAAMJ,EAAQ,IAAI,MAClB,KAAK,MAAQA,EAEbA,EAAM,OAAS,IAAM,CAEfA,EAAM,OACRA,EAAM,OAAM,EAAG,MAAMK,GAAO,CAC1BC,GAAY;;AAAA,OAAgE,KAAK,cAAc,GAAG,IAAMD,EAAI,QAAU;AAAA,kBAAqBA,EAAI,OAAO,GAAK,IAAK,IAAI,CAChL,CAAW,EAAE,KAAK,KAAK,MAAM,EAEnB,KAAK,OAAQ,CAEhB,EAEDL,EAAM,QAAU,KAAK,QACrB,KAAK,SAAW,GAChB,KAAK,QAAUA,EAAM,MAAQ,KAAK,OAClC,KAAK,cAAc,SAAWA,EAAM,OAAS,KAAK,cAAc,QAChEA,EAAM,IAAM,KAAK,cAAc,IAC/B,KAAK,MAAM,YAAa,KAAK,cAAc,GAAG,EAC9C,KAAK,aAAe,KAAK,YAAYA,CAAK,EAC1C,KAAK,OAAQ,CACd,EAED,YAAYO,EAAKC,EAAU,IAAK,CAC9B,MAAMC,EAAO,IAAM,CACjB,KAAM,CACJ,cAAAC,EACA,aAAAC,CACV,EAAYJ,EAEAG,GAAiBC,GACnB,KAAK,aAAeA,EACpB,KAAK,sBAAwBA,EAAeD,GACnC,CAACH,EAAI,UAAY,KAAK,WAAa,CAAC,KAAK,UAAYC,GAAW,MACzE,WAAWC,EAAMD,CAAO,CAE3B,EAEDC,EAAM,CACP,EAED,YAAa,CACX,MAAMG,EAAUvB,GAAY,QAAQ,QAAQ,WAAW,KAAK,IAAI,EAEhE,OAAI,KAAK,cACP,KAAK,GAAGuB,EAAQ,KAAM,MAAO,CAC3B,MAAO,CACL,MAAO,GAAG,KAAK,YAAY,IACvC,CACA,CAAS,EAGIA,CACR,EAED,kBAAmB,CACjB,MAAMC,EAAOrB,GAAQ,KAAM,aAAa,EAExC,GAAIqB,EAAM,CACR,MAAMC,EAAc,KAAK,UAAY,CAAC,KAAK,eAAe,MAAO,CAC/D,YAAa,sBACvB,EAAWD,CAAI,CAAC,EAAI,CAAE,EACd,OAAK,KAAK,WACH,KAAK,eAAe,aAAc,CACvC,MAAO,CACL,OAAQ,GACR,KAAM,KAAK,UACvB,CACS,EAAEC,CAAW,EANeA,EAAY,CAAC,CAOlD,CACA,CAEG,EAED,OAAOrB,EAAG,CACR,MAAMsB,EAAO1B,GAAY,QAAQ,OAAO,KAAK,KAAMI,CAAC,EAC9CuB,EAAOC,GAAUF,EAAK,KAAM,CAChC,YAAa,UACb,MAAO,CACL,aAAc,KAAK,IACnB,KAAM,KAAK,IAAM,MAAQ,MAC1B,EACD,MAAO,KAAK,aAGZ,WAAYrB,GAAe,CAAC,CAC1B,KAAM,YACN,UAAW,CACT,KAAM,EACP,EACD,MAAO,CACL,QAAS,KAAK,KACd,QAAS,KAAK,OACxB,CACA,CAAO,EAAI,MACX,CAAK,EACD,OAAAqB,EAAK,SAAW,CAAC,KAAK,cAAe,KAAK,cAAe,KAAK,iBAAgB,EAAI,KAAK,WAAU,CAAE,EAC5FtB,EAAEsB,EAAK,IAAKC,EAAMD,EAAK,QAAQ,CAC1C,CAEA,CAAC,ECrQcG,MAAO,OAAO,CAC3B,KAAM,YACN,MAAO,CACL,SAAU,QACV,OAAQ,QACR,SAAU,QACV,MAAO,QACP,SAAU,QACV,gBAAiB,CACf,QAAS,GACT,KAAM,CAAC,OAAQ,MAAM,CACtB,EACD,KAAM,QACN,SAAU,QACV,UAAW,QACX,MAAO,QACP,IAAK,CACH,KAAM,CAAC,OAAQ,MAAM,EACrB,QAAS,EACV,EACD,IAAK,CACH,KAAM,OACN,QAAS,QACf,CACG,EACD,KAAM,KAAO,CACX,WAAY,EAChB,GACE,SAAU,CACR,gBAAiB,CACf,MAAMC,EAAS,KAAK,sBACpB,GAAI,CAAC,KAAK,WAAY,OAAOA,EAC7B,MAAMC,EAAkB,SAAS,KAAK,eAAe,EACrD,OAAO,KAAK,YAAcD,EAASA,GAAW,MAAMC,CAAe,EAAsB,EAAlBA,EACxE,EAED,uBAAwB,CACtB,OAAI,KAAK,OAAe,SAAS,KAAK,MAAM,EACxC,KAAK,aAAe,KAAK,MAAc,GACvC,KAAK,aAAe,KAAK,MAAc,IACvC,KAAK,YAAoB,IACzB,KAAK,MAAc,GACnB,KAAK,OAAS,KAAK,SAAS,WAAW,UAAkB,GACtD,EACR,EAED,SAAU,CACR,OAAOC,GAAAC,GAAA,GAAKJ,GAAO,QAAQ,SAAS,QAAQ,KAAK,IAAI,GAA9C,CACL,YAAa,GACb,sBAAuB,KAAK,SAC5B,oBAAqB,KAAK,OAC1B,sBAAuB,KAAK,SAC5B,uBAAwB,KAAK,YAC7B,mBAAoB,KAAK,MACzB,sBAAuB,KAAK,WAC5B,kBAAmB,KAAK,KACxB,sBAAuB,KAAK,SAC5B,uBAAwB,KAAK,WAC9B,EACF,EAED,aAAc,CACZ,OAAO,KAAK,QACb,EAED,aAAc,CACZ,OAAO,KAAK,SACb,EAED,QAAS,CACP,OAAOG,GAAAC,GAAA,GAAK,KAAK,kBAAV,CACL,OAAQC,GAAc,KAAK,cAAc,CAC1C,EACP,CAEG,EAED,SAAU,CACc,CAAC,CAAC,MAAO,iBAAiB,EAAG,CAAC,gBAAiB,4BAA4B,EAAG,CAAC,eAAgB,0BAA0B,EAAG,CAAC,gBAAiB,2BAA2B,EAAG,CAAC,kBAAmB,6BAA6B,EAAG,CAAC,oBAAqB,+BAA+B,EAAG,CAAC,gBAAiB,2BAA2B,EAAG,CAAC,mBAAoB,8BAA8B,EAAG,CAAC,OAAQ,kBAAkB,CAAC,EAGla,QAAQ,CAAC,CAACC,EAAUC,CAAW,IAAM,CAC7C,KAAK,OAAO,eAAeD,CAAQ,GAAGE,GAASF,EAAUC,EAAa,IAAI,CACpF,CAAK,CACF,EAED,QAAS,CACP,eAAgB,CACd,MAAME,EAAQ,CACZ,OAAQJ,GAAc,KAAK,cAAc,EACzC,IAAK,KAAK,GACX,EACKvB,EAAQ,KAAK,aAAa,IAAM,KAAK,aAAa,IAAI,CAC1D,MAAA2B,CACR,CAAO,EAAI,KAAK,eAAeC,GAAM,CAC7B,MAAAD,CACR,CAAO,EACD,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,kBACrB,EAAS,CAAC3B,CAAK,CAAC,CACX,EAED,YAAa,CACX,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,qBACb,MAAO,CACL,OAAQuB,GAAc,KAAK,qBAAqB,CAC1D,CACA,EAAS/B,GAAQ,IAAI,CAAC,CACjB,EAED,cAAe,CACb,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,uBACb,MAAO,CACL,OAAQ+B,GAAc,KAAK,eAAe,CACpD,CACA,EAAS/B,GAAQ,KAAM,WAAW,CAAC,CACnC,CAEG,EAED,OAAOC,EAAG,CACR,KAAK,WAAa,KAAK,UAAY,CAAC,CAAC,KAAK,aAAa,UACvD,MAAMoC,EAAW,CAAC,KAAK,YAAY,EAC7Bb,EAAO,KAAK,mBAAmB,KAAK,MAAO,CAC/C,MAAO,KAAK,QACZ,MAAO,KAAK,OACZ,GAAI,KAAK,UACf,CAAK,EACD,OAAI,KAAK,YAAYa,EAAS,KAAK,KAAK,cAAc,GAClD,KAAK,KAAO,KAAK,aAAa,MAAKA,EAAS,QAAQ,KAAK,eAAe,EACrEpC,EAAE,KAAK,IAAKuB,EAAMa,CAAQ,CACrC,CAEA,CAAC,EClJD,SAASC,GAASC,EAAIC,EAASC,EAAO,CACpC,KAAM,CACJ,KAAAC,EAAO,EACX,EAAMF,EAAQ,WAAa,CAAE,EACrBG,EAAQH,EAAQ,MAChBI,EAAU,OAAOD,GAAU,UAAYA,EAAM,SAAW,CAC5D,QAAS,EACV,EACKE,EAAU,OAAOF,GAAU,YAAc,gBAAiBA,EAAQA,EAAQA,EAAM,QAChFG,EAASJ,EAAOH,EAAKC,EAAQ,IAAM,SAAS,cAAcA,EAAQ,GAAG,EAAI,OAC1EM,IACLA,EAAO,iBAAiB,SAAUD,EAASD,CAAO,EAClDL,EAAG,UAAY,OAAOA,EAAG,SAAS,EAClCA,EAAG,UAAUE,EAAM,QAAQ,IAAI,EAAI,CACjC,QAAAI,EACA,QAAAD,EAEA,OAAQF,EAAO,OAAYI,CAC5B,EACH,CAEA,SAASC,GAAOR,EAAIC,EAASC,EAAO,CAClC,IAAIO,EAEJ,GAAI,EAAG,GAAAA,EAAKT,EAAG,aAAe,MAAQS,IAAO,SAAkBA,EAAGP,EAAM,QAAQ,IAAI,GAAI,OACxF,KAAM,CACJ,QAAAI,EACA,QAAAD,EACA,OAAAE,EAASP,CACV,EAAGA,EAAG,UAAUE,EAAM,QAAQ,IAAI,EACnCK,EAAO,oBAAoB,SAAUD,EAASD,CAAO,EACrD,OAAOL,EAAG,UAAUE,EAAM,QAAQ,IAAI,CACxC,CAEO,MAAMQ,GAAS,CACtB,SAAEX,GACAS,SACF,EClCe,SAASG,GAAgBP,EAAOQ,EAAS,GAAI,CAE1D,OAAOrD,GAAOsD,GAAoB,CAAC,WAAY,OAAO,CAAC,CAAC,EAAE,OAAO,CAC/D,KAAM,kBACN,MAAO,CACL,IAAK,OACN,EACD,SAAU,CACR,qBAAsB,CACpB,OAAOT,CACf,CAEK,EACD,MAAO,CAGL,IAAIU,EAAGC,EAAM,CACXA,EAAO,KAAK,kBAAkB,EAAI,EAAI,KAAK,WAAY,CACxD,EAED,oBAAoBC,EAAQC,EAAQ,CAClC,KAAK,SAAS,YAAY,WAAW,KAAK,KAAMA,CAAM,CAC9D,CAEK,EAED,WAAY,CACV,KAAK,WAAY,CAClB,EAED,SAAU,CACR,QAASC,EAAI,EAAGC,EAASP,EAAO,OAAQM,EAAIC,EAAQD,IAClD,KAAK,OAAON,EAAOM,CAAC,EAAG,KAAK,UAAU,EAGxC,KAAK,WAAY,CAClB,EAED,SAAU,CACR,KAAK,WAAY,CAClB,EAED,aAAc,CACZ,KAAK,kBAAmB,CACzB,EAED,WAAY,CACV,KAAK,kBAAmB,CACzB,EAED,QAAS,CACP,YAAa,CACN,KAAK,KACV,KAAK,SAAS,YAAY,SAAS,KAAK,KAAM,KAAK,oBAAqB,KAAK,mBAAmB,CACjG,EAED,kBAAkBE,EAAQ,GAAO,CAC3B,CAACA,GAAS,CAAC,KAAK,KACpB,KAAK,SAAS,YAAY,WAAW,KAAK,KAAM,KAAK,mBAAmB,CACzE,EAED,kBAAmB,IAAM,CAC/B,CACA,CAAG,CACH,CCjEA,MAAMC,GAAgBC,GAAW,CAC/B,KAAM,CACJ,YAAAC,EACA,UAAAC,EACA,YAAAC,EACA,UAAAC,CACJ,EAAMJ,EACEK,EAAW,GACXC,EAAc,GACpBN,EAAQ,QAAUE,EAAYD,EAC9BD,EAAQ,QAAUI,EAAYD,EAE1B,KAAK,IAAIH,EAAQ,OAAO,EAAIK,EAAW,KAAK,IAAIL,EAAQ,OAAO,IACjEA,EAAQ,MAAQE,EAAYD,EAAcK,GAAeN,EAAQ,KAAKA,CAAO,EAC7EA,EAAQ,OAASE,EAAYD,EAAcK,GAAeN,EAAQ,MAAMA,CAAO,GAG7E,KAAK,IAAIA,EAAQ,OAAO,EAAIK,EAAW,KAAK,IAAIL,EAAQ,OAAO,IACjEA,EAAQ,IAAMI,EAAYD,EAAcG,GAAeN,EAAQ,GAAGA,CAAO,EACzEA,EAAQ,MAAQI,EAAYD,EAAcG,GAAeN,EAAQ,KAAKA,CAAO,EAEjF,EAEA,SAASO,GAAWC,EAAOR,EAAS,CAClC,MAAMS,EAAQD,EAAM,eAAe,CAAC,EACpCR,EAAQ,YAAcS,EAAM,QAC5BT,EAAQ,YAAcS,EAAM,QAC5BT,EAAQ,OAASA,EAAQ,MAAM,OAAO,OAAOQ,EAAOR,CAAO,CAAC,CAC9D,CAEA,SAASU,GAASF,EAAOR,EAAS,CAChC,MAAMS,EAAQD,EAAM,eAAe,CAAC,EACpCR,EAAQ,UAAYS,EAAM,QAC1BT,EAAQ,UAAYS,EAAM,QAC1BT,EAAQ,KAAOA,EAAQ,IAAI,OAAO,OAAOQ,EAAOR,CAAO,CAAC,EACxDD,GAAcC,CAAO,CACvB,CAEA,SAASW,GAAUH,EAAOR,EAAS,CACjC,MAAMS,EAAQD,EAAM,eAAe,CAAC,EACpCR,EAAQ,WAAaS,EAAM,QAC3BT,EAAQ,WAAaS,EAAM,QAC3BT,EAAQ,MAAQA,EAAQ,KAAK,OAAO,OAAOQ,EAAOR,CAAO,CAAC,CAC5D,CAEA,SAASY,GAAe9B,EAAO,CAC7B,MAAMkB,EAAU,CACd,YAAa,EACb,YAAa,EACb,UAAW,EACX,UAAW,EACX,WAAY,EACZ,WAAY,EACZ,QAAS,EACT,QAAS,EACT,KAAMlB,EAAM,KACZ,MAAOA,EAAM,MACb,GAAIA,EAAM,GACV,KAAMA,EAAM,KACZ,MAAOA,EAAM,MACb,KAAMA,EAAM,KACZ,IAAKA,EAAM,GACZ,EACD,MAAO,CACL,WAAY+B,GAAKN,GAAWM,EAAGb,CAAO,EACtC,SAAUa,GAAKH,GAASG,EAAGb,CAAO,EAClC,UAAWa,GAAKF,GAAUE,EAAGb,CAAO,CACrC,CACH,CAEA,SAASvB,GAASC,EAAIC,EAASC,EAAO,CACpC,MAAME,EAAQH,EAAQ,MAChBM,EAASH,EAAM,OAASJ,EAAG,cAAgBA,EAC3CK,EAAUD,EAAM,SAAW,CAC/B,QAAS,EACb,EAEE,GAAI,CAACG,EAAQ,OACb,MAAM6B,EAAWF,GAAejC,EAAQ,KAAK,EAC7CM,EAAO,eAAiB,OAAOA,EAAO,cAAc,EACpDA,EAAO,eAAeL,EAAM,QAAQ,IAAI,EAAIkC,EAC5CC,GAAKD,CAAQ,EAAE,QAAQE,GAAa,CAClC/B,EAAO,iBAAiB+B,EAAWF,EAASE,CAAS,EAAGjC,CAAO,CACnE,CAAG,CACH,CAEA,SAASG,GAAOR,EAAIC,EAASC,EAAO,CAClC,MAAMK,EAASN,EAAQ,MAAM,OAASD,EAAG,cAAgBA,EACzD,GAAI,CAACO,GAAU,CAACA,EAAO,eAAgB,OACvC,MAAM6B,EAAW7B,EAAO,eAAeL,EAAM,QAAQ,IAAI,EACzDmC,GAAKD,CAAQ,EAAE,QAAQE,GAAa,CAClC/B,EAAO,oBAAoB+B,EAAWF,EAASE,CAAS,CAAC,CAC7D,CAAG,EACD,OAAO/B,EAAO,eAAeL,EAAM,QAAQ,IAAI,CACjD,CAEY,MAACqC,GAAQ,CACnB,SAAAxC,GACA,OAAAS,EACF,ECpFegC,GAAAC,GAAI,OAAO,CACxB,KAAM,aACN,WAAY,CACV,OAAA/B,EACD,EACD,MAAO,CACL,aAAc,OACd,gBAAiB,CAAC,OAAQ,MAAM,CACjC,EACD,KAAM,KAAO,CACX,cAAe,EACf,iBAAkB,EAClB,SAAU,GACV,cAAe,GACf,eAAgB,EAChB,YAAa,EACb,OAAQ,IACZ,GACE,SAAU,CAMR,WAAY,CACV,OAAO,OAAO,QAAW,WAC1B,EAMD,yBAA0B,CACxB,OAAO,KAAK,gBAAkB,OAAO,KAAK,eAAe,EAAI,GACnE,CAEG,EACD,MAAO,CACL,eAAgB,CACd,KAAK,YAAc,KAAK,aAAe,KAAK,aAC7C,EAED,UAAW,CACT,KAAK,YAAc,CACzB,CAEG,EAED,SAAU,CACJ,KAAK,eACP,KAAK,OAAS,SAAS,cAAc,KAAK,YAAY,EAEjD,KAAK,QACRnC,GAAY,4CAA4C,KAAK,YAAY,GAAI,IAAI,EAGtF,EAED,QAAS,CACP,UAAW,CACJ,KAAK,YACV,KAAK,eAAiB,KAAK,cAC3B,KAAK,cAAgB,KAAK,OAAS,KAAK,OAAO,UAAY,OAAO,YAClE,KAAK,cAAgB,KAAK,cAAgB,KAAK,eAC/C,KAAK,iBAAmB,KAAK,IAAI,KAAK,cAAgB,KAAK,uBAAuB,EAClF,KAAK,UAAU,IAAM,CACf,KAAK,IAAI,KAAK,cAAgB,KAAK,WAAW,EAAI,KAAK,yBAAyB,KAAK,aAAc,CAC/G,CAAO,EACF,EAOD,cAAe,EAEnB,CACA,CAAC,ECrFcmE,GAAAD,GAAI,OAAO,CACxB,KAAM,eACN,KAAM,KAAO,CACX,SAAU,EACd,GAEE,SAAU,CAIR,OAAO,sBAAsB,IAAM,CACjC,KAAK,IAAI,aAAa,cAAe,MAAM,EAC3C,KAAK,SAAW,EACtB,CAAK,CACL,CAEA,CAAC,ECZKE,GAAapF,GAAOqF,GAAUJ,GAAYE,GAAaG,GAAYC,GAAgB,MAAO,CAAC,cAAe,eAAgB,iBAAkB,iBAAkB,aAAc,cAAe,OAAO,CAAC,CAAC,EAG3LH,MAAW,OAAO,CAC/B,KAAM,YACN,WAAY,CACV,OAAAjC,EACD,EAED,SAAU,CACR,MAAO,CACL,QAAS,IACV,CACF,EAED,MAAO,CACL,YAAa,QACb,aAAc,QACd,iBAAkB,QAClB,gBAAiB,QACjB,gBAAiB,QACjB,aAAc,QACd,eAAgB,QAChB,gBAAiB,QACjB,eAAgB,QAChB,MAAO,CACL,KAAM,QACN,QAAS,EACf,CACG,EAED,MAAO,CACL,MAAO,CACL,SAAU,KAAK,KAChB,CACF,EAED,SAAU,CACR,qBAAsB,CACpB,OAAQ,KAAK,OAAiB,SAAR,KACvB,EAED,WAAY,CACV,OAAO8B,GAAW,QAAQ,SAAS,UAAU,KAAK,IAAI,IAAM,KAAK,gBAAkB,KAAK,iBAAmB,KAAK,cAAgB,KAAK,kBAAoB,KAAK,UAG9J,CAAC,KAAK,MACP,EAED,SAAU,CACR,OAAOlD,GAAAC,GAAA,GAAKqD,GAAS,QAAQ,SAAS,QAAQ,KAAK,IAAI,GAAhD,CACL,sBAAuB,KAAK,UAAY,KAAK,iBAC7C,YAAa,GACb,qBAAsB,KAAK,aAAe,KAAK,aAC/C,gCAAiC,KAAK,gBACtC,+BAAgC,KAAK,gBACrC,mBAAoB,CAAC,KAAK,WAAa,KAAK,KAAO,KAAK,OACxD,yBAA0B,KAAK,WAC/B,yBAA0B,KAAK,cAAgB,EAC/C,8BAA+B,KAAK,cACrC,EACF,EAED,aAAc,CACZ,MAAMG,EAAY,KAAK,wBACvB,OAAO,KAAK,KAAKA,EAAY,KAAK,eAAiBA,EAAW,CAAC,CAChE,EAED,uBAAwB,CACtB,GAAI,CAAC,KAAK,eAAgB,OAAOH,GAAS,QAAQ,SAAS,sBAAsB,KAAK,IAAI,EAC1F,MAAMI,EAAM,KAAK,MAAQ,GAAK,GACxBC,EAAM,KAAK,uBACjB,OAAOD,GAAOC,EAAMD,GAAO,KAAK,WACjC,EAED,kBAAmB,CACjB,GAAI,CAAC,KAAK,YAAa,OACvB,MAAMA,EAAM,KAEZ,OAAOA,GADK,IACQA,GAAO,KAAK,WACjC,EAED,cAAe,CACb,MAAI,CAAC,KAAK,KAAO,KAAK,YAAoB,EACnC,KAAK,SAAS,YAAY,IAClC,EAED,mBAAoB,CAClB,OAAK,KAAK,IACH,KAAK,SAAS,YAAY,IADX,CAEvB,EAED,iBAAkB,CAChB,GAAK,KAAK,gBACV,OAAO,KAAK,WACb,EAED,wBAAyB,CACvB,IAAI5D,EAASwD,GAAS,QAAQ,SAAS,sBAAsB,KAAK,IAAI,EACtE,OAAI,KAAK,aAAYxD,GAAU,SAAS,KAAK,eAAe,GACrDA,CACR,EAED,eAAgB,CACd,MAAI,CAAC,KAAK,KAAO,KAAK,aAAqB,EACpC,KAAK,SAAS,YAAY,KAClC,EAED,yBAA0B,CACxB,OAAI,KAAK,gBAAwB,OAAO,KAAK,eAAe,EACrD,KAAK,wBAA0B,KAAK,MAAQ,GAAK,GACzD,EAED,mBAAoB,CAElB,GADI,CAAC,KAAK,WAAa,KAAK,iBAAmB,KAAK,gBAAkB,GAAK,KAAK,UAC5E,KAAK,SAAU,MAAO,GAC1B,MAAM8D,EAAkB,KAAK,gBAAkB,KAAK,eAAiB,KAAK,sBAC1E,OAAO,KAAK,OAASA,EAAkB,CAACA,CACzC,EAED,YAAa,CACX,OAAI,KAAK,iBAAmB,KAAK,WACxB,KAAK,cAAgB,KAAK,wBAG/B,KAAK,gBACA,KAAK,gBAAkB,GAAK,KAAK,kBAAoB,GAGtD,CAAC,KAAK,YAAc,KAAK,kBAAoB,KAAK,oBAAsB,CACjF,EAED,aAAc,CACZ,OAAK,KAAK,iBAIH,KAAK,cAAgB,EAHnBN,GAAS,QAAQ,SAAS,YAAY,KAAK,IAAI,CAIzD,EAED,aAAc,CACZ,OAAOA,GAAS,QAAQ,SAAS,YAAY,KAAK,IAAI,GAAK,KAAK,cACjE,EAED,QAAS,CACP,OAAOtD,GAAAC,GAAA,GAAKqD,GAAS,QAAQ,SAAS,OAAO,KAAK,IAAI,GAA/C,CACL,SAAUpD,GAAc,KAAK,iBAAkB,KAAK,EACpD,UAAWA,GAAc,KAAK,iBAAiB,EAC/C,UAAW,cAAcA,GAAc,KAAK,iBAAiB,CAAC,IAC9D,KAAMA,GAAc,KAAK,YAAY,EACrC,MAAOA,GAAc,KAAK,aAAa,CACxC,EACP,CAEG,EACD,MAAO,CACL,UAAW,WAEX,mBAAoB,CAOd,CAAC,KAAK,WAAa,CAAC,KAAK,aAAe,CAAC,KAAK,cAClD,KAAK,WAAY,CAClB,EAED,eAAe2D,EAAK,CAClB,KAAK,SAAW,CAACA,GAAO,KAAK,gBAAkB,CAChD,EAED,aAAaA,EAAK,CAChB,KAAK,SAAW,CAACA,GAAO,KAAK,cAAgB,KAAK,uBACxD,CAEG,EAED,SAAU,CACJ,KAAK,iBAAgB,KAAK,SAAW,GAC1C,EAED,QAAS,CACP,eAAgB,CACd,MAAMC,EAASR,GAAS,QAAQ,QAAQ,cAAc,KAAK,IAAI,EAC/D,OAAAQ,EAAO,KAAO,KAAK,GAAGA,EAAO,MAAQ,GAAIA,EAAO,IAAK,CACnD,MAAO,CACL,QAAS,KAAK,eACxB,CACA,CAAO,EACMA,CACR,EAED,mBAAoB,CAClB,OAAO,KAAK,eAAiB,EAAI,KAAK,eAAiB,KAAK,iBAC7D,EAED,cAAe,CACb,GAAI,KAAK,eAAgB,CACvB,KAAK,SAAW,KAAK,cAAgB,KAAK,wBAC1C,MACR,CAEU,KAAK,eACP,KAAK,SAAW,KAAK,eAAiB,KAAK,cAAgB,KAAK,yBAG9D,OAAK,iBAAmB,KAAK,2BACjC,KAAK,YAAc,KAAK,cAC9B,CAEG,EAED,OAAO1F,EAAG,CACR,MAAM0F,EAASR,GAAS,QAAQ,OAAO,KAAK,KAAMlF,CAAC,EACnD,OAAA0F,EAAO,KAAOA,EAAO,MAAQ,CAAE,EAE3B,KAAK,YACPA,EAAO,KAAK,WAAaA,EAAO,KAAK,YAAc,CAAE,EACrDA,EAAO,KAAK,WAAW,KAAK,CAC1B,IAAK,KAAK,aACV,KAAM,SACN,MAAO,KAAK,QACpB,CAAO,GAGIA,CACX,CAEA,CAAC,ECnPcC,GAAAZ,GAAI,OAAO,CACxB,KAAM,iBACN,MAAO,CACL,KAAM,OACN,OAAQ,OACR,WAAY,MAChB,CACA,CAAC,ECSca,GAAA/F,GAAO4B,GAAQ0D,GAAYQ,EAAc,EAAE,OAAO,CAC/D,KAAM,UACN,MAAO,CACL,OAAQ,CACN,KAAM,OAEN,UAAUF,EAAK,CACb,MAAO,CAAC,MAAO,QAAS,SAAU,MAAM,EAAE,SAASA,CAAG,CAC9D,CAEK,EACD,WAAY,CACV,KAAM,OACN,QAAS,gBACV,EACD,cAAe,QACf,MAAO,QACP,YAAa,QACb,UAAW,CACT,KAAM,OACN,QAAS,SACV,EACD,KAAM,CACJ,QAAS,GACT,KAAM,CAAC,QAAS,MAAM,EAEtB,UAAUA,EAAK,CACb,OAAO,OAAOA,GAAQ,UAAYA,IAAQ,EAClD,CAEK,EACD,SAAU,QACV,UAAW,QACX,KAAM,QACN,KAAM,CACJ,KAAM,OAEN,UAAUA,EAAK,CACb,MAAO,CAAC,OAAQ,QAAS,UAAW,SAAS,EAAE,SAASA,CAAG,CACnE,CAEK,EACD,MAAO,CACL,KAAM,QACN,QAAS,EACf,CACG,EACD,SAAU,CACR,gBAAiB,CACf,GAAI,CAAC,KAAK,OAAQ,OAAO,KACzB,IAAIlE,EAAO,CACT,YAAa,kBACb,MAAO,CACL,CAAC,oBAAoB,KAAK,MAAM,EAAE,EAAG,EAC/C,CACO,EAED,OAAI,KAAK,gBACPA,EAAO,KAAK,mBAAmB,KAAK,cAAeA,CAAI,EACvDA,EAAK,MAAM,4BAA4B,EAAI,IAGtC,KAAK,eAAe,MAAOA,CAAI,CACvC,EAED,qBAAsB,CACpB,GAAI,CAAC,KAAK,YAAa,OAAO,KAC9B,MAAMsE,EAAQ,KAAK,UACnB,OAAO,KAAK,eAAeC,GAAM,CAC/B,YAAa,uBACb,MAAO,CACL,MAAAD,EACA,KAAM,GACN,MAAO,EACR,EACD,MAAO,CACL,aAAc,KAAK,SAAS,KAAK,EAAE,KAAK,UAAU,CACnD,EACD,GAAI,CACF,MAAO,IAAM,KAAK,SAAW,EACvC,CACA,EAAS,CAAC,KAAK,eAAeE,GAAO,CAC7B,MAAO,CACL,MAAAF,CACV,CACA,EAAS,KAAK,SAAS,CAAC,CAAC,CACpB,EAED,cAAe,CACb,OAAK,KAAK,aACH,KAAK,eAAeE,GAAO,CAChC,YAAa,gBACb,MAAO,CACL,MAAO,KAAK,SACtB,CACA,EAAS,KAAK,YAAY,EANW,IAOhC,EAED,SAAU,CACR,MAAMC,EAAUpE,GAAAC,GAAA,GAAKJ,GAAO,QAAQ,SAAS,QAAQ,KAAK,IAAI,GAA9C,CACd,kBAAmB,EAAQ,KAAK,OAChC,iBAAkB,KAAK,MACvB,oBAAqB,KAAK,SAC1B,qBAAsB,KAAK,UAC3B,gBAAiB,KAAK,IACvB,GAED,OAAI,KAAK,SACPuE,EAAQ,mBAAmB,KAAK,MAAM,EAAE,EAAI,IAGvCA,CACR,EAED,eAAgB,CACd,OAAO,KAAK,OAAS,KAAK,IAC3B,EAED,cAAe,CACb,OAAI,KAAK,OAAS,GAAc,GAC5B,OAAO,KAAK,MAAS,UAAY,KAAK,KAAa,KAAK,KACvD,CAAC,QAAS,OAAQ,UAAW,SAAS,EAAE,SAAS,KAAK,IAAI,EACxD,IAAI,KAAK,IAAI,GADqD,EAE1E,EAED,gBAAiB,CACf,OAAO,KAAK,SAAW,EAAQ,KAAK,QAAW,KAAK,aACrD,EAED,SAAU,CACR,OAAO,KAAK,MAAQ,KAAK,QAC1B,EAED,WAAY,CACV,OAAO,KAAK,eAAiB,KAAK,cAAgB,MACnD,EAED,QAAS,CACP,OAAI,KAAK,MAAQ,CAAC,KAAK,eAAiB,CAAC,KAAK,SAAiB,GACxD7F,GAAU,QAAQ,SAAS,OAAO,KAAK,IAAI,CACxD,CAEG,EAED,SAAU,CAEJ,KAAK,OAAO,eAAe,SAAS,GACtC8B,GAAS,UAAW,WAAY,IAAI,CAEvC,EAED,QAAS,CACP,YAAa,CACX,MAAMG,EAAW,CAACrC,GAAQ,KAAM,SAAS,GAAK,KAAK,aAAc,KAAK,aAAc,KAAK,eAAgBA,GAAQ,KAAM,QAAQ,EAAG,KAAK,aAAa,MAAQ,KAAK,aAAa,MAAM,CAClL,OAAQ,KAAK,MACrB,CAAO,EAAI,KAAK,mBAAmB,EACvBwB,EAAO,CACX,YAAa,kBACd,EACD,OAAO,KAAK,eAAe,MAAOA,EAAMa,CAAQ,CACjD,EAED,YAAa,CACX,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,kBACrB,EAASrC,GAAQ,IAAI,CAAC,CACjB,EAED,UAAW,CACT,IAAIwB,EAAO,CACT,YAAa,UACb,MAAO,CACL,KAAM,OACP,EACD,GAAI,KAAK,WACT,MAAO,KAAK,QACZ,MAAO,KAAK,OACZ,WAAY,CAAC,CACX,KAAM,OACN,MAAO,KAAK,QACb,EACF,EAED,OAAK,KAAK,gBAERA,GADiB,KAAK,QAAU,KAAK,aAAe,KAAK,oBACzC,KAAK,cAAeA,CAAI,GAGnC,KAAK,eAAe,MAAOA,EAAM,CAAC,KAAK,WAAU,CAAE,CAAC,CAC5D,EAGD,QAAS,CACP,KAAK,SAAW,CAAC,KAAK,QAC5B,CAEG,EAED,OAAOvB,EAAG,CACR,MAAM0F,EAAS,KAAK,SAAU,EAC9B,OAAK,KAAK,WACH1F,EAAE,aAAc,CACrB,MAAO,CACL,KAAM,KAAK,WACX,OAAQ,KAAK,OACb,KAAM,KAAK,IACnB,CACA,EAAO,CAAC0F,CAAM,CAAC,EAPkBA,CAQjC,CAEA,CAAC,ECjOcO,GAAAlB,GAAI,OAAO,CACxB,KAAM,aACN,MAAO,CACL,gBAAiB,CACf,KAAM,SACN,QAASmB,EACf,CACA,CACA,CAAC,ECFcC,GAAAtG,GAAOuG,GAAWtG,GAAYuG,EAAS,EAAE,OAAO,CAC7D,KAAM,WACN,MAAO,CACL,KAAM,QACN,MAAO,QACP,KAAM,CACJ,KAAM,CAAC,OAAQ,MAAM,EACrB,QAAS,EACf,CACG,EACD,SAAU,CACR,SAAU,CACR,OAAOxE,GAAA,CACL,iBAAkB,KAAK,KACvB,kBAAmB,KAAK,OACrB,KAAK,eAEX,EAED,QAAS,CACP,OAAOA,GAAA,CACL,OAAQC,GAAc,KAAK,IAAI,EAC/B,SAAUA,GAAc,KAAK,IAAI,EACjC,MAAOA,GAAc,KAAK,IAAI,GAC3B,KAAK,iBAEhB,CAEG,EAED,OAAO9B,EAAG,CACR,MAAMuB,EAAO,CACX,YAAa,WACb,MAAO,KAAK,QACZ,MAAO,KAAK,OACZ,GAAI,KAAK,UACV,EACD,OAAOvB,EAAE,MAAO,KAAK,mBAAmB,KAAK,MAAOuB,CAAI,EAAGxB,GAAQ,IAAI,CAAC,CAC5E,CAEA,CAAC,ECrCDuG,GAAezG,GAAOM,EAAS,EAAE,OAAO,CACtC,KAAM,UACN,WAAY,GACZ,MAAO,CACL,SAAU,QACV,MAAO,CACL,KAAM,OACN,QAAS,SACV,EACD,SAAU,QACV,QAAS,QACT,IAAK,OACL,KAAM,CACJ,KAAM,CAAC,OAAQ,MAAM,EACrB,QAAS,CACV,EACD,MAAO,CACL,KAAM,CAAC,OAAQ,MAAM,EACrB,QAAS,MACV,EACD,MAAO,OACR,EAED,OAAOH,EAAGuG,EAAK,CACb,KAAM,CACJ,SAAAnE,EACA,UAAAoE,EACA,MAAAtE,EACA,KAAAX,CACN,EAAQgF,EACEE,EAAUjF,GAAU,CACxB,YAAa,UACb,MAAOK,GAAA,CACL,kBAAmBK,EAAM,MACzB,uBAAwBA,EAAM,UAC3BwE,GAAuBH,CAAG,GAE/B,MAAO,CACL,IAAKrE,EAAM,IACX,cAAe,CAACA,EAAM,GACvB,EACD,GAAIsE,EACJ,MAAO,CACL,KAAM1E,GAAcI,EAAM,IAAI,EAC9B,MAAOJ,GAAcI,EAAM,KAAK,EAChC,SAAUA,EAAM,SAAW,WAAa,UACzC,EACD,IAAK,OACN,EAAEX,CAAI,EACP,OAAOvB,EAAE,QAASoG,GAAU,QAAQ,QAAQ,aAAalE,EAAM,SAAWA,EAAM,MAAOuE,CAAO,EAAGrE,CAAQ,CAC7G,CAEA,CAAC,ECrDcuE,GAAA9G,GAAOuG,GAAWjG,EAAS,EAAE,OAAO,CACjD,KAAM,aACN,MAAO,CACL,MAAO,CACL,KAAM,MACN,QAAS,IAAM,EACrB,CACG,EACD,QAAS,CACP,aAAc,CACZ,OAAO,KAAK,eAAe,mBAAoB,CAC7C,YAAa,sBACb,MAAO,CACL,KAAM,qBACN,IAAK,KACf,CACO,EAAE,KAAK,MAAM,IAAI,KAAK,UAAU,CAAC,CACnC,EAED,WAAWyG,EAASC,EAAK,CACvB,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,sBACb,IAAAA,CACR,EAAS9G,GAAQ,KAAM,UAAW,CAC1B,QAAA6G,EACA,IAAAC,CACR,CAAO,GAAK,CAACD,CAAO,CAAC,CACrB,CAEG,EAED,OAAO5G,EAAG,CACR,OAAOA,EAAE,MAAO,KAAK,aAAa,KAAK,MAAO,CAC5C,YAAa,aACb,MAAO,KAAK,YACb,GAAG,CAAC,KAAK,YAAW,CAAE,CAAC,CAC5B,CAEA,CAAC,ECxCKiF,GAAapF,GAAOuG,GAAWU,GAAkB,MAAM,EAAG3G,EAAS,EAG1D8E,MAAW,OAAO,CAC/B,KAAM,cACN,MAAO,CACL,SAAU,CACR,KAAM,QACN,QAAS,IACV,EACD,MAAO,QACP,WAAY,CACV,KAAM,CAAC,OAAQ,MAAM,EACrB,QAAS,CACV,EACD,cAAe,CACb,KAAM,CAAC,OAAQ,KAAK,EACpB,QAAS,IAAM,EAChB,EACD,SAAU,CACR,KAAM,CAAC,OAAQ,KAAK,EACpB,QAAS,IAAM,EAChB,EACD,SAAU,CACR,KAAM,QACN,QAAS,IACV,EACD,MAAO,CACL,KAAM,MACN,QAAS,IAAM,EAChB,EACD,QAAS,QACT,gBAAiB,CACf,KAAM,CAAC,OAAQ,KAAK,EACpB,QAAS,IAAM,EAChB,EACD,eAAgB,QAChB,MAAO,CACL,SAAU,EAChB,CACG,EAED,MAAO,CACL,MAAO,CACL,YAAa,CAAE,EACf,SAAU,GACV,WAAY,GACZ,SAAU,GACV,UAAW,GACX,YAAa,GACb,UAAW,KAAK,MAChB,MAAO,EACR,CACF,EAED,SAAU,CACR,eAAgB,CACd,GAAI,MAAK,WACT,OAAI,KAAK,MAAc,KAAK,MAMxB,KAAK,QAAU,CAAC,KAAK,UAAkB,QAAoB,SAChE,EAED,UAAW,CACT,OAAO,KAAK,sBAAsB,OAAS,GAAK,KAAK,YAAY,OAAS,GAAK,KAAK,KACrF,EAID,YAAa,CACX,OAAO,KAAK,wBAAwB,OAAS,GAAK,KAAK,OACxD,EAED,eAAgB,CACd,OAAO,KAAK,sBAAsB,OAAS,GAAK,KAAK,KACtD,EAED,aAAc,CACZ,OAAO,KAAK,iBAAiB,OAAS,CACvC,EAED,UAAW,CACT,OAAI,KAAK,WAAmB,GACrB,KAAK,YAAc,KAAK,gBAAkB,KAAK,QACvD,EAED,uBAAwB,CACtB,OAAO,KAAK,oBAAoB,KAAK,aAAa,CACnD,EAED,kBAAmB,CACjB,OAAO,KAAK,oBAAoB,KAAK,QAAQ,CAC9C,EAED,yBAA0B,CACxB,OAAO,KAAK,oBAAoB,KAAK,eAAe,CACrD,EAED,cAAe,CACb,KAAM,CACJ,OAAO,KAAK,SACb,EAED,IAAIQ,EAAK,CACP,KAAK,UAAYA,EACjB,KAAK,MAAM,QAASA,CAAG,CAC/B,CAEK,EAED,YAAa,CACX,IAAI1C,EAEJ,OAAQA,EAAK,KAAK,YAAc,MAAQA,IAAO,OAASA,EAAK,CAAC,CAAC,KAAK,MAAQ,KAAK,KAAK,QACvF,EAED,eAAgB,CACd,MAAO,CAAC,KAAK,YAAc,CAAC,KAAK,UAClC,EAED,YAAa,CACX,IAAIA,EAEJ,OAAQA,EAAK,KAAK,YAAc,MAAQA,IAAO,OAASA,EAAK,CAAC,CAAC,KAAK,MAAQ,KAAK,KAAK,QACvF,EAED,gBAAiB,CACf,OAAI,KAAK,cAAsB,GAC3B,KAAK,YAAoB,GACtB,KAAK,eAAiB,KAAK,YAAc,CAAC,KAAK,UAAY,KAAK,UAAY,KAAK,UACzF,EAED,aAAc,CACZ,OAAO,KAAK,iBAAiB,MAAM,EAAG,OAAO,KAAK,UAAU,CAAC,CAC9D,EAED,iBAAkB,CAChB,GAAI,MAAK,WACT,IAAI,KAAK,UAAY,KAAK,eAAgB,MAAO,QACjD,GAAI,KAAK,WAAY,MAAO,UAC5B,GAAI,KAAK,SAAU,OAAO,KAAK,cAEhC,EAED,kBAAmB,CACjB,OAAI,KAAK,sBAAsB,OAAS,EAC/B,KAAK,sBACH,KAAK,iBAAmB,KAAK,gBAAgB,OAAS,EACxD,KAAK,wBACH,KAAK,UAAY,KAAK,SAAS,OAAS,EAC1C,KAAK,iBACH,KAAK,eACP,KAAK,YACA,CAAE,CACtB,CAEG,EACD,MAAO,CACL,MAAO,CACL,QAAQO,EAAQC,EAAQ,CAClB2C,GAAU5C,EAAQC,CAAM,GAC5B,KAAK,SAAU,CAChB,EAED,KAAM,EACP,EAED,eAAgB,CAGd,KAAK,SAAW,GAChB,KAAK,gBAAkB,KAAK,UAAU,KAAK,QAAQ,CACpD,EAED,UAAUkC,EAAK,CAGT,CAACA,GAAO,CAAC,KAAK,aAChB,KAAK,WAAa,GAClB,KAAK,gBAAkB,KAAK,UAAU,KAAK,QAAQ,EAEtD,EAED,aAAc,CACZ,WAAW,IAAM,CACf,KAAK,SAAW,GAChB,KAAK,WAAa,GAClB,KAAK,YAAc,GACnB,KAAK,SAAU,CAChB,EAAE,CAAC,CACL,EAED,SAASA,EAAK,CACR,KAAK,gBACP,KAAK,MAAM,eAAgBA,CAAG,CAEjC,EAED,MAAMA,EAAK,CACT,KAAK,UAAYA,CACvB,CAEG,EAED,aAAc,CACZ,KAAK,SAAU,CAChB,EAED,SAAU,CACR,KAAK,MAAQ,KAAK,KAAK,SAAS,IAAI,CACrC,EAED,eAAgB,CACd,KAAK,MAAQ,KAAK,KAAK,WAAW,IAAI,CACvC,EAED,QAAS,CACP,oBAAoBsB,EAAU,CAC5B,OAAKA,EAA6B,MAAM,QAAQA,CAAQ,EAAUA,EAAqB,CAACA,CAAQ,EAA1E,CAAE,CACzB,EAGD,OAAQ,CACN,KAAK,YAAc,GACnB,KAAK,cAAgB,MAAM,QAAQ,KAAK,aAAa,EAAI,GAAK,IAC/D,EAGD,iBAAkB,CAChB,KAAK,YAAc,EACpB,EAGD,SAASrD,EAAQ,GAAOhB,EAAO,CAC7B,MAAMsE,EAAc,CAAE,EACtBtE,EAAQA,GAAS,KAAK,cAClBgB,IAAO,KAAK,SAAW,KAAK,WAAa,IAE7C,QAASuD,EAAQ,EAAGA,EAAQ,KAAK,MAAM,OAAQA,IAAS,CACtD,MAAMC,EAAO,KAAK,MAAMD,CAAK,EACvBE,EAAQ,OAAOD,GAAS,WAAaA,EAAKxE,CAAK,EAAIwE,EAErDC,IAAU,IAAS,OAAOA,GAAU,SACtCH,EAAY,KAAKG,GAAS,EAAE,EACnB,OAAOA,GAAU,WAC1BC,GAAa,sDAAsD,OAAOD,CAAK,YAAa,IAAI,CAE1G,CAEM,YAAK,YAAcH,EACnB,KAAK,MAAQA,EAAY,SAAW,EAC7B,KAAK,KAClB,CAEA,CACA,CAAC,EC9PK/B,GAAapF,GAAOwH,GAAYC,EAAW,EAGjDC,GAAetC,GAAW,OAAQ,EAAC,OAAO,CACxC,KAAM,UACN,aAAc,GACd,MAAO,CACL,WAAY,OACZ,gBAAiB,CACf,KAAM,OACN,QAAS,EACV,EACD,MAAO,QACP,OAAQ,CAAC,OAAQ,MAAM,EACvB,YAAa,CAAC,QAAS,MAAM,EAC7B,gBAAiB,QACjB,KAAM,OACN,GAAI,OACJ,MAAO,OACP,QAAS,QACT,eAAgB,QAChB,YAAa,OACb,MAAO,IACR,EAED,MAAO,CACL,MAAO,CACL,UAAW,KAAK,MAChB,aAAc,EACf,CACF,EAED,SAAU,CACR,SAAU,CACR,OAAOpD,GAAA,CACL,qBAAsB,KAAK,SAC3B,wBAAyB,CAAC,KAAK,YAC/B,2BAA4B,KAAK,cACjC,oBAAqB,KAAK,QAC1B,uBAAwB,KAAK,WAC7B,sBAAuB,KAAK,UAE5B,sBAAuB,KAAK,UAAY,IAAS,KAAK,SAAW,KACjE,uBAAwB,KAAK,WAC7B,iBAAkB,KAAK,MACvB,6BAA8B,KAAK,iBAChC,KAAK,aAEX,EAED,YAAa,CACX,OAAO,KAAK,IAAM,SAAS,KAAK,IAAI,EACrC,EAED,YAAa,CACX,OAAO,KAAK,kBAAkB,OAAS,CACxC,EAED,SAAU,CACR,MAAO,CAAC,KAAK,aAAe,CAAC,CAAC,KAAK,OAAS,KAAK,gBAAkB,KAAK,UACzE,EAED,UAAW,CACT,MAAO,CAAC,EAAE,KAAK,OAAO,OAAS,KAAK,MACrC,EAMD,cAAe,CACb,KAAM,CACJ,OAAO,KAAK,SACb,EAED,IAAI4D,EAAK,CACP,KAAK,UAAYA,EACjB,KAAK,MAAM,KAAK,aAAcA,CAAG,CACzC,CAEK,EAED,SAAU,CACR,MAAO,CAAC,CAAC,KAAK,SACf,EAED,eAAgB,CACd,OAAO,KAAK,OACb,EAED,mBAAoB,CAClB,OAAI,KAAK,QAAgB,CAAC,KAAK,IAAI,EAC9B,KAAK,YACH,KAAK,YAAY,IAAI+B,GAAc,CACxC,GAAI,OAAOA,GAAe,SAAU,OAAOA,EAC3C,MAAMC,EAAmBD,EAAW,KAAK,aAAa,EACtD,OAAO,OAAOC,GAAqB,SAAWA,EAAmB,EAClE,GAAE,OAAOb,GAAWA,IAAY,EAAE,EALL,CAAE,CAMjC,EAED,aAAc,CACZ,OAAO,KAAK,cAAgB,IAAS,KAAK,cAAgB,QAAU,KAAK,UAC/E,CAEG,EACD,MAAO,CACL,MAAMnB,EAAK,CACT,KAAK,UAAYA,CACvB,CAEG,EAED,cAAe,CAGb,KAAK,aAAe,KAAK,SAAS,OAAS,KAAK,SAAS,MAAM,OAAS,OACzE,EAED,QAAS,CACP,YAAa,CACX,MAAO,CAAC,KAAK,iBAAkB,KAAK,aAAc,KAAK,eAAe,CACvE,EAED,YAAa,CACX,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,mBACb,MAAO,CACL,MAAO,KAAK,OAAO,KAC7B,CACA,EAAS,CAAC,KAAK,aAAY,EAAI,KAAK,YAAa,EAAC,CAC7C,EAED,gBAAiB,CACf,MAAO,CAAC,KAAK,SAAU,EAAE1F,GAAQ,IAAI,CAAC,CACvC,EAED,QAAQ2H,EAAMC,EAAIC,EAAY,GAAI,CAChC,IAAI7E,EAEJ,MAAM8E,EAAO,KAAK,GAAGH,CAAI,MAAM,EACzB9C,EAAY,SAASkD,GAAUJ,CAAI,CAAC,GACpCK,EAAc,CAAC,EAAE,KAAK,WAAWnD,CAAS,GAAK+C,GAC/CK,EAAY,CAChB,QAAS,gBACT,aAAc,gBACd,OAAQ,eACR,YAAa,eACb,MAAO,OACR,EAACN,CAAI,EACAO,EAAQF,GAAeC,EAAY,KAAK,SAAS,KAAK,EAAE,kBAAkBA,CAAS,IAAKjF,EAAK,KAAK,SAAW,MAAQA,IAAO,OAASA,EAAK,EAAE,EAAI,OAChJxB,EAAOC,GAAU,CACrB,MAAO,CACL,aAAcyG,EACd,MAAO,KAAK,gBACZ,KAAM,KAAK,KACX,SAAU,KAAK,WACf,MAAO,KAAK,MACZ,SAAUP,IAAS,QAAU,GAAK,MACnC,EACD,GAAKK,EAA0B,CAC7B,MAAOtD,GAAK,CACVA,EAAE,eAAgB,EAClBA,EAAE,gBAAiB,EACnB,KAAK,MAAMG,EAAWH,CAAC,EACvBkD,GAAMA,EAAGlD,CAAC,CACX,EAGD,QAASA,GAAK,CACZA,EAAE,eAAgB,EAClBA,EAAE,gBAAiB,CAC/B,CACA,EAb2B,MAcpB,EAAEmD,CAAS,EACZ,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,gBACb,MAAOF,EAAO,kBAAkBI,GAAUJ,CAAI,CAAC,GAAK,MAC5D,EAAS,CAAC,KAAK,eAAe3B,GAAOxE,EAAMsG,CAAI,CAAC,CAAC,CAC5C,EAED,cAAe,CACb,OAAO,KAAK,eAAe,MAAO,KAAK,mBAAmB,KAAK,gBAAiB,CAC9E,YAAa,gBACb,MAAO,CACL,OAAQ/F,GAAc,KAAK,MAAM,CAClC,EACD,GAAI,CACF,MAAO,KAAK,QACZ,UAAW,KAAK,YAChB,QAAS,KAAK,SACf,EACD,IAAK,YACN,GAAG,CAAC,KAAK,eAAc,CAAE,CAAC,CAC5B,EAED,UAAW,CACT,OAAK,KAAK,SACH,KAAK,eAAewE,GAAQ,CACjC,MAAO,CACL,MAAO,KAAK,gBACZ,KAAM,KAAK,KACX,SAAU,KAAK,WACf,QAAS,KAAK,SACd,IAAK,KAAK,WACV,MAAO,KAAK,KACtB,CACO,EAAEvG,GAAQ,KAAM,OAAO,GAAK,KAAK,KAAK,EAVZ,IAW5B,EAED,aAAc,CACZ,OAAK,KAAK,YACH,KAAK,eAAemI,GAAW,CACpC,MAAO,CACL,MAAO,KAAK,QAAU,GAAK,KAAK,gBAChC,KAAM,KAAK,KACX,MAAO,KAAK,MACZ,MAAO,KAAK,iBACb,EACD,MAAO,CACL,KAAM,KAAK,YAAc,QAAU,IACpC,EACD,YAAa,CACX,QAAShG,GAASnC,GAAQ,KAAM,UAAWmC,CAAK,CAC1D,CACA,CAAO,EAd6B,IAe/B,EAED,QAAQwF,EAAMS,EAAU/G,EAAM,CAC5B,GAAI,CAACA,EAAK,OAAQ,OAAO,KACzB,MAAMgH,EAAM,GAAGV,CAAI,IAAIS,CAAQ,GAC/B,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,YAAYC,CAAG,GAC5B,IAAAA,CACD,EAAEhH,CAAI,CACR,EAED,gBAAiB,CACf,MAAMA,EAAO,CAAE,EAEf,OAAI,KAAK,OAAO,QACdA,EAAK,KAAK,KAAK,OAAO,OAAO,EACpB,KAAK,aACdA,EAAK,KAAK,KAAK,QAAQ,SAAS,CAAC,EAG5B,KAAK,QAAQ,UAAW,QAASA,CAAI,CAC7C,EAED,eAAgB,CACd,MAAMA,EAAO,GAKb,OAAI,KAAK,OAAO,OACdA,EAAK,KAAK,KAAK,OAAO,MAAM,EACnB,KAAK,YACdA,EAAK,KAAK,KAAK,QAAQ,QAAQ,CAAC,EAG3B,KAAK,QAAQ,SAAU,QAASA,CAAI,CAC5C,EAED,QAAQ,EAAG,CACT,KAAK,MAAM,QAAS,CAAC,CACtB,EAED,YAAY,EAAG,CACb,KAAK,aAAe,GACpB,KAAK,MAAM,YAAa,CAAC,CAC1B,EAED,UAAU,EAAG,CACX,KAAK,aAAe,GACpB,KAAK,MAAM,UAAW,CAAC,CAC7B,CAEG,EAED,OAAOpB,EAAG,CACR,OAAOA,EAAE,MAAO,KAAK,aAAa,KAAK,gBAAiB,CACtD,YAAa,UACb,MAAO,KAAK,OAClB,CAAK,EAAG,KAAK,YAAY,CACzB,CAEA,CAAC,ECpSDqI,GAAexI,GAAOM,EAAS,EAAE,OAAO,CACtC,KAAM,YACN,WAAY,GACZ,MAAO,CACL,MAAO,CACL,KAAM,CAAC,OAAQ,MAAM,EACrB,QAAS,EACV,EACD,IAAK,CAAC,OAAQ,MAAM,CACrB,EAED,OAAOH,EAAGuG,EAAK,CACb,KAAM,CACJ,MAAArE,CACN,EAAQqE,EACEhB,EAAM,SAASrD,EAAM,IAAK,EAAE,EAC5BQ,EAAQ,SAASR,EAAM,MAAO,EAAE,EAChCf,EAAUoE,EAAM,GAAG7C,CAAK,MAAM6C,CAAG,GAAK,OAAOrD,EAAM,KAAK,EACxDoG,EAAY/C,GAAO7C,EAAQ6C,EACjC,OAAOvF,EAAE,MAAO,CACd,YAAa,YACb,MAAO6B,GAAA,CACL,cAAeyG,GACZ5B,GAAuBH,CAAG,EAEhC,EAAEpF,CAAO,CACd,CAEA,CAAC,EC7Bc,SAASoH,GAAc5F,EAAS,CAC7C,OAAOoC,GAAI,OAAO,CAChB,KAAM,gBACN,KAAM,KAAO,CACX,eAAgB,EACtB,GAEI,SAAU,CACRyD,GAAU,SAAS,KAAK,IAAK,CAC3B,KAAM,YACN,MAAO,KAAK,SACpB,EAAS,KAAK,MAAM,CACf,EAED,WAAY,CACVA,GAAU,OAAO,KAAK,IAAK,CACzB,KAAM,YACN,MAAO,KAAK,SACpB,EAAS,KAAK,MAAM,CACf,EAED,QAAS,CACP,UAAUhI,EAASC,EAAUC,EAAgB,CAE3C,GADA,KAAK,eAAiBA,EAClB,EAACA,EAEL,QAAS8C,EAAI,EAAGC,EAASd,EAAQ,UAAU,OAAQa,EAAIC,EAAQD,IAAK,CAClE,MAAMiF,EAAW,KAAK9F,EAAQ,UAAUa,CAAC,CAAC,EAE1C,GAAI,OAAOiF,GAAa,WAAY,CAClCA,EAAU,EACV,QACZ,CAEU5H,GAAY8B,EAAQ,UAAUa,CAAC,EAAI,wFAAwF,CACrI,CACA,CAEA,CACA,CAAG,CACH,CC1BA,MAAMyB,GAAapF,GAAO6I,GAAQC,GAAc,CAC9C,UAAW,CAAC,WAAY,cAAc,CACxC,CAAC,EAAGC,EAAQ,EACNC,GAAa,CAAC,QAAS,OAAQ,OAAQ,OAAQ,iBAAkB,OAAQ,OAAO,EAGtFC,GAAe7D,GAAW,OAAQ,EAAC,OAAO,CACxC,KAAM,eACN,WAAY,CACd,OAAI8D,GACAC,SACD,EACD,aAAc,GACd,MAAO,CACL,gBAAiB,OACjB,UAAW,QACX,UAAW,QACX,UAAW,CACT,KAAM,OACN,QAAS,QACV,EACD,QAAS,CAAC,QAAS,OAAQ,MAAM,EACjC,aAAc,SACd,OAAQ,QACR,KAAM,QACN,UAAW,QACX,MAAO,OACP,SAAU,QACV,YAAa,OACb,OAAQ,OACR,iBAAkB,OAClB,sBAAuB,QACvB,QAAS,QACT,QAAS,QACT,OAAQ,QACR,WAAY,QACZ,KAAM,QACN,aAAc,QACd,OAAQ,OACR,KAAM,CACJ,KAAM,OACN,QAAS,MACf,CACG,EACD,KAAM,KAAO,CACX,SAAU,GACV,WAAY,EACZ,YAAa,EACb,aAAc,EACd,aAAc,KACd,SAAU,GACV,WAAY,EAChB,GACE,SAAU,CACR,SAAU,CACR,OAAOpH,GAAAC,GAAA,GAAK6G,GAAO,QAAQ,SAAS,QAAQ,KAAK,IAAI,GAA9C,CACL,eAAgB,GAChB,2BAA4B,KAAK,UACjC,uBAAwB,KAAK,OAC7B,4BAA6B,KAAK,SAClC,qBAAsB,KAAK,OAC3B,8BAA+B,KAAK,aACpC,0BAA2B,KAAK,KAChC,uBAAwB,KAAK,OAC7B,0BAA2B,KAAK,SAChC,yBAA0B,KAAK,WAC/B,wBAAyB,KAAK,QAC9B,yBAA0B,KAAK,SAC/B,4BAA6B,KAAK,YAClC,wBAAyB,KAAK,QAC9B,uBAAwB,KAAK,MAC9B,EACF,EAED,eAAgB,CACd,MAAMO,EAAgB3B,GAAY,QAAQ,SAAS,cAAc,KAAK,IAAI,EAC1E,MAAI,CAAC,KAAK,cAAgB,CAAC,KAAK,UAAkB2B,EAC3C,KAAK,OAAS,SACtB,EAED,sBAAuB,CACrB,OAAI,OAAO,KAAK,cAAiB,WACxB,KAAK,aAAa,KAAK,aAAa,EAGtC,CAAC,IAAI,KAAK,eAAiB,IAAI,SAAU,GAAE,MACnD,EAED,YAAa,CACX,OAAO,KAAK,UAAY,IAAS,KAAK,SAAW,IAClD,EAED,YAAa,CACX,OAAOP,GAAO,QAAQ,SAAS,WAAW,KAAK,IAAI,GAAK,KAAK,UAC9D,EAED,cAAe,CACb,KAAM,CACJ,OAAO,KAAK,SACb,EAED,IAAIjD,EAAK,CACP,KAAK,UAAYA,EACjB,KAAK,MAAM,QAAS,KAAK,SAAS,CAC1C,CAEK,EAED,SAAU,CACR,IAAI1C,EAEJ,QAASA,EAAK,KAAK,aAAe,MAAQA,IAAO,OAAS,OAASA,EAAG,SAAU,EAAC,QAAU,GAAK,KAAK,QACtG,EAED,YAAa,CACX,OAAO,KAAK,QAAU,KAAK,QAAU,KAAK,QAC3C,EAED,eAAgB,CACd,OAAO,KAAK,SAAW8F,GAAW,SAAS,KAAK,IAAI,CACrD,EAED,UAAW,CACT,OAAO,KAAK,QAAU,KAAK,YAAc,KAAK,WAC9C,KAAK,QAAU,CAAC,KAAK,QACtB,EAED,QAAS,CACP,OAAO,KAAK,MAAQ,KAAK,YAC1B,EAED,eAAgB,CACd,IAAIK,EAAS,KAAK,QAAU,CAAC,KAAK,WAAa,KAAK,YAAc,EAClE,OAAI,KAAK,YAAc,KAAK,eAAcA,GAAU,KAAK,cAClD,KAAK,SAAS,MAAQ,KAAK,QAAU,CAC1C,KAAMA,EACN,MAAO,MACf,EAAU,CACF,KAAM,OACN,MAAOA,CACR,CACF,EAED,WAAY,CACV,OAAO,KAAK,UAAY,EAAE,KAAK,UAAY,KAAK,WACjD,EAED,YAAa,CACX,OAAO,KAAK,WAAa,KAAK,eAAiB,KAAK,qBAC1D,CAEG,EACD,MAAO,CAEL,SAAU,gBAEV,OAAQ,CACN,KAAK,UAAU,KAAK,aAAa,CAClC,EAED,QAAS,CACP,KAAK,UAAU,KAAK,cAAc,CACnC,EAED,UAAW,cAEX,MAAMzD,EAAK,CACT,KAAK,UAAYA,CACvB,CAEG,EAED,SAAU,CAEJ,KAAK,OAAO,eAAe,KAAK,GAClCxD,GAAS,MAAO,SAAU,IAAI,EAK5B,KAAK,OAAO,eAAe,sBAAsB,GACnDA,GAAS,uBAAwB,eAAgB,IAAI,EAKnD,KAAK,QAAU,EAAE,KAAK,QAAU,KAAK,UAAY,KAAK,SACxDpB,GAAY,uDAAwD,IAAI,CAE3E,EAED,SAAU,CAER,KAAK,OAAO,IAAM,KAAK,WAAY,KAAK,aAAa,EACrD,KAAK,WAAa,KAAK,aAAc,EACrC,sBAAsB,IAAM,CAC1B,KAAK,SAAW,GAChB,sBAAsB,IAAM,CACrB,KAAK,gBACR,KAAK,SAAU,CAEzB,CAAO,CACP,CAAK,CACF,EAED,QAAS,CAEP,OAAQ,CACN,KAAK,QAAS,CACf,EAGD,KAAK,EAAG,CAGN,OAAO,sBAAsB,IAAM,CACjC,KAAK,MAAM,OAAS,KAAK,MAAM,MAAM,KAAM,CACnD,CAAO,CACF,EAED,mBAAoB,CAClB,KAAK,MAAM,OAAS,KAAK,MAAM,MAAM,MAAO,EAC5C,KAAK,UAAU,IAAM,KAAK,cAAgB,IAAI,CAC/C,EAED,eAAgB,CACd,MAAMO,EAAO,CAAE,EAEf,OAAI,KAAK,OAAO,cAAc,EAC5BA,EAAK,KAAK,KAAK,OAAO,cAAc,CAAC,EAC5B,KAAK,iBACdA,EAAK,KAAK,KAAK,QAAQ,aAAa,CAAC,EAGhC,KAAK,QAAQ,SAAU,QAASA,CAAI,CAC5C,EAED,qBAAsB,CACpB,MAAMA,EAAO,CAAE,EAEf,OAAI,KAAK,OAAO,eAAe,EAC7BA,EAAK,KAAK,KAAK,OAAO,eAAe,CAAC,EAC7B,KAAK,kBACdA,EAAK,KAAK,KAAK,QAAQ,cAAc,CAAC,EAGjC,KAAK,QAAQ,UAAW,QAASA,CAAI,CAC7C,EAED,aAAc,CACZ,MAAMA,EAAO,CAAE,EAEf,OAAI,KAAK,OAAO,OACdA,EAAK,KAAK,KAAK,OAAO,MAAM,EACnB,KAAK,YACdA,EAAK,KAAK,KAAK,QAAQ,QAAQ,CAAC,EAG3B,KAAK,QAAQ,SAAU,QAASA,CAAI,CAC5C,EAED,cAAe,CACb,MAAM+H,EAAQT,GAAO,QAAQ,QAAQ,aAAa,KAAK,IAAI,EACrDU,EAAU,KAAK,oBAAqB,EAE1C,OAAIA,IACFD,EAAM,SAAWA,EAAM,UAAY,CAAE,EACrCA,EAAM,SAAS,QAAQC,CAAO,GAGzBD,CACR,EAED,cAAe,CACb,OAAK,KAAK,UAGL,KAAK,QAIH,KAAK,QAAQ,SAAU,QAAS,CAAC,KAAK,QAAQ,QAAS,KAAK,iBAAiB,CAAC,CAAC,EAH7E,KAAK,QAAQ,SAAU,QAAS,CAAC,KAAK,eAAe,KAAK,CAAC,CAAC,EAJzC,IAQ7B,EAED,YAAa,CACX,IAAIpG,EAAIsG,EAAIC,EAEZ,GAAI,CAAC,KAAK,WAAY,OAAO,KAC7B,MAAM/D,EAAM,KAAK,UAAY,GAAO,KAAK,OAAO,UAAY,KAAK,QAC3DrD,EAAQ,CACZ,KAAM,KAAK,KACX,MAAO,KAAK,MACZ,IAAAqD,EACA,MAAO,KAAK,oBACb,EACD,OAAQ+D,GAAMD,GAAMtG,EAAK,KAAK,cAAc,WAAa,MAAQsG,IAAO,OAAS,OAASA,EAAG,KAAKtG,EAAI,CACpG,MAAAb,CACR,CAAO,KAAO,MAAQoH,IAAO,OAASA,EAAK,KAAK,eAAejB,GAAU,CACjE,MAAAnG,CACR,CAAO,CACF,EAED,YAAa,CACX,OAAOwG,GAAO,QAAQ,QAAQ,WAAW,KAAK,IAAI,CACnD,EAED,gBAAiB,CACf,MAAO,CAAC,KAAK,YAAa,EAAE,KAAK,iBAAgB,EAAI,KAAK,aAAY,EAAI,KAAK,YAAa,EAAE,KAAK,YAAW,CAAE,CACjH,EAED,aAAc,CACZ,OAAK,KAAK,SACH,KAAK,eAAe,WAAY,CACrC,MAAO,CACL,cAAe,EACzB,CACA,EAAS,CAAC,KAAK,UAAS,CAAE,CAAC,EALM,IAM5B,EAED,UAAW,CACT,GAAI,CAAC,KAAK,UAAW,OAAO,KAC5B,MAAMnH,EAAO,CACX,MAAO,CACL,SAAU,GACV,MAAO,KAAK,gBACZ,KAAM,KAAK,KACX,SAAU,KAAK,WACf,QAAS,CAAC,KAAK,WAAa,KAAK,WAAa,CAAC,CAAC,KAAK,iBACrD,IAAK,KAAK,WACV,KAAM,KAAK,cAAc,KACzB,MAAO,KAAK,MACZ,MAAO,KAAK,cAAc,MAC1B,MAAO,KAAK,UACtB,CACO,EACD,OAAO,KAAK,eAAe+E,GAAQ/E,EAAMxB,GAAQ,KAAM,OAAO,GAAK,KAAK,KAAK,CAC9E,EAED,WAAY,CACV,MAAMwJ,EAAQ,CAAC,KAAK,aAAe,KAAK,YAAc,KAAK,SAAW,KAAK,WAAa,EAClFC,EAAO,KAAK,eAAe,OAAQ,CACvC,SAAU,CACR,UAAW,SACZ,EACD,YAAa,aACrB,CAAO,EACD,OAAO,KAAK,eAAe,SAAU,CACnC,MAAO,CACL,MAAQ,KAAK,SAAkC,OAAvB1H,GAAcyH,CAAK,CACrD,CACA,EAAS,CAACC,CAAI,CAAC,CACV,EAED,UAAW,CACT,MAAMhD,EAAY,OAAO,OAAO,GAAI,KAAK,UAAU,EACnD,OAAOA,EAAU,OAEjB,MAGIzD,EAAA,KAAK,OAFP,OAAA0G,GAEE1G,EADC2G,EAAAC,GACD5G,EADC,CADH,UAGF,OAAO,KAAK,eAAe,QAAS,CAClC,MAAO,CAAE,EACT,SAAU,CACR,MAAO,KAAK,OAAS,UAAY,OAAO,GAAG,KAAK,UAAW,EAAE,EAAI,KAAO,KAAK,SAC9E,EACD,MAAOnB,GAAAC,GAAA,GAAK6H,GAAL,CACL,UAAW,KAAK,UAChB,SAAU,KAAK,WACf,GAAI,KAAK,WACT,YAAa,KAAK,uBAAyB,KAAK,WAAa,CAAC,KAAK,SAAW,KAAK,YAAc,OACjG,SAAU,KAAK,WACf,KAAM,KAAK,IACZ,GACD,GAAI,OAAO,OAAOlD,EAAW,CAC3B,KAAM,KAAK,OACX,MAAO,KAAK,QACZ,MAAO,KAAK,QACZ,QAAS,KAAK,SACxB,CAAS,EACD,IAAK,QACL,WAAY,CAAC,CACX,KAAM,SACN,UAAW,CACT,MAAO,EACR,EACD,MAAO,KAAK,QACb,EACT,CAAO,CACF,EAED,aAAc,CACZ,GAAI,CAAC,KAAK,YAAa,OAAO,KAC9B,MAAMoD,EAAelB,GAAO,QAAQ,QAAQ,YAAY,KAAK,IAAI,EAC3DmB,EAAc,KAAK,WAAY,EACrC,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,uBACrB,EAAS,CAACD,EAAcC,CAAW,CAAC,CAC/B,EAED,kBAAmB,CACjB,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,oBACrB,EAAS,CAAC,KAAK,WAAY,KAAK,OAAS,KAAK,SAAS,QAAQ,EAAI,KAAM,KAAK,SAAQ,EAAI,KAAK,OAAS,KAAK,SAAS,QAAQ,EAAI,IAAI,CAAC,CAClI,EAED,SAASnC,EAAM,CACb,OAAO,KAAK,eAAe,MAAO,CAChC,MAAO,iBAAiBA,CAAI,GAC5B,IAAKA,CACb,EAAS,KAAKA,CAAI,CAAC,CACd,EAED,OAAO,EAAG,CACR,KAAK,UAAY,GACjB,GAAK,KAAK,UAAU,IAAM,KAAK,MAAM,OAAQ,CAAC,CAAC,CAChD,EAED,SAAU,CACJ,KAAK,WAAa,KAAK,YAAc,CAAC,KAAK,MAAM,OACrD,KAAK,MAAM,MAAM,MAAO,CACzB,EAED,QAAQ,EAAG,CACT,GAAI,CAAC,KAAK,MAAM,MAAO,OACvB,MAAMoC,EAAOC,GAAa,KAAK,GAAG,EAClC,GAAKD,EAEL,IAAIA,EAAK,gBAAkB,KAAK,MAAM,MACpC,OAAO,KAAK,MAAM,MAAM,MAAO,EAG5B,KAAK,YACR,KAAK,UAAY,GACjB,GAAK,KAAK,MAAM,QAAS,CAAC,GAE7B,EAED,QAAQ,EAAG,CACT,MAAMjH,EAAS,EAAE,OACjB,KAAK,cAAgBA,EAAO,MAC5B,KAAK,SAAWA,EAAO,UAAYA,EAAO,SAAS,QACpD,EAED,UAAU,EAAG,CACP,EAAE,UAAYmH,GAAS,OAAS,KAAK,YAAc,KAAK,eAC1D,KAAK,aAAe,KAAK,UACzB,KAAK,MAAM,SAAU,KAAK,YAAY,GAGxC,KAAK,MAAM,UAAW,CAAC,CACxB,EAED,YAAY,EAAG,CAET,EAAE,SAAW,KAAK,MAAM,QAC1B,EAAE,eAAgB,EAClB,EAAE,gBAAiB,GAGrBtB,GAAO,QAAQ,QAAQ,YAAY,KAAK,KAAM,CAAC,CAChD,EAED,UAAU,EAAG,CACP,KAAK,cAAc,KAAK,MAAO,EACnCA,GAAO,QAAQ,QAAQ,UAAU,KAAK,KAAM,CAAC,CAC9C,EAED,eAAgB,CACT,KAAK,WACV,KAAK,WAAa,KAAK,MAAM,MAAQ,KAAK,IAAI,KAAK,MAAM,MAAM,YAAc,IAAO,EAAG,KAAK,IAAI,YAAc,EAAE,EAAI,EACrH,EAED,gBAAiB,CACV,KAAK,MAAM,SAChB,KAAK,YAAc,KAAK,MAAM,OAAO,YACtC,EAED,iBAAkB,CACZ,CAAC,KAAK,UAAY,CAAC,KAAK,MAAM,eAAe,IACjD,KAAK,aAAe,KAAK,MAAM,eAAe,EAAE,YACjD,EAED,cAAe,CACb,GAAI,CAAC,KAAK,WAAa,OAAO,UAAa,aAAe,CAAC,KAAK,MAAM,MAAO,MAAO,GACpF,MAAMoB,EAAOC,GAAa,KAAK,GAAG,EAClC,MAAI,CAACD,GAAQA,EAAK,gBAAkB,KAAK,MAAM,MAAc,IAC7D,KAAK,MAAM,MAAM,MAAO,EACjB,GACR,EAED,YAAYrE,EAAK,CAEf,KAAK,SAAWA,EAEZA,EACF,KAAK,aAAe,KAAK,UAChB,KAAK,eAAiB,KAAK,WACpC,KAAK,MAAM,SAAU,KAAK,SAAS,CAEtC,EAED,UAAW,CACT,KAAK,cAAe,EACpB,KAAK,eAAgB,EACrB,KAAK,gBAAiB,CAC5B,CAEA,CACA,CAAC,EC7gBcwE,GAAAlF,GAAI,OAAO,CACxB,KAAM,SACN,MAAO,CACL,iBAAkB,CAChB,KAAM,CAAC,OAAQ,MAAM,EAErB,SAAU,CAGR,OAAO,KAAK,SAAW,KAAK,SAAS,WAAW,iBAAmB,MACpE,EAED,UAAWmF,GAAK,CAAC,MAAM,OAAOA,CAAC,CAAC,GAAK,CAAC,KAAM,KAAM,KAAM,KAAM,IAAI,EAAE,SAAS,OAAOA,CAAC,CAAC,CAC5F,CACG,EACD,SAAU,CACR,UAAW,CACT,KAAM,CACJ,OAAAC,EACA,MAAAZ,EACA,KAAAa,EACA,iBAAAC,CACR,EAAU,KAAK,SAAS,WAGlB,GAAIA,IAAqB,KAAK,iBAAkB,OAAOF,EACvD,MAAMG,EAAc,SAAS,KAAK,iBAAkB,EAAE,EAEtD,MADiB,CAAC,MAAMA,CAAW,EACjBf,EAAQe,EAAcF,IAAS,KAAK,gBAC5D,CAEG,EAED,SAAU,CAEJ,KAAK,OAAO,eAAe,oBAAoB,GACjDG,GAAU,qBAAsB,oBAAqB,IAAI,CAE/D,CAEA,CAAC,EC5BcC,GAAA3K,GAAO4B,GAAQwI,GAAQ9E,EAAU,EAAE,OAAO,CACvD,KAAM,WACN,aAAc,GACd,MAAO,CACL,IAAK,QACL,KAAM,OACN,UAAW,OACX,WAAY,QACZ,OAAQ,QACR,MAAO,CACL,KAAM,QACN,QAAS,EACf,CACG,EACD,SAAU,CACR,SAAU,CACR,OAAOvD,GAAAC,GAAA,GAAKJ,GAAO,QAAQ,SAAS,QAAQ,KAAK,IAAI,GAA9C,CACL,qBAAsB,KAAK,QAC3B,sBAAuB,KAAK,SAC5B,wBAAyB,KAAK,WAC9B,mBAAoB,KAAK,QAC1B,EACF,EAED,SAAU,CACR,MAAO,GAAQ,KAAK,MAAQ,KAAK,OAAO,MAAQ,KAAK,aAAa,KACnE,EAED,UAAW,CACT,OAAO,KAAK,QAAU,KAAK,GAC5B,EAED,QAAS,CACP,MAAMgJ,EAAS5I,GAAA,GAAKJ,GAAO,QAAQ,SAAS,OAAO,KAAK,IAAI,GAG5D,GAAI,KAAK,SAAU,CACjB,MAAMiJ,EAAO,KAAK,IAAU,KAAK,SAAS,YAAY,IAAM,KAAK,SAAS,YAAY,IAA9D,EACxBD,EAAO,IAAM3I,GAAc4I,CAAG,EAC9BD,EAAO,SAAW,SAClBA,EAAO,OAAS,CACxB,CAEM,OAAOA,CACb,CAEG,EACD,QAAS,CAEP,QAAS,CACP,KAAK,SAAW,CAAC,KAAK,QACvB,EAED,UAAU,EAAG,CACX,KAAK,MAAM,aAAc,CAAC,CAC3B,EAED,SAAU,CACR,GAAI,CAAC,KAAK,QAAS,OACnB,IAAItJ,EAEJ,OAAI,KAAK,KACPA,EAAU,KAAK,eAAe4E,GAAO,CACnC,MAAO,CACL,MAAO,KAAK,UACZ,KAAM,EAClB,CACA,EAAW,CAAC,KAAK,IAAI,CAAC,EAEd5E,EAAUpB,GAAQ,KAAM,MAAM,EAGzB,KAAK,eAAe4K,GAAS,CAClC,YAAa,iBACb,MAAO,CACL,MAAO,KAAK,MACZ,KAAM,EACP,EACD,GAAI,CACF,MAAO,KAAK,SACtB,CACA,EAAS,CAACxJ,CAAO,CAAC,CACb,EAED,SAAU,CACR,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,gBACrB,EAASpB,GAAQ,IAAI,CAAC,CACjB,EAED,YAAa,CACX,MAAMqC,EAAWrC,GAAQ,KAAM,UAAW,CACxC,QAAS,IAAM,KAAK,SAAW,EACvC,CAAO,EACD,GAAKqC,EACL,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,mBACd,EAAEA,CAAQ,CACZ,EAED,YAAa,CACX,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,mBACrB,EAAS,CAAC,KAAK,QAAO,EAAI,KAAK,QAAS,EAAC,CACpC,EAED,YAAa,CACX,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,mBACrB,EAAS,CAAC,KAAK,WAAU,EAAI,KAAK,WAAY,EAAC,CAC/C,CAEG,EAED,OAAOpC,EAAG,CACR,MAAMuB,EAAO,CACX,YAAa,WACb,MAAO,KAAK,OACZ,MAAO,KAAK,QACZ,MAAO,KAAK,OACZ,WAAY,CAAC,CACX,KAAM,OACN,MAAO,KAAK,QACb,EACF,EACD,OAAOvB,EAAE4K,GAAmB,CAAC5K,EAAE,MAAO,KAAK,SAAWuB,EAAO,KAAK,mBAAmB,KAAK,MAAOA,CAAI,EAAG,CAAC,KAAK,WAAU,CAAE,CAAC,CAAC,CAAC,CACjI,CAEA,CAAC,ECrIcsJ,GAAAhL,GAAOuG,GAAWjG,GAAWgF,EAAU,EAAE,OAAO,CAC7D,KAAM,YACN,MAAO,CACL,SAAU,QACV,MAAO,CACL,KAAM,OACN,QAAS,SACV,EACD,KAAM,CACJ,KAAM,QACN,QAAS,EACV,EACD,QAAS,CACP,KAAM,CAAC,OAAQ,MAAM,EACrB,QAAS,GACV,EACD,MAAO,CACL,QAAS,EACV,EACD,OAAQ,CACN,KAAM,CAAC,OAAQ,MAAM,EACrB,QAAS,CACf,CACG,EACD,SAAU,CACR,SAAU,CACR,MAAM5D,EAAO,KAAK,mBAAmB,KAAK,MAAO,CAC/C,YAAa,mBACb,MAAO,CACL,QAAS,KAAK,eACxB,CACA,CAAO,EACD,OAAO,KAAK,eAAe,MAAOA,CAAI,CACvC,EAED,SAAU,CACR,OAAOM,GAAA,CACL,sBAAuB,KAAK,SAC5B,oBAAqB,KAAK,UACvB,KAAK,aAEX,EAED,iBAAkB,CAChB,OAAO,OAAO,KAAK,SAAW,KAAK,QAAU,CAAC,CAC/C,EAED,QAAS,CACP,MAAO,CACL,OAAQ,KAAK,MACd,CACP,CAEG,EACD,QAAS,CACP,YAAa,CACX,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,oBACrB,EAAS9B,GAAQ,IAAI,CAAC,CACtB,CAEG,EAED,OAAOC,EAAG,CACR,MAAMoC,EAAW,CAAC,KAAK,OAAO,EAC9B,OAAI,KAAK,UAAUA,EAAS,KAAK,KAAK,YAAY,EAC3CpC,EAAE,MAAO,CACd,YAAa,YACb,GAAI,KAAK,WACT,MAAO,KAAK,QACZ,MAAO,KAAK,MACb,EAAEoC,CAAQ,CACf,CAEA,CAAC,ECjFc0I,GAAA/F,GAAI,OAAO,CACxB,KAAM,aACN,WAAY,CACViE,SACD,EACD,MAAO,CACL,OAAQ,CACN,KAAM,CAAC,QAAS,MAAM,EACtB,QAAS,EACf,CACG,EACD,QAAS,CACP,UAAUzH,EAAO,GAAI,CACnB,OAAK,KAAK,QACVA,EAAK,YAAc,sCACnBA,EAAK,WAAaA,EAAK,YAAc,CAAE,EACvCA,EAAK,WAAW,KAAK,CACnB,KAAM,SACN,MAAO,CACL,OAAQ,EAClB,CACA,CAAO,EACM,KAAK,eAAe,MAAOA,CAAI,GATb,IAU/B,CAEA,CACA,CAAC,ECvBM,SAASwJ,GAAQ,EAAG,CACzB,EAAE,eAAgB,CACpB,CAGA,MAAeC,GAAAnL,GAAO6I,GAAQoC,GAAY7E,EAAU,EAAE,OAAO,CAC3D,KAAM,aACN,MAAO,CACL,KAAM,aACN,MAAO,QACR,EACD,MAAO,CACL,GAAI,OACJ,WAAY,KACZ,WAAY,KACZ,UAAW,KACX,SAAU,CACR,KAAM,QACN,QAAS,IACV,EACD,MAAO,MACR,EAED,MAAO,CACL,MAAO,CACL,SAAU,KAAK,WACf,UAAW,KAAK,UACjB,CACF,EAED,SAAU,CACR,eAAgB,CACd,GAAK,KAAK,SACV,OAAI,KAAK,MAAc,KAAK,MACxB,KAAK,QAAU,CAAC,KAAK,UAAkB,QACpC,SACR,EAED,YAAa,CACX,OAAO,KAAK,WAAa,IAAQ,KAAK,WAAa,MAAQ,MAAM,QAAQ,KAAK,aAAa,CAC5F,EAED,UAAW,CACT,MAAMvD,EAAQ,KAAK,MACbyG,EAAQ,KAAK,cAEnB,OAAI,KAAK,WACF,MAAM,QAAQA,CAAK,EACjBA,EAAM,KAAK8B,GAAQ,KAAK,gBAAgBA,EAAMvI,CAAK,CAAC,EADzB,GAIhC,KAAK,YAAc,QAAa,KAAK,aAAe,OAC/CA,EAAQ,KAAK,gBAAgBA,EAAOyG,CAAK,EAAI,EAAQA,EAGvD,KAAK,gBAAgBA,EAAO,KAAK,SAAS,CAClD,EAED,SAAU,CACR,OAAO,KAAK,QACb,EAED,aAAc,CACZ,MAAO,CAAC,KAAK,YAAc,CAAC,KAAK,gBAAkB,OAAY,KAAK,eAC1E,CAEG,EACD,MAAO,CACL,WAAW1D,EAAK,CACd,KAAK,UAAYA,EACjB,KAAK,SAAWA,CACtB,CAEG,EACD,QAAS,CACP,UAAW,CACT,MAAMwC,EAAQS,GAAO,QAAQ,QAAQ,SAAS,KAAK,IAAI,EACvD,OAAKT,IACLA,EAAM,KAAK,GAAK,CAEd,MAAO8C,EACR,EACM9C,EACR,EAED,SAASP,EAAMwD,EAAO,CACpB,OAAO,KAAK,eAAe,QAAS,CAClC,MAAO,OAAO,OAAO,CACnB,eAAgB,KAAK,SAAS,SAAU,EACxC,SAAU,KAAK,WACf,GAAI,KAAK,WACT,KAAMxD,EACN,KAAAA,CACD,EAAEwD,CAAK,EACR,SAAU,CACR,MAAO,KAAK,MACZ,QAAS,KAAK,QACf,EACD,GAAI,CACF,KAAM,KAAK,OACX,OAAQ,KAAK,SACb,MAAO,KAAK,QACZ,QAAS,KAAK,UACd,MAAOH,EACR,EACD,IAAK,OACb,CAAO,CACF,EAED,QAAQ,EAAG,CACT,KAAK,SAAU,EACf,KAAK,MAAM,QAAS,CAAC,CACtB,EAED,UAAW,CACT,GAAI,CAAC,KAAK,cAAe,OACzB,MAAMrI,EAAQ,KAAK,MACnB,IAAIyG,EAAQ,KAAK,cAEjB,GAAI,KAAK,WAAY,CACd,MAAM,QAAQA,CAAK,IACtBA,EAAQ,CAAE,GAGZ,MAAM1F,EAAS0F,EAAM,OACrBA,EAAQA,EAAM,OAAO8B,GAAQ,CAAC,KAAK,gBAAgBA,EAAMvI,CAAK,CAAC,EAE3DyG,EAAM,SAAW1F,GACnB0F,EAAM,KAAKzG,CAAK,CAE1B,MAAiB,KAAK,YAAc,QAAa,KAAK,aAAe,OAC7DyG,EAAQ,KAAK,gBAAgBA,EAAO,KAAK,SAAS,EAAI,KAAK,WAAa,KAAK,UACpEzG,EACTyG,EAAQ,KAAK,gBAAgBA,EAAOzG,CAAK,EAAI,KAAOA,EAEpDyG,EAAQ,CAACA,EAGX,KAAK,SAAS,GAAMA,CAAK,EACzB,KAAK,cAAgBA,EACrB,KAAK,SAAWA,CACjB,EAED,QAAQ,EAAG,CACT,KAAK,UAAY,GACjB,KAAK,MAAM,QAAS,CAAC,CACtB,EAED,OAAO,EAAG,CACR,KAAK,UAAY,GACjB,KAAK,MAAM,OAAQ,CAAC,CACrB,EAGD,UAAU,EAAG,EAEjB,CACA,CAAC,ECxJcgC,GAAAtL,GAAO6I,GAAQE,EAE9B,EAAE,OAAO,CACP,KAAM,WACN,WAAY,CACV,aAAAwC,EACD,EACD,OAAQ,CAACxC,EAAQ,EACjB,MAAO,CACL,SAAU,QACV,aAAc,QACd,IAAK,CACH,KAAM,CAAC,OAAQ,MAAM,EACrB,QAAS,GACV,EACD,IAAK,CACH,KAAM,CAAC,OAAQ,MAAM,EACrB,QAAS,CACV,EACD,KAAM,CACJ,KAAM,CAAC,OAAQ,MAAM,EACrB,QAAS,CACV,EACD,WAAY,OACZ,WAAY,CACV,KAAM,CAAC,QAAS,MAAM,EACtB,QAAS,OACT,UAAWsB,GAAK,OAAOA,GAAM,WAAaA,IAAM,QACjD,EACD,UAAW,CACT,KAAM,CAAC,OAAQ,MAAM,EACrB,QAAS,EACV,EACD,WAAY,CACV,KAAM,MACN,QAAS,IAAM,EAChB,EACD,MAAO,CACL,KAAM,CAAC,QAAS,MAAM,EACtB,QAAS,GACT,UAAWA,GAAK,OAAOA,GAAM,WAAaA,IAAM,QACjD,EACD,SAAU,CACR,KAAM,CAAC,OAAQ,MAAM,EACrB,QAAS,CACV,EACD,WAAY,OACZ,eAAgB,OAChB,MAAO,CAAC,OAAQ,MAAM,EACtB,SAAU,OACX,EACD,KAAM,KAAO,CACX,IAAK,KACL,SAAU,KACV,aAAc,GACd,aAAc,GACd,UAAW,GACX,SAAU,GACV,QAAS,GACT,YAAa,CACjB,GACE,SAAU,CACR,SAAU,CACR,OAAOtI,GAAAC,GAAA,GAAK6G,GAAO,QAAQ,SAAS,QAAQ,KAAK,IAAI,GAA9C,CACL,kBAAmB,GACnB,4BAA6B,KAAK,SAClC,iCAAkC,KAAK,YACxC,EACF,EAED,cAAe,CACb,KAAM,CACJ,OAAO,KAAK,SACb,EAED,IAAIjD,EAAK,CACPA,EAAM,MAAMA,CAAG,EAAI,KAAK,SAAWA,EAInC,MAAM/C,EAAQ,KAAK,WAAW,KAAK,IAAI,KAAK,IAAI+C,EAAK,KAAK,QAAQ,EAAG,KAAK,QAAQ,CAAC,EAC/E/C,IAAU,KAAK,YACnB,KAAK,UAAYA,EACjB,KAAK,MAAM,QAASA,CAAK,EACjC,CAEK,EAED,iBAAkB,CAChB,OAAO,KAAK,aAAe,KAAK,WAAa,KAAK,YAAc,uCAAyC,OAAS,EACnH,EAED,UAAW,CACT,OAAO,WAAW,KAAK,GAAG,CAC3B,EAED,UAAW,CACT,OAAO,WAAW,KAAK,GAAG,CAC3B,EAED,aAAc,CACZ,OAAO,KAAK,KAAO,EAAI,WAAW,KAAK,IAAI,EAAI,CAChD,EAED,YAAa,CACX,MAAM2I,GAAc,KAAK,WAAW,KAAK,aAAa,EAAI,KAAK,WAAa,KAAK,SAAW,KAAK,UAAY,IAC7G,OAAO,MAAMA,CAAU,EAAI,EAAIA,CAChC,EAED,iBAAkB,CAChB,MAAMC,EAAW,KAAK,SAAW,SAAW,OACtCC,EAAS,KAAK,SAAW,MAAQ,QACjCC,EAAW,KAAK,SAAW,SAAW,QACtCC,EAAQ,KAAK,SAAS,IAAM,OAAS,IACrCC,EAAM,KAAK,SAAS,IAAM,IAAM,OAChChJ,EAAQ,KAAK,WAAa,QAAQ,KAAK,UAAU,YAAc,GAAG,KAAK,UAAU,IACvF,MAAO,CACL,WAAY,KAAK,gBACjB,CAAC4I,CAAQ,EAAGG,EACZ,CAACF,CAAM,EAAGG,EACV,CAACF,CAAQ,EAAG9I,CACb,CACF,EAED,aAAc,CACZ,MAAM4I,EAAW,KAAK,SAAW,KAAK,SAAS,IAAM,SAAW,MAAQ,KAAK,SAAS,IAAM,OAAS,QAC/FC,EAAS,KAAK,SAAW,SAAW,QACpCE,EAAQ,MACRC,EAAM,KAAK,WAAa,QAAQ,IAAM,KAAK,UAAU,YAAc,QAAQ,IAAM,KAAK,UAAU,KACtG,MAAO,CACL,WAAY,KAAK,gBACjB,CAACJ,CAAQ,EAAGG,EACZ,CAACF,CAAM,EAAGG,CACX,CACF,EAED,WAAY,CACV,OAAO,KAAK,WAAW,OAAS,GAAK,CAAC,EAAE,CAAC,KAAK,YAAc,KAAK,aAAe,KAAK,MACtF,EAED,UAAW,CACT,OAAO,KAAK,MAAM,KAAK,SAAW,KAAK,UAAY,KAAK,WAAW,CACpE,EAED,gBAAiB,CACf,MAAO,CAAC,KAAK,YAAc,CAAC,EAAE,KAAK,YAAc,KAAK,aAAa,aAAa,EACjF,EAED,oBAAqB,CACnB,GAAI,MAAK,WACT,OAAI,KAAK,WAAmB,KAAK,WAC7B,KAAK,OAAe,KAAK,gBACtB,KAAK,iBAAmB,mBAChC,EAED,wBAAyB,CACvB,GAAI,MAAK,WACT,OAAI,KAAK,eAAuB,KAAK,eAC9B,KAAK,iBAAmB,KAAK,aACrC,EAED,oBAAqB,CACnB,OAAI,KAAK,WAAmB,KAAK,WAC1B,KAAK,iBAAmB,KAAK,aAC1C,CAEG,EACD,MAAO,CACL,IAAIjG,EAAK,CACP,MAAMkG,EAAS,WAAWlG,CAAG,EAC7BkG,EAAS,KAAK,eAAiB,KAAK,MAAM,QAASA,CAAM,CAC1D,EAED,IAAIlG,EAAK,CACP,MAAMkG,EAAS,WAAWlG,CAAG,EAC7BkG,EAAS,KAAK,eAAiB,KAAK,MAAM,QAASA,CAAM,CAC1D,EAED,MAAO,CACL,QAAQzB,EAAG,CACT,KAAK,cAAgBA,CACtB,EAED,UAAW,EACjB,CACG,EAED,SAAU,CAER,KAAK,IAAM,SAAS,cAAc,YAAY,GAAKrJ,GAAY,6EAA8E,IAAI,CAClJ,EAED,QAAS,CACP,gBAAiB,CACf,MAAMuB,EAAW,CAAC,KAAK,UAAU,EAC3BwJ,EAAS,KAAK,UAAW,EAC/B,YAAK,aAAexJ,EAAS,QAAQwJ,CAAM,EAAIxJ,EAAS,KAAKwJ,CAAM,EACnExJ,EAAS,KAAK,KAAK,aAAa,EACzBA,CACR,EAED,WAAY,CACV,OAAO,KAAK,eAAe,MAAO,CAChC,MAAOP,GAAA,CACL,WAAY,GACZ,uBAAwB,CAAC,KAAK,SAC9B,qBAAsB,KAAK,SAC3B,oBAAqB,KAAK,UAC1B,mBAAoB,KAAK,SACzB,qBAAsB,KAAK,WAC3B,qBAAsB,KAAK,YACxB,KAAK,cAEV,WAAY,CAAC,CACX,KAAM,gBACN,MAAO,KAAK,MACtB,CAAS,EACD,GAAI,CACF,MAAO,KAAK,cACZ,UAAW,KAAK,kBAChB,WAAY,KAAK,iBAC3B,CACA,EAAS,KAAK,aAAa,CACtB,EAED,aAAc,CACZ,MAAO,CAAC,KAAK,SAAU,EAAE,KAAK,oBAAqB,KAAK,SAAQ,EAAI,KAAK,kBAAkB,KAAK,cAAe,KAAK,WAAY,KAAK,SAAU,KAAK,UAAW,KAAK,QAAS,KAAK,MAAM,CAAC,CAC1L,EAED,UAAW,CACT,OAAO,KAAK,eAAe,QAAS,CAClC,MAAOA,GAAA,CACL,MAAO,KAAK,cACZ,GAAI,KAAK,WACT,SAAU,GACV,SAAU,GACV,SAAU,IACP,KAAK,OAGlB,CAAO,CACF,EAED,mBAAoB,CAClB,MAAMO,EAAW,CAAC,KAAK,eAAe,MAAO,KAAK,mBAAmB,KAAK,mBAAoB,CAC5F,YAAa,6BACb,MAAO,KAAK,WACpB,CAAO,CAAC,EAAG,KAAK,eAAe,MAAO,KAAK,mBAAmB,KAAK,uBAAwB,CACnF,YAAa,uBACb,MAAO,KAAK,eACb,EAAC,CAAC,EACH,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,4BACb,IAAK,OACN,EAAEA,CAAQ,CACZ,EAED,UAAW,CACT,GAAI,CAAC,KAAK,MAAQ,CAAC,KAAK,UAAW,OAAO,KAC1C,MAAMyJ,EAAW,WAAW,KAAK,QAAQ,EACnCC,EAAQC,GAAY,KAAK,SAAW,CAAC,EACrCC,EAAY,KAAK,SAAW,SAAW,KAAK,SAAS,IAAM,QAAU,OACrEC,EAAkB,KAAK,SAAW,KAAK,SAAS,IAAM,OAAS,QAAU,MAC3E,KAAK,UAAUH,EAAM,QAAS,EAClC,MAAMI,EAAQJ,EAAM,IAAI7E,GAAS,CAC/B,MAAM7E,EAAW,CAAE,EAEf,KAAK,WAAW6E,CAAK,GACvB7E,EAAS,KAAK,KAAK,eAAe,MAAO,CACvC,YAAa,sBACd,EAAE,KAAK,WAAW6E,CAAK,CAAC,CAAC,EAG5B,MAAMsC,EAAQtC,GAAS,IAAM,KAAK,UAC5BkF,EAAS,KAAK,SAAS,IAAM,IAAM,KAAK,WAAa5C,EAAQA,EAAQ,KAAK,WAChF,OAAO,KAAK,eAAe,OAAQ,CACjC,IAAKtC,EACL,YAAa,iBACb,MAAO,CACL,yBAA0BkF,CAC3B,EACD,MAAO,CACL,MAAO,GAAGN,CAAQ,KAClB,OAAQ,GAAGA,CAAQ,KACnB,CAACG,CAAS,EAAG,QAAQzC,CAAK,OAAOsC,EAAW,CAAC,MAC7C,CAACI,CAAe,EAAG,cAAcJ,EAAW,CAAC,KACzD,CACS,EAAEzJ,CAAQ,CACnB,CAAO,EACD,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,4BACb,MAAO,CACL,yCAA0C,KAAK,QAAU,UAAY,KAAK,WAAW,OAAS,CACxG,CACO,EAAE8J,CAAK,CACT,EAED,kBAAkBxJ,EAAO0J,EAAYC,EAAUC,EAAWC,EAASC,EAAQpE,EAAM,QAAS,CACxF,MAAMhG,EAAW,CAAC,KAAK,UAAU,EAC3BqK,EAAoB,KAAK,qBAAqB/J,CAAK,EACzD,YAAK,gBAAkBN,EAAS,KAAK,KAAK,cAAcqK,CAAiB,CAAC,EACnE,KAAK,eAAe,MAAO,KAAK,aAAa,KAAK,mBAAoB,CAC3E,IAAArE,EACA,IAAKA,EACL,YAAa,4BACb,MAAO,CACL,oCAAqCiE,EACrC,qCAAsCC,EACtC,wCAAyC,KAAK,cAC/C,EACD,MAAO,KAAK,wBAAwBF,CAAU,EAC9C,MAAO,CACL,KAAM,SACN,SAAU,KAAK,WAAa,GAAK,KAAK,OAAO,SAAW,KAAK,OAAO,SAAW,EAC/E,aAAc,KAAK,OAAO,YAAY,GAAK,KAAK,MAChD,gBAAiB,KAAK,IACtB,gBAAiB,KAAK,IACtB,gBAAiB,KAAK,cACtB,gBAAiB,OAAO,KAAK,UAAU,EACvC,mBAAoB,KAAK,SAAW,WAAa,YAClD,EACD,GAAI,CACF,MAAOG,EACP,KAAMC,EACN,QAAS,KAAK,SACxB,CACO,GAAGpK,CAAQ,CACb,EAED,qBAAqBM,EAAO,CAC1B,OAAO,KAAK,aAAa,aAAa,EAAI,KAAK,aAAa,aAAa,EAAE,CACzE,MAAAA,CACR,CAAO,EAAI,CAAC,KAAK,eAAe,OAAQ,CAAC,OAAOA,CAAK,CAAC,CAAC,CAAC,CACnD,EAED,cAAcvB,EAAS,CACrB,MAAMuL,EAAO5K,GAAc,KAAK,SAAS,EACnC6K,EAAY,KAAK,SAAW,8BAA8B,OAAO,KAAK,SAAS,EAAI,EAAI,CAAC,qCAAuC,oEACrI,OAAO,KAAK,eAAeC,GAAkB,CAC3C,MAAO,CACL,OAAQ,eAClB,CACA,EAAS,CAAC,KAAK,eAAe,MAAO,CAC7B,YAAa,kCACb,WAAY,CAAC,CACX,KAAM,OACN,MAAO,KAAK,WAAa,KAAK,UAAY,KAAK,aAAe,QAC/D,EACT,EAAS,CAAC,KAAK,eAAe,MAAO,KAAK,mBAAmB,KAAK,mBAAoB,CAC9E,YAAa,wBACb,MAAO,CACL,OAAQF,EACR,MAAOA,EACP,UAAAC,CACV,CACA,CAAO,EAAG,CAAC,KAAK,eAAe,MAAOxL,CAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC9C,EAED,UAAW,CACT,OAAO,KAAK,eAAe,MAAO,KAAK,mBAAmB,KAAK,mBAAoB,CACjF,YAAa,iBACrB,CAAO,CAAC,CACH,EAED,wBAAwBoI,EAAO,CAC7B,MAAMyC,EAAY,KAAK,SAAW,MAAQ,OAC1C,IAAItJ,EAAQ,KAAK,SAAS,IAAM,IAAM6G,EAAQA,EAC9C,OAAA7G,EAAQ,KAAK,SAAW,IAAMA,EAAQA,EAC/B,CACL,WAAY,KAAK,gBACjB,CAACsJ,CAAS,EAAG,GAAGtJ,CAAK,GACtB,CACF,EAED,kBAAkB,EAAG,CACnB,IAAIK,EAMJ,GAJA,EAAE,eAAgB,EAClB,KAAK,SAAW,KAAK,cACrB,KAAK,SAAW,GAEX,GAAAA,EAAK,EAAE,UAAY,MAAQA,IAAO,SAAkBA,EAAG,QAAQ,0DAA0D,EAAG,CAC/H,KAAK,aAAe,GACpB,MAAM8J,EAAU,EAAE,OAAO,sBAAuB,EAC1CxI,EAAQ,YAAa,EAAI,EAAE,QAAQ,CAAC,EAAI,EAC9C,KAAK,YAAc,KAAK,SAAWA,EAAM,SAAWwI,EAAQ,IAAMA,EAAQ,OAAS,GAAKxI,EAAM,SAAWwI,EAAQ,KAAOA,EAAQ,MAAQ,EAChJ,MACQ,KAAK,YAAc,EACnB,OAAO,aAAa,KAAK,YAAY,EACrC,KAAK,aAAe,OAAO,WAAW,IAAM,CAC1C,KAAK,aAAe,EACrB,EAAE,GAAG,EAGR,MAAMC,EAAiBC,GAAmB,CACxC,QAAS,GACT,QAAS,EACjB,EAAU,GACEC,EAAmBD,GAAmB,CAC1C,QAAS,EACjB,EAAU,GACEE,EAAgB,YAAa,EACnC,KAAK,YAAY,CAAC,EAClB,KAAK,IAAI,iBAAiBA,EAAe,YAAc,YAAa,KAAK,YAAaD,CAAgB,EACtGE,GAAqB,KAAK,IAAKD,EAAe,WAAa,UAAW,KAAK,gBAAiBH,CAAc,EAC1G,KAAK,MAAM,QAAS,KAAK,aAAa,CACvC,EAED,gBAAgB,EAAG,CACjB,EAAE,gBAAiB,EACnB,OAAO,aAAa,KAAK,YAAY,EACrC,KAAK,aAAe,GACpB,MAAME,EAAmBD,GAAmB,CAC1C,QAAS,EACjB,EAAU,GACJ,KAAK,IAAI,oBAAoB,YAAa,KAAK,YAAaC,CAAgB,EAC5E,KAAK,IAAI,oBAAoB,YAAa,KAAK,YAAaA,CAAgB,EAC5E,KAAK,MAAM,UAAW,CAAC,EACvB,KAAK,MAAM,MAAO,KAAK,aAAa,EAE/B9G,GAAU,KAAK,SAAU,KAAK,aAAa,IAC9C,KAAK,MAAM,SAAU,KAAK,aAAa,EACvC,KAAK,QAAU,IAGjB,KAAK,SAAW,EACjB,EAED,YAAY,EAAG,CACT,EAAE,OAAS,cACb,KAAK,aAAe,IAGtB,KAAK,cAAgB,KAAK,eAAe,CAAC,CAC3C,EAED,UAAU,EAAG,CACX,GAAI,CAAC,KAAK,cAAe,OACzB,MAAMxD,EAAQ,KAAK,aAAa,EAAG,KAAK,aAAa,EACjDA,GAAS,MAAQA,EAAQ,KAAK,UAAYA,EAAQ,KAAK,WAC3D,KAAK,cAAgBA,EACrB,KAAK,MAAM,SAAUA,CAAK,EAC3B,EAED,cAAc,EAAG,CACf,GAAI,KAAK,QAAS,CAChB,KAAK,QAAU,GACf,MACR,CAEoB,KAAK,MAAM,MACnB,MAAO,EACb,KAAK,YAAY,CAAC,EAClB,KAAK,MAAM,SAAU,KAAK,aAAa,CACxC,EAED,OAAO,EAAG,CACR,KAAK,UAAY,GACjB,KAAK,MAAM,OAAQ,CAAC,CACrB,EAED,QAAQ,EAAG,CACT,KAAK,UAAY,GACjB,KAAK,MAAM,QAAS,CAAC,CACtB,EAED,eAAe,EAAG,CAChB,MAAM+I,EAAQ,KAAK,SAAW,MAAQ,OAChChI,EAAS,KAAK,SAAW,SAAW,QACpC0J,EAAQ,KAAK,SAAW,UAAY,UACpC,CACJ,CAAC1B,CAAK,EAAG2B,EACT,CAAC3J,CAAM,EAAG4J,CACX,EAAG,KAAK,MAAM,MAAM,sBAAuB,EACtCC,EAAc,YAAa,EAAI,EAAE,QAAQ,CAAC,EAAEH,CAAK,EAAI,EAAEA,CAAK,EAElE,IAAII,EAAW,KAAK,IAAI,KAAK,KAAKD,EAAcF,EAAa,KAAK,aAAeC,EAAa,CAAC,EAAG,CAAC,GAAK,EACxG,OAAI,KAAK,WAAUE,EAAW,EAAIA,GAC9B,KAAK,SAAS,MAAKA,EAAW,EAAIA,GAC/B,WAAW,KAAK,GAAG,EAAIA,GAAY,KAAK,SAAW,KAAK,SAChE,EAED,aAAa,EAAG7K,EAAO,CACrB,GAAI,CAAC,KAAK,cAAe,OACzB,KAAM,CACJ,OAAA8K,EACA,SAAAC,EACA,IAAA/B,EACA,KAAAgC,EACA,KAAAC,EACA,MAAAC,EACA,KAAAC,EACA,GAAAC,CACR,EAAU9D,GACJ,GAAI,CAAC,CAACwD,EAAQC,EAAU/B,EAAKgC,EAAMC,EAAMC,EAAOC,EAAMC,CAAE,EAAE,SAAS,EAAE,OAAO,EAAG,OAC/E,EAAE,eAAgB,EAClB,MAAMC,EAAO,KAAK,aAAe,EAC3BC,GAAS,KAAK,SAAW,KAAK,UAAYD,EAEhD,GAAI,CAACJ,EAAMC,EAAOC,EAAMC,CAAE,EAAE,SAAS,EAAE,OAAO,EAAG,CAE/C,MAAM9B,GADW,KAAK,SAAS,IAAM,CAAC2B,EAAMG,CAAE,EAAI,CAACF,EAAOE,CAAE,GACjC,SAAS,EAAE,OAAO,EAAI,EAAI,GAC/CG,EAAa,EAAE,SAAW,EAAI,EAAE,QAAU,EAAI,EACpDvL,EAAQA,EAAQsJ,EAAY+B,EAAOE,CAC3C,SAAiB,EAAE,UAAYP,EACvBhL,EAAQ,KAAK,iBACJ,EAAE,UAAYgJ,EACvBhJ,EAAQ,KAAK,aACR,CACL,MAAMsJ,EAAY,EAAE,UAAYyB,EAAW,EAAI,GAC/C/K,EAAQA,EAAQsJ,EAAY+B,GAAQC,EAAQ,IAAMA,EAAQ,GAAK,GACvE,CAEM,OAAOtL,CACR,EAED,WAAWA,EAAO,CAChB,GAAI,CAAC,KAAK,YAAa,OAAOA,EAG9B,MAAMwL,EAAc,KAAK,KAAK,SAAQ,EAAG,KAAM,EACzCC,EAAWD,EAAY,QAAQ,GAAG,EAAI,GAAKA,EAAY,OAASA,EAAY,QAAQ,GAAG,EAAI,EAAI,EAC/FhF,EAAS,KAAK,SAAW,KAAK,YAC9BkF,EAAW,KAAK,OAAO1L,EAAQwG,GAAU,KAAK,WAAW,EAAI,KAAK,YAAcA,EACtF,OAAO,WAAW,KAAK,IAAIkF,EAAU,KAAK,QAAQ,EAAE,QAAQD,CAAQ,CAAC,CAC3E,CAEA,CACA,CAAC,ECrhBcE,GAAArJ,GAAY,OAAO,CAChC,KAAM,SACN,MAAO,CACL,IAAK,CACH,KAAM,OACN,QAAS,MACf,CACG,EACD,SAAU,CACR,QAAS,CACP,KAAM,CACJ,IAAAsJ,EACA,IAAA5D,EACA,MAAAkD,EACA,OAAAW,EACA,YAAAC,EACA,OAAAC,EACA,KAAAd,CACR,EAAU,KAAK,SAAS,YAClB,MAAO,CACL,WAAY,GAAGjD,EAAM4D,CAAG,KACxB,aAAc,GAAGV,CAAK,KACtB,cAAe,GAAGW,EAASC,EAAcC,CAAM,KAC/C,YAAa,GAAGd,CAAI,IACrB,CACP,CAEG,EAED,OAAO3N,EAAG,CACR,MAAMuB,EAAO,CACX,YAAa,SACb,MAAO,KAAK,OACZ,IAAK,MACN,EACD,OAAOvB,EAAE,KAAK,IAAKuB,EAAM,CAACvB,EAAE,MAAO,CACjC,YAAa,cACnB,EAAOD,GAAQ,IAAI,CAAC,CAAC,CAAC,CACtB,CAEA,CAAC,ECxCD2O,GAAe7O,GAAOwH,GAAYsH,GAAmB,MAAM,CAE3D,EAAE,OAAO,CACP,KAAM,SAEN,SAAU,CACR,MAAO,CACL,KAAM,IACP,CACF,EAED,aAAc,GACd,MAAO,CACL,SAAU,QACV,eAAgB,QAChB,SAAU,QACV,MAAO,OACR,EACD,KAAM,KAAO,CACX,OAAQ,CAAE,EACV,SAAU,CAAE,EACZ,SAAU,EACd,GACE,MAAO,CACL,SAAU,CACR,QAAQlJ,EAAK,CACX,MAAMmJ,EAAS,OAAO,OAAOnJ,CAAG,EAAE,SAAS,EAAI,EAC/C,KAAK,MAAM,QAAS,CAACmJ,CAAM,CAC5B,EAED,KAAM,GACN,UAAW,EACjB,CACG,EACD,QAAS,CACP,WAAWzF,EAAO,CAChB,MAAM0F,EAAU1F,GACPA,EAAM,OAAO,WAAY1D,GAAO,CACrC,KAAK,KAAK,KAAK,SAAU0D,EAAM,KAAM1D,CAAG,CAClD,EAAW,CACD,UAAW,EACrB,CAAS,EAGGqJ,EAAW,CACf,KAAM3F,EAAM,KACZ,MAAO,IAAM,CAAE,EACf,eAAgB,IAAM,EACvB,EAED,OAAI,KAAK,eAEP2F,EAAS,eAAiB3F,EAAM,OAAO,iBAAkB1D,GAAO,CACzDA,IAED,KAAK,SAAS,eAAe0D,EAAM,IAAI,IAC3C2F,EAAS,MAAQD,EAAQ1F,CAAK,GACxC,CAAS,EAED2F,EAAS,MAAQD,EAAQ1F,CAAK,EAGzB2F,CACR,EAGD,UAAW,CACT,OAAO,KAAK,OAAO,OAAO3F,GAAS,CAACA,EAAM,SAAS,EAAI,CAAC,EAAE,SAAW,CACtE,EAGD,OAAQ,CACN,KAAK,OAAO,QAAQA,GAASA,EAAM,MAAK,CAAE,EAC1C,KAAK,cAAe,CACrB,EAED,eAAgB,CACV,KAAK,gBAEP,WAAW,IAAM,CACf,KAAK,SAAW,CAAE,CACnB,EAAE,CAAC,CAEP,EAGD,iBAAkB,CAChB,KAAK,OAAO,QAAQA,GAASA,EAAM,gBAAe,CAAE,EACpD,KAAK,cAAe,CACrB,EAED,SAASA,EAAO,CACd,KAAK,OAAO,KAAKA,CAAK,EACtB,KAAK,SAAS,KAAK,KAAK,WAAWA,CAAK,CAAC,CAC1C,EAED,WAAWA,EAAO,CAChB,MAAM4F,EAAQ,KAAK,OAAO,KAAK,GAAK,EAAE,OAAS5F,EAAM,IAAI,EACzD,GAAI,CAAC4F,EAAO,OACZ,MAAMC,EAAU,KAAK,SAAS,KAAK,GAAK,EAAE,OAASD,EAAM,IAAI,EAEzDC,IACFA,EAAQ,MAAO,EACfA,EAAQ,eAAgB,GAG1B,KAAK,SAAW,KAAK,SAAS,OAAO,GAAK,EAAE,OAASD,EAAM,IAAI,EAC/D,KAAK,OAAS,KAAK,OAAO,OAAO,GAAK,EAAE,OAASA,EAAM,IAAI,EAC3D,KAAK,QAAQ,KAAK,SAAUA,EAAM,IAAI,CAC5C,CAEG,EAED,OAAO/O,EAAG,CACR,OAAOA,EAAE,OAAQ,CACf,YAAa,SACb,MAAO6B,GAAA,CACL,WAAY,IACT,KAAK,QAEV,GAAI,CACF,OAAQ4C,GAAK,KAAK,MAAM,SAAUA,CAAC,CAC3C,CACA,EAAO1E,GAAQ,IAAI,CAAC,CACpB,CAEA,CAAC,ECnIc,SAASkP,GAAM7E,EAAM,CAElC,OAAOrF,GAAI,OAAO,CAChB,KAAM,KAAKqF,CAAI,GACf,WAAY,GACZ,MAAO,CACL,GAAI,OACJ,IAAK,CACH,KAAM,OACN,QAAS,KACjB,CACK,EAED,OAAOpK,EAAG,CACR,MAAAkC,EACA,KAAAX,EACA,SAAAa,CACN,EAAO,CACDb,EAAK,YAAc,GAAG6I,CAAI,IAAI7I,EAAK,aAAe,EAAE,GAAG,KAAM,EAC7D,KAAM,CACJ,MAAA2J,CACR,EAAU3J,EAEJ,GAAI2J,EAAO,CAET3J,EAAK,MAAQ,CAAE,EACf,MAAMyE,EAAU,OAAO,KAAKkF,CAAK,EAAE,OAAOrE,GAAO,CAG/C,GAAIA,IAAQ,OAAQ,MAAO,GAC3B,MAAMnE,EAAQwI,EAAMrE,CAAG,EAGvB,OAAIA,EAAI,WAAW,OAAO,GACxBtF,EAAK,MAAMsF,CAAG,EAAInE,EACX,IAGFA,GAAS,OAAOA,GAAU,QAC3C,CAAS,EACGsD,EAAQ,SAAQzE,EAAK,aAAe,IAAIyE,EAAQ,KAAK,GAAG,CAAC,GACrE,CAEM,OAAI9D,EAAM,KACRX,EAAK,SAAWA,EAAK,UAAY,CAAE,EACnCA,EAAK,SAAS,GAAKW,EAAM,IAGpBlC,EAAEkC,EAAM,IAAKX,EAAMa,CAAQ,CACxC,CAEA,CAAG,CACH,CChDA,MAAA8M,GAAeC,GAAK,WAAW,EAAE,OAAO,CACtC,KAAM,cACN,WAAY,GACZ,MAAO,CACL,GAAI,OACJ,IAAK,CACH,KAAM,OACN,QAAS,KACV,EACD,MAAO,CACL,KAAM,QACN,QAAS,EACf,CACG,EAED,OAAOnP,EAAG,CACR,MAAAkC,EACA,KAAAX,EACA,SAAAa,CACJ,EAAK,CACD,IAAI4D,EACJ,KAAM,CACJ,MAAAkF,CACN,EAAQ3J,EAEJ,OAAI2J,IAEF3J,EAAK,MAAQ,CAAE,EACfyE,EAAU,OAAO,KAAKkF,CAAK,EAAE,OAAOrE,GAAO,CAGzC,GAAIA,IAAQ,OAAQ,MAAO,GAC3B,MAAMnE,EAAQwI,EAAMrE,CAAG,EAGvB,OAAIA,EAAI,WAAW,OAAO,GACxBtF,EAAK,MAAMsF,CAAG,EAAInE,EACX,IAGFA,GAAS,OAAOA,GAAU,QACzC,CAAO,GAGCR,EAAM,KACRX,EAAK,SAAWA,EAAK,UAAY,CAAE,EACnCA,EAAK,SAAS,GAAKW,EAAM,IAGpBlC,EAAEkC,EAAM,IAAKV,GAAUD,EAAM,CAClC,YAAa,YACb,MAAO,MAAM,CACX,mBAAoBW,EAAM,KAClC,CAAO,EAAE,OAAO8D,GAAW,CAAE,EACxB,GAAG5D,CAAQ,CAChB,CAEA,CAAC,EC7DDgN,GAAeC,GAAuB,SAAU,MAAO,UAAU,ECMlDC,GAAAzP,GAAOC,GAAYqF,EAAU,EAAE,OAAO,CACnD,KAAM,QACN,WAAY,CACV/E,YACD,EACD,MAAO,CACL,QAAS,CACP,KAAM,OAGN,QAAS,KAAO,CACd,KAAM,OACN,WAAY,OACZ,UAAW,MACZ,EACF,EACD,IAAK,CACH,KAAM,OACN,QAAS,KACV,EACD,WAAY,CACV,KAAM,OACN,QAAS,iBACf,CACG,EACD,SAAU,CACR,QAAS,CACP,OAAOyB,GAAA,GAAK,KAAK,iBAEvB,CAEG,EACD,QAAS,CACP,YAAa,CACX,MAAMO,EAAW,KAAK,UAAYrC,GAAQ,IAAI,EAC9C,OAAO,KAAK,WAAa,KAAK,eAAe,aAAc,CACzD,MAAO,CACL,KAAM,KAAK,UACrB,CACA,EAASqC,CAAQ,EAAIA,CAChB,EAED,UAAU5B,EAASC,EAAUC,EAAgB,CACvC,KAAK,WACT,KAAK,SAAWA,EACtB,CAEG,EAED,OAAOV,EAAG,CACR,OAAOA,EAAE,KAAK,IAAK,CACjB,YAAa,SACb,MAAO,KAAK,OACZ,WAAY,CAAC,CACX,KAAM,YACN,MAAO,CACL,QAAS,KAAK,UACd,QAAS,KAAK,OACxB,CACA,CAAO,EACD,GAAI,KAAK,WACT,MAAO,KAAK,MAClB,EAAO,CAAC,KAAK,WAAU,CAAE,CAAC,CAC1B,CAEA,CAAC,EC5DcuP,GAAA1P,GAAO4B,GAAQ2E,GAAWjB,GAAYhC,GAAoB,CAAC,WAAY,SAAU,OAAQ,QAAS,KAAK,CAAC,CAEvH,EAAE,OAAO,CACP,KAAM,aACN,MAAO,CACL,IAAK,QACL,SAAU,QACV,aAAc,CACZ,KAAM,OACN,QAAS,EACV,EACD,UAAW,QACX,KAAM,QACN,QAAS,CACP,KAAM,CAAC,OAAQ,MAAM,EACrB,QAAS,GACV,EACD,WAAY,CACV,KAAM,CAAC,QAAS,MAAM,EACtB,QAAS,qBACT,UAAW+G,GAAK,OAAOA,GAAM,UAAYA,IAAM,EAChD,EACD,SAAU,OACX,EACD,KAAM,KAAO,CACX,cAAe,EACnB,GACE,SAAU,CACR,SAAU,CACR,MAAO,CACL,oBAAqB,KAAK,SAC1B,kBAAmB,KAAK,SACxB,kBAAmB,KAAK,QAAU,CAAC,KAAK,IACxC,oBAAqB,KAAK,SAC1B,0BAA2B,KAAK,cAChC,gBAAiB,KAAK,KACtB,sBAAuB,KAAK,WAAa,CAAC,KAAK,SAC/C,iBAAkB,KAAK,MACvB,gBAAiB,KAAK,KACtB,eAAgB,KAAK,IACrB,oBAAqB,KAAK,QAC3B,CACF,EAID,eAAgB,CACd,MAAO,CAAC,KAAK,MAAQ,CAAC,KAAK,QAC5B,EAID,QAAS,CACP,OAAO,KAAK,cAAgB,CAAC,KAAK,MAAQ/J,GAAU,QAAQ,SAAS,OAAO,KAAK,IAAI,CACtF,EAED,QAAS,CACP,GAAI,KAAK,UAAY,CAAC,KAAK,IAAK,MAAO,CAAE,EACzC,KAAM,CACJ,IAAAmO,EACA,OAAAG,EACA,OAAAF,EACA,YAAAC,EACA,KAAAb,EACA,MAAAC,EACA,IAAAlD,CACR,EAAU,KAAK,SAAS,YAClB,MAAO,CACL,cAAe5I,GAAc2M,EAASF,EAASC,CAAW,EAC1D,YAAa1M,GAAc6L,CAAI,EAC/B,aAAc7L,GAAc8L,CAAK,EACjC,WAAY9L,GAAcwM,EAAM5D,CAAG,CACpC,CACP,CAEG,EACD,MAAO,CACL,SAAU,aACV,QAAS,YACV,EAED,SAAU,CACJ,KAAK,UAAU,KAAK,WAAY,CACrC,EAED,SAAU,CAEJ,KAAK,OAAO,eAAe,aAAa,GAC1C8E,GAAQ,cAAe,IAAI,EAMzB,KAAK,SAAW,GAClBjF,GAAU,cAAe,KAAM,IAAI,CAEtC,EAED,QAAS,CACP,YAAa,CACX,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,kBACrB,EAAS,CAACxK,GAAQ,KAAM,SAAU,CAC1B,MAAO,CACL,MAAO,cACjB,CACO,EAAC,CAAC,CACJ,EAED,YAAa,CACX,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,mBACb,MAAO,CACL,CAAC,KAAK,YAAY,EAAG,EACtB,EACD,MAAO,CACL,KAAM,SACN,YAAa,QACvB,CACA,EAAS,CAACA,GAAQ,IAAI,CAAC,CAAC,CACnB,EAED,YAAa,CAEX,MAAMwB,GADW,KAAK,cAAgB,KAAK,mBAAqB,KAAK,cAC/C,KAAK,MAAO,CAChC,YAAa,mBACb,MAAOE,GAAO,QAAQ,SAAS,QAAQ,KAAK,IAAI,EAChD,MAAOA,GAAO,QAAQ,SAAS,OAAO,KAAK,IAAI,EAC/C,WAAY,CAAC,CACX,KAAM,OACN,MAAO,KAAK,QACtB,CAAS,EACD,GAAI,CACF,aAAc,IAAM,OAAO,aAAa,KAAK,aAAa,EAC1D,aAAc,KAAK,UAC7B,CACA,CAAO,EACD,OAAO,KAAK,eAAe,MAAOF,EAAM,CAAC,KAAK,aAAc,KAAK,WAAU,CAAE,CAAC,CAC/E,EAED,eAAgB,CACd,OAAO,KAAK,eAAe,aAAc,CACvC,MAAO,CACL,KAAM,KAAK,UACrB,CACA,EAAS,CAAC,KAAK,WAAU,CAAE,CAAC,CACvB,EAED,YAAa,CACX,OAAO,aAAa,KAAK,aAAa,EACtC,MAAMR,EAAU,OAAO,KAAK,OAAO,EAE/B,CAAC,KAAK,UACV,CAAC,EAAG,EAAE,EAAE,SAASA,CAAO,IAIxB,KAAK,cAAgB,OAAO,WAAW,IAAM,CAC3C,KAAK,SAAW,EACjB,EAAEA,CAAO,EAChB,CAEG,EAED,OAAOf,EAAG,CACR,OAAOA,EAAE,MAAO,CACd,YAAa,UACb,MAAO,KAAK,QACZ,MAAO,KAAK,MAClB,EAAO,CAAC,KAAK,aAAe,GAAQ,KAAK,gBAAkB,KAAK,WAAU,CAAE,CAAC,CAC7E,CAEA,CAAC,EC3KcyP,GAAAzE,GAAW,OAAO,CAC/B,KAAM,WACN,WAAY,CACV,MAAAnG,EACD,EACD,MAAO,CACL,MAAO,QACP,QAAS,CACP,KAAM,CAAC,QAAS,MAAM,EACtB,QAAS,EACV,EACD,KAAM,CACJ,KAAM,QACN,QAAS,EACf,CACG,EACD,SAAU,CACR,SAAU,CACR,OAAOjD,GAAAC,GAAA,GAAK6G,GAAO,QAAQ,SAAS,QAAQ,KAAK,IAAI,GAA9C,CACL,8CAA+C,GAC/C,wBAAyB,KAAK,KAC9B,yBAA0B,KAAK,KAChC,EACF,EAED,OAAQ,CACN,MAAO,CACL,eAAgB,OAAO,KAAK,QAAQ,EACpC,gBAAiB,OAAO,KAAK,UAAU,EACvC,KAAM,QACP,CACF,EAKD,iBAAkB,CAChB,GAAI,KAAK,UAAY,KAAK,eAAgB,MAAO,QACjD,GAAI,KAAK,WAAY,MAAO,UAC5B,GAAI,KAAK,WAAa,KAAM,OAAO,KAAK,aAEzC,EAED,YAAa,CACX,OAAO,KAAK,aAAa,KAAK,QAAU,OAAY,KAAK,gBAAiB,CACxE,MAAO,KAAK,YACpB,CAAO,CACP,CAEG,EACD,QAAS,CACP,gBAAiB,CACf,MAAO,CAAC,KAAK,UAAW,EAAE,KAAK,SAAQ,CAAE,CAC1C,EAED,WAAY,CACV,MAGI3F,EAAA,KAAK,OAFP,OAAA0G,GAEE1G,EADC2M,EAAA/F,GACD5G,EADC,CADH,UAGF,OAAO,KAAK,eAAe,MAAO,CAChC,YAAa,oCACrB,EAAS,CAAC,KAAK,SAAS,WAAYlB,MAAA,GAAK,KAAK,OACnC6N,EACJ,EAAG,KAAK,UAAU,KAAK,aAAa,KAAK,gBAAiB,CACzD,WAAY,CAAC,CACX,KAAM,QACN,MAAO,CACL,KAAM,KAAK,YACX,MAAO,KAAK,YACxB,CACS,EACF,EAAC,EAAG,KAAK,eAAe,MAAO7N,GAAA,CAC9B,YAAa,0BACV,KAAK,WACT,EAAG,KAAK,eAAe,MAAOA,GAAA,CAC7B,YAAa,0BACV,KAAK,YACP,CAAC,KAAK,YAAa,EAAC,CAAC,CAAC,CAC1B,EAED,aAAc,CACZ,OAAO,KAAK,eAAe8N,GAAgB,GAAI,CAAC,KAAK,UAAY,GAAQ,KAAO5P,GAAQ,KAAM,UAAU,GAAK,KAAK,eAAe6P,GAAmB,CAClJ,MAAO,CACL,MAAO,KAAK,UAAY,IAAQ,KAAK,UAAY,GAAK,KAAK,OAAS,UAAY,KAAK,QACrF,KAAM,GACN,MAAO,EACP,cAAe,EACzB,CACO,EAAC,CAAC,CACJ,EAED,aAAc,CACR,KAAK,UAAU,KAAK,SAAU,CACnC,EAED,cAAe,CACR,KAAK,UAAU,KAAK,SAAU,CACpC,EAED,UAAU,EAAG,EACP,EAAE,UAAY5F,GAAS,MAAQ,KAAK,UAAY,EAAE,UAAYA,GAAS,OAAS,CAAC,KAAK,WAAU,KAAK,SAAU,CACzH,CAEA,CACA,CAAC,ECpHK6F,GAAgBR,GAAuB,kBAAkB,EACzCA,GAAuB,kBAAkB,ECqB/D,MAAAS,GAAA,CACA,oBACA,OACA,OACA,YACA,UACA,EACA,UACA,aACA,UACA,CACA,EAEA,SACA,WACA,0CACA,EACA,OACA,+BACA,CACA,CACA,gcC/CA,SAASC,IAAW,CAClB,OAAOA,GAAW,OAAO,OAAS,OAAO,OAAO,KAAI,EAAK,SAAUC,EAAG,CACpE,QAASvL,EAAI,EAAGA,EAAI,UAAU,OAAQA,IAAK,CACzC,IAAIwL,EAAI,UAAUxL,CAAC,EACnB,QAASyL,KAAKD,GAAI,CAAE,GAAE,eAAe,KAAKA,EAAGC,CAAC,IAAMF,EAAEE,CAAC,EAAID,EAAEC,CAAC,EACpE,CACI,OAAOF,CACR,EAAED,GAAS,MAAM,KAAM,SAAS,CACnC,CCRO,IAAII,GAAiB,CAG1B,QAAS,MAET,OAAQ,SAER,OAAQ,SAER,UAAW,GAKX,YAAa,GAGb,WAAY,IACd,ECJO,SAASC,GAAShN,EAAG,CAC1B,OAAO,OAAOA,GAAM,QACtB,CACO,SAASiN,GAAYjN,EAAG,CAC7B,MAAI,CAACA,GAAK,OAAOA,GAAM,UAAY,OAAOA,EAAE,aAAgB,WACnD,GAELA,EAAE,cAAgB,IAAQ,OAAOA,EAAE,YAAY,WAAc,UAAYA,EAAE,YAAY,UAAU,cAAgB,IAGjH,OAAOA,EAAE,YAAY,WAAc,YAAcA,EAAE,YAAY,UAAUA,CAAC,IAAM,EAItF,CACO,SAASkN,GAAUlN,EAAG,CAC3B,OAAOA,GAAK,OAAOA,GAAM,UAAY,OAAO,eAAeA,CAAC,EAAE,YAAc,IAAQ,EACtF,CACO,SAASmN,GAAWnN,EAAG,CAC5B,OAAOA,GAAK,OAAOA,GAAM,UAAY,OAAO,eAAeA,CAAC,EAAE,aAAe,IAAQ,EACvF,CACO,SAASoN,GAAOpN,EAAG,CACxB,OAAOA,GAAKA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACzD,CACO,SAASqN,GAASrN,EAAG,CAC1B,OAAO,OAAOA,GAAM,QACtB,CACO,IAAIsN,GAAU,MAAM,QACpB,SAASC,GAASvN,EAAG,CAC1B,OAAOA,GAAKA,EAAE,YAAY,UAAU,WAAa,IAAQ,EAC3D,CAOO,SAASwN,GAAaxN,EAAG,CAC9B,OAAO,MAAM,QAAQA,CAAC,GAAKuN,GAASvN,CAAC,CACvC,CACO,SAASyN,GAAczN,EAAG,CAC/B,OAAOA,GAAKA,EAAE,eAAiBA,EAAE,YAAY,UAAU,WAAa,IAAQ,EAC9E,CACO,SAAS0N,GAAe1N,EAAG,CAChC,OAAOA,GAAKA,EAAE,gBAAkBA,EAAE,YAAY,UAAU,WAAa,IAAQ,EAC/E,CACO,SAAS2N,GAAQ3N,EAAG,CACzB,OAAOA,GAAKA,EAAE,YAAY,UAAU,UAAY,IAAQ,EAC1D,CACO,SAAS4N,GAAQ5N,EAAG,CACzB,OAAOA,GAAKA,EAAE,YAAY,UAAU,UAAY,IAAQ,EAC1D,CACO,SAAS6N,GAAU7N,EAAG,CAC3B,OAAO,OAAOA,GAAM,SACtB,CACO,SAAS8N,GAAY9N,EAAG,CAC7B,OAAOA,GAAKA,EAAE,YAAY,UAAU,cAAgB,IAAQ,EAC9D,CACO,SAAS+N,GAAO/N,EAAG,CACxB,OAAOA,GAAKA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACzD,CACO,SAASgO,GAAWhO,EAAG,CAC5B,OAAO,OAAOA,GAAM,UACtB,CACO,SAASiO,GAAOjO,EAAG,CACxB,OAAOA,aAAa,IACtB,CACO,SAASkO,GAASlO,EAAG,CAC1B,OAAOA,aAAa,MACtB,CACO,SAASmO,GAASnO,EAAG,CAC1B,MAAO,CAAC,EAAEA,GAAK,OAAOA,GAAM,UAAYA,EAAE,cAAgB,QAAU,CAACkN,GAAUlN,CAAC,GAAK,CAACmN,GAAWnN,CAAC,EACpG,CACO,SAASoO,GAAOpO,EAAG,CACxB,OAAOA,IAAM,IACf,CACO,SAASqO,GAAYrO,EAAG,CAC7B,OAAOA,IAAM,MACf,CACO,SAASsO,GAAetO,EAAG,CAChC,OAAOA,GAAKA,EAAE,iBAAmB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACtF,CACO,SAASuO,GAAYvO,EAAG,CAC7B,OAAOA,GAAKA,EAAE,cAAgB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACnF,CACO,SAASwO,GAAiBxO,EAAG,CAClC,OAAOA,GAAKA,EAAE,mBAAqB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACxF,CACO,SAASyO,GAAYzO,EAAG,CAC7B,OAAOA,GAAKA,EAAE,cAAgB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACnF,CACO,SAAS0O,GAAkB1O,EAAG,CACnC,OAAOA,GAAKA,EAAE,oBAAsB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACzF,CACO,SAAS2O,GAAe3O,EAAG,CAChC,OAAOA,GAAKA,EAAE,iBAAmB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACtF,CAeO,SAAS4O,GAAyB5O,EAAG,CAC1C,OAAOA,GAAKA,EAAE,2BAA6B,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EAChG,CACO,SAAS6O,GAAe7O,EAAG,CAChC,OAAOA,GAAKA,EAAE,iBAAmB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACtF,CACO,SAAS8O,GAAY9O,EAAG,CAC7B,OAAOA,GAAKA,EAAE,cAAgB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACnF,CACO,SAAS+O,GAAO/O,EAAG,CACxB,OAAOA,GAAKA,EAAE,SAAW,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EAC9E,CACO,SAASgP,GAAahP,EAAG,CAC9B,OAAOA,GAAKA,EAAE,eAAiB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACpF,CACO,SAASiP,GAAejP,EAAG,CAChC,OAAOA,GAAKA,EAAE,iBAAmB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACtF,CACO,SAASkP,GAAkBlP,EAAG,CACnC,OAAOA,GAAKA,EAAE,oBAAsB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACzF,CACO,SAASmP,GAAYnP,EAAG,CAC7B,OAAOA,GAAKA,EAAE,cAAgB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACnF,CACO,SAASoP,GAAiBpP,EAAG,CAClC,OAAOA,GAAKA,EAAE,mBAAqB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACxF,CACO,SAASqP,GAAarP,EAAG,CAC9B,OAAOA,GAAKA,EAAE,eAAiB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACpF,CACO,SAASsP,GAAQtP,EAAG,CACzB,OAAOA,GAAKA,EAAE,YAAY,UAAU,UAAY,IAAQ,EAC1D,CACO,SAASuP,GAAOvP,EAAG,CACxB,IAAI,EAAI,OAAOA,EACf,OAAI,IAAM,SACJA,IAAM,KAAa,OACnBiN,GAAYjN,CAAC,EAAU,YACvBA,EAAE,aAAeA,EAAE,YAAY,KAAaA,EAAE,YAAY,KACvD,SAEF,CACT,CC1JO,SAASwP,GAAMxP,EAAG,CACvB,IAAIsE,EAAO,OAAOtE,EAGlB,GAAIsE,IAAS,UAAYA,IAAS,UAAYA,IAAS,WAAatE,IAAM,MAAQA,IAAM,OACtF,OAAOA,EAIT,GAAI,OAAOA,EAAE,OAAU,WACrB,OAAOA,EAAE,MAAO,EAIlB,GAAI,MAAM,QAAQA,CAAC,EACjB,OAAOA,EAAE,IAAI,SAAUV,EAAO,CAC5B,OAAOkQ,GAAMlQ,CAAK,CACxB,CAAK,EAEH,GAAIU,aAAa,KAAM,OAAO,IAAI,KAAKA,EAAE,SAAS,EAClD,GAAIiN,GAAYjN,CAAC,EAAG,OAAOA,EAG3B,GAAImO,GAASnO,CAAC,EACZ,OAAOyP,GAAUzP,EAAGwP,EAAK,EAE3B,MAAM,IAAI,UAAU,+CAA+C,OAAOxP,EAAG,GAAG,CAAC,CACnF,CAQO,SAASyP,GAAUC,EAAQrK,EAAU,CAC1C,IAAImK,EAAQ,CAAE,EACd,QAAS/L,KAAOiM,EACVC,GAAeD,EAAQjM,CAAG,IAC5B+L,EAAM/L,CAAG,EAAI4B,EAASqK,EAAOjM,CAAG,CAAC,GAGrC,OAAO+L,CACT,CAQO,SAASI,GAAOC,EAAGC,EAAG,CAC3B,QAASC,KAAQD,EACXH,GAAeG,EAAGC,CAAI,IACxBF,EAAEE,CAAI,EAAID,EAAEC,CAAI,GAGpB,OAAOF,CACT,CA2CO,SAASG,GAAgBH,EAAGC,EAAG,CACpC,IAAIC,EAAM,EAAGE,EACb,GAAI,MAAM,QAAQJ,CAAC,EAAG,CAIpB,GAHI,CAAC,MAAM,QAAQC,CAAC,GAGhBD,EAAE,SAAWC,EAAE,OACjB,MAAO,GAET,IAAK,EAAI,EAAGG,EAAMJ,EAAE,OAAQ,EAAII,EAAK,IACnC,GAAI,CAACD,GAAgBH,EAAE,CAAC,EAAGC,EAAE,CAAC,CAAC,EAC7B,MAAO,GAGX,MAAO,EACX,KAAS,IAAI,OAAOD,GAAM,WACtB,OAAOA,IAAMC,EACR,GAAID,aAAa,OAAQ,CAC9B,GAAI,MAAM,QAAQC,CAAC,GAAK,EAAEA,aAAa,QACrC,MAAO,GAET,IAAKC,KAAQF,EAEX,GAAI,EAAEE,KAAQD,IAAM,CAACE,GAAgBH,EAAEE,CAAI,EAAGD,EAAEC,CAAI,CAAC,EACnD,MAAO,GAGX,IAAKA,KAAQD,EAEX,GAAI,EAAEC,KAAQF,GACZ,MAAO,GAGX,MAAO,EACX,KACI,QAAOA,IAAMC,EAEjB,CAwGO,SAASH,GAAeD,EAAQQ,EAAU,CAC/C,OAAOR,GAAU,OAAO,eAAe,KAAKA,EAAQQ,CAAQ,CAC9D,CAmGO,SAASC,GAAYT,EAAQU,EAAY,CAE9C,QADIC,EAAO,CAAE,EACJ,EAAI,EAAG,EAAID,EAAW,OAAQ,IAAK,CAC1C,IAAI3M,EAAM2M,EAAW,CAAC,EAClB9Q,EAAQoQ,EAAOjM,CAAG,EAClBnE,IAAU,SACZ+Q,EAAK5M,CAAG,EAAInE,EAElB,CACE,OAAO+Q,CACT,CC5WO,IAAIC,GAAiB,CAAC,SAAU,OAAO,EACnCC,GAAiB,CAAC,SAAU,YAAa,UAAU,ECEnDC,GAAS,SAAgBjR,EAAS,CAC3C,GAAIA,EACF,MAAM,IAAI,MAAM;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA,CAAuR,EAEzS,OAAO,OAAO,OAAOwN,EAAc,CACrC,EACAJ,GAAS6D,GAAQzD,GAAgB,CAC/B,eAAAuD,GACA,eAAAC,EACF,CAAC,ECdD,SAASE,IAAK,CACZ,MAAO,EACT,CAEA,SAASC,IAAQ,CACf,MAAO,EACT,CAEA,SAASC,IAAQ,CAEjB,CAEA,MAAMC,GAAqB,oCA0C3B,SAASC,IAAS,CAMhB,SAASC,EAAc9Q,EAAG,CACxB,OAAO,OAAOA,GAAM,UAAYA,IAAM,MAAQA,EAAE,cAAgB,MACpE,CAEE,MAAM+Q,EAAS,CAAC,CACd,KAAM,SACN,KAAM,SAAU/Q,EAAG,CACjB,OAAO,OAAOA,GAAM,QAC1B,CACA,EAAK,CACD,KAAM,SACN,KAAM,SAAUA,EAAG,CACjB,OAAO,OAAOA,GAAM,QAC1B,CACA,EAAK,CACD,KAAM,UACN,KAAM,SAAUA,EAAG,CACjB,OAAO,OAAOA,GAAM,SAC1B,CACA,EAAK,CACD,KAAM,WACN,KAAM,SAAUA,EAAG,CACjB,OAAO,OAAOA,GAAM,UAC1B,CACA,EAAK,CACD,KAAM,QACN,KAAM,MAAM,OAChB,EAAK,CACD,KAAM,OACN,KAAM,SAAUA,EAAG,CACjB,OAAOA,aAAa,IAC1B,CACA,EAAK,CACD,KAAM,SACN,KAAM,SAAUA,EAAG,CACjB,OAAOA,aAAa,MAC1B,CACA,EAAK,CACD,KAAM,SACN,KAAM8Q,CACV,EAAK,CACD,KAAM,OACN,KAAM,SAAU9Q,EAAG,CACjB,OAAOA,IAAM,IACnB,CACA,EAAK,CACD,KAAM,YACN,KAAM,SAAUA,EAAG,CACjB,OAAOA,IAAM,MACnB,CACA,CAAG,EACKgR,EAAU,CACd,KAAM,MACN,KAAMP,GACN,MAAO,EACX,EAME,IAAIQ,EAEAC,EAGAC,EAAe,EAGfC,EAAQ,CACV,YAAa,CACd,EASD,SAASC,EAASC,EAAU,CAC1B,MAAMhN,EAAO2M,EAAQ,IAAIK,CAAQ,EAEjC,GAAIhN,EACF,OAAOA,EAIT,IAAId,EAAU,iBAAmB8N,EAAW,IAC5C,MAAMtK,EAAOsK,EAAS,YAAa,EACnC,IAAIC,EAEJ,IAAKA,KAAaL,EAChB,GAAIK,EAAU,YAAa,IAAKvK,EAAM,CACpCxD,GAAW,mBAAqB+N,EAAY,MAC5C,KACR,CAGI,MAAM,IAAI,UAAU/N,CAAO,CAC/B,CAgBE,SAASgO,EAASC,EAAO,CACvB,IAAIC,EAAa,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,MACrF,MAAMC,EAAcD,EAAaL,EAASK,CAAU,EAAE,MAAQR,EAAS,OACjEU,EAAW,CAAE,EAEnB,QAASxR,EAAI,EAAGA,EAAIqR,EAAM,OAAQ,EAAErR,EAAG,CACrC,GAAI,CAACqR,EAAMrR,CAAC,GAAK,OAAOqR,EAAMrR,CAAC,EAAE,MAAS,UAAY,OAAOqR,EAAMrR,CAAC,EAAE,MAAS,WAC7E,MAAM,IAAI,UAAU,gEAAgE,EAGtF,MAAMkR,GAAWG,EAAMrR,CAAC,EAAE,KAE1B,GAAI6Q,EAAQ,IAAIK,EAAQ,EACtB,MAAM,IAAI,UAAU,wBAA0BA,GAAW,GAAG,EAG9DM,EAAS,KAAKN,EAAQ,EACtBL,EAAQ,IAAIK,GAAU,CACpB,KAAMA,GACN,KAAMG,EAAMrR,CAAC,EAAE,KACf,MAAOqR,EAAMrR,CAAC,EAAE,MAChB,MAAOuR,EAAcvR,EACrB,cAAe,CAAE,CAEzB,CAAO,CACF,CAGD,MAAMyR,EAAgBX,EAAS,MAAMS,CAAW,EAChDT,EAAWA,EAAS,MAAM,EAAGS,CAAW,EAAE,OAAOC,CAAQ,EAAE,OAAOC,CAAa,EAE/E,QAASzR,EAAIuR,EAAcC,EAAS,OAAQxR,EAAI8Q,EAAS,OAAQ,EAAE9Q,EACjE6Q,EAAQ,IAAIC,EAAS9Q,CAAC,CAAC,EAAE,MAAQA,CAEvC,CASE,SAAS0R,GAAQ,CACfb,EAAU,IAAI,IACdC,EAAW,CAAE,EACbC,EAAe,EACfK,EAAS,CAACR,CAAO,EAAG,EAAK,CAC1B,CAGDc,EAAO,EACPN,EAAST,CAAM,EAKf,SAASgB,GAAmB,CAC1B,IAAIT,EAEJ,IAAKA,KAAYJ,EACfD,EAAQ,IAAIK,CAAQ,EAAE,cAAgB,CAAE,EAG1CH,EAAe,CACnB,CASE,SAASa,EAAc1S,EAAO,CAC5B,MAAM2S,EAAUf,EAAS,OAAOlK,GAAQ,CACtC,MAAM1C,EAAO2M,EAAQ,IAAIjK,CAAI,EAC7B,MAAO,CAAC1C,EAAK,OAASA,EAAK,KAAKhF,CAAK,CAC3C,CAAK,EAED,OAAI2S,EAAQ,OACHA,EAGF,CAAC,KAAK,CACjB,CAQE,SAASC,EAAgBC,EAAQ,CAC/B,OAAOA,GAAU,OAAOA,GAAW,YAAc,uBAAwBA,CAC7E,CAqCE,SAASC,EAAcC,EAAIC,EAAW/S,EAAS,CAC7C,GAAI,CAAC2S,EAAgBG,CAAE,EACrB,MAAM,IAAI,UAAUzB,EAAkB,EAIxC,MAAM2B,EAAQhT,GAAWA,EAAQ,MAC3BiT,EAAkB,MAAM,QAAQF,CAAS,EAAIA,EAAU,KAAK,GAAG,EAAIA,EACnEG,EAASC,EAAeF,CAAe,EACvCG,GAAqBC,EAAgBH,CAAM,EAEjD,GAAI,CAACF,GAASI,MAAsBN,EAAG,WAAY,CAEjD,MAAMQ,GAAQR,EAAG,mBAAmB,aAAa,IAAIM,EAAkB,EAEvE,GAAIE,GACF,OAAOA,EAEV,CAMD,MAAMC,EAAUL,EAAO,OACvB,IAAIM,GAEJ,GAAIR,EAAO,CACTQ,GAAsB,CAAE,EACxB,IAAI/L,GAEJ,IAAKA,MAAQqL,EAAG,WACdU,GAAoB,KAAKV,EAAG,mBAAmB,aAAa,IAAIrL,EAAI,CAAC,CAE7E,MACM+L,GAAsBV,EAAG,mBAAmB,WAG9C,QAASjS,GAAI,EAAGA,GAAI0S,EAAS,EAAE1S,GAAG,CAChC,MAAM4S,GAAOP,EAAOrS,EAAC,EACf6S,GAAqB,CAAE,EAC7B,IAAIC,GAEJ,IAAKA,MAAeH,GAAqB,CACvC,MAAMI,GAAOC,EAAgBF,GAAY,OAAQ9S,EAAC,EAElD,GAAI,GAAC+S,IAAQH,GAAK,WAAa,CAACG,GAAK,WAIrC,IAAI,CAACA,GAAK,OAAQ,CAEhB,MAAME,GAAYC,EAAaH,EAAI,EAEnC,GAAIH,GAAK,MAAM,KAAKO,IAAS,CAACF,GAAU,IAAIE,GAAM,IAAI,CAAC,EACrD,QAEH,CAGDN,GAAmB,KAAKC,EAAW,EAC3C,CAGM,GADAH,GAAsBE,GAClBF,GAAoB,SAAW,EAAG,KACvC,CAGD,IAAIS,EAEJ,IAAKA,KAAaT,GAChB,GAAIS,EAAU,OAAO,QAAUV,EAC7B,OAAOU,EAIX,MAAM,IAAI,UAAU,oCAAsCnB,EAAG,MAAQ,WAAa,IAAMO,EAAgBH,EAAQ,IAAI,EAAI,IAAI,CAChI,CA6BE,SAASgB,EAAKpB,EAAIC,EAAW/S,EAAS,CACpC,OAAO6S,EAAcC,EAAIC,EAAW/S,CAAO,EAAE,cACjD,CASE,SAASmU,EAAQpU,EAAOgS,EAAU,CAEhC,MAAMhN,EAAO+M,EAASC,CAAQ,EAE9B,GAAIhN,EAAK,KAAKhF,CAAK,EACjB,OAAOA,EAGT,MAAMqU,EAAcrP,EAAK,cAEzB,GAAIqP,EAAY,SAAW,EACzB,MAAM,IAAI,MAAM,+BAAiCrC,EAAW,WAAW,EAGzE,QAASlR,EAAI,EAAGA,EAAIuT,EAAY,OAAQvT,IAGtC,GAFiBiR,EAASsC,EAAYvT,CAAC,EAAE,IAAI,EAEhC,KAAKd,CAAK,EACrB,OAAOqU,EAAYvT,CAAC,EAAE,QAAQd,CAAK,EAIvC,MAAM,IAAI,MAAM,kBAAoBA,EAAQ,OAASgS,CAAQ,CACjE,CASE,SAASsB,EAAgBH,EAAQ,CAC/B,IAAImB,EAAY,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,IACpF,OAAOnB,EAAO,IAAIoB,GAAKA,EAAE,IAAI,EAAE,KAAKD,CAAS,CACjD,CAQE,SAASE,EAAWC,EAAO,CACzB,MAAMC,EAAYD,EAAM,QAAQ,KAAK,IAAM,EAErCE,GADSD,EAAoBD,EAAM,OAAS,EAAIA,EAAM,MAAM,CAAC,EAAI,MAA5CA,GACJ,MAAM,GAAG,EAAE,IAAIG,GAAK7C,EAAS6C,EAAE,KAAM,EAAC,EAC7D,IAAIC,EAAS,GACTC,EAAYJ,EAAY,MAAQ,GAapC,MAAO,CACL,MAbiBC,EAAS,IAAI,SAAU3P,EAAM,CAC9C,OAAA6P,EAAS7P,EAAK,OAAS6P,EACvBC,GAAa9P,EAAK,KAAO,IAClB,CACL,KAAMA,EAAK,KACX,UAAWA,EAAK,MAChB,KAAMA,EAAK,KACX,MAAOA,EAAK,MACZ,WAAY,KACZ,gBAAiB,EAClB,CACP,CAAK,EAGC,KAAM8P,EAAU,MAAM,EAAG,EAAE,EAE3B,OAAAD,EACA,cAAe,GACf,UAAAH,CACD,CACL,CASE,SAASK,EAAYN,EAAO,CAC1B,MAAMO,EAAYP,EAAM,MAAM,IAAIlH,IAAKA,GAAE,IAAI,EACvC0H,EAAsBC,EAAqBF,CAAS,EAC1D,IAAIH,EAASJ,EAAM,OACfU,EAAUV,EAAM,KACpB,MAAMW,EAAmBH,EAAoB,IAAI,SAAUI,GAAY,CACrE,MAAMrQ,EAAO+M,EAASsD,GAAW,IAAI,EACrC,OAAAR,EAAS7P,EAAK,OAAS6P,EACvBM,GAAW,IAAME,GAAW,KACrB,CACL,KAAMA,GAAW,KACjB,UAAWrQ,EAAK,MAChB,KAAMA,EAAK,KACX,MAAOA,EAAK,MACZ,WAAAqQ,GACA,gBAAiBA,GAAW,KAC7B,CACP,CAAK,EACD,MAAO,CACL,MAAOZ,EAAM,MAAM,OAAOW,CAAgB,EAC1C,KAAMD,EACN,OAAAN,EACA,cAAeO,EAAiB,OAAS,EACzC,UAAWX,EAAM,SAClB,CACL,CAUE,SAAST,EAAaS,EAAO,CAC3B,OAAKA,EAAM,UACTA,EAAM,QAAU,IAAI,IACpBA,EAAM,MAAM,QAAQzP,GAAQyP,EAAM,QAAQ,IAAIzP,EAAK,IAAI,CAAC,GAGnDyP,EAAM,OACjB,CAUE,SAASrB,EAAekC,EAAc,CACpC,MAAMnC,EAAS,CAAE,EAEjB,GAAI,OAAOmC,GAAiB,SAC1B,MAAM,IAAI,UAAU,4BAA4B,EAGlD,MAAMtC,EAAYsC,EAAa,KAAM,EAErC,GAAItC,IAAc,GAChB,OAAOG,EAGT,MAAMoC,EAAYvC,EAAU,MAAM,GAAG,EAErC,QAASlS,EAAI,EAAGA,EAAIyU,EAAU,OAAQ,EAAEzU,EAAG,CACzC,MAAM0U,EAAchB,EAAWe,EAAUzU,CAAC,EAAE,KAAI,CAAE,EAElD,GAAI0U,EAAY,WAAa1U,IAAMyU,EAAU,OAAS,EACpD,MAAM,IAAI,YAAY,8BAAgCA,EAAUzU,CAAC,EAAI,wCAA6C,EAIpH,GAAI0U,EAAY,MAAM,SAAW,EAC/B,OAAO,KAGTrC,EAAO,KAAKqC,CAAW,CAC7B,CAEI,OAAOrC,CACX,CAQE,SAASsC,EAAatC,EAAQ,CAC5B,MAAMsB,EAAQiB,EAAKvC,CAAM,EACzB,OAAOsB,EAAQA,EAAM,UAAY,EACrC,CASE,SAASkB,EAAYlB,EAAO,CAC1B,GAAI,CAACA,GAASA,EAAM,MAAM,SAAW,EAEnC,OAAOtD,GACF,GAAIsD,EAAM,MAAM,SAAW,EAChC,OAAO1C,EAAS0C,EAAM,MAAM,CAAC,EAAE,IAAI,EAAE,KAChC,GAAIA,EAAM,MAAM,SAAW,EAAG,CACnC,MAAMmB,EAAQ7D,EAAS0C,EAAM,MAAM,CAAC,EAAE,IAAI,EAAE,KACtCoB,EAAQ9D,EAAS0C,EAAM,MAAM,CAAC,EAAE,IAAI,EAAE,KAC5C,OAAO,SAAY/T,EAAG,CACpB,OAAOkV,EAAMlV,CAAC,GAAKmV,EAAMnV,CAAC,CAC3B,CACP,KAAW,CAEL,MAAMoV,EAAQrB,EAAM,MAAM,IAAI,SAAUzP,EAAM,CAC5C,OAAO+M,EAAS/M,EAAK,IAAI,EAAE,IACnC,CAAO,EACD,OAAO,SAAYtE,EAAG,CACpB,QAASI,EAAI,EAAGA,EAAIgV,EAAM,OAAQhV,IAChC,GAAIgV,EAAMhV,CAAC,EAAEJ,CAAC,EACZ,MAAO,GAIX,MAAO,EACR,CACP,CACA,CAQE,SAASqV,EAAa5C,EAAQ,CAC5B,IAAI2C,EAAOF,EAAOC,EAElB,GAAIJ,EAAatC,CAAM,EAAG,CAExB2C,EAAQE,EAAQ7C,CAAM,EAAE,IAAIwC,CAAW,EACvC,MAAMM,EAAWH,EAAM,OACjBI,EAAWP,EAAYD,EAAKvC,CAAM,CAAC,EAEnCgD,GAAgB,SAAUC,EAAM,CACpC,QAAStV,GAAImV,EAAUnV,GAAIsV,EAAK,OAAQtV,KACtC,GAAI,CAACoV,EAASE,EAAKtV,EAAC,CAAC,EACnB,MAAO,GAIX,MAAO,EACR,EAED,OAAO,SAAkBsV,GAAM,CAC7B,QAAStV,EAAI,EAAGA,EAAIgV,EAAM,OAAQhV,IAChC,GAAI,CAACgV,EAAMhV,CAAC,EAAEsV,GAAKtV,CAAC,CAAC,EACnB,MAAO,GAIX,OAAOqV,GAAcC,EAAI,GAAKA,GAAK,QAAUH,EAAW,CACzD,CACP,KAEM,QAAI9C,EAAO,SAAW,EACb,SAAkBiD,EAAM,CAC7B,OAAOA,EAAK,SAAW,CACxB,EACQjD,EAAO,SAAW,GAC3ByC,EAAQD,EAAYxC,EAAO,CAAC,CAAC,EACtB,SAAkBiD,EAAM,CAC7B,OAAOR,EAAMQ,EAAK,CAAC,CAAC,GAAKA,EAAK,SAAW,CAC1C,GACQjD,EAAO,SAAW,GAC3ByC,EAAQD,EAAYxC,EAAO,CAAC,CAAC,EAC7B0C,EAAQF,EAAYxC,EAAO,CAAC,CAAC,EACtB,SAAkBiD,EAAM,CAC7B,OAAOR,EAAMQ,EAAK,CAAC,CAAC,GAAKP,EAAMO,EAAK,CAAC,CAAC,GAAKA,EAAK,SAAW,CAC5D,IAGDN,EAAQ3C,EAAO,IAAIwC,CAAW,EACvB,SAAkBS,EAAM,CAC7B,QAAStV,GAAI,EAAGA,GAAIgV,EAAM,OAAQhV,KAChC,GAAI,CAACgV,EAAMhV,EAAC,EAAEsV,EAAKtV,EAAC,CAAC,EACnB,MAAO,GAIX,OAAOsV,EAAK,SAAWN,EAAM,MAC9B,EAGT,CAWE,SAAShC,EAAgBX,EAAQ5O,EAAO,CACtC,OAAOA,EAAQ4O,EAAO,OAASA,EAAO5O,CAAK,EAAIkR,EAAatC,CAAM,EAAIuC,EAAKvC,CAAM,EAAI,IACzF,CASE,SAASkD,EAAkBlD,EAAQ5O,EAAO,CACxC,MAAMkQ,EAAQX,EAAgBX,EAAQ5O,CAAK,EAE3C,OAAKkQ,EAIET,EAAaS,CAAK,EAHhB,IAAI,GAIjB,CAQE,SAAS6B,EAAYtR,EAAM,CACzB,OAAOA,EAAK,aAAe,MAAQA,EAAK,aAAe,MAC3D,CAUE,SAASuR,EAAoBC,EAAYjS,EAAO,CAC9C,MAAMkS,EAAU,IAAI,IACpB,OAAAD,EAAW,QAAQxD,GAAa,CAC9B,MAAM0D,EAAWL,EAAkBrD,EAAU,OAAQzO,CAAK,EAC1D,IAAImD,EAEJ,IAAKA,KAAQgP,EACXD,EAAQ,IAAI/O,CAAI,CAExB,CAAK,EACM+O,EAAQ,IAAI,KAAK,EAAI,CAAC,KAAK,EAAI,MAAM,KAAKA,CAAO,CAC5D,CAWE,SAASE,EAAYjP,EAAM0O,EAAMI,EAAY,CAC3C,IAAItY,EAAK0Y,EAET,MAAMC,EAAQnP,GAAQ,UAGtB,IAAIoP,GAAqBN,EACrBjS,EAEJ,IAAKA,EAAQ,EAAGA,EAAQ6R,EAAK,OAAQ7R,IAAS,CAC5C,MAAMwS,GAAmB,CAAE,EAU3B,GATAD,GAAmB,QAAQ9D,IAAa,CACtC,MAAMyB,GAAQX,EAAgBd,GAAU,OAAQzO,CAAK,EAC/CyS,GAAOrB,EAAYlB,EAAK,GAEzBlQ,EAAQyO,GAAU,OAAO,QAAUyC,EAAazC,GAAU,MAAM,IAAMgE,GAAKZ,EAAK7R,CAAK,CAAC,GACzFwS,GAAiB,KAAK/D,EAAS,CAEzC,CAAO,EAEG+D,GAAiB,SAAW,GAI9B,GAFAH,EAAWL,EAAoBO,GAAoBvS,CAAK,EAEpDqS,EAAS,OAAS,EAAG,CACvB,MAAMK,GAAcvE,EAAc0D,EAAK7R,CAAK,CAAC,EAC7C,OAAArG,EAAM,IAAI,UAAU,2CAA6C2Y,EAAQ,eAAiBD,EAAS,KAAK,MAAM,EAAI,aAAeK,GAAY,KAAK,KAAK,EAAI,YAAc1S,EAAQ,GAAG,EACpLrG,EAAI,KAAO,CACT,SAAU,YACV,GAAI2Y,EACJ,MAAAtS,EACA,OAAQ0S,GACR,SAAAL,CACD,EACM1Y,CACjB,OAEQ4Y,GAAqBC,EAExB,CAGD,MAAMG,GAAUJ,GAAmB,IAAI,SAAU9D,GAAW,CAC1D,OAAOyC,EAAazC,GAAU,MAAM,EAAI,IAAWA,GAAU,OAAO,MAC1E,CAAK,EAED,GAAIoD,EAAK,OAAS,KAAK,IAAI,MAAM,KAAMc,EAAO,EAC5C,OAAAN,EAAWL,EAAoBO,GAAoBvS,CAAK,EACxDrG,EAAM,IAAI,UAAU,iCAAmC2Y,EAAQ,eAAiBD,EAAS,KAAK,MAAM,EAAI,YAAcR,EAAK,OAAS,GAAG,EACvIlY,EAAI,KAAO,CACT,SAAU,aACV,GAAI2Y,EACJ,MAAOT,EAAK,OACZ,SAAAQ,CACD,EACM1Y,EAIT,MAAMiZ,EAAY,KAAK,IAAI,MAAM,KAAMD,EAAO,EAE9C,GAAId,EAAK,OAASe,EAChB,OAAAjZ,EAAM,IAAI,UAAU,kCAAoC2Y,EAAQ,eAAiBM,EAAY,aAAef,EAAK,OAAS,GAAG,EAC7HlY,EAAI,KAAO,CACT,SAAU,cACV,GAAI2Y,EACJ,MAAOT,EAAK,OACZ,eAAgBe,CACjB,EACMjZ,EAIT,MAAMkZ,GAAW,CAAE,EAEnB,QAAStW,GAAI,EAAGA,GAAIsV,EAAK,OAAQ,EAAEtV,GACjCsW,GAAS,KAAK1E,EAAc0D,EAAKtV,EAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAGhD,OAAA5C,EAAM,IAAI,UAAU,sBAAwBkZ,GAAS,KAAK,IAAI,EAAI,4DAA8DP,EAAQ,GAAG,EAC3I3Y,EAAI,KAAO,CACT,SAAU,WACV,OAAQkZ,EACT,EACMlZ,CACX,CAQE,SAASmZ,EAAmB5C,EAAO,CACjC,IAAI7R,EAAMgP,EAAS,OAAS,EAE5B,QAAS9Q,EAAI,EAAGA,EAAI2T,EAAM,MAAM,OAAQ3T,IAClCwV,EAAY7B,EAAM,MAAM3T,CAAC,CAAC,IAC5B8B,EAAM,KAAK,IAAIA,EAAK6R,EAAM,MAAM3T,CAAC,EAAE,SAAS,GAIhD,OAAO8B,CACX,CASE,SAAS0U,EAAyB7C,EAAO,CACvC,IAAI7R,EAAMiP,EAAe,EAEzB,QAAS/Q,EAAI,EAAGA,EAAI2T,EAAM,MAAM,OAAQ3T,IACjCwV,EAAY7B,EAAM,MAAM3T,CAAC,CAAC,IAC7B8B,EAAM,KAAK,IAAIA,EAAK6R,EAAM,MAAM3T,CAAC,EAAE,eAAe,GAItD,OAAO8B,CACX,CAWE,SAAS2U,EAAcC,EAAQC,EAAQ,CAGrC,GAAID,EAAO,QACT,GAAI,CAACC,EAAO,OACV,MAAO,WAEAA,EAAO,OAChB,MAAO,GAIT,GAAID,EAAO,WACT,GAAI,CAACC,EAAO,UACV,MAAO,WAEAA,EAAO,UAChB,MAAO,GAIT,GAAID,EAAO,eACT,GAAI,CAACC,EAAO,cACV,MAAO,WAEAA,EAAO,cAChB,MAAO,GAIT,MAAMC,EAAWL,EAAmBG,CAAM,EAAIH,EAAmBI,CAAM,EAEvE,GAAIC,EAAW,EACb,MAAO,GAGT,GAAIA,EAAW,EACb,MAAO,GAIT,MAAMC,EAAWL,EAAyBE,CAAM,EAAIF,EAAyBG,CAAM,EAEnF,OAAIE,EAAW,EACN,GAGLA,EAAW,EACN,EAIF,CACX,CAWE,SAASC,EAAkBC,EAAYC,EAAY,CACjD,MAAMC,EAAQF,EAAW,OACnBG,EAAQF,EAAW,OACnBG,EAAQvC,EAAKqC,CAAK,EAClBG,EAAQxC,EAAKsC,CAAK,EAClBG,GAAW1C,EAAasC,CAAK,EAC7BK,EAAW3C,EAAauC,CAAK,EAGnC,GAAIG,IAAYF,EAAM,QACpB,GAAI,CAACG,GAAY,CAACF,EAAM,OACtB,MAAO,WAEAE,GAAYF,EAAM,OAC3B,MAAO,GAIT,IAAIG,GAAO,EACPC,EAAQ,EACRC,GAEJ,IAAKA,MAAOR,EACNQ,GAAI,QAAQ,EAAEF,GACdE,GAAI,eAAe,EAAED,EAG3B,IAAIE,GAAO,EACPC,GAAQ,EAEZ,IAAKF,MAAOP,EACNO,GAAI,QAAQ,EAAEC,GACdD,GAAI,eAAe,EAAEE,GAG3B,GAAIJ,KAASG,GACX,OAAOH,GAAOG,GAIhB,GAAIL,IAAYF,EAAM,eACpB,GAAI,CAACG,GAAY,CAACF,EAAM,cACtB,MAAO,WAEAE,GAAYF,EAAM,cAC3B,MAAO,GAIT,GAAII,IAAUG,GACZ,OAAOH,EAAQG,GAIjB,GAAIN,IACF,GAAI,CAACC,EACH,MAAO,WAEAA,EACT,MAAO,GAIT,MAAMM,IAAmBX,EAAM,OAASC,EAAM,SAAWG,GAAW,GAAK,GAEzE,GAAIO,KAAoB,EACtB,OAAOA,GAOT,MAAMC,GAAc,CAAE,EACtB,IAAIC,GAAK,EAET,QAAS9X,GAAI,EAAGA,GAAIiX,EAAM,OAAQ,EAAEjX,GAAG,CACrC,MAAM+X,GAAiBtB,EAAcQ,EAAMjX,EAAC,EAAGkX,EAAMlX,EAAC,CAAC,EACvD6X,GAAY,KAAKE,EAAc,EAC/BD,IAAMC,EACZ,CAEI,GAAID,KAAO,EACT,OAAOA,GAOT,IAAIE,GAEJ,IAAKA,MAAKH,GACR,GAAIG,KAAM,EACR,OAAOA,GAKX,MAAO,EACX,CAWE,SAAS5D,EAAqBF,EAAW,CACvC,GAAIA,EAAU,SAAW,EACvB,MAAO,CAAE,EAGX,MAAM7C,EAAQ6C,EAAU,IAAIjD,CAAQ,EAEhCiD,EAAU,OAAS,GACrB7C,EAAM,KAAK,CAAC4G,EAAIC,IAAOD,EAAG,MAAQC,EAAG,KAAK,EAG5C,IAAIrG,EAAUR,EAAM,CAAC,EAAE,cAEvB,GAAI6C,EAAU,SAAW,EACvB,OAAOrC,EAGTA,EAAUA,EAAQ,OAAO,EAAE,EAI3B,MAAMsG,EAAa,IAAI,IAAIjE,CAAS,EAEpC,QAASlU,EAAI,EAAGA,EAAIqR,EAAM,OAAQ,EAAErR,EAAG,CACrC,IAAIoY,EAEJ,IAAKA,KAAY/G,EAAMrR,CAAC,EAAE,cACnBmY,EAAW,IAAIC,EAAS,IAAI,IAC/BvG,EAAQ,KAAKuG,CAAQ,EACrBD,EAAW,IAAIC,EAAS,IAAI,EAGtC,CAEI,OAAOvG,CACX,CAWE,SAASwG,EAAyBhG,EAAQJ,EAAI,CAC5C,IAAIqG,EAAYrG,EAEhB,GAAII,EAAO,KAAKoB,GAAKA,EAAE,aAAa,EAAG,CACrC,MAAMG,EAAYe,EAAatC,CAAM,EAC/BkG,EAAsBlG,EAAO,IAAImG,CAAoB,EAE3DF,EAAY,UAAuB,CACjC,MAAMhD,EAAO,CAAE,EACTV,GAAOhB,EAAY,UAAU,OAAS,EAAI,UAAU,OAE1D,QAAS5T,EAAI,EAAGA,EAAI4U,GAAM5U,IACxBsV,EAAKtV,CAAC,EAAIuY,EAAoBvY,CAAC,EAAE,UAAUA,CAAC,CAAC,EAG/C,OAAI4T,IACF0B,EAAKV,EAAI,EAAI,UAAUA,EAAI,EAAE,IAAI2D,EAAoB3D,EAAI,CAAC,GAGrD3C,EAAG,MAAM,KAAMqD,CAAI,CAC3B,CACP,CAEI,IAAImD,EAAeH,EAEnB,GAAI3D,EAAatC,CAAM,EAAG,CACxB,MAAM3M,EAAS2M,EAAO,OAAS,EAE/BoG,EAAe,UAAgC,CAC7C,OAAOH,EAAU,MAAM,KAAMI,EAAM,UAAW,EAAGhT,CAAM,EAAE,OAAO,CAACgT,EAAM,UAAWhT,CAAM,CAAC,CAAC,CAAC,CAC5F,CACP,CAEI,OAAO+S,CACX,CASE,SAASD,EAAqB7E,EAAO,CACnC,IAAImB,EAAOC,EAAO4D,EAAaC,EAC/B,MAAM5D,EAAQ,CAAE,EACVzB,GAAc,CAAE,EAQtB,OAPAI,EAAM,MAAM,QAAQ,SAAUzP,EAAM,CAC9BA,EAAK,aACP8Q,EAAM,KAAK/D,EAAS/M,EAAK,WAAW,IAAI,EAAE,IAAI,EAC9CqP,GAAY,KAAKrP,EAAK,WAAW,OAAO,EAEhD,CAAK,EAEOqP,GAAY,OAAM,CACxB,IAAK,GACH,OAAO,SAAoBsF,GAAK,CAC9B,OAAOA,EACR,EAEH,IAAK,GACH,OAAA/D,EAAQE,EAAM,CAAC,EACf2D,EAAcpF,GAAY,CAAC,EACpB,SAAoBsF,GAAK,CAC9B,OAAI/D,EAAM+D,EAAG,EACJF,EAAYE,EAAG,EAGjBA,EACR,EAEH,IAAK,GACH,OAAA/D,EAAQE,EAAM,CAAC,EACfD,EAAQC,EAAM,CAAC,EACf2D,EAAcpF,GAAY,CAAC,EAC3BqF,EAAcrF,GAAY,CAAC,EACpB,SAAoBsF,GAAK,CAC9B,OAAI/D,EAAM+D,EAAG,EACJF,EAAYE,EAAG,EAGpB9D,EAAM8D,EAAG,EACJD,EAAYC,EAAG,EAGjBA,EACR,EAEH,QACE,OAAO,SAAoBA,GAAK,CAC9B,QAAS7Y,EAAI,EAAGA,EAAIuT,GAAY,OAAQvT,IACtC,GAAIgV,EAAMhV,CAAC,EAAE6Y,EAAG,EACd,OAAOtF,GAAYvT,CAAC,EAAE6Y,EAAG,EAI7B,OAAOA,EACR,CACT,CACA,CAoBE,SAASC,GAAYzG,EAAQ,CAC3B,SAAS0G,EAAa1G,EAAQ5O,EAAOuV,EAAa,CAChD,GAAIvV,EAAQ4O,EAAO,OAAQ,CACzB,MAAMsB,EAAQtB,EAAO5O,CAAK,EAC1B,IAAIwV,GAAkB,CAAE,EAExB,GAAItF,EAAM,UAAW,CAGnB,MAAMuF,EAAavF,EAAM,MAAM,OAAO6B,CAAW,EAE7C0D,EAAW,OAASvF,EAAM,MAAM,QAClCsF,GAAgB,KAAK,CACnB,MAAOC,EACP,KAAM,MAAQA,EAAW,IAAIzM,IAAKA,GAAE,IAAI,EAAE,KAAK,GAAG,EAClD,OAAQyM,EAAW,KAAKzM,IAAKA,GAAE,KAAK,EACpC,cAAe,GACf,UAAW,EACzB,CAAa,EAGHwM,GAAgB,KAAKtF,CAAK,CACpC,MAEUsF,GAAkBtF,EAAM,MAAM,IAAI,SAAUzP,EAAM,CAChD,MAAO,CACL,MAAO,CAACA,CAAI,EACZ,KAAMA,EAAK,KACX,OAAQA,EAAK,MACb,cAAeA,EAAK,WACpB,UAAW,EACZ,CACb,CAAW,EAIH,OAAOiV,EAAQF,GAAiB,SAAUG,EAAW,CACnD,OAAOL,EAAa1G,EAAQ5O,EAAQ,EAAGuV,EAAY,OAAO,CAACI,CAAS,CAAC,CAAC,CAChF,CAAS,CACT,KAEQ,OAAO,CAACJ,CAAW,CAE3B,CAEI,OAAOD,EAAa1G,EAAQ,EAAG,EAAE,CACrC,CASE,SAASgH,GAAYC,EAASC,EAAS,CACrC,MAAMC,EAAK,KAAK,IAAIF,EAAQ,OAAQC,EAAQ,MAAM,EAElD,QAASvZ,EAAI,EAAGA,EAAIwZ,EAAIxZ,IAAK,CAC3B,MAAMyZ,GAAWlE,EAAkB+D,EAAStZ,CAAC,EACvC0Z,EAAWnE,EAAkBgE,EAASvZ,CAAC,EAC7C,IAAI2Z,GAAU,GACV/S,GAEJ,IAAKA,MAAQ8S,EACX,GAAID,GAAS,IAAI7S,EAAI,EAAG,CACtB+S,GAAU,GACV,KACV,CAGM,GAAI,CAACA,GACH,MAAO,EAEf,CAEI,MAAMC,EAAON,EAAQ,OACfO,EAAON,EAAQ,OACfO,EAAanF,EAAa2E,CAAO,EACjCS,GAAapF,EAAa4E,CAAO,EACvC,OAAOO,EAAaC,GAAaH,IAASC,EAAOA,GAAQD,EAAOG,GAAaH,GAAQC,EAAOD,IAASC,CACzG,CAWE,SAASG,EAAiBC,EAAc,CACtC,OAAOA,EAAa,IAAIhI,GAClBiI,GAAcjI,CAAE,EACXkI,GAAYlI,EAAG,YAAY,QAAQ,EAGxCmI,GAAUnI,CAAE,EACPoI,GAAYpI,EAAG,QAAQ,WAAYA,EAAG,QAAQ,QAAQ,EAGxDA,CACR,CACL,CAcE,SAASqI,EAAmBC,EAAYN,EAAcO,EAAc,CAClE,MAAMC,EAAqB,CAAE,EAC7B,IAAIC,EAEJ,IAAKA,KAAaH,EAAY,CAC5B,IAAII,EAAaH,EAAaE,CAAS,EAEvC,GAAI,OAAOC,GAAe,SACxB,MAAM,IAAI,UAAU,2CAA6CD,EAAY,GAAG,EAKlF,GAFAC,EAAaV,EAAaU,CAAU,EAEhC,OAAOA,GAAe,WACxB,MAAO,GAGTF,EAAmB,KAAKE,CAAU,CACxC,CAEI,OAAOF,CACX,CAcE,SAASG,EAAkBX,EAAcO,EAAcvb,EAAM,CAC3D,MAAM4b,EAAoBb,EAAiBC,CAAY,EACjDa,EAAa,IAAI,MAAMD,EAAkB,MAAM,EAAE,KAAK,EAAK,EACjE,IAAIE,EAAiB,GAErB,KAAOA,GAAgB,CACrBA,EAAiB,GACjB,IAAIC,GAAkB,GAEtB,QAAShb,EAAI,EAAGA,EAAI6a,EAAkB,OAAQ,EAAE7a,EAAG,CACjD,GAAI8a,EAAW9a,CAAC,EAAG,SACnB,MAAMiS,GAAK4I,EAAkB7a,CAAC,EAE9B,GAAIka,GAAcjI,EAAE,EAClB4I,EAAkB7a,CAAC,EAAIiS,GAAG,YAAY,SAAShT,CAAI,EAEnD4b,EAAkB7a,CAAC,EAAE,YAAciS,GAAG,YACtC6I,EAAW9a,CAAC,EAAI,GAChBgb,GAAkB,WACTZ,GAAUnI,EAAE,EAAG,CACxB,MAAMwI,EAAqBH,EAAmBrI,GAAG,QAAQ,WAAY4I,EAAmBL,CAAY,EAEhGC,GACFI,EAAkB7a,CAAC,EAAIiS,GAAG,QAAQ,SAAS,MAAM,KAAMwI,CAAkB,EAEzEI,EAAkB7a,CAAC,EAAE,QAAUiS,GAAG,QAClC6I,EAAW9a,CAAC,EAAI,GAChBgb,GAAkB,IAElBD,EAAiB,EAE7B,CACA,CAEM,GAAIC,IAAmBD,EACrB,MAAM,IAAI,YAAY,wDAAwD,CAEtF,CAEI,OAAOF,CACX,CAUE,SAASI,GAAuBC,EAAe,CAG7C,MAAMC,EAAsB,4BAC5B,OAAO,KAAKD,CAAa,EAAE,QAAQhJ,GAAa,CAC9C,MAAMD,EAAKiJ,EAAchJ,CAAS,EAElC,GAAIiJ,EAAoB,KAAKlJ,EAAG,SAAU,GACxC,MAAM,IAAI,YAAY,kIAA4I,CAE1K,CAAK,CACL,CAaE,SAASmJ,EAAoBxU,EAAMyU,EAAkB,CAGnD,GAFArK,EAAM,cAEF,OAAO,KAAKqK,CAAgB,EAAE,SAAW,EAC3C,MAAM,IAAI,YAAY,wBAAwB,EAG5CrK,EAAM,2BACRiK,GAAuBI,CAAgB,EAIzC,MAAMC,EAAe,CAAE,EACjBC,EAAoB,CAAE,EACtBL,EAAgB,CAAE,EAClBM,EAAwB,GAE9B,IAAItJ,GAEJ,IAAKA,MAAamJ,EAAkB,CAElC,GAAI,CAAC,OAAO,UAAU,eAAe,KAAKA,EAAkBnJ,EAAS,EACnE,SAIF,MAAMG,GAASC,EAAeJ,EAAS,EACvC,GAAI,CAACG,GAAQ,SAEbiJ,EAAa,QAAQ,SAAUG,GAAI,CACjC,GAAIpC,GAAYoC,GAAIpJ,EAAM,EACxB,MAAM,IAAI,UAAU,2BAA6BG,EAAgBiJ,EAAE,EAAI,UAAYjJ,EAAgBH,EAAM,EAAI,IAAI,CAE3H,CAAO,EACDiJ,EAAa,KAAKjJ,EAAM,EAExB,MAAMqJ,GAAgBH,EAAkB,OACxCA,EAAkB,KAAKF,EAAiBnJ,EAAS,CAAC,EAClD,MAAMyJ,GAAmBtJ,GAAO,IAAI4B,CAAW,EAE/C,IAAI2H,GAEJ,IAAKA,MAAM9C,GAAY6C,EAAgB,EAAG,CACxC,MAAME,GAASrJ,EAAgBoJ,EAAE,EACjCJ,EAAsB,KAAK,CACzB,OAAQI,GACR,KAAMC,GACN,GAAIH,EACd,CAAS,EAEGE,GAAG,MAAMnI,IAAK,CAACA,GAAE,aAAa,IAChCyH,EAAcW,EAAM,EAAIH,GAElC,CACA,CAEIF,EAAsB,KAAK1E,CAAiB,EAE5C,MAAM+D,EAAoBD,EAAkBW,EAAmBL,EAAeY,EAAU,EAExF,IAAIhI,GAEJ,IAAKA,MAAKoH,EACJ,OAAO,UAAU,eAAe,KAAKA,EAAepH,EAAC,IACvDoH,EAAcpH,EAAC,EAAI+G,EAAkBK,EAAcpH,EAAC,CAAC,GAIzD,MAAM4B,EAAa,CAAE,EACfqG,GAAuB,IAAI,IAEjC,IAAKjI,MAAK0H,EAIHO,GAAqB,IAAIjI,GAAE,IAAI,IAClCA,GAAE,GAAK+G,EAAkB/G,GAAE,EAAE,EAC7B4B,EAAW,KAAK5B,EAAC,EACjBiI,GAAqB,IAAIjI,GAAE,KAAMA,EAAC,GAKtC,MAAMkI,GAAMtG,EAAW,CAAC,GAAKA,EAAW,CAAC,EAAE,OAAO,QAAU,GAAK,CAACf,EAAae,EAAW,CAAC,EAAE,MAAM,EAC7FuG,GAAMvG,EAAW,CAAC,GAAKA,EAAW,CAAC,EAAE,OAAO,QAAU,GAAK,CAACf,EAAae,EAAW,CAAC,EAAE,MAAM,EAC7FwG,GAAMxG,EAAW,CAAC,GAAKA,EAAW,CAAC,EAAE,OAAO,QAAU,GAAK,CAACf,EAAae,EAAW,CAAC,EAAE,MAAM,EAC7FyG,GAAMzG,EAAW,CAAC,GAAKA,EAAW,CAAC,EAAE,OAAO,QAAU,GAAK,CAACf,EAAae,EAAW,CAAC,EAAE,MAAM,EAC7F0G,GAAM1G,EAAW,CAAC,GAAKA,EAAW,CAAC,EAAE,OAAO,QAAU,GAAK,CAACf,EAAae,EAAW,CAAC,EAAE,MAAM,EAC7F2G,GAAM3G,EAAW,CAAC,GAAKA,EAAW,CAAC,EAAE,OAAO,QAAU,GAAK,CAACf,EAAae,EAAW,CAAC,EAAE,MAAM,EAC7F4G,GAAQN,IAAOC,IAAOC,IAAOC,IAAOC,IAAOC,GAEjD,QAASrc,GAAI,EAAGA,GAAI0V,EAAW,OAAQ,EAAE1V,GACvC0V,EAAW1V,EAAC,EAAE,KAAOiV,EAAaS,EAAW1V,EAAC,EAAE,MAAM,EAGxD,MAAMuc,GAASP,GAAMnH,EAAYa,EAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAIpF,GACtDkM,GAASP,GAAMpH,EAAYa,EAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAIpF,GACtDmM,GAASP,GAAMrH,EAAYa,EAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAIpF,GACtDoM,GAASP,GAAMtH,EAAYa,EAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAIpF,GACtDqM,GAASP,GAAMvH,EAAYa,EAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAIpF,GACtDsM,GAASP,GAAMxH,EAAYa,EAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAIpF,GACtDuM,GAASb,GAAMnH,EAAYa,EAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAIpF,GACtDwM,GAASb,GAAMpH,EAAYa,EAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAIpF,GACtDyM,GAASb,GAAMrH,EAAYa,EAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAIpF,GACtD0M,GAASb,GAAMtH,EAAYa,EAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAIpF,GACtD2M,GAASb,GAAMvH,EAAYa,EAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAIpF,GACtD4M,GAASb,GAAMxH,EAAYa,EAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAIpF,GAE5D,QAAStQ,GAAI,EAAGA,GAAI0V,EAAW,OAAQ,EAAE1V,GACvC0V,EAAW1V,EAAC,EAAE,eAAiBqY,EAAyB3C,EAAW1V,EAAC,EAAE,OAAQ0V,EAAW1V,EAAC,EAAE,EAAE,EAGhG,MAAMmd,GAAMnB,GAAMtG,EAAW,CAAC,EAAE,eAAiBnF,GAC3C6M,GAAMnB,GAAMvG,EAAW,CAAC,EAAE,eAAiBnF,GAC3C8M,GAAMnB,GAAMxG,EAAW,CAAC,EAAE,eAAiBnF,GAC3C+M,GAAMnB,GAAMzG,EAAW,CAAC,EAAE,eAAiBnF,GAC3CgN,GAAMnB,GAAM1G,EAAW,CAAC,EAAE,eAAiBnF,GAC3CiN,GAAMnB,GAAM3G,EAAW,CAAC,EAAE,eAAiBnF,GAC3CkN,GAAOzB,GAAMtG,EAAW,CAAC,EAAE,OAAO,OAAS,GAC3CkE,GAAOqC,GAAMvG,EAAW,CAAC,EAAE,OAAO,OAAS,GAC3CmE,GAAOqC,GAAMxG,EAAW,CAAC,EAAE,OAAO,OAAS,GAC3CgI,GAAOvB,GAAMzG,EAAW,CAAC,EAAE,OAAO,OAAS,GAC3CiI,GAAOvB,GAAM1G,EAAW,CAAC,EAAE,OAAO,OAAS,GAC3CkI,GAAOvB,GAAM3G,EAAW,CAAC,EAAE,OAAO,OAAS,GAE3CmI,GAASvB,GAAQ,EAAI,EACrBwB,GAAOpI,EAAW,OAElBV,GAAQU,EAAW,IAAI5B,IAAKA,GAAE,IAAI,EAClCiK,GAAMrI,EAAW,IAAI5B,IAAKA,GAAE,cAAc,EAE1CkK,GAAU,UAAmB,CAGjC,QAAShe,GAAI6d,GAAQ7d,GAAI8d,GAAM9d,KAC7B,GAAIgV,GAAMhV,EAAC,EAAE,SAAS,EACpB,OAAO+d,GAAI/d,EAAC,EAAE,MAAM,KAAM,SAAS,EAIvC,OAAOgR,EAAM,WAAWpK,EAAM,UAAW8O,CAAU,CACzD,EAII,SAASoG,GAAWmC,GAAMC,GAAM,CAG9B,OAAI,UAAU,SAAWT,IAAQlB,GAAO0B,EAAI,GAAKpB,GAAOqB,EAAI,EACnDf,GAAI,MAAM,KAAM,SAAS,EAG9B,UAAU,SAAWvD,IAAQ4C,GAAOyB,EAAI,GAAKnB,GAAOoB,EAAI,EACnDd,GAAI,MAAM,KAAM,SAAS,EAG9B,UAAU,SAAWvD,IAAQ4C,GAAOwB,EAAI,GAAKlB,GAAOmB,EAAI,EACnDb,GAAI,MAAM,KAAM,SAAS,EAG9B,UAAU,SAAWK,IAAQhB,GAAOuB,EAAI,GAAKjB,GAAOkB,EAAI,EACnDZ,GAAI,MAAM,KAAM,SAAS,EAG9B,UAAU,SAAWK,IAAQhB,GAAOsB,EAAI,GAAKhB,GAAOiB,EAAI,EACnDX,GAAI,MAAM,KAAM,SAAS,EAG9B,UAAU,SAAWK,IAAQhB,GAAOqB,EAAI,GAAKf,GAAOgB,EAAI,EACnDV,GAAI,MAAM,KAAM,SAAS,EAG3BQ,GAAQ,MAAM,KAAM,SAAS,CACrC,CAGD,GAAI,CACF,OAAO,eAAelC,GAAY,OAAQ,CACxC,MAAOlV,CACf,CAAO,CACF,OAAQxJ,GAAK,CAGb,CAKD,OAAA0e,GAAW,WAAaZ,EAGxBY,GAAW,mBAAqB,CAC9B,WAAApG,EACA,aAAcqG,EACf,EACMD,EACX,CASE,SAASqC,EAAYvX,EAAM0O,EAAMI,EAAY,CAC3C,MAAMG,EAAYjP,EAAM0O,EAAMI,CAAU,CAC5C,CAQE,SAASR,EAAQkJ,EAAK,CACpB,OAAO1F,EAAM0F,EAAK,EAAGA,EAAI,OAAS,CAAC,CACvC,CAQE,SAASxJ,EAAKwJ,EAAK,CACjB,OAAOA,EAAIA,EAAI,OAAS,CAAC,CAC7B,CAUE,SAAS1F,EAAM0F,EAAKnW,EAAOC,EAAK,CAC9B,OAAO,MAAM,UAAU,MAAM,KAAKkW,EAAKnW,EAAOC,CAAG,CACrD,CAUE,SAASmW,GAAYD,EAAKlI,EAAM,CAC9B,QAASlW,EAAI,EAAGA,EAAIoe,EAAI,OAAQpe,IAC9B,GAAIkW,EAAKkI,EAAIpe,CAAC,CAAC,EACb,OAAOoe,EAAIpe,CAAC,CAKpB,CAUE,SAASmZ,EAAQiF,EAAKnZ,EAAU,CAC9B,OAAO,MAAM,UAAU,OAAO,MAAM,GAAImZ,EAAI,IAAInZ,CAAQ,CAAC,CAC7D,CAcE,SAASqZ,IAAU,CACjB,MAAM/D,EAAarF,EAAQ,SAAS,EAAE,IAAIpB,GAAKtB,EAAgBF,EAAewB,CAAC,CAAC,CAAC,EAC3E7O,EAAW2P,EAAK,SAAS,EAE/B,GAAI,OAAO3P,GAAa,WACtB,MAAM,IAAI,UAAU,6CAA6C,EAGnE,OAAOoV,GAAYE,EAAYtV,CAAQ,CAC3C,CAEE,SAASoV,GAAYE,EAAYtV,EAAU,CACzC,MAAO,CACL,QAAS,CACP,WAAAsV,EACA,SAAAtV,CACR,CACK,CACL,CASE,SAASkV,GAAYlV,EAAU,CAC7B,GAAI,OAAOA,GAAa,WACtB,MAAM,IAAI,UAAU,8CAA8C,EAGpE,MAAO,CACL,YAAa,CACX,SAAAA,CACR,CACK,CACL,CAUE,SAASmV,GAAUmE,EAAY,CAC7B,OAAOA,GAAc,OAAOA,EAAW,SAAY,UAAY,MAAM,QAAQA,EAAW,QAAQ,UAAU,GAAK,OAAOA,EAAW,QAAQ,UAAa,UAC1J,CAUE,SAASrE,GAAcqE,EAAY,CACjC,OAAOA,GAAc,OAAOA,EAAW,aAAgB,UAAY,OAAOA,EAAW,YAAY,UAAa,UAClH,CAWE,SAASC,GAAUC,EAAWpK,EAAS,CACrC,GAAI,CAACoK,EACH,OAAOpK,EAGT,GAAIA,GAAWA,IAAYoK,EAAW,CACpC,MAAMrhB,EAAM,IAAI,MAAM,0CAA4CqhB,EAAY,aAAepK,EAAU,GAAG,EAC1G,MAAAjX,EAAI,KAAO,CACT,OAAQiX,EACR,SAAUoK,CACX,EACKrhB,CACZ,CAEI,OAAOqhB,CACX,CASE,SAASC,GAAcC,EAAK,CAC1B,IAAI/X,EAEJ,UAAWvD,KAAOsb,EAGZ,OAAO,UAAU,eAAe,KAAKA,EAAKtb,CAAG,IAAMyO,EAAgB6M,EAAItb,CAAG,CAAC,GAAK,OAAOsb,EAAItb,CAAG,EAAE,WAAc,YAChHuD,EAAO4X,GAAU5X,EAAM+X,EAAItb,CAAG,EAAE,IAAI,GAIxC,OAAOuD,CACX,CAUE,SAASgY,GAAgBC,EAAMC,EAAQ,CACrC,IAAIzb,EAEJ,IAAKA,KAAOyb,EACV,GAAI,OAAO,UAAU,eAAe,KAAKA,EAAQzb,CAAG,EAAG,CACrD,GAAIA,KAAOwb,GACLC,EAAOzb,CAAG,IAAMwb,EAAKxb,CAAG,EAAG,CAC7B,MAAMjG,EAAM,IAAI,MAAM,cAAgBiG,EAAM,oBAAoB,EAChE,MAAAjG,EAAI,KAAO,CACT,UAAWiG,EACX,eAAgByb,EAAOzb,CAAG,EAC1B,aAAcwb,EAAKxb,CAAG,CACvB,EACKjG,CACP,CAIHyhB,EAAKxb,CAAG,EAAIyb,EAAOzb,CAAG,CAC9B,CAEA,CAEE,MAAM0b,GAAY/N,EAwBlBA,EAAQ,SAAUgO,EAAW,CAC3B,MAAMC,EAAQ,OAAOD,GAAc,SAC7B/W,EAAQgX,EAAQ,EAAI,EAC1B,IAAIrY,EAAOqY,EAAQD,EAAY,GAC/B,MAAME,EAAgB,CAAE,EAExB,QAASlf,EAAIiI,EAAOjI,EAAI,UAAU,OAAQ,EAAEA,EAAG,CAC7C,MAAMyH,GAAO,UAAUzH,CAAC,EACxB,IAAImf,EAAkB,CAAE,EACpBC,GAqBJ,GAnBI,OAAO3X,IAAS,YAClB2X,GAAW3X,GAAK,KAEZ,OAAOA,GAAK,WAAc,SAE5B0X,EAAgB1X,GAAK,SAAS,EAAIA,GACzBqK,EAAgBrK,EAAI,IAE7B0X,EAAkB1X,GAAK,aAEhBiJ,EAAcjJ,EAAI,IAE3B0X,EAAkB1X,GAEbwX,IACHG,GAAWV,GAAcjX,EAAI,IAI7B,OAAO,KAAK0X,CAAe,EAAE,SAAW,EAAG,CAC7C,MAAM/hB,EAAM,IAAI,UAAU,gCAAoC4C,EAAI,4FAAiG,EACnK,MAAA5C,EAAI,KAAO,CACT,MAAO4C,EACP,SAAUyH,EACX,EACKrK,CACd,CAEW6hB,IACHrY,EAAO4X,GAAU5X,EAAMwY,EAAQ,GAGjCR,GAAgBM,EAAeC,CAAe,CACpD,CAEI,OAAO/D,EAAoBxU,GAAQ,GAAIsY,CAAa,CACrD,EAEDlO,EAAM,OAASP,GACfO,EAAM,YAAc+N,GAAU,YAC9B/N,EAAM,WAAamN,EACnBnN,EAAM,mBAAqBmN,EAC3BnN,EAAM,YAAc6E,EACpB7E,EAAM,MAAQU,EACdV,EAAM,iBAAmBW,EACzBX,EAAM,SAAWI,EACjBJ,EAAM,UAAYC,EAElBD,EAAM,QAAUsN,GAChBtN,EAAM,YAAcmJ,GACpBnJ,EAAM,QAAUsC,EAChBtC,EAAM,cAAgBgB,EACtBhB,EAAM,KAAOqC,EACbrC,EAAM,gBAAkBc,EACxBd,EAAM,0BAA4B,GAUlCA,EAAM,QAAU,SAAU9M,EAAMmb,EAAkB,CAChD,IAAIC,EAAS,MAETD,IAAqB,IAASxO,EAAQ,IAAI,QAAQ,IACpDyO,EAAS,UAGXtO,EAAM,SAAS,CAAC9M,CAAI,EAAGob,CAAM,CAC9B,EAUD,SAASC,GAAoBhL,EAAY,CACvC,GAAI,CAACA,GAAc,OAAOA,EAAW,MAAS,UAAY,OAAOA,EAAW,IAAO,UAAY,OAAOA,EAAW,SAAY,WAC3H,MAAM,IAAI,UAAU,+EAA+E,EAGrG,GAAIA,EAAW,KAAOA,EAAW,KAC/B,MAAM,IAAI,YAAY,sCAAwCA,EAAW,KAAO,cAAc,CAEpG,CAUE,OAAAvD,EAAM,cAAgB,SAAUuD,EAAY,CAC1CgL,GAAoBhL,CAAU,EAE9B,MAAMiL,EAAKvO,EAASsD,EAAW,EAAE,EAEjC,GAAIiL,EAAG,cAAc,MAAM,SAAUC,EAAO,CAC1C,OAAOA,EAAM,OAASlL,EAAW,IACvC,CAAK,EACCiL,EAAG,cAAc,KAAK,CACpB,KAAMjL,EAAW,KACjB,QAASA,EAAW,QACpB,MAAOxD,GACf,CAAO,MAED,OAAM,IAAI,MAAM,uCAAyCwD,EAAW,KAAO,SAAWiL,EAAG,KAAO,GAAG,CAEtG,EAUDxO,EAAM,eAAiB,SAAUuC,EAAa,CAC5CA,EAAY,QAAQvC,EAAM,aAAa,CACxC,EAYDA,EAAM,iBAAmB,SAAUuD,EAAY,CAC7CgL,GAAoBhL,CAAU,EAE9B,MAAMiL,EAAKvO,EAASsD,EAAW,EAAE,EAC3BmL,EAAqBrB,GAAYmB,EAAG,cAAexH,GAAKA,EAAE,OAASzD,EAAW,IAAI,EAExF,GAAI,CAACmL,EACH,MAAM,IAAI,MAAM,iDAAmDnL,EAAW,KAAO,OAASA,EAAW,EAAE,EAG7G,GAAImL,EAAmB,UAAYnL,EAAW,QAC5C,MAAM,IAAI,MAAM,yDAAyD,EAG3E,MAAM9Q,EAAQ+b,EAAG,cAAc,QAAQE,CAAkB,EACzDF,EAAG,cAAc,OAAO/b,EAAO,CAAC,CACjC,EAaDuN,EAAM,QAAU,SAAU2O,EAAIC,EAAS,CACrC,GAAI,CAAC9N,EAAgB6N,CAAE,EACrB,MAAM,IAAI,UAAUnP,EAAkB,EAGxC,MAAMqP,EAAOF,EAAG,mBAAmB,WAEnC,QAAS3f,EAAI,EAAGA,EAAI6f,EAAK,OAAQ,EAAE7f,EACjC,GAAI6f,EAAK7f,CAAC,EAAE,KAAK4f,CAAO,EACtB,OAAOC,EAAK7f,CAAC,EAIjB,OAAO,IACR,EAEMgR,CACT,CAEA,MAAA8O,GAAerP,GAAQ,EC5jEhB,SAASsP,GAAU7gB,EAAO,CAC/B,OAAI,OAAOA,GAAU,UACZ,GAEF,SAASA,CAAK,EAAIA,IAAU,KAAK,MAAMA,CAAK,EAAI,EACzD,CAOO,IAAI8gB,GAAO,KAAK,MAAQ,SAAUpgB,EAAG,CAC1C,OAAIA,EAAI,EACC,EACEA,EAAI,EACN,GAEA,CAEX,EAyEA,SAASqgB,GAAmBzT,EAAG0T,EAAMhX,EAAM,CACzC,IAAIiX,EAAW,CACb,EAAG,KACH,EAAG,KACH,GAAI,IACL,EACGC,EAASD,EAASD,CAAI,EACtBG,EAAS,GACb,GAAInX,EAAM,CACR,GAAIA,EAAO,EACT,MAAM,IAAI,MAAM,gCAAgC,EAElD,GAAI,CAAC6W,GAAU7W,CAAI,EACjB,MAAM,IAAI,MAAM,yBAAyB,EAE3C,GAAIsD,EAAI8T,GAAA,EAAMpX,EAAO,GAAK,GAAKsD,EAAI,CAAE8T,GAAA,EAAMpX,EAAO,GAChD,MAAM,IAAI,MAAM,8BAA8B,OAAOA,EAAO,EAAG,MAAM,EAAE,OAAOA,EAAO,EAAG,KAAK,CAAC,EAEhG,GAAI,CAAC6W,GAAUvT,CAAC,EACd,MAAM,IAAI,MAAM,0BAA0B,EAExCA,EAAI,IACNA,EAAIA,EAAI8T,GAAA,EAAKpX,IAEfmX,EAAS,IAAI,OAAOnX,CAAI,CAC5B,CACE,IAAI8W,EAAO,GACX,OAAIxT,EAAI,IACNA,EAAI,CAACA,EACLwT,EAAO,KAEF,GAAG,OAAOA,CAAI,EAAE,OAAOI,CAAM,EAAE,OAAO5T,EAAE,SAAS0T,CAAI,CAAC,EAAE,OAAOG,CAAM,CAC9E,CAsFO,SAASE,GAAOrhB,EAAOC,EAAS,CACrC,GAAI,OAAOA,GAAY,WAErB,OAAOA,EAAQD,CAAK,EAItB,GAAIA,IAAU,IACZ,MAAO,WACF,GAAIA,IAAU,KACnB,MAAO,YACF,GAAI,MAAMA,CAAK,EACpB,MAAO,MAET,GAAI,CACF,SAAAshB,EACA,UAAAC,EACA,SAAAC,CACJ,EAAMC,GAAuBxhB,CAAO,EAGlC,OAAQqhB,EAAQ,CACd,IAAK,QACH,OAAOI,GAAQ1hB,EAAOuhB,CAAS,EACjC,IAAK,cACH,OAAOI,GAAc3hB,EAAOuhB,CAAS,EACvC,IAAK,cACH,OAAOK,GAAc5hB,EAAOuhB,CAAS,EACvC,IAAK,MACH,OAAOR,GAAmB/gB,EAAO,EAAGwhB,CAAQ,EAC9C,IAAK,MACH,OAAOT,GAAmB/gB,EAAO,EAAGwhB,CAAQ,EAC9C,IAAK,MACH,OAAOT,GAAmB/gB,EAAO,GAAIwhB,CAAQ,EAC/C,IAAK,OAEH,OAAOK,GAAY7hB,EAAOuhB,EAAWthB,CAAO,EAAE,QAAQ,sBAAuB,UAAY,CACvF,IAAI6hB,EAAS,UAAU,CAAC,EACpB/f,EAAI,UAAU,CAAC,EACnB,OAAO+f,IAAW,IAAMA,EAAS/f,EAAIA,CAC7C,CAAO,EACH,QACE,MAAM,IAAI,MAAM,qBAAuBuf,EAAW,kEAAuE,CAC/H,CACA,CAUO,SAASG,GAAuBxhB,EAAS,CAE9C,IAAIqhB,EAAW,OACXC,EACAC,EACJ,GAAIvhB,IAAY,OACd,GAAIyN,GAASzN,CAAO,EAClBshB,EAAYthB,UACH0N,GAAY1N,CAAO,EAC5BshB,EAAYthB,EAAQ,SAAU,UACrB4O,GAAS5O,CAAO,EACrBA,EAAQ,YAAc,SACxBshB,EAAYQ,GAAiB9hB,EAAQ,UAAW,IAAM,CACpD,MAAM,IAAI,MAAM,kDAAkD,CAC5E,CAAS,GAECA,EAAQ,WAAa,SACvBuhB,EAAWO,GAAiB9hB,EAAQ,SAAU,IAAM,CAClD,MAAM,IAAI,MAAM,iDAAiD,CAC3E,CAAS,GAECA,EAAQ,WACVqhB,EAAWrhB,EAAQ,cAGrB,OAAM,IAAI,MAAM,oEAAoE,EAGxF,MAAO,CACL,SAAAqhB,EACA,UAAAC,EACA,SAAAC,CACD,CACH,CAQO,SAASQ,GAAYhiB,EAAO,CAEjC,IAAIuT,EAAQ,OAAOvT,CAAK,EAAE,YAAa,EAAC,MAAM,iCAAiC,EAC/E,GAAI,CAACuT,EACH,MAAM,IAAI,YAAY,kBAAoBvT,CAAK,EAEjD,IAAI8gB,EAAOvN,EAAM,CAAC,EACduO,EAASvO,EAAM,CAAC,EAChB0O,EAAW,WAAW1O,EAAM,CAAC,GAAK,GAAG,EACrC2O,EAAMJ,EAAO,QAAQ,GAAG,EAC5BG,GAAYC,IAAQ,GAAKA,EAAM,EAAIJ,EAAO,OAAS,EACnD,IAAIK,EAAeL,EAAO,QAAQ,IAAK,EAAE,EACxC,QAAQ,MAAO,SAAUM,EAAO,CAE/B,OAAAH,GAAYG,EAAM,OACX,EACX,CAAG,EAAE,QAAQ,MAAO,EAAE,EACnB,MAAM,EAAE,EAAE,IAAI,SAAU,EAAG,CAC1B,OAAO,SAAS,CAAC,CACrB,CAAG,EACD,OAAID,EAAa,SAAW,IAC1BA,EAAa,KAAK,CAAC,EACnBF,KAEK,CACL,KAAAnB,EACA,aAAAqB,EACA,SAAAF,CACD,CACH,CAOO,SAASL,GAAc5hB,EAAOuhB,EAAW,CAC9C,GAAI,MAAMvhB,CAAK,GAAK,CAAC,SAASA,CAAK,EACjC,OAAO,OAAOA,CAAK,EAErB,IAAIqiB,EAAQL,GAAYhiB,CAAK,EACzBsiB,EAAUC,GAAYF,EAAOd,CAAS,EACtCxf,EAAIugB,EAAQ,SACZxJ,EAAIwJ,EAAQ,aAGZE,EAASzgB,EAAI,IAAM,EAAIA,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAIA,EAAI,EAC/D,GAAI2L,GAAS6T,CAAS,EAEpB,KAAOA,EAAYzI,EAAE,QAAU/W,EAAIygB,EAAS,EAAI1J,EAAE,QAChDA,EAAE,KAAK,CAAC,MAMV,SADI2J,EAAe,KAAK,IAAI1gB,EAAIygB,CAAM,GAAK1J,EAAE,OAAS,GAC7ChY,EAAI,EAAGA,EAAI2hB,EAAc3hB,IAChCgY,EAAE,KAAK,CAAC,EASZ,QAJI4J,EAAU,KAAK,IAAI3gB,EAAIygB,CAAM,EAC7BG,EAAa,EAGVD,EAAU,GACfC,IACAD,IAKF,IAAIjX,EAAWqN,EAAE,MAAM6J,CAAU,EAAE,KAAK,EAAE,EACtCC,EAAalV,GAAS6T,CAAS,GAAK9V,EAAS,QAAUA,EAAS,MAAM,OAAO,EAAI,IAAMA,EAAW,GAClGoX,EAAM/J,EAAE,MAAM,EAAG6J,CAAU,EAAE,KAAK,EAAE,EAAIC,EAAa,KAAO7gB,GAAK,EAAI,IAAM,IAAMygB,EAAO,SAAU,EACtG,OAAOF,EAAQ,KAAOO,CACxB,CAQO,SAASnB,GAAQ1hB,EAAOuhB,EAAW,CACxC,GAAI,MAAMvhB,CAAK,GAAK,CAAC,SAASA,CAAK,EACjC,OAAO,OAAOA,CAAK,EAErB,IAAI8iB,EAAad,GAAYhiB,CAAK,EAC9BsiB,EAAU,OAAOf,GAAc,SAAWgB,GAAYO,EAAYA,EAAW,SAAW,EAAIvB,CAAS,EAAIuB,EACzGhK,EAAIwJ,EAAQ,aACZ/N,EAAI+N,EAAQ,SAAW,EAGvB/F,EAAKhI,GAAKgN,GAAa,GAC3B,OAAIzI,EAAE,OAASyD,IACbzD,EAAIA,EAAE,OAAOsJ,GAAM7F,EAAKzD,EAAE,MAAM,CAAC,GAI/BvE,EAAI,IACNuE,EAAIsJ,GAAM,CAAC7N,EAAI,CAAC,EAAE,OAAOuE,CAAC,EAC1BvE,EAAI,GAIFA,EAAIuE,EAAE,QACRA,EAAE,OAAOvE,EAAG,EAAGA,IAAM,EAAI,KAAO,GAAG,EAE9B+N,EAAQ,KAAOxJ,EAAE,KAAK,EAAE,CACjC,CASO,SAAS6I,GAAc3hB,EAAOuhB,EAAW,CAC9C,GAAI,MAAMvhB,CAAK,GAAK,CAAC,SAASA,CAAK,EACjC,OAAO,OAAOA,CAAK,EAIrB,IAAIqiB,EAAQL,GAAYhiB,CAAK,EACzBsiB,EAAUf,EAAYgB,GAAYF,EAAOd,CAAS,EAAIc,EACtDvJ,EAAIwJ,EAAQ,aACZvgB,EAAIugB,EAAQ,SAGZxJ,EAAE,OAASyI,IACbzI,EAAIA,EAAE,OAAOsJ,GAAMb,EAAYzI,EAAE,MAAM,CAAC,GAI1C,IAAIiK,EAAQjK,EAAE,MAAO,EACrB,OAAOwJ,EAAQ,KAAOS,GAASjK,EAAE,OAAS,EAAI,IAAMA,EAAE,KAAK,EAAE,EAAI,IAAM,KAAO/W,GAAK,EAAI,IAAM,IAAMA,CACrG,CAYO,SAAS8f,GAAY7hB,EAAOuhB,EAAWthB,EAAS,CACrD,GAAI,MAAMD,CAAK,GAAK,CAAC,SAASA,CAAK,EACjC,OAAO,OAAOA,CAAK,EAIrB,IAAIgjB,EAAWC,GAAmBhjB,GAAY,KAA6B,OAASA,EAAQ,SAAU,EAAE,EACpGijB,EAAWD,GAAmBhjB,GAAY,KAA6B,OAASA,EAAQ,SAAU,CAAC,EACnGoiB,EAAQL,GAAYhiB,CAAK,EACzBsiB,EAAUf,EAAYgB,GAAYF,EAAOd,CAAS,EAAIc,EAC1D,GAAIC,EAAQ,SAAWU,GAAYV,EAAQ,UAAYY,EAErD,OAAOvB,GAAc3hB,EAAOuhB,CAAS,EAErC,IAAIzI,EAAIwJ,EAAQ,aACZvgB,EAAIugB,EAAQ,SAGZxJ,EAAE,OAASyI,IACbzI,EAAIA,EAAE,OAAOsJ,GAAMb,EAAYzI,EAAE,MAAM,CAAC,GAK1CA,EAAIA,EAAE,OAAOsJ,GAAMrgB,EAAI+W,EAAE,OAAS,GAAKA,EAAE,OAASyI,EAAYA,EAAYzI,EAAE,OAAS,EAAE,CAAC,EAGxFA,EAAIsJ,GAAM,CAACrgB,CAAC,EAAE,OAAO+W,CAAC,EACtB,IAAIoJ,EAAMngB,EAAI,EAAIA,EAAI,EACtB,OAAImgB,EAAMpJ,EAAE,OAAS,GACnBA,EAAE,OAAOoJ,EAAM,EAAG,EAAG,GAAG,EAEnBI,EAAQ,KAAOxJ,EAAE,KAAK,EAAE,CAEnC,CAUO,SAASyJ,GAAYF,EAAOd,EAAW,CAU5C,QARIe,EAAU,CACZ,KAAMD,EAAM,KACZ,aAAcA,EAAM,aACpB,SAAUA,EAAM,QACjB,EACGvJ,EAAIwJ,EAAQ,aAGTf,GAAa,GAClBzI,EAAE,QAAQ,CAAC,EACXwJ,EAAQ,WACRf,IAEF,GAAIzI,EAAE,OAASyI,EAAW,CACxB,IAAIzU,EAAUgM,EAAE,OAAOyI,EAAWzI,EAAE,OAASyI,CAAS,EACtD,GAAIzU,EAAQ,CAAC,GAAK,EAAG,CACnB,IAAIhM,EAAIygB,EAAY,EAEpB,IADAzI,EAAEhY,CAAC,IACIgY,EAAEhY,CAAC,IAAM,IACdgY,EAAE,IAAK,EACHhY,IAAM,IACRgY,EAAE,QAAQ,CAAC,EACXwJ,EAAQ,WACRxhB,KAEFA,IACAgY,EAAEhY,CAAC,GAEX,CACA,CACE,OAAOwhB,CACT,CAOA,SAASF,GAAMrhB,EAAQ,CAErB,QADIme,EAAM,CAAE,EACHpe,EAAI,EAAGA,EAAIC,EAAQD,IAC1Boe,EAAI,KAAK,CAAC,EAEZ,OAAOA,CACT,CAaO,SAAS4C,GAAO9hB,EAAO,CAC5B,OAAOA,EAAM,cAAa,EAAG,QAAQ,OAAQ,EAAE,EAC9C,QAAQ,aAAc,EAAE,EACxB,MACH,CAKO,IAAImjB,GAAc,OAAO,SAAW,qBAWpC,SAASC,GAAY1iB,EAAG2iB,EAAGC,EAAS,CAEzC,GAAIA,GAAY,KACd,OAAO5iB,IAAM2iB,EAEf,GAAI3iB,IAAM2iB,EACR,MAAO,GAIT,GAAI,MAAM3iB,CAAC,GAAK,MAAM2iB,CAAC,EACrB,MAAO,GAIT,GAAI,SAAS3iB,CAAC,GAAK,SAAS2iB,CAAC,EAAG,CAE9B,IAAIE,EAAO,KAAK,IAAI7iB,EAAI2iB,CAAC,EACzB,OAAIE,GAAQJ,GACH,GAGAI,GAAQ,KAAK,IAAI,KAAK,IAAI7iB,CAAC,EAAG,KAAK,IAAI2iB,CAAC,CAAC,EAAIC,CAE1D,CAGE,MAAO,EACT,CA8DA,SAASvB,GAAiB/hB,EAAOwjB,EAAS,CACxC,GAAI9V,GAAS1N,CAAK,EAChB,OAAOA,EACF,GAAI2N,GAAY3N,CAAK,EAC1B,OAAOA,EAAM,SAAU,EAEvBwjB,EAAS,CAEb,CACA,SAASP,GAAmBjjB,EAAOyjB,EAAc,CAC/C,OAAI/V,GAAS1N,CAAK,EACTA,EACE2N,GAAY3N,CAAK,EACnBA,EAAM,SAAU,EAEhByjB,CAEX,CChqBO,SAASC,GAAQhc,EAAMic,EAAcpS,EAAQqS,EAAM,CACxD,SAASC,EAAgBC,EAAO,CAI9B,IAAIC,EAAOlT,GAAYiT,EAAOH,EAAa,IAAIK,EAAqB,CAAC,EACrE,OAAAC,GAAmBvc,EAAMic,EAAcG,CAAK,EACrCvS,EAAOwS,CAAI,CACtB,CACE,OAAAF,EAAgB,UAAY,GAC5BA,EAAgB,GAAKnc,EACrBmc,EAAgB,aAAeF,EAAa,MAAK,EAAG,KAAM,EACtDC,IACFC,EAAgB,KAAOD,GAElBC,CACT,CAoEO,SAASI,GAAmBvc,EAAMic,EAAcG,EAAO,CAC5D,IAAII,EAAaP,EAAa,OAAOQ,GAAc,CAACC,GAAqBD,CAAU,CAAC,EACnF,MAAMA,GAAcL,EAAMK,CAAU,IAAM,MAAS,EACpD,GAAI,CAACD,EAAY,CACf,IAAIG,EAAsBV,EAAa,OAAOQ,GAAcL,EAAMK,CAAU,IAAM,MAAS,EAG3F,MAAM,IAAI,MAAM,2BAA4B,OAAOzc,EAAM,KAAM,EAAI,kCAAkC,OAAO2c,EAAoB,IAAIC,GAAK,IAAK,OAAOA,EAAG,GAAI,CAAC,EAAE,KAAK,IAAI,EAAG,GAAG,CAAC,CACnL,CACA,CACO,SAASF,GAAqBD,EAAY,CAC/C,OAAOA,GAAcA,EAAW,CAAC,IAAM,GACzC,CACO,SAASH,GAAsBG,EAAY,CAChD,OAAOA,GAAcA,EAAW,CAAC,IAAM,IAAMA,EAAW,MAAM,CAAC,EAAIA,CACrE,CCnHA,SAASI,GAAgBnU,EAAQK,EAAM,CAErC,GAAIe,GAAcpB,CAAM,GAAKoU,GAAepU,EAAQK,CAAI,EACtD,OAAOL,EAAOK,CAAI,EAEpB,MAAI,OAAOL,EAAOK,CAAI,GAAM,YAAcgU,GAAarU,EAAQK,CAAI,EAC3D,IAAI,MAAM,yBAA2BA,EAAO,iBAAiB,EAE/D,IAAI,MAAM,0BAA4BA,EAAO,GAAG,CACxD,CAYA,SAASiU,GAAgBtU,EAAQK,EAAMzQ,EAAO,CAE5C,GAAIwR,GAAcpB,CAAM,GAAKoU,GAAepU,EAAQK,CAAI,EACtD,OAAAL,EAAOK,CAAI,EAAIzQ,EACRA,EAET,MAAM,IAAI,MAAM,0BAA4ByQ,EAAO,GAAG,CACxD,CAIA,SAASkU,GAAgBvU,EAAQK,EAAM,CACrC,OAAOA,KAAQL,CACjB,CAQA,SAASoU,GAAepU,EAAQK,EAAM,CACpC,MAAI,CAACL,GAAU,OAAOA,GAAW,SACxB,GAILC,GAAeuU,GAAsBnU,CAAI,EACpC,GAIL,EAAAA,KAAQ,OAAO,WAQfA,KAAQ,SAAS,UAOvB,CAuBA,SAASgU,GAAarU,EAAQyU,EAAQ,CAOpC,OANIzU,GAAW,MAAgC,OAAOA,EAAOyU,CAAM,GAAM,YAMrExU,GAAeD,EAAQyU,CAAM,GAAK,OAAO,gBAAkBA,KAAU,OAAO,eAAezU,CAAM,EAC5F,GAILC,GAAeyU,GAAmBD,CAAM,EACnC,GAIL,EAAAA,KAAU,OAAO,WAQjBA,KAAU,SAAS,UAOzB,CACA,SAASrT,GAAcpB,EAAQ,CAC7B,OAAO,OAAOA,GAAW,UAAYA,GAAUA,EAAO,cAAgB,MACxE,CACA,IAAIwU,GAAuB,CACzB,OAAQ,GACR,KAAM,EACR,EACIE,GAAoB,CACtB,SAAU,GACV,QAAS,GACT,eAAgB,EAClB,ECtIO,MAAMC,EAAkB,CAC7B,YAAY3U,EAAQ,CAClB,KAAK,cAAgBA,EACrB,KAAK,OAAO,QAAQ,EAAI,KAAK,OACjC,CACE,MAAO,CACL,OAAO,OAAO,KAAK,KAAK,aAAa,EAAE,OAAQ,CACnD,CACE,IAAIjM,EAAK,CACP,OAAOogB,GAAgB,KAAK,cAAepgB,CAAG,CAClD,CACE,IAAIA,EAAKnE,EAAO,CACd,OAAA0kB,GAAgB,KAAK,cAAevgB,EAAKnE,CAAK,EACvC,IACX,CACE,IAAImE,EAAK,CACP,OAAOwgB,GAAgB,KAAK,cAAexgB,CAAG,CAClD,CACE,SAAU,CACR,OAAO6gB,GAAY,KAAK,KAAI,EAAI7gB,GAAO,CAACA,EAAK,KAAK,IAAIA,CAAG,CAAC,CAAC,CAC/D,CACE,QAAQ4B,EAAU,CAChB,QAAS5B,KAAO,KAAK,OACnB4B,EAAS,KAAK,IAAI5B,CAAG,EAAGA,EAAK,IAAI,CAEvC,CACE,OAAOA,EAAK,CACV,OAAO,KAAK,cAAcA,CAAG,CACjC,CACE,OAAQ,CACN,QAASA,KAAO,KAAK,OACnB,KAAK,OAAOA,CAAG,CAErB,CACE,IAAI,MAAO,CACT,OAAO,OAAO,KAAK,KAAK,aAAa,EAAE,MAC3C,CACA,CAoEA,SAAS6gB,GAAYC,EAAIlf,EAAU,CACjC,MAAO,CACL,KAAM,IAAM,CACV,IAAIuH,EAAI2X,EAAG,KAAM,EACjB,OAAO3X,EAAE,KAAOA,EAAI,CAClB,MAAOvH,EAASuH,EAAE,KAAK,EACvB,KAAM,EACP,CACP,CACG,CACH,CAwDO,SAAS4X,GAAM9U,EAAQ,CAG5B,OAAKA,EAGEA,aAAkB,KAAOA,aAAkB2U,IAAqB,OAAO3U,EAAO,KAAQ,YAAc,OAAOA,EAAO,KAAQ,YAAc,OAAOA,EAAO,MAAS,YAAc,OAAOA,EAAO,KAAQ,WAFjM,EAGX,CChJA,IAAI+U,GAAgB,UAAwB,CAG1C,OAAAA,GAAgBvE,GAAc,OACvBA,EACT,EACI+C,GAAe,CAAC,aAAc,WAAY,eAAgB,WAAW,EAO9DyB,GAA6B1B,GAAQ,QAASC,GAAc,SAAqB0B,EAAM,CAChG,GAAI,CACF,UAAAC,EACA,QAAAC,EACA,YAAAC,EACA,SAAAC,CACJ,EAAMJ,EAIAvT,EAAQqT,GAAe,EAK3B,OAAArT,EAAM,MAAO,EACbA,EAAM,SAAS,CAAC,CACd,KAAM,SACN,KAAMpE,EACV,EAAK,CACD,KAAM,UACN,KAAME,EACV,EAAK,CACD,KAAM,YACN,KAAMD,EACV,EAAK,CACD,KAAM,WACN,KAAME,EACV,EAAK,CACD,KAAM,OACN,KAAMC,EACP,EAKD,CACE,KAAM,aACN,KAAM8G,GAAK7G,IAAY,upfAAupf,KAAK6G,CAAC,CACxrf,EAAK,CACD,KAAM,SACN,KAAM7G,EACV,EAAK,CACD,KAAM,QACN,KAAMiC,EACV,EAAK,CACD,KAAM,QACN,KAAMhC,EACV,EAAK,CACD,KAAM,SACN,KAAMC,EACV,EAAK,CACD,KAAM,cACN,KAAME,EACV,EAAK,CACD,KAAM,eACN,KAAMC,EACV,EAAK,CACD,KAAM,QACN,KAAMC,EACV,EAAK,CACD,KAAM,QACN,KAAMC,EACV,EAAK,CACD,KAAM,UACN,KAAMC,EACV,EAAK,CACD,KAAM,YACN,KAAMC,EACV,EAAK,CACD,KAAM,OACN,KAAMC,EACV,EAAK,CACD,KAAM,WACN,KAAMC,EACV,EAAK,CACD,KAAM,OACN,KAAMC,EACV,EAAK,CACD,KAAM,SACN,KAAMC,EACV,EAAK,CACD,KAAM,OACN,KAAME,EACV,EAAK,CACD,KAAM,YACN,KAAMC,EACV,EAAK,CACD,KAAM,eACN,KAAMC,EACV,EAAK,CACD,KAAM,YACN,KAAMC,EACV,EAAK,CACD,KAAM,iBACN,KAAMC,EACV,EAAK,CACD,KAAM,YACN,KAAMC,EACV,EAAK,CACD,KAAM,kBACN,KAAMC,EACV,EAAK,CACD,KAAM,eACN,KAAMC,EACV,EAAK,CACD,KAAM,eACN,KAAME,EACV,EAAK,CACD,KAAM,yBACN,KAAMD,EACV,EAAK,CACD,KAAM,YACN,KAAME,EACV,EAAK,CACD,KAAM,OACN,KAAMC,EACV,EAAK,CACD,KAAM,aACN,KAAMC,EACV,EAAK,CACD,KAAM,eACN,KAAMC,EACV,EAAK,CACD,KAAM,kBACN,KAAMC,EACV,EAAK,CACD,KAAM,YACN,KAAMC,EACV,EAAK,CACD,KAAM,iBACN,KAAMC,EACV,EAAK,CACD,KAAM,aACN,KAAMC,EACV,EAAK,CACD,KAAM,MACN,KAAMmV,EACV,EAAK,CACD,KAAM,SACN,KAAMrW,EACP,CACH,CAAG,EACDiD,EAAM,eAAe,CAAC,CACpB,KAAM,SACN,GAAI,YACJ,QAAS,SAAiBpR,EAAG,CAM3B,GALK4kB,GACHI,GAAiBhlB,CAAC,EAIhBohB,GAAOphB,CAAC,EAAI,GACd,MAAM,IAAI,UAAU,uFAA8FA,EAAI,uDAA4D,EAEpL,OAAO,IAAI4kB,EAAU5kB,CAAC,CAC5B,CACA,EAAK,CACD,KAAM,SACN,GAAI,UACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAK6kB,GACHI,GAAejlB,CAAC,EAEX,IAAI6kB,EAAQ7kB,EAAG,CAAC,CAC7B,CACA,EAAK,CACD,KAAM,YACN,GAAI,UACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAK6kB,GACHI,GAAejlB,CAAC,EAEX,IAAI6kB,EAAQ7kB,EAAE,SAAQ,EAAI,CAAC,CACxC,CACA,EAAK,CACD,KAAM,WACN,GAAI,YACJ,QAAS,SAAiBA,EAAG,CAC3B,MAAM,IAAI,UAAU,2JAAgK,CAC1L,CACA,EAAK,CACD,KAAM,WACN,GAAI,UACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAK6kB,GACHI,GAAejlB,CAAC,EAEX,IAAI6kB,EAAQ7kB,EAAE,QAAO,EAAI,CAAC,CACvC,CACA,EAAK,CACD,KAAM,SACN,GAAI,WACJ,QAAS,SAAiBA,EAAG,CACtB+kB,GACHG,GAAgBllB,CAAC,EAEnB,IAAImlB,EAAI,IAAIJ,EAAS/kB,CAAC,EACtB,GAAImlB,EAAE,QAAS,IAAKnlB,EAClB,MAAM,IAAI,UAAU,mGAA0GA,EAAI,qDAA0D,EAE9L,OAAOmlB,CACb,CACA,EAAK,CAQD,KAAM,SACN,GAAI,SACJ,QAAS,SAAiBnlB,EAAG,CAC3B,IAAI4M,EAAI,OAAO5M,CAAC,EAChB,GAAI,MAAM4M,CAAC,EACT,MAAM,IAAI,MAAM,mBAAqB5M,EAAI,eAAe,EAE1D,OAAO4M,CACb,CACA,EAAK,CACD,KAAM,SACN,GAAI,YACJ,QAAS,SAAiB5M,EAAG,CACtB4kB,GACHI,GAAiBhlB,CAAC,EAEpB,GAAI,CACF,OAAO,IAAI4kB,EAAU5kB,CAAC,CACvB,OAAQxC,EAAK,CACZ,MAAM,IAAI,MAAM,mBAAqBwC,EAAI,gBAAgB,CACjE,CACA,CACA,EAAK,CACD,KAAM,SACN,GAAI,WACJ,QAAS,SAAiBA,EAAG,CACtB+kB,GACHG,GAAgBllB,CAAC,EAEnB,GAAI,CACF,OAAO,IAAI+kB,EAAS/kB,CAAC,CACtB,OAAQxC,EAAK,CACZ,MAAM,IAAI,MAAM,mBAAqBwC,EAAI,eAAe,CAChE,CACA,CACA,EAAK,CACD,KAAM,SACN,GAAI,UACJ,QAAS,SAAiBA,EAAG,CACtB6kB,GACHI,GAAejlB,CAAC,EAElB,GAAI,CACF,OAAO,IAAI6kB,EAAQ7kB,CAAC,CACrB,OAAQxC,EAAK,CACZ,MAAM,IAAI,MAAM,mBAAqBwC,EAAI,cAAc,CAC/D,CACA,CACA,EAAK,CACD,KAAM,UACN,GAAI,SACJ,QAAS,SAAiBA,EAAG,CAC3B,MAAO,CAACA,CACd,CACA,EAAK,CACD,KAAM,UACN,GAAI,YACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAK4kB,GACHI,GAAiBhlB,CAAC,EAEb,IAAI4kB,EAAU,CAAC5kB,CAAC,CAC7B,CACA,EAAK,CACD,KAAM,UACN,GAAI,WACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAK+kB,GACHG,GAAgBllB,CAAC,EAEZ,IAAI+kB,EAAS,CAAC/kB,CAAC,CAC5B,CACA,EAAK,CACD,KAAM,UACN,GAAI,SACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAO,OAAOA,CAAC,CACrB,CACA,EAAK,CACD,KAAM,QACN,GAAI,SACJ,QAAS,SAAiBolB,EAAO,CAC/B,OAAKN,GACHO,GAAe,EAEV,IAAIP,EAAYM,CAAK,CAClC,CACA,EAAK,CACD,KAAM,SACN,GAAI,QACJ,QAAS,SAAiBE,EAAQ,CAChC,OAAOA,EAAO,QAAS,CAC7B,CACA,CAAG,CAAC,EAMFlU,EAAM,WAAa,CAACpK,EAAM0O,EAAMI,IAAe,CAC7C,IAAIyP,EAAanU,EAAM,YAAYpK,EAAM0O,EAAMI,CAAU,EACzD,GAAI,CAAC,YAAa,UAAU,EAAE,SAASyP,EAAW,KAAK,QAAQ,GAAK7P,EAAK,SAAW,GAAKlI,GAAakI,EAAK,CAAC,CAAC,GAE7GI,EAAW,KAAK0P,GAAO,CAACA,EAAI,OAAO,SAAS,GAAG,CAAC,EAAG,CACjD,IAAIhoB,EAAM,IAAI,UAAU,aAAa,OAAOwJ,EAAM,0CAA0C,EAAI,4CAA4C,OAAOA,EAAM,KAAK,CAAC,EAC/J,MAAAxJ,EAAI,KAAO+nB,EAAW,KAChB/nB,CACZ,CACI,MAAM+nB,CACP,EAMDnU,EAAM,WAAa,CAACpK,EAAM0O,EAAMI,IAAe,CAC7C,IAAIyP,EAAanU,EAAM,YAAYpK,EAAM0O,EAAMI,CAAU,EACzD,GAAI,CAAC,YAAa,UAAU,EAAE,SAASyP,EAAW,KAAK,QAAQ,GAAK7P,EAAK,SAAW,GAAKlI,GAAakI,EAAK,CAAC,CAAC,GAE7GI,EAAW,KAAK0P,GAAO,CAACA,EAAI,OAAO,SAAS,GAAG,CAAC,EAAG,CACjD,IAAIhoB,EAAM,IAAI,UAAU,aAAa,OAAOwJ,EAAM,0CAA0C,EAAI,4CAA4C,OAAOA,EAAM,KAAK,CAAC,EAC/J,MAAAxJ,EAAI,KAAO+nB,EAAW,KAChB/nB,CACZ,CACI,MAAM+nB,CACP,EACMnU,CACT,CAAC,EACD,SAAS4T,GAAiBhlB,EAAG,CAC3B,MAAM,IAAI,MAAM,wBAAwB,OAAOA,EAAG,kDAAkD,CAAC,CACvG,CACA,SAASilB,GAAejlB,EAAG,CACzB,MAAM,IAAI,MAAM,wBAAwB,OAAOA,EAAG,qDAAqD,CAAC,CAC1G,CACA,SAASqlB,IAAgB,CACvB,MAAM,IAAI,MAAM,qEAAuE,CACzF,CACA,SAASH,GAAgBllB,EAAG,CAC1B,MAAM,IAAI,MAAM,wBAAwB,OAAOA,EAAG,iDAAiD,CAAC,CACtG,CCxZA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAcA,IAAIylB,GAAY,KAIdC,GAAa,IAGbC,GAAW,mBAGXC,GAAO,qgCAGPC,GAAK,qgCAILC,GAAW,CAOT,UAAW,GAiBX,SAAU,EAeV,OAAQ,EAIR,SAAU,GAIV,SAAW,GAIX,KAAM,MAIN,KAAML,GAGN,OAAQ,EACT,EAMDM,GAASC,GACTC,GAAW,GAEXC,GAAe,kBACfC,GAAkBD,GAAe,qBACjCE,GAAyBF,GAAe,2BACxCG,GAAoBH,GAAe,qBACnCI,GAAM,mBAENC,GAAY,KAAK,MACjBC,GAAU,KAAK,IAEfC,GAAW,6CACXC,GAAQ,yDACRC,GAAU,gDACVC,GAAY,qCAEZC,GAAO,IACPC,GAAW,EACXC,GAAmB,iBAEnBC,GAAiBpB,GAAK,OAAS,EAC/BqB,GAAepB,GAAG,OAAS,EAG3BqB,EAAI,CAAE,YAAaZ,IA0ErBY,EAAE,cAAgBA,EAAE,IAAM,UAAY,CACpC,IAAIlnB,EAAI,IAAI,KAAK,YAAY,IAAI,EACjC,OAAIA,EAAE,EAAI,IAAGA,EAAE,EAAI,GACZmnB,GAASnnB,CAAC,CACnB,EAQAknB,EAAE,KAAO,UAAY,CACnB,OAAOC,GAAS,IAAI,KAAK,YAAY,IAAI,EAAG,KAAK,EAAI,EAAG,CAAC,CAC3D,EAWAD,EAAE,UAAYA,EAAE,MAAQ,SAAUhlB,EAAKC,EAAK,CAC1C,IAAIilB,EACFpnB,EAAI,KACJqnB,EAAOrnB,EAAE,YAGX,GAFAkC,EAAM,IAAImlB,EAAKnlB,CAAG,EAClBC,EAAM,IAAIklB,EAAKllB,CAAG,EACd,CAACD,EAAI,GAAK,CAACC,EAAI,EAAG,OAAO,IAAIklB,EAAK,GAAG,EACzC,GAAInlB,EAAI,GAAGC,CAAG,EAAG,MAAM,MAAMgkB,GAAkBhkB,CAAG,EAClD,OAAAilB,EAAIpnB,EAAE,IAAIkC,CAAG,EACNklB,EAAI,EAAIllB,EAAMlC,EAAE,IAAImC,CAAG,EAAI,EAAIA,EAAM,IAAIklB,EAAKrnB,CAAC,CACxD,EAWAknB,EAAE,WAAaA,EAAE,IAAM,SAAUvE,EAAG,CAClC,IAAIviB,EAAGknB,EAAGC,EAAKC,EACbxnB,EAAI,KACJynB,EAAKznB,EAAE,EACP0nB,GAAM/E,EAAI,IAAI3iB,EAAE,YAAY2iB,CAAC,GAAG,EAChCgF,EAAK3nB,EAAE,EACP4nB,EAAKjF,EAAE,EAGT,GAAI,CAAC8E,GAAM,CAACC,EACV,MAAO,CAACC,GAAM,CAACC,EAAK,IAAMD,IAAOC,EAAKD,EAAKF,IAAOC,EAAK,EAAI,CAACD,EAAKE,EAAK,EAAI,EAAI,GAIhF,GAAI,CAACF,EAAG,CAAC,GAAK,CAACC,EAAG,CAAC,EAAG,OAAOD,EAAG,CAAC,EAAIE,EAAKD,EAAG,CAAC,EAAI,CAACE,EAAK,EAGxD,GAAID,IAAOC,EAAI,OAAOD,EAGtB,GAAI3nB,EAAE,IAAM2iB,EAAE,EAAG,OAAO3iB,EAAE,EAAI2iB,EAAE,EAAIgF,EAAK,EAAI,EAAI,GAMjD,IAJAJ,EAAME,EAAG,OACTD,EAAME,EAAG,OAGJtnB,EAAI,EAAGknB,EAAIC,EAAMC,EAAMD,EAAMC,EAAKpnB,EAAIknB,EAAG,EAAElnB,EAC9C,GAAIqnB,EAAGrnB,CAAC,IAAMsnB,EAAGtnB,CAAC,EAAG,OAAOqnB,EAAGrnB,CAAC,EAAIsnB,EAAGtnB,CAAC,EAAIunB,EAAK,EAAI,EAAI,GAI3D,OAAOJ,IAAQC,EAAM,EAAID,EAAMC,EAAMG,EAAK,EAAI,EAAI,EACpD,EAgBAT,EAAE,OAASA,EAAE,IAAM,UAAY,CAC7B,IAAIW,EAAIC,EACN9nB,EAAI,KACJqnB,EAAOrnB,EAAE,YAEX,OAAKA,EAAE,EAGFA,EAAE,EAAE,CAAC,GAEV6nB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVA,EAAK,UAAYQ,EAAK,KAAK,IAAI7nB,EAAE,EAAGA,EAAE,GAAI,GAAI8mB,GAC9CO,EAAK,SAAW,EAEhBrnB,EAAI+nB,GAAOV,EAAMW,GAAiBX,EAAMrnB,CAAC,CAAC,EAE1CqnB,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAETX,GAASnB,IAAY,GAAKA,IAAY,EAAIhmB,EAAE,IAAG,EAAKA,EAAG6nB,EAAIC,EAAI,EAAI,GAZtD,IAAIT,EAAK,CAAC,EAHb,IAAIA,EAAK,GAAG,CAgB/B,EAmBAH,EAAE,SAAWA,EAAE,KAAO,UAAY,CAChC,IAAI,EAAGe,EAAGrb,EAAGE,EAAGob,EAAKhU,EAAGiU,EAAItb,EAAGub,EAAIC,EACjCroB,EAAI,KACJqnB,EAAOrnB,EAAE,YAEX,GAAI,CAACA,EAAE,SAAQ,GAAMA,EAAE,OAAM,EAAI,OAAO,IAAIqnB,EAAKrnB,CAAC,EAoClD,IAnCAimB,GAAW,GAGX/R,EAAIlU,EAAE,EAAIwmB,GAAQxmB,EAAE,EAAIA,EAAG,EAAI,CAAC,EAI5B,CAACkU,GAAK,KAAK,IAAIA,CAAC,GAAK,KACvBtH,EAAI0b,GAAetoB,EAAE,CAAC,EACtB,EAAIA,EAAE,GAGFkU,GAAK,EAAItH,EAAE,OAAS,GAAK,KAAGA,GAAMsH,GAAK,GAAKA,GAAK,GAAK,IAAM,MAChEA,EAAIsS,GAAQ5Z,EAAG,EAAI,CAAC,EAGpB,EAAI2Z,IAAW,EAAI,GAAK,CAAC,GAAK,EAAI,IAAM,EAAI,EAAI,GAAK,IAEjDrS,GAAK,IACPtH,EAAI,KAAO,GAEXA,EAAIsH,EAAE,gBACNtH,EAAIA,EAAE,MAAM,EAAGA,EAAE,QAAQ,GAAG,EAAI,CAAC,EAAI,GAGvCE,EAAI,IAAIua,EAAKza,CAAC,EACdE,EAAE,EAAI9M,EAAE,GAER8M,EAAI,IAAIua,EAAKnT,EAAE,SAAU,GAG3BiU,GAAM,EAAId,EAAK,WAAa,IAW1B,GANAxa,EAAIC,EACJsb,EAAKvb,EAAE,MAAMA,CAAC,EAAE,MAAMA,CAAC,EACvBwb,EAAUD,EAAG,KAAKpoB,CAAC,EACnB8M,EAAIyb,GAAOF,EAAQ,KAAKroB,CAAC,EAAE,MAAM6M,CAAC,EAAGwb,EAAQ,KAAKD,CAAE,EAAGD,EAAK,EAAG,CAAC,EAG5DG,GAAezb,EAAE,CAAC,EAAE,MAAM,EAAGsb,CAAE,KAAOvb,EAAI0b,GAAexb,EAAE,CAAC,GAAG,MAAM,EAAGqb,CAAE,EAK5E,GAJAvb,EAAIA,EAAE,MAAMub,EAAK,EAAGA,EAAK,CAAC,EAItBvb,GAAK,QAAU,CAACsb,GAAOtb,GAAK,OAAQ,CAItC,GAAI,CAACsb,IACHf,GAASta,EAAG,EAAI,EAAG,CAAC,EAEhBA,EAAE,MAAMA,CAAC,EAAE,MAAMA,CAAC,EAAE,GAAG7M,CAAC,GAAG,CAC7B8M,EAAID,EACJ,KACD,CAGHsb,GAAM,EACND,EAAM,CACd,KAAa,EAID,CAAC,CAACtb,GAAK,CAAC,CAACA,EAAE,MAAM,CAAC,GAAKA,EAAE,OAAO,CAAC,GAAK,OAGxCua,GAASra,EAAG,EAAI,EAAG,CAAC,EACpBmb,EAAI,CAACnb,EAAE,MAAMA,CAAC,EAAE,MAAMA,CAAC,EAAE,GAAG9M,CAAC,GAG/B,KACD,CAIL,OAAAimB,GAAW,GAEJkB,GAASra,EAAG,EAAGua,EAAK,SAAUY,CAAC,CACxC,EAOAf,EAAE,cAAgBA,EAAE,GAAK,UAAY,CACnC,IAAIsB,EACF5E,EAAI,KAAK,EACThX,EAAI,IAEN,GAAIgX,EAAG,CAML,GALA4E,EAAI5E,EAAE,OAAS,EACfhX,GAAK4b,EAAIjC,GAAU,KAAK,EAAIO,EAAQ,GAAKA,GAGzC0B,EAAI5E,EAAE4E,CAAC,EACHA,EAAG,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAI5b,IAChCA,EAAI,IAAGA,EAAI,EAChB,CAED,OAAOA,CACT,EAwBAsa,EAAE,UAAYA,EAAE,IAAM,SAAUvE,EAAG,CACjC,OAAO4F,GAAO,KAAM,IAAI,KAAK,YAAY5F,CAAC,CAAC,CAC7C,EAQAuE,EAAE,mBAAqBA,EAAE,SAAW,SAAUvE,EAAG,CAC/C,IAAI3iB,EAAI,KACNqnB,EAAOrnB,EAAE,YACX,OAAOmnB,GAASoB,GAAOvoB,EAAG,IAAIqnB,EAAK1E,CAAC,EAAG,EAAG,EAAG,CAAC,EAAG0E,EAAK,UAAWA,EAAK,QAAQ,CAChF,EAOAH,EAAE,OAASA,EAAE,GAAK,SAAUvE,EAAG,CAC7B,OAAO,KAAK,IAAIA,CAAC,IAAM,CACzB,EAQAuE,EAAE,MAAQ,UAAY,CACpB,OAAOC,GAAS,IAAI,KAAK,YAAY,IAAI,EAAG,KAAK,EAAI,EAAG,CAAC,CAC3D,EAQAD,EAAE,YAAcA,EAAE,GAAK,SAAUvE,EAAG,CAClC,OAAO,KAAK,IAAIA,CAAC,EAAI,CACvB,EAQAuE,EAAE,qBAAuBA,EAAE,IAAM,SAAUvE,EAAG,CAC5C,IAAIyE,EAAI,KAAK,IAAIzE,CAAC,EAClB,OAAOyE,GAAK,GAAKA,IAAM,CACzB,EA4BAF,EAAE,iBAAmBA,EAAE,KAAO,UAAY,CACxC,IAAIE,EAAGxa,EAAGib,EAAIC,EAAI7X,EAChBjQ,EAAI,KACJqnB,EAAOrnB,EAAE,YACTyoB,EAAM,IAAIpB,EAAK,CAAC,EAElB,GAAI,CAACrnB,EAAE,SAAU,EAAE,OAAO,IAAIqnB,EAAKrnB,EAAE,EAAI,IAAQ,GAAG,EACpD,GAAIA,EAAE,SAAU,OAAOyoB,EAEvBZ,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVA,EAAK,UAAYQ,EAAK,KAAK,IAAI7nB,EAAE,EAAGA,EAAE,GAAI,GAAI,EAC9CqnB,EAAK,SAAW,EAChBpX,EAAMjQ,EAAE,EAAE,OAONiQ,EAAM,IACRmX,EAAI,KAAK,KAAKnX,EAAM,CAAC,EACrBrD,GAAK,EAAI8b,GAAQ,EAAGtB,CAAC,GAAG,aAExBA,EAAI,GACJxa,EAAI,gCAGN5M,EAAI2oB,GAAatB,EAAM,EAAGrnB,EAAE,MAAM4M,CAAC,EAAG,IAAIya,EAAK,CAAC,EAAG,EAAI,EAMvD,QAHIuB,EACFxoB,EAAIgnB,EACJyB,EAAK,IAAIxB,EAAK,CAAC,EACVjnB,KACLwoB,EAAU5oB,EAAE,MAAMA,CAAC,EACnBA,EAAIyoB,EAAI,MAAMG,EAAQ,MAAMC,EAAG,MAAMD,EAAQ,MAAMC,CAAE,CAAC,CAAC,CAAC,EAG1D,OAAO1B,GAASnnB,EAAGqnB,EAAK,UAAYQ,EAAIR,EAAK,SAAWS,EAAI,EAAI,CAClE,EAiCAZ,EAAE,eAAiBA,EAAE,KAAO,UAAY,CACtC,IAAIE,EAAGS,EAAIC,EAAI7X,EACbjQ,EAAI,KACJqnB,EAAOrnB,EAAE,YAEX,GAAI,CAACA,EAAE,SAAQ,GAAMA,EAAE,OAAM,EAAI,OAAO,IAAIqnB,EAAKrnB,CAAC,EAQlD,GANA6nB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVA,EAAK,UAAYQ,EAAK,KAAK,IAAI7nB,EAAE,EAAGA,EAAE,GAAI,GAAI,EAC9CqnB,EAAK,SAAW,EAChBpX,EAAMjQ,EAAE,EAAE,OAENiQ,EAAM,EACRjQ,EAAI2oB,GAAatB,EAAM,EAAGrnB,EAAGA,EAAG,EAAI,MAC/B,CAWLonB,EAAI,IAAM,KAAK,KAAKnX,CAAG,EACvBmX,EAAIA,EAAI,GAAK,GAAKA,EAAI,EAEtBpnB,EAAIA,EAAE,MAAM,EAAI0oB,GAAQ,EAAGtB,CAAC,CAAC,EAC7BpnB,EAAI2oB,GAAatB,EAAM,EAAGrnB,EAAGA,EAAG,EAAI,EAOpC,QAJI8oB,EACFC,EAAK,IAAI1B,EAAK,CAAC,EACf2B,EAAM,IAAI3B,EAAK,EAAE,EACjB4B,EAAM,IAAI5B,EAAK,EAAE,EACZD,KACL0B,EAAU9oB,EAAE,MAAMA,CAAC,EACnBA,EAAIA,EAAE,MAAM+oB,EAAG,KAAKD,EAAQ,MAAME,EAAI,MAAMF,CAAO,EAAE,KAAKG,CAAG,CAAC,CAAC,CAAC,CAEnE,CAED,OAAA5B,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAETX,GAASnnB,EAAG6nB,EAAIC,EAAI,EAAI,CACjC,EAmBAZ,EAAE,kBAAoBA,EAAE,KAAO,UAAY,CACzC,IAAIW,EAAIC,EACN9nB,EAAI,KACJqnB,EAAOrnB,EAAE,YAEX,OAAKA,EAAE,SAAU,EACbA,EAAE,OAAQ,EAAS,IAAIqnB,EAAKrnB,CAAC,GAEjC6nB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVA,EAAK,UAAYQ,EAAK,EACtBR,EAAK,SAAW,EAETkB,GAAOvoB,EAAE,KAAM,EAAEA,EAAE,KAAI,EAAIqnB,EAAK,UAAYQ,EAAIR,EAAK,SAAWS,CAAE,GAR/C,IAAIT,EAAKrnB,EAAE,CAAC,CASxC,EAsBAknB,EAAE,cAAgBA,EAAE,KAAO,UAAY,CACrC,IAAIgC,EACFlpB,EAAI,KACJqnB,EAAOrnB,EAAE,YACTonB,EAAIpnB,EAAE,MAAM,IAAI,CAAC,EACjB6nB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SAEZ,OAAID,IAAM,GACDA,IAAM,EAETpnB,EAAE,QAAUmpB,GAAM9B,EAAMQ,EAAIC,CAAE,EAAI,IAAIT,EAAK,CAAC,EAE5C,IAAIA,EAAK,GAAG,EAGdrnB,EAAE,SAAiBmpB,GAAM9B,EAAMQ,EAAK,EAAGC,CAAE,EAAE,MAAM,EAAG,GAIxDT,EAAK,UAAYQ,EAAK,EACtBR,EAAK,SAAW,EAEhBrnB,EAAIA,EAAE,OACNkpB,EAASC,GAAM9B,EAAMQ,EAAK,EAAGC,CAAE,EAAE,MAAM,EAAG,EAE1CT,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAEToB,EAAO,MAAMlpB,CAAC,EACvB,EAsBAknB,EAAE,wBAA0BA,EAAE,MAAQ,UAAY,CAChD,IAAIW,EAAIC,EACN9nB,EAAI,KACJqnB,EAAOrnB,EAAE,YAEX,OAAIA,EAAE,IAAI,CAAC,EAAU,IAAIqnB,EAAKrnB,EAAE,GAAG,CAAC,EAAI,EAAI,GAAG,EAC1CA,EAAE,SAAQ,GAEf6nB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVA,EAAK,UAAYQ,EAAK,KAAK,IAAI,KAAK,IAAI7nB,EAAE,CAAC,EAAGA,EAAE,GAAI,GAAI,EACxDqnB,EAAK,SAAW,EAChBpB,GAAW,GAEXjmB,EAAIA,EAAE,MAAMA,CAAC,EAAE,MAAM,CAAC,EAAE,KAAI,EAAG,KAAKA,CAAC,EAErCimB,GAAW,GACXoB,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAET9nB,EAAE,MAdiB,IAAIqnB,EAAKrnB,CAAC,CAetC,EAmBAknB,EAAE,sBAAwBA,EAAE,MAAQ,UAAY,CAC9C,IAAIW,EAAIC,EACN9nB,EAAI,KACJqnB,EAAOrnB,EAAE,YAEX,MAAI,CAACA,EAAE,SAAQ,GAAMA,EAAE,OAAM,EAAW,IAAIqnB,EAAKrnB,CAAC,GAElD6nB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVA,EAAK,UAAYQ,EAAK,EAAI,KAAK,IAAI,KAAK,IAAI7nB,EAAE,CAAC,EAAGA,EAAE,GAAI,GAAI,EAC5DqnB,EAAK,SAAW,EAChBpB,GAAW,GAEXjmB,EAAIA,EAAE,MAAMA,CAAC,EAAE,KAAK,CAAC,EAAE,KAAI,EAAG,KAAKA,CAAC,EAEpCimB,GAAW,GACXoB,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAET9nB,EAAE,KACX,EAsBAknB,EAAE,yBAA2BA,EAAE,MAAQ,UAAY,CACjD,IAAIW,EAAIC,EAAIsB,EAAKC,EACfrpB,EAAI,KACJqnB,EAAOrnB,EAAE,YAEX,OAAKA,EAAE,SAAQ,EACXA,EAAE,GAAK,EAAU,IAAIqnB,EAAKrnB,EAAE,IAAG,EAAG,GAAG,CAAC,EAAIA,EAAE,EAAI,EAAIA,EAAE,SAAWA,EAAI,GAAG,GAE5E6nB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVgC,EAAMrpB,EAAE,KAEJ,KAAK,IAAIqpB,EAAKxB,CAAE,EAAI,EAAI,CAAC7nB,EAAE,EAAI,EAAUmnB,GAAS,IAAIE,EAAKrnB,CAAC,EAAG6nB,EAAIC,EAAI,EAAI,GAE/ET,EAAK,UAAY+B,EAAMC,EAAMrpB,EAAE,EAE/BA,EAAIuoB,GAAOvoB,EAAE,KAAK,CAAC,EAAG,IAAIqnB,EAAK,CAAC,EAAE,MAAMrnB,CAAC,EAAGopB,EAAMvB,EAAI,CAAC,EAEvDR,EAAK,UAAYQ,EAAK,EACtBR,EAAK,SAAW,EAEhBrnB,EAAIA,EAAE,KAENqnB,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAET9nB,EAAE,MAAM,EAAG,IArBQ,IAAIqnB,EAAK,GAAG,CAsBxC,EAwBAH,EAAE,YAAcA,EAAE,KAAO,UAAY,CACnC,IAAIgC,EAAQ9B,EACVS,EAAIC,EACJ9nB,EAAI,KACJqnB,EAAOrnB,EAAE,YAEX,OAAIA,EAAE,OAAQ,EAAS,IAAIqnB,EAAKrnB,CAAC,GAEjConB,EAAIpnB,EAAE,IAAK,EAAC,IAAI,CAAC,EACjB6nB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SAEND,IAAM,GAGJA,IAAM,GACR8B,EAASC,GAAM9B,EAAMQ,EAAK,EAAGC,CAAE,EAAE,MAAM,EAAG,EAC1CoB,EAAO,EAAIlpB,EAAE,EACNkpB,GAIF,IAAI7B,EAAK,GAAG,GAKrBA,EAAK,UAAYQ,EAAK,EACtBR,EAAK,SAAW,EAEhBrnB,EAAIA,EAAE,IAAI,IAAIqnB,EAAK,CAAC,EAAE,MAAMrnB,EAAE,MAAMA,CAAC,CAAC,EAAE,KAAM,EAAC,KAAK,CAAC,CAAC,EAAE,OAExDqnB,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAET9nB,EAAE,MAAM,CAAC,GAClB,EAqBAknB,EAAE,eAAiBA,EAAE,KAAO,UAAY,CACtC,IAAI9mB,EAAGknB,EAAGF,EAAGxa,EAAG0c,EAAIzc,EAAGC,EAAGsc,EAAKG,EAC7BvpB,EAAI,KACJqnB,EAAOrnB,EAAE,YACT6nB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SAEZ,GAAKrnB,EAAE,WAOA,IAAIA,EAAE,SACX,OAAO,IAAIqnB,EAAKrnB,CAAC,EACZ,GAAIA,EAAE,MAAM,GAAG,CAAC,GAAK6nB,EAAK,GAAKZ,GACpC,OAAAna,EAAIqc,GAAM9B,EAAMQ,EAAK,EAAGC,CAAE,EAAE,MAAM,GAAI,EACtChb,EAAE,EAAI9M,EAAE,EACD8M,MAZU,CACjB,GAAI,CAAC9M,EAAE,EAAG,OAAO,IAAIqnB,EAAK,GAAG,EAC7B,GAAIQ,EAAK,GAAKZ,GACZ,OAAAna,EAAIqc,GAAM9B,EAAMQ,EAAK,EAAGC,CAAE,EAAE,MAAM,EAAG,EACrChb,EAAE,EAAI9M,EAAE,EACD8M,CAEb,CAmBE,IAXAua,EAAK,UAAY+B,EAAMvB,EAAK,GAC5BR,EAAK,SAAW,EAQhBD,EAAI,KAAK,IAAI,GAAIgC,EAAMtC,GAAW,EAAI,CAAC,EAElC1mB,EAAIgnB,EAAGhnB,EAAG,EAAEA,EAAGJ,EAAIA,EAAE,IAAIA,EAAE,MAAMA,CAAC,EAAE,KAAK,CAAC,EAAE,KAAI,EAAG,KAAK,CAAC,CAAC,EAW/D,IATAimB,GAAW,GAEXqB,EAAI,KAAK,KAAK8B,EAAMtC,EAAQ,EAC5Bla,EAAI,EACJ2c,EAAKvpB,EAAE,MAAMA,CAAC,EACd8M,EAAI,IAAIua,EAAKrnB,CAAC,EACdspB,EAAKtpB,EAGEI,IAAM,IAOX,GANAkpB,EAAKA,EAAG,MAAMC,CAAE,EAChB1c,EAAIC,EAAE,MAAMwc,EAAG,IAAI1c,GAAK,CAAC,CAAC,EAE1B0c,EAAKA,EAAG,MAAMC,CAAE,EAChBzc,EAAID,EAAE,KAAKyc,EAAG,IAAI1c,GAAK,CAAC,CAAC,EAErBE,EAAE,EAAEwa,CAAC,IAAM,OAAQ,IAAKlnB,EAAIknB,EAAGxa,EAAE,EAAE1M,CAAC,IAAMyM,EAAE,EAAEzM,CAAC,GAAKA,KAAK,CAG/D,OAAIgnB,IAAGta,EAAIA,EAAE,MAAM,GAAMsa,EAAI,CAAE,GAE/BnB,GAAW,GAEJkB,GAASra,EAAGua,EAAK,UAAYQ,EAAIR,EAAK,SAAWS,EAAI,EAAI,CAClE,EAOAZ,EAAE,SAAW,UAAY,CACvB,MAAO,CAAC,CAAC,KAAK,CAChB,EAOAA,EAAE,UAAYA,EAAE,MAAQ,UAAY,CAClC,MAAO,CAAC,CAAC,KAAK,GAAKX,GAAU,KAAK,EAAIO,EAAQ,EAAI,KAAK,EAAE,OAAS,CACpE,EAOAI,EAAE,MAAQ,UAAY,CACpB,MAAO,CAAC,KAAK,CACf,EAOAA,EAAE,WAAaA,EAAE,MAAQ,UAAY,CACnC,OAAO,KAAK,EAAI,CAClB,EAOAA,EAAE,WAAaA,EAAE,MAAQ,UAAY,CACnC,OAAO,KAAK,EAAI,CAClB,EAOAA,EAAE,OAAS,UAAY,CACrB,MAAO,CAAC,CAAC,KAAK,GAAK,KAAK,EAAE,CAAC,IAAM,CACnC,EAOAA,EAAE,SAAWA,EAAE,GAAK,SAAUvE,EAAG,CAC/B,OAAO,KAAK,IAAIA,CAAC,EAAI,CACvB,EAOAuE,EAAE,kBAAoBA,EAAE,IAAM,SAAUvE,EAAG,CACzC,OAAO,KAAK,IAAIA,CAAC,EAAI,CACvB,EAiCAuE,EAAE,UAAYA,EAAE,IAAM,SAAU5G,EAAM,CACpC,IAAIkJ,EAAU5F,EAAG6F,EAAarC,EAAGsC,EAAKC,EAAKxB,EAAIrb,EAC7CmM,EAAM,KACNoO,EAAOpO,EAAI,YACX4O,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVuC,EAAQ,EAGV,GAAItJ,GAAQ,KACVA,EAAO,IAAI+G,EAAK,EAAE,EAClBmC,EAAW,OACN,CAKL,GAJAlJ,EAAO,IAAI+G,EAAK/G,CAAI,EACpBsD,EAAItD,EAAK,EAGLA,EAAK,EAAI,GAAK,CAACsD,GAAK,CAACA,EAAE,CAAC,GAAKtD,EAAK,GAAG,CAAC,EAAG,OAAO,IAAI+G,EAAK,GAAG,EAEhEmC,EAAWlJ,EAAK,GAAG,EAAE,CACtB,CAKD,GAHAsD,EAAI3K,EAAI,EAGJA,EAAI,EAAI,GAAK,CAAC2K,GAAK,CAACA,EAAE,CAAC,GAAK3K,EAAI,GAAG,CAAC,EACtC,OAAO,IAAIoO,EAAKzD,GAAK,CAACA,EAAE,CAAC,EAAI,KAAS3K,EAAI,GAAK,EAAI,IAAM2K,EAAI,EAAI,GAAK,EAKxE,GAAI4F,EACF,GAAI5F,EAAE,OAAS,EACb8F,EAAM,OACD,CACL,IAAKtC,EAAIxD,EAAE,CAAC,EAAGwD,EAAI,KAAO,GAAIA,GAAK,GACnCsC,EAAMtC,IAAM,CACb,CAyBH,GAtBAnB,GAAW,GACXkC,EAAKN,EAAK+B,EACVD,EAAME,GAAiB5Q,EAAKkP,CAAE,EAC9BsB,EAAcD,EAAWM,GAAQzC,EAAMc,EAAK,EAAE,EAAI0B,GAAiBvJ,EAAM6H,CAAE,EAG3Erb,EAAIyb,GAAOoB,EAAKF,EAAatB,EAAI,CAAC,EAgB9B4B,GAAoBjd,EAAE,EAAGsa,EAAIS,EAAIC,CAAE,EAErC,EAME,IALAK,GAAM,GACNwB,EAAME,GAAiB5Q,EAAKkP,CAAE,EAC9BsB,EAAcD,EAAWM,GAAQzC,EAAMc,EAAK,EAAE,EAAI0B,GAAiBvJ,EAAM6H,CAAE,EAC3Erb,EAAIyb,GAAOoB,EAAKF,EAAatB,EAAI,CAAC,EAE9B,CAACuB,EAAK,CAGJ,CAACpB,GAAexb,EAAE,CAAC,EAAE,MAAMsa,EAAI,EAAGA,EAAI,EAAE,EAAI,GAAK,OACnDta,EAAIqa,GAASra,EAAG+a,EAAK,EAAG,CAAC,GAG3B,KACD,OACMkC,GAAoBjd,EAAE,EAAGsa,GAAK,GAAIU,CAAE,GAG/C,OAAA7B,GAAW,GAEJkB,GAASra,EAAG+a,EAAIC,CAAE,CAC3B,EAgDAZ,EAAE,MAAQA,EAAE,IAAM,SAAUvE,EAAG,CAC7B,IAAIiB,EAAGviB,EAAG,EAAGimB,EAAGF,EAAGnX,EAAK4X,EAAIC,EAAIL,EAAIuC,EAAIC,EAAMvC,EAC5C1nB,EAAI,KACJqnB,EAAOrnB,EAAE,YAKX,GAHA2iB,EAAI,IAAI0E,EAAK1E,CAAC,EAGV,CAAC3iB,EAAE,GAAK,CAAC2iB,EAAE,EAGb,MAAI,CAAC3iB,EAAE,GAAK,CAAC2iB,EAAE,EAAGA,EAAI,IAAI0E,EAAK,GAAG,EAGzBrnB,EAAE,EAAG2iB,EAAE,EAAI,CAACA,EAAE,EAKlBA,EAAI,IAAI0E,EAAK1E,EAAE,GAAK3iB,EAAE,IAAM2iB,EAAE,EAAI3iB,EAAI,GAAG,EAEvC2iB,EAIT,GAAI3iB,EAAE,GAAK2iB,EAAE,EACX,OAAAA,EAAE,EAAI,CAACA,EAAE,EACF3iB,EAAE,KAAK2iB,CAAC,EASjB,GANA8E,EAAKznB,EAAE,EACP0nB,EAAK/E,EAAE,EACPkF,EAAKR,EAAK,UACVS,EAAKT,EAAK,SAGN,CAACI,EAAG,CAAC,GAAK,CAACC,EAAG,CAAC,EAAG,CAGpB,GAAIA,EAAG,CAAC,EAAG/E,EAAE,EAAI,CAACA,EAAE,UAGX8E,EAAG,CAAC,EAAG9E,EAAI,IAAI0E,EAAKrnB,CAAC,MAIzB,QAAO,IAAIqnB,EAAKS,IAAO,EAAI,GAAK,CAAC,EAEtC,OAAO7B,GAAWkB,GAASxE,EAAGkF,EAAIC,CAAE,EAAInF,CACzC,CAYD,GAPAthB,EAAIklB,GAAU5D,EAAE,EAAImE,EAAQ,EAC5BkD,EAAKzD,GAAUvmB,EAAE,EAAI8mB,EAAQ,EAE7BW,EAAKA,EAAG,QACRL,EAAI4C,EAAK3oB,EAGL+lB,EAAG,CAyBL,IAxBA6C,EAAO7C,EAAI,EAEP6C,GACFrG,EAAI6D,EACJL,EAAI,CAACA,EACLnX,EAAMyX,EAAG,SAET9D,EAAI8D,EACJrmB,EAAI2oB,EACJ/Z,EAAMwX,EAAG,QAMX,EAAI,KAAK,IAAI,KAAK,KAAKI,EAAKf,EAAQ,EAAG7W,CAAG,EAAI,EAE1CmX,EAAI,IACNA,EAAI,EACJxD,EAAE,OAAS,GAIbA,EAAE,QAAO,EACJ,EAAIwD,EAAG,KAAMxD,EAAE,KAAK,CAAC,EAC1BA,EAAE,QAAO,CAGb,KAAS,CASL,IALA,EAAI6D,EAAG,OACPxX,EAAMyX,EAAG,OACTuC,EAAO,EAAIha,EACPga,IAAMha,EAAM,GAEX,EAAI,EAAG,EAAIA,EAAK,IACnB,GAAIwX,EAAG,CAAC,GAAKC,EAAG,CAAC,EAAG,CAClBuC,EAAOxC,EAAG,CAAC,EAAIC,EAAG,CAAC,EACnB,KACD,CAGHN,EAAI,CACL,CAaD,IAXI6C,IACFrG,EAAI6D,EACJA,EAAKC,EACLA,EAAK9D,EACLjB,EAAE,EAAI,CAACA,EAAE,GAGX1S,EAAMwX,EAAG,OAIJ,EAAIC,EAAG,OAASzX,EAAK,EAAI,EAAG,EAAE,EAAGwX,EAAGxX,GAAK,EAAI,EAGlD,IAAK,EAAIyX,EAAG,OAAQ,EAAIN,GAAI,CAE1B,GAAIK,EAAG,EAAE,CAAC,EAAIC,EAAG,CAAC,EAAG,CACnB,IAAKJ,EAAI,EAAGA,GAAKG,EAAG,EAAEH,CAAC,IAAM,GAAIG,EAAGH,CAAC,EAAIT,GAAO,EAChD,EAAEY,EAAGH,CAAC,EACNG,EAAG,CAAC,GAAKZ,EACV,CAEDY,EAAG,CAAC,GAAKC,EAAG,CAAC,CACd,CAGD,KAAOD,EAAG,EAAExX,CAAG,IAAM,GAAIwX,EAAG,MAG5B,KAAOA,EAAG,CAAC,IAAM,EAAGA,EAAG,MAAK,EAAI,EAAEpmB,EAGlC,OAAKomB,EAAG,CAAC,GAET9E,EAAE,EAAI8E,EACN9E,EAAE,EAAIuH,GAAkBzC,EAAIpmB,CAAC,EAEtB4kB,GAAWkB,GAASxE,EAAGkF,EAAIC,CAAE,EAAInF,GALrB,IAAI0E,EAAKS,IAAO,EAAI,GAAK,CAAC,CAM/C,EA2BAZ,EAAE,OAASA,EAAE,IAAM,SAAUvE,EAAG,CAC9B,IAAIwH,EACFnqB,EAAI,KACJqnB,EAAOrnB,EAAE,YAKX,OAHA2iB,EAAI,IAAI0E,EAAK1E,CAAC,EAGV,CAAC3iB,EAAE,GAAK,CAAC2iB,EAAE,GAAKA,EAAE,GAAK,CAACA,EAAE,EAAE,CAAC,EAAU,IAAI0E,EAAK,GAAG,EAGnD,CAAC1E,EAAE,GAAK3iB,EAAE,GAAK,CAACA,EAAE,EAAE,CAAC,EAChBmnB,GAAS,IAAIE,EAAKrnB,CAAC,EAAGqnB,EAAK,UAAWA,EAAK,QAAQ,GAI5DpB,GAAW,GAEPoB,EAAK,QAAU,GAIjB8C,EAAI5B,GAAOvoB,EAAG2iB,EAAE,IAAG,EAAI,EAAG,EAAG,CAAC,EAC9BwH,EAAE,GAAKxH,EAAE,GAETwH,EAAI5B,GAAOvoB,EAAG2iB,EAAG,EAAG0E,EAAK,OAAQ,CAAC,EAGpC8C,EAAIA,EAAE,MAAMxH,CAAC,EAEbsD,GAAW,GAEJjmB,EAAE,MAAMmqB,CAAC,EAClB,EASAjD,EAAE,mBAAqBA,EAAE,IAAM,UAAY,CACzC,OAAOkD,GAAmB,IAAI,CAChC,EAQAlD,EAAE,iBAAmBA,EAAE,GAAK,UAAY,CACtC,OAAO2C,GAAiB,IAAI,CAC9B,EAQA3C,EAAE,QAAUA,EAAE,IAAM,UAAY,CAC9B,IAAIlnB,EAAI,IAAI,KAAK,YAAY,IAAI,EACjC,OAAAA,EAAE,EAAI,CAACA,EAAE,EACFmnB,GAASnnB,CAAC,CACnB,EAwBAknB,EAAE,KAAOA,EAAE,IAAM,SAAUvE,EAAG,CAC5B,IAAI0H,EAAOzG,EAAGviB,EAAGjB,EAAGgnB,EAAGnX,EAAK4X,EAAIC,EAAIL,EAAIC,EACtC1nB,EAAI,KACJqnB,EAAOrnB,EAAE,YAKX,GAHA2iB,EAAI,IAAI0E,EAAK1E,CAAC,EAGV,CAAC3iB,EAAE,GAAK,CAAC2iB,EAAE,EAGb,MAAI,CAAC3iB,EAAE,GAAK,CAAC2iB,EAAE,EAAGA,EAAI,IAAI0E,EAAK,GAAG,EAMxBrnB,EAAE,IAAG2iB,EAAI,IAAI0E,EAAK1E,EAAE,GAAK3iB,EAAE,IAAM2iB,EAAE,EAAI3iB,EAAI,GAAG,GAEjD2iB,EAIT,GAAI3iB,EAAE,GAAK2iB,EAAE,EACX,OAAAA,EAAE,EAAI,CAACA,EAAE,EACF3iB,EAAE,MAAM2iB,CAAC,EASlB,GANA8E,EAAKznB,EAAE,EACP0nB,EAAK/E,EAAE,EACPkF,EAAKR,EAAK,UACVS,EAAKT,EAAK,SAGN,CAACI,EAAG,CAAC,GAAK,CAACC,EAAG,CAAC,EAIjB,OAAKA,EAAG,CAAC,IAAG/E,EAAI,IAAI0E,EAAKrnB,CAAC,GAEnBimB,GAAWkB,GAASxE,EAAGkF,EAAIC,CAAE,EAAInF,EAa1C,GAPAyE,EAAIb,GAAUvmB,EAAE,EAAI8mB,EAAQ,EAC5BzlB,EAAIklB,GAAU5D,EAAE,EAAImE,EAAQ,EAE5BW,EAAKA,EAAG,QACRrnB,EAAIgnB,EAAI/lB,EAGJjB,EAAG,CAuBL,IArBIA,EAAI,GACNwjB,EAAI6D,EACJrnB,EAAI,CAACA,EACL6P,EAAMyX,EAAG,SAET9D,EAAI8D,EACJrmB,EAAI+lB,EACJnX,EAAMwX,EAAG,QAIXL,EAAI,KAAK,KAAKS,EAAKf,EAAQ,EAC3B7W,EAAMmX,EAAInX,EAAMmX,EAAI,EAAInX,EAAM,EAE1B7P,EAAI6P,IACN7P,EAAI6P,EACJ2T,EAAE,OAAS,GAIbA,EAAE,QAAO,EACFxjB,KAAMwjB,EAAE,KAAK,CAAC,EACrBA,EAAE,QAAO,CACV,CAcD,IAZA3T,EAAMwX,EAAG,OACTrnB,EAAIsnB,EAAG,OAGHzX,EAAM7P,EAAI,IACZA,EAAI6P,EACJ2T,EAAI8D,EACJA,EAAKD,EACLA,EAAK7D,GAIFyG,EAAQ,EAAGjqB,GACdiqB,GAAS5C,EAAG,EAAErnB,CAAC,EAAIqnB,EAAGrnB,CAAC,EAAIsnB,EAAGtnB,CAAC,EAAIiqB,GAASxD,GAAO,EACnDY,EAAGrnB,CAAC,GAAKymB,GAUX,IAPIwD,IACF5C,EAAG,QAAQ4C,CAAK,EAChB,EAAEhpB,GAKC4O,EAAMwX,EAAG,OAAQA,EAAG,EAAExX,CAAG,GAAK,GAAIwX,EAAG,MAE1C,OAAA9E,EAAE,EAAI8E,EACN9E,EAAE,EAAIuH,GAAkBzC,EAAIpmB,CAAC,EAEtB4kB,GAAWkB,GAASxE,EAAGkF,EAAIC,CAAE,EAAInF,CAC1C,EASAuE,EAAE,UAAYA,EAAE,GAAK,SAAUoD,EAAG,CAChC,IAAIlD,EACFpnB,EAAI,KAEN,GAAIsqB,IAAM,QAAUA,IAAM,CAAC,CAACA,GAAKA,IAAM,GAAKA,IAAM,EAAG,MAAM,MAAMnE,GAAkBmE,CAAC,EAEpF,OAAItqB,EAAE,GACJonB,EAAImD,GAAavqB,EAAE,CAAC,EAChBsqB,GAAKtqB,EAAE,EAAI,EAAIonB,IAAGA,EAAIpnB,EAAE,EAAI,IAEhConB,EAAI,IAGCA,CACT,EAQAF,EAAE,MAAQ,UAAY,CACpB,IAAIlnB,EAAI,KACNqnB,EAAOrnB,EAAE,YAEX,OAAOmnB,GAAS,IAAIE,EAAKrnB,CAAC,EAAGA,EAAE,EAAI,EAAGqnB,EAAK,QAAQ,CACrD,EAkBAH,EAAE,KAAOA,EAAE,IAAM,UAAY,CAC3B,IAAIW,EAAIC,EACN9nB,EAAI,KACJqnB,EAAOrnB,EAAE,YAEX,OAAKA,EAAE,SAAQ,EACXA,EAAE,OAAQ,EAAS,IAAIqnB,EAAKrnB,CAAC,GAEjC6nB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVA,EAAK,UAAYQ,EAAK,KAAK,IAAI7nB,EAAE,EAAGA,EAAE,GAAI,GAAI8mB,GAC9CO,EAAK,SAAW,EAEhBrnB,EAAIwqB,GAAKnD,EAAMW,GAAiBX,EAAMrnB,CAAC,CAAC,EAExCqnB,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAETX,GAASnB,GAAW,EAAIhmB,EAAE,MAAQA,EAAG6nB,EAAIC,EAAI,EAAI,GAb9B,IAAIT,EAAK,GAAG,CAcxC,EAeAH,EAAE,WAAaA,EAAE,KAAO,UAAY,CAClC,IAAIe,EAAGrb,EAAGub,EAAIrb,EAAGob,EAAKrb,EACpB7M,EAAI,KACJ,EAAIA,EAAE,EACNqB,EAAIrB,EAAE,EACNkU,EAAIlU,EAAE,EACNqnB,EAAOrnB,EAAE,YAGX,GAAIkU,IAAM,GAAK,CAAC,GAAK,CAAC,EAAE,CAAC,EACvB,OAAO,IAAImT,EAAK,CAACnT,GAAKA,EAAI,IAAM,CAAC,GAAK,EAAE,CAAC,GAAK,IAAM,EAAIlU,EAAI,GAAK,EAgCnE,IA7BAimB,GAAW,GAGX/R,EAAI,KAAK,KAAK,CAAClU,CAAC,EAIZkU,GAAK,GAAKA,GAAK,KACjBtH,EAAI0b,GAAe,CAAC,GAEf1b,EAAE,OAASvL,GAAK,GAAK,IAAGuL,GAAK,KAClCsH,EAAI,KAAK,KAAKtH,CAAC,EACfvL,EAAIklB,IAAWllB,EAAI,GAAK,CAAC,GAAKA,EAAI,GAAKA,EAAI,GAEvC6S,GAAK,IACPtH,EAAI,KAAOvL,GAEXuL,EAAIsH,EAAE,gBACNtH,EAAIA,EAAE,MAAM,EAAGA,EAAE,QAAQ,GAAG,EAAI,CAAC,EAAIvL,GAGvCyL,EAAI,IAAIua,EAAKza,CAAC,GAEdE,EAAI,IAAIua,EAAKnT,EAAE,SAAU,GAG3BiU,GAAM9mB,EAAIgmB,EAAK,WAAa,IAQ1B,GAJAxa,EAAIC,EACJA,EAAID,EAAE,KAAK0b,GAAOvoB,EAAG6M,EAAGsb,EAAK,EAAG,CAAC,CAAC,EAAE,MAAM,EAAG,EAGzCG,GAAezb,EAAE,CAAC,EAAE,MAAM,EAAGsb,CAAE,KAAOvb,EAAI0b,GAAexb,EAAE,CAAC,GAAG,MAAM,EAAGqb,CAAE,EAK5E,GAJAvb,EAAIA,EAAE,MAAMub,EAAK,EAAGA,EAAK,CAAC,EAItBvb,GAAK,QAAU,CAACsb,GAAOtb,GAAK,OAAQ,CAItC,GAAI,CAACsb,IACHf,GAASta,EAAGxL,EAAI,EAAG,CAAC,EAEhBwL,EAAE,MAAMA,CAAC,EAAE,GAAG7M,CAAC,GAAG,CACpB8M,EAAID,EACJ,KACD,CAGHsb,GAAM,EACND,EAAM,CACd,KAAa,EAID,CAAC,CAACtb,GAAK,CAAC,CAACA,EAAE,MAAM,CAAC,GAAKA,EAAE,OAAO,CAAC,GAAK,OAGxCua,GAASra,EAAGzL,EAAI,EAAG,CAAC,EACpB4mB,EAAI,CAACnb,EAAE,MAAMA,CAAC,EAAE,GAAG9M,CAAC,GAGtB,KACD,CAIL,OAAAimB,GAAW,GAEJkB,GAASra,EAAGzL,EAAGgmB,EAAK,SAAUY,CAAC,CACxC,EAgBAf,EAAE,QAAUA,EAAE,IAAM,UAAY,CAC9B,IAAIW,EAAIC,EACN9nB,EAAI,KACJqnB,EAAOrnB,EAAE,YAEX,OAAKA,EAAE,SAAQ,EACXA,EAAE,OAAQ,EAAS,IAAIqnB,EAAKrnB,CAAC,GAEjC6nB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVA,EAAK,UAAYQ,EAAK,GACtBR,EAAK,SAAW,EAEhBrnB,EAAIA,EAAE,MACNA,EAAE,EAAI,EACNA,EAAIuoB,GAAOvoB,EAAG,IAAIqnB,EAAK,CAAC,EAAE,MAAMrnB,EAAE,MAAMA,CAAC,CAAC,EAAE,KAAI,EAAI6nB,EAAK,GAAI,CAAC,EAE9DR,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAETX,GAASnB,IAAY,GAAKA,IAAY,EAAIhmB,EAAE,IAAG,EAAKA,EAAG6nB,EAAIC,EAAI,EAAI,GAfhD,IAAIT,EAAK,GAAG,CAgBxC,EAwBAH,EAAE,MAAQA,EAAE,IAAM,SAAUvE,EAAG,CAC7B,IAAI0H,EAAOhpB,EAAG,EAAG+lB,EAAGta,EAAG2d,EAAI5d,EAAG0a,EAAKC,EACjCxnB,EAAI,KACJqnB,EAAOrnB,EAAE,YACTynB,EAAKznB,EAAE,EACP0nB,GAAM/E,EAAI,IAAI0E,EAAK1E,CAAC,GAAG,EAKzB,GAHAA,EAAE,GAAK3iB,EAAE,EAGL,CAACynB,GAAM,CAACA,EAAG,CAAC,GAAK,CAACC,GAAM,CAACA,EAAG,CAAC,EAE/B,OAAO,IAAIL,EAAK,CAAC1E,EAAE,GAAK8E,GAAM,CAACA,EAAG,CAAC,GAAK,CAACC,GAAMA,GAAM,CAACA,EAAG,CAAC,GAAK,CAACD,EAI5D,IAIA,CAACA,GAAM,CAACC,EAAK/E,EAAE,EAAI,EAAIA,EAAE,EAAI,CAAC,EAoBpC,IAjBAthB,EAAIklB,GAAUvmB,EAAE,EAAI8mB,EAAQ,EAAIP,GAAU5D,EAAE,EAAImE,EAAQ,EACxDS,EAAME,EAAG,OACTD,EAAME,EAAG,OAGLH,EAAMC,IACR1a,EAAI2a,EACJA,EAAKC,EACLA,EAAK5a,EACL2d,EAAKlD,EACLA,EAAMC,EACNA,EAAMiD,GAIR3d,EAAI,GACJ2d,EAAKlD,EAAMC,EACN,EAAIiD,EAAI,KAAM3d,EAAE,KAAK,CAAC,EAG3B,IAAK,EAAI0a,EAAK,EAAE,GAAK,GAAI,CAEvB,IADA6C,EAAQ,EACHjD,EAAIG,EAAM,EAAGH,EAAI,GACpBva,EAAIC,EAAEsa,CAAC,EAAIM,EAAG,CAAC,EAAID,EAAGL,EAAI,EAAI,CAAC,EAAIiD,EACnCvd,EAAEsa,GAAG,EAAIva,EAAIga,GAAO,EACpBwD,EAAQxd,EAAIga,GAAO,EAGrB/Z,EAAEsa,CAAC,GAAKta,EAAEsa,CAAC,EAAIiD,GAASxD,GAAO,CAChC,CAGD,KAAO,CAAC/Z,EAAE,EAAE2d,CAAE,GAAI3d,EAAE,IAAG,EAEvB,OAAIud,EAAO,EAAEhpB,EACRyL,EAAE,MAAK,EAEZ6V,EAAE,EAAI7V,EACN6V,EAAE,EAAIuH,GAAkBpd,EAAGzL,CAAC,EAErB4kB,GAAWkB,GAASxE,EAAG0E,EAAK,UAAWA,EAAK,QAAQ,EAAI1E,CACjE,EAaAuE,EAAE,SAAW,SAAUiB,EAAIL,EAAI,CAC7B,OAAO4C,GAAe,KAAM,EAAGvC,EAAIL,CAAE,CACvC,EAaAZ,EAAE,gBAAkBA,EAAE,KAAO,SAAUyD,EAAI7C,EAAI,CAC7C,IAAI9nB,EAAI,KACNqnB,EAAOrnB,EAAE,YAGX,OADAA,EAAI,IAAIqnB,EAAKrnB,CAAC,EACV2qB,IAAO,OAAe3qB,GAE1B4qB,GAAWD,EAAI,EAAGjF,EAAU,EAExBoC,IAAO,OAAQA,EAAKT,EAAK,SACxBuD,GAAW9C,EAAI,EAAG,CAAC,EAEjBX,GAASnnB,EAAG2qB,EAAK3qB,EAAE,EAAI,EAAG8nB,CAAE,EACrC,EAWAZ,EAAE,cAAgB,SAAUyD,EAAI7C,EAAI,CAClC,IAAI3F,EACFniB,EAAI,KACJqnB,EAAOrnB,EAAE,YAEX,OAAI2qB,IAAO,OACTxI,EAAM0I,GAAe7qB,EAAG,EAAI,GAE5B4qB,GAAWD,EAAI,EAAGjF,EAAU,EAExBoC,IAAO,OAAQA,EAAKT,EAAK,SACxBuD,GAAW9C,EAAI,EAAG,CAAC,EAExB9nB,EAAImnB,GAAS,IAAIE,EAAKrnB,CAAC,EAAG2qB,EAAK,EAAG7C,CAAE,EACpC3F,EAAM0I,GAAe7qB,EAAG,GAAM2qB,EAAK,CAAC,GAG/B3qB,EAAE,MAAK,GAAM,CAACA,EAAE,SAAW,IAAMmiB,EAAMA,CAChD,EAmBA+E,EAAE,QAAU,SAAUyD,EAAI7C,EAAI,CAC5B,IAAI3F,EAAKQ,EACP3iB,EAAI,KACJqnB,EAAOrnB,EAAE,YAEX,OAAI2qB,IAAO,OACTxI,EAAM0I,GAAe7qB,CAAC,GAEtB4qB,GAAWD,EAAI,EAAGjF,EAAU,EAExBoC,IAAO,OAAQA,EAAKT,EAAK,SACxBuD,GAAW9C,EAAI,EAAG,CAAC,EAExBnF,EAAIwE,GAAS,IAAIE,EAAKrnB,CAAC,EAAG2qB,EAAK3qB,EAAE,EAAI,EAAG8nB,CAAE,EAC1C3F,EAAM0I,GAAelI,EAAG,GAAOgI,EAAKhI,EAAE,EAAI,CAAC,GAKtC3iB,EAAE,MAAK,GAAM,CAACA,EAAE,SAAW,IAAMmiB,EAAMA,CAChD,EAcA+E,EAAE,WAAa,SAAU4D,EAAM,CAC7B,IAAIlH,EAAGmH,EAAIC,EAAIC,EAAI5pB,EAAG+lB,EAAGxa,EAAGse,EAAIC,EAAItD,EAAIsC,EAAGrd,EACzC9M,EAAI,KACJynB,EAAKznB,EAAE,EACPqnB,EAAOrnB,EAAE,YAEX,GAAI,CAACynB,EAAI,OAAO,IAAIJ,EAAKrnB,CAAC,EAU1B,GARAmrB,EAAKJ,EAAK,IAAI1D,EAAK,CAAC,EACpB2D,EAAKE,EAAK,IAAI7D,EAAK,CAAC,EAEpBzD,EAAI,IAAIyD,EAAK2D,CAAE,EACf3pB,EAAIuiB,EAAE,EAAI2G,GAAa9C,CAAE,EAAIznB,EAAE,EAAI,EACnConB,EAAI/lB,EAAIylB,GACRlD,EAAE,EAAE,CAAC,EAAI4C,GAAQ,GAAIY,EAAI,EAAIN,GAAWM,EAAIA,CAAC,EAEzC0D,GAAQ,KAGVA,EAAOzpB,EAAI,EAAIuiB,EAAIuH,MACd,CAEL,GADAve,EAAI,IAAIya,EAAKyD,CAAI,EACb,CAACle,EAAE,MAAO,GAAIA,EAAE,GAAGue,CAAE,EAAG,MAAM,MAAMhF,GAAkBvZ,CAAC,EAC3Dke,EAAOle,EAAE,GAAGgX,CAAC,EAAKviB,EAAI,EAAIuiB,EAAIuH,EAAMve,CACrC,CAOD,IALAqZ,GAAW,GACXrZ,EAAI,IAAIya,EAAKiB,GAAeb,CAAE,CAAC,EAC/BI,EAAKR,EAAK,UACVA,EAAK,UAAYhmB,EAAIomB,EAAG,OAASX,GAAW,EAG1CqD,EAAI5B,GAAO3b,EAAGgX,EAAG,EAAG,EAAG,CAAC,EACxBqH,EAAKF,EAAG,KAAKZ,EAAE,MAAMa,CAAE,CAAC,EACpBC,EAAG,IAAIH,CAAI,GAAK,GACpBC,EAAKC,EACLA,EAAKC,EACLA,EAAKE,EACLA,EAAKD,EAAG,KAAKf,EAAE,MAAMc,CAAE,CAAC,EACxBC,EAAKD,EACLA,EAAKrH,EACLA,EAAIhX,EAAE,MAAMud,EAAE,MAAMc,CAAE,CAAC,EACvBre,EAAIqe,EAGN,OAAAA,EAAK1C,GAAOuC,EAAK,MAAMC,CAAE,EAAGC,EAAI,EAAG,EAAG,CAAC,EACvCE,EAAKA,EAAG,KAAKD,EAAG,MAAME,CAAE,CAAC,EACzBJ,EAAKA,EAAG,KAAKE,EAAG,MAAMD,CAAE,CAAC,EACzBE,EAAG,EAAIC,EAAG,EAAInrB,EAAE,EAGhB8M,EAAIyb,GAAO4C,EAAIH,EAAI3pB,EAAG,CAAC,EAAE,MAAMrB,CAAC,EAAE,IAAK,EAAC,IAAIuoB,GAAO2C,EAAIH,EAAI1pB,EAAG,CAAC,EAAE,MAAMrB,CAAC,EAAE,IAAK,GAAI,EAC7E,CAACmrB,EAAIH,CAAE,EAAI,CAACE,EAAIH,CAAE,EAExB1D,EAAK,UAAYQ,EACjB5B,GAAW,GAEJnZ,CACT,EAaAoa,EAAE,cAAgBA,EAAE,MAAQ,SAAUiB,EAAIL,EAAI,CAC5C,OAAO4C,GAAe,KAAM,GAAIvC,EAAIL,CAAE,CACxC,EAmBAZ,EAAE,UAAY,SAAUvE,EAAGmF,EAAI,CAC7B,IAAI9nB,EAAI,KACNqnB,EAAOrnB,EAAE,YAIX,GAFAA,EAAI,IAAIqnB,EAAKrnB,CAAC,EAEV2iB,GAAK,KAAM,CAGb,GAAI,CAAC3iB,EAAE,EAAG,OAAOA,EAEjB2iB,EAAI,IAAI0E,EAAK,CAAC,EACdS,EAAKT,EAAK,QACd,KAAS,CASL,GARA1E,EAAI,IAAI0E,EAAK1E,CAAC,EACVmF,IAAO,OACTA,EAAKT,EAAK,SAEVuD,GAAW9C,EAAI,EAAG,CAAC,EAIjB,CAAC9nB,EAAE,EAAG,OAAO2iB,EAAE,EAAI3iB,EAAI2iB,EAG3B,GAAI,CAACA,EAAE,EACL,OAAIA,EAAE,IAAGA,EAAE,EAAI3iB,EAAE,GACV2iB,CAEV,CAGD,OAAIA,EAAE,EAAE,CAAC,GACPsD,GAAW,GACXjmB,EAAIuoB,GAAOvoB,EAAG2iB,EAAG,EAAGmF,EAAI,CAAC,EAAE,MAAMnF,CAAC,EAClCsD,GAAW,GACXkB,GAASnnB,CAAC,IAIV2iB,EAAE,EAAI3iB,EAAE,EACRA,EAAI2iB,GAGC3iB,CACT,EAQAknB,EAAE,SAAW,UAAY,CACvB,MAAO,CAAC,IACV,EAaAA,EAAE,QAAU,SAAUiB,EAAIL,EAAI,CAC5B,OAAO4C,GAAe,KAAM,EAAGvC,EAAIL,CAAE,CACvC,EA8CAZ,EAAE,QAAUA,EAAE,IAAM,SAAUvE,EAAG,CAC/B,IAAIthB,EAAG+lB,EAAGS,EAAI/a,EAAGgb,EAAI5T,EACnBlU,EAAI,KACJqnB,EAAOrnB,EAAE,YACTorB,EAAK,EAAEzI,EAAI,IAAI0E,EAAK1E,CAAC,GAGvB,GAAI,CAAC3iB,EAAE,GAAK,CAAC2iB,EAAE,GAAK,CAAC3iB,EAAE,EAAE,CAAC,GAAK,CAAC2iB,EAAE,EAAE,CAAC,EAAG,OAAO,IAAI0E,EAAKb,GAAQ,CAACxmB,EAAGorB,CAAE,CAAC,EAIvE,GAFAprB,EAAI,IAAIqnB,EAAKrnB,CAAC,EAEVA,EAAE,GAAG,CAAC,EAAG,OAAOA,EAKpB,GAHA6nB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SAEN1E,EAAE,GAAG,CAAC,EAAG,OAAOwE,GAASnnB,EAAG6nB,EAAIC,CAAE,EAMtC,GAHAzmB,EAAIklB,GAAU5D,EAAE,EAAImE,EAAQ,EAGxBzlB,GAAKshB,EAAE,EAAE,OAAS,IAAMyE,EAAIgE,EAAK,EAAI,CAACA,EAAKA,IAAOrE,GACpD,OAAAja,EAAIue,GAAOhE,EAAMrnB,EAAGonB,EAAGS,CAAE,EAClBlF,EAAE,EAAI,EAAI,IAAI0E,EAAK,CAAC,EAAE,IAAIva,CAAC,EAAIqa,GAASra,EAAG+a,EAAIC,CAAE,EAM1D,GAHA5T,EAAIlU,EAAE,EAGFkU,EAAI,EAAG,CAGT,GAAI7S,EAAIshB,EAAE,EAAE,OAAS,EAAG,OAAO,IAAI0E,EAAK,GAAG,EAM3C,IAHK1E,EAAE,EAAEthB,CAAC,EAAI,IAAM,IAAG6S,EAAI,GAGvBlU,EAAE,GAAK,GAAKA,EAAE,EAAE,CAAC,GAAK,GAAKA,EAAE,EAAE,QAAU,EAC3C,OAAAA,EAAE,EAAIkU,EACClU,CAEV,CAcD,OARAonB,EAAIZ,GAAQ,CAACxmB,EAAGorB,CAAE,EAClB/pB,EAAI+lB,GAAK,GAAK,CAAC,SAASA,CAAC,EACrBb,GAAU6E,GAAM,KAAK,IAAI,KAAO9C,GAAetoB,EAAE,CAAC,CAAC,EAAI,KAAK,KAAOA,EAAE,EAAI,EAAE,EAC3E,IAAIqnB,EAAKD,EAAI,EAAE,EAAE,EAKjB/lB,EAAIgmB,EAAK,KAAO,GAAKhmB,EAAIgmB,EAAK,KAAO,EAAU,IAAIA,EAAKhmB,EAAI,EAAI6S,EAAI,EAAI,CAAC,GAE7E+R,GAAW,GACXoB,EAAK,SAAWrnB,EAAE,EAAI,EAMtBonB,EAAI,KAAK,IAAI,IAAK/lB,EAAI,IAAI,MAAM,EAGhCyL,EAAIsd,GAAmBzH,EAAE,MAAMkH,GAAiB7pB,EAAG6nB,EAAKT,CAAC,CAAC,EAAGS,CAAE,EAG3D/a,EAAE,IAGJA,EAAIqa,GAASra,EAAG+a,EAAK,EAAG,CAAC,EAIrBkC,GAAoBjd,EAAE,EAAG+a,EAAIC,CAAE,IACjCzmB,EAAIwmB,EAAK,GAGT/a,EAAIqa,GAASiD,GAAmBzH,EAAE,MAAMkH,GAAiB7pB,EAAGqB,EAAI+lB,CAAC,CAAC,EAAG/lB,CAAC,EAAGA,EAAI,EAAG,CAAC,EAG7E,CAACinB,GAAexb,EAAE,CAAC,EAAE,MAAM+a,EAAK,EAAGA,EAAK,EAAE,EAAI,GAAK,OACrD/a,EAAIqa,GAASra,EAAG+a,EAAK,EAAG,CAAC,KAK/B/a,EAAE,EAAIoH,EACN+R,GAAW,GACXoB,EAAK,SAAWS,EAETX,GAASra,EAAG+a,EAAIC,CAAE,EAC3B,EAcAZ,EAAE,YAAc,SAAUiB,EAAIL,EAAI,CAChC,IAAI3F,EACFniB,EAAI,KACJqnB,EAAOrnB,EAAE,YAEX,OAAImoB,IAAO,OACThG,EAAM0I,GAAe7qB,EAAGA,EAAE,GAAKqnB,EAAK,UAAYrnB,EAAE,GAAKqnB,EAAK,QAAQ,GAEpEuD,GAAWzC,EAAI,EAAGzC,EAAU,EAExBoC,IAAO,OAAQA,EAAKT,EAAK,SACxBuD,GAAW9C,EAAI,EAAG,CAAC,EAExB9nB,EAAImnB,GAAS,IAAIE,EAAKrnB,CAAC,EAAGmoB,EAAIL,CAAE,EAChC3F,EAAM0I,GAAe7qB,EAAGmoB,GAAMnoB,EAAE,GAAKA,EAAE,GAAKqnB,EAAK,SAAUc,CAAE,GAGxDnoB,EAAE,MAAK,GAAM,CAACA,EAAE,SAAW,IAAMmiB,EAAMA,CAChD,EAiBA+E,EAAE,oBAAsBA,EAAE,KAAO,SAAUiB,EAAIL,EAAI,CACjD,IAAI9nB,EAAI,KACNqnB,EAAOrnB,EAAE,YAEX,OAAImoB,IAAO,QACTA,EAAKd,EAAK,UACVS,EAAKT,EAAK,WAEVuD,GAAWzC,EAAI,EAAGzC,EAAU,EAExBoC,IAAO,OAAQA,EAAKT,EAAK,SACxBuD,GAAW9C,EAAI,EAAG,CAAC,GAGnBX,GAAS,IAAIE,EAAKrnB,CAAC,EAAGmoB,EAAIL,CAAE,CACrC,EAUAZ,EAAE,SAAW,UAAY,CACvB,IAAIlnB,EAAI,KACNqnB,EAAOrnB,EAAE,YACTmiB,EAAM0I,GAAe7qB,EAAGA,EAAE,GAAKqnB,EAAK,UAAYrnB,EAAE,GAAKqnB,EAAK,QAAQ,EAEtE,OAAOrnB,EAAE,MAAK,GAAM,CAACA,EAAE,SAAW,IAAMmiB,EAAMA,CAChD,EAOA+E,EAAE,UAAYA,EAAE,MAAQ,UAAY,CAClC,OAAOC,GAAS,IAAI,KAAK,YAAY,IAAI,EAAG,KAAK,EAAI,EAAG,CAAC,CAC3D,EAQAD,EAAE,QAAUA,EAAE,OAAS,UAAY,CACjC,IAAIlnB,EAAI,KACNqnB,EAAOrnB,EAAE,YACTmiB,EAAM0I,GAAe7qB,EAAGA,EAAE,GAAKqnB,EAAK,UAAYrnB,EAAE,GAAKqnB,EAAK,QAAQ,EAEtE,OAAOrnB,EAAE,MAAK,EAAK,IAAMmiB,EAAMA,CACjC,EAoDA,SAASmG,GAAe1E,EAAG,CACzB,IAAIxjB,EAAGgnB,EAAGkE,EACRC,EAAkB3H,EAAE,OAAS,EAC7BzB,EAAM,GACNqG,EAAI5E,EAAE,CAAC,EAET,GAAI2H,EAAkB,EAAG,CAEvB,IADApJ,GAAOqG,EACFpoB,EAAI,EAAGA,EAAImrB,EAAiBnrB,IAC/BkrB,EAAK1H,EAAExjB,CAAC,EAAI,GACZgnB,EAAIN,GAAWwE,EAAG,OACdlE,IAAGjF,GAAOqJ,GAAcpE,CAAC,GAC7BjF,GAAOmJ,EAGT9C,EAAI5E,EAAExjB,CAAC,EACPkrB,EAAK9C,EAAI,GACTpB,EAAIN,GAAWwE,EAAG,OACdlE,IAAGjF,GAAOqJ,GAAcpE,CAAC,EACjC,SAAaoB,IAAM,EACf,MAAO,IAIT,KAAOA,EAAI,KAAO,GAAIA,GAAK,GAE3B,OAAOrG,EAAMqG,CACf,CAGA,SAASoC,GAAWxqB,EAAG8B,EAAKC,EAAK,CAC/B,GAAI/B,IAAM,CAAC,CAACA,GAAKA,EAAI8B,GAAO9B,EAAI+B,EAC9B,MAAM,MAAMgkB,GAAkB/lB,CAAC,CAEnC,CAQA,SAAS2pB,GAAoBnG,EAAGxjB,EAAG0nB,EAAI2D,EAAW,CAChD,IAAIC,EAAItE,EAAGta,EAAG6e,EAGd,IAAKvE,EAAIxD,EAAE,CAAC,EAAGwD,GAAK,GAAIA,GAAK,GAAI,EAAEhnB,EAGnC,MAAI,EAAEA,EAAI,GACRA,GAAK0mB,GACL4E,EAAK,IAELA,EAAK,KAAK,MAAMtrB,EAAI,GAAK0mB,EAAQ,EACjC1mB,GAAK0mB,IAMPM,EAAIZ,GAAQ,GAAIM,GAAW1mB,CAAC,EAC5BurB,EAAK/H,EAAE8H,CAAE,EAAItE,EAAI,EAEbqE,GAAa,KACXrrB,EAAI,GACFA,GAAK,EAAGurB,EAAKA,EAAK,IAAM,EACnBvrB,GAAK,IAAGurB,EAAKA,EAAK,GAAK,GAChC7e,EAAIgb,EAAK,GAAK6D,GAAM,OAAS7D,EAAK,GAAK6D,GAAM,OAASA,GAAM,KAASA,GAAM,GAE3E7e,GAAKgb,EAAK,GAAK6D,EAAK,GAAKvE,GAAKU,EAAK,GAAK6D,EAAK,GAAKvE,EAAI,KACnDxD,EAAE8H,EAAK,CAAC,EAAItE,EAAI,IAAM,IAAMZ,GAAQ,GAAIpmB,EAAI,CAAC,EAAI,IAC/CurB,GAAMvE,EAAI,GAAKuE,GAAM,KAAO/H,EAAE8H,EAAK,CAAC,EAAItE,EAAI,IAAM,IAAM,EAG3DhnB,EAAI,GACFA,GAAK,EAAGurB,EAAKA,EAAK,IAAO,EACpBvrB,GAAK,EAAGurB,EAAKA,EAAK,IAAM,EACxBvrB,GAAK,IAAGurB,EAAKA,EAAK,GAAK,GAChC7e,GAAK2e,GAAa3D,EAAK,IAAM6D,GAAM,MAAQ,CAACF,GAAa3D,EAAK,GAAK6D,GAAM,MAEzE7e,IAAM2e,GAAa3D,EAAK,IAAM6D,EAAK,GAAKvE,GACvC,CAACqE,GAAa3D,EAAK,GAAM6D,EAAK,GAAKvE,EAAI,KACrCxD,EAAE8H,EAAK,CAAC,EAAItE,EAAI,IAAO,IAAMZ,GAAQ,GAAIpmB,EAAI,CAAC,EAAI,EAIlD0M,CACT,CAMA,SAAS8e,GAAYzJ,EAAK0J,EAAQC,EAAS,CAOzC,QANIxE,EACF9I,EAAM,CAAC,CAAC,EACRuN,EACA3rB,EAAI,EACJ4rB,EAAO7J,EAAI,OAEN/hB,EAAI4rB,GAAO,CAChB,IAAKD,EAAOvN,EAAI,OAAQuN,KAASvN,EAAIuN,CAAI,GAAKF,EAE9C,IADArN,EAAI,CAAC,GAAKmH,GAAS,QAAQxD,EAAI,OAAO/hB,GAAG,CAAC,EACrCknB,EAAI,EAAGA,EAAI9I,EAAI,OAAQ8I,IACtB9I,EAAI8I,CAAC,EAAIwE,EAAU,IACjBtN,EAAI8I,EAAI,CAAC,IAAM,SAAQ9I,EAAI8I,EAAI,CAAC,EAAI,GACxC9I,EAAI8I,EAAI,CAAC,GAAK9I,EAAI8I,CAAC,EAAIwE,EAAU,EACjCtN,EAAI8I,CAAC,GAAKwE,EAGf,CAED,OAAOtN,EAAI,SACb,CAQA,SAASuJ,GAAOV,EAAMrnB,EAAG,CACvB,IAAIonB,EAAGnX,EAAK0S,EAEZ,GAAI3iB,EAAE,SAAU,OAAOA,EAMvBiQ,EAAMjQ,EAAE,EAAE,OACNiQ,EAAM,IACRmX,EAAI,KAAK,KAAKnX,EAAM,CAAC,EACrB0S,GAAK,EAAI+F,GAAQ,EAAGtB,CAAC,GAAG,aAExBA,EAAI,GACJzE,EAAI,gCAGN0E,EAAK,WAAaD,EAElBpnB,EAAI2oB,GAAatB,EAAM,EAAGrnB,EAAE,MAAM2iB,CAAC,EAAG,IAAI0E,EAAK,CAAC,CAAC,EAGjD,QAASjnB,EAAIgnB,EAAGhnB,KAAM,CACpB,IAAI6rB,EAAQjsB,EAAE,MAAMA,CAAC,EACrBA,EAAIisB,EAAM,MAAMA,CAAK,EAAE,MAAMA,CAAK,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,CACpD,CAED,OAAA5E,EAAK,WAAaD,EAEXpnB,CACT,CAMA,IAAIuoB,GAAU,UAAY,CAGxB,SAAS2D,EAAgBlsB,EAAGonB,EAAG9G,EAAM,CACnC,IAAI6L,EACF9B,EAAQ,EACRjqB,EAAIJ,EAAE,OAER,IAAKA,EAAIA,EAAE,MAAO,EAAEI,KAClB+rB,EAAOnsB,EAAEI,CAAC,EAAIgnB,EAAIiD,EAClBrqB,EAAEI,CAAC,EAAI+rB,EAAO7L,EAAO,EACrB+J,EAAQ8B,EAAO7L,EAAO,EAGxB,OAAI+J,GAAOrqB,EAAE,QAAQqqB,CAAK,EAEnBrqB,CACR,CAED,SAASosB,EAAQvc,EAAGC,EAAGuc,EAAIC,EAAI,CAC7B,IAAIlsB,EAAG0M,EAEP,GAAIuf,GAAMC,EACRxf,EAAIuf,EAAKC,EAAK,EAAI,OAElB,KAAKlsB,EAAI0M,EAAI,EAAG1M,EAAIisB,EAAIjsB,IACtB,GAAIyP,EAAEzP,CAAC,GAAK0P,EAAE1P,CAAC,EAAG,CAChB0M,EAAI+C,EAAEzP,CAAC,EAAI0P,EAAE1P,CAAC,EAAI,EAAI,GACtB,KACD,CAIL,OAAO0M,CACR,CAED,SAASyf,EAAS1c,EAAGC,EAAGuc,EAAI/L,EAAM,CAIhC,QAHIlgB,EAAI,EAGDisB,KACLxc,EAAEwc,CAAE,GAAKjsB,EACTA,EAAIyP,EAAEwc,CAAE,EAAIvc,EAAEuc,CAAE,EAAI,EAAI,EACxBxc,EAAEwc,CAAE,EAAIjsB,EAAIkgB,EAAOzQ,EAAEwc,CAAE,EAAIvc,EAAEuc,CAAE,EAIjC,KAAO,CAACxc,EAAE,CAAC,GAAKA,EAAE,OAAS,GAAIA,EAAE,OAClC,CAED,OAAO,SAAU7P,EAAG2iB,EAAGkF,EAAIC,EAAI6C,EAAIrK,EAAM,CACvC,IAAIkM,EAAKnrB,EAAGjB,EAAGgnB,EAAGqF,EAASC,EAAMC,EAAMC,EAAOzC,EAAG0C,EAAIC,EAAKC,EAAMC,EAAM7E,EAAItb,EAAGogB,EAAIC,EAAIC,EACnFC,EAAIC,EACJhG,EAAOrnB,EAAE,YACTogB,EAAOpgB,EAAE,GAAK2iB,EAAE,EAAI,EAAI,GACxB8E,EAAKznB,EAAE,EACP0nB,EAAK/E,EAAE,EAGT,GAAI,CAAC8E,GAAM,CAACA,EAAG,CAAC,GAAK,CAACC,GAAM,CAACA,EAAG,CAAC,EAE/B,OAAO,IAAIL,EACT,CAACrnB,EAAE,GAAK,CAAC2iB,EAAE,IAAM8E,EAAKC,GAAMD,EAAG,CAAC,GAAKC,EAAG,CAAC,EAAI,CAACA,GAAM,IAGpDD,GAAMA,EAAG,CAAC,GAAK,GAAK,CAACC,EAAKtH,EAAO,EAAIA,EAAO,CAAC,EAmBjD,IAhBIE,GACFmM,EAAU,EACVprB,EAAIrB,EAAE,EAAI2iB,EAAE,IAEZrC,EAAOuG,GACP4F,EAAU3F,GACVzlB,EAAIklB,GAAUvmB,EAAE,EAAIysB,CAAO,EAAIlG,GAAU5D,EAAE,EAAI8J,CAAO,GAGxDW,EAAK1F,EAAG,OACRwF,EAAKzF,EAAG,OACR0C,EAAI,IAAI9C,EAAKjH,CAAI,EACjByM,EAAK1C,EAAE,EAAI,GAIN/pB,EAAI,EAAGsnB,EAAGtnB,CAAC,IAAMqnB,EAAGrnB,CAAC,GAAK,GAAIA,IAAI,CAavC,GAXIsnB,EAAGtnB,CAAC,GAAKqnB,EAAGrnB,CAAC,GAAK,IAAIiB,IAEtBwmB,GAAM,MACRM,EAAKN,EAAKR,EAAK,UACfS,EAAKT,EAAK,UACDsD,EACTxC,EAAKN,GAAM7nB,EAAE,EAAI2iB,EAAE,GAAK,EAExBwF,EAAKN,EAGHM,EAAK,EACP0E,EAAG,KAAK,CAAC,EACTH,EAAO,OACF,CAOL,GAJAvE,EAAKA,EAAKsE,EAAU,EAAI,EACxBrsB,EAAI,EAGAgtB,GAAM,EAAG,CAMX,IALAhG,EAAI,EACJM,EAAKA,EAAG,CAAC,EACTS,KAGQ/nB,EAAI8sB,GAAM9F,IAAMe,IAAM/nB,IAC5ByM,EAAIua,EAAI9G,GAAQmH,EAAGrnB,CAAC,GAAK,GACzBysB,EAAGzsB,CAAC,EAAIyM,EAAI6a,EAAK,EACjBN,EAAIva,EAAI6a,EAAK,EAGfgF,EAAOtF,GAAKhnB,EAAI8sB,CAGxB,KAAa,CAiBL,IAdA9F,EAAI9G,GAAQoH,EAAG,CAAC,EAAI,GAAK,EAErBN,EAAI,IACNM,EAAKwE,EAAgBxE,EAAIN,EAAG9G,CAAI,EAChCmH,EAAKyE,EAAgBzE,EAAIL,EAAG9G,CAAI,EAChC8M,EAAK1F,EAAG,OACRwF,EAAKzF,EAAG,QAGVwF,EAAKG,EACLN,EAAMrF,EAAG,MAAM,EAAG2F,CAAE,EACpBL,EAAOD,EAAI,OAGJC,EAAOK,GAAKN,EAAIC,GAAM,EAAI,EAEjCM,EAAK3F,EAAG,QACR2F,EAAG,QAAQ,CAAC,EACZF,EAAMzF,EAAG,CAAC,EAENA,EAAG,CAAC,GAAKpH,EAAO,GAAG,EAAE6M,EAEzB,GACE/F,EAAI,EAGJoF,EAAMJ,EAAQ1E,EAAIoF,EAAKM,EAAIL,CAAI,EAG3BP,EAAM,GAGRQ,EAAOF,EAAI,CAAC,EACRM,GAAML,IAAMC,EAAOA,EAAO1M,GAAQwM,EAAI,CAAC,GAAK,IAGhD1F,EAAI4F,EAAOG,EAAM,EAUb/F,EAAI,GACFA,GAAK9G,IAAM8G,EAAI9G,EAAO,GAG1BqM,EAAOT,EAAgBxE,EAAIN,EAAG9G,CAAI,EAClCsM,EAAQD,EAAK,OACbI,EAAOD,EAAI,OAGXN,EAAMJ,EAAQO,EAAMG,EAAKF,EAAOG,CAAI,EAGhCP,GAAO,IACTpF,IAGAmF,EAASI,EAAMS,EAAKR,EAAQS,EAAK3F,EAAIkF,EAAOtM,CAAI,KAO9C8G,GAAK,IAAGoF,EAAMpF,EAAI,GACtBuF,EAAOjF,EAAG,SAGZkF,EAAQD,EAAK,OACTC,EAAQG,GAAMJ,EAAK,QAAQ,CAAC,EAGhCJ,EAASO,EAAKH,EAAMI,EAAMzM,CAAI,EAG1BkM,GAAO,KACTO,EAAOD,EAAI,OAGXN,EAAMJ,EAAQ1E,EAAIoF,EAAKM,EAAIL,CAAI,EAG3BP,EAAM,IACRpF,IAGAmF,EAASO,EAAKM,EAAKL,EAAOM,EAAK3F,EAAIqF,EAAMzM,CAAI,IAIjDyM,EAAOD,EAAI,QACFN,IAAQ,IACjBpF,IACA0F,EAAM,CAAC,CAAC,GAIVD,EAAGzsB,GAAG,EAAIgnB,EAGNoF,GAAOM,EAAI,CAAC,EACdA,EAAIC,GAAM,EAAItF,EAAGwF,CAAE,GAAK,GAExBH,EAAM,CAACrF,EAAGwF,CAAE,CAAC,EACbF,EAAO,UAGDE,IAAOC,GAAMJ,EAAI,CAAC,IAAM,SAAW3E,KAE7CuE,EAAOI,EAAI,CAAC,IAAM,MACnB,CAGID,EAAG,CAAC,GAAGA,EAAG,MAAK,CACrB,CAGD,GAAIJ,GAAW,EACbtC,EAAE,EAAI9oB,EACN0kB,GAAU2G,MACL,CAGL,IAAKtsB,EAAI,EAAGgnB,EAAIyF,EAAG,CAAC,EAAGzF,GAAK,GAAIA,GAAK,GAAIhnB,IACzC+pB,EAAE,EAAI/pB,EAAIiB,EAAIorB,EAAU,EAExBtF,GAASgD,EAAGQ,EAAK9C,EAAKsC,EAAE,EAAI,EAAItC,EAAIC,EAAI4E,CAAI,CAC7C,CAED,OAAOvC,CACX,CACA,IAOC,SAAShD,GAASnnB,EAAGmoB,EAAIL,EAAIwF,EAAa,CACzC,IAAIlM,EAAQhhB,EAAGknB,EAAGF,EAAGuE,EAAI4B,EAAS/E,EAAGf,EAAI+F,EACvCnG,EAAOrnB,EAAE,YAGXytB,EAAK,GAAItF,GAAM,KAAM,CAInB,GAHAV,EAAKznB,EAAE,EAGH,CAACynB,EAAI,OAAOznB,EAWhB,IAAKohB,EAAS,EAAGgG,EAAIK,EAAG,CAAC,EAAGL,GAAK,GAAIA,GAAK,GAAIhG,IAI9C,GAHAhhB,EAAI+nB,EAAK/G,EAGLhhB,EAAI,EACNA,GAAK0mB,GACLQ,EAAIa,EACJK,EAAIf,EAAG+F,EAAM,CAAC,EAGd7B,EAAKnD,EAAIhC,GAAQ,GAAIpF,EAASkG,EAAI,CAAC,EAAI,GAAK,UAE5CkG,EAAM,KAAK,MAAMptB,EAAI,GAAK0mB,EAAQ,EAClCM,EAAIK,EAAG,OACH+F,GAAOpG,EACT,GAAIkG,EAAa,CAGf,KAAOlG,KAAOoG,GAAM/F,EAAG,KAAK,CAAC,EAC7Be,EAAImD,EAAK,EACTvK,EAAS,EACThhB,GAAK0mB,GACLQ,EAAIlnB,EAAI0mB,GAAW,CAC7B,KACU,OAAM2G,MAEH,CAIL,IAHAjF,EAAIpB,EAAIK,EAAG+F,CAAG,EAGTpM,EAAS,EAAGgG,GAAK,GAAIA,GAAK,GAAIhG,IAGnChhB,GAAK0mB,GAILQ,EAAIlnB,EAAI0mB,GAAW1F,EAGnBuK,EAAKrE,EAAI,EAAI,EAAIkB,EAAIhC,GAAQ,GAAIpF,EAASkG,EAAI,CAAC,EAAI,GAAK,CACzD,CAmBH,GAfAgG,EAAcA,GAAenF,EAAK,GAChCV,EAAG+F,EAAM,CAAC,IAAM,SAAWlG,EAAI,EAAIkB,EAAIA,EAAIhC,GAAQ,GAAIpF,EAASkG,EAAI,CAAC,GAMvEiG,EAAUzF,EAAK,GACV6D,GAAM2B,KAAiBxF,GAAM,GAAKA,IAAO9nB,EAAE,EAAI,EAAI,EAAI,IACxD2rB,EAAK,GAAKA,GAAM,IAAM7D,GAAM,GAAKwF,GAAexF,GAAM,IAGpD1nB,EAAI,EAAIknB,EAAI,EAAIkB,EAAIhC,GAAQ,GAAIpF,EAASkG,CAAC,EAAI,EAAIG,EAAG+F,EAAM,CAAC,GAAK,GAAM,GACvE1F,IAAO9nB,EAAE,EAAI,EAAI,EAAI,IAEvBmoB,EAAK,GAAK,CAACV,EAAG,CAAC,EACjB,OAAAA,EAAG,OAAS,EACR8F,GAGFpF,GAAMnoB,EAAE,EAAI,EAGZynB,EAAG,CAAC,EAAIjB,GAAQ,IAAKM,GAAWqB,EAAKrB,IAAYA,EAAQ,EACzD9mB,EAAE,EAAI,CAACmoB,GAAM,GAIbV,EAAG,CAAC,EAAIznB,EAAE,EAAI,EAGTA,EAiBT,GAbII,GAAK,GACPqnB,EAAG,OAAS+F,EACZpG,EAAI,EACJoG,MAEA/F,EAAG,OAAS+F,EAAM,EAClBpG,EAAIZ,GAAQ,GAAIM,GAAW1mB,CAAC,EAI5BqnB,EAAG+F,CAAG,EAAIlG,EAAI,GAAKkB,EAAIhC,GAAQ,GAAIpF,EAASkG,CAAC,EAAId,GAAQ,GAAIc,CAAC,EAAI,GAAKF,EAAI,GAGzEmG,EACF,OAGE,GAAIC,GAAO,EAAG,CAGZ,IAAKptB,EAAI,EAAGknB,EAAIG,EAAG,CAAC,EAAGH,GAAK,GAAIA,GAAK,GAAIlnB,IAEzC,IADAknB,EAAIG,EAAG,CAAC,GAAKL,EACRA,EAAI,EAAGE,GAAK,GAAIA,GAAK,GAAIF,IAG1BhnB,GAAKgnB,IACPpnB,EAAE,IACEynB,EAAG,CAAC,GAAKZ,KAAMY,EAAG,CAAC,EAAI,IAG7B,KACV,KAAe,CAEL,GADAA,EAAG+F,CAAG,GAAKpG,EACPK,EAAG+F,CAAG,GAAK3G,GAAM,MACrBY,EAAG+F,GAAK,EAAI,EACZpG,EAAI,CACL,CAKL,IAAKhnB,EAAIqnB,EAAG,OAAQA,EAAG,EAAErnB,CAAC,IAAM,GAAIqnB,EAAG,KACxC,CAED,OAAIxB,KAGEjmB,EAAE,EAAIqnB,EAAK,MAGbrnB,EAAE,EAAI,KACNA,EAAE,EAAI,KAGGA,EAAE,EAAIqnB,EAAK,OAGpBrnB,EAAE,EAAI,EACNA,EAAE,EAAI,CAAC,CAAC,IAKLA,CACT,CAGA,SAAS6qB,GAAe7qB,EAAG0tB,EAAOvF,EAAI,CACpC,GAAI,CAACnoB,EAAE,SAAQ,EAAI,OAAO2tB,GAAkB3tB,CAAC,EAC7C,IAAIonB,EACF/lB,EAAIrB,EAAE,EACNmiB,EAAMmG,GAAetoB,EAAE,CAAC,EACxBiQ,EAAMkS,EAAI,OAEZ,OAAIuL,GACEvF,IAAOf,EAAIe,EAAKlY,GAAO,EACzBkS,EAAMA,EAAI,OAAO,CAAC,EAAI,IAAMA,EAAI,MAAM,CAAC,EAAIqJ,GAAcpE,CAAC,EACjDnX,EAAM,IACfkS,EAAMA,EAAI,OAAO,CAAC,EAAI,IAAMA,EAAI,MAAM,CAAC,GAGzCA,EAAMA,GAAOniB,EAAE,EAAI,EAAI,IAAM,MAAQA,EAAE,GAC9BqB,EAAI,GACb8gB,EAAM,KAAOqJ,GAAc,CAACnqB,EAAI,CAAC,EAAI8gB,EACjCgG,IAAOf,EAAIe,EAAKlY,GAAO,IAAGkS,GAAOqJ,GAAcpE,CAAC,IAC3C/lB,GAAK4O,GACdkS,GAAOqJ,GAAcnqB,EAAI,EAAI4O,CAAG,EAC5BkY,IAAOf,EAAIe,EAAK9mB,EAAI,GAAK,IAAG8gB,EAAMA,EAAM,IAAMqJ,GAAcpE,CAAC,MAE5DA,EAAI/lB,EAAI,GAAK4O,IAAKkS,EAAMA,EAAI,MAAM,EAAGiF,CAAC,EAAI,IAAMjF,EAAI,MAAMiF,CAAC,GAC5De,IAAOf,EAAIe,EAAKlY,GAAO,IACrB5O,EAAI,IAAM4O,IAAKkS,GAAO,KAC1BA,GAAOqJ,GAAcpE,CAAC,IAInBjF,CACT,CAIA,SAAS+H,GAAkB9I,EAAQ/f,EAAG,CACpC,IAAImnB,EAAIpH,EAAO,CAAC,EAGhB,IAAM/f,GAAKylB,GAAU0B,GAAK,GAAIA,GAAK,GAAInnB,IACvC,OAAOA,CACT,CAGA,SAASyoB,GAAQzC,EAAMc,EAAIN,EAAI,CAC7B,GAAIM,EAAKnB,GAGP,MAAAf,GAAW,GACP4B,IAAIR,EAAK,UAAYQ,GACnB,MAAMzB,EAAsB,EAEpC,OAAOe,GAAS,IAAIE,EAAKzB,EAAI,EAAGuC,EAAI,EAAG,EAAI,CAC7C,CAGA,SAASgB,GAAM9B,EAAMc,EAAIL,EAAI,CAC3B,GAAIK,EAAKlB,GAAc,MAAM,MAAMb,EAAsB,EACzD,OAAOe,GAAS,IAAIE,EAAKxB,EAAE,EAAGsC,EAAIL,EAAI,EAAI,CAC5C,CAGA,SAASyC,GAAanJ,EAAQ,CAC5B,IAAIoH,EAAIpH,EAAO,OAAS,EACtBnR,EAAMuY,EAAI1B,GAAW,EAKvB,GAHA0B,EAAIpH,EAAOoH,CAAC,EAGRA,EAAG,CAGL,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIvY,IAG7B,IAAKuY,EAAIpH,EAAO,CAAC,EAAGoH,GAAK,GAAIA,GAAK,GAAIvY,GACvC,CAED,OAAOA,CACT,CAGA,SAASub,GAAcpE,EAAG,CAExB,QADIwG,EAAK,GACFxG,KAAMwG,GAAM,IACnB,OAAOA,CACT,CAUA,SAASvC,GAAOhE,EAAMrnB,EAAG4M,EAAGib,EAAI,CAC9B,IAAIyF,EACFxgB,EAAI,IAAIua,EAAK,CAAC,EAIdD,EAAI,KAAK,KAAKS,EAAKf,GAAW,CAAC,EAIjC,IAFAb,GAAW,KAEF,CAOP,GANIrZ,EAAI,IACNE,EAAIA,EAAE,MAAM9M,CAAC,EACT6tB,GAAS/gB,EAAE,EAAGsa,CAAC,IAAGkG,EAAc,KAGtC1gB,EAAI2Z,GAAU3Z,EAAI,CAAC,EACfA,IAAM,EAAG,CAGXA,EAAIE,EAAE,EAAE,OAAS,EACbwgB,GAAexgB,EAAE,EAAEF,CAAC,IAAM,GAAG,EAAEE,EAAE,EAAEF,CAAC,EACxC,KACD,CAED5M,EAAIA,EAAE,MAAMA,CAAC,EACb6tB,GAAS7tB,EAAE,EAAGonB,CAAC,CAChB,CAED,OAAAnB,GAAW,GAEJnZ,CACT,CAGA,SAASghB,GAAMlhB,EAAG,CAChB,OAAOA,EAAE,EAAEA,EAAE,EAAE,OAAS,CAAC,EAAI,CAC/B,CAMA,SAASmhB,GAAS1G,EAAM3R,EAAMsY,EAAM,CAKlC,QAJIrL,EACF3iB,EAAI,IAAIqnB,EAAK3R,EAAK,CAAC,CAAC,EACpBtV,EAAI,EAEC,EAAEA,EAAIsV,EAAK,QAEhB,GADAiN,EAAI,IAAI0E,EAAK3R,EAAKtV,CAAC,CAAC,EACfuiB,EAAE,EAGI3iB,EAAEguB,CAAI,EAAErL,CAAC,IAClB3iB,EAAI2iB,OAJI,CACR3iB,EAAI2iB,EACJ,KACD,CAKH,OAAO3iB,CACT,CAkCA,SAASoqB,GAAmBpqB,EAAGmoB,EAAI,CACjC,IAAIsB,EAAaG,EAAOtC,EAAG2G,EAAKC,EAAKrhB,EAAGuc,EACtClB,EAAM,EACN9nB,EAAI,EACJgnB,EAAI,EACJC,EAAOrnB,EAAE,YACT8nB,EAAKT,EAAK,SACVQ,EAAKR,EAAK,UAGZ,GAAI,CAACrnB,EAAE,GAAK,CAACA,EAAE,EAAE,CAAC,GAAKA,EAAE,EAAI,GAE3B,OAAO,IAAIqnB,EAAKrnB,EAAE,EACbA,EAAE,EAAE,CAAC,EAAQA,EAAE,EAAI,EAAI,EAAI,IAAlB,EACVA,EAAE,EAAIA,EAAE,EAAI,EAAI,EAAIA,EAAI,GAAK,EAanC,IAVImoB,GAAM,MACRlC,GAAW,GACXmD,EAAMvB,GAENuB,EAAMjB,EAGRtb,EAAI,IAAIwa,EAAK,MAAO,EAGbrnB,EAAE,EAAI,IAGXA,EAAIA,EAAE,MAAM6M,CAAC,EACbua,GAAK,EAUP,IALAwC,EAAQ,KAAK,IAAIpD,GAAQ,EAAGY,CAAC,CAAC,EAAI,KAAK,KAAO,EAAI,EAAI,EACtDgC,GAAOQ,EACPH,EAAcwE,EAAMC,EAAM,IAAI7G,EAAK,CAAC,EACpCA,EAAK,UAAY+B,IAER,CAKP,GAJA6E,EAAM9G,GAAS8G,EAAI,MAAMjuB,CAAC,EAAGopB,EAAK,CAAC,EACnCK,EAAcA,EAAY,MAAM,EAAErpB,CAAC,EACnCyM,EAAIqhB,EAAI,KAAK3F,GAAO0F,EAAKxE,EAAaL,EAAK,CAAC,CAAC,EAEzCd,GAAezb,EAAE,CAAC,EAAE,MAAM,EAAGuc,CAAG,IAAMd,GAAe4F,EAAI,CAAC,EAAE,MAAM,EAAG9E,CAAG,EAAG,CAE7E,IADA9B,EAAIF,EACGE,KAAK4G,EAAM/G,GAAS+G,EAAI,MAAMA,CAAG,EAAG9E,EAAK,CAAC,EAOjD,GAAIjB,GAAM,KAER,GAAID,EAAM,GAAK6B,GAAoBmE,EAAI,EAAG9E,EAAMQ,EAAO9B,EAAII,CAAG,EAC5Db,EAAK,UAAY+B,GAAO,GACxBK,EAAcwE,EAAMphB,EAAI,IAAIwa,EAAK,CAAC,EAClCjnB,EAAI,EACJ8nB,QAEA,QAAOf,GAAS+G,EAAK7G,EAAK,UAAYQ,EAAIC,EAAI7B,GAAW,EAAI,MAG/D,QAAAoB,EAAK,UAAYQ,EACVqG,CAEV,CAEDA,EAAMrhB,CACP,CACH,CAkBA,SAASgd,GAAiBlH,EAAGwF,EAAI,CAC/B,IAAI/P,EAAG+V,EAAI1E,EAAapoB,EAAG+sB,EAAWlG,EAAKgG,EAAKrhB,EAAGuc,EAAKiF,EAAI9E,EAC1D3c,EAAI,EACJgd,EAAQ,GACR5pB,EAAI2iB,EACJ8E,EAAKznB,EAAE,EACPqnB,EAAOrnB,EAAE,YACT8nB,EAAKT,EAAK,SACVQ,EAAKR,EAAK,UAGZ,GAAIrnB,EAAE,EAAI,GAAK,CAACynB,GAAM,CAACA,EAAG,CAAC,GAAK,CAACznB,EAAE,GAAKynB,EAAG,CAAC,GAAK,GAAKA,EAAG,QAAU,EACjE,OAAO,IAAIJ,EAAKI,GAAM,CAACA,EAAG,CAAC,EAAI,KAASznB,EAAE,GAAK,EAAI,IAAMynB,EAAK,EAAIznB,CAAC,EAcrE,GAXImoB,GAAM,MACRlC,GAAW,GACXmD,EAAMvB,GAENuB,EAAMjB,EAGRd,EAAK,UAAY+B,GAAOQ,EACxBxR,EAAIkQ,GAAeb,CAAE,EACrB0G,EAAK/V,EAAE,OAAO,CAAC,EAEX,KAAK,IAAI/W,EAAIrB,EAAE,CAAC,EAAI,MAAQ,CAa9B,KAAOmuB,EAAK,GAAKA,GAAM,GAAKA,GAAM,GAAK/V,EAAE,OAAO,CAAC,EAAI,GACnDpY,EAAIA,EAAE,MAAM2iB,CAAC,EACbvK,EAAIkQ,GAAetoB,EAAE,CAAC,EACtBmuB,EAAK/V,EAAE,OAAO,CAAC,EACfxL,IAGFvL,EAAIrB,EAAE,EAEFmuB,EAAK,GACPnuB,EAAI,IAAIqnB,EAAK,KAAOjP,CAAC,EACrB/W,KAEArB,EAAI,IAAIqnB,EAAK8G,EAAK,IAAM/V,EAAE,MAAM,CAAC,CAAC,CAExC,KAKI,QAAAvL,EAAIid,GAAQzC,EAAM+B,EAAM,EAAGvB,CAAE,EAAE,MAAMxmB,EAAI,EAAE,EAC3CrB,EAAI6pB,GAAiB,IAAIxC,EAAK8G,EAAK,IAAM/V,EAAE,MAAM,CAAC,CAAC,EAAGgR,EAAMQ,CAAK,EAAE,KAAK/c,CAAC,EACzEwa,EAAK,UAAYQ,EAEVM,GAAM,KAAOhB,GAASnnB,EAAG6nB,EAAIC,EAAI7B,GAAW,EAAI,EAAIjmB,EAa7D,IATAquB,EAAKruB,EAKLkuB,EAAME,EAAYpuB,EAAIuoB,GAAOvoB,EAAE,MAAM,CAAC,EAAGA,EAAE,KAAK,CAAC,EAAGopB,EAAK,CAAC,EAC1DG,EAAKpC,GAASnnB,EAAE,MAAMA,CAAC,EAAGopB,EAAK,CAAC,EAChCK,EAAc,IAEL,CAIP,GAHA2E,EAAYjH,GAASiH,EAAU,MAAM7E,CAAE,EAAGH,EAAK,CAAC,EAChDvc,EAAIqhB,EAAI,KAAK3F,GAAO6F,EAAW,IAAI/G,EAAKoC,CAAW,EAAGL,EAAK,CAAC,CAAC,EAEzDd,GAAezb,EAAE,CAAC,EAAE,MAAM,EAAGuc,CAAG,IAAMd,GAAe4F,EAAI,CAAC,EAAE,MAAM,EAAG9E,CAAG,EAc1E,GAbA8E,EAAMA,EAAI,MAAM,CAAC,EAIb7sB,IAAM,IAAG6sB,EAAMA,EAAI,KAAKpE,GAAQzC,EAAM+B,EAAM,EAAGvB,CAAE,EAAE,MAAMxmB,EAAI,EAAE,CAAC,GACpE6sB,EAAM3F,GAAO2F,EAAK,IAAI7G,EAAKza,CAAC,EAAGwc,EAAK,CAAC,EAQjCjB,GAAM,KACR,GAAI4B,GAAoBmE,EAAI,EAAG9E,EAAMQ,EAAO9B,EAAII,CAAG,EACjDb,EAAK,UAAY+B,GAAOQ,EACxB/c,EAAIuhB,EAAYpuB,EAAIuoB,GAAO8F,EAAG,MAAM,CAAC,EAAGA,EAAG,KAAK,CAAC,EAAGjF,EAAK,CAAC,EAC1DG,EAAKpC,GAASnnB,EAAE,MAAMA,CAAC,EAAGopB,EAAK,CAAC,EAChCK,EAAcvB,EAAM,MAEpB,QAAOf,GAAS+G,EAAK7G,EAAK,UAAYQ,EAAIC,EAAI7B,GAAW,EAAI,MAG/D,QAAAoB,EAAK,UAAYQ,EACVqG,EAIXA,EAAMrhB,EACN4c,GAAe,CAChB,CACH,CAIA,SAASkE,GAAkB3tB,EAAG,CAE5B,OAAO,OAAOA,EAAE,EAAIA,EAAE,EAAI,CAAC,CAC7B,CAMA,SAASsuB,GAAatuB,EAAGmiB,EAAK,CAC5B,IAAI9gB,EAAG,EAAG4O,EAmBV,KAhBK5O,EAAI8gB,EAAI,QAAQ,GAAG,GAAK,KAAIA,EAAMA,EAAI,QAAQ,IAAK,EAAE,IAGrD,EAAIA,EAAI,OAAO,IAAI,GAAK,GAGvB9gB,EAAI,IAAGA,EAAI,GACfA,GAAK,CAAC8gB,EAAI,MAAM,EAAI,CAAC,EACrBA,EAAMA,EAAI,UAAU,EAAG,CAAC,GACf9gB,EAAI,IAGbA,EAAI8gB,EAAI,QAIL,EAAI,EAAGA,EAAI,WAAW,CAAC,IAAM,GAAI,IAAI,CAG1C,IAAKlS,EAAMkS,EAAI,OAAQA,EAAI,WAAWlS,EAAM,CAAC,IAAM,GAAI,EAAEA,EAAI,CAG7D,GAFAkS,EAAMA,EAAI,MAAM,EAAGlS,CAAG,EAElBkS,EAAK,CAYP,GAXAlS,GAAO,EACPjQ,EAAE,EAAIqB,EAAIA,EAAI,EAAI,EAClBrB,EAAE,EAAI,GAMN,GAAKqB,EAAI,GAAKylB,GACVzlB,EAAI,IAAG,GAAKylB,IAEZ,EAAI7W,EAAK,CAEX,IADI,GAAGjQ,EAAE,EAAE,KAAK,CAACmiB,EAAI,MAAM,EAAG,CAAC,CAAC,EAC3BlS,GAAO6W,GAAU,EAAI7W,GAAMjQ,EAAE,EAAE,KAAK,CAACmiB,EAAI,MAAM,EAAG,GAAK2E,EAAQ,CAAC,EACrE3E,EAAMA,EAAI,MAAM,CAAC,EACjB,EAAI2E,GAAW3E,EAAI,MACzB,MACM,GAAKlS,EAGP,KAAO,KAAMkS,GAAO,IACpBniB,EAAE,EAAE,KAAK,CAACmiB,CAAG,EAET8D,KAGEjmB,EAAE,EAAIA,EAAE,YAAY,MAGtBA,EAAE,EAAI,KACNA,EAAE,EAAI,KAGGA,EAAE,EAAIA,EAAE,YAAY,OAG7BA,EAAE,EAAI,EACNA,EAAE,EAAI,CAAC,CAAC,GAIhB,MAGIA,EAAE,EAAI,EACNA,EAAE,EAAI,CAAC,CAAC,EAGV,OAAOA,CACT,CAMA,SAASuuB,GAAWvuB,EAAGmiB,EAAK,CAC1B,IAAI7B,EAAM+G,EAAMmH,EAASpuB,EAAGquB,EAASxe,EAAK4D,EAAG4T,EAAIuC,EAEjD,GAAI7H,EAAI,QAAQ,GAAG,EAAI,IAErB,GADAA,EAAMA,EAAI,QAAQ,eAAgB,IAAI,EAClCyE,GAAU,KAAKzE,CAAG,EAAG,OAAOmM,GAAatuB,EAAGmiB,CAAG,UAC1CA,IAAQ,YAAcA,IAAQ,MACvC,MAAK,CAACA,IAAKniB,EAAE,EAAI,KACjBA,EAAE,EAAI,IACNA,EAAE,EAAI,KACCA,EAGT,GAAI0mB,GAAM,KAAKvE,CAAG,EAChB7B,EAAO,GACP6B,EAAMA,EAAI,sBACDsE,GAAS,KAAKtE,CAAG,EAC1B7B,EAAO,UACEqG,GAAQ,KAAKxE,CAAG,EACzB7B,EAAO,MAEP,OAAM,MAAM6F,GAAkBhE,CAAG,EAgCnC,IA5BA/hB,EAAI+hB,EAAI,OAAO,IAAI,EAEf/hB,EAAI,GACNyT,EAAI,CAACsO,EAAI,MAAM/hB,EAAI,CAAC,EACpB+hB,EAAMA,EAAI,UAAU,EAAG/hB,CAAC,GAExB+hB,EAAMA,EAAI,MAAM,CAAC,EAKnB/hB,EAAI+hB,EAAI,QAAQ,GAAG,EACnBsM,EAAUruB,GAAK,EACfinB,EAAOrnB,EAAE,YAELyuB,IACFtM,EAAMA,EAAI,QAAQ,IAAK,EAAE,EACzBlS,EAAMkS,EAAI,OACV/hB,EAAI6P,EAAM7P,EAGVouB,EAAUnD,GAAOhE,EAAM,IAAIA,EAAK/G,CAAI,EAAGlgB,EAAGA,EAAI,CAAC,GAGjDqnB,EAAKmE,GAAYzJ,EAAK7B,EAAMuG,EAAI,EAChCmD,EAAKvC,EAAG,OAAS,EAGZrnB,EAAI4pB,EAAIvC,EAAGrnB,CAAC,IAAM,EAAG,EAAEA,EAAGqnB,EAAG,MAClC,OAAIrnB,EAAI,EAAU,IAAIinB,EAAKrnB,EAAE,EAAI,CAAC,GAClCA,EAAE,EAAIkqB,GAAkBzC,EAAIuC,CAAE,EAC9BhqB,EAAE,EAAIynB,EACNxB,GAAW,GAQPwI,IAASzuB,EAAIuoB,GAAOvoB,EAAGwuB,EAASve,EAAM,CAAC,GAGvC4D,IAAG7T,EAAIA,EAAE,MAAM,KAAK,IAAI6T,CAAC,EAAI,GAAK2S,GAAQ,EAAG3S,CAAC,EAAI6a,GAAQ,IAAI,EAAG7a,CAAC,CAAC,GACvEoS,GAAW,GAEJjmB,EACT,CAQA,SAASwqB,GAAKnD,EAAMrnB,EAAG,CACrB,IAAIonB,EACFnX,EAAMjQ,EAAE,EAAE,OAEZ,GAAIiQ,EAAM,EACR,OAAOjQ,EAAE,OAAQ,EAAGA,EAAI2oB,GAAatB,EAAM,EAAGrnB,EAAGA,CAAC,EAQpDonB,EAAI,IAAM,KAAK,KAAKnX,CAAG,EACvBmX,EAAIA,EAAI,GAAK,GAAKA,EAAI,EAEtBpnB,EAAIA,EAAE,MAAM,EAAI0oB,GAAQ,EAAGtB,CAAC,CAAC,EAC7BpnB,EAAI2oB,GAAatB,EAAM,EAAGrnB,EAAGA,CAAC,EAO9B,QAJI2uB,EACF5F,EAAK,IAAI1B,EAAK,CAAC,EACf2B,EAAM,IAAI3B,EAAK,EAAE,EACjB4B,EAAM,IAAI5B,EAAK,EAAE,EACZD,KACLuH,EAAS3uB,EAAE,MAAMA,CAAC,EAClBA,EAAIA,EAAE,MAAM+oB,EAAG,KAAK4F,EAAO,MAAM3F,EAAI,MAAM2F,CAAM,EAAE,MAAM1F,CAAG,CAAC,CAAC,CAAC,EAGjE,OAAOjpB,CACT,CAIA,SAAS2oB,GAAatB,EAAMza,EAAG5M,EAAG2iB,EAAGiM,EAAc,CAC9C,IAACtH,EAAGza,EAAGgiB,EAAGtF,EAEX1B,EAAKR,EAAK,UACVD,EAAI,KAAK,KAAKS,EAAKf,EAAQ,EAM7B,IAJAb,GAAW,GACXsD,EAAKvpB,EAAE,MAAMA,CAAC,EACd6uB,EAAI,IAAIxH,EAAK1E,CAAC,IAEL,CAMP,GALA9V,EAAI0b,GAAOsG,EAAE,MAAMtF,CAAE,EAAG,IAAIlC,EAAKza,IAAMA,GAAG,EAAGib,EAAI,CAAC,EAClDgH,EAAID,EAAejM,EAAE,KAAK9V,CAAC,EAAI8V,EAAE,MAAM9V,CAAC,EACxC8V,EAAI4F,GAAO1b,EAAE,MAAM0c,CAAE,EAAG,IAAIlC,EAAKza,IAAMA,GAAG,EAAGib,EAAI,CAAC,EAClDhb,EAAIgiB,EAAE,KAAKlM,CAAC,EAER9V,EAAE,EAAEua,CAAC,IAAM,OAAQ,CACrB,IAAKE,EAAIF,EAAGva,EAAE,EAAEya,CAAC,IAAMuH,EAAE,EAAEvH,CAAC,GAAKA,KAAK,CACtC,GAAIA,GAAK,GAAI,KACd,CAEDA,EAAIuH,EACJA,EAAIlM,EACJA,EAAI9V,EACJA,EAAIya,CAEL,CAED,OAAArB,GAAW,GACXpZ,EAAE,EAAE,OAASua,EAAI,EAEVva,CACT,CAIA,SAAS6b,GAAQ5Y,EAAGzO,EAAG,CAErB,QADIuL,EAAIkD,EACD,EAAEzO,GAAGuL,GAAKkD,EACjB,OAAOlD,CACT,CAIA,SAASob,GAAiBX,EAAMrnB,EAAG,CACjC,IAAI6M,EACFiiB,EAAQ9uB,EAAE,EAAI,EACd+uB,EAAK5F,GAAM9B,EAAMA,EAAK,UAAW,CAAC,EAClC6B,EAAS6F,EAAG,MAAM,EAAG,EAIvB,GAFA/uB,EAAIA,EAAE,MAEFA,EAAE,IAAIkpB,CAAM,EACd,OAAAlD,GAAW8I,EAAQ,EAAI,EAChB9uB,EAKT,GAFA6M,EAAI7M,EAAE,SAAS+uB,CAAE,EAEbliB,EAAE,SACJmZ,GAAW8I,EAAQ,EAAI,MAClB,CAIL,GAHA9uB,EAAIA,EAAE,MAAM6M,EAAE,MAAMkiB,CAAE,CAAC,EAGnB/uB,EAAE,IAAIkpB,CAAM,EACd,OAAAlD,GAAW8H,GAAMjhB,CAAC,EAAKiiB,EAAQ,EAAI,EAAMA,EAAQ,EAAI,EAC9C9uB,EAGTgmB,GAAW8H,GAAMjhB,CAAC,EAAKiiB,EAAQ,EAAI,EAAMA,EAAQ,EAAI,CACtD,CAED,OAAO9uB,EAAE,MAAM+uB,CAAE,EAAE,IAAG,CACxB,CAQA,SAASrE,GAAe1qB,EAAG8rB,EAAS3D,EAAIL,EAAI,CAC1C,IAAIxH,EAAMjf,EAAGjB,EAAGgnB,EAAGnX,EAAKsd,EAASpL,EAAKsF,EAAI9E,EACxC0E,EAAOrnB,EAAE,YACT0tB,EAAQvF,IAAO,OAWjB,GATIuF,GACF9C,GAAWzC,EAAI,EAAGzC,EAAU,EACxBoC,IAAO,OAAQA,EAAKT,EAAK,SACxBuD,GAAW9C,EAAI,EAAG,CAAC,IAExBK,EAAKd,EAAK,UACVS,EAAKT,EAAK,UAGR,CAACrnB,EAAE,WACLmiB,EAAMwL,GAAkB3tB,CAAC,MACpB,CAoCL,IAnCAmiB,EAAM0I,GAAe7qB,CAAC,EACtBI,EAAI+hB,EAAI,QAAQ,GAAG,EAOfuL,GACFpN,EAAO,EACHwL,GAAW,GACb3D,EAAKA,EAAK,EAAI,EACL2D,GAAW,IACpB3D,EAAKA,EAAK,EAAI,IAGhB7H,EAAOwL,EAOL1rB,GAAK,IACP+hB,EAAMA,EAAI,QAAQ,IAAK,EAAE,EACzBQ,EAAI,IAAI0E,EAAK,CAAC,EACd1E,EAAE,EAAIR,EAAI,OAAS/hB,EACnBuiB,EAAE,EAAIiJ,GAAYf,GAAelI,CAAC,EAAG,GAAIrC,CAAI,EAC7CqC,EAAE,EAAIA,EAAE,EAAE,QAGZ8E,EAAKmE,GAAYzJ,EAAK,GAAI7B,CAAI,EAC9Bjf,EAAI4O,EAAMwX,EAAG,OAGNA,EAAG,EAAExX,CAAG,GAAK,GAAIwX,EAAG,MAE3B,GAAI,CAACA,EAAG,CAAC,EACPtF,EAAMuL,EAAQ,OAAS,QAClB,CAyBL,GAxBIttB,EAAI,EACNiB,KAEArB,EAAI,IAAIqnB,EAAKrnB,CAAC,EACdA,EAAE,EAAIynB,EACNznB,EAAE,EAAIqB,EACNrB,EAAIuoB,GAAOvoB,EAAG2iB,EAAGwF,EAAIL,EAAI,EAAGxH,CAAI,EAChCmH,EAAKznB,EAAE,EACPqB,EAAIrB,EAAE,EACNutB,EAAUxH,IAIZ3lB,EAAIqnB,EAAGU,CAAE,EACTf,EAAI9G,EAAO,EACXiN,EAAUA,GAAW9F,EAAGU,EAAK,CAAC,IAAM,OAEpCoF,EAAUzF,EAAK,GACV1nB,IAAM,QAAUmtB,KAAazF,IAAO,GAAKA,KAAQ9nB,EAAE,EAAI,EAAI,EAAI,IAChEI,EAAIgnB,GAAKhnB,IAAMgnB,IAAMU,IAAO,GAAKyF,GAAWzF,IAAO,GAAKL,EAAGU,EAAK,CAAC,EAAI,GACrEL,KAAQ9nB,EAAE,EAAI,EAAI,EAAI,IAE1BynB,EAAG,OAASU,EAERoF,EAGF,KAAO,EAAE9F,EAAG,EAAEU,CAAE,EAAI7H,EAAO,GACzBmH,EAAGU,CAAE,EAAI,EACJA,IACH,EAAE9mB,EACFomB,EAAG,QAAQ,CAAC,GAMlB,IAAKxX,EAAMwX,EAAG,OAAQ,CAACA,EAAGxX,EAAM,CAAC,EAAG,EAAEA,EAAI,CAG1C,IAAK7P,EAAI,EAAG+hB,EAAM,GAAI/hB,EAAI6P,EAAK7P,IAAK+hB,GAAOwD,GAAS,OAAO8B,EAAGrnB,CAAC,CAAC,EAGhE,GAAIstB,EAAO,CACT,GAAIzd,EAAM,EACR,GAAI6b,GAAW,IAAMA,GAAW,EAAG,CAEjC,IADA1rB,EAAI0rB,GAAW,GAAK,EAAI,EACnB,EAAE7b,EAAKA,EAAM7P,EAAG6P,IAAOkS,GAAO,IAEnC,IADAsF,EAAKmE,GAAYzJ,EAAK7B,EAAMwL,CAAO,EAC9B7b,EAAMwX,EAAG,OAAQ,CAACA,EAAGxX,EAAM,CAAC,EAAG,EAAEA,EAAI,CAG1C,IAAK7P,EAAI,EAAG+hB,EAAM,KAAM/hB,EAAI6P,EAAK7P,IAAK+hB,GAAOwD,GAAS,OAAO8B,EAAGrnB,CAAC,CAAC,CAC9E,MACY+hB,EAAMA,EAAI,OAAO,CAAC,EAAI,IAAMA,EAAI,MAAM,CAAC,EAI3CA,EAAOA,GAAO9gB,EAAI,EAAI,IAAM,MAAQA,CAC5C,SAAiBA,EAAI,EAAG,CAChB,KAAO,EAAEA,GAAI8gB,EAAM,IAAMA,EACzBA,EAAM,KAAOA,CACrB,SACY,EAAE9gB,EAAI4O,EAAK,IAAK5O,GAAK4O,EAAK5O,KAAO8gB,GAAO,SACnC9gB,EAAI4O,IAAKkS,EAAMA,EAAI,MAAM,EAAG9gB,CAAC,EAAI,IAAM8gB,EAAI,MAAM9gB,CAAC,EAE9D,CAED8gB,GAAO2J,GAAW,GAAK,KAAOA,GAAW,EAAI,KAAOA,GAAW,EAAI,KAAO,IAAM3J,CACjF,CAED,OAAOniB,EAAE,EAAI,EAAI,IAAMmiB,EAAMA,CAC/B,CAIA,SAAS0L,GAASrP,EAAKvO,EAAK,CAC1B,GAAIuO,EAAI,OAASvO,EACf,OAAAuO,EAAI,OAASvO,EACN,EAEX,CAyDA,SAAS+e,GAAIhvB,EAAG,CACd,OAAO,IAAI,KAAKA,CAAC,EAAE,IAAG,CACxB,CASA,SAASivB,GAAKjvB,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,KAAI,CACzB,CAUA,SAASkvB,GAAMlvB,EAAG,CAChB,OAAO,IAAI,KAAKA,CAAC,EAAE,MAAK,CAC1B,CAWA,SAASmvB,GAAInvB,EAAG2iB,EAAG,CACjB,OAAO,IAAI,KAAK3iB,CAAC,EAAE,KAAK2iB,CAAC,CAC3B,CAUA,SAASyM,GAAKpvB,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,KAAI,CACzB,CAUA,SAASqvB,GAAMrvB,EAAG,CAChB,OAAO,IAAI,KAAKA,CAAC,EAAE,MAAK,CAC1B,CAUA,SAASsvB,GAAKtvB,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,KAAI,CACzB,CAUA,SAASuvB,GAAMvvB,EAAG,CAChB,OAAO,IAAI,KAAKA,CAAC,EAAE,MAAK,CAC1B,CA4BA,SAASwvB,GAAM7M,EAAG3iB,EAAG,CACnB2iB,EAAI,IAAI,KAAKA,CAAC,EACd3iB,EAAI,IAAI,KAAKA,CAAC,EACd,IAAI,EACF6nB,EAAK,KAAK,UACVC,EAAK,KAAK,SACVsB,EAAMvB,EAAK,EAGb,MAAI,CAAClF,EAAE,GAAK,CAAC3iB,EAAE,EACb,EAAI,IAAI,KAAK,GAAG,EAGP,CAAC2iB,EAAE,GAAK,CAAC3iB,EAAE,GACpB,EAAImpB,GAAM,KAAMC,EAAK,CAAC,EAAE,MAAMppB,EAAE,EAAI,EAAI,IAAO,GAAI,EACnD,EAAE,EAAI2iB,EAAE,GAGC,CAAC3iB,EAAE,GAAK2iB,EAAE,OAAM,GACzB,EAAI3iB,EAAE,EAAI,EAAImpB,GAAM,KAAMtB,EAAIC,CAAE,EAAI,IAAI,KAAK,CAAC,EAC9C,EAAE,EAAInF,EAAE,GAGC,CAACA,EAAE,GAAK3iB,EAAE,OAAM,GACzB,EAAImpB,GAAM,KAAMC,EAAK,CAAC,EAAE,MAAM,EAAG,EACjC,EAAE,EAAIzG,EAAE,GAGC3iB,EAAE,EAAI,GACf,KAAK,UAAYopB,EACjB,KAAK,SAAW,EAChB,EAAI,KAAK,KAAKb,GAAO5F,EAAG3iB,EAAGopB,EAAK,CAAC,CAAC,EAClCppB,EAAImpB,GAAM,KAAMC,EAAK,CAAC,EACtB,KAAK,UAAYvB,EACjB,KAAK,SAAWC,EAChB,EAAInF,EAAE,EAAI,EAAI,EAAE,MAAM3iB,CAAC,EAAI,EAAE,KAAKA,CAAC,GAEnC,EAAI,KAAK,KAAKuoB,GAAO5F,EAAG3iB,EAAGopB,EAAK,CAAC,CAAC,EAG7B,CACT,CAUA,SAASqG,GAAKzvB,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,KAAI,CACzB,CASA,SAAS0vB,GAAK1vB,EAAG,CACf,OAAOmnB,GAASnnB,EAAI,IAAI,KAAKA,CAAC,EAAGA,EAAE,EAAI,EAAG,CAAC,CAC7C,CAWA,SAAS2vB,GAAM3vB,EAAGkC,EAAKC,EAAK,CAC1B,OAAO,IAAI,KAAKnC,CAAC,EAAE,MAAMkC,EAAKC,CAAG,CACnC,CAqBA,SAASqO,GAAOuO,EAAK,CACnB,GAAI,CAACA,GAAO,OAAOA,GAAQ,SAAU,MAAM,MAAMmH,GAAe,iBAAiB,EACjF,IAAI9lB,EAAGyT,EAAG/M,EACR8oB,EAAc7Q,EAAI,WAAa,GAC/B8Q,EAAK,CACH,YAAa,EAAGnK,GAChB,WAAY,EAAG,EACf,WAAY,MAAY,EACxB,WAAY,EAAGD,GACf,OAAQ,EAAGA,GACX,OAAQ,MAAY,EACpB,SAAU,EAAG,CACnB,EAEE,IAAKrlB,EAAI,EAAGA,EAAIyvB,EAAG,OAAQzvB,GAAK,EAE9B,GADIyT,EAAIgc,EAAGzvB,CAAC,EAAGwvB,IAAa,KAAK/b,CAAC,EAAIiS,GAASjS,CAAC,IAC3C/M,EAAIiY,EAAIlL,CAAC,KAAO,OACnB,GAAI0S,GAAUzf,CAAC,IAAMA,GAAKA,GAAK+oB,EAAGzvB,EAAI,CAAC,GAAK0G,GAAK+oB,EAAGzvB,EAAI,CAAC,EAAG,KAAKyT,CAAC,EAAI/M,MACjE,OAAM,MAAMqf,GAAkBtS,EAAI,KAAO/M,CAAC,EAKnD,GADI+M,EAAI,SAAU+b,IAAa,KAAK/b,CAAC,EAAIiS,GAASjS,CAAC,IAC9C/M,EAAIiY,EAAIlL,CAAC,KAAO,OACnB,GAAI/M,IAAM,IAAQA,IAAM,IAASA,IAAM,GAAKA,IAAM,EAChD,GAAIA,EACF,GAAI,OAAO,QAAU,aAAe,SACjC,OAAO,iBAAmB,OAAO,aAClC,KAAK+M,CAAC,EAAI,OAEV,OAAM,MAAMwS,EAAiB,OAG/B,KAAKxS,CAAC,EAAI,OAGZ,OAAM,MAAMsS,GAAkBtS,EAAI,KAAO/M,CAAC,EAI9C,OAAO,IACT,CAUA,SAASgpB,GAAI9vB,EAAG,CACd,OAAO,IAAI,KAAKA,CAAC,EAAE,IAAG,CACxB,CAUA,SAAS+vB,GAAK/vB,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,KAAI,CACzB,CAQA,SAASwP,GAAMuP,EAAK,CAClB,IAAI3e,EAAGyT,EAAGgc,EASV,SAASnB,EAAQ5nB,EAAG,CAClB,IAAIzF,EAAGjB,EAAGyM,EACR7M,EAAI,KAGN,GAAI,EAAEA,aAAa0uB,GAAU,OAAO,IAAIA,EAAQ5nB,CAAC,EAOjD,GAHA9G,EAAE,YAAc0uB,EAGZsB,GAAkBlpB,CAAC,EAAG,CACxB9G,EAAE,EAAI8G,EAAE,EAEJmf,GACE,CAACnf,EAAE,GAAKA,EAAE,EAAI4nB,EAAQ,MAGxB1uB,EAAE,EAAI,IACNA,EAAE,EAAI,MACG8G,EAAE,EAAI4nB,EAAQ,MAGvB1uB,EAAE,EAAI,EACNA,EAAE,EAAI,CAAC,CAAC,IAERA,EAAE,EAAI8G,EAAE,EACR9G,EAAE,EAAI8G,EAAE,EAAE,MAAK,IAGjB9G,EAAE,EAAI8G,EAAE,EACR9G,EAAE,EAAI8G,EAAE,EAAIA,EAAE,EAAE,MAAK,EAAKA,EAAE,GAG9B,MACD,CAID,GAFA+F,EAAI,OAAO/F,EAEP+F,IAAM,SAAU,CAClB,GAAI/F,IAAM,EAAG,CACX9G,EAAE,EAAI,EAAI8G,EAAI,EAAI,GAAK,EACvB9G,EAAE,EAAI,EACNA,EAAE,EAAI,CAAC,CAAC,EACR,MACD,CAUD,GARI8G,EAAI,GACNA,EAAI,CAACA,EACL9G,EAAE,EAAI,IAENA,EAAE,EAAI,EAIJ8G,IAAM,CAAC,CAACA,GAAKA,EAAI,IAAK,CACxB,IAAKzF,EAAI,EAAGjB,EAAI0G,EAAG1G,GAAK,GAAIA,GAAK,GAAIiB,IAEjC4kB,GACE5kB,EAAIqtB,EAAQ,MACd1uB,EAAE,EAAI,IACNA,EAAE,EAAI,MACGqB,EAAIqtB,EAAQ,MACrB1uB,EAAE,EAAI,EACNA,EAAE,EAAI,CAAC,CAAC,IAERA,EAAE,EAAIqB,EACNrB,EAAE,EAAI,CAAC8G,CAAC,IAGV9G,EAAE,EAAIqB,EACNrB,EAAE,EAAI,CAAC8G,CAAC,GAGV,MAGR,SAAiBA,EAAI,IAAM,EAAG,CACjBA,IAAG9G,EAAE,EAAI,KACdA,EAAE,EAAI,IACNA,EAAE,EAAI,KACN,MACD,CAED,OAAOsuB,GAAatuB,EAAG8G,EAAE,SAAU,EAEzC,SAAe+F,IAAM,SACf,MAAM,MAAMsZ,GAAkBrf,CAAC,EAIjC,OAAK1G,EAAI0G,EAAE,WAAW,CAAC,KAAO,IAC5BA,EAAIA,EAAE,MAAM,CAAC,EACb9G,EAAE,EAAI,KAGFI,IAAM,KAAI0G,EAAIA,EAAE,MAAM,CAAC,GAC3B9G,EAAE,EAAI,GAGD4mB,GAAU,KAAK9f,CAAC,EAAIwnB,GAAatuB,EAAG8G,CAAC,EAAIynB,GAAWvuB,EAAG8G,CAAC,CAChE,CA2DD,GAzDA4nB,EAAQ,UAAYxH,EAEpBwH,EAAQ,SAAW,EACnBA,EAAQ,WAAa,EACrBA,EAAQ,WAAa,EACrBA,EAAQ,YAAc,EACtBA,EAAQ,cAAgB,EACxBA,EAAQ,gBAAkB,EAC1BA,EAAQ,gBAAkB,EAC1BA,EAAQ,gBAAkB,EAC1BA,EAAQ,iBAAmB,EAC3BA,EAAQ,OAAS,EAEjBA,EAAQ,OAASA,EAAQ,IAAMle,GAC/Bke,EAAQ,MAAQlf,GAChBkf,EAAQ,UAAYsB,GAEpBtB,EAAQ,IAAMM,GACdN,EAAQ,KAAOO,GACfP,EAAQ,MAAQQ,GAChBR,EAAQ,IAAMS,GACdT,EAAQ,KAAOU,GACfV,EAAQ,MAAQW,GAChBX,EAAQ,KAAOY,GACfZ,EAAQ,MAAQa,GAChBb,EAAQ,MAAQc,GAChBd,EAAQ,KAAOe,GACff,EAAQ,KAAOgB,GACfhB,EAAQ,MAAQiB,GAChBjB,EAAQ,IAAMoB,GACdpB,EAAQ,KAAOqB,GACfrB,EAAQ,IAAMuB,GACdvB,EAAQ,IAAMwB,GACdxB,EAAQ,MAAQyB,GAChBzB,EAAQ,MAAQ0B,GAChB1B,EAAQ,GAAK2B,GACb3B,EAAQ,IAAM4B,GACd5B,EAAQ,MAAQ6B,GAChB7B,EAAQ,KAAO8B,GACf9B,EAAQ,IAAMvsB,GACdusB,EAAQ,IAAMxsB,GACdwsB,EAAQ,IAAM+B,GACd/B,EAAQ,IAAMgC,GACdhC,EAAQ,IAAMT,GACdS,EAAQ,OAASiC,GACjBjC,EAAQ,MAAQkC,GAChBlC,EAAQ,KAAOtO,GACfsO,EAAQ,IAAMmC,GACdnC,EAAQ,KAAOoC,GACfpC,EAAQ,KAAOqC,GACfrC,EAAQ,IAAMsC,GACdtC,EAAQ,IAAMR,GACdQ,EAAQ,IAAMuC,GACdvC,EAAQ,KAAOwC,GACfxC,EAAQ,MAAQyC,GAEZpS,IAAQ,SAAQA,EAAM,IACtBA,GACEA,EAAI,WAAa,GAEnB,IADA8Q,EAAK,CAAC,YAAa,WAAY,WAAY,WAAY,OAAQ,OAAQ,SAAU,QAAQ,EACpFzvB,EAAI,EAAGA,EAAIyvB,EAAG,QAAc9Q,EAAI,eAAelL,EAAIgc,EAAGzvB,GAAG,CAAC,IAAG2e,EAAIlL,CAAC,EAAI,KAAKA,CAAC,GAIrF,OAAA6a,EAAQ,OAAO3P,CAAG,EAEX2P,CACT,CAWA,SAASuB,GAAIjwB,EAAG2iB,EAAG,CACjB,OAAO,IAAI,KAAK3iB,CAAC,EAAE,IAAI2iB,CAAC,CAC1B,CAUA,SAASuN,GAAIlwB,EAAG,CACd,OAAO,IAAI,KAAKA,CAAC,EAAE,IAAG,CACxB,CASA,SAASmwB,GAAMnwB,EAAG,CAChB,OAAOmnB,GAASnnB,EAAI,IAAI,KAAKA,CAAC,EAAGA,EAAE,EAAI,EAAG,CAAC,CAC7C,CAYA,SAASowB,IAAQ,CACf,IAAIhwB,EAAGwM,EACLC,EAAI,IAAI,KAAK,CAAC,EAIhB,IAFAoZ,GAAW,GAEN7lB,EAAI,EAAGA,EAAI,UAAU,QAExB,GADAwM,EAAI,IAAI,KAAK,UAAUxM,GAAG,CAAC,EACtBwM,EAAE,EAMIC,EAAE,IACXA,EAAIA,EAAE,KAAKD,EAAE,MAAMA,CAAC,CAAC,OAPb,CACR,GAAIA,EAAE,EACJ,OAAAqZ,GAAW,GACJ,IAAI,KAAK,GAAK,EAEvBpZ,EAAID,CACV,CAKE,OAAAqZ,GAAW,GAEJpZ,EAAE,MACX,CAQA,SAASmjB,GAAkBjR,EAAK,CAC9B,OAAOA,aAAe2P,IAAW3P,GAAOA,EAAI,cAAgBuH,IAAO,EACrE,CAUA,SAAS+J,GAAGrwB,EAAG,CACb,OAAO,IAAI,KAAKA,CAAC,EAAE,GAAE,CACvB,CAaA,SAASswB,GAAItwB,EAAG2iB,EAAG,CACjB,OAAO,IAAI,KAAK3iB,CAAC,EAAE,IAAI2iB,CAAC,CAC1B,CAUA,SAAS6N,GAAKxwB,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,IAAI,CAAC,CAC1B,CAUA,SAASuwB,GAAMvwB,EAAG,CAChB,OAAO,IAAI,KAAKA,CAAC,EAAE,IAAI,EAAE,CAC3B,CASA,SAASmC,IAAM,CACb,OAAO4rB,GAAS,KAAM,UAAW,IAAI,CACvC,CASA,SAAS7rB,IAAM,CACb,OAAO6rB,GAAS,KAAM,UAAW,IAAI,CACvC,CAWA,SAAS0C,GAAIzwB,EAAG2iB,EAAG,CACjB,OAAO,IAAI,KAAK3iB,CAAC,EAAE,IAAI2iB,CAAC,CAC1B,CAWA,SAAS+N,GAAI1wB,EAAG2iB,EAAG,CACjB,OAAO,IAAI,KAAK3iB,CAAC,EAAE,IAAI2iB,CAAC,CAC1B,CAWA,SAASsL,GAAIjuB,EAAG2iB,EAAG,CACjB,OAAO,IAAI,KAAK3iB,CAAC,EAAE,IAAI2iB,CAAC,CAC1B,CAWA,SAASgO,GAAOxI,EAAI,CAClB,IAAIvE,EAAGviB,EAAG+lB,EAAG,EACXhnB,EAAI,EACJ0M,EAAI,IAAI,KAAK,CAAC,EACd6e,EAAK,GAOP,GALIxD,IAAO,OAAQA,EAAK,KAAK,UACxByC,GAAWzC,EAAI,EAAGzC,EAAU,EAEjC0B,EAAI,KAAK,KAAKe,EAAKrB,EAAQ,EAEtB,KAAK,OAIH,GAAI,OAAO,gBAGhB,IAFAlD,EAAI,OAAO,gBAAgB,IAAI,YAAYwD,CAAC,CAAC,EAEtChnB,EAAIgnB,GACT,EAAIxD,EAAExjB,CAAC,EAIH,GAAK,MACPwjB,EAAExjB,CAAC,EAAI,OAAO,gBAAgB,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,EAKnDurB,EAAGvrB,GAAG,EAAI,EAAI,YAKT,OAAO,YAAa,CAK7B,IAFAwjB,EAAI,OAAO,YAAYwD,GAAK,CAAC,EAEtBhnB,EAAIgnB,GAGT,EAAIxD,EAAExjB,CAAC,GAAKwjB,EAAExjB,EAAI,CAAC,GAAK,IAAMwjB,EAAExjB,EAAI,CAAC,GAAK,MAAQwjB,EAAExjB,EAAI,CAAC,EAAI,MAAS,IAGlE,GAAK,MACP,OAAO,YAAY,CAAC,EAAE,KAAKwjB,EAAGxjB,CAAC,GAK/BurB,EAAG,KAAK,EAAI,GAAG,EACfvrB,GAAK,GAITA,EAAIgnB,EAAI,CACZ,KACI,OAAM,MAAMf,EAAiB,MA9C7B,MAAOjmB,EAAIgnB,GAAIuE,EAAGvrB,GAAG,EAAI,KAAK,OAAM,EAAK,IAAM,EA2DjD,IAVAgnB,EAAIuE,EAAG,EAAEvrB,CAAC,EACV+nB,GAAMrB,GAGFM,GAAKe,IACP,EAAI3B,GAAQ,GAAIM,GAAWqB,CAAE,EAC7BwD,EAAGvrB,CAAC,GAAKgnB,EAAI,EAAI,GAAK,GAIjBuE,EAAGvrB,CAAC,IAAM,EAAGA,IAAKurB,EAAG,MAG5B,GAAIvrB,EAAI,EACNiB,EAAI,EACJsqB,EAAK,CAAC,CAAC,MACF,CAIL,IAHAtqB,EAAI,GAGGsqB,EAAG,CAAC,IAAM,EAAGtqB,GAAKylB,GAAU6E,EAAG,QAGtC,IAAKvE,EAAI,EAAG,EAAIuE,EAAG,CAAC,EAAG,GAAK,GAAI,GAAK,GAAIvE,IAGrCA,EAAIN,KAAUzlB,GAAKylB,GAAWM,EACnC,CAED,OAAAta,EAAE,EAAIzL,EACNyL,EAAE,EAAI6e,EAEC7e,CACT,CAWA,SAAS8jB,GAAM5wB,EAAG,CAChB,OAAOmnB,GAASnnB,EAAI,IAAI,KAAKA,CAAC,EAAGA,EAAE,EAAI,EAAG,KAAK,QAAQ,CACzD,CAcA,SAASogB,GAAKpgB,EAAG,CACf,OAAAA,EAAI,IAAI,KAAKA,CAAC,EACPA,EAAE,EAAKA,EAAE,EAAE,CAAC,EAAIA,EAAE,EAAI,EAAIA,EAAE,EAAKA,EAAE,GAAK,GACjD,CAUA,SAAS6wB,GAAI7wB,EAAG,CACd,OAAO,IAAI,KAAKA,CAAC,EAAE,IAAG,CACxB,CAUA,SAAS8wB,GAAK9wB,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,KAAI,CACzB,CAUA,SAAS+wB,GAAK/wB,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,KAAI,CACzB,CAWA,SAASgxB,GAAIhxB,EAAG2iB,EAAG,CACjB,OAAO,IAAI,KAAK3iB,CAAC,EAAE,IAAI2iB,CAAC,CAC1B,CAYA,SAASuL,IAAM,CACb,IAAI9tB,EAAI,EACNsV,EAAO,UACP1V,EAAI,IAAI,KAAK0V,EAAKtV,CAAC,CAAC,EAGtB,IADA6lB,GAAW,GACJjmB,EAAE,GAAK,EAAEI,EAAIsV,EAAK,QAAS1V,EAAIA,EAAE,KAAK0V,EAAKtV,CAAC,CAAC,EACpD,OAAA6lB,GAAW,GAEJkB,GAASnnB,EAAG,KAAK,UAAW,KAAK,QAAQ,CAClD,CAUA,SAASixB,GAAIjxB,EAAG,CACd,OAAO,IAAI,KAAKA,CAAC,EAAE,IAAG,CACxB,CAUA,SAASkxB,GAAKlxB,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,KAAI,CACzB,CASA,SAASmxB,GAAMnxB,EAAG,CAChB,OAAOmnB,GAASnnB,EAAI,IAAI,KAAKA,CAAC,EAAGA,EAAE,EAAI,EAAG,CAAC,CAC7C,CAGAknB,EAAE,OAAO,IAAI,4BAA4B,CAAC,EAAIA,EAAE,SAChDA,EAAE,OAAO,WAAW,EAAI,UAGjB,IAAIwH,GAAUxH,EAAE,YAAc1X,GAAMsW,EAAQ,EAGnDF,GAAO,IAAI8I,GAAQ9I,EAAI,EACvBC,GAAK,IAAI6I,GAAQ7I,EAAE,EC7xJnB,IAAI7e,GAAO,YACPic,GAAe,CAAC,MAAO,QAAQ,EACxBmO,GAAsCpO,GAAQhc,GAAMic,GAAc0B,GAAQ,CACnF,GAAI,CACF,GAAA0M,EACA,OAAA7gB,CACJ,EAAMmU,EACAC,EAAY8J,GAAQ,MAAM,CAC5B,UAAWle,EAAO,UAClB,OAAQke,GAAQ,MACpB,CAAG,EACD,OAAA9J,EAAU,UAAY,OAAO,OAAOA,EAAU,SAAS,EAKvDA,EAAU,UAAU,KAAO,YAC3BA,EAAU,UAAU,YAAc,GAQlCA,EAAU,UAAU,OAAS,UAAY,CACvC,MAAO,CACL,OAAQ,YACR,MAAO,KAAK,SAAQ,CACrB,CACF,EAQDA,EAAU,SAAW,SAAU0M,EAAM,CACnC,OAAO,IAAI1M,EAAU0M,EAAK,KAAK,CAChC,EACGD,GAEFA,EAAG,SAAU,SAAUE,EAAMtxB,EAAM,CAC7BsxB,EAAK,YAActxB,EAAK,WAC1B2kB,EAAU,OAAO,CACf,UAAW2M,EAAK,SAC1B,CAAS,CAET,CAAK,EAEI3M,CACT,EAAG,CACD,QAAS,EACX,CAAC;;;;;yDCrBA,SAASle,EAAM,CAId,IAAIqpB,EAAO,KAAK,MAAQ,SAAS/vB,EAAG,CAClC,OAAO,KAAK,IAAIA,CAAC,EAAI,KAAO,EAAIA,GAAK,KAAK,IAAIA,CAAC,EAAI,KAAK,IAAI,CAACA,CAAC,GAAK,EACpE,EAEG8wB,EAAO,KAAK,MAAQ,SAAS9wB,EAAG,CAClC,OAAO,KAAK,IAAIA,CAAC,EAAI,KAAOA,GAAK,KAAK,IAAIA,CAAC,EAAI,KAAK,IAAI,CAACA,CAAC,GAAK,EAChE,EAQGwxB,EAAQ,SAASxxB,EAAG,CAEtB,IAAI8P,EAAI,KAAK,GAAK,EAClB,GAAI,CAACA,EAAI9P,GAAKA,EAAI8P,EAChB,OAAO,KAAK,IAAI9P,CAAC,EAAI,EAevB,IAAIyxB,EAAKzxB,EAAIA,EACb,OAAOyxB,GACLA,GACEA,GACEA,GACEA,GACEA,GACEA,GACEA,EAAK,cACH,EAAI,aACN,EAAI,WACN,EAAI,SACN,EAAI,OACN,EAAI,KACN,EAAI,IACN,EAAI,EACT,EAEGrB,EAAQ,SAASpwB,EAAG2iB,EAAG,CAEzB,IAAI9S,EAAI,KAAK,IAAI7P,CAAC,EACd8P,EAAI,KAAK,IAAI6S,CAAC,EAElB,OAAI9S,EAAI,KAAQC,EAAI,IACX,KAAK,KAAKD,EAAIA,EAAIC,EAAIA,CAAC,GAG5BD,EAAIC,GACND,EAAIC,EACJA,EAAI9P,EAAI2iB,GAER7S,EAAI6S,EAAI3iB,EAEH6P,EAAI,KAAK,KAAK,EAAIC,EAAIA,CAAC,EAC/B,EAEG4hB,EAAc,UAAW,CAC3B,MAAM,YAAY,eAAe,CAClC,EASD,SAASC,EAAS9hB,EAAGC,EAAG,CAEtB,IAAInQ,EAAK,KAAK,IAAIkQ,CAAC,EACf5J,EAAK,KAAK,IAAI6J,CAAC,EAEnB,OAAID,IAAM,EACD,KAAK,IAAI5J,CAAE,EAGhB6J,IAAM,EACD,KAAK,IAAInQ,CAAE,EAGhBA,EAAK,KAAQsG,EAAK,IACb,KAAK,IAAI4J,EAAIA,EAAIC,EAAIA,CAAC,EAAI,IAmClCD,EAAIA,EAAI,EACRC,EAAIA,EAAI,EAEF,GAAM,KAAK,IAAID,EAAIA,EAAIC,EAAIA,CAAC,EAAI,KAAK,IAChD,CAEE,IAAI8hB,EAAQ,SAAS/hB,EAAGC,EAAG,CAEzB,IAAIwa,EAAI,CAAE,GAAM,EAAG,GAAM,CAAG,EAE5B,GAAuBza,GAAM,KAC3Bya,EAAE,GACFA,EAAE,GAAQ,UACDxa,IAAM,OACfwa,EAAE,GAAQza,EACVya,EAAE,GAAQxa,MAEV,QAAQ,OAAOD,EAAC,CAEd,IAAK,SAEH,GAAI,OAAQA,GAAK,OAAQA,EACvBya,EAAE,GAAQza,EAAE,GACZya,EAAE,GAAQza,EAAE,WACH,QAASA,GAAK,QAASA,EAAG,CACnC,GAAI,CAAC,OAAO,SAASA,EAAE,GAAM,GAAK,OAAO,SAASA,EAAE,GAAM,EACxD,OAAOgV,EAAQ,SAEjByF,EAAE,GAAQza,EAAE,IAAS,KAAK,IAAIA,EAAE,GAAM,EACtCya,EAAE,GAAQza,EAAE,IAAS,KAAK,IAAIA,EAAE,GAAM,CACvC,SAAU,MAAOA,GAAK,QAASA,EAAG,CACjC,GAAI,CAAC,OAAO,SAASA,EAAE,CAAI,GAAK,OAAO,SAASA,EAAE,GAAM,EACtD,OAAOgV,EAAQ,SAEjByF,EAAE,GAAQza,EAAE,EAAO,KAAK,IAAIA,EAAE,GAAM,EACpCya,EAAE,GAAQza,EAAE,EAAO,KAAK,IAAIA,EAAE,GAAM,CAChD,MAAqBA,EAAE,SAAW,GACtBya,EAAE,GAAQza,EAAE,CAAC,EACbya,EAAE,GAAQza,EAAE,CAAC,GAEb6hB,EAAa,EAEf,MAEF,IAAK,SAEHpH,EAAE,GACFA,EAAE,GAAQ,EAEV,IAAIuH,EAAShiB,EAAE,MAAM,uCAAuC,EACxDiiB,EAAO,EACPC,EAAQ,EAERF,IAAW,MACbH,EAAa,EAGf,QAAStxB,EAAI,EAAGA,EAAIyxB,EAAO,OAAQzxB,IAAK,CAEtC,IAAIgY,EAAIyZ,EAAOzxB,CAAC,EAEZgY,IAAM,KAAOA,IAAM,KAAQA,IAAM;AAAA,IAE1BA,IAAM,IACf0Z,IACS1Z,IAAM,IACf2Z,IACS3Z,IAAM,KAAOA,IAAM,KAExB0Z,EAAOC,IAAU,GACnBL,EAAa,EAGXG,EAAOzxB,EAAI,CAAC,IAAM,KAAO,CAAC,MAAMyxB,EAAOzxB,EAAI,CAAC,CAAC,GAC/CkqB,EAAE,IAAS,YAAYyH,EAAQ,EAAI,IAAM,IAAMF,EAAOzxB,EAAI,CAAC,CAAC,EAC5DA,KAEAkqB,EAAE,IAAS,YAAYyH,EAAQ,EAAI,IAAM,IAAM,GAAG,EAEpDD,EAAOC,EAAQ,KAIXD,EAAOC,IAAU,GAAK,MAAM3Z,CAAC,IAC/BsZ,EAAa,EAGXG,EAAOzxB,EAAI,CAAC,IAAM,KAAOyxB,EAAOzxB,EAAI,CAAC,IAAM,KAC7CkqB,EAAE,IAAS,YAAYyH,EAAQ,EAAI,IAAM,IAAM3Z,CAAC,EAChDhY,KAEAkqB,EAAE,IAAS,YAAYyH,EAAQ,EAAI,IAAM,IAAM3Z,CAAC,EAElD0Z,EAAOC,EAAQ,GAE7B,CAGcD,EAAOC,EAAQ,GACjBL,EAAa,EAEf,MAEF,IAAK,SACHpH,EAAE,GAAQ,EACVA,EAAE,GAAQza,EACV,MAEF,QACE6hB,EAAa,CACvB,CAEI,OAAI,MAAMpH,EAAE,EAAK,GAAK,MAAMA,EAAE,EAAK,EAK5BA,CACR,EAMD,SAASzF,EAAQhV,EAAGC,EAAG,CAErB,GAAI,EAAE,gBAAgB+U,GACpB,OAAO,IAAIA,EAAQhV,EAAGC,CAAC,EAGzB,IAAIwa,EAAIsH,EAAM/hB,EAAGC,CAAC,EAElB,KAAK,GAAQwa,EAAE,GACf,KAAK,GAAQA,EAAE,EACnB,CAEEzF,EAAQ,UAAY,CAElB,GAAM,EACN,GAAM,EAON,KAAQ,UAAW,CAEjB,IAAImK,EAAM,KAAK,IAAQ,EAEvB,OAAO,IAAInK,EACT,KAAK,GAAQmK,EACb,KAAK,GAAQA,CAAG,CACnB,EAOD,IAAO,SAASnf,EAAGC,EAAG,CAEpB,IAAIwa,EAAI,IAAIzF,EAAQhV,EAAGC,CAAC,EAGxB,OAAI,KAAK,WAAa,GAAMwa,EAAE,WAAa,EAClCzF,EAAQ,IAIb,KAAK,WAAa,GAAMyF,EAAE,WAAa,EAClCzF,EAAQ,SAGV,IAAIA,EACT,KAAK,GAAQyF,EAAE,GACf,KAAK,GAAQA,EAAE,EAAK,CACvB,EAOD,IAAO,SAASza,EAAGC,EAAG,CAEpB,IAAIwa,EAAI,IAAIzF,EAAQhV,EAAGC,CAAC,EAGxB,OAAI,KAAK,WAAa,GAAMwa,EAAE,WAAa,EAClCzF,EAAQ,IAIb,KAAK,WAAa,GAAMyF,EAAE,WAAa,EAClCzF,EAAQ,SAGV,IAAIA,EACT,KAAK,GAAQyF,EAAE,GACf,KAAK,GAAQA,EAAE,EAAK,CACvB,EAOD,IAAO,SAASza,EAAGC,EAAG,CAEpB,IAAIwa,EAAI,IAAIzF,EAAQhV,EAAGC,CAAC,EAGxB,OAAK,KAAK,WAAa,GAAMwa,EAAE,OAAS,GAAQ,KAAK,OAAW,GAAIA,EAAE,WAAe,EAC5EzF,EAAQ,IAIb,KAAK,WAAa,GAAMyF,EAAE,WAAa,EAClCzF,EAAQ,SAIbyF,EAAE,KAAU,GAAK,KAAK,KAAU,EAC3B,IAAIzF,EAAQ,KAAK,GAAQyF,EAAE,GAAO,CAAC,EAGrC,IAAIzF,EACT,KAAK,GAAQyF,EAAE,GAAQ,KAAK,GAAQA,EAAE,GACtC,KAAK,GAAQA,EAAE,GAAQ,KAAK,GAAQA,EAAE,EAAK,CAC9C,EAOD,IAAO,SAASza,EAAGC,EAAG,CAEpB,IAAIwa,EAAI,IAAIzF,EAAQhV,EAAGC,CAAC,EAGxB,GAAK,KAAK,OAAS,GAAMwa,EAAE,OAAS,GAAQ,KAAK,WAAe,GAAIA,EAAE,WAAe,EACnF,OAAOzF,EAAQ,IAIjB,GAAI,KAAK,WAAa,GAAMyF,EAAE,OAAS,EACrC,OAAOzF,EAAQ,SAIjB,GAAI,KAAK,OAAS,GAAMyF,EAAE,WAAa,EACrC,OAAOzF,EAAQ,KAGjBhV,EAAI,KAAK,GACTC,EAAI,KAAK,GAET,IAAIsI,EAAIkS,EAAE,GACN1G,EAAI0G,EAAE,GACNzd,EAAG7M,EAEP,OAAU4jB,IAAN,EAEK,IAAIiB,EAAQhV,EAAIuI,EAAGtI,EAAIsI,CAAC,EAG7B,KAAK,IAAIA,CAAC,EAAI,KAAK,IAAIwL,CAAC,GAE1B5jB,EAAIoY,EAAIwL,EACR/W,EAAIuL,EAAIpY,EAAI4jB,EAEL,IAAIiB,GACRhV,EAAI7P,EAAI8P,GAAKjD,GACbiD,EAAI9P,EAAI6P,GAAKhD,CAAC,IAIjB7M,EAAI4jB,EAAIxL,EACRvL,EAAI+W,EAAI5jB,EAAIoY,EAEL,IAAIyM,GACRhV,EAAIC,EAAI9P,GAAK6M,GACbiD,EAAID,EAAI7P,GAAK6M,CAAC,EAEpB,EAOD,IAAO,SAASgD,EAAGC,EAAG,CAEpB,IAAIwa,EAAI,IAAIzF,EAAQhV,EAAGC,CAAC,EAKxB,GAHAD,EAAI,KAAK,GACTC,EAAI,KAAK,GAELwa,EAAE,SACJ,OAAOzF,EAAQ,IAIjB,GAAIyF,EAAE,KAAU,EAAG,CAEjB,GAAIxa,IAAM,GAAKD,EAAI,EAEjB,OAAO,IAAIgV,EAAQ,KAAK,IAAIhV,EAAGya,EAAE,EAAK,EAAG,CAAC,EAErC,GAAIza,IAAM,EAEf,QAASya,EAAE,GAAQ,EAAI,GAAK,EAAC,CAC3B,IAAK,GACH,OAAO,IAAIzF,EAAQ,KAAK,IAAI/U,EAAGwa,EAAE,EAAK,EAAG,CAAC,EAC5C,IAAK,GACH,OAAO,IAAIzF,EAAQ,EAAG,KAAK,IAAI/U,EAAGwa,EAAE,EAAK,CAAC,EAC5C,IAAK,GACH,OAAO,IAAIzF,EAAQ,CAAC,KAAK,IAAI/U,EAAGwa,EAAE,EAAK,EAAG,CAAC,EAC7C,IAAK,GACH,OAAO,IAAIzF,EAAQ,EAAG,CAAC,KAAK,IAAI/U,EAAGwa,EAAE,EAAK,CAAC,CACzD,CAEA,CAqBM,GAAIza,IAAM,GAAKC,IAAM,GAAKwa,EAAE,GAAQ,GAAKA,EAAE,IAAS,EAClD,OAAOzF,EAAQ,KAGjB,IAAI5L,EAAM,KAAK,MAAMnJ,EAAGD,CAAC,EACrBmiB,EAAML,EAAS9hB,EAAGC,CAAC,EAEvB,OAAAD,EAAI,KAAK,IAAIya,EAAE,GAAQ0H,EAAM1H,EAAE,GAAQrR,CAAG,EAC1CnJ,EAAIwa,EAAE,GAAQ0H,EAAM1H,EAAE,GAAQrR,EACvB,IAAI4L,EACThV,EAAI,KAAK,IAAIC,CAAC,EACdD,EAAI,KAAK,IAAIC,CAAC,CAAC,CAClB,EAOD,KAAQ,UAAW,CAEjB,IAAID,EAAI,KAAK,GACTC,EAAI,KAAK,GACThD,EAAI,KAAK,IAAQ,EAEjBmlB,EAAIC,EAER,GAAIriB,GAAK,EAAG,CAEV,GAAIC,IAAM,EACR,OAAO,IAAI+U,EAAQ,KAAK,KAAKhV,CAAC,EAAG,CAAC,EAGpCoiB,EAAK,GAAM,KAAK,KAAK,GAAOnlB,EAAI+C,EAAE,CAC1C,MACQoiB,EAAK,KAAK,IAAIniB,CAAC,EAAI,KAAK,KAAK,GAAKhD,EAAI+C,EAAE,EAG1C,OAAIA,GAAK,EACPqiB,EAAK,GAAM,KAAK,KAAK,GAAOplB,EAAI+C,EAAE,EAElCqiB,EAAK,KAAK,IAAIpiB,CAAC,EAAI,KAAK,KAAK,GAAKhD,EAAI+C,EAAE,EAGnC,IAAIgV,EAAQoN,EAAIniB,EAAI,EAAI,CAACoiB,EAAKA,CAAE,CACxC,EAOD,IAAO,UAAW,CAEhB,IAAIC,EAAM,KAAK,IAAI,KAAK,EAAK,EAE7B,OAAI,KAAK,GAGF,IAAItN,EACTsN,EAAM,KAAK,IAAI,KAAK,EAAK,EACzBA,EAAM,KAAK,IAAI,KAAK,EAAK,CAAC,CAC7B,EAUD,MAAS,UAAW,CAQlB,IAAItiB,EAAI,KAAK,GACTC,EAAI,KAAK,GAEb,OAAO,IAAI+U,EACT,KAAK,MAAMhV,CAAC,EAAI,KAAK,IAAIC,CAAC,EAAI0hB,EAAM1hB,CAAC,EACrC,KAAK,IAAID,CAAC,EAAI,KAAK,IAAIC,CAAC,CAAC,CAC5B,EAOD,IAAO,UAAW,CAEhB,IAAID,EAAI,KAAK,GACTC,EAAI,KAAK,GAMb,OAAO,IAAI+U,EACT8M,EAAS9hB,EAAGC,CAAC,EACb,KAAK,MAAMA,EAAGD,CAAC,CAAC,CACnB,EAOD,IAAO,UAAW,CAEhB,OAAOugB,EAAM,KAAK,GAAO,KAAK,EAAK,CACpC,EAOD,IAAO,UAAW,CAEhB,OAAO,KAAK,MAAM,KAAK,GAAO,KAAK,EAAK,CACzC,EAOD,IAAO,UAAW,CAKhB,IAAIvgB,EAAI,KAAK,GACTC,EAAI,KAAK,GAEb,OAAO,IAAI+U,EACT,KAAK,IAAIhV,CAAC,EAAIkgB,EAAKjgB,CAAC,EACpB,KAAK,IAAID,CAAC,EAAIihB,EAAKhhB,CAAC,CAAC,CACxB,EAOD,IAAO,UAAW,CAKhB,IAAID,EAAI,KAAK,GACTC,EAAI,KAAK,GAEb,OAAO,IAAI+U,EACT,KAAK,IAAIhV,CAAC,EAAIkgB,EAAKjgB,CAAC,EACpB,CAAC,KAAK,IAAID,CAAC,EAAIihB,EAAKhhB,CAAC,CAAC,CACzB,EAOD,IAAO,UAAW,CAOhB,IAAID,EAAI,EAAI,KAAK,GACbC,EAAI,EAAI,KAAK,GACb8T,EAAI,KAAK,IAAI/T,CAAC,EAAIkgB,EAAKjgB,CAAC,EAE5B,OAAO,IAAI+U,EACT,KAAK,IAAIhV,CAAC,EAAI+T,EACdkN,EAAKhhB,CAAC,EAAI8T,CAAC,CACd,EAOD,IAAO,UAAW,CAIhB,IAAI/T,EAAI,EAAI,KAAK,GACbC,EAAI,EAAI,KAAK,GACb8T,EAAI,KAAK,IAAI/T,CAAC,EAAIkgB,EAAKjgB,CAAC,EAE5B,OAAO,IAAI+U,EACT,CAAC,KAAK,IAAIhV,CAAC,EAAI+T,EACfkN,EAAKhhB,CAAC,EAAI8T,CAAC,CACd,EAOD,IAAO,UAAW,CAIhB,IAAI/T,EAAI,KAAK,GACTC,EAAI,KAAK,GACT8T,EAAI,GAAMmM,EAAK,EAAIjgB,CAAC,EAAI,GAAM,KAAK,IAAI,EAAID,CAAC,EAEhD,OAAO,IAAIgV,EACT,KAAK,IAAIhV,CAAC,EAAIkgB,EAAKjgB,CAAC,EAAI8T,EACxB,KAAK,IAAI/T,CAAC,EAAIihB,EAAKhhB,CAAC,EAAI8T,CAAC,CAC5B,EAOD,IAAO,UAAW,CAIhB,IAAI/T,EAAI,KAAK,GACTC,EAAI,KAAK,GACT8T,EAAI,GAAMmM,EAAK,EAAIjgB,CAAC,EAAI,GAAM,KAAK,IAAI,EAAID,CAAC,EAEhD,OAAO,IAAIgV,EACT,KAAK,IAAIhV,CAAC,EAAIkgB,EAAKjgB,CAAC,EAAI8T,EACxB,CAAC,KAAK,IAAI/T,CAAC,EAAIihB,EAAKhhB,CAAC,EAAI8T,CAAC,CAC7B,EAOD,KAAQ,UAAW,CAIjB,IAAI/T,EAAI,KAAK,GACTC,EAAI,KAAK,GAETuI,EAAK,IAAIwM,EACX/U,EAAIA,EAAID,EAAIA,EAAI,EAChB,GAAKA,EAAIC,CAAC,EAAE,KAAS,EAEnBwI,EAAK,IAAIuM,EACXxM,EAAG,GAAQvI,EACXuI,EAAG,GAAQxI,CAAC,EAAE,IAAQ,EAExB,OAAO,IAAIgV,EAAQvM,EAAG,GAAO,CAACA,EAAG,EAAK,CACvC,EAOD,KAAQ,UAAW,CAIjB,IAAIzI,EAAI,KAAK,GACTC,EAAI,KAAK,GAETuI,EAAK,IAAIwM,EACX/U,EAAIA,EAAID,EAAIA,EAAI,EAChB,GAAKA,EAAIC,CAAC,EAAE,KAAS,EAEnBwI,EAAK,IAAIuM,EACXxM,EAAG,GAAQvI,EACXuI,EAAG,GAAQxI,CAAC,EAAE,IAAQ,EAExB,OAAO,IAAIgV,EAAQ,KAAK,GAAK,EAAIvM,EAAG,GAAOA,EAAG,EAAK,CACpD,EAOD,KAAQ,UAAW,CAIjB,IAAIzI,EAAI,KAAK,GACTC,EAAI,KAAK,GAEb,GAAID,IAAM,EAAG,CAEX,GAAIC,IAAM,EACR,OAAO,IAAI+U,EAAQ,EAAG,GAAQ,EAGhC,GAAI/U,IAAM,GACR,OAAO,IAAI+U,EAAQ,EAAG,IAAS,CAEzC,CAEM,IAAIjB,EAAI/T,EAAIA,GAAK,EAAMC,IAAM,EAAMA,GAE/BuI,EAAK,IAAIwM,GACV,EAAI/U,EAAIA,EAAID,EAAIA,GAAK+T,EACtB,GAAK/T,EAAI+T,CAAC,EAAE,IAAK,EAEnB,OAAO,IAAIiB,EAAQ,IAAOxM,EAAG,GAAO,GAAMA,EAAG,EAAK,CACnD,EAOD,KAAQ,UAAW,CAIjB,IAAIxI,EAAI,KAAK,GACTC,EAAI,KAAK,GAEb,GAAIA,IAAM,EACR,OAAO,IAAI+U,EAAQ,KAAK,MAAM,EAAGhV,CAAC,EAAG,CAAC,EAGxC,IAAI+T,EAAI/T,EAAIA,EAAIC,EAAIA,EACpB,OAAQ8T,IAAM,EACV,IAAIiB,EACJhV,EAAI+T,EACJ,CAAC9T,EAAI8T,CAAC,EAAE,KAAI,EACZ,IAAIiB,EACHhV,IAAM,EAAKA,EAAI,EAAI,EACnBC,IAAM,EAAK,CAACA,EAAI,EAAI,CAAC,EAAE,KAAM,CACnC,EAOD,KAAQ,UAAW,CAIjB,IAAID,EAAI,KAAK,GACTC,EAAI,KAAK,GAEb,GAAID,IAAM,GAAKC,IAAM,EACnB,OAAO,IAAI+U,EAAQ,EAAG,GAAQ,EAGhC,IAAIjB,EAAI/T,EAAIA,EAAIC,EAAIA,EACpB,OAAQ8T,IAAM,EACV,IAAIiB,EACJhV,EAAI+T,EACJ,CAAC9T,EAAI8T,CAAC,EAAE,KAAI,EACZ,IAAIiB,EACHhV,IAAM,EAAKA,EAAI,EAAI,EACnBC,IAAM,EAAK,CAACA,EAAI,EAAI,CAAC,EAAE,KAAM,CACnC,EAOD,KAAQ,UAAW,CAIjB,IAAID,EAAI,KAAK,GACTC,EAAI,KAAK,GAEb,GAAID,IAAM,GAAKC,IAAM,EACnB,OAAO,IAAI+U,EAAQ,KAAK,GAAK,EAAG,GAAQ,EAG1C,IAAIjB,EAAI/T,EAAIA,EAAIC,EAAIA,EACpB,OAAQ8T,IAAM,EACV,IAAIiB,EACJhV,EAAI+T,EACJ,CAAC9T,EAAI8T,CAAC,EAAE,KAAI,EACZ,IAAIiB,EACHhV,IAAM,EAAKA,EAAI,EAAI,EACnBC,IAAM,EAAK,CAACA,EAAI,EAAI,CAAC,EAAE,KAAM,CACnC,EAOD,KAAQ,UAAW,CAIjB,IAAID,EAAI,KAAK,GACTC,EAAI,KAAK,GAEb,OAAO,IAAI+U,EACTiM,EAAKjhB,CAAC,EAAI,KAAK,IAAIC,CAAC,EACpBigB,EAAKlgB,CAAC,EAAI,KAAK,IAAIC,CAAC,CAAC,CACxB,EAOD,KAAQ,UAAW,CAIjB,IAAID,EAAI,KAAK,GACTC,EAAI,KAAK,GAEb,OAAO,IAAI+U,EACTkL,EAAKlgB,CAAC,EAAI,KAAK,IAAIC,CAAC,EACpBghB,EAAKjhB,CAAC,EAAI,KAAK,IAAIC,CAAC,CAAC,CACxB,EAOD,KAAQ,UAAW,CAIjB,IAAID,EAAI,EAAI,KAAK,GACbC,EAAI,EAAI,KAAK,GACb8T,EAAImM,EAAKlgB,CAAC,EAAI,KAAK,IAAIC,CAAC,EAE5B,OAAO,IAAI+U,EACTiM,EAAKjhB,CAAC,EAAI+T,EACV,KAAK,IAAI9T,CAAC,EAAI8T,CAAC,CAClB,EAOD,KAAQ,UAAW,CAIjB,IAAI/T,EAAI,EAAI,KAAK,GACbC,EAAI,EAAI,KAAK,GACb8T,EAAImM,EAAKlgB,CAAC,EAAI,KAAK,IAAIC,CAAC,EAE5B,OAAO,IAAI+U,EACTiM,EAAKjhB,CAAC,EAAI+T,EACV,CAAC,KAAK,IAAI9T,CAAC,EAAI8T,CAAC,CACnB,EAOD,KAAQ,UAAW,CAIjB,IAAI/T,EAAI,KAAK,GACTC,EAAI,KAAK,GACT8T,EAAI,KAAK,IAAI,EAAI9T,CAAC,EAAIigB,EAAK,EAAIlgB,CAAC,EAEpC,OAAO,IAAIgV,EACT,GAAKiM,EAAKjhB,CAAC,EAAI,KAAK,IAAIC,CAAC,EAAI8T,EAC7B,EAAImM,EAAKlgB,CAAC,EAAI,KAAK,IAAIC,CAAC,EAAI8T,CAAC,CAChC,EAOD,KAAQ,UAAW,CAIjB,IAAI/T,EAAI,KAAK,GACTC,EAAI,KAAK,GACT8T,EAAI,KAAK,IAAI,EAAI9T,CAAC,EAAIigB,EAAK,EAAIlgB,CAAC,EAEpC,OAAO,IAAIgV,EACT,EAAIkL,EAAKlgB,CAAC,EAAI,KAAK,IAAIC,CAAC,EAAI8T,EAC5B,GAAKkN,EAAKjhB,CAAC,EAAI,KAAK,IAAIC,CAAC,EAAI8T,CAAC,CACjC,EAOD,MAAS,UAAW,CAIlB,IAAIuO,EAAM,KAAK,GACf,KAAK,GAAQ,CAAC,KAAK,GACnB,KAAK,GAAQA,EACb,IAAIC,EAAM,KAAK,KAAS,EAExB,YAAK,GAAQ,CAAC,KAAK,GACnB,KAAK,GAAQD,EACbA,EAAMC,EAAI,GAEVA,EAAI,GAAQ,CAACA,EAAI,GACjBA,EAAI,GAAQD,EACLC,CACR,EAOD,MAAS,UAAW,CAIlB,IAAIA,EAAM,KAAK,KAAS,EACxB,GAAIA,EAAI,IAAS,EAAG,CAClB,IAAID,EAAMC,EAAI,GACdA,EAAI,GAAQ,CAACA,EAAI,GACjBA,EAAI,GAAQD,CACpB,KAAa,CACL,IAAIA,EAAMC,EAAI,GACdA,EAAI,GAAQ,CAACA,EAAI,GACjBA,EAAI,GAAQD,CACpB,CACM,OAAOC,CACR,EAOD,MAAS,UAAW,CAIlB,IAAIviB,EAAI,KAAK,GACTC,EAAI,KAAK,GAETuiB,EAAOxiB,EAAI,GAAKC,IAAM,EACtBwiB,EAAW,EAAIziB,EACf0iB,EAAU,EAAI1iB,EACd+T,EAAI0O,EAAWA,EAAWxiB,EAAIA,EAE9B9P,EAAK4jB,IAAM,EACX,IAAIiB,GACH0N,EAAUD,EAAWxiB,EAAIA,GAAK8T,GAC9B9T,EAAIwiB,EAAWC,EAAUziB,GAAK8T,CAAC,EAChC,IAAIiB,EACHhV,IAAM,GAAOA,EAAI,EAAK,EACtBC,IAAM,EAAMA,EAAI,EAAK,CAAC,EAEvBqc,EAAOnsB,EAAE,GACb,OAAAA,EAAE,GAAQ2xB,EAAS3xB,EAAE,GAAOA,EAAE,EAAK,EAAI,EACvCA,EAAE,GAAQ,KAAK,MAAMA,EAAE,GAAOmsB,CAAI,EAAI,EAClCkG,IACFryB,EAAE,GAAQ,CAACA,EAAE,IAERA,CACR,EAOD,MAAS,UAAW,CAIlB,IAAI6P,EAAI,KAAK,GACTC,EAAI,KAAK,GAEb,GAAID,IAAM,GAAKC,IAAM,EACnB,OAAO,IAAI+U,EAAQ,EAAG,KAAK,GAAK,CAAC,EAGnC,IAAIjB,EAAI/T,EAAIA,EAAIC,EAAIA,EACpB,OAAQ8T,IAAM,EACV,IAAIiB,EACJhV,EAAI+T,EACJ,CAAC9T,EAAI8T,CAAC,EAAE,MAAK,EACb,IAAIiB,EACHhV,IAAM,EAAKA,EAAI,EAAI,EACnBC,IAAM,EAAK,CAACA,EAAI,EAAI,CAAC,EAAE,MAAO,CACpC,EAOD,MAAS,UAAW,CAIlB,IAAID,EAAI,KAAK,GACTC,EAAI,KAAK,GAEb,GAAIA,IAAM,EAER,OAAO,IAAI+U,EACRhV,IAAM,EACH,KAAK,IAAIA,EAAI,KAAK,KAAKA,EAAIA,EAAI,CAAC,CAAC,EACjC,IAAU,CAAC,EAGnB,IAAI+T,EAAI/T,EAAIA,EAAIC,EAAIA,EACpB,OAAQ8T,IAAM,EACV,IAAIiB,EACJhV,EAAI+T,EACJ,CAAC9T,EAAI8T,CAAC,EAAE,MAAK,EACb,IAAIiB,EACHhV,IAAM,EAAKA,EAAI,EAAI,EACnBC,IAAM,EAAK,CAACA,EAAI,EAAI,CAAC,EAAE,MAAO,CACpC,EAOD,MAAS,UAAW,CAIlB,IAAID,EAAI,KAAK,GACTC,EAAI,KAAK,GAEb,GAAI,KAAK,SACP,OAAO+U,EAAQ,SAGjB,IAAIjB,EAAI/T,EAAIA,EAAIC,EAAIA,EACpB,OAAQ8T,IAAM,EACV,IAAIiB,EACJhV,EAAI+T,EACJ,CAAC9T,EAAI8T,CAAC,EAAE,MAAK,EACb,IAAIiB,EACHhV,IAAM,EAAKA,EAAI,EAAI,EACnBC,IAAM,EAAK,CAACA,EAAI,EAAI,CAAC,EAAE,MAAO,CACpC,EAOD,QAAW,UAAW,CAGpB,GAAI,KAAK,SACP,OAAO+U,EAAQ,SAGjB,GAAI,KAAK,aACP,OAAOA,EAAQ,KAGjB,IAAIhV,EAAI,KAAK,GACTC,EAAI,KAAK,GAET8T,EAAI/T,EAAIA,EAAIC,EAAIA,EAEpB,OAAO,IAAI+U,EAAQhV,EAAI+T,EAAG,CAAC9T,EAAI8T,CAAC,CACjC,EAOD,UAAa,UAAW,CAEtB,OAAO,IAAIiB,EAAQ,KAAK,GAAO,CAAC,KAAK,EAAK,CAC3C,EAOD,IAAO,UAAW,CAEhB,OAAO,IAAIA,EAAQ,CAAC,KAAK,GAAO,CAAC,KAAK,EAAK,CAC5C,EAOD,KAAQ,SAAS2N,EAAQ,CAEvB,OAAAA,EAAS,KAAK,IAAI,GAAIA,GAAU,CAAC,EAE1B,IAAI3N,EACT,KAAK,KAAK,KAAK,GAAQ2N,CAAM,EAAIA,EACjC,KAAK,KAAK,KAAK,GAAQA,CAAM,EAAIA,CAAM,CAC1C,EAOD,MAAS,SAASA,EAAQ,CAExB,OAAAA,EAAS,KAAK,IAAI,GAAIA,GAAU,CAAC,EAE1B,IAAI3N,EACT,KAAK,MAAM,KAAK,GAAQ2N,CAAM,EAAIA,EAClC,KAAK,MAAM,KAAK,GAAQA,CAAM,EAAIA,CAAM,CAC3C,EAOD,MAAS,SAASA,EAAQ,CAExB,OAAAA,EAAS,KAAK,IAAI,GAAIA,GAAU,CAAC,EAE1B,IAAI3N,EACT,KAAK,MAAM,KAAK,GAAQ2N,CAAM,EAAIA,EAClC,KAAK,MAAM,KAAK,GAAQA,CAAM,EAAIA,CAAM,CAC3C,EASD,OAAU,SAAS3iB,EAAGC,EAAG,CAEvB,IAAIwa,EAAI,IAAIzF,EAAQhV,EAAGC,CAAC,EAExB,OAAO,KAAK,IAAIwa,EAAE,GAAQ,KAAK,EAAK,GAAKzF,EAAQ,SAC/C,KAAK,IAAIyF,EAAE,GAAQ,KAAK,EAAK,GAAKzF,EAAQ,OAC7C,EAOD,MAAS,UAAW,CAElB,OAAO,IAAIA,EAAQ,KAAK,GAAO,KAAK,EAAK,CAC1C,EAOD,SAAY,UAAW,CAErB,IAAIhV,EAAI,KAAK,GACTC,EAAI,KAAK,GACT2iB,EAAM,GAEV,OAAI,KAAK,QACA,MAGL,KAAK,aACA,YAGL,KAAK,IAAI5iB,CAAC,EAAIgV,EAAQ,UACxBhV,EAAI,GAGF,KAAK,IAAIC,CAAC,EAAI+U,EAAQ,UACxB/U,EAAI,GAIFA,IAAM,EACD2iB,EAAM5iB,GAGXA,IAAM,GACR4iB,GAAO5iB,EACP4iB,GAAO,IACH3iB,EAAI,GACNA,EAAI,CAACA,EACL2iB,GAAO,KAEPA,GAAO,IAETA,GAAO,KACE3iB,EAAI,IACbA,EAAI,CAACA,EACL2iB,GAAO,KAGC3iB,IAAN,IACF2iB,GAAO3iB,GAEF2iB,EAAM,KACd,EAOD,SAAY,UAAW,CAErB,MAAO,CAAC,KAAK,GAAO,KAAK,EAAK,CAC/B,EAOD,QAAW,UAAW,CAEpB,OAAI,KAAK,KAAU,EACV,KAAK,GAEP,IACR,EAOD,MAAS,UAAW,CAClB,OAAO,MAAM,KAAK,EAAK,GAAK,MAAM,KAAK,EAAK,CAC7C,EAQD,OAAU,UAAW,CACnB,OAAO,KAAK,KAAU,GAAK,KAAK,KAAU,CAC3C,EAQD,SAAY,UAAW,CACrB,OAAO,SAAS,KAAK,EAAK,GAAK,SAAS,KAAK,EAAK,CACnD,EAQD,WAAc,UAAW,CACvB,MAAO,EAAE,KAAK,MAAU,GAAI,KAAK,WACvC,CACG,EAED5N,EAAQ,KAAU,IAAIA,EAAQ,EAAG,CAAC,EAClCA,EAAQ,IAAS,IAAIA,EAAQ,EAAG,CAAC,EACjCA,EAAQ,EAAO,IAAIA,EAAQ,EAAG,CAAC,EAC/BA,EAAQ,GAAQ,IAAIA,EAAQ,KAAK,GAAI,CAAC,EACtCA,EAAQ,EAAO,IAAIA,EAAQ,KAAK,EAAG,CAAC,EACpCA,EAAQ,SAAc,IAAIA,EAAQ,IAAU,GAAQ,EACpDA,EAAQ,IAAS,IAAIA,EAAQ,IAAK,GAAG,EACrCA,EAAQ,QAAa,MAOnB,OAAO,eAAeA,EAAS,aAAc,CAAE,MAAS,GAAM,EAC9DA,EAAQ,QAAaA,EACrBA,EAAQ,QAAaA,EACrB6N,EAAO,QAAa7N,CAKvB,GAAM,+CC34CP,IAAI7d,GAAO,UACPic,GAAe,CAAE,EACV0P,GAAoC3P,GAAQhc,GAAMic,GAAc,KAIzE,OAAO,eAAe4B,GAAS,OAAQ,CACrC,MAAO,SACX,CAAG,EACDA,GAAQ,UAAU,YAAcA,GAChCA,GAAQ,UAAU,KAAO,UACzBA,GAAQ,UAAU,UAAY,GAO9BA,GAAQ,UAAU,OAAS,UAAY,CACrC,MAAO,CACL,OAAQ,UACR,GAAI,KAAK,GACT,GAAI,KAAK,EACV,CACF,EAODA,GAAQ,UAAU,QAAU,UAAY,CACtC,MAAO,CACL,EAAG,KAAK,IAAK,EACb,IAAK,KAAK,IAAG,CACd,CACF,EAWDA,GAAQ,UAAU,OAAS,SAAUtlB,EAAS,CAC5C,IAAI4iB,EAAM,GACN+P,EAAK,KAAK,GACVD,EAAK,KAAK,GACVW,EAAQjS,GAAO,KAAK,GAAIphB,CAAO,EAC/BszB,EAAQlS,GAAO,KAAK,GAAIphB,CAAO,EAG/BshB,EAAY7T,GAASzN,CAAO,EAAIA,EAAUA,EAAUA,EAAQ,UAAY,KAC5E,GAAIshB,IAAc,KAAM,CACtB,IAAI+B,EAAU,KAAK,IAAI,GAAI,CAAC/B,CAAS,EACjC,KAAK,IAAIoR,EAAKC,CAAE,EAAItP,IACtBqP,EAAK,GAEH,KAAK,IAAIC,EAAKD,CAAE,EAAIrP,IACtBsP,EAAK,EAEb,CACI,OAAIA,IAAO,EAET/P,EAAMyQ,EACGX,IAAO,EAEZC,IAAO,EACT/P,EAAM,IACG+P,IAAO,GAChB/P,EAAM,KAENA,EAAM0Q,EAAQ,IAIZX,EAAK,EACHA,IAAO,GACT/P,EAAMyQ,EAAQ,OAEdzQ,EAAMyQ,EAAQ,MAAQC,EAAM,UAAU,CAAC,EAAI,IAGzCX,IAAO,EACT/P,EAAMyQ,EAAQ,OAEdzQ,EAAMyQ,EAAQ,MAAQC,EAAQ,IAI7B1Q,CACR,EAaD0C,GAAQ,UAAY,SAAUnP,EAAM,CAClC,OAAQ,UAAU,OAAM,CACtB,IAAK,GACH,CACE,IAAIuD,EAAM,UAAU,CAAC,EACrB,GAAI,OAAOA,GAAQ,SACjB,OAAO4L,GAAQ5L,CAAG,EAElB,MAAM,IAAI,UAAU,gDAAgD,CAEhF,CACM,IAAK,GACH,CACE,IAAI,EAAI,UAAU,CAAC,EACf6Z,EAAM,UAAU,CAAC,EACrB,GAAI9lB,GAAS,CAAC,EAAG,CAKf,GAJII,GAAO0lB,CAAG,GAAKA,EAAI,QAAQ,OAAO,IAEpCA,EAAMA,EAAI,SAAS,KAAK,GAEtB9lB,GAAS8lB,CAAG,EACd,OAAO,IAAIjO,GAAQ,CACjB,EACA,IAAAiO,CAChB,CAAe,EAEH,MAAM,IAAI,UAAU,wCAAwC,CACxE,KACY,OAAM,IAAI,UAAU,2BAA2B,CAE3D,CACM,QACE,MAAM,IAAI,YAAY,iDAAiD,CAC/E,CACG,EACDjO,GAAQ,UAAU,QAAUA,GAAQ,UAAU,SAU9CA,GAAQ,SAAW,SAAUyM,EAAM,CACjC,OAAO,IAAIzM,GAAQyM,CAAI,CACxB,EAiBDzM,GAAQ,QAAU,SAAUhV,EAAGC,EAAG,CAChC,OAAID,EAAE,GAAKC,EAAE,GACJ,EAELD,EAAE,GAAKC,EAAE,GACJ,GAELD,EAAE,GAAKC,EAAE,GACJ,EAELD,EAAE,GAAKC,EAAE,GACJ,GAEF,CACR,EACM+U,IACN,CACD,QAAS,EACX,CAAC;;;;;;yDC1JA,SAASne,EAAM,CAOd,IAAIqsB,EAAgB,IAGhB7L,EAAI,CACN,EAAK,EACL,EAAK,EACL,EAAK,CACN,EAED,SAAS8L,EAAOpmB,EAAGsH,EAAG,CAEpB,GAAI,MAAMtH,EAAI,SAASA,EAAG,EAAE,CAAC,EAC3B,MAAMqmB,EAAkB,EAE1B,OAAOrmB,EAAIsH,CACf,CAGE,SAASgf,EAAYtmB,EAAGgX,EAAG,CAEzB,GAAIA,IAAM,EACR,MAAMuP,EAAgB,EAGxB,IAAIhO,EAAI,OAAO,OAAOJ,EAAS,SAAS,EACxCI,EAAE,EAAOvY,EAAI,EAAI,GAAK,EAEtBA,EAAIA,EAAI,EAAI,CAACA,EAAIA,EAEjB,IAAIiD,EAAIujB,EAAIxmB,EAAGgX,CAAC,EAEhB,OAAAuB,EAAE,EAAOvY,EAAIiD,EACbsV,EAAE,EAAOvB,EAAI/T,EACNsV,CACX,CAEE,SAASkO,EAAU1J,EAAK,CAQtB,QANI2J,EAAU,CAAE,EAEZ1mB,EAAI+c,EACJvpB,EAAI,EACJ8T,EAAI,EAEDA,GAAKtH,GAAG,CAEb,KAAOA,EAAIxM,IAAM,GACfwM,GAAIxM,EACJkzB,EAAQlzB,CAAC,GAAKkzB,EAAQlzB,CAAC,GAAK,GAAK,EAEnC8T,GAAI,EAAI,EAAI9T,GAClB,CAEI,OAAIwM,IAAM+c,EACJ/c,EAAI,IACN0mB,EAAQ1mB,CAAC,GAAK0mB,EAAQ1mB,CAAC,GAAK,GAAK,GAEnC0mB,EAAQ3J,CAAG,GAAK2J,EAAQ3J,CAAG,GAAK,GAAK,EAEhC2J,CACX,CAEE,IAAI1B,EAAQ,SAAS2B,EAAIC,EAAI,CAE3B,IAAI5mB,EAAI,EAAGgX,EAAI,EAAG1P,EAAI,EAClBpN,EAAI,EAAG0hB,EAAI,EAAGxoB,EAAI,EAAG2iB,EAAI,EAAG2H,EAAI,EAEhCmJ,EAAI,EAAG,EAAI,EACXC,EAAI,EAAGC,EAAI,EAEXC,EAAI,IACJC,EAEJ,GAAwBN,GAAO,KAExB,GAAIC,IAAO,QAKhB,GAJA5mB,EAAI2mB,EACJ3P,EAAI4P,EACJtf,EAAItH,EAAIgX,EAEJhX,EAAI,IAAM,GAAKgX,EAAI,IAAM,EAC3B,MAAMkQ,EAAqB,MAI7B,QAAQ,OAAOP,EAAE,CAEf,IAAK,SACH,CACE,GAAI,MAAOA,GAAM,MAAOA,EACtB3mB,EAAI2mB,EAAG,EACP3P,EAAI2P,EAAG,EACH,MAAOA,IACT3mB,GAAI2mB,EAAG,WACA,KAAKA,EACd3mB,EAAI2mB,EAAG,CAAC,EACJ,KAAKA,IACP3P,EAAI2P,EAAG,CAAC,OAEV,OAAMN,EAAkB,EAE1B/e,EAAItH,EAAIgX,EACR,KACZ,CACQ,IAAK,SACH,CAME,GALI2P,EAAK,IACPrf,EAAIqf,EACJA,EAAK,CAACA,GAGJA,EAAK,IAAM,EACb3mB,EAAI2mB,UACKA,EAAK,EAAG,CAUjB,IARIA,GAAM,IACRjJ,EAAI,KAAK,IAAI,GAAI,KAAK,MAAM,EAAI,KAAK,IAAIiJ,CAAE,EAAI,KAAK,IAAI,CAAC,EACzDA,GAAKjJ,GAMA,GAAKsJ,GAAKD,GAAKC,GAGpB,GAFAC,GAAKJ,EAAIC,IAAM,EAAIC,GAEfJ,IAAOM,EAAG,CACR,EAAIF,GAAKC,GACXhnB,EAAI6mB,EAAIC,EACR9P,EAAI,EAAI+P,GACCA,EAAI,GACb/mB,EAAI8mB,EACJ9P,EAAI+P,IAEJ/mB,EAAI6mB,EACJ7P,EAAI,GAEN,KAElB,MAEsB2P,EAAKM,GACPJ,GAAIC,EACJ,GAAIC,IAEJD,GAAID,EACJE,GAAI,GAGF,EAAIC,GACNhnB,EAAI8mB,EACJ9P,EAAI+P,IAEJ/mB,EAAI6mB,EACJ7P,EAAI,GAIVhX,GAAI0d,CACL,MAAU,MAAMiJ,CAAE,GAAK,MAAMC,CAAE,KAC9B5P,EAAIhX,EAAI,KAEV,KACZ,CACQ,IAAK,SACH,CAGE,GAFA,EAAI2mB,EAAG,MAAM,QAAQ,EAEjB,IAAM,KACR,MAAMN,EAAkB,EA2C1B,GAzCI,EAAEQ,CAAC,IAAM,KACXvf,EAAI,GACJuf,KACS,EAAEA,CAAC,IAAM,KAClBA,IAGE,EAAE,SAAWA,EAAI,EACnBjL,EAAIwK,EAAO,EAAES,GAAG,EAAGvf,CAAC,EACX,EAAEuf,EAAI,CAAC,IAAM,KAAO,EAAEA,CAAC,IAAM,KAElC,EAAEA,CAAC,IAAM,MACX3sB,EAAIksB,EAAO,EAAES,GAAG,EAAGvf,CAAC,GAEtBuf,KAGIA,EAAI,IAAM,EAAE,QAAU,EAAEA,EAAI,CAAC,IAAM,KAAO,EAAEA,EAAI,CAAC,IAAM,KAAO,EAAEA,EAAI,CAAC,IAAM,KAAO,EAAEA,EAAI,CAAC,IAAM,OACjGjL,EAAIwK,EAAO,EAAES,CAAC,EAAGvf,CAAC,EAClByO,EAAI,KAAK,IAAI,GAAI,EAAE8Q,CAAC,EAAE,MAAM,EAC5BA,MAIE,EAAEA,CAAC,IAAM,KAAO,EAAEA,EAAI,CAAC,IAAM,KAAO,EAAEA,CAAC,IAAM,KAAO,EAAEA,EAAI,CAAC,IAAM,OACnEzzB,EAAIgzB,EAAO,EAAES,EAAI,CAAC,EAAGvf,CAAC,EACtBoW,EAAI,KAAK,IAAI,GAAI,EAAEmJ,EAAI,CAAC,EAAE,MAAM,EAAI,EACpCA,GAAI,IAGG,EAAEA,EAAI,CAAC,IAAM,KAAO,EAAEA,EAAI,CAAC,IAAM,KAC1CjL,EAAIwK,EAAO,EAAES,CAAC,EAAGvf,CAAC,EAClByO,EAAIqQ,EAAO,EAAES,EAAI,CAAC,EAAG,CAAC,EACtBA,GAAI,GACK,EAAEA,EAAI,CAAC,IAAM,KAAO,EAAEA,EAAI,CAAC,IAAM,MAC1C3sB,EAAIksB,EAAO,EAAES,CAAC,EAAGvf,CAAC,EAClBsU,EAAIwK,EAAO,EAAES,EAAI,CAAC,EAAGvf,CAAC,EACtByO,EAAIqQ,EAAO,EAAES,EAAI,CAAC,EAAG,CAAC,EACtBA,GAAI,GAGF,EAAE,QAAUA,EAAG,CACjB7P,EAAIjB,EAAI2H,EACRpW,EACAtH,EAAI5M,EAAI4jB,EAAI9c,EAAIwjB,EAAI9B,EACpB,KACd,CAGA,CACQ,QACE,MAAMyK,EAAkB,CAClC,CAEI,GAAIrP,IAAM,EACR,MAAMuP,EAAgB,EAGxBjM,EAAE,EAAOhT,EAAI,EAAI,GAAK,EACtBgT,EAAE,EAAO,KAAK,IAAIta,CAAC,EACnBsa,EAAE,EAAO,KAAK,IAAItD,CAAC,CACpB,EAED,SAASmQ,EAAOjkB,EAAGzO,EAAG4mB,EAAG,CAGvB,QADInb,EAAI,EACDzL,EAAI,EAAGyO,EAAKA,EAAIA,EAAKmY,EAAG5mB,IAAM,EAE/BA,EAAI,IACNyL,EAAKA,EAAIgD,EAAKmY,GAGlB,OAAOnb,CACX,CAGE,SAASknB,EAASpnB,EAAGgX,EAAG,CAEtB,KAAOA,EAAI,IAAM,EACfA,GAAI,EAAG,CAGT,KAAOA,EAAI,IAAM,EACfA,GAAI,EAAG,CAGT,GAAIA,IAAM,EACR,MAAO,GAUT,QAHIkJ,EAAM,GAAKlJ,EACX/W,EAAI,EAEDigB,IAAQ,EAAGjgB,IAGhB,GAFAigB,EAAMA,EAAM,GAAKlJ,EAEb/W,EAAIkmB,EACN,MAAO,GAEX,OAAOlmB,CACX,CAGE,SAASonB,EAAWrnB,EAAGgX,EAAG3T,EAAK,CAK7B,QAHIikB,EAAO,EACPC,EAAOJ,EAAO,GAAI9jB,EAAK2T,CAAC,EAEnB/W,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAG5B,GAAIqnB,IAASC,EACX,OAAOtnB,EAETqnB,EAAOA,EAAO,GAAKtQ,EACnBuQ,EAAOA,EAAO,GAAKvQ,CACzB,CACI,MAAO,EACX,CAEE,SAASwP,EAAIvjB,EAAGC,EAAG,CAEjB,GAAI,CAACD,EACH,OAAOC,EACT,GAAI,CAACA,EACH,OAAOD,EAET,OAAU,CAER,GADAA,GAAIC,EACA,CAACD,EACH,OAAOC,EAET,GADAA,GAAID,EACA,CAACC,EACH,OAAOD,CACf,EAUE,SAASkV,EAASlV,EAAGC,EAAG,CAItB,GAFA8hB,EAAM/hB,EAAGC,CAAC,EAEN,gBAAgBiV,EAClBlV,EAAIujB,EAAIlM,EAAE,EAAMA,EAAE,CAAI,EACtB,KAAK,EAAOA,EAAE,EACd,KAAK,EAAOA,EAAE,EAAOrX,EACrB,KAAK,EAAOqX,EAAE,EAAOrX,MAErB,QAAOqjB,EAAYhM,EAAE,EAAOA,EAAE,EAAMA,EAAE,CAAI,CAEhD,CAEE,IAAIiM,EAAiB,UAAW,CAAE,OAAO,IAAI,MAAM,kBAAkB,CAAI,EACrEF,EAAmB,UAAW,CAAE,OAAO,IAAI,MAAM,kBAAkB,CAAI,EACvEa,EAAsB,UAAW,CAAE,OAAO,IAAI,MAAM,4BAA4B,CAAI,EAExF/O,EAAS,UAAY,CAEnB,EAAK,EACL,EAAK,EACL,EAAK,EAOL,IAAO,UAAW,CAEhB,OAAOmO,EAAY,KAAK,EAAM,KAAK,CAAI,CACxC,EAOD,IAAO,UAAW,CAEhB,OAAOA,EAAY,CAAC,KAAK,EAAO,KAAK,EAAM,KAAK,CAAI,CACrD,EAOD,IAAO,SAASrjB,EAAGC,EAAG,CAEpB,OAAA8hB,EAAM/hB,EAAGC,CAAC,EACHojB,EACL,KAAK,EAAO,KAAK,EAAOhM,EAAE,EAAOA,EAAE,EAAO,KAAK,EAAOA,EAAE,EACxD,KAAK,EAAOA,EAAE,CACf,CACF,EAOD,IAAO,SAASrX,EAAGC,EAAG,CAEpB,OAAA8hB,EAAM/hB,EAAGC,CAAC,EACHojB,EACL,KAAK,EAAO,KAAK,EAAOhM,EAAE,EAAOA,EAAE,EAAO,KAAK,EAAOA,EAAE,EACxD,KAAK,EAAOA,EAAE,CACf,CACF,EAOD,IAAO,SAASrX,EAAGC,EAAG,CAEpB,OAAA8hB,EAAM/hB,EAAGC,CAAC,EACHojB,EACL,KAAK,EAAOhM,EAAE,EAAO,KAAK,EAAOA,EAAE,EACnC,KAAK,EAAOA,EAAE,CACf,CACF,EAOD,IAAO,SAASrX,EAAGC,EAAG,CAEpB,OAAA8hB,EAAM/hB,EAAGC,CAAC,EACHojB,EACL,KAAK,EAAOhM,EAAE,EAAO,KAAK,EAAOA,EAAE,EACnC,KAAK,EAAOA,EAAE,CACf,CACF,EAOD,MAAS,UAAW,CAClB,OAAOgM,EAAY,KAAK,EAAO,KAAK,EAAM,KAAK,CAAI,CACpD,EAOD,IAAO,SAASrjB,EAAGC,EAAG,CAEpB,GAAI,MAAM,KAAK,CAAI,GAAK,MAAM,KAAK,CAAI,EACrC,OAAO,IAAIiV,EAAS,GAAG,EAGzB,GAAIlV,IAAM,OACR,OAAOqjB,EAAY,KAAK,EAAO,KAAK,EAAO,KAAK,EAAM,CAAC,EAIzD,GADAtB,EAAM/hB,EAAGC,CAAC,EACAoX,EAAE,IAAR,GAAsB,KAAK,IAAX,EAClB,MAAMiM,EAAgB,EAiBxB,OAAOD,EACL,KAAK,GAAQhM,EAAE,EAAO,KAAK,IAASA,EAAE,EAAO,KAAK,GAClDA,EAAE,EAAO,KAAK,CACf,CACF,EAOD,IAAO,SAASrX,EAAGC,EAAG,CAEpB,OAAA8hB,EAAM/hB,EAAGC,CAAC,EAIHojB,EAAYE,EAAIlM,EAAE,EAAM,KAAK,CAAI,EAAIkM,EAAIlM,EAAE,EAAM,KAAK,CAAI,EAAGA,EAAE,EAAO,KAAK,CAAI,CACvF,EAOD,IAAO,SAASrX,EAAGC,EAAG,CAMpB,OAJA8hB,EAAM/hB,EAAGC,CAAC,EAINoX,EAAE,IAAS,GAAK,KAAK,IAAS,EACzBgM,EAAY,EAAG,CAAC,EAElBA,EAAYhM,EAAE,EAAO,KAAK,EAAMkM,EAAIlM,EAAE,EAAM,KAAK,CAAI,EAAIkM,EAAIlM,EAAE,EAAM,KAAK,CAAI,CAAC,CACvF,EAOD,KAAQ,SAASsL,EAAQ,CAIvB,OAFAA,EAAS,KAAK,IAAI,GAAIA,GAAU,CAAC,EAE7B,MAAM,KAAK,CAAI,GAAK,MAAM,KAAK,CAAI,EAC9B,IAAIzN,EAAS,GAAG,EAElBmO,EAAY,KAAK,KAAKV,EAAS,KAAK,EAAO,KAAK,EAAO,KAAK,CAAI,EAAGA,CAAM,CACjF,EAOD,MAAS,SAASA,EAAQ,CAIxB,OAFAA,EAAS,KAAK,IAAI,GAAIA,GAAU,CAAC,EAE7B,MAAM,KAAK,CAAI,GAAK,MAAM,KAAK,CAAI,EAC9B,IAAIzN,EAAS,GAAG,EAElBmO,EAAY,KAAK,MAAMV,EAAS,KAAK,EAAO,KAAK,EAAO,KAAK,CAAI,EAAGA,CAAM,CAClF,EAOD,MAAS,SAASA,EAAQ,CAIxB,OAFAA,EAAS,KAAK,IAAI,GAAIA,GAAU,CAAC,EAE7B,MAAM,KAAK,CAAI,GAAK,MAAM,KAAK,CAAI,EAC9B,IAAIzN,EAAS,GAAG,EAElBmO,EAAY,KAAK,MAAMV,EAAS,KAAK,EAAO,KAAK,EAAO,KAAK,CAAI,EAAGA,CAAM,CAClF,EAOD,QAAW,UAAW,CAEpB,OAAOU,EAAY,KAAK,EAAO,KAAK,EAAM,KAAK,CAAI,CACpD,EAOD,IAAO,SAASrjB,EAAGC,EAAG,CAMpB,GAJA8hB,EAAM/hB,EAAGC,CAAC,EAINoX,EAAE,IAAS,EAEb,OAAIA,EAAE,EAAO,EACJgM,EAAY,KAAK,IAAI,KAAK,EAAO,KAAK,EAAMhM,EAAE,CAAI,EAAG,KAAK,IAAI,KAAK,EAAMA,EAAE,CAAI,CAAC,EAEhFgM,EAAY,KAAK,IAAI,KAAK,EAAO,KAAK,EAAMhM,EAAE,CAAI,EAAG,KAAK,IAAI,KAAK,EAAMA,EAAE,CAAI,CAAC,EAU3F,GAAI,KAAK,EAAO,EAAG,OAAO,KAG1B,IAAI0M,EAAIP,EAAU,KAAK,CAAI,EACvBM,EAAIN,EAAU,KAAK,CAAI,EAGvBzmB,EAAI,EACJgX,EAAI,EACR,QAASwD,KAAKwM,EACZ,GAAIxM,IAAM,IACV,IAAIA,IAAM,IAAK,CACbxa,EAAI,EACJ,KACV,CAGQ,GAFAgnB,EAAExM,CAAC,GAAIF,EAAE,EAEL0M,EAAExM,CAAC,EAAIF,EAAE,IAAS,EACpB0M,EAAExM,CAAC,GAAIF,EAAE,MACJ,QAAO,KACdta,GAAI,KAAK,IAAIwa,EAAGwM,EAAExM,CAAC,CAAC,EAGtB,QAASA,KAAKuM,EACZ,GAAIvM,IAAM,IAGV,IAFAuM,EAAEvM,CAAC,GAAIF,EAAE,EAELyM,EAAEvM,CAAC,EAAIF,EAAE,IAAS,EACpByM,EAAEvM,CAAC,GAAIF,EAAE,MACJ,QAAO,KACdtD,GAAI,KAAK,IAAIwD,EAAGuM,EAAEvM,CAAC,CAAC,EAGtB,OAAIF,EAAE,EAAO,EACJgM,EAAYtP,EAAGhX,CAAC,EAElBsmB,EAAYtmB,EAAGgX,CAAC,CACxB,EAOD,OAAU,SAAS/T,EAAGC,EAAG,CAEvB,OAAA8hB,EAAM/hB,EAAGC,CAAC,EACH,KAAK,EAAO,KAAK,EAAOoX,EAAE,IAASA,EAAE,EAAOA,EAAE,EAAO,KAAK,CAClE,EAOD,QAAW,SAASrX,EAAGC,EAAG,CAExB8hB,EAAM/hB,EAAGC,CAAC,EACV,IAAIjD,EAAK,KAAK,EAAO,KAAK,EAAOqa,EAAE,EAAOA,EAAE,EAAOA,EAAE,EAAO,KAAK,EACjE,OAAQ,EAAIra,IAAMA,EAAI,EACvB,EAED,SAAY,SAASunB,EAAK,CAExB,GAAI,MAAM,KAAK,CAAI,GAAK,MAAM,KAAK,CAAI,EACrC,OAAO,KAGTA,EAAMA,GAAO,KAKb,QAHIC,EAAU,KAAK,IAAQ,EACvBC,EAAOD,EAAQ,YAAgB,EAE1Bj0B,EAAI,EAAGA,EAAIk0B,EAAK,OAAQl0B,IAAK,CAGpC,QADI8T,EAAIgf,EAAYoB,EAAKl0B,EAAI,CAAC,EAAG,CAAC,EACzBgnB,EAAIhnB,EAAI,EAAGgnB,GAAK,EAAGA,IAC1BlT,EAAIA,EAAE,QAAU,EAAG,IAAOogB,EAAKlN,CAAC,CAAC,EAGnC,GAAI,KAAK,IAAIlT,EAAE,IAAOmgB,CAAO,EAAE,SAAS,EAAID,EAC1C,OAAOlgB,EAAE,IAAO,KAAK,CAAI,CAEnC,CACM,OAAO,IACR,EAOD,UAAa,SAASrE,EAAGC,EAAG,CAE1B,OAAA8hB,EAAM/hB,EAAGC,CAAC,EACH,EAAE,EAAEoX,EAAE,EAAO,KAAK,IAAW,KAAK,EAAOA,EAAE,GAASA,EAAE,EAAO,KAAK,GAC1E,EAOD,QAAW,UAAW,CAEpB,OAAO,KAAK,EAAO,KAAK,EAAO,KAAK,CACrC,EAOD,WAAc,SAASqN,EAAc,CAEnC,IAAIC,EAAOrS,EAAM,GACbvV,EAAI,KAAK,EACTgX,EAAI,KAAK,EACb,OAAI,KAAK,EAAO,IACdzB,GAAM,KAGJyB,IAAM,EACRzB,GAAMvV,GAGF2nB,IAAiBC,EAAQ,KAAK,MAAM5nB,EAAIgX,CAAC,GAAK,IAChDzB,GAAMqS,EACNrS,GAAM,IACNvV,GAAIgX,GAGNzB,GAAMvV,EACNuV,GAAM,IACNA,GAAMyB,GAEDzB,CACR,EAOD,QAAW,SAASoS,EAAc,CAEhC,IAAIC,EAAOrS,EAAM,GACbvV,EAAI,KAAK,EACTgX,EAAI,KAAK,EACb,OAAI,KAAK,EAAO,IACdzB,GAAM,KAGJyB,IAAM,EACRzB,GAAMvV,GAGF2nB,IAAiBC,EAAQ,KAAK,MAAM5nB,EAAIgX,CAAC,GAAK,IAChDzB,GAAMqS,EACN5nB,GAAIgX,GAGNzB,GAAM,UACNA,GAAMvV,EACNuV,GAAM,KACNA,GAAMyB,EACNzB,GAAM,KAEDA,CACR,EAOD,YAAe,UAAW,CAExB,IAAItV,EACAgD,EAAI,KAAK,EACTC,EAAI,KAAK,EACTsiB,EAAM,CAAE,EAEZ,GAAI,MAAMviB,CAAC,GAAK,MAAMC,CAAC,EACrB,OAAOsiB,EAGT,GACEA,EAAI,KAAK,KAAK,MAAMviB,EAAIC,CAAC,CAAC,EAC1BjD,EAAIgD,EAAIC,EACRD,EAAIC,EACJA,EAAIjD,QACGgD,IAAM,GAEf,OAAOuiB,CACR,EAOD,SAAY,SAASqC,EAAK,CAExB,IAAIb,EAAI,KAAK,EACTD,EAAI,KAAK,EAEb,GAAI,MAAMC,CAAC,GAAK,MAAMD,CAAC,EACrB,MAAO,MAGTc,EAAMA,GAAO,GAEb,IAAIC,EAASV,EAASJ,EAAGD,CAAC,EACtBgB,EAASV,EAAWL,EAAGD,EAAGe,CAAM,EAEhCvS,EAAM,KAAK,EAAO,EAAI,IAAM,GAUhC,GARAA,GAAMyR,EAAID,EAAI,EAEdC,GAAID,EACJC,GAAI,GAEAA,IACFzR,GAAM,KAEJuS,EAAQ,CAEV,QAASt0B,EAAIu0B,EAAQv0B,KACnB+hB,GAAMyR,EAAID,EAAI,EACdC,GAAID,EACJC,GAAI,GAENzR,GAAM,IACN,QAAS/hB,EAAIs0B,EAAQt0B,KACnB+hB,GAAMyR,EAAID,EAAI,EACdC,GAAID,EACJC,GAAI,GAENzR,GAAM,GACd,KACQ,SAAS/hB,EAAIq0B,EAAKb,GAAKxzB,KACrB+hB,GAAMyR,EAAID,EAAI,EACdC,GAAID,EACJC,GAAI,GAGR,OAAOzR,CACb,CACG,EAGC,OAAO,eAAe4C,EAAU,aAAc,CAAE,MAAS,GAAM,EAC/DA,EAAS,QAAaA,EACtBA,EAAS,SAAcA,EACvB2N,EAAO,QAAa3N,CAKvB,GAAM,+CCp3BP,IAAI/d,GAAO,WACPic,GAAe,CAAE,EACV2R,GAAqC5R,GAAQhc,GAAMic,GAAc,KAI1E,OAAO,eAAe8B,GAAU,OAAQ,CACtC,MAAO,UACX,CAAG,EACDA,GAAS,UAAU,YAAcA,GACjCA,GAAS,UAAU,KAAO,WAC1BA,GAAS,UAAU,WAAa,GAOhCA,GAAS,UAAU,OAAS,UAAY,CACtC,MAAO,CACL,OAAQ,WACR,EAAG,KAAK,EAAI,KAAK,EACjB,EAAG,KAAK,CACT,CACF,EAQDA,GAAS,SAAW,SAAUuM,EAAM,CAClC,OAAO,IAAIvM,GAASuM,CAAI,CACzB,EACMvM,IACN,CACD,QAAS,EACX,CAAC,ECvCG/d,GAAO,SACPic,GAAe,CAAE,EACV4R,GAAmC7R,GAAQhc,GAAMic,GAAc,IAAM,CAuB9E,SAAS6R,GAAS,CAChB,GAAI,EAAE,gBAAgBA,GACpB,MAAM,IAAI,YAAY,kDAAkD,CAE9E,CAKE,OAAAA,EAAO,UAAU,KAAO,SACxBA,EAAO,UAAU,SAAW,GAU5BA,EAAO,UAAU,QAAU,UAAY,CAErC,MAAM,IAAI,MAAM,6CAA6C,CAC9D,EAUDA,EAAO,UAAU,SAAW,UAAY,CAEtC,MAAM,IAAI,MAAM,8CAA8C,CAC/D,EAODA,EAAO,UAAU,OAAS,SAAU32B,EAAM42B,EAAU,CAClD,MAAM,IAAI,MAAM,4CAA4C,CAC7D,EAeDD,EAAO,UAAU,OAAS,SAAUjxB,EAAOjF,EAAamkB,EAAc,CAEpE,MAAM,IAAI,MAAM,4CAA4C,CAC7D,EAOD+R,EAAO,UAAU,IAAM,SAAUjxB,EAAO,CAEtC,MAAM,IAAI,MAAM,yCAAyC,CAC1D,EAWDixB,EAAO,UAAU,IAAM,SAAUjxB,EAAOvE,EAAOyjB,EAAc,CAE3D,MAAM,IAAI,MAAM,yCAAyC,CAC1D,EAcD+R,EAAO,UAAU,OAAS,SAAUxrB,EAAMyZ,EAAc,CAEtD,MAAM,IAAI,MAAM,4CAA4C,CAC7D,EAWD+R,EAAO,UAAU,QAAU,SAAUxrB,EAAMyZ,EAAc,CAEvD,MAAM,IAAI,MAAM,6CAA6C,CAC9D,EAMD+R,EAAO,UAAU,MAAQ,UAAY,CAEnC,MAAM,IAAI,MAAM,2CAA2C,CAC5D,EAMDA,EAAO,UAAU,KAAO,UAAY,CAElC,MAAM,IAAI,MAAM,0CAA0C,CAC3D,EAYDA,EAAO,UAAU,IAAM,SAAUzvB,EAAU2vB,EAAW,CAEpD,MAAM,IAAI,MAAM,yCAAyC,CAC1D,EAQDF,EAAO,UAAU,QAAU,SAAUzvB,EAAU,CAE7C,MAAM,IAAI,MAAM,6CAA6C,CAC9D,EAMDyvB,EAAO,UAAU,OAAO,QAAQ,EAAI,UAAY,CAE9C,MAAM,IAAI,MAAM,mCAAmC,CACpD,EAMDA,EAAO,UAAU,QAAU,UAAY,CAErC,MAAM,IAAI,MAAM,6CAA6C,CAC9D,EAMDA,EAAO,UAAU,QAAU,UAAY,CAErC,MAAM,IAAI,MAAM,6CAA6C,CAC9D,EAUDA,EAAO,UAAU,OAAS,SAAUv1B,EAAS,CAE3C,MAAM,IAAI,MAAM,4CAA4C,CAC7D,EAMDu1B,EAAO,UAAU,SAAW,UAAY,CAEtC,MAAM,IAAI,MAAM,8CAA8C,CAC/D,EACMA,CACT,EAAG,CACD,QAAS,EACX,CAAC,ECvOD,SAASG,GAAsBroB,EAAG0T,EAAMhX,EAAM,CAC5C,IAAI4rB,EAAgBtoB,EAAE,YAClBuoB,EAAO,IAAID,EAAc,CAAC,EAC1BzU,EAAS,GACb,GAAInX,EAAM,CACR,GAAIA,EAAO,EACT,MAAM,IAAI,MAAM,gCAAgC,EAElD,GAAI,CAAC6W,GAAU7W,CAAI,EACjB,MAAM,IAAI,MAAM,yBAAyB,EAE3C,GAAIsD,EAAE,YAAYuoB,EAAK,IAAI7rB,EAAO,CAAC,EAAE,IAAI,CAAC,CAAC,GAAKsD,EAAE,SAASuoB,EAAK,IAAI7rB,EAAO,CAAC,EAAE,IAAI,EAAE,CAAC,EACnF,MAAM,IAAI,MAAM,8BAA8B,OAAOA,EAAO,EAAG,MAAM,EAAE,OAAOA,EAAO,EAAG,KAAK,CAAC,EAEhG,GAAI,CAACsD,EAAE,YACL,MAAM,IAAI,MAAM,0BAA0B,EAExCA,EAAE,SAAS,CAAC,IACdA,EAAIA,EAAE,IAAIuoB,EAAK,IAAI7rB,CAAI,CAAC,GAE1BmX,EAAS,IAAI,OAAOnX,CAAI,CAC5B,CACE,OAAQgX,EAAI,CACV,IAAK,GACH,MAAO,GAAG,OAAO1T,EAAE,SAAQ,CAAE,EAAE,OAAO6T,CAAM,EAC9C,IAAK,GACH,MAAO,GAAG,OAAO7T,EAAE,QAAO,CAAE,EAAE,OAAO6T,CAAM,EAC7C,IAAK,IACH,MAAO,GAAG,OAAO7T,EAAE,cAAa,CAAE,EAAE,OAAO6T,CAAM,EACnD,QACE,MAAM,IAAI,MAAM,QAAQ,OAAOH,EAAM,iBAAiB,CAAC,CAC7D,CACA,CAmFO,SAASK,GAAOrhB,EAAOC,EAAS,CACrC,GAAI,OAAOA,GAAY,WAErB,OAAOA,EAAQD,CAAK,EAItB,GAAI,CAACA,EAAM,WACT,OAAOA,EAAM,MAAK,EAAK,MAAQA,EAAM,GAAG,CAAC,EAAI,WAAa,YAE5D,GAAI,CACF,SAAAshB,EACA,UAAAC,EACA,SAAAC,CACJ,EAAMC,GAAuBxhB,CAAO,EAGlC,OAAQqhB,EAAQ,CACd,IAAK,QACH,OAAOI,GAAQ1hB,EAAOuhB,CAAS,EACjC,IAAK,cACH,OAAOI,GAAc3hB,EAAOuhB,CAAS,EACvC,IAAK,cACH,OAAOK,GAAc5hB,EAAOuhB,CAAS,EACvC,IAAK,MACH,OAAOoU,GAAsB31B,EAAO,EAAGwhB,CAAQ,EACjD,IAAK,MACH,OAAOmU,GAAsB31B,EAAO,EAAGwhB,CAAQ,EACjD,IAAK,MACH,OAAOmU,GAAsB31B,EAAO,GAAIwhB,CAAQ,EAClD,IAAK,OACH,CAGE,IAAIwB,EAAWC,GAAmBhjB,GAAY,KAA6B,OAASA,EAAQ,SAAU,EAAE,EACpGijB,EAAWD,GAAmBhjB,GAAY,KAA6B,OAASA,EAAQ,SAAU,CAAC,EAGvG,GAAID,EAAM,OAAQ,EAAE,MAAO,IAG3B,IAAI6iB,EACAP,EAAUtiB,EAAM,oBAAoBuhB,CAAS,EAC7CqP,EAAMtO,EAAQ,EAClB,OAAIsO,GAAO5N,GAAY4N,EAAM1N,EAE3BL,EAAMP,EAAQ,QAAS,EAGvBO,EAAMlB,GAAc3hB,EAAOuhB,CAAS,EAI/BsB,EAAI,QAAQ,sBAAuB,UAAY,CACpD,IAAIf,EAAS,UAAU,CAAC,EACpB/f,EAAI,UAAU,CAAC,EACnB,OAAO+f,IAAW,IAAMA,EAAS/f,EAAIA,CAC/C,CAAS,CACT,CACI,QACE,MAAM,IAAI,MAAM,qBAAuBuf,EAAW,kEAAuE,CAC/H,CACA,CAOO,SAASM,GAAc5hB,EAAOuhB,EAAW,CAE9C,IAAIxf,EAAI/B,EAAM,EACVwiB,EAASzgB,EAAI,IAAM,EAAIA,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAIA,EAAI,EAG3D+zB,EAAkB91B,EAAM,IAAI,KAAK,IAAI,GAAI,CAACwiB,CAAM,CAAC,EACjDuT,EAAWD,EAAgB,YAAYvU,CAAS,EACpD,GAAIwU,EAAS,SAAS,GAAG,EAAG,CAC1B,IAAIzQ,EAAYtlB,EAAM,YACtB+1B,EAAW,IAAIzQ,EAAUyQ,CAAQ,EAAE,QAAS,CAChD,CACE,OAAOA,EAAW,KAAOh0B,GAAK,EAAI,IAAM,IAAMygB,EAAO,SAAU,CACjE,CAUO,SAASb,GAAc3hB,EAAOuhB,EAAW,CAC9C,OAAIA,IAAc,OACTvhB,EAAM,cAAcuhB,EAAY,CAAC,EAEjCvhB,EAAM,cAAe,CAEhC,CAQO,SAAS0hB,GAAQ1hB,EAAOuhB,EAAW,CACxC,OAAOvhB,EAAM,QAAQuhB,CAAS,CAChC,CACA,SAAS0B,GAAmBjjB,EAAOyjB,EAAc,CAC/C,OAAI/V,GAAS1N,CAAK,EACTA,EACE2N,GAAY3N,CAAK,EACnBA,EAAM,SAAU,EAEhByjB,CAEX,CC7LO,SAASpC,GAAOrhB,EAAOC,EAAS,CACrC,IAAI+1B,EAASC,GAAQj2B,EAAOC,CAAO,EACnC,OAAIA,GAAW,OAAOA,GAAY,UAAY,aAAcA,GAAW+1B,EAAO,OAAS/1B,EAAQ,SACtF+1B,EAAO,UAAU,EAAG/1B,EAAQ,SAAW,CAAC,EAAI,MAE9C+1B,CACT,CACA,SAASC,GAAQj2B,EAAOC,EAAS,CAC/B,GAAI,OAAOD,GAAU,SACnB,OAAOk2B,GAAal2B,EAAOC,CAAO,EAEpC,GAAI0N,GAAY3N,CAAK,EACnB,OAAOm2B,GAAgBn2B,EAAOC,CAAO,EAKvC,GAAIm2B,GAAkBp2B,CAAK,EACzB,MAAI,CAACC,GAAWA,EAAQ,WAAa,UAE5BD,EAAM,EAAIA,EAAM,EAAI,IAAMA,EAAM,EAGhCA,EAAM,SAAU,EAG3B,GAAI,MAAM,QAAQA,CAAK,EACrB,OAAOq2B,GAAYr2B,EAAOC,CAAO,EAEnC,GAAI8N,GAAS/N,CAAK,EAChB,OAAOs2B,GAAUt2B,CAAK,EAExB,GAAI,OAAOA,GAAU,WACnB,OAAOA,EAAM,OAAS,OAAOA,EAAM,MAAM,EAAI,WAE/C,GAAIA,GAAS,OAAOA,GAAU,SAAU,CACtC,GAAI,OAAOA,EAAM,QAAW,WAC1B,OAAOA,EAAM,OAAOC,CAAO,EACtB,GAAID,GAASA,EAAM,SAASC,CAAO,IAAM,GAAG,WAEjD,OAAOD,EAAM,SAASC,CAAO,EAE7B,IAAInC,EAAU,OAAO,KAAKkC,CAAK,EAAE,IAAImE,GAC5BmyB,GAAUnyB,CAAG,EAAI,KAAOkd,GAAOrhB,EAAMmE,CAAG,EAAGlE,CAAO,CAC1D,EACD,MAAO,IAAMnC,EAAQ,KAAK,IAAI,EAAI,GAExC,CACE,OAAO,OAAOkC,CAAK,CACrB,CAQO,SAASs2B,GAAUt2B,EAAO,CAI/B,QAHIu2B,EAAO,OAAOv2B,CAAK,EACnBw2B,EAAU,GACV,EAAI,EACD,EAAID,EAAK,QAAQ,CACtB,IAAIzd,EAAIyd,EAAK,OAAO,CAAC,EACrBC,GAAW1d,KAAK2d,GAAoBA,GAAkB3d,CAAC,EAAIA,EAC3D,GACJ,CACE,MAAO,IAAM0d,EAAU,GACzB,CACA,IAAIC,GAAoB,CACtB,IAAK,MACL,KAAM,OACN,KAAM,MACN,KAAM,MACN,KAAM,MACN,KAAM,MACN,IAAM,KACR,EAuBA,SAASJ,GAAYvQ,EAAO7lB,EAAS,CACnC,GAAI,MAAM,QAAQ6lB,CAAK,EAAG,CAGxB,QAFIjD,EAAM,IACNlS,EAAMmV,EAAM,OACPhlB,EAAI,EAAGA,EAAI6P,EAAK7P,IACnBA,IAAM,IACR+hB,GAAO,MAETA,GAAOwT,GAAYvQ,EAAMhlB,CAAC,EAAGb,CAAO,EAEtC,OAAA4iB,GAAO,IACAA,CACX,KACI,QAAOxB,GAAOyE,EAAO7lB,CAAO,CAEhC,CAOA,SAASm2B,GAAkBp2B,EAAO,CAChC,OAAOA,GAAS,OAAOA,GAAU,UAAY,OAAOA,EAAM,GAAM,UAAY,OAAOA,EAAM,GAAM,UAAY,OAAOA,EAAM,GAAM,UAAY,EAC5I,CCvKO,SAAS02B,GAAeC,EAAQ/f,EAAUggB,EAAU,CACzD,GAAI,EAAE,gBAAgBF,IACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,KAAK,OAASC,EACd,KAAK,SAAW/f,EAChB,KAAK,SAAWggB,EAChB,KAAK,QAAU,wBAA0B,MAAM,QAAQD,CAAM,EAAI,IAAMA,EAAO,KAAK,IAAI,EAAI,IAAMA,GAAU,KAAO,KAAK,UAAY,MAAQ,KAAO,MAAM,QAAQ/f,CAAQ,EAAI,IAAMA,EAAS,KAAK,IAAI,EAAI,IAAMA,GAAY,IAC1N,KAAK,MAAQ,IAAI,MAAK,EAAG,KAC3B,CACA8f,GAAe,UAAY,IAAI,WAC/BA,GAAe,UAAU,YAAc,WACvCA,GAAe,UAAU,KAAO,iBAChCA,GAAe,UAAU,iBAAmB,GCZrC,SAASG,GAAWtyB,EAAO3B,EAAKC,EAAK,CAC1C,GAAI,EAAE,gBAAgBg0B,IACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,KAAK,MAAQtyB,EACT,UAAU,OAAS,GACrB,KAAK,IAAM,EACX,KAAK,IAAM3B,IAEX,KAAK,IAAMA,EACX,KAAK,IAAMC,GAET,KAAK,MAAQ,QAAa,KAAK,MAAQ,KAAK,IAC9C,KAAK,QAAU,uBAAyB,KAAK,MAAQ,MAAQ,KAAK,IAAM,IAC/D,KAAK,MAAQ,QAAa,KAAK,OAAS,KAAK,IACtD,KAAK,QAAU,uBAAyB,KAAK,MAAQ,OAAS,KAAK,IAAM,GAAK,IAE9E,KAAK,QAAU,uBAAyB,KAAK,MAAQ,IAEvD,KAAK,MAAQ,IAAI,MAAK,EAAG,KAC3B,CACAg0B,GAAW,UAAY,IAAI,WAC3BA,GAAW,UAAU,YAAc,WACnCA,GAAW,UAAU,KAAO,aAC5BA,GAAW,UAAU,aAAe,GCnB7B,SAASC,GAAUp2B,EAAG,CAE3B,QADIkU,EAAI,CAAE,EACH,MAAM,QAAQlU,CAAC,GACpBkU,EAAE,KAAKlU,EAAE,MAAM,EACfA,EAAIA,EAAE,CAAC,EAET,OAAOkU,CACT,CAWA,SAASmiB,GAAUjR,EAAO9b,EAAMgtB,EAAK,CACnC,IAAI,EACArmB,EAAMmV,EAAM,OAChB,GAAInV,IAAQ3G,EAAKgtB,CAAG,EAClB,MAAM,IAAIN,GAAe/lB,EAAK3G,EAAKgtB,CAAG,CAAC,EAEzC,GAAIA,EAAMhtB,EAAK,OAAS,EAAG,CAEzB,IAAIitB,EAAUD,EAAM,EACpB,IAAK,EAAI,EAAG,EAAIrmB,EAAK,IAAK,CACxB,IAAIumB,EAAQpR,EAAM,CAAC,EACnB,GAAI,CAAC,MAAM,QAAQoR,CAAK,EACtB,MAAM,IAAIR,GAAe1sB,EAAK,OAAS,EAAGA,EAAK,OAAQ,GAAG,EAE5D+sB,GAAUjR,EAAM,CAAC,EAAG9b,EAAMitB,CAAO,CACvC,CACA,KAEI,KAAK,EAAI,EAAG,EAAItmB,EAAK,IACnB,GAAI,MAAM,QAAQmV,EAAM,CAAC,CAAC,EACxB,MAAM,IAAI4Q,GAAe1sB,EAAK,OAAS,EAAGA,EAAK,OAAQ,GAAG,CAIlE,CASO,SAASmtB,GAASrR,EAAO9b,EAAM,CACpC,IAAIotB,EAAWptB,EAAK,SAAW,EAC/B,GAAIotB,GAEF,GAAI,MAAM,QAAQtR,CAAK,EACrB,MAAM,IAAI4Q,GAAe5Q,EAAM,OAAQ,CAAC,OAI1CiR,GAAUjR,EAAO9b,EAAM,CAAC,CAE5B,CAyBO,SAASqtB,GAAc9yB,EAAOxD,EAAQ,CAC3C,GAAIwD,IAAU,OAAW,CACvB,GAAI,CAACmJ,GAASnJ,CAAK,GAAK,CAACsc,GAAUtc,CAAK,EACtC,MAAM,IAAI,UAAU,oCAAsCA,EAAQ,GAAG,EAEvE,GAAIA,EAAQ,GAAK,OAAOxD,GAAW,UAAYwD,GAASxD,EACtD,MAAM,IAAI81B,GAAWtyB,EAAOxD,CAAM,CAExC,CACA,CAoCO,SAASsF,GAAOyf,EAAO9b,EAAMyZ,EAAc,CAEhD,GAAI,CAAC,MAAM,QAAQzZ,CAAI,EACrB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAK,SAAW,EAClB,MAAM,IAAI,MAAM,qCAAqC,EAIvDA,EAAK,QAAQ,SAAUhK,EAAO,CAC5B,GAAI,CAAC0N,GAAS1N,CAAK,GAAK,CAAC6gB,GAAU7gB,CAAK,GAAKA,EAAQ,EACnD,MAAM,IAAI,UAAU,uDAA8DqhB,GAAOrX,CAAI,EAAI,GAAG,CAE1G,CAAG,GAGG0D,GAASoY,CAAK,GAAKnY,GAAYmY,CAAK,KACtCA,EAAQ,CAACA,CAAK,GAIhB,IAAIwR,EAAgB7T,IAAiB,OAAYA,EAAe,EAChE,OAAA8T,GAAQzR,EAAO9b,EAAM,EAAGstB,CAAa,EAC9BxR,CACT,CAWA,SAASyR,GAAQzR,EAAO9b,EAAMgtB,EAAKvT,EAAc,CAC/C,IAAI3iB,EACA02B,EACAC,EAAS3R,EAAM,OACf4R,EAAS1tB,EAAKgtB,CAAG,EACjBW,EAAS,KAAK,IAAIF,EAAQC,CAAM,EAIpC,GADA5R,EAAM,OAAS4R,EACXV,EAAMhtB,EAAK,OAAS,EAAG,CAEzB,IAAIitB,EAAUD,EAAM,EAGpB,IAAKl2B,EAAI,EAAGA,EAAI62B,EAAQ72B,IAEtB02B,EAAO1R,EAAMhlB,CAAC,EACT,MAAM,QAAQ02B,CAAI,IACrBA,EAAO,CAACA,CAAI,EACZ1R,EAAMhlB,CAAC,EAAI02B,GAEbD,GAAQC,EAAMxtB,EAAMitB,EAASxT,CAAY,EAI3C,IAAK3iB,EAAI62B,EAAQ72B,EAAI42B,EAAQ52B,IAE3B02B,EAAO,CAAE,EACT1R,EAAMhlB,CAAC,EAAI02B,EAGXD,GAAQC,EAAMxtB,EAAMitB,EAASxT,CAAY,CAE/C,KAAS,CAIL,IAAK3iB,EAAI,EAAGA,EAAI62B,EAAQ72B,IACtB,KAAO,MAAM,QAAQglB,EAAMhlB,CAAC,CAAC,GAC3BglB,EAAMhlB,CAAC,EAAIglB,EAAMhlB,CAAC,EAAE,CAAC,EAKzB,IAAKA,EAAI62B,EAAQ72B,EAAI42B,EAAQ52B,IAC3BglB,EAAMhlB,CAAC,EAAI2iB,CAEjB,CACA,CAYO,SAASmU,GAAQ9R,EAAO+R,EAAO,CACpC,IAAIC,EAAYC,GAAQjS,CAAK,EACzBkS,EAAgBF,EAAU,OAC9B,GAAI,CAAC,MAAM,QAAQhS,CAAK,GAAK,CAAC,MAAM,QAAQ+R,CAAK,EAC/C,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,SAAW,EACnB,MAAM,IAAInB,GAAe,EAAGsB,EAAe,IAAI,EAEjDH,EAAQI,GAAqBJ,EAAOG,CAAa,EACjD,IAAIE,EAAYC,GAAQN,CAAK,EAC7B,GAAIG,IAAkBE,EACpB,MAAM,IAAIxB,GAAewB,EAAWF,EAAe,IAAI,EAEzD,GAAI,CACF,OAAOI,GAASN,EAAWD,CAAK,CACjC,OAAQ91B,EAAG,CACV,MAAIA,aAAa20B,GACT,IAAIA,GAAewB,EAAWF,EAAe,IAAI,EAEnDj2B,CACV,CACA,CASO,SAASk2B,GAAqBJ,EAAOG,EAAe,CACzD,IAAIE,EAAYC,GAAQN,CAAK,EACzBQ,EAAiBR,EAAM,MAAO,EAC9BS,EAAW,GACXC,EAAgBV,EAAM,QAAQS,CAAQ,EACtCE,EAAwBX,EAAM,QAAQS,EAAUC,EAAgB,CAAC,GAAK,EAC1E,GAAIC,EACF,MAAM,IAAI,MAAM,iCAAiC,EAEnD,IAAIC,EAAcF,GAAiB,EAC/BG,EAAqBV,EAAgBE,IAAc,EACvD,GAAIO,EACF,GAAIC,EACFL,EAAeE,CAAa,EAAI,CAACP,EAAgBE,MAEjD,OAAM,IAAI,MAAM,qCAAuCF,EAAgB,sBAAwB,CAACE,CAAS,EAG7G,OAAOG,CACT,CAOA,SAASF,GAAQrS,EAAO,CACtB,OAAOA,EAAM,OAAO,CAACnlB,EAAMsxB,IAAStxB,EAAOsxB,EAAM,CAAC,CACpD,CAUA,SAASmG,GAAStS,EAAO+R,EAAO,CAK9B,QAHIc,EAAW7S,EACX8S,EAEKC,EAAYhB,EAAM,OAAS,EAAGgB,EAAY,EAAGA,IAAa,CACjE,IAAI7uB,EAAO6tB,EAAMgB,CAAS,EAC1BD,EAAY,CAAE,EAId,QADI73B,EAAS43B,EAAS,OAAS3uB,EACtBlJ,EAAI,EAAGA,EAAIC,EAAQD,IAC1B83B,EAAU,KAAKD,EAAS,MAAM73B,EAAIkJ,GAAOlJ,EAAI,GAAKkJ,CAAI,CAAC,EAGzD2uB,EAAWC,CACf,CACE,OAAOD,CACT,CAkEO,SAASG,GAAUhT,EAAOiT,EAAMC,EAAOhvB,EAAM,CAClD,IAAI4K,EAAI5K,GAAQ8sB,GAAUhR,CAAK,EAG/B,GAAIkT,EACF,QAASl4B,EAAI,EAAGA,EAAIk4B,EAAOl4B,IACzBglB,EAAQ,CAACA,CAAK,EACdlR,EAAE,QAAQ,CAAC,EAMf,IADAkR,EAAQmT,GAAWnT,EAAOiT,EAAM,CAAC,EAC1BnkB,EAAE,OAASmkB,GAChBnkB,EAAE,KAAK,CAAC,EAEV,OAAOkR,CACT,CAUA,SAASmT,GAAWnT,EAAOiT,EAAM/B,EAAK,CACpC,IAAI,EAAG1c,EACP,GAAI,MAAM,QAAQwL,CAAK,EAAG,CACxB,IAAIoT,EAAOlC,EAAM,EACjB,IAAK,EAAI,EAAG1c,EAAKwL,EAAM,OAAQ,EAAIxL,EAAI,IACrCwL,EAAM,CAAC,EAAImT,GAAWnT,EAAM,CAAC,EAAGiT,EAAMG,CAAI,CAEhD,KACI,SAAS5U,EAAI0S,EAAK1S,EAAIyU,EAAMzU,IAC1BwB,EAAQ,CAACA,CAAK,EAGlB,OAAOA,CACT,CAOO,SAASiS,GAAQjS,EAAO,CAC7B,GAAI,CAAC,MAAM,QAAQA,CAAK,EAEtB,OAAOA,EAET,IAAIqT,EAAO,CAAE,EACb,OAAArT,EAAM,QAAQ,SAAS/f,EAAS/F,EAAO,CACjC,MAAM,QAAQA,CAAK,EACrBA,EAAM,QAAQ+F,CAAQ,EAEtBozB,EAAK,KAAKn5B,CAAK,CAErB,CAAG,EACMm5B,CACT,CAmHO,SAASC,GAAiBtT,EAAO7V,EAAQ,CAI9C,QAHIjL,EACAjE,EAAS,EAEJD,EAAI,EAAGA,EAAIglB,EAAM,OAAQhlB,IAAK,CACrC,IAAIyH,EAAOud,EAAMhlB,CAAC,EACdu4B,EAAW,MAAM,QAAQ9wB,CAAI,EAQjC,GALIzH,IAAM,GAAKu4B,IACbt4B,EAASwH,EAAK,QAIZ8wB,GAAY9wB,EAAK,SAAWxH,EAC9B,OAEF,IAAIu4B,EAAWD,EAAWD,GAAiB7wB,EAAM0H,CAAM,EACrDA,EAAO1H,CAAI,EACb,GAAIvD,IAAS,OACXA,EAAOs0B,UACEt0B,IAASs0B,EAClB,MAAO,OAIb,CACE,OAAOt0B,CACT,CA8BA,SAASu0B,GAAgBhpB,EAAGC,EAAGgpB,EAAWxC,EAAK,CAC7C,GAAIA,EAAMwC,EAAW,CAEnB,GAAIjpB,EAAE,SAAWC,EAAE,OACjB,MAAM,IAAIkmB,GAAenmB,EAAE,OAAQC,EAAE,MAAM,EAG7C,QADIsI,EAAI,CAAE,EACDhY,EAAI,EAAGA,EAAIyP,EAAE,OAAQzP,IAC5BgY,EAAEhY,CAAC,EAAIy4B,GAAgBhpB,EAAEzP,CAAC,EAAG0P,EAAE1P,CAAC,EAAG04B,EAAWxC,EAAM,CAAC,EAEvD,OAAOle,CACX,KAEI,QAAOvI,EAAE,OAAOC,CAAC,CAErB,CAQO,SAASipB,IAAS,CACvB,IAAIC,EAAS,MAAM,UAAU,MAAM,KAAK,UAAW,EAAG,EAAE,EACpDF,EAAY,MAAM,UAAU,MAAM,KAAK,UAAW,EAAE,EACxD,GAAIE,EAAO,SAAW,EACpB,OAAOA,EAAO,CAAC,EAEjB,GAAIA,EAAO,OAAS,EAClB,OAAOA,EAAO,MAAM,CAAC,EAAE,OAAO,SAAUvF,EAAGwF,EAAG,CAC5C,OAAOJ,GAAgBpF,EAAGwF,EAAGH,EAAW,CAAC,CAC/C,EAAOE,EAAO,CAAC,CAAC,EAEZ,MAAM,IAAI,MAAM,8CAA8C,CAElE,CAOO,SAASE,IAAiB,CAC/B,QAASC,EAAO,UAAU,OAAQhC,EAAQ,IAAI,MAAMgC,CAAI,EAAGC,EAAO,EAAGA,EAAOD,EAAMC,IAChFjC,EAAMiC,CAAI,EAAI,UAAUA,CAAI,EAM9B,QAJIC,EAAalC,EAAM,IAAIjjB,GAAKA,EAAE,MAAM,EACpC0f,EAAI,KAAK,IAAI,GAAGyF,CAAU,EAC1BC,EAAU,IAAI,MAAM1F,CAAC,EAAE,KAAK,IAAI,EAE3BxzB,EAAI,EAAGA,EAAI+2B,EAAM,OAAQ/2B,IAGhC,QAFIkJ,EAAO6tB,EAAM/2B,CAAC,EACdk2B,EAAM+C,EAAWj5B,CAAC,EACbknB,EAAI,EAAGA,EAAIgP,EAAKhP,IAAK,CAC5B,IAAI1a,EAAIgnB,EAAI0C,EAAMhP,EACdhe,EAAKge,CAAC,EAAIgS,EAAQ1sB,CAAC,IACrB0sB,EAAQ1sB,CAAC,EAAItD,EAAKge,CAAC,EAE3B,CAEE,QAASiS,EAAK,EAAGA,EAAKpC,EAAM,OAAQoC,IAClCC,GAAuBrC,EAAMoC,CAAE,EAAGD,CAAO,EAE3C,OAAOA,CACT,CAOO,SAASE,GAAuBlwB,EAAMmwB,EAAQ,CAGnD,QAFI7F,EAAI6F,EAAO,OACXnD,EAAMhtB,EAAK,OACNge,EAAI,EAAGA,EAAIgP,EAAKhP,IAAK,CAC5B,IAAI1a,EAAIgnB,EAAI0C,EAAMhP,EAClB,GAAIhe,EAAKge,CAAC,EAAImS,EAAO7sB,CAAC,GAAKtD,EAAKge,CAAC,EAAI,GAAKhe,EAAKge,CAAC,EAAImS,EAAO7sB,CAAC,EAC1D,MAAM,IAAI,MAAM,0DAA0D,OAAOtD,EAAM,wCAAwC,EAAE,OAAOgtB,EAAK,aAAa,EAAE,OAAOhtB,EAAKge,CAAC,EAAG,WAAW,EAAE,OAAOmS,EAAO7sB,CAAC,CAAC,CAAC,CAEhN,CACA,CAQO,SAAS8sB,GAAYtU,EAAOqU,EAAQ,CACzC,IAAIE,EAAQvD,GAAUhR,CAAK,EAC3B,GAAIpV,GAAgB2pB,EAAOF,CAAM,EAC/B,OAAOrU,EAEToU,GAAuBG,EAAOF,CAAM,EACpC,IAAIG,EAAkBV,GAAeS,EAAOF,CAAM,EAC9C7F,EAAIgG,EAAgB,OACpBC,EAAa,CAAC,GAAG,MAAMjG,EAAI+F,EAAM,MAAM,EAAE,KAAK,CAAC,EAAG,GAAGA,CAAK,EAC1DlG,EAAIjkB,GAAM4V,CAAK,EAEfuU,EAAM,OAAS/F,IACjBH,EAAIyD,GAAQzD,EAAGoG,CAAU,EACzBF,EAAQvD,GAAU3C,CAAC,GAIrB,QAAS6C,EAAM,EAAGA,EAAM1C,EAAG0C,IACrBqD,EAAMrD,CAAG,EAAIsD,EAAgBtD,CAAG,IAClC7C,EAAIqG,GAAQrG,EAAGmG,EAAgBtD,CAAG,EAAGA,CAAG,EACxCqD,EAAQvD,GAAU3C,CAAC,GAGvB,OAAOA,CACT,CAmCO,SAASqG,GAAQC,EAAgBC,EAAeC,EAAc,CACnE,OAAOlB,GAAO,GAAG,MAAMiB,CAAa,EAAE,KAAKD,CAAc,EAAGE,CAAY,CAC1E,CAOO,SAASzqB,GAAM4V,EAAO,CAC3B,OAAOzY,GAAS,CAAE,EAAEyY,CAAK,CAC3B,CCxrBO,SAAS8U,GAAiB7nB,EAAI,CACnC,OAAO,OAAO,KAAKA,EAAG,YAAc,CAAE,GAAE,OAAO,SAAUqD,EAAMpD,EAAW,CACxE,IAAI6nB,GAAS7nB,EAAU,MAAM,IAAI,GAAK,IAAI,OAAS,EACnD,OAAO,KAAK,IAAIoD,EAAMykB,CAAK,CAC5B,EAAE,EAAE,CACP,CC1FA,IAAInzB,GAAO,cACPic,GAAe,CAAC,QAAQ,EACjBmX,GAAwCpX,GAAQhc,GAAMic,GAAc0B,GAAQ,CACrF,GAAI,CACF,OAAAmQ,CACJ,EAAMnQ,EAMJ,SAASG,EAAY3mB,EAAM42B,EAAU,CACnC,GAAI,EAAE,gBAAgBjQ,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,GAAIiQ,GAAY,CAAC1nB,GAAS0nB,CAAQ,EAChC,MAAM,IAAI,MAAM,qBAAuBA,CAAQ,EAEjD,GAAIxnB,GAASpP,CAAI,EAEXA,EAAK,OAAS,eAEhB,KAAK,MAAQqR,GAAMrR,EAAK,KAAK,EAC7B,KAAK,MAAQqR,GAAMrR,EAAK,KAAK,EAC7B,KAAK,UAAY42B,GAAY52B,EAAK,YAGlC,KAAK,MAAQA,EAAK,QAAS,EAC3B,KAAK,MAAQA,EAAK,KAAM,EACxB,KAAK,UAAY42B,GAAY52B,EAAK,mBAE3BA,GAAQmP,GAAQnP,EAAK,IAAI,GAAKmP,GAAQnP,EAAK,IAAI,EAExD,KAAK,MAAQA,EAAK,KAClB,KAAK,MAAQA,EAAK,KAElBs4B,GAAS,KAAK,MAAO,KAAK,KAAK,EAC/B,KAAK,UAAY1B,GAAY52B,EAAK,iBACzBmP,GAAQnP,CAAI,EAErB,KAAK,MAAQk8B,EAAWl8B,CAAI,EAE5B,KAAK,MAAQi4B,GAAU,KAAK,KAAK,EAEjCK,GAAS,KAAK,MAAO,KAAK,KAAK,EAE/B,KAAK,UAAY1B,MACZ,IAAI52B,EAET,MAAM,IAAI,UAAU,6BAA+BoR,GAAOpR,CAAI,EAAI,GAAG,EAGrE,KAAK,MAAQ,CAAE,EACf,KAAK,MAAQ,CAAC,CAAC,EACf,KAAK,UAAY42B,EAEvB,CACEjQ,EAAY,UAAY,IAAIgQ,EAK5BhQ,EAAY,UAAU,kBAAoB,SAAU3mB,EAAM42B,EAAU,CAClE,OAAO,IAAIjQ,EAAY3mB,EAAM42B,CAAQ,CACtC,EAKD,OAAO,eAAejQ,EAAa,OAAQ,CACzC,MAAO,aACX,CAAG,EACDA,EAAY,UAAU,YAAcA,EACpCA,EAAY,UAAU,KAAO,cAC7BA,EAAY,UAAU,cAAgB,GAWtCA,EAAY,UAAU,YAAc,UAAY,CAC9C,OAAO4T,GAAiB,KAAK,MAAOnpB,EAAM,CAC3C,EAWDuV,EAAY,UAAU,QAAU,UAAY,CAC1C,MAAO,OACR,EAWDA,EAAY,UAAU,SAAW,UAAY,CAC3C,OAAO,KAAK,SACb,EAQDA,EAAY,UAAU,OAAS,SAAU3mB,EAAM42B,EAAU,CACvD,OAAO,IAAIjQ,EAAY3mB,EAAM42B,CAAQ,CACtC,EAgBDjQ,EAAY,UAAU,OAAS,SAAUjhB,EAAOjF,EAAamkB,EAAc,CACzE,OAAQ,UAAU,OAAM,CACtB,IAAK,GACH,OAAOuX,EAAK,KAAMz2B,CAAK,EAGzB,IAAK,GACL,IAAK,GACH,OAAO02B,EAAK,KAAM12B,EAAOjF,EAAamkB,CAAY,EACpD,QACE,MAAM,IAAI,YAAY,2BAA2B,CACzD,CACG,EAQD+B,EAAY,UAAU,IAAM,SAAUjhB,EAAO,CAC3C,GAAI,CAACyJ,GAAQzJ,CAAK,EAChB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,SAAW,KAAK,MAAM,OAC9B,MAAM,IAAImyB,GAAenyB,EAAM,OAAQ,KAAK,MAAM,MAAM,EAI1D,QAAS7D,EAAI,EAAGA,EAAI6D,EAAM,OAAQ7D,IAChC22B,GAAc9yB,EAAM7D,CAAC,EAAG,KAAK,MAAMA,CAAC,CAAC,EAGvC,QADI7B,EAAO,KAAK,MACPiC,EAAI,EAAGwZ,EAAK/V,EAAM,OAAQzD,EAAIwZ,EAAIxZ,IAAK,CAC9C,IAAIo6B,EAAS32B,EAAMzD,CAAC,EACpBu2B,GAAc6D,EAAQr8B,EAAK,MAAM,EACjCA,EAAOA,EAAKq8B,CAAM,CACxB,CACI,OAAOr8B,CACR,EAYD2mB,EAAY,UAAU,IAAM,SAAUjhB,EAAOvE,EAAOyjB,EAAc,CAChE,GAAI,CAACzV,GAAQzJ,CAAK,EAChB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,OAAS,KAAK,MAAM,OAC5B,MAAM,IAAImyB,GAAenyB,EAAM,OAAQ,KAAK,MAAM,OAAQ,GAAG,EAE/D,IAAIzD,EAAGwZ,EAAI4gB,EAGPlxB,EAAOzF,EAAM,IAAI,SAAUzD,EAAG,CAChC,OAAOA,EAAI,CACjB,CAAK,EACDq6B,EAAK,KAAMnxB,EAAMyZ,CAAY,EAG7B,IAAI5kB,EAAO,KAAK,MAChB,IAAKiC,EAAI,EAAGwZ,EAAK/V,EAAM,OAAS,EAAGzD,EAAIwZ,EAAIxZ,IACzCo6B,EAAS32B,EAAMzD,CAAC,EAChBu2B,GAAc6D,EAAQr8B,EAAK,MAAM,EACjCA,EAAOA,EAAKq8B,CAAM,EAIpB,OAAAA,EAAS32B,EAAMA,EAAM,OAAS,CAAC,EAC/B8yB,GAAc6D,EAAQr8B,EAAK,MAAM,EACjCA,EAAKq8B,CAAM,EAAIl7B,EACR,IACR,EASD,SAASg7B,EAAKhV,EAAQzhB,EAAO,CAC3B,GAAI,CAAC+J,GAAQ/J,CAAK,EAChB,MAAM,IAAI,UAAU,eAAe,EAErC,IAAI6yB,EAAW7yB,EAAM,SAAU,EAC/B,GAAI6yB,EAEF,OAAOpR,EAAO,IAAIzhB,EAAM,IAAG,CAAE,EAG7B,IAAIyF,EAAOzF,EAAM,KAAM,EACvB,GAAIyF,EAAK,SAAWgc,EAAO,MAAM,OAC/B,MAAM,IAAI0Q,GAAe1sB,EAAK,OAAQgc,EAAO,MAAM,MAAM,EAM3D,QAFIpjB,EAAM2B,EAAM,IAAK,EACjB1B,EAAM0B,EAAM,IAAK,EACZzD,EAAI,EAAGwZ,EAAK0L,EAAO,MAAM,OAAQllB,EAAIwZ,EAAIxZ,IAChDu2B,GAAcz0B,EAAI9B,CAAC,EAAGklB,EAAO,MAAMllB,CAAC,CAAC,EACrCu2B,GAAcx0B,EAAI/B,CAAC,EAAGklB,EAAO,MAAMllB,CAAC,CAAC,EAKvC,OAAO,IAAI0kB,EAAY4V,EAAcpV,EAAO,MAAOzhB,EAAOyF,EAAK,OAAQ,CAAC,EAAGgc,EAAO,SAAS,CAEjG,CAaE,SAASoV,EAAcv8B,EAAM0F,EAAOw0B,EAAM/B,EAAK,CAC7C,IAAIthB,EAAOshB,IAAQ+B,EAAO,EACtB3vB,EAAQ7E,EAAM,UAAUyyB,CAAG,EAC/B,OAAIthB,EACKtM,EAAM,IAAI,SAAUtI,EAAG,CAC5B,OAAAu2B,GAAcv2B,EAAGjC,EAAK,MAAM,EACrBA,EAAKiC,CAAC,CACd,GAAE,QAAS,EAELsI,EAAM,IAAI,SAAUtI,EAAG,CAC5Bu2B,GAAcv2B,EAAGjC,EAAK,MAAM,EAC5B,IAAIq4B,EAAQr4B,EAAKiC,CAAC,EAClB,OAAOs6B,EAAclE,EAAO3yB,EAAOw0B,EAAM/B,EAAM,CAAC,CACjD,GAAE,QAAS,CAElB,CAcE,SAASiE,EAAKjV,EAAQzhB,EAAO82B,EAAW5X,EAAc,CACpD,GAAI,CAAClf,GAASA,EAAM,UAAY,GAC9B,MAAM,IAAI,UAAU,eAAe,EAIrC,IAAI+2B,EAAQ/2B,EAAM,KAAM,EACpB6yB,EAAW7yB,EAAM,SAAU,EAG3Bg3B,EAOJ,GANIttB,GAASotB,CAAS,GACpBE,EAAQF,EAAU,KAAM,EACxBA,EAAYA,EAAU,QAAS,GAE/BE,EAAQzE,GAAUuE,CAAS,EAEzBjE,EAAU,CAIZ,GAAImE,EAAM,SAAW,EACnB,MAAM,IAAI,UAAU,iBAAiB,EAEvCvV,EAAO,IAAIzhB,EAAM,IAAG,EAAI82B,EAAW5X,CAAY,CACrD,KAAW,CAIL,GAAI,CAAC/S,GAAgB6qB,EAAOD,CAAK,EAC/B,GAAI,CACEC,EAAM,SAAW,EACnBF,EAAYjB,GAAY,CAACiB,CAAS,EAAGC,CAAK,EAE1CD,EAAYjB,GAAYiB,EAAWC,CAAK,EAE1CC,EAAQzE,GAAUuE,CAAS,CAC5B,OAAQG,EAAS,EAIpB,GAAIF,EAAM,OAAStV,EAAO,MAAM,OAC9B,MAAM,IAAI0Q,GAAe4E,EAAM,OAAQtV,EAAO,MAAM,OAAQ,GAAG,EAEjE,GAAIuV,EAAM,OAASD,EAAM,OAAQ,CAI/B,QAFIx6B,EAAI,EACJk4B,EAAQ,EACLsC,EAAMx6B,CAAC,IAAM,GAAKy6B,EAAMz6B,CAAC,IAAM,GACpCA,IAEF,KAAOw6B,EAAMx6B,CAAC,IAAM,GAClBk4B,IACAl4B,IAIFu6B,EAAYvC,GAAUuC,EAAWC,EAAM,OAAQtC,EAAOuC,CAAK,CACnE,CAGM,GAAI,CAAC7qB,GAAgB4qB,EAAOC,CAAK,EAC/B,MAAM,IAAI7E,GAAe4E,EAAOC,EAAO,GAAG,EAI5C,IAAIvxB,EAAOzF,EAAM,IAAK,EAAC,IAAI,SAAUzD,EAAG,CACtC,OAAOA,EAAI,CACnB,CAAO,EACDq6B,EAAKnV,EAAQhc,EAAMyZ,CAAY,EAG/B,IAAIsV,EAAOuC,EAAM,OACbtE,EAAM,EACVyE,EAAczV,EAAO,MAAOzhB,EAAO82B,EAAWtC,EAAM/B,CAAG,CAC7D,CACI,OAAOhR,CACX,CAYE,SAASyV,EAAc58B,EAAM0F,EAAO82B,EAAWtC,EAAM/B,EAAK,CACxD,IAAIthB,EAAOshB,IAAQ+B,EAAO,EACtB3vB,EAAQ7E,EAAM,UAAUyyB,CAAG,EAC3BthB,EACFtM,EAAM,QAAQ,SAAUsyB,EAAWC,EAAU,CAC3CtE,GAAcqE,CAAS,EACvB78B,EAAK68B,CAAS,EAAIL,EAAUM,EAAS,CAAC,CAAC,CAC/C,CAAO,EAEDvyB,EAAM,QAAQ,SAAUsyB,EAAWC,EAAU,CAC3CtE,GAAcqE,CAAS,EACvBD,EAAc58B,EAAK68B,CAAS,EAAGn3B,EAAO82B,EAAUM,EAAS,CAAC,CAAC,EAAG5C,EAAM/B,EAAM,CAAC,CACnF,CAAO,CAEP,CAeExR,EAAY,UAAU,OAAS,SAAUxb,EAAMyZ,EAAc1S,EAAM,CAEjE,GAAI,CAAC7C,GAAalE,CAAI,EACpB,MAAM,IAAI,UAAU,0BAA0B,EAIhD,IAAI4xB,EAAY5xB,EAAK,QAAO,EAAG,IAAIhK,GAC1B,MAAM,QAAQA,CAAK,GAAKA,EAAM,SAAW,EAAIA,EAAM,CAAC,EAAIA,CAChE,EAGG2oB,EAAI5X,EAAO,KAAK,MAAO,EAAG,KAE9B,OAAOwmB,EAAQ5O,EAAGiT,EAAWnY,CAAY,CAC1C,EACD,SAAS8T,EAAQvR,EAAQhc,EAAMyZ,EAAc,CAE3C,GAAIzZ,EAAK,SAAW,EAAG,CAIrB,QAFIxC,EAAIwe,EAAO,MAERhY,GAAQxG,CAAC,GACdA,EAAIA,EAAE,CAAC,EAET,OAAOA,CACb,CAEI,OAAAwe,EAAO,MAAQhc,EAAK,MAAM,CAAC,EAC3Bgc,EAAO,MAAQ3f,GAAO2f,EAAO,MAAOA,EAAO,MAAOvC,CAAY,EAEvDuC,CACX,CAgBER,EAAY,UAAU,QAAU,SAAUxb,EAAM+G,EAAM,CACpD,IAAI4X,EAAI5X,EAAO,KAAK,MAAO,EAAG,KAC9B4X,EAAE,MAAQiP,GAAQjP,EAAE,MAAO3e,CAAI,EAC/B,IAAIguB,EAAgBrP,EAAE,MAAM,OAAO,CAAC5nB,EAAQiJ,IAASjJ,EAASiJ,CAAI,EAClE,OAAA2e,EAAE,MAAQsP,GAAqBjuB,EAAMguB,CAAa,EAC3CrP,CACR,EAWD,SAASwS,EAAKnV,EAAQhc,EAAMyZ,EAAc,CAOxC,QAJAoY,EAAU7V,EAAO,MAAM,MAAM,CAAC,EAC1B8V,EAAU,GAGPD,EAAQ,OAAS7xB,EAAK,QAC3B6xB,EAAQ,KAAK,CAAC,EACdC,EAAU,GAIZ,QAASh7B,EAAI,EAAGwZ,EAAKtQ,EAAK,OAAQlJ,EAAIwZ,EAAIxZ,IACpCkJ,EAAKlJ,CAAC,EAAI+6B,EAAQ/6B,CAAC,IACrB+6B,EAAQ/6B,CAAC,EAAIkJ,EAAKlJ,CAAC,EACnBg7B,EAAU,IAGVA,GAEFvE,EAAQvR,EAAQ6V,EAASpY,CAAY,CAE3C,CAOE+B,EAAY,UAAU,MAAQ,UAAY,CACxC,IAAImD,EAAI,IAAInD,EAAY,CACtB,KAAMtV,GAAM,KAAK,KAAK,EACtB,KAAMA,GAAM,KAAK,KAAK,EACtB,SAAU,KAAK,SACrB,CAAK,EACD,OAAOyY,CACR,EAODnD,EAAY,UAAU,KAAO,UAAY,CACvC,OAAO,KAAK,MAAM,MAAM,CAAC,CAC1B,EAYDA,EAAY,UAAU,IAAM,SAAUzf,EAAU,CAE9C,IAAIg2B,EAAK,KACL3lB,EAAOwkB,GAAiB70B,CAAQ,EAChCi2B,EAAU,SAASA,EAAQh8B,EAAOuE,EAAO,CAC3C,OAAIyJ,GAAQhO,CAAK,EACRA,EAAM,IAAI,SAAUk3B,EAAOp2B,EAAG,CACnC,OAAOk7B,EAAQ9E,EAAO3yB,EAAM,OAAOzD,CAAC,CAAC,CAC/C,CAAS,EAGGsV,IAAS,EACJrQ,EAAS/F,CAAK,EACZoW,IAAS,EACXrQ,EAAS/F,EAAOuE,CAAK,EAGrBwB,EAAS/F,EAAOuE,EAAOw3B,CAAE,CAGrC,EAIGl9B,EAAOm9B,EAAQ,KAAK,MAAO,EAAE,EAC7BvG,EAAW,KAAK,YAAc,OAAY2D,GAAiBv6B,EAAMoR,EAAM,EAAI,OAC/E,OAAO,IAAIuV,EAAY3mB,EAAM42B,CAAQ,CACtC,EASDjQ,EAAY,UAAU,QAAU,SAAUzf,EAAU,CAElD,IAAIg2B,EAAK,KACLC,EAAU,SAASA,EAAQh8B,EAAOuE,EAAO,CACvCyJ,GAAQhO,CAAK,EACfA,EAAM,QAAQ,SAAUk3B,EAAOp2B,EAAG,CAChCk7B,EAAQ9E,EAAO3yB,EAAM,OAAOzD,CAAC,CAAC,CACxC,CAAS,EAEDiF,EAAS/F,EAAOuE,EAAOw3B,CAAE,CAE5B,EACDC,EAAQ,KAAK,MAAO,EAAE,CACvB,EAMDxW,EAAY,UAAU,OAAO,QAAQ,EAAI,WAAa,CACpD,IAAIwW,EAAU,SAAUA,EAAQh8B,EAAOuE,EAAO,CAC5C,GAAIyJ,GAAQhO,CAAK,EACf,QAASc,EAAI,EAAGA,EAAId,EAAM,OAAQc,IAChC,MAAAm7B,GAAOD,EAAQh8B,EAAMc,CAAC,EAAGyD,EAAM,OAAOzD,CAAC,CAAC,QAG1C,KAAM,CACJ,MAAAd,EACA,MAAAuE,CACD,CAEJ,EACD,MAAA03B,GAAOD,EAAQ,KAAK,MAAO,EAAE,EAC9B,EAMDxW,EAAY,UAAU,KAAO,UAAY,CACvC,IAAIwQ,EAAS,CAAE,EACX,EAAI,KAAK,KAAM,EACnB,GAAI,EAAE,SAAW,EACf,MAAM,IAAI,UAAU,4CAA4C,EAElE,IAAIn3B,EAAO,KAAK,MAChB,QAASq9B,KAAOr9B,EACdm3B,EAAO,KAAK,IAAIxQ,EAAY,CAAC0W,CAAG,EAAG,KAAK,SAAS,CAAC,EAEpD,OAAOlG,CACR,EAMDxQ,EAAY,UAAU,QAAU,UAAY,CAC1C,IAAI2W,EAAQ,KACRnG,EAAS,CAAE,EACXphB,EAAI,KAAK,KAAM,EACnB,GAAIA,EAAE,SAAW,EACf,MAAM,IAAI,UAAU,4CAA4C,EAOlE,QALI/V,EAAO,KAAK,MACZu9B,EAAQ,SAAet7B,EAAG,CAC5B,IAAIu7B,EAAMx9B,EAAK,IAAIq9B,GAAO,CAACA,EAAIp7B,CAAC,CAAC,CAAC,EAClCk1B,EAAO,KAAK,IAAIxQ,EAAY6W,EAAKF,EAAM,SAAS,CAAC,CAClD,EACQr7B,EAAI,EAAGA,EAAI8T,EAAE,CAAC,EAAG9T,IACxBs7B,EAAMt7B,CAAC,EAET,OAAOk1B,CACR,EAODxQ,EAAY,UAAU,QAAU,UAAY,CAC1C,OAAOtV,GAAM,KAAK,KAAK,CACxB,EAODsV,EAAY,UAAU,QAAU,UAAY,CAC1C,OAAO,KAAK,KACb,EAWDA,EAAY,UAAU,OAAS,SAAUvlB,EAAS,CAChD,OAAOohB,GAAO,KAAK,MAAOphB,CAAO,CAClC,EAODulB,EAAY,UAAU,SAAW,UAAY,CAC3C,OAAOnE,GAAO,KAAK,KAAK,CACzB,EAODmE,EAAY,UAAU,OAAS,UAAY,CACzC,MAAO,CACL,OAAQ,cACR,KAAM,KAAK,MACX,KAAM,KAAK,MACX,SAAU,KAAK,SAChB,CACF,EAUDA,EAAY,UAAU,SAAW,SAAUsC,EAAG,CAE5C,GAAIA,GAMF,GAJIna,GAAYma,CAAC,IACfA,EAAIA,EAAE,SAAU,GAGd,CAACpa,GAASoa,CAAC,GAAK,CAACjH,GAAUiH,CAAC,EAC9B,MAAM,IAAI,UAAU,2CAA2C,OAIjEA,EAAI,EAgBN,QAdIwU,EAASxU,EAAI,EAAIA,EAAI,EACrByU,EAAOzU,EAAI,EAAI,CAACA,EAAI,EAGpB0U,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAGtBnvB,EAAI,KAAK,IAAIkvB,EAAOD,EAAME,EAAUH,CAAM,EAG1Cz9B,EAAO,CAAE,EAGJiC,EAAI,EAAGA,EAAIwM,EAAGxM,IACrBjC,EAAKiC,CAAC,EAAI,KAAK,MAAMA,EAAIy7B,CAAI,EAAEz7B,EAAIw7B,CAAM,EAI3C,OAAO,IAAI9W,EAAY,CACrB,KAAA3mB,EACA,KAAM,CAACyO,CAAC,EACR,SAAU,KAAK,SACrB,CAAK,CACF,EAcDkY,EAAY,SAAW,SAAUxb,EAAMhK,EAAO8nB,EAAGrE,EAAc,CAC7D,GAAI,CAACzV,GAAQhE,CAAI,EACf,MAAM,IAAI,UAAU,gCAAgC,EAEtD,GAAIA,EAAK,SAAW,EAClB,MAAM,IAAI,MAAM,0CAA0C,EAkB5D,GAdAA,EAAOA,EAAK,IAAI,SAAU4K,EAAG,CAO3B,GALIjH,GAAYiH,CAAC,IAEfA,EAAIA,EAAE,SAAU,GAGd,CAAClH,GAASkH,CAAC,GAAK,CAACiM,GAAUjM,CAAC,GAAKA,EAAI,EACvC,MAAM,IAAI,MAAM,uCAAuC,EAEzD,OAAOA,CACb,CAAK,EAGGkT,GAMF,GAJIna,GAAYma,CAAC,IACfA,EAAIA,EAAE,SAAU,GAGd,CAACpa,GAASoa,CAAC,GAAK,CAACjH,GAAUiH,CAAC,EAC9B,MAAM,IAAI,UAAU,2CAA2C,OAIjEA,EAAI,EAEN,IAAIwU,EAASxU,EAAI,EAAIA,EAAI,EACrByU,EAAOzU,EAAI,EAAI,CAACA,EAAI,EAGpB0U,EAAOxyB,EAAK,CAAC,EACbyyB,EAAUzyB,EAAK,CAAC,EAGhBsD,EAAI,KAAK,IAAIkvB,EAAOD,EAAME,EAAUH,CAAM,EAG1CI,EAGJ,GAAI1uB,GAAQhO,CAAK,EAAG,CAElB,GAAIA,EAAM,SAAWsN,EAEnB,MAAM,IAAI,MAAM,4BAA4B,EAG9CovB,EAAS,SAAgB57B,EAAG,CAE1B,OAAOd,EAAMc,CAAC,CACf,CACP,SAAemN,GAASjO,CAAK,EAAG,CAE1B,IAAI28B,EAAK38B,EAAM,KAAM,EAErB,GAAI28B,EAAG,SAAW,GAAKA,EAAG,CAAC,IAAMrvB,EAE/B,MAAM,IAAI,MAAM,uBAAuB,EAGzCovB,EAAS,SAAgB57B,EAAG,CAE1B,OAAOd,EAAM,IAAI,CAACc,CAAC,CAAC,CACrB,CACP,MAEM47B,EAAS,UAAkB,CAEzB,OAAO18B,CACR,EAIEyjB,IAEHA,EAAe9V,GAAY+uB,EAAO,CAAC,CAAC,EAAIA,EAAO,CAAC,EAAE,IAAI,CAAC,EACrD,GAIJ,IAAI79B,EAAO,CAAE,EAGb,GAAImL,EAAK,OAAS,EAAG,CAEnBnL,EAAOwH,GAAOxH,EAAMmL,EAAMyZ,CAAY,EAEtC,QAASa,EAAI,EAAGA,EAAIhX,EAAGgX,IACrBzlB,EAAKylB,EAAIiY,CAAI,EAAEjY,EAAIgY,CAAM,EAAII,EAAOpY,CAAC,CAE7C,CAGI,OAAO,IAAIkB,EAAY,CACrB,KAAA3mB,EACA,KAAM,CAAC29B,EAAMC,CAAO,CAC1B,CAAK,CACF,EAUDjX,EAAY,SAAW,SAAUwM,EAAM,CACrC,OAAO,IAAIxM,EAAYwM,CAAI,CAC5B,EAWDxM,EAAY,UAAU,SAAW,SAAU1kB,EAAGknB,EAAG,CAE/C,GAAI,CAACta,GAAS5M,CAAC,GAAK,CAAC+f,GAAU/f,CAAC,GAAK,CAAC4M,GAASsa,CAAC,GAAK,CAACnH,GAAUmH,CAAC,EAC/D,MAAM,IAAI,MAAM,qCAAqC,EAGvD,GAAI,KAAK,MAAM,SAAW,EACxB,MAAM,IAAI,MAAM,0CAA0C,EAG5D,OAAAqP,GAAcv2B,EAAG,KAAK,MAAM,CAAC,CAAC,EAC9Bu2B,GAAcrP,EAAG,KAAK,MAAM,CAAC,CAAC,EAG9BxC,EAAY,UAAU1kB,EAAGknB,EAAG,KAAK,KAAK,EAE/B,IACR,EASDxC,EAAY,UAAY,SAAU1kB,EAAGknB,EAAGnpB,EAAM,CAE5C,IAAI+9B,EAAK/9B,EAAKiC,CAAC,EACfjC,EAAKiC,CAAC,EAAIjC,EAAKmpB,CAAC,EAChBnpB,EAAKmpB,CAAC,EAAI4U,CACX,EASD,SAAS7B,EAAWl8B,EAAM,CACxB,OAAIoP,GAASpP,CAAI,EACRk8B,EAAWl8B,EAAK,SAAS,EAE9BmP,GAAQnP,CAAI,EACPA,EAAK,IAAIk8B,CAAU,EAErBl8B,CACX,CACE,OAAO2mB,CACT,EAAG,CACD,QAAS,EACX,CAAC,ECn4BM,SAASqX,GAAQ/W,EAAO/f,EAAU2vB,EAAW,CAClD,OAAI5P,GAAS,OAAOA,EAAM,KAAQ,WAEzBA,EAAM,IAAI,SAAUplB,EAAG,CAC5B,OAAOm8B,GAAQn8B,EAAGqF,CAAmB,CAC3C,CAAK,EAEMA,EAAS+f,CAAK,CAEzB,CC3DA,IAAIpe,GAAO,YACPic,GAAe,CAAC,OAAO,EAChBmZ,GAAiCpZ,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC9E,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EA8BJ,OAAOvT,EAAMpK,GAAM,CACjB,OAAQq1B,GAGR,UAAW,SAAmBr8B,EAAG,CAC/B,OAAOA,EAAE,MAAO,CACjB,EACD,SAAU,SAAkBA,EAAG,CAC7B,OAAOA,EAAE,IAAM,GAAK,SAASA,EAAE,CAAC,CACjC,EACD,iBAAkBoR,EAAM,YAAY/R,GAAQW,GAAKm8B,GAAQn8B,EAAGX,CAAI,CAAC,CACrE,CAAG,CACH,CAAC,ECjDG8rB,GAAK,SACLmR,GAAK,iBACF,SAASC,GAAU1sB,EAAG,CAC3B,OAAO,KAAK,IAAIA,CAAC,CACnB,CACA0sB,GAAU,UAAYpR,GACf,SAASqR,GAAU3sB,EAAGC,EAAG,CAC9B,OAAOD,EAAIC,CACb,CACA0sB,GAAU,UAAYF,GACf,SAASG,GAAe5sB,EAAGC,EAAG,CACnC,OAAOD,EAAIC,CACb,CACA2sB,GAAe,UAAYH,GACpB,SAASI,GAAe7sB,EAAGC,EAAG,CACnC,OAAOD,EAAIC,CACb,CACA4sB,GAAe,UAAYJ,GAKpB,SAASK,GAAiB38B,EAAG,CAClC,MAAO,CAACA,CACV,CACA28B,GAAiB,UAAYxR,GAuLtB,SAASyR,GAAW58B,EAAG,CAC5B,OAAOogB,GAAKpgB,CAAC,CACf,CACA48B,GAAW,UAAYzR,GAyDhB,SAAS0R,GAAU78B,EAAG2iB,EAAG,CAG9B,OAAI3iB,EAAIA,EAAI,GAAK2iB,IAAM,KAAY3iB,EAAIA,EAAI,GAAK2iB,IAAM,KAC7C,EAEF,KAAK,IAAI3iB,EAAG2iB,CAAC,CACtB,CACAka,GAAU,UAAYP,GCpRtB,IAAInR,GAAK,SASF,SAAS2R,GAAiB98B,EAAG,CAClC,OAAOA,EAAI,CACb,CACA88B,GAAiB,UAAY3R,GACtB,SAAS4R,GAAa/8B,EAAG,CAC9B,OAAOA,IAAM,CACf,CACA+8B,GAAa,UAAY5R,GCdzB,IAAInkB,GAAO,aACPic,GAAe,CAAC,OAAO,EAChB+Z,GAAkCha,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC/E,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EAgCJ,OAAOvT,EAAMpK,GAAM,CACjB,OAAQ81B,GACR,UAAW,SAAmB98B,EAAG,CAC/B,MAAO,CAACA,EAAE,SAAW,CAACA,EAAE,OAAQ,GAAI,CAACA,EAAE,MAAO,CAC/C,EACD,SAAU,SAAkBA,EAAG,CAC7B,OAAOA,EAAE,EAAI,GAAKA,EAAE,EAAI,CACzB,EACD,KAAMoR,EAAM,YAAY/R,GAAQW,GAAKoR,EAAM,KAAK/R,EAAMW,EAAE,UAAS,CAAE,EAAEA,EAAE,KAAK,CAAC,EAC7E,iBAAkBoR,EAAM,YAAY/R,GAAQW,GAAKm8B,GAAQn8B,EAAGX,CAAI,CAAC,CACrE,CAAG,CACH,CAAC,EChDG2H,GAAO,SACPic,GAAe,CAAC,OAAO,EAChBga,GAA8Bja,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC3E,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EAkCJ,OAAOvT,EAAMpK,GAAM,CACjB,OAAQ+1B,GACR,UAAW,SAAmB/8B,EAAG,CAC/B,OAAOA,EAAE,OAAQ,CAClB,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,KAAO,GAAKA,EAAE,KAAO,CAC/B,EACD,SAAU,SAAkBA,EAAG,CAC7B,OAAOA,EAAE,IAAM,GAAKA,EAAE,IAAM,CAC7B,EACD,KAAMoR,EAAM,YAAY/R,GAAQW,GAAKoR,EAAM,KAAK/R,EAAMW,EAAE,UAAS,CAAE,EAAEA,EAAE,KAAK,CAAC,EAC7E,iBAAkBoR,EAAM,YAAY/R,GAAQW,GAAKm8B,GAAQn8B,EAAGX,CAAI,CAAC,CACrE,CAAG,CACH,CAAC,EC/CM,SAASqjB,GAAY1iB,EAAG2iB,EAAGC,EAAS,CAEzC,GAAIA,GAAY,KACd,OAAO5iB,EAAE,GAAG2iB,CAAC,EAIf,GAAI3iB,EAAE,GAAG2iB,CAAC,EACR,MAAO,GAIT,GAAI3iB,EAAE,MAAK,GAAM2iB,EAAE,MAAK,EACtB,MAAO,GAIT,GAAI3iB,EAAE,SAAQ,GAAM2iB,EAAE,SAAQ,EAAI,CAEhC,IAAIE,EAAO7iB,EAAE,MAAM2iB,CAAC,EAAE,IAAK,EAC3B,GAAIE,EAAK,SACP,MAAO,GAGP,IAAI1gB,EAAMnC,EAAE,YAAY,IAAIA,EAAE,IAAK,EAAE2iB,EAAE,KAAK,EAC5C,OAAOE,EAAK,IAAI1gB,EAAI,MAAMygB,CAAO,CAAC,CAExC,CAGE,MAAO,EACT,CC9BO,SAASsa,GAAcl9B,EAAG2iB,EAAGC,EAAS,CAC3C,OAAOF,GAAY1iB,EAAE,GAAI2iB,EAAE,GAAIC,CAAO,GAAKF,GAAY1iB,EAAE,GAAI2iB,EAAE,GAAIC,CAAO,CAC5E,CCXO,IAAIua,GAAoCna,GAAQ,eAAgB,CAAC,OAAO,EAAG2B,GAAQ,CACxF,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EACJ,MAAO,CACL,aAAcvT,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IAAM,CAChD,GAAI,CAAC3iB,EAAE,UAAU2iB,CAAC,EAChB,MAAM,IAAI,MAAM,0CAA0C,EAE5D,OAAOvR,EAAM,KAAK/R,EAAM,CAACW,EAAE,UAAW,EAAE2iB,EAAE,UAAS,CAAE,CAAC,EAAE3iB,EAAE,MAAO2iB,EAAE,KAAK,CACzE,EACF,CACH,CAAC,ECRG3b,GAAO,cACPic,GAAe,CAAC,QAAS,QAAQ,EAC1Bma,GAAmCpa,GAAQhc,GAAMic,GAAc0B,GAAQ,CAChF,GAAI,CACF,MAAAvT,EACA,OAAAZ,CACJ,EAAMmU,EACA0Y,EAAeF,GAAmB,CACpC,MAAA/rB,CACJ,CAAG,EAUD,OAAOA,EAAMpK,GAAM,CACjB,mBAAoB,SAAwBhH,EAAG2iB,EAAG,CAChD,OAAO3iB,IAAM2iB,CACd,EACD,iBAAkB,SAAsB3iB,EAAG2iB,EAAG,CAC5C,OAAOD,GAAY1iB,EAAG2iB,EAAGnS,EAAO,OAAO,CACxC,EACD,uBAAwB,SAA4BxQ,EAAG2iB,EAAG,CACxD,OAAO3iB,EAAE,GAAG2iB,CAAC,GAAK2a,GAAet9B,EAAG2iB,EAAGnS,EAAO,OAAO,CACtD,EACD,qBAAsB,SAA0BxQ,EAAG2iB,EAAG,CACpD,OAAO3iB,EAAE,OAAO2iB,CAAC,CAClB,EACD,mBAAoB,SAAwB3iB,EAAG2iB,EAAG,CAChD,OAAOua,GAAcl9B,EAAG2iB,EAAGnS,EAAO,OAAO,CAC/C,CACG,EAAE6sB,CAAY,CACjB,CAAC,EACoCra,GAAQhc,GAAM,CAAC,QAAS,QAAQ,EAAGu2B,GAAS,CAC/E,GAAI,CACF,MAAAnsB,EACA,OAAAZ,CACJ,EAAM+sB,EACJ,OAAOnsB,EAAMpK,GAAM,CACjB,iBAAkB,SAAsBhH,EAAG2iB,EAAG,CAC5C,OAAOD,GAAY1iB,EAAG2iB,EAAGnS,EAAO,OAAO,CAC7C,CACA,CAAG,CACH,CAAC,EC5CD,IAAIxJ,GAAO,eACPic,GAAe,CAAC,QAAS,cAAe,QAAQ,EACzCua,GAAyCxa,GAAQhc,GAAMic,GAAc0B,GAAQ,CACtF,GAAI,CACF,MAAAvT,EACA,YAAAqsB,EACA,OAAA3I,CACJ,EAAMnQ,EAOJ,SAAS+Y,EAAav/B,EAAM42B,EAAU,CACpC,GAAI,EAAE,gBAAgB2I,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,GAAI3I,GAAY,CAAC1nB,GAAS0nB,CAAQ,EAChC,MAAM,IAAI,MAAM,qBAAuBA,CAAQ,EAEjD,GAAIxnB,GAASpP,CAAI,EAEfw/B,EAAkB,KAAMx/B,EAAM42B,CAAQ,UAC7B52B,GAAQmP,GAAQnP,EAAK,KAAK,GAAKmP,GAAQnP,EAAK,GAAG,GAAKmP,GAAQnP,EAAK,IAAI,EAE9E,KAAK,QAAUA,EAAK,OACpB,KAAK,OAASA,EAAK,MACnB,KAAK,KAAOA,EAAK,IACjB,KAAK,MAAQA,EAAK,KAClB,KAAK,UAAY42B,GAAY52B,EAAK,iBACzBmP,GAAQnP,CAAI,EAErBy/B,EAAiB,KAAMz/B,EAAM42B,CAAQ,MAChC,IAAI52B,EAET,MAAM,IAAI,UAAU,6BAA+BoR,GAAOpR,CAAI,EAAI,GAAG,EAGrE,KAAK,QAAU,CAAE,EACjB,KAAK,OAAS,CAAE,EAChB,KAAK,KAAO,CAAC,CAAC,EACd,KAAK,MAAQ,CAAC,EAAG,CAAC,EAClB,KAAK,UAAY42B,EAEvB,CACE,SAAS4I,EAAkBrY,EAAQpG,EAAQ6V,EAAU,CAE/C7V,EAAO,OAAS,gBAElBoG,EAAO,QAAUpG,EAAO,QAAU1P,GAAM0P,EAAO,OAAO,EAAI,OAC1DoG,EAAO,OAAS9V,GAAM0P,EAAO,MAAM,EACnCoG,EAAO,KAAO9V,GAAM0P,EAAO,IAAI,EAC/BoG,EAAO,MAAQ9V,GAAM0P,EAAO,KAAK,EACjCoG,EAAO,UAAYyP,GAAY7V,EAAO,WAGtC0e,EAAiBtY,EAAQpG,EAAO,QAAS,EAAE6V,GAAY7V,EAAO,SAAS,CAE7E,CACE,SAAS0e,EAAiBtY,EAAQnnB,EAAM42B,EAAU,CAEhDzP,EAAO,QAAU,CAAE,EACnBA,EAAO,OAAS,CAAE,EAClBA,EAAO,KAAO,CAAE,EAChBA,EAAO,UAAYyP,EAEnB,IAAI+G,EAAO39B,EAAK,OACZ49B,EAAU,EAGV8B,EAAKJ,EAELK,EAAO,EASX,GARIzwB,GAAS0nB,CAAQ,IAEnB8I,EAAKzsB,EAAM,KAAKqsB,EAAa,CAAC1I,EAAUA,CAAQ,CAAC,GAAK0I,EAEtDK,EAAO1sB,EAAM,QAAQ,EAAG2jB,CAAQ,GAI9B+G,EAAO,EAAG,CAEZ,IAAIxU,EAAI,EACR,EAAG,CAEDhC,EAAO,KAAK,KAAKA,EAAO,OAAO,MAAM,EAErC,QAASllB,EAAI,EAAGA,EAAI07B,EAAM17B,IAAK,CAE7B,IAAIo7B,EAAMr9B,EAAKiC,CAAC,EAEhB,GAAIkN,GAAQkuB,CAAG,GAMb,GAJIlU,IAAM,GAAKyU,EAAUP,EAAI,SAC3BO,EAAUP,EAAI,QAGZlU,EAAIkU,EAAI,OAAQ,CAElB,IAAI10B,EAAI00B,EAAIlU,CAAC,EAERuW,EAAG/2B,EAAGg3B,CAAI,IAEbxY,EAAO,QAAQ,KAAKxe,CAAC,EAErBwe,EAAO,OAAO,KAAKllB,CAAC,EAEpC,OAGgBknB,IAAM,GAAKyU,EAAU,IACvBA,EAAU,GAGP8B,EAAGrC,EAAKsC,CAAI,IAEfxY,EAAO,QAAQ,KAAKkW,CAAG,EAEvBlW,EAAO,OAAO,KAAKllB,CAAC,EAGlC,CAEQknB,GACD,OAAQA,EAAIyU,EACnB,CAEIzW,EAAO,KAAK,KAAKA,EAAO,OAAO,MAAM,EAErCA,EAAO,MAAQ,CAACwW,EAAMC,CAAO,CACjC,CACE2B,EAAa,UAAY,IAAI5I,EAK7B4I,EAAa,UAAU,mBAAqB,SAAUv/B,EAAM42B,EAAU,CACpE,OAAO,IAAI2I,EAAav/B,EAAM42B,CAAQ,CACvC,EAKD,OAAO,eAAe2I,EAAc,OAAQ,CAC1C,MAAO,cACX,CAAG,EACDA,EAAa,UAAU,YAAcA,EACrCA,EAAa,UAAU,KAAO,eAC9BA,EAAa,UAAU,eAAiB,GAWxCA,EAAa,UAAU,YAAc,UAAY,CAC/C,OAAOhF,GAAiB,KAAK,QAASnpB,EAAM,CAC7C,EAWDmuB,EAAa,UAAU,QAAU,UAAY,CAC3C,MAAO,QACR,EAWDA,EAAa,UAAU,SAAW,UAAY,CAC5C,OAAO,KAAK,SACb,EAQDA,EAAa,UAAU,OAAS,SAAUv/B,EAAM42B,EAAU,CACxD,OAAO,IAAI2I,EAAav/B,EAAM42B,CAAQ,CACvC,EAWD2I,EAAa,UAAU,QAAU,UAAY,CAE3C,IAAI5B,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAE1B,OAAOD,IAAS,GAAKC,IAAY,EAAI,KAAK,OAAO,QAAUD,EAAOC,GAAW,CAC9E,EAgBD2B,EAAa,UAAU,OAAS,SAAU75B,EAAOjF,EAAamkB,EAAc,CAE1E,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,+CAA+C,EAIjE,OAAQ,UAAU,OAAM,CACtB,IAAK,GACH,OAAOgb,EAAW,KAAMl6B,CAAK,EAG/B,IAAK,GACL,IAAK,GACH,OAAOm6B,EAAW,KAAMn6B,EAAOjF,EAAamkB,CAAY,EAC1D,QACE,MAAM,IAAI,YAAY,2BAA2B,CACzD,CACG,EACD,SAASgb,EAAWzY,EAAQ2Y,EAAK,CAE/B,GAAI,CAACrwB,GAAQqwB,CAAG,EACd,MAAM,IAAI,UAAU,eAAe,EAErC,IAAIvH,EAAWuH,EAAI,SAAU,EAC7B,GAAIvH,EAEF,OAAOpR,EAAO,IAAI2Y,EAAI,IAAG,CAAE,EAG7B,IAAI30B,EAAO20B,EAAI,KAAM,EACrB,GAAI30B,EAAK,SAAWgc,EAAO,MAAM,OAC/B,MAAM,IAAI0Q,GAAe1sB,EAAK,OAAQgc,EAAO,MAAM,MAAM,EAI3D,IAAIllB,EAAGwZ,EAAIwN,EAAG8W,EAGVh8B,EAAM+7B,EAAI,IAAK,EACf97B,EAAM87B,EAAI,IAAK,EACnB,IAAK79B,EAAI,EAAGwZ,EAAK0L,EAAO,MAAM,OAAQllB,EAAIwZ,EAAIxZ,IAC5Cu2B,GAAcz0B,EAAI9B,CAAC,EAAGklB,EAAO,MAAMllB,CAAC,CAAC,EACrCu2B,GAAcx0B,EAAI/B,CAAC,EAAGklB,EAAO,MAAMllB,CAAC,CAAC,EAIvC,IAAI+9B,EAAU7Y,EAAO,QACjB8Y,EAAS9Y,EAAO,OAChB+Y,EAAO/Y,EAAO,KAGdwW,EAAOmC,EAAI,UAAU,CAAC,EACtBlC,EAAUkC,EAAI,UAAU,CAAC,EAGzBzV,EAAI,CAAE,EACN8V,EAAK,CAAE,EAGXxC,EAAK,QAAQ,SAAU17B,EAAG0M,GAAG,CAE3BwxB,EAAGl+B,CAAC,EAAI0M,GAAE,CAAC,EAEX0b,EAAEpoB,CAAC,EAAI,EACb,CAAK,EAGD,IAAIm+B,EAASJ,EAAU,GAAK,OACxBt6B,EAAQ,CAAE,EACV26B,EAAM,CAAE,EAGZ,OAAAzC,EAAQ,QAAQ,SAAUzU,EAAG,CAI3B,IAFAkX,EAAI,KAAK36B,EAAM,MAAM,EAEhBujB,EAAIiX,EAAK/W,CAAC,EAAG4W,EAAKG,EAAK/W,EAAI,CAAC,EAAGF,EAAI8W,EAAI9W,IAE1ChnB,EAAIg+B,EAAOhX,CAAC,EAERoB,EAAEpoB,CAAC,IAAM,KAEXyD,EAAM,KAAKy6B,EAAGl+B,CAAC,CAAC,EAEZm+B,GACFA,EAAO,KAAKJ,EAAQ/W,CAAC,CAAC,EAIlC,CAAK,EAEDoX,EAAI,KAAK36B,EAAM,MAAM,EAGd,IAAI65B,EAAa,CACtB,OAAAa,EACA,MAAA16B,EACA,IAAA26B,EACA,KAAAl1B,EACA,SAAUgc,EAAO,SACvB,CAAK,CACL,CACE,SAAS0Y,EAAW1Y,EAAQzhB,EAAO82B,EAAW5X,EAAc,CAE1D,GAAI,CAAClf,GAASA,EAAM,UAAY,GAC9B,MAAM,IAAI,UAAU,eAAe,EAIrC,IAAI+2B,EAAQ/2B,EAAM,KAAM,EACpB6yB,EAAW7yB,EAAM,SAAU,EAG3Bg3B,EAYJ,GAXIttB,GAASotB,CAAS,GAEpBE,EAAQF,EAAU,KAAM,EAExBA,EAAYA,EAAU,QAAS,GAG/BE,EAAQzE,GAAUuE,CAAS,EAIzBjE,EAAU,CAEZ,GAAImE,EAAM,SAAW,EACnB,MAAM,IAAI,UAAU,iBAAiB,EAGvCvV,EAAO,IAAIzhB,EAAM,IAAG,EAAI82B,EAAW5X,CAAY,CACrD,KAAW,CAEL,GAAI6X,EAAM,SAAW,GAAKA,EAAM,SAAW,EACzC,MAAM,IAAI5E,GAAe4E,EAAM,OAAQtV,EAAO,MAAM,OAAQ,GAAG,EAIjE,GAAIuV,EAAM,OAASD,EAAM,OAAQ,CAI/B,QAFIx6B,EAAI,EACJk4B,EAAQ,EACLsC,EAAMx6B,CAAC,IAAM,GAAKy6B,EAAMz6B,CAAC,IAAM,GACpCA,IAEF,KAAOw6B,EAAMx6B,CAAC,IAAM,GAClBk4B,IACAl4B,IAGFu6B,EAAYvC,GAAUuC,EAAWC,EAAM,OAAQtC,EAAOuC,CAAK,CACnE,CAGM,GAAI,CAAC7qB,GAAgB4qB,EAAOC,CAAK,EAC/B,MAAM,IAAI7E,GAAe4E,EAAOC,EAAO,GAAG,EAI5C,GAAID,EAAM,SAAW,EAAG,CAEtB,IAAIlyB,EAAQ7E,EAAM,UAAU,CAAC,EAC7B6E,EAAM,QAAQ,SAAUsyB,EAAWC,EAAU,CAC3CtE,GAAcqE,CAAS,EACvB1V,EAAO,IAAI,CAAC0V,EAAW,CAAC,EAAGL,EAAUM,EAAS,CAAC,CAAC,EAAGlY,CAAY,CACzE,CAAS,CACT,KAAa,CAEL,IAAI0b,EAAsB56B,EAAM,UAAU,CAAC,EACvC66B,EAAuB76B,EAAM,UAAU,CAAC,EAC5C46B,EAAoB,QAAQ,SAAUE,EAAgBC,EAAe,CACnEjI,GAAcgI,CAAc,EAC5BD,EAAqB,QAAQ,SAAUG,EAAiBC,EAAgB,CACtEnI,GAAckI,CAAe,EAC7BvZ,EAAO,IAAI,CAACqZ,EAAgBE,CAAe,EAAGlE,EAAUiE,EAAc,CAAC,CAAC,EAAEE,EAAe,CAAC,CAAC,EAAG/b,CAAY,CACtH,CAAW,CACX,CAAS,CACT,CACA,CACI,OAAOuC,CACX,CAQEoY,EAAa,UAAU,IAAM,SAAU75B,EAAO,CAC5C,GAAI,CAACyJ,GAAQzJ,CAAK,EAChB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,SAAW,KAAK,MAAM,OAC9B,MAAM,IAAImyB,GAAenyB,EAAM,OAAQ,KAAK,MAAM,MAAM,EAI1D,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,4CAA4C,EAI9D,IAAIzD,EAAIyD,EAAM,CAAC,EACXyjB,EAAIzjB,EAAM,CAAC,EAGf8yB,GAAcv2B,EAAG,KAAK,MAAM,CAAC,CAAC,EAC9Bu2B,GAAcrP,EAAG,KAAK,MAAM,CAAC,CAAC,EAG9B,IAAIF,EAAI2X,EAAe3+B,EAAG,KAAK,KAAKknB,CAAC,EAAG,KAAK,KAAKA,EAAI,CAAC,EAAG,KAAK,MAAM,EAErE,OAAIF,EAAI,KAAK,KAAKE,EAAI,CAAC,GAAK,KAAK,OAAOF,CAAC,IAAMhnB,EACtC,KAAK,QAAQgnB,CAAC,EAEhB,CACR,EAYDsW,EAAa,UAAU,IAAM,SAAU75B,EAAOiD,EAAGic,EAAc,CAC7D,GAAI,CAACzV,GAAQzJ,CAAK,EAChB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,SAAW,KAAK,MAAM,OAC9B,MAAM,IAAImyB,GAAenyB,EAAM,OAAQ,KAAK,MAAM,MAAM,EAI1D,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,4CAA4C,EAI9D,IAAIzD,EAAIyD,EAAM,CAAC,EACXyjB,EAAIzjB,EAAM,CAAC,EAGXi4B,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAGtB8B,EAAKJ,EAELK,EAAO,EACPzwB,GAAS,KAAK,SAAS,IAEzBwwB,EAAKzsB,EAAM,KAAKqsB,EAAa,CAAC,KAAK,UAAW,KAAK,SAAS,CAAC,GAAKA,EAElEK,EAAO1sB,EAAM,QAAQ,EAAG,KAAK,SAAS,IAIpChR,EAAI07B,EAAO,GAAKxU,EAAIyU,EAAU,KAEhClF,EAAQ,KAAM,KAAK,IAAIz2B,EAAI,EAAG07B,CAAI,EAAG,KAAK,IAAIxU,EAAI,EAAGyU,CAAO,EAAGhZ,CAAY,EAE3E+Y,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,GAIxBpF,GAAcv2B,EAAG07B,CAAI,EACrBnF,GAAcrP,EAAGyU,CAAO,EAGxB,IAAI3U,EAAI2X,EAAe3+B,EAAG,KAAK,KAAKknB,CAAC,EAAG,KAAK,KAAKA,EAAI,CAAC,EAAG,KAAK,MAAM,EAErE,OAAIF,EAAI,KAAK,KAAKE,EAAI,CAAC,GAAK,KAAK,OAAOF,CAAC,IAAMhnB,EAExCy9B,EAAG/2B,EAAGg3B,CAAI,EAKbkB,EAAQ5X,EAAGE,EAAG,KAAK,QAAS,KAAK,OAAQ,KAAK,IAAI,EAHlD,KAAK,QAAQF,CAAC,EAAItgB,EAMf+2B,EAAG/2B,EAAGg3B,CAAI,GAEbmB,EAAQ7X,EAAGhnB,EAAGknB,EAAGxgB,EAAG,KAAK,QAAS,KAAK,OAAQ,KAAK,IAAI,EAGrD,IACR,EACD,SAASi4B,EAAe3+B,EAAGkH,EAAK+D,EAAQxH,EAAO,CAE7C,GAAIwH,EAAS/D,IAAQ,EACnB,OAAO+D,EAGT,QAASyB,EAAIxF,EAAKwF,EAAIzB,EAAQyB,IAE5B,GAAIjJ,EAAMiJ,CAAC,IAAM1M,EACf,OAAO0M,EAIX,OAAOxF,CACX,CACE,SAAS03B,EAAQ5X,EAAGE,EAAGiX,EAAQ16B,EAAO26B,EAAK,CAEzCD,EAAO,OAAOnX,EAAG,CAAC,EAClBvjB,EAAM,OAAOujB,EAAG,CAAC,EAEjB,QAASpnB,EAAIsnB,EAAI,EAAGtnB,EAAIw+B,EAAI,OAAQx+B,IAClCw+B,EAAIx+B,CAAC,GAEX,CACE,SAASi/B,EAAQ7X,EAAGhnB,EAAGknB,EAAGxgB,EAAGy3B,EAAQ16B,EAAO26B,EAAK,CAE/CD,EAAO,OAAOnX,EAAG,EAAGtgB,CAAC,EAErBjD,EAAM,OAAOujB,EAAG,EAAGhnB,CAAC,EAEpB,QAASJ,EAAIsnB,EAAI,EAAGtnB,EAAIw+B,EAAI,OAAQx+B,IAClCw+B,EAAIx+B,CAAC,GAEX,CAiBE09B,EAAa,UAAU,OAAS,SAAUp0B,EAAMyZ,EAAc1S,EAAM,CAElE,GAAI,CAAC7C,GAAalE,CAAI,EACpB,MAAM,IAAI,UAAU,0BAA0B,EAIhD,IAAI4xB,EAAY5xB,EAAK,QAAO,EAAG,IAAIhK,GAC1B,MAAM,QAAQA,CAAK,GAAKA,EAAM,SAAW,EAAIA,EAAM,CAAC,EAAIA,CAChE,EACD,GAAI47B,EAAU,SAAW,EACvB,MAAM,IAAI,MAAM,0CAA0C,EAI5DA,EAAU,QAAQ,SAAU57B,EAAO,CACjC,GAAI,CAAC0N,GAAS1N,CAAK,GAAK,CAAC6gB,GAAU7gB,CAAK,GAAKA,EAAQ,EACnD,MAAM,IAAI,UAAU,uDAA8DqhB,GAAOua,CAAS,EAAI,GAAG,CAEjH,CAAK,EAGD,IAAIjT,EAAI5X,EAAO,KAAK,MAAO,EAAG,KAE9B,OAAOwmB,EAAQ5O,EAAGiT,EAAU,CAAC,EAAGA,EAAU,CAAC,EAAGnY,CAAY,CAC3D,EACD,SAAS8T,EAAQvR,EAAQwW,EAAMC,EAAShZ,EAAc,CAEpD,IAAIzjB,EAAQyjB,GAAgB,EAGxB8a,EAAKJ,EAELK,EAAO,EACPzwB,GAASiY,EAAO,SAAS,IAE3BuY,EAAKzsB,EAAM,KAAKqsB,EAAa,CAACnY,EAAO,UAAWA,EAAO,SAAS,CAAC,GAAKmY,EAEtEK,EAAO1sB,EAAM,QAAQ,EAAGkU,EAAO,SAAS,EAExChmB,EAAQ8R,EAAM,QAAQ9R,EAAOgmB,EAAO,SAAS,GAI/C,IAAI4Z,EAAM,CAACrB,EAAGv+B,EAAOw+B,CAAI,EAGrBhxB,EAAIwY,EAAO,MAAM,CAAC,EAClBlN,EAAIkN,EAAO,MAAM,CAAC,EAClBllB,EAAGknB,EAAGF,EAGV,GAAI2U,EAAU3jB,EAAG,CAEf,IAAKkP,EAAIlP,EAAGkP,EAAIyU,EAASzU,IAIvB,GAFAhC,EAAO,KAAKgC,CAAC,EAAIhC,EAAO,QAAQ,OAE5B4Z,EAEF,IAAK9+B,EAAI,EAAGA,EAAI0M,EAAG1M,IAEjBklB,EAAO,QAAQ,KAAKhmB,CAAK,EAEzBgmB,EAAO,OAAO,KAAKllB,CAAC,EAK1BklB,EAAO,KAAKyW,CAAO,EAAIzW,EAAO,QAAQ,MAC5C,MAAeyW,EAAU3jB,IAEnBkN,EAAO,KAAK,OAAOyW,EAAU,EAAG3jB,EAAI2jB,CAAO,EAE3CzW,EAAO,QAAQ,OAAOA,EAAO,KAAKyW,CAAO,EAAGzW,EAAO,QAAQ,MAAM,EACjEA,EAAO,OAAO,OAAOA,EAAO,KAAKyW,CAAO,EAAGzW,EAAO,OAAO,MAAM,GAMjE,GAHAlN,EAAI2jB,EAGAD,EAAOhvB,GAET,GAAIoyB,EAAK,CAEP,IAAItyB,EAAI,EAER,IAAK0a,EAAI,EAAGA,EAAIlP,EAAGkP,IAAK,CAEtBhC,EAAO,KAAKgC,CAAC,EAAIhC,EAAO,KAAKgC,CAAC,EAAI1a,EAElCwa,EAAI9B,EAAO,KAAKgC,EAAI,CAAC,EAAI1a,EAEzB,IAAIiH,EAAI,EAER,IAAKzT,EAAI0M,EAAG1M,EAAI07B,EAAM17B,IAAKyT,IAEzByR,EAAO,QAAQ,OAAO8B,EAAIvT,EAAG,EAAGvU,CAAK,EAErCgmB,EAAO,OAAO,OAAO8B,EAAIvT,EAAG,EAAGzT,CAAC,EAEhCwM,GAEZ,CAEQ0Y,EAAO,KAAKlN,CAAC,EAAIkN,EAAO,QAAQ,MACxC,UACewW,EAAOhvB,EAAG,CAEnB,IAAI8W,EAAI,EAER,IAAK0D,EAAI,EAAGA,EAAIlP,EAAGkP,IAAK,CAEtBhC,EAAO,KAAKgC,CAAC,EAAIhC,EAAO,KAAKgC,CAAC,EAAI1D,EAElC,IAAIub,EAAK7Z,EAAO,KAAKgC,CAAC,EAClB8X,EAAK9Z,EAAO,KAAKgC,EAAI,CAAC,EAAI1D,EAE9B,IAAKwD,EAAI+X,EAAI/X,EAAIgY,EAAIhY,IAEnBhnB,EAAIklB,EAAO,OAAO8B,CAAC,EAEfhnB,EAAI07B,EAAO,IAEbxW,EAAO,QAAQ,OAAO8B,EAAG,CAAC,EAE1B9B,EAAO,OAAO,OAAO8B,EAAG,CAAC,EAEzBxD,IAGZ,CAEM0B,EAAO,KAAKgC,CAAC,EAAIhC,EAAO,QAAQ,MACtC,CAEI,OAAAA,EAAO,MAAM,CAAC,EAAIwW,EAClBxW,EAAO,MAAM,CAAC,EAAIyW,EAEXzW,CACX,CAkBEoY,EAAa,UAAU,QAAU,SAAUvG,EAAO9mB,EAAM,CAEtD,GAAI,CAAC/C,GAAQ6pB,CAAK,EAChB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,SAAW,EACnB,MAAM,IAAI,MAAM,wDAAwD,EAI1EA,EAAM,QAAQ,SAAU73B,EAAO,CAC7B,GAAI,CAAC0N,GAAS1N,CAAK,GAAK,CAAC6gB,GAAU7gB,CAAK,GAAKA,GAAS,IAAMA,IAAU,EACpE,MAAM,IAAI,UAAU,6DAAoEqhB,GAAOwW,CAAK,EAAI,GAAG,CAEnH,CAAK,EACD,IAAIG,EAAgB,KAAK,MAAM,CAAC,EAAI,KAAK,MAAM,CAAC,EAChDH,EAAQI,GAAqBJ,EAAOG,CAAa,EACjD,IAAIE,EAAYL,EAAM,CAAC,EAAIA,EAAM,CAAC,EAGlC,GAAIG,IAAkBE,EACpB,MAAM,IAAI,MAAM,qEAAqE,EAIvF,IAAIvP,EAAI5X,EAAO,KAAK,MAAO,EAAG,KAG9B,GAAI,KAAK,MAAM,CAAC,IAAM8mB,EAAM,CAAC,GAAK,KAAK,MAAM,CAAC,IAAMA,EAAM,CAAC,EACzD,OAAOlP,EAKT,QADIoX,EAAW,CAAE,EACRj/B,EAAI,EAAGA,EAAI6nB,EAAE,KAAK,OAAQ7nB,IACjC,QAASknB,EAAI,EAAGA,EAAIW,EAAE,KAAK7nB,EAAI,CAAC,EAAI6nB,EAAE,KAAK7nB,CAAC,EAAGknB,IAC7C+X,EAAS,KAAKj/B,CAAC,EAWnB,QANIm+B,EAAStW,EAAE,QAAQ,MAAO,EAG1BqX,EAAWrX,EAAE,OAAO,MAAO,EAGtBsR,EAAK,EAAGA,EAAKtR,EAAE,OAAO,OAAQsR,IAAM,CAC3C,IAAIgG,EAAKD,EAAS/F,CAAE,EAChBiG,EAAKH,EAAS9F,CAAE,EAChBd,EAAO8G,EAAKtX,EAAE,MAAM,CAAC,EAAIuX,EAC7BH,EAAS9F,CAAE,EAAId,EAAOtB,EAAM,CAAC,EAC7BmI,EAAS/F,CAAE,EAAI,KAAK,MAAMd,EAAOtB,EAAM,CAAC,CAAC,CAC/C,CASIlP,EAAE,QAAQ,OAAS,EACnBA,EAAE,OAAO,OAAS,EAClBA,EAAE,KAAK,OAASkP,EAAM,CAAC,EAAI,EAC3BlP,EAAE,MAAQkP,EAAM,MAAO,EACvB,QAASsI,EAAM,EAAGA,EAAMxX,EAAE,KAAK,OAAQwX,IACrCxX,EAAE,KAAKwX,CAAG,EAAI,EAKhB,QAAS7iC,EAAI,EAAGA,EAAI2hC,EAAO,OAAQ3hC,IAAK,CACtC,IAAI8iC,EAAMJ,EAAS1iC,CAAC,EAChB+iC,EAAKN,EAASziC,CAAC,EACfkK,EAAIy3B,EAAO3hC,CAAC,EACZwqB,EAAI2X,EAAeW,EAAKzX,EAAE,KAAK0X,CAAE,EAAG1X,EAAE,KAAK0X,EAAK,CAAC,EAAG1X,EAAE,MAAM,EAChEgX,EAAQ7X,EAAGsY,EAAKC,EAAI74B,EAAGmhB,EAAE,QAASA,EAAE,OAAQA,EAAE,IAAI,CACxD,CAII,OAAOA,CACR,EAODyV,EAAa,UAAU,MAAQ,UAAY,CACzC,IAAIzV,EAAI,IAAIyV,EAAa,CACvB,OAAQ,KAAK,QAAUluB,GAAM,KAAK,OAAO,EAAI,OAC7C,MAAOA,GAAM,KAAK,MAAM,EACxB,IAAKA,GAAM,KAAK,IAAI,EACpB,KAAMA,GAAM,KAAK,KAAK,EACtB,SAAU,KAAK,SACrB,CAAK,EACD,OAAOyY,CACR,EAODyV,EAAa,UAAU,KAAO,UAAY,CACxC,OAAO,KAAK,MAAM,MAAM,CAAC,CAC1B,EAaDA,EAAa,UAAU,IAAM,SAAUr4B,EAAU2vB,EAAW,CAE1D,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,4CAA4C,EAG9D,IAAIqG,EAAK,KAELS,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAEtBrmB,EAAOwkB,GAAiB70B,CAAQ,EAChCu6B,EAAS,SAAgB94B,EAAG1G,EAAGknB,EAAG,CAEpC,OAAI5R,IAAS,EAAUrQ,EAASyB,CAAC,EAC7B4O,IAAS,EAAUrQ,EAASyB,EAAG,CAAC1G,EAAGknB,CAAC,CAAC,EAClCjiB,EAASyB,EAAG,CAAC1G,EAAGknB,CAAC,EAAG+T,CAAE,CAC9B,EAED,OAAOwE,EAAK,KAAM,EAAG/D,EAAO,EAAG,EAAGC,EAAU,EAAG6D,EAAQ5K,CAAS,CACjE,EAMD,SAAS6K,EAAKva,EAAQwa,EAAQC,EAAQC,EAAWC,EAAW56B,EAAU2vB,EAAW,CAE/E,IAAIuJ,EAAS,CAAE,EACX16B,EAAQ,CAAE,EACV26B,EAAM,CAAE,EAGRX,EAAKJ,EAELK,EAAO,EACPzwB,GAASiY,EAAO,SAAS,IAE3BuY,EAAKzsB,EAAM,KAAKqsB,EAAa,CAACnY,EAAO,UAAWA,EAAO,SAAS,CAAC,GAAKmY,EAEtEK,EAAO1sB,EAAM,QAAQ,EAAGkU,EAAO,SAAS,GAgB1C,QAZIsa,EAAS,SAAgB94B,EAAG9G,EAAG2iB,GAAG,CAEpC7b,EAAIzB,EAASyB,EAAG9G,EAAG2iB,EAAC,EAEfkb,EAAG/2B,EAAGg3B,CAAI,IAEbS,EAAO,KAAKz3B,CAAC,EAEbjD,EAAM,KAAK7D,CAAC,EAEf,EAEQsnB,EAAI0Y,EAAW1Y,GAAK2Y,EAAW3Y,IAAK,CAE3CkX,EAAI,KAAKD,EAAO,MAAM,EAEtB,IAAIY,EAAK7Z,EAAO,KAAKgC,CAAC,EAClB8X,EAAK9Z,EAAO,KAAKgC,EAAI,CAAC,EAC1B,GAAI0N,EAEF,QAAS5N,EAAI+X,EAAI/X,EAAIgY,EAAIhY,IAAK,CAE5B,IAAIhnB,EAAIklB,EAAO,OAAO8B,CAAC,EAEnBhnB,GAAK0/B,GAAU1/B,GAAK2/B,GAEtBH,EAAOta,EAAO,QAAQ8B,CAAC,EAAGhnB,EAAI0/B,EAAQxY,EAAI0Y,CAAS,CAE/D,KACa,CAGL,QADIE,EAAU,CAAE,EACPC,EAAKhB,EAAIgB,EAAKf,EAAIe,IAAM,CAC/B,IAAIC,EAAM9a,EAAO,OAAO6a,CAAE,EAC1BD,EAAQE,CAAG,EAAI9a,EAAO,QAAQ6a,CAAE,CAC1C,CAIQ,QAASE,GAAMP,EAAQO,IAAON,EAAQM,KAAO,CAC3C,IAAI/gC,GAAQ+gC,MAAOH,EAAUA,EAAQG,EAAG,EAAI,EAC5CT,EAAOtgC,GAAO+gC,GAAMP,EAAQxY,EAAI0Y,CAAS,CACnD,CACA,CACA,CAGI,OAAAxB,EAAI,KAAKD,EAAO,MAAM,EAEf,IAAIb,EAAa,CACtB,OAAAa,EACA,MAAA16B,EACA,IAAA26B,EACA,KAAM,CAACuB,EAASD,EAAS,EAAGG,EAAYD,EAAY,CAAC,CAC3D,CAAK,CACL,CAYEtC,EAAa,UAAU,QAAU,SAAUr4B,EAAU2vB,EAAW,CAE9D,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,gDAAgD,EAQlE,QALIqG,EAAK,KAELS,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAEjBzU,EAAI,EAAGA,EAAIyU,EAASzU,IAAK,CAEhC,IAAI6X,EAAK,KAAK,KAAK7X,CAAC,EAChB8X,EAAK,KAAK,KAAK9X,EAAI,CAAC,EACxB,GAAI0N,EAEF,QAAS5N,EAAI+X,EAAI/X,EAAIgY,EAAIhY,IAAK,CAE5B,IAAIhnB,EAAI,KAAK,OAAOgnB,CAAC,EAGrB/hB,EAAS,KAAK,QAAQ+hB,CAAC,EAAG,CAAChnB,EAAGknB,CAAC,EAAG+T,CAAE,CAC9C,KACa,CAGL,QADIkD,EAAS,CAAE,EACN+B,EAAMnB,EAAImB,EAAMlB,EAAIkB,IAAO,CAClC,IAAIC,EAAM,KAAK,OAAOD,CAAG,EACzB/B,EAAOgC,CAAG,EAAI,KAAK,QAAQD,CAAG,CACxC,CAIQ,QAASE,EAAM,EAAGA,EAAM1E,EAAM0E,IAAO,CACnC,IAAIlhC,EAAQkhC,KAAOjC,EAASA,EAAOiC,CAAG,EAAI,EAC1Cn7B,EAAS/F,EAAO,CAACkhC,EAAKlZ,CAAC,EAAG+T,CAAE,CACtC,CACA,CACA,CACG,EAMDqC,EAAa,UAAU,OAAO,QAAQ,EAAI,WAAa,CACrD,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,sCAAsC,EAGxD,QADI3B,EAAU,KAAK,MAAM,CAAC,EACjBzU,EAAI,EAAGA,EAAIyU,EAASzU,IAG3B,QAFI6X,EAAK,KAAK,KAAK7X,CAAC,EAChB8X,EAAK,KAAK,KAAK9X,EAAI,CAAC,EACfF,EAAI+X,EAAI/X,EAAIgY,EAAIhY,IAAK,CAE5B,IAAIhnB,EAAI,KAAK,OAAOgnB,CAAC,EACrB,KAAM,CACJ,MAAO,KAAK,QAAQA,CAAC,EACrB,MAAO,CAAChnB,EAAGknB,CAAC,CACb,CACT,CAEG,EAODoW,EAAa,UAAU,QAAU,UAAY,CAC3C,OAAO+C,EAAS,KAAK,QAAS,KAAK,OAAQ,KAAK,KAAM,KAAK,MAAO,EAAI,CACvE,EAOD/C,EAAa,UAAU,QAAU,UAAY,CAC3C,OAAO+C,EAAS,KAAK,QAAS,KAAK,OAAQ,KAAK,KAAM,KAAK,MAAO,EAAK,CACxE,EACD,SAASA,EAASlC,EAAQ16B,EAAO26B,EAAKl1B,EAAM+G,EAAM,CAEhD,IAAIyrB,EAAOxyB,EAAK,CAAC,EACbyyB,EAAUzyB,EAAK,CAAC,EAEhBuG,EAAI,CAAE,EAENzP,EAAGknB,EAEP,IAAKlnB,EAAI,EAAGA,EAAI07B,EAAM17B,IAEpB,IADAyP,EAAEzP,CAAC,EAAI,CAAE,EACJknB,EAAI,EAAGA,EAAIyU,EAASzU,IACvBzX,EAAEzP,CAAC,EAAEknB,CAAC,EAAI,EAKd,IAAKA,EAAI,EAAGA,EAAIyU,EAASzU,IAKvB,QAHI6X,EAAKX,EAAIlX,CAAC,EACV8X,EAAKZ,EAAIlX,EAAI,CAAC,EAETF,EAAI+X,EAAI/X,EAAIgY,EAAIhY,IAEvBhnB,EAAIyD,EAAMujB,CAAC,EAEXvX,EAAEzP,CAAC,EAAEknB,CAAC,EAAIiX,EAASluB,EAAOb,GAAM+uB,EAAOnX,CAAC,CAAC,EAAImX,EAAOnX,CAAC,EAAI,EAG7D,OAAOvX,CACX,CAWE,OAAA6tB,EAAa,UAAU,OAAS,SAAUn+B,EAAS,CASjD,QAPIu8B,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAEtB2E,EAAU,KAAK,QAAS,EAExBve,EAAM,kBAAoBxB,GAAOmb,EAAMv8B,CAAO,EAAI,MAAQohB,GAAOob,EAASx8B,CAAO,EAAI,cAAgBohB,GAAO+f,EAASnhC,CAAO,EAAI;AAAA,EAE3H+nB,EAAI,EAAGA,EAAIyU,EAASzU,IAK3B,QAHI6X,EAAK,KAAK,KAAK7X,CAAC,EAChB8X,EAAK,KAAK,KAAK9X,EAAI,CAAC,EAEfF,EAAI+X,EAAI/X,EAAIgY,EAAIhY,IAAK,CAE5B,IAAIhnB,EAAI,KAAK,OAAOgnB,CAAC,EAErBjF,GAAO;AAAA,OAAYxB,GAAOvgB,EAAGb,CAAO,EAAI,KAAOohB,GAAO2G,EAAG/nB,CAAO,EAAI,UAAY,KAAK,QAAUohB,GAAO,KAAK,QAAQyG,CAAC,EAAG7nB,CAAO,EAAI,IAC1I,CAEI,OAAO4iB,CACR,EAODub,EAAa,UAAU,SAAW,UAAY,CAC5C,OAAO/c,GAAO,KAAK,SAAS,CAC7B,EAOD+c,EAAa,UAAU,OAAS,UAAY,CAC1C,MAAO,CACL,OAAQ,eACR,OAAQ,KAAK,QACb,MAAO,KAAK,OACZ,IAAK,KAAK,KACV,KAAM,KAAK,MACX,SAAU,KAAK,SAChB,CACF,EAUDA,EAAa,UAAU,SAAW,SAAUtW,EAAG,CAE7C,GAAIA,GAMF,GAJIna,GAAYma,CAAC,IACfA,EAAIA,EAAE,SAAU,GAGd,CAACpa,GAASoa,CAAC,GAAK,CAACjH,GAAUiH,CAAC,EAC9B,MAAM,IAAI,UAAU,2CAA2C,OAIjEA,EAAI,EAEN,IAAIwU,EAASxU,EAAI,EAAIA,EAAI,EACrByU,EAAOzU,EAAI,EAAI,CAACA,EAAI,EAGpB0U,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAGtBnvB,EAAI,KAAK,IAAIkvB,EAAOD,EAAME,EAAUH,CAAM,EAG1C2C,EAAS,CAAE,EACX16B,EAAQ,CAAE,EACV26B,EAAM,CAAE,EAEZA,EAAI,CAAC,EAAI,EAET,QAASlX,EAAIsU,EAAQtU,EAAIyU,GAAWwC,EAAO,OAAS3xB,EAAG0a,IAKrD,QAHI6X,EAAK,KAAK,KAAK7X,CAAC,EAChB8X,EAAK,KAAK,KAAK9X,EAAI,CAAC,EAEftnB,EAAIm/B,EAAIn/B,EAAIo/B,EAAIp/B,IAAK,CAE5B,IAAII,EAAI,KAAK,OAAOJ,CAAC,EAErB,GAAII,IAAMknB,EAAIsU,EAASC,EAAM,CAE3B0C,EAAO,KAAK,KAAK,QAAQv+B,CAAC,CAAC,EAE3B6D,EAAM06B,EAAO,OAAS,CAAC,EAAIn+B,EAAIy7B,EAE/B,KACV,CACA,CAGI,OAAA2C,EAAI,KAAKD,EAAO,MAAM,EAEf,IAAIb,EAAa,CACtB,OAAAa,EACA,MAAA16B,EACA,IAAA26B,EACA,KAAM,CAAC5xB,EAAG,CAAC,CACjB,CAAK,CACF,EAUD8wB,EAAa,SAAW,SAAUpM,EAAM,CACtC,OAAO,IAAIoM,EAAapM,CAAI,CAC7B,EAcDoM,EAAa,SAAW,SAAUp0B,EAAMhK,EAAO8nB,EAAGrE,EAAcgS,EAAU,CACxE,GAAI,CAACznB,GAAQhE,CAAI,EACf,MAAM,IAAI,UAAU,gCAAgC,EAEtD,GAAIA,EAAK,SAAW,EAClB,MAAM,IAAI,MAAM,0CAA0C,EAkB5D,GAdAA,EAAOA,EAAK,IAAI,SAAU4K,EAAG,CAO3B,GALIjH,GAAYiH,CAAC,IAEfA,EAAIA,EAAE,SAAU,GAGd,CAAClH,GAASkH,CAAC,GAAK,CAACiM,GAAUjM,CAAC,GAAKA,EAAI,EACvC,MAAM,IAAI,MAAM,uCAAuC,EAEzD,OAAOA,CACb,CAAK,EAGGkT,GAMF,GAJIna,GAAYma,CAAC,IACfA,EAAIA,EAAE,SAAU,GAGd,CAACpa,GAASoa,CAAC,GAAK,CAACjH,GAAUiH,CAAC,EAC9B,MAAM,IAAI,UAAU,2CAA2C,OAIjEA,EAAI,EAIN,IAAIyW,EAAKJ,EAELK,EAAO,EACPzwB,GAAS0nB,CAAQ,IAEnB8I,EAAKzsB,EAAM,KAAKqsB,EAAa,CAAC1I,EAAUA,CAAQ,CAAC,GAAK0I,EAEtDK,EAAO1sB,EAAM,QAAQ,EAAG2jB,CAAQ,GAElC,IAAI6G,EAASxU,EAAI,EAAIA,EAAI,EACrByU,EAAOzU,EAAI,EAAI,CAACA,EAAI,EAGpB0U,EAAOxyB,EAAK,CAAC,EACbyyB,EAAUzyB,EAAK,CAAC,EAGhBsD,EAAI,KAAK,IAAIkvB,EAAOD,EAAME,EAAUH,CAAM,EAG1CI,EAGJ,GAAI1uB,GAAQhO,CAAK,EAAG,CAElB,GAAIA,EAAM,SAAWsN,EAEnB,MAAM,IAAI,MAAM,4BAA4B,EAG9CovB,EAAS,SAAgB57B,GAAG,CAE1B,OAAOd,EAAMc,EAAC,CACf,CACP,SAAemN,GAASjO,CAAK,EAAG,CAE1B,IAAI28B,EAAK38B,EAAM,KAAM,EAErB,GAAI28B,EAAG,SAAW,GAAKA,EAAG,CAAC,IAAMrvB,EAE/B,MAAM,IAAI,MAAM,uBAAuB,EAGzCovB,EAAS,SAAgB57B,GAAG,CAE1B,OAAOd,EAAM,IAAI,CAACc,EAAC,CAAC,CACrB,CACP,MAEM47B,EAAS,UAAkB,CAEzB,OAAO18B,CACR,EASH,QALIi/B,EAAS,CAAE,EACX16B,EAAQ,CAAE,EACV26B,EAAM,CAAE,EAGHlX,EAAI,EAAGA,EAAIyU,EAASzU,IAAK,CAEhCkX,EAAI,KAAKD,EAAO,MAAM,EAEtB,IAAIn+B,EAAIknB,EAAIsU,EAEZ,GAAIx7B,GAAK,GAAKA,EAAIwM,EAAG,CAEnB,IAAI9F,EAAIk1B,EAAO57B,CAAC,EAEXy9B,EAAG/2B,EAAGg3B,CAAI,IAEbj6B,EAAM,KAAKzD,EAAIy7B,CAAI,EAEnB0C,EAAO,KAAKz3B,CAAC,EAEvB,CACA,CAEI,OAAA03B,EAAI,KAAKD,EAAO,MAAM,EAEf,IAAIb,EAAa,CACtB,OAAAa,EACA,MAAA16B,EACA,IAAA26B,EACA,KAAM,CAAC1C,EAAMC,CAAO,CAC1B,CAAK,CACF,EAWD2B,EAAa,UAAU,SAAW,SAAUt9B,EAAGknB,EAAG,CAEhD,GAAI,CAACta,GAAS5M,CAAC,GAAK,CAAC+f,GAAU/f,CAAC,GAAK,CAAC4M,GAASsa,CAAC,GAAK,CAACnH,GAAUmH,CAAC,EAC/D,MAAM,IAAI,MAAM,qCAAqC,EAGvD,GAAI,KAAK,MAAM,SAAW,EACxB,MAAM,IAAI,MAAM,0CAA0C,EAG5D,OAAAqP,GAAcv2B,EAAG,KAAK,MAAM,CAAC,CAAC,EAC9Bu2B,GAAcrP,EAAG,KAAK,MAAM,CAAC,CAAC,EAG9BoW,EAAa,UAAUt9B,EAAGknB,EAAG,KAAK,MAAM,CAAC,EAAG,KAAK,QAAS,KAAK,OAAQ,KAAK,IAAI,EAEzE,IACR,EAWDoW,EAAa,YAAc,SAAUpW,EAAGiX,EAAQ16B,EAAO26B,EAAKn5B,EAAU,CAKpE,QAHI85B,EAAKX,EAAIlX,CAAC,EACV8X,EAAKZ,EAAIlX,EAAI,CAAC,EAETF,EAAI+X,EAAI/X,EAAIgY,EAAIhY,IAEvB/hB,EAASxB,EAAMujB,CAAC,EAAGmX,EAAOnX,CAAC,CAAC,CAE/B,EAYDsW,EAAa,UAAY,SAAU19B,EAAG2iB,EAAGoZ,EAASwC,EAAQ16B,EAAO26B,EAAK,CAEpE,QAASlX,EAAI,EAAGA,EAAIyU,EAASzU,IAAK,CAEhC,IAAI6X,EAAKX,EAAIlX,CAAC,EACV8X,EAAKZ,EAAIlX,EAAI,CAAC,EAEdqZ,EAAK5B,EAAe/+B,EAAGm/B,EAAIC,EAAIv7B,CAAK,EAEpC+8B,EAAK7B,EAAepc,EAAGwc,EAAIC,EAAIv7B,CAAK,EAExC,GAAI88B,EAAKvB,GAAMwB,EAAKxB,GAAMv7B,EAAM88B,CAAE,IAAM3gC,GAAK6D,EAAM+8B,CAAE,IAAMje,EAAG,CAE5D,GAAI4b,EAAQ,CACV,IAAIz3B,EAAIy3B,EAAOoC,CAAE,EACjBpC,EAAOoC,CAAE,EAAIpC,EAAOqC,CAAE,EACtBrC,EAAOqC,CAAE,EAAI95B,CACvB,CAEQ,QACR,CAEM,GAAI65B,EAAKvB,GAAMv7B,EAAM88B,CAAE,IAAM3gC,IAAM4gC,GAAMxB,GAAMv7B,EAAM+8B,CAAE,IAAMje,GAAI,CAE/D,IAAIke,EAAKtC,EAASA,EAAOoC,CAAE,EAAI,OAE/B98B,EAAM,OAAO+8B,EAAI,EAAGje,CAAC,EACjB4b,GACFA,EAAO,OAAOqC,EAAI,EAAGC,CAAE,EAGzBh9B,EAAM,OAAO+8B,GAAMD,EAAKA,EAAK,EAAIA,EAAI,CAAC,EAClCpC,GACFA,EAAO,OAAOqC,GAAMD,EAAKA,EAAK,EAAIA,EAAI,CAAC,EAGzC,QACR,CAEM,GAAIC,EAAKxB,GAAMv7B,EAAM+8B,CAAE,IAAMje,IAAMge,GAAMvB,GAAMv7B,EAAM88B,CAAE,IAAM3gC,GAAI,CAE/D,IAAI8gC,EAAKvC,EAASA,EAAOqC,CAAE,EAAI,OAE/B/8B,EAAM,OAAO88B,EAAI,EAAG3gC,CAAC,EACjBu+B,GACFA,EAAO,OAAOoC,EAAI,EAAGG,CAAE,EAGzBj9B,EAAM,OAAO88B,GAAMC,EAAKA,EAAK,EAAIA,EAAI,CAAC,EAClCrC,GACFA,EAAO,OAAOoC,GAAMC,EAAKA,EAAK,EAAIA,EAAI,CAAC,CAEjD,CACA,CACG,EACMlD,CACT,EAAG,CACD,QAAS,EACX,CAAC,EC38CG12B,GAAO,SACPic,GAAe,CAAC,OAAO,EAO3B,SAAS8d,GAAyBh7B,EAAO,CACvC,IAAIi7B,EAA2Bj7B,EAAM,MAAM,wCAAwC,EACnF,GAAIi7B,EAA0B,CAC5B,IAAIC,EAAQ,CACV,KAAM,EACN,KAAM,EACN,KAAM,EACZ,EAAMD,EAAyB,CAAC,CAAC,EACzBE,EAAcF,EAAyB,CAAC,EACxCG,EAAiBH,EAAyB,CAAC,EAC/C,MAAO,CACL,MAAAj7B,EACA,MAAAk7B,EACA,YAAAC,EACA,eAAAC,CACD,CACL,KACI,QAAO,IAEX,CAOA,SAASC,GAA8BC,EAAO,CAG5C,QAFIz0B,EAAI,SAASy0B,EAAM,YAAaA,EAAM,KAAK,EAC3Clc,EAAI,EACC,EAAI,EAAG,EAAIkc,EAAM,eAAe,OAAQ,IAAK,CACpD,IAAIC,EAAa,SAASD,EAAM,eAAe,CAAC,EAAGA,EAAM,KAAK,EAC9Dlc,GAAKmc,EAAa,KAAK,IAAID,EAAM,MAAO,EAAI,CAAC,CACjD,CACE,IAAI/L,EAAS1oB,EAAIuY,EACjB,GAAI,MAAMmQ,CAAM,EACd,MAAM,IAAI,YAAY,WAAa+L,EAAM,MAAQ,yBAAyB,EAE5E,OAAO/L,CACT,CACO,IAAIiM,GAA8Bve,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC3E,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EA0BA6c,EAASpwB,EAAM,SAAU,CAC3B,GAAI,UAAa,CACf,MAAO,EACR,EACD,OAAQ,SAAgBpR,EAAG,CACzB,OAAOA,CACR,EACD,OAAQ,SAAgBA,EAAG,CACzB,GAAIA,IAAM,MAAO,MAAO,KACxB,IAAIyhC,EAAwBV,GAAyB/gC,CAAC,EACtD,GAAIyhC,EACF,OAAOL,GAA8BK,CAAqB,EAE5D,IAAIn4B,EAAO,EACPo4B,EAAsB1hC,EAAE,MAAM,+BAA+B,EAC7D0hC,IAGFp4B,EAAO,OAAOo4B,EAAoB,CAAC,CAAC,EACpC1hC,EAAI0hC,EAAoB,CAAC,GAE3B,IAAI/X,EAAM,OAAO3pB,CAAC,EAClB,GAAI,MAAM2pB,CAAG,EACX,MAAM,IAAI,YAAY,WAAa3pB,EAAI,yBAAyB,EAElE,GAAI0hC,EAAqB,CAGvB,GAAI/X,EAAMjJ,GAAA,EAAKpX,GAAO,EAEpB,MAAM,IAAI,YAAY,WAAY,OAAOtJ,EAAG,mBAAoB,CAAC,EAG/D2pB,GAAOjJ,GAAA,EAAMpX,EAAO,KACtBqgB,EAAMA,EAAMjJ,GAAA,EAAKpX,GAE3B,CACM,OAAOqgB,CACR,EACD,UAAW,SAAmB3pB,EAAG,CAC/B,OAAOA,EAAE,SAAU,CACpB,EACD,SAAU,SAAkBA,EAAG,CAC7B,OAAOA,EAAE,QAAS,CACnB,EACD,KAAMoR,EAAM,YAAY/R,GAAQW,GAAK,CACnC,IAAIwP,EAAQxP,EAAE,MAAO,EACrB,OAAAwP,EAAM,MAAQnQ,EAAKW,EAAE,KAAK,EACnBwP,CACb,CAAK,EACD,KAAM,SAAexP,EAAG,CACtB,MAAO,EACR,EACD,sBAAuB,SAAwB2hC,EAAMC,EAAe,CAClE,OAAOD,EAAK,SAASC,CAAa,CACnC,EACD,iBAAkBxwB,EAAM,YAAY/R,GAAQW,GAAKm8B,GAAQn8B,EAAGX,CAAI,CAAC,CACrE,CAAG,EAOD,OAAAmiC,EAAO,SAAW,SAAUlQ,EAAM,CAChC,OAAO,WAAWA,EAAK,KAAK,CAC7B,EACMkQ,CACT,CAAC,EChJGx6B,GAAO,YACPic,GAAe,CAAC,QAAS,WAAW,EAC7B4e,GAAiC7e,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC9E,GAAI,CACF,MAAAvT,EACA,UAAAwT,CACJ,EAAMD,EA0BJ,OAAOvT,EAAM,YAAa,CACxB,GAAI,UAAa,CACf,OAAO,IAAIwT,EAAU,CAAC,CACvB,EACD,OAAQ,SAAgB5kB,EAAG,CAEzB,OAAO,IAAI4kB,EAAU5kB,EAAI,EAAE,CAC5B,EACD,OAAQ,SAAgBA,EAAG,CACzB,IAAI0hC,EAAsB1hC,EAAE,MAAM,+BAA+B,EACjE,GAAI0hC,EAAqB,CAEvB,IAAIp4B,EAAOo4B,EAAoB,CAAC,EAC5B90B,EAAIgY,EAAU8c,EAAoB,CAAC,CAAC,EACpCI,EAAa,IAAIld,EAAU,CAAC,EAAE,IAAI,OAAOtb,CAAI,CAAC,EAClD,GAAIsD,EAAE,GAAGk1B,EAAW,IAAI,CAAC,CAAC,EACxB,MAAM,IAAI,YAAY,WAAY,OAAO9hC,EAAG,mBAAoB,CAAC,EAEnE,IAAI+hC,EAAmB,IAAInd,EAAU,CAAC,EAAE,IAAI,OAAOtb,CAAI,EAAI,CAAC,EAC5D,OAAIsD,EAAE,IAAIm1B,CAAgB,EACjBn1B,EAAE,IAAIk1B,CAAU,EAEhBl1B,CAEjB,CACM,OAAO,IAAIgY,EAAU5kB,CAAC,CACvB,EACD,UAAW,SAAmBA,EAAG,CAE/B,OAAOA,CACR,EACD,KAAMoR,EAAM,YAAY/R,GAAQW,GAAK,CACnC,IAAIwP,EAAQxP,EAAE,MAAO,EACrB,OAAAwP,EAAM,MAAQnQ,EAAKW,EAAE,KAAK,EACnBwP,CACb,CAAK,EACD,SAAU,SAAkBxP,EAAG,CAC7B,OAAO,IAAI4kB,EAAU5kB,EAAE,CAAC,EAAE,IAAIA,EAAE,CAAC,EAAE,MAAMA,EAAE,CAAC,CAC7C,EACD,KAAM,SAAeA,EAAG,CACtB,OAAO,IAAI4kB,EAAU,CAAC,CACvB,EACD,iBAAkBxT,EAAM,YAAY/R,GAAQW,GAAKm8B,GAAQn8B,EAAGX,CAAI,CAAC,CACrE,CAAG,CACH,CAAC,EC5EG2H,GAAO,UACPic,GAAe,CAAC,QAAS,SAAS,EAC3B+e,GAA+Bhf,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC5E,GAAI,CACF,MAAAvT,EACA,QAAAyT,CACJ,EAAMF,EAuCJ,OAAOvT,EAAM,UAAW,CACtB,GAAI,UAAa,CACf,OAAOyT,EAAQ,IAChB,EACD,OAAQ,SAAgB7kB,EAAG,CACzB,OAAO,IAAI6kB,EAAQ7kB,EAAG,CAAC,CACxB,EACD,iBAAkB,SAAsBiyB,EAAIC,EAAI,CAC9C,OAAO,IAAIrN,EAAQoN,EAAIC,CAAE,CAC1B,EAED,uBAAwB,SAA4BD,EAAIC,EAAI,CAC1D,OAAO,IAAIrN,EAAQoN,EAAG,SAAQ,EAAIC,EAAG,UAAU,CAChD,EACD,SAAU,SAAkBlyB,EAAG,CAC7B,OAAO,IAAI6kB,EAAQ7kB,EAAE,QAAO,EAAI,CAAC,CAClC,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,MAAO,CACjB,EACD,OAAQ,SAAgBA,EAAG,CACzB,OAAO6kB,EAAQ7kB,CAAC,CACjB,EACD,KAAM,SAAeA,EAAG,CACtB,OAAO6kB,EAAQ,CAAC,CACjB,EACD,OAAQ,SAAgB7kB,EAAG,CACzB,GAAI,OAAQA,GAAK,OAAQA,EACvB,OAAO,IAAI6kB,EAAQ7kB,EAAE,GAAIA,EAAE,EAAE,EAE/B,GAAI,MAAOA,GAAK,QAASA,GAAK,QAASA,GAAK,QAASA,EACnD,OAAO,IAAI6kB,EAAQ7kB,CAAC,EAEtB,MAAM,IAAI,MAAM,6EAA6E,CAC9F,EACD,iBAAkBoR,EAAM,YAAY/R,GAAQW,GAAKm8B,GAAQn8B,EAAGX,CAAI,CAAC,CACrE,CAAG,CACH,CAAC,EClFG2H,GAAO,WACPic,GAAe,CAAC,QAAS,UAAU,EAC5Bgf,GAAgCjf,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC7E,GAAI,CACF,MAAAvT,EACA,SAAA2T,CACJ,EAAMJ,EAsCJ,OAAOvT,EAAM,WAAY,CACvB,OAAQ,SAAgBpR,EAAG,CACzB,GAAI,CAAC,SAASA,CAAC,GAAK,MAAMA,CAAC,EACzB,MAAM,IAAI,MAAMA,EAAI,sCAAsC,EAE5D,OAAO,IAAI+kB,EAAS/kB,CAAC,CACtB,EACD,OAAQ,SAAgBA,EAAG,CACzB,OAAO,IAAI+kB,EAAS/kB,CAAC,CACtB,EACD,iBAAkB,SAAsBouB,EAAW3E,EAAa,CAC9D,OAAO,IAAI1E,EAASqJ,EAAW3E,CAAW,CAC3C,EACD,KAAM,SAAezpB,EAAG,CACtB,OAAO,IAAI+kB,EAAS,CAAC,CACtB,EACD,UAAW,SAAmB/kB,EAAG,CAC/B,OAAO,IAAI+kB,EAAS/kB,EAAE,UAAU,CACjC,EACD,SAAU,SAAkBA,EAAG,CAC7B,OAAOA,CACR,EACD,KAAMoR,EAAM,YAAY/R,GAAQW,GAAK,CACnC,IAAIwP,EAAQxP,EAAE,MAAO,EACrB,OAAAwP,EAAM,MAAQnQ,EAAKW,EAAE,KAAK,EACnBwP,CACb,CAAK,EACD,OAAQ,SAAgBxP,EAAG,CACzB,OAAO,IAAI+kB,EAAS/kB,CAAC,CACtB,EACD,iBAAkBoR,EAAM,YAAY/R,GAAQW,GAAKm8B,GAAQn8B,EAAGX,CAAI,CAAC,CACrE,CAAG,CACH,CAAC,EC7EG2H,GAAO,SACPic,GAAe,CAAC,QAAS,SAAU,cAAe,cAAc,EACzDif,GAA8Blf,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC3E,GAAI,CACF,MAAAvT,EACA,OAAA0jB,EACA,YAAAhQ,EACA,aAAA4Y,CACJ,EAAM/Y,EAkCJ,OAAOvT,EAAMpK,GAAM,CACjB,GAAI,UAAa,CACf,OAAOm7B,EAAQ,EAAE,CAClB,EACD,OAAQ,SAAgBxhB,EAAQ,CAC9B,OAAOwhB,EAAQ,CAAE,EAAExhB,CAAM,CAC1B,EACD,iBAAkB,SAAsBA,EAAQoU,EAAU,CACxD,OAAOoN,EAAQ,GAAIxhB,EAAQoU,CAAQ,CACpC,EACD,MAAO,SAAe52B,EAAM,CAC1B,OAAOgkC,EAAQhkC,CAAI,CACpB,EACD,OAAQ,SAAgBA,EAAM,CAC5B,OAAOgkC,EAAQhkC,EAAMA,EAAK,QAAO,CAAE,CACpC,EACD,yBAA0BgkC,EAC1B,iCAAkCA,CACtC,CAAG,EAUD,SAASA,EAAQhkC,EAAMwiB,EAAQoU,EAAU,CAEvC,GAAIpU,IAAW,SAAWA,IAAW,WAAaA,IAAW,OAC3D,OAAO,IAAImE,EAAY3mB,EAAM42B,CAAQ,EAEvC,GAAIpU,IAAW,SACb,OAAO,IAAI+c,EAAav/B,EAAM42B,CAAQ,EAExC,MAAM,IAAI,UAAU,uBAAyB,KAAK,UAAUpU,CAAM,EAAI,GAAG,CAC7E,CACA,CAAC,EChFG3Z,GAAO,oBACPic,GAAe,CAAC,QAAS,SAAU,UAAW,MAAM,EAC7Cmf,GAAyCpf,GAAQhc,GAAMic,GAAc0B,GAAQ,CACtF,GAAI,CACF,MAAAvT,EACA,OAAAkU,EACA,QAAA+R,EACA,KAAA/tB,CACJ,EAAMqb,EAuBJ,OAAOvT,EAAMpK,GAAM,CACjB,WAAY,SAAewX,EAAK,CAC9B,OAAO6jB,EAAa7jB,CAAG,CACxB,EACD,YAAa,SAAgBA,EAAK,CAChC,OAAO8G,EAAO+c,EAAa7jB,EAAI,IAAIyJ,GAAKA,EAAE,QAAS,EAAC,CAAC,CAC3D,CAGA,CAAG,EACD,SAASoa,EAAa7jB,EAAK,CACzB,GAAIA,EAAI,SAAW,EAAG,MAAM,IAAI,UAAU,sDAAsD,EAKhG,QAJIoV,EAAI0O,EAA+B9jB,EAAI,CAAC,CAAC,EAGzC8W,EAAS,CAAE,EACNl1B,EAAI,EAAGA,EAAIwzB,EAAGxzB,IACrBk1B,EAAOl1B,CAAC,EAAI,CAAE,EAIhB,QAASu7B,KAAOnd,EAAK,CACnB,IAAI+jB,EAAYD,EAA+B3G,CAAG,EAClD,GAAI4G,IAAc3O,EAChB,MAAM,IAAI,UAAU,sCAAwCA,EAAI,GAAK,OAAS2O,EAAY,EAAE,EAK9F,QAHIpd,EAAIkS,EAAQsE,CAAG,EAGVpC,EAAK,EAAGA,EAAK3F,EAAG2F,IACvBjE,EAAOiE,CAAE,EAAE,KAAKpU,EAAEoU,CAAE,CAAC,CAE7B,CACI,OAAOjE,CACX,CACE,SAASgN,EAA+BE,EAAK,CAC3C,IAAItuB,EAAI5K,EAAKk5B,CAAG,EAChB,GAAItuB,EAAE,SAAW,EAEf,OAAOA,EAAE,CAAC,EACL,GAAIA,EAAE,SAAW,EAAG,CAEzB,GAAIA,EAAE,CAAC,IAAM,EAEX,OAAOA,EAAE,CAAC,EACL,GAAIA,EAAE,CAAC,IAAM,EAElB,OAAOA,EAAE,CAAC,EAEV,MAAM,IAAI,UAAU,gDAAgD,CAE5E,KACM,OAAM,IAAI,UAAU,qDAAqD,CAE/E,CACA,CAAC,ECpFGlN,GAAO,aACPic,GAAe,CAAC,OAAO,EAChBwf,GAAkCzf,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC/E,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EAwBJ,OAAOvT,EAAMpK,GAAM,CACjB,OAAQ21B,GACR,iCAAkC38B,GAAKA,EAAE,IAAK,EAC9C,KAAMoR,EAAM,YAAY/R,GAAQW,GAAK,CACnC,IAAIoyB,EAAMpyB,EAAE,MAAO,EACnB,OAAAoyB,EAAI,MAAQhhB,EAAM,KAAK/R,EAAM+yB,EAAI,UAAW,GAAEpyB,EAAE,KAAK,EAC9CoyB,CACb,CAAK,EAED,iBAAkBhhB,EAAM,YAAY/R,GAAQW,GAAKm8B,GAAQn8B,EAAGX,CAAU,CAAC,CAG3E,CAAG,CACH,CAAC,EC1CG2H,GAAO,MACPic,GAAe,CAAC,OAAO,EAChByf,GAA2B1f,GAAQhc,GAAMic,GAAc0B,GAAQ,CACxE,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EAyBJ,OAAOvT,EAAMpK,GAAM,CACjB,OAAQu1B,GACR,wCAAyCv8B,GAAKA,EAAE,IAAK,EAErD,iBAAkBoR,EAAM,YAAY/R,GAAQW,GAAKm8B,GAAQn8B,EAAGX,CAAU,CAAC,CAC3E,CAAG,CACH,CAAC,ECrCG2H,GAAO,YACPic,GAAe,CAAC,OAAO,EAChB0f,GAAiC3f,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC9E,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EAaJ,OAAOvT,EAAMpK,GAAM,CACjB,iBAAkBw1B,GAClB,mBAAoB,SAAwBx8B,EAAG2iB,EAAG,CAChD,OAAO3iB,EAAE,IAAI2iB,CAAC,CACf,EACD,uBAAwB,SAA4B3iB,EAAG2iB,EAAG,CACxD,OAAO3iB,EAAE,KAAK2iB,CAAC,CAChB,EACD,qBAAsB,SAA0B3iB,EAAG2iB,EAAG,CACpD,OAAO3iB,EAAE,IAAI2iB,CAAC,CACf,EACD,aAAcvR,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IAAM,CAChD,GAAI3iB,EAAE,QAAU,MAAQA,EAAE,QAAU,OAClC,MAAM,IAAI,MAAM,kDAAkD,EAEpE,GAAI2iB,EAAE,QAAU,MAAQA,EAAE,QAAU,OAClC,MAAM,IAAI,MAAM,kDAAkD,EAEpE,GAAI,CAAC3iB,EAAE,UAAU2iB,CAAC,EAAG,MAAM,IAAI,MAAM,oBAAoB,EACzD,IAAIyP,EAAMpyB,EAAE,MAAO,EACnB,OAAAoyB,EAAI,MAAQhhB,EAAM,KAAK/R,EAAM,CAAC+yB,EAAI,UAAS,EAAIzP,EAAE,UAAW,EAAC,EAAEyP,EAAI,MAAOzP,EAAE,KAAK,EACjFyP,EAAI,UAAY,GACTA,CACR,EACL,CAAG,CACH,CAAC,EC3CGprB,GAAO,iBACPic,GAAe,CAAC,OAAO,EAChB2f,GAAsC5f,GAAQhc,GAAMic,GAAc0B,GAAQ,CACnF,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EAaJ,OAAOvT,EAAMpK,GAAM,CACjB,iBAAkBy1B,GAClB,mBAAoB,SAAwBz8B,EAAG2iB,EAAG,CAChD,OAAO3iB,EAAE,IAAI2iB,CAAC,CACf,EACD,uBAAwB,SAA4B3iB,EAAG2iB,EAAG,CACxD,OAAO3iB,EAAE,MAAM2iB,CAAC,CACjB,EACD,qBAAsB,SAA0B3iB,EAAG2iB,EAAG,CACpD,OAAO3iB,EAAE,IAAI2iB,CAAC,CACf,EACD,aAAcvR,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IAAM,CAChD,GAAI3iB,EAAE,QAAU,MAAQA,EAAE,QAAU,OAClC,MAAM,IAAI,MAAM,kDAAkD,EAEpE,GAAI2iB,EAAE,QAAU,MAAQA,EAAE,QAAU,OAClC,MAAM,IAAI,MAAM,kDAAkD,EAEpE,GAAI,CAAC3iB,EAAE,UAAU2iB,CAAC,EAAG,MAAM,IAAI,MAAM,oBAAoB,EACzD,IAAIyP,EAAMpyB,EAAE,MAAO,EACnB,OAAAoyB,EAAI,MAAQhhB,EAAM,KAAK/R,EAAM,CAAC+yB,EAAI,UAAS,EAAIzP,EAAE,UAAW,EAAC,EAAEyP,EAAI,MAAOzP,EAAE,KAAK,EACjFyP,EAAI,UAAY,GACTA,CACR,EACL,CAAG,CACH,CAAC,EC5CGprB,GAAO,gBACPic,GAAe,CAAC,QAAS,aAAa,EAC/B4f,GAAqC7f,GAAQhc,GAAMic,GAAc0B,GAAQ,CAClF,GAAI,CACF,MAAAvT,EACA,YAAAqsB,CACJ,EAAM9Y,EAoBJ,OAAO,SAAuBzQ,EAAGpE,EAAGzK,EAAUy9B,EAAS,CAErD,IAAIC,EAAU7uB,EAAE,QACZ8uB,EAAS9uB,EAAE,OACX+uB,EAAO/uB,EAAE,KACTgvB,EAAQhvB,EAAE,MACVivB,EAAMjvB,EAAE,UAGZ,GAAI,CAAC6uB,EACH,MAAM,IAAI,MAAM,oEAAoE,EAItF,IAAIjH,EAAOoH,EAAM,CAAC,EACdnH,EAAUmH,EAAM,CAAC,EAGjBE,EAEAvF,EAAKJ,EAELK,EAAO,EAEPuF,EAAKh+B,EAGL,OAAO89B,GAAQ,WAEjBC,EAAKD,EAELtF,EAAKzsB,EAAM,KAAKqsB,EAAa,CAAC2F,EAAIA,CAAE,CAAC,EAErCtF,EAAO1sB,EAAM,QAAQ,EAAGgyB,CAAE,EAE1BtzB,EAAIsB,EAAM,QAAQtB,EAAGszB,CAAE,EAEvBC,EAAKjyB,EAAM,KAAK/L,EAAU,CAAC+9B,EAAIA,CAAE,CAAC,GASpC,QALIE,EAAU,CAAE,EACZC,EAAS,CAAE,EACXC,EAAO,CAAE,EAGJlc,EAAI,EAAGA,EAAIyU,EAASzU,IAAK,CAEhCkc,EAAKlc,CAAC,EAAIic,EAAO,OAEjB,QAASpE,EAAK8D,EAAK3b,CAAC,EAAG8X,EAAK6D,EAAK3b,EAAI,CAAC,EAAGF,EAAI+X,EAAI/X,EAAIgY,EAAIhY,IAAK,CAE5D,IAAIhnB,EAAI4iC,EAAO5b,CAAC,EAEZtgB,EAAIg8B,EAAUO,EAAGvzB,EAAGizB,EAAQ3b,CAAC,CAAC,EAAIic,EAAGN,EAAQ3b,CAAC,EAAGtX,CAAC,EAEjD+tB,EAAG/2B,EAAGg3B,CAAI,IAEbyF,EAAO,KAAKnjC,CAAC,EACbkjC,EAAQ,KAAKx8B,CAAC,EAExB,CACA,CAEI,OAAA08B,EAAKzH,CAAO,EAAIwH,EAAO,OAGhBrvB,EAAE,mBAAmB,CAC1B,OAAQovB,EACR,MAAOC,EACP,IAAKC,EACL,KAAM,CAAC1H,EAAMC,CAAO,EACpB,SAAUqH,CAChB,CAAK,CACF,CACH,CAAC,ECrGGp8B,GAAO,gBACPic,GAAe,CAAC,QAAS,aAAa,EAC/BwgB,GAAqCzgB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAClF,GAAI,CACF,MAAAvT,EACA,YAAA0T,CACJ,EAAMH,EAoBJ,OAAO,SAAuBzQ,EAAGpE,EAAGzK,EAAUy9B,EAAS,CAErD,IAAIC,EAAU7uB,EAAE,QACZ8uB,EAAS9uB,EAAE,OACX+uB,EAAO/uB,EAAE,KACTgvB,EAAQhvB,EAAE,MACVivB,EAAMjvB,EAAE,UAGZ,GAAI,CAAC6uB,EACH,MAAM,IAAI,MAAM,oEAAoE,EAItF,IAAIjH,EAAOoH,EAAM,CAAC,EACdnH,EAAUmH,EAAM,CAAC,EAGjBE,EAEAC,EAAKh+B,EAGL,OAAO89B,GAAQ,WAEjBC,EAAKD,EAELrzB,EAAIsB,EAAM,QAAQtB,EAAGszB,CAAE,EAEvBC,EAAKjyB,EAAM,KAAK/L,EAAU,CAAC+9B,EAAIA,CAAE,CAAC,GAYpC,QARIM,EAAQ,CAAE,EAGV1jC,EAAI,CAAE,EAENwoB,EAAI,CAAE,EAGDlB,EAAI,EAAGA,EAAIyU,EAASzU,IAAK,CAIhC,QAFIqc,EAAOrc,EAAI,EAEN6X,EAAK8D,EAAK3b,CAAC,EAAG8X,EAAK6D,EAAK3b,EAAI,CAAC,EAAGF,EAAI+X,EAAI/X,EAAIgY,EAAIhY,IAAK,CAE5D,IAAIta,EAAIk2B,EAAO5b,CAAC,EAEhBpnB,EAAE8M,CAAC,EAAIi2B,EAAQ3b,CAAC,EAChBoB,EAAE1b,CAAC,EAAI62B,CACf,CAEM,QAASvjC,EAAI,EAAGA,EAAI07B,EAAM17B,IAEpBknB,IAAM,IAERoc,EAAMtjC,CAAC,EAAI,CAAE,GAGXooB,EAAEpoB,CAAC,IAAMujC,EAEXD,EAAMtjC,CAAC,EAAEknB,CAAC,EAAIwb,EAAUO,EAAGvzB,EAAG9P,EAAEI,CAAC,CAAC,EAAIijC,EAAGrjC,EAAEI,CAAC,EAAG0P,CAAC,EAGhD4zB,EAAMtjC,CAAC,EAAEknB,CAAC,EAAIwb,EAAUO,EAAGvzB,EAAG,CAAC,EAAIuzB,EAAG,EAAGvzB,CAAC,CAGpD,CAGI,OAAO,IAAIgV,EAAY,CACrB,KAAM4e,EACN,KAAM,CAAC5H,EAAMC,CAAO,EACpB,SAAUqH,CAChB,CAAK,CACF,CACH,CAAC,ECtGGp8B,GAAO,eACPic,GAAe,CAAC,OAAO,EAChB2gB,GAAoC5gB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACjF,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EAgBJ,OAAO,SAAsB9U,EAAGC,EAAGzK,EAAUy9B,EAAS,CAEpD,IAAIe,EAAQh0B,EAAE,MACVqzB,EAAQrzB,EAAE,MACVszB,EAAMtzB,EAAE,UAGRuzB,EAEAC,EAAKh+B,EAGL,OAAO89B,GAAQ,WAEjBC,EAAKD,EAELrzB,EAAIsB,EAAM,QAAQtB,EAAGszB,CAAE,EAEvBC,EAAKjyB,EAAM,KAAK/L,EAAU,CAAC+9B,EAAIA,CAAE,CAAC,GAIpC,IAAIM,EAAQR,EAAM,OAAS,EAAIY,EAAST,EAAI,EAAGH,EAAOA,EAAM,CAAC,EAAGW,EAAO/zB,EAAGgzB,CAAO,EAAI,CAAE,EAGvF,OAAOjzB,EAAE,kBAAkB,CACzB,KAAM6zB,EACN,KAAMl0B,GAAM0zB,CAAK,EACjB,SAAUE,CAChB,CAAK,CACF,EAGD,SAASU,EAAS3e,EAAG4e,EAAO7vB,EAAGtH,EAAGo3B,EAAIC,EAAInB,EAAS,CAEjD,IAAIoB,EAAK,CAAE,EAEX,GAAIH,IAAU7vB,EAAE,OAAS,EAEvB,QAAS9T,EAAI,EAAGA,EAAIwM,EAAGxM,IAErB8jC,EAAG9jC,CAAC,EAAI0iC,EAAU3d,EAAE8e,EAAID,EAAG5jC,CAAC,CAAC,EAAI+kB,EAAE6e,EAAG5jC,CAAC,EAAG6jC,CAAE,MAI9C,SAAS3c,EAAI,EAAGA,EAAI1a,EAAG0a,IAErB4c,EAAG5c,CAAC,EAAIwc,EAAS3e,EAAG4e,EAAQ,EAAG7vB,EAAGA,EAAE6vB,EAAQ,CAAC,EAAGC,EAAG1c,CAAC,EAAG2c,EAAInB,CAAO,EAGtE,OAAOoB,CACX,CACA,CAAC,ECzEGl9B,GAAO,gBACPic,GAAe,CAAC,OAAO,EAChBkhB,GAAqCnhB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAClF,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EAoBJ,OAAO,SAAuByf,EAAaC,EAAch/B,EAAUy9B,EAAS,CAE1E,IAAIe,EAAQO,EAAY,MACpBlB,EAAQkB,EAAY,MACpBjB,EAAMiB,EAAY,WAAaA,EAAY,YAAa,EAExDE,EAAUD,EAAa,QACvBE,EAASF,EAAa,OACtBG,EAAOH,EAAa,KACpBI,EAAQJ,EAAa,MACrBK,EAAML,EAAa,WAAaA,EAAa,QAAU,OAAYA,EAAa,UAAYA,EAAa,YAAa,EAG1H,GAAInB,EAAM,SAAWuB,EAAM,OACzB,MAAM,IAAIzO,GAAekN,EAAM,OAAQuB,EAAM,MAAM,EAIrD,GAAIvB,EAAM,CAAC,IAAMuB,EAAM,CAAC,GAAKvB,EAAM,CAAC,IAAMuB,EAAM,CAAC,EAC/C,MAAM,IAAI,WAAW,iCAAmCvB,EAAQ,0BAA4BuB,EAAQ,GAAG,EAIzG,GAAI,CAACH,EACH,MAAM,IAAI,MAAM,oEAAoE,EAItF,IAAIxI,EAAOoH,EAAM,CAAC,EACdnH,EAAUmH,EAAM,CAAC,EAGjBE,EAEAtF,EAAO,EAEPuF,EAAKh+B,EAGL,OAAO89B,GAAQ,UAAYA,IAAQuB,GAAOvB,IAAQ,UAEpDC,EAAKD,EAELrF,EAAO1sB,EAAM,QAAQ,EAAGgyB,CAAE,EAE1BC,EAAKjyB,EAAM,KAAK/L,EAAU,CAAC+9B,EAAIA,CAAE,CAAC,GAOpC,QAHIM,EAAQ,CAAE,EAGLpZ,EAAI,EAAGA,EAAIwR,EAAMxR,IAExBoZ,EAAMpZ,CAAC,EAAI,CAAE,EASf,QALItqB,EAAI,CAAE,EAENwoB,EAAI,CAAE,EAGDlB,EAAI,EAAGA,EAAIyU,EAASzU,IAAK,CAIhC,QAFIqc,EAAOrc,EAAI,EAEN6X,EAAKqF,EAAKld,CAAC,EAAG8X,EAAKoF,EAAKld,EAAI,CAAC,EAAGF,EAAI+X,EAAI/X,EAAIgY,EAAIhY,IAAK,CAE5D,IAAIhnB,EAAImkC,EAAOnd,CAAC,EAEhBpnB,EAAEI,CAAC,EAAI0iC,EAAUO,EAAGiB,EAAQld,CAAC,EAAGyc,EAAMzjC,CAAC,EAAEknB,CAAC,CAAC,EAAI+b,EAAGQ,EAAMzjC,CAAC,EAAEknB,CAAC,EAAGgd,EAAQld,CAAC,CAAC,EACzEoB,EAAEpoB,CAAC,EAAIujC,CACf,CAEM,QAAShhB,EAAI,EAAGA,EAAImZ,EAAMnZ,IAEpB6F,EAAE7F,CAAC,IAAMghB,EAEXD,EAAM/gB,CAAC,EAAE2E,CAAC,EAAItnB,EAAE2iB,CAAC,EAGjB+gB,EAAM/gB,CAAC,EAAE2E,CAAC,EAAIwb,EAAUO,EAAGvF,EAAM+F,EAAMlhB,CAAC,EAAE2E,CAAC,CAAC,EAAI+b,EAAGQ,EAAMlhB,CAAC,EAAE2E,CAAC,EAAGwW,CAAI,CAG9E,CAGI,OAAOsG,EAAY,kBAAkB,CACnC,KAAMV,EACN,KAAM,CAAC5H,EAAMC,CAAO,EACpB,SAAUoH,IAAQiB,EAAY,WAAaM,IAAQL,EAAa,UAAYjB,EAAK,MACvF,CAAK,CACF,CACH,CAAC,ECvHGp8B,GAAO,iBACPic,GAAe,CAAC,QAAS,aAAa,EAC/B0hB,GAAsC3hB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACnF,GAAI,CACF,MAAAvT,EACA,YAAAqsB,CACJ,EAAM9Y,EAmBJ,OAAO,SAAwB9U,EAAGC,EAAGzK,EAAU,CAE7C,IAAI09B,EAAUlzB,EAAE,QACZmzB,EAASnzB,EAAE,OACXozB,EAAOpzB,EAAE,KACTqzB,EAAQrzB,EAAE,MACVszB,EAAMtzB,EAAE,WAAaA,EAAE,QAAU,OAAYA,EAAE,UAAYA,EAAE,YAAa,EAE1Ey0B,EAAUx0B,EAAE,QACZy0B,EAASz0B,EAAE,OACX00B,EAAO10B,EAAE,KACT20B,EAAQ30B,EAAE,MACV40B,EAAM50B,EAAE,WAAaA,EAAE,QAAU,OAAYA,EAAE,UAAYA,EAAE,YAAa,EAG9E,GAAIozB,EAAM,SAAWuB,EAAM,OACzB,MAAM,IAAIzO,GAAekN,EAAM,OAAQuB,EAAM,MAAM,EAIrD,GAAIvB,EAAM,CAAC,IAAMuB,EAAM,CAAC,GAAKvB,EAAM,CAAC,IAAMuB,EAAM,CAAC,EAC/C,MAAM,IAAI,WAAW,iCAAmCvB,EAAQ,0BAA4BuB,EAAQ,GAAG,EAIzG,IAAI3I,EAAOoH,EAAM,CAAC,EACdnH,EAAUmH,EAAM,CAAC,EAGjBE,EAEAvF,EAAKJ,EAELK,EAAO,EAEPuF,EAAKh+B,EAGL,OAAO89B,GAAQ,UAAYA,IAAQuB,GAAOvB,IAAQ,UAEpDC,EAAKD,EAELtF,EAAKzsB,EAAM,KAAKqsB,EAAa,CAAC2F,EAAIA,CAAE,CAAC,EAErCtF,EAAO1sB,EAAM,QAAQ,EAAGgyB,CAAE,EAE1BC,EAAKjyB,EAAM,KAAK/L,EAAU,CAAC+9B,EAAIA,CAAE,CAAC,GAIpC,IAAIE,EAAUP,GAAWuB,EAAU,CAAE,EAAG,OACpCf,EAAS,CAAE,EACXC,EAAO,CAAE,EAGToB,EAAKtB,EAAU,GAAK,OACpBuB,EAAKvB,EAAU,GAAK,OAEpBwB,EAAK,CAAE,EACPC,EAAK,CAAE,EAGP3kC,EAAGknB,EAAGF,EAAGgY,EAGb,IAAK9X,EAAI,EAAGA,EAAIyU,EAASzU,IAAK,CAE5Bkc,EAAKlc,CAAC,EAAIic,EAAO,OAEjB,IAAII,EAAOrc,EAAI,EAEf,IAAKF,EAAI6b,EAAK3b,CAAC,EAAG8X,EAAK6D,EAAK3b,EAAI,CAAC,EAAGF,EAAIgY,EAAIhY,IAE1ChnB,EAAI4iC,EAAO5b,CAAC,EAEZmc,EAAO,KAAKnjC,CAAC,EAEb0kC,EAAG1kC,CAAC,EAAIujC,EAEJiB,IACFA,EAAGxkC,CAAC,EAAI2iC,EAAQ3b,CAAC,GAIrB,IAAKA,EAAIod,EAAKld,CAAC,EAAG8X,EAAKoF,EAAKld,EAAI,CAAC,EAAGF,EAAIgY,EAAIhY,IAE1ChnB,EAAImkC,EAAOnd,CAAC,EAER0d,EAAG1kC,CAAC,IAAMujC,GAEZJ,EAAO,KAAKnjC,CAAC,EAGf2kC,EAAG3kC,CAAC,EAAIujC,EAEJkB,IACFA,EAAGzkC,CAAC,EAAIkkC,EAAQld,CAAC,GAIrB,GAAIkc,EAIF,IAFAlc,EAAIoc,EAAKlc,CAAC,EAEHF,EAAImc,EAAO,QAAQ,CAExBnjC,EAAImjC,EAAOnc,CAAC,EAEZ,IAAI4d,EAAMF,EAAG1kC,CAAC,EACV6kC,GAAMF,EAAG3kC,CAAC,EAEd,GAAI4kC,IAAQrB,GAAQsB,KAAQtB,EAAM,CAEhC,IAAIuB,GAAKF,IAAQrB,EAAOiB,EAAGxkC,CAAC,EAAI09B,EAC5BqH,EAAKF,KAAQtB,EAAOkB,EAAGzkC,CAAC,EAAI09B,EAE5BsH,EAAK/B,EAAG6B,GAAIC,CAAE,EAEbtH,EAAGuH,EAAItH,CAAI,EAOdyF,EAAO,OAAOnc,EAAG,CAAC,GALlBkc,EAAQ,KAAK8B,CAAE,EAEfhe,IAKd,CACA,CAEA,CAEI,OAAAoc,EAAKzH,CAAO,EAAIwH,EAAO,OAGhB1zB,EAAE,mBAAmB,CAC1B,OAAQyzB,EACR,MAAOC,EACP,IAAKC,EACL,KAAM,CAAC1H,EAAMC,CAAO,EACpB,SAAUoH,IAAQtzB,EAAE,WAAa60B,IAAQ50B,EAAE,UAAYszB,EAAK,MAClE,CAAK,CACF,CACH,CAAC,ECxKGp8B,GAAO,eACPic,GAAe,CAAC,OAAO,EAChBoiB,GAAoCriB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACjF,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EAeJ,OAAO,SAAsB9U,EAAGC,EAAGzK,EAAU,CAE3C,IAAIw+B,EAAQh0B,EAAE,MACVqzB,EAAQrzB,EAAE,MACVszB,EAAMtzB,EAAE,UAERy1B,EAAQx1B,EAAE,MACV20B,EAAQ30B,EAAE,MACV40B,EAAM50B,EAAE,UAERy1B,EAAQ,CAAE,EAGd,GAAIrC,EAAM,SAAWuB,EAAM,OACzB,MAAM,IAAIzO,GAAekN,EAAM,OAAQuB,EAAM,MAAM,EAIrD,QAASvwB,EAAI,EAAGA,EAAIgvB,EAAM,OAAQhvB,IAAK,CAErC,GAAIgvB,EAAMhvB,CAAC,IAAMuwB,EAAMvwB,CAAC,EACtB,MAAM,IAAI,WAAW,iCAAmCgvB,EAAQ,0BAA4BuB,EAAQ,GAAG,EAGzGc,EAAMrxB,CAAC,EAAIgvB,EAAMhvB,CAAC,CACxB,CAGI,IAAIkvB,EAEAC,EAAKh+B,EAGL,OAAO89B,GAAQ,UAAYA,IAAQuB,IAErCtB,EAAKD,EAELE,EAAKjyB,EAAM,KAAK/L,EAAU,CAAC+9B,EAAIA,CAAE,CAAC,GAIpC,IAAIM,EAAQ6B,EAAM,OAAS,EAAIzB,EAAST,EAAI,EAAGkC,EAAOA,EAAM,CAAC,EAAG1B,EAAOyB,CAAK,EAAI,CAAE,EAGlF,OAAOz1B,EAAE,kBAAkB,CACzB,KAAM6zB,EACN,KAAM6B,EACN,SAAUnC,CAChB,CAAK,CACF,EAGD,SAASU,EAAS3e,EAAG4e,EAAO7vB,EAAGtH,EAAGo3B,EAAIC,EAAI,CAExC,IAAIC,EAAK,CAAE,EAEX,GAAIH,IAAU7vB,EAAE,OAAS,EAEvB,QAAS9T,EAAI,EAAGA,EAAIwM,EAAGxM,IAErB8jC,EAAG9jC,CAAC,EAAI+kB,EAAE6e,EAAG5jC,CAAC,EAAG6jC,EAAG7jC,CAAC,CAAC,MAIxB,SAASknB,EAAI,EAAGA,EAAI1a,EAAG0a,IAErB4c,EAAG5c,CAAC,EAAIwc,EAAS3e,EAAG4e,EAAQ,EAAG7vB,EAAGA,EAAE6vB,EAAQ,CAAC,EAAGC,EAAG1c,CAAC,EAAG2c,EAAG3c,CAAC,CAAC,EAGhE,OAAO4c,CACX,CACA,CAAC,EC3FGl9B,GAAO,YACPw+B,GAAe,CAAC,QAAQ,EACjBC,GAAiCziB,GAAQhc,GAAMw+B,GAAc7gB,GAAQ,CAC9E,GAAI,CACF,OAAAoU,CACJ,EAAMpU,EAUJ,OAAO,SAAU8O,EAAGwF,EAAG,CACrB,IAAIrF,EAAI,KAAK,IAAIH,EAAE,MAAM,OAAQwF,EAAE,MAAM,MAAM,EAC/C,GAAIxF,EAAE,MAAM,SAAWwF,EAAE,MAAM,QACzBxF,EAAE,MAAM,MAAM,CAAC6C,EAAKl2B,IAAMk2B,IAAQ2C,EAAE,MAAM74B,CAAC,CAAC,EAE9C,MAAO,CAACqzB,EAAGwF,CAAC,EAQhB,QALIyM,EAAQC,EAASlS,EAAE,MAAOG,EAAG,CAAC,EAC9BgS,EAAQD,EAAS1M,EAAE,MAAOrF,EAAG,CAAC,EAG9B0F,EAAU,CAAE,EACPhD,EAAM,EAAGA,EAAM1C,EAAG0C,IACzBgD,EAAQhD,CAAG,EAAI,KAAK,IAAIoP,EAAMpP,CAAG,EAAGsP,EAAMtP,CAAG,CAAC,EAIhDkD,GAAuBkM,EAAOpM,CAAO,EACrCE,GAAuBoM,EAAOtM,CAAO,EAGrC,IAAIuM,EAAKpS,EAAE,MAAO,EACdqS,EAAK7M,EAAE,MAAO,EACd4M,EAAG,MAAM,OAASjS,EACpBiS,EAAG,QAAQF,EAASE,EAAG,MAAOjS,EAAG,CAAC,CAAC,EAC1BkS,EAAG,MAAM,OAASlS,GAC3BkS,EAAG,QAAQH,EAASG,EAAG,MAAOlS,EAAG,CAAC,CAAC,EAIrC,QAASmS,EAAO,EAAGA,EAAOnS,EAAGmS,IACvBF,EAAG,MAAME,CAAI,EAAIzM,EAAQyM,CAAI,IAC/BF,EAAKG,EAASH,EAAIvM,EAAQyM,CAAI,EAAGA,CAAI,GAEnCD,EAAG,MAAMC,CAAI,EAAIzM,EAAQyM,CAAI,IAC/BD,EAAKE,EAASF,EAAIxM,EAAQyM,CAAI,EAAGA,CAAI,GAKzC,MAAO,CAACF,EAAIC,CAAE,CACf,EACD,SAASH,EAASM,EAAOrS,EAAGsS,EAAQ,CAElC,MAAO,CAAC,GAAG,MAAMtS,EAAIqS,EAAM,MAAM,EAAE,KAAKC,CAAM,EAAG,GAAGD,CAAK,CAC7D,CACE,SAASD,EAASjM,EAAgBC,EAAeC,EAAc,CAE7D,OAAOlB,EAAO,GAAG,MAAMiB,CAAa,EAAE,KAAKD,CAAc,EAAGE,CAAY,CAC5E,CACA,CAAC,EC/DGjzB,GAAO,uBACPic,GAAe,CAAC,QAAS,SAAU,QAAQ,EACpCkjB,GAA4CnjB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACzF,GAAI,CACF,MAAAvT,EACA,OAAAkU,EACA,OAAAyT,CACJ,EAAMpU,EACAyhB,EAAef,GAAmB,CACpC,MAAAj0B,CACJ,CAAG,EACGi1B,EAAezC,GAAmB,CACpC,MAAAxyB,CACJ,CAAG,EACGk1B,EAAYb,GAAgB,CAC9B,OAAA1M,CACJ,CAAG,EAmBD,OAAO,SAA8Bx5B,EAAS,CAC5C,IAAIgnC,EAAOhnC,EAAQ,KACfinC,EAAKjnC,EAAQ,IAAMA,EAAQ,GAC3BknC,EACAF,GAEFE,EAAmB,CACjB,2BAA4B,CAACzmC,EAAG2iB,IAAMyjB,EAAa,GAAGE,EAAUtmC,EAAG2iB,CAAC,EAAG4jB,CAAI,EAC3E,eAAgB,CAACvmC,EAAG2iB,IAAMyjB,EAAa,GAAGE,EAAUhhB,EAAOtlB,CAAC,EAAGslB,EAAO3C,CAAC,CAAC,EAAG4jB,CAAI,EAAE,QAAS,EAC1F,qBAAsB,CAACvmC,EAAG2iB,IAAMyjB,EAAa,GAAGE,EAAUhhB,EAAOtlB,CAAC,EAAG2iB,CAAC,EAAG4jB,CAAI,EAC7E,qBAAsB,CAACvmC,EAAG2iB,IAAMyjB,EAAa,GAAGE,EAAUtmC,EAAGslB,EAAO3C,CAAC,CAAC,EAAG4jB,CAAI,CAC9E,EAEGhnC,EAAQ,KACVknC,EAAiB,4BAA4B,EAAI,CAACzmC,EAAG2iB,IAAMpjB,EAAQ,GAAG,GAAG+mC,EAAUtmC,EAAG2iB,CAAC,EAAG4jB,EAAM,EAAK,GAEnGhnC,EAAQ,KACVknC,EAAiB,2BAA2B,EAAI,CAACzmC,EAAG2iB,IAAMpjB,EAAQ,GAAG,GAAG+mC,EAAUtmC,EAAG2iB,CAAC,EAAG4jB,EAAM,EAAK,EACpGE,EAAiB,qBAAqB,EAAI,CAACzmC,EAAG2iB,IAAMpjB,EAAQ,GAAG,GAAG+mC,EAAUhhB,EAAOtlB,CAAC,EAAG2iB,CAAC,EAAG4jB,EAAM,EAAK,GAEpGC,IACFC,EAAiB,2BAA2B,EAAI,CAACzmC,EAAG2iB,IAAM6jB,EAAG,GAAGF,EAAU3jB,EAAG3iB,CAAC,EAAGumC,EAAM,EAAI,EAC3FE,EAAiB,qBAAqB,EAAI,CAACzmC,EAAG2iB,IAAM6jB,EAAG,GAAGF,EAAUhhB,EAAO3C,CAAC,EAAG3iB,CAAC,EAAGumC,EAAM,EAAI,KAK/FE,EAAmB,CACjB,2BAA4Br1B,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IACjDyjB,EAAa,GAAGE,EAAUtmC,EAAG2iB,CAAC,EAAGtjB,CAAI,CAC7C,EACD,eAAgB+R,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IACrCyjB,EAAa,GAAGE,EAAUhhB,EAAOtlB,CAAC,EAAGslB,EAAO3C,CAAC,CAAC,EAAGtjB,CAAI,EAAE,QAAS,CACxE,EACD,qBAAsB+R,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IAC3CyjB,EAAa,GAAGE,EAAUhhB,EAAOtlB,CAAC,EAAG2iB,CAAC,EAAGtjB,CAAI,CACrD,EACD,qBAAsB+R,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IAC3CyjB,EAAa,GAAGE,EAAUtmC,EAAGslB,EAAO3C,CAAC,CAAC,EAAGtjB,CAAI,CACrD,CACF,EAEGE,EAAQ,KACVknC,EAAiB,4BAA4B,EAAIr1B,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IACtEpjB,EAAQ,GAAG,GAAG+mC,EAAUtmC,EAAG2iB,CAAC,EAAGtjB,EAAM,EAAK,CAClD,GAECE,EAAQ,KACVknC,EAAiB,2BAA2B,EAAIr1B,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IACrEpjB,EAAQ,GAAG,GAAG+mC,EAAUtmC,EAAG2iB,CAAC,EAAGtjB,EAAM,EAAK,CAClD,EACDonC,EAAiB,qBAAqB,EAAIr1B,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IAC/DpjB,EAAQ,GAAG,GAAG+mC,EAAUhhB,EAAOtlB,CAAC,EAAG2iB,CAAC,EAAGtjB,EAAM,EAAK,CAC1D,GAECmnC,IACFC,EAAiB,2BAA2B,EAAIr1B,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IACrE6jB,EAAG,GAAGF,EAAU3jB,EAAG3iB,CAAC,EAAGX,EAAM,EAAI,CACzC,EACDonC,EAAiB,qBAAqB,EAAIr1B,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IAC/D6jB,EAAG,GAAGF,EAAUhhB,EAAO3C,CAAC,EAAG3iB,CAAC,EAAGX,EAAM,EAAI,CACjD,IAKL,IAAIqnC,EAASnnC,EAAQ,QAAU,MAC3BonC,EAAKpnC,EAAQ,IAAMA,EAAQ,GAC3BonC,IACEJ,GACFE,EAAiB,eAAiBC,CAAM,EAAI,CAAC1mC,EAAG2iB,IAAM0jB,EAAarmC,EAAG2iB,EAAG4jB,EAAM,EAAK,EACpFE,EAAiBC,EAAS,eAAe,EAAI,CAAC1mC,EAAG2iB,IAAM0jB,EAAa1jB,EAAG3iB,EAAGumC,EAAM,EAAI,EACpFE,EAAiB,SAAWC,CAAM,EAAI,CAAC1mC,EAAG2iB,IAAM0jB,EAAa/gB,EAAOtlB,CAAC,EAAG2iB,EAAG4jB,EAAM,EAAK,EAAE,QAAS,EACjGE,EAAiBC,EAAS,SAAS,EAAI,CAAC1mC,EAAG2iB,IAAM0jB,EAAa/gB,EAAO3C,CAAC,EAAG3iB,EAAGumC,EAAM,EAAI,EAAE,QAAS,IAEjGE,EAAiB,eAAiBC,CAAM,EAAIt1B,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IACjE0jB,EAAarmC,EAAG2iB,EAAGtjB,EAAM,EAAK,CACtC,EACDonC,EAAiBC,EAAS,eAAe,EAAIt1B,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IAClE0jB,EAAa1jB,EAAG3iB,EAAGX,EAAM,EAAI,CACrC,EACDonC,EAAiB,SAAWC,CAAM,EAAIt1B,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IAC3D0jB,EAAa/gB,EAAOtlB,CAAC,EAAG2iB,EAAGtjB,EAAM,EAAK,EAAE,QAAS,CACzD,EACDonC,EAAiBC,EAAS,SAAS,EAAIt1B,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IAC5D0jB,EAAa/gB,EAAO3C,CAAC,EAAG3iB,EAAGX,EAAM,EAAI,EAAE,QAAS,CACxD,IAGL,IAAIunC,EAAKrnC,EAAQ,KAAO,OAAYA,EAAQ,GAAKA,EAAQ,GACzD,OAAIgnC,GACEhnC,EAAQ,KACVknC,EAAiB,gBAAkBC,CAAM,EAAI,CAAC1mC,EAAG2iB,IAAMpjB,EAAQ,GAAGS,EAAG2iB,EAAG4jB,EAAM,EAAK,GAEjFK,IACFH,EAAiBC,EAAS,gBAAgB,EAAI,CAAC1mC,EAAG2iB,IAAMikB,EAAGjkB,EAAG3iB,EAAGumC,EAAM,EAAI,KAGzEhnC,EAAQ,KACVknC,EAAiB,gBAAkBC,CAAM,EAAIt1B,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IAClEpjB,EAAQ,GAAGS,EAAG2iB,EAAGtjB,EAAM,EAAK,CACpC,GAECunC,IACFH,EAAiBC,EAAS,gBAAgB,EAAIt1B,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IACnEikB,EAAGjkB,EAAG3iB,EAAGX,EAAM,EAAI,CAC3B,IAIDknC,GAAQA,EAAK,YACf32B,GAAO62B,EAAkBF,EAAK,UAAU,EAEnCE,CACR,CACH,CAAC,ECzJGz/B,GAAO,iBACPic,GAAe,CAAC,OAAO,EAChB4jB,GAAsC7jB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACnF,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EAoBJ,OAAO,SAAoByf,EAAaC,EAAch/B,EAAUy9B,EAAS,CAEvE,IAAIe,EAAQO,EAAY,MACpBlB,EAAQkB,EAAY,MACpBjB,EAAMiB,EAAY,WAAaA,EAAY,YAAa,EAExDE,EAAUD,EAAa,QACvBE,EAASF,EAAa,OACtBG,EAAOH,EAAa,KACpBI,EAAQJ,EAAa,MACrBK,EAAML,EAAa,WAAaA,EAAa,QAAU,OAAYA,EAAa,UAAYA,EAAa,YAAa,EAG1H,GAAInB,EAAM,SAAWuB,EAAM,OACzB,MAAM,IAAIzO,GAAekN,EAAM,OAAQuB,EAAM,MAAM,EAIrD,GAAIvB,EAAM,CAAC,IAAMuB,EAAM,CAAC,GAAKvB,EAAM,CAAC,IAAMuB,EAAM,CAAC,EAC/C,MAAM,IAAI,WAAW,iCAAmCvB,EAAQ,0BAA4BuB,EAAQ,GAAG,EAIzG,GAAI,CAACH,EACH,MAAM,IAAI,MAAM,oEAAoE,EAItF,IAAIxI,EAAOoH,EAAM,CAAC,EACdnH,EAAUmH,EAAM,CAAC,EAGjBE,EAAK,OAAOD,GAAQ,UAAYA,IAAQ,SAAWA,IAAQuB,EAAMvB,EAAM,OAEvEE,EAAKD,EAAKhyB,EAAM,KAAK/L,EAAU,CAAC+9B,EAAIA,CAAE,CAAC,EAAI/9B,EAG3CjF,EAAGknB,EAGHoc,EAAQ,CAAE,EAEd,IAAKtjC,EAAI,EAAGA,EAAI07B,EAAM17B,IACpBsjC,EAAMtjC,CAAC,EAAI,CAAE,EAIf,IAAIJ,EAAI,CAAE,EAENwoB,EAAI,CAAE,EAGV,IAAKlB,EAAI,EAAGA,EAAIyU,EAASzU,IAAK,CAI5B,QAFIqc,EAAOrc,EAAI,EAEN6X,EAAKqF,EAAKld,CAAC,EAAG8X,EAAKoF,EAAKld,EAAI,CAAC,EAAGF,EAAI+X,EAAI/X,EAAIgY,EAAIhY,IAEvDhnB,EAAImkC,EAAOnd,CAAC,EAEZpnB,EAAEI,CAAC,EAAI0iC,EAAUO,EAAGiB,EAAQld,CAAC,EAAGyc,EAAMzjC,CAAC,EAAEknB,CAAC,CAAC,EAAI+b,EAAGQ,EAAMzjC,CAAC,EAAEknB,CAAC,EAAGgd,EAAQld,CAAC,CAAC,EAEzEoB,EAAEpoB,CAAC,EAAIujC,EAGT,IAAKvjC,EAAI,EAAGA,EAAI07B,EAAM17B,IAEhBooB,EAAEpoB,CAAC,IAAMujC,EAEXD,EAAMtjC,CAAC,EAAEknB,CAAC,EAAItnB,EAAEI,CAAC,EAGjBsjC,EAAMtjC,CAAC,EAAEknB,CAAC,EAAIuc,EAAMzjC,CAAC,EAAEknB,CAAC,CAGlC,CAGI,OAAO8c,EAAY,kBAAkB,CACnC,KAAMV,EACN,KAAM,CAAC5H,EAAMC,CAAO,EACpB,SAAUoH,IAAQiB,EAAY,WAAaM,IAAQL,EAAa,UAAYjB,EAAK,MACvF,CAAK,CACF,CACH,CAAC,EC7GGp8B,GAAO,mBACPic,GAAe,CAAC,QAAS,aAAa,EAC/B6jB,GAAwC9jB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACrF,GAAI,CACF,MAAAvT,EACA,YAAAqsB,CACJ,EAAM9Y,EAmBJ,OAAO,SAA0B9U,EAAGC,EAAGzK,EAAU,CAE/C,IAAI09B,EAAUlzB,EAAE,QACZmzB,EAASnzB,EAAE,OACXozB,EAAOpzB,EAAE,KACTqzB,EAAQrzB,EAAE,MACVszB,EAAMtzB,EAAE,WAAaA,EAAE,QAAU,OAAYA,EAAE,UAAYA,EAAE,YAAa,EAE1Ey0B,EAAUx0B,EAAE,QACZy0B,EAASz0B,EAAE,OACX00B,EAAO10B,EAAE,KACT20B,EAAQ30B,EAAE,MACV40B,EAAM50B,EAAE,WAAaA,EAAE,QAAU,OAAYA,EAAE,UAAYA,EAAE,YAAa,EAG9E,GAAIozB,EAAM,SAAWuB,EAAM,OACzB,MAAM,IAAIzO,GAAekN,EAAM,OAAQuB,EAAM,MAAM,EAIrD,GAAIvB,EAAM,CAAC,IAAMuB,EAAM,CAAC,GAAKvB,EAAM,CAAC,IAAMuB,EAAM,CAAC,EAC/C,MAAM,IAAI,WAAW,iCAAmCvB,EAAQ,0BAA4BuB,EAAQ,GAAG,EAIzG,IAAI3I,EAAOoH,EAAM,CAAC,EACdnH,EAAUmH,EAAM,CAAC,EAGjBE,EAEAvF,EAAKJ,EAELK,EAAO,EAEPuF,EAAKh+B,EAGL,OAAO89B,GAAQ,UAAYA,IAAQuB,GAAOvB,IAAQ,UAEpDC,EAAKD,EAELtF,EAAKzsB,EAAM,KAAKqsB,EAAa,CAAC2F,EAAIA,CAAE,CAAC,EAErCtF,EAAO1sB,EAAM,QAAQ,EAAGgyB,CAAE,EAE1BC,EAAKjyB,EAAM,KAAK/L,EAAU,CAAC+9B,EAAIA,CAAE,CAAC,GAIpC,IAAIE,EAAUP,GAAWuB,EAAU,CAAE,EAAG,OACpCf,EAAS,CAAE,EACXC,EAAO,CAAE,EAGToB,EAAK7B,GAAWuB,EAAU,CAAE,EAAG,OAC/BO,EAAK9B,GAAWuB,EAAU,CAAE,EAAG,OAE/BQ,EAAK,CAAE,EACPC,EAAK,CAAE,EAGP3kC,EAAGknB,EAAGF,EAAG+X,EAAIC,EAGjB,IAAK9X,EAAI,EAAGA,EAAIyU,EAASzU,IAAK,CAE5Bkc,EAAKlc,CAAC,EAAIic,EAAO,OAEjB,IAAII,EAAOrc,EAAI,EAEf,IAAK6X,EAAK8D,EAAK3b,CAAC,EAAG8X,EAAK6D,EAAK3b,EAAI,CAAC,EAAGF,EAAI+X,EAAI/X,EAAIgY,EAAIhY,IAEnDhnB,EAAI4iC,EAAO5b,CAAC,EAEZmc,EAAO,KAAKnjC,CAAC,EAEb0kC,EAAG1kC,CAAC,EAAIujC,EAEJiB,IACFA,EAAGxkC,CAAC,EAAI2iC,EAAQ3b,CAAC,GAIrB,IAAK+X,EAAKqF,EAAKld,CAAC,EAAG8X,EAAKoF,EAAKld,EAAI,CAAC,EAAGF,EAAI+X,EAAI/X,EAAIgY,EAAIhY,IAInD,GAFAhnB,EAAImkC,EAAOnd,CAAC,EAER0d,EAAG1kC,CAAC,IAAMujC,GAEZ,GAAIiB,EAAI,CAEN,IAAI99B,GAAIu8B,EAAGuB,EAAGxkC,CAAC,EAAGkkC,EAAQld,CAAC,CAAC,EAEvByW,EAAG/2B,GAAGg3B,CAAI,EAKbgH,EAAG1kC,CAAC,EAAI,KAHRwkC,EAAGxkC,CAAC,EAAI0G,EAKtB,OAGUy8B,EAAO,KAAKnjC,CAAC,EAEb2kC,EAAG3kC,CAAC,EAAIujC,EAEJkB,IACFA,EAAGzkC,CAAC,EAAIkkC,EAAQld,CAAC,GAKvB,GAAIwd,GAAMC,EAIR,IAFAzd,EAAIoc,EAAKlc,CAAC,EAEHF,EAAImc,EAAO,QAEhBnjC,EAAImjC,EAAOnc,CAAC,EAER0d,EAAG1kC,CAAC,IAAMujC,GAEZL,EAAQlc,CAAC,EAAIwd,EAAGxkC,CAAC,EAEjBgnB,KACS2d,EAAG3kC,CAAC,IAAMujC,GAEnBL,EAAQlc,CAAC,EAAIyd,EAAGzkC,CAAC,EAEjBgnB,KAGAmc,EAAO,OAAOnc,EAAG,CAAC,CAI9B,CAEI,OAAAoc,EAAKzH,CAAO,EAAIwH,EAAO,OAGhB1zB,EAAE,mBAAmB,CAC1B,OAAQyzB,EACR,MAAOC,EACP,IAAKC,EACL,KAAM,CAAC1H,EAAMC,CAAO,EACpB,SAAUoH,IAAQtzB,EAAE,WAAa60B,IAAQ50B,EAAE,UAAYszB,EAAK,MAClE,CAAK,CACF,CACH,CAAC,ECjLGp8B,GAAO,iBACPic,GAAe,CAAC,QAAS,aAAa,EAC/B8jB,GAAsC/jB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACnF,GAAI,CACF,MAAAvT,EACA,YAAA0T,CACJ,EAAMH,EAoBJ,OAAO,SAAwBzQ,EAAGpE,EAAGzK,EAAUy9B,EAAS,CAEtD,IAAIC,EAAU7uB,EAAE,QACZ8uB,EAAS9uB,EAAE,OACX+uB,EAAO/uB,EAAE,KACTgvB,EAAQhvB,EAAE,MACVivB,EAAMjvB,EAAE,UAGZ,GAAI,CAAC6uB,EACH,MAAM,IAAI,MAAM,oEAAoE,EAItF,IAAIjH,EAAOoH,EAAM,CAAC,EACdnH,EAAUmH,EAAM,CAAC,EAGjBE,EAEAC,EAAKh+B,EAGL,OAAO89B,GAAQ,WAEjBC,EAAKD,EAELrzB,EAAIsB,EAAM,QAAQtB,EAAGszB,CAAE,EAEvBC,EAAKjyB,EAAM,KAAK/L,EAAU,CAAC+9B,EAAIA,CAAE,CAAC,GAYpC,QARIM,EAAQ,CAAE,EAGV1jC,EAAI,CAAE,EAENwoB,EAAI,CAAE,EAGDlB,EAAI,EAAGA,EAAIyU,EAASzU,IAAK,CAIhC,QAFIqc,EAAOrc,EAAI,EAEN6X,EAAK8D,EAAK3b,CAAC,EAAG8X,EAAK6D,EAAK3b,EAAI,CAAC,EAAGF,EAAI+X,EAAI/X,EAAIgY,EAAIhY,IAAK,CAE5D,IAAIta,EAAIk2B,EAAO5b,CAAC,EAEhBpnB,EAAE8M,CAAC,EAAIi2B,EAAQ3b,CAAC,EAChBoB,EAAE1b,CAAC,EAAI62B,CACf,CAEM,QAASvjC,EAAI,EAAGA,EAAI07B,EAAM17B,IAEpBknB,IAAM,IAERoc,EAAMtjC,CAAC,EAAI,CAAE,GAGXooB,EAAEpoB,CAAC,IAAMujC,EAEXD,EAAMtjC,CAAC,EAAEknB,CAAC,EAAIwb,EAAUO,EAAGvzB,EAAG9P,EAAEI,CAAC,CAAC,EAAIijC,EAAGrjC,EAAEI,CAAC,EAAG0P,CAAC,EAGhD4zB,EAAMtjC,CAAC,EAAEknB,CAAC,EAAIxX,CAGxB,CAGI,OAAO,IAAIgV,EAAY,CACrB,KAAM4e,EACN,KAAM,CAAC5H,EAAMC,CAAO,EACpB,SAAUqH,CAChB,CAAK,CACF,CACH,CAAC,ECtGGp8B,GAAO,iBACPic,GAAe,CAAC,OAAO,EAChB+jB,GAAsChkB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACnF,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EAaJ,OAAOvT,EAAM,iBAAkB,CAC7B,iBAAkBsrB,GAClB,mBAAoB,SAAwB18B,EAAG2iB,EAAG,CAChD,OAAO3iB,EAAE,IAAI2iB,CAAC,CACf,EACD,uBAAwB,SAA4B3iB,EAAG2iB,EAAG,CACxD,OAAO3iB,EAAE,MAAM2iB,CAAC,CACjB,EACD,qBAAsB,SAA0B3iB,EAAG2iB,EAAG,CACpD,OAAO3iB,EAAE,IAAI2iB,CAAC,CACf,EACD,gDAAiD,CAAC3iB,EAAG2iB,IAAMA,EAAE,SAAS3iB,CAAC,EACvE,uDAAwD,CAACA,EAAG2iB,IAAM3iB,EAAE,SAAS2iB,CAAC,CAClF,CAAG,CACH,CAAC,EC7BG3b,GAAO,WACPic,GAAe,CAAC,QAAS,SAAU,YAAa,iBAAkB,cAAe,KAAK,EAC/EgkB,GAAgCjkB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC7E,GAAI,CACF,MAAAvT,EACA,OAAAkU,EACA,UAAA4hB,EACA,eAAAC,EACA,YAAA1J,EACA,IAAAjc,CACJ,EAAMmD,EACAyiB,EAAgBvE,GAAoB,CACtC,MAAAzxB,EACA,YAAAqsB,CACJ,CAAG,EACG4I,EAAezC,GAAmB,CACpC,MAAAxyB,CACJ,CAAG,EACD,SAASi2B,EAA0BC,EAAOC,EAAO,CAE/C,OAAQD,EAAM,OAAM,CAClB,IAAK,GAEH,OAAQC,EAAM,OAAM,CAClB,IAAK,GAEH,GAAID,EAAM,CAAC,IAAMC,EAAM,CAAC,EAEtB,MAAM,IAAI,WAAW,yEAAyE,EAEhG,MACF,IAAK,GAEH,GAAID,EAAM,CAAC,IAAMC,EAAM,CAAC,EAEtB,MAAM,IAAI,WAAW,wDAA0DD,EAAM,CAAC,EAAI,6BAA+BC,EAAM,CAAC,EAAI,GAAG,EAEzI,MACF,QACE,MAAM,IAAI,MAAM,+DAAiEA,EAAM,OAAS,cAAc,CAC1H,CACQ,MACF,IAAK,GAEH,OAAQA,EAAM,OAAM,CAClB,IAAK,GAEH,GAAID,EAAM,CAAC,IAAMC,EAAM,CAAC,EAEtB,MAAM,IAAI,WAAW,yDAA2DD,EAAM,CAAC,EAAI,+BAAiCC,EAAM,CAAC,EAAI,GAAG,EAE5I,MACF,IAAK,GAEH,GAAID,EAAM,CAAC,IAAMC,EAAM,CAAC,EAEtB,MAAM,IAAI,WAAW,2DAA6DD,EAAM,CAAC,EAAI,+BAAiCC,EAAM,CAAC,EAAI,GAAG,EAE9I,MACF,QACE,MAAM,IAAI,MAAM,+DAAiEA,EAAM,OAAS,cAAc,CAC1H,CACQ,MACF,QACE,MAAM,IAAI,MAAM,+DAAiED,EAAM,OAAS,cAAc,CACtH,CACA,CAUE,SAASE,EAAsB33B,EAAG,EAAGjD,EAAG,CAEtC,GAAIA,IAAM,EACR,MAAM,IAAI,MAAM,mCAAmC,EAErD,OAAO4U,EAAI3R,EAAG,CAAC,CACnB,CAUE,SAAS43B,EAAsB53B,EAAG,EAAG,CAEnC,GAAI,EAAE,QAAS,IAAK,QAClB,MAAM,IAAI,MAAM,0CAA0C,EAE5D,OAAO63B,EAA2B73B,EAAG,CAAC,CAC1C,CAUE,SAAS63B,EAA2B73B,EAAG,EAAG,CAExC,IAAIg0B,EAAQh0B,EAAE,MACVqzB,EAAQrzB,EAAE,MACVszB,EAAMtzB,EAAE,WAAaA,EAAE,YAAa,EAEpCy1B,EAAQ,EAAE,MACVb,EAAQ,EAAE,MACVC,EAAM,EAAE,WAAa,EAAE,YAAa,EAEpCiD,EAAUzE,EAAM,CAAC,EACjB0E,EAAWnD,EAAM,CAAC,EAGlBrB,EAEAyE,EAAKX,EAELY,EAAKX,EAGLhE,GAAOuB,GAAOvB,IAAQuB,GAAO,OAAOvB,GAAQ,UAAYA,IAAQ,UAElEC,EAAKD,EAEL0E,EAAKz2B,EAAM,KAAK81B,EAAW,CAAC9D,EAAIA,CAAE,CAAC,EACnC0E,EAAK12B,EAAM,KAAK+1B,EAAgB,CAAC/D,EAAIA,CAAE,CAAC,GAO1C,QAHIhrB,EAAI,CAAE,EAGDkP,EAAI,EAAGA,EAAIsgB,EAAUtgB,IAAK,CAIjC,QAFI4G,GAAM4Z,EAAGjE,EAAM,CAAC,EAAGyB,EAAM,CAAC,EAAEhe,CAAC,CAAC,EAEzBlnB,GAAI,EAAGA,GAAIunC,EAASvnC,KAE3B8tB,GAAM2Z,EAAG3Z,GAAK4Z,EAAGjE,EAAMzjC,EAAC,EAAGklC,EAAMllC,EAAC,EAAEknB,CAAC,CAAC,CAAC,EAEzClP,EAAEkP,CAAC,EAAI4G,EACb,CAGI,OAAOre,EAAE,kBAAkB,CACzB,KAAMuI,EACN,KAAM,CAACwvB,CAAQ,EACf,SAAUzE,IAAQtzB,EAAE,WAAa60B,IAAQ,EAAE,UAAYtB,EAAK,MAClE,CAAK,CACL,CAUE,IAAI2E,EAAwB32B,EAAM,wBAAyB,CACzD,mBAAoB42B,EACpB,oBAAqBC,CACzB,CAAG,EAUGC,EAAwB92B,EAAM,wBAAyB,CACzD,2BAA4B+2B,EAC5B,4BAA6BC,EAC7B,4BAA6BC,EAC7B,6BAA8BC,CAClC,CAAG,EAUD,SAASN,EAA2Bn4B,EAAG,EAAG,CAExC,IAAIg0B,EAAQh0B,EAAE,MACVqzB,EAAQrzB,EAAE,MACVszB,EAAMtzB,EAAE,WAAaA,EAAE,YAAa,EAEpCy1B,EAAQ,EAAE,MACVZ,EAAM,EAAE,WAAa,EAAE,YAAa,EAEpC6D,EAAQrF,EAAM,CAAC,EACfsF,EAAWtF,EAAM,CAAC,EAGlBE,EAEAyE,EAAKX,EAELY,EAAKX,EAGLhE,GAAOuB,GAAOvB,IAAQuB,GAAO,OAAOvB,GAAQ,UAAYA,IAAQ,UAElEC,EAAKD,EAEL0E,EAAKz2B,EAAM,KAAK81B,EAAW,CAAC9D,EAAIA,CAAE,CAAC,EACnC0E,EAAK12B,EAAM,KAAK+1B,EAAgB,CAAC/D,EAAIA,CAAE,CAAC,GAO1C,QAHIhrB,EAAI,CAAE,EAGDhY,EAAI,EAAGA,EAAImoC,EAAOnoC,IAAK,CAM9B,QAJIo7B,EAAMqI,EAAMzjC,CAAC,EAEb8tB,GAAM4Z,EAAGtM,EAAI,CAAC,EAAG8J,EAAM,CAAC,CAAC,EAEpBhe,GAAI,EAAGA,GAAIkhB,EAAUlhB,KAE5B4G,GAAM2Z,EAAG3Z,GAAK4Z,EAAGtM,EAAIlU,EAAC,EAAGge,EAAMhe,EAAC,CAAC,CAAC,EAEpClP,EAAEhY,CAAC,EAAI8tB,EACb,CAGI,OAAOre,EAAE,kBAAkB,CACzB,KAAMuI,EACN,KAAM,CAACmwB,CAAK,EACZ,SAAUpF,IAAQtzB,EAAE,WAAa60B,IAAQ,EAAE,UAAYtB,EAAK,MAClE,CAAK,CACL,CAUE,SAAS+E,EAAgCt4B,EAAG,EAAG,CAG7C,IAAIg0B,EAAQh0B,EAAE,MACVqzB,EAAQrzB,EAAE,MACVszB,EAAMtzB,EAAE,WAAaA,EAAE,YAAa,EAEpCy1B,EAAQ,EAAE,MACVb,EAAQ,EAAE,MACVC,EAAM,EAAE,WAAa,EAAE,YAAa,EAEpC6D,EAAQrF,EAAM,CAAC,EACfsF,EAAWtF,EAAM,CAAC,EAClB0E,EAAWnD,EAAM,CAAC,EAGlBrB,EAEAyE,EAAKX,EAELY,EAAKX,EAGLhE,GAAOuB,GAAOvB,IAAQuB,GAAO,OAAOvB,GAAQ,UAAYA,IAAQ,SAAWA,IAAQ,UAErFC,EAAKD,EAEL0E,EAAKz2B,EAAM,KAAK81B,EAAW,CAAC9D,EAAIA,CAAE,CAAC,EACnC0E,EAAK12B,EAAM,KAAK+1B,EAAgB,CAAC/D,EAAIA,CAAE,CAAC,GAO1C,QAHIhrB,EAAI,CAAE,EAGDhY,GAAI,EAAGA,GAAImoC,EAAOnoC,KAAK,CAE9B,IAAIo7B,GAAMqI,EAAMzjC,EAAC,EAEjBgY,EAAEhY,EAAC,EAAI,CAAE,EAET,QAASknB,EAAI,EAAGA,EAAIsgB,EAAUtgB,IAAK,CAIjC,QAFI4G,EAAM4Z,EAAGtM,GAAI,CAAC,EAAG8J,EAAM,CAAC,EAAEhe,CAAC,CAAC,EAEvBtnB,EAAI,EAAGA,EAAIwoC,EAAUxoC,IAE5BkuB,EAAM2Z,EAAG3Z,EAAK4Z,EAAGtM,GAAIx7B,CAAC,EAAGslC,EAAMtlC,CAAC,EAAEsnB,CAAC,CAAC,CAAC,EAEvClP,EAAEhY,EAAC,EAAEknB,CAAC,EAAI4G,CAClB,CACA,CAGI,OAAOre,EAAE,kBAAkB,CACzB,KAAMuI,EACN,KAAM,CAACmwB,EAAOX,CAAQ,EACtB,SAAUzE,IAAQtzB,EAAE,WAAa60B,IAAQ,EAAE,UAAYtB,EAAK,MAClE,CAAK,CACL,CAUE,SAASgF,EAAiCv4B,EAAG,EAAG,CAE9C,IAAIg0B,EAAQh0B,EAAE,MACVqzB,EAAQrzB,EAAE,MACVszB,EAAMtzB,EAAE,WAAaA,EAAE,YAAa,EAEpCy0B,EAAU,EAAE,QACZC,EAAS,EAAE,OACXC,EAAO,EAAE,KACTC,EAAQ,EAAE,MACVC,EAAM,EAAE,WAAa,EAAE,QAAU,OAAY,EAAE,UAAY,EAAE,YAAa,EAE9E,GAAI,CAACJ,EACH,MAAM,IAAI,MAAM,wDAAwD,EAG1E,IAAIiE,EAAQrF,EAAM,CAAC,EACf0E,EAAWnD,EAAM,CAAC,EAGlBrB,EAEAyE,EAAKX,EAELY,EAAKX,EAELtJ,GAAKJ,EAELK,GAAO,EAGPqF,GAAOuB,GAAOvB,IAAQuB,GAAO,OAAOvB,GAAQ,UAAYA,IAAQ,UAElEC,EAAKD,EAEL0E,EAAKz2B,EAAM,KAAK81B,EAAW,CAAC9D,EAAIA,CAAE,CAAC,EACnC0E,EAAK12B,EAAM,KAAK+1B,EAAgB,CAAC/D,EAAIA,CAAE,CAAC,EACxCvF,GAAKzsB,EAAM,KAAKqsB,EAAa,CAAC2F,EAAIA,CAAE,CAAC,EAErCtF,GAAO1sB,EAAM,QAAQ,EAAGgyB,CAAE,GAiB5B,QAbIE,EAAU,CAAE,EACZC,EAAS,CAAE,EACXC,EAAO,CAAE,EAETprB,GAAI,EAAE,mBAAmB,CAC3B,OAAQkrB,EACR,MAAOC,EACP,IAAKC,EACL,KAAM,CAAC+E,EAAOX,CAAQ,EACtB,SAAUzE,IAAQtzB,EAAE,WAAa60B,IAAQ,EAAE,UAAYtB,EAAK,MAClE,CAAK,EAGQqF,EAAK,EAAGA,EAAKb,EAAUa,IAAM,CAEpCjF,EAAKiF,CAAE,EAAIlF,EAAO,OAElB,IAAImF,EAAMlE,EAAKiE,CAAE,EACbE,EAAMnE,EAAKiE,EAAK,CAAC,EAErB,GAAIE,EAAMD,EAIR,QAFI1zB,EAAO,EAEF5U,EAAI,EAAGA,EAAImoC,EAAOnoC,IAAK,CAM9B,QAJIujC,GAAOvjC,EAAI,EAEXwoC,EAAM,OAEDC,GAAKH,EAAKG,GAAKF,EAAKE,KAAM,CAEjC,IAAIC,GAAKvE,EAAOsE,EAAE,EAEd7zB,IAAS2uB,IAEXiF,EAAMd,EAAGjE,EAAMzjC,CAAC,EAAE0oC,EAAE,EAAGxE,EAAQuE,EAAE,CAAC,EAElC7zB,EAAO2uB,IAGPiF,EAAMf,EAAGe,EAAKd,EAAGjE,EAAMzjC,CAAC,EAAE0oC,EAAE,EAAGxE,EAAQuE,EAAE,CAAC,CAAC,CAEzD,CAEc7zB,IAAS2uB,IAAQ,CAAC9F,GAAG+K,EAAK9K,EAAI,IAEhCyF,EAAO,KAAKnjC,CAAC,EACbkjC,EAAQ,KAAKsF,CAAG,EAE5B,CAEA,CAEI,OAAApF,EAAKoE,CAAQ,EAAIrE,EAAO,OAGjBnrB,EACX,CAUE,SAAS6vB,EAA4Bp4B,EAAG,EAAG,CAEzC,IAAIkzB,EAAUlzB,EAAE,QACZmzB,EAASnzB,EAAE,OACXozB,EAAOpzB,EAAE,KACTszB,EAAMtzB,EAAE,WAAaA,EAAE,QAAU,OAAYA,EAAE,UAAYA,EAAE,YAAa,EAE9E,GAAI,CAACkzB,EACH,MAAM,IAAI,MAAM,wDAAwD,EAG1E,IAAIuC,EAAQ,EAAE,MACVZ,EAAM,EAAE,WAAa,EAAE,YAAa,EAEpC6D,EAAQ14B,EAAE,MAAM,CAAC,EACjBk5B,EAAQ,EAAE,MAAM,CAAC,EAEjBzF,EAAU,CAAE,EACZC,EAAS,CAAE,EACXC,EAAO,CAAE,EAGTJ,EAEAyE,EAAKX,EAELY,GAAKX,EAELtJ,GAAKJ,EAELK,EAAO,EAGPqF,GAAOuB,GAAOvB,IAAQuB,GAAO,OAAOvB,GAAQ,UAAYA,IAAQ,UAElEC,EAAKD,EAEL0E,EAAKz2B,EAAM,KAAK81B,EAAW,CAAC9D,EAAIA,CAAE,CAAC,EACnC0E,GAAK12B,EAAM,KAAK+1B,EAAgB,CAAC/D,EAAIA,CAAE,CAAC,EACxCvF,GAAKzsB,EAAM,KAAKqsB,EAAa,CAAC2F,EAAIA,CAAE,CAAC,EAErCtF,EAAO1sB,EAAM,QAAQ,EAAGgyB,CAAE,GAI5B,IAAIpjC,EAAI,CAAE,EAENwoB,EAAI,CAAE,EAGVgb,EAAK,CAAC,EAAI,EAEV,QAASsF,GAAK,EAAGA,GAAKC,EAAOD,KAAM,CAEjC,IAAIE,EAAM1D,EAAMwD,EAAE,EAElB,GAAI,CAACjL,GAAGmL,EAAKlL,CAAI,EAEf,QAASmL,EAAMhG,EAAK6F,EAAE,EAAGI,EAAMjG,EAAK6F,GAAK,CAAC,EAAGK,EAAKF,EAAKE,EAAKD,EAAKC,IAAM,CAErE,IAAIC,EAAKpG,EAAOmG,CAAE,EAEb3gB,EAAE4gB,CAAE,EASPppC,EAAEopC,CAAE,EAAIvB,EAAG7nC,EAAEopC,CAAE,EAAGtB,GAAGkB,EAAKjG,EAAQoG,CAAE,CAAC,CAAC,GAPtC3gB,EAAE4gB,CAAE,EAAI,GAER7F,EAAO,KAAK6F,CAAE,EAEdppC,EAAEopC,CAAE,EAAItB,GAAGkB,EAAKjG,EAAQoG,CAAE,CAAC,EAKvC,CAEA,CAEI,QAAS5V,GAAKgQ,EAAO,OAAQ1vB,EAAI,EAAGA,EAAI0f,GAAI1f,IAAK,CAE/C,IAAIw1B,GAAK9F,EAAO1vB,CAAC,EAEjByvB,EAAQzvB,CAAC,EAAI7T,EAAEqpC,EAAE,CACvB,CAEI,OAAA7F,EAAK,CAAC,EAAID,EAAO,OAGV1zB,EAAE,mBAAmB,CAC1B,OAAQyzB,EACR,MAAOC,EACP,IAAKC,EACL,KAAM,CAAC+E,EAAO,CAAC,EACf,SAAUpF,IAAQtzB,EAAE,WAAa60B,IAAQ,EAAE,UAAYtB,EAAK,MAClE,CAAK,CACL,CAUE,SAASiF,EAAiCx4B,EAAG,EAAG,CAE9C,IAAIkzB,EAAUlzB,EAAE,QACZmzB,EAASnzB,EAAE,OACXozB,EAAOpzB,EAAE,KACTszB,EAAMtzB,EAAE,WAAaA,EAAE,QAAU,OAAYA,EAAE,UAAYA,EAAE,YAAa,EAE9E,GAAI,CAACkzB,EACH,MAAM,IAAI,MAAM,wDAAwD,EAG1E,IAAIuC,EAAQ,EAAE,MACVZ,EAAM,EAAE,WAAa,EAAE,YAAa,EAEpC6D,EAAQ14B,EAAE,MAAM,CAAC,EACjBk5B,EAAQ,EAAE,MAAM,CAAC,EACjBnB,EAAW,EAAE,MAAM,CAAC,EAGpBxE,EAEAyE,EAAKX,EAELY,EAAKX,EAELtJ,EAAKJ,EAELK,GAAO,EAGPqF,GAAOuB,GAAOvB,IAAQuB,GAAO,OAAOvB,GAAQ,UAAYA,IAAQ,UAElEC,EAAKD,EAEL0E,EAAKz2B,EAAM,KAAK81B,EAAW,CAAC9D,EAAIA,CAAE,CAAC,EACnC0E,EAAK12B,EAAM,KAAK+1B,EAAgB,CAAC/D,EAAIA,CAAE,CAAC,EACxCvF,EAAKzsB,EAAM,KAAKqsB,EAAa,CAAC2F,EAAIA,CAAE,CAAC,EAErCtF,GAAO1sB,EAAM,QAAQ,EAAGgyB,CAAE,GAsB5B,QAlBIE,GAAU,CAAE,EACZC,EAAS,CAAE,EACXC,EAAO,CAAE,EAETprB,EAAIvI,EAAE,mBAAmB,CAC3B,OAAQyzB,GACR,MAAOC,EACP,IAAKC,EACL,KAAM,CAAC+E,EAAOX,CAAQ,EACtB,SAAUzE,IAAQtzB,EAAE,WAAa60B,IAAQ,EAAE,UAAYtB,EAAK,MAClE,CAAK,EAGGpjC,GAAI,CAAE,EAENwoB,EAAI,CAAE,EAGDigB,EAAK,EAAGA,EAAKb,EAAUa,IAAM,CAEpCjF,EAAKiF,CAAE,EAAIlF,EAAO,OAIlB,QAFII,EAAO8E,EAAK,EAEPK,EAAK,EAAGA,EAAKC,EAAOD,IAAM,CAEjC,IAAIQ,EAAOhE,EAAMwD,CAAE,EAAEL,CAAE,EAEvB,GAAI,CAAC5K,EAAGyL,EAAMxL,EAAI,EAEhB,QAASmL,GAAMhG,EAAK6F,CAAE,EAAGI,EAAMjG,EAAK6F,EAAK,CAAC,EAAGK,GAAKF,GAAKE,GAAKD,EAAKC,KAAM,CAErE,IAAIC,GAAKpG,EAAOmG,EAAE,EAEd3gB,EAAE4gB,EAAE,IAAMzF,GAEZnb,EAAE4gB,EAAE,EAAIzF,EAERJ,EAAO,KAAK6F,EAAE,EAEdppC,GAAEopC,EAAE,EAAItB,EAAGwB,EAAMvG,EAAQoG,EAAE,CAAC,GAG5BnpC,GAAEopC,EAAE,EAAIvB,EAAG7nC,GAAEopC,EAAE,EAAGtB,EAAGwB,EAAMvG,EAAQoG,EAAE,CAAC,CAAC,CAErD,CAEA,CAEM,QAASI,GAAK/F,EAAKiF,CAAE,EAAGlV,GAAKgQ,EAAO,OAAQ1vB,GAAI01B,GAAI11B,GAAI0f,GAAI1f,KAAK,CAE/D,IAAIw1B,GAAK9F,EAAO1vB,EAAC,EAEjByvB,GAAQzvB,EAAC,EAAI7T,GAAEqpC,EAAE,CACzB,CACA,CAEI,OAAA7F,EAAKoE,CAAQ,EAAIrE,EAAO,OAGjBnrB,CACX,CAUE,SAASkwB,EAAkCz4B,EAAG,EAAG,CAE/C,IAAIkzB,EAAUlzB,EAAE,QACZmzB,EAASnzB,EAAE,OACXozB,EAAOpzB,EAAE,KACTszB,EAAMtzB,EAAE,WAAaA,EAAE,QAAU,OAAYA,EAAE,UAAYA,EAAE,YAAa,EAE1Ey0B,EAAU,EAAE,QACZC,EAAS,EAAE,OACXC,EAAO,EAAE,KACTE,EAAM,EAAE,WAAa,EAAE,QAAU,OAAY,EAAE,UAAY,EAAE,YAAa,EAG1E6D,EAAQ14B,EAAE,MAAM,CAAC,EACjB+3B,EAAW,EAAE,MAAM,CAAC,EAEpBrJ,EAASwE,GAAWuB,EAGpBlB,EAEAyE,EAAKX,EAELY,GAAKX,EAGLhE,GAAOuB,GAAOvB,IAAQuB,GAAO,OAAOvB,GAAQ,UAAYA,IAAQ,UAElEC,EAAKD,EAEL0E,EAAKz2B,EAAM,KAAK81B,EAAW,CAAC9D,EAAIA,CAAE,CAAC,EACnC0E,GAAK12B,EAAM,KAAK+1B,EAAgB,CAAC/D,EAAIA,CAAE,CAAC,GAuB1C,QAnBIE,GAAU/E,EAAS,GAAK,OACxBgF,EAAS,CAAE,EACXC,EAAO,CAAE,EAETprB,EAAIvI,EAAE,mBAAmB,CAC3B,OAAQyzB,GACR,MAAOC,EACP,IAAKC,EACL,KAAM,CAAC+E,EAAOX,CAAQ,EACtB,SAAUzE,IAAQtzB,EAAE,WAAa60B,IAAQ,EAAE,UAAYtB,EAAK,MAClE,CAAK,EAGGpjC,GAAIu+B,EAAS,GAAK,OAElB/V,EAAI,CAAE,EAEN2gB,EAAIF,EAAKC,EAAKL,EAAIH,GAAKC,EAAKS,GAAIN,GAE3BL,GAAK,EAAGA,GAAKb,EAAUa,KAAM,CAEpCjF,EAAKiF,EAAE,EAAIlF,EAAO,OAElB,IAAII,GAAO8E,GAAK,EAEhB,IAAKC,GAAMlE,EAAKiE,EAAE,EAAGE,EAAMnE,EAAKiE,GAAK,CAAC,EAAGI,EAAKH,GAAKG,EAAKF,EAAKE,IAI3D,GAFAC,GAAKvE,EAAOsE,CAAE,EAEVtK,EAEF,IAAK0K,EAAMhG,EAAK6F,EAAE,EAAGI,EAAMjG,EAAK6F,GAAK,CAAC,EAAGK,EAAKF,EAAKE,EAAKD,EAAKC,IAE3DC,GAAKpG,EAAOmG,CAAE,EAEV3gB,EAAE4gB,EAAE,IAAMzF,IAEZnb,EAAE4gB,EAAE,EAAIzF,GAERJ,EAAO,KAAK6F,EAAE,EAEdppC,GAAEopC,EAAE,EAAItB,GAAGxD,EAAQuE,CAAE,EAAG9F,EAAQoG,CAAE,CAAC,GAGnCnpC,GAAEopC,EAAE,EAAIvB,EAAG7nC,GAAEopC,EAAE,EAAGtB,GAAGxD,EAAQuE,CAAE,EAAG9F,EAAQoG,CAAE,CAAC,CAAC,MAKlD,KAAKF,EAAMhG,EAAK6F,EAAE,EAAGI,EAAMjG,EAAK6F,GAAK,CAAC,EAAGK,EAAKF,EAAKE,EAAKD,EAAKC,IAE3DC,GAAKpG,EAAOmG,CAAE,EAEV3gB,EAAE4gB,EAAE,IAAMzF,KAEZnb,EAAE4gB,EAAE,EAAIzF,GAERJ,EAAO,KAAK6F,EAAE,GAMtB,GAAI7K,EAEF,QAASgL,GAAK/F,EAAKiF,EAAE,EAAGlV,GAAKgQ,EAAO,OAAQ1vB,GAAI01B,GAAI11B,GAAI0f,GAAI1f,KAAK,CAE/D,IAAIw1B,GAAK9F,EAAO1vB,EAAC,EAEjByvB,GAAQzvB,EAAC,EAAI7T,GAAEqpC,EAAE,CAC3B,CAEA,CAEI,OAAA7F,EAAKoE,CAAQ,EAAIrE,EAAO,OAGjBnrB,CACX,CAmCE,OAAOhH,EAAMpK,GAAMmgC,EAAgB,CAGjC,eAAgB/1B,EAAM,QAAQ,iBAAkBo4B,GAAU,CAACxpC,EAAG2iB,IAAM,CAElE0kB,EAA0BjR,GAAUp2B,CAAC,EAAGo2B,GAAUzT,CAAC,CAAC,EAGpD,IAAIsF,EAAIuhB,EAAOlkB,EAAOtlB,CAAC,EAAGslB,EAAO3C,CAAC,CAAC,EAEnC,OAAOpV,GAAS0a,CAAC,EAAIA,EAAE,QAAS,EAAGA,CACzC,CAAK,EACD,iBAAkB,SAAsBjoB,EAAG2iB,EAAG,CAE5C,IAAI8mB,EAAQzpC,EAAE,KAAM,EAChB0pC,EAAQ/mB,EAAE,KAAM,EAMpB,OAHA0kB,EAA0BoC,EAAOC,CAAK,EAGlCD,EAAM,SAAW,EAEfC,EAAM,SAAW,EAEZlC,EAAsBxnC,EAAG2iB,EAAG8mB,EAAM,CAAC,CAAC,EAGtChC,EAAsBznC,EAAG2iB,CAAC,EAG/B+mB,EAAM,SAAW,EAEZ3B,EAAsB/nC,EAAG2iB,CAAC,EAG5BulB,EAAsBloC,EAAG2iB,CAAC,CAClC,EACD,gBAAiBvR,EAAM,QAAQ,gBAAiBo4B,GAAU,CAACxpC,EAAG2iB,IAAM6mB,EAAOxpC,EAAGslB,EAAO3C,CAAC,CAAC,CAAC,EACxF,gBAAiBvR,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,IAEtCtjB,EAAKimB,EAAOtlB,EAAG2iB,EAAE,QAAO,CAAE,EAAGA,CAAC,CACtC,EACD,oBAAqB,SAAyB3iB,EAAG2iB,EAAG,CAClD,OAAOykB,EAAcpnC,EAAG2iB,EAAGwkB,EAAgB,EAAK,CACjD,EACD,mBAAoB,SAAwBnnC,EAAG2iB,EAAG,CAChD,OAAO0jB,EAAarmC,EAAG2iB,EAAGwkB,EAAgB,EAAK,CAChD,EACD,oBAAqB,SAAyBnnC,EAAG2iB,EAAG,CAClD,OAAOykB,EAAczkB,EAAG3iB,EAAGmnC,EAAgB,EAAI,CAChD,EACD,mBAAoB,SAAwBnnC,EAAG2iB,EAAG,CAChD,OAAO0jB,EAAa1jB,EAAG3iB,EAAGmnC,EAAgB,EAAI,CAC/C,EACD,aAAc,SAAkBnnC,EAAG2iB,EAAG,CAEpC,OAAO0jB,EAAa/gB,EAAOtlB,CAAC,EAAG2iB,EAAGwkB,EAAgB,EAAK,EAAE,QAAS,CACnE,EACD,aAAc,SAAkBnnC,EAAG2iB,EAAG,CAEpC,OAAO0jB,EAAa/gB,EAAO3C,CAAC,EAAG3iB,EAAGmnC,EAAgB,EAAI,EAAE,QAAS,CAClE,EACD,WAAYA,EACZ,mBAAoB/1B,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,EAAGgnB,IAAS,CAE5D,QADIrU,EAASj2B,EAAKW,EAAG2iB,CAAC,EACbviB,EAAI,EAAGA,EAAIupC,EAAK,OAAQvpC,IAC/Bk1B,EAASj2B,EAAKi2B,EAAQqU,EAAKvpC,CAAC,CAAC,EAE/B,OAAOk1B,CACR,EACL,CAAG,CACH,CAAC,EC52BGtuB,GAAO,OACPic,GAAe,CAAC,QAAS,YAAa,WAAY,SAAS,EACpD2mB,GAA4B5mB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACzE,GAAI,CACF,MAAAvT,EACA,UAAWy4B,EACX,QAAAC,EACA,SAAUC,CACd,EAAMplB,EA+BJ,OAAOvT,EAAMpK,GAAM,CACjB,OAAQ41B,GACR,QAAS,SAAiB58B,EAAG,CAC3B,OAAOA,EAAE,KAAO,EAAI8pC,EAAQlN,GAAW58B,EAAE,EAAE,CAAC,EAAIA,EAAE,KAAM,CACzD,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAO,IAAI6pC,EAAW7pC,EAAE,IAAI,CAAC,CAAC,CAC/B,EACD,SAAU,SAAkBA,EAAG,CAC7B,OAAO,IAAI+pC,EAAU/pC,EAAE,EAAG,CAAC,CAC5B,EAED,iBAAkBoR,EAAM,YAAY/R,GAAQW,GAAKm8B,GAAQn8B,EAAGX,CAAU,CAAC,EACvE,KAAM+R,EAAM,YAAY/R,GAAQW,GAAK,CACnC,GAAI,CAACA,EAAE,WAAU,GAAMA,EAAE,MAAM,CAAC,EAAE,KAAK,SAAW,EAChD,MAAM,IAAI,UAAU,yCAAyC,EAE/D,OAAOoR,EAAM,KAAK/R,EAAMW,EAAE,WAAW,EAAEA,EAAE,KAAK,CAC/C,EACL,CAAG,CACH,CAAC,EC7DGgH,GAAO,OACPic,GAAe,CAAC,SAAU,QAAS,SAAS,EACrC+mB,GAA4BhnB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACzE,GAAI,CACF,OAAAnU,EACA,MAAAY,EACA,QAAAyT,CACJ,EAAMF,EA2BJ,OAAOvT,EAAM,OAAQ,CACnB,OAAQ64B,EACR,QAAS,SAAiBjqC,EAAG,CAC3B,OAAOA,EAAE,KAAM,CAChB,EACD,UAAW,SAAmBA,EAAG,CAC/B,MAAI,CAACA,EAAE,cAAgBwQ,EAAO,YACrBxQ,EAAE,KAAM,EAGRiqC,EAAYjqC,EAAE,UAAU,CAElC,EACD,KAAM,SAAcA,EAAG,CAErB,OAAOA,EAAE,IAAI,EAAG,CACtB,CACA,CAAG,EAQD,SAASiqC,EAAYjqC,EAAG,CACtB,OAAI,MAAMA,CAAC,EACF,IACEA,GAAK,GAAKwQ,EAAO,YACnB,KAAK,KAAKxQ,CAAC,EAEX,IAAI6kB,EAAQ7kB,EAAG,CAAC,EAAE,KAAM,CAErC,CACA,CAAC,EC9DGgH,GAAO,WACPic,GAAe,CAAC,QAAS,SAAU,cAAe,iBAAkB,aAAc,cAAe,QAAQ,EAClGinB,GAAgClnB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC7E,GAAI,CACF,MAAAvT,EACA,OAAAkU,EACA,YAAAmY,EACA,eAAA0M,EACA,WAAAC,EACA,YAAAtlB,EACA,OAAAiU,CACJ,EAAMpU,EAGA0lB,EAAiBxD,GAAqB,CACxC,MAAAz1B,CACJ,CAAG,EACGk5B,EAAgBnG,GAAoB,CACtC,MAAA/yB,CACJ,CAAG,EACGm5B,EAAiB5F,GAAqB,CACxC,MAAAvzB,EACA,YAAAqsB,CACJ,CAAG,EACG+M,EAAiBzD,GAAqB,CACxC,MAAA31B,EACA,YAAA0T,CACJ,CAAG,EACG2lB,EAAgBhH,GAAoB,CACtC,MAAAryB,EACA,YAAA0T,CACJ,CAAG,EACG4lB,EAAuBvE,GAA2B,CACpD,MAAA/0B,EACA,OAAAkU,EACA,OAAAyT,CACJ,CAAG,EAgCD,OAAO3nB,EAAMpK,GAAM,CACjB,WAAYmjC,CACb,EAAEO,EAAqB,CACtB,KAAMP,EACN,GAAII,EACJ,GAAIF,EACJ,GAAIC,EACJ,GAAIG,EACJ,GAAID,CACR,CAAG,CAAC,CACJ,CAAC,ECnFGxjC,GAAO,gBACPic,GAAe,CAAC,QAAS,aAAa,EAC/B0nB,GAAqC3nB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAClF,GAAI,CACF,MAAAvT,EACA,YAAA0T,CACJ,EAAMH,EAeJ,OAAO,SAAuB,EAAG7U,EAAGzK,EAAU,CAE5C,IAAI69B,EAAQ,EAAE,MACVC,EAAM,EAAE,WAAa,EAAE,QAAU,OAAY,EAAE,UAAY,EAAE,YAAa,EAE1EsB,EAAQ30B,EAAE,MACV40B,EAAM50B,EAAE,WAAaA,EAAE,QAAU,OAAYA,EAAE,UAAYA,EAAE,YAAa,EAG9E,GAAIozB,EAAM,SAAWuB,EAAM,OACzB,MAAM,IAAIzO,GAAekN,EAAM,OAAQuB,EAAM,MAAM,EAIrD,GAAIvB,EAAM,CAAC,IAAMuB,EAAM,CAAC,GAAKvB,EAAM,CAAC,IAAMuB,EAAM,CAAC,EAC/C,MAAM,IAAI,WAAW,iCAAmCvB,EAAQ,0BAA4BuB,EAAQ,GAAG,EAIzG,IAAI3I,EAAOoH,EAAM,CAAC,EACdnH,EAAUmH,EAAM,CAAC,EAGjBE,EAEAtF,EAAO,EAEPuF,EAAKh+B,EAGL,OAAO89B,GAAQ,UAAYA,IAAQuB,GAAOvB,IAAQ,UAEpDC,EAAKD,EAELrF,EAAO1sB,EAAM,QAAQ,EAAGgyB,CAAE,EAE1BC,EAAKjyB,EAAM,KAAK/L,EAAU,CAAC+9B,EAAIA,CAAE,CAAC,GAIpC,IAAIhjC,EAAGknB,EAGHoc,EAAQ,CAAE,EAEd,IAAKtjC,EAAI,EAAGA,EAAI07B,EAAM17B,IACpBsjC,EAAMtjC,CAAC,EAAI,CAAE,EAIf,IAAIwkC,EAAK,CAAE,EACPC,EAAK,CAAE,EAEPC,EAAK,CAAE,EACPC,EAAK,CAAE,EAGX,IAAKzd,EAAI,EAAGA,EAAIyU,EAASzU,IAAK,CAE5B,IAAIqc,EAAOrc,EAAI,EAMf,IAJAsjB,EAAS,EAAGtjB,EAAGwd,EAAIF,EAAIjB,CAAI,EAE3BiH,EAAS96B,EAAGwX,EAAGyd,EAAIF,EAAIlB,CAAI,EAEtBvjC,EAAI,EAAGA,EAAI07B,EAAM17B,IAAK,CAEzB,IAAI8kC,EAAKJ,EAAG1kC,CAAC,IAAMujC,EAAOiB,EAAGxkC,CAAC,EAAI09B,EAC9BqH,EAAKJ,EAAG3kC,CAAC,IAAMujC,EAAOkB,EAAGzkC,CAAC,EAAI09B,EAElC4F,EAAMtjC,CAAC,EAAEknB,CAAC,EAAI+b,EAAG6B,EAAIC,CAAE,CAC/B,CACA,CAGI,OAAO,IAAIrgB,EAAY,CACrB,KAAM4e,EACN,KAAM,CAAC5H,EAAMC,CAAO,EACpB,SAAUoH,IAAQ,EAAE,WAAauB,IAAQ50B,EAAE,UAAYszB,EAAK,MAClE,CAAK,CACF,EACD,SAASwH,EAAS3iB,EAAGX,EAAGkB,EAAGxoB,EAAG2jC,EAAM,CAMlC,QAJIpF,EAAStW,EAAE,QACXpkB,EAAQokB,EAAE,OACVuW,EAAMvW,EAAE,KAEHb,EAAIoX,EAAIlX,CAAC,EAAG8X,EAAKZ,EAAIlX,EAAI,CAAC,EAAGF,EAAIgY,EAAIhY,IAAK,CAEjD,IAAIhnB,EAAIyD,EAAMujB,CAAC,EAEfoB,EAAEpoB,CAAC,EAAIujC,EACP3jC,EAAEI,CAAC,EAAIm+B,EAAOnX,CAAC,CACrB,CACA,CACA,CAAC,ECpHGpgB,GAAO,OACPic,GAAe,CAAC,OAAO,EAChB4nB,GAA4B7nB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACzE,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EA0BJ,OAAOvT,EAAMpK,GAAM,CACjB,gCAAiChH,GAAKA,EACtC,QAASA,GAAKA,EAAE,UAAW,EAC3B,iBAAkBoR,EAAM,YAAY/R,GAAQW,GAAKm8B,GAAQn8B,EAAGX,CAAI,CAAC,CACrE,CAAG,CACH,CAAC,ECpCG2H,GAAO,KACPic,GAAe,CAAC,OAAO,EAChB6nB,GAA0B9nB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACvE,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EA4BJ,OAAOvT,EAAMpK,GAAM,CACjB,OAAQ,IAAM,EACd,uBAAwBhH,GAAKA,EAAE,IAAI,CAAC,EACpC,QAASA,GAAKA,EAAE,GAChB,iBAAkBoR,EAAM,YAAY/R,GAAQW,GAAKm8B,GAAQn8B,EAAGX,CAAI,CAAC,CACrE,CAAG,CACH,CAAC,ECvCG2H,GAAO,KACPic,GAAe,CAAC,OAAO,EAChB8nB,GAA0B/nB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACvE,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EA4BJ,OAAOvT,EAAMpK,GAAM,CACjB,gCAAiChH,GAAKA,EACtC,QAASA,GAAKA,EAAE,GAChB,iBAAkBoR,EAAM,YAAY/R,GAAQW,GAAKm8B,GAAQn8B,EAAGX,CAAI,CAAC,CACrE,CAAG,CACH,CAAC,EClCG2H,GAAO,SACPic,GAAe,CAAC,QAAS,SAAU,WAAW,EACvC+nB,GAA8BhoB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC3E,GAAI,CACF,MAAAvT,EACA,OAAAkU,EACA,UAAAnF,CACJ,EAAMwE,EA8BJ,OAAOvT,EAAMpK,GAAM,CAEjB,yCAA0C,SAAoC0O,EAAM,CAClF,IAAItV,EACA6P,EAAMyF,EAAK,OACX4gB,EAAM,GACN2U,EACAC,EAAW,GACXC,EAAW,GAEf,IAAK/qC,EAAI,EAAGA,EAAI6P,EAAK7P,IAAK,CACxB,IAAI6Y,EAAMvD,EAAKtV,CAAC,EAMhB,GAHImN,GAAS0L,CAAG,IACdiyB,EAAW,IAETl+B,GAASiM,CAAG,GAAKhM,GAAYgM,CAAG,EAAG,CACrC,GAAI7Y,IAAM6P,EAAM,EACd,MAAM,IAAI,MAAM,8CAA8C,EAOhE,GAHAg7B,EAAU3U,EACVA,EAAMrd,EAAI,UAEN,CAACkH,EAAUmW,CAAG,EAChB,MAAM,IAAI,UAAU,uCAAuC,EAE7D,GAAIA,EAAM,GAAKl2B,EAAI,GAAKk2B,EAAM2U,EAE5B,MAAM,IAAI9U,GAAWG,EAAK2U,EAAU,CAAC,CAEjD,KAAe,CAEL,IAAIhjB,EAAIzY,GAAMyJ,CAAG,EAAE,QAAS,EACxB3P,EAAO8sB,GAAUnO,CAAC,EAMtB,GALAkjB,EAAS/qC,CAAC,EAAI6nB,EACdgjB,EAAU3U,EACVA,EAAMhtB,EAAK,OAAS,EAGhBlJ,EAAI,GAAKk2B,IAAQ2U,EACnB,MAAM,IAAIjV,GAAeiV,EAAU,EAAG3U,EAAM,CAAC,CAEzD,CACA,CACM,GAAI6U,EAAS,SAAW,EACtB,MAAM,IAAI,YAAY,8BAA8B,EAGtD,QADI/Y,EAAM+Y,EAAS,MAAO,EACnBA,EAAS,QACd/Y,EAAMgZ,GAAQhZ,EAAK+Y,EAAS,MAAK,EAAI7U,CAAG,EAE1C,OAAO4U,EAAW5lB,EAAO8M,CAAG,EAAIA,CACjC,EACD,YAAa,SAAgB1c,EAAM,CACjC,OAAOA,EAAK,KAAK,EAAE,CACzB,CACA,CAAG,CACH,CAAC,ECnGG1O,GAAO,SACPic,GAAe,CAAC,QAAS,QAAS,SAAU,OAAO,EAC5CooB,GAA8BroB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC3E,GAAI,CACF,MAAAvT,EACA,MAAAk6B,EACA,OAAAhmB,EACA,MAAA5c,CACJ,EAAMic,EAsBJ,OAAOvT,EAAMpK,GAAM,CACjB,iBAAkBukC,EAClB,gBAAiB,SAAqBjsC,EAAOksC,EAAQ,CACnD,OAAOD,EAAQjmB,EAAO9V,GAAMlQ,CAAK,CAAC,EAAGksC,CAAM,EAAE,QAAS,CAC5D,CACA,CAAG,EAQD,SAASD,EAAQjsC,EAAOksC,EAAQ,CAE9B,GAAIlsC,EAAM,OAAO,SAAW,EAC1B,MAAM,IAAI,MAAM,0CAA0C,EAE5Dq3B,GAAc6U,EAAQlsC,EAAM,KAAM,EAAC,CAAC,CAAC,EACrC,IAAImsC,EAAW/iC,EAAM,EAAGpJ,EAAM,KAAI,EAAG,CAAC,CAAC,EACnCuE,EAAQ,IAAIynC,EAAMG,EAAUD,CAAM,EAClClW,EAASh2B,EAAM,OAAOuE,CAAK,EAC/B,OAAO0J,GAAS+nB,CAAM,EAAIA,EAAShQ,EAAO,CAAC,CAACgQ,CAAM,CAAC,CAAC,CACxD,CACA,CAAC,ECtDGtuB,GAAO,OACPic,GAAe,CAAC,QAAS,SAAU,cAAe,cAAc,EACzDyoB,GAA4B1oB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACzE,GAAI,CACF,MAAAvT,EACA,OAAAkU,EACA,YAAAR,EACA,aAAA4Y,CACJ,EAAM/Y,EAsCJ,OAAOvT,EAAMpK,GAAM,CAGjB,MAAO,SAAehH,EAAG,CACvB,OAAO2rC,EAAM3rC,EAAG,EAAGo2B,GAAUp2B,CAAC,EAAG,IAAI,CACtC,EACD,gBAAiB,SAAqBA,EAAGonB,EAAG,CAC1C,OAAOukB,EAAM3rC,EAAGonB,EAAGgP,GAAUp2B,CAAC,EAAG,IAAI,CACtC,EACD,mBAAoB,SAAwBA,EAAGonB,EAAG,CAChD,OAAOukB,EAAM3rC,EAAGonB,EAAE,SAAU,EAAEgP,GAAUp2B,CAAC,EAAG,IAAI,CACjD,EACD,gBAAiB,SAAqBA,EAAG2gB,EAAQ,CAC/C,OAAOgrB,EAAM3rC,EAAG,EAAGo2B,GAAUp2B,CAAC,EAAG2gB,CAAM,CACxC,EACD,wBAAyB,SAA2B3gB,EAAGonB,EAAGzG,EAAQ,CAChE,OAAOgrB,EAAM3rC,EAAGonB,EAAGgP,GAAUp2B,CAAC,EAAG2gB,CAAM,CACxC,EACD,2BAA4B,SAA8B3gB,EAAGonB,EAAGzG,EAAQ,CACtE,OAAOgrB,EAAM3rC,EAAGonB,EAAE,SAAU,EAAEgP,GAAUp2B,CAAC,EAAG2gB,CAAM,CACnD,EACD,OAAQ,SAAgB3gB,EAAG,CACzB,OAAO2rC,EAAM3rC,EAAG,EAAGA,EAAE,OAAQA,EAAE,SAAS,CACzC,EACD,iBAAkB,SAAsBA,EAAGonB,EAAG,CAC5C,OAAOukB,EAAM3rC,EAAGonB,EAAGpnB,EAAE,OAAQA,EAAE,SAAS,CACzC,EACD,oBAAqB,SAAyBA,EAAGonB,EAAG,CAClD,OAAOukB,EAAM3rC,EAAGonB,EAAE,SAAQ,EAAIpnB,EAAE,KAAM,EAAEA,EAAE,SAAS,CACpD,EACD,iBAAkB,SAAsBA,EAAG2gB,EAAQ,CACjD,OAAOgrB,EAAM3rC,EAAG,EAAGA,EAAE,KAAM,EAAE2gB,CAAM,CACpC,EACD,yBAA0B,SAA4B3gB,EAAGonB,EAAGzG,EAAQ,CAClE,OAAOgrB,EAAM3rC,EAAGonB,EAAGpnB,EAAE,KAAM,EAAE2gB,CAAM,CACpC,EACD,4BAA6B,SAA+B3gB,EAAGonB,EAAGzG,EAAQ,CACxE,OAAOgrB,EAAM3rC,EAAGonB,EAAE,SAAU,EAAEpnB,EAAE,KAAM,EAAE2gB,CAAM,CACpD,CACA,CAAG,EAWD,SAASgrB,EAAM3rC,EAAGonB,EAAG9d,EAAMqX,EAAQ,CACjC,GAAI,CAACR,GAAUiH,CAAC,EACd,MAAM,IAAI,UAAU,sDAAsD,EAE5E,IAAIwU,EAASxU,EAAI,EAAIA,EAAI,EACrByU,EAAOzU,EAAI,EAAI,CAACA,EAAI,EAGxB,OAAQ9d,EAAK,OAAM,CACjB,IAAK,GACH,OAAOsiC,EAAsB5rC,EAAGonB,EAAGzG,EAAQrX,EAAK,CAAC,EAAGuyB,EAAMD,CAAM,EAClE,IAAK,GACH,OAAOiQ,EAAa7rC,EAAGonB,EAAGzG,EAAQrX,EAAMuyB,EAAMD,CAAM,CAC5D,CACI,MAAM,IAAI,WAAW,gDAAgD,CACzE,CACE,SAASgQ,EAAsB5rC,EAAGonB,EAAGzG,EAAQmrB,EAAGjQ,EAAMD,EAAQ,CAE5D,IAAIK,EAAK,CAAC6P,EAAIjQ,EAAMiQ,EAAIlQ,CAAM,EAC9B,GAAIjb,GAAUA,IAAW,UAAYA,IAAW,QAC9C,MAAM,IAAI,UAAU,uBAAuB,OAAOA,EAAQ,GAAI,CAAC,EAIjE,IAAIsH,EAAItH,IAAW,SAAW+c,EAAa,SAASzB,EAAIj8B,EAAGonB,CAAC,EAAItC,EAAY,SAASmX,EAAIj8B,EAAGonB,CAAC,EAE7F,OAAOzG,IAAW,KAAOsH,EAAIA,EAAE,QAAS,CAC5C,CACE,SAAS4jB,EAAa7rC,EAAGonB,EAAGzG,EAAQ,EAAGkb,EAAMD,EAAQ,CAEnD,GAAIruB,GAASvN,CAAC,EAAG,CAEf,IAAI+rC,EAAK/rC,EAAE,SAASonB,CAAC,EAErB,OAAIzG,IAAW,KAETA,IAAWorB,EAAG,UACTzmB,EAAOymB,EAAIprB,CAAM,EAEnBorB,EAEFA,EAAG,QAAS,CACzB,CAMI,QAJIn/B,EAAI,KAAK,IAAI,EAAE,CAAC,EAAIivB,EAAM,EAAE,CAAC,EAAID,CAAM,EAEvCoQ,EAAS,CAAE,EAEN5rC,EAAI,EAAGA,EAAIwM,EAAGxM,IACrB4rC,EAAO5rC,CAAC,EAAIJ,EAAEI,EAAIy7B,CAAI,EAAEz7B,EAAIw7B,CAAM,EAGpC,OAAOjb,IAAW,KAAO2E,EAAO0mB,CAAM,EAAIA,CAC9C,CACA,CAAC,ECxJGhlC,GAAO,UACPic,GAAe,CAAC,QAAS,QAAQ,EAC1BgpB,GAA+BjpB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC5E,GAAI,CACF,MAAAvT,EACA,OAAAkU,CACJ,EAAMX,EAoBJ,OAAOvT,EAAMpK,GAAM,CACjB,MAAO,SAAehH,EAAG,CACvB,OAAOksC,GAAalsC,CAAC,CACtB,EACD,OAAQ,SAAgBA,EAAG,CACzB,IAAIy4B,EAAOyT,GAAalsC,EAAE,QAAO,CAAE,EAEnC,OAAOslB,EAAOmT,CAAI,CACxB,CACA,CAAG,CACH,CAAC,ECnCGzxB,GAAO,oBACPic,GAAe,CAAC,OAAO,EAChBkpB,GAAyCnpB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACtF,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EAmCJ,OAAOvT,EAAMpK,GAAM,CACjB,MAAO,SAAehH,EAAG,CACvB,OAAO04B,GAAiB14B,EAAGuP,EAAM,CAClC,EACD,OAAQ,SAAgBvP,EAAG,CACzB,OAAOA,EAAE,YAAa,CAC5B,CACA,CAAG,CACH,CAAC,EC/CGgH,GAAO,WACPic,GAAe,CAAC,QAAS,SAAU,SAAU,YAAa,cAAe,cAAc,EAChFmpB,GAAgCppB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC7E,GAAI,CACF,MAAAvT,EACA,OAAAZ,EACA,OAAA8U,EACA,UAAAV,EACA,YAAAE,EACA,aAAA4Y,CACJ,EAAM/Y,EA+BJ,OAAOvT,EAAMpK,GAAM,CACjB,GAAI,UAAa,CACf,OAAOwJ,EAAO,SAAW,SAAW8U,EAAO,EAAE,EAAI,CAAE,CACpD,EACD,OAAQ,SAAgB3E,EAAQ,CAC9B,OAAO2E,EAAO3E,CAAM,CACrB,EACD,qBAAsB,SAAyBmb,EAAM,CACnD,OAAOuQ,EAAUvQ,EAAMA,EAAMtrB,EAAO,SAAW,SAAW,QAAU,MAAS,CAC9E,EACD,6BAA8B,SAA+BsrB,EAAMnb,EAAQ,CACzE,OAAO0rB,EAAUvQ,EAAMA,EAAMnb,CAAM,CACpC,EACD,yCAA0C,SAAwCmb,EAAMwQ,EAAM,CAC5F,OAAOD,EAAUvQ,EAAMwQ,EAAM97B,EAAO,SAAW,SAAW,QAAU,MAAS,CAC9E,EACD,iDAAkD,SAA8CsrB,EAAMwQ,EAAM3rB,EAAQ,CAClH,OAAO0rB,EAAUvQ,EAAMwQ,EAAM3rB,CAAM,CACpC,EACD,MAAO,SAAerX,EAAM,CAC1B,OAAOijC,EAAgBjjC,CAAI,CAC5B,EACD,gBAAiB,SAAqBA,EAAMqX,EAAQ,CAClD,OAAO4rB,EAAgBjjC,EAAMqX,CAAM,CACpC,EACD,OAAQ,SAAgBrX,EAAM,CAC5B,OAAOijC,EAAgBjjC,EAAK,QAAS,EAAEA,EAAK,QAAO,CAAE,CACtD,EACD,iBAAkB,SAAsBA,EAAMqX,EAAQ,CACpD,OAAO4rB,EAAgBjjC,EAAK,QAAO,EAAIqX,CAAM,CACnD,CACA,CAAG,EACD,SAAS4rB,EAAgBjjC,EAAMqX,EAAQ,CACrC,OAAQrX,EAAK,OAAM,CACjB,IAAK,GACH,OAAOqX,EAAS2E,EAAO3E,CAAM,EAAI,CAAE,EACrC,IAAK,GACH,OAAO0rB,EAAU/iC,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGqX,CAAM,EAC3C,IAAK,GACH,OAAO0rB,EAAU/iC,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGqX,CAAM,EAC3C,QACE,MAAM,IAAI,MAAM,uCAAuC,CAC/D,CACA,CAUE,SAAS0rB,EAAUvQ,EAAMwQ,EAAM3rB,EAAQ,CAErC,IAAI6rB,EAAMv/B,GAAY6uB,CAAI,GAAK7uB,GAAYq/B,CAAI,EAAI1nB,EAAY,KAG/D,GAFI3X,GAAY6uB,CAAI,IAAGA,EAAOA,EAAK,SAAU,GACzC7uB,GAAYq/B,CAAI,IAAGA,EAAOA,EAAK,SAAU,GACzC,CAACnsB,GAAU2b,CAAI,GAAKA,EAAO,EAC7B,MAAM,IAAI,MAAM,2DAA2D,EAE7E,GAAI,CAAC3b,GAAUmsB,CAAI,GAAKA,EAAO,EAC7B,MAAM,IAAI,MAAM,2DAA2D,EAE7E,IAAI7jB,EAAM+jB,EAAM,IAAI5nB,EAAU,CAAC,EAAI,EAC/B7B,EAAeypB,EAAM,IAAIA,EAAI,CAAC,EAAI,EAClCljC,EAAO,CAACwyB,EAAMwQ,CAAI,EAGtB,GAAI3rB,EAAQ,CAEV,GAAIA,IAAW,SACb,OAAO+c,EAAa,SAASp0B,EAAMmf,EAAK,EAAG1F,CAAY,EAEzD,GAAIpC,IAAW,QACb,OAAOmE,EAAY,SAASxb,EAAMmf,EAAK,EAAG1F,CAAY,EAExD,MAAM,IAAI,UAAU,wBAAyB,OAAOpC,EAAQ,GAAI,CAAC,CACvE,CAOI,QAJIyR,EAAMzsB,GAAO,GAAI2D,EAAMyZ,CAAY,EAEnC0pB,EAAU3Q,EAAOwQ,EAAOxQ,EAAOwQ,EAE1B1oB,EAAI,EAAGA,EAAI6oB,EAAS7oB,IAC3BwO,EAAIxO,CAAC,EAAEA,CAAC,EAAI6E,EAEd,OAAO2J,CACX,CACA,CAAC,ECvIM,SAASsa,IAAc,CAC5B,MAAM,IAAI,MAAM,yCAAyC,CAC3D,CACO,SAASC,IAAa,CAC3B,MAAM,IAAI,MAAM,wCAAwC,CAC1D,CACO,SAASC,IAAW,CACzB,MAAM,IAAI,MAAM,sCAAsC,CACxD,CCNA,IAAI5lC,GAAO,QACPic,GAAe,CAAC,QAAS,SAAU,UAAW,aAAc,UAAW,YAAa,SAAU,WAAY,MAAO,YAAY,EACtHta,GAA6Bqa,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC1E,GAAI,CACF,MAAAvT,EACA,OAAAZ,EACA,OAAA8U,EACA,UAAAunB,EACA,QAAAC,EACA,UAAAC,EACA,OAAAC,EACA,SAAAC,EACA,IAAA9d,EACA,WAAA+d,CACJ,EAAMvoB,EA6CJ,OAAOvT,EAAMpK,GAAM,CAIjB,OAAQmmC,EACR,kBAAmBA,EACnB,iBAAkB,SAAsB9kC,EAAOC,EAAK,CAClD,OAAO8kC,EAAKC,EAAOhlC,EAAOC,EAAK,EAAG,EAAK,CAAC,CACzC,EACD,yBAA0B,SAA4BD,EAAOC,EAAKqC,EAAM,CACtE,OAAOyiC,EAAKC,EAAOhlC,EAAOC,EAAKqC,EAAM,EAAK,CAAC,CAC5C,EACD,0BAA2B,SAA6BtC,EAAOC,EAAKglC,EAAY,CAC9E,OAAOF,EAAKC,EAAOhlC,EAAOC,EAAK,EAAGglC,CAAU,CAAC,CAC9C,EACD,kCAAmC,SAAmCjlC,EAAOC,EAAKqC,EAAM2iC,EAAY,CAClG,OAAOF,EAAKC,EAAOhlC,EAAOC,EAAKqC,EAAM2iC,CAAU,CAAC,CACjD,EACD,uBAAwB,SAA4BjlC,EAAOC,EAAK,CAC9D,IAAIsc,EAAYvc,EAAM,YACtB,OAAO+kC,EAAKC,EAAOhlC,EAAOC,EAAK,IAAIsc,EAAU,CAAC,EAAG,EAAK,CAAC,CACxD,EACD,kCAAmC,SAAqCvc,EAAOC,EAAKqC,EAAM,CACxF,OAAOyiC,EAAKC,EAAOhlC,EAAOC,EAAKqC,EAAM,EAAK,CAAC,CAC5C,EACD,gCAAiC,SAAmCtC,EAAOC,EAAKglC,EAAY,CAC1F,IAAI1oB,EAAYvc,EAAM,YACtB,OAAO+kC,EAAKC,EAAOhlC,EAAOC,EAAK,IAAIsc,EAAU,CAAC,EAAG0oB,CAAU,CAAC,CAC7D,EACD,2CAA4C,SAA4CjlC,EAAOC,EAAKqC,EAAM2iC,EAAY,CACpH,OAAOF,EAAKC,EAAOhlC,EAAOC,EAAKqC,EAAM2iC,CAAU,CAAC,CACjD,EACD,mBAAoB,SAAsBjlC,EAAOC,EAAKqC,EAAM,CAC1D,OAAOyiC,EAAKC,EAAOhlC,EAAOC,EAAKqC,EAAM,EAAK,CAAC,CAC5C,EACD,4BAA6B,SAA6BtC,EAAOC,EAAKqC,EAAM2iC,EAAY,CACtF,OAAOF,EAAKC,EAAOhlC,EAAOC,EAAKqC,EAAM2iC,CAAU,CAAC,CACtD,CACA,CAAG,EACD,SAASF,EAAK5uB,EAAK,CACjB,OAAIhO,EAAO,SAAW,SACb8U,EAASA,EAAO9G,CAAG,EAAIouB,GAAU,EAEnCpuB,CACX,CACE,SAAS2uB,EAAUhrB,EAAKmrB,EAAY,CAClC,IAAIxgC,EAAIygC,EAAOprB,CAAG,EAClB,GAAI,CAACrV,EACH,MAAM,IAAI,YAAY,WAAaqV,EAAM,qBAAqB,EAEhE,OAAI3R,EAAO,SAAW,aAChBq8B,IAAc,QAChBH,GAAa,EAERU,EAAKC,EAAOR,EAAU//B,EAAE,KAAK,EAAG+/B,EAAU//B,EAAE,GAAG,EAAG+/B,EAAU//B,EAAE,IAAI,CAAC,CAAa,GAEhFsgC,EAAKC,EAAOvgC,EAAE,MAAOA,EAAE,IAAKA,EAAE,KAAMwgC,CAAU,CAAC,CAE5D,CAWE,SAASD,EAAOhlC,EAAOC,EAAKqC,EAAM2iC,EAAY,CAI5C,QAHIloB,EAAQ,CAAE,EACVooB,EAAUN,EAAWviC,CAAI,EAAI2iC,EAAaP,EAAYD,EAAUQ,EAAaL,EAAWD,EACxFhtC,EAAIqI,EACDmlC,EAAQxtC,EAAGsI,CAAG,GACnB8c,EAAM,KAAKplB,CAAC,EACZA,EAAImvB,EAAInvB,EAAG2K,CAAI,EAEjB,OAAOya,CACX,CAWE,SAASmoB,EAAOprB,EAAK,CACnB,IAAIzM,EAAOyM,EAAI,MAAM,GAAG,EAGpBsrB,EAAO/3B,EAAK,IAAI,SAAUuD,EAAK,CAEjC,OAAO,OAAOA,CAAG,CACvB,CAAK,EACGy0B,EAAUD,EAAK,KAAK,SAAU9jB,EAAK,CACrC,OAAO,MAAMA,CAAG,CACtB,CAAK,EACD,GAAI+jB,EACF,OAAO,KAET,OAAQD,EAAK,OAAM,CACjB,IAAK,GACH,MAAO,CACL,MAAOA,EAAK,CAAC,EACb,IAAKA,EAAK,CAAC,EACX,KAAM,CACP,EACH,IAAK,GACH,MAAO,CACL,MAAOA,EAAK,CAAC,EACb,IAAKA,EAAK,CAAC,EACX,KAAMA,EAAK,CAAC,CACb,EACH,QACE,OAAO,IACf,CACA,CACA,CAAC,ECnLGzmC,GAAO,UACPic,GAAe,CAAC,QAAS,YAAa,QAAQ,EACvC0qB,GAA+B3qB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC5E,GAAI,CACF,MAAAvT,EACA,UAAA+O,CACJ,EAAMwE,EAyCJ,OAAOvT,EAAMpK,GAAM,CACjB,gBAAiB,SAAqBhH,EAAGm3B,EAAO,CAC9C,OAAOn3B,EAAE,QAAQm3B,EAAO,EAAI,CAC7B,EACD,eAAgB,SAAoBn3B,EAAGm3B,EAAO,CAC5C,OAAAA,EAAM,QAAQ,SAAU7tB,EAAM,CAC5B,GAAI,CAAC6W,EAAU7W,CAAI,EACjB,MAAM,IAAI,UAAU,+BAAiCA,CAAI,CAEnE,CAAO,EACMskC,GAAa5tC,EAAGm3B,CAAK,CAClC,CACA,CAAG,CACH,CAAC,EC3DGnwB,GAAO,OACPic,GAAe,CAAC,QAAS,SAAU,SAAS,EACrC4qB,GAA4B7qB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACzE,GAAI,CACF,MAAAvT,EACA,OAAAZ,EACA,OAAA8U,CACJ,EAAMX,EAwBJ,OAAOvT,EAAMpK,GAAM,CACjB,OAAQ,SAAgBhH,EAAG,CACzB,OAAOA,EAAE,OAAOA,EAAE,KAAI,CAAE,CACzB,EACD,MAAOo2B,GACP,OAAQ,SAAgBp2B,EAAG,CACzB,OAAOwQ,EAAO,SAAW,QAAU,CAACxQ,EAAE,MAAM,EAAIslB,EAAO,CAACtlB,EAAE,MAAM,CAAC,CAClE,EACD,uDAAwD,SAA+CA,EAAG,CAExG,OAAOwQ,EAAO,SAAW,QAAU,GAAK8U,EAASA,EAAO,EAAE,EAAIsnB,GAAU,CAC9E,CACA,CAAG,CACH,CAAC,EC5CG5lC,GAAO,YACPic,GAAe,CAAC,QAAS,QAAQ,EAC1B6qB,GAAiC9qB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC9E,GAAI,CACF,MAAAvT,EACA,OAAAkU,CACJ,EAAMX,EAuBJ,OAAOvT,EAAMpK,GAAM,CACjB,MAAOhH,GAAK+tC,EAAgBzoB,EAAOtlB,CAAC,CAAC,EAAE,QAAS,EAChD,OAAQ+tC,EACR,IAAKv+B,EACT,CAAG,EACD,SAASu+B,EAAgB/tC,EAAG,CAE1B,IAAIsJ,EAAOtJ,EAAE,KAAM,EAGf,EAGJ,OAAQsJ,EAAK,OAAM,CACjB,IAAK,GAEH,EAAItJ,EAAE,MAAO,EACb,MACF,IAAK,GACH,CAEE,IAAI87B,EAAOxyB,EAAK,CAAC,EACbyyB,EAAUzyB,EAAK,CAAC,EAGpB,GAAIyyB,IAAY,EAEd,MAAM,IAAI,WAAW,uDAAyDpb,GAAOrX,CAAI,EAAI,GAAG,EAIlG,OAAQtJ,EAAE,QAAS,GACjB,IAAK,QACH,EAAIguC,EAAgBhuC,EAAG87B,EAAMC,CAAO,EACpC,MACF,IAAK,SACH,EAAIkS,EAAiBjuC,EAAG87B,EAAMC,CAAO,EACrC,KACd,CACA,CACQ,MACF,QAEE,MAAM,IAAI,WAAW,qDAAuDpb,GAAOrX,CAAI,EAAI,GAAG,CACtG,CACI,OAAO,CACX,CACE,SAAS0kC,EAAgB/lB,EAAG6T,EAAMC,EAAS,CAOzC,QALI59B,EAAO8pB,EAAE,MAETimB,EAAa,CAAE,EACfC,EAEK7mB,EAAI,EAAGA,EAAIyU,EAASzU,IAAK,CAEhC6mB,EAAgBD,EAAW5mB,CAAC,EAAI,CAAE,EAElC,QAASlnB,EAAI,EAAGA,EAAI07B,EAAM17B,IAExB+tC,EAAc/tC,CAAC,EAAIoP,GAAMrR,EAAKiC,CAAC,EAAEknB,CAAC,CAAC,CAE3C,CAEI,OAAOW,EAAE,kBAAkB,CACzB,KAAMimB,EACN,KAAM,CAACnS,EAASD,CAAI,EACpB,SAAU7T,EAAE,SAClB,CAAK,CACL,CACE,SAASgmB,EAAiBhmB,EAAG6T,EAAMC,EAAS,CAW1C,QATIwC,EAAStW,EAAE,QACXpkB,EAAQokB,EAAE,OACVuW,EAAMvW,EAAE,KAERqb,EAAU/E,EAAS,GAAK,OACxBgF,EAAS,CAAE,EACXC,EAAO,CAAE,EAEThb,EAAI,CAAE,EACDxoB,EAAI,EAAGA,EAAI87B,EAAM97B,IACxBwoB,EAAExoB,CAAC,EAAI,EAGT,IAAI6T,EAAGi4B,EAAGxkB,EAEV,IAAKzT,EAAI,EAAGi4B,EAAIjoC,EAAM,OAAQgQ,EAAIi4B,EAAGj4B,IAEnC2U,EAAE3kB,EAAMgQ,CAAC,CAAC,IAKZ,QAFIqa,EAAM,EAED9tB,EAAI,EAAGA,EAAI07B,EAAM17B,IAExBojC,EAAK,KAAKtV,CAAG,EAEbA,GAAO1F,EAAEpoB,CAAC,EAEVooB,EAAEpoB,CAAC,EAAIojC,EAAKpjC,CAAC,EAKf,IAFAojC,EAAK,KAAKtV,CAAG,EAER5G,EAAI,EAAGA,EAAIyU,EAASzU,IAEvB,QAAS6X,EAAKX,EAAIlX,CAAC,EAAG8X,EAAKZ,EAAIlX,EAAI,CAAC,EAAGF,EAAI+X,EAAI/X,EAAIgY,EAAIhY,IAAK,CAE1D,IAAI+C,EAAI3B,EAAE3kB,EAAMujB,CAAC,CAAC,IAElBmc,EAAOpZ,CAAC,EAAI7C,EAERiX,IACF+E,EAAQnZ,CAAC,EAAI3a,GAAM+uB,EAAOnX,CAAC,CAAC,EAEtC,CAGI,OAAOa,EAAE,mBAAmB,CAC1B,OAAQqb,EACR,MAAOC,EACP,IAAKC,EACL,KAAM,CAACzH,EAASD,CAAI,EACpB,SAAU7T,EAAE,SAClB,CAAK,CACL,CACA,CAAC,EC9JGjhB,GAAO,aACPic,GAAe,CAAC,QAAS,YAAa,MAAM,EACrCmrB,GAAkCprB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC/E,GAAI,CACF,MAAAvT,EACA,UAAAi9B,EACA,KAAAC,CACJ,EAAM3pB,EAuBJ,OAAOvT,EAAMpK,GAAM,CACjB,IAAK,SAAahH,EAAG,CACnB,OAAOsuC,EAAKD,EAAUruC,CAAC,CAAC,CAC9B,CACA,CAAG,CACH,CAAC,EChCGgH,GAAO,QACPic,GAAe,CAAC,QAAS,SAAU,SAAU,WAAW,EACjDsrB,GAA6BvrB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC1E,GAAI,CACF,MAAAvT,EACA,OAAAZ,EACA,OAAA8U,EACA,UAAAV,CACJ,EAAMD,EAiCJ,OAAOvT,EAAMpK,GAAM,CACjB,GAAI,UAAa,CACf,OAAOwJ,EAAO,SAAW,QAAUg+B,EAAO,EAAE,EAAIA,EAAO,CAAE,EAAE,SAAS,CACrE,EAGD,iCAAkC,SAA+BllC,EAAM,CACrE,IAAI0L,EAAO1L,EAAKA,EAAK,OAAS,CAAC,EAC/B,GAAI,OAAO0L,GAAS,SAAU,CAC5B,IAAI2L,EAASrX,EAAK,IAAK,EACvB,OAAOklC,EAAOllC,EAAMqX,CAAM,CAClC,KAAa,QAAInQ,EAAO,SAAW,QACpBg+B,EAAOllC,CAAI,EAEXklC,EAAOllC,EAAM,SAAS,CAEhC,EACD,MAAOklC,EACP,OAAQ,SAAgBllC,EAAM,CAC5B,IAAIqX,EAASrX,EAAK,QAAS,EAC3B,OAAOklC,EAAOllC,EAAK,QAAO,EAAIqX,CAAM,CACrC,EACD,yBAA0B,SAA2BrX,EAAMqX,EAAQ,CACjE,OAAO6tB,EAAOllC,EAAK,QAAO,EAAIqX,CAAM,CAC1C,CACA,CAAG,EASD,SAAS6tB,EAAOllC,EAAMqX,EAAQ,CAC5B,IAAI8tB,EAAgBC,EAAWplC,CAAI,EAC/ByZ,EAAe0rB,EAAgB,IAAI7pB,EAAU,CAAC,EAAI,EAEtD,GADAyR,EAAU/sB,CAAI,EACVqX,EAAQ,CAEV,IAAIsH,EAAI3C,EAAO3E,CAAM,EACrB,OAAIrX,EAAK,OAAS,EACT2e,EAAE,OAAO3e,EAAMyZ,CAAY,EAE7BkF,CACb,KAAW,CAEL,IAAIzJ,EAAM,CAAE,EACZ,OAAIlV,EAAK,OAAS,EACT3D,GAAO6Y,EAAKlV,EAAMyZ,CAAY,EAEhCvE,CACb,CACA,CAGE,SAASkwB,EAAWplC,EAAM,CACxB,IAAImlC,EAAgB,GACpB,OAAAnlC,EAAK,QAAQ,SAAUhK,EAAOuE,EAAO2a,EAAK,CACpCvR,GAAY3N,CAAK,IACnBmvC,EAAgB,GAChBjwB,EAAI3a,CAAK,EAAIvE,EAAM,SAAU,EAErC,CAAK,EACMmvC,CACX,CAGE,SAASpY,EAAU/sB,EAAM,CACvBA,EAAK,QAAQ,SAAUhK,EAAO,CAC5B,GAAI,OAAOA,GAAU,UAAY,CAAC6gB,GAAU7gB,CAAK,GAAKA,EAAQ,EAC5D,MAAM,IAAI,MAAM,wDAAwD,CAEhF,CAAK,CACL,CACA,CAAC,ECrHG0H,GAAO,UACPic,GAAe,CAAC,SAAU,aAAc,WAAW,EAC5C0rB,GAA+B3rB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC5E,GAAI,CACF,OAAQiqB,EACR,UAAA/B,EACA,SAAAgC,CACJ,EAAMlqB,EACAmqB,EAAkB,CACpB,OAAQ,GACR,OAAQ,GACR,UAAW,GACX,SAAU,EACX,EAGGC,EAAmB,CACrB,OAAQ/uC,GAAK4uC,EAAQ5uC,CAAC,EACtB,UAAW6sC,EAAY7sC,GAAK6sC,EAAU7sC,CAAC,EAAI0sC,GAC3C,SAAUmC,EAAW7uC,GAAK6uC,EAAS7uC,CAAC,EAAI2sC,EACzC,EA8BD,OAAO,SAAiBrtC,EAAO,CAC7B,IAAI0vC,EAAa,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,SACjFC,EAAQ,UAAU,OAAS,EAAI,UAAU,CAAC,EAAI,OAClD,GAAIA,IAAU,OACZ,MAAM,IAAI,YAAY,sCAAsC,EAE9D,IAAIC,EAAY3/B,GAAOjQ,CAAK,EAC5B,GAAI,EAAE4vC,KAAaJ,GACjB,MAAM,IAAI,UAAU,kBAAoBxvC,EAAQ,aAAe4vC,EAAY,4BAA8B,OAAO,KAAKJ,CAAe,EAAE,KAAK,IAAI,CAAC,EAElJ,GAAI,EAAEE,KAAcD,GAClB,MAAM,IAAI,UAAU,kBAAoBzvC,EAAQ,aAAe0vC,EAAa,6BAA+B,OAAO,KAAKD,CAAgB,EAAE,KAAK,IAAI,CAAC,EAErJ,OAAIC,IAAeE,EACV5vC,EAEAyvC,EAAiBC,CAAU,EAAE1vC,CAAK,CAE5C,CACH,CAAC,ECvEG0H,GAAO,eACPic,GAAe,CAAC,QAAS,SAAS,EAC3BksB,GAAoCnsB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACjF,GAAI,CACF,MAAAvT,EACA,QAAAg+B,CACJ,EAAMzqB,EAaJ,OAAOvT,EAAMpK,GAAM,CACjB,iBAAkB,SAAsBhH,EAAG2iB,EAAG,CAC5C,OAAO3iB,EAAI2iB,CACZ,EACD,mBAAoB,SAAwB3iB,EAAG2iB,EAAG,CAChD,OAAO3iB,EAAE,IAAI2iB,CAAC,CACf,EACD,uBAAwB,SAA4B3iB,EAAG2iB,EAAG,CACxD,OAAO3iB,EAAE,IAAI2iB,CAAC,CACf,EACD,qBAAsB,SAA0B3iB,EAAG2iB,EAAG,CACpD,OAAO3iB,EAAE,IAAI2iB,CAAC,CACf,EACD,uDAAwD,CAAC3iB,EAAG2iB,IAAM3iB,EAAE,OAAO2iB,CAAC,EAC5E,gDAAiD,CAAC3iB,EAAG2iB,IAAMA,EAAE,WAAW3iB,CAAC,CAC7E,CAAG,CACH,CAAC,EChCGgH,GAAO,MACPic,GAAe,CAAC,QAAS,SAAU,WAAY,WAAY,SAAU,MAAO,WAAY,SAAU,SAAS,EACpGosB,GAA2BrsB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACxE,GAAI,CACF,MAAAvT,EACA,OAAAZ,EACA,SAAA8+B,EACA,SAAAC,EACA,OAAAjqB,EACA,IAAAkqB,EACA,OAAAhO,EACA,SAAAqN,EACA,QAAAhqB,CACJ,EAAMF,EAuCJ,OAAOvT,EAAMpK,GAAM,CACjB,iBAAkByoC,EAClB,mBAAoB,SAAwBzvC,EAAG2iB,EAAG,CAChD,OAAO3iB,EAAE,IAAI2iB,CAAC,CACf,EACD,uBAAwB,SAA4B3iB,EAAG2iB,EAAG,CACxD,OAAIA,EAAE,UAAW,GAAI3iB,GAAK,GAAKwQ,EAAO,YAC7BxQ,EAAE,IAAI2iB,CAAC,EAEP,IAAIkC,EAAQ7kB,EAAE,WAAY,CAAC,EAAE,IAAI2iB,EAAE,SAAU,EAAE,CAAC,CAE1D,EACD,qBAAsB,SAA0B3iB,EAAG2iB,EAAG,CACpD,IAAI2S,EAASt1B,EAAE,IAAI2iB,CAAC,EACpB,GAAI2S,GAAU,KACZ,OAAOA,EAET,GAAI9kB,EAAO,YACT,MAAM,IAAI,MAAM,qEAAqE,EAErF,OAAOi/B,EAAKzvC,EAAE,QAAS,EAAE2iB,EAAE,QAAO,CAAE,CAEvC,EACD,gBAAiB+sB,EACjB,mBAAoB,SAAwB1vC,EAAG2iB,EAAG,CAChD,OAAO+sB,EAAU1vC,EAAG2iB,EAAE,SAAQ,CAAE,CACjC,EACD,iBAAkBgtB,EAClB,oBAAqB,SAAyB3vC,EAAG2iB,EAAG,CAClD,OAAOgtB,EAAW3vC,EAAG2iB,EAAE,SAAQ,CAAE,CAClC,EACD,2BAA4B,SAA6B3iB,EAAG2iB,EAAG,CAC7D,OAAO3iB,EAAE,IAAI2iB,CAAC,CACpB,CACA,CAAG,EASD,SAAS8sB,EAAKzvC,EAAG2iB,EAAG,CAGlB,GAAInS,EAAO,aAAe,CAAC2P,GAAUwC,CAAC,GAAK3iB,EAAI,EAE7C,GAAI,CACF,IAAI4vC,EAAQf,EAASlsB,CAAC,EAClBktB,EAAOrO,EAAOoO,CAAK,EACvB,IAAIjtB,IAAMktB,GAAQ,KAAK,KAAKltB,EAAIktB,GAAQltB,CAAC,EAAI,QACvCitB,EAAM,EAAI,IAAM,EAClB,OAAQA,EAAM,EAAI,IAAM,EAAI,EAAI,IAAM,KAAK,IAAI,CAAC5vC,EAAG2iB,CAAC,CAGzD,OAAQmtB,EAAI,CAEnB,CAQI,OAAIt/B,EAAO,cAAgBxQ,EAAI,IAAM2iB,IAAM,KAAY3iB,EAAI,IAAMA,EAAI,GAAK2iB,IAAM,MACvE,IAELxC,GAAUwC,CAAC,GAAK3iB,GAAK,GAAKwQ,EAAO,YAC5BqsB,GAAU78B,EAAG2iB,CAAC,EAMjB3iB,EAAIA,EAAI,GAAK2iB,IAAM,KAAY3iB,EAAIA,EAAI,GAAK2iB,IAAM,KAC7C,EAEF,IAAIkC,EAAQ7kB,EAAG,CAAC,EAAE,IAAI2iB,EAAG,CAAC,CAEvC,CASE,SAAS+sB,EAAU1vC,EAAG2iB,EAAG,CACvB,GAAI,CAACxC,GAAUwC,CAAC,EACd,MAAM,IAAI,UAAU,2CAA6CA,EAAI,GAAG,EAG1E,IAAIzO,EAAI5K,GAAKtJ,CAAC,EACd,GAAIkU,EAAE,SAAW,EACf,MAAM,IAAI,MAAM,2CAA6CA,EAAE,OAAS,cAAc,EAExF,GAAIA,EAAE,CAAC,IAAMA,EAAE,CAAC,EACd,MAAM,IAAI,MAAM,sCAAwCA,EAAE,CAAC,EAAI,IAAMA,EAAE,CAAC,EAAI,GAAG,EAEjF,GAAIyO,EAAI,EACN,GAAI,CACF,OAAO+sB,EAAUF,EAAIxvC,CAAC,EAAG,CAAC2iB,CAAC,CAC5B,OAAQotB,EAAO,CACd,MAAIA,EAAM,UAAY,gDACd,IAAI,UAAU,6EAA+EptB,EAAI,GAAG,EAEtGotB,CACd,CAII,QAFI3d,EAAMkd,EAASp7B,EAAE,CAAC,CAAC,EAAE,QAAS,EAC9BoV,EAAKtpB,EACF2iB,GAAK,IACLA,EAAI,KAAO,IACdyP,EAAMmd,EAASjmB,EAAI8I,CAAG,GAExBzP,IAAM,EACN2G,EAAKimB,EAASjmB,EAAIA,CAAE,EAEtB,OAAO8I,CACX,CASE,SAASud,EAAW3vC,EAAG2iB,EAAG,CACxB,OAAO2C,EAAOoqB,EAAU1vC,EAAE,QAAS,EAAE2iB,CAAC,CAAC,CAC3C,CACA,CAAC,EC3LM,SAASqtB,GAAsBrrB,EAAM,CAC1C,GAAI,CACF,YAAAG,CACJ,EAAMH,EAUJ,OAAO,SAAyBsD,EAAGnY,EAAGO,EAAM,CAC1C,IAAI4/B,EAAQhoB,EAAE,KAAM,EACpB,GAAIgoB,EAAM,SAAW,EACnB,MAAM,IAAI,WAAW,yCAA2CtvB,GAAOsvB,CAAK,EAAI,GAAG,EAErF,IAAInU,EAAOmU,EAAM,CAAC,EACdlU,EAAUkU,EAAM,CAAC,EACrB,GAAInU,IAASC,EACX,MAAM,IAAI,WAAW,gCAAkCpb,GAAOsvB,CAAK,EAAI,GAAG,EAE5E,IAAI9xC,EAAO,CAAE,EACb,GAAIoP,GAASuC,CAAC,EAAG,CACf,IAAIogC,EAAQpgC,EAAE,KAAM,EAChBw1B,EAAQx1B,EAAE,MAGd,GAAIogC,EAAM,SAAW,EAAG,CACtB,GAAIA,EAAM,CAAC,IAAMpU,EACf,MAAM,IAAI,WAAW,8DAA8D,EAErF,QAAS17B,EAAI,EAAGA,EAAI07B,EAAM17B,IACxBjC,EAAKiC,CAAC,EAAI,CAACklC,EAAMllC,CAAC,CAAC,EAErB,OAAO,IAAI0kB,EAAY,CACrB,KAAA3mB,EACA,KAAM,CAAC29B,EAAM,CAAC,EACd,SAAUhsB,EAAE,SACtB,CAAS,CACT,CAGM,GAAIogC,EAAM,SAAW,EAAG,CACtB,GAAIA,EAAM,CAAC,IAAMpU,GAAQoU,EAAM,CAAC,IAAM,EACpC,MAAM,IAAI,WAAW,8DAA8D,EAErF,GAAIziC,GAAcqC,CAAC,EAAG,CACpB,GAAIO,EAAM,CACRlS,EAAO,CAAE,EACT,QAASo7B,EAAK,EAAGA,EAAKuC,EAAMvC,IAC1Bp7B,EAAKo7B,CAAE,EAAI,CAAC+L,EAAM/L,CAAE,EAAE,CAAC,CAAC,EAE1B,OAAO,IAAIzU,EAAY,CACrB,KAAA3mB,EACA,KAAM,CAAC29B,EAAM,CAAC,EACd,SAAUhsB,EAAE,SAC1B,CAAa,CACb,CACU,OAAOA,CACjB,CACQ,GAAIpC,GAAeoC,CAAC,EAAG,CACrB,QAAS2vB,EAAM,EAAGA,EAAM3D,EAAM2D,IAC5BthC,EAAKshC,CAAG,EAAI,CAAC,CAAC,EAKhB,QAHIlB,EAASzuB,EAAE,QACXjM,EAAQiM,EAAE,OACV0uB,EAAM1uB,EAAE,KACHsvB,EAAKZ,EAAI,CAAC,EAAGpX,EAAIoX,EAAI,CAAC,EAAGpX,EAAIgY,EAAIhY,IAAK,CAC7C,IAAIsY,EAAM77B,EAAMujB,CAAC,EACjBjpB,EAAKuhC,CAAG,EAAE,CAAC,EAAInB,EAAOnX,CAAC,CACnC,CACU,OAAO,IAAItC,EAAY,CACrB,KAAA3mB,EACA,KAAM,CAAC29B,EAAM,CAAC,EACd,SAAUhsB,EAAE,SACxB,CAAW,CACX,CACA,CACM,MAAM,IAAI,WAAW,iFAAiF,CAC5G,CACI,GAAIxC,GAAQwC,CAAC,EAAG,CACd,IAAI20B,EAAQrO,GAAUtmB,CAAC,EACvB,GAAI20B,EAAM,SAAW,EAAG,CACtB,GAAIA,EAAM,CAAC,IAAM3I,EACf,MAAM,IAAI,WAAW,8DAA8D,EAErF,QAASsE,EAAM,EAAGA,EAAMtE,EAAMsE,IAC5BjiC,EAAKiiC,CAAG,EAAI,CAACtwB,EAAEswB,CAAG,CAAC,EAErB,OAAO,IAAItb,EAAY,CACrB,KAAA3mB,EACA,KAAM,CAAC29B,EAAM,CAAC,CACxB,CAAS,CACT,CACM,GAAI2I,EAAM,SAAW,EAAG,CACtB,GAAIA,EAAM,CAAC,IAAM3I,GAAQ2I,EAAM,CAAC,IAAM,EACpC,MAAM,IAAI,WAAW,8DAA8D,EAErF,QAASpE,EAAM,EAAGA,EAAMvE,EAAMuE,IAC5BliC,EAAKkiC,CAAG,EAAI,CAACvwB,EAAEuwB,CAAG,EAAE,CAAC,CAAC,EAExB,OAAO,IAAIvb,EAAY,CACrB,KAAA3mB,EACA,KAAM,CAAC29B,EAAM,CAAC,CACxB,CAAS,CACT,CACM,MAAM,IAAI,WAAW,iFAAiF,CAC5G,CACG,CACH,CChHA,IAAI90B,GAAO,SACPic,GAAe,CAAC,QAAS,SAAU,eAAgB,iBAAkB,iBAAkB,cAAe,aAAa,EAC5GktB,GAA8BntB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC3E,GAAI,CACF,MAAAvT,EACA,OAAAkU,EACA,aAAA8qB,EACA,eAAAjJ,EACA,eAAAgD,EACA,YAAA1M,EACA,YAAA3Y,CACJ,EAAMH,EACA0rB,EAAkBL,GAAsB,CAC1C,YAAAlrB,CACJ,CAAG,EA0BD,OAAO1T,EAAMpK,GAAM,CACjB,+BAAgC,SAAiCihB,EAAGnY,EAAG,CACrE,OAAOwgC,EAA4BroB,EAAGnY,CAAC,CACxC,EACD,8BAA+B,SAAgCmY,EAAGnY,EAAG,CACnE,OAAOygC,EAA2BtoB,EAAGnY,CAAC,CACvC,EACD,wBAAyB,SAA0BD,EAAGC,EAAG,CACvD,IAAImY,EAAI3C,EAAOzV,CAAC,EACZ/C,EAAIyjC,EAA2BtoB,EAAGnY,CAAC,EACvC,OAAOhD,EAAE,QAAS,CACxB,CACA,CAAG,EACD,SAASyjC,EAA2BtoB,EAAGnY,EAAG,CAExCA,EAAIugC,EAAgBpoB,EAAGnY,EAAG,EAAI,EAS9B,QARIw1B,EAAQx1B,EAAE,MACVgsB,EAAO7T,EAAE,MAAM,CAAC,EAChB8T,EAAU9T,EAAE,MAAM,CAAC,EAGnBjoB,EAAI,CAAE,EACNwwC,EAAQvoB,EAAE,MAELX,EAAIyU,EAAU,EAAGzU,GAAK,EAAGA,IAAK,CAErC,IAAImpB,EAAKnL,EAAMhe,CAAC,EAAE,CAAC,GAAK,EAEpBopB,EAAK,OACT,GAAKjT,EAAYgT,EAAI,CAAC,EAgBpBC,EAAK,MAhBkB,CAEvB,IAAIC,EAAMH,EAAMlpB,CAAC,EAAEA,CAAC,EACpB,GAAImW,EAAYkT,EAAK,CAAC,EAEpB,MAAM,IAAI,MAAM,yDAAyD,EAE3ED,EAAKN,EAAaK,EAAIE,CAAG,EAGzB,QAASvwC,EAAIknB,EAAI,EAAGlnB,GAAK,EAAGA,IAE1BklC,EAAMllC,CAAC,EAAI,CAAC+pC,EAAe7E,EAAMllC,CAAC,EAAE,CAAC,GAAK,EAAG+mC,EAAeuJ,EAAIF,EAAMpwC,CAAC,EAAEknB,CAAC,CAAC,CAAC,CAAC,CAEvF,CAKMtnB,EAAEsnB,CAAC,EAAI,CAACopB,CAAE,CAChB,CACI,OAAO,IAAI5rB,EAAY,CACrB,KAAM9kB,EACN,KAAM,CAAC87B,EAAM,CAAC,CACpB,CAAK,CACL,CACE,SAASwU,EAA4BroB,EAAGnY,EAAG,CAEzCA,EAAIugC,EAAgBpoB,EAAGnY,EAAG,EAAI,EAY9B,QAXIw1B,EAAQx1B,EAAE,MACVgsB,EAAO7T,EAAE,MAAM,CAAC,EAChB8T,EAAU9T,EAAE,MAAM,CAAC,EACnBsW,EAAStW,EAAE,QACXpkB,EAAQokB,EAAE,OACVuW,EAAMvW,EAAE,KAGRjoB,EAAI,CAAE,EAGDsnB,EAAIyU,EAAU,EAAGzU,GAAK,EAAGA,IAAK,CACrC,IAAImpB,EAAKnL,EAAMhe,CAAC,EAAE,CAAC,GAAK,EACxB,GAAKmW,EAAYgT,EAAI,CAAC,EAuCpBzwC,EAAEsnB,CAAC,EAAI,CAAC,CAAC,MAvCc,CAcvB,QAXIqpB,EAAM,EAGNC,EAAU,CAAE,EACZC,EAAW,CAAE,EAGbC,EAAatS,EAAIlX,CAAC,EAClBypB,EAAYvS,EAAIlX,EAAI,CAAC,EAGhBF,EAAI2pB,EAAY,EAAG3pB,GAAK0pB,EAAY1pB,IAAK,CAChD,IAAIhnB,EAAIyD,EAAMujB,CAAC,EAGXhnB,IAAMknB,EACRqpB,EAAMpS,EAAOnX,CAAC,EACLhnB,EAAIknB,IAEbspB,EAAQ,KAAKrS,EAAOnX,CAAC,CAAC,EACtBypB,EAAS,KAAKzwC,CAAC,EAE3B,CAGQ,GAAIq9B,EAAYkT,EAAK,CAAC,EACpB,MAAM,IAAI,MAAM,yDAAyD,EAG3E,QADID,EAAKN,EAAaK,EAAIE,CAAG,EACpBxQ,EAAK,EAAG6Q,EAAaH,EAAS,OAAQ1Q,EAAK6Q,EAAY7Q,IAAM,CACpE,IAAI5G,EAAKsX,EAAS1Q,CAAE,EACpBmF,EAAM/L,CAAE,EAAI,CAAC4Q,EAAe7E,EAAM/L,CAAE,EAAE,CAAC,EAAG4N,EAAeuJ,EAAIE,EAAQzQ,CAAE,CAAC,CAAC,CAAC,CACpF,CACQngC,EAAEsnB,CAAC,EAAI,CAACopB,CAAE,CAClB,CAIA,CACI,OAAO,IAAI5rB,EAAY,CACrB,KAAM9kB,EACN,KAAM,CAAC87B,EAAM,CAAC,CACpB,CAAK,CACL,CACA,CAAC,EC9JG90B,GAAO,YACPic,GAAe,CAAC,QAAS,SAAU,eAAgB,iBAAkB,iBAAkB,cAAe,aAAa,EAC5GguB,GAAiCjuB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC9E,GAAI,CACF,MAAAvT,EACA,OAAAkU,EACA,aAAA8qB,EACA,eAAAjJ,EACA,eAAAgD,EACA,YAAA1M,EACA,YAAA3Y,CACJ,EAAMH,EACA0rB,EAAkBL,GAAsB,CAC1C,YAAAlrB,CACJ,CAAG,EA0BD,OAAO1T,EAAMpK,GAAM,CACjB,+BAAgC,SAAiCihB,EAAGnY,EAAG,CACrE,OAAOwgC,EAA4BroB,EAAGnY,CAAC,CACxC,EACD,8BAA+B,SAAgCmY,EAAGnY,EAAG,CACnE,OAAOygC,EAA2BtoB,EAAGnY,CAAC,CACvC,EACD,wBAAyB,SAA0BD,EAAGC,EAAG,CACvD,IAAImY,EAAI3C,EAAOzV,CAAC,EACZqhC,EAAIX,EAA2BtoB,EAAGnY,CAAC,EACvC,OAAOohC,EAAE,IAAIpkC,GAAKA,EAAE,QAAO,CAAE,CACnC,CACA,CAAG,EACD,SAASyjC,EAA2BtoB,EAAGkpB,EAAI,CAWzC,QANIlY,EAAI,CAACoX,EAAgBpoB,EAAGkpB,EAAI,EAAI,EAAE,MAAM,IAAI9vC,GAAKA,EAAE,CAAC,CAAC,CAAC,EACtDwyB,EAAI5L,EAAE,MACN6T,EAAO7T,EAAE,MAAM,CAAC,EAChB8T,EAAU9T,EAAE,MAAM,CAAC,EAGd7nB,EAAI27B,EAAU,EAAG37B,GAAK,EAAGA,IAIhC,QAHIgxC,EAAInY,EAAE,OAGD7R,EAAI,EAAGA,EAAIgqB,EAAGhqB,IAAK,CAC1B,IAAItX,EAAImpB,EAAE7R,CAAC,EACX,GAAKqW,EAAY5J,EAAEzzB,CAAC,EAAEA,CAAC,EAAG,CAAC,EAQpB,GAAKq9B,EAAY3tB,EAAE1P,CAAC,EAAG,CAAC,GAYxB,GAAIgnB,IAAM,EAAG,CAGlB,IAAIiqB,EAAO,CAAC,GAAGvhC,CAAC,EAChBuhC,EAAKjxC,CAAC,EAAI,EACV,QAASu/B,EAAKv/B,EAAI,EAAGu/B,GAAM,EAAGA,IAC5B0R,EAAK1R,CAAE,EAAIwK,EAAekH,EAAK1R,CAAE,EAAG9L,EAAE8L,CAAE,EAAEv/B,CAAC,CAAC,EAE9C64B,EAAE,KAAKoY,CAAI,CACrB,MArB0C,CAGhC,GAAIjqB,IAAM,EAER,MAAO,CAAE,EAGT6R,EAAE,OAAO7R,EAAG,CAAC,EACbA,GAAK,EACLgqB,GAAK,CAEjB,KApBsC,CAG5BthC,EAAE1P,CAAC,EAAIgwC,EAAatgC,EAAE1P,CAAC,EAAGyzB,EAAEzzB,CAAC,EAAEA,CAAC,CAAC,EACjC,QAASknB,EAAIlnB,EAAI,EAAGknB,GAAK,EAAGA,IAE1BxX,EAAEwX,CAAC,EAAI6iB,EAAer6B,EAAEwX,CAAC,EAAG6f,EAAer3B,EAAE1P,CAAC,EAAGyzB,EAAEvM,CAAC,EAAElnB,CAAC,CAAC,CAAC,CAErE,CAsBA,CAEI,OAAO64B,EAAE,IAAIj5B,GAAK,IAAI8kB,EAAY,CAChC,KAAM9kB,EAAE,IAAIqB,GAAK,CAACA,CAAC,CAAC,EACpB,KAAM,CAACy6B,EAAM,CAAC,CACpB,CAAK,CAAC,CACN,CACE,SAASwU,EAA4BroB,EAAGkpB,EAAI,CAU1C,QARIlY,EAAI,CAACoX,EAAgBpoB,EAAGkpB,EAAI,EAAI,EAAE,MAAM,IAAI9vC,IAAKA,GAAE,CAAC,CAAC,CAAC,EACtDy6B,EAAO7T,EAAE,MAAM,CAAC,EAChB8T,EAAU9T,EAAE,MAAM,CAAC,EACnBsW,EAAStW,EAAE,QACXpkB,EAAQokB,EAAE,OACVuW,EAAMvW,EAAE,KAGH7nB,EAAI27B,EAAU,EAAG37B,GAAK,EAAGA,IAIhC,QAHIgxC,EAAInY,EAAE,OAGD7R,EAAI,EAAGA,EAAIgqB,EAAGhqB,IAAK,CAa1B,QAZI,EAAI6R,EAAE7R,CAAC,EAGPkqB,EAAU,CAAE,EACZC,EAAW,CAAE,EAGbT,EAAatS,EAAIp+B,CAAC,EAClB2wC,EAAYvS,EAAIp+B,EAAI,CAAC,EAGrBoxC,EAAM,EACDlqB,EAAIypB,EAAY,EAAGzpB,GAAKwpB,EAAYxpB,IAAK,CAChD,IAAImqB,EAAI5tC,EAAMyjB,CAAC,EAEXmqB,IAAMrxC,EACRoxC,EAAMjT,EAAOjX,CAAC,EACLmqB,EAAIrxC,IAEbkxC,EAAQ,KAAK/S,EAAOjX,CAAC,CAAC,EACtBiqB,EAAS,KAAKE,CAAC,EAE3B,CACQ,GAAKhU,EAAY+T,EAAK,CAAC,EAUhB,GAAK/T,EAAY,EAAEr9B,CAAC,EAAG,CAAC,GAYxB,GAAIgnB,IAAM,EAAG,CAGlB,IAAIiqB,EAAO,CAAC,GAAG,CAAC,EAChBA,EAAKjxC,CAAC,EAAI,EAGV,QAASsxC,EAAM,EAAGC,EAAcJ,EAAS,OAAQG,EAAMC,EAAaD,IAAO,CACzE,IAAIE,GAAML,EAASG,CAAG,EACtBL,EAAKO,EAAG,EAAIzH,EAAekH,EAAKO,EAAG,EAAGN,EAAQI,CAAG,CAAC,CAC9D,CACUzY,EAAE,KAAKoY,CAAI,CACrB,MAxB0C,CAGhC,GAAIjqB,IAAM,EAER,MAAO,CAAE,EAGT6R,EAAE,OAAO7R,EAAG,CAAC,EACbA,GAAK,EACLgqB,GAAK,CAEjB,KAtBkC,CAGxB,EAAEhxC,CAAC,EAAIgwC,EAAa,EAAEhwC,CAAC,EAAGoxC,CAAG,EAG7B,QAASK,EAAM,EAAGb,EAAaO,EAAS,OAAQM,EAAMb,EAAYa,IAAO,CACvE,IAAIC,EAAKP,EAASM,CAAG,EACrB,EAAEC,CAAE,EAAI3H,EAAe,EAAE2H,CAAE,EAAG3K,EAAe,EAAE/mC,CAAC,EAAGkxC,EAAQO,CAAG,CAAC,CAAC,CAC5E,CACA,CAyBA,CAEI,OAAO5Y,EAAE,IAAIj5B,IAAK,IAAI8kB,EAAY,CAChC,KAAM9kB,GAAE,IAAIqB,GAAK,CAACA,CAAC,CAAC,EACpB,KAAM,CAACy6B,EAAM,CAAC,CACpB,CAAK,CAAC,CACN,CACA,CAAC,ECxLG90B,GAAO,QACPic,GAAe,CAAC,QAAS,SAAU,cAAe,cAAe,QAAQ,EAClE8uB,GAA6B/uB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC1E,GAAI,CACF,MAAAvT,EACA,OAAAkU,EACA,YAAAmY,EACA,YAAA3Y,EACA,OAAAiU,CACJ,EAAMpU,EACA2lB,EAAgBnG,GAAoB,CACtC,MAAA/yB,CACJ,CAAG,EACG4gC,EAAgBrH,GAAoB,CACtC,MAAAv5B,EACA,YAAA0T,CACJ,CAAG,EACG2lB,EAAgBhH,GAAoB,CACtC,MAAAryB,EACA,YAAA0T,CACJ,CAAG,EACG4lB,EAAuBvE,GAA2B,CACpD,MAAA/0B,EACA,OAAAkU,EACA,OAAAyT,CACJ,CAAG,EA8CD,OAAO3nB,EAAMpK,GAAMirC,GAAkB,CACnC,MAAA7gC,EACA,YAAAqsB,CACD,GAAGiN,EAAqB,CACvB,KAAMjN,EACN,GAAIuU,EACJ,GAAI1H,EACJ,GAAIG,CACR,CAAG,CAAC,CACJ,CAAC,EACUwH,GAAoBjvB,GAAQhc,GAAM,CAAC,QAAS,aAAa,EAAGu2B,GAAS,CAC9E,GAAI,CACF,MAAAnsB,EACA,YAAAqsB,CACJ,EAAMF,EACJ,OAAOnsB,EAAMpK,GAAM,CACjB,WAAY,SAAgBhH,EAAG2iB,EAAG,CAEhC,OAAI3iB,IAAM,KACD2iB,IAAM,KAEXA,IAAM,KACD3iB,IAAM,KAEXA,IAAM,OACD2iB,IAAM,OAEXA,IAAM,OACD3iB,IAAM,OAERy9B,EAAYz9B,EAAG2iB,CAAC,CAC7B,CACA,CAAG,CACH,CAAC,ECrGG3b,GAAO,UACPic,GAAe,CAAC,QAAS,SAAU,SAAU,cAAe,QAAQ,EAC7DivB,GAA+BlvB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC5E,GAAI,CACF,MAAAvT,EACA,OAAAZ,EACA,OAAA8U,EACA,YAAAR,EACA,OAAAiU,CACJ,EAAMpU,EACA2lB,EAAgBnG,GAAoB,CACtC,MAAA/yB,CACJ,CAAG,EACG4gC,EAAgBrH,GAAoB,CACtC,MAAAv5B,EACA,YAAA0T,CACJ,CAAG,EACG2lB,EAAgBhH,GAAoB,CACtC,MAAAryB,EACA,YAAA0T,CACJ,CAAG,EACG4lB,EAAuBvE,GAA2B,CACpD,MAAA/0B,EACA,OAAAkU,EACA,OAAAyT,CACJ,CAAG,EACGsE,EAAeF,GAAmB,CACpC,MAAA/rB,CACJ,CAAG,EAiCD,OAAOA,EAAMpK,GAAMmrC,GAAoB,CACrC,MAAA/gC,EACA,OAAAZ,CACJ,CAAG,EAAG,CACF,mBAAoB,CAACxQ,EAAG2iB,IAAM3iB,EAAI2iB,EAClC,uBAAwB,SAA4B3iB,EAAG2iB,EAAG,CACxD,OAAO3iB,EAAE,GAAG2iB,CAAC,GAAK,CAAC2a,GAAet9B,EAAG2iB,EAAGnS,EAAO,OAAO,CACvD,EACD,qBAAsB,CAACxQ,EAAG2iB,IAAM3iB,EAAE,QAAQ2iB,CAAC,IAAM,GACjD,mBAAoB,SAAwB3iB,EAAG2iB,EAAG,CAChD,MAAM,IAAI,UAAU,qDAAqD,CAC/E,CACA,EAAK0a,EAAcqN,EAAqB,CACpC,GAAIsH,EACJ,GAAI1H,EACJ,GAAIG,CACR,CAAG,CAAC,CACJ,CAAC,EACU0H,GAAqCnvB,GAAQhc,GAAM,CAAC,QAAS,QAAQ,EAAGu2B,GAAS,CAC1F,GAAI,CACF,MAAAnsB,EACA,OAAAZ,CACJ,EAAM+sB,EACJ,OAAOnsB,EAAMpK,GAAM,CACjB,iBAAkB,SAAsBhH,EAAG2iB,EAAG,CAC5C,OAAO3iB,EAAI2iB,GAAK,CAACD,GAAY1iB,EAAG2iB,EAAGnS,EAAO,OAAO,CACvD,CACA,CAAG,CACH,CAAC,ECzFGxJ,GAAO,YACPic,GAAe,CAAC,QAAS,SAAU,SAAU,cAAe,QAAQ,EAC7DmvB,GAAiCpvB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC9E,GAAI,CACF,MAAAvT,EACA,OAAAZ,EACA,OAAA8U,EACA,YAAAR,EACA,OAAAiU,CACJ,EAAMpU,EACA2lB,EAAgBnG,GAAoB,CACtC,MAAA/yB,CACJ,CAAG,EACG4gC,EAAgBrH,GAAoB,CACtC,MAAAv5B,EACA,YAAA0T,CACJ,CAAG,EACG2lB,EAAgBhH,GAAoB,CACtC,MAAAryB,EACA,YAAA0T,CACJ,CAAG,EACG4lB,EAAuBvE,GAA2B,CACpD,MAAA/0B,EACA,OAAAkU,EACA,OAAAyT,CACJ,CAAG,EACGsE,EAAeF,GAAmB,CACpC,MAAA/rB,CACJ,CAAG,EA6BD,OAAOA,EAAMpK,GAAMqrC,GAAsB,CACvC,MAAAjhC,EACA,OAAAZ,CACJ,CAAG,EAAG,CACF,mBAAoB,CAACxQ,EAAG2iB,IAAM3iB,GAAK2iB,EACnC,uBAAwB,SAA4B3iB,EAAG2iB,EAAG,CACxD,OAAO3iB,EAAE,IAAI2iB,CAAC,GAAK2a,GAAet9B,EAAG2iB,EAAGnS,EAAO,OAAO,CACvD,EACD,qBAAsB,CAACxQ,EAAG2iB,IAAM3iB,EAAE,QAAQ2iB,CAAC,IAAM,EACjD,mBAAoB,UAA0B,CAC5C,MAAM,IAAI,UAAU,qDAAqD,CAC/E,CACA,EAAK0a,EAAcqN,EAAqB,CACpC,GAAIsH,EACJ,GAAI1H,EACJ,GAAIG,CACR,CAAG,CAAC,CACJ,CAAC,EACU4H,GAAuCrvB,GAAQhc,GAAM,CAAC,QAAS,QAAQ,EAAGu2B,GAAS,CAC5F,GAAI,CACF,MAAAnsB,EACA,OAAAZ,CACJ,EAAM+sB,EACJ,OAAOnsB,EAAMpK,GAAM,CACjB,iBAAkB,SAAsBhH,EAAG2iB,EAAG,CAC5C,OAAO3iB,GAAK2iB,GAAKD,GAAY1iB,EAAG2iB,EAAGnS,EAAO,OAAO,CACvD,CACA,CAAG,CACH,CAAC,ECrFGxJ,GAAO,SACPic,GAAe,CAAC,QAAS,SAAU,SAAU,cAAe,QAAQ,EAC7DqvB,GAA8BtvB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC3E,GAAI,CACF,MAAAvT,EACA,OAAAZ,EACA,OAAA8U,EACA,YAAAR,EACA,OAAAiU,CACJ,EAAMpU,EACA2lB,EAAgBnG,GAAoB,CACtC,MAAA/yB,CACJ,CAAG,EACG4gC,EAAgBrH,GAAoB,CACtC,MAAAv5B,EACA,YAAA0T,CACJ,CAAG,EACG2lB,EAAgBhH,GAAoB,CACtC,MAAAryB,EACA,YAAA0T,CACJ,CAAG,EACG4lB,EAAuBvE,GAA2B,CACpD,MAAA/0B,EACA,OAAAkU,EACA,OAAAyT,CACJ,CAAG,EACGsE,EAAeF,GAAmB,CACpC,MAAA/rB,CACJ,CAAG,EAiCD,OAAOA,EAAMpK,GAAMurC,GAAmB,CACpC,MAAAnhC,EACA,OAAAZ,CACJ,CAAG,EAAG,CACF,mBAAoB,CAACxQ,EAAG2iB,IAAM3iB,EAAI2iB,EAClC,uBAAwB,SAA4B3iB,EAAG2iB,EAAG,CACxD,OAAO3iB,EAAE,GAAG2iB,CAAC,GAAK,CAAC2a,GAAet9B,EAAG2iB,EAAGnS,EAAO,OAAO,CACvD,EACD,qBAAsB,CAACxQ,EAAG2iB,IAAM3iB,EAAE,QAAQ2iB,CAAC,IAAM,EACjD,mBAAoB,UAA0B,CAC5C,MAAM,IAAI,UAAU,qDAAqD,CAC/E,CACA,EAAK0a,EAAcqN,EAAqB,CACpC,GAAIsH,EACJ,GAAI1H,EACJ,GAAIG,CACR,CAAG,CAAC,CACJ,CAAC,EACU8H,GAAoCvvB,GAAQhc,GAAM,CAAC,QAAS,QAAQ,EAAGu2B,GAAS,CACzF,GAAI,CACF,MAAAnsB,EACA,OAAAZ,CACJ,EAAM+sB,EACJ,OAAOnsB,EAAMpK,GAAM,CACjB,iBAAkB,SAAsBhH,EAAG2iB,EAAG,CAC5C,OAAO3iB,EAAI2iB,GAAK,CAACD,GAAY1iB,EAAG2iB,EAAGnS,EAAO,OAAO,CACvD,CACA,CAAG,CACH,CAAC,ECzFGxJ,GAAO,WACPic,GAAe,CAAC,QAAS,SAAU,SAAU,cAAe,QAAQ,EAC7DuvB,GAAgCxvB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC7E,GAAI,CACF,MAAAvT,EACA,OAAAZ,EACA,OAAA8U,EACA,YAAAR,EACA,OAAAiU,CACJ,EAAMpU,EACA2lB,EAAgBnG,GAAoB,CACtC,MAAA/yB,CACJ,CAAG,EACG4gC,EAAgBrH,GAAoB,CACtC,MAAAv5B,EACA,YAAA0T,CACJ,CAAG,EACG2lB,EAAgBhH,GAAoB,CACtC,MAAAryB,EACA,YAAA0T,CACJ,CAAG,EACG4lB,EAAuBvE,GAA2B,CACpD,MAAA/0B,EACA,OAAAkU,EACA,OAAAyT,CACJ,CAAG,EACGsE,EAAeF,GAAmB,CACpC,MAAA/rB,CACJ,CAAG,EA6BD,OAAOA,EAAMpK,GAAMyrC,GAAqB,CACtC,MAAArhC,EACA,OAAAZ,CACJ,CAAG,EAAG,CACF,mBAAoB,CAACxQ,EAAG2iB,IAAM3iB,GAAK2iB,EACnC,uBAAwB,SAA4B3iB,EAAG2iB,EAAG,CACxD,OAAO3iB,EAAE,IAAI2iB,CAAC,GAAK2a,GAAet9B,EAAG2iB,EAAGnS,EAAO,OAAO,CACvD,EACD,qBAAsB,CAACxQ,EAAG2iB,IAAM3iB,EAAE,QAAQ2iB,CAAC,IAAM,GACjD,mBAAoB,UAA0B,CAC5C,MAAM,IAAI,UAAU,qDAAqD,CAC/E,CACA,EAAK0a,EAAcqN,EAAqB,CACpC,GAAIsH,EACJ,GAAI1H,EACJ,GAAIG,CACR,CAAG,CAAC,CACJ,CAAC,EACUgI,GAAsCzvB,GAAQhc,GAAM,CAAC,QAAS,QAAQ,EAAGu2B,GAAS,CAC3F,GAAI,CACF,MAAAnsB,EACA,OAAAZ,CACJ,EAAM+sB,EACJ,OAAOnsB,EAAMpK,GAAM,CACjB,iBAAkB,SAAsBhH,EAAG2iB,EAAG,CAC5C,OAAO3iB,GAAK2iB,GAAKD,GAAY1iB,EAAG2iB,EAAGnS,EAAO,OAAO,CACvD,CACA,CAAG,CACH,CAAC,EC1FGxJ,GAAO,uBACPic,GAAe,CAAC,UAAW,aAAa,EACjCyvB,GAAiD1vB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC9F,GAAI,CACF,QAAAmoB,EACA,YAAAhoB,CACJ,EAAMH,EACJ,SAASguB,EAAqBx0C,EAAM42B,EAAU,CAC5C,GAAI,EAAE,gBAAgB4d,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,GAAI5d,GAAY,CAAC1nB,GAAS0nB,CAAQ,EAChC,MAAM,IAAI,MAAM,qBAAuBA,CAAQ,EAEjD,GAAIxnB,GAASpP,CAAI,GAAKmP,GAAQnP,CAAI,EAAG,CAEnC,IAAImnB,EAAS,IAAIR,EAAY3mB,EAAM42B,CAAQ,EAE3C,KAAK,MAAQzP,EAAO,MACpB,KAAK,MAAQA,EAAO,MACpB,KAAK,UAAYA,EAAO,UACxB,KAAK,KAAO,KACZ,KAAK,KAAO,IAClB,SAAennB,GAAQmP,GAAQnP,EAAK,IAAI,GAAKmP,GAAQnP,EAAK,IAAI,EAExD,KAAK,MAAQA,EAAK,KAClB,KAAK,MAAQA,EAAK,KAClB,KAAK,UAAYA,EAAK,SACtB,KAAK,KAAO,OAAOA,EAAK,KAAQ,YAAcA,EAAK,IAAM,KACzD,KAAK,KAAO,OAAOA,EAAK,KAAQ,YAAcA,EAAK,IAAM,SACpD,IAAIA,EAET,MAAM,IAAI,UAAU,6BAA+BoR,GAAOpR,CAAI,EAAI,GAAG,EAGrE,KAAK,MAAQ,CAAE,EACf,KAAK,MAAQ,CAAC,CAAC,EACf,KAAK,UAAY42B,EACjB,KAAK,KAAO,KACZ,KAAK,KAAO,KAElB,CACE,OAAA4d,EAAqB,UAAY,IAAI7tB,EAKrC6tB,EAAqB,UAAU,KAAO,uBACtCA,EAAqB,UAAU,uBAAyB,GAexDA,EAAqB,UAAU,OAAS,SAAU9uC,EAAO,CACvD,OAAQ,UAAU,OAAM,CACtB,IAAK,GACH,CAEE,IAAIokB,EAAInD,EAAY,UAAU,OAAO,KAAK,KAAMjhB,CAAK,EAErD,OAAI0J,GAAS0a,CAAC,EAEL,IAAI0qB,EAAqB,CAC9B,KAAM1qB,EAAE,MACR,KAAMA,EAAE,MACR,SAAUA,EAAE,SAC1B,CAAa,EAEIA,CACjB,CAEM,IAAK,GACL,IAAK,GACH,MAAM,IAAI,MAAM,0DAA0D,EAC5E,QACE,MAAM,IAAI,YAAY,2BAA2B,CACzD,CACG,EAWD0qB,EAAqB,UAAU,IAAM,UAAY,CAC/C,MAAM,IAAI,MAAM,mDAAmD,CACpE,EAcDA,EAAqB,UAAU,OAAS,UAAY,CAClD,MAAM,IAAI,MAAM,sDAAsD,CACvE,EAODA,EAAqB,UAAU,QAAU,UAAY,CACnD,MAAM,IAAI,MAAM,uDAAuD,CACxE,EAMDA,EAAqB,UAAU,MAAQ,UAAY,CACjD,OAAO,IAAIA,EAAqB,CAC9B,KAAMnjC,GAAM,KAAK,KAAK,EACtB,KAAMA,GAAM,KAAK,KAAK,EACtB,SAAU,KAAK,SACrB,CAAK,CACF,EAMDmjC,EAAqB,UAAU,OAAS,UAAY,CAClD,MAAO,CACL,OAAQ,uBACR,KAAM,KAAK,MACX,KAAM,KAAK,MACX,SAAU,KAAK,SAChB,CACF,EASDA,EAAqB,SAAW,SAAUrhB,EAAM,CAC9C,OAAO,IAAIqhB,EAAqBrhB,CAAI,CACrC,EAUDqhB,EAAqB,UAAU,SAAW,UAAY,CACpD,MAAM,IAAI,MAAM,wDAAwD,CACzE,EAMDA,EAAqB,UAAU,IAAM,UAAY,CAE/C,GAAI,KAAK,OAAS,KAAM,CAEtB,IAAI1qB,EAAI,KAER,KAAK,QAAQ,SAAUnhB,EAAG,EACpBmhB,IAAM,MAAQ6kB,EAAQhmC,EAAGmhB,CAAC,KAC5BA,EAAInhB,EAEd,CAAO,EACD,KAAK,KAAOmhB,IAAM,KAAOA,EAAI,MACnC,CACI,OAAO,KAAK,IACb,EAMD0qB,EAAqB,UAAU,IAAM,UAAY,CAE/C,GAAI,KAAK,OAAS,KAAM,CAEtB,IAAI1qB,EAAI,KAER,KAAK,QAAQ,SAAUnhB,EAAG,EACpBmhB,IAAM,MAAQ6kB,EAAQ7kB,EAAGnhB,CAAC,KAC5BmhB,EAAInhB,EAEd,CAAO,EACD,KAAK,KAAOmhB,IAAM,KAAOA,EAAI,MACnC,CACI,OAAO,KAAK,IACb,EACM0qB,CACT,EAAG,CACD,QAAS,EACX,CAAC,ECxNG3rC,GAAO,QACPic,GAAe,CAAC,uBAAwB,mBAAmB,EACpD2vB,GAAkC5vB,GAAQhc,GAAMic,GAAc0B,GAAQ,CAC/E,GAAI,CACF,qBAAAguB,EACA,kBAAAE,CACJ,EAAMluB,EAuBJ,SAAS2mB,EAAMwH,EAAQ,CACrB,GAAI,EAAE,gBAAgBxH,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,KAAK,YAAc,CAAE,EACrB,KAAK,YAAc,CAAE,EACrB,KAAK,UAAY,GACjB,QAASlrC,EAAI,EAAGwZ,EAAK,UAAU,OAAQxZ,EAAIwZ,EAAIxZ,IAAK,CAClD,IAAI6Y,EAAM,UAAU7Y,CAAC,EACjB2yC,EAAazlC,GAAQ2L,CAAG,EACxB+5B,EAAczlC,GAAS0L,CAAG,EAC1Bg6B,EAAa,KACjB,GAAItlC,GAAQsL,CAAG,EACb,KAAK,YAAY,KAAKA,CAAG,EACzB,KAAK,UAAY,WACR85B,GAAcC,EAAa,CAEpC,IAAI/qB,EAAI,OACJ4qB,EAAkB55B,CAAG,IAAM,WACzB85B,IAAY9qB,EAAIirB,EAAuBC,GAAgCl6B,CAAG,EAAE,SAAS,GACrF+5B,IAAa/qB,EAAIirB,EAAuBC,GAAgCl6B,EAAI,KAAK,EAAE,SAAS,GAChGg6B,EAAah6B,EAAI,QAAO,EAAG,QAE3BgP,EAAIirB,EAAuBj6B,EAAI,SAAS,EAE1C,KAAK,YAAY,KAAKgP,CAAC,EAEvB,IAAI3e,EAAO2e,EAAE,KAAM,GAEf3e,EAAK,SAAW,GAAKA,EAAK,CAAC,IAAM,GAAK2pC,IAAe,QACvD,KAAK,UAAY,GAE3B,SAAiB,OAAOh6B,GAAQ,SACxB,KAAK,YAAY,KAAKi6B,EAAuB,CAACj6B,CAAG,CAAC,CAAC,UAC1C,OAAOA,GAAQ,SAExB,KAAK,YAAY,KAAKA,CAAG,MAEzB,OAAM,IAAI,UAAU,8DAA8D,EAEpF,KAAK,YAAY,KAAKg6B,CAAU,CAEtC,CACA,CAKE3H,EAAM,UAAU,KAAO,QACvBA,EAAM,UAAU,QAAU,GAC1B,SAAS4H,EAAuBj6B,EAAK,CAEnC,QAAS7Y,EAAI,EAAG0rC,EAAI7yB,EAAI,OAAQ7Y,EAAI0rC,EAAG1rC,IACrC,GAAI,OAAO6Y,EAAI7Y,CAAC,GAAM,UAAY,CAAC+f,GAAUlH,EAAI7Y,CAAC,CAAC,EACjD,MAAM,IAAI,UAAU,mDAAmD,EAI3E,OAAO,IAAIuyC,EAAqB15B,CAAG,CACvC,CAOE,OAAAqyB,EAAM,UAAU,MAAQ,UAAY,CAClC,IAAIznC,EAAQ,IAAIynC,EAChB,OAAAznC,EAAM,YAAc2L,GAAM,KAAK,WAAW,EAC1C3L,EAAM,UAAY,KAAK,UACvBA,EAAM,YAAc,KAAK,YAClBA,CACR,EASDynC,EAAM,OAAS,SAAUwH,EAAQ,CAC/B,IAAIjvC,EAAQ,IAAIynC,EAChB,OAAAA,EAAM,MAAMznC,EAAOivC,CAAM,EAClBjvC,CACR,EAODynC,EAAM,UAAU,KAAO,UAAY,CAEjC,QADIhiC,EAAO,CAAE,EACJlJ,EAAI,EAAGwZ,EAAK,KAAK,YAAY,OAAQxZ,EAAIwZ,EAAIxZ,IAAK,CACzD,IAAIwjB,EAAI,KAAK,YAAYxjB,CAAC,EAC1BkJ,EAAKlJ,CAAC,EAAI,OAAOwjB,GAAM,SAAW,EAAIA,EAAE,KAAM,EAAC,CAAC,CACtD,CACI,OAAOta,CACR,EAODgiC,EAAM,UAAU,IAAM,UAAY,CAEhC,QADI/M,EAAS,CAAE,EACNn+B,EAAI,EAAGwZ,EAAK,KAAK,YAAY,OAAQxZ,EAAIwZ,EAAIxZ,IAAK,CACzD,IAAIsI,EAAQ,KAAK,YAAYtI,CAAC,EAC9Bm+B,EAAOn+B,CAAC,EAAI,OAAOsI,GAAU,SAAWA,EAAQA,EAAM,IAAK,CACjE,CACI,OAAO61B,CACR,EAOD+M,EAAM,UAAU,IAAM,UAAY,CAEhC,QADI/M,EAAS,CAAE,EACNn+B,EAAI,EAAGwZ,EAAK,KAAK,YAAY,OAAQxZ,EAAIwZ,EAAIxZ,IAAK,CACzD,IAAIsI,EAAQ,KAAK,YAAYtI,CAAC,EAC9Bm+B,EAAOn+B,CAAC,EAAI,OAAOsI,GAAU,SAAWA,EAAQA,EAAM,IAAK,CACjE,CACI,OAAO61B,CACR,EASD+M,EAAM,UAAU,QAAU,SAAUjmC,EAAU,CAC5C,QAASjF,EAAI,EAAGwZ,EAAK,KAAK,YAAY,OAAQxZ,EAAIwZ,EAAIxZ,IACpDiF,EAAS,KAAK,YAAYjF,CAAC,EAAGA,EAAG,IAAI,CAExC,EAQDkrC,EAAM,UAAU,UAAY,SAAUhV,EAAK,CACzC,OAAO,KAAK,YAAYA,CAAG,GAAK,IACjC,EAMDgV,EAAM,UAAU,iBAAmB,UAAY,CAC7C,OAAO,KAAK,YAAY,SAAW,GAAK,OAAO,KAAK,YAAY,CAAC,GAAM,QACxE,EAODA,EAAM,UAAU,kBAAoB,UAAY,CAC9C,OAAO,KAAK,iBAAkB,EAAG,KAAK,YAAY,CAAC,EAAI,IACxD,EAUDA,EAAM,UAAU,SAAW,UAAY,CACrC,OAAO,KAAK,SACb,EAQDA,EAAM,UAAU,QAAU,UAAY,CAEpC,QADIlmB,EAAQ,CAAE,EACLhlB,EAAI,EAAGwZ,EAAK,KAAK,YAAY,OAAQxZ,EAAIwZ,EAAIxZ,IAAK,CACzD,IAAIgzC,EAAY,KAAK,YAAYhzC,CAAC,EAClCglB,EAAM,KAAK,OAAOguB,GAAc,SAAWA,EAAYA,EAAU,SAAS,CAChF,CACI,OAAOhuB,CACR,EAQDkmB,EAAM,UAAU,QAAUA,EAAM,UAAU,QAO1CA,EAAM,UAAU,SAAW,UAAY,CAErC,QADI+H,EAAU,CAAE,EACPjzC,EAAI,EAAGwZ,EAAK,KAAK,YAAY,OAAQxZ,EAAIwZ,EAAIxZ,IAAK,CACzD,IAAIgzC,EAAY,KAAK,YAAYhzC,CAAC,EAC9B,OAAOgzC,GAAc,SACvBC,EAAQ,KAAK,KAAK,UAAUD,CAAS,CAAC,EAEtCC,EAAQ,KAAKD,EAAU,UAAU,CAEzC,CACI,MAAO,IAAMC,EAAQ,KAAK,IAAI,EAAI,GACnC,EAQD/H,EAAM,UAAU,OAAS,UAAY,CACnC,MAAO,CACL,OAAQ,QACR,WAAY,KAAK,WAClB,CACF,EASDA,EAAM,SAAW,SAAUha,EAAM,CAC/B,OAAOga,EAAM,OAAOha,EAAK,UAAU,CACpC,EACMga,CACT,EAAG,CACD,QAAS,EACX,CAAC,EAOD,SAAS6H,GAAgCG,EAAmB,CAE1D,IAAIC,EAAiB,CAAE,EACvB,OAAAD,EAAkB,QAAQ,CAACE,EAAMvV,IAAQ,CACnCuV,GACFD,EAAe,KAAKtV,CAAG,CAE7B,CAAG,EACMsV,CACT,CCxSA,IAAIvsC,GAAO,OACPic,GAAe,CAAC,OAAO,EAChBwwB,GAA4BzwB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACzE,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EAwBJ,OAAOvT,EAAM,OAAQ,CACnB,OAAQ,SAAgBpR,EAAG,CACzB,OAAO,KAAK,KAAKA,CAAC,CACnB,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,KAAM,CAChB,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAOA,EAAE,KAAM,CACrB,CACA,CAAG,CACH,CAAC,ECxCU0zC,GAAgC1wB,GAAQ,WAAY,CAAC,OAAO,EAAG2B,GAAQ,CAChF,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EACJ,MAAO,CACL,KAAMvT,EAAM,YAAY/R,GAAQW,GAAK,CACnC,GAAI,CAACA,EAAE,QAAQA,EAAE,YAAY,WAAW,KAAK,EAC3C,MAAM,IAAI,UAAU,kCAAkC,EAExD,OAAOoR,EAAM,KAAK/R,EAAMW,EAAE,WAAW,EAAEA,EAAE,KAAK,CAC/C,EACF,CACH,CAAC,ECXGgH,GAAO,MACPic,GAAe,CAAC,OAAO,EAChB0wB,GAA2B3wB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACxE,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EACAivB,EAAWF,GAAe,CAC5B,MAAAtiC,CACJ,CAAG,EA6BD,OAAOA,EAAMpK,GAAM,CACjB,OAAQ,KAAK,IACb,sBAAuBhH,GAAKA,EAAE,IAAG,CAClC,EAAE4zC,CAAQ,CACb,CAAC,ECzCG5sC,GAAO,MACPic,GAAe,CAAC,OAAO,EAChB4wB,GAA2B7wB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACxE,GAAI,CACF,MAAAvT,CACJ,EAAMuT,EACAivB,EAAWF,GAAe,CAC5B,MAAAtiC,CACJ,CAAG,EA6BD,OAAOA,EAAMpK,GAAM,CACjB,OAAQ,KAAK,IACb,sBAAuBhH,GAAKA,EAAE,IAAG,CAClC,EAAE4zC,CAAQ,CACb,CAAC,ECtCG5sC,GAAO,MACPic,GAAe,CAAC,QAAS,SAAU,YAAa,cAAe,cAAe,eAAgB,QAAQ,EAC/F6wB,GAA2B9wB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACxE,GAAI,CACF,MAAAvT,EACA,OAAAkU,EACA,UAAA4hB,EACA,YAAAzJ,EACA,YAAA3Y,EACA,aAAA4Y,EACA,OAAA3E,CACJ,EAAMpU,EACA0lB,EAAiBxD,GAAqB,CACxC,MAAAz1B,CACJ,CAAG,EACG2iC,EAAmBjN,GAAuB,CAC5C,MAAA11B,EACA,YAAAqsB,CACJ,CAAG,EACG+M,EAAiBzD,GAAqB,CACxC,MAAA31B,EACA,YAAA0T,CACJ,CAAG,EACG4lB,EAAuBvE,GAA2B,CACpD,MAAA/0B,EACA,OAAAkU,EACA,OAAAyT,CACJ,CAAG,EAmCD,OAAO3nB,EAAMpK,GAAM,CACjB,WAAYkgC,EACZ,mBAAoB91B,EAAM,YAAY/R,GAAQ,CAACW,EAAG2iB,EAAGgnB,IAAS,CAE5D,QADIrU,EAASj2B,EAAKW,EAAG2iB,CAAC,EACbviB,EAAI,EAAGA,EAAIupC,EAAK,OAAQvpC,IAC/Bk1B,EAASj2B,EAAKi2B,EAAQqU,EAAKvpC,CAAC,CAAC,EAE/B,OAAOk1B,CACR,EACF,EAAEoV,EAAqB,CACtB,KAAMxD,EACN,GAAImD,EACJ,GAAI0J,EACJ,GAAIvJ,CACR,CAAG,CAAC,CACJ,CAAC,ECjFGxjC,GAAO,OACPic,GAAe,CAAC,QAAS,MAAO,MAAO,MAAO,OAAQ,OAAQ,WAAY,cAAe,SAAU,UAAW,SAAU,aAAc,MAAM,EACrI+wB,GAA4BhxB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACzE,GAAI,CACF,MAAAvT,EACA,IAAA4d,EACA,IAAAG,EACA,IAAAlB,EACA,KAAAqgB,EACA,KAAAvd,EACA,SAAAwe,EACA,YAAA9R,EACA,OAAAuP,EACA,QAAAF,EACA,OAAAxnB,EACA,WAAA2uB,EACA,KAAAC,CACJ,EAAMvvB,EAuCJ,OAAOvT,EAAMpK,GAAM,CACjB,OAAQ,KAAK,IACb,QAAS,SAAiBhH,EAAG,CAC3B,OAAOA,EAAE,IAAK,CACf,EACD,UAAW,SAAmBA,EAAG,CAE/B,OAAOA,EAAE,IAAK,CACf,EACD,QAAS,SAAiBA,EAAG,CAE3B,OAAO,KAAK,IAAIA,CAAC,CAClB,EACD,MAAO,SAAeA,EAAG,CACvB,OAAOm0C,EAAM7uB,EAAOtlB,CAAC,EAAG,CAAC,CAC1B,EACD,OAAQ,SAAgBA,EAAG,CACzB,OAAOm0C,EAAMn0C,EAAG,CAAC,CAClB,EACD,qCAAsC,SAAoCA,EAAG6T,EAAG,CAC9E,OAAOsgC,EAAM7uB,EAAOtlB,CAAC,EAAG6T,CAAC,CAC1B,EACD,sCAAuC,SAAqC7T,EAAG6T,EAAG,CAChF,OAAOsgC,EAAMn0C,EAAG6T,CAAC,CACvB,CACA,CAAG,EAQD,SAASugC,EAAwBp0C,EAAG,CAElC,IAAIq0C,EAAO,EAEX,OAAAr0C,EAAE,QAAQ,SAAUV,EAAO,CACzB,IAAIwH,EAAIkoB,EAAI1vB,CAAK,EACb0tC,EAAOlmC,EAAGutC,CAAI,IAChBA,EAAOvtC,EAEV,EAAE,EAAI,EACAutC,CACX,CAQE,SAASC,EAAyBt0C,EAAG,CAEnC,IAAIu0C,EAEJ,OAAAv0C,EAAE,QAAQ,SAAUV,EAAO,CACzB,IAAIwH,EAAIkoB,EAAI1vB,CAAK,GACb,CAACi1C,GAAQzH,EAAQhmC,EAAGytC,CAAI,KAC1BA,EAAOztC,EAEV,EAAE,EAAI,EACAytC,GAAQ,CACnB,CASE,SAASC,EAAYx0C,EAAG6T,EAAG,CAEzB,GAAIA,IAAM,OAAO,mBAAqBA,IAAM,MAC1C,OAAOugC,EAAwBp0C,CAAC,EAElC,GAAI6T,IAAM,OAAO,mBAAqBA,IAAM,OAC1C,OAAOygC,EAAyBt0C,CAAC,EAEnC,GAAI6T,IAAM,MACR,OAAOsgC,EAAMn0C,EAAG,CAAC,EAEnB,GAAI,OAAO6T,GAAM,UAAY,CAAC,MAAMA,CAAC,EAAG,CAEtC,GAAI,CAAC4pB,EAAY5pB,EAAG,CAAC,EAAG,CAEtB,IAAIjH,EAAI,EAER,OAAA5M,EAAE,QAAQ,SAAUV,EAAO,CACzBsN,EAAIuiB,EAAIlB,EAAIe,EAAI1vB,CAAK,EAAGuU,CAAC,EAAGjH,CAAC,CAC9B,EAAE,EAAI,EACAqhB,EAAIrhB,EAAG,EAAIiH,CAAC,CAC3B,CACM,OAAO,OAAO,iBACpB,CAEI,MAAM,IAAI,MAAM,6BAA6B,CACjD,CAQE,SAAS4gC,EAAqBz0C,EAAG,CAE/B,IAAI00C,EAAM,EACV,OAAA10C,EAAE,QAAQ,SAAUV,EAAOuE,EAAO,CAChC6wC,EAAMvlB,EAAIulB,EAAKnF,EAASjwC,EAAOgvC,EAAKhvC,CAAK,CAAC,CAAC,CACjD,CAAK,EACM0vB,EAAI+B,EAAK2jB,CAAG,CAAC,CACxB,CAQE,SAASC,EAAe30C,EAAG,CAEzB,IAAIoY,EAAI,CAAE,EAENw8B,EAAO,EAEX,OAAA50C,EAAE,QAAQ,SAAUV,EAAOuE,EAAO,CAChC,IAAIyjB,EAAIzjB,EAAM,CAAC,EACXgxC,EAAK1lB,EAAI/W,EAAEkP,CAAC,GAAK,EAAG0H,EAAI1vB,CAAK,CAAC,EAC9B0tC,EAAO6H,EAAID,CAAI,IACjBA,EAAOC,GAETz8B,EAAEkP,CAAC,EAAIutB,CACR,EAAE,EAAI,EACAD,CACX,CAQE,SAASE,EAAe90C,EAAG,CAEzB,IAAI+0C,EAAQ/0C,EAAE,KAAM,EACpB,GAAI+0C,EAAM,CAAC,IAAMA,EAAM,CAAC,EACtB,MAAM,IAAI,WAAW,2BAA2B,EAElD,IAAIC,EAAKf,EAAWj0C,CAAC,EACjBi1C,EAAW1F,EAASyF,EAAIh1C,CAAC,EACzBk1C,EAAYhB,EAAKe,CAAQ,EAAE,OAAO,QAAS,EAC3CE,EAAMD,EAAUA,EAAU,OAAS,CAAC,EACxC,OAAOlmB,EAAI+B,EAAKokB,CAAG,CAAC,CACxB,CAQE,SAASC,EAAoBp1C,EAAG,CAE9B,IAAI8M,EAAI,CAAE,EAENuoC,EAAO,EAEX,OAAAr1C,EAAE,QAAQ,SAAUV,EAAOuE,EAAO,CAChC,IAAIzD,EAAIyD,EAAM,CAAC,EACXyxC,EAAKnmB,EAAIriB,EAAE1M,CAAC,GAAK,EAAG4uB,EAAI1vB,CAAK,CAAC,EAC9B0tC,EAAOsI,EAAID,CAAI,IACjBA,EAAOC,GAETxoC,EAAE1M,CAAC,EAAIk1C,CACR,EAAE,EAAI,EACAD,CACX,CASE,SAASE,EAAYv1C,EAAG6T,EAAG,CAEzB,GAAIA,IAAM,EACR,OAAO8gC,EAAe30C,CAAC,EAEzB,GAAI6T,IAAM,OAAO,mBAAqBA,IAAM,MAC1C,OAAOuhC,EAAoBp1C,CAAC,EAE9B,GAAI6T,IAAM,MACR,OAAO4gC,EAAqBz0C,CAAC,EAE/B,GAAI6T,IAAM,EACR,OAAOihC,EAAe90C,CAAC,EAGzB,MAAM,IAAI,MAAM,+BAAiC6T,CAAC,CACtD,CASE,SAASsgC,EAAMn0C,EAAG6T,EAAG,CAEnB,IAAIkhC,EAAQ/0C,EAAE,KAAM,EAGpB,GAAI+0C,EAAM,SAAW,EACnB,OAAOP,EAAYx0C,EAAG6T,CAAC,EAGzB,GAAIkhC,EAAM,SAAW,EAAG,CACtB,GAAIA,EAAM,CAAC,GAAKA,EAAM,CAAC,EACrB,OAAOQ,EAAYv1C,EAAG6T,CAAC,EAEvB,MAAM,IAAI,WAAW,2BAA2B,CAExD,CACA,CACA,CAAC,EC5RG7M,GAAO,MACPic,GAAe,CAAC,QAAS,YAAa,iBAAkB,OAAQ,MAAM,EAC/DuyB,GAA2BxyB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACxE,GAAI,CACF,MAAAvT,EACA,UAAA81B,EACA,eAAAC,EACA,KAAAmH,EACA,KAAAhlC,CACJ,EAAMqb,EAwBJ,OAAOvT,EAAMpK,GAAM,CACjB,2CAA4CyuC,EAC5C,6BAA8BC,CAClC,CAAG,EACD,SAASC,EAAa31C,EAAG2iB,EAAG,CAC1B,IAAIizB,EAAQC,EAAM71C,CAAC,EACf81C,EAAQD,EAAMlzB,CAAC,EACfozB,EAAMC,EACV,GAAIJ,EAAM,SAAW,EACnBG,EAAOH,EAAM,CAAC,UACLA,EAAM,SAAW,GAAKA,EAAM,CAAC,IAAM,EAC5CG,EAAOH,EAAM,CAAC,MAEd,OAAM,IAAI,WAAW,2DAA6DA,EAAM,KAAK,IAAI,EAAI,GAAG,EAE1G,GAAIE,EAAM,SAAW,EACnBE,EAAOF,EAAM,CAAC,UACLA,EAAM,SAAW,GAAKA,EAAM,CAAC,IAAM,EAC5CE,EAAOF,EAAM,CAAC,MAEd,OAAM,IAAI,WAAW,2DAA6DA,EAAM,KAAK,IAAI,EAAI,GAAG,EAE1G,GAAIC,IAASC,EAAM,MAAM,IAAI,WAAW,mCAAqCD,EAAO,OAASC,EAAO,GAAG,EACvG,GAAID,IAAS,EAAG,MAAM,IAAI,WAAW,mDAAmD,EACxF,OAAOA,CACX,CACE,SAASN,EAAU5lC,EAAGC,EAAG,CACvB,IAAI8jB,EAAI+hB,EAAa9lC,EAAGC,CAAC,EACrB+zB,EAAQt2B,GAASsC,CAAC,EAAIA,EAAE,MAAQA,EAChCszB,EAAM51B,GAASsC,CAAC,EAAIA,EAAE,WAAaA,EAAE,YAAW,EAAK,OACrDy1B,EAAQ/3B,GAASuC,CAAC,EAAIA,EAAE,MAAQA,EAChC40B,EAAMn3B,GAASuC,CAAC,EAAIA,EAAE,WAAaA,EAAE,YAAW,EAAK,OAGrDmmC,EAAYJ,EAAMhmC,CAAC,EAAE,SAAW,EAChCqmC,EAAYL,EAAM/lC,CAAC,EAAE,SAAW,EAChCqf,EAAM+X,EACNxW,EAAMyW,EAGV,GAAIhE,GAAOuB,GAAOvB,IAAQuB,GAAO,OAAOvB,GAAQ,UAAYA,IAAQ,QAAS,CAC3E,IAAIC,EAAKD,EAEThU,EAAM/d,EAAM,KAAK81B,EAAW,CAAC9D,EAAIA,CAAE,CAAC,EACpC1S,EAAMtf,EAAM,KAAK+1B,EAAgB,CAAC/D,EAAIA,CAAE,CAAC,CAC/C,CAGI,GAAI,CAAC6S,GAAa,CAACC,EAAW,CAE5B,QADI99B,EAAIsY,EAAI4d,EAAKzK,EAAM,CAAC,CAAC,EAAGyB,EAAM,CAAC,CAAC,EAC3BllC,EAAI,EAAGA,EAAIwzB,EAAGxzB,IACrBgY,EAAI+W,EAAI/W,EAAGsY,EAAI4d,EAAKzK,EAAMzjC,CAAC,CAAC,EAAGklC,EAAMllC,CAAC,CAAC,CAAC,EAE1C,OAAOgY,CACb,CAGI,GAAI,CAAC69B,GAAaC,EAAW,CAE3B,QADIhwC,EAAKwqB,EAAI4d,EAAKzK,EAAM,CAAC,CAAC,EAAGyB,EAAM,CAAC,EAAE,CAAC,CAAC,EAC/B/L,EAAK,EAAGA,EAAK3F,EAAG2F,IACvBrzB,EAAKipB,EAAIjpB,EAAIwqB,EAAI4d,EAAKzK,EAAMtK,CAAE,CAAC,EAAG+L,EAAM/L,CAAE,EAAE,CAAC,CAAC,CAAC,EAEjD,OAAOrzB,CACb,CAGI,GAAI+vC,GAAa,CAACC,EAAW,CAE3B,QADIC,EAAMzlB,EAAI4d,EAAKzK,EAAM,CAAC,EAAE,CAAC,CAAC,EAAGyB,EAAM,CAAC,CAAC,EAChC7F,EAAM,EAAGA,EAAM7L,EAAG6L,IACzB0W,EAAMhnB,EAAIgnB,EAAKzlB,EAAI4d,EAAKzK,EAAMpE,CAAG,EAAE,CAAC,CAAC,EAAG6F,EAAM7F,CAAG,CAAC,CAAC,EAErD,OAAO0W,CACb,CAGI,GAAIF,GAAaC,EAAW,CAE1B,QADIE,EAAM1lB,EAAI4d,EAAKzK,EAAM,CAAC,EAAE,CAAC,CAAC,EAAGyB,EAAM,CAAC,EAAE,CAAC,CAAC,EACnC5F,EAAM,EAAGA,EAAM9L,EAAG8L,IACzB0W,EAAMjnB,EAAIinB,EAAK1lB,EAAI4d,EAAKzK,EAAMnE,CAAG,EAAE,CAAC,CAAC,EAAG4F,EAAM5F,CAAG,EAAE,CAAC,CAAC,CAAC,EAExD,OAAO0W,CACb,CACA,CACE,SAASV,EAAW11C,EAAG2iB,EAAG,CACxBgzB,EAAa31C,EAAG2iB,CAAC,EAYjB,QAXI0zB,EAASr2C,EAAE,OACXs2C,EAAUt2C,EAAE,QACZu2C,EAAS5zB,EAAE,OACX6zB,EAAU7zB,EAAE,QAGZvK,EAAI,EACJ+W,EAAM+X,EACNxW,EAAMyW,EACN/mC,EAAI,EACJknB,EAAI,EACDlnB,EAAIi2C,EAAO,QAAU/uB,EAAIivB,EAAO,QAAQ,CAC7C,IAAIE,EAAIJ,EAAOj2C,CAAC,EACZqxC,EAAI8E,EAAOjvB,CAAC,EAChB,GAAImvB,EAAIhF,EAAG,CACTrxC,IACA,QACR,CACM,GAAIq2C,EAAIhF,EAAG,CACTnqB,IACA,QACR,CACUmvB,IAAMhF,IACRr5B,EAAI+W,EAAI/W,EAAGsY,EAAI4lB,EAAQl2C,CAAC,EAAGo2C,EAAQlvB,CAAC,CAAC,CAAC,EACtClnB,IACAknB,IAER,CACI,OAAOlP,CACX,CAGE,SAASy9B,EAAM71C,EAAG,CAChB,OAAOuN,GAASvN,CAAC,EAAIA,EAAE,KAAM,EAAGsJ,EAAKtJ,CAAC,CAC1C,CACA,CAAC,ECzJGgH,GAAO,KACPic,GAAe,CAAC,QAAS,SAAU,QAAS,WAAY,SAAU,QAAS,OAAQ,OAAQ,OAAQ,aAAc,YAAa,eAAgB,iBAAkB,iBAAkB,SAAS,EACpLyzB,GAA0B1zB,GAAQhc,GAAMic,GAAc0B,GAAQ,CACvE,GAAI,CACF,MAAAvT,EACA,OAAAkU,EACA,MAAA5D,EACA,SAAA4tB,EACA,OAAAqH,EACA,MAAAC,EACA,KAAAx2B,EACA,KAAA2Q,EACA,KAAAud,EACA,WAAAlE,EACA,UAAAlD,EACA,aAAAkJ,EACA,eAAAjJ,EACA,eAAAgD,EACA,QAAAL,CACJ,EAAMnlB,EA4CJ,OAAOhY,GAASyE,EAAMpK,GAAM,CAC1B,YAAa,SAAqBihB,EAAG,CACnC,OAAO4uB,EAAS5uB,CAAC,CAClB,EACD,aAAc,SAAsBA,EAAG,CACrC,OAAO6uB,EAAW,CACnB,EACD,MAAO,SAAejnC,EAAG,CAEvB,IAAIoY,EAAI3C,EAAOzV,CAAC,EAEZ/C,EAAI+pC,EAAS5uB,CAAC,EAElB,MAAO,CACL,EAAGnb,EAAE,EAAE,QAAS,EAChB,EAAGA,EAAE,EAAE,QAAO,CACf,CACP,CACA,CAAG,EAAG,CACF,aAAAiqC,CACJ,CAAG,EACD,SAASA,EAAa9uB,EAAG,CAEvB,IAAI6T,EAAO7T,EAAE,MAAM,CAAC,EAChBqkB,EAAOrkB,EAAE,MAAM,CAAC,EAEhB+uB,EAAI1H,EAAS,CAACxT,CAAI,EAAG,OAAO,EAC5Bmb,EAAQD,EAAE,MACV9F,EAAIjpB,EAAE,MAAO,EACbivB,EAAQhG,EAAE,MAGV9wC,EAAGknB,EAAGF,EACNoB,EAAI9G,EAAM,CAACoa,CAAI,EAAG,EAAE,EACxB,IAAK1U,EAAI,EAAGA,EAAI,KAAK,IAAIklB,EAAMxQ,CAAI,EAAG,EAAE1U,EAAG,CAyBzC,IAAI+vB,EAAQD,EAAM9vB,CAAC,EAAEA,CAAC,EAClBgwB,EAAMhN,EAAWwM,EAAMO,EAAO,CAAC,EAAI,EAAI/2B,EAAK+2B,CAAK,CAAC,EAClDE,EAAU/I,EAAK8I,CAAG,EAClBE,EAAe,EACnB,IAAKl3C,EAAIgnB,EAAGhnB,EAAI07B,EAAM17B,IACpBk3C,EAAepQ,EAAUoQ,EAAcnQ,EAAe+P,EAAM92C,CAAC,EAAEgnB,CAAC,EAAGknB,EAAK4I,EAAM92C,CAAC,EAAEgnB,CAAC,CAAC,CAAC,CAAC,EAEvF,IAAImwB,EAAQpQ,EAAeiQ,EAAKrmB,EAAKumB,CAAY,CAAC,EAClD,GAAI,CAACX,EAAOY,CAAK,EAAG,CAElB,IAAIC,EAAKrN,EAAegN,EAAOI,CAAK,EAIpC,IADA/uB,EAAEpB,CAAC,EAAI,EACFhnB,EAAIgnB,EAAI,EAAGhnB,EAAI07B,EAAM17B,IACxBooB,EAAEpoB,CAAC,EAAIgwC,EAAa8G,EAAM92C,CAAC,EAAEgnB,CAAC,EAAGowB,CAAE,EAIrC,IAAIC,GAAMrN,EAAWkE,EAAK8B,EAAaoH,EAAID,CAAK,CAAC,CAAC,EAC9CrjC,GAAI,OAcR,IAAKoT,EAAIF,EAAGE,EAAIglB,EAAMhlB,IAAK,CAIzB,IAHApT,GAAI,EAGC9T,EAAIgnB,EAAGhnB,EAAI07B,EAAM17B,IACpB8T,GAAIgzB,EAAUhzB,GAAGizB,EAAemH,EAAK9lB,EAAEpoB,CAAC,CAAC,EAAG82C,EAAM92C,CAAC,EAAEknB,CAAC,CAAC,CAAC,EAK1D,IADApT,GAAIizB,EAAejzB,GAAGujC,EAAG,EACpBr3C,EAAIgnB,EAAGhnB,EAAI07B,EAAM17B,IACpB82C,EAAM92C,CAAC,EAAEknB,CAAC,EAAI6f,EAAegD,EAAe+M,EAAM92C,CAAC,EAAEknB,CAAC,EAAG6f,EAAe3e,EAAEpoB,CAAC,EAAG8T,EAAC,CAAC,EAAGmjC,CAAO,CAEtG,CAQQ,IAAKj3C,EAAI,EAAGA,EAAI07B,EAAM17B,IAAK,CAIzB,IAHA8T,GAAI,EAGCoT,EAAIF,EAAGE,EAAIwU,EAAMxU,IACpBpT,GAAIgzB,EAAUhzB,GAAGizB,EAAe8P,EAAM72C,CAAC,EAAEknB,CAAC,EAAGkB,EAAElB,CAAC,CAAC,CAAC,EAKpD,IADApT,GAAIizB,EAAejzB,GAAGujC,EAAG,EACpBnwB,EAAIF,EAAGE,EAAIwU,EAAM,EAAExU,EACtB2vB,EAAM72C,CAAC,EAAEknB,CAAC,EAAI8oB,EAAajG,EAAe8M,EAAM72C,CAAC,EAAEknB,CAAC,EAAG6f,EAAejzB,GAAGo6B,EAAK9lB,EAAElB,CAAC,CAAC,CAAC,CAAC,EAAG+vB,CAAO,CAE1G,CACA,CACA,CAGI,MAAO,CACL,EAAAL,EACA,EAAA9F,EACA,SAAU,UAAoB,CAC5B,MAAO,MAAQ,KAAK,EAAE,SAAU,EAAG;AAAA,KAAU,KAAK,EAAE,SAAU,CACtE,CACK,CACL,CACE,SAAS2F,EAAS5uB,EAAG,CACnB,IAAIwK,EAAMskB,EAAa9uB,CAAC,EACpBivB,EAAQzkB,EAAI,EAAE,MAClB,GAAIxK,EAAE,MAAM,OAAS,EAEnB,QADI6V,EAAOoZ,EAAM,CAAC,EAAE,CAAC,EAAE,OAAS,UAAYpN,EAAQ,CAAC,EAAI,EAChD1pC,EAAI,EAAGA,EAAI82C,EAAM,OAAQ,EAAE92C,EAClC,QAASknB,EAAI,EAAGA,EAAIlnB,GAAKknB,GAAK4vB,EAAM,CAAC,GAAK,IAAI,OAAQ,EAAE5vB,EACtD4vB,EAAM92C,CAAC,EAAEknB,CAAC,EAAIwW,EAIpB,OAAOrL,CACX,CACE,SAASqkB,EAAU7uB,EAAG,CACpB,MAAM,IAAI,MAAM,4CAA4C,CAChE,CACA,CAAC,ECzNGjhB,GAAO,MACPic,GAAe,CAAC,QAAS,SAAU,iBAAkB,WAAY,eAAgB,SAAU,YAAY,EAChGy0B,GAA2B10B,GAAQhc,GAAMic,GAAc0B,GAAQ,CACxE,GAAI,CACF,MAAAvT,EACA,OAAAkU,EACA,eAAA6kB,EACA,SAAAoF,EACA,aAAAa,EACA,OAAAuG,EACA,WAAAvM,CACJ,EAAMzlB,EA0BJ,OAAOvT,EAAMpK,GAAM,CACjB,IAAK,SAAahH,EAAG,CACnB,OAAOwP,GAAMxP,CAAC,CACf,EACD,iBAAkB,SAAaA,EAAG,CAChC,IAAIsJ,EAUJ,OATIiE,GAASvN,CAAC,EACZsJ,EAAOtJ,EAAE,KAAM,EACN,MAAM,QAAQA,CAAC,GACxBA,EAAIslB,EAAOtlB,CAAC,EACZsJ,EAAOtJ,EAAE,KAAM,GAGfsJ,EAAO,CAAE,EAEHA,EAAK,OAAM,CACjB,IAAK,GAEH,OAAOkG,GAAMxP,CAAC,EAChB,IAAK,GAEH,GAAIsJ,EAAK,CAAC,IAAM,EACd,OAAOkG,GAAMxP,EAAE,QAAS,EAAC,CAAC,CAAC,EAE7B,GAAIsJ,EAAK,CAAC,IAAM,EACd,MAAO,GAEP,MAAM,IAAI,WAAW,gCAAuCqX,GAAOrX,CAAI,EAAI,GAAG,EAElF,IAAK,GACH,CAEE,IAAIwyB,EAAOxyB,EAAK,CAAC,EACbgjC,EAAOhjC,EAAK,CAAC,EACjB,GAAIwyB,IAASwQ,EACX,OAAOqL,EAAK33C,EAAE,MAAO,EAAC,QAAO,EAAI87B,CAAU,EAE7C,GAAIwQ,IAAS,EACX,MAAO,GAEP,MAAM,IAAI,WAAW,gCAAuC3rB,GAAOrX,CAAI,EAAI,GAAG,CAE5F,CACQ,QAEE,MAAM,IAAI,WAAW,yCAAgDqX,GAAOrX,CAAI,EAAI,GAAG,CACjG,CACA,CACA,CAAG,EAUD,SAASquC,EAAKryB,EAAQwW,EAAMwQ,EAAM,CAChC,GAAIxQ,IAAS,EAEX,OAAOtsB,GAAM8V,EAAO,CAAC,EAAE,CAAC,CAAC,EACpB,GAAIwW,IAAS,EAGlB,OAAOqO,EAAeoF,EAASjqB,EAAO,CAAC,EAAE,CAAC,EAAGA,EAAO,CAAC,EAAE,CAAC,CAAC,EAAGiqB,EAASjqB,EAAO,CAAC,EAAE,CAAC,EAAGA,EAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAOhG,QAFIsyB,EAAU,GACVC,EAAa,IAAI,MAAM/b,CAAI,EAAE,KAAK,CAAC,EAAE,IAAI,CAACgc,EAAG13C,IAAMA,CAAC,EAC/CgnB,EAAI,EAAGA,EAAI0U,EAAM1U,IAAK,CAC7B,IAAI2wB,EAAKF,EAAWzwB,CAAC,EACrB,GAAIuvB,EAAOrxB,EAAOyyB,CAAE,EAAE3wB,CAAC,CAAC,EAAG,CACzB,IAAI+Y,EAAK,OACT,IAAKA,EAAK/Y,EAAI,EAAG+Y,EAAKrE,EAAMqE,IAC1B,GAAI,CAACwW,EAAOrxB,EAAOuyB,EAAW1X,CAAE,CAAC,EAAE/Y,CAAC,CAAC,EAAG,CACtC2wB,EAAKF,EAAW1X,CAAE,EAClB0X,EAAW1X,CAAE,EAAI0X,EAAWzwB,CAAC,EAC7BywB,EAAWzwB,CAAC,EAAI2wB,EAChBH,EAAU,CAACA,EACX,KACd,CAEU,GAAIzX,IAAOrE,EAAM,OAAOxW,EAAOyyB,CAAE,EAAE3wB,CAAC,CAC9C,CAGQ,QAFI4wB,EAAM1yB,EAAOyyB,CAAE,EAAE3wB,CAAC,EAClB6wB,EAAO7wB,IAAM,EAAI,EAAI9B,EAAOuyB,EAAWzwB,EAAI,CAAC,CAAC,EAAEA,EAAI,CAAC,EAC/ChnB,EAAIgnB,EAAI,EAAGhnB,EAAI07B,EAAM17B,IAE5B,QADI83C,EAAKL,EAAWz3C,CAAC,EACZknB,EAAIF,EAAI,EAAGE,EAAIwU,EAAMxU,IAC5BhC,EAAO4yB,CAAE,EAAE5wB,CAAC,EAAI8oB,EAAajG,EAAeoF,EAASjqB,EAAO4yB,CAAE,EAAE5wB,CAAC,EAAG0wB,CAAG,EAAGzI,EAASjqB,EAAO4yB,CAAE,EAAE9wB,CAAC,EAAG9B,EAAOyyB,CAAE,EAAEzwB,CAAC,CAAC,CAAC,EAAG2wB,CAAI,CAGnI,CACM,IAAIE,EAAM7yB,EAAOuyB,EAAW/b,EAAO,CAAC,CAAC,EAAEA,EAAO,CAAC,EAC/C,OAAO8b,EAAUxN,EAAW+N,CAAG,EAAIA,CAEzC,CACA,CAAC,ECzIGnxC,GAAO,MACPic,GAAe,CAAC,QAAS,SAAU,eAAgB,YAAa,WAAY,aAAc,MAAO,WAAY,KAAK,EAC3Gm1B,GAA2Bp1B,GAAQhc,GAAMic,GAAc0B,GAAQ,CACxE,GAAI,CACF,MAAAvT,EACA,OAAAkU,EACA,aAAA8qB,EACA,UAAAlJ,EACA,SAAAqI,EACA,WAAAnF,EACA,IAAA+N,EACA,SAAA7I,EACA,IAAAtgB,CACJ,EAAMrK,EAqBJ,OAAOvT,EAAMpK,GAAM,CACjB,iBAAkB,SAAqBhH,EAAG,CACxC,IAAIsJ,EAAOiE,GAASvN,CAAC,EAAIA,EAAE,KAAM,EAAGo2B,GAAUp2B,CAAC,EAC/C,OAAQsJ,EAAK,OAAM,CACjB,IAAK,GAEH,GAAIA,EAAK,CAAC,IAAM,EACd,OAAIiE,GAASvN,CAAC,EACLslB,EAAO,CAAC8qB,EAAa,EAAGpwC,EAAE,QAAS,EAAC,CAAC,CAAC,CAAC,CAAC,EAExC,CAACowC,EAAa,EAAGpwC,EAAE,CAAC,CAAC,CAAC,EAG/B,MAAM,IAAI,WAAW,gCAAuC2gB,GAAOrX,CAAI,EAAI,GAAG,EAElF,IAAK,GAEH,CACE,IAAIwyB,EAAOxyB,EAAK,CAAC,EACbgjC,EAAOhjC,EAAK,CAAC,EACjB,GAAIwyB,IAASwQ,EACX,OAAI/+B,GAASvN,CAAC,EACLslB,EAAO+yB,EAAKr4C,EAAE,QAAO,EAAI87B,EAAMwQ,CAAI,EAAGtsC,EAAE,SAAS,EAGjDq4C,EAAKr4C,EAAG87B,EAAMwQ,CAAI,EAG3B,MAAM,IAAI,WAAW,gCAAuC3rB,GAAOrX,CAAI,EAAI,GAAG,CAE5F,CACQ,QAEE,MAAM,IAAI,WAAW,yCAAgDqX,GAAOrX,CAAI,EAAI,GAAG,CACjG,CACK,EACD,IAAK,SAAatJ,EAAG,CAEnB,OAAOowC,EAAa,EAAGpwC,CAAC,CAC9B,CACA,CAAG,EAUD,SAASq4C,EAAKC,EAAKxc,EAAMwQ,EAAM,CAC7B,IAAIx/B,EAAGoH,EAAGiR,EAAG7lB,EAAO6sB,EACpB,GAAI2P,IAAS,EAAG,CAGd,GADAx8B,EAAQg5C,EAAI,CAAC,EAAE,CAAC,EACZh5C,IAAU,EACZ,MAAM,MAAM,+CAA+C,EAE7D,MAAO,CAAC,CAAC8wC,EAAa,EAAG9wC,CAAK,CAAC,CAAC,CACtC,SAAew8B,IAAS,EAAG,CAErB,IAAIlY,EAAIu0B,EAAIG,CAAG,EACf,GAAI10B,IAAM,EACR,MAAM,MAAM,+CAA+C,EAE7D,MAAO,CAAC,CAACwsB,EAAakI,EAAI,CAAC,EAAE,CAAC,EAAG10B,CAAC,EAAGwsB,EAAahG,EAAWkO,EAAI,CAAC,EAAE,CAAC,CAAC,EAAG10B,CAAC,CAAC,EAAG,CAACwsB,EAAahG,EAAWkO,EAAI,CAAC,EAAE,CAAC,CAAC,EAAG10B,CAAC,EAAGwsB,EAAakI,EAAI,CAAC,EAAE,CAAC,EAAG10B,CAAC,CAAC,CAAC,CACxJ,KAAW,CAQL,IAAI,EAAI00B,EAAI,OAAQ,EACpB,IAAKxrC,EAAI,EAAGA,EAAIgvB,EAAMhvB,IACpB,EAAEA,CAAC,EAAI,EAAEA,CAAC,EAAE,OAAQ,EAQtB,QAHImsB,EAAIqW,EAASxT,CAAI,EAAE,QAAS,EAGvB1jB,EAAI,EAAGA,EAAIk0B,EAAMl0B,IAAK,CAE7B,IAAImgC,EAAOvpB,EAAI,EAAE5W,CAAC,EAAEA,CAAC,CAAC,EAClBogC,EAAOpgC,EAEX,IADAtL,EAAIsL,EAAI,EACDtL,EAAIgvB,GACL9M,EAAI,EAAEliB,CAAC,EAAEsL,CAAC,CAAC,EAAImgC,IACjBA,EAAOvpB,EAAI,EAAEliB,CAAC,EAAEsL,CAAC,CAAC,EAClBogC,EAAO1rC,GAETA,IAEF,GAAIyrC,IAAS,EACX,MAAM,MAAM,+CAA+C,EAE7DzrC,EAAI0rC,EACA1rC,IAAMsL,IACR+T,EAAO,EAAE/T,CAAC,EACV,EAAEA,CAAC,EAAI,EAAEtL,CAAC,EACV,EAAEA,CAAC,EAAIqf,EACPA,EAAO8M,EAAE7gB,CAAC,EACV6gB,EAAE7gB,CAAC,EAAI6gB,EAAEnsB,CAAC,EACVmsB,EAAEnsB,CAAC,EAAIqf,GAIT,IAAIssB,EAAK,EAAErgC,CAAC,EACRsgC,EAAKzf,EAAE7gB,CAAC,EACZ,IAAKtL,EAAI,EAAGA,EAAIgvB,EAAMhvB,IAAK,CACzB,IAAI6rC,EAAK,EAAE7rC,CAAC,EACR8rC,EAAK3f,EAAEnsB,CAAC,EACZ,GAAIA,IAAMsL,GAER,GAAIugC,EAAGvgC,CAAC,IAAM,EAAG,CAKf,IAJA+M,EAAIirB,EAAahG,EAAWuO,EAAGvgC,CAAC,CAAC,EAAGqgC,EAAGrgC,CAAC,CAAC,EAIpClE,EAAIkE,EAAGlE,EAAIo4B,EAAMp4B,IACpBykC,EAAGzkC,CAAC,EAAIgzB,EAAUyR,EAAGzkC,CAAC,EAAGq7B,EAASpqB,EAAGszB,EAAGvkC,CAAC,CAAC,CAAC,EAE7C,IAAKA,EAAI,EAAGA,EAAIo4B,EAAMp4B,IACpB0kC,EAAG1kC,CAAC,EAAIgzB,EAAU0R,EAAG1kC,CAAC,EAAGq7B,EAASpqB,EAAGuzB,EAAGxkC,CAAC,CAAC,CAAC,CAE3D,MACiB,CAIL,IADAiR,EAAIszB,EAAGrgC,CAAC,EACHlE,EAAIkE,EAAGlE,EAAIo4B,EAAMp4B,IACpBykC,EAAGzkC,CAAC,EAAIk8B,EAAauI,EAAGzkC,CAAC,EAAGiR,CAAC,EAE/B,IAAKjR,EAAI,EAAGA,EAAIo4B,EAAMp4B,IACpB0kC,EAAG1kC,CAAC,EAAIk8B,EAAawI,EAAG1kC,CAAC,EAAGiR,CAAC,CAE3C,CACA,CACA,CACM,OAAO8T,CACb,CACA,CACA,CAAC,ECtLM,SAAS4f,GAAkBl0B,EAAM,CACtC,GAAI,CACF,UAAAuiB,EACA,SAAA3a,EACA,QAAA8K,EACA,SAAAkY,EACA,eAAApI,EACA,aAAAiJ,EACA,KAAArf,EACA,IAAA/B,EACA,UAAA6d,EACA,KAAAiM,EACA,KAAAxvC,EACA,QAAA4tB,EACA,IAAAsY,EACA,GAAAuJ,EACA,OAAAC,EACA,UAAAC,EACA,MAAArC,EACA,QAAA9M,EACA,OAAAkD,EACA,QAAAF,EACA,kBAAAoM,EACA,IAAA13B,CACJ,EAAMmD,EAUJ,SAASw0B,EAAY36B,EAAKoV,EAAGwlB,EAAM90C,GAAM,CACvC,IAAI+0C,EAAc,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,GAMlFnI,EAAIoI,EAAQ96B,EAAKoV,EAAGwlB,EAAM90C,GAAM+0C,CAAW,EAc/CE,EAAmB/6B,EAAKoV,EAAGwlB,EAAM90C,GAAM+0C,EAAanI,CAAC,EAIrD,GAAI,CACF,OAAA3S,EACA,EAAA7K,CACN,EAAQ8lB,EAAuBh7B,EAAKoV,EAAGwlB,EAAM90C,GAAM+0C,CAAW,EAQ1D,GAAIA,EAAa,CACf,IAAII,EAAeC,EAAiBl7B,EAAKoV,EAAGF,EAAGwd,EAAG3S,EAAQ6a,EAAM90C,EAAI,EACpE,MAAO,CACL,OAAAi6B,EACA,aAAAkb,CACD,CACP,CACI,MAAO,CACL,OAAAlb,CACD,CACL,CASE,SAAS+a,EAAQ96B,EAAKoV,EAAGwlB,EAAM90C,GAAM+0C,EAAa,CAChD,IAAIM,EAAMr1C,KAAS,YACfs1C,EAAOt1C,KAAS,UAChBu1C,EAAWF,EAAM9M,EAAU,CAAC,EAAI,EAChCpkB,EAAMkxB,EAAM9M,EAAU,CAAC,EAAI+M,EAAO9P,EAAQ,CAAC,EAAI,EAC/CgQ,GAAUH,EAAM9M,EAAU,CAAC,EAAI,EAG/B5L,EAAQ0Y,EAAM9M,EAAU,EAAE,EAAI,EAC9BkN,GAAU5S,EAAelG,EAAOA,CAAK,EAGrC+Y,GACAX,IACFW,GAAQ,MAAMpmB,CAAC,EAAE,KAAKnL,CAAG,GAK3B,QADIzT,GAAO,GACJ,CAACA,IAAM,CAEZA,GAAO,GACP,QAAS5U,GAAI,EAAGA,GAAIwzB,EAAGxzB,KAAK,CAK1B,QAFI65C,GAAUJ,EACVK,GAAUL,EACLvyB,GAAI,EAAGA,GAAIsM,EAAGtM,KACjBlnB,KAAMknB,KACV2yB,GAAU/S,EAAU+S,GAASjrB,EAAIxQ,EAAI8I,EAAC,EAAElnB,EAAC,CAAC,CAAC,EAC3C85C,GAAUhT,EAAUgT,GAASlrB,EAAIxQ,EAAIpe,EAAC,EAAEknB,EAAC,CAAC,CAAC,GAE7C,GAAI,CAACsvB,EAAMqD,GAAS,CAAC,GAAK,CAACrD,EAAMsD,GAAS,CAAC,EAAG,CAS5C,QAJI/0B,GAAI20B,GACJ1hC,GAAI6hC,GACJE,GAAc/J,EAAa8J,GAASjZ,CAAK,EACzCmZ,EAAcjT,EAAe+S,GAASjZ,CAAK,EACxC6L,EAAQ10B,GAAG+hC,EAAW,GAC3B/hC,GAAI+uB,EAAe/uB,GAAG2hC,EAAO,EAC7B50B,GAAIgiB,EAAehiB,GAAG8b,CAAK,EAE7B,KAAO+L,EAAO50B,GAAGgiC,CAAW,GAC1BhiC,GAAIg4B,EAAah4B,GAAG2hC,EAAO,EAC3B50B,GAAIirB,EAAajrB,GAAG8b,CAAK,EAK3B,IAAIoZ,EAAYvN,EAAQsD,EAAalJ,EAAU9uB,GAAG8hC,EAAO,EAAG/0B,EAAC,EAAGgiB,EAAeD,EAAU+S,GAASC,EAAO,EAAG,GAAI,CAAC,EAGjH,GAAIG,EAAW,CAGbrlC,GAAO,GAEP,QADIslC,EAAIlK,EAAa,EAAGjrB,EAAC,EAChBwa,EAAK,EAAGA,EAAK/L,EAAG+L,IACnBv/B,KAAMu/B,IAGVnhB,EAAIpe,EAAC,EAAEu/B,CAAE,EAAIwH,EAAe3oB,EAAIpe,EAAC,EAAEu/B,CAAE,EAAG2a,CAAC,EACzC97B,EAAImhB,CAAE,EAAEv/B,EAAC,EAAI+mC,EAAe3oB,EAAImhB,CAAE,EAAEv/B,EAAC,EAAG+kB,EAAC,GAIvCk0B,IACFW,GAAM55C,EAAC,EAAI+mC,EAAe6S,GAAM55C,EAAC,EAAGk6C,CAAC,EAEnD,CACA,CACA,CACA,CAGI,OAAOjB,EAAcP,EAAKkB,EAAK,EAAI,IACvC,CAUE,SAAST,EAAmB/6B,EAAKoV,EAAGwlB,EAAM90C,GAAM+0C,EAAanI,EAAG,CAC9D,IAAIyI,EAAMr1C,KAAS,YACfs1C,EAAOt1C,KAAS,UAChBw5B,EAAO6b,EAAM9M,EAAU,CAAC,EAAI+M,EAAO9P,EAAQ,CAAC,EAAI,EAChD6P,IACFP,EAAOvM,EAAUuM,CAAI,GAEvB,QAASh5C,GAAI,EAAGA,GAAIwzB,EAAI,EAAGxzB,KAAK,CAK9B,QAFIm6C,EAAW,EACXp4C,GAAM27B,EACDxW,GAAIlnB,GAAI,EAAGknB,GAAIsM,EAAGtM,KAAK,CAC9B,IAAIpoB,GAAKsf,EAAI8I,EAAC,EAAElnB,EAAC,EACb0sC,EAAQ9d,EAAI7sB,EAAG,EAAG6sB,EAAI9vB,EAAE,CAAC,IAC3BiD,GAAMjD,GACNq7C,EAAWjzB,GAErB,CAGM,GAAI,CAAAwlB,EAAQ9d,EAAI7sB,EAAG,EAAGi3C,CAAI,EAG1B,IAAImB,IAAan6C,GAAI,EAAG,CAEtB,IAAIo6C,GAAOh8B,EAAI+7B,CAAQ,EACvB/7B,EAAI+7B,CAAQ,EAAI/7B,EAAIpe,GAAI,CAAC,EACzBoe,EAAIpe,GAAI,CAAC,EAAIo6C,GAGb,QAAS3I,GAAM,EAAGA,GAAMje,EAAGie,KAAO,CAChC,IAAI4I,GAAOj8B,EAAIqzB,EAAG,EAAE0I,CAAQ,EAC5B/7B,EAAIqzB,EAAG,EAAE0I,CAAQ,EAAI/7B,EAAIqzB,EAAG,EAAEzxC,GAAI,CAAC,EACnCoe,EAAIqzB,EAAG,EAAEzxC,GAAI,CAAC,EAAIq6C,EAC5B,CAGQ,GAAIpB,EAAa,CACf,IAAIqB,GAAOxJ,EAAEqJ,CAAQ,EACrBrJ,EAAEqJ,CAAQ,EAAIrJ,EAAE9wC,GAAI,CAAC,EACrB8wC,EAAE9wC,GAAI,CAAC,EAAIs6C,EACrB,CACA,CAGM,QAAShJ,GAAMtxC,GAAI,EAAGsxC,GAAM9d,EAAG8d,KAAO,CACpC,IAAI9kC,GAAIwjC,EAAa5xB,EAAIkzB,EAAG,EAAEtxC,EAAC,EAAG+B,EAAG,EACrC,GAAIyK,KAAM,EAKV,SAASwa,GAAI,EAAGA,GAAIwM,EAAGxM,KACrB5I,EAAIkzB,EAAG,EAAEtqB,EAAC,EAAImF,EAAS/N,EAAIkzB,EAAG,EAAEtqB,EAAC,EAAG+f,EAAev6B,GAAG4R,EAAIpe,GAAI,CAAC,EAAEgnB,EAAC,CAAC,CAAC,EAItE,QAAS+Y,EAAK,EAAGA,EAAKvM,EAAGuM,IACvB3hB,EAAI2hB,CAAE,EAAE//B,GAAI,CAAC,EAAI8mC,EAAU1oB,EAAI2hB,CAAE,EAAE//B,GAAI,CAAC,EAAG+mC,EAAev6B,GAAG4R,EAAI2hB,CAAE,EAAEuR,EAAG,CAAC,CAAC,EAI5E,GAAI2H,EACF,QAAS/Y,EAAM,EAAGA,EAAM1M,EAAG0M,IACzB4Q,EAAEQ,EAAG,EAAEpR,CAAG,EAAI/T,EAAS2kB,EAAEQ,EAAG,EAAEpR,CAAG,EAAG6G,EAAev6B,GAAGskC,EAAE9wC,GAAI,CAAC,EAAEkgC,CAAG,CAAC,CAAC,EAGhF,EACA,CACI,OAAO4Q,CACX,CAOE,SAASsI,EAAuB/lB,EAAGG,EAAGwlB,EAAM90C,GAAM+0C,EAAa,CAC7D,IAAIM,EAAMr1C,KAAS,YACfs1C,EAAOt1C,KAAS,UAChBmkB,EAAMkxB,EAAM9M,EAAU,CAAC,EAAI+M,EAAO9P,EAAQ,CAAC,EAAI,EAC/C6P,IACFP,EAAOvM,EAAUuM,CAAI,GAgCvB,QApBI56B,EAAMhP,GAAMikB,CAAC,EAGbknB,GAAU,CAAE,EAGZ/tC,EAAIgnB,EAIJgnB,GAAQ,CAAE,EAGVC,GAASxB,EAAcP,EAAK,MAAMllB,CAAC,EAAE,KAAKnL,CAAG,CAAC,EAAI,OAGlDqyB,GAAWzB,EAAcP,EAAK,MAAMlsC,CAAC,EAAE,KAAK6b,CAAG,CAAC,EAAI,OAGpDsyB,GAAwB,EACrBA,IAAyB,KAAK,CACnCA,IAAyB,EAazB,QAPI3zB,GAAI5I,EAAI5R,EAAI,CAAC,EAAEA,EAAI,CAAC,EAOfxM,GAAI,EAAGA,GAAIwM,EAAGxM,KACrBoe,EAAIpe,EAAC,EAAEA,EAAC,EAAImsB,EAAS/N,EAAIpe,EAAC,EAAEA,EAAC,EAAGgnB,EAAC,EAInC,GAAI,CACF,EAAA4vB,GACA,EAAA9F,EACR,EAAU6H,EAAGv6B,CAAG,EACVA,EAAM+wB,EAAS2B,GAAG8F,EAAC,EACnB,QAASzd,GAAK,EAAGA,GAAK3sB,EAAG2sB,KACvB/a,EAAI+a,EAAE,EAAEA,EAAE,EAAI2N,EAAU1oB,EAAI+a,EAAE,EAAEA,EAAE,EAAGnS,EAAC,EASxC,GALIiyB,IACFyB,GAAWvL,EAASuL,GAAU9D,EAAC,GAI7BpqC,IAAM,GAAKkgC,EAAQ9d,EAAIxQ,EAAI5R,EAAI,CAAC,EAAEA,EAAI,CAAC,CAAC,EAAGwsC,CAAI,EAAG,CACpD2B,GAAwB,EACxBJ,GAAQ,KAAKn8B,EAAI5R,EAAI,CAAC,EAAEA,EAAI,CAAC,CAAC,EAG1BysC,IACFuB,GAAM,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EACnBI,EAAcF,GAAUlnB,CAAC,EACzBinB,GAAStL,EAASsL,GAAQC,EAAQ,EAC9BluC,EAAI,IACNkuC,GAAWhC,EAAK,MAAMlsC,EAAI,CAAC,EAAE,KAAK6b,CAAG,CAAC,IAK1C7b,GAAK,EACL4R,EAAI,IAAK,EACT,QAASihB,GAAM,EAAGA,GAAM7yB,EAAG6yB,KACzBjhB,EAAIihB,EAAG,EAAE,IAAK,CAIjB,SAAU7yB,IAAM,GAAKkgC,EAAQ9d,EAAIxQ,EAAI5R,EAAI,CAAC,EAAEA,EAAI,CAAC,CAAC,EAAGwsC,CAAI,EAAG,CAC3D2B,GAAwB,EACxB,IAAIE,EAAKC,EAAe18B,EAAI5R,EAAI,CAAC,EAAEA,EAAI,CAAC,EAAG4R,EAAI5R,EAAI,CAAC,EAAEA,EAAI,CAAC,EAAG4R,EAAI5R,EAAI,CAAC,EAAEA,EAAI,CAAC,EAAG4R,EAAI5R,EAAI,CAAC,EAAEA,EAAI,CAAC,CAAC,EAClG+tC,GAAQ,KAAK,GAAGM,CAAE,EAGd5B,IACFuB,GAAM,QAAQO,EAAc38B,EAAI5R,EAAI,CAAC,EAAEA,EAAI,CAAC,EAAG4R,EAAI5R,EAAI,CAAC,EAAEA,EAAI,CAAC,EAAG4R,EAAI5R,EAAI,CAAC,EAAEA,EAAI,CAAC,EAAG4R,EAAI5R,EAAI,CAAC,EAAEA,EAAI,CAAC,EAAGquC,EAAG,CAAC,EAAGA,EAAG,CAAC,EAAG7B,EAAM90C,EAAI,CAAC,EACjI02C,EAAcF,GAAUlnB,CAAC,EACzBinB,GAAStL,EAASsL,GAAQC,EAAQ,EAC9BluC,EAAI,IACNkuC,GAAWhC,EAAK,MAAMlsC,EAAI,CAAC,EAAE,KAAK6b,CAAG,CAAC,IAK1C7b,GAAK,EACL4R,EAAI,IAAK,EACTA,EAAI,IAAK,EACT,QAASkhB,EAAM,EAAGA,EAAM9yB,EAAG8yB,IACzBlhB,EAAIkhB,CAAG,EAAE,IAAK,EACdlhB,EAAIkhB,CAAG,EAAE,IAAK,CAExB,CACM,GAAI9yB,IAAM,EACR,KAER,CAMI,GAHA+tC,GAAQ,KAAK,CAAC9qC,EAAGC,IAAM,CAACyc,EAASyC,EAAInf,CAAC,EAAGmf,EAAIlf,CAAC,CAAC,CAAC,EAG5CirC,GAAwB,IAAK,CAC/B,IAAIv9C,EAAM,MAAM,qEAAuEm9C,GAAQ,KAAK,IAAI,CAAC,EACzG,MAAAn9C,EAAI,OAASm9C,GACbn9C,EAAI,QAAU,CAAE,EACVA,CACZ,CAII,IAAIk2B,EAAI2lB,EAAc9J,EAASsL,GAAQO,EAAUR,GAAOhnB,CAAC,CAAC,EAAI,OAC9D,MAAO,CACL,OAAQ+mB,GACR,EAAAjnB,CACD,CACL,CAWE,SAASgmB,EAAiBjmB,EAAGG,EAAGF,EAAGwd,GAAG3S,EAAQ6a,EAAM90C,EAAM,CACxD,IAAI+2C,EAAO7L,EAAI9b,CAAC,EACZ4nB,EAAI/L,EAAS8L,EAAM5nB,EAAGC,CAAC,EACvBimB,GAAMr1C,IAAS,YACfs1C,EAAOt1C,IAAS,UAChBw5B,GAAO6b,GAAM9M,EAAU,CAAC,EAAI+M,EAAO9P,EAAQ,CAAC,EAAI,EAChDrhB,GAAMkxB,GAAM9M,EAAU,CAAC,EAAI+M,EAAO9P,EAAQ,CAAC,EAAI,EAI/CyR,GAAe,CAAE,EACjBC,GAAiB,CAAE,EACvB,QAASC,MAAUld,EAAQ,CACzB,IAAIn+B,GAAIs7C,EAAQH,GAAcE,GAAQ7E,CAAK,EACvCx2C,KAAM,IACRm7C,GAAa,KAAKE,EAAM,EACxBD,GAAe,KAAK,CAAC,GAErBA,GAAep7C,EAAC,GAAK,CAE7B,CAoCI,QA9BIu7C,GAAU,CAAE,EACZ1rC,GAAMsrC,GAAa,OACnBzrC,GAAI,MAAM8jB,CAAC,EAAE,KAAKkK,EAAI,EACtB8d,GAAI9C,EAAK,MAAMllB,CAAC,EAAE,KAAKnL,EAAG,CAAC,EAC3BiT,EAAQ,UAAiB,CAC3B,IAAI+f,EAASF,GAAanb,CAAG,EACzByb,EAAItvB,EAAS+uB,EAAG/L,EAASkM,EAAQG,EAAC,CAAC,EAEnCE,EAAY7C,EAAU4C,EAAG/rC,EAAC,EAM9B,IALAgsC,EAAU,MAAK,EAKRA,EAAU,OAASN,GAAepb,CAAG,GAAG,CAC7C,IAAI2b,GAAYC,EAAeH,EAAGjoB,EAAGkoB,EAAW1C,EAAM90C,CAAI,EAC1D,GAAIy3C,KAAc,KAChB,MAEFD,EAAU,KAAKC,EAAS,CAChC,CAGM,IAAIE,EAAa1M,EAASC,EAAI0B,EAAC,EAAGxd,CAAC,EACnCooB,EAAYA,EAAU,IAAIh1C,IAAKyoC,EAAS0M,EAAYn1C,EAAC,CAAC,EACtD60C,GAAQ,KAAK,GAAGG,EAAU,IAAIh1C,KAAM,CAClC,MAAO20C,EACP,OAAQpkB,EAAQvwB,EAAC,CAClB,EAAC,CAAC,CACJ,EACQs5B,EAAM,EAAGA,EAAMnwB,GAAKmwB,IAC3B1E,EAAO,EAET,OAAOigB,EACX,CAME,SAAST,EAAerrC,EAAGC,EAAGsI,EAAGwL,GAAG,CAElC,IAAIs4B,EAAMhV,EAAUr3B,EAAG+T,EAAC,EACpBu4B,EAAO5vB,EAAS4a,EAAet3B,EAAG+T,EAAC,EAAGujB,EAAer3B,EAAGsI,CAAC,CAAC,EAC1DpY,EAAImnC,EAAe+U,EAAK,EAAG,EAC3Bv5B,EAAIwkB,EAAepW,EAAKxE,EAAS4a,EAAe+U,EAAKA,CAAG,EAAG/U,EAAe,EAAGgV,CAAI,CAAC,CAAC,EAAG,EAAG,EAC7F,MAAO,CAACjV,EAAUlnC,EAAG2iB,CAAC,EAAG4J,EAASvsB,EAAG2iB,CAAC,CAAC,CAC3C,CASE,SAASw4B,EAActrC,EAAGC,EAAGsI,EAAGwL,GAAGw4B,EAAIC,EAAIjD,EAAM90C,EAAM,CACrD,IAAIq1C,EAAMr1C,IAAS,YACfs1C,GAAOt1C,IAAS,UAChBw5B,EAAO6b,EAAM9M,EAAU,CAAC,EAAI+M,GAAO9P,EAAQ,CAAC,EAAI,EAChDrhB,GAAMkxB,EAAM9M,EAAU,CAAC,EAAI+M,GAAO9P,EAAQ,CAAC,EAAI,EAInD,GAAIgD,EAAQ9d,EAAI5W,CAAC,EAAGghC,CAAI,EACtB,MAAO,CAAC,CAAC3wB,GAAKqV,CAAI,EAAG,CAACA,EAAMrV,EAAG,CAAC,EAKlC,GAAIukB,EAAOhe,EAAIzC,EAAS6vB,EAAIC,CAAE,CAAC,EAAGjD,CAAI,EACpC,MAAO,CAAC,CAAC7sB,EAAS6vB,EAAIx4B,EAAC,EAAG2I,EAAS8vB,EAAIz4B,EAAC,CAAC,EAAG,CAACxL,EAAGA,CAAC,CAAC,EAKpD,IAAIkkC,GAAK/vB,EAAS1c,EAAGusC,CAAE,EACnBG,GAAKhwB,EAAS3I,GAAGw4B,CAAE,EAKvB,OAAItP,EAAQ9d,EAAIlf,CAAC,EAAGspC,CAAI,GAAKtM,EAAQ9d,EAAIutB,EAAE,EAAGnD,CAAI,EACzC,CAAC,CAACkD,GAAI7zB,EAAG,EAAG,CAACrQ,EAAG0lB,CAAI,CAAC,EAErB,CAAC,CAAChuB,EAAGguB,CAAI,EAAG,CAACye,GAAI9zB,EAAG,CAAC,CAElC,CAME,SAASuyB,EAAcx8B,EAAKoV,EAAG,CAE7B,QAASxzB,EAAI,EAAGA,EAAIoe,EAAI,OAAQpe,IAC9Boe,EAAIpe,CAAC,EAAE,KAAK,GAAG,MAAMwzB,EAAIpV,EAAIpe,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,EAIjD,QAASigC,GAAM7hB,EAAI,OAAQ6hB,GAAMzM,EAAGyM,KAClC7hB,EAAI,KAAK,MAAMoV,CAAC,EAAE,KAAK,CAAC,CAAC,EACzBpV,EAAI6hB,EAAG,EAAEA,EAAG,EAAI,EAElB,OAAO7hB,CACX,CAOE,SAAS48B,EAAU58B,EAAKoV,EAAG,CAEzB,QADIC,EAAI,CAAE,EACDzzB,GAAI,EAAGA,GAAIwzB,EAAGxzB,KACrByzB,EAAEzzB,EAAC,EAAI,MAAMwzB,CAAC,EAAE,KAAK,CAAC,EAExB,IAAI6iB,EAAI,EACR,QAASzlB,KAAOxS,EAAK,CAEnB,QADI5R,EAAIokB,EAAI,OACHuP,EAAM,EAAGA,EAAM3zB,EAAG2zB,IACzB,QAASjZ,EAAI,EAAGA,EAAI1a,EAAG0a,IACrBuM,EAAE4iB,EAAIlW,CAAG,EAAEkW,EAAInvB,CAAC,EAAI0J,EAAIuP,CAAG,EAAEjZ,CAAC,EAGlCmvB,GAAK7pC,CACX,CACI,OAAOinB,CACX,CAUE,SAAS6nB,EAAQl9B,EAAKtf,EAAImT,EAAI,CAC5B,QAASjS,GAAI,EAAGA,GAAIoe,EAAI,OAAQpe,KAC9B,GAAIiS,EAAGmM,EAAIpe,EAAC,EAAGlB,CAAE,EACf,OAAOkB,GAGX,MAAO,EACX,CAgBE,SAAS47C,EAAevoB,EAAGG,EAAG4oB,EAAQpD,GAAM90C,EAAM,CAMhD,QALIm4C,EAAWn4C,IAAS,YAAcuoC,EAAU,GAAI,EAAI,IACpD/8B,EAGA1P,EAAI,EACDA,EAAI,EAAG,EAAEA,EAAG,CACjB0P,EAAI4sC,EAAuB9oB,EAAG4oB,EAAQl4C,CAAI,EAC1C,GAAI,CACFwL,EAAIkpC,EAAOvlB,EAAG3jB,CAAC,CAChB,OAAQgrB,GAAS,CAGhB,QACR,CACM,GAAIkS,EAAO2P,GAAK7sC,CAAC,EAAG2sC,CAAQ,EAC1B,KAER,CACI,GAAIr8C,GAAK,EACP,OAAO,KAKT,IADAA,EAAI,IACS,CACX,IAAIgY,EAAI4gC,EAAOvlB,EAAG3jB,CAAC,EACnB,GAAIg9B,EAAQ6P,GAAKC,EAAqB9sC,EAAG,CAACsI,CAAC,CAAC,CAAC,EAAGghC,EAAI,EAClD,MAEF,GAAI,EAAEh5C,GAAK,GACT,OAAO,KAET0P,EAAI+sC,GAAUzkC,CAAC,CACrB,CACI,OAAOtI,CACX,CAUE,SAAS4sC,EAAuB9oB,EAAG4oB,EAAQl4C,EAAM,CAC/C,IAAIq1C,GAAMr1C,IAAS,YACfs1C,EAAOt1C,IAAS,UAGhBwC,EAAI,MAAM8sB,CAAC,EAAE,KAAK,CAAC,EAAE,IAAIkkB,GAAK,EAAI,KAAK,OAAM,EAAK,CAAC,EACvD,OAAI6B,KACF7yC,EAAIA,EAAE,IAAI8F,GAAKigC,EAAUjgC,CAAC,CAAC,GAEzBgtC,IACF9yC,EAAIA,EAAE,IAAI8F,GAAKk9B,EAAQl9B,CAAC,CAAC,GAI3B9F,EAAI81C,EAAqB91C,EAAG01C,CAAM,EAG3BK,GAAU/1C,EAAGxC,CAAI,CAC5B,CAKE,SAASs4C,EAAqB91C,EAAG01C,EAAQ,CACvC,IAAIM,EAAcxzC,EAAKxC,CAAC,EACxB,QAAS0hB,MAAKg0B,EACZh0B,GAAI0O,EAAQ1O,GAAGs0B,CAAW,EAE1Bh2C,EAAIylB,EAASzlB,EAAGyoC,EAASa,EAAa5uB,EAAIgH,GAAG1hB,CAAC,EAAG0a,EAAIgH,GAAGA,EAAC,CAAC,EAAGA,EAAC,CAAC,EAEjE,OAAO1hB,CACX,CAOE,SAAS61C,GAAK71C,EAAG,CACf,OAAOkoB,EAAI+B,EAAKvP,EAAI1a,EAAGA,CAAC,CAAC,CAAC,CAC9B,CASE,SAAS+1C,GAAU/1C,EAAGxC,EAAM,CAC1B,IAAIq1C,EAAMr1C,IAAS,YACfs1C,GAAOt1C,IAAS,UAChBmkB,EAAMkxB,EAAM9M,EAAU,CAAC,EAAI+M,GAAO9P,EAAQ,CAAC,EAAI,EACnD,OAAOyF,EAASa,EAAa3nB,EAAKk0B,GAAK71C,CAAC,CAAC,EAAGA,CAAC,CACjD,CACE,OAAOqyC,CACT,CCxrBO,SAAS4D,GAAoBp4B,EAAM,CACxC,GAAI,CACF,OAAAnU,EACA,UAAA02B,EACA,SAAA3a,EACA,IAAAyC,EACA,KAAAM,EACA,IAAAQ,EACA,IAAAe,EACA,eAAAsW,EACA,IAAAqI,EACA,UAAA3C,EACA,SAAA0C,EACA,IAAApgB,CACJ,EAAMxK,EAOJ,SAASq4B,EAAKx+B,EAAKoV,EAAG,CACpB,IAAIwlB,EAAO,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI5oC,EAAO,QAClFlM,EAAO,UAAU,OAAS,EAAI,UAAU,CAAC,EAAI,OAC7C24C,EAAiB,UAAU,OAAS,EAAI,UAAU,CAAC,EAAI,OAC3D,GAAI34C,IAAS,SACX,OAAOw0C,EAAKt6B,EAAK46B,EAAM6D,CAAc,EAEvC,GAAI34C,IAAS,YACX,OAAO44C,EAAQ1+B,EAAK46B,EAAM6D,CAAc,EAE1C,MAAM,UAAU,0BAA4B34C,CAAI,CACpD,CAGE,SAASw0C,EAAK94C,EAAG6gB,EAAWo8B,EAAgB,CAC1C,IAAIrpB,EAAI5zB,EAAE,OACNm9C,EAAK,KAAK,IAAIt8B,EAAY+S,CAAC,EAC3BwpB,EACAC,EACJ,GAAIJ,EAAgB,CAClBI,EAAM,IAAI,MAAMzpB,CAAC,EAEjB,QAASxzB,EAAI,EAAGA,EAAIwzB,EAAGxzB,IACrBi9C,EAAIj9C,CAAC,EAAI,MAAMwzB,CAAC,EAAE,KAAK,CAAC,EACxBypB,EAAIj9C,CAAC,EAAEA,CAAC,EAAI,CAEpB,CAGI,QADIk9C,EAAMC,EAAOv9C,CAAC,EACX,KAAK,IAAIs9C,EAAI,CAAC,CAAC,GAAK,KAAK,IAAIH,CAAE,GAAG,CACvC,IAAI5jB,EAAK+jB,EAAI,CAAC,EAAE,CAAC,EACbh2B,EAAIg2B,EAAI,CAAC,EAAE,CAAC,EAChBF,EAAMI,EAASx9C,EAAEu5B,CAAE,EAAEA,CAAE,EAAGv5B,EAAEsnB,CAAC,EAAEA,CAAC,EAAGtnB,EAAEu5B,CAAE,EAAEjS,CAAC,CAAC,EAC3CtnB,EAAIquB,EAAGruB,EAAGo9C,EAAK7jB,EAAIjS,CAAC,EAChB21B,IAAgBI,EAAMI,EAAKJ,EAAKD,EAAK7jB,EAAIjS,CAAC,GAC9Cg2B,EAAMC,EAAOv9C,CAAC,CACpB,CAEI,QADI09C,GAAK,MAAM9pB,CAAC,EAAE,KAAK,CAAC,EACf6L,GAAM,EAAGA,GAAM7L,EAAG6L,KACzBie,GAAGje,EAAG,EAAIz/B,EAAEy/B,EAAG,EAAEA,EAAG,EAEtB,OAAOke,EAAQnuC,GAAMkuC,EAAE,EAAGL,EAAKJ,CAAc,CACjD,CAGE,SAASC,EAAQl9C,EAAG6gB,EAAWo8B,EAAgB,CAC7C,IAAIrpB,EAAI5zB,EAAE,OACNm9C,EAAKnuB,EAAInO,EAAY+S,CAAC,EACtBwpB,EACAC,EACJ,GAAIJ,EAAgB,CAClBI,EAAM,IAAI,MAAMzpB,CAAC,EAEjB,QAASxzB,EAAI,EAAGA,EAAIwzB,EAAGxzB,IACrBi9C,EAAIj9C,CAAC,EAAI,MAAMwzB,CAAC,EAAE,KAAK,CAAC,EACxBypB,EAAIj9C,CAAC,EAAEA,CAAC,EAAI,CAEpB,CAGI,QADIk9C,EAAMM,EAAU59C,CAAC,EACdgvB,EAAIsuB,EAAI,CAAC,CAAC,GAAKtuB,EAAImuB,CAAE,GAAG,CAC7B,IAAIzd,EAAM4d,EAAI,CAAC,EAAE,CAAC,EACdh2B,EAAIg2B,EAAI,CAAC,EAAE,CAAC,EAChBF,EAAMS,EAAY79C,EAAE0/B,CAAG,EAAEA,CAAG,EAAG1/B,EAAEsnB,CAAC,EAAEA,CAAC,EAAGtnB,EAAE0/B,CAAG,EAAEpY,CAAC,CAAC,EACjDtnB,EAAI89C,EAAM99C,EAAGo9C,EAAK1d,EAAKpY,CAAC,EACpB21B,IAAgBI,EAAMU,EAAQV,EAAKD,EAAK1d,EAAKpY,CAAC,GAClDg2B,EAAMM,EAAU59C,CAAC,CACvB,CAEI,QADI09C,GAAK,MAAM9pB,CAAC,EAAE,KAAK,CAAC,EACfwM,GAAM,EAAGA,GAAMxM,EAAGwM,KACzBsd,GAAGtd,EAAG,EAAIpgC,EAAEogC,EAAG,EAAEA,EAAG,EAGtB,OAAOud,EAAQnuC,GAAMkuC,EAAE,EAAGL,EAAKJ,CAAc,CACjD,CAGE,SAASO,EAASQ,EAAKC,EAAKC,EAAK,CAC/B,IAAIC,EAAQF,EAAMD,EAClB,OAAI,KAAK,IAAIG,CAAK,GAAK3tC,EAAO,QACrB,KAAK,GAAK,EAEV,GAAM,KAAK,KAAK,EAAM0tC,GAAOD,EAAMD,EAAI,CAEpD,CAGE,SAASH,EAAYG,EAAKC,EAAKC,EAAK,CAClC,IAAIC,EAAQ5xB,EAAS0xB,EAAKD,CAAG,EAC7B,OAAIhvB,EAAImvB,CAAK,GAAK3tC,EAAO,QAChBq8B,EAAU,EAAE,EAAE,KAAI,EAAG,IAAI,CAAC,EAE1B1F,EAAe,GAAK7X,EAAKigB,EAAS,EAAK2O,EAAK1O,EAAI2O,CAAK,CAAC,CAAC,CAAC,CAErE,CAGE,SAASV,EAAKJ,EAAKe,EAAOh+C,EAAGknB,EAAG,CAM9B,QALIsM,EAAIypB,EAAI,OACRjlC,EAAI,KAAK,IAAIgmC,CAAK,EAClBlqC,EAAI,KAAK,IAAIkqC,CAAK,EAClBC,EAAM,MAAMzqB,CAAC,EAAE,KAAK,CAAC,EACrB0qB,EAAM,MAAM1qB,CAAC,EAAE,KAAK,CAAC,EAChBxM,EAAI,EAAGA,EAAIwM,EAAGxM,IACrBi3B,EAAIj3B,CAAC,EAAIhP,EAAIilC,EAAIj2B,CAAC,EAAEhnB,CAAC,EAAI8T,EAAImpC,EAAIj2B,CAAC,EAAEE,CAAC,EACrCg3B,EAAIl3B,CAAC,EAAIlT,EAAImpC,EAAIj2B,CAAC,EAAEhnB,CAAC,EAAIgY,EAAIilC,EAAIj2B,CAAC,EAAEE,CAAC,EAEvC,QAAS6Y,EAAK,EAAGA,EAAKvM,EAAGuM,IACvBkd,EAAIld,CAAE,EAAE//B,CAAC,EAAIi+C,EAAIle,CAAE,EACnBkd,EAAIld,CAAE,EAAE7Y,CAAC,EAAIg3B,EAAIne,CAAE,EAErB,OAAOkd,CACX,CAEE,SAASU,EAAQV,EAAKe,EAAOh+C,EAAGknB,EAAG,CAMjC,QALIsM,EAAIypB,EAAI,OACRjlC,EAAI0X,EAAIsuB,CAAK,EACblqC,EAAI2c,EAAIutB,CAAK,EACbC,EAAM,MAAMzqB,CAAC,EAAE,KAAKiZ,EAAU,CAAC,CAAC,EAChCyR,EAAM,MAAM1qB,CAAC,EAAE,KAAKiZ,EAAU,CAAC,CAAC,EAC3BzlB,EAAI,EAAGA,EAAIwM,EAAGxM,IACrBi3B,EAAIj3B,CAAC,EAAImF,EAAS4a,EAAe/uB,EAAGilC,EAAIj2B,CAAC,EAAEhnB,CAAC,CAAC,EAAG+mC,EAAejzB,EAAGmpC,EAAIj2B,CAAC,EAAEE,CAAC,CAAC,CAAC,EAC5Eg3B,EAAIl3B,CAAC,EAAI8f,EAAUC,EAAejzB,EAAGmpC,EAAIj2B,CAAC,EAAEhnB,CAAC,CAAC,EAAG+mC,EAAe/uB,EAAGilC,EAAIj2B,CAAC,EAAEE,CAAC,CAAC,CAAC,EAE/E,QAASgZ,EAAM,EAAGA,EAAM1M,EAAG0M,IACzB+c,EAAI/c,CAAG,EAAElgC,CAAC,EAAIi+C,EAAI/d,CAAG,EACrB+c,EAAI/c,CAAG,EAAEhZ,CAAC,EAAIg3B,EAAIhe,CAAG,EAEvB,OAAO+c,CACX,CAGE,SAASS,EAAMS,EAAKH,EAAOh+C,EAAGknB,EAAG,CAc/B,QAbIsM,EAAI2qB,EAAI,OACRnmC,EAAIy0B,EAAU/c,EAAIsuB,CAAK,CAAC,EACxBlqC,EAAI24B,EAAUhc,EAAIutB,CAAK,CAAC,EACxBI,EAAKrX,EAAe/uB,EAAGA,CAAC,EACxBqmC,EAAKtX,EAAejzB,EAAGA,CAAC,EACxBwqC,EAAM,MAAM9qB,CAAC,EAAE,KAAKiZ,EAAU,CAAC,CAAC,EAChC8R,EAAM,MAAM/qB,CAAC,EAAE,KAAKiZ,EAAU,CAAC,CAAC,EAEhC+R,GAAQrP,EAAS1C,EAAU,CAAC,EAAGz0B,EAAGlE,EAAGqqC,EAAIn+C,CAAC,EAAEknB,CAAC,CAAC,EAE9Cu3B,GAAM3X,EAAU3a,EAAS4a,EAAeqX,EAAID,EAAIn+C,CAAC,EAAEA,CAAC,CAAC,EAAGw+C,EAAK,EAAGzX,EAAesX,EAAIF,EAAIj3B,CAAC,EAAEA,CAAC,CAAC,CAAC,EAC7Fw3B,EAAM3vB,EAAIgY,EAAesX,EAAIF,EAAIn+C,CAAC,EAAEA,CAAC,CAAC,EAAGw+C,GAAOzX,EAAeqX,EAAID,EAAIj3B,CAAC,EAAEA,CAAC,CAAC,CAAC,EAExEF,EAAI,EAAGA,EAAIwM,EAAGxM,IACrBs3B,EAAIt3B,CAAC,EAAImF,EAAS4a,EAAe/uB,EAAGmmC,EAAIn+C,CAAC,EAAEgnB,CAAC,CAAC,EAAG+f,EAAejzB,EAAGqqC,EAAIj3B,CAAC,EAAEF,CAAC,CAAC,CAAC,EAC5Eu3B,EAAIv3B,CAAC,EAAI8f,EAAUC,EAAejzB,EAAGqqC,EAAIn+C,CAAC,EAAEgnB,CAAC,CAAC,EAAG+f,EAAe/uB,EAAGmmC,EAAIj3B,CAAC,EAAEF,CAAC,CAAC,CAAC,EAG/Em3B,EAAIn+C,CAAC,EAAEA,CAAC,EAAIy+C,GACZN,EAAIj3B,CAAC,EAAEA,CAAC,EAAIw3B,EACZP,EAAIn+C,CAAC,EAAEknB,CAAC,EAAIulB,EAAU,CAAC,EACvB0R,EAAIj3B,CAAC,EAAElnB,CAAC,EAAIysC,EAAU,CAAC,EAEvB,QAASkS,EAAM,EAAGA,EAAMnrB,EAAGmrB,IACrBA,IAAQ3+C,GAAK2+C,IAAQz3B,IACvBi3B,EAAIn+C,CAAC,EAAE2+C,CAAG,EAAIL,EAAIK,CAAG,EACrBR,EAAIQ,CAAG,EAAE3+C,CAAC,EAAIs+C,EAAIK,CAAG,EACrBR,EAAIj3B,CAAC,EAAEy3B,CAAG,EAAIJ,EAAII,CAAG,EACrBR,EAAIQ,CAAG,EAAEz3B,CAAC,EAAIq3B,EAAII,CAAG,GAGzB,OAAOR,CACX,CAGE,SAASlwB,EAAGkwB,EAAKH,EAAOh+C,EAAGknB,EAAG,CAY5B,QAXIsM,EAAI2qB,EAAI,OACRnmC,EAAI,KAAK,IAAIgmC,CAAK,EAClBlqC,EAAI,KAAK,IAAIkqC,CAAK,EAClBI,EAAKpmC,EAAIA,EACTqmC,EAAKvqC,EAAIA,EACTwqC,EAAM,MAAM9qB,CAAC,EAAE,KAAK,CAAC,EACrB+qB,EAAM,MAAM/qB,CAAC,EAAE,KAAK,CAAC,EAErBirB,GAAML,EAAKD,EAAIn+C,CAAC,EAAEA,CAAC,EAAI,EAAIgY,EAAIlE,EAAIqqC,EAAIn+C,CAAC,EAAEknB,CAAC,EAAIm3B,EAAKF,EAAIj3B,CAAC,EAAEA,CAAC,EAC5Dw3B,GAAML,EAAKF,EAAIn+C,CAAC,EAAEA,CAAC,EAAI,EAAIgY,EAAIlE,EAAIqqC,EAAIn+C,CAAC,EAAEknB,CAAC,EAAIk3B,EAAKD,EAAIj3B,CAAC,EAAEA,CAAC,EAEvDF,EAAI,EAAGA,EAAIwM,EAAGxM,IACrBs3B,EAAIt3B,CAAC,EAAIhP,EAAImmC,EAAIn+C,CAAC,EAAEgnB,CAAC,EAAIlT,EAAIqqC,EAAIj3B,CAAC,EAAEF,CAAC,EACrCu3B,EAAIv3B,CAAC,EAAIlT,EAAIqqC,EAAIn+C,CAAC,EAAEgnB,CAAC,EAAIhP,EAAImmC,EAAIj3B,CAAC,EAAEF,CAAC,EAGvCm3B,EAAIn+C,CAAC,EAAEA,CAAC,EAAIy+C,GACZN,EAAIj3B,CAAC,EAAEA,CAAC,EAAIw3B,GACZP,EAAIn+C,CAAC,EAAEknB,CAAC,EAAI,EACZi3B,EAAIj3B,CAAC,EAAElnB,CAAC,EAAI,EAEZ,QAAS4+C,EAAM,EAAGA,EAAMprB,EAAGorB,IACrBA,IAAQ5+C,GAAK4+C,IAAQ13B,IACvBi3B,EAAIn+C,CAAC,EAAE4+C,CAAG,EAAIN,EAAIM,CAAG,EACrBT,EAAIS,CAAG,EAAE5+C,CAAC,EAAIs+C,EAAIM,CAAG,EACrBT,EAAIj3B,CAAC,EAAE03B,CAAG,EAAIL,EAAIK,CAAG,EACrBT,EAAIS,CAAG,EAAE13B,CAAC,EAAIq3B,EAAIK,CAAG,GAGzB,OAAOT,CACX,CAGE,SAAShB,EAAO0B,EAAK,CAInB,QAHIrrB,EAAIqrB,EAAI,OACRC,EAAS,EACTC,EAAQ,CAAC,EAAG,CAAC,EACR/+C,EAAI,EAAGA,EAAIwzB,EAAGxzB,IACrB,QAASknB,EAAIlnB,EAAI,EAAGknB,EAAIsM,EAAGtM,IACrB,KAAK,IAAI43B,CAAM,EAAI,KAAK,IAAID,EAAI7+C,CAAC,EAAEknB,CAAC,CAAC,IACvC43B,EAAS,KAAK,IAAID,EAAI7+C,CAAC,EAAEknB,CAAC,CAAC,EAC3B63B,EAAQ,CAAC/+C,EAAGknB,CAAC,GAInB,MAAO,CAAC63B,EAAOD,CAAM,CACzB,CAGE,SAAStB,EAAUqB,EAAK,CAItB,QAHIrrB,EAAIqrB,EAAI,OACRC,EAAS,EACTC,EAAQ,CAAC,EAAG,CAAC,EACR/+C,EAAI,EAAGA,EAAIwzB,EAAGxzB,IACrB,QAASknB,EAAIlnB,EAAI,EAAGknB,EAAIsM,EAAGtM,IACrB0H,EAAIkwB,CAAM,EAAIlwB,EAAIiwB,EAAI7+C,CAAC,EAAEknB,CAAC,CAAC,IAC7B43B,EAASlwB,EAAIiwB,EAAI7+C,CAAC,EAAEknB,CAAC,CAAC,EACtB63B,EAAQ,CAAC/+C,EAAGknB,CAAC,GAInB,MAAO,CAAC63B,EAAOD,CAAM,CACzB,CAGE,SAASvB,EAAQ/B,EAAGC,EAAGoB,EAAgB,CACrC,IAAIrpB,EAAIgoB,EAAE,OACNrd,EAAS,MAAM3K,CAAC,EAChBwrB,EACJ,GAAInC,EAAgB,CAClBmC,EAAO,MAAMxrB,CAAC,EACd,QAASxM,EAAI,EAAGA,EAAIwM,EAAGxM,IACrBg4B,EAAKh4B,CAAC,EAAI,MAAMwM,CAAC,CAEzB,CACI,QAASxzB,EAAI,EAAGA,EAAIwzB,EAAGxzB,IAAK,CAG1B,QAFIi/C,EAAQ,EACRC,EAAO1D,EAAE,CAAC,EACLt0B,EAAI,EAAGA,EAAIs0B,EAAE,OAAQt0B,IACxB0H,EAAI4sB,EAAEt0B,CAAC,CAAC,EAAI0H,EAAIswB,CAAI,IACtBD,EAAQ/3B,EACRg4B,EAAO1D,EAAEyD,CAAK,GAIlB,GADA9gB,EAAOn+B,CAAC,EAAIw7C,EAAE,OAAOyD,EAAO,CAAC,EAAE,CAAC,EAC5BpC,EACF,QAASsC,GAAM,EAAGA,GAAM3rB,EAAG2rB,KACzBH,EAAKh/C,CAAC,EAAEm/C,EAAG,EAAI1D,EAAE0D,EAAG,EAAEF,CAAK,EAC3BxD,EAAE0D,EAAG,EAAE,OAAOF,EAAO,CAAC,CAGhC,CACI,GAAI,CAACpC,EAAgB,MAAO,CAC1B,OAAA1e,CACD,EACD,IAAIkb,GAAe2F,EAAK,IAAI,CAACpT,EAAQ5rC,KAAO,CAC1C,MAAOm+B,EAAOn+B,CAAC,EACf,OAAA4rC,CACN,EAAM,EACF,MAAO,CACL,OAAAzN,EACA,aAAAkb,EACD,CACL,CACE,OAAOuD,CACT,CClSA,IAAIh2C,GAAO,OAGPic,GAAe,CAAC,SAAU,QAAS,SAAU,YAAa,QAAS,WAAY,MAAO,OAAQ,MAAO,MAAO,iBAAkB,eAAgB,MAAO,YAAa,WAAY,MAAO,SAAU,SAAU,UAAW,SAAU,UAAW,OAAQ,OAAQ,OAAQ,UAAW,KAAM,SAAU,YAAa,KAAM,KAAM,UAAW,oBAAqB,KAAK,EACnVu8B,GAA4Bx8B,GAAQhc,GAAMic,GAAc0B,GAAQ,CACzE,GAAI,CACF,OAAAnU,EACA,MAAAY,EACA,OAAAkU,EACA,UAAA4hB,EACA,SAAA3a,EACA,MAAAqqB,EACA,IAAA5nB,EACA,KAAAM,EACA,IAAAQ,EACA,IAAAe,EACA,eAAAsW,EACA,aAAAiJ,EACA,IAAAZ,EACA,UAAA3C,EACA,SAAA0C,EACA,IAAApgB,EACA,OAAA6d,EACA,OAAAxB,EACA,QAAAnU,EACA,OAAAmK,EACA,QAAAsI,EACA,KAAA/Y,EACA,KAAA+nB,EACA,KAAAxvC,EACA,QAAA4tB,EACA,GAAA6hB,EACA,OAAAC,EACA,UAAAC,EACA,GAAA/mB,EACA,GAAAD,EACA,QAAA6a,EACA,kBAAAoM,EACA,IAAA13B,CACJ,EAAMmD,EACA86B,EAAkB1C,GAAoB,CACxC,OAAAvsC,EACA,UAAA02B,EACA,SAAA3a,EAIA,IAAAyC,EACA,KAAAM,EACA,IAAAQ,EACA,IAAAe,EACA,eAAAsW,EACA,IAAAqI,EACA,UAAA3C,EAEA,SAAA0C,EACA,IAAApgB,CACJ,CAAG,EACGuwB,EAAgB7G,GAAkB,CAEpC,UAAA3R,EACA,SAAA3a,EACA,SAAAgjB,EACA,eAAApI,EACA,QAAA9P,EACA,aAAA+Y,EACA,KAAArf,EACA,IAAA/B,EACA,UAAA6d,EACA,KAAAiM,EACA,KAAAxvC,EACA,QAAA4tB,EACA,GAAA6hB,EACA,IAAAvJ,EACA,OAAAwJ,EACA,UAAAC,EACA,MAAArC,EACA,QAAA9M,EACA,OAAAkD,EACA,QAAAF,EACA,kBAAAoM,EACA,IAAA13B,CACJ,CAAG,EA8DD,OAAOpQ,EAAM,OAAQ,CAOnB,MAAO,SAAepR,EAAG,CACvB,OAAO2/C,GAAOr6B,EAAOtlB,CAAC,CAAC,CACxB,EACD,0BAA2B,SAA8BA,EAAGo5C,EAAM,CAChE,OAAOuG,GAAOr6B,EAAOtlB,CAAC,EAAG,CACvB,UAAWo5C,CACnB,CAAO,CACF,EACD,gBAAgBp5C,EAAG4/C,EAAM,CACvB,OAAOD,GAAOr6B,EAAOtlB,CAAC,EAAG4/C,CAAI,CAC9B,EACD,OAAQ,SAAgBtH,EAAK,CAC3B,OAAOqH,GAAOrH,EAAK,CACjB,UAAW,EACnB,CAAO,CACF,EACD,2BAA4B,SAA+BA,EAAKc,EAAM,CACpE,OAAOuG,GAAOrH,EAAK,CACjB,UAAWc,EACX,UAAW,EACnB,CAAO,CACF,EACD,iBAAkB,SAAsBd,EAAKsH,EAAM,CACjD,IAAIC,EAAU,CACZ,UAAW,EACZ,EACD,OAAAlzC,GAASkzC,EAASD,CAAI,EACfD,GAAOrH,EAAKuH,CAAO,CAChC,CACA,CAAG,EACD,SAASF,GAAOrH,EAAK,CACnB,IAAIwH,EACAF,EAAO,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,CAAE,EAC7E3C,EAAiB,iBAAkB2C,EAAOA,EAAK,aAAe,GAC9DxG,GAAQ0G,EAAkBF,EAAK,aAAe,MAAQE,IAAoB,OAASA,EAAkBtvC,EAAO,QAC5G8kB,GAASyqB,GAAwBzH,EAAKc,EAAM6D,CAAc,EAC9D,OAAI2C,EAAK,YACPtqB,GAAO,OAAShQ,EAAOgQ,GAAO,MAAM,EAChC2nB,IACF3nB,GAAO,aAAeA,GAAO,aAAa,IAAIiI,GAAS,CACrD,GAAI,CACF,MAAAj+B,GACA,OAAA0sC,EACZ,EAAczO,EACJ,MAAO,CACL,MAAAj+B,GACA,OAAQgmB,EAAO0mB,EAAM,CACtB,CACX,CAAS,IAGDiR,GACF,OAAO,eAAe3nB,GAAQ,UAAW,CACvC,WAAY,GAGZ,IAAK,IAAM,CACT,MAAM,IAAI,MAAM,oDAAoD,CAC9E,CACA,CAAO,EAEIA,EACX,CACE,SAASyqB,GAAwBzH,EAAKc,EAAM6D,EAAgB,CAC1D,IAAIz+B,EAAM85B,EAAI,UAEVpV,EAAQoV,EAAI,KAAM,EACtB,GAAIpV,EAAM,SAAW,GAAKA,EAAM,CAAC,IAAMA,EAAM,CAAC,EAC5C,MAAM,IAAI,WAAW,gCAAgC,OAAOviB,GAAOuiB,CAAK,EAAG,GAAG,CAAC,EAEjF,IAAItP,GAAIsP,EAAM,CAAC,EACf,GAAI8c,EAAOxhC,EAAKoV,GAAGwlB,CAAI,IACrB6G,EAAWzhC,EAAKoV,EAAC,EAEbssB,EAAY1hC,EAAKoV,GAAGwlB,CAAI,GAAG,CAC7B,IAAI+G,EAAQC,GAAY9H,EAAK95B,EAAKoV,EAAC,EACnC,OAAO6rB,EAAgBjhC,EAAKoV,GAAGwlB,EAAM+G,EAAOlD,CAAc,CAClE,CAEI,IAAI34C,GAAO87C,GAAY9H,EAAK95B,EAAKoV,EAAC,EAClC,OAAO8rB,EAAclhC,EAAKoV,GAAGwlB,EAAM90C,GAAM24C,CAAc,CAC3D,CAGE,SAASiD,EAAY1hC,EAAKoV,EAAGwlB,EAAM,CACjC,QAASh5C,EAAI,EAAGA,EAAIwzB,EAAGxzB,IACrB,QAASknB,EAAIlnB,EAAGknB,EAAIsM,EAAGtM,IAErB,GAAI0lB,EAAOH,EAAU7d,EAAIzC,EAAS/N,EAAIpe,CAAC,EAAEknB,CAAC,EAAG9I,EAAI8I,CAAC,EAAElnB,CAAC,CAAC,CAAC,CAAC,EAAGg5C,CAAI,EAC7D,MAAO,GAIb,MAAO,EACX,CAGE,SAAS4G,EAAOxhC,EAAKoV,EAAGwlB,EAAM,CAC5B,QAASh5C,EAAI,EAAGA,EAAIwzB,EAAGxzB,IACrB,QAASknB,EAAI,EAAGA,EAAIsM,EAAGtM,IAErB,GAAI0lB,EAAOH,EAAU7d,EAAIkD,EAAG1T,EAAIpe,CAAC,EAAEknB,CAAC,CAAC,CAAC,CAAC,EAAG8xB,CAAI,EAC5C,MAAO,GAIb,MAAO,EACX,CACE,SAAS6G,EAAWzhC,EAAKoV,EAAG,CAC1B,QAASxzB,EAAI,EAAGA,EAAIwzB,EAAGxzB,IACrB,QAASknB,EAAI,EAAGA,EAAIsM,EAAGtM,IACrB9I,EAAIpe,CAAC,EAAEknB,CAAC,EAAI2K,EAAGzT,EAAIpe,CAAC,EAAEknB,CAAC,CAAC,CAGhC,CAGE,SAAS84B,GAAY9H,EAAK95B,EAAKoV,EAAG,CAEhC,IAAItvB,EAAOg0C,EAAI,SAAU,EACzB,GAAIh0C,IAAS,UAAYA,IAAS,aAAeA,IAAS,UACxD,OAAOA,EAKT,QAHI+7C,EAAY,GACZC,GAAS,GACTC,EAAa,GACRngD,GAAI,EAAGA,GAAIwzB,EAAGxzB,KACrB,QAASknB,GAAI,EAAGA,GAAIsM,EAAGtM,KAAK,CAC1B,IAAIpoB,GAAKsf,EAAIpe,EAAC,EAAEknB,EAAC,EACjB,GAAIta,GAAS9N,EAAE,GAAKiO,GAAWjO,EAAE,EAC/BmhD,EAAY,WACHpzC,GAAY/N,EAAE,EACvBohD,GAAS,WACApzC,GAAUhO,EAAE,EACrBqhD,EAAa,OAEb,OAAM,UAAU,+BAAiChxC,GAAOrQ,EAAE,CAAC,CAErE,CAKI,GAHIohD,IAAUC,GACZ,QAAQ,KAAK,wEAAwE,EAEnFA,EAAY,CACd,QAAShnB,GAAK,EAAGA,GAAK3F,EAAG2F,KACvB,QAASoG,GAAK,EAAGA,GAAK/L,EAAG+L,KACvBnhB,EAAI+a,EAAE,EAAEoG,EAAE,EAAImK,EAAQtrB,EAAI+a,EAAE,EAAEoG,EAAE,CAAC,EAGrC,MAAO,SACb,CACI,GAAI2gB,GAAQ,CACV,QAAS7gB,GAAM,EAAGA,GAAM7L,EAAG6L,KACzB,QAASoS,GAAM,EAAGA,GAAMje,EAAGie,KACzBrzB,EAAIihB,EAAG,EAAEoS,EAAG,EAAIhF,EAAUruB,EAAIihB,EAAG,EAAEoS,EAAG,CAAC,EAG3C,MAAO,WACb,CACI,GAAIwO,EAAW,CACb,QAAS3gB,GAAM,EAAGA,GAAM9L,EAAG8L,KACzB,QAASgS,GAAM,EAAGA,GAAM9d,EAAG8d,KACzBlzB,EAAIkhB,EAAG,EAAEgS,EAAG,EAAIlQ,EAAOhjB,EAAIkhB,EAAG,EAAEgS,EAAG,CAAC,EAGxC,MAAO,QACb,KACM,OAAM,UAAU,yCAAyC,CAE/D,CACA,CAAC,EC/TU9sB,GAA2BwM,GAAqB,CACzD5gB,SACF,CAAC,EACUqU,GAAyB8N,GAAmB,EAAE,EAU9C5N,GAA0B6P,GAAoB,EAAE,EAgBhDE,GAAwBD,GAAkB,EAAE,EA0B5C/P,GAA6BsV,GAAuB,CAC7D,OAAAtF,EACF,CAAC,EAkBU1jB,GAAuBsT,GAAY,CAC5C,UAAAE,GACA,QAAAC,GACA,YAAAC,GACA,SAAAC,EACF,CAAC,EAUUiK,GAAqB0T,GAAU,CACxC,MAAAtxB,EACF,CAAC,EAgBU81B,GAA2BvE,GAAgB,CACpD,MAAAvxB,EACF,CAAC,EAaUke,GAAsBmkB,GAAW,CAC1C,MAAAriC,EACF,CAAC,EAMUy7B,GAA2BhL,GAAgB,CACpD,UAAAjd,GACA,MAAAxT,EACF,CAAC,EAaU04B,GAAyB9H,GAAc,CAChD,QAAAnd,GACA,MAAAzT,EACF,CAAC,EACUk9B,GAAsBzD,GAAW,CAC1C,MAAAz5B,EACF,CAAC,EACU0e,GAAqB6jB,GAAU,CACxC,MAAAviC,EACF,CAAC,EAYUqsB,GAA6BL,GAAkB,CAC1D,OAAE5sB,GACA,MAAAY,EACF,CAAC,EAoBUyhC,GAAmC1G,GAAwB,CACpE,MAAA/6B,EACF,CAAC,EAKU8gB,GAAoB4Y,GAAS,CACtC,MAAA15B,EACF,CAAC,EACU+O,GAA2Bic,GAAgB,CACpD,MAAAhrB,EACF,CAAC,EAIU87B,GAA4BlQ,GAAiB,CACtD,MAAA5rB,EACF,CAAC,EACUulC,GAAwB1Z,GAAa,CAC9C,MAAA7rB,EACF,CAAC,EAsBU+1B,GAAgCH,GAAqB,CAC9D,MAAA51B,EACF,CAAC,EAIUowB,GAAwBD,GAAa,CAC9C,MAAAnwB,EACF,CAAC,EAgBU6gB,GAAoB8Y,GAAS,CACtC,MAAA35B,EACF,CAAC,EAKUgP,GAAsBwpB,GAAW,CAC1C,UAAAhlB,GACA,SAAAG,GACA,QAAA+kB,GACA,MAAA14B,EACF,CAAC,EACUyf,GAAqBgjB,GAAU,CACxC,MAAAziC,EACF,CAAC,EACUssB,GAA8BF,GAAwB,CAC/D,OAAA1I,GACA,YAAA2I,GACA,MAAArsB,EACF,CAAC,EAUU+4B,GAAgCvH,GAAqB,CAC9D,MAAAxxB,EACF,CAAC,EA6DU2f,GAAsBiZ,GAAW,CAC1C,QAAAnlB,GACF,OAAErU,GACA,MAAAY,EACF,CAAC,EAIUg5B,GAA4B3H,GAAiB,CACtD,MAAArxB,EACF,CAAC,EAWUy9B,GAA0B5M,GAAe,CAClD,SAAAld,GACA,MAAA3T,EACF,CAAC,EAIUkU,GAAwB4c,GAAa,CAC9C,YAAApd,GACA,OAAAgQ,GACA,aAAA4I,GACA,MAAAtsB,EACF,CAAC,EAWUg+B,GAAyBT,GAAc,CAChD,UAAA9B,GACA,SAAAgC,GACA,OAAArN,EACF,CAAC,EAOUtK,GAAyByW,GAAc,CAChD,UAAAxtB,GACA,OAAAmF,GACA,MAAAlU,EACF,CAAC,EACU9H,GAAsBukC,GAAW,CAC1C,OAAAvoB,GACF,OAAE9U,GACA,MAAAY,EACF,CAAC,EAKUi9B,GAA2BP,GAAgB,CACpD,OAAAxoB,GACA,MAAAlU,EACF,CAAC,EAOUsQ,GAAuB6sB,GAAY,CAC5C,UAAA3pB,GACF,OAAEpU,GACA,OAAA8U,GACA,MAAAlU,EACF,CAAC,EAgBU2nB,GAAwBiS,GAAa,CAC9C,UAAA7qB,GACA,OAAAmF,GACA,MAAAlU,EACF,CAAC,EAMU6iC,GAA4B7F,GAAiB,CACtD,KAAAE,GACA,UAAAD,GACA,MAAAj9B,EACF,CAAC,EACU0nC,GAAsBpN,GAAW,CAC1C,YAAA5mB,GACA,aAAA4Y,GACA,OAAApY,GACA,MAAAlU,EACF,CAAC,EACUg/B,GAA8BjB,GAAmB,CAC1D,QAAAC,GACA,MAAAh+B,EACF,CAAC,EASUwlC,GAAuB7E,GAAY,CAC5C,YAAAjtB,GACA,OAAAiU,GACA,YAAA0E,GACA,OAAAnY,GACA,MAAAlU,EACF,CAAC,EACUimB,GAAyB4U,GAAc,CAChD,OAAA3mB,GACA,MAAAlU,EACF,CAAC,EAKUk+B,GAA0BlD,GAAe,CAClD,UAAAxnB,GACA,YAAAE,GACA,aAAA4Y,GACF,OAAEltB,GACA,OAAA8U,GACA,MAAAlU,EACF,CAAC,EAMU67B,GAA0BuF,GAAe,CAClD,YAAA1tB,GACA,OAAAiU,GACF,OAAEvoB,GACA,OAAA8U,GACA,MAAAlU,EACF,CAAC,EAkBU8nC,GAAmC9W,GAAwB,CACpE,QAAA/K,GACA,OAAA/R,GACA,KAAAhc,GACA,MAAA8H,EACF,CAAC,EAcU2nC,GAAoBrC,GAAS,CACtC,UAAAxP,GACA,QAAA4C,GACA,KAAAwE,GACA,aAAA8B,GACA,MAAAwG,GACA,SAAAtH,GACA,OAAAqH,GACA,OAAArxB,GACA,eAAA6hB,GACA,KAAA/mB,GACA,KAAA2Q,GACA,eAAAoZ,GACA,MAAA/4B,GACA,WAAAg5B,GACA,MAAA1oB,EACF,CAAC,EAsBUorB,GAAyBoF,GAAc,CAChD,YAAAptB,GACA,OAAAiU,GACF,OAAEvoB,GACA,OAAA8U,GACA,MAAAlU,EACF,CAAC,EACUmb,GAA0B2d,GAAe,CAClD,YAAAplB,GACA,OAAAiU,GACA,YAAA0E,GACA,OAAAnY,GACA,eAAA6kB,GACA,MAAA/4B,GACA,WAAAg5B,EACF,CAAC,EAcU4O,GAAwB7I,GAAa,CAC9C,YAAArrB,GACA,aAAAsrB,GACA,YAAA3S,GACA,OAAAnY,GACA,eAAA6hB,GACA,eAAAgD,GACA,MAAA/4B,EACF,CAAC,EAOU+d,GAAqB2kB,GAAU,CACxC,YAAAhvB,GACA,aAAA4Y,GACA,UAAAwJ,GACA,OAAAnO,GACA,YAAA0E,GACA,OAAAnY,GACA,MAAAlU,EACF,CAAC,EA6EUoQ,GAAqBg0B,GAAU,CACxC,UAAAtO,GACA,KAAAoH,GACA,eAAAnH,GACA,KAAA79B,GACA,MAAA8H,EACF,CAAC,EAoCUuhC,GAAsCD,GAAgC,CAC/E,YAAA5tB,GACA,QAAAgoB,EACF,CAAC,EACUxB,GAAuBsH,GAAiB,CACjD,qBAAAD,GACA,kBAAAE,EACF,CAAC,EACU7F,GAAwBsF,GAAa,CAC9C,YAAAxtB,GACA,OAAAiU,GACF,OAAEvoB,GACA,OAAA8U,GACA,MAAAlU,EACF,CAAC,EAsCUm+B,GAA0BtI,GAAe,CAClD,UAAAC,GACA,IAAA1lB,GACA,YAAAic,GACA,OAAAnY,GACA,eAAA6hB,GACA,MAAA/1B,EACF,CAAC,EAyDU6nC,GAA2BhI,GAAgB,CACpD,YAAAnsB,GACA,aAAAsrB,GACA,YAAA3S,GACA,OAAAnY,GACA,eAAA6hB,GACA,eAAAgD,GACA,MAAA/4B,EACF,CAAC,EAoCU+mC,GAAqBT,GAAU,CACxC,aAAAtH,GACA,OAAAuG,GACA,OAAArxB,GACA,SAAAiqB,GACA,eAAApF,GACA,MAAA/4B,GACA,WAAAg5B,EACF,CAAC,EAuGU2C,GAA2BqF,GAAgB,CACpD,YAAAttB,GACA,OAAAiU,GACF,OAAEvoB,GACA,OAAA8U,GACA,MAAAlU,EACF,CAAC,EAeU1I,GAAuBC,GAAY,CAC5C,UAAAkkC,GACA,OAAAvnB,GACA,IAAA6J,GACF,OAAE3e,GACA,WAAA08B,GACA,OAAAF,GACA,SAAAC,GACA,QAAAH,GACA,UAAAC,GACA,MAAA37B,EACF,CAAC,EAmCUo6B,GAAwBH,GAAa,CAC9C,MAAAC,GACA,OAAAhmB,GACA,MAAA5c,GACA,MAAA0I,EACF,CAAC,EACUo+B,GAAqB4I,GAAU,CACxC,IAAAppB,GACA,UAAAkY,GACA,IAAAiR,GACA,aAAA/H,GACA,SAAAd,GACA,OAAAhqB,GACA,SAAAiqB,GACA,MAAAn+B,GACA,WAAAg5B,EACF,CAAC,EA8BUnc,GAAqBohB,GAAU,CACxC,QAAAxqB,GACF,OAAErU,GACA,SAAAq+B,GACA,SAAAS,GACA,IAAAE,GACA,OAAAlqB,GACA,SAAAiqB,GACA,OAAA/N,GACA,MAAApwB,EACF,CAAC,EA0YU8iC,GAAsBsL,GAAW,CAC1C,IAAAxwB,GACA,IAAAG,GACA,UAAA+X,GACA,KAAA5X,GACA,UAAAud,GACA,OAAArB,GACA,QAAA1B,GACF,OAAEt5B,GACA,IAAAsf,GACA,KAAAgpB,GACA,aAAA1I,GACA,IAAA5uB,GACA,MAAAo1B,GACA,QAAAvf,GACA,GAAAnF,GACA,IAAAsd,GACA,OAAAxC,GACA,OAAA1nB,GACA,kBAAA4zB,GACA,SAAA3J,GACA,eAAApI,GACA,OAAA3F,GACA,GAAAuX,GACA,GAAA9mB,GACA,QAAAiF,GACA,IAAArG,GACA,KAAAvnB,GACA,QAAAwjC,GACA,KAAA/b,GACA,SAAAxE,GACA,MAAAnb,GACA,OAAA4nC,GACA,UAAAC,EACF,CAAC,EA2HU0D,GAAsB3I,GAAW,CAC1C,IAAAhlB,GACA,IAAAG,GACA,KAAAmf,GACA,WAAA2F,GACA,KAAAC,GACA,YAAAzW,GACA,OAAAuP,GACA,OAAA1nB,GACA,SAAAiqB,GACA,IAAAthB,GACA,QAAA6e,GACA,KAAA/b,GACA,MAAA3f,EACF,CAAC,ECjsDI,MAACovC,GAAe,CACnB,WAAY,CAAC3wC,EAAGC,IAAMD,EAAE,IAAI,CAAC7P,EAAG,IAAM6P,EAAE,CAAC,EAAIC,EAAE,CAAC,CAAC,EAAE,OAAO,CAACmY,EAAGrb,IAAMqb,EAAIrb,CAAC,EACzE,UAAYiD,GAAMA,EAAE,CAAC,EAAE,IAAI,CAAC7P,EAAGI,IAAMyP,EAAE,IAAI8S,GAAKA,EAAEviB,CAAC,CAAC,CAAC,EAErD,UAAUyP,EAAEC,EAAG,CACb,OAAOD,EAAE,IAAI7P,GAAK,KAAK,UAAU8P,CAAC,EAAE,IAAI6S,GAAK,KAAK,WAAW3iB,EAAG2iB,CAAC,CAAC,CAAC,CACpE,EACD,kBAAkB9S,EAAGC,EAAG,CACtB,OAAO,KAAK,MAAM,GAAG,OAAO,KAAKD,CAAC,EAAE,IAAIuX,GAAKtX,EAAEsX,CAAC,EAAIvX,EAAEuX,CAAC,CAAC,CAAC,CAC1D,EAED,iBAAiBq5B,EAAYC,EAAY,CACvC,IAAIC,EAAan/B,GAAIi/B,EAAYC,CAAU,EACvCE,EAAQjE,GAAK8D,CAAU,EACvBI,EAAQlE,GAAK+D,CAAU,EAC3B,OAAOC,GAAcC,EAAQC,EAC9B,EASD,MAAMrf,EAAQt/B,EAAKC,EAAK,CACtB,OAAO,KAAK,IAAID,EAAK,KAAK,IAAIs/B,EAAQr/B,CAAG,CAAC,CAC3C,CAEH,ECxBM2+C,GAAsB,iBAEtBC,GAAoB,CACxB,CACE,KAAM,cACN,KAAMD,GACN,UAAW,IAAGE,GAAA,IAAC,OAAO,+BAAiC,EAAC,uGACzD,CACH,EAEMC,GAA4BC,GAAW,CAC3CA,EAAO,WAAW,CAACthC,EAAIuhC,EAAM3oB,IAAS,OACpC,GAAG5Y,EAAG,OAASkhC,GAAqB,OAAOtoB,EAAI,EAE/C,IAAG74B,EAAAyhD,GAAM,QAAQ,cAAd,MAAAzhD,EAA2B,iBAAkB,CAC9C0hD,GAAqB7oB,EAAM5Y,CAAE,EAC7B,MACN,CAEIwhC,GAAM,SAAS,kBAAkB,EAC9B,KAAM,IAAMC,GAAqB7oB,EAAM5Y,CAAE,CAAC,CAC9C,EACH,EAEM0hC,GAA6B,IAAM,OACvC,QAAO3hD,EAAAyhD,GAAM,QAAQ,cAAd,YAAAzhD,EAA2B,oBAAqB,UACzD,EAEM0hD,GAAuB,CAAC7oB,EAAM+oB,EAAa,OACxCD,GAA4B,EACjC9oB,EAAK,CAAE,KAAMsoB,GAAqB,MAAO,CAAE,SAAUS,EAAW,IAAI,EAAI,EACxE/oB,EAAI,ECnCOgpB,GAAA,CACb,SAAU/iD,GAAA,GACLgjD,GAAW,CAAC,aAAa,CAAC,GAE/B,QAAS,CACP,WAAWz6C,EAAM,CACf,IAAI06C,EAAU,KAAK,YAAY,cAAc,KAAKA,GAAWA,EAAQ,MAAQ16C,CAAI,EACjF,OAAA06C,EAAQ,YAAc,KAAK,GAAG,kCAAoC16C,CAAI,EACtE06C,EAAQ,MAAQ,KAAK,GAAG,4BAA8B16C,CAAI,EACnD06C,CACR,CACF,CACH,ECOAh1C,GAAA,CACA,gBACA,OACA,OACA,YACA,UACA,EACA,UACA,mBACA,YACA,EACA,UACA,aACA,UACA,CACA,CACA,mZCRAA,GAAA,CACA,iBACA,qBAAAi1C,EAAA,EACA,OACA,OACA,aACA,UACA,EACA,eACA,aACA,UACA,EACA,OACA,YACA,UACA,EACA,aACA,YACA,YACA,EACA,OACA,aACA,UACA,CACA,EACA,UACA,WACA,MACA,iBACA,EACA,IAAAriD,EAAA,CACA,mBAAAA,CAAA,CACA,CACA,CACA,CACA,khBClCAoN,GAAA,CACA,wBACA,sBAAAk1C,EAAA,EACA,OACA,MACA,YACA,WACA,EACA,iBACA,aACA,UACA,EACA,uBACA,aACA,UACA,CACA,EACA,QAAAJ,EAAA,EACA,sBACA,WACA,eACA,GACA,SACA,aACA,IAAAK,EAAApjD,GAAA,cACAojD,EAAA,gCACA,yBAAAA,CAAA,CACA,EACA,cAAAC,EAAA,CACAC,GAAA,gBACAA,GAAA,qFAAAD,EAAA,GACAC,GAAA,gEACA,CACA,EACA,UACA,yBACA,MAAAC,EAAA,wBACA,sCAAAC,KAAA,MAAAD,CAAA,MAAA78B,GAAA,gBAAAA,EAAA,MACA,CACA,EACA,UACA,MAAA+8B,EAAA,2BAAA/8B,GAAA,GAAAA,KAAA,gBACA,qDAAA+8B,CAAA,CACA,CACA,4xBCxEO,SAASC,GAAeC,EAAa,CAC1C,MAAMhB,EAAQiB,GAAQ,EAEhBC,EAAsBC,GAAS,IAC5BnB,EAAM,QAAQ,mCAAmCgB,GAAA,YAAAA,EAAa,EAAE,CACxE,EAEKI,EAAoBD,GAAS,IAAM,OACvC,OAAOnB,EAAM,QAAQ,mBAAkBzhD,EAAA2iD,EAAoB,QAApB,YAAA3iD,EAA2B,qBAAqB,CACxF,GAEK8iD,EAASF,GAAS,IACfnB,EAAM,QAAQ,QAAQ,KAAKltC,GAAKA,EAAE,KAAOkuC,EAAY,SAAS,CACtE,EAED,SAASM,GAAS,CAChB,OAAOlkD,GAAAC,GAAA,GACF2jD,GADE,CAEL,kBAAmBI,EAAkB,MACrC,oBAAqBF,EAAoB,KAC/C,EACA,CAEE,MAAO,CACL,OAAAI,EACA,oBAAAJ,EACA,kBAAAE,EACA,OAAAC,CACJ,CACA,CCmCA,MAAA/1C,GAAA,CACA,2BACA,6BAAAi2C,EAAA,EACA,OACA,WACA,EACA,QAAAnB,EAAA,EACA,OACA,OACA,WACA,eACA,CACA,EACA,QAAAhjD,GAAAC,GAAA,GACAmkD,GAAA,6CADA,CAEA,iBACA,4BACA,EACA,SAAAf,EAAA,CACA,uBAAAA,CAAA,OACA,qFACA,CACA,CACA,GACA,SAAArjD,GAAAC,GAAA,GACAgjD,GAAA,0BADA,CAEA,eACA,oCAAAW,UAAA,OAAAziD,EAAAwiD,GAAAC,CAAA,6BAAAziD,EAAA,MACA,CACA,EACA,q6BCIA+M,GAAA,CACA,2BACA,eACA,OACA,OACA,sBACA,SACA,gBACA,oBACA,OACA,SAAApN,GAAA,EAAAA,GAAA,YACA,2DAAAK,EAAA,qDAAAA,EAAA,8CACA,wHACA,CACA,CACA,EACA,QAAAnB,GAAAC,GAAA,GACAmkD,GAAA,6CADA,CAEA,gBACA,2BACA,EACA,kBACA,4BACA,yFAEA,EACA,gBACA,sFACA,wBACA,EACA,cACA,kFACA,CACA,EACA,wnEC1EAl2C,GAAA,CACA,wBACA,OACA,gCACA,aACA,UACA,CACA,EACA,QACA,wBAAAm2C,CAAA,EAAAC,GAAA,EACA,OACA,kBAAAD,CACA,CACA,EACA,OACA,OACA,YACA,QACA,kBACA,cACA,WACA,CACA,CACA,EACA,SAAApkD,GAAA,GACAgjD,GAAA,uBAEA,SACA,eACA,wBACA,CACA,CACA,isCCxDA/0C,GAAA,CACA,mBACA,4BAAAq2C,GAAA,gBAAAC,GAAA,iBAAAC,EAAA,EACA,SAAAxkD,GAAA,GACAgjD,GAAA,kBAEA,OACA,OACA,aACA,WACA,CACA,EACA,SACA,iBACA,iBACA,EACA,aACA,iBACA,EACA,gBACA,gBACA,iBACA,EACA,WACA,cAAAhjD,GAAA,oBACA,CACA,EACA,OACA,aACA,QAAAojD,EAAA,CACA,gBACA,CAAAA,EAAA,IACA,kBACA,4DACA,EACA,YACA,CACA,CACA,ilBCzEMqB,GAAqB,CACzB,CACE,KAAM,WACN,KAAM,cACN,UAAWC,EACZ,CACH,qFCRC,SAAS9hD,EAAEwL,EAAE,CAAmD6lB,EAAe,QAAA7lB,EAA6H,IAAEu2C,GAAK,UAAU,CAAC,OAAO,SAAS/hD,EAAE,CAAC,SAASwL,EAAEzM,EAAE,CAAC,GAAG,EAAEA,CAAC,EAAE,OAAO,EAAEA,CAAC,EAAE,QAAQ,IAAI0M,EAAE,EAAE1M,CAAC,EAAE,CAAC,EAAEA,EAAE,EAAE,GAAG,QAAQ,EAAE,EAAE,OAAOiB,EAAEjB,CAAC,EAAE,KAAK0M,EAAE,QAAQA,EAAEA,EAAE,QAAQD,CAAC,EAAEC,EAAE,EAAE,GAAGA,EAAE,OAAO,CAAC,IAAI,EAAE,GAAG,OAAOD,EAAE,EAAExL,EAAEwL,EAAE,EAAE,EAAEA,EAAE,EAAE,SAASxL,EAAE,CAAC,OAAOA,CAAC,EAAEwL,EAAE,EAAE,SAASxL,EAAEuL,EAAExM,EAAE,CAACyM,EAAE,EAAExL,EAAEuL,CAAC,GAAG,OAAO,eAAevL,EAAEuL,EAAE,CAAC,aAAa,GAAG,WAAW,GAAG,IAAIxM,CAAC,CAAC,CAAC,EAAEyM,EAAE,EAAE,SAASxL,EAAE,CAAC,IAAIuL,EAAEvL,GAAGA,EAAE,WAAW,UAAU,CAAC,OAAOA,EAAE,OAAO,EAAE,UAAU,CAAC,OAAOA,CAAC,EAAE,OAAOwL,EAAE,EAAED,EAAE,IAAIA,CAAC,EAAEA,CAAC,EAAEC,EAAE,EAAE,SAASxL,EAAEwL,EAAE,CAAC,OAAO,OAAO,UAAU,eAAe,KAAKxL,EAAEwL,CAAC,CAAC,EAAEA,EAAE,EAAE,GAAGA,EAAEA,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,SAASxL,EAAEwL,EAAE,EAAE,CAAc,SAASzM,GAAG,CAAC,IAAIiB,EAAE,GAAGwL,EAAE,GAAGD,EAAE,EAAEE,EAAE,UAAU,OAAO,IAAyB,OAAO,UAAU,SAAS,KAAK,UAAU,CAAC,CAAC,IAAhE,qBAAoED,EAAE,UAAU,CAAC,EAAED,KAAKA,EAAEE,EAAEF,IAAI,CAAC,IAAIk/B,EAAE,UAAUl/B,CAAC,GAAG,SAASA,EAAE,CAAC,QAAQE,KAAKF,EAAE,OAAO,UAAU,eAAe,KAAKA,EAAEE,CAAC,IAAID,GAAuB,OAAO,UAAU,SAAS,KAAKD,EAAEE,CAAC,CAAC,IAAvD,kBAAyDzL,EAAEyL,CAAC,EAAE1M,EAAE,GAAGiB,EAAEyL,CAAC,EAAEF,EAAEE,CAAC,CAAC,EAAEzL,EAAEyL,CAAC,EAAEF,EAAEE,CAAC,EAAE,GAAEg/B,CAAC,CAAC,CAAC,OAAOzqC,CAAC,CAACwL,EAAE,EAAEzM,CAAC,EAAE,SAASiB,EAAEwL,EAAE,EAAE,UAAU,CAAc,IAAIA,EAAe,OAAO,QAApB,aAAqC,OAAO,WAAhB,OAAyB,OAAO,SAAS,GAAGD,EAAWvL,IAAT,QAAYA,EAAE,QAAQjB,EAAE,UAAU,CAAC,QAAQiB,EAAEuL,EAAE,CAAC,CAAC,oBAAoB,iBAAiB,oBAAoB,oBAAoB,mBAAmB,iBAAiB,EAAE,CAAC,0BAA0B,uBAAuB,0BAA0B,0BAA0B,yBAAyB,uBAAuB,EAAE,CAAC,0BAA0B,yBAAyB,iCAAiC,yBAAyB,yBAAyB,uBAAuB,EAAE,CAAC,uBAAuB,sBAAsB,uBAAuB,uBAAuB,sBAAsB,oBAAoB,EAAE,CAAC,sBAAsB,mBAAmB,sBAAsB,sBAAsB,qBAAqB,mBAAmB,CAAC,EAAExM,EAAE,EAAE0M,EAAEF,EAAE,OAAOk/B,EAAE,CAAE,EAAC1rC,EAAE0M,EAAE1M,IAAI,IAAIiB,EAAEuL,EAAExM,CAAC,IAAIiB,EAAE,CAAC,IAAIwL,EAAE,CAAC,IAAIzM,EAAE,EAAEA,EAAEiB,EAAE,OAAOjB,IAAI0rC,EAAEl/B,EAAE,CAAC,EAAExM,CAAC,CAAC,EAAEiB,EAAEjB,CAAC,EAAE,OAAO0rC,CAAC,CAAC,MAAM,EAAE,EAAG,EAACh/B,EAAE,CAAC,OAAO1M,EAAE,iBAAiB,MAAMA,EAAE,eAAe,EAAE0rC,EAAE,CAAC,QAAQ,SAASzqC,EAAEuL,EAAE,CAAC,OAAO,IAAI,QAAQ,SAASE,EAAE,EAAE,CAAC,IAAIoH,EAAE,UAAU,CAAC,KAAK,IAAI,SAASA,CAAC,EAAEpH,EAAC,CAAE,EAAE,KAAK,IAAI,EAAE,KAAK,GAAG,SAASoH,CAAC,EAAE7S,EAAEA,GAAGwL,EAAE,gBAAgB,IAAIw2C,EAAEhiD,EAAEjB,EAAE,iBAAiB,EAAEwM,CAAC,EAAEy2C,aAAa,SAASA,EAAE,KAAKnvC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,KAAK,UAAU,CAAC,OAAO,IAAI,QAAQ,SAAS7S,EAAEuL,EAAE,CAAC,GAAG,CAAC,KAAK,aAAa,OAAO,KAAKvL,EAAG,EAAC,IAAIyL,EAAE,UAAU,CAAC,KAAK,IAAI,SAASA,CAAC,EAAEzL,GAAG,EAAE,KAAK,IAAI,EAAE,KAAK,GAAG,SAASyL,CAAC,EAAE,IAAI,EAAED,EAAEzM,EAAE,cAAc,EAAC,EAAG,aAAa,SAAS,EAAE,KAAK0M,CAAC,EAAE,MAAMF,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,OAAO,SAASvL,EAAEwL,EAAE,CAAC,OAAO,KAAK,aAAa,KAAK,KAAM,EAAC,KAAK,QAAQxL,EAAEwL,CAAC,CAAC,EAAE,SAAS,SAASxL,EAAE,CAAC,KAAK,GAAG,SAASA,CAAC,CAAC,EAAE,QAAQ,SAASA,EAAE,CAAC,KAAK,GAAG,QAAQA,CAAC,CAAC,EAAE,GAAG,SAASA,EAAEuL,EAAE,CAAC,IAAIxM,EAAE0M,EAAEzL,CAAC,EAAEjB,GAAGyM,EAAE,iBAAiBzM,EAAEwM,EAAE,EAAE,CAAC,EAAE,IAAI,SAASvL,EAAEuL,EAAE,CAAC,IAAIxM,EAAE0M,EAAEzL,CAAC,EAAEjB,GAAGyM,EAAE,oBAAoBzM,EAAEwM,EAAE,EAAE,CAAC,EAAE,IAAIxM,CAAC,EAAE,GAAG,CAACA,EAAE,OAAO,KAAKwM,EAAEvL,EAAE,QAAQ,CAAC,UAAU,EAAE,EAAE,OAAO,WAAW,CAAC,UAAU,EAAE,GAAG,OAAO,iBAAiByqC,EAAE,CAAC,aAAa,CAAC,IAAI,UAAU,CAAC,MAAO,EAAQj/B,EAAEzM,EAAE,iBAAiB,CAAE,CAAC,EAAE,QAAQ,CAAC,WAAW,GAAG,IAAI,UAAU,CAAC,OAAOyM,EAAEzM,EAAE,iBAAiB,CAAC,CAAC,EAAE,UAAU,CAAC,WAAW,GAAG,IAAI,UAAU,CAAC,MAAO,EAAQyM,EAAEzM,EAAE,iBAAiB,CAAE,CAAC,CAAC,CAAC,EAAEwM,EAAEvL,EAAE,QAAQyqC,EAAE,OAAO,WAAWA,CAAC,GAAC,CAAE,EAAE,SAASzqC,EAAEwL,EAAE,EAAE,CAAc,SAASzM,EAAEiB,EAAEwL,EAAE,CAACxL,EAAE,MAAM,SAASwL,EAAE,SAASxL,EAAE,MAAM,KAAKwL,EAAE,KAAKxL,EAAE,MAAM,IAAIwL,EAAE,IAAIxL,EAAE,MAAM,MAAMwL,EAAE,MAAMxL,EAAE,MAAM,OAAOwL,EAAE,MAAM,CAAC,SAASC,EAAEzL,EAAE,CAAC,IAAIwL,EAAExL,EAAE,QAAQwL,IAAIA,EAAE,UAAU,OAAOxL,EAAE,QAAQ,eAAe,GAAGA,EAAE,QAAQ,UAAUA,EAAE,QAAQ,YAAYA,EAAE,QAAQ,UAAUwO,IAAIA,EAAE,aAAahD,EAAEgiB,CAAC,EAAEhf,EAAE,YAAYgf,CAAC,GAAGhiB,EAAE,cAAczM,EAAEyM,EAAEA,EAAE,YAAY,GAAG,CAAC,IAAIi/B,EAAE,EAAE,CAAC,EAAE53B,EAAE,EAAE,EAAE43B,CAAC,EAAEuX,EAAE,EAAE,CAAC,EAAEjrC,EAAE,CAAC,SAAS,UAAU,GAAG,gBAAgB,aAAa,SAAS,GAAG,SAAS,EAAE,EAAEyW,EAAE,OAAOhf,EAAE,OAAOsV,EAAE,CAAC,QAAQ,KAAK,QAAQ,KAAK,aAAa,GAAG,UAAUjR,EAAE,EAAE,UAAU,OAAO,SAAS7S,EAAEwL,EAAED,EAAE,CAAC,OAAgBA,IAAT,OAAW,KAAK,aAAa,KAAK,KAAM,EAAC,KAAK,QAAQvL,EAAEwL,CAAC,EAAED,EAAE,KAAK,QAAQvL,EAAEwL,CAAC,EAAE,KAAK,KAAI,CAAE,EAAE,QAAQ,SAASxL,EAAEwL,EAAE,CAAC,IAAIi/B,EAAE,KAAK,GAAG,KAAK,aAAa,OAAO,QAAQ,UAAU,GAAGzqC,IAAIA,EAAE,SAAS,MAAM,KAAK,QAAQ,EAAE,EAAEgiD,EAAE,CAAC,EAAE,CAAE,EAACjrC,EAAEvL,CAAC,EAAExL,IAAI,SAAS,OAAO,KAAK,QAAQ,SAAS,IAAI6S,EAAE,EAAE,YAAY,KAAK,QAAQ,SAAS,IAAI7S,EAAE,UAAU,IAAI,KAAK,QAAQ,eAAe,EAAE,KAAK,QAAQ,UAAU,KAAK,QAAQ,SAAS,CAAC,IAAI8jB,EAAE9jB,EAAE,MAAMzE,EAAEuoB,EAAE,SAAStR,EAAEsR,EAAE,KAAKvB,EAAEuB,EAAE,IAAI8C,EAAE9C,EAAE,MAAMre,EAAEqe,EAAE,OAAO9jB,EAAE,aAAa,CAAC,SAASzE,EAAE,KAAKiX,EAAE,IAAI+P,EAAE,MAAMqE,EAAE,OAAOnhB,CAAC,EAAE1G,EAAEiB,EAAE,CAAC,SAAS,QAAQ,KAAK,IAAI,IAAI,IAAI,MAAM,OAAO,OAAO,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,QAAQ,WAAWwO,EAAExO,EAAE,cAAcwtB,EAAE,SAAS,cAAc,kBAAkB,EAAEhf,EAAE,aAAagf,EAAExtB,CAAC,EAAE,SAAS,KAAK,YAAYA,CAAC,GAAG,KAAK,QAAQ,SAAS,CAAC,IAAIyO,EAAE,SAASzO,EAAEwL,EAAE,CAAYA,EAAE,MAAb,WAAmB,SAAS,oBAAoB,QAAQxL,CAAC,EAAEyqC,EAAE,KAAM,EAAC,EAAE,OAAO,KAAK,aAAa,GAAG,KAAK,QAAQzqC,EAAE,SAAS,oBAAoB,QAAQyO,CAAC,EAAE,SAAS,iBAAiB,QAAQA,CAAC,EAAE,KAAK,QAAQ,UAAU,KAAK,QAAQ,SAAS,KAAK,YAAY,EAAE,QAAQ,QAAO,CAAE,CAAC,IAAI6S,EAAE,SAAS9V,GAAG,CAACqH,EAAE,EAAE,eAAeA,EAAE,EAAE,IAAI,SAASrH,CAAC,EAAEC,EAAEg/B,CAAC,GAAGA,EAAE,aAAa53B,EAAE,EAAE,aAAa43B,EAAE,QAAQ,SAASA,EAAE,QAAQzqC,GAAG,KAAKyqC,EAAE,QAAQ53B,EAAE,EAAE,QAAQ43B,EAAE,QAAQ,UAAUA,EAAE,QAAQ,SAAS53B,EAAE,EAAE,YAAY,CAAC,EAAE,OAAOA,EAAE,EAAE,GAAG,SAASyO,CAAC,EAAEzO,EAAE,EAAE,QAAQ,KAAK,QAAQ,SAAS,SAAS,KAAK7S,CAAC,CAAC,EAAE,KAAK,UAAU,CAAC,OAAO,KAAK,aAAa,KAAK,QAAQ,UAAUyL,EAAE,IAAI,EAAE,KAAK,aAAa,GAAG,KAAK,QAAQ,KAAK,KAAK,QAAQ,UAAU,KAAK,QAAQ,SAAS,KAAK,YAAY,EAAE,QAAQ,WAAWoH,EAAE,EAAE,KAAM,EAAC,QAAQ,QAAO,CAAE,CAAC,EAAEiR,EAAE,QAAQA,EAAE,UAAUA,EAAE,SAAS,UAAU,CAAC,OAAOA,EAAE,YAAY,EAAEA,EAAE,MAAMA,EAAE,QAAQtY,EAAE,EAAEsY,CAAC,EAAE,SAAS9jB,EAAEwL,EAAE,EAAE,CAAc,SAASzM,EAAEiB,EAAEwL,EAAE,CAAC,IAAID,EAAE,CAAE,EAAC,QAAQxM,KAAKiB,EAAEwL,EAAE,QAAQzM,CAAC,GAAG,GAAG,OAAO,UAAU,eAAe,KAAKiB,EAAEjB,CAAC,IAAIwM,EAAExM,CAAC,EAAEiB,EAAEjB,CAAC,GAAG,OAAOwM,CAAC,CAAC,IAAIE,EAAE,EAAE,CAAC,EAAEg/B,EAAE,EAAE,CAAC,EAAE53B,EAAE,SAAS7S,EAAEwL,EAAE,CAAC,IAAI,EAAE,UAAU,CAAC,IAAIxL,EAAE,OAAO6S,EAAE,CAAC,SAASrH,EAAE,UAAU,SAAS,SAASA,EAAE,UAAU,QAAQ,EAAE,GAAGA,EAAE,MAAM,GAAa,OAAOA,EAAE,OAAnB,SAAyBxL,EAAEwL,EAAE,UAAU,CAAC,IAAIw2C,EAAEx2C,EAAE,MAAMuL,EAAEirC,EAAE,OAAOx0B,EAAEzuB,EAAEijD,EAAE,CAAC,QAAQ,CAAC,EAAEhiD,EAAE+W,EAAElE,EAAE,EAAE,EAAE43B,EAAE,CAAC,EAAE53B,EAAE2a,CAAC,CAAC,CAAW,OAAOxtB,GAAjB,WAAqBA,EAAE,SAAS,cAAcA,CAAC,GAAGyL,EAAE,EAAE,OAAOzL,EAAE6S,CAAC,CAAC,EAAE7S,EAAE,oBAAoBA,EAAE,oBAAoB,QAAQA,EAAE,kBAAkB,EAAEA,EAAE,iBAAiB,QAAQ,CAAC,EAAEA,EAAE,mBAAmB,CAAC,EAAEwL,EAAE,EAAEqH,CAAC,EAAE,SAAS7S,EAAEwL,EAAE,EAAE,CAAC,IAAIzM,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,IAAI,EAAEiB,EAAE,QAAQjB,EAAE,OAAO,EAAE,SAASiB,EAAEwL,EAAE,EAAE,CAAc,OAAO,eAAeA,EAAE,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,IAAIzM,EAAE,EAAE,CAAC,EAAE0M,EAAE,EAAE,EAAE1M,CAAC,EAAE0rC,EAAE,EAAE,CAAC,EAAE53B,EAAE,EAAE,CAAC,EAAEmvC,EAAE,EAAE,CAAC,EAAEjrC,EAAE,EAAE,EAAEirC,CAAC,EAAEx0B,EAAE,EAAE,CAAC,EAAE,EAAE,EAAEhiB,EAAE,aAAa,UAAU,CAAC,OAAOuL,EAAE,CAAC,CAAC,EAAE,EAAE,EAAEvL,EAAE,MAAM,UAAU,CAAC,OAAOi/B,EAAE,CAAC,CAAC,EAAE,EAAE,EAAEj/B,EAAE,YAAY,UAAU,CAAC,OAAOqH,EAAE,CAAC,CAAC,EAAE,EAAE,EAAErH,EAAE,YAAY,UAAU,CAAC,OAAOC,EAAE,CAAC,CAAC,EAAED,EAAE,QAAQ,CAAC,QAAQ,SAASxL,EAAE,CAAC,IAAIwL,EAAE,UAAU,OAAO,GAAY,UAAU,CAAC,IAApB,OAAsB,UAAU,CAAC,EAAE,GAAGzM,EAAEyM,EAAE,MAAM,aAAaxL,EAAE,UAAUjB,EAAE,EAAE,EAAEyuB,EAAE,CAAC,EAAE/hB,EAAE,EAAE,CAAC,KAAK1M,CAAC,CAAC,CAAC,EAAEiB,EAAE,UAAU,IAAIjB,CAAC,EAAE0rC,EAAE,EAAEzqC,EAAE,UAAUjB,EAAE8T,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS7S,EAAEwL,EAAE,EAAE,CAAc,OAAO,eAAeA,EAAE,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,IAAIzM,EAAE,EAAE,CAAC,EAAE0M,EAAE,EAAE,EAAE1M,CAAC,EAAEyM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,QAAQ,QAAQ,EAAE,EAAE,WAAW,CAAC,KAAK,QAAQ,QAAQ,EAAE,EAAE,mBAAmB,CAAC,KAAK,QAAQ,QAAQ,EAAE,EAAE,gBAAgB,CAAC,KAAK,OAAO,QAAQ,YAAY,EAAE,SAAS,CAAC,KAAK,QAAQ,QAAQ,EAAE,EAAE,SAAS,CAAC,KAAK,QAAQ,QAAQ,EAAE,CAAC,EAAE,KAAK,UAAU,CAAC,MAAM,CAAC,aAAa,GAAG,UAAU,EAAE,CAAC,EAAE,SAAS,CAAC,QAAQ,UAAU,CAAC,OAAO,KAAK,SAAS,EAAE,WAAW,UAAU,CAAC,OAAO,KAAK,UAAU,CAACC,EAAE,EAAE,SAAS,EAAE,aAAa,UAAU,CAAC,OAAO,KAAK,YAAY,KAAK,WAAW,KAAK,aAAa,CAAC,SAAS,QAAQ,KAAK,IAAI,IAAI,IAAI,MAAM,OAAO,OAAO,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,CAAC,OAAO,SAASzL,EAAE,CAAUA,IAAT,OAAW,KAAK,aAAa,KAAK,OAAO,KAAK,QAAS,EAACA,EAAE,KAAK,QAAS,EAAC,KAAK,KAAM,GAAE,QAAQ,UAAU,CAAC,GAAG,KAAK,YAAY,KAAK,aAAa,GAAG,KAAK,mBAAoB,EAAC,SAAS,oBAAoB,QAAQ,KAAK,gBAAgB,EAAE,SAAS,iBAAiB,QAAQ,KAAK,gBAAgB,IAAIyL,EAAE,EAAE,IAAI,SAAS,KAAK,kBAAkB,EAAEA,EAAE,EAAE,GAAG,SAAS,KAAK,kBAAkB,EAAEA,EAAE,EAAE,QAAQ,KAAK,SAAS,SAAS,KAAK,KAAK,GAAG,GAAG,KAAK,SAAS,CAAC,GAAG,KAAK,IAAI,aAAa,SAAS,KAAK,OAAO,KAAK,aAAa,KAAK,IAAI,WAAW,KAAK,QAAQ,SAAS,cAAc,kBAAkB,EAAE,KAAK,aAAa,aAAa,KAAK,QAAQ,KAAK,GAAG,EAAE,SAAS,KAAK,YAAY,KAAK,GAAG,CAAC,CAAC,EAAE,KAAK,UAAU,CAAC,KAAK,eAAe,KAAK,YAAY,KAAK,aAAa,GAAG,KAAK,mBAAoB,EAAC,SAAS,oBAAoB,QAAQ,KAAK,gBAAgB,GAAGA,EAAE,EAAE,KAAI,EAAG,EAAE,WAAW,SAASzL,EAAE,CAACA,EAAE,SAAS,KAAK,KAAK,KAAK,oBAAoB,KAAK,MAAM,EAAE,mBAAmB,UAAU,CAACyL,EAAE,EAAE,cAAcA,EAAE,EAAE,IAAI,SAAS,KAAK,kBAAkB,EAAE,KAAK,aAAaA,EAAE,EAAE,aAAa,KAAK,mBAAoB,GAAE,iBAAiB,SAASzL,EAAE,CAAYA,EAAE,MAAb,UAAkB,KAAK,KAAM,GAAE,mBAAmB,UAAU,CAAC,KAAK,cAAc,KAAK,UAAU,KAAK,eAAe,KAAK,aAAa,aAAa,KAAK,IAAI,KAAK,OAAO,EAAE,KAAK,aAAa,YAAY,KAAK,OAAO,GAAG,KAAK,MAAM,SAAS,KAAK,YAAY,EAAE,KAAK,MAAM,oBAAoB,KAAK,YAAY,EAAE,KAAK,MAAM,QAAQ,KAAK,YAAY,CAAC,EAAE,MAAM,UAAU,CAAC,KAAK,QAAS,GAAE,SAAS,UAAU,CAAC,OAAO,KAAK,YAAY,CAAC,EAAE,MAAM,CAAC,MAAM,SAASA,EAAE,CAACA,IAAI,KAAK,eAAeA,EAAE,KAAK,QAAS,EAAC,KAAK,KAAI,EAAG,EAAE,WAAW,SAASA,EAAE,CAACA,IAAI,KAAK,eAAeA,EAAE,KAAK,UAAU,KAAK,KAAM,EAAC,CAAC,EAAE,QAAQ,UAAU,CAAC,KAAK,UAAUyL,EAAE,EAAE,SAAS,CAAC,CAAC,EAAE,SAASzL,EAAEwL,EAAE,CAACxL,EAAE,QAAQ,SAASA,EAAEwL,EAAED,EAAExM,EAAE,CAAC,IAAI0M,EAAEg/B,EAAEzqC,EAAEA,GAAG,CAAE,EAAC6S,EAAE,OAAO7S,EAAE,QAAmB6S,IAAX,UAA2BA,IAAb,aAAiBpH,EAAEzL,EAAEyqC,EAAEzqC,EAAE,SAAS,IAAIgiD,EAAc,OAAOvX,GAAnB,WAAqBA,EAAE,QAAQA,EAAE,GAAGj/B,IAAIw2C,EAAE,OAAOx2C,EAAE,OAAOw2C,EAAE,gBAAgBx2C,EAAE,iBAAiBD,IAAIy2C,EAAE,SAASz2C,GAAGxM,EAAE,CAAC,IAAIgY,EAAE,OAAO,OAAOirC,EAAE,UAAU,IAAI,EAAE,OAAO,KAAKjjD,CAAC,EAAE,QAAQ,SAASiB,EAAE,CAAC,IAAIwL,EAAEzM,EAAEiB,CAAC,EAAE+W,EAAE/W,CAAC,EAAE,UAAU,CAAC,OAAOwL,CAAC,CAAC,CAAC,EAAEw2C,EAAE,SAASjrC,CAAC,CAAC,MAAM,CAAC,SAAStL,EAAE,QAAQg/B,EAAE,QAAQuX,CAAC,CAAC,CAAC,EAAE,SAAShiD,EAAEwL,EAAE,CAACxL,EAAE,QAAQ,CAAC,OAAO,UAAU,CAAC,IAAIA,EAAEwL,EAAE,KAAKD,EAAEC,EAAE,eAAe,OAAOA,EAAE,MAAM,IAAID,GAAG,MAAMC,EAAE,GAAG,CAAC,IAAI,UAAU,OAAOxL,EAAE,GAAGA,EAAEwL,EAAE,eAAe,EAAEA,EAAE,aAAaxL,GAAG,MAAMwL,EAAE,aAAa,GAAG,CAAC,MAAM,SAASxL,EAAE,CAAC,OAAOwL,EAAE,WAAWxL,CAAC,CAAC,CAAC,CAAC,EAAE,MAAMwL,EAAE,OAAO,EAAE,EAAE,CAACA,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,gBAAgB,CAAE,EAAC,CAAC,CAAC,CAAC,CAAC","names":["VResponsive","mixins","Measurable","getSlot","h","hasIntersect","__unplugin_components_1$3","Themeable","intersect","backgroundImage","src","image","entries","observer","isIntersecting","lazyImg","err","consoleWarn","img","timeout","poll","naturalHeight","naturalWidth","content","slot","placeholder","node","data","mergeData","VSheet","height","extensionHeight","__spreadProps","__spreadValues","convertToUnit","original","replacement","breaking","props","VImg","children","inserted","el","binding","vnode","self","value","options","handler","target","unbind","_a","Scroll","applicationable","events","PositionableFactory","x","prev","newVal","oldVal","i","length","force","handleGesture","wrapper","touchstartX","touchendX","touchstartY","touchendY","dirRatio","minDistance","touchstart","event","touch","touchend","touchmove","createHandlers","e","handlers","keys","eventName","Touch","Scrollable","Vue","SSRBootable","baseMixins","VToolbar","Toggleable","Applicationable","threshold","min","max","scrollOffScreen","val","render","Transitionable","__unplugin_components_30","color","VBtn","VIcon","classes","Comparable","deepEqual","__unplugin_components_0$1","Colorable","Roundable","VLabel","ctx","listeners","newData","functionalThemeClasses","__unplugin_components_6","message","key","RegistrableInject","messages","errorBucket","index","rule","valid","consoleError","BindsAttrs","Validatable","__unplugin_components_0","validation","validationResult","type","cb","extraData","icon","kebabCase","hasListener","localeKey","label","VMessages","location","ref","VCounter","isGreater","intersectable","Intersect","callback","VInput","Intersectable","Loadable","dirtyTypes","__unplugin_components_7","resize","ripple","computedColor","offset","input","prepend","_b","_c","width","span","title","inputAttrs","__objRest","messagesNode","counterNode","root","attachedRoot","keyCodes","Mobile","v","mobile","name","mobileBreakpoint","mobileWidth","deprecate","__unplugin_components_12","styles","top","VAvatar","VExpandTransition","__unplugin_components_4","Rippleable","prevent","Selectable","item","attrs","__unplugin_components_39","ClickOutside","inputWidth","startDir","endDir","valueDir","start","end","parsed","slider","tickSize","range","createRange","direction","offsetDirection","ticks","filled","valueWidth","isActive","isFocused","onFocus","onBlur","thumbLabelContent","size","transform","VScaleTransition","domRect","mouseUpOptions","passiveSupported","mouseMoveOptions","isTouchEvent","addOnceEventListener","click","trackStart","trackLength","clickOffset","clickPos","pageup","pagedown","home","left","right","down","up","step","steps","multiplier","trimmedStep","decimals","newValue","__unplugin_components_27","bar","footer","insetFooter","bottom","__unplugin_components_1$1","RegistrableProvide","errors","watcher","watchers","found","unwatch","VGrid","__unplugin_components_29","Grid","__unplugin_components_2","createSimpleFunctional","__unplugin_components_3","__unplugin_components_1","removed","__unplugin_components_24","switchAttrs","VFabTransition","VProgressCircular","VToolbarTitle","_sfc_main","_extends","n","t","r","DEFAULT_CONFIG","isNumber","isBigNumber","isComplex","isFraction","isUnit","isString","isArray","isMatrix","isCollection","isDenseMatrix","isSparseMatrix","isRange","isIndex","isBoolean","isResultSet","isHelp","isFunction","isDate","isRegExp","isObject","isNull","isUndefined","isAccessorNode","isArrayNode","isAssignmentNode","isBlockNode","isConditionalNode","isConstantNode","isFunctionAssignmentNode","isFunctionNode","isIndexNode","isNode","isObjectNode","isOperatorNode","isParenthesisNode","isRangeNode","isRelationalNode","isSymbolNode","isChain","typeOf","clone","mapObject","object","hasOwnProperty","extend","a","b","prop","deepStrictEqual","len","property","pickShallow","properties","copy","MATRIX_OPTIONS","NUMBER_OPTIONS","config","ok","notOk","undef","NOT_TYPED_FUNCTION","create","isPlainObject","_types","anyType","typeMap","typeList","nConversions","typed","findType","typeName","otherName","addTypes","types","beforeSpec","beforeIndex","newTypes","affectedTypes","clear","clearConversions","findTypeNames","matches","isTypedFunction","entity","findSignature","fn","signature","exact","stringSignature","params","parseSignature","canonicalSignature","stringifyParams","match","nParams","remainingSignatures","want","filteredSignatures","possibility","have","getParamAtIndex","haveTypes","paramTypeSet","wtype","candidate","find","convert","conversions","separator","p","parseParam","param","restParam","typeDefs","s","hasAny","paramName","expandParam","typeNames","matchingConversions","availableConversions","newName","convertibleTypes","conversion","rawSignature","rawParams","parsedParam","hasRestParam","last","compileTest","test0","test1","tests","compileTests","initial","varIndex","lastTest","testRestParam","args","getTypeSetAtIndex","isExactType","mergeExpectedParams","signatures","typeSet","paramSet","createError","expected","_name","matchingSignatures","nextMatchingDefs","test","actualTypes","lengths","maxLength","argTypes","getLowestTypeIndex","getLowestConversionIndex","compareParams","param1","param2","typeDiff","convDiff","compareSignatures","signature1","signature2","pars1","pars2","last1","last2","hasRest1","hasRest2","any1","conv1","par","any2","conv2","lengthCriterion","comparisons","tc","thisComparison","c","t1","t2","knownTypes","newMatch","compileArgsPreprocessing","fnConvert","compiledConversions","compileArgConversion","fnPreprocess","slice","conversion0","conversion1","arg","splitParams","_splitParams","paramsSoFar","resultingParams","exactTypes","flatMap","nextParam","conflicting","params1","params2","ii","typeSet1","typeSet2","overlap","len1","len2","restParam1","restParam2","clearResolutions","functionList","isReferToSelf","referToSelf","isReferTo","makeReferTo","collectResolutions","references","signatureMap","resolvedReferences","reference","resolution","resolveReferences","resolvedFunctions","isResolved","leftUnresolved","nothingResolved","validateDeprecatedThis","signaturesMap","deprecatedThisRegex","createTypedFunction","rawSignaturesMap","parsedParams","originalFunctions","preliminarySignatures","pp","functionIndex","conversionParams","sp","spName","theTypedFn","internalSignatureMap","ok0","ok1","ok2","ok3","ok4","ok5","allOk","test00","test10","test20","test30","test40","test50","test01","test11","test21","test31","test41","test51","fn0","fn1","fn2","fn3","fn4","fn5","len0","len3","len4","len5","iStart","iEnd","fns","generic","arg0","arg1","_onMismatch","arr","findInArray","referTo","objectOrFn","checkName","nameSoFar","getObjectName","obj","mergeSignatures","dest","source","saveTyped","maybeName","named","allSignatures","theseSignatures","thisName","beforeObjectTest","before","_validateConversion","to","other","existingConversion","tf","argList","sigs","typedFunction","isInteger","sign","formatNumberToBase","base","prefixes","prefix","suffix","__pow","format","notation","precision","wordSize","normalizeFormatOptions","toFixed","toExponential","toEngineering","toPrecision","digits","_toNumberOrThrow","splitNumber","exponent","dot","coefficients","zeros","split","rounded","roundDigits","newExp","missingZeros","expDiff","decimalIdx","decimalVal","str","splitValue","first","lowerExp","_toNumberOrDefault","upperExp","DBL_EPSILON","nearlyEqual","y","epsilon","diff","onError","defaultValue","factory","dependencies","meta","assertAndCreate","scope","deps","stripOptionalNotation","assertDependencies","allDefined","dependency","isOptionalDependency","missingDependencies","d","getSafeProperty","isSafeProperty","isSafeMethod","setSafeProperty","hasSafeProperty","safeNativeProperties","method","safeNativeMethods","ObjectWrappingMap","mapIterator","it","isMap","_createTyped2","createTyped","_ref","BigNumber","Complex","DenseMatrix","Fraction","throwNoBignumber","throwNoComplex","throwNoFraction","f","array","throwNoMatrix","matrix","usualError","sig","EXP_LIMIT","MAX_DIGITS","NUMERALS","LN10","PI","DEFAULTS","inexact","quadrant","external","decimalError","invalidArgument","precisionLimitExceeded","cryptoUnavailable","tag","mathfloor","mathpow","isBinary","isHex","isOctal","isDecimal","BASE","LOG_BASE","MAX_SAFE_INTEGER","LN10_PRECISION","PI_PRECISION","P","finalise","k","Ctor","j","xdL","ydL","xd","yd","xs","ys","pr","rm","cosine","toLessThanHalfPi","m","rep","sd","t3","t3plusx","digitsToString","divide","w","one","tinyPow","taylorSeries","cosh2_x","d8","sinh2_x","d5","d16","d20","halfPi","getPi","wpr","xsd","px","x2","isBase10","denominator","inf","num","guard","naturalLogarithm","getLn10","checkRoundingDigits","xe","xLTy","getBase10Exponent","q","naturalExponential","carry","z","getPrecision","sine","rL","toStringBinary","dp","checkInt32","finiteToString","maxD","d0","d1","d2","n0","n1","yn","intPow","ws","indexOfLastWord","getZeroString","repeating","di","rd","convertBase","baseIn","baseOut","arrL","strL","cos2x","multiplyInteger","temp","compare","aL","bL","subtract","cmp","logBase","more","prod","prodL","qd","rem","remL","rem0","xi","xL","yd0","yL","yz","isTruncated","roundUp","xdi","out","isExp","nonFiniteToString","zs","truncate","isOdd","maxOrMin","ltgt","pow","sum","c0","numerator","x1","parseDecimal","parseOther","divisor","isFloat","Decimal","sin2_x","isHyperbolic","u","isNeg","pi","abs","acos","acosh","add","asin","asinh","atan","atanh","atan2","cbrt","ceil","clamp","useDefaults","ps","cos","cosh","isDecimalInstance","div","exp","floor","hypot","ln","log","log10","log2","mod","mul","random","round","sin","sinh","sqrt","sub","tan","tanh","trunc","createBigNumberClass","on","json","curr","cosm1","xx","parser_exit","logHypot","parse","tokens","plus","minus","loh","re","im","tmp","res","noIM","oneMinus","onePlus","places","ret","module","createComplexClass","strRe","strIm","phi","MAX_CYCLE_LEN","assign","InvalidParameter","newFraction","DivisionByZero","gcd","factorize","factors","p1","p2","A","C","D","N","M","NonIntegerParameter","modpow","cycleLen","cycleStart","rem1","rem2","eps","thisABS","cont","excludeWhole","whole","dec","cycLen","cycOff","createFractionClass","createMatrixClass","Matrix","datatype","skipZeros","formatBigNumberToBase","BigNumberCtor","big2","valueWithoutExp","valueStr","result","_format","formatNumber","formatBigNumber","looksLikeFraction","formatArray","stringify","text","escaped","controlCharacters","DimensionError","actual","relation","IndexError","arraySize","_validate","dim","dimNext","child","validate","isScalar","validateIndex","_defaultValue","_resize","elem","oldLen","newLen","minLen","reshape","sizes","flatArray","flatten","currentLength","processSizesWildcard","newLength","product","_reshape","processedSizes","WILDCARD","wildCardIndex","isMoreThanOneWildcard","hasWildcard","canReplaceWildcard","tmpArray","tmpArray2","sizeIndex","unsqueeze","dims","outer","_unsqueeze","next","flat","getArrayDataType","_isArray","itemType","concatRecursive","concatDim","concat","arrays","B","broadcastSizes","_len","_key","dimensions","sizeMax","_i","checkBroadcastingRules","toSize","broadcastTo","Asize","broadcastedSize","paddedSize","stretch","arrayToStretch","sizeToStretch","dimToStretch","maxArgumentCount","count","createDenseMatrixClass","preprocess","_get","_set","indexI","_fit","_getSubmatrix","submatrix","iSize","sSize","_unused","_setSubmatrix","dataIndex","subIndex","sizeArray","newSize","changed","me","recurse","__yieldStar","row","_this","_loop","col","kSuper","kSub","rows","columns","_value","ms","vi","deepMap","createIsInteger","isIntegerNumber","n2","absNumber","addNumber","subtractNumber","multiplyNumber","unaryMinusNumber","signNumber","powNumber","isPositiveNumber","isZeroNumber","createIsPositive","createIsZero","complexEquals","createCompareUnits","createEqualScalar","compareUnits","bigNearlyEqual","_ref2","createSparseMatrixClass","equalScalar","SparseMatrix","_createFromMatrix","_createFromArray","eq","zero","_getsubset","_setsubset","idx","kk","mvalues","mindex","mptr","pv","values","ptr","firstDimensionRange","secondDimensionRange","firstDataIndex","firstSubIndex","secondDataIndex","secondSubIndex","_getValueIndex","_remove","_insert","ins","k0","k1","colIndex","rowIndex","r1","c1","_i2","_i3","_j","invoke","_map","minRow","maxRow","minColumn","maxColumn","_values","_k","_i4","_i5","_k2","_i6","_i7","_toArray","density","kx","ky","vx","vy","getNonDecimalNumberParts","nonDecimalWithRadixMatch","radix","integerPart","fractionalPart","makeNumberFromNonDecimalParts","parts","digitValue","createNumber","number","nonDecimalNumberParts","wordSizeSuffixMatch","unit","valuelessUnit","createBignumber","twoPowSize","twoPowSizeSubOne","createComplex","createFraction","createMatrix","_create","createMatrixFromColumns","_createArray","checkVectorTypeAndReturnLength","colLength","vec","createUnaryMinus","createAbs","createAddScalar","createSubtractScalar","createMatAlgo11xS0s","inverse","avalues","aindex","aptr","asize","adt","dt","cf","cvalues","cindex","cptr","createMatAlgo12xSfs","cdata","mark","createMatAlgo14xDs","adata","_iterate","level","av","bv","cv","createMatAlgo03xDSf","denseMatrix","sparseMatrix","bvalues","bindex","bptr","bsize","bdt","createMatAlgo05xSfSf","xa","xb","wa","wb","wai","wbi","va","vb","vc","createMatAlgo13xDD","bdata","csize","dependancies","createBroadcast","sizeA","_padLeft","sizeB","AA","BB","_dim","_stretch","shape","filler","createMatrixAlgorithmSuite","matAlgo13xDD","matAlgo14xDs","broadcast","elop","SD","matrixSignatures","scalar","Ds","sS","createMatAlgo01xDSid","createMatAlgo04xSidSid","createMatAlgo10xSids","createMultiplyScalar","createMultiply","addScalar","multiplyScalar","matAlgo11xS0s","_validateMatrixDimensions","size1","size2","_multiplyVectorVector","_multiplyVectorMatrix","_multiplyVectorDenseMatrix","alength","bcolumns","af","mf","_multiplyMatrixVector","_multiplyDenseMatrixVector","_multiplySparseMatrixVector","_multiplyMatrixMatrix","_multiplyDenseMatrixDenseMatrix","_multiplyDenseMatrixSparseMatrix","_multiplySparseMatrixDenseMatrix","_multiplySparseMatrixSparseMatrix","arows","acolumns","jb","kb0","kb1","cij","kb","ib","brows","vbi","ka0","ka1","ka","ia","ic","vbij","p0","selfMM","xsize","ysize","rest","createSign","_BigNumber","complex","_Fraction","createSqrt","_sqrtNumber","createSubtract","subtractScalar","unaryMinus","matAlgo01xDSid","matAlgo03xDSf","matAlgo05xSfSf","matAlgo10xSids","matAlgo12xSfs","matrixAlgorithmSuite","createMatAlgo07xSSf","_scatter","createConj","createIm","createRe","createConcat","prevDim","asMatrix","matrices","_concat","createColumn","Index","_column","column","rowRange","createDiag","_diag","_createDiagonalMatrix","_getDiagonal","l","dm","vector","createFlatten","flattenArray","createGetMatrixDataType","createIdentity","_identity","cols","_identityVector","Big","minimum","noBignumber","noFraction","noMatrix","bignumber","smaller","smallerEq","larger","largerEq","isPositive","_strRange","_out","_range","includeEnd","_parse","ongoing","nums","invalid","createReshape","arrayReshape","createSize","createTranspose","transposeMatrix","_denseTranspose","_sparseTranspose","transposed","transposedRow","createCtranspose","transpose","conj","createZeros","_zeros","hasBigNumbers","_normalize","createNumeric","_number","fraction","validInputTypes","validOutputTypes","outputType","check","inputType","createDivideScalar","numeric","createPow","identity","multiply","inv","_pow","_powArray","_powMatrix","yFrac","yNum","ex","error","createSolveValidation","mSize","bSize","createUsolve","divideScalar","solveValidation","_sparseBackwardSubstitution","_denseBackwardSubstitution","mdata","bj","xj","vjj","jValues","jIndices","firstIndex","lastIndex","_lastIndex","createUsolveAll","R","b_","L","bNew","iValues","iIndices","Mii","J","_j3","_lastIndex2","_J2","_j2","_J","createEqual","matAlgo07xSSf","createEqualNumber","createSmaller","createSmallerNumber","createSmallerEq","createSmallerEqNumber","createLarger","createLargerNumber","createLargerEq","createLargerEqNumber","createImmutableDenseMatrixClass","ImmutableDenseMatrix","createIndexClass","getMatrixDataType","ranges","argIsArray","argIsMatrix","sourceSize","_createImmutableMatrix","_booleansArrayToNumbersForIndex","dimension","strings","booleanArrayIndex","indexOfNumbers","bool","createAtan","createTrigUnit","createCos","trigUnit","createSin","createAdd","matAlgo04xSidSid","createNorm","ctranspose","eigs","_norm","_vectorNormPlusInfinity","pinf","_vectorNormMinusInfinity","ninf","_vectorNorm","_matrixNormFrobenius","fro","_matrixNormOne","maxc","cj","_matrixNormTwo","sizeX","tx","squaredX","eigenVals","rho","_matrixNormInfinity","maxr","ri","_matrixNorm","createDot","_denseDot","_sparseDot","_validateDim","xSize","_size","ySize","xLen","yLen","aIsColumn","bIsColumn","_c2","_c3","xindex","xvalues","yindex","yvalues","I","createQr","isZero","equal","_denseQR","_sparseQR","_denseQRimpl","Q","Qdata","Rdata","pivot","sgn","conjSgn","alphaSquared","alpha","u1","tau","createDet","_det","negated","rowIndices","_","k_","piv","piv_","i_","det","createInv","_inv","mat","ABig","rBig","Ac","Bc","Ar","Br","createComplexEigs","diag","qr","usolve","usolveAll","matrixFromColumns","complexEigs","prec","findVectors","balance","reduceToHessenberg","iterateUntilTriangular","eigenvectors","findEigenvectors","big","cplx","realzero","realone","radixSq","Rdiag","colNorm","rowNorm","rowDivRadix","rowMulRadix","condition","g","maxIndex","tmp1","tmp2","tmp3","lambdas","Sdiag","Qtotal","Qpartial","lastConvergenceBefore","inflateMatrix","ll","eigenvalues2x2","jordanBase2x2","blockDiag","Cinv","U","uniqueValues","multiplicities","lambda","indexOf","vectors","E","S","solutions","approxVec","inverseIterate","correction","trA","detA","l1","l2","na","nd","orthog","largeNum","randomOrthogonalVector","norm","orthogonalComplement","normalize","vectorShape","createRealSymmetric","main","computeVectors","diagBig","e0","psi","Sij","Vab","getAij","getTheta","Sij1","Ei","sorting","getAijBig","getThetaBig","x1Big","Sij1Big","aii","ajj","aij","denom","theta","Ski","Skj","Hij","c2","s2","Aki","Akj","csHij","Aii","Ajj","_k3","_k4","Mij","maxMij","maxIJ","vecs","minID","minE","_k5","createEigs","doRealSymmetric","doComplexEigs","doEigs","opts","useOpts","_opts$precision","computeValuesAndVectors","isReal","coerceReal","isSymmetric","_type","coerceTypes","hasNumber","hasBig","hasComplex","mathsHelpers","embedding1","embedding2","dotProduct","norm1","norm2","onboardingRouteName","evalmeeOnboarding","__vitePreload","autoRedirectToOnboarding","router","from","store","redirectToOnboarding","shouldRedirectToOnboarding","redirectTo","getFeatureMixin","mapGetters","feature","EvaLabel","EvaSwitch","user","featureName","chatSupportHelpers","currentApp","bf","filter","useSchoolsUser","schoolsUser","useStore","accessibilityOption","computed","timeAccommodation","school","facade","BetaFeaturesList","mapActions","hasVersionChanged","useAppVersion","showUserProfile","editUserProfile","appNotifications","evalmeeUserProfile","userProfile","this","o"],"ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,155],"sources":["../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VResponsive/VResponsive.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VImg/VImg.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VToolbar/VToolbar.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/directives/scroll/index.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/mixins/applicationable/index.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/directives/touch/index.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/mixins/scrollable/index.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/mixins/ssr-bootable/index.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VAppBar/VAppBar.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/mixins/transitionable/index.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VAlert/VAlert.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/mixins/comparable/index.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VAvatar/VAvatar.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VLabel/VLabel.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VMessages/VMessages.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/mixins/validatable/index.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VInput/VInput.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VCounter/VCounter.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/mixins/intersectable/index.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VTextField/VTextField.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/mixins/mobile/index.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VBanner/VBanner.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VOverlay/VOverlay.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/mixins/rippleable/index.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/mixins/selectable/index.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VSlider/VSlider.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VMain/VMain.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VForm/VForm.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VGrid/grid.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VGrid/VContainer.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VGrid/VSpacer.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VLazy/VLazy.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VSnackbar/VSnackbar.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VSwitch/VSwitch.js","../../../node_modules/.pnpm/vuetify@2.7.2_vue@2.7.16/node_modules/vuetify/lib/components/VToolbar/index.js","../../../app/javascript/components/shared/inputs/eva-text-field.vue","../../../node_modules/.pnpm/@babel+runtime@7.25.4/node_modules/@babel/runtime/helpers/esm/extends.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/core/config.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/utils/is.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/utils/object.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/core/function/config.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/entry/configReadonly.js","../../../node_modules/.pnpm/typed-function@4.1.1/node_modules/typed-function/lib/esm/typed-function.mjs","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/utils/number.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/utils/factory.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/utils/customs.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/utils/map.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/core/function/typed.js","../../../node_modules/.pnpm/decimal.js@10.4.3/node_modules/decimal.js/decimal.mjs","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/bignumber/BigNumber.js","../../../node_modules/.pnpm/complex.js@2.1.1/node_modules/complex.js/complex.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/complex/Complex.js","../../../node_modules/.pnpm/fraction.js@4.3.4/node_modules/fraction.js/fraction.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/fraction/Fraction.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/Matrix.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/utils/bignumber/formatter.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/utils/string.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/error/DimensionError.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/error/IndexError.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/utils/array.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/utils/function.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/DenseMatrix.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/utils/collection.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/utils/isInteger.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/plain/number/arithmetic.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/plain/number/utils.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/utils/isPositive.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/utils/isZero.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/utils/bignumber/nearlyEqual.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/utils/complex.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/relational/compareUnits.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/relational/equalScalar.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/SparseMatrix.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/number.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/bignumber/function/bignumber.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/complex/function/complex.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/fraction/function/fraction.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/function/matrix.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/matrixFromColumns.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/arithmetic/unaryMinus.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/arithmetic/abs.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/arithmetic/addScalar.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/arithmetic/subtractScalar.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo11xS0s.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo12xSfs.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo14xDs.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo03xDSf.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo05xSfSf.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo13xDD.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/utils/broadcast.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/utils/matrixAlgorithmSuite.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo01xDSid.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo04xSidSid.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo10xSids.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/arithmetic/multiplyScalar.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/arithmetic/multiply.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/arithmetic/sign.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/arithmetic/sqrt.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/arithmetic/subtract.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo07xSSf.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/complex/conj.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/complex/im.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/complex/re.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/concat.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/column.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/diag.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/flatten.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/getMatrixDataType.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/identity.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/utils/noop.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/range.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/reshape.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/size.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/transpose.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/ctranspose.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/zeros.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/utils/numeric.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/arithmetic/divideScalar.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/arithmetic/pow.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/algebra/solver/utils/solveValidation.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/algebra/solver/usolve.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/algebra/solver/usolveAll.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/relational/equal.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/relational/smaller.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/relational/smallerEq.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/relational/larger.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/relational/largerEq.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/ImmutableDenseMatrix.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/type/matrix/MatrixIndex.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/trigonometry/atan.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/trigonometry/trigUnit.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/trigonometry/cos.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/trigonometry/sin.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/arithmetic/add.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/arithmetic/norm.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/dot.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/algebra/decomposition/qr.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/det.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/inv.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/eigs/complexEigs.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/eigs/realSymmetric.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/function/matrix/eigs.js","../../../node_modules/.pnpm/mathjs@12.4.3/node_modules/mathjs/lib/esm/entry/pureFunctionsAny.generated.js","../../../app/javascript/helpers/maths_helpers.js","../../../app/javascript/router/evalmee_common/evalmee_onboarding.js","../../../app/javascript/components/shared/get_feature_mixin.js","../../../app/javascript/components/shared/inputs/eva-label.vue","../../../app/javascript/components/shared/inputs/eva-switch.vue","../../../app/javascript/views/user_profile/betaFeaturesList.vue","../../../app/javascript/composables/useSchoolsUser.js","../../../app/javascript/views/user_profile/showUserProfile.vue","../../../app/javascript/views/user_profile/editUserProfile.vue","../../../app/javascript/components/shared/app_notifications.vue","../../../app/javascript/views/user_profile.vue","../../../app/javascript/router/evalmee_common/user_profile.js","../../../node_modules/.pnpm/vue-fullscreen@2.6.1/node_modules/vue-fullscreen/dist/vue-fullscreen.min.js"],"sourcesContent":["import \"../../../src/components/VResponsive/VResponsive.sass\"; // Mixins\n\nimport Measurable from '../../mixins/measurable'; // Utils\n\nimport mixins from '../../util/mixins';\nimport { getSlot } from '../../util/helpers';\n/* @vue/component */\n\nexport default mixins(Measurable).extend({\n  name: 'v-responsive',\n  props: {\n    aspectRatio: [String, Number],\n    contentClass: String\n  },\n  computed: {\n    computedAspectRatio() {\n      return Number(this.aspectRatio);\n    },\n\n    aspectStyle() {\n      return this.computedAspectRatio ? {\n        paddingBottom: 1 / this.computedAspectRatio * 100 + '%'\n      } : undefined;\n    },\n\n    __cachedSizer() {\n      if (!this.aspectStyle) return [];\n      return this.$createElement('div', {\n        style: this.aspectStyle,\n        staticClass: 'v-responsive__sizer'\n      });\n    }\n\n  },\n  methods: {\n    genContent() {\n      return this.$createElement('div', {\n        staticClass: 'v-responsive__content',\n        class: this.contentClass\n      }, getSlot(this));\n    }\n\n  },\n\n  render(h) {\n    return h('div', {\n      staticClass: 'v-responsive',\n      style: this.measurableStyles,\n      on: this.$listeners\n    }, [this.__cachedSizer, this.genContent()]);\n  }\n\n});\n//# sourceMappingURL=VResponsive.js.map","// Styles\nimport \"../../../src/components/VImg/VImg.sass\"; // Directives\n\nimport intersect from '../../directives/intersect'; // Components\n\nimport VResponsive from '../VResponsive'; // Mixins\n\nimport Themeable from '../../mixins/themeable'; // Utils\n\nimport mixins from '../../util/mixins';\nimport mergeData from '../../util/mergeData';\nimport { consoleWarn } from '../../util/console';\nimport { getSlot } from '../../util/helpers';\nconst hasIntersect = typeof window !== 'undefined' && 'IntersectionObserver' in window;\n/* @vue/component */\n\nexport default mixins(VResponsive, Themeable).extend({\n  name: 'v-img',\n  directives: {\n    intersect\n  },\n  props: {\n    alt: String,\n    contain: Boolean,\n    eager: Boolean,\n    gradient: String,\n    lazySrc: String,\n    options: {\n      type: Object,\n      // For more information on types, navigate to:\n      // https://developer.mozilla.org/en-US/docs/Web/API/Intersection_Observer_API\n      default: () => ({\n        root: undefined,\n        rootMargin: undefined,\n        threshold: undefined\n      })\n    },\n    position: {\n      type: String,\n      default: 'center center'\n    },\n    sizes: String,\n    src: {\n      type: [String, Object],\n      default: ''\n    },\n    srcset: String,\n    transition: {\n      type: [Boolean, String],\n      default: 'fade-transition'\n    }\n  },\n\n  data() {\n    return {\n      currentSrc: '',\n      image: null,\n      isLoading: true,\n      calculatedAspectRatio: undefined,\n      naturalWidth: undefined,\n      hasError: false\n    };\n  },\n\n  computed: {\n    computedAspectRatio() {\n      return Number(this.normalisedSrc.aspect || this.calculatedAspectRatio);\n    },\n\n    normalisedSrc() {\n      return this.src && typeof this.src === 'object' ? {\n        src: this.src.src,\n        srcset: this.srcset || this.src.srcset,\n        lazySrc: this.lazySrc || this.src.lazySrc,\n        aspect: Number(this.aspectRatio || this.src.aspect)\n      } : {\n        src: this.src,\n        srcset: this.srcset,\n        lazySrc: this.lazySrc,\n        aspect: Number(this.aspectRatio || 0)\n      };\n    },\n\n    __cachedImage() {\n      if (!(this.normalisedSrc.src || this.normalisedSrc.lazySrc || this.gradient)) return [];\n      const backgroundImage = [];\n      const src = this.isLoading ? this.normalisedSrc.lazySrc : this.currentSrc;\n      if (this.gradient) backgroundImage.push(`linear-gradient(${this.gradient})`);\n      if (src) backgroundImage.push(`url(\"${src}\")`);\n      const image = this.$createElement('div', {\n        staticClass: 'v-image__image',\n        class: {\n          'v-image__image--preload': this.isLoading,\n          'v-image__image--contain': this.contain,\n          'v-image__image--cover': !this.contain\n        },\n        style: {\n          backgroundImage: backgroundImage.join(', '),\n          backgroundPosition: this.position\n        },\n        key: +this.isLoading\n      });\n      /* istanbul ignore if */\n\n      if (!this.transition) return image;\n      return this.$createElement('transition', {\n        attrs: {\n          name: this.transition,\n          mode: 'in-out'\n        }\n      }, [image]);\n    }\n\n  },\n  watch: {\n    src() {\n      // Force re-init when src changes\n      if (!this.isLoading) this.init(undefined, undefined, true);else this.loadImage();\n    },\n\n    '$vuetify.breakpoint.width': 'getSrc'\n  },\n\n  mounted() {\n    this.init();\n  },\n\n  methods: {\n    init(entries, observer, isIntersecting) {\n      // If the current browser supports the intersection\n      // observer api, the image is not observable, and\n      // the eager prop isn't being used, do not load\n      if (hasIntersect && !isIntersecting && !this.eager) return;\n\n      if (this.normalisedSrc.lazySrc) {\n        const lazyImg = new Image();\n        lazyImg.src = this.normalisedSrc.lazySrc;\n        this.pollForSize(lazyImg, null);\n      }\n      /* istanbul ignore else */\n\n\n      if (this.normalisedSrc.src) this.loadImage();\n    },\n\n    onLoad() {\n      this.getSrc();\n      this.isLoading = false;\n      this.$emit('load', this.src);\n\n      if (this.image && (this.normalisedSrc.src.endsWith('.svg') || this.normalisedSrc.src.startsWith('data:image/svg+xml'))) {\n        if (this.image.naturalHeight && this.image.naturalWidth) {\n          this.naturalWidth = this.image.naturalWidth;\n          this.calculatedAspectRatio = this.image.naturalWidth / this.image.naturalHeight;\n        } else {\n          this.calculatedAspectRatio = 1;\n        }\n      }\n    },\n\n    onError() {\n      this.hasError = true;\n      this.$emit('error', this.src);\n    },\n\n    getSrc() {\n      /* istanbul ignore else */\n      if (this.image) this.currentSrc = this.image.currentSrc || this.image.src;\n    },\n\n    loadImage() {\n      const image = new Image();\n      this.image = image;\n\n      image.onload = () => {\n        /* istanbul ignore if */\n        if (image.decode) {\n          image.decode().catch(err => {\n            consoleWarn(`Failed to decode image, trying to render anyway\\n\\n` + `src: ${this.normalisedSrc.src}` + (err.message ? `\\nOriginal error: ${err.message}` : ''), this);\n          }).then(this.onLoad);\n        } else {\n          this.onLoad();\n        }\n      };\n\n      image.onerror = this.onError;\n      this.hasError = false;\n      this.sizes && (image.sizes = this.sizes);\n      this.normalisedSrc.srcset && (image.srcset = this.normalisedSrc.srcset);\n      image.src = this.normalisedSrc.src;\n      this.$emit('loadstart', this.normalisedSrc.src);\n      this.aspectRatio || this.pollForSize(image);\n      this.getSrc();\n    },\n\n    pollForSize(img, timeout = 100) {\n      const poll = () => {\n        const {\n          naturalHeight,\n          naturalWidth\n        } = img;\n\n        if (naturalHeight || naturalWidth) {\n          this.naturalWidth = naturalWidth;\n          this.calculatedAspectRatio = naturalWidth / naturalHeight;\n        } else if (!img.complete && this.isLoading && !this.hasError && timeout != null) {\n          setTimeout(poll, timeout);\n        }\n      };\n\n      poll();\n    },\n\n    genContent() {\n      const content = VResponsive.options.methods.genContent.call(this);\n\n      if (this.naturalWidth) {\n        this._b(content.data, 'div', {\n          style: {\n            width: `${this.naturalWidth}px`\n          }\n        });\n      }\n\n      return content;\n    },\n\n    __genPlaceholder() {\n      const slot = getSlot(this, 'placeholder');\n\n      if (slot) {\n        const placeholder = this.isLoading ? [this.$createElement('div', {\n          staticClass: 'v-image__placeholder'\n        }, slot)] : [];\n        if (!this.transition) return placeholder[0];\n        return this.$createElement('transition', {\n          props: {\n            appear: true,\n            name: this.transition\n          }\n        }, placeholder);\n      }\n    }\n\n  },\n\n  render(h) {\n    const node = VResponsive.options.render.call(this, h);\n    const data = mergeData(node.data, {\n      staticClass: 'v-image',\n      attrs: {\n        'aria-label': this.alt,\n        role: this.alt ? 'img' : undefined\n      },\n      class: this.themeClasses,\n      // Only load intersect directive if it\n      // will work in the current browser.\n      directives: hasIntersect ? [{\n        name: 'intersect',\n        modifiers: {\n          once: true\n        },\n        value: {\n          handler: this.init,\n          options: this.options\n        }\n      }] : undefined\n    });\n    node.children = [this.__cachedSizer, this.__cachedImage, this.__genPlaceholder(), this.genContent()];\n    return h(node.tag, data, node.children);\n  }\n\n});\n//# sourceMappingURL=VImg.js.map","// Styles\nimport \"../../../src/components/VToolbar/VToolbar.sass\"; // Extensions\n\nimport VSheet from '../VSheet/VSheet'; // Components\n\nimport VImg from '../VImg/VImg'; // Utilities\n\nimport { convertToUnit, getSlot } from '../../util/helpers';\nimport { breaking } from '../../util/console';\n/* @vue/component */\n\nexport default VSheet.extend({\n  name: 'v-toolbar',\n  props: {\n    absolute: Boolean,\n    bottom: Boolean,\n    collapse: Boolean,\n    dense: Boolean,\n    extended: Boolean,\n    extensionHeight: {\n      default: 48,\n      type: [Number, String]\n    },\n    flat: Boolean,\n    floating: Boolean,\n    prominent: Boolean,\n    short: Boolean,\n    src: {\n      type: [String, Object],\n      default: ''\n    },\n    tag: {\n      type: String,\n      default: 'header'\n    }\n  },\n  data: () => ({\n    isExtended: false\n  }),\n  computed: {\n    computedHeight() {\n      const height = this.computedContentHeight;\n      if (!this.isExtended) return height;\n      const extensionHeight = parseInt(this.extensionHeight);\n      return this.isCollapsed ? height : height + (!isNaN(extensionHeight) ? extensionHeight : 0);\n    },\n\n    computedContentHeight() {\n      if (this.height) return parseInt(this.height);\n      if (this.isProminent && this.dense) return 96;\n      if (this.isProminent && this.short) return 112;\n      if (this.isProminent) return 128;\n      if (this.dense) return 48;\n      if (this.short || this.$vuetify.breakpoint.smAndDown) return 56;\n      return 64;\n    },\n\n    classes() {\n      return { ...VSheet.options.computed.classes.call(this),\n        'v-toolbar': true,\n        'v-toolbar--absolute': this.absolute,\n        'v-toolbar--bottom': this.bottom,\n        'v-toolbar--collapse': this.collapse,\n        'v-toolbar--collapsed': this.isCollapsed,\n        'v-toolbar--dense': this.dense,\n        'v-toolbar--extended': this.isExtended,\n        'v-toolbar--flat': this.flat,\n        'v-toolbar--floating': this.floating,\n        'v-toolbar--prominent': this.isProminent\n      };\n    },\n\n    isCollapsed() {\n      return this.collapse;\n    },\n\n    isProminent() {\n      return this.prominent;\n    },\n\n    styles() {\n      return { ...this.measurableStyles,\n        height: convertToUnit(this.computedHeight)\n      };\n    }\n\n  },\n\n  created() {\n    const breakingProps = [['app', '<v-app-bar app>'], ['manual-scroll', '<v-app-bar :value=\"false\">'], ['clipped-left', '<v-app-bar clipped-left>'], ['clipped-right', '<v-app-bar clipped-right>'], ['inverted-scroll', '<v-app-bar inverted-scroll>'], ['scroll-off-screen', '<v-app-bar scroll-off-screen>'], ['scroll-target', '<v-app-bar scroll-target>'], ['scroll-threshold', '<v-app-bar scroll-threshold>'], ['card', '<v-app-bar flat>']];\n    /* istanbul ignore next */\n\n    breakingProps.forEach(([original, replacement]) => {\n      if (this.$attrs.hasOwnProperty(original)) breaking(original, replacement, this);\n    });\n  },\n\n  methods: {\n    genBackground() {\n      const props = {\n        height: convertToUnit(this.computedHeight),\n        src: this.src\n      };\n      const image = this.$scopedSlots.img ? this.$scopedSlots.img({\n        props\n      }) : this.$createElement(VImg, {\n        props\n      });\n      return this.$createElement('div', {\n        staticClass: 'v-toolbar__image'\n      }, [image]);\n    },\n\n    genContent() {\n      return this.$createElement('div', {\n        staticClass: 'v-toolbar__content',\n        style: {\n          height: convertToUnit(this.computedContentHeight)\n        }\n      }, getSlot(this));\n    },\n\n    genExtension() {\n      return this.$createElement('div', {\n        staticClass: 'v-toolbar__extension',\n        style: {\n          height: convertToUnit(this.extensionHeight)\n        }\n      }, getSlot(this, 'extension'));\n    }\n\n  },\n\n  render(h) {\n    this.isExtended = this.extended || !!this.$scopedSlots.extension;\n    const children = [this.genContent()];\n    const data = this.setBackgroundColor(this.color, {\n      class: this.classes,\n      style: this.styles,\n      on: this.$listeners\n    });\n    if (this.isExtended) children.push(this.genExtension());\n    if (this.src || this.$scopedSlots.img) children.unshift(this.genBackground());\n    return h(this.tag, data, children);\n  }\n\n});\n//# sourceMappingURL=VToolbar.js.map","function inserted(el, binding, vnode) {\n  const {\n    self = false\n  } = binding.modifiers || {};\n  const value = binding.value;\n  const options = typeof value === 'object' && value.options || {\n    passive: true\n  };\n  const handler = typeof value === 'function' || 'handleEvent' in value ? value : value.handler;\n  const target = self ? el : binding.arg ? document.querySelector(binding.arg) : window;\n  if (!target) return;\n  target.addEventListener('scroll', handler, options);\n  el._onScroll = Object(el._onScroll);\n  el._onScroll[vnode.context._uid] = {\n    handler,\n    options,\n    // Don't reference self\n    target: self ? undefined : target\n  };\n}\n\nfunction unbind(el, binding, vnode) {\n  var _a;\n\n  if (!((_a = el._onScroll) === null || _a === void 0 ? void 0 : _a[vnode.context._uid])) return;\n  const {\n    handler,\n    options,\n    target = el\n  } = el._onScroll[vnode.context._uid];\n  target.removeEventListener('scroll', handler, options);\n  delete el._onScroll[vnode.context._uid];\n}\n\nexport const Scroll = {\n  inserted,\n  unbind\n};\nexport default Scroll;\n//# sourceMappingURL=index.js.map","import { factory as PositionableFactory } from '../positionable'; // Util\n\nimport mixins from '../../util/mixins';\nexport default function applicationable(value, events = []) {\n  /* @vue/component */\n  return mixins(PositionableFactory(['absolute', 'fixed'])).extend({\n    name: 'applicationable',\n    props: {\n      app: Boolean\n    },\n    computed: {\n      applicationProperty() {\n        return value;\n      }\n\n    },\n    watch: {\n      // If previous value was app\n      // reset the provided prop\n      app(x, prev) {\n        prev ? this.removeApplication(true) : this.callUpdate();\n      },\n\n      applicationProperty(newVal, oldVal) {\n        this.$vuetify.application.unregister(this._uid, oldVal);\n      }\n\n    },\n\n    activated() {\n      this.callUpdate();\n    },\n\n    created() {\n      for (let i = 0, length = events.length; i < length; i++) {\n        this.$watch(events[i], this.callUpdate);\n      }\n\n      this.callUpdate();\n    },\n\n    mounted() {\n      this.callUpdate();\n    },\n\n    deactivated() {\n      this.removeApplication();\n    },\n\n    destroyed() {\n      this.removeApplication();\n    },\n\n    methods: {\n      callUpdate() {\n        if (!this.app) return;\n        this.$vuetify.application.register(this._uid, this.applicationProperty, this.updateApplication());\n      },\n\n      removeApplication(force = false) {\n        if (!force && !this.app) return;\n        this.$vuetify.application.unregister(this._uid, this.applicationProperty);\n      },\n\n      updateApplication: () => 0\n    }\n  });\n}\n//# sourceMappingURL=index.js.map","import { keys } from '../../util/helpers';\n\nconst handleGesture = wrapper => {\n  const {\n    touchstartX,\n    touchendX,\n    touchstartY,\n    touchendY\n  } = wrapper;\n  const dirRatio = 0.5;\n  const minDistance = 16;\n  wrapper.offsetX = touchendX - touchstartX;\n  wrapper.offsetY = touchendY - touchstartY;\n\n  if (Math.abs(wrapper.offsetY) < dirRatio * Math.abs(wrapper.offsetX)) {\n    wrapper.left && touchendX < touchstartX - minDistance && wrapper.left(wrapper);\n    wrapper.right && touchendX > touchstartX + minDistance && wrapper.right(wrapper);\n  }\n\n  if (Math.abs(wrapper.offsetX) < dirRatio * Math.abs(wrapper.offsetY)) {\n    wrapper.up && touchendY < touchstartY - minDistance && wrapper.up(wrapper);\n    wrapper.down && touchendY > touchstartY + minDistance && wrapper.down(wrapper);\n  }\n};\n\nfunction touchstart(event, wrapper) {\n  const touch = event.changedTouches[0];\n  wrapper.touchstartX = touch.clientX;\n  wrapper.touchstartY = touch.clientY;\n  wrapper.start && wrapper.start(Object.assign(event, wrapper));\n}\n\nfunction touchend(event, wrapper) {\n  const touch = event.changedTouches[0];\n  wrapper.touchendX = touch.clientX;\n  wrapper.touchendY = touch.clientY;\n  wrapper.end && wrapper.end(Object.assign(event, wrapper));\n  handleGesture(wrapper);\n}\n\nfunction touchmove(event, wrapper) {\n  const touch = event.changedTouches[0];\n  wrapper.touchmoveX = touch.clientX;\n  wrapper.touchmoveY = touch.clientY;\n  wrapper.move && wrapper.move(Object.assign(event, wrapper));\n}\n\nfunction createHandlers(value) {\n  const wrapper = {\n    touchstartX: 0,\n    touchstartY: 0,\n    touchendX: 0,\n    touchendY: 0,\n    touchmoveX: 0,\n    touchmoveY: 0,\n    offsetX: 0,\n    offsetY: 0,\n    left: value.left,\n    right: value.right,\n    up: value.up,\n    down: value.down,\n    start: value.start,\n    move: value.move,\n    end: value.end\n  };\n  return {\n    touchstart: e => touchstart(e, wrapper),\n    touchend: e => touchend(e, wrapper),\n    touchmove: e => touchmove(e, wrapper)\n  };\n}\n\nfunction inserted(el, binding, vnode) {\n  const value = binding.value;\n  const target = value.parent ? el.parentElement : el;\n  const options = value.options || {\n    passive: true\n  }; // Needed to pass unit tests\n\n  if (!target) return;\n  const handlers = createHandlers(binding.value);\n  target._touchHandlers = Object(target._touchHandlers);\n  target._touchHandlers[vnode.context._uid] = handlers;\n  keys(handlers).forEach(eventName => {\n    target.addEventListener(eventName, handlers[eventName], options);\n  });\n}\n\nfunction unbind(el, binding, vnode) {\n  const target = binding.value.parent ? el.parentElement : el;\n  if (!target || !target._touchHandlers) return;\n  const handlers = target._touchHandlers[vnode.context._uid];\n  keys(handlers).forEach(eventName => {\n    target.removeEventListener(eventName, handlers[eventName]);\n  });\n  delete target._touchHandlers[vnode.context._uid];\n}\n\nexport const Touch = {\n  inserted,\n  unbind\n};\nexport default Touch;\n//# sourceMappingURL=index.js.map","// Directives\nimport { Scroll } from '../../directives'; // Utilities\n\nimport { consoleWarn } from '../../util/console'; // Types\n\nimport Vue from 'vue';\n/**\n * Scrollable\n *\n * Used for monitoring scrolling and\n * invoking functions based upon\n * scrolling thresholds being\n * met.\n */\n\n/* @vue/component */\n\nexport default Vue.extend({\n  name: 'scrollable',\n  directives: {\n    Scroll\n  },\n  props: {\n    scrollTarget: String,\n    scrollThreshold: [String, Number]\n  },\n  data: () => ({\n    currentScroll: 0,\n    currentThreshold: 0,\n    isActive: false,\n    isScrollingUp: false,\n    previousScroll: 0,\n    savedScroll: 0,\n    target: null\n  }),\n  computed: {\n    /**\n     * A computed property that returns\n     * whether scrolling features are\n     * enabled or disabled\n     */\n    canScroll() {\n      return typeof window !== 'undefined';\n    },\n\n    /**\n     * The threshold that must be met before\n     * thresholdMet function is invoked\n     */\n    computedScrollThreshold() {\n      return this.scrollThreshold ? Number(this.scrollThreshold) : 300;\n    }\n\n  },\n  watch: {\n    isScrollingUp() {\n      this.savedScroll = this.savedScroll || this.currentScroll;\n    },\n\n    isActive() {\n      this.savedScroll = 0;\n    }\n\n  },\n\n  mounted() {\n    if (this.scrollTarget) {\n      this.target = document.querySelector(this.scrollTarget);\n\n      if (!this.target) {\n        consoleWarn(`Unable to locate element with identifier ${this.scrollTarget}`, this);\n      }\n    }\n  },\n\n  methods: {\n    onScroll() {\n      if (!this.canScroll) return;\n      this.previousScroll = this.currentScroll;\n      this.currentScroll = this.target ? this.target.scrollTop : window.pageYOffset;\n      this.isScrollingUp = this.currentScroll < this.previousScroll;\n      this.currentThreshold = Math.abs(this.currentScroll - this.computedScrollThreshold);\n      this.$nextTick(() => {\n        if (Math.abs(this.currentScroll - this.savedScroll) > this.computedScrollThreshold) this.thresholdMet();\n      });\n    },\n\n    /**\n     * The method invoked when\n     * scrolling in any direction\n     * has exceeded the threshold\n     */\n    thresholdMet() {}\n\n  }\n});\n//# sourceMappingURL=index.js.map","import Vue from 'vue';\n/**\n * SSRBootable\n *\n * @mixin\n *\n * Used in layout components (drawer, toolbar, content)\n * to avoid an entry animation when using SSR\n */\n\nexport default Vue.extend({\n  name: 'ssr-bootable',\n  data: () => ({\n    isBooted: false\n  }),\n\n  mounted() {\n    // Use setAttribute instead of dataset\n    // because dataset does not work well\n    // with unit tests\n    window.requestAnimationFrame(() => {\n      this.$el.setAttribute('data-booted', 'true');\n      this.isBooted = true;\n    });\n  }\n\n});\n//# sourceMappingURL=index.js.map","// Styles\nimport \"../../../src/components/VAppBar/VAppBar.sass\"; // Extensions\n\nimport VToolbar from '../VToolbar/VToolbar'; // Directives\n\nimport Scroll from '../../directives/scroll'; // Mixins\n\nimport Applicationable from '../../mixins/applicationable';\nimport Scrollable from '../../mixins/scrollable';\nimport SSRBootable from '../../mixins/ssr-bootable';\nimport Toggleable from '../../mixins/toggleable'; // Utilities\n\nimport { convertToUnit } from '../../util/helpers';\nimport mixins from '../../util/mixins';\nconst baseMixins = mixins(VToolbar, Scrollable, SSRBootable, Toggleable, Applicationable('top', ['clippedLeft', 'clippedRight', 'computedHeight', 'invertedScroll', 'isExtended', 'isProminent', 'value']));\n/* @vue/component */\n\nexport default baseMixins.extend({\n  name: 'v-app-bar',\n  directives: {\n    Scroll\n  },\n\n  provide() {\n    return {\n      VAppBar: this\n    };\n  },\n\n  props: {\n    clippedLeft: Boolean,\n    clippedRight: Boolean,\n    collapseOnScroll: Boolean,\n    elevateOnScroll: Boolean,\n    fadeImgOnScroll: Boolean,\n    hideOnScroll: Boolean,\n    invertedScroll: Boolean,\n    scrollOffScreen: Boolean,\n    shrinkOnScroll: Boolean,\n    value: {\n      type: Boolean,\n      default: true\n    }\n  },\n\n  data() {\n    return {\n      isActive: this.value\n    };\n  },\n\n  computed: {\n    applicationProperty() {\n      return !this.bottom ? 'top' : 'bottom';\n    },\n\n    canScroll() {\n      return Scrollable.options.computed.canScroll.call(this) && (this.invertedScroll || this.elevateOnScroll || this.hideOnScroll || this.collapseOnScroll || this.isBooted || // If falsy, user has provided an\n      // explicit value which should\n      // overwrite anything we do\n      !this.value);\n    },\n\n    classes() {\n      return { ...VToolbar.options.computed.classes.call(this),\n        'v-toolbar--collapse': this.collapse || this.collapseOnScroll,\n        'v-app-bar': true,\n        'v-app-bar--clipped': this.clippedLeft || this.clippedRight,\n        'v-app-bar--fade-img-on-scroll': this.fadeImgOnScroll,\n        'v-app-bar--elevate-on-scroll': this.elevateOnScroll,\n        'v-app-bar--fixed': !this.absolute && (this.app || this.fixed),\n        'v-app-bar--hide-shadow': this.hideShadow,\n        'v-app-bar--is-scrolled': this.currentScroll > 0,\n        'v-app-bar--shrink-on-scroll': this.shrinkOnScroll\n      };\n    },\n\n    scrollRatio() {\n      const threshold = this.computedScrollThreshold;\n      return Math.max((threshold - this.currentScroll) / threshold, 0);\n    },\n\n    computedContentHeight() {\n      if (!this.shrinkOnScroll) return VToolbar.options.computed.computedContentHeight.call(this);\n      const min = this.dense ? 48 : 56;\n      const max = this.computedOriginalHeight;\n      return min + (max - min) * this.scrollRatio;\n    },\n\n    computedFontSize() {\n      if (!this.isProminent) return undefined;\n      const min = 1.25;\n      const max = 1.5;\n      return min + (max - min) * this.scrollRatio;\n    },\n\n    computedLeft() {\n      if (!this.app || this.clippedLeft) return 0;\n      return this.$vuetify.application.left;\n    },\n\n    computedMarginTop() {\n      if (!this.app) return 0;\n      return this.$vuetify.application.bar;\n    },\n\n    computedOpacity() {\n      if (!this.fadeImgOnScroll) return undefined;\n      return this.scrollRatio;\n    },\n\n    computedOriginalHeight() {\n      let height = VToolbar.options.computed.computedContentHeight.call(this);\n      if (this.isExtended) height += parseInt(this.extensionHeight);\n      return height;\n    },\n\n    computedRight() {\n      if (!this.app || this.clippedRight) return 0;\n      return this.$vuetify.application.right;\n    },\n\n    computedScrollThreshold() {\n      if (this.scrollThreshold) return Number(this.scrollThreshold);\n      return this.computedOriginalHeight - (this.dense ? 48 : 56);\n    },\n\n    computedTransform() {\n      if (!this.canScroll || this.elevateOnScroll && this.currentScroll === 0 && this.isActive) return 0;\n      if (this.isActive) return 0;\n      const scrollOffScreen = this.scrollOffScreen ? this.computedHeight : this.computedContentHeight;\n      return this.bottom ? scrollOffScreen : -scrollOffScreen;\n    },\n\n    hideShadow() {\n      if (this.elevateOnScroll && this.isExtended) {\n        return this.currentScroll < this.computedScrollThreshold;\n      }\n\n      if (this.elevateOnScroll) {\n        return this.currentScroll === 0 || this.computedTransform < 0;\n      }\n\n      return (!this.isExtended || this.scrollOffScreen) && this.computedTransform !== 0;\n    },\n\n    isCollapsed() {\n      if (!this.collapseOnScroll) {\n        return VToolbar.options.computed.isCollapsed.call(this);\n      }\n\n      return this.currentScroll > 0;\n    },\n\n    isProminent() {\n      return VToolbar.options.computed.isProminent.call(this) || this.shrinkOnScroll;\n    },\n\n    styles() {\n      return { ...VToolbar.options.computed.styles.call(this),\n        fontSize: convertToUnit(this.computedFontSize, 'rem'),\n        marginTop: convertToUnit(this.computedMarginTop),\n        transform: `translateY(${convertToUnit(this.computedTransform)})`,\n        left: convertToUnit(this.computedLeft),\n        right: convertToUnit(this.computedRight)\n      };\n    }\n\n  },\n  watch: {\n    canScroll: 'onScroll',\n\n    computedTransform() {\n      // Normally we do not want the v-app-bar\n      // to update the application top value\n      // to avoid screen jump. However, in\n      // this situation, we must so that\n      // the clipped drawer can update\n      // its top value when scrolled\n      if (!this.canScroll || !this.clippedLeft && !this.clippedRight) return;\n      this.callUpdate();\n    },\n\n    invertedScroll(val) {\n      this.isActive = !val || this.currentScroll !== 0;\n    },\n\n    hideOnScroll(val) {\n      this.isActive = !val || this.currentScroll < this.computedScrollThreshold;\n    }\n\n  },\n\n  created() {\n    if (this.invertedScroll) this.isActive = false;\n  },\n\n  methods: {\n    genBackground() {\n      const render = VToolbar.options.methods.genBackground.call(this);\n      render.data = this._b(render.data || {}, render.tag, {\n        style: {\n          opacity: this.computedOpacity\n        }\n      });\n      return render;\n    },\n\n    updateApplication() {\n      return this.invertedScroll ? 0 : this.computedHeight + this.computedTransform;\n    },\n\n    thresholdMet() {\n      if (this.invertedScroll) {\n        this.isActive = this.currentScroll > this.computedScrollThreshold;\n        return;\n      }\n\n      if (this.hideOnScroll) {\n        this.isActive = this.isScrollingUp || this.currentScroll < this.computedScrollThreshold;\n      }\n\n      if (this.currentThreshold < this.computedScrollThreshold) return;\n      this.savedScroll = this.currentScroll;\n    }\n\n  },\n\n  render(h) {\n    const render = VToolbar.options.render.call(this, h);\n    render.data = render.data || {};\n\n    if (this.canScroll) {\n      render.data.directives = render.data.directives || [];\n      render.data.directives.push({\n        arg: this.scrollTarget,\n        name: 'scroll',\n        value: this.onScroll\n      });\n    }\n\n    return render;\n  }\n\n});\n//# sourceMappingURL=VAppBar.js.map","import Vue from 'vue';\nexport default Vue.extend({\n  name: 'transitionable',\n  props: {\n    mode: String,\n    origin: String,\n    transition: String\n  }\n});\n//# sourceMappingURL=index.js.map","// Styles\nimport \"../../../src/components/VAlert/VAlert.sass\"; // Extensions\n\nimport VSheet from '../VSheet'; // Components\n\nimport VBtn from '../VBtn';\nimport VIcon from '../VIcon'; // Mixins\n\nimport Toggleable from '../../mixins/toggleable';\nimport Themeable from '../../mixins/themeable';\nimport Transitionable from '../../mixins/transitionable'; // Utilities\n\nimport mixins from '../../util/mixins';\nimport { breaking } from '../../util/console';\nimport { getSlot } from '../../util/helpers';\n/* @vue/component */\n\nexport default mixins(VSheet, Toggleable, Transitionable).extend({\n  name: 'v-alert',\n  props: {\n    border: {\n      type: String,\n\n      validator(val) {\n        return ['top', 'right', 'bottom', 'left'].includes(val);\n      }\n\n    },\n    closeLabel: {\n      type: String,\n      default: '$vuetify.close'\n    },\n    coloredBorder: Boolean,\n    dense: Boolean,\n    dismissible: Boolean,\n    closeIcon: {\n      type: String,\n      default: '$cancel'\n    },\n    icon: {\n      default: '',\n      type: [Boolean, String],\n\n      validator(val) {\n        return typeof val === 'string' || val === false;\n      }\n\n    },\n    outlined: Boolean,\n    prominent: Boolean,\n    text: Boolean,\n    type: {\n      type: String,\n\n      validator(val) {\n        return ['info', 'error', 'success', 'warning'].includes(val);\n      }\n\n    },\n    value: {\n      type: Boolean,\n      default: true\n    }\n  },\n  computed: {\n    __cachedBorder() {\n      if (!this.border) return null;\n      let data = {\n        staticClass: 'v-alert__border',\n        class: {\n          [`v-alert__border--${this.border}`]: true\n        }\n      };\n\n      if (this.coloredBorder) {\n        data = this.setBackgroundColor(this.computedColor, data);\n        data.class['v-alert__border--has-color'] = true;\n      }\n\n      return this.$createElement('div', data);\n    },\n\n    __cachedDismissible() {\n      if (!this.dismissible) return null;\n      const color = this.iconColor;\n      return this.$createElement(VBtn, {\n        staticClass: 'v-alert__dismissible',\n        props: {\n          color,\n          icon: true,\n          small: true\n        },\n        attrs: {\n          'aria-label': this.$vuetify.lang.t(this.closeLabel)\n        },\n        on: {\n          click: () => this.isActive = false\n        }\n      }, [this.$createElement(VIcon, {\n        props: {\n          color\n        }\n      }, this.closeIcon)]);\n    },\n\n    __cachedIcon() {\n      if (!this.computedIcon) return null;\n      return this.$createElement(VIcon, {\n        staticClass: 'v-alert__icon',\n        props: {\n          color: this.iconColor\n        }\n      }, this.computedIcon);\n    },\n\n    classes() {\n      const classes = { ...VSheet.options.computed.classes.call(this),\n        'v-alert--border': Boolean(this.border),\n        'v-alert--dense': this.dense,\n        'v-alert--outlined': this.outlined,\n        'v-alert--prominent': this.prominent,\n        'v-alert--text': this.text\n      };\n\n      if (this.border) {\n        classes[`v-alert--border-${this.border}`] = true;\n      }\n\n      return classes;\n    },\n\n    computedColor() {\n      return this.color || this.type;\n    },\n\n    computedIcon() {\n      if (this.icon === false) return false;\n      if (typeof this.icon === 'string' && this.icon) return this.icon;\n      if (!['error', 'info', 'success', 'warning'].includes(this.type)) return false;\n      return `$${this.type}`;\n    },\n\n    hasColoredIcon() {\n      return this.hasText || Boolean(this.border) && this.coloredBorder;\n    },\n\n    hasText() {\n      return this.text || this.outlined;\n    },\n\n    iconColor() {\n      return this.hasColoredIcon ? this.computedColor : undefined;\n    },\n\n    isDark() {\n      if (this.type && !this.coloredBorder && !this.outlined) return true;\n      return Themeable.options.computed.isDark.call(this);\n    }\n\n  },\n\n  created() {\n    /* istanbul ignore next */\n    if (this.$attrs.hasOwnProperty('outline')) {\n      breaking('outline', 'outlined', this);\n    }\n  },\n\n  methods: {\n    genWrapper() {\n      const children = [getSlot(this, 'prepend') || this.__cachedIcon, this.genContent(), this.__cachedBorder, getSlot(this, 'append'), this.$scopedSlots.close ? this.$scopedSlots.close({\n        toggle: this.toggle\n      }) : this.__cachedDismissible];\n      const data = {\n        staticClass: 'v-alert__wrapper'\n      };\n      return this.$createElement('div', data, children);\n    },\n\n    genContent() {\n      return this.$createElement('div', {\n        staticClass: 'v-alert__content'\n      }, getSlot(this));\n    },\n\n    genAlert() {\n      let data = {\n        staticClass: 'v-alert',\n        attrs: {\n          role: 'alert'\n        },\n        on: this.listeners$,\n        class: this.classes,\n        style: this.styles,\n        directives: [{\n          name: 'show',\n          value: this.isActive\n        }]\n      };\n\n      if (!this.coloredBorder) {\n        const setColor = this.hasText ? this.setTextColor : this.setBackgroundColor;\n        data = setColor(this.computedColor, data);\n      }\n\n      return this.$createElement('div', data, [this.genWrapper()]);\n    },\n\n    /** @public */\n    toggle() {\n      this.isActive = !this.isActive;\n    }\n\n  },\n\n  render(h) {\n    const render = this.genAlert();\n    if (!this.transition) return render;\n    return h('transition', {\n      props: {\n        name: this.transition,\n        origin: this.origin,\n        mode: this.mode\n      }\n    }, [render]);\n  }\n\n});\n//# sourceMappingURL=VAlert.js.map","import Vue from 'vue';\nimport { deepEqual } from '../../util/helpers';\nexport default Vue.extend({\n  name: 'comparable',\n  props: {\n    valueComparator: {\n      type: Function,\n      default: deepEqual\n    }\n  }\n});\n//# sourceMappingURL=index.js.map","import \"../../../src/components/VAvatar/VAvatar.sass\"; // Mixins\n\nimport Colorable from '../../mixins/colorable';\nimport Measurable from '../../mixins/measurable';\nimport Roundable from '../../mixins/roundable'; // Utilities\n\nimport { convertToUnit, getSlot } from '../../util/helpers';\nimport mixins from '../../util/mixins';\nexport default mixins(Colorable, Measurable, Roundable).extend({\n  name: 'v-avatar',\n  props: {\n    left: Boolean,\n    right: Boolean,\n    size: {\n      type: [Number, String],\n      default: 48\n    }\n  },\n  computed: {\n    classes() {\n      return {\n        'v-avatar--left': this.left,\n        'v-avatar--right': this.right,\n        ...this.roundedClasses\n      };\n    },\n\n    styles() {\n      return {\n        height: convertToUnit(this.size),\n        minWidth: convertToUnit(this.size),\n        width: convertToUnit(this.size),\n        ...this.measurableStyles\n      };\n    }\n\n  },\n\n  render(h) {\n    const data = {\n      staticClass: 'v-avatar',\n      class: this.classes,\n      style: this.styles,\n      on: this.$listeners\n    };\n    return h('div', this.setBackgroundColor(this.color, data), getSlot(this));\n  }\n\n});\n//# sourceMappingURL=VAvatar.js.map","// Styles\nimport \"../../../src/components/VLabel/VLabel.sass\"; // Mixins\n\nimport Colorable from '../../mixins/colorable';\nimport Themeable, { functionalThemeClasses } from '../../mixins/themeable';\nimport mixins from '../../util/mixins'; // Helpers\n\nimport { convertToUnit } from '../../util/helpers';\nimport mergeData from '../../util/mergeData';\n/* @vue/component */\n\nexport default mixins(Themeable).extend({\n  name: 'v-label',\n  functional: true,\n  props: {\n    absolute: Boolean,\n    color: {\n      type: String,\n      default: 'primary'\n    },\n    disabled: Boolean,\n    focused: Boolean,\n    for: String,\n    left: {\n      type: [Number, String],\n      default: 0\n    },\n    right: {\n      type: [Number, String],\n      default: 'auto'\n    },\n    value: Boolean\n  },\n\n  render(h, ctx) {\n    const {\n      children,\n      listeners,\n      props,\n      data\n    } = ctx;\n    const newData = mergeData({\n      staticClass: 'v-label',\n      class: {\n        'v-label--active': props.value,\n        'v-label--is-disabled': props.disabled,\n        ...functionalThemeClasses(ctx)\n      },\n      attrs: {\n        for: props.for,\n        'aria-hidden': !props.for\n      },\n      on: listeners,\n      style: {\n        left: convertToUnit(props.left),\n        right: convertToUnit(props.right),\n        position: props.absolute ? 'absolute' : 'relative'\n      },\n      ref: 'label'\n    }, data);\n    return h('label', Colorable.options.methods.setTextColor(props.focused && props.color, newData), children);\n  }\n\n});\n//# sourceMappingURL=VLabel.js.map","// Styles\nimport \"../../../src/components/VMessages/VMessages.sass\"; // Mixins\n\nimport Colorable from '../../mixins/colorable';\nimport Themeable from '../../mixins/themeable';\nimport mixins from '../../util/mixins'; // Utilities\n\nimport { getSlot } from '../../util/helpers';\n/* @vue/component */\n\nexport default mixins(Colorable, Themeable).extend({\n  name: 'v-messages',\n  props: {\n    value: {\n      type: Array,\n      default: () => []\n    }\n  },\n  methods: {\n    genChildren() {\n      return this.$createElement('transition-group', {\n        staticClass: 'v-messages__wrapper',\n        attrs: {\n          name: 'message-transition',\n          tag: 'div'\n        }\n      }, this.value.map(this.genMessage));\n    },\n\n    genMessage(message, key) {\n      return this.$createElement('div', {\n        staticClass: 'v-messages__message',\n        key\n      }, getSlot(this, 'default', {\n        message,\n        key\n      }) || [message]);\n    }\n\n  },\n\n  render(h) {\n    return h('div', this.setTextColor(this.color, {\n      staticClass: 'v-messages',\n      class: this.themeClasses\n    }), [this.genChildren()]);\n  }\n\n});\n//# sourceMappingURL=VMessages.js.map","// Mixins\nimport Colorable from '../colorable';\nimport Themeable from '../themeable';\nimport { inject as RegistrableInject } from '../registrable'; // Utilities\n\nimport { deepEqual } from '../../util/helpers';\nimport { consoleError } from '../../util/console';\nimport mixins from '../../util/mixins';\nconst baseMixins = mixins(Colorable, RegistrableInject('form'), Themeable);\n/* @vue/component */\n\nexport default baseMixins.extend({\n  name: 'validatable',\n  props: {\n    disabled: {\n      type: Boolean,\n      default: null\n    },\n    error: Boolean,\n    errorCount: {\n      type: [Number, String],\n      default: 1\n    },\n    errorMessages: {\n      type: [String, Array],\n      default: () => []\n    },\n    messages: {\n      type: [String, Array],\n      default: () => []\n    },\n    readonly: {\n      type: Boolean,\n      default: null\n    },\n    rules: {\n      type: Array,\n      default: () => []\n    },\n    success: Boolean,\n    successMessages: {\n      type: [String, Array],\n      default: () => []\n    },\n    validateOnBlur: Boolean,\n    value: {\n      required: false\n    }\n  },\n\n  data() {\n    return {\n      errorBucket: [],\n      hasColor: false,\n      hasFocused: false,\n      hasInput: false,\n      isFocused: false,\n      isResetting: false,\n      lazyValue: this.value,\n      valid: false\n    };\n  },\n\n  computed: {\n    computedColor() {\n      if (this.isDisabled) return undefined;\n      if (this.color) return this.color; // It's assumed that if the input is on a\n      // dark background, the user will want to\n      // have a white color. If the entire app\n      // is setup to be dark, then they will\n      // like want to use their primary color\n\n      if (this.isDark && !this.appIsDark) return 'white';else return 'primary';\n    },\n\n    hasError() {\n      return this.internalErrorMessages.length > 0 || this.errorBucket.length > 0 || this.error;\n    },\n\n    // TODO: Add logic that allows the user to enable based\n    // upon a good validation\n    hasSuccess() {\n      return this.internalSuccessMessages.length > 0 || this.success;\n    },\n\n    externalError() {\n      return this.internalErrorMessages.length > 0 || this.error;\n    },\n\n    hasMessages() {\n      return this.validationTarget.length > 0;\n    },\n\n    hasState() {\n      if (this.isDisabled) return false;\n      return this.hasSuccess || this.shouldValidate && this.hasError;\n    },\n\n    internalErrorMessages() {\n      return this.genInternalMessages(this.errorMessages);\n    },\n\n    internalMessages() {\n      return this.genInternalMessages(this.messages);\n    },\n\n    internalSuccessMessages() {\n      return this.genInternalMessages(this.successMessages);\n    },\n\n    internalValue: {\n      get() {\n        return this.lazyValue;\n      },\n\n      set(val) {\n        this.lazyValue = val;\n        this.$emit('input', val);\n      }\n\n    },\n\n    isDisabled() {\n      var _a;\n\n      return (_a = this.disabled) !== null && _a !== void 0 ? _a : !!this.form && this.form.disabled;\n    },\n\n    isInteractive() {\n      return !this.isDisabled && !this.isReadonly;\n    },\n\n    isReadonly() {\n      var _a;\n\n      return (_a = this.readonly) !== null && _a !== void 0 ? _a : !!this.form && this.form.readonly;\n    },\n\n    shouldValidate() {\n      if (this.externalError) return true;\n      if (this.isResetting) return false;\n      return this.validateOnBlur ? this.hasFocused && !this.isFocused : this.hasInput || this.hasFocused;\n    },\n\n    validations() {\n      return this.validationTarget.slice(0, Number(this.errorCount));\n    },\n\n    validationState() {\n      if (this.isDisabled) return undefined;\n      if (this.hasError && this.shouldValidate) return 'error';\n      if (this.hasSuccess) return 'success';\n      if (this.hasColor) return this.computedColor;\n      return undefined;\n    },\n\n    validationTarget() {\n      if (this.internalErrorMessages.length > 0) {\n        return this.internalErrorMessages;\n      } else if (this.successMessages && this.successMessages.length > 0) {\n        return this.internalSuccessMessages;\n      } else if (this.messages && this.messages.length > 0) {\n        return this.internalMessages;\n      } else if (this.shouldValidate) {\n        return this.errorBucket;\n      } else return [];\n    }\n\n  },\n  watch: {\n    rules: {\n      handler(newVal, oldVal) {\n        if (deepEqual(newVal, oldVal)) return;\n        this.validate();\n      },\n\n      deep: true\n    },\n\n    internalValue() {\n      // If it's the first time we're setting input,\n      // mark it with hasInput\n      this.hasInput = true;\n      this.validateOnBlur || this.$nextTick(this.validate);\n    },\n\n    isFocused(val) {\n      // Should not check validation\n      // if disabled\n      if (!val && !this.isDisabled) {\n        this.hasFocused = true;\n        this.validateOnBlur && this.$nextTick(this.validate);\n      }\n    },\n\n    isResetting() {\n      setTimeout(() => {\n        this.hasInput = false;\n        this.hasFocused = false;\n        this.isResetting = false;\n        this.validate();\n      }, 0);\n    },\n\n    hasError(val) {\n      if (this.shouldValidate) {\n        this.$emit('update:error', val);\n      }\n    },\n\n    value(val) {\n      this.lazyValue = val;\n    }\n\n  },\n\n  beforeMount() {\n    this.validate();\n  },\n\n  created() {\n    this.form && this.form.register(this);\n  },\n\n  beforeDestroy() {\n    this.form && this.form.unregister(this);\n  },\n\n  methods: {\n    genInternalMessages(messages) {\n      if (!messages) return [];else if (Array.isArray(messages)) return messages;else return [messages];\n    },\n\n    /** @public */\n    reset() {\n      this.isResetting = true;\n      this.internalValue = Array.isArray(this.internalValue) ? [] : null;\n    },\n\n    /** @public */\n    resetValidation() {\n      this.isResetting = true;\n    },\n\n    /** @public */\n    validate(force = false, value) {\n      const errorBucket = [];\n      value = value || this.internalValue;\n      if (force) this.hasInput = this.hasFocused = true;\n\n      for (let index = 0; index < this.rules.length; index++) {\n        const rule = this.rules[index];\n        const valid = typeof rule === 'function' ? rule(value) : rule;\n\n        if (valid === false || typeof valid === 'string') {\n          errorBucket.push(valid || '');\n        } else if (typeof valid !== 'boolean') {\n          consoleError(`Rules should return a string or boolean, received '${typeof valid}' instead`, this);\n        }\n      }\n\n      this.errorBucket = errorBucket;\n      this.valid = errorBucket.length === 0;\n      return this.valid;\n    }\n\n  }\n});\n//# sourceMappingURL=index.js.map","// Styles\nimport \"../../../src/components/VInput/VInput.sass\"; // Components\n\nimport VIcon from '../VIcon';\nimport VLabel from '../VLabel';\nimport VMessages from '../VMessages'; // Mixins\n\nimport BindsAttrs from '../../mixins/binds-attrs';\nimport Validatable from '../../mixins/validatable'; // Utilities\n\nimport { convertToUnit, getSlot, kebabCase } from '../../util/helpers';\nimport mergeData from '../../util/mergeData';\nimport mixins from '../../util/mixins';\nconst baseMixins = mixins(BindsAttrs, Validatable);\n/* @vue/component */\n\nexport default baseMixins.extend().extend({\n  name: 'v-input',\n  inheritAttrs: false,\n  props: {\n    appendIcon: String,\n    backgroundColor: {\n      type: String,\n      default: ''\n    },\n    dense: Boolean,\n    height: [Number, String],\n    hideDetails: [Boolean, String],\n    hideSpinButtons: Boolean,\n    hint: String,\n    id: String,\n    label: String,\n    loading: Boolean,\n    persistentHint: Boolean,\n    prependIcon: String,\n    value: null\n  },\n\n  data() {\n    return {\n      lazyValue: this.value,\n      hasMouseDown: false\n    };\n  },\n\n  computed: {\n    classes() {\n      return {\n        'v-input--has-state': this.hasState,\n        'v-input--hide-details': !this.showDetails,\n        'v-input--is-label-active': this.isLabelActive,\n        'v-input--is-dirty': this.isDirty,\n        'v-input--is-disabled': this.isDisabled,\n        'v-input--is-focused': this.isFocused,\n        // <v-switch loading>.loading === '' so we can't just cast to boolean\n        'v-input--is-loading': this.loading !== false && this.loading != null,\n        'v-input--is-readonly': this.isReadonly,\n        'v-input--dense': this.dense,\n        'v-input--hide-spin-buttons': this.hideSpinButtons,\n        ...this.themeClasses\n      };\n    },\n\n    computedId() {\n      return this.id || `input-${this._uid}`;\n    },\n\n    hasDetails() {\n      return this.messagesToDisplay.length > 0;\n    },\n\n    hasHint() {\n      return !this.hasMessages && !!this.hint && (this.persistentHint || this.isFocused);\n    },\n\n    hasLabel() {\n      return !!(this.$slots.label || this.label);\n    },\n\n    // Proxy for `lazyValue`\n    // This allows an input\n    // to function without\n    // a provided model\n    internalValue: {\n      get() {\n        return this.lazyValue;\n      },\n\n      set(val) {\n        this.lazyValue = val;\n        this.$emit(this.$_modelEvent, val);\n      }\n\n    },\n\n    isDirty() {\n      return !!this.lazyValue;\n    },\n\n    isLabelActive() {\n      return this.isDirty;\n    },\n\n    messagesToDisplay() {\n      if (this.hasHint) return [this.hint];\n      if (!this.hasMessages) return [];\n      return this.validations.map(validation => {\n        if (typeof validation === 'string') return validation;\n        const validationResult = validation(this.internalValue);\n        return typeof validationResult === 'string' ? validationResult : '';\n      }).filter(message => message !== '');\n    },\n\n    showDetails() {\n      return this.hideDetails === false || this.hideDetails === 'auto' && this.hasDetails;\n    }\n\n  },\n  watch: {\n    value(val) {\n      this.lazyValue = val;\n    }\n\n  },\n\n  beforeCreate() {\n    // v-radio-group needs to emit a different event\n    // https://github.com/vuetifyjs/vuetify/issues/4752\n    this.$_modelEvent = this.$options.model && this.$options.model.event || 'input';\n  },\n\n  methods: {\n    genContent() {\n      return [this.genPrependSlot(), this.genControl(), this.genAppendSlot()];\n    },\n\n    genControl() {\n      return this.$createElement('div', {\n        staticClass: 'v-input__control',\n        attrs: {\n          title: this.attrs$.title\n        }\n      }, [this.genInputSlot(), this.genMessages()]);\n    },\n\n    genDefaultSlot() {\n      return [this.genLabel(), getSlot(this)];\n    },\n\n    genIcon(type, cb, extraData = {}) {\n      var _a;\n\n      const icon = this[`${type}Icon`];\n      const eventName = `click:${kebabCase(type)}`;\n      const hasListener = !!(this.listeners$[eventName] || cb);\n      const localeKey = {\n        prepend: 'prependAction',\n        prependInner: 'prependAction',\n        append: 'appendAction',\n        appendOuter: 'appendAction',\n        clear: 'clear'\n      }[type];\n      const label = hasListener && localeKey ? this.$vuetify.lang.t(`$vuetify.input.${localeKey}`, (_a = this.label) !== null && _a !== void 0 ? _a : '') : undefined;\n      const data = mergeData({\n        attrs: {\n          'aria-label': label,\n          color: this.validationState,\n          dark: this.dark,\n          disabled: this.isDisabled,\n          light: this.light,\n          tabindex: type === 'clear' ? -1 : undefined\n        },\n        on: !hasListener ? undefined : {\n          click: e => {\n            e.preventDefault();\n            e.stopPropagation();\n            this.$emit(eventName, e);\n            cb && cb(e);\n          },\n          // Container has g event that will\n          // trigger menu open if enclosed\n          mouseup: e => {\n            e.preventDefault();\n            e.stopPropagation();\n          }\n        }\n      }, extraData);\n      return this.$createElement('div', {\n        staticClass: `v-input__icon`,\n        class: type ? `v-input__icon--${kebabCase(type)}` : undefined\n      }, [this.$createElement(VIcon, data, icon)]);\n    },\n\n    genInputSlot() {\n      return this.$createElement('div', this.setBackgroundColor(this.backgroundColor, {\n        staticClass: 'v-input__slot',\n        style: {\n          height: convertToUnit(this.height)\n        },\n        on: {\n          click: this.onClick,\n          mousedown: this.onMouseDown,\n          mouseup: this.onMouseUp\n        },\n        ref: 'input-slot'\n      }), [this.genDefaultSlot()]);\n    },\n\n    genLabel() {\n      if (!this.hasLabel) return null;\n      return this.$createElement(VLabel, {\n        props: {\n          color: this.validationState,\n          dark: this.dark,\n          disabled: this.isDisabled,\n          focused: this.hasState,\n          for: this.computedId,\n          light: this.light\n        }\n      }, getSlot(this, 'label') || this.label);\n    },\n\n    genMessages() {\n      if (!this.showDetails) return null;\n      return this.$createElement(VMessages, {\n        props: {\n          color: this.hasHint ? '' : this.validationState,\n          dark: this.dark,\n          light: this.light,\n          value: this.messagesToDisplay\n        },\n        attrs: {\n          role: this.hasMessages ? 'alert' : null\n        },\n        scopedSlots: {\n          default: props => getSlot(this, 'message', props)\n        }\n      });\n    },\n\n    genSlot(type, location, slot) {\n      if (!slot.length) return null;\n      const ref = `${type}-${location}`;\n      return this.$createElement('div', {\n        staticClass: `v-input__${ref}`,\n        ref\n      }, slot);\n    },\n\n    genPrependSlot() {\n      const slot = [];\n\n      if (this.$slots.prepend) {\n        slot.push(this.$slots.prepend);\n      } else if (this.prependIcon) {\n        slot.push(this.genIcon('prepend'));\n      }\n\n      return this.genSlot('prepend', 'outer', slot);\n    },\n\n    genAppendSlot() {\n      const slot = []; // Append icon for text field was really\n      // an appended inner icon, v-text-field\n      // will overwrite this method in order to obtain\n      // backwards compat\n\n      if (this.$slots.append) {\n        slot.push(this.$slots.append);\n      } else if (this.appendIcon) {\n        slot.push(this.genIcon('append'));\n      }\n\n      return this.genSlot('append', 'outer', slot);\n    },\n\n    onClick(e) {\n      this.$emit('click', e);\n    },\n\n    onMouseDown(e) {\n      this.hasMouseDown = true;\n      this.$emit('mousedown', e);\n    },\n\n    onMouseUp(e) {\n      this.hasMouseDown = false;\n      this.$emit('mouseup', e);\n    }\n\n  },\n\n  render(h) {\n    return h('div', this.setTextColor(this.validationState, {\n      staticClass: 'v-input',\n      class: this.classes\n    }), this.genContent());\n  }\n\n});\n//# sourceMappingURL=VInput.js.map","// Styles\nimport \"../../../src/components/VCounter/VCounter.sass\"; // Mixins\n\nimport Themeable, { functionalThemeClasses } from '../../mixins/themeable';\nimport mixins from '../../util/mixins';\n/* @vue/component */\n\nexport default mixins(Themeable).extend({\n  name: 'v-counter',\n  functional: true,\n  props: {\n    value: {\n      type: [Number, String],\n      default: ''\n    },\n    max: [Number, String]\n  },\n\n  render(h, ctx) {\n    const {\n      props\n    } = ctx;\n    const max = parseInt(props.max, 10);\n    const value = parseInt(props.value, 10);\n    const content = max ? `${value} / ${max}` : String(props.value);\n    const isGreater = max && value > max;\n    return h('div', {\n      staticClass: 'v-counter',\n      class: {\n        'error--text': isGreater,\n        ...functionalThemeClasses(ctx)\n      }\n    }, content);\n  }\n\n});\n//# sourceMappingURL=VCounter.js.map","// Directives\nimport Intersect from '../../directives/intersect'; // Utilities\n\nimport { consoleWarn } from '../../util/console'; // Types\n\nimport Vue from 'vue';\nexport default function intersectable(options) {\n  return Vue.extend({\n    name: 'intersectable',\n    data: () => ({\n      isIntersecting: false\n    }),\n\n    mounted() {\n      Intersect.inserted(this.$el, {\n        name: 'intersect',\n        value: this.onObserve\n      }, this.$vnode);\n    },\n\n    destroyed() {\n      Intersect.unbind(this.$el, {\n        name: 'intersect',\n        value: this.onObserve\n      }, this.$vnode);\n    },\n\n    methods: {\n      onObserve(entries, observer, isIntersecting) {\n        this.isIntersecting = isIntersecting;\n        if (!isIntersecting) return;\n\n        for (let i = 0, length = options.onVisible.length; i < length; i++) {\n          const callback = this[options.onVisible[i]];\n\n          if (typeof callback === 'function') {\n            callback();\n            continue;\n          }\n\n          consoleWarn(options.onVisible[i] + ' method is not available on the instance but referenced in intersectable mixin options');\n        }\n      }\n\n    }\n  });\n}\n//# sourceMappingURL=index.js.map","// Styles\nimport \"../../../src/components/VTextField/VTextField.sass\"; // Extensions\n\nimport VInput from '../VInput'; // Components\n\nimport VCounter from '../VCounter';\nimport VLabel from '../VLabel'; // Mixins\n\nimport Intersectable from '../../mixins/intersectable';\nimport Loadable from '../../mixins/loadable';\nimport Validatable from '../../mixins/validatable'; // Directives\n\nimport resize from '../../directives/resize';\nimport ripple from '../../directives/ripple'; // Utilities\n\nimport { attachedRoot } from '../../util/dom';\nimport { convertToUnit, getSlot, keyCodes } from '../../util/helpers';\nimport { breaking, consoleWarn } from '../../util/console'; // Types\n\nimport mixins from '../../util/mixins';\nconst baseMixins = mixins(VInput, Intersectable({\n  onVisible: ['onResize', 'tryAutofocus']\n}), Loadable);\nconst dirtyTypes = ['color', 'file', 'time', 'date', 'datetime-local', 'week', 'month'];\n/* @vue/component */\n\nexport default baseMixins.extend().extend({\n  name: 'v-text-field',\n  directives: {\n    resize,\n    ripple\n  },\n  inheritAttrs: false,\n  props: {\n    appendOuterIcon: String,\n    autofocus: Boolean,\n    clearable: Boolean,\n    clearIcon: {\n      type: String,\n      default: '$clear'\n    },\n    counter: [Boolean, Number, String],\n    counterValue: Function,\n    filled: Boolean,\n    flat: Boolean,\n    fullWidth: Boolean,\n    label: String,\n    outlined: Boolean,\n    placeholder: String,\n    prefix: String,\n    prependInnerIcon: String,\n    persistentPlaceholder: Boolean,\n    reverse: Boolean,\n    rounded: Boolean,\n    shaped: Boolean,\n    singleLine: Boolean,\n    solo: Boolean,\n    soloInverted: Boolean,\n    suffix: String,\n    type: {\n      type: String,\n      default: 'text'\n    }\n  },\n  data: () => ({\n    badInput: false,\n    labelWidth: 0,\n    prefixWidth: 0,\n    prependWidth: 0,\n    initialValue: null,\n    isBooted: false,\n    isClearing: false\n  }),\n  computed: {\n    classes() {\n      return { ...VInput.options.computed.classes.call(this),\n        'v-text-field': true,\n        'v-text-field--full-width': this.fullWidth,\n        'v-text-field--prefix': this.prefix,\n        'v-text-field--single-line': this.isSingle,\n        'v-text-field--solo': this.isSolo,\n        'v-text-field--solo-inverted': this.soloInverted,\n        'v-text-field--solo-flat': this.flat,\n        'v-text-field--filled': this.filled,\n        'v-text-field--is-booted': this.isBooted,\n        'v-text-field--enclosed': this.isEnclosed,\n        'v-text-field--reverse': this.reverse,\n        'v-text-field--outlined': this.outlined,\n        'v-text-field--placeholder': this.placeholder,\n        'v-text-field--rounded': this.rounded,\n        'v-text-field--shaped': this.shaped\n      };\n    },\n\n    computedColor() {\n      const computedColor = Validatable.options.computed.computedColor.call(this);\n      if (!this.soloInverted || !this.isFocused) return computedColor;\n      return this.color || 'primary';\n    },\n\n    computedCounterValue() {\n      if (typeof this.counterValue === 'function') {\n        return this.counterValue(this.internalValue);\n      }\n\n      return [...(this.internalValue || '').toString()].length;\n    },\n\n    hasCounter() {\n      return this.counter !== false && this.counter != null;\n    },\n\n    hasDetails() {\n      return VInput.options.computed.hasDetails.call(this) || this.hasCounter;\n    },\n\n    internalValue: {\n      get() {\n        return this.lazyValue;\n      },\n\n      set(val) {\n        this.lazyValue = val;\n        this.$emit('input', this.lazyValue);\n      }\n\n    },\n\n    isDirty() {\n      var _a;\n\n      return ((_a = this.lazyValue) === null || _a === void 0 ? void 0 : _a.toString().length) > 0 || this.badInput;\n    },\n\n    isEnclosed() {\n      return this.filled || this.isSolo || this.outlined;\n    },\n\n    isLabelActive() {\n      return this.isDirty || dirtyTypes.includes(this.type);\n    },\n\n    isSingle() {\n      return this.isSolo || this.singleLine || this.fullWidth || // https://material.io/components/text-fields/#filled-text-field\n      this.filled && !this.hasLabel;\n    },\n\n    isSolo() {\n      return this.solo || this.soloInverted;\n    },\n\n    labelPosition() {\n      let offset = this.prefix && !this.labelValue ? this.prefixWidth : 0;\n      if (this.labelValue && this.prependWidth) offset -= this.prependWidth;\n      return this.$vuetify.rtl === this.reverse ? {\n        left: offset,\n        right: 'auto'\n      } : {\n        left: 'auto',\n        right: offset\n      };\n    },\n\n    showLabel() {\n      return this.hasLabel && !(this.isSingle && this.labelValue);\n    },\n\n    labelValue() {\n      return this.isFocused || this.isLabelActive || this.persistentPlaceholder;\n    }\n\n  },\n  watch: {\n    // labelValue: 'setLabelWidth', // moved to mounted, see #11533\n    outlined: 'setLabelWidth',\n\n    label() {\n      this.$nextTick(this.setLabelWidth);\n    },\n\n    prefix() {\n      this.$nextTick(this.setPrefixWidth);\n    },\n\n    isFocused: 'updateValue',\n\n    value(val) {\n      this.lazyValue = val;\n    }\n\n  },\n\n  created() {\n    /* istanbul ignore next */\n    if (this.$attrs.hasOwnProperty('box')) {\n      breaking('box', 'filled', this);\n    }\n    /* istanbul ignore next */\n\n\n    if (this.$attrs.hasOwnProperty('browser-autocomplete')) {\n      breaking('browser-autocomplete', 'autocomplete', this);\n    }\n    /* istanbul ignore if */\n\n\n    if (this.shaped && !(this.filled || this.outlined || this.isSolo)) {\n      consoleWarn('shaped should be used with either filled or outlined', this);\n    }\n  },\n\n  mounted() {\n    // #11533\n    this.$watch(() => this.labelValue, this.setLabelWidth);\n    this.autofocus && this.tryAutofocus();\n    requestAnimationFrame(() => {\n      this.isBooted = true;\n      requestAnimationFrame(() => {\n        if (!this.isIntersecting) {\n          this.onResize();\n        }\n      });\n    });\n  },\n\n  methods: {\n    /** @public */\n    focus() {\n      this.onFocus();\n    },\n\n    /** @public */\n    blur(e) {\n      // https://github.com/vuetifyjs/vuetify/issues/5913\n      // Safari tab order gets broken if called synchronous\n      window.requestAnimationFrame(() => {\n        this.$refs.input && this.$refs.input.blur();\n      });\n    },\n\n    clearableCallback() {\n      this.$refs.input && this.$refs.input.focus();\n      this.$nextTick(() => this.internalValue = null);\n    },\n\n    genAppendSlot() {\n      const slot = [];\n\n      if (this.$slots['append-outer']) {\n        slot.push(this.$slots['append-outer']);\n      } else if (this.appendOuterIcon) {\n        slot.push(this.genIcon('appendOuter'));\n      }\n\n      return this.genSlot('append', 'outer', slot);\n    },\n\n    genPrependInnerSlot() {\n      const slot = [];\n\n      if (this.$slots['prepend-inner']) {\n        slot.push(this.$slots['prepend-inner']);\n      } else if (this.prependInnerIcon) {\n        slot.push(this.genIcon('prependInner'));\n      }\n\n      return this.genSlot('prepend', 'inner', slot);\n    },\n\n    genIconSlot() {\n      const slot = [];\n\n      if (this.$slots.append) {\n        slot.push(this.$slots.append);\n      } else if (this.appendIcon) {\n        slot.push(this.genIcon('append'));\n      }\n\n      return this.genSlot('append', 'inner', slot);\n    },\n\n    genInputSlot() {\n      const input = VInput.options.methods.genInputSlot.call(this);\n      const prepend = this.genPrependInnerSlot();\n\n      if (prepend) {\n        input.children = input.children || [];\n        input.children.unshift(prepend);\n      }\n\n      return input;\n    },\n\n    genClearIcon() {\n      if (!this.clearable) return null; // if the text field has no content then don't display the clear icon.\n      // We add an empty div because other controls depend on a ref to append inner\n\n      if (!this.isDirty) {\n        return this.genSlot('append', 'inner', [this.$createElement('div')]);\n      }\n\n      return this.genSlot('append', 'inner', [this.genIcon('clear', this.clearableCallback)]);\n    },\n\n    genCounter() {\n      var _a, _b, _c;\n\n      if (!this.hasCounter) return null;\n      const max = this.counter === true ? this.attrs$.maxlength : this.counter;\n      const props = {\n        dark: this.dark,\n        light: this.light,\n        max,\n        value: this.computedCounterValue\n      };\n      return (_c = (_b = (_a = this.$scopedSlots).counter) === null || _b === void 0 ? void 0 : _b.call(_a, {\n        props\n      })) !== null && _c !== void 0 ? _c : this.$createElement(VCounter, {\n        props\n      });\n    },\n\n    genControl() {\n      return VInput.options.methods.genControl.call(this);\n    },\n\n    genDefaultSlot() {\n      return [this.genFieldset(), this.genTextFieldSlot(), this.genClearIcon(), this.genIconSlot(), this.genProgress()];\n    },\n\n    genFieldset() {\n      if (!this.outlined) return null;\n      return this.$createElement('fieldset', {\n        attrs: {\n          'aria-hidden': true\n        }\n      }, [this.genLegend()]);\n    },\n\n    genLabel() {\n      if (!this.showLabel) return null;\n      const data = {\n        props: {\n          absolute: true,\n          color: this.validationState,\n          dark: this.dark,\n          disabled: this.isDisabled,\n          focused: !this.isSingle && (this.isFocused || !!this.validationState),\n          for: this.computedId,\n          left: this.labelPosition.left,\n          light: this.light,\n          right: this.labelPosition.right,\n          value: this.labelValue\n        }\n      };\n      return this.$createElement(VLabel, data, getSlot(this, 'label') || this.label);\n    },\n\n    genLegend() {\n      const width = !this.singleLine && (this.labelValue || this.isDirty) ? this.labelWidth : 0;\n      const span = this.$createElement('span', {\n        domProps: {\n          innerHTML: '&#8203;'\n        },\n        staticClass: 'notranslate'\n      });\n      return this.$createElement('legend', {\n        style: {\n          width: !this.isSingle ? convertToUnit(width) : undefined\n        }\n      }, [span]);\n    },\n\n    genInput() {\n      const listeners = Object.assign({}, this.listeners$);\n      delete listeners.change; // Change should not be bound externally\n\n      const {\n        title,\n        ...inputAttrs\n      } = this.attrs$;\n      return this.$createElement('input', {\n        style: {},\n        domProps: {\n          value: this.type === 'number' && Object.is(this.lazyValue, -0) ? '-0' : this.lazyValue\n        },\n        attrs: { ...inputAttrs,\n          autofocus: this.autofocus,\n          disabled: this.isDisabled,\n          id: this.computedId,\n          placeholder: this.persistentPlaceholder || this.isFocused || !this.hasLabel ? this.placeholder : undefined,\n          readonly: this.isReadonly,\n          type: this.type\n        },\n        on: Object.assign(listeners, {\n          blur: this.onBlur,\n          input: this.onInput,\n          focus: this.onFocus,\n          keydown: this.onKeyDown\n        }),\n        ref: 'input',\n        directives: [{\n          name: 'resize',\n          modifiers: {\n            quiet: true\n          },\n          value: this.onResize\n        }]\n      });\n    },\n\n    genMessages() {\n      if (!this.showDetails) return null;\n      const messagesNode = VInput.options.methods.genMessages.call(this);\n      const counterNode = this.genCounter();\n      return this.$createElement('div', {\n        staticClass: 'v-text-field__details'\n      }, [messagesNode, counterNode]);\n    },\n\n    genTextFieldSlot() {\n      return this.$createElement('div', {\n        staticClass: 'v-text-field__slot'\n      }, [this.genLabel(), this.prefix ? this.genAffix('prefix') : null, this.genInput(), this.suffix ? this.genAffix('suffix') : null]);\n    },\n\n    genAffix(type) {\n      return this.$createElement('div', {\n        class: `v-text-field__${type}`,\n        ref: type\n      }, this[type]);\n    },\n\n    onBlur(e) {\n      this.isFocused = false;\n      e && this.$nextTick(() => this.$emit('blur', e));\n    },\n\n    onClick() {\n      if (this.isFocused || this.isDisabled || !this.$refs.input) return;\n      this.$refs.input.focus();\n    },\n\n    onFocus(e) {\n      if (!this.$refs.input) return;\n      const root = attachedRoot(this.$el);\n      if (!root) return;\n\n      if (root.activeElement !== this.$refs.input) {\n        return this.$refs.input.focus();\n      }\n\n      if (!this.isFocused) {\n        this.isFocused = true;\n        e && this.$emit('focus', e);\n      }\n    },\n\n    onInput(e) {\n      const target = e.target;\n      this.internalValue = target.value;\n      this.badInput = target.validity && target.validity.badInput;\n    },\n\n    onKeyDown(e) {\n      if (e.keyCode === keyCodes.enter && this.lazyValue !== this.initialValue) {\n        this.initialValue = this.lazyValue;\n        this.$emit('change', this.initialValue);\n      }\n\n      this.$emit('keydown', e);\n    },\n\n    onMouseDown(e) {\n      // Prevent input from being blurred\n      if (e.target !== this.$refs.input) {\n        e.preventDefault();\n        e.stopPropagation();\n      }\n\n      VInput.options.methods.onMouseDown.call(this, e);\n    },\n\n    onMouseUp(e) {\n      if (this.hasMouseDown) this.focus();\n      VInput.options.methods.onMouseUp.call(this, e);\n    },\n\n    setLabelWidth() {\n      if (!this.outlined) return;\n      this.labelWidth = this.$refs.label ? Math.min(this.$refs.label.scrollWidth * 0.75 + 6, this.$el.offsetWidth - 24) : 0;\n    },\n\n    setPrefixWidth() {\n      if (!this.$refs.prefix) return;\n      this.prefixWidth = this.$refs.prefix.offsetWidth;\n    },\n\n    setPrependWidth() {\n      if (!this.outlined || !this.$refs['prepend-inner']) return;\n      this.prependWidth = this.$refs['prepend-inner'].offsetWidth;\n    },\n\n    tryAutofocus() {\n      if (!this.autofocus || typeof document === 'undefined' || !this.$refs.input) return false;\n      const root = attachedRoot(this.$el);\n      if (!root || root.activeElement === this.$refs.input) return false;\n      this.$refs.input.focus();\n      return true;\n    },\n\n    updateValue(val) {\n      // Sets validationState from validatable\n      this.hasColor = val;\n\n      if (val) {\n        this.initialValue = this.lazyValue;\n      } else if (this.initialValue !== this.lazyValue) {\n        this.$emit('change', this.lazyValue);\n      }\n    },\n\n    onResize() {\n      this.setLabelWidth();\n      this.setPrefixWidth();\n      this.setPrependWidth();\n    }\n\n  }\n});\n//# sourceMappingURL=VTextField.js.map","import { deprecate } from '../../util/console';\nimport Vue from 'vue';\n/* @vue/component */\n\nexport default Vue.extend({\n  name: 'mobile',\n  props: {\n    mobileBreakpoint: {\n      type: [Number, String],\n\n      default() {\n        // Avoid destroying unit\n        // tests for users\n        return this.$vuetify ? this.$vuetify.breakpoint.mobileBreakpoint : undefined;\n      },\n\n      validator: v => !isNaN(Number(v)) || ['xs', 'sm', 'md', 'lg', 'xl'].includes(String(v))\n    }\n  },\n  computed: {\n    isMobile() {\n      const {\n        mobile,\n        width,\n        name,\n        mobileBreakpoint\n      } = this.$vuetify.breakpoint; // Check if local mobileBreakpoint matches\n      // the application's mobileBreakpoint\n\n      if (mobileBreakpoint === this.mobileBreakpoint) return mobile;\n      const mobileWidth = parseInt(this.mobileBreakpoint, 10);\n      const isNumber = !isNaN(mobileWidth);\n      return isNumber ? width < mobileWidth : name === this.mobileBreakpoint;\n    }\n\n  },\n\n  created() {\n    /* istanbul ignore next */\n    if (this.$attrs.hasOwnProperty('mobile-break-point')) {\n      deprecate('mobile-break-point', 'mobile-breakpoint', this);\n    }\n  }\n\n});\n//# sourceMappingURL=index.js.map","// Styles\nimport \"../../../src/components/VBanner/VBanner.sass\"; // Extensions\n\nimport VSheet from '../VSheet'; // Components\n\nimport VAvatar from '../VAvatar';\nimport VIcon from '../VIcon';\nimport { VExpandTransition } from '../transitions'; // Mixins\n\nimport Mobile from '../../mixins/mobile';\nimport Toggleable from '../../mixins/toggleable'; // Utilities\n\nimport mixins from '../../util/mixins';\nimport { convertToUnit, getSlot } from '../../util/helpers';\n/* @vue/component */\n\nexport default mixins(VSheet, Mobile, Toggleable).extend({\n  name: 'v-banner',\n  inheritAttrs: false,\n  props: {\n    app: Boolean,\n    icon: String,\n    iconColor: String,\n    singleLine: Boolean,\n    sticky: Boolean,\n    value: {\n      type: Boolean,\n      default: true\n    }\n  },\n  computed: {\n    classes() {\n      return { ...VSheet.options.computed.classes.call(this),\n        'v-banner--has-icon': this.hasIcon,\n        'v-banner--is-mobile': this.isMobile,\n        'v-banner--single-line': this.singleLine,\n        'v-banner--sticky': this.isSticky\n      };\n    },\n\n    hasIcon() {\n      return Boolean(this.icon || this.$slots.icon || this.$scopedSlots.icon);\n    },\n\n    isSticky() {\n      return this.sticky || this.app;\n    },\n\n    styles() {\n      const styles = { ...VSheet.options.computed.styles.call(this)\n      };\n\n      if (this.isSticky) {\n        const top = !this.app ? 0 : this.$vuetify.application.bar + this.$vuetify.application.top;\n        styles.top = convertToUnit(top);\n        styles.position = 'sticky';\n        styles.zIndex = 1;\n      }\n\n      return styles;\n    }\n\n  },\n  methods: {\n    /** @public */\n    toggle() {\n      this.isActive = !this.isActive;\n    },\n\n    iconClick(e) {\n      this.$emit('click:icon', e);\n    },\n\n    genIcon() {\n      if (!this.hasIcon) return undefined;\n      let content;\n\n      if (this.icon) {\n        content = this.$createElement(VIcon, {\n          props: {\n            color: this.iconColor,\n            size: 28\n          }\n        }, [this.icon]);\n      } else {\n        content = getSlot(this, 'icon');\n      }\n\n      return this.$createElement(VAvatar, {\n        staticClass: 'v-banner__icon',\n        props: {\n          color: this.color,\n          size: 40\n        },\n        on: {\n          click: this.iconClick\n        }\n      }, [content]);\n    },\n\n    genText() {\n      return this.$createElement('div', {\n        staticClass: 'v-banner__text'\n      }, getSlot(this));\n    },\n\n    genActions() {\n      const children = getSlot(this, 'actions', {\n        dismiss: () => this.isActive = false\n      });\n      if (!children) return undefined;\n      return this.$createElement('div', {\n        staticClass: 'v-banner__actions'\n      }, children);\n    },\n\n    genContent() {\n      return this.$createElement('div', {\n        staticClass: 'v-banner__content'\n      }, [this.genIcon(), this.genText()]);\n    },\n\n    genWrapper() {\n      return this.$createElement('div', {\n        staticClass: 'v-banner__wrapper'\n      }, [this.genContent(), this.genActions()]);\n    }\n\n  },\n\n  render(h) {\n    const data = {\n      staticClass: 'v-banner',\n      attrs: this.attrs$,\n      class: this.classes,\n      style: this.styles,\n      directives: [{\n        name: 'show',\n        value: this.isActive\n      }]\n    };\n    return h(VExpandTransition, [h('div', this.outlined ? data : this.setBackgroundColor(this.color, data), [this.genWrapper()])]);\n  }\n\n});\n//# sourceMappingURL=VBanner.js.map","// Styles\nimport \"../../../src/components/VOverlay/VOverlay.sass\"; // Mixins\n\nimport Colorable from './../../mixins/colorable';\nimport Themeable from '../../mixins/themeable';\nimport Toggleable from './../../mixins/toggleable'; // Utilities\n\nimport mixins from '../../util/mixins';\nimport { getSlot } from '../../util/helpers';\n/* @vue/component */\n\nexport default mixins(Colorable, Themeable, Toggleable).extend({\n  name: 'v-overlay',\n  props: {\n    absolute: Boolean,\n    color: {\n      type: String,\n      default: '#212121'\n    },\n    dark: {\n      type: Boolean,\n      default: true\n    },\n    opacity: {\n      type: [Number, String],\n      default: 0.46\n    },\n    value: {\n      default: true\n    },\n    zIndex: {\n      type: [Number, String],\n      default: 5\n    }\n  },\n  computed: {\n    __scrim() {\n      const data = this.setBackgroundColor(this.color, {\n        staticClass: 'v-overlay__scrim',\n        style: {\n          opacity: this.computedOpacity\n        }\n      });\n      return this.$createElement('div', data);\n    },\n\n    classes() {\n      return {\n        'v-overlay--absolute': this.absolute,\n        'v-overlay--active': this.isActive,\n        ...this.themeClasses\n      };\n    },\n\n    computedOpacity() {\n      return Number(this.isActive ? this.opacity : 0);\n    },\n\n    styles() {\n      return {\n        zIndex: this.zIndex\n      };\n    }\n\n  },\n  methods: {\n    genContent() {\n      return this.$createElement('div', {\n        staticClass: 'v-overlay__content'\n      }, getSlot(this));\n    }\n\n  },\n\n  render(h) {\n    const children = [this.__scrim];\n    if (this.isActive) children.push(this.genContent());\n    return h('div', {\n      staticClass: 'v-overlay',\n      on: this.$listeners,\n      class: this.classes,\n      style: this.styles\n    }, children);\n  }\n\n});\n//# sourceMappingURL=VOverlay.js.map","// Directives\nimport ripple from '../../directives/ripple'; // Types\n\nimport Vue from 'vue';\nexport default Vue.extend({\n  name: 'rippleable',\n  directives: {\n    ripple\n  },\n  props: {\n    ripple: {\n      type: [Boolean, Object],\n      default: true\n    }\n  },\n  methods: {\n    genRipple(data = {}) {\n      if (!this.ripple) return null;\n      data.staticClass = 'v-input--selection-controls__ripple';\n      data.directives = data.directives || [];\n      data.directives.push({\n        name: 'ripple',\n        value: {\n          center: true\n        }\n      });\n      return this.$createElement('div', data);\n    }\n\n  }\n});\n//# sourceMappingURL=index.js.map","// Components\nimport VInput from '../../components/VInput'; // Mixins\n\nimport Rippleable from '../rippleable';\nimport Comparable from '../comparable'; // Utilities\n\nimport mixins from '../../util/mixins';\nexport function prevent(e) {\n  e.preventDefault();\n}\n/* @vue/component */\n\nexport default mixins(VInput, Rippleable, Comparable).extend({\n  name: 'selectable',\n  model: {\n    prop: 'inputValue',\n    event: 'change'\n  },\n  props: {\n    id: String,\n    inputValue: null,\n    falseValue: null,\n    trueValue: null,\n    multiple: {\n      type: Boolean,\n      default: null\n    },\n    label: String\n  },\n\n  data() {\n    return {\n      hasColor: this.inputValue,\n      lazyValue: this.inputValue\n    };\n  },\n\n  computed: {\n    computedColor() {\n      if (!this.isActive) return undefined;\n      if (this.color) return this.color;\n      if (this.isDark && !this.appIsDark) return 'white';\n      return 'primary';\n    },\n\n    isMultiple() {\n      return this.multiple === true || this.multiple === null && Array.isArray(this.internalValue);\n    },\n\n    isActive() {\n      const value = this.value;\n      const input = this.internalValue;\n\n      if (this.isMultiple) {\n        if (!Array.isArray(input)) return false;\n        return input.some(item => this.valueComparator(item, value));\n      }\n\n      if (this.trueValue === undefined || this.falseValue === undefined) {\n        return value ? this.valueComparator(value, input) : Boolean(input);\n      }\n\n      return this.valueComparator(input, this.trueValue);\n    },\n\n    isDirty() {\n      return this.isActive;\n    },\n\n    rippleState() {\n      return !this.isDisabled && !this.validationState ? undefined : this.validationState;\n    }\n\n  },\n  watch: {\n    inputValue(val) {\n      this.lazyValue = val;\n      this.hasColor = val;\n    }\n\n  },\n  methods: {\n    genLabel() {\n      const label = VInput.options.methods.genLabel.call(this);\n      if (!label) return label;\n      label.data.on = {\n        // Label shouldn't cause the input to focus\n        click: prevent\n      };\n      return label;\n    },\n\n    genInput(type, attrs) {\n      return this.$createElement('input', {\n        attrs: Object.assign({\n          'aria-checked': this.isActive.toString(),\n          disabled: this.isDisabled,\n          id: this.computedId,\n          role: type,\n          type\n        }, attrs),\n        domProps: {\n          value: this.value,\n          checked: this.isActive\n        },\n        on: {\n          blur: this.onBlur,\n          change: this.onChange,\n          focus: this.onFocus,\n          keydown: this.onKeydown,\n          click: prevent\n        },\n        ref: 'input'\n      });\n    },\n\n    onClick(e) {\n      this.onChange();\n      this.$emit('click', e);\n    },\n\n    onChange() {\n      if (!this.isInteractive) return;\n      const value = this.value;\n      let input = this.internalValue;\n\n      if (this.isMultiple) {\n        if (!Array.isArray(input)) {\n          input = [];\n        }\n\n        const length = input.length;\n        input = input.filter(item => !this.valueComparator(item, value));\n\n        if (input.length === length) {\n          input.push(value);\n        }\n      } else if (this.trueValue !== undefined && this.falseValue !== undefined) {\n        input = this.valueComparator(input, this.trueValue) ? this.falseValue : this.trueValue;\n      } else if (value) {\n        input = this.valueComparator(input, value) ? null : value;\n      } else {\n        input = !input;\n      }\n\n      this.validate(true, input);\n      this.internalValue = input;\n      this.hasColor = input;\n    },\n\n    onFocus(e) {\n      this.isFocused = true;\n      this.$emit('focus', e);\n    },\n\n    onBlur(e) {\n      this.isFocused = false;\n      this.$emit('blur', e);\n    },\n\n    /** @abstract */\n    onKeydown(e) {}\n\n  }\n});\n//# sourceMappingURL=index.js.map","import \"../../../src/components/VSlider/VSlider.sass\"; // Components\n\nimport VInput from '../VInput';\nimport { VScaleTransition } from '../transitions'; // Mixins\n\nimport mixins from '../../util/mixins';\nimport Loadable from '../../mixins/loadable'; // Directives\n\nimport ClickOutside from '../../directives/click-outside'; // Helpers\n\nimport { addOnceEventListener, deepEqual, keyCodes, createRange, convertToUnit, passiveSupported } from '../../util/helpers';\nimport { consoleWarn } from '../../util/console';\nexport default mixins(VInput, Loadable\n/* @vue/component */\n).extend({\n  name: 'v-slider',\n  directives: {\n    ClickOutside\n  },\n  mixins: [Loadable],\n  props: {\n    disabled: Boolean,\n    inverseLabel: Boolean,\n    max: {\n      type: [Number, String],\n      default: 100\n    },\n    min: {\n      type: [Number, String],\n      default: 0\n    },\n    step: {\n      type: [Number, String],\n      default: 1\n    },\n    thumbColor: String,\n    thumbLabel: {\n      type: [Boolean, String],\n      default: undefined,\n      validator: v => typeof v === 'boolean' || v === 'always'\n    },\n    thumbSize: {\n      type: [Number, String],\n      default: 32\n    },\n    tickLabels: {\n      type: Array,\n      default: () => []\n    },\n    ticks: {\n      type: [Boolean, String],\n      default: false,\n      validator: v => typeof v === 'boolean' || v === 'always'\n    },\n    tickSize: {\n      type: [Number, String],\n      default: 2\n    },\n    trackColor: String,\n    trackFillColor: String,\n    value: [Number, String],\n    vertical: Boolean\n  },\n  data: () => ({\n    app: null,\n    oldValue: null,\n    thumbPressed: false,\n    mouseTimeout: -1,\n    isFocused: false,\n    isActive: false,\n    noClick: false,\n    startOffset: 0\n  }),\n  computed: {\n    classes() {\n      return { ...VInput.options.computed.classes.call(this),\n        'v-input__slider': true,\n        'v-input__slider--vertical': this.vertical,\n        'v-input__slider--inverse-label': this.inverseLabel\n      };\n    },\n\n    internalValue: {\n      get() {\n        return this.lazyValue;\n      },\n\n      set(val) {\n        val = isNaN(val) ? this.minValue : val; // Round value to ensure the\n        // entire slider range can\n        // be selected with step\n\n        const value = this.roundValue(Math.min(Math.max(val, this.minValue), this.maxValue));\n        if (value === this.lazyValue) return;\n        this.lazyValue = value;\n        this.$emit('input', value);\n      }\n\n    },\n\n    trackTransition() {\n      return this.thumbPressed ? this.showTicks || this.stepNumeric ? '0.1s cubic-bezier(0.25, 0.8, 0.5, 1)' : 'none' : '';\n    },\n\n    minValue() {\n      return parseFloat(this.min);\n    },\n\n    maxValue() {\n      return parseFloat(this.max);\n    },\n\n    stepNumeric() {\n      return this.step > 0 ? parseFloat(this.step) : 0;\n    },\n\n    inputWidth() {\n      const inputWidth = (this.roundValue(this.internalValue) - this.minValue) / (this.maxValue - this.minValue) * 100;\n      return isNaN(inputWidth) ? 0 : inputWidth;\n    },\n\n    trackFillStyles() {\n      const startDir = this.vertical ? 'bottom' : 'left';\n      const endDir = this.vertical ? 'top' : 'right';\n      const valueDir = this.vertical ? 'height' : 'width';\n      const start = this.$vuetify.rtl ? 'auto' : '0';\n      const end = this.$vuetify.rtl ? '0' : 'auto';\n      const value = this.isDisabled ? `calc(${this.inputWidth}% - 10px)` : `${this.inputWidth}%`;\n      return {\n        transition: this.trackTransition,\n        [startDir]: start,\n        [endDir]: end,\n        [valueDir]: value\n      };\n    },\n\n    trackStyles() {\n      const startDir = this.vertical ? this.$vuetify.rtl ? 'bottom' : 'top' : this.$vuetify.rtl ? 'left' : 'right';\n      const endDir = this.vertical ? 'height' : 'width';\n      const start = '0px';\n      const end = this.isDisabled ? `calc(${100 - this.inputWidth}% - 10px)` : `calc(${100 - this.inputWidth}%)`;\n      return {\n        transition: this.trackTransition,\n        [startDir]: start,\n        [endDir]: end\n      };\n    },\n\n    showTicks() {\n      return this.tickLabels.length > 0 || !!(!this.isDisabled && this.stepNumeric && this.ticks);\n    },\n\n    numTicks() {\n      return Math.ceil((this.maxValue - this.minValue) / this.stepNumeric);\n    },\n\n    showThumbLabel() {\n      return !this.isDisabled && !!(this.thumbLabel || this.$scopedSlots['thumb-label']);\n    },\n\n    computedTrackColor() {\n      if (this.isDisabled) return undefined;\n      if (this.trackColor) return this.trackColor;\n      if (this.isDark) return this.validationState;\n      return this.validationState || 'primary lighten-3';\n    },\n\n    computedTrackFillColor() {\n      if (this.isDisabled) return undefined;\n      if (this.trackFillColor) return this.trackFillColor;\n      return this.validationState || this.computedColor;\n    },\n\n    computedThumbColor() {\n      if (this.thumbColor) return this.thumbColor;\n      return this.validationState || this.computedColor;\n    }\n\n  },\n  watch: {\n    min(val) {\n      const parsed = parseFloat(val);\n      parsed > this.internalValue && this.$emit('input', parsed);\n    },\n\n    max(val) {\n      const parsed = parseFloat(val);\n      parsed < this.internalValue && this.$emit('input', parsed);\n    },\n\n    value: {\n      handler(v) {\n        this.internalValue = v;\n      },\n\n      immediate: true\n    }\n  },\n\n  mounted() {\n    // Without a v-app, iOS does not work with body selectors\n    this.app = document.querySelector('[data-app]') || consoleWarn('Missing v-app or a non-body wrapping element with the [data-app] attribute', this);\n  },\n\n  methods: {\n    genDefaultSlot() {\n      const children = [this.genLabel()];\n      const slider = this.genSlider();\n      this.inverseLabel ? children.unshift(slider) : children.push(slider);\n      children.push(this.genProgress());\n      return children;\n    },\n\n    genSlider() {\n      return this.$createElement('div', {\n        class: {\n          'v-slider': true,\n          'v-slider--horizontal': !this.vertical,\n          'v-slider--vertical': this.vertical,\n          'v-slider--focused': this.isFocused,\n          'v-slider--active': this.isActive,\n          'v-slider--disabled': this.isDisabled,\n          'v-slider--readonly': this.isReadonly,\n          ...this.themeClasses\n        },\n        directives: [{\n          name: 'click-outside',\n          value: this.onBlur\n        }],\n        on: {\n          click: this.onSliderClick,\n          mousedown: this.onSliderMouseDown,\n          touchstart: this.onSliderMouseDown\n        }\n      }, this.genChildren());\n    },\n\n    genChildren() {\n      return [this.genInput(), this.genTrackContainer(), this.genSteps(), this.genThumbContainer(this.internalValue, this.inputWidth, this.isActive, this.isFocused, this.onFocus, this.onBlur)];\n    },\n\n    genInput() {\n      return this.$createElement('input', {\n        attrs: {\n          value: this.internalValue,\n          id: this.computedId,\n          disabled: true,\n          readonly: true,\n          tabindex: -1,\n          ...this.$attrs\n        } // on: this.genListeners(), // TODO: do we need to attach the listeners to input?\n\n      });\n    },\n\n    genTrackContainer() {\n      const children = [this.$createElement('div', this.setBackgroundColor(this.computedTrackColor, {\n        staticClass: 'v-slider__track-background',\n        style: this.trackStyles\n      })), this.$createElement('div', this.setBackgroundColor(this.computedTrackFillColor, {\n        staticClass: 'v-slider__track-fill',\n        style: this.trackFillStyles\n      }))];\n      return this.$createElement('div', {\n        staticClass: 'v-slider__track-container',\n        ref: 'track'\n      }, children);\n    },\n\n    genSteps() {\n      if (!this.step || !this.showTicks) return null;\n      const tickSize = parseFloat(this.tickSize);\n      const range = createRange(this.numTicks + 1);\n      const direction = this.vertical ? 'bottom' : this.$vuetify.rtl ? 'right' : 'left';\n      const offsetDirection = this.vertical ? this.$vuetify.rtl ? 'left' : 'right' : 'top';\n      if (this.vertical) range.reverse();\n      const ticks = range.map(index => {\n        const children = [];\n\n        if (this.tickLabels[index]) {\n          children.push(this.$createElement('div', {\n            staticClass: 'v-slider__tick-label'\n          }, this.tickLabels[index]));\n        }\n\n        const width = index * (100 / this.numTicks);\n        const filled = this.$vuetify.rtl ? 100 - this.inputWidth < width : width < this.inputWidth;\n        return this.$createElement('span', {\n          key: index,\n          staticClass: 'v-slider__tick',\n          class: {\n            'v-slider__tick--filled': filled\n          },\n          style: {\n            width: `${tickSize}px`,\n            height: `${tickSize}px`,\n            [direction]: `calc(${width}% - ${tickSize / 2}px)`,\n            [offsetDirection]: `calc(50% - ${tickSize / 2}px)`\n          }\n        }, children);\n      });\n      return this.$createElement('div', {\n        staticClass: 'v-slider__ticks-container',\n        class: {\n          'v-slider__ticks-container--always-show': this.ticks === 'always' || this.tickLabels.length > 0\n        }\n      }, ticks);\n    },\n\n    genThumbContainer(value, valueWidth, isActive, isFocused, onFocus, onBlur, ref = 'thumb') {\n      const children = [this.genThumb()];\n      const thumbLabelContent = this.genThumbLabelContent(value);\n      this.showThumbLabel && children.push(this.genThumbLabel(thumbLabelContent));\n      return this.$createElement('div', this.setTextColor(this.computedThumbColor, {\n        ref,\n        key: ref,\n        staticClass: 'v-slider__thumb-container',\n        class: {\n          'v-slider__thumb-container--active': isActive,\n          'v-slider__thumb-container--focused': isFocused,\n          'v-slider__thumb-container--show-label': this.showThumbLabel\n        },\n        style: this.getThumbContainerStyles(valueWidth),\n        attrs: {\n          role: 'slider',\n          tabindex: this.isDisabled ? -1 : this.$attrs.tabindex ? this.$attrs.tabindex : 0,\n          'aria-label': this.$attrs['aria-label'] || this.label,\n          'aria-valuemin': this.min,\n          'aria-valuemax': this.max,\n          'aria-valuenow': this.internalValue,\n          'aria-readonly': String(this.isReadonly),\n          'aria-orientation': this.vertical ? 'vertical' : 'horizontal'\n        },\n        on: {\n          focus: onFocus,\n          blur: onBlur,\n          keydown: this.onKeyDown\n        }\n      }), children);\n    },\n\n    genThumbLabelContent(value) {\n      return this.$scopedSlots['thumb-label'] ? this.$scopedSlots['thumb-label']({\n        value\n      }) : [this.$createElement('span', [String(value)])];\n    },\n\n    genThumbLabel(content) {\n      const size = convertToUnit(this.thumbSize);\n      const transform = this.vertical ? `translateY(20%) translateY(${Number(this.thumbSize) / 3 - 1}px) translateX(55%) rotate(135deg)` : `translateY(-20%) translateY(-12px) translateX(-50%) rotate(45deg)`;\n      return this.$createElement(VScaleTransition, {\n        props: {\n          origin: 'bottom center'\n        }\n      }, [this.$createElement('div', {\n        staticClass: 'v-slider__thumb-label-container',\n        directives: [{\n          name: 'show',\n          value: this.isFocused || this.isActive || this.thumbLabel === 'always'\n        }]\n      }, [this.$createElement('div', this.setBackgroundColor(this.computedThumbColor, {\n        staticClass: 'v-slider__thumb-label',\n        style: {\n          height: size,\n          width: size,\n          transform\n        }\n      }), [this.$createElement('div', content)])])]);\n    },\n\n    genThumb() {\n      return this.$createElement('div', this.setBackgroundColor(this.computedThumbColor, {\n        staticClass: 'v-slider__thumb'\n      }));\n    },\n\n    getThumbContainerStyles(width) {\n      const direction = this.vertical ? 'top' : 'left';\n      let value = this.$vuetify.rtl ? 100 - width : width;\n      value = this.vertical ? 100 - value : value;\n      return {\n        transition: this.trackTransition,\n        [direction]: `${value}%`\n      };\n    },\n\n    onSliderMouseDown(e) {\n      var _a;\n\n      e.preventDefault();\n      this.oldValue = this.internalValue;\n      this.isActive = true;\n\n      if ((_a = e.target) === null || _a === void 0 ? void 0 : _a.matches('.v-slider__thumb-container, .v-slider__thumb-container *')) {\n        this.thumbPressed = true;\n        const domRect = e.target.getBoundingClientRect();\n        const touch = 'touches' in e ? e.touches[0] : e;\n        this.startOffset = this.vertical ? touch.clientY - (domRect.top + domRect.height / 2) : touch.clientX - (domRect.left + domRect.width / 2);\n      } else {\n        this.startOffset = 0;\n        window.clearTimeout(this.mouseTimeout);\n        this.mouseTimeout = window.setTimeout(() => {\n          this.thumbPressed = true;\n        }, 300);\n      }\n\n      const mouseUpOptions = passiveSupported ? {\n        passive: true,\n        capture: true\n      } : true;\n      const mouseMoveOptions = passiveSupported ? {\n        passive: true\n      } : false;\n      const isTouchEvent = ('touches' in e);\n      this.onMouseMove(e);\n      this.app.addEventListener(isTouchEvent ? 'touchmove' : 'mousemove', this.onMouseMove, mouseMoveOptions);\n      addOnceEventListener(this.app, isTouchEvent ? 'touchend' : 'mouseup', this.onSliderMouseUp, mouseUpOptions);\n      this.$emit('start', this.internalValue);\n    },\n\n    onSliderMouseUp(e) {\n      e.stopPropagation();\n      window.clearTimeout(this.mouseTimeout);\n      this.thumbPressed = false;\n      const mouseMoveOptions = passiveSupported ? {\n        passive: true\n      } : false;\n      this.app.removeEventListener('touchmove', this.onMouseMove, mouseMoveOptions);\n      this.app.removeEventListener('mousemove', this.onMouseMove, mouseMoveOptions);\n      this.$emit('mouseup', e);\n      this.$emit('end', this.internalValue);\n\n      if (!deepEqual(this.oldValue, this.internalValue)) {\n        this.$emit('change', this.internalValue);\n        this.noClick = true;\n      }\n\n      this.isActive = false;\n    },\n\n    onMouseMove(e) {\n      if (e.type === 'mousemove') {\n        this.thumbPressed = true;\n      }\n\n      this.internalValue = this.parseMouseMove(e);\n    },\n\n    onKeyDown(e) {\n      if (!this.isInteractive) return;\n      const value = this.parseKeyDown(e, this.internalValue);\n      if (value == null || value < this.minValue || value > this.maxValue) return;\n      this.internalValue = value;\n      this.$emit('change', value);\n    },\n\n    onSliderClick(e) {\n      if (this.noClick) {\n        this.noClick = false;\n        return;\n      }\n\n      const thumb = this.$refs.thumb;\n      thumb.focus();\n      this.onMouseMove(e);\n      this.$emit('change', this.internalValue);\n    },\n\n    onBlur(e) {\n      this.isFocused = false;\n      this.$emit('blur', e);\n    },\n\n    onFocus(e) {\n      this.isFocused = true;\n      this.$emit('focus', e);\n    },\n\n    parseMouseMove(e) {\n      const start = this.vertical ? 'top' : 'left';\n      const length = this.vertical ? 'height' : 'width';\n      const click = this.vertical ? 'clientY' : 'clientX';\n      const {\n        [start]: trackStart,\n        [length]: trackLength\n      } = this.$refs.track.getBoundingClientRect();\n      const clickOffset = 'touches' in e ? e.touches[0][click] : e[click]; // It is possible for left to be NaN, force to number\n\n      let clickPos = Math.min(Math.max((clickOffset - trackStart - this.startOffset) / trackLength, 0), 1) || 0;\n      if (this.vertical) clickPos = 1 - clickPos;\n      if (this.$vuetify.rtl) clickPos = 1 - clickPos;\n      return parseFloat(this.min) + clickPos * (this.maxValue - this.minValue);\n    },\n\n    parseKeyDown(e, value) {\n      if (!this.isInteractive) return;\n      const {\n        pageup,\n        pagedown,\n        end,\n        home,\n        left,\n        right,\n        down,\n        up\n      } = keyCodes;\n      if (![pageup, pagedown, end, home, left, right, down, up].includes(e.keyCode)) return;\n      e.preventDefault();\n      const step = this.stepNumeric || 1;\n      const steps = (this.maxValue - this.minValue) / step;\n\n      if ([left, right, down, up].includes(e.keyCode)) {\n        const increase = this.$vuetify.rtl ? [left, up] : [right, up];\n        const direction = increase.includes(e.keyCode) ? 1 : -1;\n        const multiplier = e.shiftKey ? 3 : e.ctrlKey ? 2 : 1;\n        value = value + direction * step * multiplier;\n      } else if (e.keyCode === home) {\n        value = this.minValue;\n      } else if (e.keyCode === end) {\n        value = this.maxValue;\n      } else {\n        const direction = e.keyCode === pagedown ? 1 : -1;\n        value = value - direction * step * (steps > 100 ? steps / 10 : 10);\n      }\n\n      return value;\n    },\n\n    roundValue(value) {\n      if (!this.stepNumeric) return value; // Format input value using the same number\n      // of decimals places as in the step prop\n\n      const trimmedStep = this.step.toString().trim();\n      const decimals = trimmedStep.indexOf('.') > -1 ? trimmedStep.length - trimmedStep.indexOf('.') - 1 : 0;\n      const offset = this.minValue % this.stepNumeric;\n      const newValue = Math.round((value - offset) / this.stepNumeric) * this.stepNumeric + offset;\n      return parseFloat(Math.min(newValue, this.maxValue).toFixed(decimals));\n    }\n\n  }\n});\n//# sourceMappingURL=VSlider.js.map","// Styles\nimport \"../../../src/components/VMain/VMain.sass\"; // Mixins\n\nimport SSRBootable from '../../mixins/ssr-bootable';\nimport { getSlot } from '../../util/helpers';\n/* @vue/component */\n\nexport default SSRBootable.extend({\n  name: 'v-main',\n  props: {\n    tag: {\n      type: String,\n      default: 'main'\n    }\n  },\n  computed: {\n    styles() {\n      const {\n        bar,\n        top,\n        right,\n        footer,\n        insetFooter,\n        bottom,\n        left\n      } = this.$vuetify.application;\n      return {\n        paddingTop: `${top + bar}px`,\n        paddingRight: `${right}px`,\n        paddingBottom: `${footer + insetFooter + bottom}px`,\n        paddingLeft: `${left}px`\n      };\n    }\n\n  },\n\n  render(h) {\n    const data = {\n      staticClass: 'v-main',\n      style: this.styles,\n      ref: 'main'\n    };\n    return h(this.tag, data, [h('div', {\n      staticClass: 'v-main__wrap'\n    }, getSlot(this))]);\n  }\n\n});\n//# sourceMappingURL=VMain.js.map","// Mixins\nimport mixins from '../../util/mixins';\nimport BindsAttrs from '../../mixins/binds-attrs';\nimport { provide as RegistrableProvide } from '../../mixins/registrable';\nimport { getSlot } from '../../util/helpers';\n/* @vue/component */\n\nexport default mixins(BindsAttrs, RegistrableProvide('form')\n/* @vue/component */\n).extend({\n  name: 'v-form',\n\n  provide() {\n    return {\n      form: this\n    };\n  },\n\n  inheritAttrs: false,\n  props: {\n    disabled: Boolean,\n    lazyValidation: Boolean,\n    readonly: Boolean,\n    value: Boolean\n  },\n  data: () => ({\n    inputs: [],\n    watchers: [],\n    errorBag: {}\n  }),\n  watch: {\n    errorBag: {\n      handler(val) {\n        const errors = Object.values(val).includes(true);\n        this.$emit('input', !errors);\n      },\n\n      deep: true,\n      immediate: true\n    }\n  },\n  methods: {\n    watchInput(input) {\n      const watcher = input => {\n        return input.$watch('hasError', val => {\n          this.$set(this.errorBag, input._uid, val);\n        }, {\n          immediate: true\n        });\n      };\n\n      const watchers = {\n        _uid: input._uid,\n        valid: () => {},\n        shouldValidate: () => {}\n      };\n\n      if (this.lazyValidation) {\n        // Only start watching inputs if we need to\n        watchers.shouldValidate = input.$watch('shouldValidate', val => {\n          if (!val) return; // Only watch if we're not already doing it\n\n          if (this.errorBag.hasOwnProperty(input._uid)) return;\n          watchers.valid = watcher(input);\n        });\n      } else {\n        watchers.valid = watcher(input);\n      }\n\n      return watchers;\n    },\n\n    /** @public */\n    validate() {\n      return this.inputs.filter(input => !input.validate(true)).length === 0;\n    },\n\n    /** @public */\n    reset() {\n      this.inputs.forEach(input => input.reset());\n      this.resetErrorBag();\n    },\n\n    resetErrorBag() {\n      if (this.lazyValidation) {\n        // Account for timeout in validatable\n        setTimeout(() => {\n          this.errorBag = {};\n        }, 0);\n      }\n    },\n\n    /** @public */\n    resetValidation() {\n      this.inputs.forEach(input => input.resetValidation());\n      this.resetErrorBag();\n    },\n\n    register(input) {\n      this.inputs.push(input);\n      this.watchers.push(this.watchInput(input));\n    },\n\n    unregister(input) {\n      const found = this.inputs.find(i => i._uid === input._uid);\n      if (!found) return;\n      const unwatch = this.watchers.find(i => i._uid === found._uid);\n\n      if (unwatch) {\n        unwatch.valid();\n        unwatch.shouldValidate();\n      }\n\n      this.watchers = this.watchers.filter(i => i._uid !== found._uid);\n      this.inputs = this.inputs.filter(i => i._uid !== found._uid);\n      this.$delete(this.errorBag, found._uid);\n    }\n\n  },\n\n  render(h) {\n    return h('form', {\n      staticClass: 'v-form',\n      attrs: {\n        novalidate: true,\n        ...this.attrs$\n      },\n      on: {\n        submit: e => this.$emit('submit', e)\n      }\n    }, getSlot(this));\n  }\n\n});\n//# sourceMappingURL=VForm.js.map","// Types\nimport Vue from 'vue';\nexport default function VGrid(name) {\n  /* @vue/component */\n  return Vue.extend({\n    name: `v-${name}`,\n    functional: true,\n    props: {\n      id: String,\n      tag: {\n        type: String,\n        default: 'div'\n      }\n    },\n\n    render(h, {\n      props,\n      data,\n      children\n    }) {\n      data.staticClass = `${name} ${data.staticClass || ''}`.trim();\n      const {\n        attrs\n      } = data;\n\n      if (attrs) {\n        // reset attrs to extract utility clases like pa-3\n        data.attrs = {};\n        const classes = Object.keys(attrs).filter(key => {\n          // TODO: Remove once resolved\n          // https://github.com/vuejs/vue/issues/7841\n          if (key === 'slot') return false;\n          const value = attrs[key]; // add back data attributes like data-test=\"foo\" but do not\n          // add them as classes\n\n          if (key.startsWith('data-')) {\n            data.attrs[key] = value;\n            return false;\n          }\n\n          return value || typeof value === 'string';\n        });\n        if (classes.length) data.staticClass += ` ${classes.join(' ')}`;\n      }\n\n      if (props.id) {\n        data.domProps = data.domProps || {};\n        data.domProps.id = props.id;\n      }\n\n      return h(props.tag, data, children);\n    }\n\n  });\n}\n//# sourceMappingURL=grid.js.map","import \"../../../src/components/VGrid/_grid.sass\";\nimport \"../../../src/components/VGrid/VGrid.sass\";\nimport Grid from './grid';\nimport mergeData from '../../util/mergeData';\n/* @vue/component */\n\nexport default Grid('container').extend({\n  name: 'v-container',\n  functional: true,\n  props: {\n    id: String,\n    tag: {\n      type: String,\n      default: 'div'\n    },\n    fluid: {\n      type: Boolean,\n      default: false\n    }\n  },\n\n  render(h, {\n    props,\n    data,\n    children\n  }) {\n    let classes;\n    const {\n      attrs\n    } = data;\n\n    if (attrs) {\n      // reset attrs to extract utility clases like pa-3\n      data.attrs = {};\n      classes = Object.keys(attrs).filter(key => {\n        // TODO: Remove once resolved\n        // https://github.com/vuejs/vue/issues/7841\n        if (key === 'slot') return false;\n        const value = attrs[key]; // add back data attributes like data-test=\"foo\" but do not\n        // add them as classes\n\n        if (key.startsWith('data-')) {\n          data.attrs[key] = value;\n          return false;\n        }\n\n        return value || typeof value === 'string';\n      });\n    }\n\n    if (props.id) {\n      data.domProps = data.domProps || {};\n      data.domProps.id = props.id;\n    }\n\n    return h(props.tag, mergeData(data, {\n      staticClass: 'container',\n      class: Array({\n        'container--fluid': props.fluid\n      }).concat(classes || [])\n    }), children);\n  }\n\n});\n//# sourceMappingURL=VContainer.js.map","import \"../../../src/components/VGrid/_grid.sass\";\nimport { createSimpleFunctional } from '../../util/helpers';\nexport default createSimpleFunctional('spacer', 'div', 'v-spacer');\n//# sourceMappingURL=VSpacer.js.map","// Mixins\nimport Measurable from '../../mixins/measurable';\nimport Toggleable from '../../mixins/toggleable'; // Directives\n\nimport intersect from '../../directives/intersect'; // Utilities\n\nimport mixins from '../../util/mixins';\nimport { getSlot } from '../../util/helpers';\nexport default mixins(Measurable, Toggleable).extend({\n  name: 'VLazy',\n  directives: {\n    intersect\n  },\n  props: {\n    options: {\n      type: Object,\n      // For more information on types, navigate to:\n      // https://developer.mozilla.org/en-US/docs/Web/API/Intersection_Observer_API\n      default: () => ({\n        root: undefined,\n        rootMargin: undefined,\n        threshold: undefined\n      })\n    },\n    tag: {\n      type: String,\n      default: 'div'\n    },\n    transition: {\n      type: String,\n      default: 'fade-transition'\n    }\n  },\n  computed: {\n    styles() {\n      return { ...this.measurableStyles\n      };\n    }\n\n  },\n  methods: {\n    genContent() {\n      const children = this.isActive && getSlot(this);\n      return this.transition ? this.$createElement('transition', {\n        props: {\n          name: this.transition\n        }\n      }, children) : children;\n    },\n\n    onObserve(entries, observer, isIntersecting) {\n      if (this.isActive) return;\n      this.isActive = isIntersecting;\n    }\n\n  },\n\n  render(h) {\n    return h(this.tag, {\n      staticClass: 'v-lazy',\n      attrs: this.$attrs,\n      directives: [{\n        name: 'intersect',\n        value: {\n          handler: this.onObserve,\n          options: this.options\n        }\n      }],\n      on: this.$listeners,\n      style: this.styles\n    }, [this.genContent()]);\n  }\n\n});\n//# sourceMappingURL=VLazy.js.map","// Styles\nimport \"../../../src/components/VSnackbar/VSnackbar.sass\"; // Components\n\nimport VSheet from '../VSheet/VSheet'; // Mixins\n\nimport Colorable from '../../mixins/colorable';\nimport Themeable from '../../mixins/themeable';\nimport Toggleable from '../../mixins/toggleable';\nimport { factory as PositionableFactory } from '../../mixins/positionable'; // Utilities\n\nimport mixins from '../../util/mixins';\nimport { convertToUnit, getSlot } from '../../util/helpers';\nimport { deprecate, removed } from '../../util/console';\nexport default mixins(VSheet, Colorable, Toggleable, PositionableFactory(['absolute', 'bottom', 'left', 'right', 'top'])\n/* @vue/component */\n).extend({\n  name: 'v-snackbar',\n  props: {\n    app: Boolean,\n    centered: Boolean,\n    contentClass: {\n      type: String,\n      default: ''\n    },\n    multiLine: Boolean,\n    text: Boolean,\n    timeout: {\n      type: [Number, String],\n      default: 5000\n    },\n    transition: {\n      type: [Boolean, String],\n      default: 'v-snack-transition',\n      validator: v => typeof v === 'string' || v === false\n    },\n    vertical: Boolean\n  },\n  data: () => ({\n    activeTimeout: -1\n  }),\n  computed: {\n    classes() {\n      return {\n        'v-snack--absolute': this.absolute,\n        'v-snack--active': this.isActive,\n        'v-snack--bottom': this.bottom || !this.top,\n        'v-snack--centered': this.centered,\n        'v-snack--has-background': this.hasBackground,\n        'v-snack--left': this.left,\n        'v-snack--multi-line': this.multiLine && !this.vertical,\n        'v-snack--right': this.right,\n        'v-snack--text': this.text,\n        'v-snack--top': this.top,\n        'v-snack--vertical': this.vertical\n      };\n    },\n\n    // Text and outlined styles both\n    // use transparent backgrounds\n    hasBackground() {\n      return !this.text && !this.outlined;\n    },\n\n    // Snackbar is dark by default\n    // override themeable logic.\n    isDark() {\n      return this.hasBackground ? !this.light : Themeable.options.computed.isDark.call(this);\n    },\n\n    styles() {\n      if (this.absolute || !this.app) return {};\n      const {\n        bar,\n        bottom,\n        footer,\n        insetFooter,\n        left,\n        right,\n        top\n      } = this.$vuetify.application;\n      return {\n        paddingBottom: convertToUnit(bottom + footer + insetFooter),\n        paddingLeft: convertToUnit(left),\n        paddingRight: convertToUnit(right),\n        paddingTop: convertToUnit(bar + top)\n      };\n    }\n\n  },\n  watch: {\n    isActive: 'setTimeout',\n    timeout: 'setTimeout'\n  },\n\n  mounted() {\n    if (this.isActive) this.setTimeout();\n  },\n\n  created() {\n    /* istanbul ignore next */\n    if (this.$attrs.hasOwnProperty('auto-height')) {\n      removed('auto-height', this);\n    }\n    /* istanbul ignore next */\n    // eslint-disable-next-line eqeqeq\n\n\n    if (this.timeout == 0) {\n      deprecate('timeout=\"0\"', '-1', this);\n    }\n  },\n\n  methods: {\n    genActions() {\n      return this.$createElement('div', {\n        staticClass: 'v-snack__action '\n      }, [getSlot(this, 'action', {\n        attrs: {\n          class: 'v-snack__btn'\n        }\n      })]);\n    },\n\n    genContent() {\n      return this.$createElement('div', {\n        staticClass: 'v-snack__content',\n        class: {\n          [this.contentClass]: true\n        },\n        attrs: {\n          role: 'status',\n          'aria-live': 'polite'\n        }\n      }, [getSlot(this)]);\n    },\n\n    genWrapper() {\n      const setColor = this.hasBackground ? this.setBackgroundColor : this.setTextColor;\n      const data = setColor(this.color, {\n        staticClass: 'v-snack__wrapper',\n        class: VSheet.options.computed.classes.call(this),\n        style: VSheet.options.computed.styles.call(this),\n        directives: [{\n          name: 'show',\n          value: this.isActive\n        }],\n        on: {\n          pointerenter: () => window.clearTimeout(this.activeTimeout),\n          pointerleave: this.setTimeout\n        }\n      });\n      return this.$createElement('div', data, [this.genContent(), this.genActions()]);\n    },\n\n    genTransition() {\n      return this.$createElement('transition', {\n        props: {\n          name: this.transition\n        }\n      }, [this.genWrapper()]);\n    },\n\n    setTimeout() {\n      window.clearTimeout(this.activeTimeout);\n      const timeout = Number(this.timeout);\n\n      if (!this.isActive || // TODO: remove 0 in v3\n      [0, -1].includes(timeout)) {\n        return;\n      }\n\n      this.activeTimeout = window.setTimeout(() => {\n        this.isActive = false;\n      }, timeout);\n    }\n\n  },\n\n  render(h) {\n    return h('div', {\n      staticClass: 'v-snack',\n      class: this.classes,\n      style: this.styles\n    }, [this.transition !== false ? this.genTransition() : this.genWrapper()]);\n  }\n\n});\n//# sourceMappingURL=VSnackbar.js.map","// Styles\nimport \"../../../src/styles/components/_selection-controls.sass\";\nimport \"../../../src/components/VSwitch/VSwitch.sass\"; // Mixins\n\nimport Selectable from '../../mixins/selectable';\nimport VInput from '../VInput'; // Directives\n\nimport Touch from '../../directives/touch'; // Components\n\nimport { VFabTransition } from '../transitions';\nimport VProgressCircular from '../VProgressCircular/VProgressCircular'; // Helpers\n\nimport { getSlot, keyCodes } from '../../util/helpers';\n/* @vue/component */\n\nexport default Selectable.extend({\n  name: 'v-switch',\n  directives: {\n    Touch\n  },\n  props: {\n    inset: Boolean,\n    loading: {\n      type: [Boolean, String],\n      default: false\n    },\n    flat: {\n      type: Boolean,\n      default: false\n    }\n  },\n  computed: {\n    classes() {\n      return { ...VInput.options.computed.classes.call(this),\n        'v-input--selection-controls v-input--switch': true,\n        'v-input--switch--flat': this.flat,\n        'v-input--switch--inset': this.inset\n      };\n    },\n\n    attrs() {\n      return {\n        'aria-checked': String(this.isActive),\n        'aria-disabled': String(this.isDisabled),\n        role: 'switch'\n      };\n    },\n\n    // Do not return undefined if disabled,\n    // according to spec, should still show\n    // a color when disabled and active\n    validationState() {\n      if (this.hasError && this.shouldValidate) return 'error';\n      if (this.hasSuccess) return 'success';\n      if (this.hasColor !== null) return this.computedColor;\n      return undefined;\n    },\n\n    switchData() {\n      return this.setTextColor(this.loading ? undefined : this.validationState, {\n        class: this.themeClasses\n      });\n    }\n\n  },\n  methods: {\n    genDefaultSlot() {\n      return [this.genSwitch(), this.genLabel()];\n    },\n\n    genSwitch() {\n      const {\n        title,\n        ...switchAttrs\n      } = this.attrs$;\n      return this.$createElement('div', {\n        staticClass: 'v-input--selection-controls__input'\n      }, [this.genInput('checkbox', { ...this.attrs,\n        ...switchAttrs\n      }), this.genRipple(this.setTextColor(this.validationState, {\n        directives: [{\n          name: 'touch',\n          value: {\n            left: this.onSwipeLeft,\n            right: this.onSwipeRight\n          }\n        }]\n      })), this.$createElement('div', {\n        staticClass: 'v-input--switch__track',\n        ...this.switchData\n      }), this.$createElement('div', {\n        staticClass: 'v-input--switch__thumb',\n        ...this.switchData\n      }, [this.genProgress()])]);\n    },\n\n    genProgress() {\n      return this.$createElement(VFabTransition, {}, [this.loading === false ? null : getSlot(this, 'progress') || this.$createElement(VProgressCircular, {\n        props: {\n          color: this.loading === true || this.loading === '' ? this.color || 'primary' : this.loading,\n          size: 16,\n          width: 2,\n          indeterminate: true\n        }\n      })]);\n    },\n\n    onSwipeLeft() {\n      if (this.isActive) this.onChange();\n    },\n\n    onSwipeRight() {\n      if (!this.isActive) this.onChange();\n    },\n\n    onKeydown(e) {\n      if (e.keyCode === keyCodes.left && this.isActive || e.keyCode === keyCodes.right && !this.isActive) this.onChange();\n    }\n\n  }\n});\n//# sourceMappingURL=VSwitch.js.map","// Components\nimport VToolbar from './VToolbar'; // Utilities\n\nimport { createSimpleFunctional } from '../../util/helpers';\nconst VToolbarTitle = createSimpleFunctional('v-toolbar__title');\nconst VToolbarItems = createSimpleFunctional('v-toolbar__items');\nexport { VToolbar, VToolbarItems, VToolbarTitle };\nexport default {\n  $_vuetify_subcomponents: {\n    VToolbar,\n    VToolbarItems,\n    VToolbarTitle\n  }\n};\n//# sourceMappingURL=index.js.map","<template>\n  <div>\n    <!--   This label should be linked to the text-field -->\n    <label\n      v-if=\"label\"\n      :class=\"{ 'body-1': bigLabel, 'black-text': bigLabel }\"\n    >{{ label }}</label>\n    <v-text-field\n      filled\n      solo\n      flat\n      v-bind=\"$attrs\"\n      v-on=\"$listeners\"\n      dense\n      :class=\"{ 'mt-2': bigLabel }\"\n      ref=\"text-field\"\n    >\n      <slot\n        v-for=\"slot in Object.keys($slots)\"\n        :name=\"slot\"\n        :slot=\"slot\"\n      />\n    </v-text-field>\n  </div>\n</template>\n<script>\nexport default {\n  name: \"EvaTextField\",\n  props: {\n    label: {\n      type: String,\n      default: \"\",\n    },\n    bigLabel: {\n      type: Boolean,\n      default: false,\n    },\n  },\n\n  methods: {\n    validate() {\n      return this.$refs[\"text-field\"].validate()\n    },\n    blur() {\n      this.$refs[\"text-field\"].blur()\n    },\n  },\n}\n</script>\n\n<style scoped>\n\n</style>\n","function _extends() {\n  return _extends = Object.assign ? Object.assign.bind() : function (n) {\n    for (var e = 1; e < arguments.length; e++) {\n      var t = arguments[e];\n      for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]);\n    }\n    return n;\n  }, _extends.apply(null, arguments);\n}\nexport { _extends as default };","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};","// 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.\n\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  if (x.isBigNumber === true && typeof x.constructor.prototype === 'object' && x.constructor.prototype.isBigNumber === true) {\n    return true;\n  }\n  if (typeof x.constructor.isDecimal === 'function' && x.constructor.isDecimal(x) === true) {\n    return true;\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/**\n * Test whether a value is a collection: an Array or Matrix\n * @param {*} x\n * @returns {boolean} isCollection\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}\n\n/* Very specialized: returns true for those nodes which in the numerator of\n   a fraction means that the division in that fraction has precedence over implicit\n   multiplication, e.g. -2/3 x parses as (-2/3) x and 3/4 x parses as (3/4) x but\n   6!/8 x parses as 6! / (8x). It is located here because it is shared between\n   parse.js and OperatorNode.js (for parsing and printing, respectively).\n\n   This should *not* be exported from mathjs, unlike most of the tests here.\n   Its name does not start with 'is' to prevent utils/snapshot.js from thinking\n   it should be exported.\n*/\nexport function rule2Node(node) {\n  return isConstantNode(node) || isOperatorNode(node) && node.args.length === 1 && isConstantNode(node.args[0]) && '-+~'.includes(node.op);\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 isRelationalNode(x) {\n  return x && x.isRelationalNode === 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  if (t === 'object') {\n    if (x === null) return 'null';\n    if (isBigNumber(x)) return 'BigNumber'; // Special: weird mashup with Decimal\n    if (x.constructor && x.constructor.name) return x.constructor.name;\n    return 'Object'; // just in case\n  }\n  return t; // can be 'string', 'number', 'boolean', 'function', 'bigint', ...\n}","import { isBigNumber, isObject } from './is.js';\n\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 */\nexport function clone(x) {\n  var type = typeof x;\n\n  // immutable primitive types\n  if (type === 'number' || type === 'string' || type === 'boolean' || x === null || x === undefined) {\n    return x;\n  }\n\n  // use clone function of the object when available\n  if (typeof x.clone === 'function') {\n    return x.clone();\n  }\n\n  // array\n  if (Array.isArray(x)) {\n    return x.map(function (value) {\n      return clone(value);\n    });\n  }\n  if (x instanceof Date) return new Date(x.valueOf());\n  if (isBigNumber(x)) return x; // bignumbers are immutable\n\n  // object\n  if (isObject(x)) {\n    return mapObject(x, clone);\n  }\n  throw new TypeError(\"Cannot clone: unknown type of value (value: \".concat(x, \")\"));\n}\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 */\nexport function mapObject(object, callback) {\n  var clone = {};\n  for (var key in object) {\n    if (hasOwnProperty(object, key)) {\n      clone[key] = callback(object[key]);\n    }\n  }\n  return clone;\n}\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 */\nexport function extend(a, b) {\n  for (var prop in b) {\n    if (hasOwnProperty(b, prop)) {\n      a[prop] = b[prop];\n    }\n  }\n  return a;\n}\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 */\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  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        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  return a;\n}\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 */\nexport function deepStrictEqual(a, b) {\n  var prop, i, len;\n  if (Array.isArray(a)) {\n    if (!Array.isArray(b)) {\n      return false;\n    }\n    if (a.length !== b.length) {\n      return false;\n    }\n    for (i = 0, len = a.length; i < len; i++) {\n      if (!deepStrictEqual(a[i], b[i])) {\n        return false;\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    for (prop in a) {\n      // noinspection JSUnfilteredForInLoop\n      if (!(prop in b) || !deepStrictEqual(a[prop], b[prop])) {\n        return false;\n      }\n    }\n    for (prop in b) {\n      // noinspection JSUnfilteredForInLoop\n      if (!(prop in a)) {\n        return false;\n      }\n    }\n    return true;\n  } else {\n    return a === b;\n  }\n}\n\n/**\n * Recursively flatten a nested object.\n * @param {Object} nestedObject\n * @return {Object} Returns the flattened object\n */\nexport function deepFlatten(nestedObject) {\n  var flattenedObject = {};\n  _deepFlatten(nestedObject, flattenedObject);\n  return flattenedObject;\n}\n\n// helper function used by deepFlatten\nfunction _deepFlatten(nestedObject, flattenedObject) {\n  for (var prop in nestedObject) {\n    if (hasOwnProperty(nestedObject, prop)) {\n      var value = nestedObject[prop];\n      if (typeof value === 'object' && value !== null) {\n        _deepFlatten(value, flattenedObject);\n      } else {\n        flattenedObject[prop] = value;\n      }\n    }\n  }\n}\n\n/**\n * Test whether the current JavaScript engine supports Object.defineProperty\n * @returns {boolean} returns true if supported\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          return null;\n        }\n      });\n      return true;\n    }\n  } catch (e) {}\n  return false;\n}\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 */\nexport function lazy(object, prop, valueResolver) {\n  var _uninitialized = true;\n  var _value;\n  Object.defineProperty(object, prop, {\n    get: function get() {\n      if (_uninitialized) {\n        _value = valueResolver();\n        _uninitialized = false;\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/**\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 */\nexport function traverse(object, path) {\n  if (path && typeof path === 'string') {\n    return traverse(object, path.split('.'));\n  }\n  var obj = object;\n  if (path) {\n    for (var i = 0; i < path.length; i++) {\n      var key = path[i];\n      if (!(key in obj)) {\n        obj[key] = {};\n      }\n      obj = obj[key];\n    }\n  }\n  return obj;\n}\n\n/**\n * A safe hasOwnProperty\n * @param {Object} object\n * @param {string} property\n */\nexport function hasOwnProperty(object, property) {\n  return object && Object.hasOwnProperty.call(object, property);\n}\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 */\nexport function isLegacyFactory(object) {\n  return object && typeof object.factory === 'function';\n}\n\n/**\n * Get a nested property from an object\n * @param {Object} object\n * @param {string | string[]} path\n * @returns {Object}\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  var child = object;\n  for (var i = 0; i < path.length; i++) {\n    var key = path[i];\n    child = child ? child[key] : undefined;\n  }\n  return child;\n}\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 */\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  var child = object;\n  for (var i = 0; i < path.length - 1; i++) {\n    var key = path[i];\n    if (child[key] === undefined) {\n      child[key] = {};\n    }\n    child = child[key];\n  }\n  if (path.length > 0) {\n    var lastKey = path[path.length - 1];\n    child[lastKey] = value;\n  }\n  return object;\n}\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 */\nexport function pick(object, properties, transform) {\n  var copy = {};\n  for (var i = 0; i < properties.length; i++) {\n    var key = properties[i];\n    var value = get(object, key);\n    if (value !== undefined) {\n      set(copy, key, transform ? transform(value, key) : value);\n    }\n  }\n  return copy;\n}\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 */\nexport function pickShallow(object, properties) {\n  var copy = {};\n  for (var i = 0; i < properties.length; i++) {\n    var key = properties[i];\n    var value = object[key];\n    if (value !== undefined) {\n      copy[key] = value;\n    }\n  }\n  return copy;\n}\n\n// helper function to test whether a string contains a path like 'user.name'\nfunction isPath(str) {\n  return str.includes('.');\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\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);\n\n      // validate some of the options\n      validateOption(options, 'matrix', MATRIX_OPTIONS);\n      validateOption(options, 'number', NUMBER_OPTIONS);\n\n      // merge options\n      deepExtend(config, options);\n      var curr = mapObject(config, clone);\n      var changes = mapObject(options, clone);\n\n      // emit 'config' event\n      emit('config', curr, prev, changes);\n      return curr;\n    } else {\n      return mapObject(config, clone);\n    }\n  }\n\n  // attach the valid options to the function so they can be extended\n  _config.MATRIX_OPTIONS = MATRIX_OPTIONS;\n  _config.NUMBER_OPTIONS = NUMBER_OPTIONS;\n\n  // attach the config properties as readonly properties to the config function\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/**\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 */\nfunction validateOption(options, name, values) {\n  if (options[name] !== undefined && !values.includes(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}","import _extends from \"@babel/runtime/helpers/extends\";\nimport { DEFAULT_CONFIG } from '../core/config.js';\nimport { MATRIX_OPTIONS, NUMBER_OPTIONS } from '../core/function/config.js';\n\n// create a read-only version of config\nexport var config = function config(options) {\n  if (options) {\n    throw new Error('The global config is readonly. \\n' + 'Please create a mathjs instance if you want to change the default configuration. \\n' + 'Example:\\n' + '\\n' + '  import { create, all } from \\'mathjs\\';\\n' + '  const mathjs = create(all);\\n' + '  mathjs.config({ number: \\'BigNumber\\' });\\n');\n  }\n  return Object.freeze(DEFAULT_CONFIG);\n};\n_extends(config, DEFAULT_CONFIG, {\n  MATRIX_OPTIONS,\n  NUMBER_OPTIONS\n});","function ok() {\n  return true;\n}\n\nfunction notOk() {\n  return false;\n}\n\nfunction undef() {\n  return undefined;\n}\n\nconst NOT_TYPED_FUNCTION = 'Argument is not a typed-function.';\n/**\n * @typedef {{\n *   params: Param[],\n *   fn: function,\n *   test: function,\n *   implementation: function\n * }} Signature\n *\n * @typedef {{\n *   types: Type[],\n *   hasAny: boolean,\n *   hasConversion: boolean,\n *   restParam: boolean\n * }} Param\n *\n * @typedef {{\n *   name: string,\n *   typeIndex: number,\n *   test: function,\n *   isAny: boolean,\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 *   isAny?: boolean\n * }} TypeDef\n */\n\n/**\n * @returns {() => function}\n */\n\nfunction create() {\n  // data type tests\n\n  /**\n   * Returns true if the argument is a non-null \"plain\" object\n   */\n  function isPlainObject(x) {\n    return typeof x === 'object' && x !== null && x.constructor === Object;\n  }\n\n  const _types = [{\n    name: 'number',\n    test: function (x) {\n      return typeof x === 'number';\n    }\n  }, {\n    name: 'string',\n    test: function (x) {\n      return typeof x === 'string';\n    }\n  }, {\n    name: 'boolean',\n    test: function (x) {\n      return typeof x === 'boolean';\n    }\n  }, {\n    name: 'Function',\n    test: function (x) {\n      return typeof x === 'function';\n    }\n  }, {\n    name: 'Array',\n    test: Array.isArray\n  }, {\n    name: 'Date',\n    test: function (x) {\n      return x instanceof Date;\n    }\n  }, {\n    name: 'RegExp',\n    test: function (x) {\n      return x instanceof RegExp;\n    }\n  }, {\n    name: 'Object',\n    test: isPlainObject\n  }, {\n    name: 'null',\n    test: function (x) {\n      return x === null;\n    }\n  }, {\n    name: 'undefined',\n    test: function (x) {\n      return x === undefined;\n    }\n  }];\n  const anyType = {\n    name: 'any',\n    test: ok,\n    isAny: true\n  }; // Data structures to track the types. As these are local variables in\n  // create(), each typed universe will get its own copy, but the variables\n  // will only be accessible through the (closures of the) functions supplied\n  // as properties of the typed object, not directly.\n  // These will be initialized in clear() below\n\n  let typeMap; // primary store of all types\n\n  let typeList; // Array of just type names, for the sake of ordering\n  // And similar data structures for the type conversions:\n\n  let nConversions = 0; // the actual conversions are stored on a property of the destination types\n  // This is a temporary object, will be replaced with a function at the end\n\n  let typed = {\n    createCount: 0\n  };\n  /**\n   * Takes a type name and returns the corresponding official type object\n   * for that type.\n   *\n   * @param {string} typeName\n   * @returns {TypeDef} type\n   */\n\n  function findType(typeName) {\n    const type = typeMap.get(typeName);\n\n    if (type) {\n      return type;\n    } // Remainder is error handling\n\n\n    let message = 'Unknown type \"' + typeName + '\"';\n    const name = typeName.toLowerCase();\n    let otherName;\n\n    for (otherName of typeList) {\n      if (otherName.toLowerCase() === name) {\n        message += '. Did you mean \"' + otherName + '\" ?';\n        break;\n      }\n    }\n\n    throw new TypeError(message);\n  }\n  /**\n   * Adds an array `types` of type definitions to this typed instance.\n   * Each type definition should be an object with properties:\n   * 'name' - a string giving the name of the type; 'test' - function\n   * returning a boolean that tests membership in the type; and optionally\n   * 'isAny' - true only for the 'any' type.\n   *\n   * The second optional argument, `before`, gives the name of a type that\n   * these types should be added before. The new types are added in the\n   * order specified.\n   * @param {TypeDef[]} types\n   * @param {string | boolean} [beforeSpec='any'] before\n   */\n\n\n  function addTypes(types) {\n    let beforeSpec = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'any';\n    const beforeIndex = beforeSpec ? findType(beforeSpec).index : typeList.length;\n    const newTypes = [];\n\n    for (let i = 0; i < types.length; ++i) {\n      if (!types[i] || typeof types[i].name !== 'string' || typeof types[i].test !== 'function') {\n        throw new TypeError('Object with properties {name: string, test: function} expected');\n      }\n\n      const typeName = types[i].name;\n\n      if (typeMap.has(typeName)) {\n        throw new TypeError('Duplicate type name \"' + typeName + '\"');\n      }\n\n      newTypes.push(typeName);\n      typeMap.set(typeName, {\n        name: typeName,\n        test: types[i].test,\n        isAny: types[i].isAny,\n        index: beforeIndex + i,\n        conversionsTo: [] // Newly added type can't have any conversions to it\n\n      });\n    } // update the typeList\n\n\n    const affectedTypes = typeList.slice(beforeIndex);\n    typeList = typeList.slice(0, beforeIndex).concat(newTypes).concat(affectedTypes); // Fix the indices\n\n    for (let i = beforeIndex + newTypes.length; i < typeList.length; ++i) {\n      typeMap.get(typeList[i]).index = i;\n    }\n  }\n  /**\n   * Removes all types and conversions from this typed instance.\n   * May cause previously constructed typed-functions to throw\n   * strange errors when they are called with types that do not\n   * match any of their signatures.\n   */\n\n\n  function clear() {\n    typeMap = new Map();\n    typeList = [];\n    nConversions = 0;\n    addTypes([anyType], false);\n  } // initialize the types to the default list\n\n\n  clear();\n  addTypes(_types);\n  /**\n   * Removes all conversions, leaving the types alone.\n   */\n\n  function clearConversions() {\n    let typeName;\n\n    for (typeName of typeList) {\n      typeMap.get(typeName).conversionsTo = [];\n    }\n\n    nConversions = 0;\n  }\n  /**\n   * Find the type names that match a value.\n   * @param {*} value\n   * @return {string[]} Array of names of types for which\n   *                  the type test matches the value.\n   */\n\n\n  function findTypeNames(value) {\n    const matches = typeList.filter(name => {\n      const type = typeMap.get(name);\n      return !type.isAny && type.test(value);\n    });\n\n    if (matches.length) {\n      return matches;\n    }\n\n    return ['any'];\n  }\n  /**\n   * Check if an entity is a typed function created by any instance\n   * @param {any} entity\n   * @returns {boolean}\n   */\n\n\n  function isTypedFunction(entity) {\n    return entity && typeof entity === 'function' && '_typedFunctionData' in entity;\n  }\n  /**\n   * Find a specific signature from a (composed) typed function, for example:\n   *\n   *   typed.findSignature(fn, ['number', 'string'])\n   *   typed.findSignature(fn, 'number, string')\n   *   typed.findSignature(fn, 'number,string', {exact: true})\n   *\n   * This function findSignature will by default return the best match to\n   * the given signature, possibly employing type conversions.\n   *\n   * The (optional) third argument is a plain object giving options\n   * controlling the signature search. Currently the only implemented\n   * option is `exact`: if specified as true (default is false), only\n   * exact matches will be returned (i.e. signatures for which `fn` was\n   * directly defined). Note that a (possibly different) type matching\n   * `any`, or one or more instances of TYPE matching `...TYPE` are\n   * considered exact matches in this regard, as no conversions are used.\n   *\n   * This function returns a \"signature\" object, as does `typed.resolve()`,\n   * which is a plain object with four keys: `params` (the array of parameters\n   * for this signature), `fn` (the originally supplied function for this\n   * signature), `test` (a generated function that determines if an argument\n   * list matches this signature, and `implementation` (the function to call\n   * on a matching argument list, that performs conversions if necessary and\n   * then calls the originally supplied function).\n   *\n   * @param {Function} fn                   A typed-function\n   * @param {string | string[]} signature\n   *     Signature to be found, can be an array or a comma separated string.\n   * @param {object} options  Controls the signature search as documented\n   * @return {{ params: Param[], fn: function, test: function, implementation: function }}\n   *     Returns the matching signature, or throws an error when no signature\n   *     is found.\n   */\n\n\n  function findSignature(fn, signature, options) {\n    if (!isTypedFunction(fn)) {\n      throw new TypeError(NOT_TYPED_FUNCTION);\n    } // Canonicalize input\n\n\n    const exact = options && options.exact;\n    const stringSignature = Array.isArray(signature) ? signature.join(',') : signature;\n    const params = parseSignature(stringSignature);\n    const canonicalSignature = stringifyParams(params); // First hope we get lucky and exactly match a signature\n\n    if (!exact || canonicalSignature in fn.signatures) {\n      // OK, we can check the internal signatures\n      const match = fn._typedFunctionData.signatureMap.get(canonicalSignature);\n\n      if (match) {\n        return match;\n      }\n    } // Oh well, we did not; so we have to go back and check the parameters\n    // one by one, in order to catch things like `any` and rest params.\n    // Note here we can assume there is at least one parameter, because\n    // the empty signature would have matched successfully above.\n\n\n    const nParams = params.length;\n    let remainingSignatures;\n\n    if (exact) {\n      remainingSignatures = [];\n      let name;\n\n      for (name in fn.signatures) {\n        remainingSignatures.push(fn._typedFunctionData.signatureMap.get(name));\n      }\n    } else {\n      remainingSignatures = fn._typedFunctionData.signatures;\n    }\n\n    for (let i = 0; i < nParams; ++i) {\n      const want = params[i];\n      const filteredSignatures = [];\n      let possibility;\n\n      for (possibility of remainingSignatures) {\n        const have = getParamAtIndex(possibility.params, i);\n\n        if (!have || want.restParam && !have.restParam) {\n          continue;\n        }\n\n        if (!have.hasAny) {\n          // have to check all of the wanted types are available\n          const haveTypes = paramTypeSet(have);\n\n          if (want.types.some(wtype => !haveTypes.has(wtype.name))) {\n            continue;\n          }\n        } // OK, this looks good\n\n\n        filteredSignatures.push(possibility);\n      }\n\n      remainingSignatures = filteredSignatures;\n      if (remainingSignatures.length === 0) break;\n    } // Return the first remaining signature that was totally matched:\n\n\n    let candidate;\n\n    for (candidate of remainingSignatures) {\n      if (candidate.params.length <= nParams) {\n        return candidate;\n      }\n    }\n\n    throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + stringifyParams(params, ', ') + '))');\n  }\n  /**\n   * Find the proper function to call for a specific signature from\n   * a (composed) typed function, for example:\n   *\n   *   typed.find(fn, ['number', 'string'])\n   *   typed.find(fn, 'number, string')\n   *   typed.find(fn, 'number,string', {exact: true})\n   *\n   * This function find will by default return the best match to\n   * the given signature, possibly employing type conversions (and returning\n   * a function that will perform those conversions as needed). The\n   * (optional) third argument is a plain object giving options contolling\n   * the signature search. Currently only the option `exact` is implemented,\n   * which defaults to \"false\". If `exact` is specified as true, then only\n   * exact matches will be returned (i.e. signatures for which `fn` was\n   * directly defined). Uses of `any` and `...TYPE` are considered exact if\n   * no conversions are necessary to apply the corresponding function.\n   *\n   * @param {Function} fn                   A typed-function\n   * @param {string | string[]} signature\n   *     Signature to be found, can be an array or a comma separated string.\n   * @param {object} options  Controls the signature match as documented\n   * @return {function}\n   *     Returns the function to call for the given signature, or throws an\n   *     error if no match is found.\n   */\n\n\n  function find(fn, signature, options) {\n    return findSignature(fn, signature, options).implementation;\n  }\n  /**\n   * Convert a given value to another data type, specified by type name.\n   *\n   * @param {*} value\n   * @param {string} typeName\n   */\n\n\n  function convert(value, typeName) {\n    // check conversion is needed\n    const type = findType(typeName);\n\n    if (type.test(value)) {\n      return value;\n    }\n\n    const conversions = type.conversionsTo;\n\n    if (conversions.length === 0) {\n      throw new Error('There are no conversions to ' + typeName + ' defined.');\n    }\n\n    for (let i = 0; i < conversions.length; i++) {\n      const fromType = findType(conversions[i].from);\n\n      if (fromType.test(value)) {\n        return conversions[i].convert(value);\n      }\n    }\n\n    throw new Error('Cannot convert ' + value + ' to ' + typeName);\n  }\n  /**\n   * Stringify parameters in a normalized way\n   * @param {Param[]} params\n   * @param {string} [','] separator\n   * @return {string}\n   */\n\n\n  function stringifyParams(params) {\n    let separator = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : ',';\n    return params.map(p => p.name).join(separator);\n  }\n  /**\n   * Parse a parameter, like \"...number | boolean\"\n   * @param {string} param\n   * @return {Param} param\n   */\n\n\n  function parseParam(param) {\n    const restParam = param.indexOf('...') === 0;\n    const types = !restParam ? param : param.length > 3 ? param.slice(3) : 'any';\n    const typeDefs = types.split('|').map(s => findType(s.trim()));\n    let hasAny = false;\n    let paramName = restParam ? '...' : '';\n    const exactTypes = typeDefs.map(function (type) {\n      hasAny = type.isAny || hasAny;\n      paramName += type.name + '|';\n      return {\n        name: type.name,\n        typeIndex: type.index,\n        test: type.test,\n        isAny: type.isAny,\n        conversion: null,\n        conversionIndex: -1\n      };\n    });\n    return {\n      types: exactTypes,\n      name: paramName.slice(0, -1),\n      // remove trailing '|' from above\n      hasAny,\n      hasConversion: false,\n      restParam\n    };\n  }\n  /**\n   * Expands a parsed parameter with the types available from currently\n   * defined conversions.\n   * @param {Param} param\n   * @return {Param} param\n   */\n\n\n  function expandParam(param) {\n    const typeNames = param.types.map(t => t.name);\n    const matchingConversions = availableConversions(typeNames);\n    let hasAny = param.hasAny;\n    let newName = param.name;\n    const convertibleTypes = matchingConversions.map(function (conversion) {\n      const type = findType(conversion.from);\n      hasAny = type.isAny || hasAny;\n      newName += '|' + conversion.from;\n      return {\n        name: conversion.from,\n        typeIndex: type.index,\n        test: type.test,\n        isAny: type.isAny,\n        conversion,\n        conversionIndex: conversion.index\n      };\n    });\n    return {\n      types: param.types.concat(convertibleTypes),\n      name: newName,\n      hasAny,\n      hasConversion: convertibleTypes.length > 0,\n      restParam: param.restParam\n    };\n  }\n  /**\n   * Return the set of type names in a parameter.\n   * Caches the result for efficiency\n   *\n   * @param {Param} param\n   * @return {Set<string>} typenames\n   */\n\n\n  function paramTypeSet(param) {\n    if (!param.typeSet) {\n      param.typeSet = new Set();\n      param.types.forEach(type => param.typeSet.add(type.name));\n    }\n\n    return param.typeSet;\n  }\n  /**\n   * Parse a signature with comma separated parameters,\n   * like \"number | boolean, ...string\"\n   *\n   * @param {string} signature\n   * @return {Param[]} params\n   */\n\n\n  function parseSignature(rawSignature) {\n    const params = [];\n\n    if (typeof rawSignature !== 'string') {\n      throw new TypeError('Signatures must be strings');\n    }\n\n    const signature = rawSignature.trim();\n\n    if (signature === '') {\n      return params;\n    }\n\n    const rawParams = signature.split(',');\n\n    for (let i = 0; i < rawParams.length; ++i) {\n      const parsedParam = parseParam(rawParams[i].trim());\n\n      if (parsedParam.restParam && i !== rawParams.length - 1) {\n        throw new SyntaxError('Unexpected rest parameter \"' + rawParams[i] + '\": ' + 'only allowed for the last parameter');\n      } // if invalid, short-circuit (all the types may have been filtered)\n\n\n      if (parsedParam.types.length === 0) {\n        return null;\n      }\n\n      params.push(parsedParam);\n    }\n\n    return params;\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\n\n  function hasRestParam(params) {\n    const param = last(params);\n    return param ? param.restParam : false;\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\n\n  function compileTest(param) {\n    if (!param || param.types.length === 0) {\n      // nothing to do\n      return ok;\n    } else if (param.types.length === 1) {\n      return findType(param.types[0].name).test;\n    } else if (param.types.length === 2) {\n      const test0 = findType(param.types[0].name).test;\n      const test1 = findType(param.types[1].name).test;\n      return function or(x) {\n        return test0(x) || test1(x);\n      };\n    } else {\n      // param.types.length > 2\n      const tests = param.types.map(function (type) {\n        return findType(type.name).test;\n      });\n      return function or(x) {\n        for (let i = 0; i < tests.length; i++) {\n          if (tests[i](x)) {\n            return true;\n          }\n        }\n\n        return false;\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\n\n  function compileTests(params) {\n    let tests, test0, test1;\n\n    if (hasRestParam(params)) {\n      // variable arguments like '...number'\n      tests = initial(params).map(compileTest);\n      const varIndex = tests.length;\n      const lastTest = compileTest(last(params));\n\n      const testRestParam = function (args) {\n        for (let i = varIndex; i < args.length; i++) {\n          if (!lastTest(args[i])) {\n            return false;\n          }\n        }\n\n        return true;\n      };\n\n      return function testArgs(args) {\n        for (let i = 0; i < tests.length; i++) {\n          if (!tests[i](args[i])) {\n            return false;\n          }\n        }\n\n        return testRestParam(args) && args.length >= varIndex + 1;\n      };\n    } else {\n      // no variable arguments\n      if (params.length === 0) {\n        return function testArgs(args) {\n          return args.length === 0;\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      } 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      } else {\n        // arguments.length > 2\n        tests = params.map(compileTest);\n        return function testArgs(args) {\n          for (let i = 0; i < tests.length; i++) {\n            if (!tests[i](args[i])) {\n              return false;\n            }\n          }\n\n          return args.length === tests.length;\n        };\n      }\n    }\n  }\n  /**\n   * Find the parameter at a specific index of a Params list.\n   * Handles rest parameters.\n   * @param {Param[]} params\n   * @param {number} index\n   * @return {Param | null} Returns the matching parameter when found,\n   *                        null otherwise.\n   */\n\n\n  function getParamAtIndex(params, index) {\n    return index < params.length ? params[index] : hasRestParam(params) ? last(params) : null;\n  }\n  /**\n   * Get all type names of a parameter\n   * @param {Params[]} params\n   * @param {number} index\n   * @return {string[]} Returns an array with type names\n   */\n\n\n  function getTypeSetAtIndex(params, index) {\n    const param = getParamAtIndex(params, index);\n\n    if (!param) {\n      return new Set();\n    }\n\n    return paramTypeSet(param);\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\n\n  function isExactType(type) {\n    return type.conversion === null || type.conversion === undefined;\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\n\n  function mergeExpectedParams(signatures, index) {\n    const typeSet = new Set();\n    signatures.forEach(signature => {\n      const paramSet = getTypeSetAtIndex(signature.params, index);\n      let name;\n\n      for (name of paramSet) {\n        typeSet.add(name);\n      }\n    });\n    return typeSet.has('any') ? ['any'] : Array.from(typeSet);\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\n\n  function createError(name, args, signatures) {\n    let err, expected;\n\n    const _name = name || 'unnamed'; // test for wrong type at some index\n\n\n    let matchingSignatures = signatures;\n    let index;\n\n    for (index = 0; index < args.length; index++) {\n      const nextMatchingDefs = [];\n      matchingSignatures.forEach(signature => {\n        const param = getParamAtIndex(signature.params, index);\n        const test = compileTest(param);\n\n        if ((index < signature.params.length || hasRestParam(signature.params)) && test(args[index])) {\n          nextMatchingDefs.push(signature);\n        }\n      });\n\n      if (nextMatchingDefs.length === 0) {\n        // no matching signatures anymore, throw error \"wrong type\"\n        expected = mergeExpectedParams(matchingSignatures, index);\n\n        if (expected.length > 0) {\n          const actualTypes = findTypeNames(args[index]);\n          err = new TypeError('Unexpected type of argument in function ' + _name + ' (expected: ' + expected.join(' or ') + ', actual: ' + actualTypes.join(' | ') + ', index: ' + index + ')');\n          err.data = {\n            category: 'wrongType',\n            fn: _name,\n            index,\n            actual: actualTypes,\n            expected\n          };\n          return err;\n        }\n      } else {\n        matchingSignatures = nextMatchingDefs;\n      }\n    } // test for too few arguments\n\n\n    const lengths = matchingSignatures.map(function (signature) {\n      return hasRestParam(signature.params) ? Infinity : signature.params.length;\n    });\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 + ' (expected: ' + expected.join(' or ') + ', index: ' + args.length + ')');\n      err.data = {\n        category: 'tooFewArgs',\n        fn: _name,\n        index: args.length,\n        expected\n      };\n      return err;\n    } // test for too many arguments\n\n\n    const maxLength = Math.max.apply(null, lengths);\n\n    if (args.length > maxLength) {\n      err = new TypeError('Too many arguments in function ' + _name + ' (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    } // Generic error\n\n\n    const argTypes = [];\n\n    for (let i = 0; i < args.length; ++i) {\n      argTypes.push(findTypeNames(args[i]).join('|'));\n    }\n\n    err = new TypeError('Arguments of type \"' + argTypes.join(', ') + '\" do not match any of the defined signatures of function ' + _name + '.');\n    err.data = {\n      category: 'mismatch',\n      actual: argTypes\n    };\n    return err;\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\n\n  function getLowestTypeIndex(param) {\n    let min = typeList.length + 1;\n\n    for (let 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   * 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\n\n  function getLowestConversionIndex(param) {\n    let min = nConversions + 1;\n\n    for (let 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   * Compare two params\n   * @param {Param} param1\n   * @param {Param} param2\n   * @return {number} returns -1 when param1 must get a lower\n   *                  index than param2, 1 when the opposite,\n   *                  or zero when both are equal\n   */\n\n\n  function compareParams(param1, param2) {\n    // We compare a number of metrics on a param in turn:\n    // 1) 'any' parameters are the least preferred\n    if (param1.hasAny) {\n      if (!param2.hasAny) {\n        return 1;\n      }\n    } else if (param2.hasAny) {\n      return -1;\n    } // 2) Prefer non-rest to rest parameters\n\n\n    if (param1.restParam) {\n      if (!param2.restParam) {\n        return 1;\n      }\n    } else if (param2.restParam) {\n      return -1;\n    } // 3) Prefer exact type match to conversions\n\n\n    if (param1.hasConversion) {\n      if (!param2.hasConversion) {\n        return 1;\n      }\n    } else if (param2.hasConversion) {\n      return -1;\n    } // 4) Prefer lower type index:\n\n\n    const typeDiff = getLowestTypeIndex(param1) - getLowestTypeIndex(param2);\n\n    if (typeDiff < 0) {\n      return -1;\n    }\n\n    if (typeDiff > 0) {\n      return 1;\n    } // 5) Prefer lower conversion index\n\n\n    const convDiff = getLowestConversionIndex(param1) - getLowestConversionIndex(param2);\n\n    if (convDiff < 0) {\n      return -1;\n    }\n\n    if (convDiff > 0) {\n      return 1;\n    } // Don't have a basis for preference\n\n\n    return 0;\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\n\n  function compareSignatures(signature1, signature2) {\n    const pars1 = signature1.params;\n    const pars2 = signature2.params;\n    const last1 = last(pars1);\n    const last2 = last(pars2);\n    const hasRest1 = hasRestParam(pars1);\n    const hasRest2 = hasRestParam(pars2); // We compare a number of metrics on signatures in turn:\n    // 1) An \"any rest param\" is least preferred\n\n    if (hasRest1 && last1.hasAny) {\n      if (!hasRest2 || !last2.hasAny) {\n        return 1;\n      }\n    } else if (hasRest2 && last2.hasAny) {\n      return -1;\n    } // 2) Minimize the number of 'any' parameters\n\n\n    let any1 = 0;\n    let conv1 = 0;\n    let par;\n\n    for (par of pars1) {\n      if (par.hasAny) ++any1;\n      if (par.hasConversion) ++conv1;\n    }\n\n    let any2 = 0;\n    let conv2 = 0;\n\n    for (par of pars2) {\n      if (par.hasAny) ++any2;\n      if (par.hasConversion) ++conv2;\n    }\n\n    if (any1 !== any2) {\n      return any1 - any2;\n    } // 3) A conversion rest param is less preferred\n\n\n    if (hasRest1 && last1.hasConversion) {\n      if (!hasRest2 || !last2.hasConversion) {\n        return 1;\n      }\n    } else if (hasRest2 && last2.hasConversion) {\n      return -1;\n    } // 4) Minimize the number of conversions\n\n\n    if (conv1 !== conv2) {\n      return conv1 - conv2;\n    } // 5) Prefer no rest param\n\n\n    if (hasRest1) {\n      if (!hasRest2) {\n        return 1;\n      }\n    } else if (hasRest2) {\n      return -1;\n    } // 6) Prefer shorter with rest param, longer without\n\n\n    const lengthCriterion = (pars1.length - pars2.length) * (hasRest1 ? -1 : 1);\n\n    if (lengthCriterion !== 0) {\n      return lengthCriterion;\n    } // Signatures are identical in each of the above metrics.\n    // In particular, they are the same length.\n    // We can therefore compare the parameters one by one.\n    // First we count which signature has more preferred parameters.\n\n\n    const comparisons = [];\n    let tc = 0;\n\n    for (let i = 0; i < pars1.length; ++i) {\n      const thisComparison = compareParams(pars1[i], pars2[i]);\n      comparisons.push(thisComparison);\n      tc += thisComparison;\n    }\n\n    if (tc !== 0) {\n      return tc;\n    } // They have the same number of preferred parameters, so go by the\n    // earliest parameter in which we have a preference.\n    // In other words, dispatch is driven somewhat more by earlier\n    // parameters than later ones.\n\n\n    let c;\n\n    for (c of comparisons) {\n      if (c !== 0) {\n        return c;\n      }\n    } // It's a tossup:\n\n\n    return 0;\n  }\n  /**\n   * Produce a list of all conversions from distinct types to one of\n   * the given types.\n   *\n   * @param {string[]} typeNames\n   * @return {ConversionDef[]} Returns the conversions that are available\n   *                        resulting in any given type (if any)\n   */\n\n\n  function availableConversions(typeNames) {\n    if (typeNames.length === 0) {\n      return [];\n    }\n\n    const types = typeNames.map(findType);\n\n    if (typeNames.length > 1) {\n      types.sort((t1, t2) => t1.index - t2.index);\n    }\n\n    let matches = types[0].conversionsTo;\n\n    if (typeNames.length === 1) {\n      return matches;\n    }\n\n    matches = matches.concat([]); // shallow copy the matches\n    // Since the types are now in index order, we just want the first\n    // occurrence of any from type:\n\n    const knownTypes = new Set(typeNames);\n\n    for (let i = 1; i < types.length; ++i) {\n      let newMatch;\n\n      for (newMatch of types[i].conversionsTo) {\n        if (!knownTypes.has(newMatch.from)) {\n          matches.push(newMatch);\n          knownTypes.add(newMatch.from);\n        }\n      }\n    }\n\n    return matches;\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\n\n  function compileArgsPreprocessing(params, fn) {\n    let fnConvert = fn; // TODO: can we make this wrapper function smarter/simpler?\n\n    if (params.some(p => p.hasConversion)) {\n      const restParam = hasRestParam(params);\n      const compiledConversions = params.map(compileArgConversion);\n\n      fnConvert = function convertArgs() {\n        const args = [];\n        const last = restParam ? arguments.length - 1 : arguments.length;\n\n        for (let i = 0; i < last; i++) {\n          args[i] = compiledConversions[i](arguments[i]);\n        }\n\n        if (restParam) {\n          args[last] = arguments[last].map(compiledConversions[last]);\n        }\n\n        return fn.apply(this, args);\n      };\n    }\n\n    let fnPreprocess = fnConvert;\n\n    if (hasRestParam(params)) {\n      const offset = params.length - 1;\n\n      fnPreprocess = function preprocessRestParams() {\n        return fnConvert.apply(this, slice(arguments, 0, offset).concat([slice(arguments, offset)]));\n      };\n    }\n\n    return fnPreprocess;\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\n\n  function compileArgConversion(param) {\n    let test0, test1, conversion0, conversion1;\n    const tests = [];\n    const conversions = [];\n    param.types.forEach(function (type) {\n      if (type.conversion) {\n        tests.push(findType(type.conversion.from).test);\n        conversions.push(type.conversion.convert);\n      }\n    }); // create optimized conversion functions depending on the number of conversions\n\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\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\n          if (test1(arg)) {\n            return conversion1(arg);\n          }\n\n          return arg;\n        };\n\n      default:\n        return function convertArg(arg) {\n          for (let i = 0; i < conversions.length; i++) {\n            if (tests[i](arg)) {\n              return conversions[i](arg);\n            }\n          }\n\n          return arg;\n        };\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   * @return {Param[]}\n   */\n\n\n  function splitParams(params) {\n    function _splitParams(params, index, paramsSoFar) {\n      if (index < params.length) {\n        const param = params[index];\n        let resultingParams = [];\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          const exactTypes = param.types.filter(isExactType);\n\n          if (exactTypes.length < param.types.length) {\n            resultingParams.push({\n              types: exactTypes,\n              name: '...' + exactTypes.map(t => t.name).join('|'),\n              hasAny: exactTypes.some(t => t.isAny),\n              hasConversion: false,\n              restParam: true\n            });\n          }\n\n          resultingParams.push(param);\n        } else {\n          // split all the types of a regular parameter into one type per param\n          resultingParams = param.types.map(function (type) {\n            return {\n              types: [type],\n              name: type.name,\n              hasAny: type.isAny,\n              hasConversion: type.conversion,\n              restParam: false\n            };\n          });\n        } // recurse over the groups with types\n\n\n        return flatMap(resultingParams, function (nextParam) {\n          return _splitParams(params, index + 1, paramsSoFar.concat([nextParam]));\n        });\n      } else {\n        // we've reached the end of the parameters.\n        return [paramsSoFar];\n      }\n    }\n\n    return _splitParams(params, 0, []);\n  }\n  /**\n   * Test whether two param lists represent conflicting signatures\n   * @param {Param[]} params1\n   * @param {Param[]} params2\n   * @return {boolean} Returns true when the signatures conflict, false otherwise.\n   */\n\n\n  function conflicting(params1, params2) {\n    const ii = Math.max(params1.length, params2.length);\n\n    for (let i = 0; i < ii; i++) {\n      const typeSet1 = getTypeSetAtIndex(params1, i);\n      const typeSet2 = getTypeSetAtIndex(params2, i);\n      let overlap = false;\n      let name;\n\n      for (name of typeSet2) {\n        if (typeSet1.has(name)) {\n          overlap = true;\n          break;\n        }\n      }\n\n      if (!overlap) {\n        return false;\n      }\n    }\n\n    const len1 = params1.length;\n    const len2 = params2.length;\n    const restParam1 = hasRestParam(params1);\n    const restParam2 = hasRestParam(params2);\n    return restParam1 ? restParam2 ? len1 === len2 : len2 >= len1 : restParam2 ? len1 >= len2 : len1 === len2;\n  }\n  /**\n   * Helper function for `resolveReferences` that returns a copy of\n   * functionList wihe any prior resolutions cleared out, in case we are\n   * recycling signatures from a prior typed function construction.\n   *\n   * @param {Array.<function|typed-reference>} functionList\n   * @return {Array.<function|typed-reference>}\n   */\n\n\n  function clearResolutions(functionList) {\n    return functionList.map(fn => {\n      if (isReferToSelf(fn)) {\n        return referToSelf(fn.referToSelf.callback);\n      }\n\n      if (isReferTo(fn)) {\n        return makeReferTo(fn.referTo.references, fn.referTo.callback);\n      }\n\n      return fn;\n    });\n  }\n  /**\n   * Take a list of references, a list of functions functionList, and a\n   * signatureMap indexing signatures into functionList, and return\n   * the list of resolutions, or a false-y value if they don't all\n   * resolve in a valid way (yet).\n   *\n   * @param {string[]} references\n   * @param {Array<function|typed-reference} functionList\n   * @param {Object.<string, integer>} signatureMap\n   * @return {function[] | false} resolutions\n   */\n\n\n  function collectResolutions(references, functionList, signatureMap) {\n    const resolvedReferences = [];\n    let reference;\n\n    for (reference of references) {\n      let resolution = signatureMap[reference];\n\n      if (typeof resolution !== 'number') {\n        throw new TypeError('No definition for referenced signature \"' + reference + '\"');\n      }\n\n      resolution = functionList[resolution];\n\n      if (typeof resolution !== 'function') {\n        return false;\n      }\n\n      resolvedReferences.push(resolution);\n    }\n\n    return resolvedReferences;\n  }\n  /**\n   * Resolve any references in the functionList for the typed function\n   * itself. The signatureMap tells which index in the functionList a\n   * given signature should be mapped to (for use in resolving typed.referTo)\n   * and self provides the destions of a typed.referToSelf.\n   *\n   * @param {Array<function | typed-reference-object>} functionList\n   * @param {Object.<string, function>} signatureMap\n   * @param {function} self  The typed-function itself\n   * @return {Array<function>} The list of resolved functions\n   */\n\n\n  function resolveReferences(functionList, signatureMap, self) {\n    const resolvedFunctions = clearResolutions(functionList);\n    const isResolved = new Array(resolvedFunctions.length).fill(false);\n    let leftUnresolved = true;\n\n    while (leftUnresolved) {\n      leftUnresolved = false;\n      let nothingResolved = true;\n\n      for (let i = 0; i < resolvedFunctions.length; ++i) {\n        if (isResolved[i]) continue;\n        const fn = resolvedFunctions[i];\n\n        if (isReferToSelf(fn)) {\n          resolvedFunctions[i] = fn.referToSelf.callback(self); // Preserve reference in case signature is reused someday:\n\n          resolvedFunctions[i].referToSelf = fn.referToSelf;\n          isResolved[i] = true;\n          nothingResolved = false;\n        } else if (isReferTo(fn)) {\n          const resolvedReferences = collectResolutions(fn.referTo.references, resolvedFunctions, signatureMap);\n\n          if (resolvedReferences) {\n            resolvedFunctions[i] = fn.referTo.callback.apply(this, resolvedReferences); // Preserve reference in case signature is reused someday:\n\n            resolvedFunctions[i].referTo = fn.referTo;\n            isResolved[i] = true;\n            nothingResolved = false;\n          } else {\n            leftUnresolved = true;\n          }\n        }\n      }\n\n      if (nothingResolved && leftUnresolved) {\n        throw new SyntaxError('Circular reference detected in resolving typed.referTo');\n      }\n    }\n\n    return resolvedFunctions;\n  }\n  /**\n   * Validate whether any of the function bodies contains a self-reference\n   * usage like `this(...)` or `this.signatures`. This self-referencing is\n   * deprecated since typed-function v3. It has been replaced with\n   * the functions typed.referTo and typed.referToSelf.\n   * @param {Object.<string, function>} signaturesMap\n   */\n\n\n  function validateDeprecatedThis(signaturesMap) {\n    // TODO: remove this deprecation warning logic some day (it's introduced in v3)\n    // match occurrences like 'this(' and 'this.signatures'\n    const deprecatedThisRegex = /\\bthis(\\(|\\.signatures\\b)/;\n    Object.keys(signaturesMap).forEach(signature => {\n      const fn = signaturesMap[signature];\n\n      if (deprecatedThisRegex.test(fn.toString())) {\n        throw new SyntaxError('Using `this` to self-reference a function ' + 'is deprecated since typed-function@3. ' + 'Use typed.referTo and typed.referToSelf instead.');\n      }\n    });\n  }\n  /**\n   * Create a typed function\n   * @param {String} name               The name for the typed function\n   * @param {Object.<string, function>} rawSignaturesMap\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\n\n  function createTypedFunction(name, rawSignaturesMap) {\n    typed.createCount++;\n\n    if (Object.keys(rawSignaturesMap).length === 0) {\n      throw new SyntaxError('No signatures provided');\n    }\n\n    if (typed.warnAgainstDeprecatedThis) {\n      validateDeprecatedThis(rawSignaturesMap);\n    } // Main processing loop for signatures\n\n\n    const parsedParams = [];\n    const originalFunctions = [];\n    const signaturesMap = {};\n    const preliminarySignatures = []; // may have duplicates from conversions\n\n    let signature;\n\n    for (signature in rawSignaturesMap) {\n      // A) Protect against polluted Object prototype:\n      if (!Object.prototype.hasOwnProperty.call(rawSignaturesMap, signature)) {\n        continue;\n      } // B) Parse the signature\n\n\n      const params = parseSignature(signature);\n      if (!params) continue; // C) Check for conflicts\n\n      parsedParams.forEach(function (pp) {\n        if (conflicting(pp, params)) {\n          throw new TypeError('Conflicting signatures \"' + stringifyParams(pp) + '\" and \"' + stringifyParams(params) + '\".');\n        }\n      });\n      parsedParams.push(params); // D) Store the provided function and add conversions\n\n      const functionIndex = originalFunctions.length;\n      originalFunctions.push(rawSignaturesMap[signature]);\n      const conversionParams = params.map(expandParam); // E) Split the signatures and collect them up\n\n      let sp;\n\n      for (sp of splitParams(conversionParams)) {\n        const spName = stringifyParams(sp);\n        preliminarySignatures.push({\n          params: sp,\n          name: spName,\n          fn: functionIndex\n        });\n\n        if (sp.every(p => !p.hasConversion)) {\n          signaturesMap[spName] = functionIndex;\n        }\n      }\n    }\n\n    preliminarySignatures.sort(compareSignatures); // Note the forward reference to theTypedFn\n\n    const resolvedFunctions = resolveReferences(originalFunctions, signaturesMap, theTypedFn); // Fill in the proper function for each signature\n\n    let s;\n\n    for (s in signaturesMap) {\n      if (Object.prototype.hasOwnProperty.call(signaturesMap, s)) {\n        signaturesMap[s] = resolvedFunctions[signaturesMap[s]];\n      }\n    }\n\n    const signatures = [];\n    const internalSignatureMap = new Map(); // benchmarks faster than object\n\n    for (s of preliminarySignatures) {\n      // Note it's only safe to eliminate duplicates like this\n      // _after_ the signature sorting step above; otherwise we might\n      // remove the wrong one.\n      if (!internalSignatureMap.has(s.name)) {\n        s.fn = resolvedFunctions[s.fn];\n        signatures.push(s);\n        internalSignatureMap.set(s.name, s);\n      }\n    } // we create a highly optimized checks for the first couple of signatures with max 2 arguments\n\n\n    const ok0 = signatures[0] && signatures[0].params.length <= 2 && !hasRestParam(signatures[0].params);\n    const ok1 = signatures[1] && signatures[1].params.length <= 2 && !hasRestParam(signatures[1].params);\n    const ok2 = signatures[2] && signatures[2].params.length <= 2 && !hasRestParam(signatures[2].params);\n    const ok3 = signatures[3] && signatures[3].params.length <= 2 && !hasRestParam(signatures[3].params);\n    const ok4 = signatures[4] && signatures[4].params.length <= 2 && !hasRestParam(signatures[4].params);\n    const ok5 = signatures[5] && signatures[5].params.length <= 2 && !hasRestParam(signatures[5].params);\n    const allOk = ok0 && ok1 && ok2 && ok3 && ok4 && ok5; // compile the tests\n\n    for (let i = 0; i < signatures.length; ++i) {\n      signatures[i].test = compileTests(signatures[i].params);\n    }\n\n    const test00 = ok0 ? compileTest(signatures[0].params[0]) : notOk;\n    const test10 = ok1 ? compileTest(signatures[1].params[0]) : notOk;\n    const test20 = ok2 ? compileTest(signatures[2].params[0]) : notOk;\n    const test30 = ok3 ? compileTest(signatures[3].params[0]) : notOk;\n    const test40 = ok4 ? compileTest(signatures[4].params[0]) : notOk;\n    const test50 = ok5 ? compileTest(signatures[5].params[0]) : notOk;\n    const test01 = ok0 ? compileTest(signatures[0].params[1]) : notOk;\n    const test11 = ok1 ? compileTest(signatures[1].params[1]) : notOk;\n    const test21 = ok2 ? compileTest(signatures[2].params[1]) : notOk;\n    const test31 = ok3 ? compileTest(signatures[3].params[1]) : notOk;\n    const test41 = ok4 ? compileTest(signatures[4].params[1]) : notOk;\n    const test51 = ok5 ? compileTest(signatures[5].params[1]) : notOk; // compile the functions\n\n    for (let i = 0; i < signatures.length; ++i) {\n      signatures[i].implementation = compileArgsPreprocessing(signatures[i].params, signatures[i].fn);\n    }\n\n    const fn0 = ok0 ? signatures[0].implementation : undef;\n    const fn1 = ok1 ? signatures[1].implementation : undef;\n    const fn2 = ok2 ? signatures[2].implementation : undef;\n    const fn3 = ok3 ? signatures[3].implementation : undef;\n    const fn4 = ok4 ? signatures[4].implementation : undef;\n    const fn5 = ok5 ? signatures[5].implementation : undef;\n    const len0 = ok0 ? signatures[0].params.length : -1;\n    const len1 = ok1 ? signatures[1].params.length : -1;\n    const len2 = ok2 ? signatures[2].params.length : -1;\n    const len3 = ok3 ? signatures[3].params.length : -1;\n    const len4 = ok4 ? signatures[4].params.length : -1;\n    const len5 = ok5 ? signatures[5].params.length : -1; // simple and generic, but also slow\n\n    const iStart = allOk ? 6 : 0;\n    const iEnd = signatures.length; // de-reference ahead for execution speed:\n\n    const tests = signatures.map(s => s.test);\n    const fns = signatures.map(s => s.implementation);\n\n    const generic = function generic() {\n      'use strict';\n\n      for (let i = iStart; i < iEnd; i++) {\n        if (tests[i](arguments)) {\n          return fns[i].apply(this, arguments);\n        }\n      }\n\n      return typed.onMismatch(name, arguments, signatures);\n    }; // create the typed function\n    // fast, specialized version. Falls back to the slower, generic one if needed\n\n\n    function theTypedFn(arg0, arg1) {\n      'use strict';\n\n      if (arguments.length === len0 && test00(arg0) && test01(arg1)) {\n        return fn0.apply(this, arguments);\n      }\n\n      if (arguments.length === len1 && test10(arg0) && test11(arg1)) {\n        return fn1.apply(this, arguments);\n      }\n\n      if (arguments.length === len2 && test20(arg0) && test21(arg1)) {\n        return fn2.apply(this, arguments);\n      }\n\n      if (arguments.length === len3 && test30(arg0) && test31(arg1)) {\n        return fn3.apply(this, arguments);\n      }\n\n      if (arguments.length === len4 && test40(arg0) && test41(arg1)) {\n        return fn4.apply(this, arguments);\n      }\n\n      if (arguments.length === len5 && test50(arg0) && test51(arg1)) {\n        return fn5.apply(this, arguments);\n      }\n\n      return generic.apply(this, arguments);\n    } // attach name the typed function\n\n\n    try {\n      Object.defineProperty(theTypedFn, 'name', {\n        value: name\n      });\n    } catch (err) {// 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    } // attach signatures to the function.\n    // This property is close to the original collection of signatures\n    // used to create the typed-function, just with unions split:\n\n\n    theTypedFn.signatures = signaturesMap; // Store internal data for functions like resolve, find, etc.\n    // Also serves as the flag that this is a typed-function\n\n    theTypedFn._typedFunctionData = {\n      signatures,\n      signatureMap: internalSignatureMap\n    };\n    return theTypedFn;\n  }\n  /**\n   * Action to take on mismatch\n   * @param {string} name      Name of function that was attempted to be called\n   * @param {Array} args       Actual arguments to the call\n   * @param {Array} signatures Known signatures of the named typed-function\n   */\n\n\n  function _onMismatch(name, args, signatures) {\n    throw createError(name, args, signatures);\n  }\n  /**\n   * Return all but the last items of an array or function Arguments\n   * @param {Array | Arguments} arr\n   * @return {Array}\n   */\n\n\n  function initial(arr) {\n    return slice(arr, 0, arr.length - 1);\n  }\n  /**\n   * return the last item of an array or function Arguments\n   * @param {Array | Arguments} arr\n   * @return {*}\n   */\n\n\n  function last(arr) {\n    return arr[arr.length - 1];\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\n\n  function slice(arr, start, end) {\n    return Array.prototype.slice.call(arr, start, end);\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\n\n  function findInArray(arr, test) {\n    for (let i = 0; i < arr.length; i++) {\n      if (test(arr[i])) {\n        return arr[i];\n      }\n    }\n\n    return undefined;\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\n\n  function flatMap(arr, callback) {\n    return Array.prototype.concat.apply([], arr.map(callback));\n  }\n  /**\n   * Create a reference callback to one or multiple signatures\n   *\n   * Syntax:\n   *\n   *     typed.referTo(signature1, signature2, ..., function callback(fn1, fn2, ...) {\n   *       // ...\n   *     })\n   *\n   * @returns {{referTo: {references: string[], callback}}}\n   */\n\n\n  function referTo() {\n    const references = initial(arguments).map(s => stringifyParams(parseSignature(s)));\n    const callback = last(arguments);\n\n    if (typeof callback !== 'function') {\n      throw new TypeError('Callback function expected as last argument');\n    }\n\n    return makeReferTo(references, callback);\n  }\n\n  function makeReferTo(references, callback) {\n    return {\n      referTo: {\n        references,\n        callback\n      }\n    };\n  }\n  /**\n   * Create a reference callback to the typed-function itself\n   *\n   * @param {(self: function) => function} callback\n   * @returns {{referToSelf: { callback: function }}}\n   */\n\n\n  function referToSelf(callback) {\n    if (typeof callback !== 'function') {\n      throw new TypeError('Callback function expected as first argument');\n    }\n\n    return {\n      referToSelf: {\n        callback\n      }\n    };\n  }\n  /**\n   * Test whether something is a referTo object, holding a list with reference\n   * signatures and a callback.\n   *\n   * @param {Object | function} objectOrFn\n   * @returns {boolean}\n   */\n\n\n  function isReferTo(objectOrFn) {\n    return objectOrFn && typeof objectOrFn.referTo === 'object' && Array.isArray(objectOrFn.referTo.references) && typeof objectOrFn.referTo.callback === 'function';\n  }\n  /**\n   * Test whether something is a referToSelf object, holding a callback where\n   * to pass `self`.\n   *\n   * @param {Object | function} objectOrFn\n   * @returns {boolean}\n   */\n\n\n  function isReferToSelf(objectOrFn) {\n    return objectOrFn && typeof objectOrFn.referToSelf === 'object' && typeof objectOrFn.referToSelf.callback === 'function';\n  }\n  /**\n   * Check if name is (A) new, (B) a match, or (C) a mismatch; and throw\n   * an error in case (C).\n   *\n   * @param { string | undefined } nameSoFar\n   * @param { string | undefined } newName\n   * @returns { string } updated name\n   */\n\n\n  function checkName(nameSoFar, newName) {\n    if (!nameSoFar) {\n      return newName;\n    }\n\n    if (newName && newName !== nameSoFar) {\n      const err = new Error('Function names do not match (expected: ' + nameSoFar + ', actual: ' + newName + ')');\n      err.data = {\n        actual: newName,\n        expected: nameSoFar\n      };\n      throw err;\n    }\n\n    return nameSoFar;\n  }\n  /**\n   * Retrieve the implied name from an object with signature keys\n   * and function values, checking whether all value names match\n   *\n   * @param { {string: function} } obj\n   */\n\n\n  function getObjectName(obj) {\n    let name;\n\n    for (const key in obj) {\n      // Only pay attention to own properties, and only if their values\n      // are typed functions or functions with a signature property\n      if (Object.prototype.hasOwnProperty.call(obj, key) && (isTypedFunction(obj[key]) || typeof obj[key].signature === 'string')) {\n        name = checkName(name, obj[key].name);\n      }\n    }\n\n    return name;\n  }\n  /**\n   * Copy all of the signatures from the second argument into the first,\n   * which is modified by side effect, checking for conflicts\n   *\n   * @param {Object.<string, function|typed-reference>} dest\n   * @param {Object.<string, function|typed-reference>} source\n   */\n\n\n  function mergeSignatures(dest, source) {\n    let key;\n\n    for (key in source) {\n      if (Object.prototype.hasOwnProperty.call(source, key)) {\n        if (key in dest) {\n          if (source[key] !== dest[key]) {\n            const err = new Error('Signature \"' + key + '\" is defined twice');\n            err.data = {\n              signature: key,\n              sourceFunction: source[key],\n              destFunction: dest[key]\n            };\n            throw err;\n          } // else: both signatures point to the same function, that's fine\n\n        }\n\n        dest[key] = source[key];\n      }\n    }\n  }\n\n  const saveTyped = typed;\n  /**\n   * Originally the main function was a typed function itself, but then\n   * it might not be able to generate error messages if the client\n   * replaced the type system with different names.\n   *\n   * Main entry: typed([name], functions/objects with signatures...)\n   *\n   * Assembles and returns a new typed-function from the given items\n   * that provide signatures and implementations, each of which may be\n   * * a plain object mapping (string) signatures to implementing functions,\n   * * a previously constructed typed function, or\n   * * any other single function with a string-valued property `signature`.\n    * The name of the resulting typed-function will be given by the\n   * string-valued name argument if present, or if not, by the name\n   * of any of the arguments that have one, as long as any that do are\n   * consistent with each other. If no name is specified, the name will be\n   * an empty string.\n   *\n   * @param {string} maybeName [optional]\n   * @param {(function|object)[]} signature providers\n   * @returns {typed-function}\n   */\n\n  typed = function (maybeName) {\n    const named = typeof maybeName === 'string';\n    const start = named ? 1 : 0;\n    let name = named ? maybeName : '';\n    const allSignatures = {};\n\n    for (let i = start; i < arguments.length; ++i) {\n      const item = arguments[i];\n      let theseSignatures = {};\n      let thisName;\n\n      if (typeof item === 'function') {\n        thisName = item.name;\n\n        if (typeof item.signature === 'string') {\n          // Case 1: Ordinary function with a string 'signature' property\n          theseSignatures[item.signature] = item;\n        } else if (isTypedFunction(item)) {\n          // Case 2: Existing typed function\n          theseSignatures = item.signatures;\n        }\n      } else if (isPlainObject(item)) {\n        // Case 3: Plain object, assume keys = signatures, values = functions\n        theseSignatures = item;\n\n        if (!named) {\n          thisName = getObjectName(item);\n        }\n      }\n\n      if (Object.keys(theseSignatures).length === 0) {\n        const err = new TypeError('Argument to \\'typed\\' at index ' + i + ' is not a (typed) function, ' + 'nor an object with signatures as keys and functions as values.');\n        err.data = {\n          index: i,\n          argument: item\n        };\n        throw err;\n      }\n\n      if (!named) {\n        name = checkName(name, thisName);\n      }\n\n      mergeSignatures(allSignatures, theseSignatures);\n    }\n\n    return createTypedFunction(name || '', allSignatures);\n  };\n\n  typed.create = create;\n  typed.createCount = saveTyped.createCount;\n  typed.onMismatch = _onMismatch;\n  typed.throwMismatchError = _onMismatch;\n  typed.createError = createError;\n  typed.clear = clear;\n  typed.clearConversions = clearConversions;\n  typed.addTypes = addTypes;\n  typed._findType = findType; // For unit testing only\n\n  typed.referTo = referTo;\n  typed.referToSelf = referToSelf;\n  typed.convert = convert;\n  typed.findSignature = findSignature;\n  typed.find = find;\n  typed.isTypedFunction = isTypedFunction;\n  typed.warnAgainstDeprecatedThis = true;\n  /**\n   * add a type (convenience wrapper for typed.addTypes)\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\n  typed.addType = function (type, beforeObjectTest) {\n    let before = 'any';\n\n    if (beforeObjectTest !== false && typeMap.has('Object')) {\n      before = 'Object';\n    }\n\n    typed.addTypes([type], before);\n  };\n  /**\n   * Verify that the ConversionDef conversion has a valid format.\n   *\n   * @param {conversionDef} conversion\n   * @return {void}\n   * @throws {TypeError|SyntaxError}\n   */\n\n\n  function _validateConversion(conversion) {\n    if (!conversion || typeof conversion.from !== 'string' || typeof conversion.to !== 'string' || typeof conversion.convert !== 'function') {\n      throw new TypeError('Object with properties {from: string, to: string, convert: function} expected');\n    }\n\n    if (conversion.to === conversion.from) {\n      throw new SyntaxError('Illegal to define conversion from \"' + conversion.from + '\" to itself.');\n    }\n  }\n  /**\n   * Add a conversion\n   *\n   * @param {ConversionDef} conversion\n   * @returns {void}\n   * @throws {TypeError}\n   */\n\n\n  typed.addConversion = function (conversion) {\n    _validateConversion(conversion);\n\n    const to = findType(conversion.to);\n\n    if (to.conversionsTo.every(function (other) {\n      return other.from !== conversion.from;\n    })) {\n      to.conversionsTo.push({\n        from: conversion.from,\n        convert: conversion.convert,\n        index: nConversions++\n      });\n    } else {\n      throw new Error('There is already a conversion from \"' + conversion.from + '\" to \"' + to.name + '\"');\n    }\n  };\n  /**\n   * Convenience wrapper to call addConversion on each conversion in a list.\n   *\n   @param {ConversionDef[]} conversions\n   @returns {void}\n   @throws {TypeError}\n   */\n\n\n  typed.addConversions = function (conversions) {\n    conversions.forEach(typed.addConversion);\n  };\n  /**\n   * Remove the specified conversion. The format is the same as for\n   * addConversion, and the convert function must match or an error\n   * is thrown.\n   *\n   * @param {{from: string, to: string, convert: function}} conversion\n   * @returns {void}\n   * @throws {TypeError|SyntaxError|Error}\n   */\n\n\n  typed.removeConversion = function (conversion) {\n    _validateConversion(conversion);\n\n    const to = findType(conversion.to);\n    const existingConversion = findInArray(to.conversionsTo, c => c.from === conversion.from);\n\n    if (!existingConversion) {\n      throw new Error('Attempt to remove nonexistent conversion from ' + conversion.from + ' to ' + conversion.to);\n    }\n\n    if (existingConversion.convert !== conversion.convert) {\n      throw new Error('Conversion to remove does not match existing conversion');\n    }\n\n    const index = to.conversionsTo.indexOf(existingConversion);\n    to.conversionsTo.splice(index, 1);\n  };\n  /**\n   * Produce the specific signature that a typed function\n   * will execute on the given arguments. Here, a \"signature\" is an\n   * object with properties 'params', 'test', 'fn', and 'implementation'.\n   * This last property is a function that converts params as necessary\n   * and then calls 'fn'. Returns null if there is no matching signature.\n   * @param {typed-function} tf\n   * @param {any[]} argList\n   * @returns {{params: string, test: function, fn: function, implementation: function}}\n   */\n\n\n  typed.resolve = function (tf, argList) {\n    if (!isTypedFunction(tf)) {\n      throw new TypeError(NOT_TYPED_FUNCTION);\n    }\n\n    const sigs = tf._typedFunctionData.signatures;\n\n    for (let i = 0; i < sigs.length; ++i) {\n      if (sigs[i].test(argList)) {\n        return sigs[i];\n      }\n    }\n\n    return null;\n  };\n\n  return typed;\n}\n\nexport default create();\n//# sourceMappingURL=typed-function.mjs.map","import { isBigNumber, isNumber, isObject } from './is.js';\n\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 */\nexport function isInteger(value) {\n  if (typeof value === 'boolean') {\n    return true;\n  }\n  return isFinite(value) ? value === Math.round(value) : false;\n}\n\n/**\n * Calculate the sign of a number\n * @param {number} x\n * @returns {number}\n */\nexport var sign = 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/**\n * Calculate the base-2 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexport var log2 = Math.log2 || function log2(x) {\n  return Math.log(x) / Math.LN2;\n};\n\n/**\n * Calculate the base-10 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexport var log10 = Math.log10 || function log10(x) {\n  return Math.log(x) / Math.LN10;\n};\n\n/**\n * Calculate the natural logarithm of a number + 1\n * @param {number} x\n * @returns {number}\n */\nexport var log1p = Math.log1p || function (x) {\n  return Math.log(x + 1);\n};\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 */\nexport var cbrt = Math.cbrt || function cbrt(x) {\n  if (x === 0) {\n    return x;\n  }\n  var negate = x < 0;\n  var result;\n  if (negate) {\n    x = -x;\n  }\n  if (isFinite(x)) {\n    result = Math.exp(Math.log(x) / 3);\n    // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods\n    result = (x / (result * result) + 2 * result) / 3;\n  } else {\n    result = x;\n  }\n  return negate ? -result : result;\n};\n\n/**\n * Calculates exponentiation minus 1\n * @param {number} x\n * @return {number} res\n */\nexport var expm1 = 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/**\n * Formats a number in a given base\n * @param {number} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\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  if (size) {\n    if (size < 1) {\n      throw new Error('size must be in greater than 0');\n    }\n    if (!isInteger(size)) {\n      throw new Error('size must be an integer');\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    if (!isInteger(n)) {\n      throw new Error('Value must be an integer');\n    }\n    if (n < 0) {\n      n = n + 2 ** size;\n    }\n    suffix = \"i\".concat(size);\n  }\n  var sign = '';\n  if (n < 0) {\n    n = -n;\n    sign = '-';\n  }\n  return \"\".concat(sign).concat(prefix).concat(n.toString(base)).concat(suffix);\n}\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 */\nexport function format(value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value);\n  }\n\n  // handle special cases\n  if (value === Infinity) {\n    return 'Infinity';\n  } else if (value === -Infinity) {\n    return '-Infinity';\n  } else if (isNaN(value)) {\n    return 'NaN';\n  }\n  var {\n    notation,\n    precision,\n    wordSize\n  } = normalizeFormatOptions(options);\n\n  // handle the various notations\n  switch (notation) {\n    case 'fixed':\n      return toFixed(value, precision);\n    case 'exponential':\n      return toExponential(value, precision);\n    case 'engineering':\n      return toEngineering(value, precision);\n    case 'bin':\n      return formatNumberToBase(value, 2, wordSize);\n    case 'oct':\n      return formatNumberToBase(value, 8, wordSize);\n    case 'hex':\n      return formatNumberToBase(value, 16, wordSize);\n    case 'auto':\n      // remove trailing zeros after the decimal point\n      return toPrecision(value, precision, options).replace(/((\\.\\d*?)(0+))($|e)/, function () {\n        var digits = arguments[2];\n        var e = arguments[4];\n        return digits !== '.' ? digits + e : e;\n      });\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n  }\n}\n\n/**\n * Normalize format options into an object:\n *   {\n *     notation: string,\n *     precision: number | undefined,\n *     wordSize: number | undefined\n *   }\n */\nexport function normalizeFormatOptions(options) {\n  // default values for options\n  var notation = 'auto';\n  var precision;\n  var wordSize;\n  if (options !== undefined) {\n    if (isNumber(options)) {\n      precision = options;\n    } else if (isBigNumber(options)) {\n      precision = options.toNumber();\n    } else if (isObject(options)) {\n      if (options.precision !== undefined) {\n        precision = _toNumberOrThrow(options.precision, () => {\n          throw new Error('Option \"precision\" must be a number or BigNumber');\n        });\n      }\n      if (options.wordSize !== undefined) {\n        wordSize = _toNumberOrThrow(options.wordSize, () => {\n          throw new Error('Option \"wordSize\" must be a number or BigNumber');\n        });\n      }\n      if (options.notation) {\n        notation = options.notation;\n      }\n    } else {\n      throw new Error('Unsupported type of options, number, BigNumber, or object expected');\n    }\n  }\n  return {\n    notation,\n    precision,\n    wordSize\n  };\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 */\nexport function splitNumber(value) {\n  // parse the input value\n  var match = String(value).toLowerCase().match(/^(-?)(\\d+\\.?\\d*)(e([+-]?\\d+))?$/);\n  if (!match) {\n    throw new SyntaxError('Invalid number ' + value);\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  if (coefficients.length === 0) {\n    coefficients.push(0);\n    exponent++;\n  }\n  return {\n    sign,\n    coefficients,\n    exponent\n  };\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 */\nexport function toEngineering(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n  var split = splitNumber(value);\n  var rounded = roundDigits(split, precision);\n  var e = rounded.exponent;\n  var c = rounded.coefficients;\n\n  // find nearest lower multiple of 3 for exponent\n  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;\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    for (var i = 0; i < missingZeros; i++) {\n      c.push(0);\n    }\n  }\n\n  // find difference in exponents\n  var expDiff = Math.abs(e - newExp);\n  var decimalIdx = 1;\n\n  // push decimal index over by expDiff times\n  while (expDiff > 0) {\n    decimalIdx++;\n    expDiff--;\n  }\n\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  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/**\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 */\nexport function toFixed(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\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\n  // append zeros if needed\n  var pp = p + (precision || 0);\n  if (c.length < pp) {\n    c = c.concat(zeros(pp - c.length));\n  }\n\n  // prepend zeros if needed\n  if (p < 0) {\n    c = zeros(-p + 1).concat(c);\n    p = 1;\n  }\n\n  // insert a dot if needed\n  if (p < c.length) {\n    c.splice(p, 0, p === 0 ? '0.' : '.');\n  }\n  return rounded.sign + c.join('');\n}\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 */\nexport function toExponential(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n\n  // round if needed, else create a clone\n  var split = splitNumber(value);\n  var rounded = precision ? roundDigits(split, precision) : split;\n  var c = rounded.coefficients;\n  var e = rounded.exponent;\n\n  // append zeros if needed\n  if (c.length < precision) {\n    c = c.concat(zeros(precision - c.length));\n  }\n\n  // format as `C.CCCe+EEE` or `C.CCCe-EEE`\n  var first = c.shift();\n  return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;\n}\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 */\nexport function toPrecision(value, precision, options) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n\n  // determine lower and upper bound for exponential notation.\n  var lowerExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.lowerExp, -3);\n  var upperExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.upperExp, 5);\n  var split = splitNumber(value);\n  var rounded = precision ? roundDigits(split, precision) : split;\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;\n\n    // append trailing zeros\n    if (c.length < precision) {\n      c = c.concat(zeros(precision - c.length));\n    }\n\n    // append trailing zeros\n    // TODO: simplify the next statement\n    c = c.concat(zeros(e - c.length + 1 + (c.length < precision ? precision - c.length : 0)));\n\n    // prepend zeros\n    c = zeros(-e).concat(c);\n    var dot = e > 0 ? e : 0;\n    if (dot < c.length - 1) {\n      c.splice(dot + 1, 0, '.');\n    }\n    return rounded.sign + c.join('');\n  }\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 */\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;\n\n  // prepend zeros if needed\n  while (precision <= 0) {\n    c.unshift(0);\n    rounded.exponent++;\n    precision++;\n  }\n  if (c.length > precision) {\n    var removed = c.splice(precision, c.length - precision);\n    if (removed[0] >= 5) {\n      var i = precision - 1;\n      c[i]++;\n      while (c[i] === 10) {\n        c.pop();\n        if (i === 0) {\n          c.unshift(0);\n          rounded.exponent++;\n          i++;\n        }\n        i--;\n        c[i]++;\n      }\n    }\n  }\n  return rounded;\n}\n\n/**\n * Create an array filled with zeros.\n * @param {number} length\n * @return {Array}\n */\nfunction zeros(length) {\n  var arr = [];\n  for (var i = 0; i < length; i++) {\n    arr.push(0);\n  }\n  return arr;\n}\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 */\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/**\n * Minimum number added to one that makes the result different than one\n */\nexport var DBL_EPSILON = Number.EPSILON || 2.2204460492503130808472633361816E-16;\n\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*/\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  if (x === y) {\n    return true;\n  }\n\n  // NaN\n  if (isNaN(x) || isNaN(y)) {\n    return false;\n  }\n\n  // at this point x and y should be finite\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    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  }\n\n  // Infinite and Number or negative Infinite and positive Infinite cases\n  return false;\n}\n\n/**\n * Calculate the hyperbolic arccos of a number\n * @param {number} x\n * @return {number}\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/**\n * Calculate the hyperbolic arctangent of a number\n * @param {number} x\n * @return {number}\n */\nexport var atanh = Math.atanh || function (x) {\n  return Math.log((1 + x) / (1 - x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic cosine of a number\n * @param {number} x\n * @returns {number}\n */\nexport var cosh = Math.cosh || function (x) {\n  return (Math.exp(x) + Math.exp(-x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic sine of a number\n * @param {number} x\n * @returns {number}\n */\nexport var sinh = Math.sinh || function (x) {\n  return (Math.exp(x) - Math.exp(-x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic tangent of a number\n * @param {number} x\n * @returns {number}\n */\nexport var tanh = Math.tanh || function (x) {\n  var e = Math.exp(2 * x);\n  return (e - 1) / (e + 1);\n};\n\n/**\n * Returns a value with the magnitude of x and the sign of y.\n * @param {number} x\n * @param {number} y\n * @returns {number}\n */\nexport function copysign(x, y) {\n  var signx = x > 0 ? true : x < 0 ? false : 1 / x === Infinity;\n  var signy = y > 0 ? true : y < 0 ? false : 1 / y === Infinity;\n  return signx ^ signy ? -x : x;\n}\nfunction _toNumberOrThrow(value, onError) {\n  if (isNumber(value)) {\n    return value;\n  } else if (isBigNumber(value)) {\n    return value.toNumber();\n  } else {\n    onError();\n  }\n}\nfunction _toNumberOrDefault(value, defaultValue) {\n  if (isNumber(value)) {\n    return value;\n  } else if (isBigNumber(value)) {\n    return value.toNumber();\n  } else {\n    return defaultValue;\n  }\n}","import { pickShallow } from './object.js';\n\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 */\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  assertAndCreate.isFactory = true;\n  assertAndCreate.fn = name;\n  assertAndCreate.dependencies = dependencies.slice().sort();\n  if (meta) {\n    assertAndCreate.meta = meta;\n  }\n  return assertAndCreate;\n}\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 */\nexport function sortFactories(factories) {\n  var factoriesByName = {};\n  factories.forEach(factory => {\n    factoriesByName[factory.fn] = factory;\n  });\n  function containsDependency(factory, dependency) {\n    // TODO: detect circular references\n    if (isFactory(factory)) {\n      if (factory.dependencies.includes(dependency.fn || dependency.name)) {\n        return true;\n      }\n      if (factory.dependencies.some(d => containsDependency(factoriesByName[d], dependency))) {\n        return true;\n      }\n    }\n    return false;\n  }\n  var sorted = [];\n  function addFactory(factory) {\n    var index = 0;\n    while (index < sorted.length && !containsDependency(sorted[index], factory)) {\n      index++;\n    }\n    sorted.splice(index, 0, factory);\n  }\n\n  // sort regular factory functions\n  factories.filter(isFactory).forEach(addFactory);\n\n  // sort legacy factory functions AFTER the regular factory functions\n  factories.filter(factory => !isFactory(factory)).forEach(addFactory);\n  return sorted;\n}\n\n// TODO: comment or cleanup if unused in the end\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/**\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 */\nexport function isFactory(obj) {\n  return typeof obj === 'function' && typeof obj.fn === 'string' && Array.isArray(obj.dependencies);\n}\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 */\nexport function assertDependencies(name, dependencies, scope) {\n  var allDefined = dependencies.filter(dependency => !isOptionalDependency(dependency)) // filter optionals\n  .every(dependency => scope[dependency] !== undefined);\n  if (!allDefined) {\n    var missingDependencies = dependencies.filter(dependency => scope[dependency] === undefined);\n\n    // TODO: create a custom error class for this, a MathjsError or something like that\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 { hasOwnProperty } from './object.js';\n\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 */\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  if (typeof object[prop] === 'function' && isSafeMethod(object, prop)) {\n    throw new Error('Cannot access method \"' + prop + '\" as a property');\n  }\n  throw new Error('No access to property \"' + prop + '\"');\n}\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?\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  throw new Error('No access to property \"' + prop + '\"');\n}\nfunction getSafeProperties(object) {\n  return Object.keys(object).filter(prop => hasOwnProperty(object, prop));\n}\nfunction hasSafeProperty(object, prop) {\n  return prop in object;\n}\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 */\nfunction isSafeProperty(object, prop) {\n  if (!object || typeof object !== 'object') {\n    return false;\n  }\n  // SAFE: whitelisted\n  // e.g length\n  if (hasOwnProperty(safeNativeProperties, prop)) {\n    return true;\n  }\n  // UNSAFE: inherited from Object prototype\n  // e.g constructor\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  }\n  // UNSAFE: inherited from Function prototype\n  // e.g call, apply\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  return true;\n}\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 * @return {function} Returns the method when valid\n */\nfunction getSafeMethod(object, method) {\n  if (!isSafeMethod(object, method)) {\n    throw new Error('No access to method \"' + method + '\"');\n  }\n  return object[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 */\nfunction isSafeMethod(object, method) {\n  if (object === null || object === undefined || typeof object[method] !== 'function') {\n    return false;\n  }\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  if (hasOwnProperty(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {\n    return false;\n  }\n  // SAFE: whitelisted\n  // e.g toString\n  if (hasOwnProperty(safeNativeMethods, method)) {\n    return true;\n  }\n  // UNSAFE: inherited from Object prototype\n  // e.g constructor\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  }\n  // UNSAFE: inherited from Function prototype\n  // e.g call, apply\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  return true;\n}\nfunction isPlainObject(object) {\n  return typeof object === 'object' && object && object.constructor === Object;\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 { getSafeMethod };\nexport { isSafeMethod };\nexport { isPlainObject };","import { setSafeProperty, hasSafeProperty, getSafeProperty } from './customs.js';\nimport { isObject } from './is.js';\n\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 */\nexport class ObjectWrappingMap {\n  constructor(object) {\n    this.wrappedObject = object;\n    this[Symbol.iterator] = this.entries;\n  }\n  keys() {\n    return Object.keys(this.wrappedObject).values();\n  }\n  get(key) {\n    return getSafeProperty(this.wrappedObject, key);\n  }\n  set(key, value) {\n    setSafeProperty(this.wrappedObject, key, value);\n    return this;\n  }\n  has(key) {\n    return hasSafeProperty(this.wrappedObject, key);\n  }\n  entries() {\n    return mapIterator(this.keys(), key => [key, this.get(key)]);\n  }\n  forEach(callback) {\n    for (var key of this.keys()) {\n      callback(this.get(key), key, this);\n    }\n  }\n  delete(key) {\n    delete this.wrappedObject[key];\n  }\n  clear() {\n    for (var key of this.keys()) {\n      this.delete(key);\n    }\n  }\n  get size() {\n    return Object.keys(this.wrappedObject).length;\n  }\n}\n\n/**\n * Create a map with two partitions: a and b.\n * The set with bKeys determines which keys/values are read/written to map b,\n * all other values are read/written to map a\n *\n * For example:\n *\n *   const a = new Map()\n *   const b = new Map()\n *   const p = new PartitionedMap(a, b, new Set(['x', 'y']))\n *\n * In this case, values `x` and `y` are read/written to map `b`,\n * all other values are read/written to map `a`.\n */\nexport class PartitionedMap {\n  /**\n   * @param {Map} a\n   * @param {Map} b\n   * @param {Set} bKeys\n   */\n  constructor(a, b, bKeys) {\n    this.a = a;\n    this.b = b;\n    this.bKeys = bKeys;\n    this[Symbol.iterator] = this.entries;\n  }\n  get(key) {\n    return this.bKeys.has(key) ? this.b.get(key) : this.a.get(key);\n  }\n  set(key, value) {\n    if (this.bKeys.has(key)) {\n      this.b.set(key, value);\n    } else {\n      this.a.set(key, value);\n    }\n    return this;\n  }\n  has(key) {\n    return this.b.has(key) || this.a.has(key);\n  }\n  keys() {\n    return new Set([...this.a.keys(), ...this.b.keys()])[Symbol.iterator]();\n  }\n  entries() {\n    return mapIterator(this.keys(), key => [key, this.get(key)]);\n  }\n  forEach(callback) {\n    for (var key of this.keys()) {\n      callback(this.get(key), key, this);\n    }\n  }\n  delete(key) {\n    return this.bKeys.has(key) ? this.b.delete(key) : this.a.delete(key);\n  }\n  clear() {\n    this.a.clear();\n    this.b.clear();\n  }\n  get size() {\n    return [...this.keys()].length;\n  }\n}\n\n/**\n * Create a new iterator that maps over the provided iterator, applying a mapping function to each item\n */\nfunction mapIterator(it, callback) {\n  return {\n    next: () => {\n      var n = it.next();\n      return n.done ? n : {\n        value: callback(n.value),\n        done: false\n      };\n    }\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 */\nexport function createEmptyMap() {\n  return new Map();\n}\n\n/**\n * Creates a Map from the given object.\n *\n * @param { Map | { [key: string]: unknown } | undefined } mapOrObject\n * @returns\n */\nexport function createMap(mapOrObject) {\n  if (!mapOrObject) {\n    return createEmptyMap();\n  }\n  if (isMap(mapOrObject)) {\n    return mapOrObject;\n  }\n  if (isObject(mapOrObject)) {\n    return new ObjectWrappingMap(mapOrObject);\n  }\n  throw new Error('createMap can create maps from objects or Maps');\n}\n\n/**\n * Unwraps a map into an object.\n *\n * @param {Map} map\n * @returns { [key: string]: unknown }\n */\nexport function toObject(map) {\n  if (map instanceof ObjectWrappingMap) {\n    return map.wrappedObject;\n  }\n  var object = {};\n  for (var key of map.keys()) {\n    var value = map.get(key);\n    setSafeProperty(object, key, value);\n  }\n  return object;\n}\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 */\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  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/**\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 */\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  for (var args of objects) {\n    if (!args) {\n      continue;\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  return map;\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 */\n\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, isRelationalNode, 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';\n\n// returns a new instance of typed-function\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};\nvar dependencies = ['?BigNumber', '?Complex', '?DenseMatrix', '?Fraction'];\n\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 */\nexport var createTyped = /* #__PURE__ */factory('typed', dependencies, function createTyped(_ref) {\n  var {\n    BigNumber,\n    Complex,\n    DenseMatrix,\n    Fraction\n  } = _ref;\n  // TODO: typed-function must be able to silently ignore signatures with unknown data types\n\n  // get a new instance of typed-function\n  var typed = _createTyped2();\n\n  // 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  typed.clear();\n  typed.addTypes([{\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  // The following type matches a valid variable name, i.e., an alphanumeric\n  // string starting with an alphabetic character. It is used (at least)\n  // in the definition of the derivative() function, as the argument telling\n  // what to differentiate over must (currently) be a variable.\n  {\n    name: 'identifier',\n    test: s => isString && /^(?:[A-Za-z\\xAA\\xB5\\xBA\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376\\u0377\\u037A-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u052F\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05D0-\\u05EA\\u05EF-\\u05F2\\u0620-\\u064A\\u066E\\u066F\\u0671-\\u06D3\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4\\u07F5\\u07FA\\u0800-\\u0815\\u081A\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086A\\u0870-\\u0887\\u0889-\\u088E\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDD\\u0CDE\\u0CE0\\u0CE1\\u0CF1\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\u1C88\\u1C90-\\u1CBA\\u1CBD-\\u1CBF\\u1CE9-\\u1CEC\\u1CEE-\\u1CF3\\u1CF5\\u1CF6\\u1CFA\\u1D00-\\u1DBF\\u1E00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2071\\u207F\\u2090-\\u209C\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2139\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u2183\\u2184\\u2C00-\\u2CE4\\u2CEB-\\u2CEE\\u2CF2\\u2CF3\\u2D00-\\u2D25\\u2D27\\u2D2D\\u2D30-\\u2D67\\u2D6F\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u2E2F\\u3005\\u3006\\u3031-\\u3035\\u303B\\u303C\\u3041-\\u3096\\u309D-\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FF\\u3105-\\u312F\\u3131-\\u318E\\u31A0-\\u31BF\\u31F0-\\u31FF\\u3400-\\u4DBF\\u4E00-\\uA48C\\uA4D0-\\uA4FD\\uA500-\\uA60C\\uA610-\\uA61F\\uA62A\\uA62B\\uA640-\\uA66E\\uA67F-\\uA69D\\uA6A0-\\uA6E5\\uA717-\\uA71F\\uA722-\\uA788\\uA78B-\\uA7CA\\uA7D0\\uA7D1\\uA7D3\\uA7D5-\\uA7D9\\uA7F2-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]|\\uD800[\\uDC00-\\uDC0B\\uDC0D-\\uDC26\\uDC28-\\uDC3A\\uDC3C\\uDC3D\\uDC3F-\\uDC4D\\uDC50-\\uDC5D\\uDC80-\\uDCFA\\uDE80-\\uDE9C\\uDEA0-\\uDED0\\uDF00-\\uDF1F\\uDF2D-\\uDF40\\uDF42-\\uDF49\\uDF50-\\uDF75\\uDF80-\\uDF9D\\uDFA0-\\uDFC3\\uDFC8-\\uDFCF]|\\uD801[\\uDC00-\\uDC9D\\uDCB0-\\uDCD3\\uDCD8-\\uDCFB\\uDD00-\\uDD27\\uDD30-\\uDD63\\uDD70-\\uDD7A\\uDD7C-\\uDD8A\\uDD8C-\\uDD92\\uDD94\\uDD95\\uDD97-\\uDDA1\\uDDA3-\\uDDB1\\uDDB3-\\uDDB9\\uDDBB\\uDDBC\\uDE00-\\uDF36\\uDF40-\\uDF55\\uDF60-\\uDF67\\uDF80-\\uDF85\\uDF87-\\uDFB0\\uDFB2-\\uDFBA]|\\uD802[\\uDC00-\\uDC05\\uDC08\\uDC0A-\\uDC35\\uDC37\\uDC38\\uDC3C\\uDC3F-\\uDC55\\uDC60-\\uDC76\\uDC80-\\uDC9E\\uDCE0-\\uDCF2\\uDCF4\\uDCF5\\uDD00-\\uDD15\\uDD20-\\uDD39\\uDD80-\\uDDB7\\uDDBE\\uDDBF\\uDE00\\uDE10-\\uDE13\\uDE15-\\uDE17\\uDE19-\\uDE35\\uDE60-\\uDE7C\\uDE80-\\uDE9C\\uDEC0-\\uDEC7\\uDEC9-\\uDEE4\\uDF00-\\uDF35\\uDF40-\\uDF55\\uDF60-\\uDF72\\uDF80-\\uDF91]|\\uD803[\\uDC00-\\uDC48\\uDC80-\\uDCB2\\uDCC0-\\uDCF2\\uDD00-\\uDD23\\uDE80-\\uDEA9\\uDEB0\\uDEB1\\uDF00-\\uDF1C\\uDF27\\uDF30-\\uDF45\\uDF70-\\uDF81\\uDFB0-\\uDFC4\\uDFE0-\\uDFF6]|\\uD804[\\uDC03-\\uDC37\\uDC71\\uDC72\\uDC75\\uDC83-\\uDCAF\\uDCD0-\\uDCE8\\uDD03-\\uDD26\\uDD44\\uDD47\\uDD50-\\uDD72\\uDD76\\uDD83-\\uDDB2\\uDDC1-\\uDDC4\\uDDDA\\uDDDC\\uDE00-\\uDE11\\uDE13-\\uDE2B\\uDE3F\\uDE40\\uDE80-\\uDE86\\uDE88\\uDE8A-\\uDE8D\\uDE8F-\\uDE9D\\uDE9F-\\uDEA8\\uDEB0-\\uDEDE\\uDF05-\\uDF0C\\uDF0F\\uDF10\\uDF13-\\uDF28\\uDF2A-\\uDF30\\uDF32\\uDF33\\uDF35-\\uDF39\\uDF3D\\uDF50\\uDF5D-\\uDF61]|\\uD805[\\uDC00-\\uDC34\\uDC47-\\uDC4A\\uDC5F-\\uDC61\\uDC80-\\uDCAF\\uDCC4\\uDCC5\\uDCC7\\uDD80-\\uDDAE\\uDDD8-\\uDDDB\\uDE00-\\uDE2F\\uDE44\\uDE80-\\uDEAA\\uDEB8\\uDF00-\\uDF1A\\uDF40-\\uDF46]|\\uD806[\\uDC00-\\uDC2B\\uDCA0-\\uDCDF\\uDCFF-\\uDD06\\uDD09\\uDD0C-\\uDD13\\uDD15\\uDD16\\uDD18-\\uDD2F\\uDD3F\\uDD41\\uDDA0-\\uDDA7\\uDDAA-\\uDDD0\\uDDE1\\uDDE3\\uDE00\\uDE0B-\\uDE32\\uDE3A\\uDE50\\uDE5C-\\uDE89\\uDE9D\\uDEB0-\\uDEF8]|\\uD807[\\uDC00-\\uDC08\\uDC0A-\\uDC2E\\uDC40\\uDC72-\\uDC8F\\uDD00-\\uDD06\\uDD08\\uDD09\\uDD0B-\\uDD30\\uDD46\\uDD60-\\uDD65\\uDD67\\uDD68\\uDD6A-\\uDD89\\uDD98\\uDEE0-\\uDEF2\\uDF02\\uDF04-\\uDF10\\uDF12-\\uDF33\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD81C-\\uD820\\uD822\\uD840-\\uD868\\uD86A-\\uD86C\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883\\uD885-\\uD887][\\uDC00-\\uDFFF]|\\uD80D[\\uDC00-\\uDC2F\\uDC41-\\uDC46]|\\uD811[\\uDC00-\\uDE46]|\\uD81A[\\uDC00-\\uDE38\\uDE40-\\uDE5E\\uDE70-\\uDEBE\\uDED0-\\uDEED\\uDF00-\\uDF2F\\uDF40-\\uDF43\\uDF63-\\uDF77\\uDF7D-\\uDF8F]|\\uD81B[\\uDE40-\\uDE7F\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3]|\\uD821[\\uDC00-\\uDFF7]|\\uD823[\\uDC00-\\uDCD5\\uDD00-\\uDD08]|\\uD82B[\\uDFF0-\\uDFF3\\uDFF5-\\uDFFB\\uDFFD\\uDFFE]|\\uD82C[\\uDC00-\\uDD22\\uDD32\\uDD50-\\uDD52\\uDD55\\uDD64-\\uDD67\\uDD70-\\uDEFB]|\\uD82F[\\uDC00-\\uDC6A\\uDC70-\\uDC7C\\uDC80-\\uDC88\\uDC90-\\uDC99]|\\uD835[\\uDC00-\\uDC54\\uDC56-\\uDC9C\\uDC9E\\uDC9F\\uDCA2\\uDCA5\\uDCA6\\uDCA9-\\uDCAC\\uDCAE-\\uDCB9\\uDCBB\\uDCBD-\\uDCC3\\uDCC5-\\uDD05\\uDD07-\\uDD0A\\uDD0D-\\uDD14\\uDD16-\\uDD1C\\uDD1E-\\uDD39\\uDD3B-\\uDD3E\\uDD40-\\uDD44\\uDD46\\uDD4A-\\uDD50\\uDD52-\\uDEA5\\uDEA8-\\uDEC0\\uDEC2-\\uDEDA\\uDEDC-\\uDEFA\\uDEFC-\\uDF14\\uDF16-\\uDF34\\uDF36-\\uDF4E\\uDF50-\\uDF6E\\uDF70-\\uDF88\\uDF8A-\\uDFA8\\uDFAA-\\uDFC2\\uDFC4-\\uDFCB]|\\uD837[\\uDF00-\\uDF1E\\uDF25-\\uDF2A]|\\uD838[\\uDC30-\\uDC6D\\uDD00-\\uDD2C\\uDD37-\\uDD3D\\uDD4E\\uDE90-\\uDEAD\\uDEC0-\\uDEEB]|\\uD839[\\uDCD0-\\uDCEB\\uDFE0-\\uDFE6\\uDFE8-\\uDFEB\\uDFED\\uDFEE\\uDFF0-\\uDFFE]|\\uD83A[\\uDC00-\\uDCC4\\uDD00-\\uDD43\\uDD4B]|\\uD83B[\\uDE00-\\uDE03\\uDE05-\\uDE1F\\uDE21\\uDE22\\uDE24\\uDE27\\uDE29-\\uDE32\\uDE34-\\uDE37\\uDE39\\uDE3B\\uDE42\\uDE47\\uDE49\\uDE4B\\uDE4D-\\uDE4F\\uDE51\\uDE52\\uDE54\\uDE57\\uDE59\\uDE5B\\uDE5D\\uDE5F\\uDE61\\uDE62\\uDE64\\uDE67-\\uDE6A\\uDE6C-\\uDE72\\uDE74-\\uDE77\\uDE79-\\uDE7C\\uDE7E\\uDE80-\\uDE89\\uDE8B-\\uDE9B\\uDEA1-\\uDEA3\\uDEA5-\\uDEA9\\uDEAB-\\uDEBB]|\\uD869[\\uDC00-\\uDEDF\\uDF00-\\uDFFF]|\\uD86D[\\uDC00-\\uDF39\\uDF40-\\uDFFF]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEA1\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A\\uDF50-\\uDFFF]|\\uD888[\\uDC00-\\uDFAF])(?:[0-9A-Za-z\\xAA\\xB5\\xBA\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376\\u0377\\u037A-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u052F\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05D0-\\u05EA\\u05EF-\\u05F2\\u0620-\\u064A\\u066E\\u066F\\u0671-\\u06D3\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4\\u07F5\\u07FA\\u0800-\\u0815\\u081A\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086A\\u0870-\\u0887\\u0889-\\u088E\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDD\\u0CDE\\u0CE0\\u0CE1\\u0CF1\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\u1C88\\u1C90-\\u1CBA\\u1CBD-\\u1CBF\\u1CE9-\\u1CEC\\u1CEE-\\u1CF3\\u1CF5\\u1CF6\\u1CFA\\u1D00-\\u1DBF\\u1E00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2071\\u207F\\u2090-\\u209C\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2139\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u2183\\u2184\\u2C00-\\u2CE4\\u2CEB-\\u2CEE\\u2CF2\\u2CF3\\u2D00-\\u2D25\\u2D27\\u2D2D\\u2D30-\\u2D67\\u2D6F\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u2E2F\\u3005\\u3006\\u3031-\\u3035\\u303B\\u303C\\u3041-\\u3096\\u309D-\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FF\\u3105-\\u312F\\u3131-\\u318E\\u31A0-\\u31BF\\u31F0-\\u31FF\\u3400-\\u4DBF\\u4E00-\\uA48C\\uA4D0-\\uA4FD\\uA500-\\uA60C\\uA610-\\uA61F\\uA62A\\uA62B\\uA640-\\uA66E\\uA67F-\\uA69D\\uA6A0-\\uA6E5\\uA717-\\uA71F\\uA722-\\uA788\\uA78B-\\uA7CA\\uA7D0\\uA7D1\\uA7D3\\uA7D5-\\uA7D9\\uA7F2-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]|\\uD800[\\uDC00-\\uDC0B\\uDC0D-\\uDC26\\uDC28-\\uDC3A\\uDC3C\\uDC3D\\uDC3F-\\uDC4D\\uDC50-\\uDC5D\\uDC80-\\uDCFA\\uDE80-\\uDE9C\\uDEA0-\\uDED0\\uDF00-\\uDF1F\\uDF2D-\\uDF40\\uDF42-\\uDF49\\uDF50-\\uDF75\\uDF80-\\uDF9D\\uDFA0-\\uDFC3\\uDFC8-\\uDFCF]|\\uD801[\\uDC00-\\uDC9D\\uDCB0-\\uDCD3\\uDCD8-\\uDCFB\\uDD00-\\uDD27\\uDD30-\\uDD63\\uDD70-\\uDD7A\\uDD7C-\\uDD8A\\uDD8C-\\uDD92\\uDD94\\uDD95\\uDD97-\\uDDA1\\uDDA3-\\uDDB1\\uDDB3-\\uDDB9\\uDDBB\\uDDBC\\uDE00-\\uDF36\\uDF40-\\uDF55\\uDF60-\\uDF67\\uDF80-\\uDF85\\uDF87-\\uDFB0\\uDFB2-\\uDFBA]|\\uD802[\\uDC00-\\uDC05\\uDC08\\uDC0A-\\uDC35\\uDC37\\uDC38\\uDC3C\\uDC3F-\\uDC55\\uDC60-\\uDC76\\uDC80-\\uDC9E\\uDCE0-\\uDCF2\\uDCF4\\uDCF5\\uDD00-\\uDD15\\uDD20-\\uDD39\\uDD80-\\uDDB7\\uDDBE\\uDDBF\\uDE00\\uDE10-\\uDE13\\uDE15-\\uDE17\\uDE19-\\uDE35\\uDE60-\\uDE7C\\uDE80-\\uDE9C\\uDEC0-\\uDEC7\\uDEC9-\\uDEE4\\uDF00-\\uDF35\\uDF40-\\uDF55\\uDF60-\\uDF72\\uDF80-\\uDF91]|\\uD803[\\uDC00-\\uDC48\\uDC80-\\uDCB2\\uDCC0-\\uDCF2\\uDD00-\\uDD23\\uDE80-\\uDEA9\\uDEB0\\uDEB1\\uDF00-\\uDF1C\\uDF27\\uDF30-\\uDF45\\uDF70-\\uDF81\\uDFB0-\\uDFC4\\uDFE0-\\uDFF6]|\\uD804[\\uDC03-\\uDC37\\uDC71\\uDC72\\uDC75\\uDC83-\\uDCAF\\uDCD0-\\uDCE8\\uDD03-\\uDD26\\uDD44\\uDD47\\uDD50-\\uDD72\\uDD76\\uDD83-\\uDDB2\\uDDC1-\\uDDC4\\uDDDA\\uDDDC\\uDE00-\\uDE11\\uDE13-\\uDE2B\\uDE3F\\uDE40\\uDE80-\\uDE86\\uDE88\\uDE8A-\\uDE8D\\uDE8F-\\uDE9D\\uDE9F-\\uDEA8\\uDEB0-\\uDEDE\\uDF05-\\uDF0C\\uDF0F\\uDF10\\uDF13-\\uDF28\\uDF2A-\\uDF30\\uDF32\\uDF33\\uDF35-\\uDF39\\uDF3D\\uDF50\\uDF5D-\\uDF61]|\\uD805[\\uDC00-\\uDC34\\uDC47-\\uDC4A\\uDC5F-\\uDC61\\uDC80-\\uDCAF\\uDCC4\\uDCC5\\uDCC7\\uDD80-\\uDDAE\\uDDD8-\\uDDDB\\uDE00-\\uDE2F\\uDE44\\uDE80-\\uDEAA\\uDEB8\\uDF00-\\uDF1A\\uDF40-\\uDF46]|\\uD806[\\uDC00-\\uDC2B\\uDCA0-\\uDCDF\\uDCFF-\\uDD06\\uDD09\\uDD0C-\\uDD13\\uDD15\\uDD16\\uDD18-\\uDD2F\\uDD3F\\uDD41\\uDDA0-\\uDDA7\\uDDAA-\\uDDD0\\uDDE1\\uDDE3\\uDE00\\uDE0B-\\uDE32\\uDE3A\\uDE50\\uDE5C-\\uDE89\\uDE9D\\uDEB0-\\uDEF8]|\\uD807[\\uDC00-\\uDC08\\uDC0A-\\uDC2E\\uDC40\\uDC72-\\uDC8F\\uDD00-\\uDD06\\uDD08\\uDD09\\uDD0B-\\uDD30\\uDD46\\uDD60-\\uDD65\\uDD67\\uDD68\\uDD6A-\\uDD89\\uDD98\\uDEE0-\\uDEF2\\uDF02\\uDF04-\\uDF10\\uDF12-\\uDF33\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD81C-\\uD820\\uD822\\uD840-\\uD868\\uD86A-\\uD86C\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883\\uD885-\\uD887][\\uDC00-\\uDFFF]|\\uD80D[\\uDC00-\\uDC2F\\uDC41-\\uDC46]|\\uD811[\\uDC00-\\uDE46]|\\uD81A[\\uDC00-\\uDE38\\uDE40-\\uDE5E\\uDE70-\\uDEBE\\uDED0-\\uDEED\\uDF00-\\uDF2F\\uDF40-\\uDF43\\uDF63-\\uDF77\\uDF7D-\\uDF8F]|\\uD81B[\\uDE40-\\uDE7F\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3]|\\uD821[\\uDC00-\\uDFF7]|\\uD823[\\uDC00-\\uDCD5\\uDD00-\\uDD08]|\\uD82B[\\uDFF0-\\uDFF3\\uDFF5-\\uDFFB\\uDFFD\\uDFFE]|\\uD82C[\\uDC00-\\uDD22\\uDD32\\uDD50-\\uDD52\\uDD55\\uDD64-\\uDD67\\uDD70-\\uDEFB]|\\uD82F[\\uDC00-\\uDC6A\\uDC70-\\uDC7C\\uDC80-\\uDC88\\uDC90-\\uDC99]|\\uD835[\\uDC00-\\uDC54\\uDC56-\\uDC9C\\uDC9E\\uDC9F\\uDCA2\\uDCA5\\uDCA6\\uDCA9-\\uDCAC\\uDCAE-\\uDCB9\\uDCBB\\uDCBD-\\uDCC3\\uDCC5-\\uDD05\\uDD07-\\uDD0A\\uDD0D-\\uDD14\\uDD16-\\uDD1C\\uDD1E-\\uDD39\\uDD3B-\\uDD3E\\uDD40-\\uDD44\\uDD46\\uDD4A-\\uDD50\\uDD52-\\uDEA5\\uDEA8-\\uDEC0\\uDEC2-\\uDEDA\\uDEDC-\\uDEFA\\uDEFC-\\uDF14\\uDF16-\\uDF34\\uDF36-\\uDF4E\\uDF50-\\uDF6E\\uDF70-\\uDF88\\uDF8A-\\uDFA8\\uDFAA-\\uDFC2\\uDFC4-\\uDFCB]|\\uD837[\\uDF00-\\uDF1E\\uDF25-\\uDF2A]|\\uD838[\\uDC30-\\uDC6D\\uDD00-\\uDD2C\\uDD37-\\uDD3D\\uDD4E\\uDE90-\\uDEAD\\uDEC0-\\uDEEB]|\\uD839[\\uDCD0-\\uDCEB\\uDFE0-\\uDFE6\\uDFE8-\\uDFEB\\uDFED\\uDFEE\\uDFF0-\\uDFFE]|\\uD83A[\\uDC00-\\uDCC4\\uDD00-\\uDD43\\uDD4B]|\\uD83B[\\uDE00-\\uDE03\\uDE05-\\uDE1F\\uDE21\\uDE22\\uDE24\\uDE27\\uDE29-\\uDE32\\uDE34-\\uDE37\\uDE39\\uDE3B\\uDE42\\uDE47\\uDE49\\uDE4B\\uDE4D-\\uDE4F\\uDE51\\uDE52\\uDE54\\uDE57\\uDE59\\uDE5B\\uDE5D\\uDE5F\\uDE61\\uDE62\\uDE64\\uDE67-\\uDE6A\\uDE6C-\\uDE72\\uDE74-\\uDE77\\uDE79-\\uDE7C\\uDE7E\\uDE80-\\uDE89\\uDE8B-\\uDE9B\\uDEA1-\\uDEA3\\uDEA5-\\uDEA9\\uDEAB-\\uDEBB]|\\uD869[\\uDC00-\\uDEDF\\uDF00-\\uDFFF]|\\uD86D[\\uDC00-\\uDF39\\uDF40-\\uDFFF]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEA1\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A\\uDF50-\\uDFFF]|\\uD888[\\uDC00-\\uDFAF])*$/.test(s)\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: 'RelationalNode',\n    test: isRelationalNode\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.addConversions([{\n    from: 'number',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n\n      // note: conversion from number to BigNumber can fail if x has >15 digits\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      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      return new Complex(x, 0);\n    }\n  }, {\n    from: 'BigNumber',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\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      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      var f = new Fraction(x);\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      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      if (isNaN(n)) {\n        throw new Error('Cannot convert \"' + x + '\" to a number');\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      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      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      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      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      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      return new DenseMatrix(array);\n    }\n  }, {\n    from: 'Matrix',\n    to: 'Array',\n    convert: function convert(matrix) {\n      return matrix.valueOf();\n    }\n  }]);\n\n  // Provide a suggestion on how to call a function elementwise\n  // This was added primarily as guidance for the v10 -> v11 transition,\n  // and could potentially be removed in the future if it no longer seems\n  // to be helpful.\n  typed.onMismatch = (name, args, signatures) => {\n    var usualError = typed.createError(name, args, signatures);\n    if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && isCollection(args[0]) &&\n    // check if the function can be unary:\n    signatures.some(sig => !sig.params.includes(','))) {\n      var err = new TypeError(\"Function '\".concat(name, \"' doesn't apply to matrices. To call it \") + \"elementwise on a matrix 'M', try 'map(M, \".concat(name, \")'.\"));\n      err.data = usualError.data;\n      throw err;\n    }\n    throw usualError;\n  };\n\n  // Provide a suggestion on how to call a function elementwise\n  // This was added primarily as guidance for the v10 -> v11 transition,\n  // and could potentially be removed in the future if it no longer seems\n  // to be helpful.\n  typed.onMismatch = (name, args, signatures) => {\n    var usualError = typed.createError(name, args, signatures);\n    if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && isCollection(args[0]) &&\n    // check if the function can be unary:\n    signatures.some(sig => !sig.params.includes(','))) {\n      var err = new TypeError(\"Function '\".concat(name, \"' doesn't apply to matrices. To call it \") + \"elementwise on a matrix 'M', try 'map(M, \".concat(name, \")'.\"));\n      err.data = usualError.data;\n      throw err;\n    }\n    throw usualError;\n  };\n  return typed;\n});\nfunction throwNoBignumber(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a BigNumber: no class 'BigNumber' provided\"));\n}\nfunction throwNoComplex(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a Complex number: no class 'Complex' provided\"));\n}\nfunction throwNoMatrix() {\n  throw new Error('Cannot convert array into a Matrix: no class \\'DenseMatrix\\' provided');\n}\nfunction throwNoFraction(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a Fraction, no class 'Fraction' provided.\"));\n}","/*!\r\n *  decimal.js v10.4.3\r\n *  An arbitrary-precision Decimal type for JavaScript.\r\n *  https://github.com/MikeMcl/decimal.js\r\n *  Copyright (c) 2022 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\nvar 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  inexact, 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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nvar 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction trunc(x) {\r\n  return finalise(x = new this(x), x.e + 1, 1);\r\n}\r\n\r\n\r\nP[Symbol.for('nodejs.util.inspect.custom')] = P.toString;\r\nP[Symbol.toStringTag] = 'Decimal';\r\n\r\n// Create and configure initial Decimal constructor.\r\nexport var Decimal = P.constructor = clone(DEFAULTS);\r\n\r\n// Create the internal constants from their string values.\r\nLN10 = new Decimal(LN10);\r\nPI = new Decimal(PI);\r\n\r\nexport default Decimal;\r\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  /**\n   * Attach type information\n   */\n  BigNumber.prototype.type = 'BigNumber';\n  BigNumber.prototype.isBigNumber = true;\n\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  BigNumber.prototype.toJSON = function () {\n    return {\n      mathjs: 'BigNumber',\n      value: this.toString()\n    };\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  BigNumber.fromJSON = function (json) {\n    return new BigNumber(json.value);\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  return BigNumber;\n}, {\n  isClass: true\n});","/**\n * @license Complex.js v2.1.1 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 = Math.cosh || function(x) {\n    return Math.abs(x) < 1e-9 ? 1 - x : (Math.exp(x) + Math.exp(-x)) * 0.5;\n  };\n\n  var sinh = Math.sinh || function(x) {\n    return Math.abs(x) < 1e-9 ? x : (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     a = a / 2;\n     b = b / 2;\n\n    return 0.5 * Math.log(a * a + b * b) + Math.LN2;\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(z) = ( e^iz - e^-iz ) / 2i \n      //        = sin(a)cosh(b) + i cos(a)sinh(b)\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^iz + e^-iz ) / 2 \n      //        = cos(a)cosh(b) - i sin(a)sinh(b)\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(z) = sin(z) / cos(z) \n      //        = ( e^iz - e^-iz ) / ( i( e^iz + e^-iz ) )\n      //        = ( e^2iz - 1 ) / i( e^2iz + 1 )\n      //        = ( sin(2a) + i sinh(2b) ) / ( cos(2a) + cosh(2b) )\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","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  Object.defineProperty(Complex, 'name', {\n    value: 'Complex'\n  });\n  Complex.prototype.constructor = Complex;\n  Complex.prototype.type = 'Complex';\n  Complex.prototype.isComplex = true;\n\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  Complex.prototype.toJSON = function () {\n    return {\n      mathjs: 'Complex',\n      re: this.re,\n      im: this.im\n    };\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  Complex.prototype.toPolar = function () {\n    return {\n      r: this.abs(),\n      phi: this.arg()\n    };\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  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);\n\n    // round either re or im when smaller than the configured precision\n    var precision = isNumber(options) ? options : options ? options.precision : null;\n    if (precision !== null) {\n      var epsilon = Math.pow(10, -precision);\n      if (Math.abs(re / im) < epsilon) {\n        re = 0;\n      }\n      if (Math.abs(im / re) < epsilon) {\n        im = 0;\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    return str;\n  };\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  Complex.fromPolar = function (args) {\n    switch (arguments.length) {\n      case 1:\n        {\n          var arg = arguments[0];\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      case 2:\n        {\n          var r = arguments[0];\n          var phi = arguments[1];\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            if (isNumber(phi)) {\n              return new Complex({\n                r,\n                phi\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      default:\n        throw new SyntaxError('Wrong number of arguments in function fromPolar');\n    }\n  };\n  Complex.prototype.valueOf = Complex.prototype.toString;\n\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  Complex.fromJSON = function (json) {\n    return new Complex(json);\n  };\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  Complex.compare = function (a, b) {\n    if (a.re > b.re) {\n      return 1;\n    }\n    if (a.re < b.re) {\n      return -1;\n    }\n    if (a.im > b.im) {\n      return 1;\n    }\n    if (a.im < b.im) {\n      return -1;\n    }\n    return 0;\n  };\n  return Complex;\n}, {\n  isClass: true\n});","/**\n * @license Fraction.js v4.3.0 20/08/2023\n * https://www.xarg.org/2014/03/rational-numbers-in-javascript/\n *\n * Copyright (c) 2023, Robert Eisele (robert@raw.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 => <numerator>, 1 => <denominator> ]\n * [ n => <numerator>, 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 assign(n, s) {\n\n    if (isNaN(n = parseInt(n, 10))) {\n      throw InvalidParameter();\n    }\n    return n * s;\n  }\n\n  // Creates a new Fraction internally without the need of the bulky constructor\n  function newFraction(n, d) {\n\n    if (d === 0) {\n      throw DivisionByZero();\n    }\n\n    var f = Object.create(Fraction.prototype);\n    f[\"s\"] = n < 0 ? -1 : 1;\n\n    n = n < 0 ? -n : n;\n\n    var a = gcd(n, d);\n\n    f[\"n\"] = n / a;\n    f[\"d\"] = d / a;\n    return f;\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\n      if (n % 1 !== 0 || d % 1 !== 0) {\n        throw NonIntegerParameter();\n      }\n\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              throw InvalidParameter();\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              throw InvalidParameter();\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          throw InvalidParameter();\n      }\n\n    if (d === 0) {\n      throw 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    parse(a, b);\n\n    if (this instanceof Fraction) {\n      a = gcd(P[\"d\"], P[\"n\"]); // Abuse variable a\n      this[\"s\"] = P[\"s\"];\n      this[\"n\"] = P[\"n\"] / a;\n      this[\"d\"] = P[\"d\"] / a;\n    } else {\n      return newFraction(P['s'] * P['n'], P['d']);\n    }\n  }\n\n  var DivisionByZero = function() { return new Error(\"Division by Zero\"); };\n  var InvalidParameter = function() { return new Error(\"Invalid argument\"); };\n  var NonIntegerParameter = function() { return new Error(\"Parameters must be integer\"); };\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 newFraction(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 newFraction(-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 newFraction(\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 newFraction(\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 newFraction(\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 newFraction(\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 newFraction(this['s'] * this['n'], this['d']);\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 newFraction(this[\"s\"] * this[\"n\"] % this[\"d\"], 1);\n      }\n\n      parse(a, b);\n      if (0 === P[\"n\"] && 0 === this[\"d\"]) {\n        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 newFraction(\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 newFraction(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 newFraction(0, 1);\n      }\n      return newFraction(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 newFraction(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 newFraction(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 newFraction(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 newFraction(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 newFraction(Math.pow(this['s'] * this[\"d\"], P['n']), Math.pow(this[\"n\"], P['n']));\n        } else {\n          return newFraction(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 newFraction(d, n);\n      }\n      return newFraction(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      if (isNaN(this['n']) || isNaN(this['d'])) {\n        return this;\n      }\n\n      eps = eps || 0.001;\n\n      var thisABS = this['abs']();\n      var cont = thisABS['toContinued']();\n\n      for (var i = 1; i < cont.length; i++) {\n\n        var s = newFraction(cont[i - 1], 1);\n        for (var k = i - 2; k >= 0; k--) {\n          s = s['inverse']()['add'](cont[k]);\n        }\n\n        if (Math.abs(s['sub'](thisABS).valueOf()) < eps) {\n          return s['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(true) => \"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 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'] < 0 ? \"-\" : \"\";\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 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","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  Object.defineProperty(Fraction, 'name', {\n    value: 'Fraction'\n  });\n  Fraction.prototype.constructor = Fraction;\n  Fraction.prototype.type = 'Fraction';\n  Fraction.prototype.isFraction = true;\n\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  Fraction.prototype.toJSON = function () {\n    return {\n      mathjs: 'Fraction',\n      n: this.s * this.n,\n      d: this.d\n    };\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  Fraction.fromJSON = function (json) {\n    return new Fraction(json);\n  };\n  return Fraction;\n}, {\n  isClass: true\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  /**\n   * Attach type information\n   */\n  Matrix.prototype.type = 'Matrix';\n  Matrix.prototype.isMatrix = true;\n\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  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  /**\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  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  /**\n   * Create a new Matrix With the type of the current matrix instance\n   * @param {Array | Object} data\n   * @param {string} [datatype]\n   */\n  Matrix.prototype.create = function (data, datatype) {\n    throw new Error('Cannot invoke create on a Matrix interface');\n  };\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  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  /**\n   * Get a single element from the matrix.\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\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  /**\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  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  /**\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  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  /**\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  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  /**\n   * Create a clone of the matrix\n   * @return {Matrix} clone\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  /**\n   * Retrieve the size of the matrix.\n   * @returns {number[]} size\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  /**\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  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  /**\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  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  /**\n   * Iterate over the matrix elements\n   * @return {Iterable<{ value, index: number[] }>}\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  /**\n   * Create an Array with a copy of the data of the Matrix\n   * @returns {Array} array\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  /**\n   * Get the primitive value of the Matrix: a multidimensional array\n   * @returns {Array} array\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  /**\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  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  /**\n   * Get a string representation of the matrix\n   * @returns {string} str\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  return Matrix;\n}, {\n  isClass: true\n});","import { isBigNumber, isNumber } from '../is.js';\nimport { isInteger, normalizeFormatOptions } from '../number.js';\n\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 */\nfunction formatBigNumberToBase(n, base, size) {\n  var BigNumberCtor = n.constructor;\n  var big2 = new BigNumberCtor(2);\n  var suffix = '';\n  if (size) {\n    if (size < 1) {\n      throw new Error('size must be in greater than 0');\n    }\n    if (!isInteger(size)) {\n      throw new Error('size must be an integer');\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    if (!n.isInteger()) {\n      throw new Error('Value must be an integer');\n    }\n    if (n.lessThan(0)) {\n      n = n.add(big2.pow(size));\n    }\n    suffix = \"i\".concat(size);\n  }\n  switch (base) {\n    case 2:\n      return \"\".concat(n.toBinary()).concat(suffix);\n    case 8:\n      return \"\".concat(n.toOctal()).concat(suffix);\n    case 16:\n      return \"\".concat(n.toHexadecimal()).concat(suffix);\n    default:\n      throw new Error(\"Base \".concat(base, \" not supported \"));\n  }\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 | BigNumber} [options]\n * @return {string} str The formatted value\n */\nexport function format(value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value);\n  }\n\n  // handle special cases\n  if (!value.isFinite()) {\n    return value.isNaN() ? 'NaN' : value.gt(0) ? 'Infinity' : '-Infinity';\n  }\n  var {\n    notation,\n    precision,\n    wordSize\n  } = normalizeFormatOptions(options);\n\n  // handle the various notations\n  switch (notation) {\n    case 'fixed':\n      return toFixed(value, precision);\n    case 'exponential':\n      return toExponential(value, precision);\n    case 'engineering':\n      return toEngineering(value, precision);\n    case 'bin':\n      return formatBigNumberToBase(value, 2, wordSize);\n    case 'oct':\n      return formatBigNumberToBase(value, 8, wordSize);\n    case 'hex':\n      return formatBigNumberToBase(value, 16, wordSize);\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 = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.lowerExp, -3);\n        var upperExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.upperExp, 5);\n\n        // handle special case zero\n        if (value.isZero()) return '0';\n\n        // determine whether or not to output exponential notation\n        var str;\n        var rounded = value.toSignificantDigits(precision);\n        var exp = rounded.e;\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        }\n\n        // remove trailing zeros after the decimal point\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    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n  }\n}\n\n/**\n * Format a BigNumber in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {BigNumber} value\n * @param {number} [precision]        Optional number of significant figures to return.\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;\n\n  // find difference in exponents, and calculate the value without exponent\n  var valueWithoutExp = value.mul(Math.pow(10, -newExp));\n  var valueStr = valueWithoutExp.toPrecision(precision);\n  if (valueStr.includes('e')) {\n    var BigNumber = value.constructor;\n    valueStr = new BigNumber(valueStr).toFixed();\n  }\n  return valueStr + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\n}\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 */\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/**\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 */\nexport function toFixed(value, precision) {\n  return value.toFixed(precision);\n}\nfunction _toNumberOrDefault(value, defaultValue) {\n  if (isNumber(value)) {\n    return value;\n  } else if (isBigNumber(value)) {\n    return value.toNumber();\n  } else {\n    return defaultValue;\n  }\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/**\n * Check if a text ends with a certain string.\n * @param {string} text\n * @param {string} search\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/**\n * Format a value of any type into a string.\n *\n * Usage:\n *     math.format(value)\n *     math.format(value, precision)\n *     math.format(value, options)\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]\n *     Formatting options. See src/utils/number.js:format for a\n *     description of the available options controlling number output.\n *     This generic \"format\" also supports the option property `truncate: NN`\n *     giving the maximum number NN of characters to return (if there would\n *     have been more, they are deleted and replaced by an ellipsis).\n * @return {string} str\n */\nexport function format(value, options) {\n  var result = _format(value, options);\n  if (options && typeof options === 'object' && 'truncate' in options && result.length > options.truncate) {\n    return result.substring(0, options.truncate - 3) + '...';\n  }\n  return result;\n}\nfunction _format(value, options) {\n  if (typeof value === 'number') {\n    return formatNumber(value, options);\n  }\n  if (isBigNumber(value)) {\n    return formatBigNumber(value, options);\n  }\n\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  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  if (Array.isArray(value)) {\n    return formatArray(value, options);\n  }\n  if (isString(value)) {\n    return stringify(value);\n  }\n  if (typeof value === 'function') {\n    return value.syntax ? String(value.syntax) : 'function';\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 stringify(key) + ': ' + format(value[key], options);\n      });\n      return '{' + entries.join(', ') + '}';\n    }\n  }\n  return String(value);\n}\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 */\nexport function stringify(value) {\n  var text = String(value);\n  var escaped = '';\n  var i = 0;\n  while (i < text.length) {\n    var c = text.charAt(i);\n    escaped += c in controlCharacters ? controlCharacters[c] : c;\n    i++;\n  }\n  return '\"' + escaped + '\"';\n}\nvar controlCharacters = {\n  '\"': '\\\\\"',\n  '\\\\': '\\\\\\\\',\n  '\\b': '\\\\b',\n  '\\f': '\\\\f',\n  '\\n': '\\\\n',\n  '\\r': '\\\\r',\n  '\\t': '\\\\t'\n};\n\n/**\n * Escape special HTML characters\n * @param {*} value\n * @return {string}\n */\nexport function escape(value) {\n  var text = String(value);\n  text = text.replace(/&/g, '&amp;').replace(/\"/g, '&quot;').replace(/'/g, '&#39;').replace(/</g, '&lt;').replace(/>/g, '&gt;');\n  return text;\n}\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 */\nfunction formatArray(array, options) {\n  if (Array.isArray(array)) {\n    var str = '[';\n    var len = array.length;\n    for (var i = 0; i < len; i++) {\n      if (i !== 0) {\n        str += ', ';\n      }\n      str += formatArray(array[i], options);\n    }\n    str += ']';\n    return str;\n  } else {\n    return format(array, options);\n  }\n}\n\n/**\n * Check whether a value looks like a Fraction (unsafe duck-type check)\n * @param {*} value\n * @return {boolean}\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/**\n * Compare two strings\n * @param {string} x\n * @param {string} y\n * @returns {number}\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  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  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  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  this.index = index;\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  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  this.stack = new Error().stack;\n}\nIndexError.prototype = new RangeError();\nIndexError.prototype.constructor = RangeError;\nIndexError.prototype.name = 'IndexError';\nIndexError.prototype.isIndexError = true;","import _extends from \"@babel/runtime/helpers/extends\";\nimport { isInteger } from './number.js';\nimport { isNumber, isBigNumber, isArray, isString } from './is.js';\nimport { format } from './string.js';\nimport { DimensionError } from '../error/DimensionError.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { deepStrictEqual } from './object.js';\n\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 */\nexport function arraySize(x) {\n  var s = [];\n  while (Array.isArray(x)) {\n    s.push(x.length);\n    x = x[0];\n  }\n  return s;\n}\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 */\nfunction _validate(array, size, dim) {\n  var i;\n  var len = array.length;\n  if (len !== size[dim]) {\n    throw new DimensionError(len, size[dim]);\n  }\n  if (dim < size.length - 1) {\n    // recursively validate each child array\n    var dimNext = dim + 1;\n    for (i = 0; i < len; i++) {\n      var child = array[i];\n      if (!Array.isArray(child)) {\n        throw new DimensionError(size.length - 1, size.length, '<');\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/**\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 */\nexport function validate(array, size) {\n  var isScalar = size.length === 0;\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/**\n * Validate whether the source of the index matches the size of the Array\n * @param {Array | Matrix} array    Array to be validated\n * @param {Index} index  Index with the source information to validate\n * @throws DimensionError\n */\nexport function validateIndexSourceSize(value, index) {\n  var valueSize = value.isMatrix ? value._size : arraySize(value);\n  var sourceSize = index._sourceSize;\n  // checks if the source size is not null and matches the valueSize\n  sourceSize.forEach((sourceDim, i) => {\n    if (sourceDim !== null && sourceDim !== valueSize[i]) {\n      throw new DimensionError(sourceDim, valueSize[i]);\n    }\n  });\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 */\nexport function validateIndex(index, length) {\n  if (index !== undefined) {\n    if (!isNumber(index) || !isInteger(index)) {\n      throw new TypeError('Index must be an integer (value: ' + index + ')');\n    }\n    if (index < 0 || typeof length === 'number' && index >= length) {\n      throw new IndexError(index, length);\n    }\n  }\n}\n\n/**\n * Test if and index has empty values\n * @param {number} index    Zero-based index\n */\nexport function isEmptyIndex(index) {\n  for (var i = 0; i < index._dimensions.length; ++i) {\n    var dimension = index._dimensions[i];\n    if (dimension._data && isArray(dimension._data)) {\n      if (dimension._size[0] === 0) {\n        return true;\n      }\n    } else if (dimension.isRange) {\n      if (dimension.start === dimension.end) {\n        return true;\n      }\n    } else if (isString(dimension)) {\n      if (dimension.length === 0) {\n        return true;\n      }\n    }\n  }\n  return false;\n}\n\n/**\n * Resize a multi dimensional array. The resized array is returned.\n * @param {Array | number} array         Array to be resized\n * @param {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 */\nexport function resize(array, size, defaultValue) {\n  // check the type of the arguments\n  if (!Array.isArray(size)) {\n    throw new TypeError('Array expected');\n  }\n  if (size.length === 0) {\n    throw new Error('Resizing to scalar is not supported');\n  }\n\n  // check whether size contains positive integers\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  });\n\n  // convert number to an array\n  if (isNumber(array) || isBigNumber(array)) {\n    array = [array];\n  }\n\n  // recursively resize the array\n  var _defaultValue = defaultValue !== undefined ? defaultValue : 0;\n  _resize(array, size, 0, _defaultValue);\n  return array;\n}\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 */\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);\n\n  // apply new length\n  array.length = newLen;\n  if (dim < size.length - 1) {\n    // non-last dimension\n    var dimNext = dim + 1;\n\n    // resize existing child arrays\n    for (i = 0; i < minLen; i++) {\n      // resize child array\n      elem = array[i];\n      if (!Array.isArray(elem)) {\n        elem = [elem]; // add a dimension\n        array[i] = elem;\n      }\n      _resize(elem, size, dimNext, defaultValue);\n    }\n\n    // create new child arrays\n    for (i = minLen; i < newLen; i++) {\n      // get child array\n      elem = [];\n      array[i] = elem;\n\n      // resize new child array\n      _resize(elem, size, dimNext, defaultValue);\n    }\n  } else {\n    // last dimension\n\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    }\n\n    // fill new elements with the default value\n    for (i = minLen; i < newLen; i++) {\n      array[i] = defaultValue;\n    }\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 {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 */\nexport function reshape(array, sizes) {\n  var flatArray = flatten(array);\n  var currentLength = flatArray.length;\n  if (!Array.isArray(array) || !Array.isArray(sizes)) {\n    throw new TypeError('Array expected');\n  }\n  if (sizes.length === 0) {\n    throw new DimensionError(0, currentLength, '!=');\n  }\n  sizes = processSizesWildcard(sizes, currentLength);\n  var newLength = product(sizes);\n  if (currentLength !== newLength) {\n    throw new DimensionError(newLength, currentLength, '!=');\n  }\n  try {\n    return _reshape(flatArray, sizes);\n  } catch (e) {\n    if (e instanceof DimensionError) {\n      throw new DimensionError(newLength, currentLength, '!=');\n    }\n    throw e;\n  }\n}\n\n/**\n * Replaces the wildcard -1 in the sizes array.\n * @param {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 {number[]}      The sizes array with wildcard replaced.\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  if (isMoreThanOneWildcard) {\n    throw new Error('More than one wildcard in sizes');\n  }\n  var hasWildcard = wildCardIndex >= 0;\n  var canReplaceWildcard = currentLength % newLength === 0;\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  return processedSizes;\n}\n\n/**\n * Computes the product of all array elements.\n * @param {number[]} array Array of factors\n * @returns {number}            Product of all elements\n */\nfunction product(array) {\n  return array.reduce((prev, curr) => prev * curr, 1);\n}\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 {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\nfunction _reshape(array, sizes) {\n  // testing if there are enough elements for the requested shape\n  var tmpArray = array;\n  var tmpArray2;\n  // for each dimensions starting by the last one and ignoring the first one\n  for (var sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {\n    var size = sizes[sizeIndex];\n    tmpArray2 = [];\n\n    // aggregate the elements of the current tmpArray in elements of the requested size\n    var length = tmpArray.length / size;\n    for (var i = 0; i < length; i++) {\n      tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size));\n    }\n    // set it as the new tmpArray for the next loop turn or for return\n    tmpArray = tmpArray2;\n  }\n  return tmpArray;\n}\n\n/**\n * Squeeze a multi dimensional array\n * @param {Array} array\n * @param {Array} [size]\n * @returns {Array} returns the array itself\n */\nexport function squeeze(array, size) {\n  var s = size || arraySize(array);\n\n  // squeeze outer dimensions\n  while (Array.isArray(array) && array.length === 1) {\n    array = array[0];\n    s.shift();\n  }\n\n  // find the first dimension to be squeezed\n  var dims = s.length;\n  while (s[dims - 1] === 1) {\n    dims--;\n  }\n\n  // squeeze inner dimensions\n  if (dims < s.length) {\n    array = _squeeze(array, dims, 0);\n    s.length = dims;\n  }\n  return array;\n}\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 */\nfunction _squeeze(array, dims, dim) {\n  var i, ii;\n  if (dim < dims) {\n    var next = dim + 1;\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  return array;\n}\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 */\nexport function unsqueeze(array, dims, outer, size) {\n  var s = size || arraySize(array);\n\n  // unsqueeze outer dimensions\n  if (outer) {\n    for (var i = 0; i < outer; i++) {\n      array = [array];\n      s.unshift(1);\n    }\n  }\n\n  // unsqueeze inner dimensions\n  array = _unsqueeze(array, dims, 0);\n  while (s.length < dims) {\n    s.push(1);\n  }\n  return array;\n}\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 */\nfunction _unsqueeze(array, dims, dim) {\n  var i, ii;\n  if (Array.isArray(array)) {\n    var next = dim + 1;\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  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 */\nexport function flatten(array) {\n  if (!Array.isArray(array)) {\n    // if not an array, return as is\n    return array;\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/**\n * A safe map\n * @param {Array} array\n * @param {function} callback\n */\nexport function map(array, callback) {\n  return Array.prototype.map.call(array, callback);\n}\n\n/**\n * A safe forEach\n * @param {Array} array\n * @param {function} callback\n */\nexport function forEach(array, callback) {\n  Array.prototype.forEach.call(array, callback);\n}\n\n/**\n * A safe filter\n * @param {Array} array\n * @param {function} callback\n */\nexport function filter(array, callback) {\n  if (arraySize(array).length !== 1) {\n    throw new Error('Only one dimensional matrices supported');\n  }\n  return Array.prototype.filter.call(array, callback);\n}\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 */\nexport function filterRegExp(array, regexp) {\n  if (arraySize(array).length !== 1) {\n    throw new Error('Only one dimensional matrices supported');\n  }\n  return Array.prototype.filter.call(array, entry => regexp.test(entry));\n}\n\n/**\n * A safe join\n * @param {Array} array\n * @param {string} separator\n */\nexport function join(array, separator) {\n  return Array.prototype.join.call(array, separator);\n}\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 */\nexport function identify(a) {\n  if (!Array.isArray(a)) {\n    throw new TypeError('Array input expected');\n  }\n  if (a.length === 0) {\n    return a;\n  }\n  var b = [];\n  var count = 0;\n  b[0] = {\n    value: a[0],\n    identifier: 0\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    b.push({\n      value: a[i],\n      identifier: count\n    });\n  }\n  return b;\n}\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 */\nexport function generalize(a) {\n  if (!Array.isArray(a)) {\n    throw new TypeError('Array input expected');\n  }\n  if (a.length === 0) {\n    return a;\n  }\n  var b = [];\n  for (var i = 0; i < a.length; i++) {\n    b.push(a[i].value);\n  }\n  return b;\n}\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 */\nexport function getArrayDataType(array, typeOf) {\n  var type; // to hold type info\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);\n\n    // Saving the target matrix row size\n    if (i === 0 && _isArray) {\n      length = item.length;\n    }\n\n    // If the current item is an array but the length does not equal the targetVectorSize\n    if (_isArray && item.length !== length) {\n      return undefined;\n    }\n    var itemType = _isArray ? getArrayDataType(item, typeOf) // recurse into a nested array\n    : typeOf(item);\n    if (type === undefined) {\n      type = itemType; // first item\n    } else if (type !== itemType) {\n      return 'mixed';\n    } else {\n      // we're good, everything has the same type so far\n    }\n  }\n  return type;\n}\n\n/**\n * Return the last item from an array\n * @param {array}\n * @returns {*}\n */\nexport function last(array) {\n  return array[array.length - 1];\n}\n\n/**\n * Get all but the last element of array.\n * @param {array}\n * @returns {*}\n */\nexport function initial(array) {\n  return array.slice(0, array.length - 1);\n}\n\n/**\n * Recursively concatenate two matrices.\n * The contents of the matrices is not cloned.\n * @param {Array} a             Multi dimensional array\n * @param {Array} b             Multi dimensional array\n * @param {number} concatDim    The dimension on which to concatenate (zero-based)\n * @param {number} dim          The current dim (zero-based)\n * @return {Array} c            The concatenated matrix\n * @private\n */\nfunction concatRecursive(a, b, concatDim, dim) {\n  if (dim < concatDim) {\n    // recurse into next dimension\n    if (a.length !== b.length) {\n      throw new DimensionError(a.length, b.length);\n    }\n    var c = [];\n    for (var i = 0; i < a.length; i++) {\n      c[i] = concatRecursive(a[i], b[i], concatDim, dim + 1);\n    }\n    return c;\n  } else {\n    // concatenate this dimension\n    return a.concat(b);\n  }\n}\n\n/**\n * Concatenates many arrays in the specified direction\n * @param {...Array} arrays All the arrays to concatenate\n * @param {number} concatDim The dimension on which to concatenate (zero-based)\n * @returns\n*/\nexport function concat() {\n  var arrays = Array.prototype.slice.call(arguments, 0, -1);\n  var concatDim = Array.prototype.slice.call(arguments, -1);\n  if (arrays.length === 1) {\n    return arrays[0];\n  }\n  if (arrays.length > 1) {\n    return arrays.slice(1).reduce(function (A, B) {\n      return concatRecursive(A, B, concatDim, 0);\n    }, arrays[0]);\n  } else {\n    throw new Error('Wrong number of arguments in function concat');\n  }\n}\n\n/**\n * Receives two or more sizes and get's the broadcasted size for both.\n * @param  {...number[]} sizes Sizes to broadcast together\n * @returns\n */\nexport function broadcastSizes() {\n  for (var _len = arguments.length, sizes = new Array(_len), _key = 0; _key < _len; _key++) {\n    sizes[_key] = arguments[_key];\n  }\n  var dimensions = sizes.map(s => s.length);\n  var N = Math.max(...dimensions);\n  var sizeMax = new Array(N).fill(null);\n  // check for every size\n  for (var i = 0; i < sizes.length; i++) {\n    var size = sizes[i];\n    var dim = dimensions[i];\n    for (var j = 0; j < dim; j++) {\n      var n = N - dim + j;\n      if (size[j] > sizeMax[n]) {\n        sizeMax[n] = size[j];\n      }\n    }\n  }\n  for (var _i = 0; _i < sizes.length; _i++) {\n    checkBroadcastingRules(sizes[_i], sizeMax);\n  }\n  return sizeMax;\n}\n\n/**\n * Checks if it's possible to broadcast a size to another size\n * @param {number[]} size The size of the array to check\n * @param {number[]} toSize The size of the array to validate if it can be broadcasted to\n */\nexport function checkBroadcastingRules(size, toSize) {\n  var N = toSize.length;\n  var dim = size.length;\n  for (var j = 0; j < dim; j++) {\n    var n = N - dim + j;\n    if (size[j] < toSize[n] && size[j] > 1 || size[j] > toSize[n]) {\n      throw new Error(\"shape missmatch: missmatch is found in arg with shape (\".concat(size, \") not possible to broadcast dimension \").concat(dim, \" with size \").concat(size[j], \" to size \").concat(toSize[n]));\n    }\n  }\n}\n\n/**\n * Broadcasts a single array to a certain size\n * @param {array} array Array to be broadcasted\n * @param {number[]} toSize Size to broadcast the array\n * @returns The broadcasted array\n */\nexport function broadcastTo(array, toSize) {\n  var Asize = arraySize(array);\n  if (deepStrictEqual(Asize, toSize)) {\n    return array;\n  }\n  checkBroadcastingRules(Asize, toSize);\n  var broadcastedSize = broadcastSizes(Asize, toSize);\n  var N = broadcastedSize.length;\n  var paddedSize = [...Array(N - Asize.length).fill(1), ...Asize];\n  var A = clone(array);\n  // reshape A if needed to make it ready for concat\n  if (Asize.length < N) {\n    A = reshape(A, paddedSize);\n    Asize = arraySize(A);\n  }\n\n  // stretches the array on each dimension to make it the same size as index\n  for (var dim = 0; dim < N; dim++) {\n    if (Asize[dim] < broadcastedSize[dim]) {\n      A = stretch(A, broadcastedSize[dim], dim);\n      Asize = arraySize(A);\n    }\n  }\n  return A;\n}\n\n/**\n * Broadcasts arrays and returns the broadcasted arrays in an array\n * @param  {...Array | any} arrays\n * @returns\n */\nexport function broadcastArrays() {\n  for (var _len2 = arguments.length, arrays = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n    arrays[_key2] = arguments[_key2];\n  }\n  if (arrays.length === 0) {\n    throw new Error('Insuficient number of argumnets in function broadcastArrays');\n  }\n  if (arrays.length === 1) {\n    return arrays[0];\n  }\n  var sizes = arrays.map(function (array) {\n    return arraySize(array);\n  });\n  var broadcastedSize = broadcastSizes(...sizes);\n  var broadcastedArrays = [];\n  arrays.forEach(function (array) {\n    broadcastedArrays.push(broadcastTo(array, broadcastedSize));\n  });\n  return broadcastedArrays;\n}\n\n/**\n * stretches a matrix up to a certain size in a certain dimension\n * @param {Array} arrayToStretch\n * @param {number[]} sizeToStretch\n * @param {number} dimToStretch\n * @returns\n */\nexport function stretch(arrayToStretch, sizeToStretch, dimToStretch) {\n  return concat(...Array(sizeToStretch).fill(arrayToStretch), dimToStretch);\n}\n\n/**\n * Deep clones a multidimensional array\n * @param {Array} array\n * @returns cloned array\n */\nexport function clone(array) {\n  return _extends([], array);\n}","// function utils\n\nimport { lruQueue } from './lruQueue.js';\n\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 */\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    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i];\n    }\n    var hash = hasher(args);\n    if (memoize.cache.values.has(hash)) {\n      memoize.cache.lru.hit(hash);\n      return memoize.cache.values.get(hash);\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/**\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 */\nexport function memoizeCompare(fn, isEqual) {\n  var memoize = function memoize() {\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i];\n    }\n    for (var c = 0; c < memoize.cache.length; c++) {\n      var cached = memoize.cache[c];\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    var res = fn.apply(fn, args);\n    memoize.cache.unshift({\n      args,\n      res\n    });\n    return res;\n  };\n  memoize.cache = [];\n  return memoize;\n}\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 */\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 { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';\nimport { arraySize, getArrayDataType, processSizesWildcard, reshape, resize, unsqueeze, validate, validateIndex, broadcastTo } 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';\nimport { maxArgumentCount } from '../../utils/function.js';\nvar name = 'DenseMatrix';\nvar dependencies = ['Matrix'];\nexport var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Matrix\n  } = _ref;\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    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\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;\n      // verify the dimensions of the array\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);\n      // get the dimensions of the array\n      this._size = arraySize(this._data);\n      // verify the dimensions of the array, TODO: compute size while processing array\n      validate(this._data, this._size);\n      // data type unknown\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  DenseMatrix.prototype = new Matrix();\n\n  /**\n   * Create a new DenseMatrix\n   */\n  DenseMatrix.prototype.createDenseMatrix = function (data, datatype) {\n    return new DenseMatrix(data, datatype);\n  };\n\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(DenseMatrix, 'name', {\n    value: 'DenseMatrix'\n  });\n  DenseMatrix.prototype.constructor = DenseMatrix;\n  DenseMatrix.prototype.type = 'DenseMatrix';\n  DenseMatrix.prototype.isDenseMatrix = true;\n\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  DenseMatrix.prototype.getDataType = function () {\n    return getArrayDataType(this._data, typeOf);\n  };\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  DenseMatrix.prototype.storage = function () {\n    return 'dense';\n  };\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  DenseMatrix.prototype.datatype = function () {\n    return this._datatype;\n  };\n\n  /**\n   * Create a new DenseMatrix\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n  DenseMatrix.prototype.create = function (data, datatype) {\n    return new DenseMatrix(data, datatype);\n  };\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  DenseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n    switch (arguments.length) {\n      case 1:\n        return _get(this, index);\n\n      // intentional fall through\n      case 2:\n      case 3:\n        return _set(this, index, replacement, defaultValue);\n      default:\n        throw new SyntaxError('Wrong number of arguments');\n    }\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  DenseMatrix.prototype.get = function (index) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    }\n\n    // check index\n    for (var x = 0; x < index.length; x++) {\n      validateIndex(index[x], this._size[x]);\n    }\n    var data = this._data;\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    return data;\n  };\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  DenseMatrix.prototype.set = function (index, value, defaultValue) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length < this._size.length) {\n      throw new DimensionError(index.length, this._size.length, '<');\n    }\n    var i, ii, indexI;\n\n    // enlarge matrix when needed\n    var size = index.map(function (i) {\n      return i + 1;\n    });\n    _fit(this, size, defaultValue);\n\n    // traverse over the dimensions\n    var data = this._data;\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    }\n\n    // set new value\n    indexI = index[index.length - 1];\n    validateIndex(indexI, data.length);\n    data[indexI] = value;\n    return this;\n  };\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  function _get(matrix, index) {\n    if (!isIndex(index)) {\n      throw new TypeError('Invalid index');\n    }\n    var isScalar = index.isScalar();\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(index.min());\n    } else {\n      // validate dimensions\n      var size = index.size();\n      if (size.length !== matrix._size.length) {\n        throw new DimensionError(size.length, matrix._size.length);\n      }\n\n      // validate if any of the ranges in the index is out of range\n      var min = index.min();\n      var max = index.max();\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      }\n\n      // retrieve submatrix\n      // TODO: more efficient when creating an empty matrix and setting _data and _size manually\n      return new DenseMatrix(_getSubmatrix(matrix._data, index, size.length, 0), matrix._datatype);\n    }\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  function _getSubmatrix(data, index, dims, dim) {\n    var last = dim === dims - 1;\n    var range = index.dimension(dim);\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  /**\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  function _set(matrix, index, submatrix, defaultValue) {\n    if (!index || index.isIndex !== true) {\n      throw new TypeError('Invalid index');\n    }\n\n    // get index size and check whether the index contains a single value\n    var iSize = index.size();\n    var isScalar = index.isScalar();\n\n    // calculate the size of the submatrix, and convert it into an Array if needed\n    var sSize;\n    if (isMatrix(submatrix)) {\n      sSize = submatrix.size();\n      submatrix = submatrix.valueOf();\n    } else {\n      sSize = arraySize(submatrix);\n    }\n    if (isScalar) {\n      // set a scalar\n\n      // check whether submatrix is a scalar\n      if (sSize.length !== 0) {\n        throw new TypeError('Scalar expected');\n      }\n      matrix.set(index.min(), submatrix, defaultValue);\n    } else {\n      // set a submatrix\n\n      // broadcast submatrix\n      if (!deepStrictEqual(sSize, iSize)) {\n        try {\n          if (sSize.length === 0) {\n            submatrix = broadcastTo([submatrix], iSize);\n          } else {\n            submatrix = broadcastTo(submatrix, iSize);\n          }\n          sSize = arraySize(submatrix);\n        } catch (_unused) {}\n      }\n\n      // validate dimensions\n      if (iSize.length < matrix._size.length) {\n        throw new DimensionError(iSize.length, matrix._size.length, '<');\n      }\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        var i = 0;\n        var outer = 0;\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++;\n        }\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        }\n\n        // unsqueeze both outer and inner dimensions\n        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);\n      }\n\n      // check whether the size of the submatrix matches the index size\n      if (!deepStrictEqual(iSize, sSize)) {\n        throw new DimensionError(iSize, sSize, '>');\n      }\n\n      // enlarge matrix when needed\n      var size = index.max().map(function (i) {\n        return i + 1;\n      });\n      _fit(matrix, size, defaultValue);\n\n      // insert the sub matrix\n      var dims = iSize.length;\n      var dim = 0;\n      _setSubmatrix(matrix._data, index, submatrix, dims, dim);\n    }\n    return matrix;\n  }\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  function _setSubmatrix(data, index, submatrix, dims, dim) {\n    var last = dim === dims - 1;\n    var range = index.dimension(dim);\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        _setSubmatrix(data[dataIndex], index, submatrix[subIndex[0]], dims, dim + 1);\n      });\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  DenseMatrix.prototype.resize = function (size, defaultValue, copy) {\n    // validate arguments\n    if (!isCollection(size)) {\n      throw new TypeError('Array or Matrix expected');\n    }\n\n    // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n    var sizeArray = size.valueOf().map(value => {\n      return Array.isArray(value) && value.length === 1 ? value[0] : value;\n    });\n\n    // matrix to resize\n    var m = copy ? this.clone() : this;\n    // resize matrix\n    return _resize(m, sizeArray, defaultValue);\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;\n      // go deep\n      while (isArray(v)) {\n        v = v[0];\n      }\n      return v;\n    }\n    // resize matrix\n    matrix._size = size.slice(0); // copy the array\n    matrix._data = resize(matrix._data, matrix._size, defaultValue);\n    // return matrix\n    return matrix;\n  }\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  DenseMatrix.prototype.reshape = function (size, copy) {\n    var m = copy ? this.clone() : this;\n    m._data = reshape(m._data, size);\n    var currentLength = m._size.reduce((length, size) => length * size);\n    m._size = processSizesWildcard(size, currentLength);\n    return m;\n  };\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  function _fit(matrix, size, defaultValue) {\n    var\n    // copy the array\n    newSize = matrix._size.slice(0);\n    var changed = false;\n\n    // add dimensions when needed\n    while (newSize.length < size.length) {\n      newSize.push(0);\n      changed = true;\n    }\n\n    // enlarge size when needed\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    if (changed) {\n      // resize only when size is changed\n      _resize(matrix, newSize, defaultValue);\n    }\n  }\n\n  /**\n   * Create a clone of the matrix\n   * @memberof DenseMatrix\n   * @return {DenseMatrix} clone\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  /**\n   * Retrieve the size of the matrix.\n   * @memberof DenseMatrix\n   * @returns {number[]} size\n   */\n  DenseMatrix.prototype.size = function () {\n    return this._size.slice(0); // return a clone of _size\n  };\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  DenseMatrix.prototype.map = function (callback) {\n    // matrix instance\n    var me = this;\n    var args = maxArgumentCount(callback);\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        // invoke the callback function with the right number of arguments\n        if (args === 1) {\n          return callback(value);\n        } else if (args === 2) {\n          return callback(value, index);\n        } else {\n          // 3 or -1\n          return callback(value, index, me);\n        }\n      }\n    };\n\n    // determine the new datatype when the original matrix has datatype defined\n    // TODO: should be done in matrix constructor instead\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  /**\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  DenseMatrix.prototype.forEach = function (callback) {\n    // matrix instance\n    var me = this;\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    recurse(this._data, []);\n  };\n\n  /**\n   * Iterate over the matrix elements\n   * @return {Iterable<{ value, index: number[] }>}\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    yield* recurse(this._data, []);\n  };\n\n  /**\n   * Returns an array containing the rows of a 2D matrix\n   * @returns {Array<Matrix>}\n   */\n  DenseMatrix.prototype.rows = function () {\n    var result = [];\n    var s = this.size();\n    if (s.length !== 2) {\n      throw new TypeError('Rows can only be returned for a 2D matrix.');\n    }\n    var data = this._data;\n    for (var row of data) {\n      result.push(new DenseMatrix([row], this._datatype));\n    }\n    return result;\n  };\n\n  /**\n   * Returns an array containing the columns of a 2D matrix\n   * @returns {Array<Matrix>}\n   */\n  DenseMatrix.prototype.columns = function () {\n    var _this = this;\n    var result = [];\n    var s = this.size();\n    if (s.length !== 2) {\n      throw new TypeError('Rows can only be returned for a 2D matrix.');\n    }\n    var data = this._data;\n    var _loop = function _loop(i) {\n      var col = data.map(row => [row[i]]);\n      result.push(new DenseMatrix(col, _this._datatype));\n    };\n    for (var i = 0; i < s[1]; i++) {\n      _loop(i);\n    }\n    return result;\n  };\n\n  /**\n   * Create an Array with a copy of the data of the DenseMatrix\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n  DenseMatrix.prototype.toArray = function () {\n    return clone(this._data);\n  };\n\n  /**\n   * Get the primitive value of the DenseMatrix: a multidimensional array\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n  DenseMatrix.prototype.valueOf = function () {\n    return this._data;\n  };\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  DenseMatrix.prototype.format = function (options) {\n    return format(this._data, options);\n  };\n\n  /**\n   * Get a string representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {string} str\n   */\n  DenseMatrix.prototype.toString = function () {\n    return format(this._data);\n  };\n\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {Object}\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  /**\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  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      }\n      // is must be an integer\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    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n\n    // number diagonal values\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // x is a matrix get diagonal from matrix\n    var data = [];\n\n    // loop rows\n    for (var i = 0; i < n; i++) {\n      data[i] = this._data[i + kSub][i + kSuper];\n    }\n\n    // create DenseMatrix\n    return new DenseMatrix({\n      data,\n      size: [n],\n      datatype: this._datatype\n    });\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  DenseMatrix.diagonal = function (size, value, k, defaultValue) {\n    if (!isArray(size)) {\n      throw new TypeError('Array expected, size parameter');\n    }\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    }\n\n    // map size & validate\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      }\n      // validate arguments\n      if (!isNumber(s) || !isInteger(s) || s < 1) {\n        throw new Error('Size values must be positive integers');\n      }\n      return s;\n    });\n\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\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    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows and columns\n    var rows = size[0];\n    var columns = size[1];\n\n    // number of non-zero items\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // value extraction function\n    var _value;\n\n    // check value\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      }\n      // define function\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();\n      // validate matrix\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      }\n      // define function\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    }\n\n    // discover default value if needed\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    }\n\n    // empty array\n    var data = [];\n\n    // check we need to resize array\n    if (size.length > 0) {\n      // resize array\n      data = resize(data, size, defaultValue);\n      // fill diagonal\n      for (var d = 0; d < n; d++) {\n        data[d + kSub][d + kSuper] = _value(d);\n      }\n    }\n\n    // create DenseMatrix\n    return new DenseMatrix({\n      data,\n      size: [rows, columns]\n    });\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  DenseMatrix.fromJSON = function (json) {\n    return new DenseMatrix(json);\n  };\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  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    }\n    // check dimensions\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    }\n    // validate index\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[0]);\n\n    // swap rows\n    DenseMatrix._swapRows(i, j, this._data);\n    // return current instance\n    return this;\n  };\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  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  /**\n   * Preprocess data, which can be an Array or DenseMatrix with nested Arrays and\n   * Matrices. Clones all (nested) Arrays, and replaces all nested Matrices with Arrays\n   * @memberof DenseMatrix\n   * @param {Array | Matrix} data\n   * @return {Array} data\n   */\n  function preprocess(data) {\n    if (isMatrix(data)) {\n      return preprocess(data.valueOf());\n    }\n    if (isArray(data)) {\n      return data.map(preprocess);\n    }\n    return data;\n  }\n  return DenseMatrix;\n}, {\n  isClass: true\n});","import { isCollection, isMatrix } from './is.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { arraySize } from './array.js';\nimport { _switch } from './switch.js';\n\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 */\nexport function containsCollections(array) {\n  for (var i = 0; i < array.length; i++) {\n    if (isCollection(array[i])) {\n      return true;\n    }\n  }\n  return false;\n}\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 */\nexport function deepForEach(array, callback) {\n  if (isMatrix(array)) {\n    array = array.valueOf();\n  }\n  for (var i = 0, ii = array.length; i < ii; i++) {\n    var value = array[i];\n    if (Array.isArray(value)) {\n      deepForEach(value, callback);\n    } else {\n      callback(value);\n    }\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 */\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/**\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 */\nexport function reduce(mat, dim, callback) {\n  var size = Array.isArray(mat) ? arraySize(mat) : mat.size();\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  if (isMatrix(mat)) {\n    return mat.create(_reduce(mat.valueOf(), dim, callback));\n  } else {\n    return _reduce(mat, dim, callback);\n  }\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 */\nfunction _reduce(mat, dim, callback) {\n  var i, ret, val, tran;\n  if (dim <= 0) {\n    if (!Array.isArray(mat[0])) {\n      val = mat[0];\n      for (i = 1; i < mat.length; i++) {\n        val = callback(val, mat[i]);\n      }\n      return val;\n    } else {\n      tran = _switch(mat);\n      ret = [];\n      for (i = 0; i < tran.length; i++) {\n        ret[i] = _reduce(tran[i], dim - 1, callback);\n      }\n      return ret;\n    }\n  } else {\n    ret = [];\n    for (i = 0; i < mat.length; i++) {\n      ret[i] = _reduce(mat[i], dim - 1, callback);\n    }\n    return ret;\n  }\n}\n\n// TODO: document function scatter\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;\n\n  // vars\n  var k, k0, k1, i;\n\n  // check we need to process values (pattern matrix)\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];\n      // check value exists in current j\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark;\n        // add i to pattern of C\n        cindex.push(i);\n        // x(i) = A, check we need to call function this time\n        if (update) {\n          // copy value to workspace calling callback function\n          x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k]);\n          // function was called on current row\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]);\n        // function was called on current row\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];\n      // check value exists in current j\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark;\n        // add i to pattern of C\n        cindex.push(i);\n      } else {\n        // indicate function was called on current row\n        u[i] = mark;\n      }\n    }\n  }\n}","import { deepMap } from '../../utils/collection.js';\nimport { isInteger as isIntegerNumber } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'isInteger';\nvar dependencies = ['typed'];\nexport var createIsInteger = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Test whether a value is an integer number.\n   * The function supports `number`, `BigNumber`, and `Fraction`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isInteger(x)\n   *\n   * Examples:\n   *\n   *    math.isInteger(2)                     // returns true\n   *    math.isInteger(0)                     // returns true\n   *    math.isInteger(0.5)                   // returns false\n   *    math.isInteger(math.bignumber(500))   // returns true\n   *    math.isInteger(math.fraction(4))      // returns true\n   *    math.isInteger('3')                   // returns true\n   *    math.isInteger([3, 0.5, -2])          // returns [true, false, true]\n   *    math.isInteger(math.complex('2-4i'))  // throws an error\n   *\n   * See also:\n   *\n   *    isNumeric, isPositive, isNegative, isZero\n   *\n   * @param {number | BigNumber | Fraction | Array | Matrix} x   Value to be tested\n   * @return {boolean}  Returns true when `x` contains a numeric, integer value.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: isIntegerNumber,\n    // TODO: what to do with isInteger(add(0.1, 0.2))  ?\n\n    BigNumber: function BigNumber(x) {\n      return x.isInt();\n    },\n    Fraction: function Fraction(x) {\n      return x.d === 1 && isFinite(x.n);\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { cbrt, expm1, isInteger, log10, log1p, log2, sign, toFixed } 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 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;\n\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 */\nexport function gcdNumber(a, b) {\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function gcd must be integer numbers');\n  }\n\n  // https://en.wikipedia.org/wiki/Euclidean_algorithm\n  var r;\n  while (b !== 0) {\n    r = a % b;\n    a = b;\n    b = r;\n  }\n  return a < 0 ? -a : a;\n}\ngcdNumber.signature = n2;\n\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 */\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  if (a === 0 || b === 0) {\n    return 0;\n  }\n\n  // https://en.wikipedia.org/wiki/Euclidean_algorithm\n  // evaluate lcm here inline to reduce overhead\n  var t;\n  var prod = a * b;\n  while (b !== 0) {\n    t = b;\n    b = a % t;\n    a = t;\n  }\n  return Math.abs(prod / a);\n}\nlcmNumber.signature = n2;\n\n/**\n * Calculate the logarithm of a value, optionally to a given base.\n * @param {number} x\n * @param {number | null | undefined} base\n * @return {number}\n */\nexport function logNumber(x, y) {\n  if (y) {\n    return Math.log(x) / Math.log(y);\n  }\n  return Math.log(x);\n}\n\n/**\n * Calculate the 10-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\nexport function log10Number(x) {\n  return log10(x);\n}\nlog10Number.signature = n1;\n\n/**\n * Calculate the 2-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\nexport function log2Number(x) {\n  return log2(x);\n}\nlog2Number.signature = n1;\n\n/**\n * Calculate the natural logarithm of a `number+1`\n * @param {number} x\n * @returns {number}\n */\nexport function log1pNumber(x) {\n  return log1p(x);\n}\nlog1pNumber.signature = n1;\n\n/**\n * Calculate the modulus of two numbers\n * @param {number} x\n * @param {number} y\n * @returns {number} res\n * @private\n */\nexport function modNumber(x, y) {\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 y === 0 ? x : x - y * Math.floor(x / y);\n}\nmodNumber.signature = n2;\n\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} [2] root\n * @private\n */\nexport function nthRootNumber(a) {\n  var root = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 2;\n  var inv = root < 0;\n  if (inv) {\n    root = -root;\n  }\n  if (root === 0) {\n    throw new Error('Root must be non-zero');\n  }\n  if (a < 0 && Math.abs(root) % 2 !== 1) {\n    throw new Error('Root must be odd when a is negative.');\n  }\n\n  // edge cases zero and infinity\n  if (a === 0) {\n    return inv ? Infinity : 0;\n  }\n  if (!isFinite(a)) {\n    return inv ? 0 : a;\n  }\n  var x = Math.pow(Math.abs(a), 1 / root);\n  // If a < 0, we require that root is an odd integer,\n  // so (-1) ^ (1/root) = -1\n  x = a < 0 ? -x : x;\n  return inv ? 1 / x : x;\n\n  // 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  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}\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/**\n * Calculate xgcd for two numbers\n * @param {number} a\n * @param {number} b\n * @return {number} result\n * @private\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  var q; // quotient\n  var r; // remainder\n  var x = 0;\n  var lastx = 1;\n  var y = 1;\n  var lasty = 0;\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function xgcd must be integer numbers');\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  var res;\n  if (a < 0) {\n    res = [-a, -lastx, -lasty];\n  } else {\n    res = [a, a ? lastx : 0, lasty];\n  }\n  return res;\n}\nxgcdNumber.signature = n2;\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} res\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  return Math.pow(x, y);\n}\npowNumber.signature = n2;\n\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 */\nexport function roundNumber(value) {\n  var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  if (!isInteger(decimals) || decimals < 0 || decimals > 15) {\n    throw new Error('Number of decimals in function round must be an integer from 0 to 15 inclusive');\n  }\n  return parseFloat(toFixed(value, decimals));\n}\n\n/**\n * Calculate the norm of a number, the absolute value.\n * @param {number} x\n * @return {number}\n */\nexport function normNumber(x) {\n  return Math.abs(x);\n}\nnormNumber.signature = n1;","import { isInteger } from '../../utils/number.js';\nvar n1 = 'number';\nexport function isIntegerNumber(x) {\n  return isInteger(x);\n}\nisIntegerNumber.signature = n1;\nexport function isNegativeNumber(x) {\n  return x < 0;\n}\nisNegativeNumber.signature = n1;\nexport function isPositiveNumber(x) {\n  return x > 0;\n}\nisPositiveNumber.signature = n1;\nexport function isZeroNumber(x) {\n  return x === 0;\n}\nisZeroNumber.signature = n1;\nexport function isNaNNumber(x) {\n  return Number.isNaN(x);\n}\nisNaNNumber.signature = n1;","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { isPositiveNumber } from '../../plain/number/index.js';\nvar name = 'isPositive';\nvar dependencies = ['typed'];\nexport var createIsPositive = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Test whether a value is positive: larger than zero.\n   * The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isPositive(x)\n   *\n   * Examples:\n   *\n   *    math.isPositive(3)                     // returns true\n   *    math.isPositive(-2)                    // returns false\n   *    math.isPositive(0)                     // returns false\n   *    math.isPositive(-0)                    // returns false\n   *    math.isPositive(0.5)                   // returns true\n   *    math.isPositive(math.bignumber(2))     // returns true\n   *    math.isPositive(math.fraction(-2, 5))  // returns false\n   *    math.isPositive(math.fraction(1, 3))   // returns true\n   *    math.isPositive('2')                   // returns true\n   *    math.isPositive([2, 0, -3])            // returns [true, false, false]\n   *\n   * See also:\n   *\n   *    isNumeric, isZero, isNegative, isInteger\n   *\n   * @param {number | BigNumber | Fraction | Unit | Array | Matrix} x  Value to be tested\n   * @return {boolean}  Returns true when `x` is larger than zero.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: isPositiveNumber,\n    BigNumber: function BigNumber(x) {\n      return !x.isNeg() && !x.isZero() && !x.isNaN();\n    },\n    Fraction: function Fraction(x) {\n      return x.s > 0 && x.n > 0;\n    },\n    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { isZeroNumber } from '../../plain/number/index.js';\nvar name = 'isZero';\nvar dependencies = ['typed'];\nexport var createIsZero = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Test whether a value is zero.\n   * The function can check for zero for types `number`, `BigNumber`, `Fraction`,\n   * `Complex`, and `Unit`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isZero(x)\n   *\n   * Examples:\n   *\n   *    math.isZero(0)                      // returns true\n   *    math.isZero(2)                      // returns false\n   *    math.isZero(0.5)                    // returns false\n   *    math.isZero(math.bignumber(0))      // returns true\n   *    math.isZero(math.fraction(0))       // returns true\n   *    math.isZero(math.fraction(1,3))     // returns false\n   *    math.isZero(math.complex('2 - 4i')) // returns false\n   *    math.isZero(math.complex('0i'))     // returns true\n   *    math.isZero('0')                    // returns true\n   *    math.isZero('2')                    // returns false\n   *    math.isZero([2, 0, -3])             // returns [false, true, false]\n   *\n   * See also:\n   *\n   *    isNumeric, isPositive, isNegative, isInteger\n   *\n   * @param {number | BigNumber | Complex | Fraction | Unit | Array | Matrix} x       Value to be tested\n   * @return {boolean}  Returns true when `x` is zero.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: isZeroNumber,\n    BigNumber: function BigNumber(x) {\n      return x.isZero();\n    },\n    Complex: function Complex(x) {\n      return x.re === 0 && x.im === 0;\n    },\n    Fraction: function Fraction(x) {\n      return x.d === 1 && x.n === 0;\n    },\n    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\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  }\n\n  // use \"==\" operator, handles infinities\n  if (x.eq(y)) {\n    return true;\n  }\n\n  // NaN\n  if (x.isNaN() || y.isNaN()) {\n    return false;\n  }\n\n  // at this point x and y should be finite\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    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  }\n\n  // Infinite and Number or negative Infinite and positive Infinite cases\n  return false;\n}","import { nearlyEqual } from './number.js';\n\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 */\nexport function complexEquals(x, y, epsilon) {\n  return nearlyEqual(x.re, y.re, epsilon) && nearlyEqual(x.im, y.im, epsilon);\n}","import { factory } from '../../utils/factory.js';\nexport var createCompareUnits = /* #__PURE__ */factory('compareUnits', ['typed'], _ref => {\n  var {\n    typed\n  } = _ref;\n  return {\n    'Unit, Unit': typed.referToSelf(self => (x, y) => {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n      return typed.find(self, [x.valueType(), y.valueType()])(x.value, y.value);\n    })\n  };\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';\nimport { createCompareUnits } from './compareUnits.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  var compareUnits = createCompareUnits({\n    typed\n  });\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  }, compareUnits);\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 { 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';\nimport { maxArgumentCount } from '../../utils/function.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   * 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    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\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  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  function _createFromArray(matrix, data, datatype) {\n    // initialize fields\n    matrix._values = [];\n    matrix._index = [];\n    matrix._ptr = [];\n    matrix._datatype = datatype;\n    // discover rows & columns, do not use math.size() to avoid looping array twice\n    var rows = data.length;\n    var columns = 0;\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, datatype);\n    }\n\n    // check we have rows (empty array)\n    if (rows > 0) {\n      // column index\n      var j = 0;\n      do {\n        // store pointer to values index\n        matrix._ptr.push(matrix._index.length);\n        // loop rows\n        for (var i = 0; i < rows; i++) {\n          // current row\n          var row = data[i];\n          // check row is an array\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            }\n            // check row has column\n            if (j < row.length) {\n              // value\n              var v = row[j];\n              // check value != 0\n              if (!eq(v, zero)) {\n                // store value\n                matrix._values.push(v);\n                // index\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            }\n            // check value != 0 (row is a scalar)\n            if (!eq(row, zero)) {\n              // store value\n              matrix._values.push(row);\n              // index\n              matrix._index.push(i);\n            }\n          }\n        }\n        // increment index\n        j++;\n      } while (j < columns);\n    }\n    // store number of values in ptr\n    matrix._ptr.push(matrix._index.length);\n    // size\n    matrix._size = [rows, columns];\n  }\n  SparseMatrix.prototype = new Matrix();\n\n  /**\n   * Create a new SparseMatrix\n   */\n  SparseMatrix.prototype.createSparseMatrix = function (data, datatype) {\n    return new SparseMatrix(data, datatype);\n  };\n\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(SparseMatrix, 'name', {\n    value: 'SparseMatrix'\n  });\n  SparseMatrix.prototype.constructor = SparseMatrix;\n  SparseMatrix.prototype.type = 'SparseMatrix';\n  SparseMatrix.prototype.isSparseMatrix = true;\n\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  SparseMatrix.prototype.getDataType = function () {\n    return getArrayDataType(this._values, typeOf);\n  };\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  SparseMatrix.prototype.storage = function () {\n    return 'sparse';\n  };\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  SparseMatrix.prototype.datatype = function () {\n    return this._datatype;\n  };\n\n  /**\n   * Create a new SparseMatrix\n   * @memberof SparseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n  SparseMatrix.prototype.create = function (data, datatype) {\n    return new SparseMatrix(data, datatype);\n  };\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  SparseMatrix.prototype.density = function () {\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    // calculate density\n    return rows !== 0 && columns !== 0 ? this._index.length / (rows * columns) : 0;\n  };\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  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    }\n\n    // check arguments\n    switch (arguments.length) {\n      case 1:\n        return _getsubset(this, index);\n\n      // intentional fall through\n      case 2:\n      case 3:\n        return _setsubset(this, index, replacement, defaultValue);\n      default:\n        throw new SyntaxError('Wrong number of arguments');\n    }\n  };\n  function _getsubset(matrix, idx) {\n    // check idx\n    if (!isIndex(idx)) {\n      throw new TypeError('Invalid index');\n    }\n    var isScalar = idx.isScalar();\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(idx.min());\n    }\n    // validate dimensions\n    var size = idx.size();\n    if (size.length !== matrix._size.length) {\n      throw new DimensionError(size.length, matrix._size.length);\n    }\n\n    // vars\n    var i, ii, k, kk;\n\n    // validate if any of the ranges in the index is out of range\n    var min = idx.min();\n    var max = idx.max();\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    }\n\n    // matrix arrays\n    var mvalues = matrix._values;\n    var mindex = matrix._index;\n    var mptr = matrix._ptr;\n\n    // rows & columns dimensions for result matrix\n    var rows = idx.dimension(0);\n    var columns = idx.dimension(1);\n\n    // workspace & permutation vector\n    var w = [];\n    var pv = [];\n\n    // loop rows in resulting matrix\n    rows.forEach(function (i, r) {\n      // update permutation vector\n      pv[i] = r[0];\n      // mark i in workspace\n      w[i] = true;\n    });\n\n    // result matrix arrays\n    var values = mvalues ? [] : undefined;\n    var index = [];\n    var ptr = [];\n\n    // loop columns in result matrix\n    columns.forEach(function (j) {\n      // update ptr\n      ptr.push(index.length);\n      // loop values in column j\n      for (k = mptr[j], kk = mptr[j + 1]; k < kk; k++) {\n        // row\n        i = mindex[k];\n        // check row is in result matrix\n        if (w[i] === true) {\n          // push index\n          index.push(pv[i]);\n          // check we need to process values\n          if (values) {\n            values.push(mvalues[k]);\n          }\n        }\n      }\n    });\n    // update ptr\n    ptr.push(index.length);\n\n    // return matrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size,\n      datatype: matrix._datatype\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    }\n\n    // get index size and check whether the index contains a single value\n    var iSize = index.size();\n    var isScalar = index.isScalar();\n\n    // calculate the size of the submatrix, and convert it into an Array if needed\n    var sSize;\n    if (isMatrix(submatrix)) {\n      // submatrix size\n      sSize = submatrix.size();\n      // use array representation\n      submatrix = submatrix.toArray();\n    } else {\n      // get submatrix size (array, scalar)\n      sSize = arraySize(submatrix);\n    }\n\n    // check index is a scalar\n    if (isScalar) {\n      // verify submatrix is a scalar\n      if (sSize.length !== 0) {\n        throw new TypeError('Scalar expected');\n      }\n      // set value\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      }\n\n      // check submatrix and index have the same dimensions\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        var i = 0;\n        var outer = 0;\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++;\n        }\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        }\n        // unsqueeze both outer and inner dimensions\n        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);\n      }\n\n      // check whether the size of the submatrix matches the index size\n      if (!deepStrictEqual(iSize, sSize)) {\n        throw new DimensionError(iSize, sSize, '>');\n      }\n\n      // insert the sub matrix\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    return matrix;\n  }\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  SparseMatrix.prototype.get = function (index) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    }\n\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke get on a Pattern only matrix');\n    }\n\n    // row and column\n    var i = index[0];\n    var j = index[1];\n\n    // check i, j are valid\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[1]);\n\n    // find value index\n    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index);\n    // check k is prior to next column k and it is in the correct row\n    if (k < this._ptr[j + 1] && this._index[k] === i) {\n      return this._values[k];\n    }\n    return 0;\n  };\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  SparseMatrix.prototype.set = function (index, v, defaultValue) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    }\n\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke set on a Pattern only matrix');\n    }\n\n    // row and column\n    var i = index[0];\n    var j = index[1];\n\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(this._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [this._datatype, this._datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, this._datatype);\n    }\n\n    // check we need to resize matrix\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);\n      // update rows & columns\n      rows = this._size[0];\n      columns = this._size[1];\n    }\n\n    // check i, j are valid\n    validateIndex(i, rows);\n    validateIndex(j, columns);\n\n    // find value index\n    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index);\n    // check k is prior to next column k and it is in the correct row\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      if (!eq(v, zero)) {\n        // insert value @ (i, j)\n        _insert(k, i, j, v, this._values, this._index, this._ptr);\n      }\n    }\n    return this;\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    }\n    // loop rows [top, bottom[\n    for (var r = top; r < bottom; r++) {\n      // check we found value index\n      if (index[r] === i) {\n        return r;\n      }\n    }\n    // we did not find row\n    return top;\n  }\n  function _remove(k, j, values, index, ptr) {\n    // remove value @ k\n    values.splice(k, 1);\n    index.splice(k, 1);\n    // update pointers\n    for (var x = j + 1; x < ptr.length; x++) {\n      ptr[x]--;\n    }\n  }\n  function _insert(k, i, j, v, values, index, ptr) {\n    // insert value\n    values.splice(k, 0, v);\n    // update row for k\n    index.splice(k, 0, i);\n    // update column pointers\n    for (var x = j + 1; x < ptr.length; x++) {\n      ptr[x]++;\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 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  SparseMatrix.prototype.resize = function (size, defaultValue, copy) {\n    // validate arguments\n    if (!isCollection(size)) {\n      throw new TypeError('Array or Matrix expected');\n    }\n\n    // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n    var sizeArray = size.valueOf().map(value => {\n      return Array.isArray(value) && value.length === 1 ? value[0] : value;\n    });\n    if (sizeArray.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    }\n\n    // check sizes\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    });\n\n    // matrix to resize\n    var m = copy ? this.clone() : this;\n    // resize matrix\n    return _resize(m, sizeArray[0], sizeArray[1], defaultValue);\n  };\n  function _resize(matrix, rows, columns, defaultValue) {\n    // value to insert at the time of growing matrix\n    var value = defaultValue || 0;\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(matrix._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, matrix._datatype);\n      // convert value to the same datatype\n      value = typed.convert(value, matrix._datatype);\n    }\n\n    // should we insert the value?\n    var ins = !eq(value, zero);\n\n    // old columns and rows\n    var r = matrix._size[0];\n    var c = matrix._size[1];\n    var i, j, k;\n\n    // check we need to increase columns\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;\n        // check we need to insert matrix._values\n        if (ins) {\n          // loop rows\n          for (i = 0; i < r; i++) {\n            // add new matrix._values\n            matrix._values.push(value);\n            // update matrix._index\n            matrix._index.push(i);\n          }\n        }\n      }\n      // store number of matrix._values in matrix._ptr\n      matrix._ptr[columns] = matrix._values.length;\n    } else if (columns < c) {\n      // truncate matrix._ptr\n      matrix._ptr.splice(columns + 1, c - columns);\n      // truncate matrix._values and matrix._index\n      matrix._values.splice(matrix._ptr[columns], matrix._values.length);\n      matrix._index.splice(matrix._ptr[columns], matrix._index.length);\n    }\n    // update columns\n    c = columns;\n\n    // check we need to increase rows\n    if (rows > r) {\n      // check we have to insert values\n      if (ins) {\n        // inserts\n        var n = 0;\n        // loop columns\n        for (j = 0; j < c; j++) {\n          // update matrix._ptr for current column\n          matrix._ptr[j] = matrix._ptr[j] + n;\n          // where to insert matrix._values\n          k = matrix._ptr[j + 1] + n;\n          // pointer\n          var p = 0;\n          // loop new rows, initialize pointer\n          for (i = r; i < rows; i++, p++) {\n            // add value\n            matrix._values.splice(k + p, 0, value);\n            // update matrix._index\n            matrix._index.splice(k + p, 0, i);\n            // increment inserts\n            n++;\n          }\n        }\n        // store number of matrix._values in matrix._ptr\n        matrix._ptr[c] = matrix._values.length;\n      }\n    } else if (rows < r) {\n      // deletes\n      var d = 0;\n      // loop columns\n      for (j = 0; j < c; j++) {\n        // update matrix._ptr for current column\n        matrix._ptr[j] = matrix._ptr[j] - d;\n        // where matrix._values start for next column\n        var k0 = matrix._ptr[j];\n        var k1 = matrix._ptr[j + 1] - d;\n        // loop matrix._index\n        for (k = k0; k < k1; k++) {\n          // row\n          i = matrix._index[k];\n          // check we need to delete value and matrix._index\n          if (i > rows - 1) {\n            // remove value\n            matrix._values.splice(k, 1);\n            // remove item from matrix._index\n            matrix._index.splice(k, 1);\n            // increase deletes\n            d++;\n          }\n        }\n      }\n      // update matrix._ptr for current column\n      matrix._ptr[j] = matrix._values.length;\n    }\n    // update matrix._size\n    matrix._size[0] = rows;\n    matrix._size[1] = columns;\n    // return matrix\n    return matrix;\n  }\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  SparseMatrix.prototype.reshape = function (sizes, copy) {\n    // validate arguments\n    if (!isArray(sizes)) {\n      throw new TypeError('Array expected');\n    }\n    if (sizes.length !== 2) {\n      throw new Error('Sparse matrices can only be reshaped in two dimensions');\n    }\n\n    // check sizes\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];\n\n    // m * n must not change\n    if (currentLength !== newLength) {\n      throw new Error('Reshaping sparse matrix will result in the wrong number of elements');\n    }\n\n    // matrix to reshape\n    var m = copy ? this.clone() : this;\n\n    // return unchanged if the same shape\n    if (this._size[0] === sizes[0] && this._size[1] === sizes[1]) {\n      return m;\n    }\n\n    // Convert to COO format (generate a column index)\n    var colIndex = [];\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    }\n\n    // Clone the values array\n    var values = m._values.slice();\n\n    // Clone the row index array\n    var rowIndex = m._index.slice();\n\n    // Transform the (row, column) indices\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    }\n\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\n    // OR, we could easily just:\n\n    // 1. Remove all values from the matrix\n    m._values.length = 0;\n    m._index.length = 0;\n    m._ptr.length = sizes[1] + 1;\n    m._size = sizes.slice();\n    for (var _i2 = 0; _i2 < m._ptr.length; _i2++) {\n      m._ptr[_i2] = 0;\n    }\n\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    for (var h = 0; h < values.length; h++) {\n      var _i3 = rowIndex[h];\n      var _j = colIndex[h];\n      var v = values[h];\n      var k = _getValueIndex(_i3, m._ptr[_j], m._ptr[_j + 1], m._index);\n      _insert(k, _i3, _j, v, m._values, m._index, m._ptr);\n    }\n\n    // The value indices are inserted out of order, but apparently that's... still OK?\n\n    return m;\n  };\n\n  /**\n   * Create a clone of the matrix\n   * @memberof SparseMatrix\n   * @return {SparseMatrix} clone\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  /**\n   * Retrieve the size of the matrix.\n   * @memberof SparseMatrix\n   * @returns {number[]} size\n   */\n  SparseMatrix.prototype.size = function () {\n    return this._size.slice(0); // copy the Array\n  };\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  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    }\n    // matrix instance\n    var me = this;\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    // invoke callback\n    var args = maxArgumentCount(callback);\n    var invoke = function invoke(v, i, j) {\n      // invoke callback\n      if (args === 1) return callback(v);\n      if (args === 2) return callback(v, [i, j]);\n      return callback(v, [i, j], me);\n    };\n    // invoke _map\n    return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros);\n  };\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  function _map(matrix, minRow, maxRow, minColumn, maxColumn, callback, skipZeros) {\n    // result arrays\n    var values = [];\n    var index = [];\n    var ptr = [];\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(matrix._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, matrix._datatype);\n    }\n\n    // invoke callback\n    var invoke = function invoke(v, x, y) {\n      // invoke callback\n      v = callback(v, x, y);\n      // check value != 0\n      if (!eq(v, zero)) {\n        // store value\n        values.push(v);\n        // index\n        index.push(x);\n      }\n    };\n    // loop columns\n    for (var j = minColumn; j <= maxColumn; j++) {\n      // store pointer to values index\n      ptr.push(values.length);\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = matrix._ptr[j];\n      var k1 = matrix._ptr[j + 1];\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];\n          // check i is in range\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        for (var _k = k0; _k < k1; _k++) {\n          var _i4 = matrix._index[_k];\n          _values[_i4] = matrix._values[_k];\n        }\n\n        // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\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    }\n\n    // store number of values in ptr\n    ptr.push(values.length);\n    // return sparse matrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size: [maxRow - minRow + 1, maxColumn - minColumn + 1]\n    });\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  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    }\n    // matrix instance\n    var me = this;\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1];\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 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\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];\n\n          // value @ k\n          callback(this._values[k], [i, j], me);\n        }\n      } else {\n        // create a cache holding all defined values\n        var values = {};\n        for (var _k2 = k0; _k2 < k1; _k2++) {\n          var _i6 = this._index[_k2];\n          values[_i6] = this._values[_k2];\n        }\n\n        // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\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  /**\n   * Iterate over the matrix elements, skipping zeros\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  SparseMatrix.prototype[Symbol.iterator] = function* () {\n    if (!this._values) {\n      throw new Error('Cannot iterate a Pattern only matrix');\n    }\n    var columns = this._size[1];\n    for (var j = 0; j < columns; j++) {\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\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  /**\n   * Create an Array with a copy of the data of the SparseMatrix\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n  SparseMatrix.prototype.toArray = function () {\n    return _toArray(this._values, this._index, this._ptr, this._size, true);\n  };\n\n  /**\n   * Get the primitive value of the SparseMatrix: a two dimensions array\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n  SparseMatrix.prototype.valueOf = function () {\n    return _toArray(this._values, this._index, this._ptr, this._size, false);\n  };\n  function _toArray(values, index, ptr, size, copy) {\n    // rows and columns\n    var rows = size[0];\n    var columns = size[1];\n    // result\n    var a = [];\n    // vars\n    var i, j;\n    // initialize array\n    for (i = 0; i < rows; i++) {\n      a[i] = [];\n      for (j = 0; j < columns; j++) {\n        a[i][j] = 0;\n      }\n    }\n\n    // loop columns\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];\n      // loop k within [k0, k1[\n      for (var k = k0; k < k1; k++) {\n        // row index\n        i = index[k];\n        // set value (use one for pattern matrix)\n        a[i][j] = values ? copy ? clone(values[k]) : values[k] : 1;\n      }\n    }\n    return a;\n  }\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  SparseMatrix.prototype.format = function (options) {\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    // density\n    var density = this.density();\n    // rows & columns\n    var str = 'Sparse Matrix [' + format(rows, options) + ' x ' + format(columns, options) + '] density: ' + format(density, options) + '\\n';\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 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n      // loop k within [k0, k1[\n      for (var k = k0; k < k1; k++) {\n        // row index\n        var i = this._index[k];\n        // append value\n        str += '\\n    (' + format(i, options) + ', ' + format(j, options) + ') ==> ' + (this._values ? format(this._values[k], options) : 'X');\n      }\n    }\n    return str;\n  };\n\n  /**\n   * Get a string representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {string} str\n   */\n  SparseMatrix.prototype.toString = function () {\n    return format(this.toArray());\n  };\n\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {Object}\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  /**\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  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      }\n      // is must be an integer\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    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n\n    // number diagonal values\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // diagonal arrays\n    var values = [];\n    var index = [];\n    var ptr = [];\n    // initial ptr value\n    ptr[0] = 0;\n    // loop columns\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];\n      // loop x within [k0, k1[\n      for (var x = k0; x < k1; x++) {\n        // row index\n        var i = this._index[x];\n        // check row\n        if (i === j - kSuper + kSub) {\n          // value on this column\n          values.push(this._values[x]);\n          // store row\n          index[values.length - 1] = i - kSub;\n          // exit loop\n          break;\n        }\n      }\n    }\n    // close ptr\n    ptr.push(values.length);\n    // return matrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size: [n, 1]\n    });\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  SparseMatrix.fromJSON = function (json) {\n    return new SparseMatrix(json);\n  };\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  SparseMatrix.diagonal = function (size, value, k, defaultValue, datatype) {\n    if (!isArray(size)) {\n      throw new TypeError('Array expected, size parameter');\n    }\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    }\n\n    // map size & validate\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      }\n      // validate arguments\n      if (!isNumber(s) || !isInteger(s) || s < 1) {\n        throw new Error('Size values must be positive integers');\n      }\n      return s;\n    });\n\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\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    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, datatype);\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows and columns\n    var rows = size[0];\n    var columns = size[1];\n\n    // number of non-zero items\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // value extraction function\n    var _value;\n\n    // check value\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      }\n      // define function\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();\n      // validate matrix\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      }\n      // define function\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    }\n\n    // create arrays\n    var values = [];\n    var index = [];\n    var ptr = [];\n\n    // loop items\n    for (var j = 0; j < columns; j++) {\n      // number of rows with value\n      ptr.push(values.length);\n      // diagonal index\n      var i = j - kSuper;\n      // check we need to set diagonal value\n      if (i >= 0 && i < n) {\n        // get value @ i\n        var v = _value(i);\n        // check for zero\n        if (!eq(v, zero)) {\n          // column\n          index.push(i + kSub);\n          // add value\n          values.push(v);\n        }\n      }\n    }\n    // last value should be number of values\n    ptr.push(values.length);\n    // create SparseMatrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size: [rows, columns]\n    });\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  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    }\n    // check dimensions\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    }\n    // validate index\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[0]);\n\n    // swap rows\n    SparseMatrix._swapRows(i, j, this._size[1], this._values, this._index, this._ptr);\n    // return current instance\n    return this;\n  };\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  SparseMatrix._forEachRow = function (j, values, index, ptr, callback) {\n    // indeces for column j\n    var k0 = ptr[j];\n    var k1 = ptr[j + 1];\n    // loop\n    for (var k = k0; k < k1; k++) {\n      // invoke callback\n      callback(index[k], values[k]);\n    }\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  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];\n      // find value index @ x\n      var kx = _getValueIndex(x, k0, k1, index);\n      // find value index @ x\n      var ky = _getValueIndex(y, k0, k1, index);\n      // check both rows exist in matrix\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        }\n        // next column\n        continue;\n      }\n      // check x row exist & no y row\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;\n        // insert value @ y\n        index.splice(ky, 0, y);\n        if (values) {\n          values.splice(ky, 0, vx);\n        }\n        // remove value @ x (adjust array index if needed)\n        index.splice(ky <= kx ? kx + 1 : kx, 1);\n        if (values) {\n          values.splice(ky <= kx ? kx + 1 : kx, 1);\n        }\n        // next column\n        continue;\n      }\n      // check y row exist & no x row\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;\n        // insert value @ x\n        index.splice(kx, 0, x);\n        if (values) {\n          values.splice(kx, 0, vy);\n        }\n        // remove value @ y (adjust array index if needed)\n        index.splice(kx <= ky ? ky + 1 : ky, 1);\n        if (values) {\n          values.splice(kx <= ky ? ky + 1 : ky, 1);\n        }\n      }\n    }\n  };\n  return SparseMatrix;\n}, {\n  isClass: true\n});","import { factory } from '../utils/factory.js';\nimport { deepMap } from '../utils/collection.js';\nvar name = 'number';\nvar dependencies = ['typed'];\n\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 */\nfunction getNonDecimalNumberParts(input) {\n  var nonDecimalWithRadixMatch = input.match(/(0[box])([0-9a-fA-F]*)\\.([0-9a-fA-F]*)/);\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/**\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 */\nfunction makeNumberFromNonDecimalParts(parts) {\n  var n = parseInt(parts.integerPart, parts.radix);\n  var f = 0;\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  var result = n + f;\n  if (isNaN(result)) {\n    throw new SyntaxError('String \"' + parts.input + '\" is not a valid number');\n  }\n  return result;\n}\nexport var createNumber = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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      if (nonDecimalNumberParts) {\n        return makeNumberFromNonDecimalParts(nonDecimalNumberParts);\n      }\n      var size = 0;\n      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);\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      var num = Number(x);\n      if (isNaN(num)) {\n        throw new SyntaxError('String \"' + x + '\" is not a valid number');\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        }\n        // check if the bit at index size - 1 is set and if so do the twos complement\n        if (num >= 2 ** (size - 1)) {\n          num = num - 2 ** size;\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: typed.referToSelf(self => x => {\n      var clone = x.clone();\n      clone.value = self(x.value);\n      return clone;\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': typed.referToSelf(self => x => deepMap(x, self))\n  });\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  number.fromJSON = function (json) {\n    return parseFloat(json.value);\n  };\n  return number;\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   * 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      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        if (n.gt(twoPowSize.sub(1))) {\n          throw new SyntaxError(\"String \\\"\".concat(x, \"\\\" is out of range\"));\n        }\n        var twoPowSizeSubOne = new BigNumber(2).pow(Number(size) - 1);\n        if (n.gte(twoPowSizeSubOne)) {\n          return n.sub(twoPowSize);\n        } else {\n          return 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    Unit: typed.referToSelf(self => x => {\n      var clone = x.clone();\n      clone.value = self(x.value);\n      return clone;\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': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'complex';\nvar dependencies = ['typed', 'Complex'];\nexport var createComplex = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Complex\n  } = _ref;\n  /**\n   * Create a complex value or convert a value to a complex value.\n   *\n   * Syntax:\n   *\n   *     math.complex()                           // creates a complex value with zero\n   *                                              // as real and imaginary part.\n   *     math.complex(re : number, im : string)   // creates a complex value with provided\n   *                                              // values for real and imaginary part.\n   *     math.complex(re : number)                // creates a complex value with provided\n   *                                              // real value and zero imaginary part.\n   *     math.complex(complex : Complex)          // clones the provided complex value.\n   *     math.complex(arg : string)               // parses a string into a complex value.\n   *     math.complex(array : Array)              // converts the elements of the array\n   *                                              // or matrix element wise into a\n   *                                              // complex value.\n   *     math.complex({re: number, im: number})   // creates a complex value with provided\n   *                                              // values for real an imaginary part.\n   *     math.complex({r: number, phi: number})   // creates a complex value with provided\n   *                                              // polar coordinates\n   *\n   * Examples:\n   *\n   *    const a = math.complex(3, -4)     // a = Complex 3 - 4i\n   *    a.re = 5                          // a = Complex 5 - 4i\n   *    const i = a.im                    // Number -4\n   *    const b = math.complex('2 + 6i')  // Complex 2 + 6i\n   *    const c = math.complex()          // Complex 0 + 0i\n   *    const d = math.add(a, b)          // Complex 5 + 2i\n   *\n   * See also:\n   *\n   *    bignumber, boolean, index, matrix, number, string, unit\n   *\n   * @param {* | Array | Matrix} [args]\n   *            Arguments specifying the real and imaginary part of the complex number\n   * @return {Complex | Array | Matrix} Returns a complex value\n   */\n  return typed('complex', {\n    '': function _() {\n      return Complex.ZERO;\n    },\n    number: function number(x) {\n      return new Complex(x, 0);\n    },\n    'number, number': function numberNumber(re, im) {\n      return new Complex(re, im);\n    },\n    // TODO: this signature should be redundant\n    'BigNumber, BigNumber': function BigNumberBigNumber(re, im) {\n      return new Complex(re.toNumber(), im.toNumber());\n    },\n    Fraction: function Fraction(x) {\n      return new Complex(x.valueOf(), 0);\n    },\n    Complex: function Complex(x) {\n      return x.clone();\n    },\n    string: function string(x) {\n      return Complex(x); // for example '2 + 3i'\n    },\n    null: function _null(x) {\n      return Complex(0);\n    },\n    Object: function Object(x) {\n      if ('re' in x && 'im' in x) {\n        return new Complex(x.re, x.im);\n      }\n      if ('r' in x && 'phi' in x || 'abs' in x && 'arg' in x) {\n        return new Complex(x);\n      }\n      throw new Error('Expected object with properties (re and im) or (r and phi) or (abs and arg)');\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\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   * Create a fraction or convert a value to a fraction.\n   *\n   * With one numeric argument, produces the closest rational approximation to the\n   * input.\n   * With two arguments, the first is the numerator and the second is the denominator,\n   * and creates the corresponding fraction. Both numerator and denominator must be\n   * integers.\n   * With one object argument, looks for the integer numerator as the value of property\n   * 'n' and the integer denominator as the value of property 'd'.\n   * With a matrix argument, creates a matrix of the same shape with entries\n   * converted into fractions.\n   *\n   * Syntax:\n   *     math.fraction(value)\n   *     math.fraction(numerator, denominator)\n   *     math.fraction({n: numerator, d: denominator})\n   *     math.fraction(matrix: Array | Matrix)\n   *\n   * Examples:\n   *\n   *     math.fraction(6.283)             // returns Fraction 6283/1000\n   *     math.fraction(1, 3)              // returns Fraction 1/3\n   *     math.fraction('2/3')             // returns Fraction 2/3\n   *     math.fraction({n: 2, d: 3})      // returns Fraction 2/3\n   *     math.fraction([0.2, 0.25, 1.25]) // returns Array [1/5, 1/4, 5/4]\n   *     math.fraction(4, 5.1)            // throws Error: Parameters must be integer\n   *\n   * See also:\n   *\n   *    bignumber, number, string, unit\n   *\n   * @param {number | string | Fraction | BigNumber | Unit | Array | Matrix} [args]\n   *            Arguments specifying the value, or 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      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    Unit: typed.referToSelf(self => x => {\n      var clone = x.clone();\n      clone.value = self(x.value);\n      return clone;\n    }),\n    Object: function Object(x) {\n      return new Fraction(x);\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\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   * 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  /**\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  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    if (format === 'sparse') {\n      return new SparseMatrix(data, datatype);\n    }\n    throw new TypeError('Unknown matrix type ' + JSON.stringify(format) + '.');\n  }\n});","import { factory } from '../../utils/factory.js';\nvar name = 'matrixFromColumns';\nvar dependencies = ['typed', 'matrix', 'flatten', 'size'];\nexport var createMatrixFromColumns = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    flatten,\n    size\n  } = _ref;\n  /**\n   * Create a dense matrix from vectors as individual columns.\n   * If you pass row vectors, they will be transposed (but not conjugated!)\n   *\n   * Syntax:\n   *\n   *    math.matrixFromColumns(...arr)\n   *    math.matrixFromColumns(col1, col2)\n   *    math.matrixFromColumns(col1, col2, col3)\n   *\n   * Examples:\n   *\n   *    math.matrixFromColumns([1, 2, 3], [[4],[5],[6]])\n   *    math.matrixFromColumns(...vectors)\n   *\n   * See also:\n   *\n   *    matrix, matrixFromRows, matrixFromFunction, zeros\n   *\n   * @param {... Array | Matrix} cols Multiple columns\n   * @return { number[][] | Matrix } if at least one of the arguments is an array, an array will be returned\n   */\n  return typed(name, {\n    '...Array': function Array(arr) {\n      return _createArray(arr);\n    },\n    '...Matrix': function Matrix(arr) {\n      return matrix(_createArray(arr.map(m => m.toArray())));\n    }\n\n    // TODO implement this properly for SparseMatrix\n  });\n  function _createArray(arr) {\n    if (arr.length === 0) throw new TypeError('At least one column is needed to construct a matrix.');\n    var N = checkVectorTypeAndReturnLength(arr[0]);\n\n    // create an array with empty rows\n    var result = [];\n    for (var i = 0; i < N; i++) {\n      result[i] = [];\n    }\n\n    // loop columns\n    for (var col of arr) {\n      var colLength = checkVectorTypeAndReturnLength(col);\n      if (colLength !== N) {\n        throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (colLength | 0));\n      }\n      var f = flatten(col);\n\n      // push a value to each row\n      for (var _i = 0; _i < N; _i++) {\n        result[_i].push(f[_i]);\n      }\n    }\n    return result;\n  }\n  function checkVectorTypeAndReturnLength(vec) {\n    var s = size(vec);\n    if (s.length === 1) {\n      // 1D vector\n      return s[0];\n    } else if (s.length === 2) {\n      // 2D vector\n      if (s[0] === 1) {\n        // row vector\n        return s[1];\n      } else if (s[1] === 1) {\n        // col vector\n        return s[0];\n      } else {\n        throw new TypeError('At least one of the arguments is not a vector.');\n      }\n    } else {\n      throw new TypeError('Only one- or two-dimensional vectors are supported.');\n    }\n  }\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   * 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 | BigNumber | Fraction': x => x.neg(),\n    Unit: typed.referToSelf(self => x => {\n      var res = x.clone();\n      res.value = typed.find(self, res.valueType())(x.value);\n      return res;\n    }),\n    // deep map collection, skip zeros since unaryMinus(0) = 0\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true))\n\n    // TODO: add support for string\n  });\n});","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   * 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 | BigNumber | Fraction | Unit': x => x.abs(),\n    // deep map collection, skip zeros since abs(0) = 0\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true))\n  });\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   * 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': typed.referToSelf(self => (x, y) => {\n      if (x.value === null || x.value === undefined) {\n        throw new Error('Parameter x contains a unit with undefined value');\n      }\n      if (y.value === null || y.value === undefined) {\n        throw new Error('Parameter y contains a unit with undefined value');\n      }\n      if (!x.equalBase(y)) throw new Error('Units do not match');\n      var res = x.clone();\n      res.value = typed.find(self, [res.valueType(), y.valueType()])(res.value, y.value);\n      res.fixPrefix = false;\n      return res;\n    })\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { subtractNumber } from '../../plain/number/index.js';\nvar name = 'subtractScalar';\nvar dependencies = ['typed'];\nexport var createSubtractScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Subtract two scalar values, `x - y`.\n   * This function is meant for internal use: it is used by the public function\n   * `subtract`\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit} x   First value\n   * @param  {number | BigNumber | Fraction | Complex} y          Second value to be subtracted from `x`\n   * @return {number | BigNumber | Fraction | Complex | Unit}     Difference of `x` and `y`\n   * @private\n   */\n  return typed(name, {\n    'number, number': subtractNumber,\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': typed.referToSelf(self => (x, y) => {\n      if (x.value === null || x.value === undefined) {\n        throw new Error('Parameter x contains a unit with undefined value');\n      }\n      if (y.value === null || y.value === undefined) {\n        throw new Error('Parameter y contains a unit with undefined value');\n      }\n      if (!x.equalBase(y)) throw new Error('Units do not match');\n      var res = x.clone();\n      res.value = typed.find(self, [res.valueType(), y.valueType()])(res.value, y.value);\n      res.fixPrefix = false;\n      return res;\n    })\n  });\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'matAlgo11xS0s';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createMatAlgo11xS0s = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\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 matAlgo11xS0s(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;\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // initialize ptr\n      cptr[j] = cindex.length;\n      // values in j\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = aindex[k];\n        // invoke callback\n        var v = inverse ? cf(b, avalues[k]) : cf(avalues[k], b);\n        // check value is zero\n        if (!eq(v, zero)) {\n          // push index & value\n          cindex.push(i);\n          cvalues.push(v);\n        }\n      }\n    }\n    // update ptr\n    cptr[columns] = cindex.length;\n\n    // return sparse matrix\n    return s.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 = 'matAlgo12xSfs';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createMatAlgo12xSfs = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    DenseMatrix\n  } = _ref;\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 matAlgo12xSfs(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;\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cdata = [];\n\n    // workspaces\n    var x = [];\n    // marks indicating we have a value in x for a given column\n    var w = [];\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1;\n      // values in j\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var r = aindex[k];\n        // update workspace\n        x[r] = avalues[k];\n        w[r] = mark;\n      }\n      // loop rows\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        }\n        // check sparse matrix has a value @ i,j\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    }\n\n    // return dense matrix\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { clone } from '../../../utils/object.js';\nvar name = 'matAlgo14xDs';\nvar dependencies = ['typed'];\nexport var createMatAlgo14xDs = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 matAlgo14xDs(a, b, callback, inverse) {\n    // a arrays\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n\n    // datatype\n    var dt;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // populate cdata, iterate through dimensions\n    var cdata = asize.length > 0 ? _iterate(cf, 0, asize, asize[0], adata, b, inverse) : [];\n\n    // c matrix\n    return a.createDenseMatrix({\n      data: cdata,\n      size: clone(asize),\n      datatype: dt\n    });\n  };\n\n  // recursive function\n  function _iterate(f, level, s, n, av, bv, inverse) {\n    // initialize array for this level\n    var cv = [];\n    // check we reach the last level\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    return cv;\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo03xDSf';\nvar dependencies = ['typed'];\nexport var createMatAlgo03xDSf = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 matAlgo03xDSf(denseMatrix, sparseMatrix, callback, inverse) {\n    // dense matrix arrays\n    var adata = denseMatrix._data;\n    var asize = denseMatrix._size;\n    var adt = denseMatrix._datatype || denseMatrix.getDataType();\n    // sparse matrix arrays\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 || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\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    }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result (DenseMatrix)\n    var cdata = [];\n\n    // initialize dense matrix\n    for (var z = 0; z < rows; z++) {\n      // initialize row\n      cdata[z] = [];\n    }\n\n    // workspace\n    var x = [];\n    // marks indicating we have a value in x for a given column\n    var w = [];\n\n    // loop columns in b\n    for (var j = 0; j < columns; j++) {\n      // column mark\n      var mark = j + 1;\n      // values in column j\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = bindex[k];\n        // update workspace\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);\n        w[i] = mark;\n      }\n      // process workspace\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    }\n\n    // return dense matrix\n    return denseMatrix.createDenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo05xSfSf';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createMatAlgo05xSfSf = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\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 matAlgo05xSfSf(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 || a._data === undefined ? a._datatype : a.getDataType();\n    // sparse matrix arrays\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 || b._data === undefined ? b._datatype : b.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\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    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = [];\n\n    // workspaces\n    var xa = cvalues ? [] : undefined;\n    var xb = cvalues ? [] : undefined;\n    // marks indicating we have a value in x for a given column\n    var wa = [];\n    var wb = [];\n\n    // vars\n    var i, j, k, k1;\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length;\n      // columns mark\n      var mark = j + 1;\n      // loop values A(:,j)\n      for (k = aptr[j], k1 = aptr[j + 1]; k < k1; k++) {\n        // row\n        i = aindex[k];\n        // push index\n        cindex.push(i);\n        // update workspace\n        wa[i] = mark;\n        // check we need to process values\n        if (xa) {\n          xa[i] = avalues[k];\n        }\n      }\n      // loop values B(:,j)\n      for (k = bptr[j], k1 = bptr[j + 1]; k < k1; k++) {\n        // row\n        i = bindex[k];\n        // check row existed in A\n        if (wa[i] !== mark) {\n          // push index\n          cindex.push(i);\n        }\n        // update workspace\n        wb[i] = mark;\n        // check we need to process values\n        if (xb) {\n          xb[i] = bvalues[k];\n        }\n      }\n      // check we need to process values (non pattern matrix)\n      if (cvalues) {\n        // initialize first index in j\n        k = cptr[j];\n        // loop index in j\n        while (k < cindex.length) {\n          // row\n          i = cindex[k];\n          // marks\n          var wai = wa[i];\n          var wbi = wb[i];\n          // check Aij or Bij are nonzero\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;\n            // Cij\n            var vc = cf(va, vb);\n            // check for zero\n            if (!eq(vc, zero)) {\n              // push value\n              cvalues.push(vc);\n              // increment pointer\n              k++;\n            } else {\n              // remove value @ i, do not increment pointer\n              cindex.splice(k, 1);\n            }\n          }\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length;\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo13xDD';\nvar dependencies = ['typed'];\nexport var createMatAlgo13xDD = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 matAlgo13xDD(a, b, callback) {\n    // a arrays\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n    // b arrays\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype;\n    // c arrays\n    var csize = [];\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    }\n\n    // validate each one of the dimension sizes\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      }\n      // update dimension in c\n      csize[s] = asize[s];\n    }\n\n    // datatype\n    var dt;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt;\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // populate cdata, iterate through dimensions\n    var cdata = csize.length > 0 ? _iterate(cf, 0, csize, csize[0], adata, bdata) : [];\n\n    // c matrix\n    return a.createDenseMatrix({\n      data: cdata,\n      size: csize,\n      datatype: dt\n    });\n  };\n\n  // recursive function\n  function _iterate(f, level, s, n, av, bv) {\n    // initialize array for this level\n    var cv = [];\n    // check we reach the last level\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    return cv;\n  }\n});","import { checkBroadcastingRules } from '../../../utils/array.js';\nimport { factory } from '../../../utils/factory.js';\nvar name = 'broadcast';\nvar dependancies = ['concat'];\nexport var createBroadcast = /* #__PURE__ */factory(name, dependancies, _ref => {\n  var {\n    concat\n  } = _ref;\n  /**\n  * Broadcasts two matrices, and return both in an array\n  * It checks if it's possible with broadcasting rules\n  *\n  * @param {Matrix}   A      First Matrix\n  * @param {Matrix}   B      Second Matrix\n  *\n  * @return {Matrix[]}      [ broadcastedA, broadcastedB ]\n  */\n  return function (A, B) {\n    var N = Math.max(A._size.length, B._size.length); // max number of dims\n    if (A._size.length === B._size.length) {\n      if (A._size.every((dim, i) => dim === B._size[i])) {\n        // If matrices have the same size return them\n        return [A, B];\n      }\n    }\n    var sizeA = _padLeft(A._size, N, 0); // pad to the left to align dimensions to the right\n    var sizeB = _padLeft(B._size, N, 0); // pad to the left to align dimensions to the right\n\n    // calculate the max dimensions\n    var sizeMax = [];\n    for (var dim = 0; dim < N; dim++) {\n      sizeMax[dim] = Math.max(sizeA[dim], sizeB[dim]);\n    }\n\n    // check if the broadcasting rules applyes for both matrices\n    checkBroadcastingRules(sizeA, sizeMax);\n    checkBroadcastingRules(sizeB, sizeMax);\n\n    // reshape A or B if needed to make them ready for concat\n    var AA = A.clone();\n    var BB = B.clone();\n    if (AA._size.length < N) {\n      AA.reshape(_padLeft(AA._size, N, 1));\n    } else if (BB._size.length < N) {\n      BB.reshape(_padLeft(BB._size, N, 1));\n    }\n\n    // stretches the matrices on each dimension to make them the same size\n    for (var _dim = 0; _dim < N; _dim++) {\n      if (AA._size[_dim] < sizeMax[_dim]) {\n        AA = _stretch(AA, sizeMax[_dim], _dim);\n      }\n      if (BB._size[_dim] < sizeMax[_dim]) {\n        BB = _stretch(BB, sizeMax[_dim], _dim);\n      }\n    }\n\n    // return the array with the two broadcasted matrices\n    return [AA, BB];\n  };\n  function _padLeft(shape, N, filler) {\n    // pads an array of dimensions with numbers to the left, unitl the number of dimensions is N\n    return [...Array(N - shape.length).fill(filler), ...shape];\n  }\n  function _stretch(arrayToStretch, sizeToStretch, dimToStretch) {\n    // stretches a matrix up to a certain size in a certain dimension\n    return concat(...Array(sizeToStretch).fill(arrayToStretch), dimToStretch);\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { extend } from '../../../utils/object.js';\nimport { createMatAlgo13xDD } from './matAlgo13xDD.js';\nimport { createMatAlgo14xDs } from './matAlgo14xDs.js';\nimport { createBroadcast } from './broadcast.js';\nvar name = 'matrixAlgorithmSuite';\nvar dependencies = ['typed', 'matrix', 'concat'];\nexport var createMatrixAlgorithmSuite = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    concat\n  } = _ref;\n  var matAlgo13xDD = createMatAlgo13xDD({\n    typed\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\n  });\n  var broadcast = createBroadcast({\n    concat\n  });\n\n  /**\n   * Return a signatures object with the usual boilerplate of\n   * matrix algorithms, based on a plain options object with the\n   * following properties:\n   *   elop: function -- the elementwise operation to use, defaults to self\n   *   SS: function -- the algorithm to apply for two sparse matrices\n   *   DS: function -- the algorithm to apply for a dense and a sparse matrix\n   *   SD: function -- algo for a sparse and a dense; defaults to SD flipped\n   *   Ss: function -- the algorithm to apply for a sparse matrix and scalar\n   *   sS: function -- algo for scalar and sparse; defaults to Ss flipped\n   *   scalar: string -- typed-function type for scalars, defaults to 'any'\n   *\n   * If Ss is not specified, no matrix-scalar signatures are generated.\n   *\n   * @param {object} options\n   * @return {Object<string, function>} signatures\n   */\n  return function matrixAlgorithmSuite(options) {\n    var elop = options.elop;\n    var SD = options.SD || options.DS;\n    var matrixSignatures;\n    if (elop) {\n      // First the dense ones\n      matrixSignatures = {\n        'DenseMatrix, DenseMatrix': (x, y) => matAlgo13xDD(...broadcast(x, y), elop),\n        'Array, Array': (x, y) => matAlgo13xDD(...broadcast(matrix(x), matrix(y)), elop).valueOf(),\n        'Array, DenseMatrix': (x, y) => matAlgo13xDD(...broadcast(matrix(x), y), elop),\n        'DenseMatrix, Array': (x, y) => matAlgo13xDD(...broadcast(x, matrix(y)), elop)\n      };\n      // Now incorporate sparse matrices\n      if (options.SS) {\n        matrixSignatures['SparseMatrix, SparseMatrix'] = (x, y) => options.SS(...broadcast(x, y), elop, false);\n      }\n      if (options.DS) {\n        matrixSignatures['DenseMatrix, SparseMatrix'] = (x, y) => options.DS(...broadcast(x, y), elop, false);\n        matrixSignatures['Array, SparseMatrix'] = (x, y) => options.DS(...broadcast(matrix(x), y), elop, false);\n      }\n      if (SD) {\n        matrixSignatures['SparseMatrix, DenseMatrix'] = (x, y) => SD(...broadcast(y, x), elop, true);\n        matrixSignatures['SparseMatrix, Array'] = (x, y) => SD(...broadcast(matrix(y), x), elop, true);\n      }\n    } else {\n      // No elop, use this\n      // First the dense ones\n      matrixSignatures = {\n        'DenseMatrix, DenseMatrix': typed.referToSelf(self => (x, y) => {\n          return matAlgo13xDD(...broadcast(x, y), self);\n        }),\n        'Array, Array': typed.referToSelf(self => (x, y) => {\n          return matAlgo13xDD(...broadcast(matrix(x), matrix(y)), self).valueOf();\n        }),\n        'Array, DenseMatrix': typed.referToSelf(self => (x, y) => {\n          return matAlgo13xDD(...broadcast(matrix(x), y), self);\n        }),\n        'DenseMatrix, Array': typed.referToSelf(self => (x, y) => {\n          return matAlgo13xDD(...broadcast(x, matrix(y)), self);\n        })\n      };\n      // Now incorporate sparse matrices\n      if (options.SS) {\n        matrixSignatures['SparseMatrix, SparseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return options.SS(...broadcast(x, y), self, false);\n        });\n      }\n      if (options.DS) {\n        matrixSignatures['DenseMatrix, SparseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return options.DS(...broadcast(x, y), self, false);\n        });\n        matrixSignatures['Array, SparseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return options.DS(...broadcast(matrix(x), y), self, false);\n        });\n      }\n      if (SD) {\n        matrixSignatures['SparseMatrix, DenseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return SD(...broadcast(y, x), self, true);\n        });\n        matrixSignatures['SparseMatrix, Array'] = typed.referToSelf(self => (x, y) => {\n          return SD(...broadcast(matrix(y), x), self, true);\n        });\n      }\n    }\n\n    // Now add the scalars\n    var scalar = options.scalar || 'any';\n    var Ds = options.Ds || options.Ss;\n    if (Ds) {\n      if (elop) {\n        matrixSignatures['DenseMatrix,' + scalar] = (x, y) => matAlgo14xDs(x, y, elop, false);\n        matrixSignatures[scalar + ', DenseMatrix'] = (x, y) => matAlgo14xDs(y, x, elop, true);\n        matrixSignatures['Array,' + scalar] = (x, y) => matAlgo14xDs(matrix(x), y, elop, false).valueOf();\n        matrixSignatures[scalar + ', Array'] = (x, y) => matAlgo14xDs(matrix(y), x, elop, true).valueOf();\n      } else {\n        matrixSignatures['DenseMatrix,' + scalar] = typed.referToSelf(self => (x, y) => {\n          return matAlgo14xDs(x, y, self, false);\n        });\n        matrixSignatures[scalar + ', DenseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return matAlgo14xDs(y, x, self, true);\n        });\n        matrixSignatures['Array,' + scalar] = typed.referToSelf(self => (x, y) => {\n          return matAlgo14xDs(matrix(x), y, self, false).valueOf();\n        });\n        matrixSignatures[scalar + ', Array'] = typed.referToSelf(self => (x, y) => {\n          return matAlgo14xDs(matrix(y), x, self, true).valueOf();\n        });\n      }\n    }\n    var sS = options.sS !== undefined ? options.sS : options.Ss;\n    if (elop) {\n      if (options.Ss) {\n        matrixSignatures['SparseMatrix,' + scalar] = (x, y) => options.Ss(x, y, elop, false);\n      }\n      if (sS) {\n        matrixSignatures[scalar + ', SparseMatrix'] = (x, y) => sS(y, x, elop, true);\n      }\n    } else {\n      if (options.Ss) {\n        matrixSignatures['SparseMatrix,' + scalar] = typed.referToSelf(self => (x, y) => {\n          return options.Ss(x, y, self, false);\n        });\n      }\n      if (sS) {\n        matrixSignatures[scalar + ', SparseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return sS(y, x, self, true);\n        });\n      }\n    }\n    // Also pull in the scalar signatures if the operator is a typed function\n    if (elop && elop.signatures) {\n      extend(matrixSignatures, elop.signatures);\n    }\n    return matrixSignatures;\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo01xDSid';\nvar dependencies = ['typed'];\nexport var createMatAlgo01xDSid = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 || denseMatrix.getDataType();\n    // sparse matrix arrays\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 || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\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    }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // process data types\n    var dt = typeof adt === 'string' && adt !== 'mixed' && adt === bdt ? adt : undefined;\n    // callback function\n    var cf = dt ? typed.find(callback, [dt, dt]) : callback;\n\n    // vars\n    var i, j;\n\n    // result (DenseMatrix)\n    var cdata = [];\n    // initialize c\n    for (i = 0; i < rows; i++) {\n      cdata[i] = [];\n    }\n\n    // workspace\n    var x = [];\n    // marks indicating we have a value in x for a given column\n    var w = [];\n\n    // loop columns in b\n    for (j = 0; j < columns; j++) {\n      // column mark\n      var mark = j + 1;\n      // values in column j\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k];\n        // update workspace\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);\n        // mark i as updated\n        w[i] = mark;\n      }\n      // loop rows\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    }\n\n    // return dense matrix\n    return denseMatrix.createDenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo04xSidSid';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createMatAlgo04xSidSid = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\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 && B(i,j) === 0\n   *          └  B(i,j)       ; A(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 matAlgo04xSidSid(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 || a._data === undefined ? a._datatype : a.getDataType();\n    // sparse matrix arrays\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 || b._data === undefined ? b._datatype : b.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\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    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = [];\n\n    // workspace\n    var xa = avalues && bvalues ? [] : undefined;\n    var xb = avalues && bvalues ? [] : undefined;\n    // marks indicating we have a value in x for a given column\n    var wa = [];\n    var wb = [];\n\n    // vars\n    var i, j, k, k0, k1;\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length;\n      // columns mark\n      var mark = j + 1;\n      // loop A(:,j)\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k];\n        // update c\n        cindex.push(i);\n        // update workspace\n        wa[i] = mark;\n        // check we need to process values\n        if (xa) {\n          xa[i] = avalues[k];\n        }\n      }\n      // loop B(:,j)\n      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k];\n        // check row exists in A\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]);\n            // check for zero\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);\n          // update workspace\n          wb[i] = mark;\n          // check we need to process values\n          if (xb) {\n            xb[i] = bvalues[k];\n          }\n        }\n      }\n      // check we need to process values (non pattern matrix)\n      if (xa && xb) {\n        // initialize first index in j\n        k = cptr[j];\n        // loop index in j\n        while (k < cindex.length) {\n          // row\n          i = cindex[k];\n          // check workspace has value @ i\n          if (wa[i] === mark) {\n            // push value (Aij != 0 || (Aij != 0 && Bij != 0))\n            cvalues[k] = xa[i];\n            // increment pointer\n            k++;\n          } else if (wb[i] === mark) {\n            // push value (bij != 0)\n            cvalues[k] = xb[i];\n            // increment pointer\n            k++;\n          } else {\n            // remove index @ k\n            cindex.splice(k, 1);\n          }\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length;\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'matAlgo10xSids';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createMatAlgo10xSids = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    DenseMatrix\n  } = _ref;\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 matAlgo10xSids(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;\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cdata = [];\n\n    // workspaces\n    var x = [];\n    // marks indicating we have a value in x for a given column\n    var w = [];\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1;\n      // values in j\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var r = aindex[k];\n        // update workspace\n        x[r] = avalues[k];\n        w[r] = mark;\n      }\n      // loop rows\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        }\n        // check sparse matrix has a value @ i,j\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    }\n\n    // return dense matrix\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\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   * 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': (x, y) => y.multiply(x),\n    'Unit, number | Fraction | BigNumber | Complex | Unit': (x, y) => x.multiply(y)\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nimport { arraySize } from '../../utils/array.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.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 matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\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            break;\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            break;\n          default:\n            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');\n        }\n        break;\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            break;\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            break;\n          default:\n            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');\n        }\n        break;\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  /**\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  function _multiplyVectorVector(a, b, n) {\n    // check empty vector\n    if (n === 0) {\n      throw new Error('Cannot multiply two empty vectors');\n    }\n    return dot(a, b);\n  }\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  function _multiplyVectorMatrix(a, b) {\n    // process storage\n    if (b.storage() !== 'dense') {\n      throw new Error('Support for SparseMatrix not implemented');\n    }\n    return _multiplyVectorDenseMatrix(a, b);\n  }\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  function _multiplyVectorDenseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype || a.getDataType();\n    // b dense\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype || b.getDataType();\n    // rows & columns\n    var alength = asize[0];\n    var bcolumns = bsize[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // result\n    var c = [];\n\n    // loop matrix columns\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]);\n      // loop vector\n      for (var i = 1; i < alength; i++) {\n        // multiply & accumulate\n        sum = af(sum, mf(adata[i], bdata[i][j]));\n      }\n      c[j] = sum;\n    }\n\n    // return matrix\n    return a.createDenseMatrix({\n      data: c,\n      size: [bcolumns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\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  var _multiplyMatrixVector = typed('_multiplyMatrixVector', {\n    'DenseMatrix, any': _multiplyDenseMatrixVector,\n    'SparseMatrix, any': _multiplySparseMatrixVector\n  });\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  var _multiplyMatrixMatrix = typed('_multiplyMatrixMatrix', {\n    'DenseMatrix, DenseMatrix': _multiplyDenseMatrixDenseMatrix,\n    'DenseMatrix, SparseMatrix': _multiplyDenseMatrixSparseMatrix,\n    'SparseMatrix, DenseMatrix': _multiplySparseMatrixDenseMatrix,\n    'SparseMatrix, SparseMatrix': _multiplySparseMatrixSparseMatrix\n  });\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  function _multiplyDenseMatrixVector(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype || a.getDataType();\n    // b dense\n    var bdata = b._data;\n    var bdt = b._datatype || b.getDataType();\n    // rows & columns\n    var arows = asize[0];\n    var acolumns = asize[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // result\n    var c = [];\n\n    // loop matrix a rows\n    for (var i = 0; i < arows; i++) {\n      // current row\n      var row = adata[i];\n      // sum (do not initialize it with zero)\n      var sum = mf(row[0], bdata[0]);\n      // loop matrix a columns\n      for (var j = 1; j < acolumns; j++) {\n        // multiply & accumulate\n        sum = af(sum, mf(row[j], bdata[j]));\n      }\n      c[i] = sum;\n    }\n\n    // return matrix\n    return a.createDenseMatrix({\n      data: c,\n      size: [arows],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\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  function _multiplyDenseMatrixDenseMatrix(a, b) {\n    // getDataType()\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype || a.getDataType();\n    // b dense\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype || b.getDataType();\n    // rows & columns\n    var arows = asize[0];\n    var acolumns = asize[1];\n    var bcolumns = bsize[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed' && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // result\n    var c = [];\n\n    // loop matrix a rows\n    for (var i = 0; i < arows; i++) {\n      // current row\n      var row = adata[i];\n      // initialize row array\n      c[i] = [];\n      // loop matrix b columns\n      for (var j = 0; j < bcolumns; j++) {\n        // sum (avoid initializing sum to zero)\n        var sum = mf(row[0], bdata[0][j]);\n        // loop matrix a columns\n        for (var x = 1; x < acolumns; x++) {\n          // multiply & accumulate\n          sum = af(sum, mf(row[x], bdata[x][j]));\n        }\n        c[i][j] = sum;\n      }\n    }\n\n    // return matrix\n    return a.createDenseMatrix({\n      data: c,\n      size: [arows, bcolumns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\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  function _multiplyDenseMatrixSparseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype || a.getDataType();\n    // b sparse\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 || b._data === undefined ? b._datatype : b.getDataType();\n    // validate b matrix\n    if (!bvalues) {\n      throw new Error('Cannot multiply Dense Matrix times Pattern only Matrix');\n    }\n    // rows & columns\n    var arows = asize[0];\n    var bcolumns = bsize[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n    // equalScalar signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n    }\n\n    // result\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n    // c matrix\n    var c = b.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n\n    // loop b columns\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length;\n      // indeces in column jb\n      var kb0 = bptr[jb];\n      var kb1 = bptr[jb + 1];\n      // do not process column jb if no data exists\n      if (kb1 > kb0) {\n        // last row mark processed\n        var last = 0;\n        // loop a rows\n        for (var i = 0; i < arows; i++) {\n          // column mark\n          var mark = i + 1;\n          // C[i, jb]\n          var cij = void 0;\n          // values in b column j\n          for (var kb = kb0; kb < kb1; kb++) {\n            // row\n            var ib = bindex[kb];\n            // check value has been initialized\n            if (last !== mark) {\n              // first value in column jb\n              cij = mf(adata[i][ib], bvalues[kb]);\n              // update mark\n              last = mark;\n            } else {\n              // accumulate value\n              cij = af(cij, mf(adata[i][ib], bvalues[kb]));\n            }\n          }\n          // check column has been processed and value != 0\n          if (last === mark && !eq(cij, zero)) {\n            // push row & value\n            cindex.push(i);\n            cvalues.push(cij);\n          }\n        }\n      }\n    }\n    // update ptr\n    cptr[bcolumns] = cindex.length;\n\n    // return sparse matrix\n    return c;\n  }\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  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 || a._data === undefined ? a._datatype : a.getDataType();\n    // validate a matrix\n    if (!avalues) {\n      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');\n    }\n    // b dense\n    var bdata = b._data;\n    var bdt = b._datatype || b.getDataType();\n    // rows & columns\n    var arows = a._size[0];\n    var brows = b._size[0];\n    // result\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n    // equalScalar signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n    }\n\n    // workspace\n    var x = [];\n    // vector with marks indicating a value x[i] exists in a given column\n    var w = [];\n\n    // update ptr\n    cptr[0] = 0;\n    // rows in b\n    for (var ib = 0; ib < brows; ib++) {\n      // b[ib]\n      var vbi = bdata[ib];\n      // check b[ib] != 0, avoid loops\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];\n          // check value exists in current j\n          if (!w[ia]) {\n            // ia is new entry in j\n            w[ia] = true;\n            // add i to pattern of C\n            cindex.push(ia);\n            // x(ia) = A\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    }\n    // copy values from x to column jb of c\n    for (var p1 = cindex.length, p = 0; p < p1; p++) {\n      // row\n      var ic = cindex[p];\n      // copy value\n      cvalues[p] = x[ic];\n    }\n    // update ptr\n    cptr[1] = cindex.length;\n\n    // matrix to return\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, 1],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\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  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 || a._data === undefined ? a._datatype : a.getDataType();\n    // validate a matrix\n    if (!avalues) {\n      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');\n    }\n    // b dense\n    var bdata = b._data;\n    var bdt = b._datatype || b.getDataType();\n    // rows & columns\n    var arows = a._size[0];\n    var brows = b._size[0];\n    var bcolumns = b._size[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n    // equalScalar signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n    }\n\n    // result\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n    // c matrix\n    var c = a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n\n    // workspace\n    var x = [];\n    // vector with marks indicating a value x[i] exists in a given column\n    var w = [];\n\n    // loop b columns\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length;\n      // mark in workspace for current column\n      var mark = jb + 1;\n      // rows in jb\n      for (var ib = 0; ib < brows; ib++) {\n        // b[ib, jb]\n        var vbij = bdata[ib][jb];\n        // check b[ib, jb] != 0, avoid loops\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];\n            // check value exists in current j\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark;\n              // add i to pattern of C\n              cindex.push(ia);\n              // x(ia) = A\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      }\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];\n        // copy value\n        cvalues[p] = x[ic];\n      }\n    }\n    // update ptr\n    cptr[bcolumns] = cindex.length;\n\n    // return sparse matrix\n    return c;\n  }\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  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 || a._data === undefined ? a._datatype : a.getDataType();\n    // b sparse\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();\n\n    // rows & columns\n    var arows = a._size[0];\n    var bcolumns = b._size[1];\n    // flag indicating both matrices (a & b) contain data\n    var values = avalues && bvalues;\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // result\n    var cvalues = values ? [] : undefined;\n    var cindex = [];\n    var cptr = [];\n    // c matrix\n    var c = a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n\n    // workspace\n    var x = values ? [] : undefined;\n    // vector with marks indicating a value x[i] exists in a given column\n    var w = [];\n    // variables\n    var ka, ka0, ka1, kb, kb0, kb1, ia, ib;\n    // loop b columns\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length;\n      // mark in workspace for current column\n      var mark = jb + 1;\n      // B values & index in j\n      for (kb0 = bptr[jb], kb1 = bptr[jb + 1], kb = kb0; kb < kb1; kb++) {\n        // b row\n        ib = bindex[kb];\n        // check we need to process values\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];\n            // check value exists in current j\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark;\n              // add i to pattern of C\n              cindex.push(ia);\n              // x(ia) = A\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];\n            // check value exists in current j\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark;\n              // add i to pattern of C\n              cindex.push(ia);\n            }\n          }\n        }\n      }\n      // check we need to process matrix values (pattern matrix)\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];\n          // copy value\n          cvalues[p] = x[ic];\n        }\n      }\n    }\n    // update ptr\n    cptr[bcolumns] = cindex.length;\n\n    // return sparse matrix\n    return c;\n  }\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  return typed(name, multiplyScalar, {\n    // we extend the signatures of multiplyScalar with signatures dealing with matrices\n\n    'Array, Array': typed.referTo('Matrix, Matrix', selfMM => (x, y) => {\n      // check dimensions\n      _validateMatrixDimensions(arraySize(x), arraySize(y));\n\n      // use dense matrix implementation\n      var m = selfMM(matrix(x), matrix(y));\n      // return array or scalar\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();\n\n      // check dimensions\n      _validateMatrixDimensions(xsize, ysize);\n\n      // process dimensions\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        }\n        // Vector * Matrix\n        return _multiplyVectorMatrix(x, y);\n      }\n      // process y dimensions\n      if (ysize.length === 1) {\n        // Matrix * Vector\n        return _multiplyMatrixVector(x, y);\n      }\n      // Matrix * Matrix\n      return _multiplyMatrixMatrix(x, y);\n    },\n    'Matrix, Array': typed.referTo('Matrix,Matrix', selfMM => (x, y) => selfMM(x, matrix(y))),\n    'Array, Matrix': typed.referToSelf(self => (x, y) => {\n      // use Matrix * Matrix implementation\n      return self(matrix(x, y.storage()), y);\n    }),\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return matAlgo11xS0s(x, y, multiplyScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return matAlgo14xDs(x, y, multiplyScalar, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return matAlgo11xS0s(y, x, multiplyScalar, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return matAlgo14xDs(y, x, multiplyScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(x), y, multiplyScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(y), x, multiplyScalar, true).valueOf();\n    },\n    'any, any': multiplyScalar,\n    'any, any, ...any': typed.referToSelf(self => (x, y, rest) => {\n      var result = self(x, y);\n      for (var i = 0; i < rest.length; i++) {\n        result = self(result, rest[i]);\n      }\n      return result;\n    })\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { signNumber } from '../../plain/number/index.js';\nvar name = 'sign';\nvar dependencies = ['typed', 'BigNumber', 'Fraction', 'complex'];\nexport var createSign = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    BigNumber: _BigNumber,\n    complex,\n    Fraction: _Fraction\n  } = _ref;\n  /**\n   * Compute the sign of a value. The sign of a value x is:\n   *\n   * -  1 when x > 0\n   * - -1 when x < 0\n   * -  0 when x == 0\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.sign(x)\n   *\n   * Examples:\n   *\n   *    math.sign(3.5)               // returns 1\n   *    math.sign(-4.2)              // returns -1\n   *    math.sign(0)                 // returns 0\n   *\n   *    math.sign([3, 5, -2, 0, 2])  // returns [1, 1, -1, 0, 1]\n   *\n   * See also:\n   *\n   *    abs\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x\n   *            The number for which to determine the sign\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}\n   *            The sign of `x`\n   */\n  return typed(name, {\n    number: signNumber,\n    Complex: function Complex(x) {\n      return x.im === 0 ? complex(signNumber(x.re)) : x.sign();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(x.cmp(0));\n    },\n    Fraction: function Fraction(x) {\n      return new _Fraction(x.s, 1);\n    },\n    // deep map collection, skip zeros since sign(0) = 0\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true)),\n    Unit: typed.referToSelf(self => x => {\n      if (!x._isDerived() && x.units[0].unit.offset !== 0) {\n        throw new TypeError('sign is ambiguous for units with offset');\n      }\n      return typed.find(self, x.valueType())(x.value);\n    })\n  });\n});","import { factory } from '../../utils/factory.js';\nvar name = 'sqrt';\nvar dependencies = ['config', 'typed', 'Complex'];\nexport var createSqrt = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    config,\n    typed,\n    Complex\n  } = _ref;\n  /**\n   * Calculate the square root of a value.\n   *\n   * For matrices, if you want the matrix square root of a square matrix,\n   * use the `sqrtm` function. If you wish to apply `sqrt` elementwise to\n   * a matrix M, use `math.map(M, math.sqrt)`.\n   *\n   * Syntax:\n   *\n   *    math.sqrt(x)\n   *\n   * Examples:\n   *\n   *    math.sqrt(25)                // returns 5\n   *    math.square(5)               // returns 25\n   *    math.sqrt(-4)                // returns Complex 2i\n   *\n   * See also:\n   *\n   *    square, multiply, cube, cbrt, sqrtm\n   *\n   * @param {number | BigNumber | Complex | Unit} x\n   *            Value for which to calculate the square root.\n   * @return {number | BigNumber | Complex | Unit}\n   *            Returns the square root of `x`\n   */\n  return typed('sqrt', {\n    number: _sqrtNumber,\n    Complex: function Complex(x) {\n      return x.sqrt();\n    },\n    BigNumber: function BigNumber(x) {\n      if (!x.isNegative() || config.predictable) {\n        return x.sqrt();\n      } else {\n        // negative value -> downgrade to number to do complex value computation\n        return _sqrtNumber(x.toNumber());\n      }\n    },\n    Unit: function Unit(x) {\n      // Someday will work for complex units when they are implemented\n      return x.pow(0.5);\n    }\n  });\n\n  /**\n   * Calculate sqrt for a number\n   * @param {number} x\n   * @returns {number | Complex} Returns the square root of x\n   * @private\n   */\n  function _sqrtNumber(x) {\n    if (isNaN(x)) {\n      return NaN;\n    } else if (x >= 0 || config.predictable) {\n      return Math.sqrt(x);\n    } else {\n      return new Complex(x, 0).sqrt();\n    }\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo05xSfSf } from '../../type/matrix/utils/matAlgo05xSfSf.js';\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'subtract';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'subtractScalar', 'unaryMinus', 'DenseMatrix', 'concat'];\nexport var createSubtract = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    subtractScalar,\n    unaryMinus,\n    DenseMatrix,\n    concat\n  } = _ref;\n  // TODO: split function subtract in two: subtract and subtractScalar\n\n  var matAlgo01xDSid = createMatAlgo01xDSid({\n    typed\n  });\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo05xSfSf = createMatAlgo05xSfSf({\n    typed,\n    equalScalar\n  });\n  var matAlgo10xSids = createMatAlgo10xSids({\n    typed,\n    DenseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\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 Initial value\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Value to subtract from `x`\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Subtraction of `x` and `y`\n   */\n  return typed(name, {\n    'any, any': subtractScalar\n  }, matrixAlgorithmSuite({\n    elop: subtractScalar,\n    SS: matAlgo05xSfSf,\n    DS: matAlgo01xDSid,\n    SD: matAlgo03xDSf,\n    Ss: matAlgo12xSfs,\n    sS: matAlgo10xSids\n  }));\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo07xSSf';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createMatAlgo07xSSf = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    DenseMatrix\n  } = _ref;\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 matAlgo07xSSf(a, b, callback) {\n    // sparse matrix arrays\n    var asize = a._size;\n    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();\n    // sparse matrix arrays\n    var bsize = b._size;\n    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\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    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // vars\n    var i, j;\n\n    // result arrays\n    var cdata = [];\n    // initialize c\n    for (i = 0; i < rows; i++) {\n      cdata[i] = [];\n    }\n\n    // workspaces\n    var xa = [];\n    var xb = [];\n    // marks indicating we have a value in x for a given column\n    var wa = [];\n    var wb = [];\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1;\n      // scatter the values of A(:,j) into workspace\n      _scatter(a, j, wa, xa, mark);\n      // scatter the values of B(:,j) into workspace\n      _scatter(b, j, wb, xb, mark);\n      // loop rows\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;\n        // invoke callback\n        cdata[i][j] = cf(va, vb);\n      }\n    }\n\n    // return dense matrix\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\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;\n    // loop values in column j\n    for (var k = ptr[j], k1 = ptr[j + 1]; k < k1; k++) {\n      // row\n      var i = index[k];\n      // update workspace\n      w[i] = mark;\n      x[i] = values[k];\n    }\n  }\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   * 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 | BigNumber | Fraction': x => x,\n    Complex: x => x.conjugate(),\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'im';\nvar dependencies = ['typed'];\nexport var createIm = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Get the imaginary part of a complex number.\n   * For a complex number `a + bi`, the function returns `b`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.im(x)\n   *\n   * Examples:\n   *\n   *    const a = math.complex(2, 3)\n   *    math.re(a)                     // returns number 2\n   *    math.im(a)                     // returns number 3\n   *\n   *    math.re(math.complex('-5.2i')) // returns number -5.2\n   *    math.re(math.complex(2.4))     // returns number 0\n   *\n   * See also:\n   *\n   *    re, conj, abs, arg\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Array | Matrix} The imaginary part of x\n   */\n  return typed(name, {\n    number: () => 0,\n    'BigNumber | Fraction': x => x.mul(0),\n    Complex: x => x.im,\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 're';\nvar dependencies = ['typed'];\nexport var createRe = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Get the real part of a complex number.\n   * For a complex number `a + bi`, the function returns `a`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.re(x)\n   *\n   * Examples:\n   *\n   *    const a = math.complex(2, 3)\n   *    math.re(a)                     // returns number 2\n   *    math.im(a)                     // returns number 3\n   *\n   *    math.re(math.complex('-5.2i')) // returns number 0\n   *    math.re(math.complex(2.4))     // returns number 2.4\n   *\n   * See also:\n   *\n   *    im, conj, abs, arg\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Array | Matrix} The real part of x\n   */\n  return typed(name, {\n    'number | BigNumber | Fraction': x => x,\n    Complex: x => x.re,\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { isBigNumber, isMatrix, isNumber } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { arraySize, concat as _concat } from '../../utils/array.js';\nimport { IndexError } from '../../error/IndexError.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'concat';\nvar dependencies = ['typed', 'matrix', 'isInteger'];\nexport var createConcat = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    isInteger\n  } = _ref;\n  /**\n   * Concatenate two or more matrices.\n   *\n   * Syntax:\n   *\n   *     math.concat(A, B, C, ...)\n   *     math.concat(A, B, C, ..., dim)\n   *\n   * Where:\n   *\n   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.\n   *   By default the last dimension of the matrices.\n   *\n   * Examples:\n   *\n   *    const A = [[1, 2], [5, 6]]\n   *    const B = [[3, 4], [7, 8]]\n   *\n   *    math.concat(A, B)                  // returns [[1, 2, 3, 4], [5, 6, 7, 8]]\n   *    math.concat(A, B, 0)               // returns [[1, 2], [5, 6], [3, 4], [7, 8]]\n   *    math.concat('hello', ' ', 'world') // returns 'hello world'\n   *\n   * See also:\n   *\n   *    size, squeeze, subset, transpose\n   *\n   * @param {... Array | Matrix} args     Two or more matrices\n   * @return {Array | Matrix} Concatenated matrix\n   */\n  return typed(name, {\n    // TODO: change signature to '...Array | Matrix, dim?' when supported\n    '...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumber(args) {\n      var i;\n      var len = args.length;\n      var dim = -1; // zero-based dimension\n      var prevDim;\n      var asMatrix = false;\n      var matrices = []; // contains multi dimensional arrays\n\n      for (i = 0; i < len; i++) {\n        var arg = args[i];\n\n        // test whether we need to return a Matrix (if not we return an Array)\n        if (isMatrix(arg)) {\n          asMatrix = true;\n        }\n        if (isNumber(arg) || isBigNumber(arg)) {\n          if (i !== len - 1) {\n            throw new Error('Dimension must be specified as last argument');\n          }\n\n          // last argument contains the dimension on which to concatenate\n          prevDim = dim;\n          dim = arg.valueOf(); // change BigNumber to number\n\n          if (!isInteger(dim)) {\n            throw new TypeError('Integer number expected for dimension');\n          }\n          if (dim < 0 || i > 0 && dim > prevDim) {\n            // TODO: would be more clear when throwing a DimensionError here\n            throw new IndexError(dim, prevDim + 1);\n          }\n        } else {\n          // this is a matrix or array\n          var m = clone(arg).valueOf();\n          var size = arraySize(m);\n          matrices[i] = m;\n          prevDim = dim;\n          dim = size.length - 1;\n\n          // verify whether each of the matrices has the same number of dimensions\n          if (i > 0 && dim !== prevDim) {\n            throw new DimensionError(prevDim + 1, dim + 1);\n          }\n        }\n      }\n      if (matrices.length === 0) {\n        throw new SyntaxError('At least one matrix expected');\n      }\n      var res = matrices.shift();\n      while (matrices.length) {\n        res = _concat(res, matrices.shift(), dim);\n      }\n      return asMatrix ? matrix(res) : res;\n    },\n    '...string': function string(args) {\n      return args.join('');\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { validateIndex } from '../../utils/array.js';\nvar name = 'column';\nvar dependencies = ['typed', 'Index', 'matrix', 'range'];\nexport var createColumn = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Index,\n    matrix,\n    range\n  } = _ref;\n  /**\n   * Return a column from a Matrix.\n   *\n   * Syntax:\n   *\n   *     math.column(value, index)\n   *\n   * Example:\n   *\n   *     // get a column\n   *     const d = [[1, 2], [3, 4]]\n   *     math.column(d, 1) // returns [[2], [4]]\n   *\n   * See also:\n   *\n   *     row\n   *\n   * @param {Array | Matrix } value   An array or matrix\n   * @param {number} column           The index of the column\n   * @return {Array | Matrix}         The retrieved column\n   */\n  return typed(name, {\n    'Matrix, number': _column,\n    'Array, number': function ArrayNumber(value, column) {\n      return _column(matrix(clone(value)), column).valueOf();\n    }\n  });\n\n  /**\n   * Retrieve a column of a matrix\n   * @param {Matrix } value  A matrix\n   * @param {number} column  The index of the column\n   * @return {Matrix}        The retrieved column\n   */\n  function _column(value, column) {\n    // check dimensions\n    if (value.size().length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    }\n    validateIndex(column, value.size()[1]);\n    var rowRange = range(0, value.size()[0]);\n    var index = new Index(rowRange, column);\n    var result = value.subset(index);\n    return isMatrix(result) ? result : matrix([[result]]);\n  }\n});","import { isMatrix } from '../../utils/is.js';\nimport { arraySize } from '../../utils/array.js';\nimport { isInteger } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'diag';\nvar dependencies = ['typed', 'matrix', 'DenseMatrix', 'SparseMatrix'];\nexport var createDiag = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\n  /**\n   * Create a diagonal matrix or retrieve the diagonal of a matrix\n   *\n   * When `x` is a vector, a matrix with vector `x` on the diagonal will be returned.\n   * When `x` is a two dimensional matrix, the matrixes `k`th diagonal will be returned as vector.\n   * When k is positive, the values are placed on the super diagonal.\n   * When k is negative, the values are placed on the sub diagonal.\n   *\n   * Syntax:\n   *\n   *     math.diag(X)\n   *     math.diag(X, format)\n   *     math.diag(X, k)\n   *     math.diag(X, k, format)\n   *\n   * Examples:\n   *\n   *     // create a diagonal matrix\n   *     math.diag([1, 2, 3])      // returns [[1, 0, 0], [0, 2, 0], [0, 0, 3]]\n   *     math.diag([1, 2, 3], 1)   // returns [[0, 1, 0, 0], [0, 0, 2, 0], [0, 0, 0, 3]]\n   *     math.diag([1, 2, 3], -1)  // returns [[0, 0, 0], [1, 0, 0], [0, 2, 0], [0, 0, 3]]\n   *\n   *    // retrieve the diagonal from a matrix\n   *    const a = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]\n   *    math.diag(a)   // returns [1, 5, 9]\n   *\n   * See also:\n   *\n   *     ones, zeros, identity\n   *\n   * @param {Matrix | Array} x          A two dimensional matrix or a vector\n   * @param {number | BigNumber} [k=0]  The diagonal where the vector will be filled\n   *                                    in or retrieved.\n   * @param {string} [format='dense']   The matrix storage format.\n   *\n   * @returns {Matrix | Array} Diagonal matrix from input vector, or diagonal from input matrix.\n   */\n  return typed(name, {\n    // FIXME: simplify this huge amount of signatures as soon as typed-function supports optional arguments\n\n    Array: function Array(x) {\n      return _diag(x, 0, arraySize(x), null);\n    },\n    'Array, number': function ArrayNumber(x, k) {\n      return _diag(x, k, arraySize(x), null);\n    },\n    'Array, BigNumber': function ArrayBigNumber(x, k) {\n      return _diag(x, k.toNumber(), arraySize(x), null);\n    },\n    'Array, string': function ArrayString(x, format) {\n      return _diag(x, 0, arraySize(x), format);\n    },\n    'Array, number, string': function ArrayNumberString(x, k, format) {\n      return _diag(x, k, arraySize(x), format);\n    },\n    'Array, BigNumber, string': function ArrayBigNumberString(x, k, format) {\n      return _diag(x, k.toNumber(), arraySize(x), format);\n    },\n    Matrix: function Matrix(x) {\n      return _diag(x, 0, x.size(), x.storage());\n    },\n    'Matrix, number': function MatrixNumber(x, k) {\n      return _diag(x, k, x.size(), x.storage());\n    },\n    'Matrix, BigNumber': function MatrixBigNumber(x, k) {\n      return _diag(x, k.toNumber(), x.size(), x.storage());\n    },\n    'Matrix, string': function MatrixString(x, format) {\n      return _diag(x, 0, x.size(), format);\n    },\n    'Matrix, number, string': function MatrixNumberString(x, k, format) {\n      return _diag(x, k, x.size(), format);\n    },\n    'Matrix, BigNumber, string': function MatrixBigNumberString(x, k, format) {\n      return _diag(x, k.toNumber(), x.size(), format);\n    }\n  });\n\n  /**\n   * Creeate diagonal matrix from a vector or vice versa\n   * @param {Array | Matrix} x\n   * @param {number} k\n   * @param {string} format Storage format for matrix. If null,\n   *                          an Array is returned\n   * @returns {Array | Matrix}\n   * @private\n   */\n  function _diag(x, k, size, format) {\n    if (!isInteger(k)) {\n      throw new TypeError('Second parameter in function diag must be an integer');\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // check dimensions\n    switch (size.length) {\n      case 1:\n        return _createDiagonalMatrix(x, k, format, size[0], kSub, kSuper);\n      case 2:\n        return _getDiagonal(x, k, format, size, kSub, kSuper);\n    }\n    throw new RangeError('Matrix for function diag must be 2 dimensional');\n  }\n  function _createDiagonalMatrix(x, k, format, l, kSub, kSuper) {\n    // matrix size\n    var ms = [l + kSub, l + kSuper];\n    if (format && format !== 'sparse' && format !== 'dense') {\n      throw new TypeError(\"Unknown matrix type \".concat(format, \"\\\"\"));\n    }\n\n    // create diagonal matrix\n    var m = format === 'sparse' ? SparseMatrix.diagonal(ms, x, k) : DenseMatrix.diagonal(ms, x, k);\n    // check we need to return a matrix\n    return format !== null ? m : m.valueOf();\n  }\n  function _getDiagonal(x, k, format, s, kSub, kSuper) {\n    // check x is a Matrix\n    if (isMatrix(x)) {\n      // get diagonal matrix\n      var dm = x.diagonal(k);\n      // check we need to return a matrix\n      if (format !== null) {\n        // check we need to change matrix format\n        if (format !== dm.storage()) {\n          return matrix(dm, format);\n        }\n        return dm;\n      }\n      return dm.valueOf();\n    }\n    // vector size\n    var n = Math.min(s[0] - kSub, s[1] - kSuper);\n    // diagonal values\n    var vector = [];\n    // loop diagonal\n    for (var i = 0; i < n; i++) {\n      vector[i] = x[i + kSub][i + kSuper];\n    }\n    // check we need to return a matrix\n    return format !== null ? matrix(vector) : vector;\n  }\n});","import { flatten as flattenArray } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'flatten';\nvar dependencies = ['typed', 'matrix'];\nexport var createFlatten = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n  /**\n   * Flatten a multidimensional matrix into a single dimensional matrix.\n   * A new matrix is returned, the original matrix is left untouched.\n   *\n   * Syntax:\n   *\n   *    math.flatten(x)\n   *\n   * Examples:\n   *\n   *    math.flatten([[1,2], [3,4]])   // returns [1, 2, 3, 4]\n   *\n   * See also:\n   *\n   *    concat, resize, size, squeeze\n   *\n   * @param {Matrix | Array} x   Matrix to be flattened\n   * @return {Matrix | Array} Returns the flattened matrix\n   */\n  return typed(name, {\n    Array: function Array(x) {\n      return flattenArray(x);\n    },\n    Matrix: function Matrix(x) {\n      var flat = flattenArray(x.toArray());\n      // TODO: return the same matrix type as x (Dense or Sparse Matrix)\n      return matrix(flat);\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { getArrayDataType } from '../../utils/array.js';\nimport { typeOf } from '../../utils/is.js';\nvar name = 'getMatrixDataType';\nvar dependencies = ['typed'];\nexport var createGetMatrixDataType = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Find the data type of all elements in a matrix or array,\n   * for example 'number' if all items are a number and 'Complex' if all values\n   * are complex numbers.\n   * If a matrix contains more than one data type, it will return 'mixed'.\n   *\n   * Syntax:\n   *\n   *    math.getMatrixDataType(x)\n   *\n   * Examples:\n   *\n   *    const x = [ [1, 2, 3], [4, 5, 6] ]\n   *    const mixedX = [ [1, true], [2, 3] ]\n   *    const fractionX = [ [math.fraction(1, 3)], [math.fraction(1, 3)] ]\n   *    const unitX = [ [math.unit('5cm')], [math.unit('5cm')] ]\n   *    const bigNumberX = [ [math.bignumber(1)], [math.bignumber(0)] ]\n   *    const sparse = math.sparse(x)\n   *    const dense = math.matrix(x)\n   *    math.getMatrixDataType(x)   // returns 'number'\n   *    math.getMatrixDataType(sparse)   // returns 'number'\n   *    math.getMatrixDataType(dense)   // returns 'number'\n   *    math.getMatrixDataType(mixedX) // returns 'mixed'\n   *    math.getMatrixDataType(fractionX) // returns 'Fraction'\n   *    math.getMatrixDataType(unitX) // returns 'Unit'\n   *    math.getMatrixDataType(bigNumberX) // return 'BigNumber'\n   *\n   * See also:\n   *  SparseMatrix, DenseMatrix\n   *\n   * @param {...Matrix | Array} x   The Matrix with values.\n   *\n   * @return {string} A string representation of the matrix type\n   */\n  return typed(name, {\n    Array: function Array(x) {\n      return getArrayDataType(x, typeOf);\n    },\n    Matrix: function Matrix(x) {\n      return x.getDataType();\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   * 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  function _identityVector(size, format) {\n    switch (size.length) {\n      case 0:\n        return format ? matrix(format) : [];\n      case 1:\n        return _identity(size[0], size[0], format);\n      case 2:\n        return _identity(size[0], size[1], format);\n      default:\n        throw new Error('Vector containing two values expected');\n    }\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  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    if (!isInteger(rows) || rows < 1) {\n      throw new Error('Parameters in function identity must be positive integers');\n    }\n    if (!isInteger(cols) || cols < 1) {\n      throw new Error('Parameters in function identity must be positive integers');\n    }\n    var one = Big ? new BigNumber(1) : 1;\n    var defaultValue = Big ? new Big(0) : 0;\n    var size = [rows, cols];\n\n    // check we need to return a matrix\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      if (format === 'dense') {\n        return DenseMatrix.diagonal(size, one, 0, defaultValue);\n      }\n      throw new TypeError(\"Unknown matrix type \\\"\".concat(format, \"\\\"\"));\n    }\n\n    // create and resize array\n    var res = resize([], size, defaultValue);\n    // fill in ones on the diagonal\n    var minimum = rows < cols ? rows : cols;\n    // fill diagonal\n    for (var d = 0; d < minimum; d++) {\n      res[d][d] = one;\n    }\n    return res;\n  }\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 { factory } from '../../utils/factory.js';\nimport { noBignumber, noMatrix } from '../../utils/noop.js';\nvar name = 'range';\nvar dependencies = ['typed', 'config', '?matrix', '?bignumber', 'smaller', 'smallerEq', 'larger', 'largerEq', 'add', 'isPositive'];\nexport var createRange = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    bignumber,\n    smaller,\n    smallerEq,\n    larger,\n    largerEq,\n    add,\n    isPositive\n  } = _ref;\n  /**\n   * Create an array from a range.\n   * By default, the range end is excluded. This can be customized by providing\n   * an extra parameter `includeEnd`.\n   *\n   * Syntax:\n   *\n   *     math.range(str [, includeEnd])               // Create a range from a string,\n   *                                                  // where the string contains the\n   *                                                  // start, optional step, and end,\n   *                                                  // separated by a colon.\n   *     math.range(start, end [, includeEnd])        // Create a range with start and\n   *                                                  // end and a step size of 1.\n   *     math.range(start, end, step [, includeEnd])  // Create a range with start, step,\n   *                                                  // and end.\n   *\n   * Where:\n   *\n   * - `str: string`\n   *   A string 'start:end' or 'start:step:end'\n   * - `start: {number | BigNumber | Unit}`\n   *   Start of the range\n   * - `end: number | BigNumber | Unit`\n   *   End of the range, excluded by default, included when parameter includeEnd=true\n   * - `step: number | BigNumber | Unit`\n   *   Step size. Default value is 1.\n   * - `includeEnd: boolean`\n   *   Option to specify whether to include the end or not. False by default.\n   *\n   * Examples:\n   *\n   *     math.range(2, 6)        // [2, 3, 4, 5]\n   *     math.range(2, -3, -1)   // [2, 1, 0, -1, -2]\n   *     math.range('2:1:6')     // [2, 3, 4, 5]\n   *     math.range(2, 6, true)  // [2, 3, 4, 5, 6]\n   *     math.range(math.unit(2, 'm'), math.unit(-3, 'm'), math.unit(-1, 'm')) // [2 m, 1 m, 0 m , -1 m, -2 m]\n   *\n   * See also:\n   *\n   *     ones, zeros, size, subset\n   *\n   * @param {*} args   Parameters describing the ranges `start`, `end`, and optional `step`.\n   * @return {Array | Matrix} range\n   */\n  return typed(name, {\n    // TODO: simplify signatures when typed-function supports default values and optional arguments\n\n    // TODO: a number or boolean should not be converted to string here\n    string: _strRange,\n    'string, boolean': _strRange,\n    'number, number': function numberNumber(start, end) {\n      return _out(_range(start, end, 1, false));\n    },\n    'number, number, number': function numberNumberNumber(start, end, step) {\n      return _out(_range(start, end, step, false));\n    },\n    'number, number, boolean': function numberNumberBoolean(start, end, includeEnd) {\n      return _out(_range(start, end, 1, includeEnd));\n    },\n    'number, number, number, boolean': function numberNumberNumberBoolean(start, end, step, includeEnd) {\n      return _out(_range(start, end, step, includeEnd));\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(start, end) {\n      var BigNumber = start.constructor;\n      return _out(_range(start, end, new BigNumber(1), false));\n    },\n    'BigNumber, BigNumber, BigNumber': function BigNumberBigNumberBigNumber(start, end, step) {\n      return _out(_range(start, end, step, false));\n    },\n    'BigNumber, BigNumber, boolean': function BigNumberBigNumberBoolean(start, end, includeEnd) {\n      var BigNumber = start.constructor;\n      return _out(_range(start, end, new BigNumber(1), includeEnd));\n    },\n    'BigNumber, BigNumber, BigNumber, boolean': function BigNumberBigNumberBigNumberBoolean(start, end, step, includeEnd) {\n      return _out(_range(start, end, step, includeEnd));\n    },\n    'Unit, Unit, Unit': function UnitUnitUnit(start, end, step) {\n      return _out(_range(start, end, step, false));\n    },\n    'Unit, Unit, Unit, boolean': function UnitUnitUnitBoolean(start, end, step, includeEnd) {\n      return _out(_range(start, end, step, includeEnd));\n    }\n  });\n  function _out(arr) {\n    if (config.matrix === 'Matrix') {\n      return matrix ? matrix(arr) : noMatrix();\n    }\n    return arr;\n  }\n  function _strRange(str, includeEnd) {\n    var r = _parse(str);\n    if (!r) {\n      throw new SyntaxError('String \"' + str + '\" is no valid range');\n    }\n    if (config.number === 'BigNumber') {\n      if (bignumber === undefined) {\n        noBignumber();\n      }\n      return _out(_range(bignumber(r.start), bignumber(r.end), bignumber(r.step)), includeEnd);\n    } else {\n      return _out(_range(r.start, r.end, r.step, includeEnd));\n    }\n  }\n\n  /**\n   * Create a range with numbers or BigNumbers\n   * @param {number | BigNumber | Unit} start\n   * @param {number | BigNumber | Unit} end\n   * @param {number | BigNumber | Unit} step\n   * @param {boolean} includeEnd\n   * @returns {Array} range\n   * @private\n   */\n  function _range(start, end, step, includeEnd) {\n    var array = [];\n    var ongoing = isPositive(step) ? includeEnd ? smallerEq : smaller : includeEnd ? largerEq : larger;\n    var x = start;\n    while (ongoing(x, end)) {\n      array.push(x);\n      x = add(x, step);\n    }\n    return array;\n  }\n\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   * @param {string} str\n   * @return {{start: number, end: number, step: number} | null} range Object containing properties start, end, step\n   * @private\n   */\n  function _parse(str) {\n    var args = str.split(':');\n\n    // number\n    var nums = args.map(function (arg) {\n      // use Number and not parseFloat as Number returns NaN on invalid garbage in the string\n      return Number(arg);\n    });\n    var invalid = nums.some(function (num) {\n      return isNaN(num);\n    });\n    if (invalid) {\n      return null;\n    }\n    switch (nums.length) {\n      case 2:\n        return {\n          start: nums[0],\n          end: nums[1],\n          step: 1\n        };\n      case 3:\n        return {\n          start: nums[0],\n          end: nums[2],\n          step: nums[1]\n        };\n      default:\n        return null;\n    }\n  }\n});","import { reshape as arrayReshape } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'reshape';\nvar dependencies = ['typed', 'isInteger', 'matrix'];\nexport var createReshape = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    isInteger\n  } = _ref;\n  /**\n   * Reshape a multi dimensional array to fit the specified dimensions\n   *\n   * Syntax:\n   *\n   *     math.reshape(x, sizes)\n   *\n   * Examples:\n   *\n   *     math.reshape([1, 2, 3, 4, 5, 6], [2, 3])\n   *     // returns Array  [[1, 2, 3], [4, 5, 6]]\n   *\n   *     math.reshape([[1, 2], [3, 4]], [1, 4])\n   *     // returns Array  [[1, 2, 3, 4]]\n   *\n   *     math.reshape([[1, 2], [3, 4]], [4])\n   *     // returns Array [1, 2, 3, 4]\n   *\n   *     const x = math.matrix([1, 2, 3, 4, 5, 6, 7, 8])\n   *     math.reshape(x, [2, 2, 2])\n   *     // returns Matrix [[[1, 2], [3, 4]], [[5, 6], [7, 8]]]\n   *\n   *    math.reshape([1, 2, 3, 4], [-1, 2])\n   *    // returns Matrix [[1, 2], [3, 4]]\n   *\n   * See also:\n   *\n   *     size, squeeze, resize\n   *\n   * @param {Array | Matrix | *} x  Matrix to be reshaped\n   * @param {number[]} sizes        One dimensional array with integral sizes for\n   *                                each dimension. One -1 is allowed as wildcard,\n   *                                which calculates this dimension automatically.\n   *\n   * @return {* | Array | Matrix}   A reshaped clone of matrix `x`\n   *\n   * @throws {TypeError}            If `sizes` does not contain solely integers\n   * @throws {DimensionError}       If the product of the new dimension sizes does\n   *                                not equal that of the old ones\n   */\n  return typed(name, {\n    'Matrix, Array': function MatrixArray(x, sizes) {\n      return x.reshape(sizes, true);\n    },\n    'Array, Array': function ArrayArray(x, sizes) {\n      sizes.forEach(function (size) {\n        if (!isInteger(size)) {\n          throw new TypeError('Invalid size for dimension: ' + size);\n        }\n      });\n      return arrayReshape(x, sizes);\n    }\n  });\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   * 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});","import { clone } from '../../utils/object.js';\nimport { format } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'transpose';\nvar dependencies = ['typed', 'matrix'];\nexport var createTranspose = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n  /**\n   * Transpose a matrix. All values of the matrix are reflected over its\n   * main diagonal. Only applicable to two dimensional matrices containing\n   * a vector (i.e. having size `[1,n]` or `[n,1]`). One dimensional\n   * vectors and scalars return the input unchanged.\n   *\n   * Syntax:\n   *\n   *     math.transpose(x)\n   *\n   * Examples:\n   *\n   *     const A = [[1, 2, 3], [4, 5, 6]]\n   *     math.transpose(A)               // returns [[1, 4], [2, 5], [3, 6]]\n   *\n   * See also:\n   *\n   *     diag, inv, subset, squeeze\n   *\n   * @param {Array | Matrix} x  Matrix to be transposed\n   * @return {Array | Matrix}   The transposed matrix\n   */\n  return typed(name, {\n    Array: x => transposeMatrix(matrix(x)).valueOf(),\n    Matrix: transposeMatrix,\n    any: clone // scalars\n  });\n  function transposeMatrix(x) {\n    // matrix size\n    var size = x.size();\n\n    // result\n    var c;\n\n    // process dimensions\n    switch (size.length) {\n      case 1:\n        // vector\n        c = x.clone();\n        break;\n      case 2:\n        {\n          // rows and columns\n          var rows = size[0];\n          var columns = size[1];\n\n          // check columns\n          if (columns === 0) {\n            // throw exception\n            throw new RangeError('Cannot transpose a 2D matrix with no columns (size: ' + format(size) + ')');\n          }\n\n          // process storage format\n          switch (x.storage()) {\n            case 'dense':\n              c = _denseTranspose(x, rows, columns);\n              break;\n            case 'sparse':\n              c = _sparseTranspose(x, rows, columns);\n              break;\n          }\n        }\n        break;\n      default:\n        // multi dimensional\n        throw new RangeError('Matrix must be a vector or two dimensional (size: ' + format(size) + ')');\n    }\n    return c;\n  }\n  function _denseTranspose(m, rows, columns) {\n    // matrix array\n    var data = m._data;\n    // transposed matrix data\n    var transposed = [];\n    var transposedRow;\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // initialize row\n      transposedRow = transposed[j] = [];\n      // loop rows\n      for (var i = 0; i < rows; i++) {\n        // set data\n        transposedRow[i] = clone(data[i][j]);\n      }\n    }\n    // return matrix\n    return m.createDenseMatrix({\n      data: transposed,\n      size: [columns, rows],\n      datatype: m._datatype\n    });\n  }\n  function _sparseTranspose(m, rows, columns) {\n    // matrix arrays\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr;\n    // result matrices\n    var cvalues = values ? [] : undefined;\n    var cindex = [];\n    var cptr = [];\n    // row counts\n    var w = [];\n    for (var x = 0; x < rows; x++) {\n      w[x] = 0;\n    }\n    // vars\n    var p, l, j;\n    // loop values in matrix\n    for (p = 0, l = index.length; p < l; p++) {\n      // number of values in row\n      w[index[p]]++;\n    }\n    // cumulative sum\n    var sum = 0;\n    // initialize cptr with the cummulative sum of row counts\n    for (var i = 0; i < rows; i++) {\n      // update cptr\n      cptr.push(sum);\n      // update sum\n      sum += w[i];\n      // update w\n      w[i] = cptr[i];\n    }\n    // update cptr\n    cptr.push(sum);\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // values & index in column\n      for (var k0 = ptr[j], k1 = ptr[j + 1], k = k0; k < k1; k++) {\n        // C values & index\n        var q = w[index[k]]++;\n        // C[j, i] = A[i, j]\n        cindex[q] = j;\n        // check we need to process values (pattern matrix)\n        if (values) {\n          cvalues[q] = clone(values[k]);\n        }\n      }\n    }\n    // return matrix\n    return m.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [columns, rows],\n      datatype: m._datatype\n    });\n  }\n});","import { factory } from '../../utils/factory.js';\nvar name = 'ctranspose';\nvar dependencies = ['typed', 'transpose', 'conj'];\nexport var createCtranspose = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    transpose,\n    conj\n  } = _ref;\n  /**\n   * Transpose and complex conjugate a matrix. All values of the matrix are\n   * reflected over its main diagonal and then the complex conjugate is\n   * taken. This is equivalent to complex conjugation for scalars and\n   * vectors.\n   *\n   * Syntax:\n   *\n   *     math.ctranspose(x)\n   *\n   * Examples:\n   *\n   *     const A = [[1, 2, 3], [4, 5, math.complex(6,7)]]\n   *     math.ctranspose(A)               // returns [[1, 4], [2, 5], [3, {re:6,im:7}]]\n   *\n   * See also:\n   *\n   *     transpose, diag, inv, subset, squeeze\n   *\n   * @param {Array | Matrix} x  Matrix to be ctransposed\n   * @return {Array | Matrix}   The ctransposed matrix\n   */\n  return typed(name, {\n    any: function any(x) {\n      return conj(transpose(x));\n    }\n  });\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   * 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()                   // returns []\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|BigNumber) | 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      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  /**\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  function _zeros(size, format) {\n    var hasBigNumbers = _normalize(size);\n    var defaultValue = hasBigNumbers ? new BigNumber(0) : 0;\n    _validate(size);\n    if (format) {\n      // return a matrix\n      var m = matrix(format);\n      if (size.length > 0) {\n        return m.resize(size, defaultValue);\n      }\n      return m;\n    } else {\n      // return an Array\n      var arr = [];\n      if (size.length > 0) {\n        return resize(arr, size, defaultValue);\n      }\n      return arr;\n    }\n  }\n\n  // replace BigNumbers with numbers, returns true if size contained BigNumbers\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  }\n\n  // validate arguments\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});\n\n// TODO: zeros contains almost the same code as ones. Reuse this?","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  };\n\n  // Load the conversion functions for each output type\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  /**\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 4\n   *    math.numeric('4', 'number')                 // returns 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 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  return function numeric(value) {\n    var outputType = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'number';\n    var check = arguments.length > 2 ? arguments[2] : undefined;\n    if (check !== undefined) {\n      throw new SyntaxError('numeric() takes one or two arguments');\n    }\n    var inputType = typeOf(value);\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    if (!(outputType in validOutputTypes)) {\n      throw new TypeError('Cannot convert ' + value + ' to type \"' + outputType + '\"; valid output types are ' + Object.keys(validOutputTypes).join(', '));\n    }\n    if (outputType === inputType) {\n      return value;\n    } else {\n      return validOutputTypes[outputType](value);\n    }\n  };\n});","import { factory } from '../../utils/factory.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   * 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 | Complex | Fraction | BigNumber | Unit': (x, y) => x.divide(y),\n    'number | Fraction | Complex | BigNumber, Unit': (x, y) => y.divideInto(x)\n  });\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', 'inv', 'fraction', 'number', 'Complex'];\nexport var createPow = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    identity,\n    multiply,\n    matrix,\n    inv,\n    number,\n    fraction,\n    Complex\n  } = _ref;\n  /**\n   * Calculates the power of x to y, `x ^ y`.\n   *\n   * Matrix exponentiation is supported for square matrices `x` and integers `y`:\n   * when `y` is nonnegative, `x` may be any square matrix; and when `y` is\n   * negative, `x` must be invertible, and then this function returns\n   * inv(x)^(-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   *    const c = [[1, 2], [4, 3]]\n   *    math.pow(c, -1)               // returns Array [[-0.6, 0.4], [0.8, -0.2]]\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      if (result != null) {\n        return result;\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  /**\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  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        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) {\n        // fraction() throws an error if y is Infinity, etc.\n      }\n\n      // Unable to express y as a fraction, so continue on\n    }\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    if (config.predictable && (x < -1 && y === Infinity || x > -1 && x < 0 && y === -Infinity)) {\n      return NaN;\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\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      return new Complex(x, 0).pow(y, 0);\n    }\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 integer value (positive if `x` is not invertible)\n   * @returns {Array}\n   * @private\n   */\n  function _powArray(x, y) {\n    if (!isInteger(y)) {\n      throw new TypeError('For A^b, b must be an integer (value is ' + y + ')');\n    }\n    // verify that A is a 2 dimensional square matrix\n    var s = size(x);\n    if (s.length !== 2) {\n      throw new Error('For A^b, A must be 2 dimensional (A has ' + s.length + ' dimensions)');\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    if (y < 0) {\n      try {\n        return _powArray(inv(x), -y);\n      } catch (error) {\n        if (error.message === 'Cannot calculate inverse, determinant is zero') {\n          throw new TypeError('For A^b, when A is not invertible, b must be a positive integer (value is ' + y + ')');\n        }\n        throw error;\n      }\n    }\n    var res = identity(s[0]).valueOf();\n    var px = x;\n    while (y >= 1) {\n      if ((y & 1) === 1) {\n        res = multiply(px, res);\n      }\n      y >>= 1;\n      px = multiply(px, px);\n    }\n    return res;\n  }\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  function _powMatrix(x, y) {\n    return matrix(_powArray(x.valueOf(), y));\n  }\n});","import { isArray, isMatrix, isDenseMatrix, isSparseMatrix } from '../../../../utils/is.js';\nimport { arraySize } from '../../../../utils/array.js';\nimport { format } from '../../../../utils/string.js';\nexport function createSolveValidation(_ref) {\n  var {\n    DenseMatrix\n  } = _ref;\n  /**\n   * Validates matrix and column vector b for backward/forward substitution algorithms.\n   *\n   * @param {Matrix} m            An N x N matrix\n   * @param {Array | Matrix} b    A column vector\n   * @param {Boolean} copy        Return a copy of vector b\n   *\n   * @return {DenseMatrix}        Dense column vector b\n   */\n  return function solveValidation(m, b, copy) {\n    var mSize = m.size();\n    if (mSize.length !== 2) {\n      throw new RangeError('Matrix must be two dimensional (size: ' + format(mSize) + ')');\n    }\n    var rows = mSize[0];\n    var columns = mSize[1];\n    if (rows !== columns) {\n      throw new RangeError('Matrix must be square (size: ' + format(mSize) + ')');\n    }\n    var data = [];\n    if (isMatrix(b)) {\n      var bSize = b.size();\n      var bdata = b._data;\n\n      // 1-dim vector\n      if (bSize.length === 1) {\n        if (bSize[0] !== rows) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n        }\n        for (var i = 0; i < rows; i++) {\n          data[i] = [bdata[i]];\n        }\n        return new DenseMatrix({\n          data,\n          size: [rows, 1],\n          datatype: b._datatype\n        });\n      }\n\n      // 2-dim column\n      if (bSize.length === 2) {\n        if (bSize[0] !== rows || bSize[1] !== 1) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n        }\n        if (isDenseMatrix(b)) {\n          if (copy) {\n            data = [];\n            for (var _i = 0; _i < rows; _i++) {\n              data[_i] = [bdata[_i][0]];\n            }\n            return new DenseMatrix({\n              data,\n              size: [rows, 1],\n              datatype: b._datatype\n            });\n          }\n          return b;\n        }\n        if (isSparseMatrix(b)) {\n          for (var _i2 = 0; _i2 < rows; _i2++) {\n            data[_i2] = [0];\n          }\n          var values = b._values;\n          var index = b._index;\n          var ptr = b._ptr;\n          for (var k1 = ptr[1], k = ptr[0]; k < k1; k++) {\n            var _i3 = index[k];\n            data[_i3][0] = values[k];\n          }\n          return new DenseMatrix({\n            data,\n            size: [rows, 1],\n            datatype: b._datatype\n          });\n        }\n      }\n      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.');\n    }\n    if (isArray(b)) {\n      var bsize = arraySize(b);\n      if (bsize.length === 1) {\n        if (bsize[0] !== rows) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n        }\n        for (var _i4 = 0; _i4 < rows; _i4++) {\n          data[_i4] = [b[_i4]];\n        }\n        return new DenseMatrix({\n          data,\n          size: [rows, 1]\n        });\n      }\n      if (bsize.length === 2) {\n        if (bsize[0] !== rows || bsize[1] !== 1) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n        }\n        for (var _i5 = 0; _i5 < rows; _i5++) {\n          data[_i5] = [b[_i5][0]];\n        }\n        return new DenseMatrix({\n          data,\n          size: [rows, 1]\n        });\n      }\n      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.');\n    }\n  };\n}","import { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nvar name = 'usolve';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'equalScalar', 'DenseMatrix'];\nexport var createUsolve = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    multiplyScalar,\n    subtractScalar,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    DenseMatrix\n  });\n\n  /**\n   * Finds one solution of a linear equation system by backward substitution. Matrix must be an upper triangular matrix. Throws an error if there's no solution.\n   *\n   * `U * x = b`\n   *\n   * Syntax:\n   *\n   *    math.usolve(U, b)\n   *\n   * Examples:\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = usolve(a, b)  // [[8], [9]]\n   *\n   * See also:\n   *\n   *    usolveAll, lup, slu, usolve, lusolve\n   *\n   * @param {Matrix, Array} U       A N x N matrix or array (U)\n   * @param {Matrix, Array} b       A column vector with the b values\n   *\n   * @return {DenseMatrix | Array}  A column vector with the linear system solution (x)\n   */\n  return typed(name, {\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {\n      return _sparseBackwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {\n      return _denseBackwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      var m = matrix(a);\n      var r = _denseBackwardSubstitution(m, b);\n      return r.valueOf();\n    }\n  });\n  function _denseBackwardSubstitution(m, b) {\n    // make b into a column vector\n    b = solveValidation(m, b, true);\n    var bdata = b._data;\n    var rows = m._size[0];\n    var columns = m._size[1];\n\n    // result\n    var x = [];\n    var mdata = m._data;\n    // loop columns backwards\n    for (var j = columns - 1; j >= 0; j--) {\n      // b[j]\n      var bj = bdata[j][0] || 0;\n      // x[j]\n      var xj = void 0;\n      if (!equalScalar(bj, 0)) {\n        // value at [j, j]\n        var vjj = mdata[j][j];\n        if (equalScalar(vjj, 0)) {\n          // system cannot be solved\n          throw new Error('Linear system cannot be solved since matrix is singular');\n        }\n        xj = divideScalar(bj, vjj);\n\n        // loop rows\n        for (var i = j - 1; i >= 0; i--) {\n          // update copy of b\n          bdata[i] = [subtractScalar(bdata[i][0] || 0, multiplyScalar(xj, mdata[i][j]))];\n        }\n      } else {\n        // zero value at j\n        xj = 0;\n      }\n      // update x\n      x[j] = [xj];\n    }\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    });\n  }\n  function _sparseBackwardSubstitution(m, b) {\n    // make b into a column vector\n    b = solveValidation(m, b, true);\n    var bdata = b._data;\n    var rows = m._size[0];\n    var columns = m._size[1];\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr;\n\n    // result\n    var x = [];\n\n    // loop columns backwards\n    for (var j = columns - 1; j >= 0; j--) {\n      var bj = bdata[j][0] || 0;\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n\n        var vjj = 0;\n\n        // upper triangular matrix values & index (column j)\n        var jValues = [];\n        var jIndices = [];\n\n        // first & last indeces in column\n        var firstIndex = ptr[j];\n        var lastIndex = ptr[j + 1];\n\n        // values in column, find value at [j, j], loop backwards\n        for (var k = lastIndex - 1; k >= firstIndex; k--) {\n          var i = index[k];\n\n          // check row (rows are not sorted!)\n          if (i === j) {\n            vjj = values[k];\n          } else if (i < j) {\n            // store upper triangular\n            jValues.push(values[k]);\n            jIndices.push(i);\n          }\n        }\n\n        // at this point we must have a value in vjj\n        if (equalScalar(vjj, 0)) {\n          throw new Error('Linear system cannot be solved since matrix is singular');\n        }\n        var xj = divideScalar(bj, vjj);\n        for (var _k = 0, _lastIndex = jIndices.length; _k < _lastIndex; _k++) {\n          var _i = jIndices[_k];\n          bdata[_i] = [subtractScalar(bdata[_i][0], multiplyScalar(xj, jValues[_k]))];\n        }\n        x[j] = [xj];\n      } else {\n        // degenerate row, we can choose any value\n        x[j] = [0];\n      }\n    }\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    });\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nvar name = 'usolveAll';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'equalScalar', 'DenseMatrix'];\nexport var createUsolveAll = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    multiplyScalar,\n    subtractScalar,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    DenseMatrix\n  });\n\n  /**\n   * Finds all solutions of a linear equation system by backward substitution. Matrix must be an upper triangular matrix.\n   *\n   * `U * x = b`\n   *\n   * Syntax:\n   *\n   *    math.usolveAll(U, b)\n   *\n   * Examples:\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = usolveAll(a, b)  // [ [[8], [9]] ]\n   *\n   * See also:\n   *\n   *    usolve, lup, slu, usolve, lusolve\n   *\n   * @param {Matrix, Array} U       A N x N matrix or array (U)\n   * @param {Matrix, Array} b       A column vector with the b values\n   *\n   * @return {DenseMatrix[] | Array[]}  An array of affine-independent column vectors (x) that solve the linear system\n   */\n  return typed(name, {\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {\n      return _sparseBackwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {\n      return _denseBackwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      var m = matrix(a);\n      var R = _denseBackwardSubstitution(m, b);\n      return R.map(r => r.valueOf());\n    }\n  });\n  function _denseBackwardSubstitution(m, b_) {\n    // the algorithm is derived from\n    // https://www.overleaf.com/read/csvgqdxggyjv\n\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];\n    var M = m._data;\n    var rows = m._size[0];\n    var columns = m._size[1];\n\n    // loop columns backwards\n    for (var i = columns - 1; i >= 0; i--) {\n      var L = B.length;\n\n      // loop right-hand sides\n      for (var k = 0; k < L; k++) {\n        var b = B[k];\n        if (!equalScalar(M[i][i], 0)) {\n          // non-singular row\n\n          b[i] = divideScalar(b[i], M[i][i]);\n          for (var j = i - 1; j >= 0; j--) {\n            // b[j] -= b[i] * M[j,i]\n            b[j] = subtractScalar(b[j], multiplyScalar(b[i], M[j][i]));\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\n\n          if (k === 0) {\n            // There is no valid solution\n            return [];\n          } else {\n            // This RHS is invalid but other solutions may still exist\n            B.splice(k, 1);\n            k -= 1;\n            L -= 1;\n          }\n        } else if (k === 0) {\n          // singular row, RHS is zero\n\n          var bNew = [...b];\n          bNew[i] = 1;\n          for (var _j = i - 1; _j >= 0; _j--) {\n            bNew[_j] = subtractScalar(bNew[_j], M[_j][i]);\n          }\n          B.push(bNew);\n        }\n      }\n    }\n    return B.map(x => new DenseMatrix({\n      data: x.map(e => [e]),\n      size: [rows, 1]\n    }));\n  }\n  function _sparseBackwardSubstitution(m, b_) {\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];\n    var rows = m._size[0];\n    var columns = m._size[1];\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr;\n\n    // loop columns backwards\n    for (var i = columns - 1; i >= 0; i--) {\n      var L = B.length;\n\n      // loop right-hand sides\n      for (var k = 0; k < L; k++) {\n        var b = B[k];\n\n        // values & indices (column i)\n        var iValues = [];\n        var iIndices = [];\n\n        // first & last indeces in column\n        var firstIndex = ptr[i];\n        var lastIndex = ptr[i + 1];\n\n        // find the value at [i, i]\n        var Mii = 0;\n        for (var j = lastIndex - 1; j >= firstIndex; j--) {\n          var J = index[j];\n          // check row\n          if (J === i) {\n            Mii = values[j];\n          } else if (J < i) {\n            // store upper triangular\n            iValues.push(values[j]);\n            iIndices.push(J);\n          }\n        }\n        if (!equalScalar(Mii, 0)) {\n          // non-singular row\n\n          b[i] = divideScalar(b[i], Mii);\n\n          // loop upper triangular\n          for (var _j2 = 0, _lastIndex = iIndices.length; _j2 < _lastIndex; _j2++) {\n            var _J = iIndices[_j2];\n            b[_J] = subtractScalar(b[_J], multiplyScalar(b[i], iValues[_j2]));\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\n\n          if (k === 0) {\n            // There is no valid solution\n            return [];\n          } else {\n            // This RHS is invalid but other solutions may still exist\n            B.splice(k, 1);\n            k -= 1;\n            L -= 1;\n          }\n        } else if (k === 0) {\n          // singular row, RHS is zero\n\n          var bNew = [...b];\n          bNew[i] = 1;\n\n          // loop upper triangular\n          for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {\n            var _J2 = iIndices[_j3];\n            bNew[_J2] = subtractScalar(bNew[_J2], iValues[_j3]);\n          }\n          B.push(bNew);\n        }\n      }\n    }\n    return B.map(x => new DenseMatrix({\n      data: x.map(e => [e]),\n      size: [rows, 1]\n    }));\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'equal';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];\nexport var createEqual = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix,\n    concat\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    DenseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\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  return typed(name, createEqualNumber({\n    typed,\n    equalScalar\n  }), matrixAlgorithmSuite({\n    elop: equalScalar,\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\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      if (y === null) {\n        return x === null;\n      }\n      if (x === undefined) {\n        return y === undefined;\n      }\n      if (y === undefined) {\n        return x === undefined;\n      }\n      return equalScalar(x, y);\n    }\n  });\n});","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'smaller';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix', 'concat'];\nexport var createSmaller = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    DenseMatrix,\n    concat\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    DenseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var compareUnits = createCompareUnits({\n    typed\n  });\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  return typed(name, createSmallerNumber({\n    typed,\n    config\n  }), {\n    'boolean, boolean': (x, y) => x < y,\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.lt(y) && !bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': (x, y) => x.compare(y) === -1,\n    'Complex, Complex': function ComplexComplex(x, y) {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    }\n  }, compareUnits, matrixAlgorithmSuite({\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\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 { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'smallerEq';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix', 'concat'];\nexport var createSmallerEq = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    DenseMatrix,\n    concat\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    DenseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var compareUnits = createCompareUnits({\n    typed\n  });\n\n  /**\n   * Test whether value x is smaller or equal to y.\n   *\n   * The function returns true when x is smaller than y or 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.smallerEq(x, y)\n   *\n   * Examples:\n   *\n   *    math.smaller(1 + 2, 3)        // returns false\n   *    math.smallerEq(1 + 2, 3)      // returns true\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, larger, 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 smaller than y, else returns false\n   */\n  return typed(name, createSmallerEqNumber({\n    typed,\n    config\n  }), {\n    'boolean, boolean': (x, y) => x <= y,\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.lte(y) || bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': (x, y) => x.compare(y) !== 1,\n    'Complex, Complex': function ComplexComplex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    }\n  }, compareUnits, matrixAlgorithmSuite({\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexport var createSmallerEqNumber = /* #__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 { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'larger';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix', 'concat'];\nexport var createLarger = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    DenseMatrix,\n    concat\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    DenseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var compareUnits = createCompareUnits({\n    typed\n  });\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  return typed(name, createLargerNumber({\n    typed,\n    config\n  }), {\n    'boolean, boolean': (x, y) => x > y,\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.gt(y) && !bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': (x, y) => x.compare(y) === 1,\n    'Complex, Complex': function ComplexComplex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    }\n  }, compareUnits, matrixAlgorithmSuite({\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\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});","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'largerEq';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix', 'concat'];\nexport var createLargerEq = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    DenseMatrix,\n    concat\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    DenseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var compareUnits = createCompareUnits({\n    typed\n  });\n\n  /**\n   * Test whether value x is larger or equal to y.\n   *\n   * The function returns true when x is larger than y or 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.largerEq(x, y)\n   *\n   * Examples:\n   *\n   *    math.larger(2, 1 + 1)         // returns false\n   *    math.largerEq(2, 1 + 1)       // returns true\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, smallerEq, larger, 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 or equal to y, else returns false\n   */\n  return typed(name, createLargerEqNumber({\n    typed,\n    config\n  }), {\n    'boolean, boolean': (x, y) => x >= y,\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.gte(y) || bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': (x, y) => x.compare(y) !== -1,\n    'Complex, Complex': function ComplexComplex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    }\n  }, compareUnits, matrixAlgorithmSuite({\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexport var createLargerEqNumber = /* #__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 { isArray, isMatrix, isString, typeOf } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ImmutableDenseMatrix';\nvar dependencies = ['smaller', 'DenseMatrix'];\nexport var createImmutableDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    smaller,\n    DenseMatrix\n  } = _ref;\n  function ImmutableDenseMatrix(data, datatype) {\n    if (!(this instanceof ImmutableDenseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n    if (isMatrix(data) || isArray(data)) {\n      // use DenseMatrix implementation\n      var matrix = new DenseMatrix(data, datatype);\n      // internal structures\n      this._data = matrix._data;\n      this._size = matrix._size;\n      this._datatype = matrix._datatype;\n      this._min = null;\n      this._max = null;\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;\n      this._datatype = data.datatype;\n      this._min = typeof data.min !== 'undefined' ? data.min : null;\n      this._max = typeof data.max !== 'undefined' ? data.max : null;\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      this._min = null;\n      this._max = null;\n    }\n  }\n  ImmutableDenseMatrix.prototype = new DenseMatrix();\n\n  /**\n   * Attach type information\n   */\n  ImmutableDenseMatrix.prototype.type = 'ImmutableDenseMatrix';\n  ImmutableDenseMatrix.prototype.isImmutableDenseMatrix = true;\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 | ImmutableDenseMatrix | *} [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  ImmutableDenseMatrix.prototype.subset = function (index) {\n    switch (arguments.length) {\n      case 1:\n        {\n          // use base implementation\n          var m = DenseMatrix.prototype.subset.call(this, index);\n          // check result is a matrix\n          if (isMatrix(m)) {\n            // return immutable matrix\n            return new ImmutableDenseMatrix({\n              data: m._data,\n              size: m._size,\n              datatype: m._datatype\n            });\n          }\n          return m;\n        }\n      // intentional fall through\n      case 2:\n      case 3:\n        throw new Error('Cannot invoke set subset on an Immutable Matrix instance');\n      default:\n        throw new SyntaxError('Wrong number of arguments');\n    }\n  };\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 {ImmutableDenseMatrix} self\n   */\n  ImmutableDenseMatrix.prototype.set = function () {\n    throw new Error('Cannot invoke set on an Immutable Matrix instance');\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   * @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  ImmutableDenseMatrix.prototype.resize = function () {\n    throw new Error('Cannot invoke resize on an Immutable Matrix instance');\n  };\n\n  /**\n   * Disallows reshaping in favor of immutability.\n   *\n   * @throws {Error} Operation not allowed\n   */\n  ImmutableDenseMatrix.prototype.reshape = function () {\n    throw new Error('Cannot invoke reshape on an Immutable Matrix instance');\n  };\n\n  /**\n   * Create a clone of the matrix\n   * @return {ImmutableDenseMatrix} clone\n   */\n  ImmutableDenseMatrix.prototype.clone = function () {\n    return new ImmutableDenseMatrix({\n      data: clone(this._data),\n      size: clone(this._size),\n      datatype: this._datatype\n    });\n  };\n\n  /**\n   * Get a JSON representation of the matrix\n   * @returns {Object}\n   */\n  ImmutableDenseMatrix.prototype.toJSON = function () {\n    return {\n      mathjs: 'ImmutableDenseMatrix',\n      data: this._data,\n      size: this._size,\n      datatype: this._datatype\n    };\n  };\n\n  /**\n   * Generate a matrix from a JSON object\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"ImmutableDenseMatrix\", data: [], size: []}`,\n   *                       where mathjs is optional\n   * @returns {ImmutableDenseMatrix}\n   */\n  ImmutableDenseMatrix.fromJSON = function (json) {\n    return new ImmutableDenseMatrix(json);\n  };\n\n  /**\n   * Swap rows i and j in Matrix.\n   *\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  ImmutableDenseMatrix.prototype.swapRows = function () {\n    throw new Error('Cannot invoke swapRows on an Immutable Matrix instance');\n  };\n\n  /**\n   * Calculate the minimum value in the set\n   * @return {Number | undefined} min\n   */\n  ImmutableDenseMatrix.prototype.min = function () {\n    // check min has been calculated before\n    if (this._min === null) {\n      // minimum\n      var m = null;\n      // compute min\n      this.forEach(function (v) {\n        if (m === null || smaller(v, m)) {\n          m = v;\n        }\n      });\n      this._min = m !== null ? m : undefined;\n    }\n    return this._min;\n  };\n\n  /**\n   * Calculate the maximum value in the set\n   * @return {Number | undefined} max\n   */\n  ImmutableDenseMatrix.prototype.max = function () {\n    // check max has been calculated before\n    if (this._max === null) {\n      // maximum\n      var m = null;\n      // compute max\n      this.forEach(function (v) {\n        if (m === null || smaller(m, v)) {\n          m = v;\n        }\n      });\n      this._max = m !== null ? m : undefined;\n    }\n    return this._max;\n  };\n  return ImmutableDenseMatrix;\n}, {\n  isClass: true\n});","import { isArray, isMatrix, isRange } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { isInteger } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Index';\nvar dependencies = ['ImmutableDenseMatrix', 'getMatrixDataType'];\nexport var createIndexClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    ImmutableDenseMatrix,\n    getMatrixDataType\n  } = _ref;\n  /**\n   * Create an index. An Index can store ranges and sets for multiple dimensions.\n   * Matrix.get, Matrix.set, and math.subset accept an Index as input.\n   *\n   * Usage:\n   *     const index = new Index(range1, range2, matrix1, array1, ...)\n   *\n   * Where each parameter can be any of:\n   *     A number\n   *     A string (containing a name of an object property)\n   *     An instance of Range\n   *     An Array with the Set values\n   *     An Array with Booleans\n   *     A Matrix with the Set values\n   *     A Matrix with Booleans\n   *\n   * The parameters start, end, and step must be integer numbers.\n   *\n   * @class Index\n   * @Constructor Index\n   * @param {...*} ranges\n   */\n  function Index(ranges) {\n    if (!(this instanceof Index)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n    this._dimensions = [];\n    this._sourceSize = [];\n    this._isScalar = true;\n    for (var i = 0, ii = arguments.length; i < ii; i++) {\n      var arg = arguments[i];\n      var argIsArray = isArray(arg);\n      var argIsMatrix = isMatrix(arg);\n      var sourceSize = null;\n      if (isRange(arg)) {\n        this._dimensions.push(arg);\n        this._isScalar = false;\n      } else if (argIsArray || argIsMatrix) {\n        // create matrix\n        var m = void 0;\n        if (getMatrixDataType(arg) === 'boolean') {\n          if (argIsArray) m = _createImmutableMatrix(_booleansArrayToNumbersForIndex(arg).valueOf());\n          if (argIsMatrix) m = _createImmutableMatrix(_booleansArrayToNumbersForIndex(arg._data).valueOf());\n          sourceSize = arg.valueOf().length;\n        } else {\n          m = _createImmutableMatrix(arg.valueOf());\n        }\n        this._dimensions.push(m);\n        // size\n        var size = m.size();\n        // scalar\n        if (size.length !== 1 || size[0] !== 1 || sourceSize !== null) {\n          this._isScalar = false;\n        }\n      } else if (typeof arg === 'number') {\n        this._dimensions.push(_createImmutableMatrix([arg]));\n      } else if (typeof arg === 'string') {\n        // object property (arguments.count should be 1)\n        this._dimensions.push(arg);\n      } else {\n        throw new TypeError('Dimension must be an Array, Matrix, number, string, or Range');\n      }\n      this._sourceSize.push(sourceSize);\n      // TODO: implement support for wildcard '*'\n    }\n  }\n\n  /**\n   * Attach type information\n   */\n  Index.prototype.type = 'Index';\n  Index.prototype.isIndex = true;\n  function _createImmutableMatrix(arg) {\n    // loop array elements\n    for (var i = 0, l = arg.length; i < l; i++) {\n      if (typeof arg[i] !== 'number' || !isInteger(arg[i])) {\n        throw new TypeError('Index parameters must be positive integer numbers');\n      }\n    }\n    // create matrix\n    return new ImmutableDenseMatrix(arg);\n  }\n\n  /**\n   * Create a clone of the index\n   * @memberof Index\n   * @return {Index} clone\n   */\n  Index.prototype.clone = function () {\n    var index = new Index();\n    index._dimensions = clone(this._dimensions);\n    index._isScalar = this._isScalar;\n    index._sourceSize = this._sourceSize;\n    return index;\n  };\n\n  /**\n   * Create an index from an array with ranges/numbers\n   * @memberof Index\n   * @param {Array.<Array | number>} ranges\n   * @return {Index} index\n   * @private\n   */\n  Index.create = function (ranges) {\n    var index = new Index();\n    Index.apply(index, ranges);\n    return index;\n  };\n\n  /**\n   * Retrieve the size of the index, the number of elements for each dimension.\n   * @memberof Index\n   * @returns {number[]} size\n   */\n  Index.prototype.size = function () {\n    var size = [];\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var d = this._dimensions[i];\n      size[i] = typeof d === 'string' ? 1 : d.size()[0];\n    }\n    return size;\n  };\n\n  /**\n   * Get the maximum value for each of the indexes ranges.\n   * @memberof Index\n   * @returns {number[]} max\n   */\n  Index.prototype.max = function () {\n    var values = [];\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var range = this._dimensions[i];\n      values[i] = typeof range === 'string' ? range : range.max();\n    }\n    return values;\n  };\n\n  /**\n   * Get the minimum value for each of the indexes ranges.\n   * @memberof Index\n   * @returns {number[]} min\n   */\n  Index.prototype.min = function () {\n    var values = [];\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var range = this._dimensions[i];\n      values[i] = typeof range === 'string' ? range : range.min();\n    }\n    return values;\n  };\n\n  /**\n   * Loop over each of the ranges of the index\n   * @memberof Index\n   * @param {Function} callback   Called for each range with a Range as first\n   *                              argument, the dimension as second, and the\n   *                              index object as third.\n   */\n  Index.prototype.forEach = function (callback) {\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      callback(this._dimensions[i], i, this);\n    }\n  };\n\n  /**\n   * Retrieve the dimension for the given index\n   * @memberof Index\n   * @param {Number} dim                  Number of the dimension\n   * @returns {Range | null} range\n   */\n  Index.prototype.dimension = function (dim) {\n    return this._dimensions[dim] || null;\n  };\n\n  /**\n   * Test whether this index contains an object property\n   * @returns {boolean} Returns true if the index is an object property\n   */\n  Index.prototype.isObjectProperty = function () {\n    return this._dimensions.length === 1 && typeof this._dimensions[0] === 'string';\n  };\n\n  /**\n   * Returns the object property name when the Index holds a single object property,\n   * else returns null\n   * @returns {string | null}\n   */\n  Index.prototype.getObjectProperty = function () {\n    return this.isObjectProperty() ? this._dimensions[0] : null;\n  };\n\n  /**\n   * Test whether this index contains only a single value.\n   *\n   * This is the case when the index is created with only scalar values as ranges,\n   * not for ranges resolving into a single value.\n   * @memberof Index\n   * @return {boolean} isScalar\n   */\n  Index.prototype.isScalar = function () {\n    return this._isScalar;\n  };\n\n  /**\n   * Expand the Index into an array.\n   * For example new Index([0,3], [2,7]) returns [[0,1,2], [2,3,4,5,6]]\n   * @memberof Index\n   * @returns {Array} array\n   */\n  Index.prototype.toArray = function () {\n    var array = [];\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var dimension = this._dimensions[i];\n      array.push(typeof dimension === 'string' ? dimension : dimension.toArray());\n    }\n    return array;\n  };\n\n  /**\n   * Get the primitive value of the Index, a two dimensional array.\n   * Equivalent to Index.toArray().\n   * @memberof Index\n   * @returns {Array} array\n   */\n  Index.prototype.valueOf = Index.prototype.toArray;\n\n  /**\n   * Get the string representation of the index, for example '[2:6]' or '[0:2:10, 4:7, [1,2,3]]'\n   * @memberof Index\n   * @returns {String} str\n   */\n  Index.prototype.toString = function () {\n    var strings = [];\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var dimension = this._dimensions[i];\n      if (typeof dimension === 'string') {\n        strings.push(JSON.stringify(dimension));\n      } else {\n        strings.push(dimension.toString());\n      }\n    }\n    return '[' + strings.join(', ') + ']';\n  };\n\n  /**\n   * Get a JSON representation of the Index\n   * @memberof Index\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Index\", \"ranges\": [{\"mathjs\": \"Range\", start: 0, end: 10, step:1}, ...]}`\n   */\n  Index.prototype.toJSON = function () {\n    return {\n      mathjs: 'Index',\n      dimensions: this._dimensions\n    };\n  };\n\n  /**\n   * Instantiate an Index from a JSON object\n   * @memberof Index\n   * @param {Object} json A JSON object structured as:\n   *                     `{\"mathjs\": \"Index\", \"dimensions\": [{\"mathjs\": \"Range\", start: 0, end: 10, step:1}, ...]}`\n   * @return {Index}\n   */\n  Index.fromJSON = function (json) {\n    return Index.create(json.dimensions);\n  };\n  return Index;\n}, {\n  isClass: true\n});\n\n/**\n * Receives an array of booleans and returns an array of Numbers for Index\n * @param {Array} booleanArrayIndex An array of booleans\n * @return {Array} A set of numbers ready for index\n */\nfunction _booleansArrayToNumbersForIndex(booleanArrayIndex) {\n  // gets an array of booleans and returns an array of numbers\n  var indexOfNumbers = [];\n  booleanArrayIndex.forEach((bool, idx) => {\n    if (bool) {\n      indexOfNumbers.push(idx);\n    }\n  });\n  return indexOfNumbers;\n}","import { factory } from '../../utils/factory.js';\nvar name = 'atan';\nvar dependencies = ['typed'];\nexport var createAtan = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Calculate the inverse tangent of a value.\n   *\n   * To avoid confusion with matrix arctangent, this function does not apply\n   * to matrices.\n   *\n   * Syntax:\n   *\n   *    math.atan(x)\n   *\n   * Examples:\n   *\n   *    math.atan(0.5)           // returns number 0.4636476090008061\n   *    math.atan(2)             // returns number 1.1071487177940904\n   *    math.atan(math.tan(1.5)) // returns number 1.5\n   *\n   * See also:\n   *\n   *    tan, asin, acos\n   *\n   * @param {number | BigNumber | Complex} x   Function input\n   * @return {number | BigNumber | Complex} The arc tangent of x\n   */\n  return typed('atan', {\n    number: function number(x) {\n      return Math.atan(x);\n    },\n    Complex: function Complex(x) {\n      return x.atan();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.atan();\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nexport var createTrigUnit = /* #__PURE__ */factory('trigUnit', ['typed'], _ref => {\n  var {\n    typed\n  } = _ref;\n  return {\n    Unit: typed.referToSelf(self => x => {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function cot is no angle');\n      }\n      return typed.find(self, x.valueType())(x.value);\n    })\n  };\n});","import { factory } from '../../utils/factory.js';\nimport { createTrigUnit } from './trigUnit.js';\nvar name = 'cos';\nvar dependencies = ['typed'];\nexport var createCos = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  var trigUnit = createTrigUnit({\n    typed\n  });\n\n  /**\n   * Calculate the cosine of a value.\n   *\n   * To avoid confusion with the matrix cosine, this function does not\n   * apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.cos(x)\n   *\n   * Examples:\n   *\n   *    math.cos(2)                      // returns number -0.4161468365471422\n   *    math.cos(math.pi / 4)            // returns number  0.7071067811865475\n   *    math.cos(math.unit(180, 'deg'))  // returns number -1\n   *    math.cos(math.unit(60, 'deg'))   // returns number  0.5\n   *\n   *    const angle = 0.2\n   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number ~1\n   *\n   * See also:\n   *\n   *    cos, tan\n   *\n   * @param {number | BigNumber | Complex | Unit} x  Function input\n   * @return {number | BigNumber | Complex} Cosine of x\n   */\n  return typed(name, {\n    number: Math.cos,\n    'Complex | BigNumber': x => x.cos()\n  }, trigUnit);\n});","import { factory } from '../../utils/factory.js';\nimport { createTrigUnit } from './trigUnit.js';\nvar name = 'sin';\nvar dependencies = ['typed'];\nexport var createSin = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  var trigUnit = createTrigUnit({\n    typed\n  });\n\n  /**\n   * Calculate the sine of a value.\n   *\n   * To avoid confusion with the matrix sine, this function does not apply\n   * to matrices.\n   *\n   * Syntax:\n   *\n   *    math.sin(x)\n   *\n   * Examples:\n   *\n   *    math.sin(2)                      // returns number 0.9092974268256813\n   *    math.sin(math.pi / 4)            // returns number 0.7071067811865475\n   *    math.sin(math.unit(90, 'deg'))   // returns number 1\n   *    math.sin(math.unit(30, 'deg'))   // returns number 0.5\n   *\n   *    const angle = 0.2\n   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number ~1\n   *\n   * See also:\n   *\n   *    cos, tan\n   *\n   * @param {number | BigNumber | Complex | Unit} x  Function input\n   * @return {number | BigNumber | Complex} Sine of x\n   */\n  return typed(name, {\n    number: Math.sin,\n    'Complex | BigNumber': x => x.sin()\n  }, trigUnit);\n});","import { factory } from '../../utils/factory.js';\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';\nimport { createMatAlgo04xSidSid } from '../../type/matrix/utils/matAlgo04xSidSid.js';\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'add';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'equalScalar', 'DenseMatrix', 'SparseMatrix', 'concat'];\nexport var createAdd = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    addScalar,\n    equalScalar,\n    DenseMatrix,\n    SparseMatrix,\n    concat\n  } = _ref;\n  var matAlgo01xDSid = createMatAlgo01xDSid({\n    typed\n  });\n  var matAlgo04xSidSid = createMatAlgo04xSidSid({\n    typed,\n    equalScalar\n  });\n  var matAlgo10xSids = createMatAlgo10xSids({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\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  return typed(name, {\n    'any, any': addScalar,\n    'any, any, ...any': typed.referToSelf(self => (x, y, rest) => {\n      var result = self(x, y);\n      for (var i = 0; i < rest.length; i++) {\n        result = self(result, rest[i]);\n      }\n      return result;\n    })\n  }, matrixAlgorithmSuite({\n    elop: addScalar,\n    DS: matAlgo01xDSid,\n    SS: matAlgo04xSidSid,\n    Ss: matAlgo10xSids\n  }));\n});","import { factory } from '../../utils/factory.js';\nvar name = 'norm';\nvar dependencies = ['typed', 'abs', 'add', 'pow', 'conj', 'sqrt', 'multiply', 'equalScalar', 'larger', 'smaller', 'matrix', 'ctranspose', 'eigs'];\nexport var createNorm = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    abs,\n    add,\n    pow,\n    conj,\n    sqrt,\n    multiply,\n    equalScalar,\n    larger,\n    smaller,\n    matrix,\n    ctranspose,\n    eigs\n  } = _ref;\n  /**\n   * Calculate the norm of a number, vector or matrix.\n   *\n   * The second parameter p is optional. If not provided, it defaults to 2.\n   *\n   * Syntax:\n   *\n   *    math.norm(x)\n   *    math.norm(x, p)\n   *\n   * Examples:\n   *\n   *    math.abs(-3.5)                         // returns 3.5\n   *    math.norm(-3.5)                        // returns 3.5\n   *\n   *    math.norm(math.complex(3, -4))         // returns 5\n   *\n   *    math.norm([1, 2, -3], Infinity)        // returns 3\n   *    math.norm([1, 2, -3], -Infinity)       // returns 1\n   *\n   *    math.norm([3, 4], 2)                   // returns 5\n   *\n   *    math.norm([[1, 2], [3, 4]], 1)          // returns 6\n   *    math.norm([[1, 2], [3, 4]], 'inf')     // returns 7\n   *    math.norm([[1, 2], [3, 4]], 'fro')     // returns 5.477225575051661\n   *\n   * See also:\n   *\n   *    abs, hypot\n   *\n   * @param  {number | BigNumber | Complex | Array | Matrix} x\n   *            Value for which to calculate the norm\n   * @param  {number | BigNumber | string} [p=2]\n   *            Vector space.\n   *            Supported numbers include Infinity and -Infinity.\n   *            Supported strings are: 'inf', '-inf', and 'fro' (The Frobenius norm)\n   * @return {number | BigNumber} the p-norm\n   */\n  return typed(name, {\n    number: Math.abs,\n    Complex: function Complex(x) {\n      return x.abs();\n    },\n    BigNumber: function BigNumber(x) {\n      // norm(x) = abs(x)\n      return x.abs();\n    },\n    boolean: function boolean(x) {\n      // norm(x) = abs(x)\n      return Math.abs(x);\n    },\n    Array: function Array(x) {\n      return _norm(matrix(x), 2);\n    },\n    Matrix: function Matrix(x) {\n      return _norm(x, 2);\n    },\n    'Array, number | BigNumber | string': function ArrayNumberBigNumberString(x, p) {\n      return _norm(matrix(x), p);\n    },\n    'Matrix, number | BigNumber | string': function MatrixNumberBigNumberString(x, p) {\n      return _norm(x, p);\n    }\n  });\n\n  /**\n   * Calculate the plus infinity norm for a vector\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _vectorNormPlusInfinity(x) {\n    // norm(x, Infinity) = max(abs(x))\n    var pinf = 0;\n    // skip zeros since abs(0) === 0\n    x.forEach(function (value) {\n      var v = abs(value);\n      if (larger(v, pinf)) {\n        pinf = v;\n      }\n    }, true);\n    return pinf;\n  }\n\n  /**\n   * Calculate the minus infinity norm for a vector\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _vectorNormMinusInfinity(x) {\n    // norm(x, -Infinity) = min(abs(x))\n    var ninf;\n    // skip zeros since abs(0) === 0\n    x.forEach(function (value) {\n      var v = abs(value);\n      if (!ninf || smaller(v, ninf)) {\n        ninf = v;\n      }\n    }, true);\n    return ninf || 0;\n  }\n\n  /**\n   * Calculate the norm for a vector\n   * @param {Matrix} x\n   * @param {number | string} p\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _vectorNorm(x, p) {\n    // check p\n    if (p === Number.POSITIVE_INFINITY || p === 'inf') {\n      return _vectorNormPlusInfinity(x);\n    }\n    if (p === Number.NEGATIVE_INFINITY || p === '-inf') {\n      return _vectorNormMinusInfinity(x);\n    }\n    if (p === 'fro') {\n      return _norm(x, 2);\n    }\n    if (typeof p === 'number' && !isNaN(p)) {\n      // check p != 0\n      if (!equalScalar(p, 0)) {\n        // norm(x, p) = sum(abs(xi) ^ p) ^ 1/p\n        var n = 0;\n        // skip zeros since abs(0) === 0\n        x.forEach(function (value) {\n          n = add(pow(abs(value), p), n);\n        }, true);\n        return pow(n, 1 / p);\n      }\n      return Number.POSITIVE_INFINITY;\n    }\n    // invalid parameter value\n    throw new Error('Unsupported parameter value');\n  }\n\n  /**\n   * Calculate the Frobenius norm for a matrix\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _matrixNormFrobenius(x) {\n    // norm(x) = sqrt(sum(diag(x'x)))\n    var fro = 0;\n    x.forEach(function (value, index) {\n      fro = add(fro, multiply(value, conj(value)));\n    });\n    return abs(sqrt(fro));\n  }\n\n  /**\n   * Calculate the norm L1 for a matrix\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _matrixNormOne(x) {\n    // norm(x) = the largest column sum\n    var c = [];\n    // result\n    var maxc = 0;\n    // skip zeros since abs(0) == 0\n    x.forEach(function (value, index) {\n      var j = index[1];\n      var cj = add(c[j] || 0, abs(value));\n      if (larger(cj, maxc)) {\n        maxc = cj;\n      }\n      c[j] = cj;\n    }, true);\n    return maxc;\n  }\n\n  /**\n   * Calculate the norm L2 for a matrix\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _matrixNormTwo(x) {\n    // norm(x) = sqrt( max eigenvalue of A*.A)\n    var sizeX = x.size();\n    if (sizeX[0] !== sizeX[1]) {\n      throw new RangeError('Invalid matrix dimensions');\n    }\n    var tx = ctranspose(x);\n    var squaredX = multiply(tx, x);\n    var eigenVals = eigs(squaredX).values.toArray();\n    var rho = eigenVals[eigenVals.length - 1];\n    return abs(sqrt(rho));\n  }\n\n  /**\n   * Calculate the infinity norm for a matrix\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _matrixNormInfinity(x) {\n    // norm(x) = the largest row sum\n    var r = [];\n    // result\n    var maxr = 0;\n    // skip zeros since abs(0) == 0\n    x.forEach(function (value, index) {\n      var i = index[0];\n      var ri = add(r[i] || 0, abs(value));\n      if (larger(ri, maxr)) {\n        maxr = ri;\n      }\n      r[i] = ri;\n    }, true);\n    return maxr;\n  }\n\n  /**\n   * Calculate the norm for a 2D Matrix (M*N)\n   * @param {Matrix} x\n   * @param {number | string} p\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _matrixNorm(x, p) {\n    // check p\n    if (p === 1) {\n      return _matrixNormOne(x);\n    }\n    if (p === Number.POSITIVE_INFINITY || p === 'inf') {\n      return _matrixNormInfinity(x);\n    }\n    if (p === 'fro') {\n      return _matrixNormFrobenius(x);\n    }\n    if (p === 2) {\n      return _matrixNormTwo(x);\n    } // invalid parameter value\n\n    throw new Error('Unsupported parameter value ' + p);\n  }\n\n  /**\n   * Calculate the norm for an array\n   * @param {Matrix} x\n   * @param {number | string} p\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _norm(x, p) {\n    // size\n    var sizeX = x.size();\n\n    // check if it is a vector\n    if (sizeX.length === 1) {\n      return _vectorNorm(x, p);\n    }\n    // MxN matrix\n    if (sizeX.length === 2) {\n      if (sizeX[0] && sizeX[1]) {\n        return _matrixNorm(x, p);\n      } else {\n        throw new RangeError('Invalid matrix dimensions');\n      }\n    }\n  }\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   * 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  function _validateDim(x, y) {\n    var xSize = _size(x);\n    var ySize = _size(y);\n    var xLen, yLen;\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    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    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  function _denseDot(a, b) {\n    var N = _validateDim(a, b);\n    var adata = isMatrix(a) ? a._data : a;\n    var adt = isMatrix(a) ? a._datatype || a.getDataType() : undefined;\n    var bdata = isMatrix(b) ? b._data : b;\n    var bdt = isMatrix(b) ? b._datatype || b.getDataType() : undefined;\n\n    // are these 2-dimensional column vectors? (as opposed to 1-dimensional vectors)\n    var aIsColumn = _size(a).length === 2;\n    var bIsColumn = _size(b).length === 2;\n    var add = addScalar;\n    var mul = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      var dt = adt;\n      // find signatures that matches (dt, dt)\n      add = typed.find(addScalar, [dt, dt]);\n      mul = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // both vectors 1-dimensional\n    if (!aIsColumn && !bIsColumn) {\n      var c = mul(conj(adata[0]), bdata[0]);\n      for (var i = 1; i < N; i++) {\n        c = add(c, mul(conj(adata[i]), bdata[i]));\n      }\n      return c;\n    }\n\n    // a is 1-dim, b is column\n    if (!aIsColumn && bIsColumn) {\n      var _c = mul(conj(adata[0]), bdata[0][0]);\n      for (var _i = 1; _i < N; _i++) {\n        _c = add(_c, mul(conj(adata[_i]), bdata[_i][0]));\n      }\n      return _c;\n    }\n\n    // a is column, b is 1-dim\n    if (aIsColumn && !bIsColumn) {\n      var _c2 = mul(conj(adata[0][0]), bdata[0]);\n      for (var _i2 = 1; _i2 < N; _i2++) {\n        _c2 = add(_c2, mul(conj(adata[_i2][0]), bdata[_i2]));\n      }\n      return _c2;\n    }\n\n    // both vectors are column\n    if (aIsColumn && bIsColumn) {\n      var _c3 = mul(conj(adata[0][0]), bdata[0][0]);\n      for (var _i3 = 1; _i3 < N; _i3++) {\n        _c3 = add(_c3, mul(conj(adata[_i3][0]), bdata[_i3][0]));\n      }\n      return _c3;\n    }\n  }\n  function _sparseDot(x, y) {\n    _validateDim(x, y);\n    var xindex = x._index;\n    var xvalues = x._values;\n    var yindex = y._index;\n    var yvalues = y._values;\n\n    // TODO optimize add & mul using datatype\n    var c = 0;\n    var add = addScalar;\n    var mul = multiplyScalar;\n    var i = 0;\n    var j = 0;\n    while (i < xindex.length && j < yindex.length) {\n      var I = xindex[i];\n      var J = yindex[j];\n      if (I < J) {\n        i++;\n        continue;\n      }\n      if (I > J) {\n        j++;\n        continue;\n      }\n      if (I === J) {\n        c = add(c, mul(xvalues[i], yvalues[j]));\n        i++;\n        j++;\n      }\n    }\n    return c;\n  }\n\n  // TODO remove this once #1771 is fixed\n  function _size(x) {\n    return isMatrix(x) ? x.size() : size(x);\n  }\n});","import _extends from \"@babel/runtime/helpers/extends\";\nimport { factory } from '../../../utils/factory.js';\nvar name = 'qr';\nvar dependencies = ['typed', 'matrix', 'zeros', 'identity', 'isZero', 'equal', 'sign', 'sqrt', 'conj', 'unaryMinus', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'complex'];\nexport var createQr = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    zeros,\n    identity,\n    isZero,\n    equal,\n    sign,\n    sqrt,\n    conj,\n    unaryMinus,\n    addScalar,\n    divideScalar,\n    multiplyScalar,\n    subtractScalar,\n    complex\n  } = _ref;\n  /**\n   * Calculate the Matrix QR decomposition. Matrix `A` is decomposed in\n   * two matrices (`Q`, `R`) where `Q` is an\n   * orthogonal matrix and `R` is an upper triangular matrix.\n   *\n   * Syntax:\n   *\n   *    math.qr(A)\n   *\n   * Example:\n   *\n   *    const m = [\n   *      [1, -1,  4],\n   *      [1,  4, -2],\n   *      [1,  4,  2],\n   *      [1,  -1, 0]\n   *    ]\n   *    const result = math.qr(m)\n   *    // r = {\n   *    //   Q: [\n   *    //     [0.5, -0.5,   0.5],\n   *    //     [0.5,  0.5,  -0.5],\n   *    //     [0.5,  0.5,   0.5],\n   *    //     [0.5, -0.5,  -0.5],\n   *    //   ],\n   *    //   R: [\n   *    //     [2, 3,  2],\n   *    //     [0, 5, -2],\n   *    //     [0, 0,  4],\n   *    //     [0, 0,  0]\n   *    //   ]\n   *    // }\n   *\n   * See also:\n   *\n   *    lup, lusolve\n   *\n   * @param {Matrix | Array} A    A two dimensional matrix or array\n   * for which to get the QR decomposition.\n   *\n   * @return {{Q: Array | Matrix, R: Array | Matrix}} Q: the orthogonal\n   * matrix and R: the upper triangular matrix\n   */\n  return _extends(typed(name, {\n    DenseMatrix: function DenseMatrix(m) {\n      return _denseQR(m);\n    },\n    SparseMatrix: function SparseMatrix(m) {\n      return _sparseQR(m);\n    },\n    Array: function Array(a) {\n      // create dense matrix from array\n      var m = matrix(a);\n      // lup, use matrix implementation\n      var r = _denseQR(m);\n      // result\n      return {\n        Q: r.Q.valueOf(),\n        R: r.R.valueOf()\n      };\n    }\n  }), {\n    _denseQRimpl\n  });\n  function _denseQRimpl(m) {\n    // rows & columns (m x n)\n    var rows = m._size[0]; // m\n    var cols = m._size[1]; // n\n\n    var Q = identity([rows], 'dense');\n    var Qdata = Q._data;\n    var R = m.clone();\n    var Rdata = R._data;\n\n    // vars\n    var i, j, k;\n    var w = zeros([rows], '');\n    for (k = 0; k < Math.min(cols, rows); ++k) {\n      /*\n       * **k-th Household matrix**\n       *\n       * The matrix I - 2*v*transpose(v)\n       * x     = first column of A\n       * x1    = first element of x\n       * alpha = x1 / |x1| * |x|\n       * e1    = tranpose([1, 0, 0, ...])\n       * u     = x - alpha * e1\n       * v     = u / |u|\n       *\n       * Household matrix = I - 2 * v * tranpose(v)\n       *\n       *  * Initially Q = I and R = A.\n       *  * Household matrix is a reflection in a plane normal to v which\n       *    will zero out all but the top right element in R.\n       *  * Appplying reflection to both Q and R will not change product.\n       *  * Repeat this process on the (1,1) minor to get R as an upper\n       *    triangular matrix.\n       *  * Reflections leave the magnitude of the columns of Q unchanged\n       *    so Q remains othoganal.\n       *\n       */\n\n      var pivot = Rdata[k][k];\n      var sgn = unaryMinus(equal(pivot, 0) ? 1 : sign(pivot));\n      var conjSgn = conj(sgn);\n      var alphaSquared = 0;\n      for (i = k; i < rows; i++) {\n        alphaSquared = addScalar(alphaSquared, multiplyScalar(Rdata[i][k], conj(Rdata[i][k])));\n      }\n      var alpha = multiplyScalar(sgn, sqrt(alphaSquared));\n      if (!isZero(alpha)) {\n        // first element in vector u\n        var u1 = subtractScalar(pivot, alpha);\n\n        // w = v * u1 / |u|    (only elements k to (rows-1) are used)\n        w[k] = 1;\n        for (i = k + 1; i < rows; i++) {\n          w[i] = divideScalar(Rdata[i][k], u1);\n        }\n\n        // tau = - conj(u1 / alpha)\n        var tau = unaryMinus(conj(divideScalar(u1, alpha)));\n        var s = void 0;\n\n        /*\n         * tau and w have been choosen so that\n         *\n         * 2 * v * tranpose(v) = tau * w * tranpose(w)\n         */\n\n        /*\n         * -- calculate R = R - tau * w * tranpose(w) * R --\n         * Only do calculation with rows k to (rows-1)\n         * Additionally columns 0 to (k-1) will not be changed by this\n         *   multiplication so do not bother recalculating them\n         */\n        for (j = k; j < cols; j++) {\n          s = 0.0;\n\n          // calculate jth element of [tranpose(w) * R]\n          for (i = k; i < rows; i++) {\n            s = addScalar(s, multiplyScalar(conj(w[i]), Rdata[i][j]));\n          }\n\n          // calculate the jth element of [tau * transpose(w) * R]\n          s = multiplyScalar(s, tau);\n          for (i = k; i < rows; i++) {\n            Rdata[i][j] = multiplyScalar(subtractScalar(Rdata[i][j], multiplyScalar(w[i], s)), conjSgn);\n          }\n        }\n        /*\n         * -- calculate Q = Q - tau * Q * w * transpose(w) --\n         * Q is a square matrix (rows x rows)\n         * Only do calculation with columns k to (rows-1)\n         * Additionally rows 0 to (k-1) will not be changed by this\n         *   multiplication so do not bother recalculating them\n         */\n        for (i = 0; i < rows; i++) {\n          s = 0.0;\n\n          // calculate ith element of [Q * w]\n          for (j = k; j < rows; j++) {\n            s = addScalar(s, multiplyScalar(Qdata[i][j], w[j]));\n          }\n\n          // calculate the ith element of [tau * Q * w]\n          s = multiplyScalar(s, tau);\n          for (j = k; j < rows; ++j) {\n            Qdata[i][j] = divideScalar(subtractScalar(Qdata[i][j], multiplyScalar(s, conj(w[j]))), conjSgn);\n          }\n        }\n      }\n    }\n\n    // return matrices\n    return {\n      Q,\n      R,\n      toString: function toString() {\n        return 'Q: ' + this.Q.toString() + '\\nR: ' + this.R.toString();\n      }\n    };\n  }\n  function _denseQR(m) {\n    var ret = _denseQRimpl(m);\n    var Rdata = ret.R._data;\n    if (m._data.length > 0) {\n      var zero = Rdata[0][0].type === 'Complex' ? complex(0) : 0;\n      for (var i = 0; i < Rdata.length; ++i) {\n        for (var j = 0; j < i && j < (Rdata[0] || []).length; ++j) {\n          Rdata[i][j] = zero;\n        }\n      }\n    }\n    return ret;\n  }\n  function _sparseQR(m) {\n    throw new Error('qr not implemented for sparse matrices yet');\n  }\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', 'subtractScalar', 'multiply', 'divideScalar', 'isZero', 'unaryMinus'];\nexport var createDet = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    subtractScalar,\n    multiply,\n    divideScalar,\n    isZero,\n    unaryMinus\n  } = _ref;\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      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      switch (size.length) {\n        case 0:\n          // scalar\n          return clone(x);\n        case 1:\n          // vector\n          if (size[0] === 1) {\n            return clone(x.valueOf()[0]);\n          }\n          if (size[0] === 0) {\n            return 1; // det of an empty matrix is per definition 1\n          } else {\n            throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n          }\n        case 2:\n          {\n            // two-dimensional array\n            var rows = size[0];\n            var cols = size[1];\n            if (rows === cols) {\n              return _det(x.clone().valueOf(), rows, cols);\n            }\n            if (cols === 0) {\n              return 1; // det of an empty matrix is per definition 1\n            } else {\n              throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\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  /**\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  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 subtractScalar(multiply(matrix[0][0], matrix[1][1]), multiply(matrix[1][0], matrix[0][1]));\n    } else {\n      // Bareiss algorithm\n      // this algorithm have same complexity as LUP decomposition (O(n^3))\n      // but it preserve precision of floating point more relative to the LUP decomposition\n      var negated = false;\n      var rowIndices = new Array(rows).fill(0).map((_, i) => i); // matrix index of row i\n      for (var k = 0; k < rows; k++) {\n        var k_ = rowIndices[k];\n        if (isZero(matrix[k_][k])) {\n          var _k = void 0;\n          for (_k = k + 1; _k < rows; _k++) {\n            if (!isZero(matrix[rowIndices[_k]][k])) {\n              k_ = rowIndices[_k];\n              rowIndices[_k] = rowIndices[k];\n              rowIndices[k] = k_;\n              negated = !negated;\n              break;\n            }\n          }\n          if (_k === rows) return matrix[k_][k]; // some zero of the type\n        }\n        var piv = matrix[k_][k];\n        var piv_ = k === 0 ? 1 : matrix[rowIndices[k - 1]][k - 1];\n        for (var i = k + 1; i < rows; i++) {\n          var i_ = rowIndices[i];\n          for (var j = k + 1; j < rows; j++) {\n            matrix[i_][j] = divideScalar(subtractScalar(multiply(matrix[i_][j], piv), multiply(matrix[i_][k], matrix[k_][j])), piv_);\n          }\n        }\n      }\n      var det = matrix[rowIndices[rows - 1]][rows - 1];\n      return negated ? unaryMinus(det) : 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   * 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      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        case 2:\n          // two dimensional array\n          {\n            var rows = size[0];\n            var cols = size[1];\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        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  /**\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  function _inv(mat, rows, cols) {\n    var r, s, f, value, temp;\n    if (rows === 1) {\n      // this is a 1 x 1 matrix\n      value = mat[0][0];\n      if (value === 0) {\n        throw Error('Cannot calculate inverse, determinant is zero');\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      if (d === 0) {\n        throw Error('Cannot calculate inverse, determinant is zero');\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\n      // make a copy of the matrix (only the arrays, not of the elements)\n      var A = mat.concat();\n      for (r = 0; r < rows; r++) {\n        A[r] = A[r].concat();\n      }\n\n      // create an identity matrix which in the end will contain the\n      // matrix inverse\n      var B = identity(rows).valueOf();\n\n      // loop over all columns, and perform row reductions\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        while (r < rows) {\n          if (abs(A[r][c]) > ABig) {\n            ABig = abs(A[r][c]);\n            rBig = r;\n          }\n          r++;\n        }\n        if (ABig === 0) {\n          throw Error('Cannot calculate inverse, determinant is zero');\n        }\n        r = rBig;\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        }\n\n        // eliminate non-zero values on the other rows at column c\n        var Ac = A[c];\n        var Bc = B[c];\n        for (r = 0; r < rows; r++) {\n          var Ar = A[r];\n          var Br = B[r];\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]);\n\n              // add (f * row c) to row r to eliminate the value\n              // at column c\n              for (s = c; s < cols; s++) {\n                Ar[s] = addScalar(Ar[s], multiply(f, Ac[s]));\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            for (s = c; s < cols; s++) {\n              Ar[s] = divideScalar(Ar[s], f);\n            }\n            for (s = 0; s < cols; s++) {\n              Br[s] = divideScalar(Br[s], f);\n            }\n          }\n        }\n      }\n      return B;\n    }\n  }\n});","import { clone } from '../../../utils/object.js';\nexport function createComplexEigs(_ref) {\n  var {\n    addScalar,\n    subtract,\n    flatten,\n    multiply,\n    multiplyScalar,\n    divideScalar,\n    sqrt,\n    abs,\n    bignumber,\n    diag,\n    size,\n    reshape,\n    inv,\n    qr,\n    usolve,\n    usolveAll,\n    equal,\n    complex,\n    larger,\n    smaller,\n    matrixFromColumns,\n    dot\n  } = _ref;\n  /**\n   * @param {number[][]} arr the matrix to find eigenvalues of\n   * @param {number} N size of the matrix\n   * @param {number|BigNumber} prec precision, anything lower will be considered zero\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @param {boolean} findVectors should we find eigenvectors?\n   *\n   * @returns {{ values: number[], vectors: number[][] }}\n   */\n  function complexEigs(arr, N, prec, type) {\n    var findVectors = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : true;\n    // TODO check if any row/col are zero except the diagonal\n\n    // make sure corresponding rows and columns have similar magnitude\n    // important because of numerical stability\n    // MODIFIES arr by side effect!\n    var R = balance(arr, N, prec, type, findVectors);\n\n    // R is the row transformation matrix\n    // arr = A' = R A R^-1, A is the original matrix\n    // (if findVectors is false, R is undefined)\n    // (And so to return to original matrix: A = R^-1 arr R)\n\n    // TODO if magnitudes of elements vary over many orders,\n    // move greatest elements to the top left corner\n\n    // using similarity transformations, reduce the matrix\n    // to Hessenberg form (upper triangular plus one subdiagonal row)\n    // updates the transformation matrix R with new row operationsq\n    // MODIFIES arr by side effect!\n    reduceToHessenberg(arr, N, prec, type, findVectors, R);\n    // still true that original A = R^-1 arr R)\n\n    // find eigenvalues\n    var {\n      values,\n      C\n    } = iterateUntilTriangular(arr, N, prec, type, findVectors);\n\n    // values is the list of eigenvalues, C is the column\n    // transformation matrix that transforms arr, the hessenberg\n    // matrix, to upper triangular\n    // (So U = C^-1 arr C and the relationship between current arr\n    // and original A is unchanged.)\n\n    if (findVectors) {\n      var eigenvectors = findEigenvectors(arr, N, C, R, values, prec, type);\n      return {\n        values,\n        eigenvectors\n      };\n    }\n    return {\n      values\n    };\n  }\n\n  /**\n   * @param {number[][]} arr\n   * @param {number} N\n   * @param {number} prec\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {number[][]}\n   */\n  function balance(arr, N, prec, type, findVectors) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var realzero = big ? bignumber(0) : 0;\n    var one = big ? bignumber(1) : cplx ? complex(1) : 1;\n    var realone = big ? bignumber(1) : 1;\n\n    // base of the floating-point arithmetic\n    var radix = big ? bignumber(10) : 2;\n    var radixSq = multiplyScalar(radix, radix);\n\n    // the diagonal transformation matrix R\n    var Rdiag;\n    if (findVectors) {\n      Rdiag = Array(N).fill(one);\n    }\n\n    // this isn't the only time we loop thru the matrix...\n    var last = false;\n    while (!last) {\n      // ...haha I'm joking! unless...\n      last = true;\n      for (var i = 0; i < N; i++) {\n        // compute the taxicab norm of i-th column and row\n        // TODO optimize for complex numbers\n        var colNorm = realzero;\n        var rowNorm = realzero;\n        for (var j = 0; j < N; j++) {\n          if (i === j) continue;\n          colNorm = addScalar(colNorm, abs(arr[j][i]));\n          rowNorm = addScalar(rowNorm, abs(arr[i][j]));\n        }\n        if (!equal(colNorm, 0) && !equal(rowNorm, 0)) {\n          // find integer power closest to balancing the matrix\n          // (we want to scale only by integer powers of radix,\n          // so that we don't lose any precision due to round-off)\n\n          var f = realone;\n          var c = colNorm;\n          var rowDivRadix = divideScalar(rowNorm, radix);\n          var rowMulRadix = multiplyScalar(rowNorm, radix);\n          while (smaller(c, rowDivRadix)) {\n            c = multiplyScalar(c, radixSq);\n            f = multiplyScalar(f, radix);\n          }\n          while (larger(c, rowMulRadix)) {\n            c = divideScalar(c, radixSq);\n            f = divideScalar(f, radix);\n          }\n\n          // check whether balancing is needed\n          // condition = (c + rowNorm) / f < 0.95 * (colNorm + rowNorm)\n          var condition = smaller(divideScalar(addScalar(c, rowNorm), f), multiplyScalar(addScalar(colNorm, rowNorm), 0.95));\n\n          // apply balancing similarity transformation\n          if (condition) {\n            // we should loop once again to check whether\n            // another rebalancing is needed\n            last = false;\n            var g = divideScalar(1, f);\n            for (var _j = 0; _j < N; _j++) {\n              if (i === _j) {\n                continue;\n              }\n              arr[i][_j] = multiplyScalar(arr[i][_j], g);\n              arr[_j][i] = multiplyScalar(arr[_j][i], f);\n            }\n\n            // keep track of transformations\n            if (findVectors) {\n              Rdiag[i] = multiplyScalar(Rdiag[i], g);\n            }\n          }\n        }\n      }\n    }\n\n    // return the diagonal row transformation matrix\n    return findVectors ? diag(Rdiag) : null;\n  }\n\n  /**\n   * @param {number[][]} arr\n   * @param {number} N\n   * @param {number} prec\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @param {boolean} findVectors\n   * @param {number[][]} R the row transformation matrix that will be modified\n   */\n  function reduceToHessenberg(arr, N, prec, type, findVectors, R) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;\n    if (big) {\n      prec = bignumber(prec);\n    }\n    for (var i = 0; i < N - 2; i++) {\n      // Find the largest subdiag element in the i-th col\n\n      var maxIndex = 0;\n      var max = zero;\n      for (var j = i + 1; j < N; j++) {\n        var el = arr[j][i];\n        if (smaller(abs(max), abs(el))) {\n          max = el;\n          maxIndex = j;\n        }\n      }\n\n      // This col is pivoted, no need to do anything\n      if (smaller(abs(max), prec)) {\n        continue;\n      }\n      if (maxIndex !== i + 1) {\n        // Interchange maxIndex-th and (i+1)-th row\n        var tmp1 = arr[maxIndex];\n        arr[maxIndex] = arr[i + 1];\n        arr[i + 1] = tmp1;\n\n        // Interchange maxIndex-th and (i+1)-th column\n        for (var _j2 = 0; _j2 < N; _j2++) {\n          var tmp2 = arr[_j2][maxIndex];\n          arr[_j2][maxIndex] = arr[_j2][i + 1];\n          arr[_j2][i + 1] = tmp2;\n        }\n\n        // keep track of transformations\n        if (findVectors) {\n          var tmp3 = R[maxIndex];\n          R[maxIndex] = R[i + 1];\n          R[i + 1] = tmp3;\n        }\n      }\n\n      // Reduce following rows and columns\n      for (var _j3 = i + 2; _j3 < N; _j3++) {\n        var n = divideScalar(arr[_j3][i], max);\n        if (n === 0) {\n          continue;\n        }\n\n        // from j-th row subtract n-times (i+1)th row\n        for (var k = 0; k < N; k++) {\n          arr[_j3][k] = subtract(arr[_j3][k], multiplyScalar(n, arr[i + 1][k]));\n        }\n\n        // to (i+1)th column add n-times j-th column\n        for (var _k = 0; _k < N; _k++) {\n          arr[_k][i + 1] = addScalar(arr[_k][i + 1], multiplyScalar(n, arr[_k][_j3]));\n        }\n\n        // keep track of transformations\n        if (findVectors) {\n          for (var _k2 = 0; _k2 < N; _k2++) {\n            R[_j3][_k2] = subtract(R[_j3][_k2], multiplyScalar(n, R[i + 1][_k2]));\n          }\n        }\n      }\n    }\n    return R;\n  }\n\n  /**\n   * @returns {{values: values, C: Matrix}}\n   * @see Press, Wiliams: Numerical recipes in Fortran 77\n   * @see https://en.wikipedia.org/wiki/QR_algorithm\n   */\n  function iterateUntilTriangular(A, N, prec, type, findVectors) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var one = big ? bignumber(1) : cplx ? complex(1) : 1;\n    if (big) {\n      prec = bignumber(prec);\n    }\n\n    // The Francis Algorithm\n    // The core idea of this algorithm is that doing successive\n    // A' = QtAQ transformations will eventually converge to block-\n    // upper-triangular with diagonal blocks either 1x1 or 2x2.\n    // The Q here is the one from the QR decomposition, A = QR.\n    // Since the eigenvalues of a block-upper-triangular matrix are\n    // the eigenvalues of its diagonal blocks and we know how to find\n    // eigenvalues of a 2x2 matrix, we know the eigenvalues of A.\n\n    var arr = clone(A);\n\n    // the list of converged eigenvalues\n    var lambdas = [];\n\n    // size of arr, which will get smaller as eigenvalues converge\n    var n = N;\n\n    // the diagonal of the block-diagonal matrix that turns\n    // converged 2x2 matrices into upper triangular matrices\n    var Sdiag = [];\n\n    // N×N matrix describing the overall transformation done during the QR algorithm\n    var Qtotal = findVectors ? diag(Array(N).fill(one)) : undefined;\n\n    // nxn matrix describing the QR transformations done since last convergence\n    var Qpartial = findVectors ? diag(Array(n).fill(one)) : undefined;\n\n    // last eigenvalue converged before this many steps\n    var lastConvergenceBefore = 0;\n    while (lastConvergenceBefore <= 100) {\n      lastConvergenceBefore += 1;\n\n      // TODO if the convergence is slow, do something clever\n\n      // Perform the factorization\n\n      var k = arr[n - 1][n - 1]; // TODO this is apparently a somewhat\n      // old-fashioned choice; ideally set close to an eigenvalue, or\n      // perhaps better yet switch to the implicit QR version that is sometimes\n      // specifically called the \"Francis algorithm\" that is alluded to\n      // in the following TODO. (Or perhaps we switch to an independently\n      // optimized third-party package for the linear algebra operations...)\n\n      for (var i = 0; i < n; i++) {\n        arr[i][i] = subtract(arr[i][i], k);\n      }\n\n      // TODO do an implicit QR transformation\n      var {\n        Q,\n        R\n      } = qr(arr);\n      arr = multiply(R, Q);\n      for (var _i = 0; _i < n; _i++) {\n        arr[_i][_i] = addScalar(arr[_i][_i], k);\n      }\n\n      // keep track of transformations\n      if (findVectors) {\n        Qpartial = multiply(Qpartial, Q);\n      }\n\n      // The rightmost diagonal element converged to an eigenvalue\n      if (n === 1 || smaller(abs(arr[n - 1][n - 2]), prec)) {\n        lastConvergenceBefore = 0;\n        lambdas.push(arr[n - 1][n - 1]);\n\n        // keep track of transformations\n        if (findVectors) {\n          Sdiag.unshift([[1]]);\n          inflateMatrix(Qpartial, N);\n          Qtotal = multiply(Qtotal, Qpartial);\n          if (n > 1) {\n            Qpartial = diag(Array(n - 1).fill(one));\n          }\n        }\n\n        // reduce the matrix size\n        n -= 1;\n        arr.pop();\n        for (var _i2 = 0; _i2 < n; _i2++) {\n          arr[_i2].pop();\n        }\n\n        // The rightmost diagonal 2x2 block converged\n      } else if (n === 2 || smaller(abs(arr[n - 2][n - 3]), prec)) {\n        lastConvergenceBefore = 0;\n        var ll = eigenvalues2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1]);\n        lambdas.push(...ll);\n\n        // keep track of transformations\n        if (findVectors) {\n          Sdiag.unshift(jordanBase2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1], ll[0], ll[1], prec, type));\n          inflateMatrix(Qpartial, N);\n          Qtotal = multiply(Qtotal, Qpartial);\n          if (n > 2) {\n            Qpartial = diag(Array(n - 2).fill(one));\n          }\n        }\n\n        // reduce the matrix size\n        n -= 2;\n        arr.pop();\n        arr.pop();\n        for (var _i3 = 0; _i3 < n; _i3++) {\n          arr[_i3].pop();\n          arr[_i3].pop();\n        }\n      }\n      if (n === 0) {\n        break;\n      }\n    }\n\n    // standard sorting\n    lambdas.sort((a, b) => +subtract(abs(a), abs(b)));\n\n    // the algorithm didn't converge\n    if (lastConvergenceBefore > 100) {\n      var err = Error('The eigenvalues failed to converge. Only found these eigenvalues: ' + lambdas.join(', '));\n      err.values = lambdas;\n      err.vectors = [];\n      throw err;\n    }\n\n    // combine the overall QR transformation Qtotal with the subsequent\n    // transformation S that turns the diagonal 2x2 blocks to upper triangular\n    var C = findVectors ? multiply(Qtotal, blockDiag(Sdiag, N)) : undefined;\n    return {\n      values: lambdas,\n      C\n    };\n  }\n\n  /**\n   * @param {Matrix} A hessenberg-form matrix\n   * @param {number} N size of A\n   * @param {Matrix} C column transformation matrix that turns A into upper triangular\n   * @param {Matrix} R similarity that turns original matrix into A\n   * @param {number[]} values array of eigenvalues of A\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {number[][]} eigenvalues\n   */\n  function findEigenvectors(A, N, C, R, values, prec, type) {\n    var Cinv = inv(C);\n    var U = multiply(Cinv, A, C);\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;\n    var one = big ? bignumber(1) : cplx ? complex(1) : 1;\n\n    // turn values into a kind of \"multiset\"\n    // this way it is easier to find eigenvectors\n    var uniqueValues = [];\n    var multiplicities = [];\n    for (var lambda of values) {\n      var i = indexOf(uniqueValues, lambda, equal);\n      if (i === -1) {\n        uniqueValues.push(lambda);\n        multiplicities.push(1);\n      } else {\n        multiplicities[i] += 1;\n      }\n    }\n\n    // find eigenvectors by solving U − lambdaE = 0\n    // TODO replace with an iterative eigenvector algorithm\n    // (this one might fail for imprecise eigenvalues)\n\n    var vectors = [];\n    var len = uniqueValues.length;\n    var b = Array(N).fill(zero);\n    var E = diag(Array(N).fill(one));\n    var _loop = function _loop() {\n      var lambda = uniqueValues[_i4];\n      var S = subtract(U, multiply(lambda, E)); // the characteristic matrix\n\n      var solutions = usolveAll(S, b);\n      solutions.shift(); // ignore the null vector\n\n      // looks like we missed something, try inverse iteration\n      // But if that fails, just presume that the original matrix truly\n      // was defective.\n      while (solutions.length < multiplicities[_i4]) {\n        var approxVec = inverseIterate(S, N, solutions, prec, type);\n        if (approxVec === null) {\n          break;\n        } // no more vectors were found\n        solutions.push(approxVec);\n      }\n\n      // Transform back into original array coordinates\n      var correction = multiply(inv(R), C);\n      solutions = solutions.map(v => multiply(correction, v));\n      vectors.push(...solutions.map(v => ({\n        value: lambda,\n        vector: flatten(v)\n      })));\n    };\n    for (var _i4 = 0; _i4 < len; _i4++) {\n      _loop();\n    }\n    return vectors;\n  }\n\n  /**\n   * Compute the eigenvalues of an 2x2 matrix\n   * @return {[number,number]}\n   */\n  function eigenvalues2x2(a, b, c, d) {\n    // lambda_+- = 1/2 trA +- 1/2 sqrt( tr^2 A - 4 detA )\n    var trA = addScalar(a, d);\n    var detA = subtract(multiplyScalar(a, d), multiplyScalar(b, c));\n    var x = multiplyScalar(trA, 0.5);\n    var y = multiplyScalar(sqrt(subtract(multiplyScalar(trA, trA), multiplyScalar(4, detA))), 0.5);\n    return [addScalar(x, y), subtract(x, y)];\n  }\n\n  /**\n   * For an 2x2 matrix compute the transformation matrix S,\n   * so that SAS^-1 is an upper triangular matrix\n   * @return {[[number,number],[number,number]]}\n   * @see https://math.berkeley.edu/~ogus/old/Math_54-05/webfoils/jordan.pdf\n   * @see http://people.math.harvard.edu/~knill/teaching/math21b2004/exhibits/2dmatrices/index.html\n   */\n  function jordanBase2x2(a, b, c, d, l1, l2, prec, type) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;\n    var one = big ? bignumber(1) : cplx ? complex(1) : 1;\n\n    // matrix is already upper triangular\n    // return an identity matrix\n    if (smaller(abs(c), prec)) {\n      return [[one, zero], [zero, one]];\n    }\n\n    // matrix is diagonalizable\n    // return its eigenvectors as columns\n    if (larger(abs(subtract(l1, l2)), prec)) {\n      return [[subtract(l1, d), subtract(l2, d)], [c, c]];\n    }\n\n    // matrix is not diagonalizable\n    // compute diagonal elements of N = A - lambdaI\n    var na = subtract(a, l1);\n    var nd = subtract(d, l1);\n\n    // col(N,2) = 0  implies  S = ( col(N,1), e_1 )\n    // col(N,2) != 0 implies  S = ( col(N,2), e_2 )\n\n    if (smaller(abs(b), prec) && smaller(abs(nd), prec)) {\n      return [[na, one], [c, zero]];\n    } else {\n      return [[b, zero], [nd, one]];\n    }\n  }\n\n  /**\n   * Enlarge the matrix from nxn to NxN, setting the new\n   * elements to 1 on diagonal and 0 elsewhere\n   */\n  function inflateMatrix(arr, N) {\n    // add columns\n    for (var i = 0; i < arr.length; i++) {\n      arr[i].push(...Array(N - arr[i].length).fill(0));\n    }\n\n    // add rows\n    for (var _i5 = arr.length; _i5 < N; _i5++) {\n      arr.push(Array(N).fill(0));\n      arr[_i5][_i5] = 1;\n    }\n    return arr;\n  }\n\n  /**\n   * Create a block-diagonal matrix with the given square matrices on the diagonal\n   * @param {Matrix[] | number[][][]} arr array of matrices to be placed on the diagonal\n   * @param {number} N the size of the resulting matrix\n   */\n  function blockDiag(arr, N) {\n    var M = [];\n    for (var i = 0; i < N; i++) {\n      M[i] = Array(N).fill(0);\n    }\n    var I = 0;\n    for (var sub of arr) {\n      var n = sub.length;\n      for (var _i6 = 0; _i6 < n; _i6++) {\n        for (var j = 0; j < n; j++) {\n          M[I + _i6][I + j] = sub[_i6][j];\n        }\n      }\n      I += n;\n    }\n    return M;\n  }\n\n  /**\n   * Finds the index of an element in an array using a custom equality function\n   * @template T\n   * @param {Array<T>} arr array in which to search\n   * @param {T} el the element to find\n   * @param {function(T, T): boolean} fn the equality function, first argument is an element of `arr`, the second is always `el`\n   * @returns {number} the index of `el`, or -1 when it's not in `arr`\n   */\n  function indexOf(arr, el, fn) {\n    for (var i = 0; i < arr.length; i++) {\n      if (fn(arr[i], el)) {\n        return i;\n      }\n    }\n    return -1;\n  }\n\n  /**\n   * Provided a near-singular upper-triangular matrix A and a list of vectors,\n   * finds an eigenvector of A with the smallest eigenvalue, which is orthogonal\n   * to each vector in the list\n   * @template T\n   * @param {T[][]} A near-singular square matrix\n   * @param {number} N dimension\n   * @param {T[][]} orthog list of vectors\n   * @param {number} prec epsilon\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @return {T[] | null} eigenvector\n   *\n   * @see Numerical Recipes for Fortran 77 – 11.7 Eigenvalues or Eigenvectors by Inverse Iteration\n   */\n  function inverseIterate(A, N, orthog, prec, type) {\n    var largeNum = type === 'BigNumber' ? bignumber(1000) : 1000;\n    var b; // the vector\n\n    // you better choose a random vector before I count to five\n    var i = 0;\n    for (; i < 5; ++i) {\n      b = randomOrthogonalVector(N, orthog, type);\n      try {\n        b = usolve(A, b);\n      } catch (_unused) {\n        // That direction didn't work, likely because the original matrix\n        // was defective. But still make the full number of tries...\n        continue;\n      }\n      if (larger(norm(b), largeNum)) {\n        break;\n      }\n    }\n    if (i >= 5) {\n      return null; // couldn't find any orthogonal vector in the image\n    }\n\n    // you better converge before I count to ten\n    i = 0;\n    while (true) {\n      var c = usolve(A, b);\n      if (smaller(norm(orthogonalComplement(b, [c])), prec)) {\n        break;\n      }\n      if (++i >= 10) {\n        return null;\n      }\n      b = normalize(c);\n    }\n    return b;\n  }\n\n  /**\n   * Generates a random unit vector of dimension N, orthogonal to each vector in the list\n   * @template T\n   * @param {number} N dimension\n   * @param {T[][]} orthog list of vectors\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {T[]} random vector\n   */\n  function randomOrthogonalVector(N, orthog, type) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n\n    // generate random vector with the correct type\n    var v = Array(N).fill(0).map(_ => 2 * Math.random() - 1);\n    if (big) {\n      v = v.map(n => bignumber(n));\n    }\n    if (cplx) {\n      v = v.map(n => complex(n));\n    }\n\n    // project to orthogonal complement\n    v = orthogonalComplement(v, orthog);\n\n    // normalize\n    return normalize(v, type);\n  }\n\n  /**\n   * Project vector v to the orthogonal complement of an array of vectors\n   */\n  function orthogonalComplement(v, orthog) {\n    var vectorShape = size(v);\n    for (var w of orthog) {\n      w = reshape(w, vectorShape); // make sure this is just a vector computation\n      // v := v − (w, v)/|w|^2 w\n      v = subtract(v, multiply(divideScalar(dot(w, v), dot(w, w)), w));\n    }\n    return v;\n  }\n\n  /**\n   * Calculate the norm of a vector.\n   * We can't use math.norm because factory can't handle circular dependency.\n   * Seriously, I'm really fed up with factory.\n   */\n  function norm(v) {\n    return abs(sqrt(dot(v, v)));\n  }\n\n  /**\n   * Normalize a vector\n   * @template T\n   * @param {T[]} v\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {T[]} normalized vec\n   */\n  function normalize(v, type) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var one = big ? bignumber(1) : cplx ? complex(1) : 1;\n    return multiply(divideScalar(one, norm(v)), v);\n  }\n  return complexEigs;\n}","import { clone } from '../../../utils/object.js';\nexport function createRealSymmetric(_ref) {\n  var {\n    config,\n    addScalar,\n    subtract,\n    abs,\n    atan,\n    cos,\n    sin,\n    multiplyScalar,\n    inv,\n    bignumber,\n    multiply,\n    add\n  } = _ref;\n  /**\n   * @param {number[] | BigNumber[]} arr\n   * @param {number} N\n   * @param {number} prec\n   * @param {'number' | 'BigNumber'} type\n   */\n  function main(arr, N) {\n    var prec = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : config.epsilon;\n    var type = arguments.length > 3 ? arguments[3] : undefined;\n    var computeVectors = arguments.length > 4 ? arguments[4] : undefined;\n    if (type === 'number') {\n      return diag(arr, prec, computeVectors);\n    }\n    if (type === 'BigNumber') {\n      return diagBig(arr, prec, computeVectors);\n    }\n    throw TypeError('Unsupported data type: ' + type);\n  }\n\n  // diagonalization implementation for number (efficient)\n  function diag(x, precision, computeVectors) {\n    var N = x.length;\n    var e0 = Math.abs(precision / N);\n    var psi;\n    var Sij;\n    if (computeVectors) {\n      Sij = new Array(N);\n      // Sij is Identity Matrix\n      for (var i = 0; i < N; i++) {\n        Sij[i] = Array(N).fill(0);\n        Sij[i][i] = 1.0;\n      }\n    }\n    // initial error\n    var Vab = getAij(x);\n    while (Math.abs(Vab[1]) >= Math.abs(e0)) {\n      var _i = Vab[0][0];\n      var j = Vab[0][1];\n      psi = getTheta(x[_i][_i], x[j][j], x[_i][j]);\n      x = x1(x, psi, _i, j);\n      if (computeVectors) Sij = Sij1(Sij, psi, _i, j);\n      Vab = getAij(x);\n    }\n    var Ei = Array(N).fill(0); // eigenvalues\n    for (var _i2 = 0; _i2 < N; _i2++) {\n      Ei[_i2] = x[_i2][_i2];\n    }\n    return sorting(clone(Ei), Sij, computeVectors);\n  }\n\n  // diagonalization implementation for bigNumber\n  function diagBig(x, precision, computeVectors) {\n    var N = x.length;\n    var e0 = abs(precision / N);\n    var psi;\n    var Sij;\n    if (computeVectors) {\n      Sij = new Array(N);\n      // Sij is Identity Matrix\n      for (var i = 0; i < N; i++) {\n        Sij[i] = Array(N).fill(0);\n        Sij[i][i] = 1.0;\n      }\n    }\n    // initial error\n    var Vab = getAijBig(x);\n    while (abs(Vab[1]) >= abs(e0)) {\n      var _i3 = Vab[0][0];\n      var j = Vab[0][1];\n      psi = getThetaBig(x[_i3][_i3], x[j][j], x[_i3][j]);\n      x = x1Big(x, psi, _i3, j);\n      if (computeVectors) Sij = Sij1Big(Sij, psi, _i3, j);\n      Vab = getAijBig(x);\n    }\n    var Ei = Array(N).fill(0); // eigenvalues\n    for (var _i4 = 0; _i4 < N; _i4++) {\n      Ei[_i4] = x[_i4][_i4];\n    }\n    // return [clone(Ei), clone(Sij)]\n    return sorting(clone(Ei), Sij, computeVectors);\n  }\n\n  // get angle\n  function getTheta(aii, ajj, aij) {\n    var denom = ajj - aii;\n    if (Math.abs(denom) <= config.epsilon) {\n      return Math.PI / 4.0;\n    } else {\n      return 0.5 * Math.atan(2.0 * aij / (ajj - aii));\n    }\n  }\n\n  // get angle\n  function getThetaBig(aii, ajj, aij) {\n    var denom = subtract(ajj, aii);\n    if (abs(denom) <= config.epsilon) {\n      return bignumber(-1).acos().div(4);\n    } else {\n      return multiplyScalar(0.5, atan(multiply(2.0, aij, inv(denom))));\n    }\n  }\n\n  // update eigvec\n  function Sij1(Sij, theta, i, j) {\n    var N = Sij.length;\n    var c = Math.cos(theta);\n    var s = Math.sin(theta);\n    var Ski = Array(N).fill(0);\n    var Skj = Array(N).fill(0);\n    for (var k = 0; k < N; k++) {\n      Ski[k] = c * Sij[k][i] - s * Sij[k][j];\n      Skj[k] = s * Sij[k][i] + c * Sij[k][j];\n    }\n    for (var _k = 0; _k < N; _k++) {\n      Sij[_k][i] = Ski[_k];\n      Sij[_k][j] = Skj[_k];\n    }\n    return Sij;\n  }\n  // update eigvec for overlap\n  function Sij1Big(Sij, theta, i, j) {\n    var N = Sij.length;\n    var c = cos(theta);\n    var s = sin(theta);\n    var Ski = Array(N).fill(bignumber(0));\n    var Skj = Array(N).fill(bignumber(0));\n    for (var k = 0; k < N; k++) {\n      Ski[k] = subtract(multiplyScalar(c, Sij[k][i]), multiplyScalar(s, Sij[k][j]));\n      Skj[k] = addScalar(multiplyScalar(s, Sij[k][i]), multiplyScalar(c, Sij[k][j]));\n    }\n    for (var _k2 = 0; _k2 < N; _k2++) {\n      Sij[_k2][i] = Ski[_k2];\n      Sij[_k2][j] = Skj[_k2];\n    }\n    return Sij;\n  }\n\n  // update matrix\n  function x1Big(Hij, theta, i, j) {\n    var N = Hij.length;\n    var c = bignumber(cos(theta));\n    var s = bignumber(sin(theta));\n    var c2 = multiplyScalar(c, c);\n    var s2 = multiplyScalar(s, s);\n    var Aki = Array(N).fill(bignumber(0));\n    var Akj = Array(N).fill(bignumber(0));\n    // 2cs Hij\n    var csHij = multiply(bignumber(2), c, s, Hij[i][j]);\n    //  Aii\n    var Aii = addScalar(subtract(multiplyScalar(c2, Hij[i][i]), csHij), multiplyScalar(s2, Hij[j][j]));\n    var Ajj = add(multiplyScalar(s2, Hij[i][i]), csHij, multiplyScalar(c2, Hij[j][j]));\n    // 0  to i\n    for (var k = 0; k < N; k++) {\n      Aki[k] = subtract(multiplyScalar(c, Hij[i][k]), multiplyScalar(s, Hij[j][k]));\n      Akj[k] = addScalar(multiplyScalar(s, Hij[i][k]), multiplyScalar(c, Hij[j][k]));\n    }\n    // Modify Hij\n    Hij[i][i] = Aii;\n    Hij[j][j] = Ajj;\n    Hij[i][j] = bignumber(0);\n    Hij[j][i] = bignumber(0);\n    // 0  to i\n    for (var _k3 = 0; _k3 < N; _k3++) {\n      if (_k3 !== i && _k3 !== j) {\n        Hij[i][_k3] = Aki[_k3];\n        Hij[_k3][i] = Aki[_k3];\n        Hij[j][_k3] = Akj[_k3];\n        Hij[_k3][j] = Akj[_k3];\n      }\n    }\n    return Hij;\n  }\n\n  // update matrix\n  function x1(Hij, theta, i, j) {\n    var N = Hij.length;\n    var c = Math.cos(theta);\n    var s = Math.sin(theta);\n    var c2 = c * c;\n    var s2 = s * s;\n    var Aki = Array(N).fill(0);\n    var Akj = Array(N).fill(0);\n    //  Aii\n    var Aii = c2 * Hij[i][i] - 2 * c * s * Hij[i][j] + s2 * Hij[j][j];\n    var Ajj = s2 * Hij[i][i] + 2 * c * s * Hij[i][j] + c2 * Hij[j][j];\n    // 0  to i\n    for (var k = 0; k < N; k++) {\n      Aki[k] = c * Hij[i][k] - s * Hij[j][k];\n      Akj[k] = s * Hij[i][k] + c * Hij[j][k];\n    }\n    // Modify Hij\n    Hij[i][i] = Aii;\n    Hij[j][j] = Ajj;\n    Hij[i][j] = 0;\n    Hij[j][i] = 0;\n    // 0  to i\n    for (var _k4 = 0; _k4 < N; _k4++) {\n      if (_k4 !== i && _k4 !== j) {\n        Hij[i][_k4] = Aki[_k4];\n        Hij[_k4][i] = Aki[_k4];\n        Hij[j][_k4] = Akj[_k4];\n        Hij[_k4][j] = Akj[_k4];\n      }\n    }\n    return Hij;\n  }\n\n  // get max off-diagonal value from Upper Diagonal\n  function getAij(Mij) {\n    var N = Mij.length;\n    var maxMij = 0;\n    var maxIJ = [0, 1];\n    for (var i = 0; i < N; i++) {\n      for (var j = i + 1; j < N; j++) {\n        if (Math.abs(maxMij) < Math.abs(Mij[i][j])) {\n          maxMij = Math.abs(Mij[i][j]);\n          maxIJ = [i, j];\n        }\n      }\n    }\n    return [maxIJ, maxMij];\n  }\n\n  // get max off-diagonal value from Upper Diagonal\n  function getAijBig(Mij) {\n    var N = Mij.length;\n    var maxMij = 0;\n    var maxIJ = [0, 1];\n    for (var i = 0; i < N; i++) {\n      for (var j = i + 1; j < N; j++) {\n        if (abs(maxMij) < abs(Mij[i][j])) {\n          maxMij = abs(Mij[i][j]);\n          maxIJ = [i, j];\n        }\n      }\n    }\n    return [maxIJ, maxMij];\n  }\n\n  // sort results\n  function sorting(E, S, computeVectors) {\n    var N = E.length;\n    var values = Array(N);\n    var vecs;\n    if (computeVectors) {\n      vecs = Array(N);\n      for (var k = 0; k < N; k++) {\n        vecs[k] = Array(N);\n      }\n    }\n    for (var i = 0; i < N; i++) {\n      var minID = 0;\n      var minE = E[0];\n      for (var j = 0; j < E.length; j++) {\n        if (abs(E[j]) < abs(minE)) {\n          minID = j;\n          minE = E[minID];\n        }\n      }\n      values[i] = E.splice(minID, 1)[0];\n      if (computeVectors) {\n        for (var _k5 = 0; _k5 < N; _k5++) {\n          vecs[i][_k5] = S[_k5][minID];\n          S[_k5].splice(minID, 1);\n        }\n      }\n    }\n    if (!computeVectors) return {\n      values\n    };\n    var eigenvectors = vecs.map((vector, i) => ({\n      value: values[i],\n      vector\n    }));\n    return {\n      values,\n      eigenvectors\n    };\n  }\n  return main;\n}","import _extends from \"@babel/runtime/helpers/extends\";\nimport { factory } from '../../utils/factory.js';\nimport { format } from '../../utils/string.js';\nimport { createComplexEigs } from './eigs/complexEigs.js';\nimport { createRealSymmetric } from './eigs/realSymmetric.js';\nimport { typeOf, isNumber, isBigNumber, isComplex, isFraction } from '../../utils/is.js';\nvar name = 'eigs';\n\n// The absolute state of math.js's dependency system:\nvar dependencies = ['config', 'typed', 'matrix', 'addScalar', 'equal', 'subtract', 'abs', 'atan', 'cos', 'sin', 'multiplyScalar', 'divideScalar', 'inv', 'bignumber', 'multiply', 'add', 'larger', 'column', 'flatten', 'number', 'complex', 'sqrt', 'diag', 'size', 'reshape', 'qr', 'usolve', 'usolveAll', 'im', 're', 'smaller', 'matrixFromColumns', 'dot'];\nexport var createEigs = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    config,\n    typed,\n    matrix,\n    addScalar,\n    subtract,\n    equal,\n    abs,\n    atan,\n    cos,\n    sin,\n    multiplyScalar,\n    divideScalar,\n    inv,\n    bignumber,\n    multiply,\n    add,\n    larger,\n    column,\n    flatten,\n    number,\n    complex,\n    sqrt,\n    diag,\n    size,\n    reshape,\n    qr,\n    usolve,\n    usolveAll,\n    im,\n    re,\n    smaller,\n    matrixFromColumns,\n    dot\n  } = _ref;\n  var doRealSymmetric = createRealSymmetric({\n    config,\n    addScalar,\n    subtract,\n    column,\n    flatten,\n    equal,\n    abs,\n    atan,\n    cos,\n    sin,\n    multiplyScalar,\n    inv,\n    bignumber,\n    complex,\n    multiply,\n    add\n  });\n  var doComplexEigs = createComplexEigs({\n    config,\n    addScalar,\n    subtract,\n    multiply,\n    multiplyScalar,\n    flatten,\n    divideScalar,\n    sqrt,\n    abs,\n    bignumber,\n    diag,\n    size,\n    reshape,\n    qr,\n    inv,\n    usolve,\n    usolveAll,\n    equal,\n    complex,\n    larger,\n    smaller,\n    matrixFromColumns,\n    dot\n  });\n\n  /**\n   * Compute eigenvalues and optionally eigenvectors of a square matrix.\n   * The eigenvalues are sorted by their absolute value, ascending, and\n   * returned as a vector in the `values` property of the returned project.\n   * An eigenvalue with algebraic multiplicity k will be listed k times, so\n   * that the returned `values` vector always has length equal to the size\n   * of the input matrix.\n   *\n   * The `eigenvectors` property of the return value provides the eigenvectors.\n   * It is an array of plain objects: the `value` property of each gives the\n   * associated eigenvalue, and the `vector` property gives the eigenvector\n   * itself. Note that the same `value` property will occur as many times in\n   * the list provided by `eigenvectors` as the geometric multiplicity of\n   * that value.\n   *\n   * If the algorithm fails to converge, it will throw an error –\n   * in that case, however, you may still find useful information\n   * in `err.values` and `err.vectors`.\n   *\n   * Note that the 'precision' option does not directly specify the _accuracy_\n   * of the returned eigenvalues. Rather, it determines how small an entry\n   * of the iterative approximations to an upper triangular matrix must be\n   * in order to be considered zero. The actual accuracy of the returned\n   * eigenvalues may be greater or less than the precision, depending on the\n   * conditioning of the matrix and how far apart or close the actual\n   * eigenvalues are. Note that currently, relatively simple, \"traditional\"\n   * methods of eigenvalue computation are being used; this is not a modern,\n   * high-precision eigenvalue computation. That said, it should typically\n   * produce fairly reasonable results.\n   *\n   * Syntax:\n   *\n   *     math.eigs(x, [prec])\n   *     math.eigs(x, {options})\n   *\n   * Examples:\n   *\n   *     const { eigs, multiply, column, transpose, matrixFromColumns } = math\n   *     const H = [[5, 2.3], [2.3, 1]]\n   *     const ans = eigs(H) // returns {values: [E1,E2...sorted], eigenvectors: [{value: E1, vector: v2}, {value: e, vector: v2}, ...]\n   *     const E = ans.values\n   *     const V = ans.eigenvectors\n   *     multiply(H, V[0].vector)) // returns multiply(E[0], V[0].vector))\n   *     const U = matrixFromColumns(...V.map(obj => obj.vector))\n   *     const UTxHxU = multiply(transpose(U), H, U) // diagonalizes H if possible\n   *     E[0] == UTxHxU[0][0]  // returns true always\n   *\n   *     // Compute only approximate eigenvalues:\n   *     const {values} = eigs(H, {eigenvectors: false, precision: 1e-6})\n   *\n   * See also:\n   *\n   *     inv\n   *\n   * @param {Array | Matrix} x  Matrix to be diagonalized\n   *\n   * @param {number | BigNumber | OptsObject} [opts] Object with keys `precision`, defaulting to config.epsilon, and `eigenvectors`, defaulting to true and specifying whether to compute eigenvectors. If just a number, specifies precision.\n   * @return {{values: Array|Matrix, eigenvectors?: Array<EVobj>}} Object containing an array of eigenvalues and an array of {value: number|BigNumber, vector: Array|Matrix} objects. The eigenvectors property is undefined if eigenvectors were not requested.\n   *\n   */\n  return typed('eigs', {\n    // The conversion to matrix in the first two implementations,\n    // just to convert back to an array right away in\n    // computeValuesAndVectors, is unfortunate, and should perhaps be\n    // streamlined. It is done because the Matrix object carries some\n    // type information about its entries, and so constructing the matrix\n    // is a roundabout way of doing type detection.\n    Array: function Array(x) {\n      return doEigs(matrix(x));\n    },\n    'Array, number|BigNumber': function ArrayNumberBigNumber(x, prec) {\n      return doEigs(matrix(x), {\n        precision: prec\n      });\n    },\n    'Array, Object'(x, opts) {\n      return doEigs(matrix(x), opts);\n    },\n    Matrix: function Matrix(mat) {\n      return doEigs(mat, {\n        matricize: true\n      });\n    },\n    'Matrix, number|BigNumber': function MatrixNumberBigNumber(mat, prec) {\n      return doEigs(mat, {\n        precision: prec,\n        matricize: true\n      });\n    },\n    'Matrix, Object': function MatrixObject(mat, opts) {\n      var useOpts = {\n        matricize: true\n      };\n      _extends(useOpts, opts);\n      return doEigs(mat, useOpts);\n    }\n  });\n  function doEigs(mat) {\n    var _opts$precision;\n    var opts = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    var computeVectors = 'eigenvectors' in opts ? opts.eigenvectors : true;\n    var prec = (_opts$precision = opts.precision) !== null && _opts$precision !== void 0 ? _opts$precision : config.epsilon;\n    var result = computeValuesAndVectors(mat, prec, computeVectors);\n    if (opts.matricize) {\n      result.values = matrix(result.values);\n      if (computeVectors) {\n        result.eigenvectors = result.eigenvectors.map(_ref2 => {\n          var {\n            value,\n            vector\n          } = _ref2;\n          return {\n            value,\n            vector: matrix(vector)\n          };\n        });\n      }\n    }\n    if (computeVectors) {\n      Object.defineProperty(result, 'vectors', {\n        enumerable: false,\n        // to make sure that the eigenvectors can still be\n        // converted to string.\n        get: () => {\n          throw new Error('eigs(M).vectors replaced with eigs(M).eigenvectors');\n        }\n      });\n    }\n    return result;\n  }\n  function computeValuesAndVectors(mat, prec, computeVectors) {\n    var arr = mat.toArray(); // NOTE: arr is guaranteed to be unaliased\n    // and so safe to modify in place\n    var asize = mat.size();\n    if (asize.length !== 2 || asize[0] !== asize[1]) {\n      throw new RangeError(\"Matrix must be square (size: \".concat(format(asize), \")\"));\n    }\n    var N = asize[0];\n    if (isReal(arr, N, prec)) {\n      coerceReal(arr, N); // modifies arr by side effect\n\n      if (isSymmetric(arr, N, prec)) {\n        var _type = coerceTypes(mat, arr, N); // modifies arr by side effect\n        return doRealSymmetric(arr, N, prec, _type, computeVectors);\n      }\n    }\n    var type = coerceTypes(mat, arr, N); // modifies arr by side effect\n    return doComplexEigs(arr, N, prec, type, computeVectors);\n  }\n\n  /** @return {boolean} */\n  function isSymmetric(arr, N, prec) {\n    for (var i = 0; i < N; i++) {\n      for (var j = i; j < N; j++) {\n        // TODO proper comparison of bignum and frac\n        if (larger(bignumber(abs(subtract(arr[i][j], arr[j][i]))), prec)) {\n          return false;\n        }\n      }\n    }\n    return true;\n  }\n\n  /** @return {boolean} */\n  function isReal(arr, N, prec) {\n    for (var i = 0; i < N; i++) {\n      for (var j = 0; j < N; j++) {\n        // TODO proper comparison of bignum and frac\n        if (larger(bignumber(abs(im(arr[i][j]))), prec)) {\n          return false;\n        }\n      }\n    }\n    return true;\n  }\n  function coerceReal(arr, N) {\n    for (var i = 0; i < N; i++) {\n      for (var j = 0; j < N; j++) {\n        arr[i][j] = re(arr[i][j]);\n      }\n    }\n  }\n\n  /** @return {'number' | 'BigNumber' | 'Complex'} */\n  function coerceTypes(mat, arr, N) {\n    /** @type {string} */\n    var type = mat.datatype();\n    if (type === 'number' || type === 'BigNumber' || type === 'Complex') {\n      return type;\n    }\n    var hasNumber = false;\n    var hasBig = false;\n    var hasComplex = false;\n    for (var i = 0; i < N; i++) {\n      for (var j = 0; j < N; j++) {\n        var el = arr[i][j];\n        if (isNumber(el) || isFraction(el)) {\n          hasNumber = true;\n        } else if (isBigNumber(el)) {\n          hasBig = true;\n        } else if (isComplex(el)) {\n          hasComplex = true;\n        } else {\n          throw TypeError('Unsupported type in Matrix: ' + typeOf(el));\n        }\n      }\n    }\n    if (hasBig && hasComplex) {\n      console.warn('Complex BigNumbers not supported, this operation will lose precission.');\n    }\n    if (hasComplex) {\n      for (var _i = 0; _i < N; _i++) {\n        for (var _j = 0; _j < N; _j++) {\n          arr[_i][_j] = complex(arr[_i][_j]);\n        }\n      }\n      return 'Complex';\n    }\n    if (hasBig) {\n      for (var _i2 = 0; _i2 < N; _i2++) {\n        for (var _j2 = 0; _j2 < N; _j2++) {\n          arr[_i2][_j2] = bignumber(arr[_i2][_j2]);\n        }\n      }\n      return 'BigNumber';\n    }\n    if (hasNumber) {\n      for (var _i3 = 0; _i3 < N; _i3++) {\n        for (var _j3 = 0; _j3 < N; _j3++) {\n          arr[_i3][_j3] = number(arr[_i3][_j3]);\n        }\n      }\n      return 'number';\n    } else {\n      throw TypeError('Matrix contains unsupported types only.');\n    }\n  }\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { config } from './configReadonly.js';\nimport { createBigNumberClass, createComplexClass, createE, createFalse, createFineStructure, createFractionClass, createI, createInfinity, createLN10, createLOG10E, createMatrixClass, createNaN, createNull, createPhi, createRangeClass, createResultSet, createSQRT1_2,\n// eslint-disable-line camelcase\ncreateSackurTetrode, createTau, createTrue, createVersion, createDenseMatrixClass, createEfimovFactor, createLN2, createPi, createReplacer, createSQRT2, createTyped, createUnaryPlus, createWeakMixingAngle, createAbs, createAcos, createAcot, createAcsc, createAddScalar, createArg, createAsech, createAsinh, createAtan, createAtanh, createBignumber, createBitNot, createBoolean, createClone, createCombinations, createComplex, createConj, createCos, createCot, createCsc, createCube, createEqualScalar, createErf, createExp, createExpm1, createFilter, createForEach, createFormat, createGetMatrixDataType, createHex, createIm, createIsInteger, createIsNegative, createIsPositive, createIsZero, createLOG2E, createLgamma, createLog10, createLog2, createMap, createMultiplyScalar, createNot, createNumber, createOct, createPickRandom, createPrint, createRandom, createRe, createSec, createSign, createSin, createSparseMatrixClass, createSplitUnit, createSquare, createString, createSubtractScalar, createTan, createTypeOf, createAcosh, createAcsch, createApply, createAsec, createBin, createCombinationsWithRep, createCosh, createCsch, createIsNaN, createIsPrime, createRandomInt, createSech, createSinh, createSparse, createSqrt, createTanh, createUnaryMinus, createAcoth, createCoth, createFraction, createIsNumeric, createMatrix, createMatrixFromFunction, createMode, createNumeric, createProd, createReshape, createSize, createSqueeze, createTranspose, createXgcd, createZeros, createAsin, createCbrt, createConcat, createCount, createCtranspose, createDiag, createDivideScalar, createDotDivide, createEqual, createFlatten, createHasNumericValue, createIdentity, createKron, createLargerEq, createLeftShift, createLsolve, createMatrixFromColumns, createNthRoot, createOnes, createQr, createResize, createRightArithShift, createRound, createSmaller, createSubtract, createTo, createUnequal, createUsolve, createXor, createAdd, createAtan2, createBitAnd, createBitOr, createBitXor, createCatalan, createCompare, createCompareText, createCumSum, createDeepEqual, createDiff, createDistance, createDot, createEqualText, createFloor, createGcd, createHypot, createImmutableDenseMatrixClass, createIndexClass, createLarger, createLog, createLsolveAll, createMatrixFromRows, createMin, createMod, createMultiply, createNthRoots, createOr, createPartitionSelect, createRightLogShift, createSlu, createSubset, createSum, createTrace, createUsolveAll, createZpk2tf, createCeil, createCompareNatural, createComposition, createCross, createDet, createDotMultiply, createFibonacciHeapClass, createFix, createIndex, createIntersect, createInvmod, createLcm, createLog1p, createMax, createSetCartesian, createSetDistinct, createSetIsSubset, createSetPowerset, createSmallerEq, createSort, createAnd, createRange, createRow, createSetDifference, createSetMultiplicity, createSetSymDifference, createSpaClass, createColumn, createInv, createLup, createPinv, createPow, createSetIntersect, createSetUnion, createSqrtm, createUnitClass, createVacuumImpedance, createWienDisplacement, createAtomicMass, createBohrMagneton, createBoltzmann, createConductanceQuantum, createCoulomb, createDeuteronMass, createDotPow, createElectricConstant, createElementaryCharge, createExpm, createFaraday, createFft, createGamma, createGravitationConstant, createHartreeEnergy, createIfft, createKlitzing, createLoschmidt, createMagneticConstant, createMolarMass, createMolarPlanckConstant, createNeutronMass, createNuclearMagneton, createPlanckCharge, createPlanckLength, createPlanckTemperature, createProtonMass, createQuantumOfCirculation, createReducedPlanckConstant, createRydberg, createSecondRadiation, createSpeedOfLight, createStefanBoltzmann, createThomsonCrossSection, createAvogadro, createBohrRadius, createCreateUnit, createDivide, createElectronMass, createFactorial, createFirstRadiation, createGravity, createInverseConductanceQuantum, createLusolve, createMagneticFluxQuantum, createMolarMassC12, createMultinomial, createPermutations, createPlanckMass, createPolynomialRoot, createSetSize, createSolveODE, createStirlingS2, createUnitFunction, createBellNumbers, createEigs, createFermiCoupling, createGasConstant, createKldivergence, createMean, createMolarVolume, createPlanckConstant, createQuantileSeq, createVariance, createClassicalElectronRadius, createMedian, createCorr, createFreqz, createMad, createStd, createZeta, createNorm, createRotationMatrix, createPlanckTime, createSchur, createRotate, createSylvester, createLyap } from '../factoriesAny.js';\nexport var BigNumber = /* #__PURE__ */createBigNumberClass({\n  config\n});\nexport var Complex = /* #__PURE__ */createComplexClass({});\nexport var e = /* #__PURE__ */createE({\n  BigNumber,\n  config\n});\nexport var _false = /* #__PURE__ */createFalse({});\nexport var fineStructure = /* #__PURE__ */createFineStructure({\n  BigNumber,\n  config\n});\nexport var Fraction = /* #__PURE__ */createFractionClass({});\nexport var i = /* #__PURE__ */createI({\n  Complex\n});\nexport var _Infinity = /* #__PURE__ */createInfinity({\n  BigNumber,\n  config\n});\nexport var LN10 = /* #__PURE__ */createLN10({\n  BigNumber,\n  config\n});\nexport var LOG10E = /* #__PURE__ */createLOG10E({\n  BigNumber,\n  config\n});\nexport var Matrix = /* #__PURE__ */createMatrixClass({});\nexport var _NaN = /* #__PURE__ */createNaN({\n  BigNumber,\n  config\n});\nexport var _null = /* #__PURE__ */createNull({});\nexport var phi = /* #__PURE__ */createPhi({\n  BigNumber,\n  config\n});\nexport var Range = /* #__PURE__ */createRangeClass({});\nexport var ResultSet = /* #__PURE__ */createResultSet({});\nexport var SQRT1_2 = /* #__PURE__ */createSQRT1_2({\n  BigNumber,\n  config\n});\nexport var sackurTetrode = /* #__PURE__ */createSackurTetrode({\n  BigNumber,\n  config\n});\nexport var tau = /* #__PURE__ */createTau({\n  BigNumber,\n  config\n});\nexport var _true = /* #__PURE__ */createTrue({});\nexport var version = /* #__PURE__ */createVersion({});\nexport var DenseMatrix = /* #__PURE__ */createDenseMatrixClass({\n  Matrix\n});\nexport var efimovFactor = /* #__PURE__ */createEfimovFactor({\n  BigNumber,\n  config\n});\nexport var LN2 = /* #__PURE__ */createLN2({\n  BigNumber,\n  config\n});\nexport var pi = /* #__PURE__ */createPi({\n  BigNumber,\n  config\n});\nexport var replacer = /* #__PURE__ */createReplacer({});\nexport var SQRT2 = /* #__PURE__ */createSQRT2({\n  BigNumber,\n  config\n});\nexport var typed = /* #__PURE__ */createTyped({\n  BigNumber,\n  Complex,\n  DenseMatrix,\n  Fraction\n});\nexport var unaryPlus = /* #__PURE__ */createUnaryPlus({\n  BigNumber,\n  config,\n  typed\n});\nexport var weakMixingAngle = /* #__PURE__ */createWeakMixingAngle({\n  BigNumber,\n  config\n});\nexport var abs = /* #__PURE__ */createAbs({\n  typed\n});\nexport var acos = /* #__PURE__ */createAcos({\n  Complex,\n  config,\n  typed\n});\nexport var acot = /* #__PURE__ */createAcot({\n  BigNumber,\n  typed\n});\nexport var acsc = /* #__PURE__ */createAcsc({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var addScalar = /* #__PURE__ */createAddScalar({\n  typed\n});\nexport var arg = /* #__PURE__ */createArg({\n  typed\n});\nexport var asech = /* #__PURE__ */createAsech({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var asinh = /* #__PURE__ */createAsinh({\n  typed\n});\nexport var atan = /* #__PURE__ */createAtan({\n  typed\n});\nexport var atanh = /* #__PURE__ */createAtanh({\n  Complex,\n  config,\n  typed\n});\nexport var bignumber = /* #__PURE__ */createBignumber({\n  BigNumber,\n  typed\n});\nexport var bitNot = /* #__PURE__ */createBitNot({\n  typed\n});\nexport var boolean = /* #__PURE__ */createBoolean({\n  typed\n});\nexport var clone = /* #__PURE__ */createClone({\n  typed\n});\nexport var combinations = /* #__PURE__ */createCombinations({\n  typed\n});\nexport var complex = /* #__PURE__ */createComplex({\n  Complex,\n  typed\n});\nexport var conj = /* #__PURE__ */createConj({\n  typed\n});\nexport var cos = /* #__PURE__ */createCos({\n  typed\n});\nexport var cot = /* #__PURE__ */createCot({\n  BigNumber,\n  typed\n});\nexport var csc = /* #__PURE__ */createCsc({\n  BigNumber,\n  typed\n});\nexport var cube = /* #__PURE__ */createCube({\n  typed\n});\nexport var equalScalar = /* #__PURE__ */createEqualScalar({\n  config,\n  typed\n});\nexport var erf = /* #__PURE__ */createErf({\n  typed\n});\nexport var exp = /* #__PURE__ */createExp({\n  typed\n});\nexport var expm1 = /* #__PURE__ */createExpm1({\n  Complex,\n  typed\n});\nexport var filter = /* #__PURE__ */createFilter({\n  typed\n});\nexport var forEach = /* #__PURE__ */createForEach({\n  typed\n});\nexport var format = /* #__PURE__ */createFormat({\n  typed\n});\nexport var getMatrixDataType = /* #__PURE__ */createGetMatrixDataType({\n  typed\n});\nexport var hex = /* #__PURE__ */createHex({\n  format,\n  typed\n});\nexport var im = /* #__PURE__ */createIm({\n  typed\n});\nexport var isInteger = /* #__PURE__ */createIsInteger({\n  typed\n});\nexport var isNegative = /* #__PURE__ */createIsNegative({\n  typed\n});\nexport var isPositive = /* #__PURE__ */createIsPositive({\n  typed\n});\nexport var isZero = /* #__PURE__ */createIsZero({\n  typed\n});\nexport var LOG2E = /* #__PURE__ */createLOG2E({\n  BigNumber,\n  config\n});\nexport var lgamma = /* #__PURE__ */createLgamma({\n  Complex,\n  typed\n});\nexport var log10 = /* #__PURE__ */createLog10({\n  Complex,\n  config,\n  typed\n});\nexport var log2 = /* #__PURE__ */createLog2({\n  Complex,\n  config,\n  typed\n});\nexport var map = /* #__PURE__ */createMap({\n  typed\n});\nexport var multiplyScalar = /* #__PURE__ */createMultiplyScalar({\n  typed\n});\nexport var not = /* #__PURE__ */createNot({\n  typed\n});\nexport var number = /* #__PURE__ */createNumber({\n  typed\n});\nexport var oct = /* #__PURE__ */createOct({\n  format,\n  typed\n});\nexport var pickRandom = /* #__PURE__ */createPickRandom({\n  config,\n  typed\n});\nexport var print = /* #__PURE__ */createPrint({\n  typed\n});\nexport var random = /* #__PURE__ */createRandom({\n  config,\n  typed\n});\nexport var re = /* #__PURE__ */createRe({\n  typed\n});\nexport var sec = /* #__PURE__ */createSec({\n  BigNumber,\n  typed\n});\nexport var sign = /* #__PURE__ */createSign({\n  BigNumber,\n  Fraction,\n  complex,\n  typed\n});\nexport var sin = /* #__PURE__ */createSin({\n  typed\n});\nexport var SparseMatrix = /* #__PURE__ */createSparseMatrixClass({\n  Matrix,\n  equalScalar,\n  typed\n});\nexport var splitUnit = /* #__PURE__ */createSplitUnit({\n  typed\n});\nexport var square = /* #__PURE__ */createSquare({\n  typed\n});\nexport var string = /* #__PURE__ */createString({\n  typed\n});\nexport var subtractScalar = /* #__PURE__ */createSubtractScalar({\n  typed\n});\nexport var tan = /* #__PURE__ */createTan({\n  typed\n});\nexport var typeOf = /* #__PURE__ */createTypeOf({\n  typed\n});\nexport var acosh = /* #__PURE__ */createAcosh({\n  Complex,\n  config,\n  typed\n});\nexport var acsch = /* #__PURE__ */createAcsch({\n  BigNumber,\n  typed\n});\nexport var apply = /* #__PURE__ */createApply({\n  isInteger,\n  typed\n});\nexport var asec = /* #__PURE__ */createAsec({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var bin = /* #__PURE__ */createBin({\n  format,\n  typed\n});\nexport var combinationsWithRep = /* #__PURE__ */createCombinationsWithRep({\n  typed\n});\nexport var cosh = /* #__PURE__ */createCosh({\n  typed\n});\nexport var csch = /* #__PURE__ */createCsch({\n  BigNumber,\n  typed\n});\nexport var isNaN = /* #__PURE__ */createIsNaN({\n  typed\n});\nexport var isPrime = /* #__PURE__ */createIsPrime({\n  typed\n});\nexport var randomInt = /* #__PURE__ */createRandomInt({\n  config,\n  typed\n});\nexport var sech = /* #__PURE__ */createSech({\n  BigNumber,\n  typed\n});\nexport var sinh = /* #__PURE__ */createSinh({\n  typed\n});\nexport var sparse = /* #__PURE__ */createSparse({\n  SparseMatrix,\n  typed\n});\nexport var sqrt = /* #__PURE__ */createSqrt({\n  Complex,\n  config,\n  typed\n});\nexport var tanh = /* #__PURE__ */createTanh({\n  typed\n});\nexport var unaryMinus = /* #__PURE__ */createUnaryMinus({\n  typed\n});\nexport var acoth = /* #__PURE__ */createAcoth({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var coth = /* #__PURE__ */createCoth({\n  BigNumber,\n  typed\n});\nexport var fraction = /* #__PURE__ */createFraction({\n  Fraction,\n  typed\n});\nexport var isNumeric = /* #__PURE__ */createIsNumeric({\n  typed\n});\nexport var matrix = /* #__PURE__ */createMatrix({\n  DenseMatrix,\n  Matrix,\n  SparseMatrix,\n  typed\n});\nexport var matrixFromFunction = /* #__PURE__ */createMatrixFromFunction({\n  isZero,\n  matrix,\n  typed\n});\nexport var mode = /* #__PURE__ */createMode({\n  isNaN,\n  isNumeric,\n  typed\n});\nexport var numeric = /* #__PURE__ */createNumeric({\n  bignumber,\n  fraction,\n  number\n});\nexport var prod = /* #__PURE__ */createProd({\n  config,\n  multiplyScalar,\n  numeric,\n  typed\n});\nexport var reshape = /* #__PURE__ */createReshape({\n  isInteger,\n  matrix,\n  typed\n});\nexport var size = /* #__PURE__ */createSize({\n  matrix,\n  config,\n  typed\n});\nexport var squeeze = /* #__PURE__ */createSqueeze({\n  matrix,\n  typed\n});\nexport var transpose = /* #__PURE__ */createTranspose({\n  matrix,\n  typed\n});\nexport var xgcd = /* #__PURE__ */createXgcd({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var zeros = /* #__PURE__ */createZeros({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var asin = /* #__PURE__ */createAsin({\n  Complex,\n  config,\n  typed\n});\nexport var cbrt = /* #__PURE__ */createCbrt({\n  BigNumber,\n  Complex,\n  Fraction,\n  config,\n  isNegative,\n  matrix,\n  typed,\n  unaryMinus\n});\nexport var concat = /* #__PURE__ */createConcat({\n  isInteger,\n  matrix,\n  typed\n});\nexport var count = /* #__PURE__ */createCount({\n  prod,\n  size,\n  typed\n});\nexport var ctranspose = /* #__PURE__ */createCtranspose({\n  conj,\n  transpose,\n  typed\n});\nexport var diag = /* #__PURE__ */createDiag({\n  DenseMatrix,\n  SparseMatrix,\n  matrix,\n  typed\n});\nexport var divideScalar = /* #__PURE__ */createDivideScalar({\n  numeric,\n  typed\n});\nexport var dotDivide = /* #__PURE__ */createDotDivide({\n  DenseMatrix,\n  concat,\n  divideScalar,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var equal = /* #__PURE__ */createEqual({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var flatten = /* #__PURE__ */createFlatten({\n  matrix,\n  typed\n});\nexport var hasNumericValue = /* #__PURE__ */createHasNumericValue({\n  isNumeric,\n  typed\n});\nexport var identity = /* #__PURE__ */createIdentity({\n  BigNumber,\n  DenseMatrix,\n  SparseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var kron = /* #__PURE__ */createKron({\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var largerEq = /* #__PURE__ */createLargerEq({\n  DenseMatrix,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var leftShift = /* #__PURE__ */createLeftShift({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var lsolve = /* #__PURE__ */createLsolve({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var matrixFromColumns = /* #__PURE__ */createMatrixFromColumns({\n  flatten,\n  matrix,\n  size,\n  typed\n});\nexport var nthRoot = /* #__PURE__ */createNthRoot({\n  BigNumber,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var ones = /* #__PURE__ */createOnes({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var qr = /* #__PURE__ */createQr({\n  addScalar,\n  complex,\n  conj,\n  divideScalar,\n  equal,\n  identity,\n  isZero,\n  matrix,\n  multiplyScalar,\n  sign,\n  sqrt,\n  subtractScalar,\n  typed,\n  unaryMinus,\n  zeros\n});\nexport var resize = /* #__PURE__ */createResize({\n  config,\n  matrix\n});\nexport var rightArithShift = /* #__PURE__ */createRightArithShift({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var round = /* #__PURE__ */createRound({\n  BigNumber,\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var smaller = /* #__PURE__ */createSmaller({\n  DenseMatrix,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var subtract = /* #__PURE__ */createSubtract({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  subtractScalar,\n  typed,\n  unaryMinus\n});\nexport var to = /* #__PURE__ */createTo({\n  concat,\n  matrix,\n  typed\n});\nexport var unequal = /* #__PURE__ */createUnequal({\n  DenseMatrix,\n  concat,\n  config,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var usolve = /* #__PURE__ */createUsolve({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var xor = /* #__PURE__ */createXor({\n  DenseMatrix,\n  concat,\n  matrix,\n  typed\n});\nexport var add = /* #__PURE__ */createAdd({\n  DenseMatrix,\n  SparseMatrix,\n  addScalar,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var atan2 = /* #__PURE__ */createAtan2({\n  BigNumber,\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitAnd = /* #__PURE__ */createBitAnd({\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitOr = /* #__PURE__ */createBitOr({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitXor = /* #__PURE__ */createBitXor({\n  DenseMatrix,\n  concat,\n  matrix,\n  typed\n});\nexport var catalan = /* #__PURE__ */createCatalan({\n  addScalar,\n  combinations,\n  divideScalar,\n  isInteger,\n  isNegative,\n  multiplyScalar,\n  typed\n});\nexport var compare = /* #__PURE__ */createCompare({\n  BigNumber,\n  DenseMatrix,\n  Fraction,\n  concat,\n  config,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var compareText = /* #__PURE__ */createCompareText({\n  concat,\n  matrix,\n  typed\n});\nexport var cumsum = /* #__PURE__ */createCumSum({\n  add,\n  typed,\n  unaryPlus\n});\nexport var deepEqual = /* #__PURE__ */createDeepEqual({\n  equal,\n  typed\n});\nexport var diff = /* #__PURE__ */createDiff({\n  matrix,\n  number,\n  subtract,\n  typed\n});\nexport var distance = /* #__PURE__ */createDistance({\n  abs,\n  addScalar,\n  deepEqual,\n  divideScalar,\n  multiplyScalar,\n  sqrt,\n  subtractScalar,\n  typed\n});\nexport var dot = /* #__PURE__ */createDot({\n  addScalar,\n  conj,\n  multiplyScalar,\n  size,\n  typed\n});\nexport var equalText = /* #__PURE__ */createEqualText({\n  compareText,\n  isZero,\n  typed\n});\nexport var floor = /* #__PURE__ */createFloor({\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var gcd = /* #__PURE__ */createGcd({\n  BigNumber,\n  DenseMatrix,\n  concat,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var hypot = /* #__PURE__ */createHypot({\n  abs,\n  addScalar,\n  divideScalar,\n  isPositive,\n  multiplyScalar,\n  smaller,\n  sqrt,\n  typed\n});\nexport var ImmutableDenseMatrix = /* #__PURE__ */createImmutableDenseMatrixClass({\n  DenseMatrix,\n  smaller\n});\nexport var Index = /* #__PURE__ */createIndexClass({\n  ImmutableDenseMatrix,\n  getMatrixDataType\n});\nexport var larger = /* #__PURE__ */createLarger({\n  DenseMatrix,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var log = /* #__PURE__ */createLog({\n  Complex,\n  config,\n  divideScalar,\n  typed\n});\nexport var lsolveAll = /* #__PURE__ */createLsolveAll({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var matrixFromRows = /* #__PURE__ */createMatrixFromRows({\n  flatten,\n  matrix,\n  size,\n  typed\n});\nexport var min = /* #__PURE__ */createMin({\n  config,\n  numeric,\n  smaller,\n  typed\n});\nexport var mod = /* #__PURE__ */createMod({\n  DenseMatrix,\n  concat,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var multiply = /* #__PURE__ */createMultiply({\n  addScalar,\n  dot,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var nthRoots = /* #__PURE__ */createNthRoots({\n  Complex,\n  config,\n  divideScalar,\n  typed\n});\nexport var or = /* #__PURE__ */createOr({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var partitionSelect = /* #__PURE__ */createPartitionSelect({\n  compare,\n  isNaN,\n  isNumeric,\n  typed\n});\nexport var rightLogShift = /* #__PURE__ */createRightLogShift({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var slu = /* #__PURE__ */createSlu({\n  SparseMatrix,\n  abs,\n  add,\n  divideScalar,\n  larger,\n  largerEq,\n  multiply,\n  subtract,\n  transpose,\n  typed\n});\nexport var subset = /* #__PURE__ */createSubset({\n  add,\n  matrix,\n  typed,\n  zeros\n});\nexport var sum = /* #__PURE__ */createSum({\n  add,\n  config,\n  numeric,\n  typed\n});\nexport var trace = /* #__PURE__ */createTrace({\n  add,\n  matrix,\n  typed\n});\nexport var usolveAll = /* #__PURE__ */createUsolveAll({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var zpk2tf = /* #__PURE__ */createZpk2tf({\n  Complex,\n  add,\n  multiply,\n  number,\n  typed\n});\nexport var ceil = /* #__PURE__ */createCeil({\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var compareNatural = /* #__PURE__ */createCompareNatural({\n  compare,\n  typed\n});\nexport var composition = /* #__PURE__ */createComposition({\n  addScalar,\n  combinations,\n  isInteger,\n  isNegative,\n  isPositive,\n  larger,\n  typed\n});\nexport var cross = /* #__PURE__ */createCross({\n  matrix,\n  multiply,\n  subtract,\n  typed\n});\nexport var det = /* #__PURE__ */createDet({\n  divideScalar,\n  isZero,\n  matrix,\n  multiply,\n  subtractScalar,\n  typed,\n  unaryMinus\n});\nexport var dotMultiply = /* #__PURE__ */createDotMultiply({\n  concat,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var FibonacciHeap = /* #__PURE__ */createFibonacciHeapClass({\n  larger,\n  smaller\n});\nexport var fix = /* #__PURE__ */createFix({\n  Complex,\n  DenseMatrix,\n  ceil,\n  equalScalar,\n  floor,\n  matrix,\n  typed,\n  zeros\n});\nexport var index = /* #__PURE__ */createIndex({\n  Index,\n  typed\n});\nexport var intersect = /* #__PURE__ */createIntersect({\n  abs,\n  add,\n  addScalar,\n  config,\n  divideScalar,\n  equalScalar,\n  flatten,\n  isNumeric,\n  isZero,\n  matrix,\n  multiply,\n  multiplyScalar,\n  smaller,\n  subtract,\n  typed\n});\nexport var invmod = /* #__PURE__ */createInvmod({\n  BigNumber,\n  add,\n  config,\n  equal,\n  isInteger,\n  mod,\n  smaller,\n  typed,\n  xgcd\n});\nexport var lcm = /* #__PURE__ */createLcm({\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var log1p = /* #__PURE__ */createLog1p({\n  Complex,\n  config,\n  divideScalar,\n  log,\n  typed\n});\nexport var max = /* #__PURE__ */createMax({\n  config,\n  larger,\n  numeric,\n  typed\n});\nexport var setCartesian = /* #__PURE__ */createSetCartesian({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setDistinct = /* #__PURE__ */createSetDistinct({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setIsSubset = /* #__PURE__ */createSetIsSubset({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setPowerset = /* #__PURE__ */createSetPowerset({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var smallerEq = /* #__PURE__ */createSmallerEq({\n  DenseMatrix,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var sort = /* #__PURE__ */createSort({\n  compare,\n  compareNatural,\n  matrix,\n  typed\n});\nexport var and = /* #__PURE__ */createAnd({\n  concat,\n  equalScalar,\n  matrix,\n  not,\n  typed,\n  zeros\n});\nexport var range = /* #__PURE__ */createRange({\n  bignumber,\n  matrix,\n  add,\n  config,\n  isPositive,\n  larger,\n  largerEq,\n  smaller,\n  smallerEq,\n  typed\n});\nexport var row = /* #__PURE__ */createRow({\n  Index,\n  matrix,\n  range,\n  typed\n});\nexport var setDifference = /* #__PURE__ */createSetDifference({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setMultiplicity = /* #__PURE__ */createSetMultiplicity({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setSymDifference = /* #__PURE__ */createSetSymDifference({\n  Index,\n  concat,\n  setDifference,\n  size,\n  subset,\n  typed\n});\nexport var Spa = /* #__PURE__ */createSpaClass({\n  FibonacciHeap,\n  addScalar,\n  equalScalar\n});\nexport var column = /* #__PURE__ */createColumn({\n  Index,\n  matrix,\n  range,\n  typed\n});\nexport var inv = /* #__PURE__ */createInv({\n  abs,\n  addScalar,\n  det,\n  divideScalar,\n  identity,\n  matrix,\n  multiply,\n  typed,\n  unaryMinus\n});\nexport var lup = /* #__PURE__ */createLup({\n  DenseMatrix,\n  Spa,\n  SparseMatrix,\n  abs,\n  addScalar,\n  divideScalar,\n  equalScalar,\n  larger,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed,\n  unaryMinus\n});\nexport var pinv = /* #__PURE__ */createPinv({\n  Complex,\n  add,\n  ctranspose,\n  deepEqual,\n  divideScalar,\n  dot,\n  dotDivide,\n  equal,\n  inv,\n  matrix,\n  multiply,\n  typed\n});\nexport var pow = /* #__PURE__ */createPow({\n  Complex,\n  config,\n  fraction,\n  identity,\n  inv,\n  matrix,\n  multiply,\n  number,\n  typed\n});\nexport var setIntersect = /* #__PURE__ */createSetIntersect({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setUnion = /* #__PURE__ */createSetUnion({\n  Index,\n  concat,\n  setIntersect,\n  setSymDifference,\n  size,\n  subset,\n  typed\n});\nexport var sqrtm = /* #__PURE__ */createSqrtm({\n  abs,\n  add,\n  identity,\n  inv,\n  map,\n  max,\n  multiply,\n  size,\n  sqrt,\n  subtract,\n  typed\n});\nexport var Unit = /* #__PURE__ */createUnitClass({\n  BigNumber,\n  Complex,\n  Fraction,\n  abs,\n  addScalar,\n  config,\n  divideScalar,\n  equal,\n  fix,\n  format,\n  isNumeric,\n  multiplyScalar,\n  number,\n  pow,\n  round,\n  subtractScalar\n});\nexport var vacuumImpedance = /* #__PURE__ */createVacuumImpedance({\n  BigNumber,\n  Unit,\n  config\n});\nexport var wienDisplacement = /* #__PURE__ */createWienDisplacement({\n  BigNumber,\n  Unit,\n  config\n});\nexport var atomicMass = /* #__PURE__ */createAtomicMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var bohrMagneton = /* #__PURE__ */createBohrMagneton({\n  BigNumber,\n  Unit,\n  config\n});\nexport var boltzmann = /* #__PURE__ */createBoltzmann({\n  BigNumber,\n  Unit,\n  config\n});\nexport var conductanceQuantum = /* #__PURE__ */createConductanceQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var coulomb = /* #__PURE__ */createCoulomb({\n  BigNumber,\n  Unit,\n  config\n});\nexport var deuteronMass = /* #__PURE__ */createDeuteronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var dotPow = /* #__PURE__ */createDotPow({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  pow,\n  typed\n});\nexport var electricConstant = /* #__PURE__ */createElectricConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var elementaryCharge = /* #__PURE__ */createElementaryCharge({\n  BigNumber,\n  Unit,\n  config\n});\nexport var expm = /* #__PURE__ */createExpm({\n  abs,\n  add,\n  identity,\n  inv,\n  multiply,\n  typed\n});\nexport var faraday = /* #__PURE__ */createFaraday({\n  BigNumber,\n  Unit,\n  config\n});\nexport var fft = /* #__PURE__ */createFft({\n  addScalar,\n  ceil,\n  conj,\n  divideScalar,\n  dotDivide,\n  exp,\n  i,\n  log2,\n  matrix,\n  multiplyScalar,\n  pow,\n  tau,\n  typed\n});\nexport var gamma = /* #__PURE__ */createGamma({\n  BigNumber,\n  Complex,\n  config,\n  multiplyScalar,\n  pow,\n  typed\n});\nexport var gravitationConstant = /* #__PURE__ */createGravitationConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var hartreeEnergy = /* #__PURE__ */createHartreeEnergy({\n  BigNumber,\n  Unit,\n  config\n});\nexport var ifft = /* #__PURE__ */createIfft({\n  conj,\n  dotDivide,\n  fft,\n  typed\n});\nexport var klitzing = /* #__PURE__ */createKlitzing({\n  BigNumber,\n  Unit,\n  config\n});\nexport var loschmidt = /* #__PURE__ */createLoschmidt({\n  BigNumber,\n  Unit,\n  config\n});\nexport var magneticConstant = /* #__PURE__ */createMagneticConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarMass = /* #__PURE__ */createMolarMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarPlanckConstant = /* #__PURE__ */createMolarPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var neutronMass = /* #__PURE__ */createNeutronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var nuclearMagneton = /* #__PURE__ */createNuclearMagneton({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckCharge = /* #__PURE__ */createPlanckCharge({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckLength = /* #__PURE__ */createPlanckLength({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckTemperature = /* #__PURE__ */createPlanckTemperature({\n  BigNumber,\n  Unit,\n  config\n});\nexport var protonMass = /* #__PURE__ */createProtonMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var quantumOfCirculation = /* #__PURE__ */createQuantumOfCirculation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var reducedPlanckConstant = /* #__PURE__ */createReducedPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var rydberg = /* #__PURE__ */createRydberg({\n  BigNumber,\n  Unit,\n  config\n});\nexport var secondRadiation = /* #__PURE__ */createSecondRadiation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var speedOfLight = /* #__PURE__ */createSpeedOfLight({\n  BigNumber,\n  Unit,\n  config\n});\nexport var stefanBoltzmann = /* #__PURE__ */createStefanBoltzmann({\n  BigNumber,\n  Unit,\n  config\n});\nexport var thomsonCrossSection = /* #__PURE__ */createThomsonCrossSection({\n  BigNumber,\n  Unit,\n  config\n});\nexport var avogadro = /* #__PURE__ */createAvogadro({\n  BigNumber,\n  Unit,\n  config\n});\nexport var bohrRadius = /* #__PURE__ */createBohrRadius({\n  BigNumber,\n  Unit,\n  config\n});\nexport var createUnit = /* #__PURE__ */createCreateUnit({\n  Unit,\n  typed\n});\nexport var divide = /* #__PURE__ */createDivide({\n  divideScalar,\n  equalScalar,\n  inv,\n  matrix,\n  multiply,\n  typed\n});\nexport var electronMass = /* #__PURE__ */createElectronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var factorial = /* #__PURE__ */createFactorial({\n  gamma,\n  typed\n});\nexport var firstRadiation = /* #__PURE__ */createFirstRadiation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gravity = /* #__PURE__ */createGravity({\n  BigNumber,\n  Unit,\n  config\n});\nexport var inverseConductanceQuantum = /* #__PURE__ */createInverseConductanceQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var lusolve = /* #__PURE__ */createLusolve({\n  DenseMatrix,\n  lsolve,\n  lup,\n  matrix,\n  slu,\n  typed,\n  usolve\n});\nexport var magneticFluxQuantum = /* #__PURE__ */createMagneticFluxQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarMassC12 = /* #__PURE__ */createMolarMassC12({\n  BigNumber,\n  Unit,\n  config\n});\nexport var multinomial = /* #__PURE__ */createMultinomial({\n  add,\n  divide,\n  factorial,\n  isInteger,\n  isPositive,\n  multiply,\n  typed\n});\nexport var permutations = /* #__PURE__ */createPermutations({\n  factorial,\n  typed\n});\nexport var planckMass = /* #__PURE__ */createPlanckMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var polynomialRoot = /* #__PURE__ */createPolynomialRoot({\n  add,\n  cbrt,\n  divide,\n  equalScalar,\n  im,\n  isZero,\n  multiply,\n  re,\n  sqrt,\n  subtract,\n  typeOf,\n  typed,\n  unaryMinus\n});\nexport var setSize = /* #__PURE__ */createSetSize({\n  compareNatural,\n  typed\n});\nexport var solveODE = /* #__PURE__ */createSolveODE({\n  abs,\n  add,\n  bignumber,\n  divide,\n  isNegative,\n  isPositive,\n  larger,\n  map,\n  matrix,\n  max,\n  multiply,\n  smaller,\n  subtract,\n  typed,\n  unaryMinus\n});\nexport var stirlingS2 = /* #__PURE__ */createStirlingS2({\n  bignumber,\n  addScalar,\n  combinations,\n  divideScalar,\n  factorial,\n  isInteger,\n  isNegative,\n  larger,\n  multiplyScalar,\n  number,\n  pow,\n  subtractScalar,\n  typed\n});\nexport var unit = /* #__PURE__ */createUnitFunction({\n  Unit,\n  typed\n});\nexport var bellNumbers = /* #__PURE__ */createBellNumbers({\n  addScalar,\n  isInteger,\n  isNegative,\n  stirlingS2,\n  typed\n});\nexport var eigs = /* #__PURE__ */createEigs({\n  abs,\n  add,\n  addScalar,\n  atan,\n  bignumber,\n  column,\n  complex,\n  config,\n  cos,\n  diag,\n  divideScalar,\n  dot,\n  equal,\n  flatten,\n  im,\n  inv,\n  larger,\n  matrix,\n  matrixFromColumns,\n  multiply,\n  multiplyScalar,\n  number,\n  qr,\n  re,\n  reshape,\n  sin,\n  size,\n  smaller,\n  sqrt,\n  subtract,\n  typed,\n  usolve,\n  usolveAll\n});\nexport var fermiCoupling = /* #__PURE__ */createFermiCoupling({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gasConstant = /* #__PURE__ */createGasConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var kldivergence = /* #__PURE__ */createKldivergence({\n  divide,\n  dotDivide,\n  isNumeric,\n  log,\n  map,\n  matrix,\n  multiply,\n  sum,\n  typed\n});\nexport var mean = /* #__PURE__ */createMean({\n  add,\n  divide,\n  typed\n});\nexport var molarVolume = /* #__PURE__ */createMolarVolume({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckConstant = /* #__PURE__ */createPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var quantileSeq = /* #__PURE__ */createQuantileSeq({\n  bignumber,\n  add,\n  compare,\n  divide,\n  isInteger,\n  larger,\n  multiply,\n  partitionSelect,\n  smaller,\n  smallerEq,\n  subtract,\n  typed\n});\nexport var variance = /* #__PURE__ */createVariance({\n  add,\n  apply,\n  divide,\n  isNaN,\n  multiply,\n  subtract,\n  typed\n});\nexport var classicalElectronRadius = /* #__PURE__ */createClassicalElectronRadius({\n  BigNumber,\n  Unit,\n  config\n});\nexport var median = /* #__PURE__ */createMedian({\n  add,\n  compare,\n  divide,\n  partitionSelect,\n  typed\n});\nexport var corr = /* #__PURE__ */createCorr({\n  add,\n  divide,\n  matrix,\n  mean,\n  multiply,\n  pow,\n  sqrt,\n  subtract,\n  sum,\n  typed\n});\nexport var freqz = /* #__PURE__ */createFreqz({\n  Complex,\n  add,\n  divide,\n  matrix,\n  multiply,\n  typed\n});\nexport var mad = /* #__PURE__ */createMad({\n  abs,\n  map,\n  median,\n  subtract,\n  typed\n});\nexport var std = /* #__PURE__ */createStd({\n  map,\n  sqrt,\n  typed,\n  variance\n});\nexport var zeta = /* #__PURE__ */createZeta({\n  BigNumber,\n  Complex,\n  add,\n  config,\n  divide,\n  equal,\n  factorial,\n  gamma,\n  isNegative,\n  multiply,\n  pi,\n  pow,\n  sin,\n  smallerEq,\n  subtract,\n  typed\n});\nexport var norm = /* #__PURE__ */createNorm({\n  abs,\n  add,\n  conj,\n  ctranspose,\n  eigs,\n  equalScalar,\n  larger,\n  matrix,\n  multiply,\n  pow,\n  smaller,\n  sqrt,\n  typed\n});\nexport var rotationMatrix = /* #__PURE__ */createRotationMatrix({\n  BigNumber,\n  DenseMatrix,\n  SparseMatrix,\n  addScalar,\n  config,\n  cos,\n  matrix,\n  multiplyScalar,\n  norm,\n  sin,\n  typed,\n  unaryMinus\n});\nexport var planckTime = /* #__PURE__ */createPlanckTime({\n  BigNumber,\n  Unit,\n  config\n});\nexport var schur = /* #__PURE__ */createSchur({\n  identity,\n  matrix,\n  multiply,\n  norm,\n  qr,\n  subtract,\n  typed\n});\nexport var rotate = /* #__PURE__ */createRotate({\n  multiply,\n  rotationMatrix,\n  typed\n});\nexport var sylvester = /* #__PURE__ */createSylvester({\n  abs,\n  add,\n  concat,\n  identity,\n  index,\n  lusolve,\n  matrix,\n  matrixFromColumns,\n  multiply,\n  range,\n  schur,\n  subset,\n  subtract,\n  transpose,\n  typed\n});\nexport var lyap = /* #__PURE__ */createLyap({\n  matrix,\n  multiply,\n  sylvester,\n  transpose,\n  typed\n});","import { dot, norm } from \"mathjs\"\n\nconst mathsHelpers = {\n  dotproduct: (a, b) => a.map((x, i) => a[i] * b[i]).reduce((m, n) => m + n),\n  transpose: (a) => a[0].map((x, i) => a.map(y => y[i])),\n\n  mmultiply(a,b) {\n    return a.map(x => this.transpose(b).map(y => this.dotproduct(x, y)))\n  },\n  euclideanDistance(a, b) {\n    return Math.hypot(...Object.keys(a).map(k => b[k] - a[k]))\n  },\n\n  cosineSimilarity(embedding1, embedding2) {\n    let dotProduct = dot(embedding1, embedding2)\n    let norm1 = norm(embedding1)\n    let norm2 = norm(embedding2)\n    return dotProduct / (norm1 * norm2)\n  },\n\n  /**\n   * Clamps a number within a range.\n   * @param {number} number - The number to clamp.\n   * @param {number} min - The lower bound of the range.\n   * @param {number} max - The upper bound of the range.\n   * @returns {number} The clamped number.\n   */\n  clamp(number, min, max) {\n    return Math.max(min, Math.min(number, max))\n  },\n\n}\n\nexport default mathsHelpers\n","import store from \"../../store\"\n\n// How to use this module :\n// 1. Import evalmeeOnboarding, autoRedirectToOnboarding in your router\n// 2. add `...evalmeeOnboarding` to your routes\n// 3. add `autoRedirectToOnboarding(router)` in your router\n\nconst onboardingRouteName = \"onboardingUser\"\n\nconst evalmeeOnboarding = [\n  {\n    path: \"/onboarding\",\n    name: onboardingRouteName,\n    component: ()=>import(\"../../views/onboarding_user.vue\"),\n  },\n]\n\nconst autoRedirectToOnboarding = (router) => {\n  router.beforeEach((to, from, next) => {\n    if(to.name === onboardingRouteName) return next()\n\n    if(store.getters.currentUser?.onboarding_state) {\n      redirectToOnboarding(next, to)\n      return\n    }\n\n    store.dispatch(\"fetchCurrentUser\")\n      .then( () => redirectToOnboarding(next, to))\n  })\n}\n\nconst shouldRedirectToOnboarding = () => {\n  return store.getters.currentUser?.onboarding_state !== \"complete\"\n}\n\nconst redirectToOnboarding = (next, redirectTo = null) => {\n  return shouldRedirectToOnboarding() ?\n    next({ name: onboardingRouteName, query: { redirect: redirectTo.path } }) :\n    next()\n}\n\nexport {\n  evalmeeOnboarding,\n  autoRedirectToOnboarding\n}\n\n","\nimport { mapGetters } from \"vuex\"\n\nexport default {\n  computed: {\n    ...mapGetters([\"currentUser\"]),\n  },\n  methods: {\n    getFeature(name) {\n      let feature = this.currentUser.beta_features.find(feature => feature.name == name)\n      feature.description = this.$t(\"user.edit.features.description.\" + name)\n      feature.title = this.$t(\"user.edit.features.title.\" + name)\n      return feature\n    },\n  },\n}\n","<template>\n  <label\n    :class=\"{\n      'v-input--is-disabled': disabled,\n      'eva-label': !disabled,\n    }\"\n  >\n    <slot>\n      <span class=\"font-weight-medium\">\n        {{ label }}\n      </span>\n      <span\n        class=\"grey--text d-block\"\n        v-if=\"subtitle\"\n      >\n        {{ subtitle }}\n      </span>\n    </slot>\n  </label>\n</template>\n\n<script>\nexport default {\n  name: \"EvaLabel\",\n  props: {\n    label: {\n      type: String,\n      default: \"\",\n    },\n    subtitle: {\n      type: [String, null],\n      default: null,\n    },\n    disabled: {\n      type: Boolean,\n      default: false,\n    },\n  },\n}\n</script>\n\n<style scoped>\n\n/* Should inherit from .theme--light.v-label */\n.eva-label {\n  color: rgba(0,0,0,.6);\n}\n</style>\n","<template>\n  <div>\n    <v-switch\n      v-bind=\"$attrs\"\n      v-on=\"$listeners\"\n      v-model=\"tempValue\"\n      :dense=\"dense\"\n      :class=\"{ 'switchOnRight': switchOnRight }\"\n      class=\"mt-0\"\n    >\n      <template #label>\n        <!--\n          This description should be outside of the label for accessibility reasons.\n          While we dont have a solution for now with te current v-switch component,\n          we can use this workaround.\n        -->\n        <eva-label\n          :label=\"label\"\n          :subtitle=\"description\"\n          :disabled=\"$attrs.disabled\"\n        />\n        <slot name=\"label-append\" />\n      </template>\n    </v-switch>\n  </div>\n</template>\n\n<script>\nimport EvaLabel from \"@/components/shared/inputs/eva-label.vue\"\n\nexport default {\n  name: \"EvaSwitch\",\n  components: { EvaLabel },\n  props: {\n    value: {\n      type: Boolean,\n      default: false,\n    },\n    switchOnRight: {\n      type: Boolean,\n      default: false,\n    },\n    label: {\n      type: String,\n      default: \"\",\n    },\n    description: {\n      type: String,\n      default: null,\n    },\n    dense: {\n      type: Boolean,\n      default: true,\n    },\n  },\n  computed: {\n    tempValue: {\n      get() {\n        return this.value\n      },\n      set(value) {\n        this.$emit(\"input\", value)\n      },\n    },\n  },\n}\n</script>\n\n<style scoped>\n\n.switchOnRight::v-deep .v-input__slot{\n  display: flex;\n  flex-direction: row-reverse;\n  gap: 16px;\n}\n\n</style>\n","<template>\n  <div>\n    <v-sheet\n      v-for=\"(item, index) in tempFeatures\"\n      :key=\"item.name\"\n    >\n      <eva-switch\n        @change=\"updateUser\"\n        v-model=\"item.value\"\n        :label=\"item.title\"\n        :disabled=\"item.type === 'private' && !allowPrivateAndHidden\"\n        switch-on-right\n        :description=\"withDescription ? item.description : null\"\n        hide-details\n      />\n      <div v-if=\"item.type === 'private' && !allowPrivateAndHidden\">\n        {{ $t(\"user.edit.features.invitationOnly\") }}\n        <a @click=\"showCrispChat(item.title)\"> {{ $t(\"user.edit.features.askAccess\") }} </a>\n      </div>\n      <v-divider\n        v-if=\"index !== tempFeatures.length -1\"\n        class=\"mt-2\"\n      />\n    </v-sheet>\n  </div>\n</template>\n<script>\nimport EvaSwitch from \"@/components/shared/inputs/eva-switch.vue\"\nimport getFeatureMixin from \"@/components/shared/get_feature_mixin\"\nimport chatSupportHelpers from \"@/helpers/chat_support_helpers\"\n\nexport default {\n  name: \"BetaFeaturesList\",\n  components: { EvaSwitch },\n  props: {\n    user: {\n      type: Object,\n      required: true,\n    },\n    withDescription: {\n      type: Boolean,\n      default: true,\n    },\n    allowPrivateAndHidden: {\n      type: Boolean,\n      default: false,\n    },\n  },\n  mixins: [getFeatureMixin],\n  emits: [\"update:user\"],\n  data: () => ({\n    tempFeatures: [],\n  }),\n  methods: {\n    updateUser() {\n      let user = { ...this.user }\n      user.beta_features = this.tempFeatures\n      this.$emit(\"update:user\", user)\n    },\n    showCrispChat(featureName) {\n      chatSupportHelpers.showCrispChat()\n      chatSupportHelpers.prefillCrispMessage(this.$t(\"user.edit.features.supportChatAskAccessTo\", { featureName }) )\n      chatSupportHelpers.showCrispMessage(this.$t(\"live.help.supportChatDefaultMessage\"))\n    },\n  },\n  computed: {\n    currentAppBetaFeatures() {\n      const currentApp = this.user.last_app_used\n      return this.user.beta_features.filter(bf => bf.app === currentApp).map(f => this.getFeature(f.name))\n    },\n  },\n  mounted() {\n    const filter = this.allowPrivateAndHidden ? f => true : f => f.type !== \"hidden\"\n    this.tempFeatures = this.currentAppBetaFeatures.filter(filter)\n  },\n}\n</script>\n\n\n<style scoped>\n\n</style>\n","import { useStore } from \"@/store\"\nimport { computed } from \"vue\"\n\nexport function useSchoolsUser(schoolsUser) {\n  const store = useStore()\n\n  const accessibilityOption = computed(() => {\n    return store.getters.accessibilityOptionBySchoolsUserId(schoolsUser?.id)\n  })\n\n  const timeAccommodation = computed(() => {\n    return store.getters.timeAccommodation(accessibilityOption.value?.time_accommodation_id)\n  })\n\n  const school = computed(() => {\n    return store.getters.schools.find(s => s.id === schoolsUser.school_id)\n  })\n\n  function facade() {\n    return {\n      ...schoolsUser,\n      timeAccommodation: timeAccommodation.value,\n      accessibilityOption: accessibilityOption.value,\n    }\n  }\n\n  return {\n    facade,\n    accessibilityOption,\n    timeAccommodation,\n    school,\n  }\n}\n","<template>\n  <div class=\"container\">\n    <v-card\n      class=\"mt-5\"\n      outlined\n      flat\n    >\n      <v-card-title>{{ `${this.user.first_name} ${this.user.last_name}` }}</v-card-title>\n\n      <v-list dense>\n        <v-list-item>\n          <v-list-item-icon><v-icon>mdi-school-outline</v-icon></v-list-item-icon>\n          <v-list-item-content>\n            <v-list-item-title>{{ schoolsNames.join(\", \") }}</v-list-item-title>\n          </v-list-item-content>\n        </v-list-item>\n\n        <v-list-item>\n          <v-list-item-icon><v-icon>mdi-email-outline</v-icon></v-list-item-icon>\n          <v-list-item-content>\n            <v-list-item-title>{{ this.user.email }}</v-list-item-title>\n          </v-list-item-content>\n        </v-list-item>\n      </v-list>\n\n      <v-divider />\n\n      <v-card-actions>\n        <v-btn\n          color=\"primary\"\n          text\n          @click=\"toggleEditForm\"\n        >\n          <v-icon left>\n            mdi-pencil\n          </v-icon>\n          {{ $t(\"user.edit_profile\") }}\n        </v-btn>\n      </v-card-actions>\n    </v-card>\n\n    <v-card\n      v-if=\"user.teacher\"\n      class=\"mt-4\"\n      outlined\n      flat\n    >\n      <v-card-title>\n        {{ $t(\"user.edit.features.betaTitle\") }}\n      </v-card-title>\n      <v-card-text>\n        <beta-features-list\n          :user=\"user\"\n          @update:user=\"saveUser\"\n        />\n      </v-card-text>\n    </v-card>\n  </div>\n</template>\n\n<script>\nimport { mapActions, mapGetters } from \"vuex\"\n\nimport getFeatureMixin from \"../../components/shared/get_feature_mixin\"\nimport BetaFeaturesList from \"@/views/user_profile/betaFeaturesList.vue\"\nimport { useSchoolsUser } from \"@/composables/useSchoolsUser\"\n\nexport default {\n  name: \"showUserProfile.vue\",\n  components: { BetaFeaturesList },\n  props: {\n    user: Object,\n  },\n  mixins: [getFeatureMixin],\n  data() {\n    return {\n      switch1: false,\n      tempFeatures: [],\n    }\n  },\n  methods: {\n    ...mapActions([\"updateCurrentUser\", \"newAppNotification\"]),\n    toggleEditForm() {\n      this.$emit(\"toggleEditForm\")\n    },\n    saveUser(user) {\n      this.updateCurrentUser(user).then(\n        this.newAppNotification({ message: this.$t(\"user.edit.successMessage\"), type: \"success\" })\n      )\n    },\n  },\n  computed: {\n    ...mapGetters([\"currentSchoolsUsers\"]),\n    schoolsNames() {\n      return this.currentSchoolsUsers.map((schoolsUser) => useSchoolsUser(schoolsUser).school.value?.name)\n    },\n  },\n}\n</script>\n\n<style scoped>\n\n</style>\n","<template>\n  <div>\n    <v-form\n      @submit.prevent=\"saveCurrentUser\"\n      v-model=\"valid\"\n      lazy-validation\n      ref=\"form\"\n    >\n      <v-card class=\"mt-5\">\n        <v-card-title>{{ $t(\"user.edit.personal_infos\") }}</v-card-title>\n\n        <v-list>\n          <v-list-item>\n            <v-list-item-content>\n              <v-text-field\n                v-model=\"mutableUser.first_name\"\n                :label=\"$t('user.first_name')\"\n                :rules=\"[rules.required]\"\n                validate-on-blur\n              />\n            </v-list-item-content>\n          </v-list-item>\n\n          <v-list-item>\n            <v-list-item-content>\n              <v-text-field\n                v-model=\"mutableUser.last_name\"\n                :label=\"$t('user.last_name')\"\n                :rules=\"[rules.required]\"\n                validate-on-blur\n              />\n            </v-list-item-content>\n          </v-list-item>\n        </v-list>\n      </v-card>\n\n      <v-card class=\"mt-5\">\n        <v-card-title>{{ $t(\"user.edit.password\") }}</v-card-title>\n\n        <v-list>\n          <v-list-item>\n            <v-list-item-content>{{ $t(\"user.edit.password_tips\") }}</v-list-item-content>\n          </v-list-item>\n\n          <v-list-item>\n            <v-list-item-content>\n              <v-text-field\n                v-model=\"mutableUser.password\"\n                :label=\"$t('user.edit.new_password')\"\n                :append-icon=\"showPassword ? 'mdi-eye' : 'mdi-eye-off'\"\n                :type=\"showPassword ? 'text' : 'password'\"\n                @click:append=\"showPassword = !showPassword\"\n                counter\n                validate-on-blur\n              />\n            </v-list-item-content>\n          </v-list-item>\n\n          <v-list-item>\n            <v-list-item-content>\n              <v-text-field\n                v-model=\"mutableUser.password_confirmation\"\n                :label=\"$t('user.edit.password_confirmation')\"\n                :rules=\"[rules.passwordMin, rules.passwordMin]\"\n                :append-icon=\"showConfirmation ? 'mdi-eye' : 'mdi-eye-off'\"\n                :type=\"showConfirmation ? 'text' : 'password'\"\n                @click:append=\"showConfirmation = !showConfirmation\"\n                counter\n                validate-on-blur\n              />\n            </v-list-item-content>\n          </v-list-item>\n        </v-list>\n      </v-card>\n\n      <v-card\n        flat\n        color=\"transparent\"\n      >\n        <v-card-actions>\n          <v-spacer />\n\n          <eva-button\n            @click=\"editCancelled\"\n            :label=\"$t('cancel')\"\n          />\n\n          <eva-button\n            primary\n            type=\"submit\"\n            :label=\"$t('save')\"\n          />\n        </v-card-actions>\n      </v-card>\n    </v-form>\n  </div>\n</template>\n\n<script>\nimport { mapActions } from \"vuex\"\n\nexport default {\n  name: \"editUserProfile.vue\",\n  props: [\"user\"],\n  data() {\n    return {\n      mutableUser: this.user,\n      valid: true,\n      showPassword: false,\n      showConfirmation: false,\n      rules: {\n        required: value => !!value || \"Required.\",\n        passwordMin: () => !this.mutableUser.password || this.mutableUser.password_confirmation?.length >= 8 || this.$t(\"user.edit.passwordMin\"),\n        passwordMatch: () => (this.mutableUser.password === this.mutableUser.password_confirmation) || this.$t(\"user.edit.passwordMatch\"),\n      },\n    }\n  },\n  methods: {\n    ...mapActions([\"updateCurrentUser\", \"newAppNotification\"]),\n    editCancelled() {\n      this.$emit(\"editCancelled\")\n    },\n    saveCurrentUser() {\n      if (this.$refs.form.validate()) {\n        this.updateCurrentUser(this.mutableUser).then(this.onFulfillment).catch(this.onRejection)\n      }\n    },\n    onFulfillment() {\n      this.newAppNotification({ message: this.$t(\"user.edit.successMessage\"), type: \"success\" })\n      this.$emit(\"userEdited\")\n    },\n    onRejection() {\n      this.newAppNotification({ message: this.$t(\"user.edit.error_message\"), type: \"error\" })\n    },\n  },\n}\n</script>\n","<template>\n  <div>\n    <v-snackbar\n      v-if=\"hasVersionChanged && !noAppVersionUpdateNotification\"\n      bottom\n      text\n      left\n      color=\"primary\"\n      :value=\"hasVersionChanged\"\n      :timeout=\"-1\"\n      vertical\n      :max-width=\"300\"\n      multi-line\n    >\n      {{ $t(\"notifications.newAppVersionAvailable.message\") }}\n      <template #action>\n        <eva-button\n          primary\n          dense\n          :label=\"$t('notifications.newAppVersionAvailable.action')\"\n          @click=\"windowReload\"\n        />\n      </template>\n    </v-snackbar>\n    <v-snackbar\n      v-for=\"(notification, index) in appNotifications.filter(n => n.show)\"\n      :key=\"notification.uuid\"\n      v-model=\"notification.show\"\n      :timeout=\"notification.timeout\"\n      top\n      text\n      right\n      :color=\"colors[notification.type]\"\n      :style=\"`top: ${(index * 60) + 8}px`\"\n      :vertical=\"notification.action\"\n      :ref=\"`snackbar${index}`\"\n    >\n      {{ notification.message }}\n\n      <template #action=\"{ attrs }\">\n        <v-btn\n          :color=\"colors[notification.type]\"\n          text\n          v-bind=\"attrs\"\n          @click=\"notification.show = false\"\n          icon\n          small\n        >\n          <v-icon small>\n            mdi-close\n          </v-icon>\n        </v-btn>\n      </template>\n    </v-snackbar>\n  </div>\n</template>\n\n<script>\nimport { useAppVersion } from \"@/composables/useAppVersion\"\nimport { mapGetters } from \"vuex\"\n\nexport default {\n  name: \"AppNotifications\",\n  props: {\n    noAppVersionUpdateNotification: {\n      type: Boolean,\n      default: false,\n    },\n  },\n  setup() {\n    const { hasVersionChanged } = useAppVersion()\n    return {\n      hasVersionChanged,\n    }\n  },\n  data() {\n    return {\n      snackbar: true,\n      colors: {\n        success: \"success\",\n        error: \"error\",\n        info: \"info\",\n      },\n    }\n  },\n  computed:{\n    ...mapGetters([\"appNotifications\"]),\n  },\n  methods: {\n    windowReload() {\n      window.location.reload()\n    },\n  },\n}\n</script>\n\n<style scoped>\n\n</style>\n","<template>\n  <v-app\n    id=\"evalmee-app\"\n    :style=\"{background: $vuetify.theme.themes.light.background}\"\n  >\n    <app-notifications />\n    <v-main>\n      <v-container>\n        <v-btn\n          icon\n          to=\"/\"\n        >\n          <v-icon>arrow_back</v-icon>\n        </v-btn>\n        <edit-user-profile\n          v-if=\"this.isEditing\"\n          @editCancelled=\"editCancelled()\"\n          @userEdited=\"userEdited()\"\n          :user=\"this.tempUser\"\n        />\n\n        <show-user-profile\n          v-else\n          @toggleEditForm=\"toggleEditForm()\"\n          :user=\"tempUser\"\n        />\n      </v-container>\n    </v-main>\n  </v-app>\n</template>\n\n<script>\nimport showUserProfile from \"./user_profile/showUserProfile.vue\"\nimport editUserProfile from \"./user_profile/editUserProfile.vue\"\nimport appNotifications from \"../components/shared/app_notifications.vue\"\nimport { mapGetters } from \"vuex\"\n\nexport default {\n  name: \"UserProfile\",\n  components: { showUserProfile, editUserProfile, appNotifications },\n  computed: {\n    ...mapGetters([\"currentUser\"]),\n  },\n  data() {\n    return {\n      isEditing: false,\n      tempUser: {},\n    }\n  },\n  methods: {\n    toggleEditForm() {\n      this.isEditing = true\n    },\n    userEdited() {\n      this.isEditing = false\n    },\n    editCancelled() {\n      this.copyUser()\n      this.isEditing = false\n    },\n    copyUser() {\n      this.tempUser = { ...this.currentUser }\n    },\n  },\n  watch: {\n    currentUser: {\n      handler(user) {\n        this.copyUser()\n        if(user.id) return\n        this.$router.push(\n          { name: \"userLogin\", query: { redirect_to: window.location.href } })\n      },\n      immediate: true,\n    },\n  },\n}\n</script>\n\n<style scoped>\n\n</style>\n","import userProfile from \"../../views/user_profile.vue\"\n\nconst evalmeeUserProfile = [\n  {\n    path: \"/profile\",\n    name: \"userProfile\",\n    component: userProfile,\n  },\n]\n\nexport {\n  evalmeeUserProfile,\n}\n\n","!function(e,t){\"object\"==typeof exports&&\"object\"==typeof module?module.exports=t():\"function\"==typeof define&&define.amd?define([],t):\"object\"==typeof exports?exports.VueFullscreen=t():e.VueFullscreen=t()}(this,function(){return function(e){function t(i){if(n[i])return n[i].exports;var r=n[i]={i:i,l:!1,exports:{}};return e[i].call(r.exports,r,r.exports,t),r.l=!0,r.exports}var n={};return t.m=e,t.c=n,t.i=function(e){return e},t.d=function(e,n,i){t.o(e,n)||Object.defineProperty(e,n,{configurable:!1,enumerable:!0,get:i})},t.n=function(e){var n=e&&e.__esModule?function(){return e.default}:function(){return e};return t.d(n,\"a\",n),n},t.o=function(e,t){return Object.prototype.hasOwnProperty.call(e,t)},t.p=\"\",t(t.s=5)}([function(e,t,n){\"use strict\";function i(){var e={},t=!1,n=0,r=arguments.length;for(\"[object Boolean]\"===Object.prototype.toString.call(arguments[0])&&(t=arguments[0],n++);n<r;n++){var l=arguments[n];!function(n){for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t&&\"[object Object]\"===Object.prototype.toString.call(n[r])?e[r]=i(!0,e[r],n[r]):e[r]=n[r])}(l)}return e}t.a=i},function(e,t){!function(){\"use strict\";var t=\"undefined\"!=typeof window&&void 0!==window.document?window.document:{},n=void 0!==e&&e.exports,i=function(){for(var e,n=[[\"requestFullscreen\",\"exitFullscreen\",\"fullscreenElement\",\"fullscreenEnabled\",\"fullscreenchange\",\"fullscreenerror\"],[\"webkitRequestFullscreen\",\"webkitExitFullscreen\",\"webkitFullscreenElement\",\"webkitFullscreenEnabled\",\"webkitfullscreenchange\",\"webkitfullscreenerror\"],[\"webkitRequestFullScreen\",\"webkitCancelFullScreen\",\"webkitCurrentFullScreenElement\",\"webkitCancelFullScreen\",\"webkitfullscreenchange\",\"webkitfullscreenerror\"],[\"mozRequestFullScreen\",\"mozCancelFullScreen\",\"mozFullScreenElement\",\"mozFullScreenEnabled\",\"mozfullscreenchange\",\"mozfullscreenerror\"],[\"msRequestFullscreen\",\"msExitFullscreen\",\"msFullscreenElement\",\"msFullscreenEnabled\",\"MSFullscreenChange\",\"MSFullscreenError\"]],i=0,r=n.length,l={};i<r;i++)if((e=n[i])&&e[1]in t){for(i=0;i<e.length;i++)l[n[0][i]]=e[i];return l}return!1}(),r={change:i.fullscreenchange,error:i.fullscreenerror},l={request:function(e,n){return new Promise(function(r,l){var s=function(){this.off(\"change\",s),r()}.bind(this);this.on(\"change\",s),e=e||t.documentElement;var o=e[i.requestFullscreen](n);o instanceof Promise&&o.then(s).catch(l)}.bind(this))},exit:function(){return new Promise(function(e,n){if(!this.isFullscreen)return void e();var r=function(){this.off(\"change\",r),e()}.bind(this);this.on(\"change\",r);var l=t[i.exitFullscreen]();l instanceof Promise&&l.then(r).catch(n)}.bind(this))},toggle:function(e,t){return this.isFullscreen?this.exit():this.request(e,t)},onchange:function(e){this.on(\"change\",e)},onerror:function(e){this.on(\"error\",e)},on:function(e,n){var i=r[e];i&&t.addEventListener(i,n,!1)},off:function(e,n){var i=r[e];i&&t.removeEventListener(i,n,!1)},raw:i};if(!i)return void(n?e.exports={isEnabled:!1}:window.screenfull={isEnabled:!1});Object.defineProperties(l,{isFullscreen:{get:function(){return Boolean(t[i.fullscreenElement])}},element:{enumerable:!0,get:function(){return t[i.fullscreenElement]}},isEnabled:{enumerable:!0,get:function(){return Boolean(t[i.fullscreenEnabled])}}}),n?e.exports=l:window.screenfull=l}()},function(e,t,n){\"use strict\";function i(e,t){e.style.position=t.position,e.style.left=t.left,e.style.top=t.top,e.style.width=t.width,e.style.height=t.height}function r(e){var t=e.element;t&&(t.classList.remove(e.options.fullscreenClass),(e.options.teleport||e.options.pageOnly)&&(e.options.teleport&&a&&(a.insertBefore(t,u),a.removeChild(u)),t.__styleCache&&i(t,t.__styleCache)))}var l=n(1),s=n.n(l),o=n(0),c={callback:function(){},fullscreenClass:\"fullscreen\",pageOnly:!1,teleport:!1},u=void 0,a=void 0,f={options:null,element:null,isFullscreen:!1,isEnabled:s.a.isEnabled,toggle:function(e,t,n){return void 0===n?this.isFullscreen?this.exit():this.request(e,t):n?this.request(e,t):this.exit()},request:function(e,t){var l=this;if(this.isFullscreen)return Promise.resolve();if(e||(e=document.body),this.options=n.i(o.a)({},c,t),e===document.body&&(this.options.teleport=!1),s.a.isEnabled||(this.options.pageOnly=!0),e.classList.add(this.options.fullscreenClass),this.options.teleport||this.options.pageOnly){var f=e.style,h=f.position,p=f.left,d=f.top,m=f.width,v=f.height;e.__styleCache={position:h,left:p,top:d,width:m,height:v},i(e,{position:\"fixed\",left:\"0\",top:\"0\",width:\"100%\",height:\"100%\"})}if(this.options.teleport&&(a=e.parentNode)&&(u=document.createComment(\"fullscreen-token\"),a.insertBefore(u,e),document.body.appendChild(e)),this.options.pageOnly){var b=function e(t){\"Escape\"===t.key&&(document.removeEventListener(\"keyup\",e),l.exit())};return this.isFullscreen=!0,this.element=e,document.removeEventListener(\"keyup\",b),document.addEventListener(\"keyup\",b),this.options.callback&&this.options.callback(this.isFullscreen),Promise.resolve()}var y=function t(){s.a.isFullscreen||(s.a.off(\"change\",t),r(l)),l.isFullscreen=s.a.isFullscreen,l.options.teleport?l.element=e||null:l.element=s.a.element,l.options.callback&&l.options.callback(s.a.isFullscreen)};return s.a.on(\"change\",y),s.a.request(this.options.teleport?document.body:e)},exit:function(){return this.isFullscreen?this.options.pageOnly?(r(this),this.isFullscreen=!1,this.element=null,this.options.callback&&this.options.callback(this.isFullscreen),Promise.resolve()):s.a.exit():Promise.resolve()}};f.support=f.isEnabled,f.getState=function(){return f.isFullscreen},f.enter=f.request,t.a=f},function(e,t,n){\"use strict\";function i(e,t){var n={};for(var i in e)t.indexOf(i)>=0||Object.prototype.hasOwnProperty.call(e,i)&&(n[i]=e[i]);return n}var r=n(2),l=n(0),s=function(e,t){var s=function(){var e=void 0,s={teleport:t.modifiers.teleport,pageOnly:t.modifiers.pageOnly};if(t.value)if(\"string\"==typeof t.value)e=t.value;else{var o=t.value,c=o.target,u=i(o,[\"target\"]);e=c,s=n.i(l.a)(s,u)}\"string\"==typeof e&&(e=document.querySelector(e)),r.a.toggle(e,s)};e._onClickFullScreen&&e.removeEventListener(\"click\",e._onClickFullScreen),e.addEventListener(\"click\",s),e._onClickFullScreen=s};t.a=s},function(e,t,n){var i=n(7)(n(6),n(8),null,null);e.exports=i.exports},function(e,t,n){\"use strict\";Object.defineProperty(t,\"__esModule\",{value:!0});var i=n(4),r=n.n(i),l=n(2),s=n(3),o=n(1),c=n.n(o),u=n(0);n.d(t,\"screenfull\",function(){return c.a}),n.d(t,\"api\",function(){return l.a}),n.d(t,\"directive\",function(){return s.a}),n.d(t,\"component\",function(){return r.a}),t.default={install:function(e){var t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},i=t.name||\"fullscreen\";e.component(i,n.i(u.a)(r.a,{name:i})),e.prototype[\"$\"+i]=l.a,e.directive(i,s.a)}}},function(e,t,n){\"use strict\";Object.defineProperty(t,\"__esModule\",{value:!0});var i=n(1),r=n.n(i);t.default={props:{value:{type:Boolean,default:!1},fullscreen:{type:Boolean,default:!1},exitOnClickWrapper:{type:Boolean,default:!0},fullscreenClass:{type:String,default:\"fullscreen\"},pageOnly:{type:Boolean,default:!1},teleport:{type:Boolean,default:!1}},data:function(){return{isFullscreen:!1,isEnabled:!1}},computed:{support:function(){return this.isEnabled},isPageOnly:function(){return this.pageOnly||!r.a.isEnabled},wrapperStyle:function(){return(this.isPageOnly||this.teleport)&&this.isFullscreen?{position:\"fixed\",left:\"0\",top:\"0\",width:\"100%\",height:\"100%\"}:void 0}},methods:{toggle:function(e){void 0===e?this.isFullscreen?this.exit():this.request():e?this.request():this.exit()},request:function(){if(this.isPageOnly?(this.isFullscreen=!0,this.onChangeFullScreen(),document.removeEventListener(\"keyup\",this.keypressCallback),document.addEventListener(\"keyup\",this.keypressCallback)):(r.a.off(\"change\",this.fullScreenCallback),r.a.on(\"change\",this.fullScreenCallback),r.a.request(this.teleport?document.body:this.$el)),this.teleport){if(this.$el.parentNode===document.body)return;this.__parentNode=this.$el.parentNode,this.__token=document.createComment(\"fullscreen-token\"),this.__parentNode.insertBefore(this.__token,this.$el),document.body.appendChild(this.$el)}},exit:function(){this.isFullscreen&&(this.isPageOnly?(this.isFullscreen=!1,this.onChangeFullScreen(),document.removeEventListener(\"keyup\",this.keypressCallback)):r.a.exit())},shadeClick:function(e){e.target===this.$el&&this.exitOnClickWrapper&&this.exit()},fullScreenCallback:function(){r.a.isFullscreen||r.a.off(\"change\",this.fullScreenCallback),this.isFullscreen=r.a.isFullscreen,this.onChangeFullScreen()},keypressCallback:function(e){\"Escape\"===e.key&&this.exit()},onChangeFullScreen:function(){this.isFullscreen||this.teleport&&this.__parentNode&&(this.__parentNode.insertBefore(this.$el,this.__token),this.__parentNode.removeChild(this.__token)),this.$emit(\"change\",this.isFullscreen),this.$emit(\"update:fullscreen\",this.isFullscreen),this.$emit(\"input\",this.isFullscreen)},enter:function(){this.request()},getState:function(){return this.isFullscreen}},watch:{value:function(e){e!==this.isFullscreen&&(e?this.request():this.exit())},fullscreen:function(e){e!==this.isFullscreen&&(e?this.request():this.exit())}},created:function(){this.isEnabled=r.a.isEnabled}}},function(e,t){e.exports=function(e,t,n,i){var r,l=e=e||{},s=typeof e.default;\"object\"!==s&&\"function\"!==s||(r=e,l=e.default);var o=\"function\"==typeof l?l.options:l;if(t&&(o.render=t.render,o.staticRenderFns=t.staticRenderFns),n&&(o._scopeId=n),i){var c=Object.create(o.computed||null);Object.keys(i).forEach(function(e){var t=i[e];c[e]=function(){return t}}),o.computed=c}return{esModule:r,exports:l,options:o}}},function(e,t){e.exports={render:function(){var e,t=this,n=t.$createElement;return(t._self._c||n)(\"div\",t._b({ref:\"wrapper\",class:(e={},e[t.fullscreenClass]=t.isFullscreen,e),style:t.wrapperStyle,on:{click:function(e){return t.shadeClick(e)}}},\"div\",t.$attrs,!1),[t._t(\"default\")],2)},staticRenderFns:[]}}])});"],"file":"assets/vue-fullscreen.min-Cm_-AJ5U.js"}