{"mappings":"qDAAUA,EAAMC,OAAND,EAMRE,EANcD,EAMR,WAEJ,SAASE,EAAKC,EAAMC,EAASC,GAKzB,OAJAC,KAAKC,KAAOL,EAAKM,UACjBF,KAAKH,KAAOA,EACZG,KAAKF,QAAUA,EACfE,KAAKD,YAAcA,EACZC,KAeX,SAASG,EAAMC,EAAMC,EAAKC,EAAWC,GACjCP,KAAKI,KAAOA,EACZJ,KAAKK,IAAMA,EACXL,KAAKM,UAAYA,EACjBN,KAAKQ,KAAO,GACZR,KAAKO,SAAWA,EAChBP,KAAKS,WAAaT,KAAKK,MAAQD,EAAKN,QAAQY,OAsChD,SAASC,EAAOC,EAASC,GACrBb,KAAKY,QAAUA,EACfZ,KAAKa,MAAQA,EACbb,KAAKc,OAAS,GACdd,KAAKe,MAAQ,GACbf,KAAKgB,UAAY,GACjBhB,KAAKiB,UAAY,GA0ErB,SAASC,EAAQC,EAAOC,GACpBpB,KAAKmB,MAAQA,EACbnB,KAAKoB,MAAQA,GAASpB,KAAKmB,MAAM,GAAGtB,KACpC,IAAIwB,EAASrB,KAAKqB,OAAS,GAC3BrB,KAAKmB,MAAMG,SAAQ,SAASlB,GACnBiB,EAAOE,eAAenB,EAAKP,QAC5BwB,EAAOjB,EAAKP,MAAQ,IAExBwB,EAAOjB,EAAKP,MAAM2B,KAAKpB,MAkB/B,SAASqB,IACPzB,KAAK0B,MAAM,IA8Db,SAASC,EAAOR,EAAOC,EAAOQ,GAC1B,GAAIT,aAAiBD,EACjB,CAAA,IAAIN,EAAUO,EACVS,EAAUR,OAEVR,EAAUM,EAAQW,aAAaV,EAAOC,GAS9C,IAAK,IAAIU,KAPT9B,KAAKY,QAAUA,EAGfZ,KAAK4B,QAAU,CACXG,aAAa,EACbC,MAAOpB,EAAQoB,OAAS,IAAIP,GAEfG,GAAW,GACxB5B,KAAK4B,QAAQE,GAAOF,EAAQE,GAIhC9B,KAAKgC,MAAQhC,KAAK4B,QAAQI,MAC1BhC,KAAKiC,gBAAaC,EAGlB,IAAIC,EAAS,IAAIxB,EAAOC,EAAS,GACrBZ,KAAKoC,MAAQ,CAACD,GAG1BA,EAAOpB,MAAMH,EAAQQ,OAAS,GAC9Be,EAAOE,QAAQzB,EAAQQ,OAEvBe,EAAOG,UACPtC,KAAKuC,QAAU,EA0QnB,SAASC,EAAsBC,GAC3B,IAAIC,SAAcD,EAClB,GAAa,WAATC,EACA,OAAOD,EACJ,GAAa,WAATC,EAAmB,CAC1B,GAAID,EAAOE,QACP,OAAOC,KAAKC,UAAUJ,EAAOE,SAC1B,GAAIF,aAAkBK,OACzB,OAAOL,EAAOM,WACX,GAAIN,EAAOC,KACd,MAAO,IAAMD,EAAOC,KACjB,GAAID,EAAOO,KACd,MAAO,IAAMC,OAAOR,EAAOO,MAAQ,IAEnC,MAAM,IAAIE,MAAM,wBAA0BT,IAKtD,OA9hBA7C,EAAKM,UAAY,EAEjBN,EAAKuD,UAAUJ,SAAW,SAASK,GAC/B,IAAIC,OAA0C,IAAjBD,EACNpD,KAAKF,QAAQwD,IAAId,GAAuBe,KAAK,KACzCvD,KAAKF,QAAQ0D,MAAM,EAAGJ,GAAcE,IAAId,GAAuBe,KAAK,KACpE,MAAKvD,KACHF,QAAG0D,MAAQJ,GAAkBE,IAAEd,GAAyBe,KAAE,KACvF,OAAOvD,KAAKH,KAAO,MAAKwD,GAc5BlD,EAAMgD,UAAUJ,SAAW,WACvB,MAAO,IAAM/C,KAAKI,KAAK2C,SAAS/C,KAAKK,KAAO,aAAeL,KAAKM,WAAa,IAGjFH,EAAMgD,UAAUM,UAAY,SAASC,GACjC,IAAIC,EAAQ,IAAIxD,EAAMH,KAAKI,KAAMJ,KAAKK,IAAM,EAAGL,KAAKM,UAAWN,KAAKO,UASpE,OARAoD,EAAMC,KAAO5D,KACb2D,EAAME,MAAQH,EACVC,EAAMlD,aACNkD,EAAMnD,KAAOmD,EAAMG,QAGnBH,EAAME,WAAQ3B,GAEXyB,GAGXxD,EAAMgD,UAAUW,MAAQ,WACpB,IAAIC,EAAW,GACXC,EAAOhE,KACX,GACI+D,EAASvC,KAAKwC,EAAKH,MAAMrD,MACzBwD,EAAOA,EAAKJ,WACPI,EAAKJ,MAEd,OADAG,EAASE,UACFF,GAGX5D,EAAMgD,UAAUe,OAAS,WACjBlE,KAAKI,KAAKL,cACVC,KAAKQ,KAAOR,KAAKI,KAAKL,YAAYC,KAAKQ,KAAMR,KAAKM,UAAWqB,EAAOwC,QAe5ExD,EAAOwC,UAAUb,QAAU,SAAS8B,GAKhC,IAJA,IAAItD,EAASd,KAAKc,OACdC,EAAQf,KAAKe,MACbE,EAAYjB,KAAKiB,UAEZoD,EAAI,EAAGA,EAAIvD,EAAOJ,OAAQ2D,IAAK,CACpC,IAAIV,EAAQ7C,EAAOuD,GAEnB,GAAIV,EAAMlD,YAEN,GADAkD,EAAMO,SACFP,EAAMnD,OAASmB,EAAOwC,KAAM,CAG5B,IADA,IAAI5D,EAAWoD,EAAMpD,SACZ+D,EAAI/D,EAASG,OAAQ4D,KAAO,CACjC,IAAIV,EAAOrD,EAAS+D,GACpBtE,KAAKuE,SAASX,EAAMD,GAIxB,GAAIA,EAAMrD,YAAcN,KAAKa,MAAO,CAEhC,IAAI2D,EAAMb,EAAMvD,KAAKP,MACpBG,KAAKiB,UAAUuD,GAAOxE,KAAKiB,UAAUuD,IAAQ,IAAIhD,KAAKmC,SAI5D,CAGH,GAAmB,iBADfa,EAAMb,EAAMvD,KAAKN,QAAQ6D,EAAMtD,MACN,CACzBL,KAAKgB,UAAUQ,KAAKmC,GACpB,SAIJ,GAAI5C,EAAMyD,IAGN,GAFAzD,EAAMyD,GAAKhD,KAAKmC,GAEZ1C,EAAUM,eAAeiD,GACzB,CAAA,IAAIC,EAAQxD,EAAUuD,GACtB,IAASF,EAAI,EAAGA,EAAIG,EAAM/D,OAAQ4D,IAAK,CACnC,IAAIT,EAAQY,EAAMH,GAClBtE,KAAKuE,SAASZ,EAAOE,UAI7B9C,EAAMyD,GAAO,CAACb,GACd3D,KAAKqC,QAAQmC,MAM7B7D,EAAOwC,UAAUd,QAAU,SAASmC,GAGhC,IAFA,IAAIrD,EAAQnB,KAAKY,QAAQS,OAAOmD,IAAQ,GAE/BF,EAAI,EAAGA,EAAInD,EAAMT,OAAQ4D,IAAK,CACnC,IAAII,EAAIvD,EAAMmD,GACV/D,EAAWP,KAAKe,MAAMyD,GACtBG,EAAI,IAAIxE,EAAMuE,EAAG,EAAG1E,KAAKa,MAAON,GACpCP,KAAKc,OAAOU,KAAKmD,KAIzBhE,EAAOwC,UAAUoB,SAAW,SAASX,EAAMC,GACvC,IAAIe,EAAOhB,EAAKH,UAAUI,GAC1B7D,KAAKc,OAAOU,KAAKoD,IAiBrB1D,EAAQW,aAAe,SAASV,EAAOC,GACnC,IAAIY,EAAQb,EAAM0D,MACd1D,EAAM2D,cACR1D,EAAQD,EAAM2D,YACd3D,EAAQA,EAAM4D,aAEhB,IACIC,EAAI,IAAI9D,EADRC,EAAQA,EAAMmC,KAAI,SAAUoB,GAAK,OAAQ,IAAI9E,EAAK8E,EAAE7E,KAAM6E,EAAE5E,QAAS4E,EAAE3E,gBAChDqB,GAE3B,OADA4D,EAAEhD,MAAQA,EACHgD,GAQXvD,EAAY0B,UAAUzB,MAAQ,SAASlB,EAAMmD,GACzC3D,KAAKiF,OAASzE,EACdR,KAAKa,MAAQ,EACbb,KAAKkF,KAAOvB,EAAQA,EAAMuB,KAAO,EACjClF,KAAKmF,cAAgBxB,GAASA,EAAMyB,IAAM,GAG9C3D,EAAY0B,UAAUkC,KAAO,WACzB,GAAIrF,KAAKa,MAAQb,KAAKiF,OAAOvE,OAAQ,CACjC,IAAI4E,EAAKtF,KAAKiF,OAAOjF,KAAKa,SAK1B,MAJW,OAAPyE,IACFtF,KAAKkF,MAAQ,EACblF,KAAKmF,cAAgBnF,KAAKa,OAErB,CAAC0E,MAAOD,KAIvB7D,EAAY0B,UAAUqC,KAAO,WAC3B,MAAO,CACLN,KAAMlF,KAAKkF,KACXE,IAAKpF,KAAKa,MAAQb,KAAKmF,gBAI3B1D,EAAY0B,UAAUsC,YAAc,SAASC,EAAOC,GAGhD,IAAIV,EAASjF,KAAKiF,OAClB,GAAsB,iBAAXA,EAAqB,CAC5B,IAAIW,EAAQX,EACPY,MAAM,MACNrC,MACGsC,KAAKC,IAAI,EAAG/F,KAAKkF,KAAO,GACxBlF,KAAKkF,MAGTc,EAAgBf,EAAOgB,QAAQ,KAAMjG,KAAKa,QACxB,IAAlBmF,IAAsBA,EAAgBf,EAAOvE,QACjD,IAAI0E,EAAMpF,KAAKa,MAAQb,KAAKmF,cACxBe,EAAiBjD,OAAOjD,KAAKkF,MAAMxE,OAQvC,OAPAiF,GAAW,YAAc3F,KAAKkF,KAAO,QAAUE,EAAM,QACrDO,GAAWC,EACNtC,KAAI,SAAS4B,EAAMZ,GAChB,OAAO6B,EAAInG,KAAKkF,KAAOU,EAAMlF,OAAS4D,EAAI,EAAG4B,GAAkB,IAAMhB,IACtElF,MACFuD,KAAK,MACVoC,GAAW,KAAOQ,EAAI,GAAID,EAAiBd,GAAO,MAGlD,OAAOO,EAAU,cAAgB3F,KAAKa,MAAQ,GAGlD,SAASsF,EAAIC,EAAG1F,GACZ,IAAIiE,EAAI1B,OAAOmD,GACf,OAAOC,MAAM3F,EAASiE,EAAEjE,OAAS,GAAG6C,KAAK,KAAOoB,IAuCxDhD,EAAOwC,KAAO,GAEdxC,EAAOwB,UAAUmD,KAAO,SAASC,GAC7B,IAGIb,EAHA1D,EAAQhC,KAAKgC,MAIjB,IAHAA,EAAMN,MAAM6E,EAAOvG,KAAKiC,cAGX,CACT,IAEI,KADAyD,EAAQ1D,EAAMqD,QAEV,MAEN,MAAOmB,GAGL,IAAIpC,EAAa,IAAIzD,EAAOX,KAAKY,QAASZ,KAAKuC,QAAU,GAKzD,MAJAvC,KAAKoC,MAAMZ,KAAK4C,IACZqC,EAAM,IAAIvD,MAAMlD,KAAK0G,iBAAiBF,KACtCG,OAAS3G,KAAKuC,QAClBkE,EAAIf,MAAQc,EAAEd,MACRe,EAGV,IAAItE,EAASnC,KAAKoC,MAAMpC,KAAKuC,SAGxBvC,KAAK4B,QAAQG,oBACP/B,KAAKoC,MAAMpC,KAAKuC,QAAU,GAGrC,IAAI6D,EAAIpG,KAAKuC,QAAU,EACnB6B,EAAa,IAAIzD,EAAOX,KAAKY,QAASwF,GAC1CpG,KAAKoC,MAAMZ,KAAK4C,GAMhB,IAHA,IA8BQqC,EA9BJ9D,OAAyBT,IAAfwD,EAAMkB,KAAqBlB,EAAMkB,KAAOlB,EAAMH,MACxDA,EAAQvD,EAAM6E,cAAgBpF,EAAciE,EAAMH,MAAQG,EAC1D1E,EAAYmB,EAAOnB,UACdqD,EAAIrD,EAAUN,OAAQ2D,KAAO,CAClC,IAAIV,EAAQ3C,EAAUqD,GAClByC,EAASnD,EAAMvD,KAAKN,QAAQ6D,EAAMtD,KAGtC,GAAIyG,EAAO9D,KAAO8D,EAAO9D,KAAKuC,GAC1BuB,EAAOpE,KAAOoE,EAAOpE,OAASgD,EAAMhD,KACtBoE,EAAOnE,UAAYA,EAAS,CAE1C,IAAI0C,EAAO1B,EAAMF,UAAU,CAACjD,KAAM+E,EAAOG,MAAOA,EAAOqB,SAAS,EAAMzG,UAAW8F,EAAI,IACrFhC,EAAWtD,OAAOU,KAAK6D,IAe/B,GAHAjB,EAAW9B,UAGsB,IAA7B8B,EAAWtD,OAAOJ,OAKlB,MAHI+F,EAAM,IAAIvD,MAAMlD,KAAKgH,YAAYtB,KACjCiB,OAAS3G,KAAKuC,QAClBkE,EAAIf,MAAQA,EACNe,EAINzG,KAAK4B,QAAQG,cACfI,EAAOF,WAAaD,EAAMwD,QAG5BxF,KAAKuC,UAUT,OARIJ,IACFnC,KAAKiC,WAAaD,EAAMwD,QAI1BxF,KAAKiH,QAAUjH,KAAKkE,SAGblE,MAGX2B,EAAOwB,UAAUuD,iBAAmB,SAASQ,GACzC,IAAIC,EAAcC,EAGd1B,EAAQwB,EAAWxB,MAQvB,OAPIA,GACAyB,EAAe,SAAWvE,KAAKC,UAAU6C,EAAMkB,KAAK,IAAM,iBAC1DQ,EAAepH,KAAKgC,MAAMyD,YAAYC,EAAO,kBAE7CyB,EAAe,sBACfC,EAAeF,EAAWvB,SAEvB3F,KAAKqH,kBAAkBD,EAAcD,IAGhDxF,EAAOwB,UAAU6D,YAAc,SAAStB,GACpC,IAAIyB,GAAgBzB,EAAMhD,KAAOgD,EAAMhD,KAAO,WAAa,IAAME,KAAKC,eAA0BX,IAAhBwD,EAAMH,MAAsBG,EAAMH,MAAQG,GACtH0B,EAAepH,KAAKgC,MAAMyD,YAAYC,EAAO,gBACjD,OAAO1F,KAAKqH,kBAAkBD,EAAcD,IAGhDxF,EAAOwB,UAAUkE,kBAAoB,SAASD,EAAcD,GACxD,IAAIvB,EAAQ,GACZA,EAAMpE,KAAK4F,GACX,IAAIE,EAAkBtH,KAAKoC,MAAM1B,OAAS,EACtC6G,EAAavH,KAAKoC,MAAMkF,GACxBE,EAAkBD,EAAWzG,OAC5B2G,QAAO,SAAS9D,GACb,IAAI+D,EAAa/D,EAAMvD,KAAKN,QAAQ6D,EAAMtD,KAC1C,OAAOqH,GAAoC,iBAAfA,KAyBpC,OAtB+B,IAA3BF,EAAgB9G,QAChBkF,EAAMpE,KAAK,cAAgB2F,EAAe,6EAC1CnH,KAAK2H,kBAAkBJ,EAAWzG,OAAQ8E,KAE1CA,EAAMpE,KAAK,cAAgB2F,EAAe,6DAIxBK,EACblE,KAAI,SAASK,GACV,OAAO3D,KAAK4H,qBAAqBjE,EAAO,KAAO,CAACA,KACjD3D,MAEKsB,SAAQ,SAASuG,GACzB,IAAIlE,EAAQkE,EAAW,GACnBH,EAAa/D,EAAMvD,KAAKN,QAAQ6D,EAAMtD,KACtCyH,EAAgB9H,KAAK+H,iBAAiBL,GAC1C9B,EAAMpE,KAAK,KAAOsG,EAAgB,cAClC9H,KAAK2H,kBAAkBE,EAAYjC,KACpC5F,OAEP4F,EAAMpE,KAAK,IACJoE,EAAMrC,KAAK,OAGtB5B,EAAOwB,UAAUwE,kBAAoB,SAASE,EAAYjC,GAGtD,IAFA,IAAIoC,EACAC,EAAmB,EACdC,EAAI,EAAGA,EAAIL,EAAWnH,OAAQwH,IAAK,CACxC,IAAIvE,EAAQkE,EAAWK,GACnBC,EAAUxE,EAAMvD,KAAK2C,SAASY,EAAMtD,KACpC8H,IAAYH,EACZC,KAEIA,EAAmB,GACnBrC,EAAMpE,KAAK,SAAWyG,EAAmB,iCAE7CA,EAAmB,EACnBrC,EAAMpE,KAAK,OAAS2G,IAExBH,EAAcG,IAItBxG,EAAOwB,UAAU4E,iBAAmB,SAAStF,GACzC,OA4EJ,SAA8BA,GAC1B,IAAIC,SAAcD,EAClB,GAAa,WAATC,EACA,OAAOD,EACJ,GAAa,WAATC,EAAmB,CAC1B,GAAID,EAAOE,QACP,OAAOC,KAAKC,UAAUJ,EAAOE,SAC1B,GAAIF,aAAkBK,OACzB,MAAO,sBAAwBL,EAC5B,GAAIA,EAAOC,KACd,OAAOD,EAAOC,KAAO,SAClB,GAAID,EAAOO,KACd,MAAO,kBAAoBC,OAAOR,EAAOO,MAEzC,MAAM,IAAIE,MAAM,wBAA0BT,IA1F3C2F,CAAqB3F,IAchCd,EAAOwB,UAAUyE,qBAAuB,SAASjE,EAAO0E,GACpD,IAA+B,IAA3BA,EAAQpC,QAAQtC,GAIhB,OAAO,KAEX,GAA8B,IAA1BA,EAAMpD,SAASG,OACf,MAAO,CAACiD,GAEZ,IAAI2E,EAAY3E,EAAMpD,SAAS,GAC3BgI,EAAe,CAAC5E,GAAO6E,OAAOH,GAC9BI,EAAczI,KAAK4H,qBAAqBU,EAAWC,GACvD,OAAoB,OAAhBE,EACO,KAEJ,CAAC9E,GAAO6E,OAAOC,IAG1B9G,EAAOwB,UAAUqC,KAAO,WACpB,IAAIrD,EAASnC,KAAKoC,MAAMpC,KAAKuC,SAE7B,OADAJ,EAAOF,WAAajC,KAAKiC,WAClBE,GAGXR,EAAOwB,UAAUuF,QAAU,SAASvG,GAChC,IAAItB,EAAQsB,EAAOtB,MACnBb,KAAKuC,QAAU1B,EACfb,KAAKoC,MAAMvB,GAASsB,EACpBnC,KAAKoC,MAAMuG,OAAO9H,EAAQ,GAC1Bb,KAAKiC,WAAaE,EAAOF,WAGzBjC,KAAKiH,QAAUjH,KAAKkE,UAIxBvC,EAAOwB,UAAUyF,OAAS,SAAS/H,GAC/B,IAAKb,KAAK4B,QAAQG,YACd,MAAM,IAAImB,MAAM,gDAIpBlD,KAAK0I,QAAQ1I,KAAKoC,MAAMvB,KAG5Bc,EAAOwB,UAAUe,OAAS,WAEtB,IAAI2E,EAAiB,GACjBzH,EAAQpB,KAAKY,QAAQQ,MAUzB,OATapB,KAAKoC,MAAMpC,KAAKoC,MAAM1B,OAAS,GACrCI,OAAOQ,SAAQ,SAAUwH,GACxBA,EAAE1I,KAAKP,OAASuB,GACT0H,EAAEzI,MAAQyI,EAAE1I,KAAKN,QAAQY,QACT,IAAhBoI,EAAExI,WACFwI,EAAEtI,OAASmB,EAAOwC,MACzB0E,EAAerH,KAAKsH,MAGrBD,EAAevF,KAAI,SAASyF,GAAI,OAAOA,EAAEvI,SAyC7C,CACHmB,OAAQA,EACRT,QAASA,EACTtB,KAAMA,IA/iBwBD,EAC9BA,EAAiBD,IAEjBD,EAAKuJ,QAAUtJ,QCAnBkB,OAAAA,EAAU,CACViE,WAAO3C,EACP6C,YAAa,CACb,CAAClF,KAAQ,OAAQC,QAAW,CAAC,IAAK,UAAW,KAAMC,YAAe,EAAC,CAAGkJ,KAAaA,GACnF,CAACpJ,KAAQ,wCAAyCC,QAAW,IAC7D,CAACD,KAAQ,wDAAyDC,QAAW,CAAC,KAAM,eACpF,CAACD,KAAQ,wCAAyCC,QAAW,CAAC,wCAAyC,yDAA0DC,YAAe,SAAiBmJ,GAAI,OAAOA,EAAE,GAAGV,OAAO,CAACU,EAAE,OAC3N,CAACrJ,KAAQ,iCAAkCC,QAAW,CAAC,aAAc,0CACrE,CAACD,KAAQ,iBAAkBC,QAAW,CAAC,kCAAmCC,YAT9E,SAAYoJ,GAAK,OAAOA,EAAE,KAUtB,CAACtJ,KAAQ,iBAAkBC,QAAW,GAAIC,YAAe,SAASmJ,GAAI,OAAO,OAC7E,CAACrJ,KAAQ,UAAWC,QAAW,CAAC,kBAAmBC,YAAgB,EAAEqJ,KAC7C,OAAZA,EAAyB,GACtB,CAACA,EAAQ,MAAOA,EAAQ,GAAG9F,KAAI,EAAC,CAAGyF,KAAOA,MAEzD,CAAClJ,KAAQ,aAAcC,QAAW,CAAC,eAAgBC,YAAe,GAAGwF,MAAaA,GAClF,CAAC1F,KAAQ,cAAeC,QAAW,CAAC,eACpC,CAACD,KAAQ,cAAeC,QAAW,CAAC,WACpC,CAACD,KAAQ,cAAeC,QAAW,CAAC,WACpC,CAACD,KAAQ,cAAeC,QAAW,CAAC,WACpC,CAACD,KAAQ,cAAeC,QAAW,CAAC,cACpC,CAACD,KAAQ,cAAeC,QAAW,CAAC,eACpC,CAACD,KAAQ,cAAeC,QAAW,CAAC,uBACpC,CAACD,KAAQ,cAAeC,QAAW,CAAC,cACpC,CAACD,KAAQ,cAAeC,QAAW,CAAC,UACpC,CAACD,KAAQ,oBAAqBC,QAAW,IACzC,CAACD,KAAQ,oBAAqBC,QAAW,CAAC,oCAAsCC,YAAe,SAAiBmJ,GAAI,OAAOA,EAAE,GAAGV,OAAO,CAACU,EAAE,OAC1I,CAACrJ,KAAQ,aAAcC,QAAW,aAAc,qBAAsBC,YAAe,EAAEsJ,EAAOC,MAAW,CAAEC,KAAM,aAAc1J,KAAMwJ,EAAMC,EAAK/F,KAAK,OACrJ,CAAC1D,KAAQ,SAAUC,QAAW,CAAC,CAAC6C,QAAU,KAAM,cAAe5C,YAAe,EAAC,EA/BnFF,KA+BwFA,OAAa,CAAE0J,KAAM,cAAU1J,KACnH,CAACA,KAAQ,gBAAiBC,QAAW,IACrC,CAACD,KAAQ,gBAAiBC,QAAW,CAAC,gBAAiB,kBAAmBC,YAAe,SAAiBmJ,GAAI,OAAOA,EAAE,GAAGV,OAAO,CAACU,EAAE,OACpI,CAACrJ,KAAQ,SAAUC,QAAW,CAAC,CAAC6C,QAAU,KAAO,gBAAiB,CAACA,QAAU,MAAQ5C,YAAe,EAAC,CAAGwF,MAAY,CAAEgE,KAAM,WAAYhE,MAAO,CAAEgE,KAAM,SAAUhE,MAAOA,EAAMhC,KAAK,QACnL,CAAC1D,KAAQ,iBAAkBC,QAAW,cACtC,CAACD,KAAQ,iBAAkBC,QAAW,CAAC,CAAC6C,QAAU,kBAAoB5C,YAAgB,EAAC,CAAGyJ,MAClF,OAAQA,GACJ,IAAK,IAAK,MAAO,KACjB,IAAK,IAAK,MAAO,KACjB,IAAK,IAAK,MAAO,KACjB,IAAK,IAAM,MAAO,IAClB,IAAK,KAAM,MAAO,QAG9B,CAAC3J,KAAQ,yBAA0BC,QAAW,CAAC,CAAC6C,QAAU,OAC1D,CAAC9C,KAAQ,gCAAiCC,QAAW,IACrD,CAACD,KAAQ,gCAAiCC,QAAW,CAAC,yCAA2CC,YAAe,SAAiBmJ,GAAI,OAAOA,EAAE,GAAGV,OAAO,CAACU,EAAE,OAC3J,CAACrJ,KAAQ,yBAA0BC,QAAW,SAAU,kCACxD,CAACD,KAAQ,SAAUC,QAAW,CAAC,0BAA2BC,YAAgB,GAAG0J,EAAMC,EAAO,QAAU,CAC5FH,KAAM,WACNhE,MAAO,CAAEgE,KAAM,SAAUhE,QAASkE,EAAOC,EAAKnG,KAAK,SAE3D,CAAC1D,KAAQ,YAAaC,QAAW,CAAC,WAAY,KAAM,cAAeC,YAAe,GAAG4J,GAAS,CAAIC,MAAa,CAAEL,KAAM,qBAAaI,SAAUC,KAC9I,CAAC/J,KAAQ,oBAAqBC,QAAW,CAAC,CAAC6C,QAAU,KAAM,CAACA,QAAU,MAAO5C,YAAe,SAAgBmJ,GAAI,OAAOA,EAAE3F,KAAK,MAC9H,CAAC1D,KAAQ,WAAYC,QAAW,CAAC,sBACjC,CAACD,KAAQ,oBAAqBC,QAAW,CAAC,CAAC6C,QAAU,KAAM,CAACA,QAAU,MAAO5C,YAAe,SAAgBmJ,GAAI,OAAOA,EAAE3F,KAAK,MAC9H,CAAC1D,KAAQ,WAAYC,QAAW,CAAC,sBACjC,CAACD,KAAQ,oBAAqBC,QAAW,CAAC,CAAC6C,QAAU,KAAM,CAACA,QAAU,MAAO5C,YAAe,SAAgBmJ,GAAI,OAAOA,EAAE3F,KAAK,MAC9H,CAAC1D,KAAQ,WAAYC,QAAW,CAAC,sBACjC,CAACD,KAAQ,oBAAqBC,QAAW,CAAC,CAAC6C,QAAU,KAAM,CAACA,QAAU,MAAO5C,YAAe,SAAgBmJ,GAAI,OAAOA,EAAE3F,KAAK,MAC9H,CAAC1D,KAAQ,WAAYC,QAAW,CAAC,sBACjC,CAACD,KAAQ,oBAAqBC,QAAW,CAAC,CAAC6C,QAAU,KAAM,CAACA,QAAU,MAAO5C,YAAe,SAAgBmJ,GAAI,OAAOA,EAAE3F,KAAK,MAC9H,CAAC1D,KAAQ,WAAYC,QAAW,CAAC,sBACjC,CAACD,KAAQ,oBAAqBC,QAAW,CAAC,CAAC6C,QAAU,KAAM,CAACA,QAAU,MAAO5C,YAAe,SAAgBmJ,GAAI,OAAOA,EAAE3F,KAAK,MAC9H,CAAC1D,KAAQ,WAAYC,QAAW,CAAC,sBACjC,CAACD,KAAQ,WAAYC,QAAW,kBAChC,CAACD,KAAQ,aAAcC,QAAW,CAAC,CAAC6C,QAAU,KAAM,IAAK,cAAe5C,YAAe,EAAC,CAAA,EAnE5FF,KAmEmGA,OAAa,CAAE0J,KAAM,aAAcK,OAAQ/J,KAC1I,CAACA,KAAQ,qBAAsBC,QAAW,CAAC,CAAC6C,QAAU,KAAM,IAAK,cAAe5C,YAAe,EAAC,CAAA,EApEpGF,KAoE2GA,OAAa,CAAE0J,KAAM,qBAAsBK,OAAQ/J,KAC1J,CAACA,KAAQ,wBAAyBC,QAAW,CAAC,IAAK,UAAW,MAC9D,CAACD,KAAQ,wBAAyBC,QAAW,CAAC,CAAC6C,QAAU,KAAM,wBAAyB,CAACA,QAAU,OACnG,CAAC9C,KAAQ,YAAaC,QAAW,CAAC,yBAA0BC,YAAe,GAAE,EAAG,CAAGkJ,QAAgB,CAAEM,KAAM,WAAYhE,MAAO,CAAEgE,KAAM,YAAahE,MAAO0D,MAC1J,CAACpJ,KAAQ,oBAAqBC,QAAW,CAAC,IAAK,UAAW,MAC1D,CAACD,KAAQ,oBAAqBC,QAAW,CAAC,CAAC6C,QAAU,KAAM,oBAAqB,CAACA,QAAU,OAC3F,CAAC9C,KAAQ,QAASC,QAAW,CAAC,qBAAsBC,YAAe,GAAE,EAAG,CAAGkJ,QAAe,CAAEM,KAAM,gBAASN,KAC3G,CAACpJ,KAAQ,WAAYC,QAAW,IAChC,CAACD,KAAQ,WAAYC,QAAW,CAAC,sBAAwBC,YAAe,SAAiBmJ,GAAI,OAAOA,EAAE,GAAGV,OAAO,CAACU,EAAE,OACnH,CAACrJ,KAAQ,WAAYC,QAAW,IAChC,CAACD,KAAQ,kCAAmCC,QAAW,IACvD,CAACD,KAAQ,kCAAmCC,QAAW,CAAC,6CAA+CC,YAAe,SAAiBmJ,GAAI,OAAOA,EAAE,GAAGV,OAAO,CAACU,EAAE,OACjK,CAACrJ,KAAQ,2BAA4BC,QAAW,CAAC,UAAW,oCAC5D,CAACD,KAAQ,WAAYC,QAAW,CAAC,WAAY,4BAA6BC,YAAe,SAAiBmJ,GAAI,OAAOA,EAAE,GAAGV,OAAO,CAACU,EAAE,OACpI,CAACrJ,KAAQ,IAAKC,QAAW,CAAC,WAAY,aACtC,CAACD,KAAQ,YAAaC,QAAW,aACjC,CAACD,KAAQ,YAAaC,QAAW,CAAC,uBAAyBC,YAAe,SAAiBmJ,GAAI,OAAOA,EAAE,GAAGV,OAAO,CAACU,EAAE,OACrH,CAACrJ,KAAQ,YAAaC,QAAW,IACjC,CAACD,KAAQ,mCAAoCC,QAAW,IACxD,CAACD,KAAQ,mCAAoCC,QAAW,CAAC,8CAAgDC,YAAe,SAAiBmJ,GAAI,OAAOA,EAAE,GAAGV,OAAO,CAACU,EAAE,OACnK,CAACrJ,KAAQ,4BAA6BC,QAAW,CAAC,UAAW,qCAC7D,CAACD,KAAQ,YAAaC,QAAW,CAAC,YAAa,6BAA8BC,YAAe,SAAiBmJ,GAAI,OAAOA,EAAE,GAAGV,OAAO,CAACU,EAAE,OACvI,CAACrJ,KAAQ,KAAMC,QAAW,CAAC,YAAa,cACxC,CAACD,KAAQ,mCAAoCC,QAAW,IACxD,CAACD,KAAQ,mCAAoCC,QAAW,CAAC,8CAAgDC,YAAe,SAAiBmJ,GAAI,OAAOA,EAAE,GAAGV,OAAO,CAACU,EAAE,OACnK,CAACrJ,KAAQ,4BAA6BC,QAAW,CAAC,UAAW,qCAC7D,CAACD,KAAQ,YAAaC,QAAW,CAAC,8BAClC,CAACD,KAAQ,mCAAoCC,QAAW,IACxD,CAACD,KAAQ,mCAAoCC,QAAW,CAAC,8CAAgDC,YAAe,SAAiBmJ,GAAI,OAAOA,EAAE,GAAGV,OAAO,CAACU,EAAE,OACnK,CAACrJ,KAAQ,4BAA6BC,QAAW,CAAC,UAAW,qCAC7D,CAACD,KAAQ,YAAaC,QAAW,CAAC,YAAa,6BAA8BC,YAAe,SAAiBmJ,GAAI,OAAOA,EAAE,GAAGV,OAAO,CAACU,EAAE,OACvI,CAACrJ,KAAQ,KAAMC,QAAW,CAAC,cAC3B,CAACD,KAAQ,iBAAkBC,QAAW,IACtC,CAACD,KAAQ,iBAAkBC,QAAW,CAAC,sBAAwBC,YAAe,SAAiBmJ,GAAI,OAAOA,EAAE,GAAGV,OAAO,CAACU,EAAE,OACzH,CAACrJ,KAAQ,UAAWC,QAAW,CAAC,CAAC6C,QAAU,KAAM,iBAAkB,CAACA,QAAU,SAE9EmC,YAAa,aAE6C,IAAnB+E,EACxCA,EAAiBjJ,EAEjBkJ,OAAOlJ,QAAUA,EC3Gb,IAAImJ,EAAsBnD,IAC7B,IAAI/F,EAAQ,EACZ,MAAO,CACHmJ,KAAKC,IACDpJ,GAASoJ,EACFrD,EAAKpD,MAAM3C,EAAQoJ,EAAOpJ,MCMtC,SAASqJ,EAAeC,EAAuBC,GAClD,IAAIC,EAAS,IAAIC,EAAA3K,GAAQgC,QAAO2I,EAAAT,IAChCQ,EAAO/D,KAAK6D,GACZ,IAAIlB,EAAUoB,EAAOpD,QAAQ,GAC7B,IAAKgC,EACD,KAAM,4BAGV,MAAO,CACHsB,IAAIC,GACA,IAAIC,EAA2B,CAC3BC,OAAQX,EAAmBS,SAC3BJ,EACAO,MAAO,IAEXC,EAAW3B,EAASwB,EAASI,GAAiB,IAElDC,QAAQC,EAAqBC,GACzBJ,EAAW3B,EAAS8B,EAAIC,GAAO,KAKpC,SAASC,EAAS1F,GACrB,MAAO,CAAC,SAAU,SAAU,WAAW2F,SAAS3F,EAAMgE,MAOnD,IAAIsB,EAAiC,CACxCrK,KAAM,CACF2K,WAAY,CACR5B,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACRD,EAAGX,MAAM,IAAMxH,KAAKC,UAAUkI,EAAGJ,MAAO,KAAM,GAAK,OAG3DS,KAAM,CAAE7B,KAAM,UAAWhE,OAAO,GAChC8F,MAAO,CAAE9B,KAAM,UAAWhE,OAAO,GACjC+F,MAAO,CACH/B,KAAM,SACNhE,MAAO,CACH/E,KAAM,CACFwJ,KAAM,CACFT,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAIO,EAAsB,GACtBhF,EAAQwE,EAAGL,OAAOV,KAAK,KAE3B,IADAuB,EAAU/J,KAAK+E,GACS,MAAjBA,EAAM7F,QACT6F,EAAQwE,EAAGL,OAAOV,KAAK,KACvBuB,EAAU/J,KAAK+E,GAEnBwE,EAAGJ,MAAMnJ,KAAK,CAAE+H,KAAM,SAAUhE,MAAOgG,EAAUhI,KAAK,WAM1EiI,OAAQ,CACJjC,KAAM,SACNhE,MAAO,CACH/E,KAAM,CACF4J,MAAO,CACHb,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAIS,EAAQV,EAAGJ,MAAMe,MACrB,IAAKT,EAASQ,GACV,MAAM,IAAIE,UAAU,+BAA+BF,EAAMlC,QAE7DwB,EAAGX,MAAMqB,EAAMlG,MAAMxC,iBAMzC6I,OAAQ,CACJrC,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAIS,EAAQV,EAAGJ,MAAMe,MACrB,IAAKT,EAASQ,GACV,MAAM,IAAIE,UAAU,+BAA+BF,EAAMlC,QAE7DwB,EAAGX,MAAMqB,EAAMlG,MAAMxC,WAAa,QAG1C8I,MAAO,CACHtC,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAIc,EAAuB,GACvB/C,EAAIgC,EAAGL,OAAOV,KAAK,GACvB,KAAa,OAANjB,GAAoB,KAANA,GACjB+C,EAAWtK,KAAKuH,GAChBA,EAAIgC,EAAGL,OAAOV,KAAK,GAEvBe,EAAGJ,MAAMnJ,KAAK,CAAE+H,KAAM,SAAUhE,MAAOuG,EAAWvI,KAAK,QAG/DwI,OAAQ,CACJxC,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAIS,EAAQV,EAAGJ,MAAMe,MACrB,IAAKT,EAASQ,GACV,MAAM,IAAIE,UAAU,mCAAmCF,EAAMlC,QAEjEwB,EAAGJ,MAAMnJ,KAAK,CAAE+H,KAAM,SAAUhE,OAAQkG,EAAMlG,UAGtDyG,MAAO,CACHzC,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACRD,EAAGJ,MAAMnJ,KAAK,CACV+H,KAAM,QACNhE,MAAO,OAInB0G,OAAQ,CACJ1C,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACRD,EAAGJ,MAAMnJ,KAAK,CACV+H,KAAM,SACNhE,MAAO,OAInB2G,KAAM,CACF3C,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAImB,EAAOpB,EAAGJ,MAAMe,MACpB,GAAkB,cAAdS,EAAK5C,KACL,MAAMoC,UAAU,kCAAkCQ,EAAK5C,QAE3D,IAAK,IAAI6C,EAAI,EAAGA,EAAI,IAAMA,IACtBxB,EAAWuB,EAAK5G,MAAOwF,EAAIC,GAAO,KAI9CqB,GAAI,CACA9C,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAKsB,EAAOC,EAAMC,GAAczB,EAAGJ,MAAMhC,QAAO,EAAI,GACpD,GACmB,cAAf2D,EAAM/C,MACQ,cAAdgD,EAAKhD,MACe,YAApBiD,EAAWjD,KAEX,MAAM,IAAIoC,UACN,iDAAiDW,EAAM/C,SAASgD,EAAKhD,YAAYiD,EAAWjD,QAGpGqB,EAAW4B,EAAWjH,MAAQ+G,EAAM/G,MAAQgH,EAAKhH,MAAOwF,EAAIC,GAAO,KAG3ET,IAAK,CACDhB,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAIyB,EAAY1B,EAAGJ,MAAMe,MACzB,GAAuB,cAAnBe,EAAUlD,KACV,MAAM,IAAIoC,UAAU,kCAAkCc,EAAUlD,QAEpEqB,EAAW6B,EAAUlH,MAAOwF,EAAIC,GAAO,KAG/C0B,KAAM,CACFnD,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAIpE,EAAOmE,EAAGJ,MAAMe,MACpB,GAAkB,WAAd9E,EAAK2C,KACL,MAAM,IAAIoC,UAAU,+BAA+B/E,EAAK2C,QAE5DW,EAAetD,EAAKrB,MAAOwF,EAAGX,OAAOU,QAAQC,EAAIC,KAGzD2B,MAAO,CACHpD,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAKtB,EAAM1G,GAAQ+H,EAAGJ,MAAMhC,QAAO,EAAI,GACvC,GAAkB,cAAde,EAAKH,MAAsC,cAAdvG,EAAKuG,KAClC,MAAM,IAAIoC,UACN,mCAAmCjC,EAAKH,YAAYvG,EAAKuG,QAGjE,IAAI6C,EAAI,EACR,KACKxB,EAAW5H,EAAKuC,MAAOwF,EAAIC,GAAO,GAAQD,EAAGJ,MAAMe,MAAOnG,OAAS6G,EAAI,KAExExB,EAAWlB,EAAKnE,MAAOwF,EAAIC,GAAO,GAClCoB,GAAK,IAIjBQ,OAAQ,CACJrD,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAIS,EAAQV,EAAGJ,MAAMe,MACrBX,EAAGJ,MAAMnJ,KAAK,CACV+H,KAAM,SACNhE,MAAO3C,KAAKC,UAAU4I,GAAO,CAACW,EAAGS,IAAMA,EAAEtH,YAIrDuH,SAAU,CACNvD,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAItB,EAAOqB,EAAGJ,MAAMe,MACpB,GAAkB,WAAdhC,EAAKH,KACL,MAAM,IAAIoC,UAAU,2CAA2CjC,EAAKH,QAExEwB,EAAGJ,MAAMnJ,KACLoB,KAAKmK,MAAMrD,EAAKnE,OAAO,CAAC6G,EAAGS,KAAO,CAC9BtD,KAAMlD,MAAM2G,QAAQH,GAAK,eAAiBA,EAC1CtH,MAAOsH,WAQpBI,EAAwC,CAC/CzL,KAAM,CACF+H,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAKzF,EAAOyG,GAASjB,EAAGJ,MAAMhC,QAAO,EAAI,GACzCqD,EAAMzG,MAAM/D,KAAK+D,KAGzBmG,IAAK,CACDnC,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAIgB,EAAQjB,EAAGJ,MAAMe,MACrBX,EAAGJ,MAAMnJ,KAAKwK,EAAMzG,MAAMmG,SAGlCwB,QAAS,CACL3D,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAKzF,EAAOyG,GAASjB,EAAGJ,MAAMhC,QAAO,EAAI,GACzCqD,EAAMzG,MAAM2H,QAAQ3H,KAG5B4H,MAAO,CACH5D,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAIgB,EAAQjB,EAAGJ,MAAMe,MACrBX,EAAGJ,MAAMnJ,KAAKwK,EAAMzG,MAAM4H,WAGlCC,IAAK,CACD7D,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAKnK,EAAOmL,GAASjB,EAAGJ,MAAMhC,QAAO,EAAI,GACzC,GAAmB,WAAf9H,EAAM0I,KACN,MAAMoC,UAAU,kCAAkC9K,EAAM0I,QAE5DwB,EAAGJ,MAAMnJ,KAAKwK,EAAMzG,MAAM1E,EAAM0E,UAGxC8H,IAAK,CACD9D,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAKzF,EAAO1E,EAAOmL,GAASjB,EAAGJ,MAAMhC,QAAO,EAAI,GAChD,GAAmB,WAAf9H,EAAM0I,KACN,MAAMoC,UAAU,kCAAkC9K,EAAM0I,QAE5DyC,EAAMzG,MAAM1E,EAAM0E,OAASA,KAK5B+H,EAAyC,CAChDF,IAAK,CACD7D,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAKlJ,EAAKyL,GAAOxC,EAAGJ,MAAMhC,QAAO,EAAI,GACrCoC,EAAGJ,MAAMnJ,KAAK+L,EAAIhI,MAAMzD,EAAIyD,UAGpC8H,IAAK,CACD9D,KAAM,iBACNhE,MAAO,CAACwF,EAAIC,KACR,IAAKzF,EAAOzD,EAAKyL,GAAOxC,EAAGJ,MAAMhC,QAAO,EAAI,GAC5C4E,EAAIhI,MAAMzD,EAAIyD,OAASA,KAYnC,SAASqF,EACL3B,EACAwB,EACAO,EACAwC,GAEIA,IACAxC,EAAQ,CACJyC,OAAQzC,EACRxK,KAAM,KAGdyI,EAAQ3H,SAASoM,IACbC,EAAcD,EAAYjD,EAASO,MAW3C,SAAS2C,EACLD,EACAjD,EACAO,GAEA,IACIS,EACAmC,GArVRjD,MAmVUA,GAAUF,EAGhB,OAAQiD,EAAWnE,MACf,IAAK,SAED,GADAqE,EAAWjD,EAAMe,MACK,WAAlBkC,EAASrE,KACTkC,EAAQmC,EAASrI,MAAM/E,KAAKkN,EAAW7N,WACpC,GAAsB,UAAlB+N,EAASrE,KAChBkC,EAAQwB,EAAeS,EAAW7N,MAClC8K,EAAMnJ,KAAKoM,OACR,CAAA,GAAsB,WAAlBA,EAASrE,KAIhB,MAAM,IAAIrG,MAAM,yBAHhBuI,EAAQ6B,EAAgBI,EAAW7N,MACnC8K,EAAMnJ,KAAKoM,GAIf,QAAc1L,IAAVuJ,EACA,MAAM,IAAIoC,eAAe,2BAA2BH,EAAW7N,QAEnEiO,EAASrC,EAAOhB,EAASO,GACzB,MACJ,IAAK,aACDA,EAAMxK,KAAKkN,EAAW9D,QAAUe,EAAMe,MACtC,MACJ,IAAK,qBAED,GADAkC,EAAWjD,EAAMe,MACK,cAAlBkC,EAASrE,KACT,MAAM,IAAIoC,UAAU,kCAAkCiC,EAASrE,QAEnEyB,EAAMxK,KAAKkN,EAAW9D,QAAU,CAAEL,KAAM,WAAYhE,MAAOqI,EAASrI,OACpE,MACJ,IAAK,WACDoF,EAAMnJ,KAAKkM,EAAWnI,OACtB,MACJ,IAAK,QACDqF,EAAW8C,EAAWzE,QAASwB,EAASO,GAAO,GAC/C,MACJ,IAAK,aACD,IA1XZnL,KA0XkBA,GAAS6N,EACfjC,EA+BZ,SAAqBsC,EAA6BlO,GAC9C,IAAImL,EAAQ+C,EACRC,EAAShD,EAAMxK,KAAKX,GACpBuM,EAAI,EACJ6B,EAAiB,IACrB,UAAkB/L,IAAX8L,GAAwBhD,EAAMyC,QAAUrB,EAAI6B,GAC/CjD,EAAQA,EAAMyC,OACdO,EAAShD,EAAMxK,KAAKX,GACpBuM,GAAK,EAET,QAAelK,IAAX8L,EACA,MAAI5B,GAAK6B,EACC,IAAI/K,MAAM,gCAEV,IAAI2K,eAAe,2BAA2BhO,KAG5D,OAAOmO,EAhDSE,CAAYlD,EAAOnL,GAC3BiO,EAASrC,EAAOhB,EAASO,GACzB,MACJ,IAAK,YACD,IAAIrB,EAAWwE,EAAYT,EAAW/D,UAClC/F,EAAO+G,EAAMe,MACjBiC,EAAcD,EAAW9D,OAAQa,EAASO,GAC1C,IAAInH,EAAQ8G,EAAMe,MAClBf,EAAMnJ,KAAKmI,EAAS/F,EAAMC,KAatC,SAASiK,EAASrC,EAAsBhB,EAA0BO,GAC3C,aAAfS,EAAMlC,KACNqB,EAAWa,EAAMlG,MAAOkF,EAASO,GAAO,GAClB,mBAAfS,EAAMlC,KACbkC,EAAMlG,MAAMkF,EAASO,GAErBP,EAAQE,MAAMnJ,KAAKiK,GAwB3B,SAAS2C,EACLC,GAEA,MAAO,CAACC,EAAGC,KACP,GAAe,WAAXD,EAAE/E,MAAgC,WAAXgF,EAAEhF,KACzB,MAAM,IAAIoC,UAAU,kCAAkC2C,EAAE/E,YAAYgF,EAAEhF,QAE1E,MAAO,CAAEA,KAAM,SAAUhE,MAAO8I,EAAEC,EAAE/I,MAAOgJ,EAAEhJ,SAIrD,SAASiJ,EACLH,GAEA,MAAO,CAACC,EAAGC,KACP,GAAe,WAAXD,EAAE/E,MAAgC,WAAXgF,EAAEhF,KACzB,MAAM,IAAIoC,UACN,yBAAyB2C,EAAE/E,YAAYgF,EAAEhF,gCAGjD,MAAO,CAAEA,KAAM,UAAWhE,MAAO8I,EAAEC,EAAE/I,MAAOgJ,EAAEhJ,SAItD,IAAI4I,EAGA,CACA,IAAKC,GAAgB,CAACE,EAAGC,IAAMD,EAAIC,IACnC,IAAKH,GAAgB,CAACE,EAAGC,IAAMD,EAAIC,IACnC,IAAKH,GAAgB,CAACE,EAAGC,KAAQD,EAAIC,EAAKA,GAAKA,IAC/C,IAAK,CAACD,EAAkBC,KACpB,IAAK,CAAC,SAAU,UAAUrD,SAASoD,EAAE/E,QAAU,CAAC,SAAU,UAAU2B,SAASqD,EAAEhF,MAC3E,MAAM,IAAIoC,UACN,0BAA0B2C,EAAE/E,YAAYgF,EAAEhF,6BAGlD,IAAIA,EAA8B,SAIlC,MAHe,WAAX+E,EAAE/E,MAAgC,WAAXgF,EAAEhF,OACzBA,EAAO,UAEJ,MAAEA,EAAMhE,MAAO+I,EAAE/I,MAAQgJ,EAAEhJ,QAEtC,IAAK6I,GAAgB,CAACE,EAAGC,IAAMD,EAAIC,IACnC,KAAMH,GAAgB,CAACE,EAAGC,IAAMD,GAAKC,IACrC,KAAMH,GAAgB,CAACE,EAAGC,IAAMD,GAAKC,IACrC,IAAKH,GAAgB,CAACE,EAAGC,IAAMD,EAAIC,IACnC,IAAKH,GAAgB,CAACE,EAAGC,IAAMD,EAAIC,IACnC,IAAKH,GAAgB,CAACE,EAAGC,IAAMD,EAAIC,IACnC,IAAKC,GAAmB,CAACF,EAAGC,IAAMD,EAAIC,IACtC,KAAMC,GAAmB,CAACF,EAAGC,IAAMD,GAAKC,IACxC,IAAKC,GAAmB,CAACF,EAAGC,IAAMD,EAAIC,IACtC,KAAMC,GAAmB,CAACF,EAAGC,IAAMD,GAAKC,IACxC,KAAM,CAACD,EAAkBC,KACd,CAAEhF,KAAM,UAAWhE,MAAO+I,EAAE/E,OAASgF,EAAEhF,MAAQ+E,EAAE/I,QAAUgJ,EAAEhJ,QAExE,KAAM,CAAC+I,EAAkBC,KACd,CAAEhF,KAAM,UAAWhE,MAAO+I,EAAE/E,OAASgF,EAAEhF,MAAQ+E,EAAE/I,QAAUgJ,EAAEhJ,SCverE,SAASkJ,EAAOH,GACnB,IAAIC,EAAID,EAAE,GAAGzI,MAAM,MAInB,OAHoB,IAAhB0I,EAAE,GAAG7N,QACL6N,EAAE5F,OAAO,EAAG,GAET4F,EAAEjL,KAAK4B,GAASA,EAAKwJ,cAAanL,KAAK,MCH3C,IAAIoL,EAAgB,CACvB,cAAe,CAAC,wBAAyB,IACzCC,WAAc,CAAC,mBAAoB,IACnCC,UAAa,CACTJ,CAAM;;;;;;;kBAQN,KAEJ,gBAAiB,CACbA,CAAM;;;;;UAMN,KAEJ,6BAA8B,CAC1BA,CAAM;;;;;UAMNA,CAAM;;;;WAMV,iCAAkC,CAC9BA,CAAM;;;UAINA,CAAM;;;;;WAOV,mBAAoB,CAChBA,CAAM;;;UAINA,CAAM;;;WAKV,+BAAgC,CAC5BA,CAAM;;;UAIN,IAEJ,2CAA4C,CACxCA,CAAM;;;;;;;;;;;;;UAcN,WClFRK,EAAiBlM,KAAKmK,MAAM,omBCK5B,IAAIgC,EAAMC,SAASC,cAAc,OCLH,IAACC,EAAuBC,EDMtDJ,EAAIK,WCN2BF,EDMEJ,EAAAO,WAAWC,ICNUH,EDMLL,EAAAK,QCJtC,YAAYD,cAA0BC,69CDKjDH,SAAStF,KAAK6F,YAAYR,GAE1B,IAAIS,EAASR,SAASS,eAAe,iBACjCC,EAAUV,SAASS,eAAe,WAClCE,EAAQX,SAASS,eAAe,SAChCG,EAASZ,SAASS,eAAe,UACjCI,EAASb,SAASS,eAAe,UAerC,SAASK,IACLC,WAAWC,EAAQ,GAGvB,SAASA,IACDN,EAAQnK,QAAUoJ,EAAca,EAAOjK,SAAS,KAChDiK,EAAOjK,MAAQ,KAEnBqK,EAAOK,UAAY,GACnB,IACIJ,EAAOI,UAAY,GACnB/F,EAAewF,EAAQnK,OAAQsH,GAAOgD,EAAOI,WAAapD,IAAItC,IAAIoF,EAAMpK,OAC1E,MAAO2K,GACL,IACIC,EADAC,EAAY,GAAKF,EAEjBE,EAAUC,WAAW,kCACrBD,EAAYA,EAAUE,QAAO,yBAA2B,IACxDH,EAAW,IAAII,IAAIH,EAAUvK,MAAM,OACnCuK,EAAY/J,MAAMmK,KAAKL,GAAU5M,KAAK,OAE1CqM,EAAOK,UAAYG,GAjC3BK,OAAOC,KAAK/B,GAAerN,SAASQ,IAChC,IAAI6O,EAAS3B,SAASC,cAAc,UACpC0B,EAAOC,YAAc9O,EACrB6O,EAAOpL,MAAQzD,EACf0N,EAAOD,YAAYoB,MAEvBnB,EAAOqB,iBAAiB,UAAU,MAC5BnB,EAAQnK,MAAOoK,EAAMpK,OAASoJ,EAAca,EAAOjK,OACrDmK,EAAQoB,KAAOhL,KAAKC,IAAI2J,EAAQoB,KAAMpB,EAAQnK,MAAMM,MAAM,MAAMnF,QAChEiP,EAAMmB,KAAOnB,EAAMpK,MAAMM,MAAM,MAAMnF,OACrCsP,OA2BJA,IAEAN,EAAQmB,iBAAiB,QAASf,GAAc,GAChDH,EAAMkB,iBAAiB,QAASf,GAAc","sources":["node_modules/nearley/lib/nearley.js","grammar.ne","src/util.ts","src/broccoli.ts","src/util/dedent.ts","src/example.ts","package.json","src/main.ts","src/lib/githubCorner.ts"],"sourcesContent":["(function(root, factory) {\n if (typeof module === 'object' && module.exports) {\n module.exports = factory();\n } else {\n root.nearley = factory();\n }\n}(this, function() {\n\n function Rule(name, symbols, postprocess) {\n this.id = ++Rule.highestId;\n this.name = name;\n this.symbols = symbols; // a list of literal | regex class | nonterminal\n this.postprocess = postprocess;\n return this;\n }\n Rule.highestId = 0;\n\n Rule.prototype.toString = function(withCursorAt) {\n var symbolSequence = (typeof withCursorAt === \"undefined\")\n ? this.symbols.map(getSymbolShortDisplay).join(' ')\n : ( this.symbols.slice(0, withCursorAt).map(getSymbolShortDisplay).join(' ')\n + \" ● \"\n + this.symbols.slice(withCursorAt).map(getSymbolShortDisplay).join(' ') );\n return this.name + \" → \" + symbolSequence;\n }\n\n\n // a State is a rule at a position from a given starting point in the input stream (reference)\n function State(rule, dot, reference, wantedBy) {\n this.rule = rule;\n this.dot = dot;\n this.reference = reference;\n this.data = [];\n this.wantedBy = wantedBy;\n this.isComplete = this.dot === rule.symbols.length;\n }\n\n State.prototype.toString = function() {\n return \"{\" + this.rule.toString(this.dot) + \"}, from: \" + (this.reference || 0);\n };\n\n State.prototype.nextState = function(child) {\n var state = new State(this.rule, this.dot + 1, this.reference, this.wantedBy);\n state.left = this;\n state.right = child;\n if (state.isComplete) {\n state.data = state.build();\n // Having right set here will prevent the right state and its children\n // form being garbage collected\n state.right = undefined;\n }\n return state;\n };\n\n State.prototype.build = function() {\n var children = [];\n var node = this;\n do {\n children.push(node.right.data);\n node = node.left;\n } while (node.left);\n children.reverse();\n return children;\n };\n\n State.prototype.finish = function() {\n if (this.rule.postprocess) {\n this.data = this.rule.postprocess(this.data, this.reference, Parser.fail);\n }\n };\n\n\n function Column(grammar, index) {\n this.grammar = grammar;\n this.index = index;\n this.states = [];\n this.wants = {}; // states indexed by the non-terminal they expect\n this.scannable = []; // list of states that expect a token\n this.completed = {}; // states that are nullable\n }\n\n\n Column.prototype.process = function(nextColumn) {\n var states = this.states;\n var wants = this.wants;\n var completed = this.completed;\n\n for (var w = 0; w < states.length; w++) { // nb. we push() during iteration\n var state = states[w];\n\n if (state.isComplete) {\n state.finish();\n if (state.data !== Parser.fail) {\n // complete\n var wantedBy = state.wantedBy;\n for (var i = wantedBy.length; i--; ) { // this line is hot\n var left = wantedBy[i];\n this.complete(left, state);\n }\n\n // special-case nullables\n if (state.reference === this.index) {\n // make sure future predictors of this rule get completed.\n var exp = state.rule.name;\n (this.completed[exp] = this.completed[exp] || []).push(state);\n }\n }\n\n } else {\n // queue scannable states\n var exp = state.rule.symbols[state.dot];\n if (typeof exp !== 'string') {\n this.scannable.push(state);\n continue;\n }\n\n // predict\n if (wants[exp]) {\n wants[exp].push(state);\n\n if (completed.hasOwnProperty(exp)) {\n var nulls = completed[exp];\n for (var i = 0; i < nulls.length; i++) {\n var right = nulls[i];\n this.complete(state, right);\n }\n }\n } else {\n wants[exp] = [state];\n this.predict(exp);\n }\n }\n }\n }\n\n Column.prototype.predict = function(exp) {\n var rules = this.grammar.byName[exp] || [];\n\n for (var i = 0; i < rules.length; i++) {\n var r = rules[i];\n var wantedBy = this.wants[exp];\n var s = new State(r, 0, this.index, wantedBy);\n this.states.push(s);\n }\n }\n\n Column.prototype.complete = function(left, right) {\n var copy = left.nextState(right);\n this.states.push(copy);\n }\n\n\n function Grammar(rules, start) {\n this.rules = rules;\n this.start = start || this.rules[0].name;\n var byName = this.byName = {};\n this.rules.forEach(function(rule) {\n if (!byName.hasOwnProperty(rule.name)) {\n byName[rule.name] = [];\n }\n byName[rule.name].push(rule);\n });\n }\n\n // So we can allow passing (rules, start) directly to Parser for backwards compatibility\n Grammar.fromCompiled = function(rules, start) {\n var lexer = rules.Lexer;\n if (rules.ParserStart) {\n start = rules.ParserStart;\n rules = rules.ParserRules;\n }\n var rules = rules.map(function (r) { return (new Rule(r.name, r.symbols, r.postprocess)); });\n var g = new Grammar(rules, start);\n g.lexer = lexer; // nb. storing lexer on Grammar is iffy, but unavoidable\n return g;\n }\n\n\n function StreamLexer() {\n this.reset(\"\");\n }\n\n StreamLexer.prototype.reset = function(data, state) {\n this.buffer = data;\n this.index = 0;\n this.line = state ? state.line : 1;\n this.lastLineBreak = state ? -state.col : 0;\n }\n\n StreamLexer.prototype.next = function() {\n if (this.index < this.buffer.length) {\n var ch = this.buffer[this.index++];\n if (ch === '\\n') {\n this.line += 1;\n this.lastLineBreak = this.index;\n }\n return {value: ch};\n }\n }\n\n StreamLexer.prototype.save = function() {\n return {\n line: this.line,\n col: this.index - this.lastLineBreak,\n }\n }\n\n StreamLexer.prototype.formatError = function(token, message) {\n // nb. this gets called after consuming the offending token,\n // so the culprit is index-1\n var buffer = this.buffer;\n if (typeof buffer === 'string') {\n var lines = buffer\n .split(\"\\n\")\n .slice(\n Math.max(0, this.line - 5), \n this.line\n );\n\n var nextLineBreak = buffer.indexOf('\\n', this.index);\n if (nextLineBreak === -1) nextLineBreak = buffer.length;\n var col = this.index - this.lastLineBreak;\n var lastLineDigits = String(this.line).length;\n message += \" at line \" + this.line + \" col \" + col + \":\\n\\n\";\n message += lines\n .map(function(line, i) {\n return pad(this.line - lines.length + i + 1, lastLineDigits) + \" \" + line;\n }, this)\n .join(\"\\n\");\n message += \"\\n\" + pad(\"\", lastLineDigits + col) + \"^\\n\";\n return message;\n } else {\n return message + \" at index \" + (this.index - 1);\n }\n\n function pad(n, length) {\n var s = String(n);\n return Array(length - s.length + 1).join(\" \") + s;\n }\n }\n\n function Parser(rules, start, options) {\n if (rules instanceof Grammar) {\n var grammar = rules;\n var options = start;\n } else {\n var grammar = Grammar.fromCompiled(rules, start);\n }\n this.grammar = grammar;\n\n // Read options\n this.options = {\n keepHistory: false,\n lexer: grammar.lexer || new StreamLexer,\n };\n for (var key in (options || {})) {\n this.options[key] = options[key];\n }\n\n // Setup lexer\n this.lexer = this.options.lexer;\n this.lexerState = undefined;\n\n // Setup a table\n var column = new Column(grammar, 0);\n var table = this.table = [column];\n\n // I could be expecting anything.\n column.wants[grammar.start] = [];\n column.predict(grammar.start);\n // TODO what if start rule is nullable?\n column.process();\n this.current = 0; // token index\n }\n\n // create a reserved token for indicating a parse fail\n Parser.fail = {};\n\n Parser.prototype.feed = function(chunk) {\n var lexer = this.lexer;\n lexer.reset(chunk, this.lexerState);\n\n var token;\n while (true) {\n try {\n token = lexer.next();\n if (!token) {\n break;\n }\n } catch (e) {\n // Create the next column so that the error reporter\n // can display the correctly predicted states.\n var nextColumn = new Column(this.grammar, this.current + 1);\n this.table.push(nextColumn);\n var err = new Error(this.reportLexerError(e));\n err.offset = this.current;\n err.token = e.token;\n throw err;\n }\n // We add new states to table[current+1]\n var column = this.table[this.current];\n\n // GC unused states\n if (!this.options.keepHistory) {\n delete this.table[this.current - 1];\n }\n\n var n = this.current + 1;\n var nextColumn = new Column(this.grammar, n);\n this.table.push(nextColumn);\n\n // Advance all tokens that expect the symbol\n var literal = token.text !== undefined ? token.text : token.value;\n var value = lexer.constructor === StreamLexer ? token.value : token;\n var scannable = column.scannable;\n for (var w = scannable.length; w--; ) {\n var state = scannable[w];\n var expect = state.rule.symbols[state.dot];\n // Try to consume the token\n // either regex or literal\n if (expect.test ? expect.test(value) :\n expect.type ? expect.type === token.type\n : expect.literal === literal) {\n // Add it\n var next = state.nextState({data: value, token: token, isToken: true, reference: n - 1});\n nextColumn.states.push(next);\n }\n }\n\n // Next, for each of the rules, we either\n // (a) complete it, and try to see if the reference row expected that\n // rule\n // (b) predict the next nonterminal it expects by adding that\n // nonterminal's start state\n // To prevent duplication, we also keep track of rules we have already\n // added\n\n nextColumn.process();\n\n // If needed, throw an error:\n if (nextColumn.states.length === 0) {\n // No states at all! This is not good.\n var err = new Error(this.reportError(token));\n err.offset = this.current;\n err.token = token;\n throw err;\n }\n\n // maybe save lexer state\n if (this.options.keepHistory) {\n column.lexerState = lexer.save()\n }\n\n this.current++;\n }\n if (column) {\n this.lexerState = lexer.save()\n }\n\n // Incrementally keep track of results\n this.results = this.finish();\n\n // Allow chaining, for whatever it's worth\n return this;\n };\n\n Parser.prototype.reportLexerError = function(lexerError) {\n var tokenDisplay, lexerMessage;\n // Planning to add a token property to moo's thrown error\n // even on erroring tokens to be used in error display below\n var token = lexerError.token;\n if (token) {\n tokenDisplay = \"input \" + JSON.stringify(token.text[0]) + \" (lexer error)\";\n lexerMessage = this.lexer.formatError(token, \"Syntax error\");\n } else {\n tokenDisplay = \"input (lexer error)\";\n lexerMessage = lexerError.message;\n }\n return this.reportErrorCommon(lexerMessage, tokenDisplay);\n };\n\n Parser.prototype.reportError = function(token) {\n var tokenDisplay = (token.type ? token.type + \" token: \" : \"\") + JSON.stringify(token.value !== undefined ? token.value : token);\n var lexerMessage = this.lexer.formatError(token, \"Syntax error\");\n return this.reportErrorCommon(lexerMessage, tokenDisplay);\n };\n\n Parser.prototype.reportErrorCommon = function(lexerMessage, tokenDisplay) {\n var lines = [];\n lines.push(lexerMessage);\n var lastColumnIndex = this.table.length - 2;\n var lastColumn = this.table[lastColumnIndex];\n var expectantStates = lastColumn.states\n .filter(function(state) {\n var nextSymbol = state.rule.symbols[state.dot];\n return nextSymbol && typeof nextSymbol !== \"string\";\n });\n\n if (expectantStates.length === 0) {\n lines.push('Unexpected ' + tokenDisplay + '. I did not expect any more input. Here is the state of my parse table:\\n');\n this.displayStateStack(lastColumn.states, lines);\n } else {\n lines.push('Unexpected ' + tokenDisplay + '. Instead, I was expecting to see one of the following:\\n');\n // Display a \"state stack\" for each expectant state\n // - which shows you how this state came to be, step by step.\n // If there is more than one derivation, we only display the first one.\n var stateStacks = expectantStates\n .map(function(state) {\n return this.buildFirstStateStack(state, []) || [state];\n }, this);\n // Display each state that is expecting a terminal symbol next.\n stateStacks.forEach(function(stateStack) {\n var state = stateStack[0];\n var nextSymbol = state.rule.symbols[state.dot];\n var symbolDisplay = this.getSymbolDisplay(nextSymbol);\n lines.push('A ' + symbolDisplay + ' based on:');\n this.displayStateStack(stateStack, lines);\n }, this);\n }\n lines.push(\"\");\n return lines.join(\"\\n\");\n }\n \n Parser.prototype.displayStateStack = function(stateStack, lines) {\n var lastDisplay;\n var sameDisplayCount = 0;\n for (var j = 0; j < stateStack.length; j++) {\n var state = stateStack[j];\n var display = state.rule.toString(state.dot);\n if (display === lastDisplay) {\n sameDisplayCount++;\n } else {\n if (sameDisplayCount > 0) {\n lines.push(' ^ ' + sameDisplayCount + ' more lines identical to this');\n }\n sameDisplayCount = 0;\n lines.push(' ' + display);\n }\n lastDisplay = display;\n }\n };\n\n Parser.prototype.getSymbolDisplay = function(symbol) {\n return getSymbolLongDisplay(symbol);\n };\n\n /*\n Builds a the first state stack. You can think of a state stack as the call stack\n of the recursive-descent parser which the Nearley parse algorithm simulates.\n A state stack is represented as an array of state objects. Within a\n state stack, the first item of the array will be the starting\n state, with each successive item in the array going further back into history.\n\n This function needs to be given a starting state and an empty array representing\n the visited states, and it returns an single state stack.\n\n */\n Parser.prototype.buildFirstStateStack = function(state, visited) {\n if (visited.indexOf(state) !== -1) {\n // Found cycle, return null\n // to eliminate this path from the results, because\n // we don't know how to display it meaningfully\n return null;\n }\n if (state.wantedBy.length === 0) {\n return [state];\n }\n var prevState = state.wantedBy[0];\n var childVisited = [state].concat(visited);\n var childResult = this.buildFirstStateStack(prevState, childVisited);\n if (childResult === null) {\n return null;\n }\n return [state].concat(childResult);\n };\n\n Parser.prototype.save = function() {\n var column = this.table[this.current];\n column.lexerState = this.lexerState;\n return column;\n };\n\n Parser.prototype.restore = function(column) {\n var index = column.index;\n this.current = index;\n this.table[index] = column;\n this.table.splice(index + 1);\n this.lexerState = column.lexerState;\n\n // Incrementally keep track of results\n this.results = this.finish();\n };\n\n // nb. deprecated: use save/restore instead!\n Parser.prototype.rewind = function(index) {\n if (!this.options.keepHistory) {\n throw new Error('set option `keepHistory` to enable rewinding')\n }\n // nb. recall column (table) indicies fall between token indicies.\n // col 0 -- token 0 -- col 1\n this.restore(this.table[index]);\n };\n\n Parser.prototype.finish = function() {\n // Return the possible parsings\n var considerations = [];\n var start = this.grammar.start;\n var column = this.table[this.table.length - 1]\n column.states.forEach(function (t) {\n if (t.rule.name === start\n && t.dot === t.rule.symbols.length\n && t.reference === 0\n && t.data !== Parser.fail) {\n considerations.push(t);\n }\n });\n return considerations.map(function(c) {return c.data; });\n };\n\n function getSymbolLongDisplay(symbol) {\n var type = typeof symbol;\n if (type === \"string\") {\n return symbol;\n } else if (type === \"object\") {\n if (symbol.literal) {\n return JSON.stringify(symbol.literal);\n } else if (symbol instanceof RegExp) {\n return 'character matching ' + symbol;\n } else if (symbol.type) {\n return symbol.type + ' token';\n } else if (symbol.test) {\n return 'token matching ' + String(symbol.test);\n } else {\n throw new Error('Unknown symbol type: ' + symbol);\n }\n }\n }\n\n function getSymbolShortDisplay(symbol) {\n var type = typeof symbol;\n if (type === \"string\") {\n return symbol;\n } else if (type === \"object\") {\n if (symbol.literal) {\n return JSON.stringify(symbol.literal);\n } else if (symbol instanceof RegExp) {\n return symbol.toString();\n } else if (symbol.type) {\n return '%' + symbol.type;\n } else if (symbol.test) {\n return '<' + String(symbol.test) + '>';\n } else {\n throw new Error('Unknown symbol type: ' + symbol);\n }\n }\n }\n\n return {\n Parser: Parser,\n Grammar: Grammar,\n Rule: Rule,\n };\n\n}));\n","braced[X] -> \"{\" $X \"}\"\nparenthesized[X] -> \"(\" $X \")\"\nbracketed[X] -> \"[\" $X \"]\"\n\nmain -> _ program _ {% ([, program]) => program %}\n\nprogram -> (expression (__ expression):*):? {% ([content]) => {\n if (content === null) return []\n return [content[0], ...content[1].map(([, c]) => c)]\n} %}\n\nexpression -> expression_ {% ([[value]]) => (value) %}\nexpression_ -> identifier | access | string | number | operation | assignment | functionassignment | codeblock | group\n\nidentifier -> [A-Za-z_] [0-9A-Za-z_]:* {% ([first, rest]) => ({ kind: \"identifier\", name: first+rest.join(\"\") }) %}\n\naccess -> \".\" identifier {% ([, { name }]) => ({ kind: \"access\", name }) %}\n\nstring -> \"\\\"\" string_content:* \"\\\"\" {% ([, value]) => ({ kind: \"litteral\", value: { kind: \"string\", value: value.join(\"\") }}) %}\n\nstring_content -> [^\"\\n\\\\] | \"\\\\\" [ntr\"\\\\] {% ([, character]) => {\n switch (character) {\n case \"n\": return \"\\n\"\n case \"t\": return \"\\t\"\n case \"r\": return \"\\r\"\n case \"\\\"\": return \"\\\"\"\n case \"\\\\\": return \"\\\\\"\n }\n} %}\n\nnumber -> (\"0\" | [1-9] [0-9]:*) {% ([[head, body = []]]) => ({\n kind: \"litteral\",\n value: { kind: \"number\", value: +(head + body.join(\"\"))\n}}) %}\n\noperation -> operator __ expression {% ([[operator], , target]) => ({ kind: \"operation\", operator, target }) %}\n\noperator -> \"==\" | \"!=\" | \"<=\" | \">=\" | \"<<\" | \">>\" | [-+*/%<>&^|]\n\nassignment -> \"=\" _ identifier {% ([, , { name }]) => ({ kind: \"assignment\", target: name }) %}\nfunctionassignment -> \":\" _ identifier {% ([, , { name }]) => ({ kind: \"functionassignment\", target: name }) %}\n\ncodeblock -> braced[_ program _] {% ([[, [, program]]]) => ({ kind: \"litteral\", value: { kind: \"codeblock\", value: program }}) %}\n\ngroup -> parenthesized[_ program _] {% ([[, [, program]]])=> ({ kind: \"group\", program }) %}\n\n_ -> [ \\t\\n]:* (comment [ \\t\\n]:*):*\n__ -> [ \\t\\n]:+ (comment [ \\t\\n]:*):* | (comment [ \\t\\n]:*):+\n\ncomment -> \"#\" .:* \"\\n\"\n","import { Reader } from \"./type\"\n\nexport let createStringReader = (text: string): Reader => {\n let index = 0\n return {\n read(count) {\n index += count\n return text.slice(index - count, index)\n },\n }\n}\n","import { default as nearley } from \"nearley\"\n\nimport broccoliGrammar from \"../grammar.ne\"\nimport { createStringReader } from \"./util\"\nimport {\n BroccoliFrame,\n BroccoliRuntime,\n BroccoliTreeExpression,\n BroccoliTreeOperation,\n BroccoliTreeProgram,\n BroccoliValue,\n} from \"./type\"\n\nexport function createBroccoli(programString: string, write: (v: string) => void) {\n let parser = new nearley.Parser(broccoliGrammar)\n parser.feed(programString)\n let program = parser.results[0]\n if (!program) {\n throw \"The program doesn't parse\"\n }\n\n return {\n run(stdinString: string) {\n let runtime: BroccoliRuntime = {\n reader: createStringReader(stdinString),\n write,\n stack: [],\n }\n runProgram(program, runtime, predefinedFrame, true)\n },\n runeval(rt: BroccoliRuntime, frame: BroccoliFrame) {\n runProgram(program, rt, frame, false)\n },\n }\n}\n\nexport function isScalar(value: BroccoliValue) {\n return [\"string\", \"number\", \"boolean\"].includes(value.kind)\n}\n\n/**\n * The predefined frame contains all the soft keywords as well as the value\n * they are associated with.\n */\nexport let predefinedFrame: BroccoliFrame = {\n data: {\n printstack: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n rt.write(\"<\" + JSON.stringify(rt.stack, null, 2) + \">\")\n },\n },\n true: { kind: \"boolean\", value: true },\n false: { kind: \"boolean\", value: false },\n stdin: {\n kind: \"native\",\n value: {\n data: {\n read: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let textArray: string[] = []\n let chunk = rt.reader.read(1000)\n textArray.push(chunk)\n while (chunk.length === 1000) {\n chunk = rt.reader.read(1000)\n textArray.push(chunk)\n }\n rt.stack.push({ kind: \"string\", value: textArray.join(\"\") })\n },\n },\n },\n },\n },\n stdout: {\n kind: \"native\",\n value: {\n data: {\n write: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let entry = rt.stack.pop()!\n if (!isScalar(entry)) {\n throw new TypeError(`Expected a scalar but got a ${entry.kind}`)\n }\n rt.write(entry.value.toString())\n },\n },\n },\n },\n },\n output: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let entry = rt.stack.pop()!\n if (!isScalar(entry)) {\n throw new TypeError(`Expected a scalar but got a ${entry.kind}`)\n }\n rt.write(entry.value.toString() + \"\\n\")\n },\n },\n input: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let valueArray: string[] = []\n let c = rt.reader.read(1)\n while (c !== \"\\n\" && c !== \"\") {\n valueArray.push(c)\n c = rt.reader.read(1)\n }\n rt.stack.push({ kind: \"string\", value: valueArray.join(\"\") })\n },\n },\n number: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let entry = rt.stack.pop()!\n if (!isScalar(entry)) {\n throw new TypeError(`Expected a scalar value but got ${entry.kind}`)\n }\n rt.stack.push({ kind: \"number\", value: +entry.value })\n },\n },\n array: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n rt.stack.push({\n kind: \"array\",\n value: [],\n })\n },\n },\n object: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n rt.stack.push({\n kind: \"object\",\n value: {},\n })\n },\n },\n loop: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let last = rt.stack.pop()!\n if (last.kind !== \"codeblock\") {\n throw TypeError(`Expected a codeblock but got a ${last.kind}`)\n }\n for (let k = 0; k < 1000; k++) {\n runProgram(last.value, rt, frame, false)\n }\n },\n },\n if: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let [ifyes, ifno, testresult] = rt.stack.splice(-3, 3)\n if (\n ifyes.kind !== \"codeblock\" ||\n ifno.kind !== \"codeblock\" ||\n testresult.kind !== \"boolean\"\n ) {\n throw new TypeError(\n `Expected two codeblocks and a boolean but got ${ifyes.kind}, ${ifno.kind} and ${testresult.kind}`,\n )\n }\n runProgram(testresult.value ? ifyes.value : ifno.value, rt, frame, false)\n },\n },\n run: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let codeblock = rt.stack.pop()!\n if (codeblock.kind !== \"codeblock\") {\n throw new TypeError(`Expected a codeblock but got a ${codeblock.kind}`)\n }\n runProgram(codeblock.value, rt, frame, true)\n },\n },\n eval: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let text = rt.stack.pop()!\n if (text.kind !== \"string\") {\n throw new TypeError(`Expected a string but got a ${text.kind}`)\n }\n createBroccoli(text.value, rt.write).runeval(rt, frame)\n },\n },\n while: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let [body, test] = rt.stack.splice(-2, 2)\n if (body.kind !== \"codeblock\" || test.kind !== \"codeblock\") {\n throw new TypeError(\n `Expected two codeblocks but got ${body.kind} and ${test.kind}`,\n )\n }\n let k = 0\n while (\n (runProgram(test.value, rt, frame, false), rt.stack.pop()!.value && k < 1000)\n ) {\n runProgram(body.value, rt, frame, false)\n k += 1\n }\n },\n },\n toJson: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let entry = rt.stack.pop()!\n rt.stack.push({\n kind: \"string\",\n value: JSON.stringify(entry, (k, v) => v.value),\n })\n },\n },\n fromJson: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let body = rt.stack.pop()!\n if (body.kind !== \"string\") {\n throw new TypeError(`fromJson expected a string but it got a ${body.kind}`)\n }\n rt.stack.push(\n JSON.parse(body.value, (k, v) => ({\n kind: Array.isArray(v) ? \"array\" : typeof v,\n value: v,\n })),\n )\n },\n },\n },\n}\n\nexport let arrayMethodMap: BroccoliFrame[\"data\"] = {\n push: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let [value, array] = rt.stack.splice(-2, 2)\n array.value.push(value)\n },\n },\n pop: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let array = rt.stack.pop()!\n rt.stack.push(array.value.pop())\n },\n },\n unshift: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let [value, array] = rt.stack.splice(-2, 2)\n array.value.unshift(value)\n },\n },\n shift: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let array = rt.stack.pop()!\n rt.stack.push(array.value.shift())\n },\n },\n get: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let [index, array] = rt.stack.splice(-2, 2)\n if (index.kind !== \"number\") {\n throw TypeError(`expected a number index, got a ${index.kind}`)\n }\n rt.stack.push(array.value[index.value])\n },\n },\n set: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let [value, index, array] = rt.stack.splice(-3, 3)\n if (index.kind !== \"number\") {\n throw TypeError(`expected a number index, got a ${index.kind}`)\n }\n array.value[index.value] = value\n },\n },\n}\n\nexport let objectMethodMap: BroccoliFrame[\"data\"] = {\n get: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let [key, obj] = rt.stack.splice(-2, 2)\n rt.stack.push(obj.value[key.value])\n },\n },\n set: {\n kind: \"nativefunction\",\n value: (rt, frame) => {\n let [value, key, obj] = rt.stack.splice(-3, 3)\n obj.value[key.value] = value\n },\n },\n}\n\n/**\n * Run the given broccoli code, possibly inside a new frame\n * @param program\n * @param runtime\n * @param frame\n * @param createNewFrame\n */\nfunction runProgram(\n program: BroccoliTreeProgram,\n runtime: BroccoliRuntime,\n frame: BroccoliFrame,\n createNewFrame: boolean,\n) {\n if (createNewFrame) {\n frame = {\n parent: frame,\n data: {},\n }\n }\n program.forEach((expression) => {\n runExpression(expression, runtime, frame)\n })\n}\n\n/**\n * Execute the given expression according to its kind\n *\n * @param expression The expression to run\n * @param runtime The runtime\n * @param frame The current frame\n */\nfunction runExpression(\n expression: BroccoliTreeExpression,\n runtime: BroccoliRuntime,\n frame: BroccoliFrame,\n) {\n let { stack } = runtime\n let entry: BroccoliValue\n let previous: BroccoliValue\n switch (expression.kind) {\n case \"access\":\n previous = stack.pop()!\n if (previous.kind === \"native\") {\n entry = previous.value.data[expression.name]\n } else if (previous.kind === \"array\") {\n entry = arrayMethodMap[expression.name]\n stack.push(previous)\n } else if (previous.kind === \"object\") {\n entry = objectMethodMap[expression.name]\n stack.push(previous)\n } else {\n throw new Error(\"unhandled access case\")\n }\n if (entry === undefined) {\n throw new ReferenceError(`unrecognized identifier ${expression.name}`)\n }\n runEntry(entry, runtime, frame)\n break\n case \"assignment\":\n frame.data[expression.target] = stack.pop()!\n break\n case \"functionassignment\":\n previous = stack.pop()!\n if (previous.kind !== \"codeblock\") {\n throw new TypeError(`Expected a codeblock but got a ${previous.kind}`)\n }\n frame.data[expression.target] = { kind: \"function\", value: previous.value }\n break\n case \"litteral\":\n stack.push(expression.value)\n break\n case \"group\":\n runProgram(expression.program, runtime, frame, true)\n break\n case \"identifier\":\n let { name } = expression\n entry = frameLookup(frame, name)\n runEntry(entry, runtime, frame)\n break\n case \"operation\":\n let operator = operatorMap[expression.operator]\n let left = stack.pop()!\n runExpression(expression.target, runtime, frame)\n let right = stack.pop()!\n stack.push(operator(left, right))\n break\n }\n}\n\n/**\n * runEntry performs the action related to the given entry, be it running a\n * function or just adding it as a value to the stack.\n *\n * @param entry The entry to run\n * @param runtime The runtime context\n * @param frame The current frame\n */\nfunction runEntry(entry: BroccoliValue, runtime: BroccoliRuntime, frame: BroccoliFrame) {\n if (entry.kind === \"function\") {\n runProgram(entry.value, runtime, frame, true)\n } else if (entry.kind === \"nativefunction\") {\n entry.value(runtime, frame)\n } else {\n runtime.stack.push(entry)\n }\n}\n\nfunction frameLookup(initialFrame: BroccoliFrame, name: string): BroccoliValue {\n let frame = initialFrame\n let result = frame.data[name]\n let k = 0\n let recursionLimit = 100\n while (result === undefined && frame.parent && k < recursionLimit) {\n frame = frame.parent\n result = frame.data[name]\n k += 1\n }\n if (result === undefined) {\n if (k >= recursionLimit) {\n throw new Error(\"too much codeblock recursion\")\n } else {\n throw new ReferenceError(`unrecognized identifier ${name}`)\n }\n }\n return result\n}\n\nfunction numericOperator(\n f: (a: number, b: number) => number,\n): (a: BroccoliValue, b: BroccoliValue) => BroccoliValue {\n return (a, b) => {\n if (a.kind !== \"number\" || b.kind !== \"number\") {\n throw new TypeError(`expected number inputs but got ${a.kind} and ${b.kind}`)\n }\n return { kind: \"number\", value: f(a.value, b.value) }\n }\n}\n\nfunction comparisonOperator(\n f: (a: number, b: number) => boolean,\n): (a: BroccoliValue, b: BroccoliValue) => BroccoliValue {\n return (a, b) => {\n if (a.kind !== \"number\" || b.kind !== \"number\") {\n throw new TypeError(\n `expected numbers, got ${a.kind} and ${b.kind} in comparision operator`,\n )\n }\n return { kind: \"boolean\", value: f(a.value, b.value) }\n }\n}\n\nlet operatorMap: Record<\n BroccoliTreeOperation[\"operator\"],\n (a: BroccoliValue, b: BroccoliValue) => BroccoliValue\n> = {\n \"*\": numericOperator((a, b) => a * b),\n \"/\": numericOperator((a, b) => a / b),\n \"%\": numericOperator((a, b) => ((a % b) + b) % b),\n \"+\": (a: BroccoliValue, b: BroccoliValue) => {\n if (![\"string\", \"number\"].includes(a.kind) || ![\"string\", \"number\"].includes(b.kind)) {\n throw new TypeError(\n `got incompatible types ${a.kind} and ${b.kind} in addition operator`,\n )\n }\n let kind: BroccoliValue[\"kind\"] = \"string\"\n if (a.kind === \"number\" && b.kind === \"number\") {\n kind = \"number\"\n }\n return { kind, value: a.value + b.value }\n },\n \"-\": numericOperator((a, b) => a - b),\n \"<<\": numericOperator((a, b) => a << b),\n \">>\": numericOperator((a, b) => a >> b),\n \"&\": numericOperator((a, b) => a & b),\n \"^\": numericOperator((a, b) => a ^ b),\n \"|\": numericOperator((a, b) => a | b),\n \"<\": comparisonOperator((a, b) => a < b),\n \"<=\": comparisonOperator((a, b) => a <= b),\n \">\": comparisonOperator((a, b) => a > b),\n \">=\": comparisonOperator((a, b) => a >= b),\n \"==\": (a: BroccoliValue, b: BroccoliValue) => {\n return { kind: \"boolean\", value: a.kind === b.kind && a.value === b.value }\n },\n \"!=\": (a: BroccoliValue, b: BroccoliValue) => {\n return { kind: \"boolean\", value: a.kind !== b.kind || a.value !== b.value }\n },\n}\n","export function dedent(a: TemplateStringsArray): string {\n let b = a[0].split(\"\\n\")\n if (b[0].length === 0) {\n b.splice(0, 1)\n }\n return b.map((line) => line.trimStart()).join(\"\\n\")\n}\n","import { dedent } from \"./util/dedent\"\n\nexport let exampleObject = {\n \"Hello world\": [`\"Hello World!\" output`, \"\"],\n \"Precedence\": [`3 + 3 * 3 output`, \"\"],\n \"Factorial\": [\n dedent`\n input number = a\n 1 = b\n { a * b = b a - 1 = a }\n { a > 0 }\n while\n\n b output`,\n \"4\",\n ],\n \"Truth machine\": [\n dedent`\n { { 1 stdout .write } { true } while }\n { 0 output }\n input number == 1\n if\n `,\n \"0\",\n ],\n \"Copy input lines on output\": [\n dedent`\n input\n { output input }\n { = a a a }\n while\n `,\n dedent`\n abc\n defg\n hijkl\n `,\n ],\n \"Copy the whole input on output\": [\n dedent`\n stdin .read\n stdout .write\n `,\n dedent`\n abc\n defg\n\n _\n `,\n ],\n \"Run a code block\": [\n dedent`\n { input output } = copy\n copy run\n `,\n dedent`\n content line one\n content line two\n `,\n ],\n \"Create and invoke a function\": [\n dedent`\n { \"Hello world!\" output } : hello\n hello\n `,\n \"\",\n ],\n \"Create and manipulate objects and arrays\": [\n dedent`\n # find all the methods available at:\n # https://github.com/mathieucaroff/broccoli/blob/743cad0168fcd6c32736497278607dc7e088720d/src/broccoli.ts#L236\n array = a\n 0 a .push\n 10 a .push\n 20 a .push\n a toJson output\n\n object = b\n 2 \"foo\" b .set\n 4 \"bar\" b .set\n b toJson output\n `,\n \"\",\n ],\n}\n","{\n \"name\": \"broccoli\",\n \"version\": \"1.0.0\",\n \"license\": \"NTP\",\n \"repository\": {\n \"url\": \"https://github.com/mathieucaroff/broccoli\"\n },\n \"scripts\": {\n \"check\": \"tsc --noEmit\",\n \"checkwatch\": \"tsc --noEmit --watch\",\n \"build\": \"parcel build src/index.html --dist-dir public\",\n \"mcabuild\": \"parcel build src/index.html --public-url broccoli.d\",\n \"serve\": \"parcel src/index.html\"\n },\n \"dependencies\": {\n \"nearley\": \"^2.20.1\"\n },\n \"devDependencies\": {\n \"@parcel/transformer-inline-string\": \"2.3.2\",\n \"@parcel/transformer-yaml\": \"2.3.2\",\n \"@types/nearley\": \"^2.11.2\",\n \"parcel\": \"^2.3.2\",\n \"parcel-transformer-nearley\": \"^1.0.4\",\n \"specimen-test\": \"^0.1.0\",\n \"typescript\": \"^4.6.2\"\n }\n}\n","import { githubCornerHTML } from \"./lib/githubCorner\"\nimport { createBroccoli } from \"./broccoli\"\nimport { exampleObject } from \"./example\"\nimport { repository, version } from \"../package.json\"\n\nlet div = document.createElement(\"div\")\ndiv.innerHTML = githubCornerHTML(repository.url, version)\ndocument.body.appendChild(div)\n\nlet select = document.getElementById(\"exampleSelect\") as HTMLSelectElement\nlet program = document.getElementById(\"program\") as HTMLTextAreaElement\nlet stdin = document.getElementById(\"stdin\") as HTMLTextAreaElement\nlet stderr = document.getElementById(\"stderr\")!\nlet stdout = document.getElementById(\"stdout\")!\n\nObject.keys(exampleObject).forEach((key) => {\n let option = document.createElement(\"option\")\n option.textContent = key\n option.value = key\n select.appendChild(option)\n})\nselect.addEventListener(\"change\", () => {\n ;[program.value, stdin.value] = exampleObject[select.value]\n program.rows = Math.max(program.rows, program.value.split(\"\\n\").length)\n stdin.rows = stdin.value.split(\"\\n\").length\n update()\n})\n\nfunction handleChange() {\n setTimeout(update, 1)\n}\n\nfunction update() {\n if (program.value !== exampleObject[select.value]?.[0]) {\n select.value = \"-\"\n }\n stderr.innerText = \"\"\n try {\n stdout.innerText = \"\"\n createBroccoli(program.value, (v) => (stdout.innerText += v)).run(stdin.value)\n } catch (error) {\n let errorText = \"\" + error\n let errorSet: Set\n if (errorText.startsWith(\"Error: Syntax error at line \")) {\n errorText = errorText.replace(/ based on:(\\n .*)+/g, \"\")\n errorSet = new Set(errorText.split(\"\\n\"))\n errorText = Array.from(errorSet).join(\"\\n\")\n }\n stderr.innerText = errorText\n }\n}\n\nupdate()\n\nprogram.addEventListener(\"input\", handleChange, true)\nstdin.addEventListener(\"input\", handleChange, true)\n","export let githubCornerHTML = (repositoryUrl: string, version: string) => {\n // white on black (classic for light theme)\n return ``\n}\n"],"names":["root","factory","$5105b3b40fcb4a1e$exports","Rule","name","symbols","postprocess","this","id","highestId","State","rule","dot","reference","wantedBy","data","isComplete","length","Column","grammar","index","states","wants","scannable","completed","Grammar","rules","start","byName","forEach","hasOwnProperty","push","StreamLexer","reset","Parser","options","fromCompiled","key","keepHistory","lexer","lexerState","undefined","column","table","predict","process","current","getSymbolShortDisplay","symbol","type","literal","JSON","stringify","RegExp","toString","test","String","Error","prototype","withCursorAt","symbolSequence","map","join","slice","nextState","child","state","left","right","build","children","node","reverse","finish","fail","nextColumn","w","i","complete","exp","nulls","r","s","copy","Lexer","ParserStart","ParserRules","g","buffer","line","lastLineBreak","col","next","ch","value","save","formatError","token","message","lines","split","Math","max","nextLineBreak","indexOf","lastLineDigits","pad","n","Array","feed","chunk","e","err","reportLexerError","offset","text","constructor","expect","isToken","reportError","results","lexerError","tokenDisplay","lexerMessage","reportErrorCommon","lastColumnIndex","lastColumn","expectantStates","filter","nextSymbol","displayStateStack","buildFirstStateStack","stateStack","symbolDisplay","getSymbolDisplay","lastDisplay","sameDisplayCount","j","display","getSymbolLongDisplay","visited","prevState","childVisited","concat","childResult","restore","splice","rewind","considerations","t","c","nearley","program","d","x","content","first","rest","kind","character","head","body","operator","target","$1b70f3a77842b501$exports","window","$9fd44832378de894$export$ac74a19039455e37","read","count","$b96f7a69ad7a27d3$export$128beb349d296c49","programString","write","parser","$parcel$interopDefault","run","stdinString","runtime","reader","stack","$b96f7a69ad7a27d3$var$runProgram","$b96f7a69ad7a27d3$export$f0bb796dc665d20d","runeval","rt","frame","$b96f7a69ad7a27d3$export$8f3495e22775e76c","includes","printstack","true","false","stdin","textArray","stdout","entry","pop","TypeError","output","input","valueArray","number","array","object","loop","last","k","if","ifyes","ifno","testresult","codeblock","eval","while","toJson","v","fromJson","parse","isArray","$b96f7a69ad7a27d3$export$1eab2041c1a732a","unshift","shift","get","set","$b96f7a69ad7a27d3$export$e4a249a929fb81b2","obj","createNewFrame","parent","expression","$b96f7a69ad7a27d3$var$runExpression","previous","ReferenceError","$b96f7a69ad7a27d3$var$runEntry","initialFrame","result","recursionLimit","$b96f7a69ad7a27d3$var$frameLookup","$b96f7a69ad7a27d3$var$operatorMap","$b96f7a69ad7a27d3$var$numericOperator","f","a","b","$b96f7a69ad7a27d3$var$comparisonOperator","$b7811c3c04a63dc4$export$1d81801f981b61e","trimStart","$79a3fbaf3c1dcc13$export$dcf56692ee8d91e5","Precedence","Factorial","$8f13b60c0ee5b277$exports","$ad2bcec7a0192558$var$div","document","createElement","repositoryUrl","version","innerHTML","repository","url","appendChild","$ad2bcec7a0192558$var$select","getElementById","$ad2bcec7a0192558$var$program","$ad2bcec7a0192558$var$stdin","$ad2bcec7a0192558$var$stderr","$ad2bcec7a0192558$var$stdout","$ad2bcec7a0192558$var$handleChange","setTimeout","$ad2bcec7a0192558$var$update","innerText","error","errorSet","errorText","startsWith","replace","Set","from","Object","keys","option","textContent","addEventListener","rows"],"version":3,"file":"index.2461dbc5.js.map"}