{"version":3,"file":"module.js","mappings":"uMACIA,EADAC,ECAAC,EACAC,E,oGCEJ,MAAMC,GAA4BC,EAAAA,EAAAA,OAAK,IAAM,gCAgBhCC,EAAoB,CAC/B,CACEC,GAAI,yDACJC,MAAO,gCACPC,YAAa,6DACbC,UAnBJ,SAA4CC,GAC1C,OACE,kBAACC,EAAAA,SAAQA,CACPC,SACE,kBAACC,EAAAA,WAAUA,CAACC,QAAQ,YAAYC,UAAAA,GAAS,2BAK3C,kBAACZ,EAA8BO,GAGrC,I,4TCTA,MAAMM,GAAMZ,EAAAA,EAAAA,MAAIA,GAAC,YACf,MAAM,cAAEa,SAAwB,yEAExBC,QAASC,SAAwB,yEACjCD,QAASE,SAA0B,+BACnCF,QAASG,SAAsB,8BAQvC,OANAF,IAEIF,YACIK,QAAQC,IAAI,CAACH,IAAmBC,OAGjC,6BACT,KAEMG,GAAYpB,EAAAA,EAAAA,MAAIA,GAAC,YACrB,aAAa,6BACf,KAEaqB,GAAS,IAAIC,EAAAA,WAAgBC,YAAYX,GAAKY,cAAc,CACvErB,MAAO,gBACPsB,KAAM,MACNC,KAAMN,EACNlB,GAAI,kBAGN,IAAK,MAAMyB,KAAcC,EAAAA,GACvBP,EAAOQ,QAAQF,GAGjB,IAAK,MAAMG,KAA0B7B,EACnCoB,EAAOU,gBAAgBD,E,uMCZzB,MAAME,EAAe,yBACf7B,EAAQ,WAAW6B,IACnB5B,EAAc,6BAA6B4B,SAC3CP,EAAO,UAEAQ,EAAkB,CAC7BC,oBAAqB,4CAYVN,EAA2B,CACtC,CACEO,QAASC,EAAAA,sBAAsBC,mBAC/BlC,QACAC,cACAqB,OACAa,KAAMC,IACNC,UAAWC,GAEb,CACEN,QAASC,EAAAA,sBAAsBM,qBAC/BvC,QACAC,cACAqB,OACAa,KAAMC,IACNC,UAAWC,IAIf,SAASE,EAAgBC,GACvB,OAAKA,GACIC,EAAAA,EAGX,CAGO,SAASC,EAAmBF,GACjC,OAAOA,aAAAA,EAAAA,EAAOG,QAAQ,QAAS,KACjC,CAEO,SAASC,EAAqBJ,GACnC,OAAKA,GAKEK,EAAAA,EAAAA,IAA8BH,EAAmBF,IAJ/CC,EAAAA,EAKX,CAUA,SAASJ,EAAqDS,G,IAKzCC,EAoBsCA,EAxBzD,IAAKD,EACH,OAEF,MAAMC,EAAYD,EAAQf,QAAQiB,MAAMC,I,IAAWA,E,MAA4B,UAAX,QAAjBA,EAAAA,EAAOC,kBAAPD,IAAAA,OAAAA,EAAAA,EAAmBE,KAAe,IACrF,IAAKJ,KAAkC,QAApBA,EAAAA,EAAUG,kBAAVH,IAAAA,OAAAA,EAAAA,EAAsBK,KACvC,OAGF,MAAMC,EAAON,EAAUM,MACjB,aAAEC,EAAY,YAAEC,EAAW,OAAEC,EAAM,eAAEC,IAAmBC,EAAAA,EAAAA,IAAoBL,EAAMP,EAASC,GAC3FY,EAAgBL,EAAaN,MAAMY,IAAaC,EAAAA,EAAAA,IAAoBD,EAASE,YAGnF,IAAKH,EACH,OAIF,MACMI,EAAaC,EADGL,EAAcnB,MAAMyB,MAAM,KAAK,IAErD,IAAIC,EAAYP,EAAcQ,MAAQC,EAAAA,GAAe,UAAYT,EAAcQ,IAE/Eb,EAAae,MAAMC,GAAOA,EAAEH,MAAQD,GAAa,EAAI,IAErD,IAAIK,EAASC,EAAgBC,EAAcC,aAAkC,QAApB3B,EAAAA,EAAUG,kBAAVH,IAAAA,OAAAA,EAAAA,EAAsBK,IAAK,IAAIuB,iBACxFJ,EAASC,EAAgBC,EAAcG,cAAe9B,EAAQ+B,UAAUC,KAAKC,UAAUC,WAAYT,GACnGA,EAASC,EAAgBC,EAAcQ,YAAanC,EAAQ+B,UAAUK,GAAGH,UAAUC,WAAYT,GAE/F,IAAK,MAAMY,KAAe7B,EAAc,CAEtC,GAAI6B,EAAYhC,OAASiC,EAAAA,EAAUC,QACjC,SAGF,MAAMC,EAA6B,GAAGH,EAAYhB,OAAOgB,EAAYrB,YAAYyB,EAC/E3C,EAAqBuC,EAAY3C,WAC9B+C,EAAoB7C,EAAmByC,EAAY3C,UAExD+B,EAASiB,EAAmBf,EAAcgB,OAAQH,EAA4Bf,EAChF,CAEA,GAAIhB,EACF,IAAK,MAAMmC,KAAcnC,EACvBgB,EAASiB,EACPf,EAAckB,YACd,GAAGD,EAAWvB,OAAOoB,EAAoBG,EAAW5B,aAAayB,EAC/DhD,EAAgBmD,EAAWlD,UAE7B+B,GAIN,GAAIf,aAAAA,EAAAA,EAAQoC,OACV,IAAK,MAAMC,KAASrC,EAClB,GAAIqC,EAAM1C,OAASiC,EAAAA,EAAUU,mBAEzBvB,EADEsB,EAAM1B,MAAQ4B,EAAAA,GACPP,EACPf,EAAcuB,OACd,GAAGH,EAAM1B,OAAO0B,EAAM/B,YAAYyB,EAAoBhD,EAAgBsD,EAAMrD,UAC5E+B,GAGOiB,EACPf,EAAcwB,SACd,GAAGJ,EAAM1B,OAAO0B,EAAM/B,YAAYyB,EAChC3C,EAAqBiD,EAAMrD,WACxB+C,EAAoB7C,EAAmBmD,EAAMrD,UAClD+B,OAGC,CACL,MAAM2B,EAA8B,CAClC1D,MAAOqD,EAAMrD,MACb2D,OAAQN,EAAMM,QAGVC,EAAuB,GAAGP,EAAM1B,OAAO0B,EAAM/B,YAAYyB,EAC7D3C,EAAqByD,KAAKC,UAAUJ,QAtFJ1D,EAuFH0D,EAAW1D,MAtF3CA,EAIE+C,EAAoB7C,EAAmBF,IAHrCC,EAAAA,KAuFH8B,EAASiB,EAAmBf,EAAc8B,OAAQH,EAAsB7B,EAC1E,CA1FC,IAAmC/B,EA6FxC,GAAIiB,aAAAA,EAAAA,EAAgBmC,OAAQ,CAC1B,MAAMY,EAA6B,GAEnC,IAAK,MAAMX,KAASpC,EAClB+C,EAASC,KAAK,CACZtD,KAAM0C,EAAM/B,WAAa4C,EAAAA,GAAgBC,MAAQ,UAAY,UAC7DC,QAASrE,EAAgBsD,EAAMrD,SAInC,IAAIqE,GAAiBC,EAAAA,EAAAA,GAAqBN,GAE1CjC,EAASiB,EAAmBf,EAAcsC,SAAUV,KAAKC,UAAUE,GAAWjC,GAC9EA,EAASiB,EAAmBf,EAAcuC,iBAAkBH,EAAgBtC,EAC9E,CAEA,MAAO,CACLrC,KAAMC,EAAa,YAAY+B,KAAaH,SAAmBQ,GAEnE,CAEO,SAASpC,EAAaD,EAAO,WAAY+E,GAC9C,MAAO,MAAMC,EAAAA,KAAgBhF,IAAO+E,EAAY,IAAIA,EAAUjC,aAAe,IAC/E,CAEO,MAAMP,EAAgB,CAC3BC,aAAc,OAAOyC,EAAAA,KACrBvC,cAAe,OACfK,YAAa,KACbQ,OAAQ,OAAO2B,EAAAA,KACfb,OAAQ,OAAOc,EAAAA,KACfpB,SAAU,OAAOqB,EAAAA,KACjBtB,OAAQ,OAAOuB,EAAAA,KACf5B,YAAa,OAAO6B,EAAAA,KACpBT,SAAUU,EAAAA,GACVT,iBAAkB,OAAOS,EAAAA,MAIpB,SAASjD,EAAgBL,EAAuB3B,EAAekF,G,IAC3BA,EAAzC,MAAMC,EAAe,IAAIhD,gBAAsC,QAAtB+C,EAAAA,aAAAA,EAAAA,EAAc1C,kBAAd0C,IAAAA,EAAAA,EAA4BE,SAASC,QAG9E,OAFAF,EAAaG,IAAI3D,EAAK3B,GAEfmF,CACT,CAEO,SAASnC,EACdrB,EACA3B,EACAkF,G,IAEyCA,EAAzC,MAAMC,EAAe,IAAIhD,gBAAsC,QAAtB+C,EAAAA,aAAAA,EAAAA,EAAc1C,kBAAd0C,IAAAA,EAAAA,EAA4BE,SAASC,QAG9E,OAFAF,EAAaI,OAAO5D,EAAK3B,GAElBmF,CACT,CAEO,SAAS3D,EAAagE,GAC3B,OACEC,EAAAA,EAAAA,IAAgCD,GAE7BrF,QAAQ,MAAO,KACfA,QAAQ,MAAO,IAEtB,CAqBO,SAAS4C,EAAoB/C,GAClC,OAnBF,SAAkCA,GAChC,OAAIA,QACK,GAIF,KAAK0F,OAAOvF,SAASH,EAAO,UACrC,CAYS2F,CAVF,SAAiC3F,GACtC,OAAIA,QACK,GAIO,MAAM0F,OAAOvF,SAASH,EAAO,UAC/C,CAGkC4F,CAAwB5F,GAC1D,C,kCCzQO,eAAK4C,G,2DAAAA,C,CAAL,C,2MCKA,eAAKiD,G,0EAAAA,C,CAAL,C,IAOA,WAAKC,G,+CAAAA,C,CAAL,C,IAMA,MAAMC,E,sUAAW,IAAKF,EAAkBC,GA4BxC,eAAKE,G,2EAAAA,C,CAAL,C,IAOA,WAAK9B,G,yCAAAA,C,CAAL,C,IAKA,WAAK+B,G,2EAAAA,C,CAAL,C,ugBCrDP,MAAMC,EAAiB,CACrBC,IAAKzB,EAAAA,GACL0B,Q,SAGWC,EAAS,CACpBC,KAAM,CAACC,EAAajG,KAClB,MAAMkG,EAAM,KAAKN,EAAmB5F,GACpCmG,QAAQC,IAAIH,EAAKC,GACjBG,EAAgBJ,EAAKC,EAAI,EAE3BI,KAAM,CAACL,EAAajG,KAClB,MAAMkG,EAAM,KAAKN,EAAmB5F,GACpCmG,QAAQG,KAAKL,EAAKC,GAClBK,EAAgBN,EAAKC,EAAI,EAE3BM,MAAO,CAACC,EAAsBzG,KAC5B,MAAMkG,EAAM,KAAKN,EAAmB5F,GACpCmG,QAAQK,MAAMC,EAAKP,GACnBQ,EAAeD,EAAKP,EAAI,GAItBG,EAAkB,CAACJ,EAAajG,KACpC,KACE2G,EAAAA,EAAAA,SAAQV,EAAKjG,EACf,CAAE,MAAO4G,GACPT,QAAQG,KAAK,4BACf,GAGIC,EAAkB,CAACN,EAAajG,KACpC,KACE6G,EAAAA,EAAAA,YAAWZ,EAAKjG,EAClB,CAAE,MAAO4G,GACPT,QAAQG,KAAK,8BAA+B,CAAEL,MAAKjG,WACrD,GAgCI0G,EAAiB,CAACD,EAAmCK,KACzD,IAAI9G,EAAU8G,EACd,KA3BF,SAAmCL,EAA2BzG,GAC5D,GAAmB,iBAARyG,GAA4B,OAARA,KACzBM,EAAAA,EAAAA,IAASN,IACXO,OAAOC,KAAKR,GAAKS,SAAS7F,IACxB,MAAM3B,EAAQ+G,EAAIpF,GACG,iBAAV3B,GAAuC,kBAAVA,GAAwC,iBAAVA,IACpEM,EAAQqB,GAAO3B,EAAMwC,WACvB,IAIAiF,EAAQV,IACV,GAAwB,iBAAbA,EAAIW,MAAkC,OAAbX,EAAIW,KACtC,IACEpH,EAAQoH,KAAO7D,KAAKC,UAAUiD,EAAIW,KACpC,CAAE,MAAOR,GAET,KAC6B,iBAAbH,EAAIW,MAAyC,kBAAbX,EAAIW,MAA0C,iBAAbX,EAAIW,OACrFpH,EAAQoH,KAAOX,EAAIW,KAAKlF,WAIhC,CAKImF,CAA0BZ,EAAKzG,GAE3ByG,aAAea,OACjBC,EAAAA,EAAAA,UAASd,EAAKzG,GACU,iBAARyG,GAChBc,EAAAA,EAAAA,UAAS,IAAID,MAAMb,GAAMzG,GAChByG,GAAsB,iBAARA,EACnBzG,EAAQiG,KACVsB,EAAAA,EAAAA,UAAS,IAAID,MAAMtH,EAAQiG,KAAMjG,IAEjCuH,EAAAA,EAAAA,UAAS,IAAID,MAAM,gBAAiBtH,IAGtCuH,EAAAA,EAAAA,UAAS,IAAID,MAAM,iBAAkBtH,EAEzC,CAAE,MAAO4G,GACPT,QAAQK,MAAM,4BAA6B,CAAEC,MAAKzG,WACpD,GAGImH,EAAWzH,GACR,SAAUA,C,wNCnDZ,MAAM8H,EAaX,eAAOC,CAASC,GACd,OAAO,IAAIF,EAAaE,EAAK1F,KAAM0F,EAAKtF,GAAIsF,EAAMA,EAAKrH,KACzD,CAEAsH,QAAAA,CAASC,GACP,OAAOC,KAAK7F,MAAQ4F,EAAS5F,MAAQ6F,KAAKzF,IAAMwF,EAASxF,EAC3D,CAEA0F,aAAAA,CAAcC,GACZ,OAAOA,EAAMC,UAAUH,KAAK7F,KAAM6F,KAAKzF,GACzC,CAjBA6F,WAAAA,CAAYjG,EAAcI,EAAY8F,EAAyB7H,GAL/D2B,EAAAA,KAAAA,YAAAA,GACAI,EAAAA,KAAAA,UAAAA,GACA/B,EAAAA,KAAAA,YAAAA,GACA6H,EAAAA,KAAAA,kBAAAA,GAGEL,KAAK7F,KAAOA,EACZ6F,KAAKzF,GAAKA,EACVyF,KAAKxH,KAAOA,EACZwH,KAAKK,WAAaA,CACpB,EAeK,SAASC,EAAkBJ,EAAeK,GAC/C,MAAMC,EAAsB,GAS5B,OARmBhF,EAAAA,GAAOiF,MAAMP,GAC3BQ,QAAQ,CACXC,MAAQd,UACYe,IAAdL,GAA2BA,EAAUM,SAAShB,EAAKrH,KAAKrD,MAC1DqL,EAAM1E,KAAK+D,EAAKA,KAClB,IAGGW,CACT,CAEA,SAASM,EAA4BjB,EAAkBrH,GACrD,GAAIqH,EAAKrH,KAAKrD,KAAOqD,EACnB,MAAO,CAACmH,EAAaC,SAASC,IAGhC,MAAMkB,EAA4B,GAClC,IAAIC,EAAM,EACNC,EAAQpB,EAAKqB,WAAWF,GAC5B,KAAOC,GACLF,EAAUjF,QAAQgF,EAA4BG,EAAOzI,IACrDwI,EAAMC,EAAM1G,GACZ0G,EAAQpB,EAAKqB,WAAWF,GAE1B,OAAOD,CACT,CAgCA,SAASI,EACPC,EACAC,EACAzI,EACA0I,EACAnI,GAEA,MAAMoI,EAAkBpI,IAAa0E,EAAAA,GAAa2D,OAASrI,IAAa0E,EAAAA,GAAa4D,cAC/EC,EAAoBN,EAAgBP,SAAS,SAAWU,EAI9D,GAAoB,MAAhBF,GAAuBE,EAAiB,CAC1C,MAAMI,EAAsB,IAAIC,OAAO,OAAQ,KAC/CR,EAAkBA,EAAgBpJ,QAAQ2J,EAAqB,KACjE,MAAO,GAAoB,MAAhBN,EAAqB,CAC9B,MAAMQ,EAA2B,IAAID,OAAO,SAAU,KACtDR,EAAkBA,EAAgBpJ,QAAQ6J,EAA0B,KAEpE,MAAMF,EAAsB,IAAIC,OAAO,OAAQ,KAC/CR,EAAkBA,EAAgBpJ,QAAQ2J,EAAqB,KACjE,CAeA,OAbID,IAEFN,EAAkBA,EAAgBpJ,QAAQ,OAAQ,KAGpDY,EAAYkD,KAAK,CACftC,IAAKkI,EACD5D,EAAAA,GAAwBgE,gBAAgBzH,WACxCyD,EAAAA,GAAwBiE,cAAc1H,WAAa,IAAMiH,EAAMjH,WACnElB,SAAUA,EACVtB,MAAOuJ,IAGFA,CACT,CAEA,SAASY,EAAoBZ,EAAyBtI,EAAqCK,GACzF,MAAM0I,EAA2B,IAAID,OAAO,MAAO,KACnDR,EAAkBA,EAAgBpJ,QAAQ6J,EAA0B,KACpE/I,EAAegD,KAAK,CAClB3C,WACAtB,MAAOuJ,GAEX,CAoDA,SAASa,EAAwBC,GAC/B,OAAIpB,EAA4BoB,EAASC,EAAAA,IAAKlH,OACrCmH,EAAAA,GAAeC,IACbvB,EAA4BoB,EAASI,EAAAA,IAAKrH,OAC5CmH,EAAAA,GAAeG,GACbzB,EAA4BoB,EAASM,EAAAA,IAAKvH,OAC5CmH,EAAAA,GAAeK,IACb3B,EAA4BoB,EAASQ,EAAAA,IAAKzH,OAC5CmH,EAAAA,GAAeO,QAGxBrE,QAAQG,KAAK,2BAGf,CAEA,SAASmE,EAAuBV,GAC9B,OAAIpB,EAA4BoB,EAASW,EAAAA,IAAI5H,OACpCmH,EAAAA,GAAeU,MACbhC,EAA4BoB,EAASa,EAAAA,IAAK9H,OAC5CmH,EAAAA,GAAeY,SACblC,EAA4BoB,EAASe,EAAAA,IAAIhI,OAC3CmH,EAAAA,GAAec,WACbpC,EAA4BoB,EAASiB,EAAAA,IAAKlI,OAC5CmH,EAAAA,GAAegB,mBADjB,CAKT,CAsFO,SAASrK,EACdmH,EACA/H,EACAC,GAOA,MAAMiL,EAA+B,GAC/BzK,EAAgC,GAChCE,EAAsC,GACtCD,EAAwB,GACxBI,EAAWqH,EAAkBJ,EAAO,CAACoD,EAAAA,KAE3C,OAAwB,IAApBrK,EAASgC,OACJ,CAAEtC,aAAc0K,IAnQ3B,SAA2BnD,EAAemD,GAExC,MAAME,EAAajD,EAAkBJ,EAAO,CAACsD,EAAAA,KAC7C,IAAK,MAAMtB,KAAWqB,EAAY,C,IAGCE,EAA2BC,EAF5D,MAAMD,EAAqB3C,EAA4BoB,EAASyB,EAAAA,IAC1DD,EAAgB5C,EAA4BoB,EAAS0B,EAAAA,IACrDzK,EAAW+G,EAAMC,UAA+B,QAArBsD,EAAAA,EAAmB,UAAnBA,IAAAA,OAAAA,EAAAA,EAAuBlJ,GAAoB,QAAhBmJ,EAAAA,EAAc,UAAdA,IAAAA,OAAAA,EAAAA,EAAkBvJ,MACxEX,EAAMiK,EAAmB,GAAGxD,cAAcC,GAC1CrI,EAAQ6L,EAAcG,KAAK9D,GAAaG,EAAMC,UAAUJ,EAAS5F,KAAO,EAAG4F,EAASxF,GAAK,KAAI,GAGhGf,GACA3B,IACAsB,IAAaiJ,EAAAA,GAAeY,UAC3B7J,IAAaiJ,EAAAA,GAAeU,OAC5B3J,IAAaiJ,EAAAA,GAAec,YAC5B/J,IAAaiJ,EAAAA,GAAegB,gBAKhCC,EAAOvH,KAAK,CACVtC,MACAL,WACAtB,QACAW,KAAMiC,EAAAA,EAAUC,SAEpB,CACF,CA6OEoJ,CAFsBhD,EAA4B7H,EAAS,GAAIqK,EAAAA,IAAU,GAAGrD,cAAcC,GAEzDmD,GA3LnC,SAA0BnD,EAAetH,EAA+BE,GACtE,MAAMiL,EAAiBzD,EAAkBJ,EAAO,CAAC8D,EAAAA,KACjD,IAAK,MAAO1C,EAAOY,KAAY6B,EAAeE,UAAW,CACvD,MAAMC,EAAQpD,EAA4BoB,EAASiC,EAAAA,IAC7CC,EAAatD,EAA4BoB,EAASmC,EAAAA,IAClDC,EAAWxD,EAA4BoB,EAASa,EAAAA,IAChDwB,EAAiBzD,EAA4BoB,EAASiB,EAAAA,IACtDqB,EAAiB1D,EAA4BoB,EAASuC,EAAAA,IACtDC,EAAiB5D,EAA4BoB,EAASyC,EAAAA,IAEtDC,EAAuBC,EAAyB3C,GAEtD,IAAK,MAAM4C,KAAuBF,EAAsB,CACtD,MAAMvD,EAAcnB,EAAMC,WAAU2E,aAAAA,EAAAA,EAAqB3K,MAAO,EAAG2K,aAAAA,EAAAA,EAAqB3K,MAGxF,IAAIiH,EAAkBlB,EAAMC,WAAU2E,aAAAA,EAAAA,EAAqB3K,MAAO,GAAG2K,aAAAA,EAAAA,EAAqBvK,IAAK,GAE/F,GAAI6G,EAAgBnG,OAAQ,CAC1B,IAAI9B,EACJ,GAAI+K,EAAMjJ,OACR9B,EAAW0E,EAAAA,GAAa7B,WACnB,GAAIsI,EAASrJ,OAClB9B,EAAW0E,EAAAA,GAAakH,mBACnB,GAAIR,EAAetJ,OACxB9B,EAAW0E,EAAAA,GAAa4D,mBACnB,GAAI2C,EAAWnJ,OACpB9B,EAAW0E,EAAAA,GAAa2D,WACnB,GAAIgD,EAAevJ,OACxB9B,EAAW4C,EAAAA,GAAgBC,UACtB,KAAI0I,EAAezJ,OAEnB,CACLqD,QAAQG,KAAK,sBAAuB,CAClCyB,MAAOA,EAAMC,UAAU+B,EAAQ/H,KAAM+H,EAAQ3H,MAG/C,QACF,CAPEpB,EAAW4C,EAAAA,GAAgBgJ,aAO7B,CAEM5L,IAAa4C,EAAAA,GAAgBC,OAAS7C,IAAa4C,EAAAA,GAAgBgJ,cACvE5D,EAAuBC,EAAiBC,EAAazI,EAAa0I,EAAOnI,GAEzE6I,EAAoBZ,EAAiBtI,EAAgBK,EAEzD,CACF,CACF,CACF,CA4IE6L,CAAiB9E,EAAOtH,EAAaE,GA5GvC,SAAqBoH,EAAerH,EAAuBV,EAAsCC,G,IAC7ED,EAAlB,MAAM8M,EAAwB,QAAZ9M,EAAAA,EAAQoH,YAARpH,IAAAA,OAAAA,EAAAA,EAAc+M,OAAO7M,MAAM8M,GAAUA,EAAMC,QAAUhN,EAAUgN,QAE3EC,EAAY/E,EAAkBJ,EAAO,CAACoF,EAAAA,KAC5C,IAAK,MAAMpD,KAAWmD,EAAW,C,IAsBbE,EArBlB,MACMC,EADW7F,EAAaC,SAASsC,GACXjC,cAAcC,GAI1C,GAHqBgC,EAAQuD,SAASH,EAAAA,IAIpC,SAIF,GAAmC,cAA/BE,EAAWrF,UAAU,EAAG,GAC1B,SAKF,MAAMuF,EAAepF,EAAkBJ,EAAMC,UAAU,EAAG+B,EAAQrC,KAAKtF,IAAK,CAACoL,EAAAA,KACvEC,EAAatF,EAAkBJ,EAAMC,UAAU,EAAG+B,EAAQrC,KAAKtF,IAAK,CAACsL,EAAAA,KAIrEC,EAA4B,QAAhBP,EADIzE,EAA4BoB,EAASyB,EAAAA,IAC3B,UAAd4B,IAAAA,OAAAA,EAAAA,EAAkBtF,cAAcC,GAG5C6F,EAAmBjF,EAA4BoB,EAAS0B,EAAAA,IACxDoC,EAAmBlF,EAA4BoB,EAAS+D,EAAAA,IACxDC,EAAkBpF,EAA4BoB,EAASiE,EAAAA,IACvDC,EAAqBtF,EAA4BoB,EAASmE,EAAAA,IAEhE,IAAI9K,EAAoBpC,EAmBpBmN,EAlBJ,GAAIP,EAAiB9K,OACnB9B,EAAWyJ,EAAuBV,GAElC3G,EAAa2E,EAAMC,UAAU4F,EAAiB,GAAG5L,KAAO,EAAG4L,EAAiB,GAAGxL,GAAK,QAC/E,GAAIyL,EAAiB/K,OAC1BM,EAAayK,EAAiB,GAAG/F,cAAcC,GAC/C/G,EAAW8I,EAAwBC,QAC9B,GAAIkE,EAAmBnL,OAC5B9B,EAAW8I,EAAwBC,GACnC3G,EAAa6K,EAAmB,GAAGnG,cAAcC,OAC5C,KAAIgG,EAAgBjL,OAIzB,SAHA9B,EAAW8I,EAAwBC,GACnC3G,EAAa2K,EAAgB,GAAGjG,cAAcC,EAGhD,C,IAOcqG,EAGd,GANItB,IAGFqB,EAA6CrB,QAAjCsB,GAAAA,EAAAA,EAAAA,GAAsBT,EAAWb,UAAjCsB,IAAAA,EAAAA,OAA+C3F,GAGzDzH,EAAU,CACZ,IAAIqC,EACAkK,EAAazK,QAAU2K,EAAW3K,OACpCO,EAAS,QACAkK,EAAazK,OACtBO,EAAS,SACAoK,EAAW3K,OACpBO,EAAS,OAGT8K,EAAY7L,EAAAA,EAAUU,mBAGxBtC,EAAOiD,KAAK,CACVtC,IAAKsM,EACL3M,SAAUA,EACVX,KAAM8N,QAAAA,EAAa7L,EAAAA,EAAU+L,OAC7BhL,SACA3D,MAAO0D,GAEX,CACF,CACF,CA2BEkL,CAAYvG,EAAOrH,EAAQV,EAASC,GAE7B,CAAEO,aAAc0K,EAAQzK,cAAaC,SAAQC,kBACtD,CAqBO,MAAM4N,EAAU,EAChB,SAASC,EAAazG,GAC3B,OAA2C,IArBtC,SAAyBA,EAAe0G,GAC7C,IAAIC,GAAkB,EAUtB,OATarL,EAAAA,GAAOiF,MAAMP,GACrBQ,QAAQ,CACXC,MAAO,EAAGnI,WACR,GAAIA,EAAKrD,KAAOyR,EAEd,OADAC,GAAkB,GACX,CACT,IAGGA,CACT,CASSA,CAAgB3G,EAAOwG,EAChC,CAEA,SAAS7B,EAAyBxB,GAChC,MAAM7C,EAAsB,GAC5B,IAAIX,EAA0BwD,EAC9B,EAAG,CACD,MAAMyD,EAASjH,EAAK4F,SAAS7B,EAAAA,IACzBkD,IAAWjH,EAAK4F,SAAS7H,EAAAA,KAC3B4C,EAAM1E,KAAKgL,GAEbjH,EAAOA,EAAK4F,SAASsB,EAAAA,GACvB,OAAiB,MAARlH,GAET,OAAOW,CACT,C,uDCpZO,WAAKwG,G,+DAAAA,C,CAAL,C,IA6BA,SAAST,EAAsBU,EAAkB9B,EAAkB7D,EAAQ,G,IAC9D6D,EAAlB,MAAM+B,EAAwD,QAA5C/B,EAAAA,EAAMtM,OAAOR,MAAM6C,GAAyB,eAAfA,EAAMiM,cAAnChC,IAAAA,OAAAA,EAAAA,EAA2DiC,OAAO9F,GACpF,IAAK4F,EACH,OAAO,KAET,OAAQA,EAAUD,IAChB,IAAK,IACH,OAAOxM,EAAAA,EAAUC,QACnB,IAAK,IACH,OAAOD,EAAAA,EAAUU,mBACnB,IAAK,IACH,OAAOV,EAAAA,EAAU+L,OACnB,QACE,OAAO,KAEb,C,4IC5CA,MAAMa,EAASC,GAAyC,iBAANA,GAAwB,OAANA,EAEpE,SAASC,EAA+BhI,EAAciI,GACpD,OAAOA,KAAQjI,CACjB,CAEA,MAAMkI,EAAYC,GAA6B,iBAANA,GAAkBA,GAAM,GAEpDxI,EAAYyI,GAAgE,iBAARA,EAE1E,SAASC,EAAiBjO,GAC/B,IAAIkO,EAAoB,GACxB,GAAIC,MAAMC,QAAQpO,GAChB,IAAK,IAAIqO,EAAI,EAAGA,EAAIrO,EAAEsB,OAAQ+M,IAC5BH,EAAQ/L,KAAK2L,EAAS9N,EAAEqO,KAG5B,OAAOH,CACT,CAEO,SAASI,EAAuBX,GACrC,MAAMY,EAAWb,EAAMC,IAAMC,EAAQD,EAAG,QAAUC,EAAQD,EAAG,OAASA,EAEtE,GAAIY,EAAU,CACZ,MAAMC,EAA8B,iBAAjBD,EAASC,KAAoBD,EAASC,IACnDhT,EAA4B,iBAAhB+S,EAAS/S,IAAmB+S,EAAS/S,GACvD,IAAW,IAAPA,IAAwB,IAARgT,EAClB,MAAO,CAAEA,MAAKhT,KAElB,CAEA,OAAO,CACT,CAEO,SAASiT,EAA4Bd,GAC1C,MAAoB,iBAANA,IAAyB,SAANA,GAAsB,UAANA,IAAkBA,CACrE,CACO,SAASe,EAAoBf,GAClC,MAAiB,iBAANA,GAAkBA,IAAMgB,EAAAA,cAAcC,UAAUlO,WAClDiO,EAAAA,cAAcC,UAGN,iBAANjB,GAAkBA,IAAMgB,EAAAA,cAAcE,WAAWnO,YACnDiO,EAAAA,cAAcE,UAIzB,CAEO,SAASC,EAAiBnB,GAC/B,MAAMY,EAAWb,EAAMC,IAAMC,EAAQD,EAAG,UAAYC,EAAQD,EAAG,WAAaA,EAE5E,GAAIY,EAAU,CACZ,MAAM1M,EACuB,iBAApB0M,EAAS1M,SACK,WAApB0M,EAAS1M,QACY,SAApB0M,EAAS1M,QACW,UAApB0M,EAAS1M,QACW,uBAApB0M,EAAS1M,SACX0M,EAAS1M,OACL3D,EAAkC,iBAAnBqQ,EAASrQ,OAAsBqQ,EAASrQ,MAE7D,IAAe,IAAX2D,IAA8B,IAAV3D,EACtB,MAAO,CAAE2D,SAAQ3D,QAErB,CAEA,OAAO,CACT,CAEO,SAAS6Q,EAAyBpB,GACvC,MAAMY,EAAWb,EAAMC,IAAMpI,EAASoI,IAAMA,EAE5C,GAAIY,EAAU,CACZ,MAAM9I,EAAOD,OAAOC,KAAK8I,GACnBS,EAAuC,CAAC,EAC9C,IAAK,IAAIX,EAAI,EAAGA,EAAI5I,EAAKnE,OAAQ+M,IAAK,CACpC,MAAMxO,EAAM4F,EAAK4I,GACXnQ,EAAQqQ,EAAS9I,EAAK4I,IACP,iBAAVnQ,IACT8Q,EAAanP,GAAO3B,EAExB,CAEA,OAAO8Q,CACT,CAEA,OAAO,CACT,CAEO,SAASC,EAAgBC,GAC9B,MAAMC,EAAQzB,EAAMwB,IAAiBtB,EAAQsB,EAAc,OAAStB,EAAQsB,EAAc,SAAWA,EACrG,GAAIC,EAAO,CACT,MAAMvO,EAAKkN,EAASqB,EAAMvO,IACpBJ,EAAOsN,EAASqB,EAAM3O,MAC5B,GAAII,GAAMJ,EACR,MAAO,CAAEI,KAAIJ,OAEjB,CAGF,CAEO,SAAS4O,EAAqBC,GACnC,OAAQA,GACN,KAAKtL,EAAAA,GAAcoF,MACnB,KAAKpF,EAAAA,GAAcsF,SACnB,KAAKtF,EAAAA,GAAcwF,WACnB,KAAKxF,EAAAA,GAAc0F,cACnB,KAAKzF,EAAAA,GAAgBgF,GACrB,KAAKhF,EAAAA,GAAgB8E,IACrB,KAAK9E,EAAAA,GAAgB4E,GACrB,KAAK5E,EAAAA,GAAgB0E,IACnB,OAAO2G,EACT,QACE,MAAM,IAAIC,EAAe,wBAE/B,CAEO,MAAMA,UAAuBxJ,O,sFC1H7B,MAAMvG,EAAuB8P,GAC3BA,IAAOpL,EAAAA,GAASkF,OAASkG,IAAOpL,EAAAA,GAASsF,WAErCgG,EAAuBF,GAC3BA,IAAOpL,EAAAA,GAASoF,UAAYgG,IAAOpL,EAAAA,GAASwF,cAExC+F,EAAmBH,GACvBA,IAAOpL,EAAAA,GAASsF,YAAc8F,IAAOpL,EAAAA,GAASwF,cAE1CgG,EAAqBJ,GACzBK,EAAAA,GAAqBxI,SAASmI,E,+FCVhC,SAASM,EAAuBN,GACrC,GAAIA,IAAOpL,EAAAA,GAASoF,SAClB,MAAO,YAET,GAAIgG,IAAOpL,EAAAA,GAASwF,cAClB,MAAO,uBAET,GAAI4F,IAAOpL,EAAAA,GAASkF,MAClB,MAAO,SAET,GAAIkG,IAAOpL,EAAAA,GAASsF,WAClB,MAAO,gBAET,GAAI8F,IAAOpL,EAAAA,GAAS2E,GAClB,MAAO,YAET,GAAIyG,IAAOpL,EAAAA,GAAS+E,GAClB,MAAO,eAET,GAAIqG,IAAOpL,EAAAA,GAAS6E,IAClB,MAAO,2BAET,GAAIuG,IAAOpL,EAAAA,GAASyE,IAClB,MAAO,wBAGT,MAAM1D,EAAQ,IAAIc,MAAM,qBAExB,MADAvB,EAAAA,EAAOS,MAAMA,EAAO,CAAEP,IAAK,mBAAoBjF,SAAU6P,IACnDrK,CACR,CC5BO,MAAM4K,EAAY,CAAC3L,EAAAA,GAASkF,MAAOlF,EAAAA,GAASoF,SAAUpF,EAAAA,GAASsF,WAAYtF,EAAAA,GAASwF,eAAeS,KAExG,CAAChM,EAAOyJ,EAAOkI,KACR,CACLnU,YAAaiU,EAAuBzR,GACpC4R,MAAO5R,EACPA,YAIS6R,EAAmB,CAAC9L,EAAAA,GAASkF,MAAOlF,EAAAA,GAASsF,YAAYW,KAA8BhM,IAAW,CAC7GxC,YAAaiU,EAAuBzR,GACpC4R,MAAO5R,EACPA,YAGWwR,EAAuB,CAACzL,EAAAA,GAAS+E,GAAI/E,EAAAA,GAAS6E,IAAK7E,EAAAA,GAAS2E,GAAI3E,EAAAA,GAASyE,KAEzEsH,EAAmBN,EAAqBxF,KAA8BhM,IAAW,CAC5FxC,YAAaiU,EAAuBzR,GACpC4R,MAAO5R,EACPA,YAGW+R,EAAyC,CACpD,CAAEH,MAAO,QAAS5R,MAAOgG,EAAAA,GAAa7B,OACtC,CAAEyN,MAAO,gBAAiB5R,MAAOgG,EAAAA,GAAakH,eAC9C,CAAE0E,MAAO,QAAS5R,MAAOgG,EAAAA,GAAa2D,OACtC,CAAEiI,MAAO,gBAAiB5R,MAAOgG,EAAAA,GAAa4D,e,gBCtBzC,SAASoI,EAAgCzQ,GAC9C,OAAOA,EAAWpB,QAAQ,MAAO,QAAQA,QAAQ,MAAO,OAAOA,QAAQ,KAAM,MAC/E,CCRO,SAASmE,EAAqBN,GACnC,MACMiO,EADkBjO,EAASwH,QAAQpH,GAA6B,YAAjBA,EAAQzD,OAE1DqL,KAAKkG,GAAM,OAAOF,EAAgCE,EAAE9N,cACpD+N,KAAK,KACLC,OAEGC,EAAkBrO,EAASwH,QAAQpH,GAA6B,YAAjBA,EAAQzD,OAC7D,IAAI2R,EAAsB,GAU1B,OATID,EAAgBjP,OAAS,IAEzBkP,EAD6B,IAA3BD,EAAgBjP,OACI,OAAO4O,EAAgCK,EAAgB,GAAGjO,YAE1D,MAAMiO,EACzBrG,KAAKkG,GAAM,IAAIF,EAAgCE,EAAE9N,cACjD+N,KAAK,WAGL,GAAGF,KAAuBK,IAAsBF,MACzD,C,+bCQO,MAAMxN,EAAa,UACb2N,EAAkB,aAClBC,EAAqB,kBACrBC,EAA0B,qBAC1B5N,EAAa,SACb6N,EAAkB,YAClBC,EAAsB,mBACtBC,EAAwB,qBACxBC,EAA0B,aAC1B/N,EAAe,WACfgO,EAAoB,cACpB7N,EAAe,WACf8N,EAAoB,cACpBhO,EAAa,SACbiO,EAAkB,YAClBC,EAAqB,UACrBC,EAAqB,UACrBC,EAA0B,aAC1BC,EAA2B,uBAE3BC,EAAoB,gBACpBC,EAAyB,mBACzB3O,EAAiB,KACjB4O,EAAsB,QACtBC,EAAoB,sDACpBC,EAAmB,6CACnBC,EAAmB,WAEnBC,EAAkB,aAClBC,EAAuB,gBAIvBC,EAAkB,eAGlB7O,EAAmB,cACnB8O,EAAwB,iBACxBC,EAA2B,IAAIxB,MAAoBS,KAAmBF,KAAqBC,KAAqBe,KAAyBF,KAAwBlB,IAGjKsB,EAA0C,IAAIzB,MAAoBS,KAAmBJ,KAAyBG,KAAqBe,KAAyBF,KAAwBjB,IAEpLsB,EAA8B,IAAI1B,MAAoBI,KAAuBG,KAAqBC,KAAqBe,KAAyBF,KAAwBlB,IACxKwB,EAAgC,IAAI3B,MAAoBO,KAAqBC,KAAqBa,IAClGO,EAAkC,GAAG5B,KAAmBS,KAAmBF,KAAqBC,KAAqBe,KAAyBpB,IAC9I0B,EAAiB,CAAExT,IAAK2S,GACxBc,EAAqB,SACrB9Q,EAAuB,iBACvB3B,EAAe,eACf0S,EAAmB,UACnBC,EAAyB,yBAEzBtU,EAAuB,KAIvBuU,EAAgC,UACtC,SAAS/O,EAAgCzF,EAAQ,IACtD,OAAIA,EAAMyU,WAAWD,GACZxU,EAAMsI,UAAUkM,EAA8BpR,QAEhDpD,CACT,CACO,SAAS0U,EAA4B1U,EAAQ,IAClD,OAAOA,EAAMyU,WAAWD,EAC1B,CACO,SAASnU,EAA8BL,EAAQ,IACpD,OAAOwU,EAAgCxU,CACzC,C,WCpGA2U,EAAOC,QAAUC,C,WCAjBF,EAAOC,QAAUE,C,WCAjBH,EAAOC,QAAUG,C,WCAjBJ,EAAOC,QAAUI,C,WCAjBL,EAAOC,QAAUK,C,WCAjBN,EAAOC,QAAUM,C,WCAjBP,EAAOC,QAAUO,C,UCAjBR,EAAOC,QAAUQ,C,WCAjBT,EAAOC,QAAUS,C,WCAjBV,EAAOC,QAAUU,C,WCAjBX,EAAOC,QAAUW,C,wSCGjB,MAAMC,EAAsB,KAC5B,IAAIC,EAAa,EACjB,MAAMC,EACF,WAAAnN,CAAYjG,EAAMI,GACdyF,KAAK7F,KAAOA,EACZ6F,KAAKzF,GAAKA,CACd,EAOJ,MAAMiT,EAIF,WAAApN,CAAYqN,EAAS,CAAC,GAClBzN,KAAK7K,GAAKmY,IACVtN,KAAK0N,UAAYD,EAAOC,QACxB1N,KAAK2N,YAAcF,EAAOE,aAAe,MACrC,MAAM,IAAIlO,MAAM,uDACnB,EACL,CAUA,GAAAmO,CAAI5R,GACA,GAAIgE,KAAK0N,QACL,MAAM,IAAIG,WAAW,0CAGzB,MAFoB,mBAAT7R,IACPA,EAAQ8R,EAAS9R,MAAMA,IACnBxD,IACJ,IAAIuV,EAAS/R,EAAMxD,GACnB,YAAkBoI,IAAXmN,EAAuB,KAAO,CAAC/N,KAAM+N,EAAO,CAE3D,EAQJP,EAASQ,SAAW,IAAIR,EAAS,CAAEG,YAAaM,GAAOA,EAAI3U,MAAM,OAMjEkU,EAASU,SAAW,IAAIV,EAAS,CAAEG,YAAaM,GAAOA,EAAI3U,MAAM,OAMjEkU,EAASW,MAAQ,IAAIX,EAAS,CAAEG,YAAaM,GAAOA,EAAI3U,MAAM,OAY9DkU,EAASY,QAAU,IAAIZ,EAAS,CAAEG,YAAa9V,IACvC,GAAIA,GAAkB,OAATA,GAA2B,OAATA,GAA2B,QAATA,EAC7C,MAAM,IAAIgW,WAAW,8BAAgChW,GACzD,OAAOA,GAAS,MAAM,IAO9B2V,EAASa,YAAc,IAAIb,EAAS,CAAEE,SAAS,IAO/CF,EAASc,UAAY,IAAId,EAAS,CAAEE,SAAS,IAM7CF,EAASe,QAAU,IAAIf,EAAS,CAAEE,SAAS,IAM3C,MAAMc,EACF,WAAApO,CAIAqO,EAUAC,EAIAlT,GACIwE,KAAKyO,KAAOA,EACZzO,KAAK0O,QAAUA,EACf1O,KAAKxE,OAASA,CAClB,CAIA,UAAOmT,CAAIF,GACP,OAAOA,GAAQA,EAAKlZ,OAASkZ,EAAKlZ,MAAMiY,EAASe,QAAQpZ,GAC7D,EAEJ,MAAMyZ,EAAUzP,OAAO0P,OAAO,MAI9B,MAAMf,EAIF,WAAA1N,CAOA+G,EAIA5R,EAKAJ,EAIA2Z,EAAQ,GACJ9O,KAAKmH,KAAOA,EACZnH,KAAKzK,MAAQA,EACbyK,KAAK7K,GAAKA,EACV6K,KAAK8O,MAAQA,CACjB,CAIA,aAAOC,CAAOC,GACV,IAAIzZ,EAAQyZ,EAAKzZ,OAASyZ,EAAKzZ,MAAM0F,OAASkE,OAAO0P,OAAO,MAAQD,EAChEE,GAASE,EAAKC,IAAM,EAAuB,IAAMD,EAAKE,QAAU,EAA2B,IAC1FF,EAAKrQ,MAAQ,EAAyB,IAAmB,MAAbqQ,EAAK7H,KAAe,EAA6B,GAC9F3O,EAAO,IAAIsV,EAASkB,EAAK7H,MAAQ,GAAI5R,EAAOyZ,EAAK7Z,GAAI2Z,GACzD,GAAIE,EAAKzZ,MACL,IAAK,IAAI4Z,KAAOH,EAAKzZ,MAGjB,GAFKuS,MAAMC,QAAQoH,KACfA,EAAMA,EAAI3W,IACV2W,EAAK,CACL,GAAIA,EAAI,GAAGzB,QACP,MAAM,IAAIG,WAAW,8CACzBtY,EAAM4Z,EAAI,GAAGha,IAAMga,EAAI,EAC3B,CAER,OAAO3W,CACX,CAKA,IAAAgP,CAAKA,GAAQ,OAAOxH,KAAKzK,MAAMiS,EAAKrS,GAAK,CAIzC,SAAIia,GAAU,OAAqB,EAAbpP,KAAK8O,OAAgC,CAAG,CAI9D,aAAIO,GAAc,OAAqB,EAAbrP,KAAK8O,OAAoC,CAAG,CAItE,WAAIQ,GAAY,OAAqB,EAAbtP,KAAK8O,OAAkC,CAAG,CAKlE,eAAIS,GAAgB,OAAqB,EAAbvP,KAAK8O,OAAsC,CAAG,CAK1E,EAAAU,CAAGrI,GACC,GAAmB,iBAARA,EAAkB,CACzB,GAAInH,KAAKmH,MAAQA,EACb,OAAO,EACX,IAAIgH,EAAQnO,KAAKwH,KAAKgG,EAASW,OAC/B,QAAOA,GAAQA,EAAMsB,QAAQtI,IAAS,CAC1C,CACA,OAAOnH,KAAK7K,IAAMgS,CACtB,CASA,YAAOnL,CAAM6H,GACT,IAAI6L,EAASvQ,OAAO0P,OAAO,MAC3B,IAAK,IAAIrH,KAAQ3D,EACb,IAAK,IAAIsD,KAAQK,EAAKlO,MAAM,KACxBoW,EAAOvI,GAAQtD,EAAI2D,GAC3B,OAAQ3H,IACJ,IAAK,IAAI8P,EAAS9P,EAAK2H,KAAKgG,EAASW,OAAQnG,GAAK,EAAGA,GAAK2H,EAASA,EAAO1U,OAAS,GAAI+M,IAAK,CACxF,IAAI4H,EAAQF,EAAO1H,EAAI,EAAInI,EAAKsH,KAAOwI,EAAO3H,IAC9C,GAAI4H,EACA,OAAOA,CACf,EAER,EAKJ9B,EAAS+B,KAAO,IAAI/B,EAAS,GAAI3O,OAAO0P,OAAO,MAAO,EAAG,GAUzD,MAAMiB,EAKF,WAAA1P,CAIA2P,GACI/P,KAAK+P,MAAQA,EACb,IAAK,IAAI/H,EAAI,EAAGA,EAAI+H,EAAM9U,OAAQ+M,IAC9B,GAAI+H,EAAM/H,GAAG7S,IAAM6S,EACf,MAAM,IAAI6F,WAAW,8EACjC,CAMA,MAAAmC,IAAUza,GACN,IAAI0a,EAAW,GACf,IAAK,IAAIzX,KAAQwH,KAAK+P,MAAO,CACzB,IAAIG,EAAW,KACf,IAAK,IAAIC,KAAU5a,EAAO,CACtB,IAAIqY,EAAMuC,EAAO3X,GACboV,IACKsC,IACDA,EAAW/Q,OAAOiR,OAAO,CAAC,EAAG5X,EAAKjD,QACtC2a,EAAStC,EAAI,GAAGzY,IAAMyY,EAAI,GAElC,CACAqC,EAASnU,KAAKoU,EAAW,IAAIpC,EAAStV,EAAK2O,KAAM+I,EAAU1X,EAAKrD,GAAIqD,EAAKsW,OAAStW,EACtF,CACA,OAAO,IAAIsX,EAAQG,EACvB,EAEJ,MAAMI,EAAa,IAAIC,QAAWC,EAAkB,IAAID,QAKxD,IAAIE,GACJ,SAAWA,GAMPA,EAASA,EAAyB,eAAI,GAAK,iBAM3CA,EAASA,EAA2B,iBAAI,GAAK,mBAM7CA,EAASA,EAAuB,aAAI,GAAK,eAOzCA,EAASA,EAAyB,eAAI,GAAK,gBAC9C,CA1BD,CA0BGA,IAAaA,EAAW,CAAC,IAiB5B,MAAMC,EAIF,WAAArQ,CAIA5H,EAIAkY,EAKA3P,EAIA9F,EAIA1F,GASI,GARAyK,KAAKxH,KAAOA,EACZwH,KAAK0Q,SAAWA,EAChB1Q,KAAKe,UAAYA,EACjBf,KAAK/E,OAASA,EAId+E,KAAKzK,MAAQ,KACTA,GAASA,EAAM0F,OAAQ,CACvB+E,KAAKzK,MAAQ4J,OAAO0P,OAAO,MAC3B,IAAK,IAAKrH,EAAM3P,KAAUtC,EACtByK,KAAKzK,MAAqB,iBAARiS,EAAmBA,EAAOA,EAAKrS,IAAM0C,CAC/D,CACJ,CAIA,QAAAwC,GACI,IAAIkU,EAAUC,EAAYG,IAAI3O,MAC9B,GAAIuO,IAAYA,EAAQG,QACpB,OAAOH,EAAQE,KAAKpU,WACxB,IAAIqW,EAAW,GACf,IAAK,IAAIC,KAAM3Q,KAAK0Q,SAAU,CAC1B,IAAIzC,EAAM0C,EAAGtW,WACT4T,IACIyC,IACAA,GAAY,KAChBA,GAAYzC,EAEpB,CACA,OAAQjO,KAAKxH,KAAK2O,MACb,KAAKyJ,KAAK5Q,KAAKxH,KAAK2O,QAAUnH,KAAKxH,KAAK8W,QAAU5T,KAAKC,UAAUqE,KAAKxH,KAAK2O,MAAQnH,KAAKxH,KAAK2O,OACzFuJ,EAASzV,OAAS,IAAMyV,EAAW,IAAM,IAFzBA,CAG7B,CAMA,MAAAG,CAAOC,EAAO,GACV,OAAO,IAAIC,EAAW/Q,KAAKgR,QAASF,EACxC,CAMA,QAAAG,CAASjQ,EAAKkQ,EAAO,EAAGJ,EAAO,GAC3B,IAAIK,EAAQd,EAAW1B,IAAI3O,OAASA,KAAKgR,QACrCH,EAAS,IAAIE,EAAWI,GAG5B,OAFAN,EAAOO,OAAOpQ,EAAKkQ,GACnBb,EAAWlT,IAAI6C,KAAM6Q,EAAOQ,OACrBR,CACX,CAKA,WAAIG,GACA,OAAO,IAAIM,EAAStR,KAAM,EAAG,EAAG,KACpC,CAYA,OAAAuR,CAAQvQ,EAAKkQ,EAAO,GAChB,IAAIrR,EAAO2R,EAAYnB,EAAW1B,IAAI3O,OAASA,KAAKgR,QAAShQ,EAAKkQ,GAAM,GAExE,OADAb,EAAWlT,IAAI6C,KAAMH,GACdA,CACX,CAQA,YAAA4R,CAAazQ,EAAKkQ,EAAO,GACrB,IAAIrR,EAAO2R,EAAYjB,EAAgB5B,IAAI3O,OAASA,KAAKgR,QAAShQ,EAAKkQ,GAAM,GAE7E,OADAX,EAAgBpT,IAAI6C,KAAMH,GACnBA,CACX,CAQA,YAAA6R,CAAa1Q,EAAKkQ,EAAO,GACrB,OAwcR,SAAuBzC,EAAMzN,EAAKkQ,GAC9B,IAAIS,EAAQlD,EAAKgD,aAAazQ,EAAKkQ,GAAOU,EAAS,KACnD,IAAK,IAAIC,EAAOF,aAAiBL,EAAWK,EAAQA,EAAMxZ,QAAQ2Z,OAAQD,EAAMA,EAAOA,EAAKC,OACxF,GAAID,EAAKvQ,MAAQ,EAAG,CAChB,IAAIwQ,EAASD,EAAKC,QACjBF,IAAWA,EAAS,CAACD,KAAS7V,KAAKgW,EAAOP,QAAQvQ,EAAKkQ,IACxDW,EAAOC,CACX,KACK,CACD,IAAIC,EAAQvD,EAAYG,IAAIkD,EAAKpD,MAEjC,GAAIsD,GAASA,EAAMrD,SAAWqD,EAAMrD,QAAQ,GAAGvU,MAAQ6G,GAAO+Q,EAAMrD,QAAQqD,EAAMrD,QAAQzT,OAAS,GAAGV,IAAMyG,EAAK,CAC7G,IAAIgR,EAAO,IAAIV,EAASS,EAAMtD,KAAMsD,EAAMrD,QAAQ,GAAGvU,KAAO0X,EAAK1X,MAAO,EAAG0X,IAC1ED,IAAWA,EAAS,CAACD,KAAS7V,KAAK0V,EAAYQ,EAAMhR,EAAKkQ,GAAM,GACrE,CACJ,CAEJ,OAAOU,EAASK,EAAUL,GAAUD,CACxC,CA1deO,CAAclS,KAAMgB,EAAKkQ,EACpC,CAQA,OAAAxQ,CAAQsO,GACJ,IAAI,MAAErO,EAAK,MAAEwR,EAAK,KAAEhY,EAAO,EAAC,GAAEI,EAAKyF,KAAK/E,QAAW+T,EAC/C8B,EAAO9B,EAAK8B,MAAQ,EAAGsB,GAAQtB,EAAON,EAAS6B,kBAAoB,EACvE,IAAK,IAAIC,EAAItS,KAAK6Q,OAAOC,EAAON,EAAS6B,oBAAqB,CAC1D,IAAIE,GAAU,EACd,GAAID,EAAEnY,MAAQI,GAAM+X,EAAE/X,IAAMJ,KAAUiY,GAAQE,EAAE9Z,KAAK+W,cAA4B,IAAb5O,EAAM2R,IAAe,CACrF,GAAIA,EAAEE,aACF,SACJD,GAAU,CACd,CACA,KACQA,GAAWJ,IAAUC,IAASE,EAAE9Z,KAAK+W,cACrC4C,EAAMG,IACNA,EAAEG,eAHD,CAKL,IAAKH,EAAER,SACH,OACJS,GAAU,CACd,CACJ,CACJ,CAKA,IAAA/K,CAAKA,GACD,OAAQA,EAAKkG,QAAiC1N,KAAKzK,MAAQyK,KAAKzK,MAAMiS,EAAKrS,SAAMyL,EAA1DZ,KAAKxH,KAAKgP,KAAKA,EAC1C,CAMA,cAAIkL,GACA,IAAI3E,EAAS,GACb,GAAI/N,KAAKzK,MACL,IAAK,IAAIJ,KAAM6K,KAAKzK,MAChBwY,EAAOjS,KAAK,EAAE3G,EAAI6K,KAAKzK,MAAMJ,KACrC,OAAO4Y,CACX,CAMA,OAAA4E,CAAQlF,EAAS,CAAC,GACd,OAAOzN,KAAK0Q,SAASzV,QAAU,EAA+B+E,KAC1D4S,EAAa9E,EAAS+B,KAAM7P,KAAK0Q,SAAU1Q,KAAKe,UAAW,EAAGf,KAAK0Q,SAASzV,OAAQ,EAAG+E,KAAK/E,QAAQ,CAACyV,EAAU3P,EAAW9F,IAAW,IAAIwV,EAAKzQ,KAAKxH,KAAMkY,EAAU3P,EAAW9F,EAAQ+E,KAAK0S,aAAajF,EAAOoF,UAAY,EAAEnC,EAAU3P,EAAW9F,IAAW,IAAIwV,EAAK3C,EAAS+B,KAAMa,EAAU3P,EAAW9F,IAClT,CAKA,YAAO6X,CAAMvT,GAAQ,OA4tBzB,SAAmBA,GACf,IAAIwT,EACJ,IAAI,OAAEC,EAAM,QAAEC,EAAO,gBAAEC,EAAkB7F,EAAmB,OAAE8F,EAAS,GAAE,cAAEC,EAAgBH,EAAQlD,MAAM9U,QAAWsE,EAChHsR,EAAS/I,MAAMC,QAAQiL,GAAU,IAAIK,EAAiBL,EAAQA,EAAO/X,QAAU+X,EAC/EjD,EAAQkD,EAAQlD,MAChB1B,EAAc,EAAGC,EAAY,EACjC,SAASgF,EAASC,EAAaC,EAAQ9C,EAAU3P,EAAW0S,EAAUC,GAClE,IAAI,GAAEve,EAAE,MAAEwe,EAAK,IAAEC,EAAG,KAAEC,GAAShD,EAC3BiD,EAAmBxF,EAAWyF,EAAiB1F,EACnD,KAAOwF,EAAO,GAAG,CAEb,GADAhD,EAAOmD,QACM,GAATH,EAAsC,CACtC,IAAIhU,EAAOsT,EAAOhe,GAGlB,OAFAub,EAAS5U,KAAK+D,QACdkB,EAAUjF,KAAK6X,EAAQJ,EAE3B,CACK,IAAa,GAATM,EAEL,YADAxF,EAAclZ,GAGb,IAAa,GAAT0e,EAEL,YADAvF,EAAYnZ,GAIZ,MAAM,IAAI0Y,WAAW,6BAA6BgG,IAE1D,CACA,IAAsBhU,EAAMmT,EAAxBxa,EAAOuX,EAAM5a,GACb8e,EAAWN,EAAQJ,EACvB,GAAIK,EAAMD,GAAST,IAAoBF,EA8G3C,SAAwBkB,EAAST,GAO7B,IAAIU,EAAOtD,EAAOsD,OACdN,EAAO,EAAGF,EAAQ,EAAGS,EAAO,EAAGC,EAAWF,EAAKP,IAAMV,EACrDnF,EAAS,CAAE8F,KAAM,EAAGF,MAAO,EAAGS,KAAM,GACxCvC,EAAM,IAAK,IAAI2B,EAASW,EAAKnT,IAAMkT,EAASC,EAAKnT,IAAMwS,GAAS,CAC5D,IAAIc,EAAWH,EAAKN,KAEpB,GAAIM,EAAKhf,IAAMse,GAAYa,GAAY,EAAG,CAGtCvG,EAAO8F,KAAOA,EACd9F,EAAO4F,MAAQA,EACf5F,EAAOqG,KAAOA,EACdA,GAAQ,EACRP,GAAQ,EACRM,EAAKH,OACL,QACJ,CACA,IAAIC,EAAWE,EAAKnT,IAAMsT,EAC1B,GAAIA,EAAW,GAAKL,EAAWT,GAAUW,EAAKR,MAAQU,EAClD,MACJ,IAAIE,EAAeJ,EAAKhf,IAAMie,EAAgB,EAAI,EAC9CoB,EAAYL,EAAKR,MAErB,IADAQ,EAAKH,OACEG,EAAKnT,IAAMiT,GAAU,CACxB,GAAIE,EAAKN,KAAO,EAAG,CACf,IAAkB,GAAdM,EAAKN,KAGL,MAAMhC,EAFN0C,GAAgB,CAGxB,MACSJ,EAAKhf,IAAMie,IAChBmB,GAAgB,GAEpBJ,EAAKH,MACT,CACAL,EAAQa,EACRX,GAAQS,EACRF,GAAQG,CACZ,CAMA,OALId,EAAW,GAAKI,GAAQK,KACxBnG,EAAO8F,KAAOA,EACd9F,EAAO4F,MAAQA,EACf5F,EAAOqG,KAAOA,GAEXrG,EAAO8F,KAAO,EAAI9F,OAASnN,CACtC,CAlKoD6T,CAAe5D,EAAO7P,IAAMwS,EAAQC,IAAY,CAE5F,IAAIlU,EAAO,IAAImV,YAAY1B,EAAOa,KAAOb,EAAOoB,MAC5CO,EAAS9D,EAAO7P,IAAMgS,EAAOa,KAAMvS,EAAQ/B,EAAKtE,OACpD,KAAO4V,EAAO7P,IAAM2T,GAChBrT,EAAQsT,EAAa5B,EAAOW,MAAOpU,EAAM+B,GAC7CzB,EAAO,IAAIgV,EAAWtV,EAAMqU,EAAMZ,EAAOW,MAAOV,GAChDgB,EAAWjB,EAAOW,MAAQJ,CAC9B,KACK,CACD,IAAIoB,EAAS9D,EAAO7P,IAAM6S,EAC1BhD,EAAOmD,OACP,IAAIc,EAAgB,GAAIC,EAAiB,GACrCC,EAAgB7f,GAAMie,EAAgBje,GAAM,EAC5C8f,EAAY,EAAGC,EAAUtB,EAC7B,KAAO/C,EAAO7P,IAAM2T,GACZK,GAAiB,GAAKnE,EAAO1b,IAAM6f,GAAiBnE,EAAOgD,MAAQ,GAC/DhD,EAAO+C,KAAOsB,EAAUhC,IACxBiC,EAAeL,EAAeC,EAAgBpB,EAAOsB,EAAWpE,EAAO+C,IAAKsB,EAASF,EAAelB,EAAkBC,GACtHkB,EAAYH,EAAc7Z,OAC1Bia,EAAUrE,EAAO+C,KAErB/C,EAAOmD,QAEFN,EAAQ,KACb0B,EAAazB,EAAOgB,EAAQG,EAAeC,GAG3CzB,EAASK,EAAOgB,EAAQG,EAAeC,EAAgBC,EAAetB,EAAQ,GAOtF,GAJIsB,GAAiB,GAAKC,EAAY,GAAKA,EAAYH,EAAc7Z,QACjEka,EAAeL,EAAeC,EAAgBpB,EAAOsB,EAAWtB,EAAOuB,EAASF,EAAelB,EAAkBC,GACrHe,EAAcO,UACdN,EAAeM,UACXL,GAAiB,GAAKC,EAAY,EAAG,CACrC,IAAIK,EA0ChB,SAAsB9c,EAAM6V,GACxB,MAAO,CAACqC,EAAU3P,EAAW9F,KACzB,IAAgDsa,EAAMC,EAAlDlH,EAAY,EAAGmH,EAAQ/E,EAASzV,OAAS,EAC7C,GAAIwa,GAAS,IAAMF,EAAO7E,EAAS+E,cAAmBhF,EAAM,CACxD,IAAKgF,GAASF,EAAK/c,MAAQA,GAAQ+c,EAAKta,QAAUA,EAC9C,OAAOsa,GACPC,EAAgBD,EAAK/N,KAAKgG,EAASc,cACnCA,EAAYvN,EAAU0U,GAASF,EAAKta,OAASua,EACrD,CACA,OAAO3C,EAASra,EAAMkY,EAAU3P,EAAW9F,EAAQqT,EAAWD,EAAY,CAElF,CArDuBqH,CAAald,EAAMub,GAC9BlU,EAAO+S,EAAapa,EAAMsc,EAAeC,EAAgB,EAAGD,EAAc7Z,OAAQ,EAAG2Y,EAAMD,EAAO2B,EAAMA,EAC5G,MAEIzV,EAAOgT,EAASra,EAAMsc,EAAeC,EAAgBnB,EAAMD,EAAOG,EAAmBF,EAAKG,EAElG,CACArD,EAAS5U,KAAK+D,GACdkB,EAAUjF,KAAKmY,EACnB,CACA,SAASmB,EAAa7B,EAAaC,EAAQ9C,EAAU3P,GACjD,IAAIP,EAAQ,GACRmV,EAAY,EAAGC,GAAU,EAC7B,KAAO/E,EAAO7P,IAAMwS,GAAQ,CACxB,IAAI,GAAEre,EAAE,MAAEwe,EAAK,IAAEC,EAAG,KAAEC,GAAShD,EAC/B,GAAIgD,EAAO,EACPhD,EAAOmD,WAEN,IAAI4B,GAAU,GAAKjC,EAAQiC,EAC5B,MAGIA,EAAS,IACTA,EAAShC,EAAMV,GACnB1S,EAAM1E,KAAK3G,EAAIwe,EAAOC,GACtB+B,IACA9E,EAAOmD,MACX,CACJ,CACA,GAAI2B,EAAW,CACX,IAAI3C,EAAS,IAAI0B,YAAwB,EAAZiB,GACzBhC,EAAQnT,EAAMA,EAAMvF,OAAS,GACjC,IAAK,IAAI+M,EAAIxH,EAAMvF,OAAS,EAAG4a,EAAI,EAAG7N,GAAK,EAAGA,GAAK,EAC/CgL,EAAO6C,KAAOrV,EAAMwH,GACpBgL,EAAO6C,KAAOrV,EAAMwH,EAAI,GAAK2L,EAC7BX,EAAO6C,KAAOrV,EAAMwH,EAAI,GAAK2L,EAC7BX,EAAO6C,KAAOA,EAElBnF,EAAS5U,KAAK,IAAI+Y,EAAW7B,EAAQxS,EAAM,GAAKmT,EAAOV,IACvDlS,EAAUjF,KAAK6X,EAAQJ,EAC3B,CACJ,CAaA,SAAS4B,EAAezE,EAAU3P,EAAW+U,EAAM9N,EAAG7N,EAAMI,EAAI/B,EAAM8V,EAAWD,GAC7E,IAAIyG,EAAgB,GAAIC,EAAiB,GACzC,KAAOrE,EAASzV,OAAS+M,GACrB8M,EAAchZ,KAAK4U,EAASqF,OAC5BhB,EAAejZ,KAAKiF,EAAUgV,MAAQD,EAAO3b,GAEjDuW,EAAS5U,KAAK+W,EAASI,EAAQlD,MAAMvX,GAAOsc,EAAeC,EAAgBxa,EAAKJ,EAAMmU,EAAY/T,EAAI8T,IACtGtN,EAAUjF,KAAK3B,EAAO2b,EAC1B,CACA,SAASjD,EAASra,EAAMkY,EAAU3P,EAAW9F,EAAQqT,EAAWD,EAAa9Y,GACzE,GAAI8Y,EAAa,CACb,IAAI2H,EAAO,CAACxI,EAASa,YAAaA,GAClC9Y,EAAQA,EAAQ,CAACygB,GAAMC,OAAO1gB,GAAS,CAACygB,EAC5C,CACA,GAAI1H,EAAY,GAAI,CAChB,IAAI0H,EAAO,CAACxI,EAASc,UAAWA,GAChC/Y,EAAQA,EAAQ,CAACygB,GAAMC,OAAO1gB,GAAS,CAACygB,EAC5C,CACA,OAAO,IAAIvF,EAAKjY,EAAMkY,EAAU3P,EAAW9F,EAAQ1F,EACvD,CAsDA,SAASqf,EAAasB,EAAalD,EAAQ1R,GACvC,IAAI,GAAEnM,EAAE,MAAEwe,EAAK,IAAEC,EAAG,KAAEC,GAAShD,EAE/B,GADAA,EAAOmD,OACHH,GAAQ,GAAK1e,EAAKie,EAAe,CACjC,IAAI+C,EAAa7U,EACjB,GAAIuS,EAAO,EAAG,CACV,IAAIc,EAAS9D,EAAO7P,KAAO6S,EAAO,GAClC,KAAOhD,EAAO7P,IAAM2T,GAChBrT,EAAQsT,EAAasB,EAAalD,EAAQ1R,EAClD,CACA0R,IAAS1R,GAAS6U,EAClBnD,IAAS1R,GAASsS,EAAMsC,EACxBlD,IAAS1R,GAASqS,EAAQuC,EAC1BlD,IAAS1R,GAASnM,CACtB,MACkB,GAAT0e,EACLxF,EAAclZ,GAEA,GAAT0e,IACLvF,EAAYnZ,GAEhB,OAAOmM,CACX,CACA,IAAIoP,EAAW,GAAI3P,EAAY,GAC/B,KAAO8P,EAAO7P,IAAM,GAChBsS,EAAS/T,EAAKoU,OAAS,EAAGpU,EAAK2W,aAAe,EAAGxF,EAAU3P,GAAY,EAAG,GAC9E,IAAI9F,EAAgC,QAAtB8X,EAAKxT,EAAKtE,cAA2B,IAAP8X,EAAgBA,EAAMrC,EAASzV,OAAS8F,EAAU,GAAK2P,EAAS,GAAGzV,OAAS,EACxH,OAAO,IAAIwV,EAAKV,EAAMxQ,EAAK6W,OAAQ1F,EAAS2E,UAAWtU,EAAUsU,UAAWpa,EAChF,CA17BgCob,CAAU9W,EAAO,EAKjDkR,EAAK6F,MAAQ,IAAI7F,EAAK3C,EAAS+B,KAAM,GAAI,GAAI,GAC7C,MAAMwD,EACF,WAAAjT,CAAY4S,EAAQ1R,GAChBtB,KAAKgT,OAASA,EACdhT,KAAKsB,MAAQA,CACjB,CACA,MAAInM,GAAO,OAAO6K,KAAKgT,OAAOhT,KAAKsB,MAAQ,EAAI,CAC/C,SAAIqS,GAAU,OAAO3T,KAAKgT,OAAOhT,KAAKsB,MAAQ,EAAI,CAClD,OAAIsS,GAAQ,OAAO5T,KAAKgT,OAAOhT,KAAKsB,MAAQ,EAAI,CAChD,QAAIuS,GAAS,OAAO7T,KAAKgT,OAAOhT,KAAKsB,MAAQ,EAAI,CACjD,OAAIN,GAAQ,OAAOhB,KAAKsB,KAAO,CAC/B,IAAA0S,GAAShU,KAAKsB,OAAS,CAAG,CAC1B,IAAA6S,GAAS,OAAO,IAAId,EAAiBrT,KAAKgT,OAAQhT,KAAKsB,MAAQ,EAQnE,MAAMuT,EAIF,WAAAzU,CAIA4S,EAIA/X,EAIAkC,GACI6C,KAAKgT,OAASA,EACdhT,KAAK/E,OAASA,EACd+E,KAAK7C,IAAMA,CACf,CAIA,QAAI3E,GAAS,OAAOsV,EAAS+B,IAAM,CAInC,QAAAxV,GACI,IAAI0T,EAAS,GACb,IAAK,IAAIzM,EAAQ,EAAGA,EAAQtB,KAAKgT,OAAO/X,QACpC8S,EAAOjS,KAAKkE,KAAKuW,YAAYjV,IAC7BA,EAAQtB,KAAKgT,OAAO1R,EAAQ,GAEhC,OAAOyM,EAAO/D,KAAK,IACvB,CAIA,WAAAuM,CAAYjV,GACR,IAAInM,EAAK6K,KAAKgT,OAAO1R,GAAQkV,EAAWxW,KAAKgT,OAAO1R,EAAQ,GACxD9I,EAAOwH,KAAK7C,IAAI4S,MAAM5a,GAAK4Y,EAASvV,EAAK2O,KAI7C,GAHI,KAAKyJ,KAAK7C,KAAYvV,EAAK8W,UAC3BvB,EAASrS,KAAKC,UAAUoS,IAExByI,IADJlV,GAAS,GAEL,OAAOyM,EACX,IAAI2C,EAAW,GACf,KAAOpP,EAAQkV,GACX9F,EAAS5U,KAAKkE,KAAKuW,YAAYjV,IAC/BA,EAAQtB,KAAKgT,OAAO1R,EAAQ,GAEhC,OAAOyM,EAAS,IAAM2C,EAAS1G,KAAK,KAAO,GAC/C,CAIA,SAAAyM,CAAUN,EAAYK,EAAUE,EAAK1V,EAAKkQ,GACtC,IAAI,OAAE8B,GAAWhT,KAAM2W,GAAQ,EAC/B,IAAK,IAAI3O,EAAImO,EAAYnO,GAAKwO,KACtBI,EAAU1F,EAAMlQ,EAAKgS,EAAOhL,EAAI,GAAIgL,EAAOhL,EAAI,MAC/C2O,EAAO3O,EACH0O,EAAM,IAHsB1O,EAAIgL,EAAOhL,EAAI,IAOvD,OAAO2O,CACX,CAIA,KAAAE,CAAMC,EAAQC,EAAM5c,GAChB,IAAI6c,EAAIhX,KAAKgT,OACTiE,EAAO,IAAIvC,YAAYqC,EAAOD,GAASI,EAAM,EACjD,IAAK,IAAIlP,EAAI8O,EAAQjB,EAAI,EAAG7N,EAAI+O,GAAO,CACnCE,EAAKpB,KAAOmB,EAAEhP,KACdiP,EAAKpB,KAAOmB,EAAEhP,KAAO7N,EACrB,IAAII,EAAK0c,EAAKpB,KAAOmB,EAAEhP,KAAO7N,EAC9B8c,EAAKpB,KAAOmB,EAAEhP,KAAO8O,EACrBI,EAAMC,KAAKC,IAAIF,EAAK3c,EACxB,CACA,OAAO,IAAIsa,EAAWoC,EAAMC,EAAKlX,KAAK7C,IAC1C,EAEJ,SAASyZ,EAAU1F,EAAMlQ,EAAK7G,EAAMI,GAChC,OAAQ2W,GACJ,KAAM,EAAqB,OAAO/W,EAAO6G,EACzC,KAAM,EAAyB,OAAOzG,GAAMyG,GAAO7G,EAAO6G,EAC1D,KAAK,EAAqB,OAAO7G,EAAO6G,GAAOzG,EAAKyG,EACpD,KAAK,EAAwB,OAAO7G,GAAQ6G,GAAOzG,EAAKyG,EACxD,KAAK,EAAoB,OAAOzG,EAAKyG,EACrC,KAAK,EAAuB,OAAO,EAE3C,CACA,SAASwQ,EAAY3R,EAAMmB,EAAKkQ,EAAMmG,GAGlC,IAFA,IAAItE,EAEGlT,EAAK1F,MAAQ0F,EAAKtF,KACpB2W,EAAO,EAAIrR,EAAK1F,MAAQ6G,EAAMnB,EAAK1F,KAAO6G,KAC1CkQ,GAAQ,EAAIrR,EAAKtF,IAAMyG,EAAMnB,EAAKtF,GAAKyG,IAAM,CAC9C,IAAI8Q,GAAUuF,GAAYxX,aAAgByR,GAAYzR,EAAKyB,MAAQ,EAAI,KAAOzB,EAAKiS,OACnF,IAAKA,EACD,OAAOjS,EACXA,EAAOiS,CACX,CACA,IAAIhB,EAAOuG,EAAW,EAAI7G,EAAS8G,eAEnC,GAAID,EACA,IAAK,IAAIxF,EAAOhS,EAAMiS,EAASD,EAAKC,OAAQA,EAAQD,EAAOC,EAAQA,EAASD,EAAKC,OACzED,aAAgBP,GAAYO,EAAKvQ,MAAQ,IAA+C,QAAxCyR,EAAKjB,EAAOnR,MAAMK,EAAKkQ,EAAMJ,UAA0B,IAAPiC,OAAgB,EAASA,EAAG5Y,OAAS0X,EAAK1X,OAC1I0F,EAAOiS,GAEnB,OAAS,CACL,IAAIH,EAAQ9R,EAAKc,MAAMK,EAAKkQ,EAAMJ,GAClC,IAAKa,EACD,OAAO9R,EACXA,EAAO8R,CACX,CACJ,CACA,MAAM4F,EACF,MAAA1G,CAAOC,EAAO,GAAK,OAAO,IAAIC,EAAW/Q,KAAM8Q,EAAO,CACtD,QAAArL,CAASjN,EAAMgf,EAAS,KAAMC,EAAQ,MAClC,IAAIC,EAAIC,EAAY3X,KAAMxH,EAAMgf,EAAQC,GACxC,OAAOC,EAAEzc,OAASyc,EAAE,GAAK,IAC7B,CACA,WAAAC,CAAYnf,EAAMgf,EAAS,KAAMC,EAAQ,MACrC,OAAOE,EAAY3X,KAAMxH,EAAMgf,EAAQC,EAC3C,CACA,OAAAlG,CAAQvQ,EAAKkQ,EAAO,GAChB,OAAOM,EAAYxR,KAAMgB,EAAKkQ,GAAM,EACxC,CACA,YAAAO,CAAazQ,EAAKkQ,EAAO,GACrB,OAAOM,EAAYxR,KAAMgB,EAAKkQ,GAAM,EACxC,CACA,YAAA0G,CAAazf,GACT,OAAO0f,EAAiB7X,KAAK8R,OAAQ3Z,EACzC,CACA,0BAAA2f,CAA2B9W,GACvB,IAAI6Q,EAAO7R,KAAK+X,YAAY/W,GAAMnB,EAAOG,KACzC,KAAO6R,GAAM,CACT,IAAI0D,EAAO1D,EAAKmG,UAChB,IAAKzC,GAAQA,EAAKhb,IAAMsX,EAAKtX,GACzB,MACAgb,EAAK/c,KAAK8W,SAAWiG,EAAKpb,MAAQob,EAAKhb,IACvCsF,EAAOgS,EACPA,EAAO0D,EAAK0C,aAGZpG,EAAO0D,CAEf,CACA,OAAO1V,CACX,CACA,QAAIA,GAAS,OAAOG,IAAM,CAC1B,QAAIgU,GAAS,OAAOhU,KAAK8R,MAAQ,EAErC,MAAMR,UAAiBiG,EACnB,WAAAnX,CAAYiR,EAAOlX,EAEnBmH,EAAO4W,GACHC,QACAnY,KAAKqR,MAAQA,EACbrR,KAAK7F,KAAOA,EACZ6F,KAAKsB,MAAQA,EACbtB,KAAKkY,QAAUA,CACnB,CACA,QAAI1f,GAAS,OAAOwH,KAAKqR,MAAM7Y,IAAM,CACrC,QAAI2O,GAAS,OAAOnH,KAAKqR,MAAM7Y,KAAK2O,IAAM,CAC1C,MAAI5M,GAAO,OAAOyF,KAAK7F,KAAO6F,KAAKqR,MAAMpW,MAAQ,CACjD,SAAAmd,CAAUpQ,EAAG0O,EAAK1V,EAAKkQ,EAAMJ,EAAO,GAChC,IAAK,IAAIgB,EAAS9R,OAAQ,CACtB,IAAK,IAAI,SAAE0Q,EAAQ,UAAE3P,GAAc+Q,EAAOT,MAAOtS,EAAI2X,EAAM,EAAIhG,EAASzV,QAAU,EAAG+M,GAAKjJ,EAAGiJ,GAAK0O,EAAK,CACnG,IAAI1C,EAAOtD,EAAS1I,GAAI2L,EAAQ5S,EAAUiH,GAAK8J,EAAO3X,KACtD,GAAKyc,EAAU1F,EAAMlQ,EAAK2S,EAAOA,EAAQK,EAAK/Y,QAE9C,GAAI+Y,aAAgBa,EAAY,CAC5B,GAAI/D,EAAON,EAAS6H,eAChB,SACJ,IAAI/W,EAAQ0S,EAAKyC,UAAU,EAAGzC,EAAKhB,OAAO/X,OAAQyb,EAAK1V,EAAM2S,EAAOzC,GACpE,GAAI5P,GAAS,EACT,OAAO,IAAIgX,EAAW,IAAIC,EAAczG,EAAQkC,EAAMhM,EAAG2L,GAAQ,KAAMrS,EAC/E,MACK,GAAKwP,EAAON,EAAS6B,mBAAuB2B,EAAKxb,KAAK+W,aAAeiJ,EAASxE,GAAQ,CACvF,IAAIzF,EACJ,KAAMuC,EAAON,EAASiI,gBAAkBlK,EAAUC,EAAYG,IAAIqF,MAAWzF,EAAQG,QACjF,OAAO,IAAI4C,EAAS/C,EAAQE,KAAMkF,EAAO3L,EAAG8J,GAChD,IAAIH,EAAQ,IAAIL,EAAS0C,EAAML,EAAO3L,EAAG8J,GACzC,OAAQhB,EAAON,EAAS6B,mBAAsBV,EAAMnZ,KAAK+W,YAAcoC,EACjEA,EAAMyG,UAAU1B,EAAM,EAAI1C,EAAKtD,SAASzV,OAAS,EAAI,EAAGyb,EAAK1V,EAAKkQ,EAC5E,CACJ,CACA,GAAKJ,EAAON,EAAS6B,mBAAsBP,EAAOtZ,KAAK+W,YACnD,OAAO,KAMX,GAJIvH,EADA8J,EAAOxQ,OAAS,EACZwQ,EAAOxQ,MAAQoV,EAEfA,EAAM,GAAK,EAAI5E,EAAOoG,QAAQ7G,MAAMX,SAASzV,OACrD6W,EAASA,EAAOoG,SACXpG,EACD,OAAO,IACf,CACJ,CACA,cAAIU,GAAe,OAAOxS,KAAKoY,UAAU,EAAG,EAAG,EAAG,EAAwB,CAC1E,aAAIJ,GAAc,OAAOhY,KAAKoY,UAAUpY,KAAKqR,MAAMX,SAASzV,OAAS,GAAI,EAAG,EAAG,EAAwB,CACvG,UAAAiG,CAAWF,GAAO,OAAOhB,KAAKoY,UAAU,EAAG,EAAGpX,EAAK,EAAqB,CACxE,WAAA+W,CAAY/W,GAAO,OAAOhB,KAAKoY,UAAUpY,KAAKqR,MAAMX,SAASzV,OAAS,GAAI,EAAG+F,GAAM,EAAsB,CACzG,KAAAL,CAAMK,EAAKkQ,EAAMJ,EAAO,GACpB,IAAIvC,EACJ,KAAMuC,EAAON,EAAS8G,kBAAoB/I,EAAUC,EAAYG,IAAI3O,KAAKqR,SAAW9C,EAAQG,QAAS,CACjG,IAAIgK,EAAO1X,EAAMhB,KAAK7F,KACtB,IAAK,IAAI,KAAEA,EAAI,GAAEI,KAAQgU,EAAQG,QAC7B,IAAKwC,EAAO,EAAI/W,GAAQue,EAAOve,EAAOue,KACjCxH,EAAO,EAAI3W,GAAMme,EAAOne,EAAKme,GAC9B,OAAO,IAAIpH,EAAS/C,EAAQE,KAAMF,EAAQG,QAAQ,GAAGvU,KAAO6F,KAAK7F,MAAO,EAAG6F,KAEvF,CACA,OAAOA,KAAKoY,UAAU,EAAG,EAAGpX,EAAKkQ,EAAMJ,EAC3C,CACA,qBAAA6H,GACI,IAAIC,EAAM5Y,KACV,KAAO4Y,EAAIpgB,KAAK+W,aAAeqJ,EAAIV,SAC/BU,EAAMA,EAAIV,QACd,OAAOU,CACX,CACA,UAAI9G,GACA,OAAO9R,KAAKkY,QAAUlY,KAAKkY,QAAQS,wBAA0B,IACjE,CACA,eAAIlG,GACA,OAAOzS,KAAKkY,SAAWlY,KAAKsB,OAAS,EAAItB,KAAKkY,QAAQE,UAAUpY,KAAKsB,MAAQ,EAAG,EAAG,EAAG,GAAyB,IACnH,CACA,eAAI2W,GACA,OAAOjY,KAAKkY,SAAWlY,KAAKsB,OAAS,EAAItB,KAAKkY,QAAQE,UAAUpY,KAAKsB,MAAQ,GAAI,EAAG,EAAG,GAAyB,IACpH,CACA,QAAImN,GAAS,OAAOzO,KAAKqR,KAAO,CAChC,MAAAwH,GAAW,OAAO7Y,KAAKqR,KAAO,CAI9B,QAAAhX,GAAa,OAAO2F,KAAKqR,MAAMhX,UAAY,EAE/C,SAASsd,EAAY9X,EAAMrH,EAAMgf,EAAQC,GACrC,IAAIqB,EAAMjZ,EAAKgR,SAAU9C,EAAS,GAClC,IAAK+K,EAAItG,aACL,OAAOzE,EACX,GAAc,MAAVyJ,EACA,IAAK,IAAI5H,GAAQ,GAAQA,GAErB,GADAA,EAAQkJ,EAAItgB,KAAKgX,GAAGgI,IACfsB,EAAIrG,cACL,OAAO1E,EAEnB,OAAS,CACL,GAAa,MAAT0J,GAAiBqB,EAAItgB,KAAKgX,GAAGiI,GAC7B,OAAO1J,EAGX,GAFI+K,EAAItgB,KAAKgX,GAAGhX,IACZuV,EAAOjS,KAAKgd,EAAIjZ,OACfiZ,EAAIrG,cACL,OAAgB,MAATgF,EAAgB1J,EAAS,EACxC,CACJ,CACA,SAAS8J,EAAiBhY,EAAM1H,EAAS6P,EAAI7P,EAAQ8C,OAAS,GAC1D,IAAK,IAAI8O,EAAIlK,EAAMmI,GAAK,EAAG+B,EAAIA,EAAE+H,OAAQ,CACrC,IAAK/H,EACD,OAAO,EACX,IAAKA,EAAEvR,KAAK+W,YAAa,CACrB,GAAIpX,EAAQ6P,IAAM7P,EAAQ6P,IAAM+B,EAAE5C,KAC9B,OAAO,EACXa,GACJ,CACJ,CACA,OAAO,CACX,CACA,MAAMuQ,EACF,WAAAnY,CAAY0R,EAAQkB,EAAQ1R,EAAOqS,GAC/B3T,KAAK8R,OAASA,EACd9R,KAAKgT,OAASA,EACdhT,KAAKsB,MAAQA,EACbtB,KAAK2T,MAAQA,CACjB,EAEJ,MAAM2E,UAAmBf,EACrB,QAAIpQ,GAAS,OAAOnH,KAAKxH,KAAK2O,IAAM,CACpC,QAAIhN,GAAS,OAAO6F,KAAK7H,QAAQwb,MAAQ3T,KAAK7H,QAAQ6a,OAAOA,OAAOhT,KAAKsB,MAAQ,EAAI,CACrF,MAAI/G,GAAO,OAAOyF,KAAK7H,QAAQwb,MAAQ3T,KAAK7H,QAAQ6a,OAAOA,OAAOhT,KAAKsB,MAAQ,EAAI,CACnF,WAAAlB,CAAYjI,EAAS+f,EAAS5W,GAC1B6W,QACAnY,KAAK7H,QAAUA,EACf6H,KAAKkY,QAAUA,EACflY,KAAKsB,MAAQA,EACbtB,KAAKxH,KAAOL,EAAQ6a,OAAO7V,IAAI4S,MAAM5X,EAAQ6a,OAAOA,OAAO1R,GAC/D,CACA,KAAAL,CAAMyV,EAAK1V,EAAKkQ,GACZ,IAAI,OAAE8B,GAAWhT,KAAK7H,QAClBmJ,EAAQ0R,EAAOyD,UAAUzW,KAAKsB,MAAQ,EAAG0R,EAAOA,OAAOhT,KAAKsB,MAAQ,GAAIoV,EAAK1V,EAAMhB,KAAK7H,QAAQwb,MAAOzC,GAC3G,OAAO5P,EAAQ,EAAI,KAAO,IAAIgX,EAAWtY,KAAK7H,QAAS6H,KAAMsB,EACjE,CACA,cAAIkR,GAAe,OAAOxS,KAAKiB,MAAM,EAAG,EAAG,EAAwB,CACnE,aAAI+W,GAAc,OAAOhY,KAAKiB,OAAO,EAAG,EAAG,EAAwB,CACnE,UAAAC,CAAWF,GAAO,OAAOhB,KAAKiB,MAAM,EAAGD,EAAK,EAAqB,CACjE,WAAA+W,CAAY/W,GAAO,OAAOhB,KAAKiB,OAAO,EAAGD,GAAM,EAAsB,CACrE,KAAAL,CAAMK,EAAKkQ,EAAMJ,EAAO,GACpB,GAAIA,EAAON,EAAS6H,eAChB,OAAO,KACX,IAAI,OAAErF,GAAWhT,KAAK7H,QAClBmJ,EAAQ0R,EAAOyD,UAAUzW,KAAKsB,MAAQ,EAAG0R,EAAOA,OAAOhT,KAAKsB,MAAQ,GAAI4P,EAAO,EAAI,GAAK,EAAGlQ,EAAMhB,KAAK7H,QAAQwb,MAAOzC,GACzH,OAAO5P,EAAQ,EAAI,KAAO,IAAIgX,EAAWtY,KAAK7H,QAAS6H,KAAMsB,EACjE,CACA,UAAIwQ,GACA,OAAO9R,KAAKkY,SAAWlY,KAAK7H,QAAQ2Z,OAAO6G,uBAC/C,CACA,eAAAI,CAAgBrC,GACZ,OAAO1W,KAAKkY,QAAU,KAAOlY,KAAK7H,QAAQ2Z,OAAOsG,UAAUpY,KAAK7H,QAAQmJ,MAAQoV,EAAKA,EAAK,EAAG,EACjG,CACA,eAAIjE,GACA,IAAI,OAAEO,GAAWhT,KAAK7H,QAClBsf,EAAQzE,EAAOA,OAAOhT,KAAKsB,MAAQ,GACvC,OAAImW,GAASzX,KAAKkY,QAAUlF,EAAOA,OAAOhT,KAAKkY,QAAQ5W,MAAQ,GAAK0R,EAAOA,OAAO/X,QACvE,IAAIqd,EAAWtY,KAAK7H,QAAS6H,KAAKkY,QAAST,GAC/CzX,KAAK+Y,gBAAgB,EAChC,CACA,eAAId,GACA,IAAI,OAAEjF,GAAWhT,KAAK7H,QAClBob,EAAcvT,KAAKkY,QAAUlY,KAAKkY,QAAQ5W,MAAQ,EAAI,EAC1D,OAAItB,KAAKsB,OAASiS,EACPvT,KAAK+Y,iBAAiB,GAC1B,IAAIT,EAAWtY,KAAK7H,QAAS6H,KAAKkY,QAASlF,EAAOyD,UAAUlD,EAAavT,KAAKsB,OAAQ,EAAG,EAAG,GACvG,CACA,QAAImN,GAAS,OAAO,IAAM,CAC1B,MAAAoK,GACI,IAAInI,EAAW,GAAI3P,EAAY,IAC3B,OAAEiS,GAAWhT,KAAK7H,QAClB2e,EAAS9W,KAAKsB,MAAQ,EAAGyV,EAAO/D,EAAOA,OAAOhT,KAAKsB,MAAQ,GAC/D,GAAIyV,EAAOD,EAAQ,CACf,IAAI3c,EAAO6Y,EAAOA,OAAOhT,KAAKsB,MAAQ,GACtCoP,EAAS5U,KAAKkX,EAAO6D,MAAMC,EAAQC,EAAM5c,IACzC4G,EAAUjF,KAAK,EACnB,CACA,OAAO,IAAI2U,EAAKzQ,KAAKxH,KAAMkY,EAAU3P,EAAWf,KAAKzF,GAAKyF,KAAK7F,KACnE,CAIA,QAAAE,GAAa,OAAO2F,KAAK7H,QAAQ6a,OAAOuD,YAAYvW,KAAKsB,MAAQ,EAErE,SAAS2Q,EAAU+G,GACf,IAAKA,EAAM/d,OACP,OAAO,KACX,IAAI0b,EAAO,EAAGsC,EAASD,EAAM,GAC7B,IAAK,IAAIhR,EAAI,EAAGA,EAAIgR,EAAM/d,OAAQ+M,IAAK,CACnC,IAAInI,EAAOmZ,EAAMhR,IACbnI,EAAK1F,KAAO8e,EAAO9e,MAAQ0F,EAAKtF,GAAK0e,EAAO1e,MAC5C0e,EAASpZ,EACT8W,EAAO3O,EAEf,CACA,IAAIgM,EAAOiF,aAAkB3H,GAAY2H,EAAO3X,MAAQ,EAAI,KAAO2X,EAAOnH,OACtEoH,EAAWF,EAAMnC,QAKrB,OAJI7C,EACAkF,EAASvC,GAAQ3C,EAEjBkF,EAASC,OAAOxC,EAAM,GACnB,IAAIyC,EAAcF,EAAUD,EACvC,CACA,MAAMG,EACF,WAAAhZ,CAAY4Y,EAAOnZ,GACfG,KAAKgZ,MAAQA,EACbhZ,KAAKH,KAAOA,CAChB,CACA,QAAImU,GAAS,OAAO/B,EAAUjS,KAAKgZ,MAAQ,EAyB/C,MAAMjI,EAIF,QAAI5J,GAAS,OAAOnH,KAAKxH,KAAK2O,IAAM,CAIpC,WAAA/G,CAAYP,EAIZiR,EAAO,GAYH,GAXA9Q,KAAK8Q,KAAOA,EAIZ9Q,KAAKgT,OAAS,KACdhT,KAAKqZ,MAAQ,GAIbrZ,KAAKsB,MAAQ,EACbtB,KAAKsZ,WAAa,KACdzZ,aAAgByR,EAChBtR,KAAKuZ,UAAU1Z,OAEd,CACDG,KAAKqR,MAAQxR,EAAK1H,QAAQ2Z,OAC1B9R,KAAKgT,OAASnT,EAAK1H,QACnB,IAAK,IAAIqhB,EAAI3Z,EAAKqY,QAASsB,EAAGA,EAAIA,EAAEtB,QAChClY,KAAKqZ,MAAMI,QAAQD,EAAElY,OACzBtB,KAAKsZ,WAAazZ,EAClBG,KAAK0Z,SAAS7Z,EAAKyB,MACvB,CACJ,CACA,SAAAiY,CAAU1Z,GACN,QAAKA,IAELG,KAAKqR,MAAQxR,EACbG,KAAKxH,KAAOqH,EAAKrH,KACjBwH,KAAK7F,KAAO0F,EAAK1F,KACjB6F,KAAKzF,GAAKsF,EAAKtF,IACR,EACX,CACA,QAAAmf,CAASpY,EAAO9I,GACZwH,KAAKsB,MAAQA,EACb,IAAI,MAAEqS,EAAK,OAAEX,GAAWhT,KAAKgT,OAI7B,OAHAhT,KAAKxH,KAAOA,GAAQwa,EAAO7V,IAAI4S,MAAMiD,EAAOA,OAAO1R,IACnDtB,KAAK7F,KAAOwZ,EAAQX,EAAOA,OAAO1R,EAAQ,GAC1CtB,KAAKzF,GAAKoZ,EAAQX,EAAOA,OAAO1R,EAAQ,IACjC,CACX,CAIA,KAAAqY,CAAM9Z,GACF,QAAKA,IAEDA,aAAgByR,GAChBtR,KAAKgT,OAAS,KACPhT,KAAKuZ,UAAU1Z,KAE1BG,KAAKgT,OAASnT,EAAK1H,QACZ6H,KAAK0Z,SAAS7Z,EAAKyB,MAAOzB,EAAKrH,OAC1C,CAIA,QAAA6B,GACI,OAAO2F,KAAKgT,OAAShT,KAAKgT,OAAOA,OAAOuD,YAAYvW,KAAKsB,OAAStB,KAAKqR,MAAMhX,UACjF,CAIA,UAAAuf,CAAWlD,EAAK1V,EAAKkQ,GACjB,IAAKlR,KAAKgT,OACN,OAAOhT,KAAK2Z,MAAM3Z,KAAKqR,MAAM+G,UAAU1B,EAAM,EAAI1W,KAAKqR,MAAMA,MAAMX,SAASzV,OAAS,EAAI,EAAGyb,EAAK1V,EAAKkQ,EAAMlR,KAAK8Q,OACpH,IAAI,OAAEkC,GAAWhT,KAAKgT,OAClB1R,EAAQ0R,EAAOyD,UAAUzW,KAAKsB,MAAQ,EAAG0R,EAAOA,OAAOhT,KAAKsB,MAAQ,GAAIoV,EAAK1V,EAAMhB,KAAKgT,OAAOW,MAAOzC,GAC1G,QAAI5P,EAAQ,KAEZtB,KAAKqZ,MAAMvd,KAAKkE,KAAKsB,OACdtB,KAAK0Z,SAASpY,GACzB,CAKA,UAAAkR,GAAe,OAAOxS,KAAK4Z,WAAW,EAAG,EAAG,EAAwB,CAIpE,SAAA5B,GAAc,OAAOhY,KAAK4Z,YAAY,EAAG,EAAG,EAAwB,CAIpE,UAAA1Y,CAAWF,GAAO,OAAOhB,KAAK4Z,WAAW,EAAG5Y,EAAK,EAAqB,CAItE,WAAA+W,CAAY/W,GAAO,OAAOhB,KAAK4Z,YAAY,EAAG5Y,GAAM,EAAsB,CAQ1E,KAAAL,CAAMK,EAAKkQ,EAAMJ,EAAO9Q,KAAK8Q,MACzB,OAAK9Q,KAAKgT,SAEHlC,EAAON,EAAS6H,iBAAyBrY,KAAK4Z,WAAW,EAAG5Y,EAAKkQ,GAD7DlR,KAAK2Z,MAAM3Z,KAAKqR,MAAM1Q,MAAMK,EAAKkQ,EAAMJ,GAEtD,CAIA,MAAAgB,GACI,IAAK9R,KAAKgT,OACN,OAAOhT,KAAKuZ,UAAWvZ,KAAK8Q,KAAON,EAAS6B,iBAAoBrS,KAAKqR,MAAM6G,QAAUlY,KAAKqR,MAAMS,QACpG,GAAI9R,KAAKqZ,MAAMpe,OACX,OAAO+E,KAAK0Z,SAAS1Z,KAAKqZ,MAAMtD,OACpC,IAAIjE,EAAU9R,KAAK8Q,KAAON,EAAS6B,iBAAoBrS,KAAKgT,OAAOlB,OAAS9R,KAAKgT,OAAOlB,OAAO6G,wBAE/F,OADA3Y,KAAKgT,OAAS,KACPhT,KAAKuZ,UAAUzH,EAC1B,CAIA,OAAA+H,CAAQnD,GACJ,IAAK1W,KAAKgT,OACN,QAAQhT,KAAKqR,MAAM6G,SACblY,KAAK2Z,MAAM3Z,KAAKqR,MAAM/P,MAAQ,EAAI,KAC9BtB,KAAKqR,MAAM6G,QAAQE,UAAUpY,KAAKqR,MAAM/P,MAAQoV,EAAKA,EAAK,EAAG,EAAuB1W,KAAK8Q,OACvG,IAAI,OAAEkC,GAAWhT,KAAKgT,OAAQ8G,EAAI9Z,KAAKqZ,MAAMpe,OAAS,EACtD,GAAIyb,EAAM,EAAG,CACT,IAAInD,EAAcuG,EAAI,EAAI,EAAI9Z,KAAKqZ,MAAMS,GAAK,EAC9C,GAAI9Z,KAAKsB,OAASiS,EACd,OAAOvT,KAAK0Z,SAAS1G,EAAOyD,UAAUlD,EAAavT,KAAKsB,OAAQ,EAAG,EAAG,GAC9E,KACK,CACD,IAAImW,EAAQzE,EAAOA,OAAOhT,KAAKsB,MAAQ,GACvC,GAAImW,GAASqC,EAAI,EAAI9G,EAAOA,OAAO/X,OAAS+X,EAAOA,OAAOhT,KAAKqZ,MAAMS,GAAK,IACtE,OAAO9Z,KAAK0Z,SAASjC,EAC7B,CACA,OAAOqC,EAAI,GAAI9Z,KAAK2Z,MAAM3Z,KAAKgT,OAAOlB,OAAOsG,UAAUpY,KAAKgT,OAAO1R,MAAQoV,EAAKA,EAAK,EAAG,EAAuB1W,KAAK8Q,MACxH,CAIA,WAAA2B,GAAgB,OAAOzS,KAAK6Z,QAAQ,EAAI,CAIxC,WAAA5B,GAAgB,OAAOjY,KAAK6Z,SAAS,EAAI,CACzC,UAAAE,CAAWrD,GACP,IAAIpV,EAAOwQ,GAAQ,OAAEkB,GAAWhT,KAChC,GAAIgT,EAAQ,CACR,GAAI0D,EAAM,GACN,GAAI1W,KAAKsB,MAAQ0R,EAAOA,OAAOA,OAAO/X,OAClC,OAAO,OAGX,IAAK,IAAI+M,EAAI,EAAGA,EAAIhI,KAAKsB,MAAO0G,IAC5B,GAAIgL,EAAOA,OAAOA,OAAOhL,EAAI,GAAKhI,KAAKsB,MACnC,OAAO,IAEhBA,QAAOwQ,UAAWkB,EACzB,OAEO1R,QAAO4W,QAASpG,GAAW9R,KAAKqR,OAEvC,KAAOS,IAAUxQ,QAAO4W,QAASpG,GAAWA,GACxC,GAAIxQ,GAAS,EACT,IAAK,IAAI0G,EAAI1G,EAAQoV,EAAK3X,EAAI2X,EAAM,GAAK,EAAI5E,EAAOT,MAAMX,SAASzV,OAAQ+M,GAAKjJ,EAAGiJ,GAAK0O,EAAK,CACzF,IAAIzV,EAAQ6Q,EAAOT,MAAMX,SAAS1I,GAClC,GAAKhI,KAAK8Q,KAAON,EAAS6B,kBACtBpR,aAAiB4T,IAChB5T,EAAMzI,KAAK+W,aACZiJ,EAASvX,GACT,OAAO,CACf,CAER,OAAO,CACX,CACA,IAAA+Y,CAAKtD,EAAK/V,GACN,GAAIA,GAASX,KAAK4Z,WAAWlD,EAAK,EAAG,GACjC,OAAO,EACX,OAAS,CACL,GAAI1W,KAAK6Z,QAAQnD,GACb,OAAO,EACX,GAAI1W,KAAK+Z,WAAWrD,KAAS1W,KAAK8R,SAC9B,OAAO,CACf,CACJ,CAQA,IAAAkC,CAAKrT,GAAQ,GAAQ,OAAOX,KAAKga,KAAK,EAAGrZ,EAAQ,CAOjD,IAAAsZ,CAAKtZ,GAAQ,GAAQ,OAAOX,KAAKga,MAAM,EAAGrZ,EAAQ,CAMlD,MAAAyQ,CAAOpQ,EAAKkQ,EAAO,GAEf,MAAOlR,KAAK7F,MAAQ6F,KAAKzF,KACpB2W,EAAO,EAAIlR,KAAK7F,MAAQ6G,EAAMhB,KAAK7F,KAAO6G,KAC1CkQ,GAAQ,EAAIlR,KAAKzF,IAAMyG,EAAMhB,KAAKzF,GAAKyG,KACnChB,KAAK8R,WAGd,KAAO9R,KAAK4Z,WAAW,EAAG5Y,EAAKkQ,KAC/B,OAAOlR,IACX,CAKA,QAAIH,GACA,IAAKG,KAAKgT,OACN,OAAOhT,KAAKqR,MAChB,IAAI6I,EAAQla,KAAKsZ,WAAYvL,EAAS,KAAM2F,EAAQ,EACpD,GAAIwG,GAASA,EAAM/hB,SAAW6H,KAAKgT,OAC/BnB,EAAM,IAAK,IAAIvQ,EAAQtB,KAAKsB,MAAOwY,EAAI9Z,KAAKqZ,MAAMpe,OAAQ6e,GAAK,GAAI,CAC/D,IAAK,IAAIxH,EAAI4H,EAAO5H,EAAGA,EAAIA,EAAE4F,QACzB,GAAI5F,EAAEhR,OAASA,EAAO,CAClB,GAAIA,GAAStB,KAAKsB,MACd,OAAOgR,EACXvE,EAASuE,EACToB,EAAQoG,EAAI,EACZ,MAAMjI,CACV,CACJvQ,EAAQtB,KAAKqZ,QAAQS,EACzB,CAEJ,IAAK,IAAI9R,EAAI0L,EAAO1L,EAAIhI,KAAKqZ,MAAMpe,OAAQ+M,IACvC+F,EAAS,IAAIuK,EAAWtY,KAAKgT,OAAQjF,EAAQ/N,KAAKqZ,MAAMrR,IAC5D,OAAOhI,KAAKsZ,WAAa,IAAIhB,EAAWtY,KAAKgT,OAAQjF,EAAQ/N,KAAKsB,MACtE,CAMA,QAAImN,GACA,OAAOzO,KAAKgT,OAAS,KAAOhT,KAAKqR,MAAMA,KAC3C,CAOA,OAAA3Q,CAAQC,EAAOwR,GACX,IAAK,IAAIuB,EAAQ,IAAK,CAClB,IAAIyG,GAAY,EAChB,GAAIna,KAAKxH,KAAK+W,cAA+B,IAAhB5O,EAAMX,MAAiB,CAChD,GAAIA,KAAKwS,aAAc,CACnBkB,IACA,QACJ,CACK1T,KAAKxH,KAAK+W,cACX4K,GAAY,EACpB,CACA,OAAS,CAIL,GAHIA,GAAahI,GACbA,EAAMnS,MACVma,EAAYna,KAAKxH,KAAK+W,aACjBmE,EACD,OACJ,GAAI1T,KAAKyS,cACL,MACJzS,KAAK8R,SACL4B,IACAyG,GAAY,CAChB,CACJ,CACJ,CAMA,YAAAvC,CAAazf,GACT,IAAK6H,KAAKgT,OACN,OAAO6E,EAAiB7X,KAAKH,KAAKiS,OAAQ3Z,GAC9C,IAAI,OAAE6a,GAAWhT,KAAKgT,QAAQ,MAAEjD,GAAUiD,EAAO7V,IACjD,IAAK,IAAI6K,EAAI7P,EAAQ8C,OAAS,EAAG6e,EAAI9Z,KAAKqZ,MAAMpe,OAAS,EAAG+M,GAAK,EAAG8R,IAAK,CACrE,GAAIA,EAAI,EACJ,OAAOjC,EAAiB7X,KAAKqR,MAAOlZ,EAAS6P,GACjD,IAAIxP,EAAOuX,EAAMiD,EAAOA,OAAOhT,KAAKqZ,MAAMS,KAC1C,IAAKthB,EAAK+W,YAAa,CACnB,GAAIpX,EAAQ6P,IAAM7P,EAAQ6P,IAAMxP,EAAK2O,KACjC,OAAO,EACXa,GACJ,CACJ,CACA,OAAO,CACX,EAEJ,SAASwQ,EAAS/J,GACd,OAAOA,EAAKiC,SAAS0J,MAAKzJ,GAAMA,aAAckE,IAAelE,EAAGnY,KAAK+W,aAAeiJ,EAAS7H,IACjG,CAgOA,MAAM0J,EAAgB,IAAI/J,QAC1B,SAASgE,EAASgG,EAAaza,GAC3B,IAAKya,EAAY/K,aAAe1P,aAAgBgV,GAAchV,EAAKrH,MAAQ8hB,EACvE,OAAO,EACX,IAAIzG,EAAOwG,EAAc1L,IAAI9O,GAC7B,GAAY,MAARgU,EAAc,CACdA,EAAO,EACP,IAAK,IAAI5S,KAASpB,EAAK6Q,SAAU,CAC7B,GAAIzP,EAAMzI,MAAQ8hB,KAAiBrZ,aAAiBwP,GAAO,CACvDoD,EAAO,EACP,KACJ,CACAA,GAAQS,EAASgG,EAAarZ,EAClC,CACAoZ,EAAcld,IAAI0C,EAAMgU,EAC5B,CACA,OAAOA,CACX,CACA,SAASjB,EAET0H,EAEA5J,EAAU3P,EAEV5G,EAAMI,EAENoZ,EAEA1Y,EAEAsf,EAEAC,GACI,IAAIC,EAAQ,EACZ,IAAK,IAAIzS,EAAI7N,EAAM6N,EAAIzN,EAAIyN,IACvByS,GAASnG,EAASgG,EAAa5J,EAAS1I,IAC5C,IAAI0S,EAAWvD,KAAKwD,KAAc,IAARF,EAAe,GACrC3F,EAAgB,GAAIC,EAAiB,GA2BzC,OA1BA,SAAS6F,EAAOlK,EAAU3P,EAAW5G,EAAMI,EAAIsgB,GAC3C,IAAK,IAAI7S,EAAI7N,EAAM6N,EAAIzN,GAAK,CACxB,IAAIugB,EAAY9S,EAAG+S,EAAaha,EAAUiH,GAAIgT,EAAY1G,EAASgG,EAAa5J,EAAS1I,IAEzF,IADAA,IACOA,EAAIzN,EAAIyN,IAAK,CAChB,IAAIiT,EAAW3G,EAASgG,EAAa5J,EAAS1I,IAC9C,GAAIgT,EAAYC,GAAYP,EACxB,MACJM,GAAaC,CACjB,CACA,GAAIjT,GAAK8S,EAAY,EAAG,CACpB,GAAIE,EAAYN,EAAU,CACtB,IAAIQ,EAAOxK,EAASoK,GACpBF,EAAOM,EAAKxK,SAAUwK,EAAKna,UAAW,EAAGma,EAAKxK,SAASzV,OAAQ8F,EAAU+Z,GAAaD,GACtF,QACJ,CACA/F,EAAchZ,KAAK4U,EAASoK,GAChC,KACK,CACD,IAAI7f,EAAS8F,EAAUiH,EAAI,GAAK0I,EAAS1I,EAAI,GAAG/M,OAAS8f,EACzDjG,EAAchZ,KAAK8W,EAAa0H,EAAa5J,EAAU3P,EAAW+Z,EAAW9S,EAAG+S,EAAY9f,EAAQ,KAAMuf,GAC9G,CACAzF,EAAejZ,KAAKif,EAAaF,EAASlH,EAC9C,CACJ,CACAiH,CAAOlK,EAAU3P,EAAW5G,EAAMI,EAAI,IAC9BggB,GAASC,GAAQ1F,EAAeC,EAAgB9Z,EAC5D,CAkKA,MAAMkgB,EAWF,UAAAC,CAAWC,EAAOC,EAAWC,GAIzB,MAHoB,iBAATF,IACPA,EAAQ,IAAIG,EAAYH,IAC5BE,EAAUA,EAAwCA,EAAOtgB,OAASsgB,EAAO1X,KAAI6T,GAAK,IAAInK,EAAMmK,EAAEvd,KAAMud,EAAEnd,MAAO,CAAC,IAAIgT,EAAM,EAAG,IAAxG,CAAC,IAAIA,EAAM,EAAG8N,EAAMpgB,SAChC+E,KAAKyb,YAAYJ,EAAOC,GAAa,GAAIC,EACpD,CAIA,KAAA9a,CAAM4a,EAAOC,EAAWC,GACpB,IAAI9a,EAAQT,KAAKob,WAAWC,EAAOC,EAAWC,GAC9C,OAAS,CACL,IAAIG,EAAOjb,EAAMkb,UACjB,GAAID,EACA,OAAOA,CACf,CACJ,EAEJ,MAAMF,EACF,WAAApb,CAAY0G,GACR9G,KAAK8G,OAASA,CAClB,CACA,UAAI7L,GAAW,OAAO+E,KAAK8G,OAAO7L,MAAQ,CAC1C,KAAA2gB,CAAMzhB,GAAQ,OAAO6F,KAAK8G,OAAO+P,MAAM1c,EAAO,CAC9C,cAAI0hB,GAAe,OAAO,CAAO,CACjC,IAAAC,CAAK3hB,EAAMI,GAAM,OAAOyF,KAAK8G,OAAO+P,MAAM1c,EAAMI,EAAK,EAuCpC,IAAIiT,EAAS,CAAEE,SAAS,ICrvD7C,MAAMqO,EAIF,WAAA3b,CAIA2J,EAKAsP,EAIA2C,EAQAC,EAIAjb,EAMAkb,EAOAlJ,EASAmJ,EAIAC,EAIA9N,EAAY,EAQZwD,GACI9R,KAAK+J,EAAIA,EACT/J,KAAKqZ,MAAQA,EACbrZ,KAAKgc,MAAQA,EACbhc,KAAKic,UAAYA,EACjBjc,KAAKgB,IAAMA,EACXhB,KAAKkc,MAAQA,EACblc,KAAKgT,OAASA,EACdhT,KAAKmc,WAAaA,EAClBnc,KAAKoc,WAAaA,EAClBpc,KAAKsO,UAAYA,EACjBtO,KAAK8R,OAASA,CAClB,CAIA,QAAAzX,GACI,MAAO,IAAI2F,KAAKqZ,MAAMhW,QAAO,CAACgZ,EAAGrU,IAAMA,EAAI,GAAK,IAAGiO,OAAOjW,KAAKgc,WAAWhc,KAAKgB,MAAMhB,KAAKkc,MAAQ,IAAMlc,KAAKkc,MAAQ,IACzH,CAKA,YAAOvI,CAAM5J,EAAGiS,EAAOhb,EAAM,GACzB,IAAIsb,EAAKvS,EAAEvO,OAAOrD,QAClB,OAAO,IAAI4jB,EAAMhS,EAAG,GAAIiS,EAAOhb,EAAKA,EAAK,EAAG,GAAI,EAAGsb,EAAK,IAAIC,EAAaD,EAAIA,EAAG3I,OAAS,KAAM,EAAG,KACtG,CAOA,WAAIxb,GAAY,OAAO6H,KAAKoc,WAAapc,KAAKoc,WAAWjkB,QAAU,IAAM,CAMzE,SAAAqkB,CAAUR,EAAOrI,GACb3T,KAAKqZ,MAAMvd,KAAKkE,KAAKgc,MAAOrI,EAAO3T,KAAKmc,WAAanc,KAAKgT,OAAO/X,QACjE+E,KAAKgc,MAAQA,CACjB,CAKA,MAAAS,CAAOC,GACH,IAAI3J,EACJ,IAAIW,EAAQgJ,GAAU,GAAkClkB,EAAgB,MAATkkB,GAC3D,OAAElhB,GAAWwE,KAAK+J,EAClB4S,EAAkB3c,KAAKic,UAAYjc,KAAKgB,IAAM,GAC9C2b,GACA3c,KAAK4c,aAAa5c,KAAKgB,KAC3B,IAAI6b,EAAQrhB,EAAOshB,kBAAkBtkB,GAGrC,GAFIqkB,IACA7c,KAAKkc,OAASW,GACL,GAATnJ,EAOA,OANA1T,KAAKwc,UAAUhhB,EAAOuhB,QAAQ/c,KAAKgc,MAAOxjB,GAAM,GAAOwH,KAAKic,WAGxDzjB,EAAOgD,EAAOwhB,eACdhd,KAAKid,UAAUzkB,EAAMwH,KAAKic,UAAWjc,KAAKic,UAAWU,EAAkB,EAAI,GAAG,QAClF3c,KAAKkd,cAAc1kB,EAAMwH,KAAKic,WAQlC,IAAInG,EAAO9V,KAAKqZ,MAAMpe,OAAwB,GAAbyY,EAAQ,IAAoB,OAATgJ,EAAwC,EAAI,GAC5F/I,EAAQmC,EAAO9V,KAAKqZ,MAAMvD,EAAO,GAAK9V,KAAK+J,EAAEwR,OAAO,GAAGphB,KAAM0Z,EAAO7T,KAAKic,UAAYtI,EAIrFE,GAAQ,OAAqF,QAA5Cd,EAAK/S,KAAK+J,EAAEvO,OAAOyX,QAAQlD,MAAMvX,UAA0B,IAAPua,OAAgB,EAASA,EAAGxD,eAC7HoE,GAAS3T,KAAK+J,EAAEoT,uBAChBnd,KAAK+J,EAAEqT,oBACPpd,KAAK+J,EAAEsT,qBAAuBxJ,GAEzB7T,KAAK+J,EAAEsT,qBAAuBxJ,IACnC7T,KAAK+J,EAAEqT,kBAAoB,EAC3Bpd,KAAK+J,EAAEoT,sBAAwBxJ,EAC/B3T,KAAK+J,EAAEsT,qBAAuBxJ,IAGtC,IAAIsI,EAAarG,EAAO9V,KAAKqZ,MAAMvD,EAAO,GAAK,EAAGwH,EAAQtd,KAAKmc,WAAanc,KAAKgT,OAAO/X,OAASkhB,EAEjG,GAAI3jB,EAAOgD,EAAOwhB,eAA2B,OAATN,EAA0C,CAC1E,IAAI1b,EAAMxF,EAAO+hB,UAAUvd,KAAKgc,MAAO,GAA6Bhc,KAAKgB,IAAMhB,KAAKic,UACpFjc,KAAKid,UAAUzkB,EAAMmb,EAAO3S,EAAKsc,EAAQ,GAAG,EAChD,CACA,GAAa,OAATZ,EACA1c,KAAKgc,MAAQhc,KAAKqZ,MAAMvD,OAEvB,CACD,IAAI0H,EAAcxd,KAAKqZ,MAAMvD,EAAO,GACpC9V,KAAKgc,MAAQxgB,EAAOuhB,QAAQS,EAAahlB,GAAM,EACnD,CACA,KAAOwH,KAAKqZ,MAAMpe,OAAS6a,GACvB9V,KAAKqZ,MAAMtD,MACf/V,KAAKkd,cAAc1kB,EAAMmb,EAC7B,CAKA,SAAAsJ,CAAUQ,EAAM9J,EAAOC,EAAKC,EAAO,EAAG6J,GAAW,GAC7C,GAAY,GAARD,KACEzd,KAAKqZ,MAAMpe,QAAU+E,KAAKqZ,MAAMrZ,KAAKqZ,MAAMpe,OAAS,GAAK+E,KAAKgT,OAAO/X,OAAS+E,KAAKmc,YAAa,CAElG,IAAIrD,EAAM9Y,KAAMiP,EAAMjP,KAAKgT,OAAO/X,OAKlC,GAJW,GAAPgU,GAAY6J,EAAIhH,SAChB7C,EAAM6J,EAAIqD,WAAarD,EAAIhH,OAAOqK,WAClCrD,EAAMA,EAAIhH,QAEV7C,EAAM,GAA4B,GAAvB6J,EAAI9F,OAAO/D,EAAM,IAA0B6J,EAAI9F,OAAO/D,EAAM,IAAM,EAAG,CAChF,GAAI0E,GAASC,EACT,OACJ,GAAIkF,EAAI9F,OAAO/D,EAAM,IAAM0E,EAEvB,YADAmF,EAAI9F,OAAO/D,EAAM,GAAK2E,EAG9B,CACJ,CACA,GAAK8J,GAAY1d,KAAKgB,KAAO4S,EAGxB,CACD,IAAItS,EAAQtB,KAAKgT,OAAO/X,OACxB,GAAIqG,EAAQ,GAA+B,GAA1BtB,KAAKgT,OAAO1R,EAAQ,GAAwB,CACzD,IAAIqc,GAAW,EACf,IAAK,IAAI9L,EAAOvQ,EAAOuQ,EAAO,GAAK7R,KAAKgT,OAAOnB,EAAO,GAAK+B,EAAK/B,GAAQ,EACpE,GAAI7R,KAAKgT,OAAOnB,EAAO,IAAM,EAAG,CAC5B8L,GAAW,EACX,KACJ,CAEJ,GAAIA,EACA,KAAOrc,EAAQ,GAAKtB,KAAKgT,OAAO1R,EAAQ,GAAKsS,GAEzC5T,KAAKgT,OAAO1R,GAAStB,KAAKgT,OAAO1R,EAAQ,GACzCtB,KAAKgT,OAAO1R,EAAQ,GAAKtB,KAAKgT,OAAO1R,EAAQ,GAC7CtB,KAAKgT,OAAO1R,EAAQ,GAAKtB,KAAKgT,OAAO1R,EAAQ,GAC7CtB,KAAKgT,OAAO1R,EAAQ,GAAKtB,KAAKgT,OAAO1R,EAAQ,GAC7CA,GAAS,EACLuS,EAAO,IACPA,GAAQ,EAExB,CACA7T,KAAKgT,OAAO1R,GAASmc,EACrBzd,KAAKgT,OAAO1R,EAAQ,GAAKqS,EACzB3T,KAAKgT,OAAO1R,EAAQ,GAAKsS,EACzB5T,KAAKgT,OAAO1R,EAAQ,GAAKuS,CAC7B,MA5BI7T,KAAKgT,OAAOlX,KAAK2hB,EAAM9J,EAAOC,EAAKC,EA6B3C,CAKA,KAAA+J,CAAMlB,EAAQlkB,EAAMmb,EAAOC,GACvB,GAAa,OAAT8I,EACA1c,KAAKwc,UAAmB,MAATE,EAAuC1c,KAAKgB,UAE1D,GAAc,OAAT0b,EAaN1c,KAAKgB,IAAM4S,EACX5T,KAAK6d,aAAarlB,EAAMmb,GACpBnb,GAAQwH,KAAK+J,EAAEvO,OAAOsiB,SACtB9d,KAAKgT,OAAOlX,KAAKtD,EAAMmb,EAAOC,EAAK,OAhBY,CACnD,IAAImK,EAAYrB,GAAQ,OAAElhB,GAAWwE,KAAK+J,GACtC6J,EAAM5T,KAAKgB,KAAOxI,GAAQgD,EAAOsiB,WACjC9d,KAAKgB,IAAM4S,EACNpY,EAAO+hB,UAAUQ,EAAW,KAC7B/d,KAAKic,UAAYrI,IAEzB5T,KAAKwc,UAAUuB,EAAWpK,GAC1B3T,KAAK6d,aAAarlB,EAAMmb,GACpBnb,GAAQgD,EAAOsiB,SACf9d,KAAKgT,OAAOlX,KAAKtD,EAAMmb,EAAOC,EAAK,EAC3C,CAOJ,CAKA,KAAAoK,CAAMtB,EAAQ1I,EAAMiK,EAAWC,GACd,MAATxB,EACA1c,KAAKyc,OAAOC,GAEZ1c,KAAK4d,MAAMlB,EAAQ1I,EAAMiK,EAAWC,EAC5C,CAKA,OAAAC,CAAQtmB,EAAOmc,GACX,IAAI1S,EAAQtB,KAAK+J,EAAEoJ,OAAOlY,OAAS,GAC/BqG,EAAQ,GAAKtB,KAAK+J,EAAEoJ,OAAO7R,IAAUzJ,KACrCmI,KAAK+J,EAAEoJ,OAAOrX,KAAKjE,GACnByJ,KAEJ,IAAIqS,EAAQ3T,KAAKgB,IACjBhB,KAAKic,UAAYjc,KAAKgB,IAAM2S,EAAQ9b,EAAMoD,OAC1C+E,KAAKwc,UAAUxI,EAAML,GACrB3T,KAAKgT,OAAOlX,KAAKwF,EAAOqS,EAAO3T,KAAKic,WAAY,GAC5Cjc,KAAKoc,YACLpc,KAAKoe,cAAcpe,KAAKoc,WAAWiC,QAAQC,MAAMte,KAAKoc,WAAWjkB,QAASN,EAAOmI,KAAMA,KAAK+J,EAAEwU,OAAOC,MAAMxe,KAAKgB,IAAMnJ,EAAMoD,SACpI,CAOA,KAAA3B,GACI,IAAIwY,EAAS9R,KACTye,EAAM3M,EAAOkB,OAAO/X,OAKxB,KAAOwjB,EAAM,GAAK3M,EAAOkB,OAAOyL,EAAM,GAAK3M,EAAOmK,WAC9CwC,GAAO,EACX,IAAIzL,EAASlB,EAAOkB,OAAO6D,MAAM4H,GAAM3I,EAAOhE,EAAOqK,WAAasC,EAElE,KAAO3M,GAAUgE,GAAQhE,EAAOqK,YAC5BrK,EAASA,EAAOA,OACpB,OAAO,IAAIiK,EAAM/b,KAAK+J,EAAG/J,KAAKqZ,MAAMxC,QAAS7W,KAAKgc,MAAOhc,KAAKic,UAAWjc,KAAKgB,IAAKhB,KAAKkc,MAAOlJ,EAAQ8C,EAAM9V,KAAKoc,WAAYpc,KAAKsO,UAAWwD,EAClJ,CAKA,eAAA4M,CAAgB1K,EAAMkK,GAClB,IAAIS,EAAS3K,GAAQhU,KAAK+J,EAAEvO,OAAOsiB,QAC/Ba,GACA3e,KAAKid,UAAUjJ,EAAMhU,KAAKgB,IAAKkd,EAAS,GAC5Cle,KAAKid,UAAU,EAAkBjd,KAAKgB,IAAKkd,EAASS,EAAS,EAAI,GACjE3e,KAAKgB,IAAMhB,KAAKic,UAAYiC,EAC5Ble,KAAKkc,OAAS,GAClB,CAOA,QAAA0C,CAASnB,GACL,IAAK,IAAIoB,EAAM,IAAIC,EAAe9e,QAAS,CACvC,IAAI0c,EAAS1c,KAAK+J,EAAEvO,OAAOujB,UAAUF,EAAI7C,MAAO,IAAqChc,KAAK+J,EAAEvO,OAAOwjB,UAAUH,EAAI7C,MAAOyB,GACxH,GAAc,GAAVf,EACA,OAAO,EACX,KAAc,MAATA,GACD,OAAO,EACXmC,EAAIpC,OAAOC,EACf,CACJ,CAMA,eAAAuC,CAAgBjL,GACZ,GAAIhU,KAAKqZ,MAAMpe,QAAU,IACrB,MAAO,GACX,IAAIikB,EAAalf,KAAK+J,EAAEvO,OAAO0jB,WAAWlf,KAAKgc,OAC/C,GAAIkD,EAAWjkB,OAAS,GAAgC+E,KAAKqZ,MAAMpe,QAAU,IAA0C,CACnH,IAAIkkB,EAAO,GACX,IAAK,IAAWzX,EAAPM,EAAI,EAAMA,EAAIkX,EAAWjkB,OAAQ+M,GAAK,GACtCN,EAAIwX,EAAWlX,EAAI,KAAOhI,KAAKgc,OAAShc,KAAK+J,EAAEvO,OAAOwjB,UAAUtX,EAAGsM,IACpEmL,EAAKrjB,KAAKojB,EAAWlX,GAAIN,GAEjC,GAAI1H,KAAKqZ,MAAMpe,OAAS,IACpB,IAAK,IAAI+M,EAAI,EAAGmX,EAAKlkB,OAAS,GAAgC+M,EAAIkX,EAAWjkB,OAAQ+M,GAAK,EAAG,CACzF,IAAIN,EAAIwX,EAAWlX,EAAI,GAClBmX,EAAK/E,MAAK,CAACgF,EAAGpX,IAAW,EAAJA,GAAUoX,GAAK1X,KACrCyX,EAAKrjB,KAAKojB,EAAWlX,GAAIN,EACjC,CACJwX,EAAaC,CACjB,CACA,IAAIpR,EAAS,GACb,IAAK,IAAI/F,EAAI,EAAGA,EAAIkX,EAAWjkB,QAAU8S,EAAO9S,OAAS,EAAyB+M,GAAK,EAAG,CACtF,IAAIN,EAAIwX,EAAWlX,EAAI,GACvB,GAAIN,GAAK1H,KAAKgc,MACV,SACJ,IAAI3C,EAAQrZ,KAAK1G,QACjB+f,EAAMmD,UAAU9U,EAAG1H,KAAKgB,KACxBqY,EAAM4D,UAAU,EAAkB5D,EAAMrY,IAAKqY,EAAMrY,IAAK,GAAG,GAC3DqY,EAAMwE,aAAaqB,EAAWlX,GAAIhI,KAAKgB,KACvCqY,EAAM4C,UAAYjc,KAAKgB,IACvBqY,EAAM6C,OAAS,IACfnO,EAAOjS,KAAKud,EAChB,CACA,OAAOtL,CACX,CAMA,WAAAsR,GACI,IAAI,OAAE7jB,GAAWwE,KAAK+J,EAClB0S,EAASjhB,EAAOujB,UAAU/e,KAAKgc,MAAO,GAC1C,KAAc,MAATS,GACD,OAAO,EACX,IAAKjhB,EAAO8jB,YAAYtf,KAAKgc,MAAOS,GAAS,CACzC,IAAI/I,EAAQ+I,GAAU,GAAkCgB,EAAgB,MAAThB,EAC3DnkB,EAAS0H,KAAKqZ,MAAMpe,OAAiB,EAARyY,EACjC,GAAIpb,EAAS,GAAKkD,EAAOuhB,QAAQ/c,KAAKqZ,MAAM/gB,GAASmlB,GAAM,GAAS,EAAG,CACnE,IAAI8B,EAASvf,KAAKwf,sBAClB,GAAc,MAAVD,EACA,OAAO,EACX9C,EAAS8C,CACb,CACAvf,KAAKid,UAAU,EAAkBjd,KAAKgB,IAAKhB,KAAKgB,IAAK,GAAG,GACxDhB,KAAKkc,OAAS,GAClB,CAGA,OAFAlc,KAAKic,UAAYjc,KAAKgB,IACtBhB,KAAKyc,OAAOA,IACL,CACX,CAMA,mBAAA+C,GACI,IAAI,OAAEhkB,GAAWwE,KAAK+J,EAAG0V,EAAO,GAC5BC,EAAU,CAAC1D,EAAOtI,KAClB,IAAI+L,EAAK5e,SAASmb,GAGlB,OADAyD,EAAK3jB,KAAKkgB,GACHxgB,EAAOmkB,WAAW3D,GAAQU,IAC7B,GAAa,OAATA,QACC,GAAa,MAATA,EAAwC,CAC7C,IAAIkD,GAAUlD,GAAU,IAAoChJ,EAC5D,GAAIkM,EAAS,EAAG,CACZ,IAAInC,EAAgB,MAATf,EAAuCpkB,EAAS0H,KAAKqZ,MAAMpe,OAAkB,EAAT2kB,EAC/E,GAAItnB,GAAU,GAAKkD,EAAOuhB,QAAQ/c,KAAKqZ,MAAM/gB,GAASmlB,GAAM,IAAU,EAClE,OAAQmC,GAAU,GAAoC,MAAgCnC,CAC9F,CACJ,KACK,CACD,IAAI7N,EAAQ8P,EAAQhD,EAAQhJ,EAAQ,GACpC,GAAa,MAAT9D,EACA,OAAOA,CACf,IACF,EAEN,OAAO8P,EAAQ1f,KAAKgc,MAAO,EAC/B,CAIA,QAAA6D,GACI,MAAQ7f,KAAK+J,EAAEvO,OAAO+hB,UAAUvd,KAAKgc,MAAO,IACxC,IAAKhc,KAAKqf,cAAe,CACrBrf,KAAKid,UAAU,EAAkBjd,KAAKgB,IAAKhB,KAAKgB,IAAK,GAAG,GACxD,KACJ,CAEJ,OAAOhB,IACX,CAMA,WAAI8f,GACA,GAAyB,GAArB9f,KAAKqZ,MAAMpe,OACX,OAAO,EACX,IAAI,OAAEO,GAAWwE,KAAK+J,EACtB,OAAgF,OAAzEvO,EAAO+D,KAAK/D,EAAOujB,UAAU/e,KAAKgc,MAAO,MAC3CxgB,EAAOujB,UAAU/e,KAAKgc,MAAO,EACtC,CAMA,OAAA+D,GACI/f,KAAKid,UAAU,EAAkBjd,KAAKgB,IAAKhB,KAAKgB,IAAK,GAAG,GACxDhB,KAAKgc,MAAQhc,KAAKqZ,MAAM,GACxBrZ,KAAKqZ,MAAMpe,OAAS,CACxB,CAIA,SAAA+kB,CAAUC,GACN,GAAIjgB,KAAKgc,OAASiE,EAAMjE,OAAShc,KAAKqZ,MAAMpe,QAAUglB,EAAM5G,MAAMpe,OAC9D,OAAO,EACX,IAAK,IAAI+M,EAAI,EAAGA,EAAIhI,KAAKqZ,MAAMpe,OAAQ+M,GAAK,EACxC,GAAIhI,KAAKqZ,MAAMrR,IAAMiY,EAAM5G,MAAMrR,GAC7B,OAAO,EACf,OAAO,CACX,CAIA,UAAIxM,GAAW,OAAOwE,KAAK+J,EAAEvO,MAAQ,CAKrC,cAAA0kB,CAAeC,GAAa,OAAOngB,KAAK+J,EAAEvO,OAAO4kB,QAAQtR,MAAMqR,EAAY,CAC3E,YAAAtC,CAAaJ,EAAM9J,GACX3T,KAAKoc,YACLpc,KAAKoe,cAAcpe,KAAKoc,WAAWiC,QAAQT,MAAM5d,KAAKoc,WAAWjkB,QAASslB,EAAMzd,KAAMA,KAAK+J,EAAEwU,OAAOC,MAAM7K,IAClH,CACA,aAAAuJ,CAAcO,EAAM9J,GACZ3T,KAAKoc,YACLpc,KAAKoe,cAAcpe,KAAKoc,WAAWiC,QAAQ5B,OAAOzc,KAAKoc,WAAWjkB,QAASslB,EAAMzd,KAAMA,KAAK+J,EAAEwU,OAAOC,MAAM7K,IACnH,CAIA,WAAA0M,GACI,IAAI9K,EAAOvV,KAAKgT,OAAO/X,OAAS,GAC5Bsa,EAAO,IAA2B,GAAtBvV,KAAKgT,OAAOuC,KACxBvV,KAAKgT,OAAOlX,KAAKkE,KAAKoc,WAAWkE,KAAMtgB,KAAKgB,IAAKhB,KAAKgB,KAAM,EACpE,CAIA,aAAAuf,GACI,IAAIhL,EAAOvV,KAAKgT,OAAO/X,OAAS,GAC5Bsa,EAAO,IAA2B,GAAtBvV,KAAKgT,OAAOuC,KACxBvV,KAAKgT,OAAOlX,KAAKkE,KAAKsO,UAAWtO,KAAKgB,IAAKhB,KAAKgB,KAAM,EAC9D,CACA,aAAAod,CAAcjmB,GACV,GAAIA,GAAW6H,KAAKoc,WAAWjkB,QAAS,CACpC,IAAIqoB,EAAQ,IAAIjE,EAAavc,KAAKoc,WAAWiC,QAASlmB,GAClDqoB,EAAMF,MAAQtgB,KAAKoc,WAAWkE,MAC9BtgB,KAAKqgB,cACTrgB,KAAKoc,WAAaoE,CACtB,CACJ,CAIA,YAAA5D,CAAatO,GACLA,EAAYtO,KAAKsO,YACjBtO,KAAKugB,gBACLvgB,KAAKsO,UAAYA,EAEzB,CAIA,KAAAmS,GACQzgB,KAAKoc,YAAcpc,KAAKoc,WAAWiC,QAAQqC,QAC3C1gB,KAAKqgB,cACLrgB,KAAKsO,UAAY,GACjBtO,KAAKugB,eACb,EAEJ,MAAMhE,EACF,WAAAnc,CAAYie,EAASlmB,GACjB6H,KAAKqe,QAAUA,EACfre,KAAK7H,QAAUA,EACf6H,KAAKsgB,KAAOjC,EAAQqC,OAASrC,EAAQiC,KAAKnoB,GAAW,CACzD,EAIJ,MAAM2mB,EACF,WAAA1e,CAAYuT,GACR3T,KAAK2T,MAAQA,EACb3T,KAAKgc,MAAQrI,EAAMqI,MACnBhc,KAAKqZ,MAAQ1F,EAAM0F,MACnBrZ,KAAK8V,KAAO9V,KAAKqZ,MAAMpe,MAC3B,CACA,MAAAwhB,CAAOC,GACH,IAAIe,EAAgB,MAATf,EAAuChJ,EAAQgJ,GAAU,GACvD,GAAThJ,GACI1T,KAAKqZ,OAASrZ,KAAK2T,MAAM0F,QACzBrZ,KAAKqZ,MAAQrZ,KAAKqZ,MAAMxC,SAC5B7W,KAAKqZ,MAAMvd,KAAKkE,KAAKgc,MAAO,EAAG,GAC/Bhc,KAAK8V,MAAQ,GAGb9V,KAAK8V,MAAsB,GAAbpC,EAAQ,GAE1B,IAAIiN,EAAO3gB,KAAK2T,MAAM5J,EAAEvO,OAAOuhB,QAAQ/c,KAAKqZ,MAAMrZ,KAAK8V,KAAO,GAAI2H,GAAM,GACxEzd,KAAKgc,MAAQ2E,CACjB,EAIJ,MAAMC,EACF,WAAAxgB,CAAYiZ,EAAOrY,EAAKM,GACpBtB,KAAKqZ,MAAQA,EACbrZ,KAAKgB,IAAMA,EACXhB,KAAKsB,MAAQA,EACbtB,KAAKgT,OAASqG,EAAMrG,OACF,GAAdhT,KAAKsB,OACLtB,KAAK6gB,WACb,CACA,aAAOhS,CAAOwK,EAAOrY,EAAMqY,EAAM8C,WAAa9C,EAAMrG,OAAO/X,QACvD,OAAO,IAAI2lB,EAAkBvH,EAAOrY,EAAKA,EAAMqY,EAAM8C,WACzD,CACA,SAAA0E,GACI,IAAI7M,EAAOhU,KAAKqZ,MAAMvH,OACV,MAARkC,IACAhU,KAAKsB,MAAQtB,KAAKqZ,MAAM8C,WAAanI,EAAKmI,WAC1Cnc,KAAKqZ,MAAQrF,EACbhU,KAAKgT,OAASgB,EAAKhB,OAE3B,CACA,MAAI7d,GAAO,OAAO6K,KAAKgT,OAAOhT,KAAKsB,MAAQ,EAAI,CAC/C,SAAIqS,GAAU,OAAO3T,KAAKgT,OAAOhT,KAAKsB,MAAQ,EAAI,CAClD,OAAIsS,GAAQ,OAAO5T,KAAKgT,OAAOhT,KAAKsB,MAAQ,EAAI,CAChD,QAAIuS,GAAS,OAAO7T,KAAKgT,OAAOhT,KAAKsB,MAAQ,EAAI,CACjD,IAAA0S,GACIhU,KAAKsB,OAAS,EACdtB,KAAKgB,KAAO,EACM,GAAdhB,KAAKsB,OACLtB,KAAK6gB,WACb,CACA,IAAA1M,GACI,OAAO,IAAIyM,EAAkB5gB,KAAKqZ,MAAOrZ,KAAKgB,IAAKhB,KAAKsB,MAC5D,EAKJ,SAASwf,EAAYzF,EAAO0F,EAAOrM,aAC/B,GAAoB,iBAAT2G,EACP,OAAOA,EACX,IAAI7R,EAAQ,KACZ,IAAK,IAAIxI,EAAM,EAAGggB,EAAM,EAAGhgB,EAAMqa,EAAMpgB,QAAS,CAC5C,IAAIpD,EAAQ,EACZ,OAAS,CACL,IAAImc,EAAOqH,EAAM4F,WAAWjgB,KAAQkgB,GAAO,EAC3C,GAAY,KAARlN,EAAqC,CACrCnc,EAAQ,MACR,KACJ,CACImc,GAAQ,IACRA,IACAA,GAAQ,IACRA,IACJ,IAAImN,EAAQnN,EAAO,GAMnB,GALImN,GAAS,KACTA,GAAS,GACTD,GAAO,GAEXrpB,GAASspB,EACLD,EACA,MACJrpB,GAAS,EACb,CACI2R,EACAA,EAAMwX,KAASnpB,EAEf2R,EAAQ,IAAIuX,EAAKlpB,EACzB,CACA,OAAO2R,CACX,CAEA,MAAM4X,EACF,WAAAhhB,GACIJ,KAAK2T,OAAS,EACd3T,KAAKnI,OAAS,EACdmI,KAAK4T,KAAO,EACZ5T,KAAKqhB,UAAY,EACjBrhB,KAAKsO,UAAY,EACjBtO,KAAKshB,KAAO,EACZthB,KAAK7H,QAAU,CACnB,EAEJ,MAAMopB,EAAY,IAAIH,EAOtB,MAAMI,EAIF,WAAAphB,CAIAib,EAIAE,GACIvb,KAAKqb,MAAQA,EACbrb,KAAKub,OAASA,EAIdvb,KAAK4b,MAAQ,GAIb5b,KAAKyhB,SAAW,EAIhBzhB,KAAK0hB,OAAS,GACd1hB,KAAK2hB,UAAY,EAKjB3hB,KAAKgU,MAAQ,EAIbhU,KAAK4hB,MAAQL,EACbvhB,KAAK6hB,WAAa,EAClB7hB,KAAKgB,IAAMhB,KAAK8hB,SAAWvG,EAAO,GAAGphB,KACrC6F,KAAK8I,MAAQyS,EAAO,GACpBvb,KAAK4T,IAAM2H,EAAOA,EAAOtgB,OAAS,GAAGV,GACrCyF,KAAK+hB,UACT,CAIA,aAAAC,CAAcnH,EAAQoH,GAClB,IAAInZ,EAAQ9I,KAAK8I,MAAOxH,EAAQtB,KAAK6hB,WACjC7gB,EAAMhB,KAAKgB,IAAM6Z,EACrB,KAAO7Z,EAAM8H,EAAM3O,MAAM,CACrB,IAAKmH,EACD,OAAO,KACX,IAAI0S,EAAOhU,KAAKub,SAASja,GACzBN,GAAO8H,EAAM3O,KAAO6Z,EAAKzZ,GACzBuO,EAAQkL,CACZ,CACA,KAAOiO,EAAQ,EAAIjhB,EAAM8H,EAAMvO,GAAKyG,GAAO8H,EAAMvO,IAAI,CACjD,GAAI+G,GAAStB,KAAKub,OAAOtgB,OAAS,EAC9B,OAAO,KACX,IAAI+Y,EAAOhU,KAAKub,SAASja,GACzBN,GAAOgT,EAAK7Z,KAAO2O,EAAMvO,GACzBuO,EAAQkL,CACZ,CACA,OAAOhT,CACX,CAIA,OAAAkhB,CAAQlhB,GACJ,GAAIA,GAAOhB,KAAK8I,MAAM3O,MAAQ6G,EAAMhB,KAAK8I,MAAMvO,GAC3C,OAAOyG,EACX,IAAK,IAAI8H,KAAS9I,KAAKub,OACnB,GAAIzS,EAAMvO,GAAKyG,EACX,OAAOmW,KAAKC,IAAIpW,EAAK8H,EAAM3O,MACnC,OAAO6F,KAAK4T,GAChB,CAYA,IAAAuO,CAAKtH,GACD,IAAkC7Z,EAAK+M,EAAnCqU,EAAMpiB,KAAKyhB,SAAW5G,EAC1B,GAAIuH,GAAO,GAAKA,EAAMpiB,KAAK4b,MAAM3gB,OAC7B+F,EAAMhB,KAAKgB,IAAM6Z,EACjB9M,EAAS/N,KAAK4b,MAAMqF,WAAWmB,OAE9B,CACD,IAAIC,EAAWriB,KAAKgiB,cAAcnH,EAAQ,GAC1C,GAAgB,MAAZwH,EACA,OAAQ,EAEZ,GADArhB,EAAMqhB,EACFrhB,GAAOhB,KAAK2hB,WAAa3gB,EAAMhB,KAAK2hB,UAAY3hB,KAAK0hB,OAAOzmB,OAC5D8S,EAAS/N,KAAK0hB,OAAOT,WAAWjgB,EAAMhB,KAAK2hB,eAE1C,CACD,IAAI3Z,EAAIhI,KAAK6hB,WAAY/Y,EAAQ9I,KAAK8I,MACtC,KAAOA,EAAMvO,IAAMyG,GACf8H,EAAQ9I,KAAKub,SAASvT,GAC1BhI,KAAK0hB,OAAS1hB,KAAKqb,MAAMO,MAAM5b,KAAK2hB,UAAY3gB,GAC5CA,EAAMhB,KAAK0hB,OAAOzmB,OAAS6N,EAAMvO,KACjCyF,KAAK0hB,OAAS1hB,KAAK0hB,OAAO7K,MAAM,EAAG/N,EAAMvO,GAAKyG,IAClD+M,EAAS/N,KAAK0hB,OAAOT,WAAW,EACpC,CACJ,CAGA,OAFIjgB,GAAOhB,KAAK4hB,MAAMtT,YAClBtO,KAAK4hB,MAAMtT,UAAYtN,EAAM,GAC1B+M,CACX,CAMA,WAAAuU,CAAYV,EAAOW,EAAY,GAC3B,IAAI3O,EAAM2O,EAAYviB,KAAKgiB,cAAcO,GAAY,GAAKviB,KAAKgB,IAC/D,GAAW,MAAP4S,GAAeA,EAAM5T,KAAK4hB,MAAMjO,MAChC,MAAM,IAAI9F,WAAW,2BACzB7N,KAAK4hB,MAAM/pB,MAAQ+pB,EACnB5hB,KAAK4hB,MAAMhO,IAAMA,CACrB,CAIA,aAAA4O,CAAcZ,EAAOjN,GACjB3U,KAAK4hB,MAAM/pB,MAAQ+pB,EACnB5hB,KAAK4hB,MAAMhO,IAAMe,CACrB,CACA,QAAA8N,GACI,GAAIziB,KAAKgB,KAAOhB,KAAK2hB,WAAa3hB,KAAKgB,IAAMhB,KAAK2hB,UAAY3hB,KAAK0hB,OAAOzmB,OAAQ,CAC9E,IAAI,MAAE2gB,EAAK,SAAEkG,GAAa9hB,KAC1BA,KAAK4b,MAAQ5b,KAAK0hB,OAClB1hB,KAAK8hB,SAAW9hB,KAAK2hB,UACrB3hB,KAAK0hB,OAAS9F,EACd5b,KAAK2hB,UAAYG,EACjB9hB,KAAKyhB,SAAWzhB,KAAKgB,IAAMhB,KAAK8hB,QACpC,KACK,CACD9hB,KAAK0hB,OAAS1hB,KAAK4b,MACnB5b,KAAK2hB,UAAY3hB,KAAK8hB,SACtB,IAAIY,EAAY1iB,KAAKqb,MAAMO,MAAM5b,KAAKgB,KAClC4S,EAAM5T,KAAKgB,IAAM0hB,EAAUznB,OAC/B+E,KAAK4b,MAAQhI,EAAM5T,KAAK8I,MAAMvO,GAAKmoB,EAAU7L,MAAM,EAAG7W,KAAK8I,MAAMvO,GAAKyF,KAAKgB,KAAO0hB,EAClF1iB,KAAK8hB,SAAW9hB,KAAKgB,IACrBhB,KAAKyhB,SAAW,CACpB,CACJ,CACA,QAAAM,GACI,OAAI/hB,KAAKyhB,UAAYzhB,KAAK4b,MAAM3gB,SAC5B+E,KAAKyiB,WACDziB,KAAKyhB,UAAYzhB,KAAK4b,MAAM3gB,QACrB+E,KAAKgU,MAAQ,EAErBhU,KAAKgU,KAAOhU,KAAK4b,MAAMqF,WAAWjhB,KAAKyhB,SAClD,CAKA,OAAA9F,CAAQnC,EAAI,GAER,IADAxZ,KAAKyhB,UAAYjI,EACVxZ,KAAKgB,IAAMwY,GAAKxZ,KAAK8I,MAAMvO,IAAI,CAClC,GAAIyF,KAAK6hB,YAAc7hB,KAAKub,OAAOtgB,OAAS,EACxC,OAAO+E,KAAK2iB,UAChBnJ,GAAKxZ,KAAK8I,MAAMvO,GAAKyF,KAAKgB,IAC1BhB,KAAK8I,MAAQ9I,KAAKub,SAASvb,KAAK6hB,YAChC7hB,KAAKgB,IAAMhB,KAAK8I,MAAM3O,IAC1B,CAIA,OAHA6F,KAAKgB,KAAOwY,EACRxZ,KAAKgB,KAAOhB,KAAK4hB,MAAMtT,YACvBtO,KAAK4hB,MAAMtT,UAAYtO,KAAKgB,IAAM,GAC/BhB,KAAK+hB,UAChB,CACA,OAAAY,GAII,OAHA3iB,KAAKgB,IAAMhB,KAAK8hB,SAAW9hB,KAAK4T,IAChC5T,KAAK8I,MAAQ9I,KAAKub,OAAOvb,KAAK6hB,WAAa7hB,KAAKub,OAAOtgB,OAAS,GAChE+E,KAAK4b,MAAQ,GACN5b,KAAKgU,MAAQ,CACxB,CAIA,KAAAwK,CAAMxd,EAAK4gB,GAUP,GATIA,GACA5hB,KAAK4hB,MAAQA,EACbA,EAAMjO,MAAQ3S,EACd4gB,EAAMtT,UAAYtN,EAAM,EACxB4gB,EAAM/pB,MAAQ+pB,EAAMP,UAAY,GAGhCrhB,KAAK4hB,MAAQL,EAEbvhB,KAAKgB,KAAOA,EAAK,CAEjB,GADAhB,KAAKgB,IAAMA,EACPA,GAAOhB,KAAK4T,IAEZ,OADA5T,KAAK2iB,UACE3iB,KAEX,KAAOgB,EAAMhB,KAAK8I,MAAM3O,MACpB6F,KAAK8I,MAAQ9I,KAAKub,SAASvb,KAAK6hB,YACpC,KAAO7gB,GAAOhB,KAAK8I,MAAMvO,IACrByF,KAAK8I,MAAQ9I,KAAKub,SAASvb,KAAK6hB,YAChC7gB,GAAOhB,KAAK8hB,UAAY9gB,EAAMhB,KAAK8hB,SAAW9hB,KAAK4b,MAAM3gB,OACzD+E,KAAKyhB,SAAWzgB,EAAMhB,KAAK8hB,UAG3B9hB,KAAK4b,MAAQ,GACb5b,KAAKyhB,SAAW,GAEpBzhB,KAAK+hB,UACT,CACA,OAAO/hB,IACX,CAIA,IAAA8b,CAAK3hB,EAAMI,GACP,GAAIJ,GAAQ6F,KAAK8hB,UAAYvnB,GAAMyF,KAAK8hB,SAAW9hB,KAAK4b,MAAM3gB,OAC1D,OAAO+E,KAAK4b,MAAM/E,MAAM1c,EAAO6F,KAAK8hB,SAAUvnB,EAAKyF,KAAK8hB,UAC5D,GAAI3nB,GAAQ6F,KAAK2hB,WAAapnB,GAAMyF,KAAK2hB,UAAY3hB,KAAK0hB,OAAOzmB,OAC7D,OAAO+E,KAAK0hB,OAAO7K,MAAM1c,EAAO6F,KAAK2hB,UAAWpnB,EAAKyF,KAAK2hB,WAC9D,GAAIxnB,GAAQ6F,KAAK8I,MAAM3O,MAAQI,GAAMyF,KAAK8I,MAAMvO,GAC5C,OAAOyF,KAAKqb,MAAMS,KAAK3hB,EAAMI,GACjC,IAAIwT,EAAS,GACb,IAAK,IAAI2J,KAAK1X,KAAKub,OAAQ,CACvB,GAAI7D,EAAEvd,MAAQI,EACV,MACAmd,EAAEnd,GAAKJ,IACP4T,GAAU/N,KAAKqb,MAAMS,KAAK3E,KAAKC,IAAIM,EAAEvd,KAAMA,GAAOgd,KAAKyL,IAAIlL,EAAEnd,GAAIA,IACzE,CACA,OAAOwT,CACX,EAKJ,MAAM8U,EACF,WAAAziB,CAAYb,EAAMpK,GACd6K,KAAKT,KAAOA,EACZS,KAAK7K,GAAKA,CACd,CACA,KAAAysB,CAAMvG,EAAOhC,GACT,IAAI,OAAE7d,GAAW6d,EAAMtP,GA+E/B,SAAmBxK,EAAM8b,EAAOhC,EAAOlL,EAAO2U,EAAWC,GACrD,IAAI/G,EAAQ,EAAGgH,EAAY,GAAK7U,GAAO,QAAEiS,GAAY/G,EAAMtP,EAAEvO,OAC7DqW,EAAM,KACGmR,EAAYzjB,EAAKyc,IADX,CAGX,IAAIiH,EAAS1jB,EAAKyc,EAAQ,GAI1B,IAAK,IAAIhU,EAAIgU,EAAQ,EAAGhU,EAAIib,EAAQjb,GAAK,EACrC,IAAKzI,EAAKyI,EAAI,GAAKgb,GAAa,EAAG,CAC/B,IAAIvF,EAAOle,EAAKyI,GAChB,GAAIoY,EAAQ8C,OAAOzF,MACQ,GAAtBpC,EAAMuG,MAAM/pB,OAAewjB,EAAMuG,MAAM/pB,OAAS4lB,GAC7C0F,EAAU1F,EAAMpC,EAAMuG,MAAM/pB,MAAOirB,EAAWC,IAAc,CAChE1H,EAAMiH,YAAY7E,GAClB,KACJ,CACJ,CACJ,IAAIzJ,EAAOqH,EAAMrH,KAAMoP,EAAM,EAAGC,EAAO9jB,EAAKyc,EAAQ,GAEpD,KAAIX,EAAMrH,KAAO,GAAKqP,EAAOD,GAAsC,OAA/B7jB,EAAK0jB,EAAgB,EAAPI,EAAW,IAA7D,CAKA,KAAOD,EAAMC,GAAO,CAChB,IAAIC,EAAOF,EAAMC,GAAS,EACtB/hB,EAAQ2hB,EAASK,GAAOA,GAAO,GAC/BnpB,EAAOoF,EAAK+B,GAAQ/G,EAAKgF,EAAK+B,EAAQ,IAAM,MAChD,GAAI0S,EAAO7Z,EACPkpB,EAAOC,MACN,MAAItP,GAAQzZ,GAEZ,CACDyhB,EAAQzc,EAAK+B,EAAQ,GACrB+Z,EAAMM,UACN,SAAS9J,CACb,CALIuR,EAAME,EAAM,CAKhB,CACJ,CACA,KAhBA,CAFItH,EAAQzc,EAAK0jB,EAAgB,EAAPI,EAAW,EAmBzC,CACJ,CAxHQE,CAAUvjB,KAAKT,KAAM8b,EAAOhC,EAAOrZ,KAAK7K,GAAIqG,EAAO+D,KAAM/D,EAAOgoB,eACpE,EAwHJ,SAASC,EAAWlkB,EAAMoU,EAAO8J,GAC7B,IAAK,IAAezJ,EAAXhM,EAAI2L,EAAiC,QAAnBK,EAAOzU,EAAKyI,IAA4BA,IAC/D,GAAIgM,GAAQyJ,EACR,OAAOzV,EAAI2L,EACnB,OAAQ,CACZ,CACA,SAASwP,EAAUvB,EAAO3H,EAAMyJ,EAAWC,GACvC,IAAIC,EAAQH,EAAWC,EAAWC,EAAa1J,GAC/C,OAAO2J,EAAQ,GAAKH,EAAWC,EAAWC,EAAa/B,GAASgC,CACpE,CA/HAf,EAAWgB,UAAUC,WAAajB,EAAWgB,UAAUpuB,SAAWotB,EAAWgB,UAAU7T,QAAS,EA+BzD6S,EAAWgB,UAAUpuB,SAAWotB,EAAWgB,UAAU7T,QAAS,EAmGrG,MAAM+T,EAA4B,oBAAXC,SAA0BA,QAAQC,KAAO,YAAYrT,KAAKoT,QAAQC,IAAIC,KAC7F,IAAIC,EAAW,KACf,SAASC,EAAM3V,EAAMzN,EAAKkQ,GACtB,IAAIL,EAASpC,EAAKoC,OAAOL,EAAS6B,kBAElC,IADAxB,EAAOO,OAAOpQ,KAEV,KAAMkQ,EAAO,EAAIL,EAAOkH,YAAY/W,GAAO6P,EAAO3P,WAAWF,IACzD,OAAS,CACL,IAAKkQ,EAAO,EAAIL,EAAOtW,GAAKyG,EAAM6P,EAAO1W,KAAO6G,KAAS6P,EAAOrY,KAAK8W,QACjE,OAAO4B,EAAO,EAAIiG,KAAKC,IAAI,EAAGD,KAAKyL,IAAI/R,EAAOtW,GAAK,EAAGyG,EAAM,KACtDmW,KAAKyL,IAAInU,EAAKxT,OAAQkc,KAAKC,IAAIvG,EAAO1W,KAAO,EAAG6G,EAAM,KAChE,GAAIkQ,EAAO,EAAIL,EAAOoH,cAAgBpH,EAAO4B,cACzC,MACJ,IAAK5B,EAAOiB,SACR,OAAOZ,EAAO,EAAI,EAAIzC,EAAKxT,MACnC,CAEZ,CACA,MAAM,EACF,WAAAmF,CAAYkb,EAAWrI,GACnBjT,KAAKsb,UAAYA,EACjBtb,KAAKiT,QAAUA,EACfjT,KAAKgI,EAAI,EACThI,KAAKqkB,SAAW,KAChBrkB,KAAKskB,UAAY,EACjBtkB,KAAKukB,QAAU,EACfvkB,KAAKwkB,MAAQ,GACbxkB,KAAK2T,MAAQ,GACb3T,KAAKsB,MAAQ,GACbtB,KAAKykB,cACT,CACA,YAAAA,GACI,IAAIC,EAAK1kB,KAAKqkB,SAAWrkB,KAAKgI,GAAKhI,KAAKsb,UAAUrgB,OAAS,KAAO+E,KAAKsb,UAAUtb,KAAKgI,KACtF,GAAI0c,EAAI,CAGJ,IAFA1kB,KAAKskB,SAAWI,EAAGC,UAAYP,EAAMM,EAAGjW,KAAMiW,EAAGvqB,KAAOuqB,EAAG7J,OAAQ,GAAK6J,EAAG7J,OAAS6J,EAAGvqB,KACvF6F,KAAKukB,OAASG,EAAGE,QAAUR,EAAMM,EAAGjW,KAAMiW,EAAGnqB,GAAKmqB,EAAG7J,QAAS,GAAK6J,EAAG7J,OAAS6J,EAAGnqB,GAC3EyF,KAAKwkB,MAAMvpB,QACd+E,KAAKwkB,MAAMzO,MACX/V,KAAK2T,MAAMoC,MACX/V,KAAKsB,MAAMyU,MAEf/V,KAAKwkB,MAAM1oB,KAAK4oB,EAAGjW,MACnBzO,KAAK2T,MAAM7X,MAAM4oB,EAAG7J,QACpB7a,KAAKsB,MAAMxF,KAAK,GAChBkE,KAAKie,UAAYje,KAAKskB,QAC1B,MAEItkB,KAAKie,UAAY,GAEzB,CAEA,MAAA4G,CAAO7jB,GACH,GAAIA,EAAMhB,KAAKie,UACX,OAAO,KACX,KAAOje,KAAKqkB,UAAYrkB,KAAKukB,QAAUvjB,GACnChB,KAAKykB,eACT,IAAKzkB,KAAKqkB,SACN,OAAO,KACX,OAAS,CACL,IAAI9O,EAAOvV,KAAKwkB,MAAMvpB,OAAS,EAC/B,GAAIsa,EAAO,EAEP,OADAvV,KAAKykB,eACE,KAEX,IAAIxV,EAAMjP,KAAKwkB,MAAMjP,GAAOjU,EAAQtB,KAAKsB,MAAMiU,GAC/C,GAAIjU,GAAS2N,EAAIyB,SAASzV,OAAQ,CAC9B+E,KAAKwkB,MAAMzO,MACX/V,KAAK2T,MAAMoC,MACX/V,KAAKsB,MAAMyU,MACX,QACJ,CACA,IAAI/B,EAAO/E,EAAIyB,SAASpP,GACpBqS,EAAQ3T,KAAK2T,MAAM4B,GAAQtG,EAAIlO,UAAUO,GAC7C,GAAIqS,EAAQ3S,EAER,OADAhB,KAAKie,UAAYtK,EACV,KAEX,GAAIK,aAAgBvD,EAAM,CACtB,GAAIkD,GAAS3S,EAAK,CACd,GAAI2S,EAAQ3T,KAAKskB,SACb,OAAO,KACX,IAAI1Q,EAAMD,EAAQK,EAAK/Y,OACvB,GAAI2Y,GAAO5T,KAAKukB,OAAQ,CACpB,IAAIjW,EAAY0F,EAAKxM,KAAKgG,EAASc,WACnC,IAAKA,GAAasF,EAAMtF,EAAYtO,KAAKqkB,SAAS9pB,GAC9C,OAAOyZ,CACf,CACJ,CACAhU,KAAKsB,MAAMiU,KACP5B,EAAQK,EAAK/Y,QAAUkc,KAAKC,IAAIpX,KAAKskB,SAAUtjB,KAC/ChB,KAAKwkB,MAAM1oB,KAAKkY,GAChBhU,KAAK2T,MAAM7X,KAAK6X,GAChB3T,KAAKsB,MAAMxF,KAAK,GAExB,MAEIkE,KAAKsB,MAAMiU,KACXvV,KAAKie,UAAYtK,EAAQK,EAAK/Y,MAEtC,CACJ,EAEJ,MAAM6pB,EACF,WAAA1kB,CAAY5E,EAAQ+iB,GAChBve,KAAKue,OAASA,EACdve,KAAK+kB,OAAS,GACd/kB,KAAKglB,UAAY,KACjBhlB,KAAKilB,QAAU,GACfjlB,KAAK+kB,OAASvpB,EAAO0pB,WAAWrhB,KAAIwY,GAAK,IAAI+E,GACjD,CACA,UAAA+D,CAAW9L,GACP,IAAI+L,EAAc,EACdC,EAAO,MACP,OAAE7pB,GAAW6d,EAAMtP,GAAG,WAAEmb,GAAe1pB,EACvC8lB,EAAO9lB,EAAOujB,UAAU1F,EAAM2C,MAAO,GACrC7jB,EAAUkhB,EAAM+C,WAAa/C,EAAM+C,WAAWkE,KAAO,EACrDhS,EAAY,EAChB,IAAK,IAAItG,EAAI,EAAGA,EAAIkd,EAAWjqB,OAAQ+M,IAAK,CACxC,KAAM,GAAKA,EAAKsZ,GACZ,SACJ,IAAIgE,EAAYJ,EAAWld,GAAI4Z,EAAQ5hB,KAAK+kB,OAAO/c,GACnD,KAAIqd,GAASC,EAAU7vB,aAEnB6vB,EAAUxB,YAAclC,EAAMjO,OAAS0F,EAAMrY,KAAO4gB,EAAMN,MAAQA,GAAQM,EAAMzpB,SAAWA,KAC3F6H,KAAKulB,kBAAkB3D,EAAO0D,EAAWjM,GACzCuI,EAAMN,KAAOA,EACbM,EAAMzpB,QAAUA,GAEhBypB,EAAMtT,UAAYsT,EAAMhO,IAAM,KAC9BtF,EAAY6I,KAAKC,IAAIwK,EAAMtT,UAAWA,IACvB,GAAfsT,EAAM/pB,OAA2B,CACjC,IAAIse,EAAaiP,EAIjB,GAHIxD,EAAMP,UAAY,IAClB+D,EAAcplB,KAAKwlB,WAAWnM,EAAOuI,EAAMP,SAAUO,EAAMhO,IAAKwR,IACpEA,EAAcplB,KAAKwlB,WAAWnM,EAAOuI,EAAM/pB,MAAO+pB,EAAMhO,IAAKwR,IACxDE,EAAUtV,SACXqV,EAAOzD,EACHwD,EAAcjP,GACd,KAEZ,CACJ,CACA,KAAOnW,KAAKilB,QAAQhqB,OAASmqB,GACzBplB,KAAKilB,QAAQlP,MAUjB,OATIzH,GACA+K,EAAMuD,aAAatO,GAClB+W,GAAQhM,EAAMrY,KAAOhB,KAAKue,OAAO3K,MAClCyR,EAAO,IAAIjE,EACXiE,EAAKxtB,MAAQwhB,EAAMtP,EAAEvO,OAAOiqB,QAC5BJ,EAAK1R,MAAQ0R,EAAKzR,IAAMyF,EAAMrY,IAC9BokB,EAAcplB,KAAKwlB,WAAWnM,EAAOgM,EAAKxtB,MAAOwtB,EAAKzR,IAAKwR,IAE/DplB,KAAKglB,UAAYK,EACVrlB,KAAKilB,OAChB,CACA,YAAAS,CAAarM,GACT,GAAIrZ,KAAKglB,UACL,OAAOhlB,KAAKglB,UAChB,IAAIK,EAAO,IAAIjE,GAAa,IAAEpgB,EAAG,EAAE+I,GAAMsP,EAIzC,OAHAgM,EAAK1R,MAAQ3S,EACbqkB,EAAKzR,IAAMuD,KAAKyL,IAAI5hB,EAAM,EAAG+I,EAAEwU,OAAO3K,KACtCyR,EAAKxtB,MAAQmJ,GAAO+I,EAAEwU,OAAO3K,IAAM7J,EAAEvO,OAAOiqB,QAAU,EAC/CJ,CACX,CACA,iBAAAE,CAAkB3D,EAAO0D,EAAWjM,GAChC,IAAI1F,EAAQ3T,KAAKue,OAAO2D,QAAQ7I,EAAMrY,KAEtC,GADAskB,EAAU1D,MAAM5hB,KAAKue,OAAOC,MAAM7K,EAAOiO,GAAQvI,GAC7CuI,EAAM/pB,OAAS,EAAG,CAClB,IAAI,OAAE2D,GAAW6d,EAAMtP,EACvB,IAAK,IAAI/B,EAAI,EAAGA,EAAIxM,EAAOmqB,YAAY1qB,OAAQ+M,IAC3C,GAAIxM,EAAOmqB,YAAY3d,IAAM4Z,EAAM/pB,MAAO,CACtC,IAAIkW,EAASvS,EAAOoqB,aAAa5d,GAAGhI,KAAKue,OAAOzC,KAAK8F,EAAMjO,MAAOiO,EAAMhO,KAAMyF,GAC9E,GAAItL,GAAU,GAAKsL,EAAMtP,EAAEvO,OAAO4kB,QAAQ8C,OAAOnV,GAAU,GAAI,CAC7C,EAATA,EAGD6T,EAAMP,SAAWtT,GAAU,EAF3B6T,EAAM/pB,MAAQkW,GAAU,EAG5B,KACJ,CACJ,CACR,MAEI6T,EAAM/pB,MAAQ,EACd+pB,EAAMhO,IAAM5T,KAAKue,OAAO2D,QAAQvO,EAAQ,EAEhD,CACA,SAAAkS,CAAUnJ,EAAQkF,EAAOhO,EAAKtS,GAE1B,IAAK,IAAI0G,EAAI,EAAGA,EAAI1G,EAAO0G,GAAK,EAC5B,GAAIhI,KAAKilB,QAAQjd,IAAM0U,EACnB,OAAOpb,EAIf,OAHAtB,KAAKilB,QAAQ3jB,KAAWob,EACxB1c,KAAKilB,QAAQ3jB,KAAWsgB,EACxB5hB,KAAKilB,QAAQ3jB,KAAWsS,EACjBtS,CACX,CACA,UAAAkkB,CAAWnM,EAAOuI,EAAOhO,EAAKtS,GAC1B,IAAI,MAAE0a,GAAU3C,GAAO,OAAE7d,GAAW6d,EAAMtP,GAAG,KAAExK,GAAS/D,EACxD,IAAK,IAAI2B,EAAM,EAAGA,EAAM,EAAGA,IACvB,IAAK,IAAI6K,EAAIxM,EAAOujB,UAAU/C,EAAO7e,EAAM,EAA0B,IAA8B6K,GAAK,EAAG,CACvG,GAAe,OAAXzI,EAAKyI,GAA2B,CAChC,GAAmB,GAAfzI,EAAKyI,EAAI,GAGR,CACY,GAAT1G,GAA6B,GAAf/B,EAAKyI,EAAI,KACvB1G,EAAQtB,KAAK6lB,UAAU7P,GAAKzW,EAAMyI,EAAI,GAAI4Z,EAAOhO,EAAKtS,IAC1D,KACJ,CANI0G,EAAIgO,GAAKzW,EAAMyI,EAAI,EAO3B,CACIzI,EAAKyI,IAAM4Z,IACXtgB,EAAQtB,KAAK6lB,UAAU7P,GAAKzW,EAAMyI,EAAI,GAAI4Z,EAAOhO,EAAKtS,GAC9D,CAEJ,OAAOA,CACX,EAEJ,MAAMwkB,EACF,WAAA1lB,CAAY5E,EAAQ6f,EAAOC,EAAWC,GAClCvb,KAAKxE,OAASA,EACdwE,KAAKqb,MAAQA,EACbrb,KAAKub,OAASA,EACdvb,KAAK+lB,WAAa,EAClB/lB,KAAKgmB,YAAc,KACnBhmB,KAAKimB,YAAc,EACnBjmB,KAAKmT,OAAS,GACdnT,KAAKkmB,UAAY,KACjBlmB,KAAKmd,uBAAyB,EAC9Bnd,KAAKqd,qBAAuB,EAC5Brd,KAAKod,kBAAoB,EACzBpd,KAAKue,OAAS,IAAIiD,EAAYnG,EAAOE,GACrCvb,KAAK+kB,OAAS,IAAID,EAAWtpB,EAAQwE,KAAKue,QAC1Cve,KAAKmmB,QAAU3qB,EAAOyT,IAAI,GAC1B,IAAI,KAAE9U,GAASohB,EAAO,GACtBvb,KAAKomB,OAAS,CAACrK,EAAMpI,MAAM3T,KAAMxE,EAAOyT,IAAI,GAAI9U,IAChD6F,KAAKsb,UAAYA,EAAUrgB,QAAU+E,KAAKue,OAAO3K,IAAMzZ,EAA6B,EAAtBqB,EAAO6qB,aAC/D,IAAI,EAAe/K,EAAW9f,EAAOyX,SAAW,IAC1D,CACA,aAAIqT,GACA,OAAOtmB,KAAKimB,WAChB,CAOA,OAAAtK,GACI,IAGI4K,EAASC,EAHTJ,EAASpmB,KAAKomB,OAAQplB,EAAMhB,KAAKimB,YAEjCQ,EAAYzmB,KAAKomB,OAAS,GAS9B,GAAIpmB,KAAKod,kBAAoB,KAAmE,GAAjBgJ,EAAOnrB,OAAa,CAC/F,IAAKyM,GAAK0e,EACV,KAAO1e,EAAE2X,eAAiB3X,EAAE2R,MAAMpe,QAAUyM,EAAE2R,MAAM3R,EAAE2R,MAAMpe,OAAS,IAAM+E,KAAKmd,wBAChFnd,KAAKod,kBAAoBpd,KAAKqd,qBAAuB,CACzD,CAIA,IAAK,IAAIrV,EAAI,EAAGA,EAAIoe,EAAOnrB,OAAQ+M,IAAK,CACpC,IAAIqR,EAAQ+M,EAAOpe,GACnB,OAAS,CAEL,GADAhI,KAAK+kB,OAAOC,UAAY,KACpB3L,EAAMrY,IAAMA,EACZylB,EAAU3qB,KAAKud,OAEd,IAAIrZ,KAAK0mB,aAAarN,EAAOoN,EAAWL,GACzC,SAEC,CACIG,IACDA,EAAU,GACVC,EAAgB,IAEpBD,EAAQzqB,KAAKud,GACb,IAAIsN,EAAM3mB,KAAK+kB,OAAOW,aAAarM,GACnCmN,EAAc1qB,KAAK6qB,EAAI9uB,MAAO8uB,EAAI/S,IACtC,EACA,KACJ,CACJ,CACA,IAAK6S,EAAUxrB,OAAQ,CACnB,IAAI2rB,EAAWL,GAuhB3B,SAAsBH,GAClB,IAAIjH,EAAO,KACX,IAAK,IAAI9F,KAAS+M,EAAQ,CACtB,IAAIG,EAAUlN,EAAMtP,EAAEmc,WACjB7M,EAAMrY,KAAOqY,EAAMtP,EAAEwU,OAAO3K,KAAkB,MAAX2S,GAAmBlN,EAAMrY,IAAMulB,IACnElN,EAAMtP,EAAEvO,OAAO+hB,UAAUlE,EAAM2C,MAAO,MACpCmD,GAAQA,EAAKjD,MAAQ7C,EAAM6C,SAC7BiD,EAAO9F,EACf,CACA,OAAO8F,CACX,CAjiBsC0H,CAAaN,GACvC,GAAIK,EAGA,OAFI7C,GACAzlB,QAAQC,IAAI,eAAiByB,KAAK8mB,QAAQF,IACvC5mB,KAAK+mB,YAAYH,GAE5B,GAAI5mB,KAAKxE,OAAOklB,OAGZ,MAFIqD,GAAWwC,GACXjoB,QAAQC,IAAI,qBAAuByB,KAAK+kB,OAAOC,UAAYhlB,KAAKxE,OAAOwrB,QAAQhnB,KAAK+kB,OAAOC,UAAUntB,OAAS,SAC5G,IAAIovB,YAAY,eAAiBjmB,GAEtChB,KAAK+lB,aACN/lB,KAAK+lB,WAAa,EAC1B,CACA,GAAI/lB,KAAK+lB,YAAcQ,EAAS,CAC5B,IAAIK,EAA6B,MAAlB5mB,KAAKkmB,WAAqBK,EAAQ,GAAGvlB,IAAMhB,KAAKkmB,UAAYK,EAAQ,GAC7EvmB,KAAKknB,YAAYX,EAASC,EAAeC,GAC/C,GAAIG,EAGA,OAFI7C,GACAzlB,QAAQC,IAAI,gBAAkByB,KAAK8mB,QAAQF,IACxC5mB,KAAK+mB,YAAYH,EAAS/G,WAEzC,CACA,GAAI7f,KAAK+lB,WAAY,CACjB,IAAIoB,EAAkC,GAAnBnnB,KAAK+lB,WAAkB,EAAsB,EAAlB/lB,KAAK+lB,WACnD,GAAIU,EAAUxrB,OAASksB,EAEnB,IADAV,EAAU/sB,MAAK,CAACC,EAAGqd,IAAMA,EAAEkF,MAAQviB,EAAEuiB,QAC9BuK,EAAUxrB,OAASksB,GACtBV,EAAU1Q,MAEd0Q,EAAUrM,MAAK1S,GAAKA,EAAEuU,UAAYjb,KAClChB,KAAK+lB,YACb,MACK,GAAIU,EAAUxrB,OAAS,EAAG,CAI3BmsB,EAAO,IAAK,IAAIpf,EAAI,EAAGA,EAAIye,EAAUxrB,OAAS,EAAG+M,IAAK,CAClD,IAAIqR,EAAQoN,EAAUze,GACtB,IAAK,IAAI6N,EAAI7N,EAAI,EAAG6N,EAAI4Q,EAAUxrB,OAAQ4a,IAAK,CAC3C,IAAIoK,EAAQwG,EAAU5Q,GACtB,GAAIwD,EAAM2G,UAAUC,IAChB5G,EAAMrG,OAAO/X,OAAS,KAAsCglB,EAAMjN,OAAO/X,OAAS,IAAoC,CACtH,MAAMoe,EAAM6C,MAAQ+D,EAAM/D,OAAW7C,EAAMrG,OAAO/X,OAASglB,EAAMjN,OAAO/X,QAAW,GAG9E,CACDwrB,EAAUtN,OAAOnR,IAAK,GACtB,SAASof,CACb,CALIX,EAAUtN,OAAOtD,IAAK,EAM9B,CACJ,CACJ,CACI4Q,EAAUxrB,OAAS,IACnBwrB,EAAUtN,OAAO,GAA4BsN,EAAUxrB,OAAS,GACxE,CACA+E,KAAKimB,YAAcQ,EAAU,GAAGzlB,IAChC,IAAK,IAAIgH,EAAI,EAAGA,EAAIye,EAAUxrB,OAAQ+M,IAC9Bye,EAAUze,GAAGhH,IAAMhB,KAAKimB,cACxBjmB,KAAKimB,YAAcQ,EAAUze,GAAGhH,KACxC,OAAO,IACX,CACA,MAAA4U,CAAO5U,GACH,GAAsB,MAAlBhB,KAAKkmB,WAAqBlmB,KAAKkmB,UAAYllB,EAC3C,MAAM,IAAI6M,WAAW,gCACzB7N,KAAKkmB,UAAYllB,CACrB,CAKA,YAAA0lB,CAAarN,EAAO+M,EAAQ9sB,GACxB,IAAIqa,EAAQ0F,EAAMrY,KAAK,OAAExF,GAAWwE,KAChC8V,EAAOiO,EAAU/jB,KAAK8mB,QAAQzN,GAAS,OAAS,GACpD,GAAsB,MAAlBrZ,KAAKkmB,WAAqBvS,EAAQ3T,KAAKkmB,UACvC,OAAO7M,EAAMgG,cAAgBhG,EAAQ,KACzC,GAAIrZ,KAAKsb,UAAW,CAChB,IAAI+L,EAAWhO,EAAM+C,YAAc/C,EAAM+C,WAAWiC,QAAQqC,OAAQ4G,EAASD,EAAWhO,EAAM+C,WAAWkE,KAAO,EAChH,IAAK,IAAIiH,EAASvnB,KAAKsb,UAAUuJ,OAAOlR,GAAQ4T,GAAS,CACrD,IAAIvrB,EAAQgE,KAAKxE,OAAOyX,QAAQlD,MAAMwX,EAAO/uB,KAAKrD,KAAOoyB,EAAO/uB,KAAOgD,EAAOuhB,QAAQ1D,EAAM2C,MAAOuL,EAAO/uB,KAAKrD,KAAO,EACtH,GAAI6G,GAAS,GAAKurB,EAAOtsB,UAAYosB,IAAaE,EAAO/f,KAAKgG,EAASa,cAAgB,IAAMiZ,GAIzF,OAHAjO,EAAM8E,QAAQoJ,EAAQvrB,GAClB+nB,GACAzlB,QAAQC,IAAIuX,EAAO9V,KAAK8mB,QAAQzN,GAAS,kBAAkB7d,EAAOwrB,QAAQO,EAAO/uB,KAAKrD,SACnF,EAEX,KAAMoyB,aAAkB9W,IAAmC,GAA1B8W,EAAO7W,SAASzV,QAAessB,EAAOxmB,UAAU,GAAK,EAClF,MACJ,IAAI4Q,EAAQ4V,EAAO7W,SAAS,GAC5B,KAAIiB,aAAiBlB,GAA+B,GAAvB8W,EAAOxmB,UAAU,IAG1C,MAFAwmB,EAAS5V,CAGjB,CACJ,CACA,IAAI6V,EAAgBhsB,EAAOujB,UAAU1F,EAAM2C,MAAO,GAClD,GAAIwL,EAAgB,EAIhB,OAHAnO,EAAMoD,OAAO+K,GACTzD,GACAzlB,QAAQC,IAAIuX,EAAO9V,KAAK8mB,QAAQzN,GAAS,uBAAuB7d,EAAOwrB,QAAwB,MAAhBQ,QAC5E,EAEX,GAAInO,EAAMA,MAAMpe,QAAU,KACtB,KAAOoe,EAAMA,MAAMpe,OAAS,KAAwBoe,EAAMgG,gBAE9D,IAAI4F,EAAUjlB,KAAK+kB,OAAOI,WAAW9L,GACrC,IAAK,IAAIrR,EAAI,EAAGA,EAAIid,EAAQhqB,QAAS,CACjC,IAAIyhB,EAASuI,EAAQjd,KAAMyV,EAAOwH,EAAQjd,KAAM4L,EAAMqR,EAAQjd,KAC1DuN,EAAOvN,GAAKid,EAAQhqB,SAAW3B,EAC/BmuB,EAAalS,EAAO8D,EAAQA,EAAM/f,QAClC+rB,EAAOrlB,KAAK+kB,OAAOC,UAKvB,GAJAyC,EAAWzJ,MAAMtB,EAAQe,EAAM4H,EAAOA,EAAK1R,MAAQ8T,EAAWzmB,IAAK4S,GAC/DmQ,GACAzlB,QAAQC,IAAIuX,EAAO9V,KAAK8mB,QAAQW,GAAc,SAAmB,MAAT/K,EAClD,aAAalhB,EAAOwrB,QAAiB,MAATtK,KADqE,eACrBlhB,EAAOwrB,QAAQvJ,QAAW9J,IAAQ8T,GAAcpO,EAAQ,GAAK,cAC/I9D,EACA,OAAO,EACFkS,EAAWzmB,IAAM2S,EACtByS,EAAOtqB,KAAK2rB,GAEZnuB,EAAMwC,KAAK2rB,EACnB,CACA,OAAO,CACX,CAIA,YAAAC,CAAarO,EAAOoN,GAChB,IAAIzlB,EAAMqY,EAAMrY,IAChB,OAAS,CACL,IAAKhB,KAAK0mB,aAAarN,EAAO,KAAM,MAChC,OAAO,EACX,GAAIA,EAAMrY,IAAMA,EAEZ,OADA2mB,EAAetO,EAAOoN,IACf,CAEf,CACJ,CACA,WAAAS,CAAYd,EAAQrB,EAAQ0B,GACxB,IAAIG,EAAW,KAAMgB,GAAY,EACjC,IAAK,IAAI5f,EAAI,EAAGA,EAAIoe,EAAOnrB,OAAQ+M,IAAK,CACpC,IAAIqR,EAAQ+M,EAAOpe,GAAI4Z,EAAQmD,EAAO/c,GAAK,GAAI6f,EAAW9C,EAAkB,GAAV/c,GAAK,IACnE8N,EAAOiO,EAAU/jB,KAAK8mB,QAAQzN,GAAS,OAAS,GACpD,GAAIA,EAAMyG,QAAS,CACf,GAAI8H,EACA,SAMJ,GALAA,GAAY,EACZvO,EAAM0G,UACFgE,GACAzlB,QAAQC,IAAIuX,EAAO9V,KAAK8mB,QAAQzN,GAAS,gBAClCrZ,KAAK0nB,aAAarO,EAAOoN,GAEhC,QACR,CACA,IAAIqB,EAAQzO,EAAM/f,QAASyuB,EAAYjS,EACvC,IAAK,IAAID,EAAI,EAAGiS,EAAMzI,eAAiBxJ,EAAI,KACnCkO,GACAzlB,QAAQC,IAAIwpB,EAAY/nB,KAAK8mB,QAAQgB,GAAS,wBACvC9nB,KAAK0nB,aAAaI,EAAOrB,IAHkC5Q,IAMlEkO,IACAgE,EAAY/nB,KAAK8mB,QAAQgB,GAAS,QAE1C,IAAK,IAAIE,KAAU3O,EAAM4F,gBAAgB2C,GACjCmC,GACAzlB,QAAQC,IAAIuX,EAAO9V,KAAK8mB,QAAQkB,GAAU,yBAC9ChoB,KAAK0nB,aAAaM,EAAQvB,GAE1BzmB,KAAKue,OAAO3K,IAAMyF,EAAMrY,KACpB6mB,GAAYxO,EAAMrY,MAClB6mB,IACAjG,EAAQ,GAEZvI,EAAMqF,gBAAgBkD,EAAOiG,GACzB9D,GACAzlB,QAAQC,IAAIuX,EAAO9V,KAAK8mB,QAAQzN,GAAS,wBAAwBrZ,KAAKxE,OAAOwrB,QAAQpF,OACzF+F,EAAetO,EAAOoN,MAEhBG,GAAYA,EAAS1K,MAAQ7C,EAAM6C,SACzC0K,EAAWvN,EAEnB,CACA,OAAOuN,CACX,CAEA,WAAAG,CAAY1N,GAER,OADAA,EAAMoH,QACChQ,EAAKqC,MAAM,CAAEE,OAAQ4N,EAAkB/R,OAAOwK,GACjDpG,QAASjT,KAAKxE,OAAOyX,QACrBmD,MAAOpW,KAAKmmB,QACZjT,gBAAiBlT,KAAKxE,OAAO6qB,aAC7BlT,OAAQnT,KAAKmT,OACbQ,MAAO3T,KAAKub,OAAO,GAAGphB,KACtBc,OAAQoe,EAAMrY,IAAMhB,KAAKub,OAAO,GAAGphB,KACnCiZ,cAAepT,KAAKxE,OAAOwhB,eACnC,CACA,OAAA8J,CAAQzN,GACJ,IAAIlkB,GAAMgvB,IAAaA,EAAW,IAAI7T,UAAU3B,IAAI0K,GAGpD,OAFKlkB,GACDgvB,EAAShnB,IAAIkc,EAAOlkB,EAAKyO,OAAOqkB,cAAcjoB,KAAKgmB,gBAChD7wB,EAAKkkB,CAChB,EAEJ,SAASsO,EAAetO,EAAOoN,GAC3B,IAAK,IAAIze,EAAI,EAAGA,EAAIye,EAAUxrB,OAAQ+M,IAAK,CACvC,IAAIiY,EAAQwG,EAAUze,GACtB,GAAIiY,EAAMjf,KAAOqY,EAAMrY,KAAOif,EAAMD,UAAU3G,GAG1C,YAFIoN,EAAUze,GAAGkU,MAAQ7C,EAAM6C,QAC3BuK,EAAUze,GAAKqR,GAG3B,CACAoN,EAAU3qB,KAAKud,EACnB,CACA,MAAM6O,EACF,WAAA9nB,CAAY+P,EAAQrB,EAAOlZ,GACvBoK,KAAKmQ,OAASA,EACdnQ,KAAK8O,MAAQA,EACb9O,KAAKpK,SAAWA,CACpB,CACA,MAAAstB,CAAOzF,GAAQ,OAAQzd,KAAKpK,UAAmC,GAAvBoK,KAAKpK,SAAS6nB,EAAY,EAiCtE,MAAM0K,UAAiBhN,EAInB,WAAA/a,CAAY4O,GAMR,GALAmJ,QAIAnY,KAAKooB,SAAW,GACI,IAAhBpZ,EAAK/Q,QACL,MAAM,IAAI4P,WAAW,mBAAmBmB,EAAK/Q,+CACjD,IAAIoqB,EAAYrZ,EAAKqZ,UAAU/uB,MAAM,KACrC0G,KAAKgd,cAAgBqL,EAAUptB,OAC/B,IAAK,IAAI+M,EAAI,EAAGA,EAAIgH,EAAKsZ,gBAAiBtgB,IACtCqgB,EAAUvsB,KAAK,IACnB,IAAIysB,EAAWppB,OAAOC,KAAK4P,EAAKwZ,UAAU3kB,KAAI6T,GAAK1I,EAAKwZ,SAAS9Q,GAAG,KAChE+Q,EAAY,GAChB,IAAK,IAAIzgB,EAAI,EAAGA,EAAIqgB,EAAUptB,OAAQ+M,IAClCygB,EAAU3sB,KAAK,IACnB,SAAS4sB,EAAQC,EAAQnhB,EAAM3P,GAC3B4wB,EAAUE,GAAQ7sB,KAAK,CAAC0L,EAAMA,EAAKmG,YAAY/J,OAAO/L,KAC1D,CACA,GAAImX,EAAKyZ,UACL,IAAK,IAAIG,KAAY5Z,EAAKyZ,UAAW,CACjC,IAAIjhB,EAAOohB,EAAS,GACD,iBAARphB,IACPA,EAAOgG,EAAShG,IACpB,IAAK,IAAIQ,EAAI,EAAGA,EAAI4gB,EAAS3tB,QAAS,CAClC,IAAI+Y,EAAO4U,EAAS5gB,KACpB,GAAIgM,GAAQ,EACR0U,EAAQ1U,EAAMxM,EAAMohB,EAAS5gB,UAE5B,CACD,IAAInQ,EAAQ+wB,EAAS5gB,GAAKgM,GAC1B,IAAK,IAAI6B,GAAK7B,EAAM6B,EAAI,EAAGA,IACvB6S,EAAQE,EAAS5gB,KAAMR,EAAM3P,GACjCmQ,GACJ,CACJ,CACJ,CACJhI,KAAKiT,QAAU,IAAInD,EAAQuY,EAAUxkB,KAAI,CAACsD,EAAMa,IAAM8F,EAASiB,OAAO,CAClE5H,KAAMa,GAAKhI,KAAKgd,mBAAgBpc,EAAYuG,EAC5ChS,GAAI6S,EACJzS,MAAOkzB,EAAUzgB,GACjBiH,IAAKsZ,EAAS9Y,QAAQzH,IAAM,EAC5BrJ,MAAY,GAALqJ,EACPkH,QAASF,EAAK6Z,cAAgB7Z,EAAK6Z,aAAapZ,QAAQzH,IAAM,OAE9DgH,EAAK8Z,cACL9oB,KAAKiT,QAAUjT,KAAKiT,QAAQjD,UAAUhB,EAAK8Z,cAC/C9oB,KAAK0gB,QAAS,EACd1gB,KAAKqmB,aAAehZ,EACpB,IAAI0b,EAAajI,EAAY9R,EAAKga,WAClChpB,KAAK7H,QAAU6W,EAAK7W,QACpB6H,KAAKipB,iBAAmBja,EAAK2W,aAAe,GAC5C3lB,KAAK2lB,YAAc,IAAIjR,YAAY1U,KAAKipB,iBAAiBhuB,QACzD,IAAK,IAAI+M,EAAI,EAAGA,EAAIhI,KAAKipB,iBAAiBhuB,OAAQ+M,IAC9ChI,KAAK2lB,YAAY3d,GAAKhI,KAAKipB,iBAAiBjhB,GAAGyV,KACnDzd,KAAK4lB,aAAe5lB,KAAKipB,iBAAiBplB,IAAIqlB,IAC9ClpB,KAAKmpB,OAASrI,EAAY9R,EAAKma,OAAQC,aACvCppB,KAAKT,KAAOuhB,EAAY9R,EAAKqa,WAC7BrpB,KAAK2gB,KAAOG,EAAY9R,EAAK2R,MAC7B3gB,KAAKspB,QAAUta,EAAKsa,QACpBtpB,KAAKklB,WAAalW,EAAKkW,WAAWrhB,KAAIhM,GAAyB,iBAATA,EAAoB,IAAIgrB,EAAWkG,EAAYlxB,GAASA,IAC9GmI,KAAKwoB,SAAWxZ,EAAKwZ,SACrBxoB,KAAKupB,SAAWva,EAAKua,UAAY,CAAC,EAClCvpB,KAAKwpB,mBAAqBxa,EAAKwa,oBAAsB,KACrDxpB,KAAKwjB,eAAiBxU,EAAKya,UAC3BzpB,KAAK0pB,UAAY1a,EAAK0a,WAAa,KACnC1pB,KAAK8d,QAAU9d,KAAKiT,QAAQlD,MAAM9U,OAAS,EAC3C+E,KAAKogB,QAAUpgB,KAAK2pB,eACpB3pB,KAAKiP,IAAMjP,KAAKwoB,SAASrpB,OAAOC,KAAKY,KAAKwoB,UAAU,GACxD,CACA,WAAA/M,CAAYJ,EAAOC,EAAWC,GAC1B,IAAI9a,EAAQ,IAAIqlB,EAAM9lB,KAAMqb,EAAOC,EAAWC,GAC9C,IAAK,IAAIqO,KAAK5pB,KAAKooB,SACf3nB,EAAQmpB,EAAEnpB,EAAO4a,EAAOC,EAAWC,GACvC,OAAO9a,CACX,CAIA,OAAAsc,CAAQf,EAAOyB,EAAMoM,GAAQ,GACzB,IAAIC,EAAQ9pB,KAAK2gB,KACjB,GAAIlD,GAAQqM,EAAM,GACd,OAAQ,EACZ,IAAK,IAAI9oB,EAAM8oB,EAAMrM,EAAO,KAAM,CAC9B,IAAIsM,EAAWD,EAAM9oB,KAAQuU,EAAkB,EAAXwU,EAChCzxB,EAASwxB,EAAM9oB,KACnB,GAAIuU,GAAQsU,EACR,OAAOvxB,EACX,IAAK,IAAIsb,EAAM5S,GAAO+oB,GAAY,GAAI/oB,EAAM4S,EAAK5S,IAC7C,GAAI8oB,EAAM9oB,IAAQgb,EACd,OAAO1jB,EACf,GAAIid,EACA,OAAQ,CAChB,CACJ,CAIA,SAAAyJ,CAAUhD,EAAOgO,GACb,IAAIzqB,EAAOS,KAAKT,KAChB,IAAK,IAAIpC,EAAM,EAAGA,EAAM,EAAGA,IACvB,IAAK,IAA2F6W,EAAvFhM,EAAIhI,KAAK+e,UAAU/C,EAAO7e,EAAM,EAA0B,IAAoC6K,GAAK,EAAG,CAC3G,GAAwB,QAAnBgM,EAAOzU,EAAKyI,IAA4B,CACzC,GAAmB,GAAfzI,EAAKyI,EAAI,GAER,IAAmB,GAAfzI,EAAKyI,EAAI,GACd,OAAOgO,GAAKzW,EAAMyI,EAAI,GAEtB,KAAK,CAJLgM,EAAOzU,EAAKyI,EAAIgO,GAAKzW,EAAMyI,EAAI,GAKvC,CACA,GAAIgM,GAAQgW,GAAoB,GAARhW,EACpB,OAAOgC,GAAKzW,EAAMyI,EAAI,EAC9B,CAEJ,OAAO,CACX,CAIA,SAAA+W,CAAU/C,EAAOiO,GACb,OAAOjqB,KAAKmpB,OAAgB,EAARnN,EAAmCiO,EAC3D,CAIA,SAAA1M,CAAUvB,EAAOkO,GACb,OAAQlqB,KAAK+e,UAAU/C,EAAO,GAA4BkO,GAAQ,CACtE,CAIA,WAAA5K,CAAYtD,EAAOU,GACf,QAAS1c,KAAK2f,WAAW3D,GAAOriB,GAAKA,GAAK+iB,GAAgB,MAC9D,CAIA,UAAAiD,CAAW3D,EAAOU,GACd,IAAIyN,EAAQnqB,KAAK+e,UAAU/C,EAAO,GAC9BjO,EAASoc,EAAQzN,EAAOyN,QAASvpB,EACrC,IAAK,IAAIoH,EAAIhI,KAAK+e,UAAU/C,EAAO,GAAuC,MAAVjO,EAAgB/F,GAAK,EAAG,CACpF,GAAoB,OAAhBhI,KAAKT,KAAKyI,GAA2B,CACrC,GAAwB,GAApBhI,KAAKT,KAAKyI,EAAI,GAGd,MAFAA,EAAIgO,GAAKhW,KAAKT,KAAMyI,EAAI,EAGhC,CACA+F,EAAS2O,EAAO1G,GAAKhW,KAAKT,KAAMyI,EAAI,GACxC,CACA,OAAO+F,CACX,CAKA,UAAAmR,CAAWlD,GACP,IAAIjO,EAAS,GACb,IAAK,IAAI/F,EAAIhI,KAAK+e,UAAU/C,EAAO,IAA8BhU,GAAK,EAAG,CACrE,GAAoB,OAAhBhI,KAAKT,KAAKyI,GAA2B,CACrC,GAAwB,GAApBhI,KAAKT,KAAKyI,EAAI,GAGd,MAFAA,EAAIgO,GAAKhW,KAAKT,KAAMyI,EAAI,EAGhC,CACA,KAAwB,EAAnBhI,KAAKT,KAAKyI,EAAI,IAAkD,CACjE,IAAInQ,EAAQmI,KAAKT,KAAKyI,EAAI,GACrB+F,EAAOqM,MAAK,CAACgF,EAAGpX,IAAW,EAAJA,GAAUoX,GAAKvnB,KACvCkW,EAAOjS,KAAKkE,KAAKT,KAAKyI,GAAInQ,EAClC,CACJ,CACA,OAAOkW,CACX,CAMA,SAAAtW,CAAUgW,GAGN,IAAIwJ,EAAO9X,OAAOiR,OAAOjR,OAAO0P,OAAOsZ,EAAStE,WAAY7jB,MAG5D,GAFIyN,EAAOlY,QACP0hB,EAAKhE,QAAUjT,KAAKiT,QAAQjD,UAAUvC,EAAOlY,QAC7CkY,EAAOwB,IAAK,CACZ,IAAI9Q,EAAO6B,KAAKwoB,SAAS/a,EAAOwB,KAChC,IAAK9Q,EACD,MAAM,IAAI0P,WAAW,yBAAyBJ,EAAOwB,OACzDgI,EAAKhI,IAAM9Q,CACf,CA2BA,OA1BIsP,EAAOyX,aACPjO,EAAKiO,WAAallB,KAAKklB,WAAWrhB,KAAIumB,IAClC,IAAIxa,EAAQnC,EAAOyX,WAAW7sB,MAAKqf,GAAKA,EAAEvd,MAAQiwB,IAClD,OAAOxa,EAAQA,EAAMrV,GAAK6vB,CAAC,KAE/B3c,EAAOmY,eACP3O,EAAK2O,aAAe5lB,KAAK4lB,aAAa/O,QACtCI,EAAKgS,iBAAmBjpB,KAAKipB,iBAAiBplB,KAAI,CAAC6D,EAAGM,KAClD,IAAI4H,EAAQnC,EAAOmY,aAAavtB,MAAKqf,GAAKA,EAAEvd,MAAQuN,EAAE2iB,WACtD,IAAKza,EACD,OAAOlI,EACX,IAAIsH,EAAO7P,OAAOiR,OAAOjR,OAAOiR,OAAO,CAAC,EAAG1I,GAAI,CAAE2iB,SAAUza,EAAMrV,KAEjE,OADA0c,EAAK2O,aAAa5d,GAAKkhB,GAAela,GAC/BA,CAAI,KAGfvB,EAAO6c,iBACPrT,EAAK9e,QAAUsV,EAAO6c,gBACtB7c,EAAO2S,UACPnJ,EAAKmJ,QAAUpgB,KAAK2pB,aAAalc,EAAO2S,UACvB,MAAjB3S,EAAOiT,SACPzJ,EAAKyJ,OAASjT,EAAOiT,QACrBjT,EAAO8c,OACPtT,EAAKmR,SAAWnR,EAAKmR,SAASnS,OAAOxI,EAAO8c,OACrB,MAAvB9c,EAAO4Y,eACPpP,EAAKoP,aAAe5Y,EAAO4Y,cACxBpP,CACX,CAKA,WAAAuT,GACI,OAAOxqB,KAAKooB,SAASntB,OAAS,CAClC,CAOA,OAAA+rB,CAAQvJ,GACJ,OAAOzd,KAAK0pB,UAAY1pB,KAAK0pB,UAAUjM,GAAQ7Z,OAAO6Z,GAAQzd,KAAK8d,SAAW9d,KAAKiT,QAAQlD,MAAM0N,GAAMtW,MAAQsW,EACnH,CAKA,WAAIgI,GAAY,OAAOzlB,KAAK8d,QAAU,CAAG,CAIzC,WAAI9M,GAAY,OAAOhR,KAAKiT,QAAQlD,MAAM/P,KAAKiP,IAAI,GAAK,CAIxD,iBAAA6N,CAAkBW,GACd,IAAIgN,EAAOzqB,KAAKwpB,mBAChB,OAAe,MAARiB,EAAe,EAAIA,EAAKhN,IAAS,CAC5C,CAIA,YAAAkM,CAAavJ,GACT,IAAIhZ,EAASjI,OAAOC,KAAKY,KAAKupB,UAAWza,EAAQ1H,EAAOvD,KAAI,KAAM,IAClE,GAAIuc,EACA,IAAK,IAAIsK,KAAQtK,EAAQ9mB,MAAM,KAAM,CACjC,IAAInE,EAAKiS,EAAOqI,QAAQib,GACpBv1B,GAAM,IACN2Z,EAAM3Z,IAAM,EACpB,CACJ,IAAIS,EAAW,KACf,IAAK,IAAIoS,EAAI,EAAGA,EAAIZ,EAAOnM,OAAQ+M,IAC/B,IAAK8G,EAAM9G,GACP,IAAK,IAAkC7S,EAA9B0gB,EAAI7V,KAAKupB,SAASniB,EAAOY,IAAkC,QAAxB7S,EAAK6K,KAAKT,KAAKsW,QACtDjgB,IAAaA,EAAW,IAAI+0B,WAAW3qB,KAAKspB,QAAU,KAAKn0B,GAAM,EAE9E,OAAO,IAAI+yB,EAAQ9H,EAAStR,EAAOlZ,EACvC,CAKA,kBAAO+X,CAAYqB,GACf,OAAO,IAAImZ,EAASnZ,EACxB,EAEJ,SAASgH,GAAKzW,EAAMkf,GAAO,OAAOlf,EAAKkf,GAAQlf,EAAKkf,EAAM,IAAM,EAAK,CAYrE,SAASyK,GAAela,GACpB,GAAIA,EAAKqb,SAAU,CACf,IAAI/I,EAAOtS,EAAKgB,OAAS,EAA4B,EACrD,MAAO,CAACnY,EAAOwhB,IAAWrK,EAAKqb,SAASxyB,EAAOwhB,IAAU,EAAKiI,CAClE,CACA,OAAOtS,EAAKL,GAChB,CCr1DA,MAoCMic,GAAgB,CACpBC,KArCa,EAsCbC,OArCW,EAsCXC,OArCW,EAsCX9uB,QArCY,EAsCZ+uB,OArCW,EAsCXC,aApCgB,EAqChBC,YApCe,EAqCfC,cApCiB,EAqCjBC,OApCW,GAqCXvQ,OApCW,GAqCXwQ,KApCS,GAqCTC,GApCO,GAqCPC,SApCa,GAqCbC,WApCc,GAqCdC,YApCe,GAqCfC,OA/CW,EAgDXC,WArCe,GAsCfC,KArCS,GAsCTC,KArCS,IA4CLC,GAA0B,CAC9BC,GA5CO,GA6CPC,QA5CY,GA6CZC,IA5CQ,GA6CRC,GA5CO,GA6CPC,OA5CW,GA6CXC,IA5CQ,GA6CRC,IA5CQ,GA6CR/O,MA5CU,GA6CVlG,IA5CQ,GA6CRwL,IA5CQ,GA6CR0J,OA5CW,GA6CXC,OA5CW,GA6CXC,QA5CY,GA6CZC,KA5CS,GA6CT/yB,KA5CS,GA6CTgzB,UA5Cc,IAoDVC,GAAkB,CAACC,UAAU,KAAKC,GAAG,IAAKC,gBAAgB,IAAKC,KAAK,IAAKC,aAAa,IAAKC,gBAAgB,IAAKC,WAAW,IAAKC,cAAc,IAAKC,cAAc,IAAKC,cAAc,IAAKC,cAAc,IAAKC,iBAAiB,IAAKC,iBAAiB,IAAKC,mBAAmB,IAAKC,gBAAgB,IAAKC,eAAe,IAAKC,iBAAiB,IAAKC,MAAM,IAAKC,SAAS,IAAKC,iBAAiB,KACzXvyB,GAAS2sB,EAASxa,YAAY,CAClC1P,QAAS,GACTkrB,OAAQ,ygGACRE,UAAW,+9KACX1I,KAAM,wvCACN0H,UAAW,k4CACXiB,QAAS,IACTT,aAAc,CAAC,EAAE,IACjBP,gBAAiB,EACjBU,UAAW,4tEACX9D,WAAY,CAAC,EAAG,GAChBsD,SAAU,CAAC,MAAQ,CAAC,EAAE,KACtB7C,YAAa,CAAC,CAAClI,KAAM,GAAI9O,IAAK,CAAC9W,EAAOwhB,IAzCX,CAACxhB,GACrB+yB,GAAc/yB,EAAMm2B,iBAAmB,EAwCGC,CAAqBp2B,IAAU,GAAI,CAAC4lB,KAAM,GAAI9O,IAAK,CAAC9W,EAAOwhB,IAlBrF,CAACxhB,GACjBi0B,GAAwBj0B,EAAMm2B,iBAAmB,EAiB+DE,CAAiBr2B,IAAU,EAAK,GAAG,CAAC4lB,KAAM,GAAI9O,IAAK9W,GAAS80B,GAAgB90B,KAAW,IAC9M4xB,UAAW,IAGP5jB,GAAO,EACXF,GAAS,EAsCTrC,GAAW,GAEXE,GAAU,GACVG,GAAa,GACbd,GAAK,GACL,GAAS,GACTE,GAAM,GACNE,GAAK,GACLE,GAAM,GAINa,GAAa,GAEbG,GAAY,GACZE,GAAY,GACZI,GAAc,GACdE,GAAM,GACN/G,GAAW,GAEXmJ,GAAW,GAUXzB,GAAc,GAId5C,GAAM,GACN2D,GAAW,GACX7D,GAAM,GACNF,GAAM,GACNH,GAAM,GAGNgE,GAAQ,GAGR,GAAS,GAcTgoB,GAAa,E,sEC1MXC,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqB1tB,IAAjB2tB,EACH,OAAOA,EAAa9hB,QAGrB,IAAID,EAAS4hB,EAAyBE,GAAY,CAGjD7hB,QAAS,CAAC,GAOX,OAHA+hB,EAAoBF,GAAUG,KAAKjiB,EAAOC,QAASD,EAAQA,EAAOC,QAAS4hB,GAGpE7hB,EAAOC,OACf,C,OAGA4hB,EAAoBK,EAAIF,ECxBxBH,EAAoB7U,EAAKhN,IACxB,IAAImiB,EAASniB,GAAUA,EAAOoiB,WAC7B,IAAOpiB,EAAiB,QACxB,IAAM,EAEP,OADA6hB,EAAoBvU,EAAE6U,EAAQ,CAAEh1B,EAAGg1B,IAC5BA,CAAM,EhCNV95B,EAAWsK,OAAO0vB,eAAkBlnB,GAASxI,OAAO0vB,eAAelnB,GAASA,GAASA,EAAa,UAQtG0mB,EAAoBjE,EAAI,SAASvyB,EAAOiZ,GAEvC,GADU,EAAPA,IAAUjZ,EAAQmI,KAAKnI,IAChB,EAAPiZ,EAAU,OAAOjZ,EACpB,GAAoB,iBAAVA,GAAsBA,EAAO,CACtC,GAAW,EAAPiZ,GAAajZ,EAAM+2B,WAAY,OAAO/2B,EAC1C,GAAW,GAAPiZ,GAAoC,mBAAfjZ,EAAMi3B,KAAqB,OAAOj3B,CAC5D,CACA,IAAIk3B,EAAK5vB,OAAO0P,OAAO,MACvBwf,EAAoB3W,EAAEqX,GACtB,IAAIC,EAAM,CAAC,EACXp6B,EAAiBA,GAAkB,CAAC,KAAMC,EAAS,CAAC,GAAIA,EAAS,IAAKA,EAASA,IAC/E,IAAI,IAAIo6B,EAAiB,EAAPne,GAAYjZ,EAAyB,iBAAXo3B,KAAyBr6B,EAAe6a,QAAQwf,GAAUA,EAAUp6B,EAASo6B,GACxH9vB,OAAO+vB,oBAAoBD,GAAS5vB,SAAS7F,GAASw1B,EAAIx1B,GAAO,IAAO3B,EAAM2B,KAI/E,OAFAw1B,EAAa,QAAI,IAAM,EACvBX,EAAoBvU,EAAEiV,EAAIC,GACnBD,CACR,EiCxBAV,EAAoBvU,EAAI,CAACrN,EAAS0iB,KACjC,IAAI,IAAI31B,KAAO21B,EACXd,EAAoB/mB,EAAE6nB,EAAY31B,KAAS60B,EAAoB/mB,EAAEmF,EAASjT,IAC5E2F,OAAOiwB,eAAe3iB,EAASjT,EAAK,CAAE61B,YAAY,EAAM1gB,IAAKwgB,EAAW31B,IAE1E,ECND60B,EAAoBiB,EAAI,CAAC,EAGzBjB,EAAoBtvB,EAAKwwB,GACjBp5B,QAAQC,IAAI+I,OAAOC,KAAKivB,EAAoBiB,GAAG7S,QAAO,CAAC+S,EAAUh2B,KACvE60B,EAAoBiB,EAAE91B,GAAK+1B,EAASC,GAC7BA,IACL,KCNJnB,EAAoBoB,EAAKF,GAEZA,EAAU,MCHvBlB,EAAoBqB,EAAI,WACvB,GAA0B,iBAAfC,WAAyB,OAAOA,WAC3C,IACC,OAAO3vB,MAAQ,IAAI4vB,SAAS,cAAb,EAChB,CAAE,MAAO7wB,GACR,GAAsB,iBAAX8wB,OAAqB,OAAOA,MACxC,CACA,CAPuB,GCAxBxB,EAAoB/mB,EAAI,CAACK,EAAKH,IAAUrI,OAAO0kB,UAAUiM,eAAerB,KAAK9mB,EAAKH,GpCA9E1S,EAAa,CAAC,EACdC,EAAoB,2BAExBs5B,EAAoB0B,EAAI,CAACC,EAAKtU,EAAMliB,EAAK+1B,KACxC,GAAGz6B,EAAWk7B,GAAQl7B,EAAWk7B,GAAKl0B,KAAK4f,OAA3C,CACA,IAAIuU,EAAQC,EACZ,QAAWtvB,IAARpH,EAEF,IADA,IAAI22B,EAAUC,SAASC,qBAAqB,UACpCroB,EAAI,EAAGA,EAAImoB,EAAQl1B,OAAQ+M,IAAK,CACvC,IAAIN,EAAIyoB,EAAQnoB,GAChB,GAAGN,EAAE4oB,aAAa,QAAUN,GAAOtoB,EAAE4oB,aAAa,iBAAmBv7B,EAAoByE,EAAK,CAAEy2B,EAASvoB,EAAG,KAAO,CACpH,CAEGuoB,IACHC,GAAa,GACbD,EAASG,SAASG,cAAc,WAEzBC,QAAU,QACjBP,EAAOQ,QAAU,IACbpC,EAAoBqC,IACvBT,EAAOU,aAAa,QAAStC,EAAoBqC,IAElDT,EAAOU,aAAa,eAAgB57B,EAAoByE,GAExDy2B,EAAO9gB,IAAM6gB,GAEdl7B,EAAWk7B,GAAO,CAACtU,GACnB,IAAIkV,EAAmB,CAAC3W,EAAM4W,KAE7BZ,EAAOa,QAAUb,EAAOc,OAAS,KACjCC,aAAaP,GACb,IAAIQ,EAAUn8B,EAAWk7B,GAIzB,UAHOl7B,EAAWk7B,GAClBC,EAAOiB,YAAcjB,EAAOiB,WAAWC,YAAYlB,GACnDgB,GAAWA,EAAQ5xB,SAAS+xB,GAAQA,EAAGP,KACpC5W,EAAM,OAAOA,EAAK4W,EAAM,EAExBJ,EAAUY,WAAWT,EAAiBU,KAAK,UAAM1wB,EAAW,CAAEpI,KAAM,UAAWF,OAAQ23B,IAAW,MACtGA,EAAOa,QAAUF,EAAiBU,KAAK,KAAMrB,EAAOa,SACpDb,EAAOc,OAASH,EAAiBU,KAAK,KAAMrB,EAAOc,QACnDb,GAAcE,SAASmB,KAAKC,YAAYvB,EApCkB,CAoCX,EqCvChD5B,EAAoB3W,EAAKjL,IACH,oBAAXlP,QAA0BA,OAAOk0B,aAC1CtyB,OAAOiwB,eAAe3iB,EAASlP,OAAOk0B,YAAa,CAAE55B,MAAO,WAE7DsH,OAAOiwB,eAAe3iB,EAAS,aAAc,CAAE5U,OAAO,GAAO,ECL9Dw2B,EAAoBtkB,EAAI,0C,MCAxBskB,EAAoBrX,EAAIoZ,SAASsB,SAAWC,KAAK10B,SAAS20B,KAK1D,IAAIC,EAAkB,CACrB,IAAK,GAGNxD,EAAoBiB,EAAEzZ,EAAI,CAAC0Z,EAASC,KAElC,IAAIsC,EAAqBzD,EAAoB/mB,EAAEuqB,EAAiBtC,GAAWsC,EAAgBtC,QAAW3uB,EACtG,GAA0B,IAAvBkxB,EAGF,GAAGA,EACFtC,EAAS1zB,KAAKg2B,EAAmB,QAC3B,CAGL,IAAIC,EAAU,IAAI57B,SAAQ,CAACob,EAASygB,IAAYF,EAAqBD,EAAgBtC,GAAW,CAAChe,EAASygB,KAC1GxC,EAAS1zB,KAAKg2B,EAAmB,GAAKC,GAGtC,IAAI/B,EAAM3B,EAAoBtkB,EAAIskB,EAAoBoB,EAAEF,GAEpD5wB,EAAQ,IAAIc,MAgBhB4uB,EAAoB0B,EAAEC,GAfFa,IACnB,GAAGxC,EAAoB/mB,EAAEuqB,EAAiBtC,KAEf,KAD1BuC,EAAqBD,EAAgBtC,MACRsC,EAAgBtC,QAAW3uB,GACrDkxB,GAAoB,CACtB,IAAIG,EAAYpB,IAAyB,SAAfA,EAAMr4B,KAAkB,UAAYq4B,EAAMr4B,MAChE05B,EAAUrB,GAASA,EAAMv4B,QAAUu4B,EAAMv4B,OAAO6W,IACpDxQ,EAAMwzB,QAAU,iBAAmB5C,EAAU,cAAgB0C,EAAY,KAAOC,EAAU,IAC1FvzB,EAAMwI,KAAO,iBACbxI,EAAMnG,KAAOy5B,EACbtzB,EAAMyzB,QAAUF,EAChBJ,EAAmB,GAAGnzB,EACvB,CACD,GAEwC,SAAW4wB,EAASA,EAE/D,CACD,EAcF,IAAI8C,EAAuB,CAACC,EAA4B/yB,KACvD,IAGI+uB,EAAUiB,GAHTgD,EAAUC,EAAaC,GAAWlzB,EAGhByI,EAAI,EAC3B,GAAGuqB,EAASnY,MAAMjlB,GAAgC,IAAxB08B,EAAgB18B,KAAa,CACtD,IAAIm5B,KAAYkE,EACZnE,EAAoB/mB,EAAEkrB,EAAalE,KACrCD,EAAoBK,EAAEJ,GAAYkE,EAAYlE,IAG7CmE,GAAsBA,EAAQpE,EAClC,CAEA,IADGiE,GAA4BA,EAA2B/yB,GACrDyI,EAAIuqB,EAASt3B,OAAQ+M,IACzBunB,EAAUgD,EAASvqB,GAChBqmB,EAAoB/mB,EAAEuqB,EAAiBtC,IAAYsC,EAAgBtC,IACrEsC,EAAgBtC,GAAS,KAE1BsC,EAAgBtC,GAAW,CAC5B,EAIGmD,EAAqBf,KAA0C,oCAAIA,KAA0C,qCAAK,GACtHe,EAAmBrzB,QAAQgzB,EAAqBf,KAAK,KAAM,IAC3DoB,EAAmB52B,KAAOu2B,EAAqBf,KAAK,KAAMoB,EAAmB52B,KAAKw1B,KAAKoB,G,KClF7DrE,EAAoB,K","sources":["webpack://grafana-lokiexplore-app/webpack/runtime/create fake namespace object","webpack://grafana-lokiexplore-app/webpack/runtime/load script","webpack://grafana-lokiexplore-app/./services/extensions/exposedComponents.tsx","webpack://grafana-lokiexplore-app/./module.tsx","webpack://grafana-lokiexplore-app/./services/extensions/links.ts","webpack://grafana-lokiexplore-app/./services/fieldsTypes.ts","webpack://grafana-lokiexplore-app/./services/filterTypes.ts","webpack://grafana-lokiexplore-app/./services/logger.ts","webpack://grafana-lokiexplore-app/./services/logqlMatchers.ts","webpack://grafana-lokiexplore-app/./services/lokiQuery.ts","webpack://grafana-lokiexplore-app/./services/narrowing.ts","webpack://grafana-lokiexplore-app/./services/operatorHelpers.ts","webpack://grafana-lokiexplore-app/./services/getOperatorDescription.ts","webpack://grafana-lokiexplore-app/./services/operators.ts","webpack://grafana-lokiexplore-app/./services/extensions/scenesMethods.ts","webpack://grafana-lokiexplore-app/./services/renderPatternFilters.ts","webpack://grafana-lokiexplore-app/./services/variables.ts","webpack://grafana-lokiexplore-app/external amd \"@emotion/css\"","webpack://grafana-lokiexplore-app/external amd \"@grafana/data\"","webpack://grafana-lokiexplore-app/external amd \"@grafana/runtime\"","webpack://grafana-lokiexplore-app/external amd \"@grafana/ui\"","webpack://grafana-lokiexplore-app/external amd \"lodash\"","webpack://grafana-lokiexplore-app/external amd \"react\"","webpack://grafana-lokiexplore-app/external amd \"react-dom\"","webpack://grafana-lokiexplore-app/external amd \"react-redux\"","webpack://grafana-lokiexplore-app/external amd \"react-router-dom\"","webpack://grafana-lokiexplore-app/external amd \"redux\"","webpack://grafana-lokiexplore-app/external amd \"rxjs\"","webpack://grafana-lokiexplore-app/../node_modules/@lezer/common/dist/index.js","webpack://grafana-lokiexplore-app/../node_modules/@lezer/lr/dist/index.js","webpack://grafana-lokiexplore-app/../node_modules/@grafana/lezer-logql/index.es.js","webpack://grafana-lokiexplore-app/webpack/bootstrap","webpack://grafana-lokiexplore-app/webpack/runtime/compat get default export","webpack://grafana-lokiexplore-app/webpack/runtime/define property getters","webpack://grafana-lokiexplore-app/webpack/runtime/ensure chunk","webpack://grafana-lokiexplore-app/webpack/runtime/get javascript chunk filename","webpack://grafana-lokiexplore-app/webpack/runtime/global","webpack://grafana-lokiexplore-app/webpack/runtime/hasOwnProperty shorthand","webpack://grafana-lokiexplore-app/webpack/runtime/make namespace object","webpack://grafana-lokiexplore-app/webpack/runtime/publicPath","webpack://grafana-lokiexplore-app/webpack/runtime/jsonp chunk loading","webpack://grafana-lokiexplore-app/webpack/startup"],"sourcesContent":["var getProto = Object.getPrototypeOf ? (obj) => (Object.getPrototypeOf(obj)) : (obj) => (obj.__proto__);\nvar leafPrototypes;\n// create a fake namespace object\n// mode & 1: value is a module id, require it\n// mode & 2: merge all properties of value into the ns\n// mode & 4: return value when already ns object\n// mode & 16: return value when it's Promise-like\n// mode & 8|1: behave like require\n__webpack_require__.t = function(value, mode) {\n\tif(mode & 1) value = this(value);\n\tif(mode & 8) return value;\n\tif(typeof value === 'object' && value) {\n\t\tif((mode & 4) && value.__esModule) return value;\n\t\tif((mode & 16) && typeof value.then === 'function') return value;\n\t}\n\tvar ns = Object.create(null);\n\t__webpack_require__.r(ns);\n\tvar def = {};\n\tleafPrototypes = leafPrototypes || [null, getProto({}), getProto([]), getProto(getProto)];\n\tfor(var current = mode & 2 && value; typeof current == 'object' && !~leafPrototypes.indexOf(current); current = getProto(current)) {\n\t\tObject.getOwnPropertyNames(current).forEach((key) => (def[key] = () => (value[key])));\n\t}\n\tdef['default'] = () => (value);\n\t__webpack_require__.d(ns, def);\n\treturn ns;\n};","var inProgress = {};\nvar dataWebpackPrefix = \"grafana-lokiexplore-app:\";\n// loadScript function to load a script via script tag\n__webpack_require__.l = (url, done, key, chunkId) => {\n\tif(inProgress[url]) { inProgress[url].push(done); return; }\n\tvar script, needAttach;\n\tif(key !== undefined) {\n\t\tvar scripts = document.getElementsByTagName(\"script\");\n\t\tfor(var i = 0; i < scripts.length; i++) {\n\t\t\tvar s = scripts[i];\n\t\t\tif(s.getAttribute(\"src\") == url || s.getAttribute(\"data-webpack\") == dataWebpackPrefix + key) { script = s; break; }\n\t\t}\n\t}\n\tif(!script) {\n\t\tneedAttach = true;\n\t\tscript = document.createElement('script');\n\n\t\tscript.charset = 'utf-8';\n\t\tscript.timeout = 120;\n\t\tif (__webpack_require__.nc) {\n\t\t\tscript.setAttribute(\"nonce\", __webpack_require__.nc);\n\t\t}\n\t\tscript.setAttribute(\"data-webpack\", dataWebpackPrefix + key);\n\n\t\tscript.src = url;\n\t}\n\tinProgress[url] = [done];\n\tvar onScriptComplete = (prev, event) => {\n\t\t// avoid mem leaks in IE.\n\t\tscript.onerror = script.onload = null;\n\t\tclearTimeout(timeout);\n\t\tvar doneFns = inProgress[url];\n\t\tdelete inProgress[url];\n\t\tscript.parentNode && script.parentNode.removeChild(script);\n\t\tdoneFns && doneFns.forEach((fn) => (fn(event)));\n\t\tif(prev) return prev(event);\n\t}\n\tvar timeout = setTimeout(onScriptComplete.bind(null, undefined, { type: 'timeout', target: script }), 120000);\n\tscript.onerror = onScriptComplete.bind(null, script.onerror);\n\tscript.onload = onScriptComplete.bind(null, script.onload);\n\tneedAttach && document.head.appendChild(script);\n};","import { LinkButton } from '@grafana/ui';\nimport { OpenInLogsDrilldownButtonProps } from 'Components/OpenInLogsDrilldownButton/types';\nimport React, { lazy, Suspense } from 'react';\nconst OpenInLogsDrilldownButton = lazy(() => import('Components/OpenInLogsDrilldownButton/OpenInLogsDrilldownButton'));\n\nfunction SuspendedOpenInLogsDrilldownButton(props: OpenInLogsDrilldownButtonProps) {\n  return (\n    <Suspense\n      fallback={\n        <LinkButton variant=\"secondary\" disabled>\n          Open in Logs Drilldown\n        </LinkButton>\n      }\n    >\n      <OpenInLogsDrilldownButton {...props} />\n    </Suspense>\n  );\n}\n\nexport const exposedComponents = [\n  {\n    id: `grafana-lokiexplore-app/open-in-explore-logs-button/v1`,\n    title: 'Open in Logs Drilldown button',\n    description: 'A button that opens a logs view in the Logs Drilldown app.',\n    component: SuspendedOpenInLogsDrilldownButton,\n  },\n];\n","import { lazy } from 'react';\nimport { AppPlugin } from '@grafana/data';\nimport { linkConfigs } from 'services/extensions/links';\nimport { exposedComponents } from 'services/extensions/exposedComponents';\n\n// Anything imported in this file is included in the main bundle which is pre-loaded in Grafana\n// Don't add imports to this file without lazy loading\n// Link extensions are the exception as they must be included in the main bundle in order to work in core Grafana\nconst App = lazy(async () => {\n  const { wasmSupported } = await import('services/sorting');\n\n  const { default: initRuntimeDs } = await import('services/datasource');\n  const { default: initChangepoint } = await import('@bsull/augurs/changepoint');\n  const { default: initOutlier } = await import('@bsull/augurs/outlier');\n\n  initRuntimeDs();\n\n  if (wasmSupported()) {\n    await Promise.all([initChangepoint(), initOutlier()]);\n  }\n\n  return import('Components/App');\n});\n\nconst AppConfig = lazy(async () => {\n  return await import('./Components/AppConfig/AppConfig');\n});\n\nexport const plugin = new AppPlugin<{}>().setRootPage(App).addConfigPage({\n  title: 'Configuration',\n  icon: 'cog',\n  body: AppConfig,\n  id: 'configuration',\n});\n\nfor (const linkConfig of linkConfigs) {\n  plugin.addLink(linkConfig);\n}\n\nfor (const exposedComponentConfig of exposedComponents) {\n  plugin.exposeComponent(exposedComponentConfig);\n}\n","// Warning: This file (and any imports) are included in the main bundle with Grafana in order to provide link extension support in Grafana core, in an effort to keep Grafana loading quickly, please do not add any unnecessary imports to this file and run the bundle analyzer before committing any changes!\nimport { PluginExtensionLinkConfig, PluginExtensionPanelContext, PluginExtensionPoints } from '@grafana/data';\n\nimport {\n  addAdHocFilterUserInputPrefix,\n  AdHocFieldValue,\n  AppliedPattern,\n  EMPTY_VARIABLE_VALUE,\n  LEVEL_VARIABLE_VALUE,\n  SERVICE_NAME,\n  stripAdHocFilterUserInputPrefix,\n  VAR_DATASOURCE,\n  VAR_FIELDS,\n  VAR_LABELS,\n  VAR_LEVELS,\n  VAR_LINE_FILTERS,\n  VAR_METADATA,\n  VAR_PATTERNS,\n} from 'services/variables';\nimport pluginJson from '../../plugin.json';\nimport { getMatcherFromQuery } from '../logqlMatchers';\nimport { LokiQuery } from '../lokiQuery';\nimport { LabelType } from '../fieldsTypes';\n\nimport { isOperatorInclusive } from '../operatorHelpers';\nimport { PatternFilterOp } from '../filterTypes';\nimport { renderPatternFilters } from '../renderPatternFilters';\n\nconst PRODUCT_NAME = 'Grafana Logs Drilldown';\nconst title = `Open in ${PRODUCT_NAME}`;\nconst description = `Open current query in the ${PRODUCT_NAME} view`;\nconst icon = 'gf-logs';\n\nexport const ExtensionPoints = {\n  MetricInvestigation: 'grafana-lokiexplore-app/investigation/v1',\n} as const;\n\nexport type LinkConfigs = Array<\n  {\n    targets: string | string[];\n    // eslint-disable-next-line deprecation/deprecation\n  } & Omit<PluginExtensionLinkConfig<PluginExtensionPanelContext>, 'type' | 'extensionPointId'>\n>;\n\n// `plugin.addLink` requires these types; unfortunately, the correct `PluginExtensionAddedLinkConfig` type is not exported with 11.2.x\n// TODO: fix this type when we move to `@grafana/data` 11.3.x\nexport const linkConfigs: LinkConfigs = [\n  {\n    targets: PluginExtensionPoints.DashboardPanelMenu,\n    title,\n    description,\n    icon,\n    path: createAppUrl(),\n    configure: contextToLink,\n  },\n  {\n    targets: PluginExtensionPoints.ExploreToolbarAction,\n    title,\n    description,\n    icon,\n    path: createAppUrl(),\n    configure: contextToLink,\n  },\n];\n\nfunction stringifyValues(value?: string): string {\n  if (!value) {\n    return EMPTY_VARIABLE_VALUE;\n  }\n  return value;\n}\n\n// Why are there twice as many escape chars in the url as expected?\nexport function replaceEscapeChars(value?: string): string | undefined {\n  return value?.replace(/\\\\\\\\/g, '\\\\');\n}\n\nexport function stringifyAdHocValues(value?: string): string {\n  if (!value) {\n    return EMPTY_VARIABLE_VALUE;\n  }\n\n  // All label values from explore are already escaped, so we mark them as custom values to prevent them from getting escaped again when rendering the LogQL\n  return addAdHocFilterUserInputPrefix(replaceEscapeChars(value));\n}\n\nexport function stringifyAdHocValueLabels(value?: string): string {\n  if (!value) {\n    return EMPTY_VARIABLE_VALUE;\n  }\n\n  return escapeURLDelimiters(replaceEscapeChars(value));\n}\n\nfunction contextToLink<T extends PluginExtensionPanelContext>(context?: T) {\n  if (!context) {\n    return undefined;\n  }\n  const lokiQuery = context.targets.find((target) => target.datasource?.type === 'loki') as LokiQuery | undefined;\n  if (!lokiQuery || !lokiQuery.datasource?.uid) {\n    return undefined;\n  }\n\n  const expr = lokiQuery.expr;\n  const { labelFilters, lineFilters, fields, patternFilters } = getMatcherFromQuery(expr, context, lokiQuery);\n  const labelSelector = labelFilters.find((selector) => isOperatorInclusive(selector.operator));\n\n  // Require at least one inclusive operator to run a valid Loki query\n  if (!labelSelector) {\n    return undefined;\n  }\n\n  // If there are a bunch of values for the same field, the value slug can get really long, let's just use the first one in the URL\n  const urlLabelValue = labelSelector.value.split('|')[0];\n  const labelValue = replaceSlash(urlLabelValue);\n  let labelName = labelSelector.key === SERVICE_NAME ? 'service' : labelSelector.key;\n  // sort `primary label` first\n  labelFilters.sort((a) => (a.key === labelName ? -1 : 1));\n\n  let params = setUrlParameter(UrlParameters.DatasourceId, lokiQuery.datasource?.uid, new URLSearchParams());\n  params = setUrlParameter(UrlParameters.TimeRangeFrom, context.timeRange.from.valueOf().toString(), params);\n  params = setUrlParameter(UrlParameters.TimeRangeTo, context.timeRange.to.valueOf().toString(), params);\n\n  for (const labelFilter of labelFilters) {\n    // skip non-indexed filters for now\n    if (labelFilter.type !== LabelType.Indexed) {\n      continue;\n    }\n\n    const labelsAdHocFilterURLString = `${labelFilter.key}|${labelFilter.operator}|${escapeURLDelimiters(\n      stringifyAdHocValues(labelFilter.value)\n    )},${escapeURLDelimiters(replaceEscapeChars(labelFilter.value))}`;\n\n    params = appendUrlParameter(UrlParameters.Labels, labelsAdHocFilterURLString, params);\n  }\n\n  if (lineFilters) {\n    for (const lineFilter of lineFilters) {\n      params = appendUrlParameter(\n        UrlParameters.LineFilters,\n        `${lineFilter.key}|${escapeURLDelimiters(lineFilter.operator)}|${escapeURLDelimiters(\n          stringifyValues(lineFilter.value)\n        )}`,\n        params\n      );\n    }\n  }\n  if (fields?.length) {\n    for (const field of fields) {\n      if (field.type === LabelType.StructuredMetadata) {\n        if (field.key === LEVEL_VARIABLE_VALUE) {\n          params = appendUrlParameter(\n            UrlParameters.Levels,\n            `${field.key}|${field.operator}|${escapeURLDelimiters(stringifyValues(field.value))}`,\n            params\n          );\n        } else {\n          params = appendUrlParameter(\n            UrlParameters.Metadata,\n            `${field.key}|${field.operator}|${escapeURLDelimiters(\n              stringifyAdHocValues(field.value)\n            )},${escapeURLDelimiters(replaceEscapeChars(field.value))}`,\n            params\n          );\n        }\n      } else {\n        const fieldValue: AdHocFieldValue = {\n          value: field.value,\n          parser: field.parser,\n        };\n\n        const adHocFilterURLString = `${field.key}|${field.operator}|${escapeURLDelimiters(\n          stringifyAdHocValues(JSON.stringify(fieldValue))\n        )},${stringifyAdHocValueLabels(fieldValue.value)}`;\n\n        params = appendUrlParameter(UrlParameters.Fields, adHocFilterURLString, params);\n      }\n    }\n  }\n  if (patternFilters?.length) {\n    const patterns: AppliedPattern[] = [];\n\n    for (const field of patternFilters) {\n      patterns.push({\n        type: field.operator === PatternFilterOp.match ? 'include' : 'exclude',\n        pattern: stringifyValues(field.value),\n      });\n    }\n\n    let patternsString = renderPatternFilters(patterns);\n\n    params = appendUrlParameter(UrlParameters.Patterns, JSON.stringify(patterns), params);\n    params = appendUrlParameter(UrlParameters.PatternsVariable, patternsString, params);\n  }\n\n  return {\n    path: createAppUrl(`/explore/${labelName}/${labelValue}/logs`, params),\n  };\n}\n\nexport function createAppUrl(path = '/explore', urlParams?: URLSearchParams): string {\n  return `/a/${pluginJson.id}${path}${urlParams ? `?${urlParams.toString()}` : ''}`;\n}\n\nexport const UrlParameters = {\n  DatasourceId: `var-${VAR_DATASOURCE}`,\n  TimeRangeFrom: 'from',\n  TimeRangeTo: 'to',\n  Labels: `var-${VAR_LABELS}`,\n  Fields: `var-${VAR_FIELDS}`,\n  Metadata: `var-${VAR_METADATA}`,\n  Levels: `var-${VAR_LEVELS}`,\n  LineFilters: `var-${VAR_LINE_FILTERS}`,\n  Patterns: VAR_PATTERNS,\n  PatternsVariable: `var-${VAR_PATTERNS}`,\n} as const;\nexport type UrlParameterType = (typeof UrlParameters)[keyof typeof UrlParameters];\n\nexport function setUrlParameter(key: UrlParameterType, value: string, initalParams?: URLSearchParams): URLSearchParams {\n  const searchParams = new URLSearchParams(initalParams?.toString() ?? location.search);\n  searchParams.set(key, value);\n\n  return searchParams;\n}\n\nexport function appendUrlParameter(\n  key: UrlParameterType,\n  value: string,\n  initalParams?: URLSearchParams\n): URLSearchParams {\n  const searchParams = new URLSearchParams(initalParams?.toString() ?? location.search);\n  searchParams.append(key, value);\n\n  return searchParams;\n}\n\nexport function replaceSlash(parameter: string): string {\n  return (\n    stripAdHocFilterUserInputPrefix(parameter)\n      // back-slash is converted to forward-slash in the URL, replace that char\n      .replace(/\\//g, '-')\n      .replace(/\\\\/g, '-')\n  );\n}\n\n// Manually copied over from @grafana/scenes so we don't need to import scenes to build links\nfunction escapeUrlCommaDelimiters(value: string | undefined): string {\n  if (value === null || value === undefined) {\n    return '';\n  }\n\n  // Replace the comma due to using it as a value/label separator\n  return /,/g[Symbol.replace](value, '__gfc__');\n}\n\nexport function escapeUrlPipeDelimiters(value: string | undefined): string {\n  if (value === null || value === undefined) {\n    return '';\n  }\n\n  // Replace the pipe due to using it as a filter separator\n  return (value = /\\|/g[Symbol.replace](value, '__gfp__'));\n}\n\nexport function escapeURLDelimiters(value: string | undefined): string {\n  return escapeUrlCommaDelimiters(escapeUrlPipeDelimiters(value));\n}\n","// copied from public/app/plugins/datasource/loki/types.ts\nexport enum LabelType {\n  Indexed = 'I',\n  StructuredMetadata = 'S',\n  Parsed = 'P',\n}\n","// Warning: This file (and any imports) are included in the main bundle with Grafana in order to provide link extension support in Grafana core, in an effort to keep Grafana loading quickly, please do not add any unnecessary imports to this file and run the bundle analyzer before committing any changes!\n\nimport { LabelType } from './fieldsTypes';\nimport { ParserType } from './variables';\n\nexport type FilterOpType = LabelFilterOp | NumericFilterOp;\nexport enum LabelFilterOp {\n  Equal = '=',\n  NotEqual = '!=',\n  RegexEqual = '=~',\n  RegexNotEqual = '!~',\n}\n\nexport enum NumericFilterOp {\n  gt = '>',\n  lt = '<',\n  gte = '>=',\n  lte = '<=',\n}\nexport const FilterOp = { ...LabelFilterOp, ...NumericFilterOp };\n\nexport type IndexedLabelFilter = {\n  key: string;\n  operator: FilterOpType;\n  value: string;\n  type?: LabelType;\n};\n\nexport type FieldFilter = {\n  key: string;\n  operator: FilterOpType;\n  value: string;\n  type?: LabelType;\n  parser?: ParserType;\n};\n\nexport type LineFilterType = {\n  key: string;\n  operator: LineFilterOp;\n  value: string;\n};\n\nexport type PatternFilterType = {\n  operator: PatternFilterOp;\n  value: string;\n};\n\nexport enum LineFilterOp {\n  match = '|=',\n  negativeMatch = `!=`,\n  regex = '|~',\n  negativeRegex = `!~`,\n}\n\nexport enum PatternFilterOp {\n  match = '|>',\n  negativeMatch = '!>',\n}\n\nexport enum LineFilterCaseSensitive {\n  caseSensitive = 'caseSensitive',\n  caseInsensitive = 'caseInsensitive',\n}\n","import { LogContext } from '@grafana/faro-web-sdk';\nimport { FetchError, logError, logInfo, logWarning } from '@grafana/runtime';\nimport pluginJson from '../plugin.json';\nimport packageJson from '../../package.json';\nimport { isRecord } from './narrowing';\n\nconst defaultContext = {\n  app: pluginJson.id,\n  version: packageJson.version,\n};\n\nexport const logger = {\n  info: (msg: string, context?: LogContext) => {\n    const ctx = { ...defaultContext, ...context };\n    console.log(msg, ctx);\n    attemptFaroInfo(msg, ctx);\n  },\n  warn: (msg: string, context?: LogContext) => {\n    const ctx = { ...defaultContext, ...context };\n    console.warn(msg, ctx);\n    attemptFaroWarn(msg, ctx);\n  },\n  error: (err: Error | unknown, context?: LogContext) => {\n    const ctx = { ...defaultContext, ...context };\n    console.error(err, ctx);\n    attemptFaroErr(err, ctx);\n  },\n};\n\nconst attemptFaroInfo = (msg: string, context?: LogContext) => {\n  try {\n    logInfo(msg, context);\n  } catch (e) {\n    console.warn('Failed to log faro event!');\n  }\n};\n\nconst attemptFaroWarn = (msg: string, context?: LogContext) => {\n  try {\n    logWarning(msg, context);\n  } catch (e) {\n    console.warn('Failed to log faro warning!', { msg, context });\n  }\n};\n/**\n * Checks unknown error for properties from Records like FetchError and adds them to the context\n * @param err\n * @param context\n */\nfunction populateFetchErrorContext(err: unknown | FetchError, context: LogContext) {\n  if (typeof err === 'object' && err !== null) {\n    if (isRecord(err)) {\n      Object.keys(err).forEach((key: string) => {\n        const value = err[key];\n        if (typeof value === 'string' || typeof value === 'boolean' || typeof value === 'number') {\n          context[key] = value.toString();\n        }\n      });\n    }\n\n    if (hasData(err)) {\n      if (typeof err.data === 'object' && err.data !== null) {\n        try {\n          context.data = JSON.stringify(err.data);\n        } catch (e) {\n          // do nothing\n        }\n      } else if (typeof err.data === 'string' || typeof err.data === 'boolean' || typeof err.data === 'number') {\n        context.data = err.data.toString();\n      }\n    }\n  }\n}\n\nconst attemptFaroErr = (err: Error | FetchError | unknown, context2: LogContext) => {\n  let context = context2;\n  try {\n    populateFetchErrorContext(err, context);\n\n    if (err instanceof Error) {\n      logError(err, context);\n    } else if (typeof err === 'string') {\n      logError(new Error(err), context);\n    } else if (err && typeof err === 'object') {\n      if (context.msg) {\n        logError(new Error(context.msg), context);\n      } else {\n        logError(new Error('error object'), context);\n      }\n    } else {\n      logError(new Error('unknown error'), context);\n    }\n  } catch (e) {\n    console.error('Failed to log faro error!', { err, context });\n  }\n};\n\nconst hasData = (value: object): value is { data: unknown } => {\n  return 'data' in value;\n};\n","// Warning: This file (and any imports) are included in the main bundle with Grafana in order to provide link extension support in Grafana core, in an effort to keep Grafana loading quickly, please do not add any unnecessary imports to this file and run the bundle analyzer before committing any changes!\n\nimport {\n  Bytes,\n  Duration,\n  Eq,\n  FilterOp,\n  Gte,\n  Gtr,\n  Identifier,\n  Json,\n  LabelFilter,\n  LineFilter,\n  Logfmt,\n  Lss,\n  Lte,\n  Matcher,\n  Neq,\n  Npa,\n  Nre,\n  Number,\n  OrFilter,\n  parser,\n  PipeExact,\n  PipeMatch,\n  PipePattern,\n  Re,\n  Selector,\n  String,\n} from '@grafana/lezer-logql';\nimport { NodeType, SyntaxNode, Tree } from '@lezer/common';\nimport {\n  FieldFilter,\n  FilterOp as FilterOperator,\n  FilterOpType,\n  IndexedLabelFilter,\n  LineFilterCaseSensitive,\n  LineFilterOp,\n  LineFilterType,\n  PatternFilterOp,\n  PatternFilterType,\n} from './filterTypes';\nimport { PluginExtensionPanelContext } from '@grafana/data';\nimport { getLabelTypeFromFrame, LokiQuery } from './lokiQuery';\nimport { LabelType } from './fieldsTypes';\nimport { ParserType } from './variables';\n\nexport class NodePosition {\n  from: number;\n  to: number;\n  type?: NodeType;\n  syntaxNode?: SyntaxNode;\n\n  constructor(from: number, to: number, syntaxNode?: SyntaxNode, type?: NodeType) {\n    this.from = from;\n    this.to = to;\n    this.type = type;\n    this.syntaxNode = syntaxNode;\n  }\n\n  static fromNode(node: SyntaxNode): NodePosition {\n    return new NodePosition(node.from, node.to, node, node.type);\n  }\n\n  contains(position: NodePosition): boolean {\n    return this.from <= position.from && this.to >= position.to;\n  }\n\n  getExpression(query: string): string {\n    return query.substring(this.from, this.to);\n  }\n}\n\nexport function getNodesFromQuery(query: string, nodeTypes?: number[]): SyntaxNode[] {\n  const nodes: SyntaxNode[] = [];\n  const tree: Tree = parser.parse(query);\n  tree.iterate({\n    enter: (node): false | void => {\n      if (nodeTypes === undefined || nodeTypes.includes(node.type.id)) {\n        nodes.push(node.node);\n      }\n    },\n  });\n  return nodes;\n}\n\nfunction getAllPositionsInNodeByType(node: SyntaxNode, type: number): NodePosition[] {\n  if (node.type.id === type) {\n    return [NodePosition.fromNode(node)];\n  }\n\n  const positions: NodePosition[] = [];\n  let pos = 0;\n  let child = node.childAfter(pos);\n  while (child) {\n    positions.push(...getAllPositionsInNodeByType(child, type));\n    pos = child.to;\n    child = node.childAfter(pos);\n  }\n  return positions;\n}\n\nfunction parseLabelFilters(query: string, filter: IndexedLabelFilter[]) {\n  // `Matcher` will select field filters as well as indexed label filters\n  const allMatcher = getNodesFromQuery(query, [Matcher]);\n  for (const matcher of allMatcher) {\n    const identifierPosition = getAllPositionsInNodeByType(matcher, Identifier);\n    const valuePosition = getAllPositionsInNodeByType(matcher, String);\n    const operator = query.substring(identifierPosition[0]?.to, valuePosition[0]?.from);\n    const key = identifierPosition[0].getExpression(query);\n    const value = valuePosition.map((position) => query.substring(position.from + 1, position.to - 1))[0];\n\n    if (\n      !key ||\n      !value ||\n      (operator !== FilterOperator.NotEqual &&\n        operator !== FilterOperator.Equal &&\n        operator !== FilterOperator.RegexEqual &&\n        operator !== FilterOperator.RegexNotEqual)\n    ) {\n      continue;\n    }\n\n    filter.push({\n      key,\n      operator,\n      value,\n      type: LabelType.Indexed,\n    });\n  }\n}\n\nfunction parseNonPatternFilters(\n  lineFilterValue: string,\n  quoteString: string,\n  lineFilters: LineFilterType[],\n  index: number,\n  operator: LineFilterOp\n) {\n  const isRegexSelector = operator === LineFilterOp.regex || operator === LineFilterOp.negativeRegex;\n  const isCaseInsensitive = lineFilterValue.includes('(?i)') && isRegexSelector;\n\n  // If quoteString is `, we shouldn't need to un-escape anything\n  // But if the quoteString is \", we'll need to remove double escape chars, as these values are re-escaped when building the query expression (but not stored in the value/url)\n  if (quoteString === '\"' && isRegexSelector) {\n    const replaceDoubleEscape = new RegExp(/\\\\\\\\/, 'g');\n    lineFilterValue = lineFilterValue.replace(replaceDoubleEscape, '\\\\');\n  } else if (quoteString === '\"') {\n    const replaceDoubleQuoteEscape = new RegExp(/\\\\\\\\\\\"/, 'g');\n    lineFilterValue = lineFilterValue.replace(replaceDoubleQuoteEscape, '\"');\n\n    const replaceDoubleEscape = new RegExp(/\\\\\\\\/, 'g');\n    lineFilterValue = lineFilterValue.replace(replaceDoubleEscape, '\\\\');\n  }\n\n  if (isCaseInsensitive) {\n    // If `(?i)` exists in a regex it would need to be escaped to match log lines containing `(?i)`, so it should be safe to replace all instances of `(?i)` in the line filter?\n    lineFilterValue = lineFilterValue.replace('(?i)', '');\n  }\n\n  lineFilters.push({\n    key: isCaseInsensitive\n      ? LineFilterCaseSensitive.caseInsensitive.toString()\n      : LineFilterCaseSensitive.caseSensitive.toString() + ',' + index.toString(),\n    operator: operator,\n    value: lineFilterValue,\n  });\n\n  return lineFilterValue;\n}\n\nfunction parsePatternFilters(lineFilterValue: string, patternFilters: PatternFilterType[], operator: PatternFilterOp) {\n  const replaceDoubleQuoteEscape = new RegExp(/\\\\\"/, 'g');\n  lineFilterValue = lineFilterValue.replace(replaceDoubleQuoteEscape, '\"');\n  patternFilters.push({\n    operator,\n    value: lineFilterValue,\n  });\n}\n\nfunction parseLineFilters(query: string, lineFilters: LineFilterType[], patternFilters: PatternFilterType[]) {\n  const allLineFilters = getNodesFromQuery(query, [LineFilter]);\n  for (const [index, matcher] of allLineFilters.entries()) {\n    const equal = getAllPositionsInNodeByType(matcher, PipeExact);\n    const pipeRegExp = getAllPositionsInNodeByType(matcher, PipeMatch);\n    const notEqual = getAllPositionsInNodeByType(matcher, Neq);\n    const notEqualRegExp = getAllPositionsInNodeByType(matcher, Nre);\n    const patternInclude = getAllPositionsInNodeByType(matcher, PipePattern);\n    const patternExclude = getAllPositionsInNodeByType(matcher, Npa);\n\n    const lineFilterValueNodes = getStringsFromLineFilter(matcher);\n\n    for (const lineFilterValueNode of lineFilterValueNodes) {\n      const quoteString = query.substring(lineFilterValueNode?.from + 1, lineFilterValueNode?.from);\n\n      // Remove quotes\n      let lineFilterValue = query.substring(lineFilterValueNode?.from + 1, lineFilterValueNode?.to - 1);\n\n      if (lineFilterValue.length) {\n        let operator;\n        if (equal.length) {\n          operator = LineFilterOp.match;\n        } else if (notEqual.length) {\n          operator = LineFilterOp.negativeMatch;\n        } else if (notEqualRegExp.length) {\n          operator = LineFilterOp.negativeRegex;\n        } else if (pipeRegExp.length) {\n          operator = LineFilterOp.regex;\n        } else if (patternInclude.length) {\n          operator = PatternFilterOp.match;\n        } else if (patternExclude.length) {\n          operator = PatternFilterOp.negativeMatch;\n        } else {\n          console.warn('unknown line filter', {\n            query: query.substring(matcher.from, matcher.to),\n          });\n\n          continue;\n        }\n\n        if (!(operator === PatternFilterOp.match || operator === PatternFilterOp.negativeMatch)) {\n          parseNonPatternFilters(lineFilterValue, quoteString, lineFilters, index, operator);\n        } else {\n          parsePatternFilters(lineFilterValue, patternFilters, operator);\n        }\n      }\n    }\n  }\n}\n\nfunction getNumericFieldOperator(matcher: SyntaxNode) {\n  if (getAllPositionsInNodeByType(matcher, Lte).length) {\n    return FilterOperator.lte;\n  } else if (getAllPositionsInNodeByType(matcher, Lss).length) {\n    return FilterOperator.lt;\n  } else if (getAllPositionsInNodeByType(matcher, Gte).length) {\n    return FilterOperator.gte;\n  } else if (getAllPositionsInNodeByType(matcher, Gtr).length) {\n    return FilterOperator.gt;\n  }\n\n  console.warn('unknown numeric operator');\n\n  return undefined;\n}\n\nfunction getStringFieldOperator(matcher: SyntaxNode) {\n  if (getAllPositionsInNodeByType(matcher, Eq).length) {\n    return FilterOperator.Equal; // =\n  } else if (getAllPositionsInNodeByType(matcher, Neq).length) {\n    return FilterOperator.NotEqual; // !=\n  } else if (getAllPositionsInNodeByType(matcher, Re).length) {\n    return FilterOperator.RegexEqual; // =~\n  } else if (getAllPositionsInNodeByType(matcher, Nre).length) {\n    return FilterOperator.RegexNotEqual; // !~\n  }\n\n  return undefined;\n}\n\nfunction parseFields(query: string, fields: FieldFilter[], context: PluginExtensionPanelContext, lokiQuery: LokiQuery) {\n  const dataFrame = context.data?.series.find((frame) => frame.refId === lokiQuery.refId);\n  // We do not currently support \"or\" in Grafana Logs Drilldown, so grab the left hand side LabelFilter leaf nodes as this will be the first filter expression in a given pipeline stage\n  const allFields = getNodesFromQuery(query, [LabelFilter]);\n  for (const matcher of allFields) {\n    const position = NodePosition.fromNode(matcher);\n    const expression = position.getExpression(query);\n    const isParentNode = matcher.getChild(LabelFilter);\n\n    // If the Label filter contains other Label Filter nodes, we want to skip this node so we only add the leaf LabelFilter nodes\n    if (isParentNode) {\n      continue;\n    }\n\n    // Skip error expression, it will get added automatically when Grafana Logs Drilldown adds a parser\n    if (expression.substring(0, 9) === `__error__`) {\n      continue;\n    }\n\n    // @todo we need to use detected_fields API to get the \"right\" parser for a specific field\n    // Currently we just check to see if there is a parser before the current node, this means that queries that are placing metadata filters after the parser will query the metadata field as a parsed field, which will lead to degraded performance\n    const logFmtParser = getNodesFromQuery(query.substring(0, matcher.node.to), [Logfmt]);\n    const jsonParser = getNodesFromQuery(query.substring(0, matcher.node.to), [Json]);\n\n    // field filter key\n    const fieldNameNode = getAllPositionsInNodeByType(matcher, Identifier);\n    const fieldName = fieldNameNode[0]?.getExpression(query);\n\n    // field filter value\n    const fieldStringValue = getAllPositionsInNodeByType(matcher, String);\n    const fieldNumberValue = getAllPositionsInNodeByType(matcher, Number);\n    const fieldBytesValue = getAllPositionsInNodeByType(matcher, Bytes);\n    const fieldDurationValue = getAllPositionsInNodeByType(matcher, Duration);\n\n    let fieldValue: string, operator: FilterOpType | undefined;\n    if (fieldStringValue.length) {\n      operator = getStringFieldOperator(matcher);\n      // Strip out quotes\n      fieldValue = query.substring(fieldStringValue[0].from + 1, fieldStringValue[0].to - 1);\n    } else if (fieldNumberValue.length) {\n      fieldValue = fieldNumberValue[0].getExpression(query);\n      operator = getNumericFieldOperator(matcher);\n    } else if (fieldDurationValue.length) {\n      operator = getNumericFieldOperator(matcher);\n      fieldValue = fieldDurationValue[0].getExpression(query);\n    } else if (fieldBytesValue.length) {\n      operator = getNumericFieldOperator(matcher);\n      fieldValue = fieldBytesValue[0].getExpression(query);\n    } else {\n      continue;\n    }\n\n    // Label type\n    let labelType: LabelType | undefined;\n    if (dataFrame) {\n      // @todo if the field label is not in the first line, we'll always add this filter as a field filter\n      // Also negative filters that exclude all values of a field will always fail to get a label type for that exclusion filter?\n      labelType = getLabelTypeFromFrame(fieldName, dataFrame) ?? undefined;\n    }\n\n    if (operator) {\n      let parser: ParserType | undefined;\n      if (logFmtParser.length && jsonParser.length) {\n        parser = 'mixed';\n      } else if (logFmtParser.length) {\n        parser = 'logfmt';\n      } else if (jsonParser.length) {\n        parser = 'json';\n      } else {\n        // If there is no parser in the query, the field would have to be metadata or an invalid query?\n        labelType = LabelType.StructuredMetadata;\n      }\n\n      fields.push({\n        key: fieldName,\n        operator: operator,\n        type: labelType ?? LabelType.Parsed,\n        parser,\n        value: fieldValue,\n      });\n    }\n  }\n}\n\nexport function getMatcherFromQuery(\n  query: string,\n  context: PluginExtensionPanelContext,\n  lokiQuery: LokiQuery\n): {\n  labelFilters: IndexedLabelFilter[];\n  lineFilters?: LineFilterType[];\n  fields?: FieldFilter[];\n  patternFilters?: PatternFilterType[];\n} {\n  const filter: IndexedLabelFilter[] = [];\n  const lineFilters: LineFilterType[] = [];\n  const patternFilters: PatternFilterType[] = [];\n  const fields: FieldFilter[] = [];\n  const selector = getNodesFromQuery(query, [Selector]);\n\n  if (selector.length === 0) {\n    return { labelFilters: filter };\n  }\n\n  // Get the stream selector portion of the query\n  const selectorQuery = getAllPositionsInNodeByType(selector[0], Selector)[0].getExpression(query);\n\n  parseLabelFilters(selectorQuery, filter);\n  parseLineFilters(query, lineFilters, patternFilters);\n  parseFields(query, fields, context, lokiQuery);\n\n  return { labelFilters: filter, lineFilters, fields, patternFilters };\n}\n\nexport function isQueryWithNode(query: string, nodeType: number): boolean {\n  let isQueryWithNode = false;\n  const tree = parser.parse(query);\n  tree.iterate({\n    enter: ({ type }): false | void => {\n      if (type.id === nodeType) {\n        isQueryWithNode = true;\n        return false;\n      }\n    },\n  });\n  return isQueryWithNode;\n}\n\n/**\n * Parses the query and looks for error nodes. If there is at least one, it returns true.\n * Grafana variables are considered errors, so if you need to validate a query\n * with variables you should interpolate it first.\n */\nexport const ErrorId = 0;\nexport function isValidQuery(query: string): boolean {\n  return isQueryWithNode(query, ErrorId) === false;\n}\n\nfunction getStringsFromLineFilter(filter: SyntaxNode): SyntaxNode[] {\n  const nodes: SyntaxNode[] = [];\n  let node: SyntaxNode | null = filter;\n  do {\n    const string = node.getChild(String);\n    if (string && !node.getChild(FilterOp)) {\n      nodes.push(string);\n    }\n    node = node.getChild(OrFilter);\n  } while (node != null);\n\n  return nodes;\n}\n","// Warning: This file (and any imports) are included in the main bundle with Grafana in order to provide link extension support in Grafana core, in an effort to keep Grafana loading quickly, please do not add any unnecessary imports to this file and run the bundle analyzer before committing any changes!\nimport { DataSourceRef } from '@grafana/schema';\nimport { DataSourceWithBackend } from '@grafana/runtime';\nimport { DataFrame, DataSourceJsonData, ScopedVars, TimeRange } from '@grafana/data';\nimport { LabelType } from './fieldsTypes';\n\nexport enum LokiQueryDirection {\n  Backward = 'backward',\n  Forward = 'forward',\n  Scan = 'scan',\n}\n\nexport type LokiQuery = {\n  refId: string;\n  queryType?: LokiQueryType;\n  editorMode?: string;\n  supportingQueryType?: string;\n  expr: string;\n  legendFormat?: string;\n  splitDuration?: string;\n  datasource?: DataSourceRef;\n  maxLines?: number;\n  direction?: LokiQueryDirection;\n};\n\nexport type LokiQueryType = 'instant' | 'range' | 'stream' | string;\n\nexport type LokiDatasource = DataSourceWithBackend<LokiQuery, DataSourceJsonData> & {\n  maxLines?: number;\n} & {\n  // @todo delete after min supported grafana is upgraded to >=11.6\n  interpolateString?: (string: string, scopedVars?: ScopedVars) => string;\n  getTimeRangeParams: (timeRange: TimeRange) => { start: number; end: number };\n};\n\nexport function getLabelTypeFromFrame(labelKey: string, frame: DataFrame, index = 0): null | LabelType {\n  const typeField = frame.fields.find((field) => field.name === 'labelTypes')?.values[index];\n  if (!typeField) {\n    return null;\n  }\n  switch (typeField[labelKey]) {\n    case 'I':\n      return LabelType.Indexed;\n    case 'S':\n      return LabelType.StructuredMetadata;\n    case 'P':\n      return LabelType.Parsed;\n    default:\n      return null;\n  }\n}\n","import { SelectedTableRow } from '../Components/Table/LogLineCellComponent';\nimport { LogsVisualizationType } from './store';\nimport { FieldValue, ParserType } from './variables';\nimport { LogsSortOrder, RawTimeRange } from '@grafana/data';\nimport { LabelFilterOp, NumericFilterOp } from './filterTypes';\n\nconst isObj = (o: unknown): o is object => typeof o === 'object' && o !== null;\n\nfunction hasProp<K extends PropertyKey>(data: object, prop: K): data is Record<K, unknown> {\n  return prop in data;\n}\n\nconst isString = (s: unknown) => (typeof s === 'string' && s) || '';\n\nexport const isRecord = (obj: unknown): obj is Record<string, unknown> => typeof obj === 'object';\n\nexport function unknownToStrings(a: unknown): string[] {\n  let strings: string[] = [];\n  if (Array.isArray(a)) {\n    for (let i = 0; i < a.length; i++) {\n      strings.push(isString(a[i]));\n    }\n  }\n  return strings;\n}\n\nexport function narrowSelectedTableRow(o: unknown): SelectedTableRow | false {\n  const narrowed = isObj(o) && hasProp(o, 'row') && hasProp(o, 'id') && o;\n\n  if (narrowed) {\n    const row = typeof narrowed.row === 'number' && narrowed.row;\n    const id = typeof narrowed.id === 'string' && narrowed.id;\n    if (id !== false && row !== false) {\n      return { row, id };\n    }\n  }\n\n  return false;\n}\n\nexport function narrowLogsVisualizationType(o: unknown): LogsVisualizationType | false {\n  return typeof o === 'string' && (o === 'logs' || o === 'table') && o;\n}\nexport function narrowLogsSortOrder(o: unknown): LogsSortOrder | false {\n  if (typeof o === 'string' && o === LogsSortOrder.Ascending.toString()) {\n    return LogsSortOrder.Ascending;\n  }\n\n  if (typeof o === 'string' && o === LogsSortOrder.Descending.toString()) {\n    return LogsSortOrder.Descending;\n  }\n\n  return false;\n}\n\nexport function narrowFieldValue(o: unknown): FieldValue | false {\n  const narrowed = isObj(o) && hasProp(o, 'value') && hasProp(o, 'parser') && o;\n\n  if (narrowed) {\n    const parser: ParserType | false =\n      typeof narrowed.parser === 'string' &&\n      (narrowed.parser === 'logfmt' ||\n        narrowed.parser === 'json' ||\n        narrowed.parser === 'mixed' ||\n        narrowed.parser === 'structuredMetadata') &&\n      narrowed.parser;\n    const value = typeof narrowed.value === 'string' && narrowed.value;\n\n    if (parser !== false && value !== false) {\n      return { parser, value };\n    }\n  }\n\n  return false;\n}\n\nexport function narrowRecordStringNumber(o: unknown): Record<string, number> | false {\n  const narrowed = isObj(o) && isRecord(o) && o;\n\n  if (narrowed) {\n    const keys = Object.keys(narrowed);\n    const returnRecord: Record<string, number> = {};\n    for (let i = 0; i < keys.length; i++) {\n      const key = keys[i];\n      const value = narrowed[keys[i]];\n      if (typeof value === 'number') {\n        returnRecord[key] = value;\n      }\n    }\n\n    return returnRecord;\n  }\n\n  return false;\n}\n\nexport function narrowTimeRange(unknownRange: unknown): RawTimeRange | undefined {\n  const range = isObj(unknownRange) && hasProp(unknownRange, 'to') && hasProp(unknownRange, 'from') && unknownRange;\n  if (range) {\n    const to = isString(range.to);\n    const from = isString(range.from);\n    if (to && from) {\n      return { to, from };\n    }\n  }\n\n  return undefined;\n}\n\nexport function narrowFilterOperator(op: string): LabelFilterOp | NumericFilterOp {\n  switch (op) {\n    case LabelFilterOp.Equal:\n    case LabelFilterOp.NotEqual:\n    case LabelFilterOp.RegexEqual:\n    case LabelFilterOp.RegexNotEqual:\n    case NumericFilterOp.gt:\n    case NumericFilterOp.gte:\n    case NumericFilterOp.lt:\n    case NumericFilterOp.lte:\n      return op;\n    default:\n      throw new NarrowingError('operator is invalid!');\n  }\n}\n\nexport class NarrowingError extends Error {}\n","import { FilterOp, FilterOpType, NumericFilterOp } from './filterTypes';\nimport { numericOperatorArray } from './operators';\n\nexport const isOperatorInclusive = (op: string | FilterOpType): boolean => {\n  return op === FilterOp.Equal || op === FilterOp.RegexEqual;\n};\nexport const isOperatorExclusive = (op: string | FilterOpType): boolean => {\n  return op === FilterOp.NotEqual || op === FilterOp.RegexNotEqual;\n};\nexport const isOperatorRegex = (op: string | FilterOpType): boolean => {\n  return op === FilterOp.RegexEqual || op === FilterOp.RegexNotEqual;\n};\nexport const isOperatorNumeric = (op: string | NumericFilterOp): boolean => {\n  return numericOperatorArray.includes(op);\n};\n","import { FilterOp, FilterOpType } from './filterTypes';\nimport { logger } from './logger';\n\nexport function getOperatorDescription(op: FilterOpType): string {\n  if (op === FilterOp.NotEqual) {\n    return 'Not equal';\n  }\n  if (op === FilterOp.RegexNotEqual) {\n    return 'Does not match regex';\n  }\n  if (op === FilterOp.Equal) {\n    return 'Equals';\n  }\n  if (op === FilterOp.RegexEqual) {\n    return 'Matches regex';\n  }\n  if (op === FilterOp.lt) {\n    return 'Less than';\n  }\n  if (op === FilterOp.gt) {\n    return 'Greater than';\n  }\n  if (op === FilterOp.gte) {\n    return 'Greater than or equal to';\n  }\n  if (op === FilterOp.lte) {\n    return 'Less than or equal to';\n  }\n\n  const error = new Error('Invalid operator!');\n  logger.error(error, { msg: 'Invalid operator', operator: op });\n  throw error;\n}\n","import { FilterOp, LineFilterOp } from './filterTypes';\nimport { SelectableValue } from '@grafana/data';\nimport { getOperatorDescription } from './getOperatorDescription';\n\nexport const operators = [FilterOp.Equal, FilterOp.NotEqual, FilterOp.RegexEqual, FilterOp.RegexNotEqual].map<\n  SelectableValue<string>\n>((value, index, array) => {\n  return {\n    description: getOperatorDescription(value),\n    label: value,\n    value,\n  };\n});\n\nexport const includeOperators = [FilterOp.Equal, FilterOp.RegexEqual].map<SelectableValue<string>>((value) => ({\n  description: getOperatorDescription(value),\n  label: value,\n  value,\n}));\n\nexport const numericOperatorArray = [FilterOp.gt, FilterOp.gte, FilterOp.lt, FilterOp.lte];\n\nexport const numericOperators = numericOperatorArray.map<SelectableValue<string>>((value) => ({\n  description: getOperatorDescription(value),\n  label: value,\n  value,\n}));\n\nexport const lineFilterOperators: SelectableValue[] = [\n  { label: 'match', value: LineFilterOp.match },\n  { label: 'negativeMatch', value: LineFilterOp.negativeMatch },\n  { label: 'regex', value: LineFilterOp.regex },\n  { label: 'negativeRegex', value: LineFilterOp.negativeRegex },\n];\n","// Warning, this file is included in the main module.tsx bundle, and doesn't contain any imports to keep that bundle size small. Don't add imports to this file!\n\n/**\n * Methods copied from scenes that we want in the module (to generate links which cannot be lazy loaded), without including all of scenes.\n * See https://github.com/grafana/scenes/issues/1046\n */\n// based on the openmetrics-documentation, the 3 symbols we have to handle are:\n// - \\n ... the newline character\n// - \\  ... the backslash character\n// - \"  ... the double-quote character\nexport function escapeLabelValueInExactSelector(labelValue: string): string {\n  return labelValue.replace(/\\\\/g, '\\\\\\\\').replace(/\\n/g, '\\\\n').replace(/\"/g, '\\\\\"');\n}\n","// Warning, this file is included in the main module.tsx bundle, and doesn't contain many imports to keep that bundle size small. Don't add imports to this file!\nimport { AppliedPattern } from './variables';\nimport { escapeLabelValueInExactSelector } from './extensions/scenesMethods';\n\nexport function renderPatternFilters(patterns: AppliedPattern[]) {\n  const excludePatterns = patterns.filter((pattern) => pattern.type === 'exclude');\n  const excludePatternsLine = excludePatterns\n    .map((p) => `!> \"${escapeLabelValueInExactSelector(p.pattern)}\"`)\n    .join(' ')\n    .trim();\n\n  const includePatterns = patterns.filter((pattern) => pattern.type === 'include');\n  let includePatternsLine = '';\n  if (includePatterns.length > 0) {\n    if (includePatterns.length === 1) {\n      includePatternsLine = `|> \"${escapeLabelValueInExactSelector(includePatterns[0].pattern)}\"`;\n    } else {\n      includePatternsLine = `|> ${includePatterns\n        .map((p) => `\"${escapeLabelValueInExactSelector(p.pattern)}\"`)\n        .join(' or ')}`;\n    }\n  }\n  return `${excludePatternsLine} ${includePatternsLine}`.trim();\n}\n","// Warning, this file is included in the main module.tsx bundle, and doesn't contain any imports to keep that bundle size small. Don't add imports to this file!\n\nimport { AdHocFilterWithLabels } from '@grafana/scenes';\n\nexport interface FieldValue {\n  value: string;\n  parser: ParserType;\n}\n\nexport interface AdHocFieldValue {\n  value?: string;\n  parser?: ParserType;\n}\nexport interface AppliedPattern {\n  pattern: string;\n  type: 'include' | 'exclude';\n}\n\nexport type ParserType = 'logfmt' | 'json' | 'mixed' | 'structuredMetadata';\nexport type DetectedFieldType = 'int' | 'float' | 'duration' | 'bytes' | 'boolean' | 'string';\nexport type AdHocFilterWithLabelsMeta = { parser?: ParserType; type?: DetectedFieldType };\nexport type AdHocFiltersWithLabelsAndMeta = AdHocFilterWithLabels<AdHocFilterWithLabelsMeta>;\n\nexport type LogsQueryOptions = {\n  labelExpressionToAdd?: string;\n  structuredMetadataToAdd?: string;\n  fieldExpressionToAdd?: string;\n  parser?: ParserType;\n  fieldType?: DetectedFieldType;\n};\n\nexport const VAR_LABELS = 'filters';\nexport const VAR_LABELS_EXPR = '${filters}';\nexport const VAR_LABELS_REPLICA = 'filters_replica';\nexport const VAR_LABELS_REPLICA_EXPR = '${filters_replica}';\nexport const VAR_FIELDS = 'fields';\nexport const VAR_FIELDS_EXPR = '${fields}';\nexport const PENDING_FIELDS_EXPR = '${pendingFields}';\nexport const PENDING_METADATA_EXPR = '${pendingMetadata}';\nexport const VAR_FIELDS_AND_METADATA = 'all-fields';\nexport const VAR_METADATA = 'metadata';\nexport const VAR_METADATA_EXPR = '${metadata}';\nexport const VAR_PATTERNS = 'patterns';\nexport const VAR_PATTERNS_EXPR = '${patterns}';\nexport const VAR_LEVELS = 'levels';\nexport const VAR_LEVELS_EXPR = '${levels}';\nexport const VAR_FIELD_GROUP_BY = 'fieldBy';\nexport const VAR_LABEL_GROUP_BY = 'labelBy';\nexport const VAR_LABEL_GROUP_BY_EXPR = '${labelBy}';\nexport const VAR_PRIMARY_LABEL_SEARCH = 'primary_label_search';\nexport const VAR_PRIMARY_LABEL_SEARCH_EXPR = '${primary_label_search}';\nexport const VAR_PRIMARY_LABEL = 'primary_label';\nexport const VAR_PRIMARY_LABEL_EXPR = '${primary_label}';\nexport const VAR_DATASOURCE = 'ds';\nexport const VAR_DATASOURCE_EXPR = '${ds}';\nexport const MIXED_FORMAT_EXPR = `| json | logfmt | drop __error__, __error_details__`;\nexport const JSON_FORMAT_EXPR = `| json | drop __error__, __error_details__`;\nexport const LOGS_FORMAT_EXPR = `| logfmt`;\n// This variable is hardcoded to the value of MIXED_FORMAT_EXPR. This is a hack to get logs context working, we don't want to use a variable for a value that doesn't change and cannot be updated by the user.\nexport const VAR_LOGS_FORMAT = 'logsFormat';\nexport const VAR_LOGS_FORMAT_EXPR = '${logsFormat}';\n// The deprecated line filter (custom variable)\nexport const VAR_LINE_FILTER_DEPRECATED = 'lineFilter';\n// The new single value line filter (ad-hoc variable), results are added to VAR_LINE_FILTER_AD_HOC when \"submitted\"\nexport const VAR_LINE_FILTER = 'lineFilterV2';\nexport const VAR_LINE_FILTER_EXPR = '${lineFilterV2}';\n// The new multi value line filter (ad-hoc variable)\nexport const VAR_LINE_FILTERS = 'lineFilters';\nexport const VAR_LINE_FILTERS_EXPR = '${lineFilters}';\nexport const LOG_STREAM_SELECTOR_EXPR = `{${VAR_LABELS_EXPR}} ${VAR_LEVELS_EXPR} ${VAR_METADATA_EXPR} ${VAR_PATTERNS_EXPR} ${VAR_LINE_FILTERS_EXPR} ${VAR_LOGS_FORMAT_EXPR} ${VAR_FIELDS_EXPR}`;\n// Same as the LOG_STREAM_SELECTOR_EXPR, but without the fields as they will need to be built manually to exclude the current filter value\nexport const DETECTED_FIELD_VALUES_EXPR = `{${VAR_LABELS_EXPR}} ${VAR_LEVELS_EXPR} ${VAR_METADATA_EXPR} ${VAR_PATTERNS_EXPR} ${VAR_LINE_FILTERS_EXPR} ${VAR_LOGS_FORMAT_EXPR} ${PENDING_FIELDS_EXPR}`;\nexport const DETECTED_FIELD_AND_METADATA_VALUES_EXPR = `{${VAR_LABELS_EXPR}} ${VAR_LEVELS_EXPR} ${PENDING_METADATA_EXPR} ${VAR_PATTERNS_EXPR} ${VAR_LINE_FILTERS_EXPR} ${VAR_LOGS_FORMAT_EXPR} ${PENDING_FIELDS_EXPR}`;\nexport const DETECTED_METADATA_VALUES_EXPR = `{${VAR_LABELS_EXPR}} ${VAR_LEVELS_EXPR} ${PENDING_FIELDS_EXPR} ${VAR_PATTERNS_EXPR} ${VAR_LINE_FILTERS_EXPR} ${VAR_LOGS_FORMAT_EXPR} ${VAR_FIELDS_EXPR}`;\nexport const DETECTED_LEVELS_VALUES_EXPR = `{${VAR_LABELS_EXPR}} ${PENDING_FIELDS_EXPR} ${VAR_METADATA_EXPR} ${VAR_PATTERNS_EXPR} ${VAR_LINE_FILTERS_EXPR} ${VAR_LOGS_FORMAT_EXPR} ${VAR_FIELDS_EXPR}`;\nexport const PATTERNS_SAMPLE_SELECTOR_EXPR = `{${VAR_LABELS_EXPR}} ${VAR_METADATA_EXPR} ${VAR_PATTERNS_EXPR} ${VAR_LOGS_FORMAT_EXPR}`;\nexport const PRETTY_LOG_STREAM_SELECTOR_EXPR = `${VAR_LABELS_EXPR} ${VAR_LEVELS_EXPR} ${VAR_METADATA_EXPR} ${VAR_PATTERNS_EXPR} ${VAR_LINE_FILTERS_EXPR} ${VAR_FIELDS_EXPR}`;\nexport const EXPLORATION_DS = { uid: VAR_DATASOURCE_EXPR };\nexport const ALL_VARIABLE_VALUE = '$__all';\nexport const LEVEL_VARIABLE_VALUE = 'detected_level';\nexport const SERVICE_NAME = 'service_name';\nexport const SERVICE_UI_LABEL = 'service';\nexport const VAR_AGGREGATED_METRICS = 'var_aggregated_metrics';\nexport const VAR_AGGREGATED_METRICS_EXPR = '${var_aggregated_metrics}';\nexport const EMPTY_VARIABLE_VALUE = '\"\"';\n\n// Delimiter used at the start of a label value to denote user input that should not be escaped\n// @todo we need ad-hoc-filter meta that is persisted in the URL so we can clean this up.\nexport const USER_INPUT_ADHOC_VALUE_PREFIX = '__CVΩ__';\nexport function stripAdHocFilterUserInputPrefix(value = '') {\n  if (value.startsWith(USER_INPUT_ADHOC_VALUE_PREFIX)) {\n    return value.substring(USER_INPUT_ADHOC_VALUE_PREFIX.length);\n  }\n  return value;\n}\nexport function isAdHocFilterValueUserInput(value = '') {\n  return value.startsWith(USER_INPUT_ADHOC_VALUE_PREFIX);\n}\nexport function addAdHocFilterUserInputPrefix(value = '') {\n  return USER_INPUT_ADHOC_VALUE_PREFIX + value;\n}\n","module.exports = __WEBPACK_EXTERNAL_MODULE__6089__;","module.exports = __WEBPACK_EXTERNAL_MODULE__7781__;","module.exports = __WEBPACK_EXTERNAL_MODULE__8531__;","module.exports = __WEBPACK_EXTERNAL_MODULE__2007__;","module.exports = __WEBPACK_EXTERNAL_MODULE__3241__;","module.exports = __WEBPACK_EXTERNAL_MODULE__5959__;","module.exports = __WEBPACK_EXTERNAL_MODULE__8398__;","module.exports = __WEBPACK_EXTERNAL_MODULE__200__;","module.exports = __WEBPACK_EXTERNAL_MODULE__3806__;","module.exports = __WEBPACK_EXTERNAL_MODULE__7694__;","module.exports = __WEBPACK_EXTERNAL_MODULE__1269__;","/**\nThe default maximum length of a `TreeBuffer` node.\n*/\nconst DefaultBufferLength = 1024;\nlet nextPropID = 0;\nclass Range {\n    constructor(from, to) {\n        this.from = from;\n        this.to = to;\n    }\n}\n/**\nEach [node type](#common.NodeType) or [individual tree](#common.Tree)\ncan have metadata associated with it in props. Instances of this\nclass represent prop names.\n*/\nclass NodeProp {\n    /**\n    Create a new node prop type.\n    */\n    constructor(config = {}) {\n        this.id = nextPropID++;\n        this.perNode = !!config.perNode;\n        this.deserialize = config.deserialize || (() => {\n            throw new Error(\"This node type doesn't define a deserialize function\");\n        });\n    }\n    /**\n    This is meant to be used with\n    [`NodeSet.extend`](#common.NodeSet.extend) or\n    [`LRParser.configure`](#lr.ParserConfig.props) to compute\n    prop values for each node type in the set. Takes a [match\n    object](#common.NodeType^match) or function that returns undefined\n    if the node type doesn't get this prop, and the prop's value if\n    it does.\n    */\n    add(match) {\n        if (this.perNode)\n            throw new RangeError(\"Can't add per-node props to node types\");\n        if (typeof match != \"function\")\n            match = NodeType.match(match);\n        return (type) => {\n            let result = match(type);\n            return result === undefined ? null : [this, result];\n        };\n    }\n}\n/**\nProp that is used to describe matching delimiters. For opening\ndelimiters, this holds an array of node names (written as a\nspace-separated string when declaring this prop in a grammar)\nfor the node types of closing delimiters that match it.\n*/\nNodeProp.closedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/**\nThe inverse of [`closedBy`](#common.NodeProp^closedBy). This is\nattached to closing delimiters, holding an array of node names\nof types of matching opening delimiters.\n*/\nNodeProp.openedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/**\nUsed to assign node types to groups (for example, all node\ntypes that represent an expression could be tagged with an\n`\"Expression\"` group).\n*/\nNodeProp.group = new NodeProp({ deserialize: str => str.split(\" \") });\n/**\nAttached to nodes to indicate these should be\n[displayed](https://codemirror.net/docs/ref/#language.syntaxTree)\nin a bidirectional text isolate, so that direction-neutral\ncharacters on their sides don't incorrectly get associated with\nsurrounding text. You'll generally want to set this for nodes\nthat contain arbitrary text, like strings and comments, and for\nnodes that appear _inside_ arbitrary text, like HTML tags. When\nnot given a value, in a grammar declaration, defaults to\n`\"auto\"`.\n*/\nNodeProp.isolate = new NodeProp({ deserialize: value => {\n        if (value && value != \"rtl\" && value != \"ltr\" && value != \"auto\")\n            throw new RangeError(\"Invalid value for isolate: \" + value);\n        return value || \"auto\";\n    } });\n/**\nThe hash of the [context](#lr.ContextTracker.constructor)\nthat the node was parsed in, if any. Used to limit reuse of\ncontextual nodes.\n*/\nNodeProp.contextHash = new NodeProp({ perNode: true });\n/**\nThe distance beyond the end of the node that the tokenizer\nlooked ahead for any of the tokens inside the node. (The LR\nparser only stores this when it is larger than 25, for\nefficiency reasons.)\n*/\nNodeProp.lookAhead = new NodeProp({ perNode: true });\n/**\nThis per-node prop is used to replace a given node, or part of a\nnode, with another tree. This is useful to include trees from\ndifferent languages in mixed-language parsers.\n*/\nNodeProp.mounted = new NodeProp({ perNode: true });\n/**\nA mounted tree, which can be [stored](#common.NodeProp^mounted) on\na tree node to indicate that parts of its content are\nrepresented by another tree.\n*/\nclass MountedTree {\n    constructor(\n    /**\n    The inner tree.\n    */\n    tree, \n    /**\n    If this is null, this tree replaces the entire node (it will\n    be included in the regular iteration instead of its host\n    node). If not, only the given ranges are considered to be\n    covered by this tree. This is used for trees that are mixed in\n    a way that isn't strictly hierarchical. Such mounted trees are\n    only entered by [`resolveInner`](#common.Tree.resolveInner)\n    and [`enter`](#common.SyntaxNode.enter).\n    */\n    overlay, \n    /**\n    The parser used to create this subtree.\n    */\n    parser) {\n        this.tree = tree;\n        this.overlay = overlay;\n        this.parser = parser;\n    }\n    /**\n    @internal\n    */\n    static get(tree) {\n        return tree && tree.props && tree.props[NodeProp.mounted.id];\n    }\n}\nconst noProps = Object.create(null);\n/**\nEach node in a syntax tree has a node type associated with it.\n*/\nclass NodeType {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The name of the node type. Not necessarily unique, but if the\n    grammar was written properly, different node types with the\n    same name within a node set should play the same semantic\n    role.\n    */\n    name, \n    /**\n    @internal\n    */\n    props, \n    /**\n    The id of this node in its set. Corresponds to the term ids\n    used in the parser.\n    */\n    id, \n    /**\n    @internal\n    */\n    flags = 0) {\n        this.name = name;\n        this.props = props;\n        this.id = id;\n        this.flags = flags;\n    }\n    /**\n    Define a node type.\n    */\n    static define(spec) {\n        let props = spec.props && spec.props.length ? Object.create(null) : noProps;\n        let flags = (spec.top ? 1 /* NodeFlag.Top */ : 0) | (spec.skipped ? 2 /* NodeFlag.Skipped */ : 0) |\n            (spec.error ? 4 /* NodeFlag.Error */ : 0) | (spec.name == null ? 8 /* NodeFlag.Anonymous */ : 0);\n        let type = new NodeType(spec.name || \"\", props, spec.id, flags);\n        if (spec.props)\n            for (let src of spec.props) {\n                if (!Array.isArray(src))\n                    src = src(type);\n                if (src) {\n                    if (src[0].perNode)\n                        throw new RangeError(\"Can't store a per-node prop on a node type\");\n                    props[src[0].id] = src[1];\n                }\n            }\n        return type;\n    }\n    /**\n    Retrieves a node prop for this type. Will return `undefined` if\n    the prop isn't present on this node.\n    */\n    prop(prop) { return this.props[prop.id]; }\n    /**\n    True when this is the top node of a grammar.\n    */\n    get isTop() { return (this.flags & 1 /* NodeFlag.Top */) > 0; }\n    /**\n    True when this node is produced by a skip rule.\n    */\n    get isSkipped() { return (this.flags & 2 /* NodeFlag.Skipped */) > 0; }\n    /**\n    Indicates whether this is an error node.\n    */\n    get isError() { return (this.flags & 4 /* NodeFlag.Error */) > 0; }\n    /**\n    When true, this node type doesn't correspond to a user-declared\n    named node, for example because it is used to cache repetition.\n    */\n    get isAnonymous() { return (this.flags & 8 /* NodeFlag.Anonymous */) > 0; }\n    /**\n    Returns true when this node's name or one of its\n    [groups](#common.NodeProp^group) matches the given string.\n    */\n    is(name) {\n        if (typeof name == 'string') {\n            if (this.name == name)\n                return true;\n            let group = this.prop(NodeProp.group);\n            return group ? group.indexOf(name) > -1 : false;\n        }\n        return this.id == name;\n    }\n    /**\n    Create a function from node types to arbitrary values by\n    specifying an object whose property names are node or\n    [group](#common.NodeProp^group) names. Often useful with\n    [`NodeProp.add`](#common.NodeProp.add). You can put multiple\n    names, separated by spaces, in a single property name to map\n    multiple node names to a single value.\n    */\n    static match(map) {\n        let direct = Object.create(null);\n        for (let prop in map)\n            for (let name of prop.split(\" \"))\n                direct[name] = map[prop];\n        return (node) => {\n            for (let groups = node.prop(NodeProp.group), i = -1; i < (groups ? groups.length : 0); i++) {\n                let found = direct[i < 0 ? node.name : groups[i]];\n                if (found)\n                    return found;\n            }\n        };\n    }\n}\n/**\nAn empty dummy node type to use when no actual type is available.\n*/\nNodeType.none = new NodeType(\"\", Object.create(null), 0, 8 /* NodeFlag.Anonymous */);\n/**\nA node set holds a collection of node types. It is used to\ncompactly represent trees by storing their type ids, rather than a\nfull pointer to the type object, in a numeric array. Each parser\n[has](#lr.LRParser.nodeSet) a node set, and [tree\nbuffers](#common.TreeBuffer) can only store collections of nodes\nfrom the same set. A set can have a maximum of 2**16 (65536) node\ntypes in it, so that the ids fit into 16-bit typed array slots.\n*/\nclass NodeSet {\n    /**\n    Create a set with the given types. The `id` property of each\n    type should correspond to its position within the array.\n    */\n    constructor(\n    /**\n    The node types in this set, by id.\n    */\n    types) {\n        this.types = types;\n        for (let i = 0; i < types.length; i++)\n            if (types[i].id != i)\n                throw new RangeError(\"Node type ids should correspond to array positions when creating a node set\");\n    }\n    /**\n    Create a copy of this set with some node properties added. The\n    arguments to this method can be created with\n    [`NodeProp.add`](#common.NodeProp.add).\n    */\n    extend(...props) {\n        let newTypes = [];\n        for (let type of this.types) {\n            let newProps = null;\n            for (let source of props) {\n                let add = source(type);\n                if (add) {\n                    if (!newProps)\n                        newProps = Object.assign({}, type.props);\n                    newProps[add[0].id] = add[1];\n                }\n            }\n            newTypes.push(newProps ? new NodeType(type.name, newProps, type.id, type.flags) : type);\n        }\n        return new NodeSet(newTypes);\n    }\n}\nconst CachedNode = new WeakMap(), CachedInnerNode = new WeakMap();\n/**\nOptions that control iteration. Can be combined with the `|`\noperator to enable multiple ones.\n*/\nvar IterMode;\n(function (IterMode) {\n    /**\n    When enabled, iteration will only visit [`Tree`](#common.Tree)\n    objects, not nodes packed into\n    [`TreeBuffer`](#common.TreeBuffer)s.\n    */\n    IterMode[IterMode[\"ExcludeBuffers\"] = 1] = \"ExcludeBuffers\";\n    /**\n    Enable this to make iteration include anonymous nodes (such as\n    the nodes that wrap repeated grammar constructs into a balanced\n    tree).\n    */\n    IterMode[IterMode[\"IncludeAnonymous\"] = 2] = \"IncludeAnonymous\";\n    /**\n    By default, regular [mounted](#common.NodeProp^mounted) nodes\n    replace their base node in iteration. Enable this to ignore them\n    instead.\n    */\n    IterMode[IterMode[\"IgnoreMounts\"] = 4] = \"IgnoreMounts\";\n    /**\n    This option only applies in\n    [`enter`](#common.SyntaxNode.enter)-style methods. It tells the\n    library to not enter mounted overlays if one covers the given\n    position.\n    */\n    IterMode[IterMode[\"IgnoreOverlays\"] = 8] = \"IgnoreOverlays\";\n})(IterMode || (IterMode = {}));\n/**\nA piece of syntax tree. There are two ways to approach these\ntrees: the way they are actually stored in memory, and the\nconvenient way.\n\nSyntax trees are stored as a tree of `Tree` and `TreeBuffer`\nobjects. By packing detail information into `TreeBuffer` leaf\nnodes, the representation is made a lot more memory-efficient.\n\nHowever, when you want to actually work with tree nodes, this\nrepresentation is very awkward, so most client code will want to\nuse the [`TreeCursor`](#common.TreeCursor) or\n[`SyntaxNode`](#common.SyntaxNode) interface instead, which provides\na view on some part of this data structure, and can be used to\nmove around to adjacent nodes.\n*/\nclass Tree {\n    /**\n    Construct a new tree. See also [`Tree.build`](#common.Tree^build).\n    */\n    constructor(\n    /**\n    The type of the top node.\n    */\n    type, \n    /**\n    This node's child nodes.\n    */\n    children, \n    /**\n    The positions (offsets relative to the start of this tree) of\n    the children.\n    */\n    positions, \n    /**\n    The total length of this tree\n    */\n    length, \n    /**\n    Per-node [node props](#common.NodeProp) to associate with this node.\n    */\n    props) {\n        this.type = type;\n        this.children = children;\n        this.positions = positions;\n        this.length = length;\n        /**\n        @internal\n        */\n        this.props = null;\n        if (props && props.length) {\n            this.props = Object.create(null);\n            for (let [prop, value] of props)\n                this.props[typeof prop == \"number\" ? prop : prop.id] = value;\n        }\n    }\n    /**\n    @internal\n    */\n    toString() {\n        let mounted = MountedTree.get(this);\n        if (mounted && !mounted.overlay)\n            return mounted.tree.toString();\n        let children = \"\";\n        for (let ch of this.children) {\n            let str = ch.toString();\n            if (str) {\n                if (children)\n                    children += \",\";\n                children += str;\n            }\n        }\n        return !this.type.name ? children :\n            (/\\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) +\n                (children.length ? \"(\" + children + \")\" : \"\");\n    }\n    /**\n    Get a [tree cursor](#common.TreeCursor) positioned at the top of\n    the tree. Mode can be used to [control](#common.IterMode) which\n    nodes the cursor visits.\n    */\n    cursor(mode = 0) {\n        return new TreeCursor(this.topNode, mode);\n    }\n    /**\n    Get a [tree cursor](#common.TreeCursor) pointing into this tree\n    at the given position and side (see\n    [`moveTo`](#common.TreeCursor.moveTo).\n    */\n    cursorAt(pos, side = 0, mode = 0) {\n        let scope = CachedNode.get(this) || this.topNode;\n        let cursor = new TreeCursor(scope);\n        cursor.moveTo(pos, side);\n        CachedNode.set(this, cursor._tree);\n        return cursor;\n    }\n    /**\n    Get a [syntax node](#common.SyntaxNode) object for the top of the\n    tree.\n    */\n    get topNode() {\n        return new TreeNode(this, 0, 0, null);\n    }\n    /**\n    Get the [syntax node](#common.SyntaxNode) at the given position.\n    If `side` is -1, this will move into nodes that end at the\n    position. If 1, it'll move into nodes that start at the\n    position. With 0, it'll only enter nodes that cover the position\n    from both sides.\n    \n    Note that this will not enter\n    [overlays](#common.MountedTree.overlay), and you often want\n    [`resolveInner`](#common.Tree.resolveInner) instead.\n    */\n    resolve(pos, side = 0) {\n        let node = resolveNode(CachedNode.get(this) || this.topNode, pos, side, false);\n        CachedNode.set(this, node);\n        return node;\n    }\n    /**\n    Like [`resolve`](#common.Tree.resolve), but will enter\n    [overlaid](#common.MountedTree.overlay) nodes, producing a syntax node\n    pointing into the innermost overlaid tree at the given position\n    (with parent links going through all parent structure, including\n    the host trees).\n    */\n    resolveInner(pos, side = 0) {\n        let node = resolveNode(CachedInnerNode.get(this) || this.topNode, pos, side, true);\n        CachedInnerNode.set(this, node);\n        return node;\n    }\n    /**\n    In some situations, it can be useful to iterate through all\n    nodes around a position, including those in overlays that don't\n    directly cover the position. This method gives you an iterator\n    that will produce all nodes, from small to big, around the given\n    position.\n    */\n    resolveStack(pos, side = 0) {\n        return stackIterator(this, pos, side);\n    }\n    /**\n    Iterate over the tree and its children, calling `enter` for any\n    node that touches the `from`/`to` region (if given) before\n    running over such a node's children, and `leave` (if given) when\n    leaving the node. When `enter` returns `false`, that node will\n    not have its children iterated over (or `leave` called).\n    */\n    iterate(spec) {\n        let { enter, leave, from = 0, to = this.length } = spec;\n        let mode = spec.mode || 0, anon = (mode & IterMode.IncludeAnonymous) > 0;\n        for (let c = this.cursor(mode | IterMode.IncludeAnonymous);;) {\n            let entered = false;\n            if (c.from <= to && c.to >= from && (!anon && c.type.isAnonymous || enter(c) !== false)) {\n                if (c.firstChild())\n                    continue;\n                entered = true;\n            }\n            for (;;) {\n                if (entered && leave && (anon || !c.type.isAnonymous))\n                    leave(c);\n                if (c.nextSibling())\n                    break;\n                if (!c.parent())\n                    return;\n                entered = true;\n            }\n        }\n    }\n    /**\n    Get the value of the given [node prop](#common.NodeProp) for this\n    node. Works with both per-node and per-type props.\n    */\n    prop(prop) {\n        return !prop.perNode ? this.type.prop(prop) : this.props ? this.props[prop.id] : undefined;\n    }\n    /**\n    Returns the node's [per-node props](#common.NodeProp.perNode) in a\n    format that can be passed to the [`Tree`](#common.Tree)\n    constructor.\n    */\n    get propValues() {\n        let result = [];\n        if (this.props)\n            for (let id in this.props)\n                result.push([+id, this.props[id]]);\n        return result;\n    }\n    /**\n    Balance the direct children of this tree, producing a copy of\n    which may have children grouped into subtrees with type\n    [`NodeType.none`](#common.NodeType^none).\n    */\n    balance(config = {}) {\n        return this.children.length <= 8 /* Balance.BranchFactor */ ? this :\n            balanceRange(NodeType.none, this.children, this.positions, 0, this.children.length, 0, this.length, (children, positions, length) => new Tree(this.type, children, positions, length, this.propValues), config.makeTree || ((children, positions, length) => new Tree(NodeType.none, children, positions, length)));\n    }\n    /**\n    Build a tree from a postfix-ordered buffer of node information,\n    or a cursor over such a buffer.\n    */\n    static build(data) { return buildTree(data); }\n}\n/**\nThe empty tree\n*/\nTree.empty = new Tree(NodeType.none, [], [], 0);\nclass FlatBufferCursor {\n    constructor(buffer, index) {\n        this.buffer = buffer;\n        this.index = index;\n    }\n    get id() { return this.buffer[this.index - 4]; }\n    get start() { return this.buffer[this.index - 3]; }\n    get end() { return this.buffer[this.index - 2]; }\n    get size() { return this.buffer[this.index - 1]; }\n    get pos() { return this.index; }\n    next() { this.index -= 4; }\n    fork() { return new FlatBufferCursor(this.buffer, this.index); }\n}\n/**\nTree buffers contain (type, start, end, endIndex) quads for each\nnode. In such a buffer, nodes are stored in prefix order (parents\nbefore children, with the endIndex of the parent indicating which\nchildren belong to it).\n*/\nclass TreeBuffer {\n    /**\n    Create a tree buffer.\n    */\n    constructor(\n    /**\n    The buffer's content.\n    */\n    buffer, \n    /**\n    The total length of the group of nodes in the buffer.\n    */\n    length, \n    /**\n    The node set used in this buffer.\n    */\n    set) {\n        this.buffer = buffer;\n        this.length = length;\n        this.set = set;\n    }\n    /**\n    @internal\n    */\n    get type() { return NodeType.none; }\n    /**\n    @internal\n    */\n    toString() {\n        let result = [];\n        for (let index = 0; index < this.buffer.length;) {\n            result.push(this.childString(index));\n            index = this.buffer[index + 3];\n        }\n        return result.join(\",\");\n    }\n    /**\n    @internal\n    */\n    childString(index) {\n        let id = this.buffer[index], endIndex = this.buffer[index + 3];\n        let type = this.set.types[id], result = type.name;\n        if (/\\W/.test(result) && !type.isError)\n            result = JSON.stringify(result);\n        index += 4;\n        if (endIndex == index)\n            return result;\n        let children = [];\n        while (index < endIndex) {\n            children.push(this.childString(index));\n            index = this.buffer[index + 3];\n        }\n        return result + \"(\" + children.join(\",\") + \")\";\n    }\n    /**\n    @internal\n    */\n    findChild(startIndex, endIndex, dir, pos, side) {\n        let { buffer } = this, pick = -1;\n        for (let i = startIndex; i != endIndex; i = buffer[i + 3]) {\n            if (checkSide(side, pos, buffer[i + 1], buffer[i + 2])) {\n                pick = i;\n                if (dir > 0)\n                    break;\n            }\n        }\n        return pick;\n    }\n    /**\n    @internal\n    */\n    slice(startI, endI, from) {\n        let b = this.buffer;\n        let copy = new Uint16Array(endI - startI), len = 0;\n        for (let i = startI, j = 0; i < endI;) {\n            copy[j++] = b[i++];\n            copy[j++] = b[i++] - from;\n            let to = copy[j++] = b[i++] - from;\n            copy[j++] = b[i++] - startI;\n            len = Math.max(len, to);\n        }\n        return new TreeBuffer(copy, len, this.set);\n    }\n}\nfunction checkSide(side, pos, from, to) {\n    switch (side) {\n        case -2 /* Side.Before */: return from < pos;\n        case -1 /* Side.AtOrBefore */: return to >= pos && from < pos;\n        case 0 /* Side.Around */: return from < pos && to > pos;\n        case 1 /* Side.AtOrAfter */: return from <= pos && to > pos;\n        case 2 /* Side.After */: return to > pos;\n        case 4 /* Side.DontCare */: return true;\n    }\n}\nfunction resolveNode(node, pos, side, overlays) {\n    var _a;\n    // Move up to a node that actually holds the position, if possible\n    while (node.from == node.to ||\n        (side < 1 ? node.from >= pos : node.from > pos) ||\n        (side > -1 ? node.to <= pos : node.to < pos)) {\n        let parent = !overlays && node instanceof TreeNode && node.index < 0 ? null : node.parent;\n        if (!parent)\n            return node;\n        node = parent;\n    }\n    let mode = overlays ? 0 : IterMode.IgnoreOverlays;\n    // Must go up out of overlays when those do not overlap with pos\n    if (overlays)\n        for (let scan = node, parent = scan.parent; parent; scan = parent, parent = scan.parent) {\n            if (scan instanceof TreeNode && scan.index < 0 && ((_a = parent.enter(pos, side, mode)) === null || _a === void 0 ? void 0 : _a.from) != scan.from)\n                node = parent;\n        }\n    for (;;) {\n        let inner = node.enter(pos, side, mode);\n        if (!inner)\n            return node;\n        node = inner;\n    }\n}\nclass BaseNode {\n    cursor(mode = 0) { return new TreeCursor(this, mode); }\n    getChild(type, before = null, after = null) {\n        let r = getChildren(this, type, before, after);\n        return r.length ? r[0] : null;\n    }\n    getChildren(type, before = null, after = null) {\n        return getChildren(this, type, before, after);\n    }\n    resolve(pos, side = 0) {\n        return resolveNode(this, pos, side, false);\n    }\n    resolveInner(pos, side = 0) {\n        return resolveNode(this, pos, side, true);\n    }\n    matchContext(context) {\n        return matchNodeContext(this.parent, context);\n    }\n    enterUnfinishedNodesBefore(pos) {\n        let scan = this.childBefore(pos), node = this;\n        while (scan) {\n            let last = scan.lastChild;\n            if (!last || last.to != scan.to)\n                break;\n            if (last.type.isError && last.from == last.to) {\n                node = scan;\n                scan = last.prevSibling;\n            }\n            else {\n                scan = last;\n            }\n        }\n        return node;\n    }\n    get node() { return this; }\n    get next() { return this.parent; }\n}\nclass TreeNode extends BaseNode {\n    constructor(_tree, from, \n    // Index in parent node, set to -1 if the node is not a direct child of _parent.node (overlay)\n    index, _parent) {\n        super();\n        this._tree = _tree;\n        this.from = from;\n        this.index = index;\n        this._parent = _parent;\n    }\n    get type() { return this._tree.type; }\n    get name() { return this._tree.type.name; }\n    get to() { return this.from + this._tree.length; }\n    nextChild(i, dir, pos, side, mode = 0) {\n        for (let parent = this;;) {\n            for (let { children, positions } = parent._tree, e = dir > 0 ? children.length : -1; i != e; i += dir) {\n                let next = children[i], start = positions[i] + parent.from;\n                if (!checkSide(side, pos, start, start + next.length))\n                    continue;\n                if (next instanceof TreeBuffer) {\n                    if (mode & IterMode.ExcludeBuffers)\n                        continue;\n                    let index = next.findChild(0, next.buffer.length, dir, pos - start, side);\n                    if (index > -1)\n                        return new BufferNode(new BufferContext(parent, next, i, start), null, index);\n                }\n                else if ((mode & IterMode.IncludeAnonymous) || (!next.type.isAnonymous || hasChild(next))) {\n                    let mounted;\n                    if (!(mode & IterMode.IgnoreMounts) && (mounted = MountedTree.get(next)) && !mounted.overlay)\n                        return new TreeNode(mounted.tree, start, i, parent);\n                    let inner = new TreeNode(next, start, i, parent);\n                    return (mode & IterMode.IncludeAnonymous) || !inner.type.isAnonymous ? inner\n                        : inner.nextChild(dir < 0 ? next.children.length - 1 : 0, dir, pos, side);\n                }\n            }\n            if ((mode & IterMode.IncludeAnonymous) || !parent.type.isAnonymous)\n                return null;\n            if (parent.index >= 0)\n                i = parent.index + dir;\n            else\n                i = dir < 0 ? -1 : parent._parent._tree.children.length;\n            parent = parent._parent;\n            if (!parent)\n                return null;\n        }\n    }\n    get firstChild() { return this.nextChild(0, 1, 0, 4 /* Side.DontCare */); }\n    get lastChild() { return this.nextChild(this._tree.children.length - 1, -1, 0, 4 /* Side.DontCare */); }\n    childAfter(pos) { return this.nextChild(0, 1, pos, 2 /* Side.After */); }\n    childBefore(pos) { return this.nextChild(this._tree.children.length - 1, -1, pos, -2 /* Side.Before */); }\n    enter(pos, side, mode = 0) {\n        let mounted;\n        if (!(mode & IterMode.IgnoreOverlays) && (mounted = MountedTree.get(this._tree)) && mounted.overlay) {\n            let rPos = pos - this.from;\n            for (let { from, to } of mounted.overlay) {\n                if ((side > 0 ? from <= rPos : from < rPos) &&\n                    (side < 0 ? to >= rPos : to > rPos))\n                    return new TreeNode(mounted.tree, mounted.overlay[0].from + this.from, -1, this);\n            }\n        }\n        return this.nextChild(0, 1, pos, side, mode);\n    }\n    nextSignificantParent() {\n        let val = this;\n        while (val.type.isAnonymous && val._parent)\n            val = val._parent;\n        return val;\n    }\n    get parent() {\n        return this._parent ? this._parent.nextSignificantParent() : null;\n    }\n    get nextSibling() {\n        return this._parent && this.index >= 0 ? this._parent.nextChild(this.index + 1, 1, 0, 4 /* Side.DontCare */) : null;\n    }\n    get prevSibling() {\n        return this._parent && this.index >= 0 ? this._parent.nextChild(this.index - 1, -1, 0, 4 /* Side.DontCare */) : null;\n    }\n    get tree() { return this._tree; }\n    toTree() { return this._tree; }\n    /**\n    @internal\n    */\n    toString() { return this._tree.toString(); }\n}\nfunction getChildren(node, type, before, after) {\n    let cur = node.cursor(), result = [];\n    if (!cur.firstChild())\n        return result;\n    if (before != null)\n        for (let found = false; !found;) {\n            found = cur.type.is(before);\n            if (!cur.nextSibling())\n                return result;\n        }\n    for (;;) {\n        if (after != null && cur.type.is(after))\n            return result;\n        if (cur.type.is(type))\n            result.push(cur.node);\n        if (!cur.nextSibling())\n            return after == null ? result : [];\n    }\n}\nfunction matchNodeContext(node, context, i = context.length - 1) {\n    for (let p = node; i >= 0; p = p.parent) {\n        if (!p)\n            return false;\n        if (!p.type.isAnonymous) {\n            if (context[i] && context[i] != p.name)\n                return false;\n            i--;\n        }\n    }\n    return true;\n}\nclass BufferContext {\n    constructor(parent, buffer, index, start) {\n        this.parent = parent;\n        this.buffer = buffer;\n        this.index = index;\n        this.start = start;\n    }\n}\nclass BufferNode extends BaseNode {\n    get name() { return this.type.name; }\n    get from() { return this.context.start + this.context.buffer.buffer[this.index + 1]; }\n    get to() { return this.context.start + this.context.buffer.buffer[this.index + 2]; }\n    constructor(context, _parent, index) {\n        super();\n        this.context = context;\n        this._parent = _parent;\n        this.index = index;\n        this.type = context.buffer.set.types[context.buffer.buffer[index]];\n    }\n    child(dir, pos, side) {\n        let { buffer } = this.context;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.context.start, side);\n        return index < 0 ? null : new BufferNode(this.context, this, index);\n    }\n    get firstChild() { return this.child(1, 0, 4 /* Side.DontCare */); }\n    get lastChild() { return this.child(-1, 0, 4 /* Side.DontCare */); }\n    childAfter(pos) { return this.child(1, pos, 2 /* Side.After */); }\n    childBefore(pos) { return this.child(-1, pos, -2 /* Side.Before */); }\n    enter(pos, side, mode = 0) {\n        if (mode & IterMode.ExcludeBuffers)\n            return null;\n        let { buffer } = this.context;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], side > 0 ? 1 : -1, pos - this.context.start, side);\n        return index < 0 ? null : new BufferNode(this.context, this, index);\n    }\n    get parent() {\n        return this._parent || this.context.parent.nextSignificantParent();\n    }\n    externalSibling(dir) {\n        return this._parent ? null : this.context.parent.nextChild(this.context.index + dir, dir, 0, 4 /* Side.DontCare */);\n    }\n    get nextSibling() {\n        let { buffer } = this.context;\n        let after = buffer.buffer[this.index + 3];\n        if (after < (this._parent ? buffer.buffer[this._parent.index + 3] : buffer.buffer.length))\n            return new BufferNode(this.context, this._parent, after);\n        return this.externalSibling(1);\n    }\n    get prevSibling() {\n        let { buffer } = this.context;\n        let parentStart = this._parent ? this._parent.index + 4 : 0;\n        if (this.index == parentStart)\n            return this.externalSibling(-1);\n        return new BufferNode(this.context, this._parent, buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n    }\n    get tree() { return null; }\n    toTree() {\n        let children = [], positions = [];\n        let { buffer } = this.context;\n        let startI = this.index + 4, endI = buffer.buffer[this.index + 3];\n        if (endI > startI) {\n            let from = buffer.buffer[this.index + 1];\n            children.push(buffer.slice(startI, endI, from));\n            positions.push(0);\n        }\n        return new Tree(this.type, children, positions, this.to - this.from);\n    }\n    /**\n    @internal\n    */\n    toString() { return this.context.buffer.childString(this.index); }\n}\nfunction iterStack(heads) {\n    if (!heads.length)\n        return null;\n    let pick = 0, picked = heads[0];\n    for (let i = 1; i < heads.length; i++) {\n        let node = heads[i];\n        if (node.from > picked.from || node.to < picked.to) {\n            picked = node;\n            pick = i;\n        }\n    }\n    let next = picked instanceof TreeNode && picked.index < 0 ? null : picked.parent;\n    let newHeads = heads.slice();\n    if (next)\n        newHeads[pick] = next;\n    else\n        newHeads.splice(pick, 1);\n    return new StackIterator(newHeads, picked);\n}\nclass StackIterator {\n    constructor(heads, node) {\n        this.heads = heads;\n        this.node = node;\n    }\n    get next() { return iterStack(this.heads); }\n}\nfunction stackIterator(tree, pos, side) {\n    let inner = tree.resolveInner(pos, side), layers = null;\n    for (let scan = inner instanceof TreeNode ? inner : inner.context.parent; scan; scan = scan.parent) {\n        if (scan.index < 0) { // This is an overlay root\n            let parent = scan.parent;\n            (layers || (layers = [inner])).push(parent.resolve(pos, side));\n            scan = parent;\n        }\n        else {\n            let mount = MountedTree.get(scan.tree);\n            // Relevant overlay branching off\n            if (mount && mount.overlay && mount.overlay[0].from <= pos && mount.overlay[mount.overlay.length - 1].to >= pos) {\n                let root = new TreeNode(mount.tree, mount.overlay[0].from + scan.from, -1, scan);\n                (layers || (layers = [inner])).push(resolveNode(root, pos, side, false));\n            }\n        }\n    }\n    return layers ? iterStack(layers) : inner;\n}\n/**\nA tree cursor object focuses on a given node in a syntax tree, and\nallows you to move to adjacent nodes.\n*/\nclass TreeCursor {\n    /**\n    Shorthand for `.type.name`.\n    */\n    get name() { return this.type.name; }\n    /**\n    @internal\n    */\n    constructor(node, \n    /**\n    @internal\n    */\n    mode = 0) {\n        this.mode = mode;\n        /**\n        @internal\n        */\n        this.buffer = null;\n        this.stack = [];\n        /**\n        @internal\n        */\n        this.index = 0;\n        this.bufferNode = null;\n        if (node instanceof TreeNode) {\n            this.yieldNode(node);\n        }\n        else {\n            this._tree = node.context.parent;\n            this.buffer = node.context;\n            for (let n = node._parent; n; n = n._parent)\n                this.stack.unshift(n.index);\n            this.bufferNode = node;\n            this.yieldBuf(node.index);\n        }\n    }\n    yieldNode(node) {\n        if (!node)\n            return false;\n        this._tree = node;\n        this.type = node.type;\n        this.from = node.from;\n        this.to = node.to;\n        return true;\n    }\n    yieldBuf(index, type) {\n        this.index = index;\n        let { start, buffer } = this.buffer;\n        this.type = type || buffer.set.types[buffer.buffer[index]];\n        this.from = start + buffer.buffer[index + 1];\n        this.to = start + buffer.buffer[index + 2];\n        return true;\n    }\n    /**\n    @internal\n    */\n    yield(node) {\n        if (!node)\n            return false;\n        if (node instanceof TreeNode) {\n            this.buffer = null;\n            return this.yieldNode(node);\n        }\n        this.buffer = node.context;\n        return this.yieldBuf(node.index, node.type);\n    }\n    /**\n    @internal\n    */\n    toString() {\n        return this.buffer ? this.buffer.buffer.childString(this.index) : this._tree.toString();\n    }\n    /**\n    @internal\n    */\n    enterChild(dir, pos, side) {\n        if (!this.buffer)\n            return this.yield(this._tree.nextChild(dir < 0 ? this._tree._tree.children.length - 1 : 0, dir, pos, side, this.mode));\n        let { buffer } = this.buffer;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.buffer.start, side);\n        if (index < 0)\n            return false;\n        this.stack.push(this.index);\n        return this.yieldBuf(index);\n    }\n    /**\n    Move the cursor to this node's first child. When this returns\n    false, the node has no child, and the cursor has not been moved.\n    */\n    firstChild() { return this.enterChild(1, 0, 4 /* Side.DontCare */); }\n    /**\n    Move the cursor to this node's last child.\n    */\n    lastChild() { return this.enterChild(-1, 0, 4 /* Side.DontCare */); }\n    /**\n    Move the cursor to the first child that ends after `pos`.\n    */\n    childAfter(pos) { return this.enterChild(1, pos, 2 /* Side.After */); }\n    /**\n    Move to the last child that starts before `pos`.\n    */\n    childBefore(pos) { return this.enterChild(-1, pos, -2 /* Side.Before */); }\n    /**\n    Move the cursor to the child around `pos`. If side is -1 the\n    child may end at that position, when 1 it may start there. This\n    will also enter [overlaid](#common.MountedTree.overlay)\n    [mounted](#common.NodeProp^mounted) trees unless `overlays` is\n    set to false.\n    */\n    enter(pos, side, mode = this.mode) {\n        if (!this.buffer)\n            return this.yield(this._tree.enter(pos, side, mode));\n        return mode & IterMode.ExcludeBuffers ? false : this.enterChild(1, pos, side);\n    }\n    /**\n    Move to the node's parent node, if this isn't the top node.\n    */\n    parent() {\n        if (!this.buffer)\n            return this.yieldNode((this.mode & IterMode.IncludeAnonymous) ? this._tree._parent : this._tree.parent);\n        if (this.stack.length)\n            return this.yieldBuf(this.stack.pop());\n        let parent = (this.mode & IterMode.IncludeAnonymous) ? this.buffer.parent : this.buffer.parent.nextSignificantParent();\n        this.buffer = null;\n        return this.yieldNode(parent);\n    }\n    /**\n    @internal\n    */\n    sibling(dir) {\n        if (!this.buffer)\n            return !this._tree._parent ? false\n                : this.yield(this._tree.index < 0 ? null\n                    : this._tree._parent.nextChild(this._tree.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode));\n        let { buffer } = this.buffer, d = this.stack.length - 1;\n        if (dir < 0) {\n            let parentStart = d < 0 ? 0 : this.stack[d] + 4;\n            if (this.index != parentStart)\n                return this.yieldBuf(buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n        }\n        else {\n            let after = buffer.buffer[this.index + 3];\n            if (after < (d < 0 ? buffer.buffer.length : buffer.buffer[this.stack[d] + 3]))\n                return this.yieldBuf(after);\n        }\n        return d < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode)) : false;\n    }\n    /**\n    Move to this node's next sibling, if any.\n    */\n    nextSibling() { return this.sibling(1); }\n    /**\n    Move to this node's previous sibling, if any.\n    */\n    prevSibling() { return this.sibling(-1); }\n    atLastNode(dir) {\n        let index, parent, { buffer } = this;\n        if (buffer) {\n            if (dir > 0) {\n                if (this.index < buffer.buffer.buffer.length)\n                    return false;\n            }\n            else {\n                for (let i = 0; i < this.index; i++)\n                    if (buffer.buffer.buffer[i + 3] < this.index)\n                        return false;\n            }\n            ({ index, parent } = buffer);\n        }\n        else {\n            ({ index, _parent: parent } = this._tree);\n        }\n        for (; parent; { index, _parent: parent } = parent) {\n            if (index > -1)\n                for (let i = index + dir, e = dir < 0 ? -1 : parent._tree.children.length; i != e; i += dir) {\n                    let child = parent._tree.children[i];\n                    if ((this.mode & IterMode.IncludeAnonymous) ||\n                        child instanceof TreeBuffer ||\n                        !child.type.isAnonymous ||\n                        hasChild(child))\n                        return false;\n                }\n        }\n        return true;\n    }\n    move(dir, enter) {\n        if (enter && this.enterChild(dir, 0, 4 /* Side.DontCare */))\n            return true;\n        for (;;) {\n            if (this.sibling(dir))\n                return true;\n            if (this.atLastNode(dir) || !this.parent())\n                return false;\n        }\n    }\n    /**\n    Move to the next node in a\n    [pre-order](https://en.wikipedia.org/wiki/Tree_traversal#Pre-order,_NLR)\n    traversal, going from a node to its first child or, if the\n    current node is empty or `enter` is false, its next sibling or\n    the next sibling of the first parent node that has one.\n    */\n    next(enter = true) { return this.move(1, enter); }\n    /**\n    Move to the next node in a last-to-first pre-order traversal. A\n    node is followed by its last child or, if it has none, its\n    previous sibling or the previous sibling of the first parent\n    node that has one.\n    */\n    prev(enter = true) { return this.move(-1, enter); }\n    /**\n    Move the cursor to the innermost node that covers `pos`. If\n    `side` is -1, it will enter nodes that end at `pos`. If it is 1,\n    it will enter nodes that start at `pos`.\n    */\n    moveTo(pos, side = 0) {\n        // Move up to a node that actually holds the position, if possible\n        while (this.from == this.to ||\n            (side < 1 ? this.from >= pos : this.from > pos) ||\n            (side > -1 ? this.to <= pos : this.to < pos))\n            if (!this.parent())\n                break;\n        // Then scan down into child nodes as far as possible\n        while (this.enterChild(1, pos, side)) { }\n        return this;\n    }\n    /**\n    Get a [syntax node](#common.SyntaxNode) at the cursor's current\n    position.\n    */\n    get node() {\n        if (!this.buffer)\n            return this._tree;\n        let cache = this.bufferNode, result = null, depth = 0;\n        if (cache && cache.context == this.buffer) {\n            scan: for (let index = this.index, d = this.stack.length; d >= 0;) {\n                for (let c = cache; c; c = c._parent)\n                    if (c.index == index) {\n                        if (index == this.index)\n                            return c;\n                        result = c;\n                        depth = d + 1;\n                        break scan;\n                    }\n                index = this.stack[--d];\n            }\n        }\n        for (let i = depth; i < this.stack.length; i++)\n            result = new BufferNode(this.buffer, result, this.stack[i]);\n        return this.bufferNode = new BufferNode(this.buffer, result, this.index);\n    }\n    /**\n    Get the [tree](#common.Tree) that represents the current node, if\n    any. Will return null when the node is in a [tree\n    buffer](#common.TreeBuffer).\n    */\n    get tree() {\n        return this.buffer ? null : this._tree._tree;\n    }\n    /**\n    Iterate over the current node and all its descendants, calling\n    `enter` when entering a node and `leave`, if given, when leaving\n    one. When `enter` returns `false`, any children of that node are\n    skipped, and `leave` isn't called for it.\n    */\n    iterate(enter, leave) {\n        for (let depth = 0;;) {\n            let mustLeave = false;\n            if (this.type.isAnonymous || enter(this) !== false) {\n                if (this.firstChild()) {\n                    depth++;\n                    continue;\n                }\n                if (!this.type.isAnonymous)\n                    mustLeave = true;\n            }\n            for (;;) {\n                if (mustLeave && leave)\n                    leave(this);\n                mustLeave = this.type.isAnonymous;\n                if (!depth)\n                    return;\n                if (this.nextSibling())\n                    break;\n                this.parent();\n                depth--;\n                mustLeave = true;\n            }\n        }\n    }\n    /**\n    Test whether the current node matches a given context—a sequence\n    of direct parent node names. Empty strings in the context array\n    are treated as wildcards.\n    */\n    matchContext(context) {\n        if (!this.buffer)\n            return matchNodeContext(this.node.parent, context);\n        let { buffer } = this.buffer, { types } = buffer.set;\n        for (let i = context.length - 1, d = this.stack.length - 1; i >= 0; d--) {\n            if (d < 0)\n                return matchNodeContext(this._tree, context, i);\n            let type = types[buffer.buffer[this.stack[d]]];\n            if (!type.isAnonymous) {\n                if (context[i] && context[i] != type.name)\n                    return false;\n                i--;\n            }\n        }\n        return true;\n    }\n}\nfunction hasChild(tree) {\n    return tree.children.some(ch => ch instanceof TreeBuffer || !ch.type.isAnonymous || hasChild(ch));\n}\nfunction buildTree(data) {\n    var _a;\n    let { buffer, nodeSet, maxBufferLength = DefaultBufferLength, reused = [], minRepeatType = nodeSet.types.length } = data;\n    let cursor = Array.isArray(buffer) ? new FlatBufferCursor(buffer, buffer.length) : buffer;\n    let types = nodeSet.types;\n    let contextHash = 0, lookAhead = 0;\n    function takeNode(parentStart, minPos, children, positions, inRepeat, depth) {\n        let { id, start, end, size } = cursor;\n        let lookAheadAtStart = lookAhead, contextAtStart = contextHash;\n        while (size < 0) {\n            cursor.next();\n            if (size == -1 /* SpecialRecord.Reuse */) {\n                let node = reused[id];\n                children.push(node);\n                positions.push(start - parentStart);\n                return;\n            }\n            else if (size == -3 /* SpecialRecord.ContextChange */) { // Context change\n                contextHash = id;\n                return;\n            }\n            else if (size == -4 /* SpecialRecord.LookAhead */) {\n                lookAhead = id;\n                return;\n            }\n            else {\n                throw new RangeError(`Unrecognized record size: ${size}`);\n            }\n        }\n        let type = types[id], node, buffer;\n        let startPos = start - parentStart;\n        if (end - start <= maxBufferLength && (buffer = findBufferSize(cursor.pos - minPos, inRepeat))) {\n            // Small enough for a buffer, and no reused nodes inside\n            let data = new Uint16Array(buffer.size - buffer.skip);\n            let endPos = cursor.pos - buffer.size, index = data.length;\n            while (cursor.pos > endPos)\n                index = copyToBuffer(buffer.start, data, index);\n            node = new TreeBuffer(data, end - buffer.start, nodeSet);\n            startPos = buffer.start - parentStart;\n        }\n        else { // Make it a node\n            let endPos = cursor.pos - size;\n            cursor.next();\n            let localChildren = [], localPositions = [];\n            let localInRepeat = id >= minRepeatType ? id : -1;\n            let lastGroup = 0, lastEnd = end;\n            while (cursor.pos > endPos) {\n                if (localInRepeat >= 0 && cursor.id == localInRepeat && cursor.size >= 0) {\n                    if (cursor.end <= lastEnd - maxBufferLength) {\n                        makeRepeatLeaf(localChildren, localPositions, start, lastGroup, cursor.end, lastEnd, localInRepeat, lookAheadAtStart, contextAtStart);\n                        lastGroup = localChildren.length;\n                        lastEnd = cursor.end;\n                    }\n                    cursor.next();\n                }\n                else if (depth > 2500 /* CutOff.Depth */) {\n                    takeFlatNode(start, endPos, localChildren, localPositions);\n                }\n                else {\n                    takeNode(start, endPos, localChildren, localPositions, localInRepeat, depth + 1);\n                }\n            }\n            if (localInRepeat >= 0 && lastGroup > 0 && lastGroup < localChildren.length)\n                makeRepeatLeaf(localChildren, localPositions, start, lastGroup, start, lastEnd, localInRepeat, lookAheadAtStart, contextAtStart);\n            localChildren.reverse();\n            localPositions.reverse();\n            if (localInRepeat > -1 && lastGroup > 0) {\n                let make = makeBalanced(type, contextAtStart);\n                node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make);\n            }\n            else {\n                node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end, contextAtStart);\n            }\n        }\n        children.push(node);\n        positions.push(startPos);\n    }\n    function takeFlatNode(parentStart, minPos, children, positions) {\n        let nodes = []; // Temporary, inverted array of leaf nodes found, with absolute positions\n        let nodeCount = 0, stopAt = -1;\n        while (cursor.pos > minPos) {\n            let { id, start, end, size } = cursor;\n            if (size > 4) { // Not a leaf\n                cursor.next();\n            }\n            else if (stopAt > -1 && start < stopAt) {\n                break;\n            }\n            else {\n                if (stopAt < 0)\n                    stopAt = end - maxBufferLength;\n                nodes.push(id, start, end);\n                nodeCount++;\n                cursor.next();\n            }\n        }\n        if (nodeCount) {\n            let buffer = new Uint16Array(nodeCount * 4);\n            let start = nodes[nodes.length - 2];\n            for (let i = nodes.length - 3, j = 0; i >= 0; i -= 3) {\n                buffer[j++] = nodes[i];\n                buffer[j++] = nodes[i + 1] - start;\n                buffer[j++] = nodes[i + 2] - start;\n                buffer[j++] = j;\n            }\n            children.push(new TreeBuffer(buffer, nodes[2] - start, nodeSet));\n            positions.push(start - parentStart);\n        }\n    }\n    function makeBalanced(type, contextHash) {\n        return (children, positions, length) => {\n            let lookAhead = 0, lastI = children.length - 1, last, lookAheadProp;\n            if (lastI >= 0 && (last = children[lastI]) instanceof Tree) {\n                if (!lastI && last.type == type && last.length == length)\n                    return last;\n                if (lookAheadProp = last.prop(NodeProp.lookAhead))\n                    lookAhead = positions[lastI] + last.length + lookAheadProp;\n            }\n            return makeTree(type, children, positions, length, lookAhead, contextHash);\n        };\n    }\n    function makeRepeatLeaf(children, positions, base, i, from, to, type, lookAhead, contextHash) {\n        let localChildren = [], localPositions = [];\n        while (children.length > i) {\n            localChildren.push(children.pop());\n            localPositions.push(positions.pop() + base - from);\n        }\n        children.push(makeTree(nodeSet.types[type], localChildren, localPositions, to - from, lookAhead - to, contextHash));\n        positions.push(from - base);\n    }\n    function makeTree(type, children, positions, length, lookAhead, contextHash, props) {\n        if (contextHash) {\n            let pair = [NodeProp.contextHash, contextHash];\n            props = props ? [pair].concat(props) : [pair];\n        }\n        if (lookAhead > 25) {\n            let pair = [NodeProp.lookAhead, lookAhead];\n            props = props ? [pair].concat(props) : [pair];\n        }\n        return new Tree(type, children, positions, length, props);\n    }\n    function findBufferSize(maxSize, inRepeat) {\n        // Scan through the buffer to find previous siblings that fit\n        // together in a TreeBuffer, and don't contain any reused nodes\n        // (which can't be stored in a buffer).\n        // If `inRepeat` is > -1, ignore node boundaries of that type for\n        // nesting, but make sure the end falls either at the start\n        // (`maxSize`) or before such a node.\n        let fork = cursor.fork();\n        let size = 0, start = 0, skip = 0, minStart = fork.end - maxBufferLength;\n        let result = { size: 0, start: 0, skip: 0 };\n        scan: for (let minPos = fork.pos - maxSize; fork.pos > minPos;) {\n            let nodeSize = fork.size;\n            // Pretend nested repeat nodes of the same type don't exist\n            if (fork.id == inRepeat && nodeSize >= 0) {\n                // Except that we store the current state as a valid return\n                // value.\n                result.size = size;\n                result.start = start;\n                result.skip = skip;\n                skip += 4;\n                size += 4;\n                fork.next();\n                continue;\n            }\n            let startPos = fork.pos - nodeSize;\n            if (nodeSize < 0 || startPos < minPos || fork.start < minStart)\n                break;\n            let localSkipped = fork.id >= minRepeatType ? 4 : 0;\n            let nodeStart = fork.start;\n            fork.next();\n            while (fork.pos > startPos) {\n                if (fork.size < 0) {\n                    if (fork.size == -3 /* SpecialRecord.ContextChange */)\n                        localSkipped += 4;\n                    else\n                        break scan;\n                }\n                else if (fork.id >= minRepeatType) {\n                    localSkipped += 4;\n                }\n                fork.next();\n            }\n            start = nodeStart;\n            size += nodeSize;\n            skip += localSkipped;\n        }\n        if (inRepeat < 0 || size == maxSize) {\n            result.size = size;\n            result.start = start;\n            result.skip = skip;\n        }\n        return result.size > 4 ? result : undefined;\n    }\n    function copyToBuffer(bufferStart, buffer, index) {\n        let { id, start, end, size } = cursor;\n        cursor.next();\n        if (size >= 0 && id < minRepeatType) {\n            let startIndex = index;\n            if (size > 4) {\n                let endPos = cursor.pos - (size - 4);\n                while (cursor.pos > endPos)\n                    index = copyToBuffer(bufferStart, buffer, index);\n            }\n            buffer[--index] = startIndex;\n            buffer[--index] = end - bufferStart;\n            buffer[--index] = start - bufferStart;\n            buffer[--index] = id;\n        }\n        else if (size == -3 /* SpecialRecord.ContextChange */) {\n            contextHash = id;\n        }\n        else if (size == -4 /* SpecialRecord.LookAhead */) {\n            lookAhead = id;\n        }\n        return index;\n    }\n    let children = [], positions = [];\n    while (cursor.pos > 0)\n        takeNode(data.start || 0, data.bufferStart || 0, children, positions, -1, 0);\n    let length = (_a = data.length) !== null && _a !== void 0 ? _a : (children.length ? positions[0] + children[0].length : 0);\n    return new Tree(types[data.topID], children.reverse(), positions.reverse(), length);\n}\nconst nodeSizeCache = new WeakMap;\nfunction nodeSize(balanceType, node) {\n    if (!balanceType.isAnonymous || node instanceof TreeBuffer || node.type != balanceType)\n        return 1;\n    let size = nodeSizeCache.get(node);\n    if (size == null) {\n        size = 1;\n        for (let child of node.children) {\n            if (child.type != balanceType || !(child instanceof Tree)) {\n                size = 1;\n                break;\n            }\n            size += nodeSize(balanceType, child);\n        }\n        nodeSizeCache.set(node, size);\n    }\n    return size;\n}\nfunction balanceRange(\n// The type the balanced tree's inner nodes.\nbalanceType, \n// The direct children and their positions\nchildren, positions, \n// The index range in children/positions to use\nfrom, to, \n// The start position of the nodes, relative to their parent.\nstart, \n// Length of the outer node\nlength, \n// Function to build the top node of the balanced tree\nmkTop, \n// Function to build internal nodes for the balanced tree\nmkTree) {\n    let total = 0;\n    for (let i = from; i < to; i++)\n        total += nodeSize(balanceType, children[i]);\n    let maxChild = Math.ceil((total * 1.5) / 8 /* Balance.BranchFactor */);\n    let localChildren = [], localPositions = [];\n    function divide(children, positions, from, to, offset) {\n        for (let i = from; i < to;) {\n            let groupFrom = i, groupStart = positions[i], groupSize = nodeSize(balanceType, children[i]);\n            i++;\n            for (; i < to; i++) {\n                let nextSize = nodeSize(balanceType, children[i]);\n                if (groupSize + nextSize >= maxChild)\n                    break;\n                groupSize += nextSize;\n            }\n            if (i == groupFrom + 1) {\n                if (groupSize > maxChild) {\n                    let only = children[groupFrom]; // Only trees can have a size > 1\n                    divide(only.children, only.positions, 0, only.children.length, positions[groupFrom] + offset);\n                    continue;\n                }\n                localChildren.push(children[groupFrom]);\n            }\n            else {\n                let length = positions[i - 1] + children[i - 1].length - groupStart;\n                localChildren.push(balanceRange(balanceType, children, positions, groupFrom, i, groupStart, length, null, mkTree));\n            }\n            localPositions.push(groupStart + offset - start);\n        }\n    }\n    divide(children, positions, from, to, 0);\n    return (mkTop || mkTree)(localChildren, localPositions, length);\n}\n/**\nProvides a way to associate values with pieces of trees. As long\nas that part of the tree is reused, the associated values can be\nretrieved from an updated tree.\n*/\nclass NodeWeakMap {\n    constructor() {\n        this.map = new WeakMap();\n    }\n    setBuffer(buffer, index, value) {\n        let inner = this.map.get(buffer);\n        if (!inner)\n            this.map.set(buffer, inner = new Map);\n        inner.set(index, value);\n    }\n    getBuffer(buffer, index) {\n        let inner = this.map.get(buffer);\n        return inner && inner.get(index);\n    }\n    /**\n    Set the value for this syntax node.\n    */\n    set(node, value) {\n        if (node instanceof BufferNode)\n            this.setBuffer(node.context.buffer, node.index, value);\n        else if (node instanceof TreeNode)\n            this.map.set(node.tree, value);\n    }\n    /**\n    Retrieve value for this syntax node, if it exists in the map.\n    */\n    get(node) {\n        return node instanceof BufferNode ? this.getBuffer(node.context.buffer, node.index)\n            : node instanceof TreeNode ? this.map.get(node.tree) : undefined;\n    }\n    /**\n    Set the value for the node that a cursor currently points to.\n    */\n    cursorSet(cursor, value) {\n        if (cursor.buffer)\n            this.setBuffer(cursor.buffer.buffer, cursor.index, value);\n        else\n            this.map.set(cursor.tree, value);\n    }\n    /**\n    Retrieve the value for the node that a cursor currently points\n    to.\n    */\n    cursorGet(cursor) {\n        return cursor.buffer ? this.getBuffer(cursor.buffer.buffer, cursor.index) : this.map.get(cursor.tree);\n    }\n}\n\n/**\nTree fragments are used during [incremental\nparsing](#common.Parser.startParse) to track parts of old trees\nthat can be reused in a new parse. An array of fragments is used\nto track regions of an old tree whose nodes might be reused in new\nparses. Use the static\n[`applyChanges`](#common.TreeFragment^applyChanges) method to\nupdate fragments for document changes.\n*/\nclass TreeFragment {\n    /**\n    Construct a tree fragment. You'll usually want to use\n    [`addTree`](#common.TreeFragment^addTree) and\n    [`applyChanges`](#common.TreeFragment^applyChanges) instead of\n    calling this directly.\n    */\n    constructor(\n    /**\n    The start of the unchanged range pointed to by this fragment.\n    This refers to an offset in the _updated_ document (as opposed\n    to the original tree).\n    */\n    from, \n    /**\n    The end of the unchanged range.\n    */\n    to, \n    /**\n    The tree that this fragment is based on.\n    */\n    tree, \n    /**\n    The offset between the fragment's tree and the document that\n    this fragment can be used against. Add this when going from\n    document to tree positions, subtract it to go from tree to\n    document positions.\n    */\n    offset, openStart = false, openEnd = false) {\n        this.from = from;\n        this.to = to;\n        this.tree = tree;\n        this.offset = offset;\n        this.open = (openStart ? 1 /* Open.Start */ : 0) | (openEnd ? 2 /* Open.End */ : 0);\n    }\n    /**\n    Whether the start of the fragment represents the start of a\n    parse, or the end of a change. (In the second case, it may not\n    be safe to reuse some nodes at the start, depending on the\n    parsing algorithm.)\n    */\n    get openStart() { return (this.open & 1 /* Open.Start */) > 0; }\n    /**\n    Whether the end of the fragment represents the end of a\n    full-document parse, or the start of a change.\n    */\n    get openEnd() { return (this.open & 2 /* Open.End */) > 0; }\n    /**\n    Create a set of fragments from a freshly parsed tree, or update\n    an existing set of fragments by replacing the ones that overlap\n    with a tree with content from the new tree. When `partial` is\n    true, the parse is treated as incomplete, and the resulting\n    fragment has [`openEnd`](#common.TreeFragment.openEnd) set to\n    true.\n    */\n    static addTree(tree, fragments = [], partial = false) {\n        let result = [new TreeFragment(0, tree.length, tree, 0, false, partial)];\n        for (let f of fragments)\n            if (f.to > tree.length)\n                result.push(f);\n        return result;\n    }\n    /**\n    Apply a set of edits to an array of fragments, removing or\n    splitting fragments as necessary to remove edited ranges, and\n    adjusting offsets for fragments that moved.\n    */\n    static applyChanges(fragments, changes, minGap = 128) {\n        if (!changes.length)\n            return fragments;\n        let result = [];\n        let fI = 1, nextF = fragments.length ? fragments[0] : null;\n        for (let cI = 0, pos = 0, off = 0;; cI++) {\n            let nextC = cI < changes.length ? changes[cI] : null;\n            let nextPos = nextC ? nextC.fromA : 1e9;\n            if (nextPos - pos >= minGap)\n                while (nextF && nextF.from < nextPos) {\n                    let cut = nextF;\n                    if (pos >= cut.from || nextPos <= cut.to || off) {\n                        let fFrom = Math.max(cut.from, pos) - off, fTo = Math.min(cut.to, nextPos) - off;\n                        cut = fFrom >= fTo ? null : new TreeFragment(fFrom, fTo, cut.tree, cut.offset + off, cI > 0, !!nextC);\n                    }\n                    if (cut)\n                        result.push(cut);\n                    if (nextF.to > nextPos)\n                        break;\n                    nextF = fI < fragments.length ? fragments[fI++] : null;\n                }\n            if (!nextC)\n                break;\n            pos = nextC.toA;\n            off = nextC.toA - nextC.toB;\n        }\n        return result;\n    }\n}\n/**\nA superclass that parsers should extend.\n*/\nclass Parser {\n    /**\n    Start a parse, returning a [partial parse](#common.PartialParse)\n    object. [`fragments`](#common.TreeFragment) can be passed in to\n    make the parse incremental.\n    \n    By default, the entire input is parsed. You can pass `ranges`,\n    which should be a sorted array of non-empty, non-overlapping\n    ranges, to parse only those ranges. The tree returned in that\n    case will start at `ranges[0].from`.\n    */\n    startParse(input, fragments, ranges) {\n        if (typeof input == \"string\")\n            input = new StringInput(input);\n        ranges = !ranges ? [new Range(0, input.length)] : ranges.length ? ranges.map(r => new Range(r.from, r.to)) : [new Range(0, 0)];\n        return this.createParse(input, fragments || [], ranges);\n    }\n    /**\n    Run a full parse, returning the resulting tree.\n    */\n    parse(input, fragments, ranges) {\n        let parse = this.startParse(input, fragments, ranges);\n        for (;;) {\n            let done = parse.advance();\n            if (done)\n                return done;\n        }\n    }\n}\nclass StringInput {\n    constructor(string) {\n        this.string = string;\n    }\n    get length() { return this.string.length; }\n    chunk(from) { return this.string.slice(from); }\n    get lineChunks() { return false; }\n    read(from, to) { return this.string.slice(from, to); }\n}\n\n/**\nCreate a parse wrapper that, after the inner parse completes,\nscans its tree for mixed language regions with the `nest`\nfunction, runs the resulting [inner parses](#common.NestedParse),\nand then [mounts](#common.NodeProp^mounted) their results onto the\ntree.\n*/\nfunction parseMixed(nest) {\n    return (parse, input, fragments, ranges) => new MixedParse(parse, nest, input, fragments, ranges);\n}\nclass InnerParse {\n    constructor(parser, parse, overlay, target, from) {\n        this.parser = parser;\n        this.parse = parse;\n        this.overlay = overlay;\n        this.target = target;\n        this.from = from;\n    }\n}\nfunction checkRanges(ranges) {\n    if (!ranges.length || ranges.some(r => r.from >= r.to))\n        throw new RangeError(\"Invalid inner parse ranges given: \" + JSON.stringify(ranges));\n}\nclass ActiveOverlay {\n    constructor(parser, predicate, mounts, index, start, target, prev) {\n        this.parser = parser;\n        this.predicate = predicate;\n        this.mounts = mounts;\n        this.index = index;\n        this.start = start;\n        this.target = target;\n        this.prev = prev;\n        this.depth = 0;\n        this.ranges = [];\n    }\n}\nconst stoppedInner = new NodeProp({ perNode: true });\nclass MixedParse {\n    constructor(base, nest, input, fragments, ranges) {\n        this.nest = nest;\n        this.input = input;\n        this.fragments = fragments;\n        this.ranges = ranges;\n        this.inner = [];\n        this.innerDone = 0;\n        this.baseTree = null;\n        this.stoppedAt = null;\n        this.baseParse = base;\n    }\n    advance() {\n        if (this.baseParse) {\n            let done = this.baseParse.advance();\n            if (!done)\n                return null;\n            this.baseParse = null;\n            this.baseTree = done;\n            this.startInner();\n            if (this.stoppedAt != null)\n                for (let inner of this.inner)\n                    inner.parse.stopAt(this.stoppedAt);\n        }\n        if (this.innerDone == this.inner.length) {\n            let result = this.baseTree;\n            if (this.stoppedAt != null)\n                result = new Tree(result.type, result.children, result.positions, result.length, result.propValues.concat([[stoppedInner, this.stoppedAt]]));\n            return result;\n        }\n        let inner = this.inner[this.innerDone], done = inner.parse.advance();\n        if (done) {\n            this.innerDone++;\n            // This is a somewhat dodgy but super helpful hack where we\n            // patch up nodes created by the inner parse (and thus\n            // presumably not aliased anywhere else) to hold the information\n            // about the inner parse.\n            let props = Object.assign(Object.create(null), inner.target.props);\n            props[NodeProp.mounted.id] = new MountedTree(done, inner.overlay, inner.parser);\n            inner.target.props = props;\n        }\n        return null;\n    }\n    get parsedPos() {\n        if (this.baseParse)\n            return 0;\n        let pos = this.input.length;\n        for (let i = this.innerDone; i < this.inner.length; i++) {\n            if (this.inner[i].from < pos)\n                pos = Math.min(pos, this.inner[i].parse.parsedPos);\n        }\n        return pos;\n    }\n    stopAt(pos) {\n        this.stoppedAt = pos;\n        if (this.baseParse)\n            this.baseParse.stopAt(pos);\n        else\n            for (let i = this.innerDone; i < this.inner.length; i++)\n                this.inner[i].parse.stopAt(pos);\n    }\n    startInner() {\n        let fragmentCursor = new FragmentCursor(this.fragments);\n        let overlay = null;\n        let covered = null;\n        let cursor = new TreeCursor(new TreeNode(this.baseTree, this.ranges[0].from, 0, null), IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n        scan: for (let nest, isCovered;;) {\n            let enter = true, range;\n            if (this.stoppedAt != null && cursor.from >= this.stoppedAt) {\n                enter = false;\n            }\n            else if (fragmentCursor.hasNode(cursor)) {\n                if (overlay) {\n                    let match = overlay.mounts.find(m => m.frag.from <= cursor.from && m.frag.to >= cursor.to && m.mount.overlay);\n                    if (match)\n                        for (let r of match.mount.overlay) {\n                            let from = r.from + match.pos, to = r.to + match.pos;\n                            if (from >= cursor.from && to <= cursor.to && !overlay.ranges.some(r => r.from < to && r.to > from))\n                                overlay.ranges.push({ from, to });\n                        }\n                }\n                enter = false;\n            }\n            else if (covered && (isCovered = checkCover(covered.ranges, cursor.from, cursor.to))) {\n                enter = isCovered != 2 /* Cover.Full */;\n            }\n            else if (!cursor.type.isAnonymous && (nest = this.nest(cursor, this.input)) &&\n                (cursor.from < cursor.to || !nest.overlay)) {\n                if (!cursor.tree)\n                    materialize(cursor);\n                let oldMounts = fragmentCursor.findMounts(cursor.from, nest.parser);\n                if (typeof nest.overlay == \"function\") {\n                    overlay = new ActiveOverlay(nest.parser, nest.overlay, oldMounts, this.inner.length, cursor.from, cursor.tree, overlay);\n                }\n                else {\n                    let ranges = punchRanges(this.ranges, nest.overlay ||\n                        (cursor.from < cursor.to ? [new Range(cursor.from, cursor.to)] : []));\n                    if (ranges.length)\n                        checkRanges(ranges);\n                    if (ranges.length || !nest.overlay)\n                        this.inner.push(new InnerParse(nest.parser, ranges.length ? nest.parser.startParse(this.input, enterFragments(oldMounts, ranges), ranges)\n                            : nest.parser.startParse(\"\"), nest.overlay ? nest.overlay.map(r => new Range(r.from - cursor.from, r.to - cursor.from)) : null, cursor.tree, ranges.length ? ranges[0].from : cursor.from));\n                    if (!nest.overlay)\n                        enter = false;\n                    else if (ranges.length)\n                        covered = { ranges, depth: 0, prev: covered };\n                }\n            }\n            else if (overlay && (range = overlay.predicate(cursor))) {\n                if (range === true)\n                    range = new Range(cursor.from, cursor.to);\n                if (range.from < range.to) {\n                    let last = overlay.ranges.length - 1;\n                    if (last >= 0 && overlay.ranges[last].to == range.from)\n                        overlay.ranges[last] = { from: overlay.ranges[last].from, to: range.to };\n                    else\n                        overlay.ranges.push(range);\n                }\n            }\n            if (enter && cursor.firstChild()) {\n                if (overlay)\n                    overlay.depth++;\n                if (covered)\n                    covered.depth++;\n            }\n            else {\n                for (;;) {\n                    if (cursor.nextSibling())\n                        break;\n                    if (!cursor.parent())\n                        break scan;\n                    if (overlay && !--overlay.depth) {\n                        let ranges = punchRanges(this.ranges, overlay.ranges);\n                        if (ranges.length) {\n                            checkRanges(ranges);\n                            this.inner.splice(overlay.index, 0, new InnerParse(overlay.parser, overlay.parser.startParse(this.input, enterFragments(overlay.mounts, ranges), ranges), overlay.ranges.map(r => new Range(r.from - overlay.start, r.to - overlay.start)), overlay.target, ranges[0].from));\n                        }\n                        overlay = overlay.prev;\n                    }\n                    if (covered && !--covered.depth)\n                        covered = covered.prev;\n                }\n            }\n        }\n    }\n}\nfunction checkCover(covered, from, to) {\n    for (let range of covered) {\n        if (range.from >= to)\n            break;\n        if (range.to > from)\n            return range.from <= from && range.to >= to ? 2 /* Cover.Full */ : 1 /* Cover.Partial */;\n    }\n    return 0 /* Cover.None */;\n}\n// Take a piece of buffer and convert it into a stand-alone\n// TreeBuffer.\nfunction sliceBuf(buf, startI, endI, nodes, positions, off) {\n    if (startI < endI) {\n        let from = buf.buffer[startI + 1];\n        nodes.push(buf.slice(startI, endI, from));\n        positions.push(from - off);\n    }\n}\n// This function takes a node that's in a buffer, and converts it, and\n// its parent buffer nodes, into a Tree. This is again acting on the\n// assumption that the trees and buffers have been constructed by the\n// parse that was ran via the mix parser, and thus aren't shared with\n// any other code, making violations of the immutability safe.\nfunction materialize(cursor) {\n    let { node } = cursor, stack = [];\n    let buffer = node.context.buffer;\n    // Scan up to the nearest tree\n    do {\n        stack.push(cursor.index);\n        cursor.parent();\n    } while (!cursor.tree);\n    // Find the index of the buffer in that tree\n    let base = cursor.tree, i = base.children.indexOf(buffer);\n    let buf = base.children[i], b = buf.buffer, newStack = [i];\n    // Split a level in the buffer, putting the nodes before and after\n    // the child that contains `node` into new buffers.\n    function split(startI, endI, type, innerOffset, length, stackPos) {\n        let targetI = stack[stackPos];\n        let children = [], positions = [];\n        sliceBuf(buf, startI, targetI, children, positions, innerOffset);\n        let from = b[targetI + 1], to = b[targetI + 2];\n        newStack.push(children.length);\n        let child = stackPos\n            ? split(targetI + 4, b[targetI + 3], buf.set.types[b[targetI]], from, to - from, stackPos - 1)\n            : node.toTree();\n        children.push(child);\n        positions.push(from - innerOffset);\n        sliceBuf(buf, b[targetI + 3], endI, children, positions, innerOffset);\n        return new Tree(type, children, positions, length);\n    }\n    base.children[i] = split(0, b.length, NodeType.none, 0, buf.length, stack.length - 1);\n    // Move the cursor back to the target node\n    for (let index of newStack) {\n        let tree = cursor.tree.children[index], pos = cursor.tree.positions[index];\n        cursor.yield(new TreeNode(tree, pos + cursor.from, index, cursor._tree));\n    }\n}\nclass StructureCursor {\n    constructor(root, offset) {\n        this.offset = offset;\n        this.done = false;\n        this.cursor = root.cursor(IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n    }\n    // Move to the first node (in pre-order) that starts at or after `pos`.\n    moveTo(pos) {\n        let { cursor } = this, p = pos - this.offset;\n        while (!this.done && cursor.from < p) {\n            if (cursor.to >= pos && cursor.enter(p, 1, IterMode.IgnoreOverlays | IterMode.ExcludeBuffers)) ;\n            else if (!cursor.next(false))\n                this.done = true;\n        }\n    }\n    hasNode(cursor) {\n        this.moveTo(cursor.from);\n        if (!this.done && this.cursor.from + this.offset == cursor.from && this.cursor.tree) {\n            for (let tree = this.cursor.tree;;) {\n                if (tree == cursor.tree)\n                    return true;\n                if (tree.children.length && tree.positions[0] == 0 && tree.children[0] instanceof Tree)\n                    tree = tree.children[0];\n                else\n                    break;\n            }\n        }\n        return false;\n    }\n}\nclass FragmentCursor {\n    constructor(fragments) {\n        var _a;\n        this.fragments = fragments;\n        this.curTo = 0;\n        this.fragI = 0;\n        if (fragments.length) {\n            let first = this.curFrag = fragments[0];\n            this.curTo = (_a = first.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : first.to;\n            this.inner = new StructureCursor(first.tree, -first.offset);\n        }\n        else {\n            this.curFrag = this.inner = null;\n        }\n    }\n    hasNode(node) {\n        while (this.curFrag && node.from >= this.curTo)\n            this.nextFrag();\n        return this.curFrag && this.curFrag.from <= node.from && this.curTo >= node.to && this.inner.hasNode(node);\n    }\n    nextFrag() {\n        var _a;\n        this.fragI++;\n        if (this.fragI == this.fragments.length) {\n            this.curFrag = this.inner = null;\n        }\n        else {\n            let frag = this.curFrag = this.fragments[this.fragI];\n            this.curTo = (_a = frag.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : frag.to;\n            this.inner = new StructureCursor(frag.tree, -frag.offset);\n        }\n    }\n    findMounts(pos, parser) {\n        var _a;\n        let result = [];\n        if (this.inner) {\n            this.inner.cursor.moveTo(pos, 1);\n            for (let pos = this.inner.cursor.node; pos; pos = pos.parent) {\n                let mount = (_a = pos.tree) === null || _a === void 0 ? void 0 : _a.prop(NodeProp.mounted);\n                if (mount && mount.parser == parser) {\n                    for (let i = this.fragI; i < this.fragments.length; i++) {\n                        let frag = this.fragments[i];\n                        if (frag.from >= pos.to)\n                            break;\n                        if (frag.tree == this.curFrag.tree)\n                            result.push({\n                                frag,\n                                pos: pos.from - frag.offset,\n                                mount\n                            });\n                    }\n                }\n            }\n        }\n        return result;\n    }\n}\nfunction punchRanges(outer, ranges) {\n    let copy = null, current = ranges;\n    for (let i = 1, j = 0; i < outer.length; i++) {\n        let gapFrom = outer[i - 1].to, gapTo = outer[i].from;\n        for (; j < current.length; j++) {\n            let r = current[j];\n            if (r.from >= gapTo)\n                break;\n            if (r.to <= gapFrom)\n                continue;\n            if (!copy)\n                current = copy = ranges.slice();\n            if (r.from < gapFrom) {\n                copy[j] = new Range(r.from, gapFrom);\n                if (r.to > gapTo)\n                    copy.splice(j + 1, 0, new Range(gapTo, r.to));\n            }\n            else if (r.to > gapTo) {\n                copy[j--] = new Range(gapTo, r.to);\n            }\n            else {\n                copy.splice(j--, 1);\n            }\n        }\n    }\n    return current;\n}\nfunction findCoverChanges(a, b, from, to) {\n    let iA = 0, iB = 0, inA = false, inB = false, pos = -1e9;\n    let result = [];\n    for (;;) {\n        let nextA = iA == a.length ? 1e9 : inA ? a[iA].to : a[iA].from;\n        let nextB = iB == b.length ? 1e9 : inB ? b[iB].to : b[iB].from;\n        if (inA != inB) {\n            let start = Math.max(pos, from), end = Math.min(nextA, nextB, to);\n            if (start < end)\n                result.push(new Range(start, end));\n        }\n        pos = Math.min(nextA, nextB);\n        if (pos == 1e9)\n            break;\n        if (nextA == pos) {\n            if (!inA)\n                inA = true;\n            else {\n                inA = false;\n                iA++;\n            }\n        }\n        if (nextB == pos) {\n            if (!inB)\n                inB = true;\n            else {\n                inB = false;\n                iB++;\n            }\n        }\n    }\n    return result;\n}\n// Given a number of fragments for the outer tree, and a set of ranges\n// to parse, find fragments for inner trees mounted around those\n// ranges, if any.\nfunction enterFragments(mounts, ranges) {\n    let result = [];\n    for (let { pos, mount, frag } of mounts) {\n        let startPos = pos + (mount.overlay ? mount.overlay[0].from : 0), endPos = startPos + mount.tree.length;\n        let from = Math.max(frag.from, startPos), to = Math.min(frag.to, endPos);\n        if (mount.overlay) {\n            let overlay = mount.overlay.map(r => new Range(r.from + pos, r.to + pos));\n            let changes = findCoverChanges(ranges, overlay, from, to);\n            for (let i = 0, pos = from;; i++) {\n                let last = i == changes.length, end = last ? to : changes[i].from;\n                if (end > pos)\n                    result.push(new TreeFragment(pos, end, mount.tree, -startPos, frag.from >= pos || frag.openStart, frag.to <= end || frag.openEnd));\n                if (last)\n                    break;\n                pos = changes[i].to;\n            }\n        }\n        else {\n            result.push(new TreeFragment(from, to, mount.tree, -startPos, frag.from >= startPos || frag.openStart, frag.to <= endPos || frag.openEnd));\n        }\n    }\n    return result;\n}\n\nexport { DefaultBufferLength, IterMode, MountedTree, NodeProp, NodeSet, NodeType, NodeWeakMap, Parser, Tree, TreeBuffer, TreeCursor, TreeFragment, parseMixed };\n","import { Parser, NodeProp, NodeSet, NodeType, DefaultBufferLength, Tree, IterMode } from '@lezer/common';\n\n/**\nA parse stack. These are used internally by the parser to track\nparsing progress. They also provide some properties and methods\nthat external code such as a tokenizer can use to get information\nabout the parse state.\n*/\nclass Stack {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The parse that this stack is part of @internal\n    */\n    p, \n    /**\n    Holds state, input pos, buffer index triplets for all but the\n    top state @internal\n    */\n    stack, \n    /**\n    The current parse state @internal\n    */\n    state, \n    // The position at which the next reduce should take place. This\n    // can be less than `this.pos` when skipped expressions have been\n    // added to the stack (which should be moved outside of the next\n    // reduction)\n    /**\n    @internal\n    */\n    reducePos, \n    /**\n    The input position up to which this stack has parsed.\n    */\n    pos, \n    /**\n    The dynamic score of the stack, including dynamic precedence\n    and error-recovery penalties\n    @internal\n    */\n    score, \n    // The output buffer. Holds (type, start, end, size) quads\n    // representing nodes created by the parser, where `size` is\n    // amount of buffer array entries covered by this node.\n    /**\n    @internal\n    */\n    buffer, \n    // The base offset of the buffer. When stacks are split, the split\n    // instance shared the buffer history with its parent up to\n    // `bufferBase`, which is the absolute offset (including the\n    // offset of previous splits) into the buffer at which this stack\n    // starts writing.\n    /**\n    @internal\n    */\n    bufferBase, \n    /**\n    @internal\n    */\n    curContext, \n    /**\n    @internal\n    */\n    lookAhead = 0, \n    // A parent stack from which this was split off, if any. This is\n    // set up so that it always points to a stack that has some\n    // additional buffer content, never to a stack with an equal\n    // `bufferBase`.\n    /**\n    @internal\n    */\n    parent) {\n        this.p = p;\n        this.stack = stack;\n        this.state = state;\n        this.reducePos = reducePos;\n        this.pos = pos;\n        this.score = score;\n        this.buffer = buffer;\n        this.bufferBase = bufferBase;\n        this.curContext = curContext;\n        this.lookAhead = lookAhead;\n        this.parent = parent;\n    }\n    /**\n    @internal\n    */\n    toString() {\n        return `[${this.stack.filter((_, i) => i % 3 == 0).concat(this.state)}]@${this.pos}${this.score ? \"!\" + this.score : \"\"}`;\n    }\n    // Start an empty stack\n    /**\n    @internal\n    */\n    static start(p, state, pos = 0) {\n        let cx = p.parser.context;\n        return new Stack(p, [], state, pos, pos, 0, [], 0, cx ? new StackContext(cx, cx.start) : null, 0, null);\n    }\n    /**\n    The stack's current [context](#lr.ContextTracker) value, if\n    any. Its type will depend on the context tracker's type\n    parameter, or it will be `null` if there is no context\n    tracker.\n    */\n    get context() { return this.curContext ? this.curContext.context : null; }\n    // Push a state onto the stack, tracking its start position as well\n    // as the buffer base at that point.\n    /**\n    @internal\n    */\n    pushState(state, start) {\n        this.stack.push(this.state, start, this.bufferBase + this.buffer.length);\n        this.state = state;\n    }\n    // Apply a reduce action\n    /**\n    @internal\n    */\n    reduce(action) {\n        var _a;\n        let depth = action >> 19 /* Action.ReduceDepthShift */, type = action & 65535 /* Action.ValueMask */;\n        let { parser } = this.p;\n        let lookaheadRecord = this.reducePos < this.pos - 25 /* Lookahead.Margin */;\n        if (lookaheadRecord)\n            this.setLookAhead(this.pos);\n        let dPrec = parser.dynamicPrecedence(type);\n        if (dPrec)\n            this.score += dPrec;\n        if (depth == 0) {\n            this.pushState(parser.getGoto(this.state, type, true), this.reducePos);\n            // Zero-depth reductions are a special case—they add stuff to\n            // the stack without popping anything off.\n            if (type < parser.minRepeatTerm)\n                this.storeNode(type, this.reducePos, this.reducePos, lookaheadRecord ? 8 : 4, true);\n            this.reduceContext(type, this.reducePos);\n            return;\n        }\n        // Find the base index into `this.stack`, content after which will\n        // be dropped. Note that with `StayFlag` reductions we need to\n        // consume two extra frames (the dummy parent node for the skipped\n        // expression and the state that we'll be staying in, which should\n        // be moved to `this.state`).\n        let base = this.stack.length - ((depth - 1) * 3) - (action & 262144 /* Action.StayFlag */ ? 6 : 0);\n        let start = base ? this.stack[base - 2] : this.p.ranges[0].from, size = this.reducePos - start;\n        // This is a kludge to try and detect overly deep left-associative\n        // trees, which will not increase the parse stack depth and thus\n        // won't be caught by the regular stack-depth limit check.\n        if (size >= 2000 /* Recover.MinBigReduction */ && !((_a = this.p.parser.nodeSet.types[type]) === null || _a === void 0 ? void 0 : _a.isAnonymous)) {\n            if (start == this.p.lastBigReductionStart) {\n                this.p.bigReductionCount++;\n                this.p.lastBigReductionSize = size;\n            }\n            else if (this.p.lastBigReductionSize < size) {\n                this.p.bigReductionCount = 1;\n                this.p.lastBigReductionStart = start;\n                this.p.lastBigReductionSize = size;\n            }\n        }\n        let bufferBase = base ? this.stack[base - 1] : 0, count = this.bufferBase + this.buffer.length - bufferBase;\n        // Store normal terms or `R -> R R` repeat reductions\n        if (type < parser.minRepeatTerm || (action & 131072 /* Action.RepeatFlag */)) {\n            let pos = parser.stateFlag(this.state, 1 /* StateFlag.Skipped */) ? this.pos : this.reducePos;\n            this.storeNode(type, start, pos, count + 4, true);\n        }\n        if (action & 262144 /* Action.StayFlag */) {\n            this.state = this.stack[base];\n        }\n        else {\n            let baseStateID = this.stack[base - 3];\n            this.state = parser.getGoto(baseStateID, type, true);\n        }\n        while (this.stack.length > base)\n            this.stack.pop();\n        this.reduceContext(type, start);\n    }\n    // Shift a value into the buffer\n    /**\n    @internal\n    */\n    storeNode(term, start, end, size = 4, mustSink = false) {\n        if (term == 0 /* Term.Err */ &&\n            (!this.stack.length || this.stack[this.stack.length - 1] < this.buffer.length + this.bufferBase)) {\n            // Try to omit/merge adjacent error nodes\n            let cur = this, top = this.buffer.length;\n            if (top == 0 && cur.parent) {\n                top = cur.bufferBase - cur.parent.bufferBase;\n                cur = cur.parent;\n            }\n            if (top > 0 && cur.buffer[top - 4] == 0 /* Term.Err */ && cur.buffer[top - 1] > -1) {\n                if (start == end)\n                    return;\n                if (cur.buffer[top - 2] >= start) {\n                    cur.buffer[top - 2] = end;\n                    return;\n                }\n            }\n        }\n        if (!mustSink || this.pos == end) { // Simple case, just append\n            this.buffer.push(term, start, end, size);\n        }\n        else { // There may be skipped nodes that have to be moved forward\n            let index = this.buffer.length;\n            if (index > 0 && this.buffer[index - 4] != 0 /* Term.Err */) {\n                let mustMove = false;\n                for (let scan = index; scan > 0 && this.buffer[scan - 2] > end; scan -= 4) {\n                    if (this.buffer[scan - 1] >= 0) {\n                        mustMove = true;\n                        break;\n                    }\n                }\n                if (mustMove)\n                    while (index > 0 && this.buffer[index - 2] > end) {\n                        // Move this record forward\n                        this.buffer[index] = this.buffer[index - 4];\n                        this.buffer[index + 1] = this.buffer[index - 3];\n                        this.buffer[index + 2] = this.buffer[index - 2];\n                        this.buffer[index + 3] = this.buffer[index - 1];\n                        index -= 4;\n                        if (size > 4)\n                            size -= 4;\n                    }\n            }\n            this.buffer[index] = term;\n            this.buffer[index + 1] = start;\n            this.buffer[index + 2] = end;\n            this.buffer[index + 3] = size;\n        }\n    }\n    // Apply a shift action\n    /**\n    @internal\n    */\n    shift(action, type, start, end) {\n        if (action & 131072 /* Action.GotoFlag */) {\n            this.pushState(action & 65535 /* Action.ValueMask */, this.pos);\n        }\n        else if ((action & 262144 /* Action.StayFlag */) == 0) { // Regular shift\n            let nextState = action, { parser } = this.p;\n            if (end > this.pos || type <= parser.maxNode) {\n                this.pos = end;\n                if (!parser.stateFlag(nextState, 1 /* StateFlag.Skipped */))\n                    this.reducePos = end;\n            }\n            this.pushState(nextState, start);\n            this.shiftContext(type, start);\n            if (type <= parser.maxNode)\n                this.buffer.push(type, start, end, 4);\n        }\n        else { // Shift-and-stay, which means this is a skipped token\n            this.pos = end;\n            this.shiftContext(type, start);\n            if (type <= this.p.parser.maxNode)\n                this.buffer.push(type, start, end, 4);\n        }\n    }\n    // Apply an action\n    /**\n    @internal\n    */\n    apply(action, next, nextStart, nextEnd) {\n        if (action & 65536 /* Action.ReduceFlag */)\n            this.reduce(action);\n        else\n            this.shift(action, next, nextStart, nextEnd);\n    }\n    // Add a prebuilt (reused) node into the buffer.\n    /**\n    @internal\n    */\n    useNode(value, next) {\n        let index = this.p.reused.length - 1;\n        if (index < 0 || this.p.reused[index] != value) {\n            this.p.reused.push(value);\n            index++;\n        }\n        let start = this.pos;\n        this.reducePos = this.pos = start + value.length;\n        this.pushState(next, start);\n        this.buffer.push(index, start, this.reducePos, -1 /* size == -1 means this is a reused value */);\n        if (this.curContext)\n            this.updateContext(this.curContext.tracker.reuse(this.curContext.context, value, this, this.p.stream.reset(this.pos - value.length)));\n    }\n    // Split the stack. Due to the buffer sharing and the fact\n    // that `this.stack` tends to stay quite shallow, this isn't very\n    // expensive.\n    /**\n    @internal\n    */\n    split() {\n        let parent = this;\n        let off = parent.buffer.length;\n        // Because the top of the buffer (after this.pos) may be mutated\n        // to reorder reductions and skipped tokens, and shared buffers\n        // should be immutable, this copies any outstanding skipped tokens\n        // to the new buffer, and puts the base pointer before them.\n        while (off > 0 && parent.buffer[off - 2] > parent.reducePos)\n            off -= 4;\n        let buffer = parent.buffer.slice(off), base = parent.bufferBase + off;\n        // Make sure parent points to an actual parent with content, if there is such a parent.\n        while (parent && base == parent.bufferBase)\n            parent = parent.parent;\n        return new Stack(this.p, this.stack.slice(), this.state, this.reducePos, this.pos, this.score, buffer, base, this.curContext, this.lookAhead, parent);\n    }\n    // Try to recover from an error by 'deleting' (ignoring) one token.\n    /**\n    @internal\n    */\n    recoverByDelete(next, nextEnd) {\n        let isNode = next <= this.p.parser.maxNode;\n        if (isNode)\n            this.storeNode(next, this.pos, nextEnd, 4);\n        this.storeNode(0 /* Term.Err */, this.pos, nextEnd, isNode ? 8 : 4);\n        this.pos = this.reducePos = nextEnd;\n        this.score -= 190 /* Recover.Delete */;\n    }\n    /**\n    Check if the given term would be able to be shifted (optionally\n    after some reductions) on this stack. This can be useful for\n    external tokenizers that want to make sure they only provide a\n    given token when it applies.\n    */\n    canShift(term) {\n        for (let sim = new SimulatedStack(this);;) {\n            let action = this.p.parser.stateSlot(sim.state, 4 /* ParseState.DefaultReduce */) || this.p.parser.hasAction(sim.state, term);\n            if (action == 0)\n                return false;\n            if ((action & 65536 /* Action.ReduceFlag */) == 0)\n                return true;\n            sim.reduce(action);\n        }\n    }\n    // Apply up to Recover.MaxNext recovery actions that conceptually\n    // inserts some missing token or rule.\n    /**\n    @internal\n    */\n    recoverByInsert(next) {\n        if (this.stack.length >= 300 /* Recover.MaxInsertStackDepth */)\n            return [];\n        let nextStates = this.p.parser.nextStates(this.state);\n        if (nextStates.length > 4 /* Recover.MaxNext */ << 1 || this.stack.length >= 120 /* Recover.DampenInsertStackDepth */) {\n            let best = [];\n            for (let i = 0, s; i < nextStates.length; i += 2) {\n                if ((s = nextStates[i + 1]) != this.state && this.p.parser.hasAction(s, next))\n                    best.push(nextStates[i], s);\n            }\n            if (this.stack.length < 120 /* Recover.DampenInsertStackDepth */)\n                for (let i = 0; best.length < 4 /* Recover.MaxNext */ << 1 && i < nextStates.length; i += 2) {\n                    let s = nextStates[i + 1];\n                    if (!best.some((v, i) => (i & 1) && v == s))\n                        best.push(nextStates[i], s);\n                }\n            nextStates = best;\n        }\n        let result = [];\n        for (let i = 0; i < nextStates.length && result.length < 4 /* Recover.MaxNext */; i += 2) {\n            let s = nextStates[i + 1];\n            if (s == this.state)\n                continue;\n            let stack = this.split();\n            stack.pushState(s, this.pos);\n            stack.storeNode(0 /* Term.Err */, stack.pos, stack.pos, 4, true);\n            stack.shiftContext(nextStates[i], this.pos);\n            stack.reducePos = this.pos;\n            stack.score -= 200 /* Recover.Insert */;\n            result.push(stack);\n        }\n        return result;\n    }\n    // Force a reduce, if possible. Return false if that can't\n    // be done.\n    /**\n    @internal\n    */\n    forceReduce() {\n        let { parser } = this.p;\n        let reduce = parser.stateSlot(this.state, 5 /* ParseState.ForcedReduce */);\n        if ((reduce & 65536 /* Action.ReduceFlag */) == 0)\n            return false;\n        if (!parser.validAction(this.state, reduce)) {\n            let depth = reduce >> 19 /* Action.ReduceDepthShift */, term = reduce & 65535 /* Action.ValueMask */;\n            let target = this.stack.length - depth * 3;\n            if (target < 0 || parser.getGoto(this.stack[target], term, false) < 0) {\n                let backup = this.findForcedReduction();\n                if (backup == null)\n                    return false;\n                reduce = backup;\n            }\n            this.storeNode(0 /* Term.Err */, this.pos, this.pos, 4, true);\n            this.score -= 100 /* Recover.Reduce */;\n        }\n        this.reducePos = this.pos;\n        this.reduce(reduce);\n        return true;\n    }\n    /**\n    Try to scan through the automaton to find some kind of reduction\n    that can be applied. Used when the regular ForcedReduce field\n    isn't a valid action. @internal\n    */\n    findForcedReduction() {\n        let { parser } = this.p, seen = [];\n        let explore = (state, depth) => {\n            if (seen.includes(state))\n                return;\n            seen.push(state);\n            return parser.allActions(state, (action) => {\n                if (action & (262144 /* Action.StayFlag */ | 131072 /* Action.GotoFlag */)) ;\n                else if (action & 65536 /* Action.ReduceFlag */) {\n                    let rDepth = (action >> 19 /* Action.ReduceDepthShift */) - depth;\n                    if (rDepth > 1) {\n                        let term = action & 65535 /* Action.ValueMask */, target = this.stack.length - rDepth * 3;\n                        if (target >= 0 && parser.getGoto(this.stack[target], term, false) >= 0)\n                            return (rDepth << 19 /* Action.ReduceDepthShift */) | 65536 /* Action.ReduceFlag */ | term;\n                    }\n                }\n                else {\n                    let found = explore(action, depth + 1);\n                    if (found != null)\n                        return found;\n                }\n            });\n        };\n        return explore(this.state, 0);\n    }\n    /**\n    @internal\n    */\n    forceAll() {\n        while (!this.p.parser.stateFlag(this.state, 2 /* StateFlag.Accepting */)) {\n            if (!this.forceReduce()) {\n                this.storeNode(0 /* Term.Err */, this.pos, this.pos, 4, true);\n                break;\n            }\n        }\n        return this;\n    }\n    /**\n    Check whether this state has no further actions (assumed to be a direct descendant of the\n    top state, since any other states must be able to continue\n    somehow). @internal\n    */\n    get deadEnd() {\n        if (this.stack.length != 3)\n            return false;\n        let { parser } = this.p;\n        return parser.data[parser.stateSlot(this.state, 1 /* ParseState.Actions */)] == 65535 /* Seq.End */ &&\n            !parser.stateSlot(this.state, 4 /* ParseState.DefaultReduce */);\n    }\n    /**\n    Restart the stack (put it back in its start state). Only safe\n    when this.stack.length == 3 (state is directly below the top\n    state). @internal\n    */\n    restart() {\n        this.storeNode(0 /* Term.Err */, this.pos, this.pos, 4, true);\n        this.state = this.stack[0];\n        this.stack.length = 0;\n    }\n    /**\n    @internal\n    */\n    sameState(other) {\n        if (this.state != other.state || this.stack.length != other.stack.length)\n            return false;\n        for (let i = 0; i < this.stack.length; i += 3)\n            if (this.stack[i] != other.stack[i])\n                return false;\n        return true;\n    }\n    /**\n    Get the parser used by this stack.\n    */\n    get parser() { return this.p.parser; }\n    /**\n    Test whether a given dialect (by numeric ID, as exported from\n    the terms file) is enabled.\n    */\n    dialectEnabled(dialectID) { return this.p.parser.dialect.flags[dialectID]; }\n    shiftContext(term, start) {\n        if (this.curContext)\n            this.updateContext(this.curContext.tracker.shift(this.curContext.context, term, this, this.p.stream.reset(start)));\n    }\n    reduceContext(term, start) {\n        if (this.curContext)\n            this.updateContext(this.curContext.tracker.reduce(this.curContext.context, term, this, this.p.stream.reset(start)));\n    }\n    /**\n    @internal\n    */\n    emitContext() {\n        let last = this.buffer.length - 1;\n        if (last < 0 || this.buffer[last] != -3)\n            this.buffer.push(this.curContext.hash, this.pos, this.pos, -3);\n    }\n    /**\n    @internal\n    */\n    emitLookAhead() {\n        let last = this.buffer.length - 1;\n        if (last < 0 || this.buffer[last] != -4)\n            this.buffer.push(this.lookAhead, this.pos, this.pos, -4);\n    }\n    updateContext(context) {\n        if (context != this.curContext.context) {\n            let newCx = new StackContext(this.curContext.tracker, context);\n            if (newCx.hash != this.curContext.hash)\n                this.emitContext();\n            this.curContext = newCx;\n        }\n    }\n    /**\n    @internal\n    */\n    setLookAhead(lookAhead) {\n        if (lookAhead > this.lookAhead) {\n            this.emitLookAhead();\n            this.lookAhead = lookAhead;\n        }\n    }\n    /**\n    @internal\n    */\n    close() {\n        if (this.curContext && this.curContext.tracker.strict)\n            this.emitContext();\n        if (this.lookAhead > 0)\n            this.emitLookAhead();\n    }\n}\nclass StackContext {\n    constructor(tracker, context) {\n        this.tracker = tracker;\n        this.context = context;\n        this.hash = tracker.strict ? tracker.hash(context) : 0;\n    }\n}\n// Used to cheaply run some reductions to scan ahead without mutating\n// an entire stack\nclass SimulatedStack {\n    constructor(start) {\n        this.start = start;\n        this.state = start.state;\n        this.stack = start.stack;\n        this.base = this.stack.length;\n    }\n    reduce(action) {\n        let term = action & 65535 /* Action.ValueMask */, depth = action >> 19 /* Action.ReduceDepthShift */;\n        if (depth == 0) {\n            if (this.stack == this.start.stack)\n                this.stack = this.stack.slice();\n            this.stack.push(this.state, 0, 0);\n            this.base += 3;\n        }\n        else {\n            this.base -= (depth - 1) * 3;\n        }\n        let goto = this.start.p.parser.getGoto(this.stack[this.base - 3], term, true);\n        this.state = goto;\n    }\n}\n// This is given to `Tree.build` to build a buffer, and encapsulates\n// the parent-stack-walking necessary to read the nodes.\nclass StackBufferCursor {\n    constructor(stack, pos, index) {\n        this.stack = stack;\n        this.pos = pos;\n        this.index = index;\n        this.buffer = stack.buffer;\n        if (this.index == 0)\n            this.maybeNext();\n    }\n    static create(stack, pos = stack.bufferBase + stack.buffer.length) {\n        return new StackBufferCursor(stack, pos, pos - stack.bufferBase);\n    }\n    maybeNext() {\n        let next = this.stack.parent;\n        if (next != null) {\n            this.index = this.stack.bufferBase - next.bufferBase;\n            this.stack = next;\n            this.buffer = next.buffer;\n        }\n    }\n    get id() { return this.buffer[this.index - 4]; }\n    get start() { return this.buffer[this.index - 3]; }\n    get end() { return this.buffer[this.index - 2]; }\n    get size() { return this.buffer[this.index - 1]; }\n    next() {\n        this.index -= 4;\n        this.pos -= 4;\n        if (this.index == 0)\n            this.maybeNext();\n    }\n    fork() {\n        return new StackBufferCursor(this.stack, this.pos, this.index);\n    }\n}\n\n// See lezer-generator/src/encode.ts for comments about the encoding\n// used here\nfunction decodeArray(input, Type = Uint16Array) {\n    if (typeof input != \"string\")\n        return input;\n    let array = null;\n    for (let pos = 0, out = 0; pos < input.length;) {\n        let value = 0;\n        for (;;) {\n            let next = input.charCodeAt(pos++), stop = false;\n            if (next == 126 /* Encode.BigValCode */) {\n                value = 65535 /* Encode.BigVal */;\n                break;\n            }\n            if (next >= 92 /* Encode.Gap2 */)\n                next--;\n            if (next >= 34 /* Encode.Gap1 */)\n                next--;\n            let digit = next - 32 /* Encode.Start */;\n            if (digit >= 46 /* Encode.Base */) {\n                digit -= 46 /* Encode.Base */;\n                stop = true;\n            }\n            value += digit;\n            if (stop)\n                break;\n            value *= 46 /* Encode.Base */;\n        }\n        if (array)\n            array[out++] = value;\n        else\n            array = new Type(value);\n    }\n    return array;\n}\n\nclass CachedToken {\n    constructor() {\n        this.start = -1;\n        this.value = -1;\n        this.end = -1;\n        this.extended = -1;\n        this.lookAhead = 0;\n        this.mask = 0;\n        this.context = 0;\n    }\n}\nconst nullToken = new CachedToken;\n/**\n[Tokenizers](#lr.ExternalTokenizer) interact with the input\nthrough this interface. It presents the input as a stream of\ncharacters, tracking lookahead and hiding the complexity of\n[ranges](#common.Parser.parse^ranges) from tokenizer code.\n*/\nclass InputStream {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    @internal\n    */\n    input, \n    /**\n    @internal\n    */\n    ranges) {\n        this.input = input;\n        this.ranges = ranges;\n        /**\n        @internal\n        */\n        this.chunk = \"\";\n        /**\n        @internal\n        */\n        this.chunkOff = 0;\n        /**\n        Backup chunk\n        */\n        this.chunk2 = \"\";\n        this.chunk2Pos = 0;\n        /**\n        The character code of the next code unit in the input, or -1\n        when the stream is at the end of the input.\n        */\n        this.next = -1;\n        /**\n        @internal\n        */\n        this.token = nullToken;\n        this.rangeIndex = 0;\n        this.pos = this.chunkPos = ranges[0].from;\n        this.range = ranges[0];\n        this.end = ranges[ranges.length - 1].to;\n        this.readNext();\n    }\n    /**\n    @internal\n    */\n    resolveOffset(offset, assoc) {\n        let range = this.range, index = this.rangeIndex;\n        let pos = this.pos + offset;\n        while (pos < range.from) {\n            if (!index)\n                return null;\n            let next = this.ranges[--index];\n            pos -= range.from - next.to;\n            range = next;\n        }\n        while (assoc < 0 ? pos > range.to : pos >= range.to) {\n            if (index == this.ranges.length - 1)\n                return null;\n            let next = this.ranges[++index];\n            pos += next.from - range.to;\n            range = next;\n        }\n        return pos;\n    }\n    /**\n    @internal\n    */\n    clipPos(pos) {\n        if (pos >= this.range.from && pos < this.range.to)\n            return pos;\n        for (let range of this.ranges)\n            if (range.to > pos)\n                return Math.max(pos, range.from);\n        return this.end;\n    }\n    /**\n    Look at a code unit near the stream position. `.peek(0)` equals\n    `.next`, `.peek(-1)` gives you the previous character, and so\n    on.\n    \n    Note that looking around during tokenizing creates dependencies\n    on potentially far-away content, which may reduce the\n    effectiveness incremental parsing—when looking forward—or even\n    cause invalid reparses when looking backward more than 25 code\n    units, since the library does not track lookbehind.\n    */\n    peek(offset) {\n        let idx = this.chunkOff + offset, pos, result;\n        if (idx >= 0 && idx < this.chunk.length) {\n            pos = this.pos + offset;\n            result = this.chunk.charCodeAt(idx);\n        }\n        else {\n            let resolved = this.resolveOffset(offset, 1);\n            if (resolved == null)\n                return -1;\n            pos = resolved;\n            if (pos >= this.chunk2Pos && pos < this.chunk2Pos + this.chunk2.length) {\n                result = this.chunk2.charCodeAt(pos - this.chunk2Pos);\n            }\n            else {\n                let i = this.rangeIndex, range = this.range;\n                while (range.to <= pos)\n                    range = this.ranges[++i];\n                this.chunk2 = this.input.chunk(this.chunk2Pos = pos);\n                if (pos + this.chunk2.length > range.to)\n                    this.chunk2 = this.chunk2.slice(0, range.to - pos);\n                result = this.chunk2.charCodeAt(0);\n            }\n        }\n        if (pos >= this.token.lookAhead)\n            this.token.lookAhead = pos + 1;\n        return result;\n    }\n    /**\n    Accept a token. By default, the end of the token is set to the\n    current stream position, but you can pass an offset (relative to\n    the stream position) to change that.\n    */\n    acceptToken(token, endOffset = 0) {\n        let end = endOffset ? this.resolveOffset(endOffset, -1) : this.pos;\n        if (end == null || end < this.token.start)\n            throw new RangeError(\"Token end out of bounds\");\n        this.token.value = token;\n        this.token.end = end;\n    }\n    /**\n    Accept a token ending at a specific given position.\n    */\n    acceptTokenTo(token, endPos) {\n        this.token.value = token;\n        this.token.end = endPos;\n    }\n    getChunk() {\n        if (this.pos >= this.chunk2Pos && this.pos < this.chunk2Pos + this.chunk2.length) {\n            let { chunk, chunkPos } = this;\n            this.chunk = this.chunk2;\n            this.chunkPos = this.chunk2Pos;\n            this.chunk2 = chunk;\n            this.chunk2Pos = chunkPos;\n            this.chunkOff = this.pos - this.chunkPos;\n        }\n        else {\n            this.chunk2 = this.chunk;\n            this.chunk2Pos = this.chunkPos;\n            let nextChunk = this.input.chunk(this.pos);\n            let end = this.pos + nextChunk.length;\n            this.chunk = end > this.range.to ? nextChunk.slice(0, this.range.to - this.pos) : nextChunk;\n            this.chunkPos = this.pos;\n            this.chunkOff = 0;\n        }\n    }\n    readNext() {\n        if (this.chunkOff >= this.chunk.length) {\n            this.getChunk();\n            if (this.chunkOff == this.chunk.length)\n                return this.next = -1;\n        }\n        return this.next = this.chunk.charCodeAt(this.chunkOff);\n    }\n    /**\n    Move the stream forward N (defaults to 1) code units. Returns\n    the new value of [`next`](#lr.InputStream.next).\n    */\n    advance(n = 1) {\n        this.chunkOff += n;\n        while (this.pos + n >= this.range.to) {\n            if (this.rangeIndex == this.ranges.length - 1)\n                return this.setDone();\n            n -= this.range.to - this.pos;\n            this.range = this.ranges[++this.rangeIndex];\n            this.pos = this.range.from;\n        }\n        this.pos += n;\n        if (this.pos >= this.token.lookAhead)\n            this.token.lookAhead = this.pos + 1;\n        return this.readNext();\n    }\n    setDone() {\n        this.pos = this.chunkPos = this.end;\n        this.range = this.ranges[this.rangeIndex = this.ranges.length - 1];\n        this.chunk = \"\";\n        return this.next = -1;\n    }\n    /**\n    @internal\n    */\n    reset(pos, token) {\n        if (token) {\n            this.token = token;\n            token.start = pos;\n            token.lookAhead = pos + 1;\n            token.value = token.extended = -1;\n        }\n        else {\n            this.token = nullToken;\n        }\n        if (this.pos != pos) {\n            this.pos = pos;\n            if (pos == this.end) {\n                this.setDone();\n                return this;\n            }\n            while (pos < this.range.from)\n                this.range = this.ranges[--this.rangeIndex];\n            while (pos >= this.range.to)\n                this.range = this.ranges[++this.rangeIndex];\n            if (pos >= this.chunkPos && pos < this.chunkPos + this.chunk.length) {\n                this.chunkOff = pos - this.chunkPos;\n            }\n            else {\n                this.chunk = \"\";\n                this.chunkOff = 0;\n            }\n            this.readNext();\n        }\n        return this;\n    }\n    /**\n    @internal\n    */\n    read(from, to) {\n        if (from >= this.chunkPos && to <= this.chunkPos + this.chunk.length)\n            return this.chunk.slice(from - this.chunkPos, to - this.chunkPos);\n        if (from >= this.chunk2Pos && to <= this.chunk2Pos + this.chunk2.length)\n            return this.chunk2.slice(from - this.chunk2Pos, to - this.chunk2Pos);\n        if (from >= this.range.from && to <= this.range.to)\n            return this.input.read(from, to);\n        let result = \"\";\n        for (let r of this.ranges) {\n            if (r.from >= to)\n                break;\n            if (r.to > from)\n                result += this.input.read(Math.max(r.from, from), Math.min(r.to, to));\n        }\n        return result;\n    }\n}\n/**\n@internal\n*/\nclass TokenGroup {\n    constructor(data, id) {\n        this.data = data;\n        this.id = id;\n    }\n    token(input, stack) {\n        let { parser } = stack.p;\n        readToken(this.data, input, stack, this.id, parser.data, parser.tokenPrecTable);\n    }\n}\nTokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false;\n/**\n@hide\n*/\nclass LocalTokenGroup {\n    constructor(data, precTable, elseToken) {\n        this.precTable = precTable;\n        this.elseToken = elseToken;\n        this.data = typeof data == \"string\" ? decodeArray(data) : data;\n    }\n    token(input, stack) {\n        let start = input.pos, skipped = 0;\n        for (;;) {\n            let atEof = input.next < 0, nextPos = input.resolveOffset(1, 1);\n            readToken(this.data, input, stack, 0, this.data, this.precTable);\n            if (input.token.value > -1)\n                break;\n            if (this.elseToken == null)\n                return;\n            if (!atEof)\n                skipped++;\n            if (nextPos == null)\n                break;\n            input.reset(nextPos, input.token);\n        }\n        if (skipped) {\n            input.reset(start, input.token);\n            input.acceptToken(this.elseToken, skipped);\n        }\n    }\n}\nLocalTokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false;\n/**\n`@external tokens` declarations in the grammar should resolve to\nan instance of this class.\n*/\nclass ExternalTokenizer {\n    /**\n    Create a tokenizer. The first argument is the function that,\n    given an input stream, scans for the types of tokens it\n    recognizes at the stream's position, and calls\n    [`acceptToken`](#lr.InputStream.acceptToken) when it finds\n    one.\n    */\n    constructor(\n    /**\n    @internal\n    */\n    token, options = {}) {\n        this.token = token;\n        this.contextual = !!options.contextual;\n        this.fallback = !!options.fallback;\n        this.extend = !!options.extend;\n    }\n}\n// Tokenizer data is stored a big uint16 array containing, for each\n// state:\n//\n//  - A group bitmask, indicating what token groups are reachable from\n//    this state, so that paths that can only lead to tokens not in\n//    any of the current groups can be cut off early.\n//\n//  - The position of the end of the state's sequence of accepting\n//    tokens\n//\n//  - The number of outgoing edges for the state\n//\n//  - The accepting tokens, as (token id, group mask) pairs\n//\n//  - The outgoing edges, as (start character, end character, state\n//    index) triples, with end character being exclusive\n//\n// This function interprets that data, running through a stream as\n// long as new states with the a matching group mask can be reached,\n// and updating `input.token` when it matches a token.\nfunction readToken(data, input, stack, group, precTable, precOffset) {\n    let state = 0, groupMask = 1 << group, { dialect } = stack.p.parser;\n    scan: for (;;) {\n        if ((groupMask & data[state]) == 0)\n            break;\n        let accEnd = data[state + 1];\n        // Check whether this state can lead to a token in the current group\n        // Accept tokens in this state, possibly overwriting\n        // lower-precedence / shorter tokens\n        for (let i = state + 3; i < accEnd; i += 2)\n            if ((data[i + 1] & groupMask) > 0) {\n                let term = data[i];\n                if (dialect.allows(term) &&\n                    (input.token.value == -1 || input.token.value == term ||\n                        overrides(term, input.token.value, precTable, precOffset))) {\n                    input.acceptToken(term);\n                    break;\n                }\n            }\n        let next = input.next, low = 0, high = data[state + 2];\n        // Special case for EOF\n        if (input.next < 0 && high > low && data[accEnd + high * 3 - 3] == 65535 /* Seq.End */) {\n            state = data[accEnd + high * 3 - 1];\n            continue scan;\n        }\n        // Do a binary search on the state's edges\n        for (; low < high;) {\n            let mid = (low + high) >> 1;\n            let index = accEnd + mid + (mid << 1);\n            let from = data[index], to = data[index + 1] || 0x10000;\n            if (next < from)\n                high = mid;\n            else if (next >= to)\n                low = mid + 1;\n            else {\n                state = data[index + 2];\n                input.advance();\n                continue scan;\n            }\n        }\n        break;\n    }\n}\nfunction findOffset(data, start, term) {\n    for (let i = start, next; (next = data[i]) != 65535 /* Seq.End */; i++)\n        if (next == term)\n            return i - start;\n    return -1;\n}\nfunction overrides(token, prev, tableData, tableOffset) {\n    let iPrev = findOffset(tableData, tableOffset, prev);\n    return iPrev < 0 || findOffset(tableData, tableOffset, token) < iPrev;\n}\n\n// Environment variable used to control console output\nconst verbose = typeof process != \"undefined\" && process.env && /\\bparse\\b/.test(process.env.LOG);\nlet stackIDs = null;\nfunction cutAt(tree, pos, side) {\n    let cursor = tree.cursor(IterMode.IncludeAnonymous);\n    cursor.moveTo(pos);\n    for (;;) {\n        if (!(side < 0 ? cursor.childBefore(pos) : cursor.childAfter(pos)))\n            for (;;) {\n                if ((side < 0 ? cursor.to < pos : cursor.from > pos) && !cursor.type.isError)\n                    return side < 0 ? Math.max(0, Math.min(cursor.to - 1, pos - 25 /* Lookahead.Margin */))\n                        : Math.min(tree.length, Math.max(cursor.from + 1, pos + 25 /* Lookahead.Margin */));\n                if (side < 0 ? cursor.prevSibling() : cursor.nextSibling())\n                    break;\n                if (!cursor.parent())\n                    return side < 0 ? 0 : tree.length;\n            }\n    }\n}\nclass FragmentCursor {\n    constructor(fragments, nodeSet) {\n        this.fragments = fragments;\n        this.nodeSet = nodeSet;\n        this.i = 0;\n        this.fragment = null;\n        this.safeFrom = -1;\n        this.safeTo = -1;\n        this.trees = [];\n        this.start = [];\n        this.index = [];\n        this.nextFragment();\n    }\n    nextFragment() {\n        let fr = this.fragment = this.i == this.fragments.length ? null : this.fragments[this.i++];\n        if (fr) {\n            this.safeFrom = fr.openStart ? cutAt(fr.tree, fr.from + fr.offset, 1) - fr.offset : fr.from;\n            this.safeTo = fr.openEnd ? cutAt(fr.tree, fr.to + fr.offset, -1) - fr.offset : fr.to;\n            while (this.trees.length) {\n                this.trees.pop();\n                this.start.pop();\n                this.index.pop();\n            }\n            this.trees.push(fr.tree);\n            this.start.push(-fr.offset);\n            this.index.push(0);\n            this.nextStart = this.safeFrom;\n        }\n        else {\n            this.nextStart = 1e9;\n        }\n    }\n    // `pos` must be >= any previously given `pos` for this cursor\n    nodeAt(pos) {\n        if (pos < this.nextStart)\n            return null;\n        while (this.fragment && this.safeTo <= pos)\n            this.nextFragment();\n        if (!this.fragment)\n            return null;\n        for (;;) {\n            let last = this.trees.length - 1;\n            if (last < 0) { // End of tree\n                this.nextFragment();\n                return null;\n            }\n            let top = this.trees[last], index = this.index[last];\n            if (index == top.children.length) {\n                this.trees.pop();\n                this.start.pop();\n                this.index.pop();\n                continue;\n            }\n            let next = top.children[index];\n            let start = this.start[last] + top.positions[index];\n            if (start > pos) {\n                this.nextStart = start;\n                return null;\n            }\n            if (next instanceof Tree) {\n                if (start == pos) {\n                    if (start < this.safeFrom)\n                        return null;\n                    let end = start + next.length;\n                    if (end <= this.safeTo) {\n                        let lookAhead = next.prop(NodeProp.lookAhead);\n                        if (!lookAhead || end + lookAhead < this.fragment.to)\n                            return next;\n                    }\n                }\n                this.index[last]++;\n                if (start + next.length >= Math.max(this.safeFrom, pos)) { // Enter this node\n                    this.trees.push(next);\n                    this.start.push(start);\n                    this.index.push(0);\n                }\n            }\n            else {\n                this.index[last]++;\n                this.nextStart = start + next.length;\n            }\n        }\n    }\n}\nclass TokenCache {\n    constructor(parser, stream) {\n        this.stream = stream;\n        this.tokens = [];\n        this.mainToken = null;\n        this.actions = [];\n        this.tokens = parser.tokenizers.map(_ => new CachedToken);\n    }\n    getActions(stack) {\n        let actionIndex = 0;\n        let main = null;\n        let { parser } = stack.p, { tokenizers } = parser;\n        let mask = parser.stateSlot(stack.state, 3 /* ParseState.TokenizerMask */);\n        let context = stack.curContext ? stack.curContext.hash : 0;\n        let lookAhead = 0;\n        for (let i = 0; i < tokenizers.length; i++) {\n            if (((1 << i) & mask) == 0)\n                continue;\n            let tokenizer = tokenizers[i], token = this.tokens[i];\n            if (main && !tokenizer.fallback)\n                continue;\n            if (tokenizer.contextual || token.start != stack.pos || token.mask != mask || token.context != context) {\n                this.updateCachedToken(token, tokenizer, stack);\n                token.mask = mask;\n                token.context = context;\n            }\n            if (token.lookAhead > token.end + 25 /* Lookahead.Margin */)\n                lookAhead = Math.max(token.lookAhead, lookAhead);\n            if (token.value != 0 /* Term.Err */) {\n                let startIndex = actionIndex;\n                if (token.extended > -1)\n                    actionIndex = this.addActions(stack, token.extended, token.end, actionIndex);\n                actionIndex = this.addActions(stack, token.value, token.end, actionIndex);\n                if (!tokenizer.extend) {\n                    main = token;\n                    if (actionIndex > startIndex)\n                        break;\n                }\n            }\n        }\n        while (this.actions.length > actionIndex)\n            this.actions.pop();\n        if (lookAhead)\n            stack.setLookAhead(lookAhead);\n        if (!main && stack.pos == this.stream.end) {\n            main = new CachedToken;\n            main.value = stack.p.parser.eofTerm;\n            main.start = main.end = stack.pos;\n            actionIndex = this.addActions(stack, main.value, main.end, actionIndex);\n        }\n        this.mainToken = main;\n        return this.actions;\n    }\n    getMainToken(stack) {\n        if (this.mainToken)\n            return this.mainToken;\n        let main = new CachedToken, { pos, p } = stack;\n        main.start = pos;\n        main.end = Math.min(pos + 1, p.stream.end);\n        main.value = pos == p.stream.end ? p.parser.eofTerm : 0 /* Term.Err */;\n        return main;\n    }\n    updateCachedToken(token, tokenizer, stack) {\n        let start = this.stream.clipPos(stack.pos);\n        tokenizer.token(this.stream.reset(start, token), stack);\n        if (token.value > -1) {\n            let { parser } = stack.p;\n            for (let i = 0; i < parser.specialized.length; i++)\n                if (parser.specialized[i] == token.value) {\n                    let result = parser.specializers[i](this.stream.read(token.start, token.end), stack);\n                    if (result >= 0 && stack.p.parser.dialect.allows(result >> 1)) {\n                        if ((result & 1) == 0 /* Specialize.Specialize */)\n                            token.value = result >> 1;\n                        else\n                            token.extended = result >> 1;\n                        break;\n                    }\n                }\n        }\n        else {\n            token.value = 0 /* Term.Err */;\n            token.end = this.stream.clipPos(start + 1);\n        }\n    }\n    putAction(action, token, end, index) {\n        // Don't add duplicate actions\n        for (let i = 0; i < index; i += 3)\n            if (this.actions[i] == action)\n                return index;\n        this.actions[index++] = action;\n        this.actions[index++] = token;\n        this.actions[index++] = end;\n        return index;\n    }\n    addActions(stack, token, end, index) {\n        let { state } = stack, { parser } = stack.p, { data } = parser;\n        for (let set = 0; set < 2; set++) {\n            for (let i = parser.stateSlot(state, set ? 2 /* ParseState.Skip */ : 1 /* ParseState.Actions */);; i += 3) {\n                if (data[i] == 65535 /* Seq.End */) {\n                    if (data[i + 1] == 1 /* Seq.Next */) {\n                        i = pair(data, i + 2);\n                    }\n                    else {\n                        if (index == 0 && data[i + 1] == 2 /* Seq.Other */)\n                            index = this.putAction(pair(data, i + 2), token, end, index);\n                        break;\n                    }\n                }\n                if (data[i] == token)\n                    index = this.putAction(pair(data, i + 1), token, end, index);\n            }\n        }\n        return index;\n    }\n}\nclass Parse {\n    constructor(parser, input, fragments, ranges) {\n        this.parser = parser;\n        this.input = input;\n        this.ranges = ranges;\n        this.recovering = 0;\n        this.nextStackID = 0x2654; // ♔, ♕, ♖, ♗, ♘, ♙, ♠, ♡, ♢, ♣, ♤, ♥, ♦, ♧\n        this.minStackPos = 0;\n        this.reused = [];\n        this.stoppedAt = null;\n        this.lastBigReductionStart = -1;\n        this.lastBigReductionSize = 0;\n        this.bigReductionCount = 0;\n        this.stream = new InputStream(input, ranges);\n        this.tokens = new TokenCache(parser, this.stream);\n        this.topTerm = parser.top[1];\n        let { from } = ranges[0];\n        this.stacks = [Stack.start(this, parser.top[0], from)];\n        this.fragments = fragments.length && this.stream.end - from > parser.bufferLength * 4\n            ? new FragmentCursor(fragments, parser.nodeSet) : null;\n    }\n    get parsedPos() {\n        return this.minStackPos;\n    }\n    // Move the parser forward. This will process all parse stacks at\n    // `this.pos` and try to advance them to a further position. If no\n    // stack for such a position is found, it'll start error-recovery.\n    //\n    // When the parse is finished, this will return a syntax tree. When\n    // not, it returns `null`.\n    advance() {\n        let stacks = this.stacks, pos = this.minStackPos;\n        // This will hold stacks beyond `pos`.\n        let newStacks = this.stacks = [];\n        let stopped, stoppedTokens;\n        // If a large amount of reductions happened with the same start\n        // position, force the stack out of that production in order to\n        // avoid creating a tree too deep to recurse through.\n        // (This is an ugly kludge, because unfortunately there is no\n        // straightforward, cheap way to check for this happening, due to\n        // the history of reductions only being available in an\n        // expensive-to-access format in the stack buffers.)\n        if (this.bigReductionCount > 300 /* Rec.MaxLeftAssociativeReductionCount */ && stacks.length == 1) {\n            let [s] = stacks;\n            while (s.forceReduce() && s.stack.length && s.stack[s.stack.length - 2] >= this.lastBigReductionStart) { }\n            this.bigReductionCount = this.lastBigReductionSize = 0;\n        }\n        // Keep advancing any stacks at `pos` until they either move\n        // forward or can't be advanced. Gather stacks that can't be\n        // advanced further in `stopped`.\n        for (let i = 0; i < stacks.length; i++) {\n            let stack = stacks[i];\n            for (;;) {\n                this.tokens.mainToken = null;\n                if (stack.pos > pos) {\n                    newStacks.push(stack);\n                }\n                else if (this.advanceStack(stack, newStacks, stacks)) {\n                    continue;\n                }\n                else {\n                    if (!stopped) {\n                        stopped = [];\n                        stoppedTokens = [];\n                    }\n                    stopped.push(stack);\n                    let tok = this.tokens.getMainToken(stack);\n                    stoppedTokens.push(tok.value, tok.end);\n                }\n                break;\n            }\n        }\n        if (!newStacks.length) {\n            let finished = stopped && findFinished(stopped);\n            if (finished) {\n                if (verbose)\n                    console.log(\"Finish with \" + this.stackID(finished));\n                return this.stackToTree(finished);\n            }\n            if (this.parser.strict) {\n                if (verbose && stopped)\n                    console.log(\"Stuck with token \" + (this.tokens.mainToken ? this.parser.getName(this.tokens.mainToken.value) : \"none\"));\n                throw new SyntaxError(\"No parse at \" + pos);\n            }\n            if (!this.recovering)\n                this.recovering = 5 /* Rec.Distance */;\n        }\n        if (this.recovering && stopped) {\n            let finished = this.stoppedAt != null && stopped[0].pos > this.stoppedAt ? stopped[0]\n                : this.runRecovery(stopped, stoppedTokens, newStacks);\n            if (finished) {\n                if (verbose)\n                    console.log(\"Force-finish \" + this.stackID(finished));\n                return this.stackToTree(finished.forceAll());\n            }\n        }\n        if (this.recovering) {\n            let maxRemaining = this.recovering == 1 ? 1 : this.recovering * 3 /* Rec.MaxRemainingPerStep */;\n            if (newStacks.length > maxRemaining) {\n                newStacks.sort((a, b) => b.score - a.score);\n                while (newStacks.length > maxRemaining)\n                    newStacks.pop();\n            }\n            if (newStacks.some(s => s.reducePos > pos))\n                this.recovering--;\n        }\n        else if (newStacks.length > 1) {\n            // Prune stacks that are in the same state, or that have been\n            // running without splitting for a while, to avoid getting stuck\n            // with multiple successful stacks running endlessly on.\n            outer: for (let i = 0; i < newStacks.length - 1; i++) {\n                let stack = newStacks[i];\n                for (let j = i + 1; j < newStacks.length; j++) {\n                    let other = newStacks[j];\n                    if (stack.sameState(other) ||\n                        stack.buffer.length > 500 /* Rec.MinBufferLengthPrune */ && other.buffer.length > 500 /* Rec.MinBufferLengthPrune */) {\n                        if (((stack.score - other.score) || (stack.buffer.length - other.buffer.length)) > 0) {\n                            newStacks.splice(j--, 1);\n                        }\n                        else {\n                            newStacks.splice(i--, 1);\n                            continue outer;\n                        }\n                    }\n                }\n            }\n            if (newStacks.length > 12 /* Rec.MaxStackCount */)\n                newStacks.splice(12 /* Rec.MaxStackCount */, newStacks.length - 12 /* Rec.MaxStackCount */);\n        }\n        this.minStackPos = newStacks[0].pos;\n        for (let i = 1; i < newStacks.length; i++)\n            if (newStacks[i].pos < this.minStackPos)\n                this.minStackPos = newStacks[i].pos;\n        return null;\n    }\n    stopAt(pos) {\n        if (this.stoppedAt != null && this.stoppedAt < pos)\n            throw new RangeError(\"Can't move stoppedAt forward\");\n        this.stoppedAt = pos;\n    }\n    // Returns an updated version of the given stack, or null if the\n    // stack can't advance normally. When `split` and `stacks` are\n    // given, stacks split off by ambiguous operations will be pushed to\n    // `split`, or added to `stacks` if they move `pos` forward.\n    advanceStack(stack, stacks, split) {\n        let start = stack.pos, { parser } = this;\n        let base = verbose ? this.stackID(stack) + \" -> \" : \"\";\n        if (this.stoppedAt != null && start > this.stoppedAt)\n            return stack.forceReduce() ? stack : null;\n        if (this.fragments) {\n            let strictCx = stack.curContext && stack.curContext.tracker.strict, cxHash = strictCx ? stack.curContext.hash : 0;\n            for (let cached = this.fragments.nodeAt(start); cached;) {\n                let match = this.parser.nodeSet.types[cached.type.id] == cached.type ? parser.getGoto(stack.state, cached.type.id) : -1;\n                if (match > -1 && cached.length && (!strictCx || (cached.prop(NodeProp.contextHash) || 0) == cxHash)) {\n                    stack.useNode(cached, match);\n                    if (verbose)\n                        console.log(base + this.stackID(stack) + ` (via reuse of ${parser.getName(cached.type.id)})`);\n                    return true;\n                }\n                if (!(cached instanceof Tree) || cached.children.length == 0 || cached.positions[0] > 0)\n                    break;\n                let inner = cached.children[0];\n                if (inner instanceof Tree && cached.positions[0] == 0)\n                    cached = inner;\n                else\n                    break;\n            }\n        }\n        let defaultReduce = parser.stateSlot(stack.state, 4 /* ParseState.DefaultReduce */);\n        if (defaultReduce > 0) {\n            stack.reduce(defaultReduce);\n            if (verbose)\n                console.log(base + this.stackID(stack) + ` (via always-reduce ${parser.getName(defaultReduce & 65535 /* Action.ValueMask */)})`);\n            return true;\n        }\n        if (stack.stack.length >= 8400 /* Rec.CutDepth */) {\n            while (stack.stack.length > 6000 /* Rec.CutTo */ && stack.forceReduce()) { }\n        }\n        let actions = this.tokens.getActions(stack);\n        for (let i = 0; i < actions.length;) {\n            let action = actions[i++], term = actions[i++], end = actions[i++];\n            let last = i == actions.length || !split;\n            let localStack = last ? stack : stack.split();\n            let main = this.tokens.mainToken;\n            localStack.apply(action, term, main ? main.start : localStack.pos, end);\n            if (verbose)\n                console.log(base + this.stackID(localStack) + ` (via ${(action & 65536 /* Action.ReduceFlag */) == 0 ? \"shift\"\n                    : `reduce of ${parser.getName(action & 65535 /* Action.ValueMask */)}`} for ${parser.getName(term)} @ ${start}${localStack == stack ? \"\" : \", split\"})`);\n            if (last)\n                return true;\n            else if (localStack.pos > start)\n                stacks.push(localStack);\n            else\n                split.push(localStack);\n        }\n        return false;\n    }\n    // Advance a given stack forward as far as it will go. Returns the\n    // (possibly updated) stack if it got stuck, or null if it moved\n    // forward and was given to `pushStackDedup`.\n    advanceFully(stack, newStacks) {\n        let pos = stack.pos;\n        for (;;) {\n            if (!this.advanceStack(stack, null, null))\n                return false;\n            if (stack.pos > pos) {\n                pushStackDedup(stack, newStacks);\n                return true;\n            }\n        }\n    }\n    runRecovery(stacks, tokens, newStacks) {\n        let finished = null, restarted = false;\n        for (let i = 0; i < stacks.length; i++) {\n            let stack = stacks[i], token = tokens[i << 1], tokenEnd = tokens[(i << 1) + 1];\n            let base = verbose ? this.stackID(stack) + \" -> \" : \"\";\n            if (stack.deadEnd) {\n                if (restarted)\n                    continue;\n                restarted = true;\n                stack.restart();\n                if (verbose)\n                    console.log(base + this.stackID(stack) + \" (restarted)\");\n                let done = this.advanceFully(stack, newStacks);\n                if (done)\n                    continue;\n            }\n            let force = stack.split(), forceBase = base;\n            for (let j = 0; force.forceReduce() && j < 10 /* Rec.ForceReduceLimit */; j++) {\n                if (verbose)\n                    console.log(forceBase + this.stackID(force) + \" (via force-reduce)\");\n                let done = this.advanceFully(force, newStacks);\n                if (done)\n                    break;\n                if (verbose)\n                    forceBase = this.stackID(force) + \" -> \";\n            }\n            for (let insert of stack.recoverByInsert(token)) {\n                if (verbose)\n                    console.log(base + this.stackID(insert) + \" (via recover-insert)\");\n                this.advanceFully(insert, newStacks);\n            }\n            if (this.stream.end > stack.pos) {\n                if (tokenEnd == stack.pos) {\n                    tokenEnd++;\n                    token = 0 /* Term.Err */;\n                }\n                stack.recoverByDelete(token, tokenEnd);\n                if (verbose)\n                    console.log(base + this.stackID(stack) + ` (via recover-delete ${this.parser.getName(token)})`);\n                pushStackDedup(stack, newStacks);\n            }\n            else if (!finished || finished.score < stack.score) {\n                finished = stack;\n            }\n        }\n        return finished;\n    }\n    // Convert the stack's buffer to a syntax tree.\n    stackToTree(stack) {\n        stack.close();\n        return Tree.build({ buffer: StackBufferCursor.create(stack),\n            nodeSet: this.parser.nodeSet,\n            topID: this.topTerm,\n            maxBufferLength: this.parser.bufferLength,\n            reused: this.reused,\n            start: this.ranges[0].from,\n            length: stack.pos - this.ranges[0].from,\n            minRepeatType: this.parser.minRepeatTerm });\n    }\n    stackID(stack) {\n        let id = (stackIDs || (stackIDs = new WeakMap)).get(stack);\n        if (!id)\n            stackIDs.set(stack, id = String.fromCodePoint(this.nextStackID++));\n        return id + stack;\n    }\n}\nfunction pushStackDedup(stack, newStacks) {\n    for (let i = 0; i < newStacks.length; i++) {\n        let other = newStacks[i];\n        if (other.pos == stack.pos && other.sameState(stack)) {\n            if (newStacks[i].score < stack.score)\n                newStacks[i] = stack;\n            return;\n        }\n    }\n    newStacks.push(stack);\n}\nclass Dialect {\n    constructor(source, flags, disabled) {\n        this.source = source;\n        this.flags = flags;\n        this.disabled = disabled;\n    }\n    allows(term) { return !this.disabled || this.disabled[term] == 0; }\n}\nconst id = x => x;\n/**\nContext trackers are used to track stateful context (such as\nindentation in the Python grammar, or parent elements in the XML\ngrammar) needed by external tokenizers. You declare them in a\ngrammar file as `@context exportName from \"module\"`.\n\nContext values should be immutable, and can be updated (replaced)\non shift or reduce actions.\n\nThe export used in a `@context` declaration should be of this\ntype.\n*/\nclass ContextTracker {\n    /**\n    Define a context tracker.\n    */\n    constructor(spec) {\n        this.start = spec.start;\n        this.shift = spec.shift || id;\n        this.reduce = spec.reduce || id;\n        this.reuse = spec.reuse || id;\n        this.hash = spec.hash || (() => 0);\n        this.strict = spec.strict !== false;\n    }\n}\n/**\nHolds the parse tables for a given grammar, as generated by\n`lezer-generator`, and provides [methods](#common.Parser) to parse\ncontent with.\n*/\nclass LRParser extends Parser {\n    /**\n    @internal\n    */\n    constructor(spec) {\n        super();\n        /**\n        @internal\n        */\n        this.wrappers = [];\n        if (spec.version != 14 /* File.Version */)\n            throw new RangeError(`Parser version (${spec.version}) doesn't match runtime version (${14 /* File.Version */})`);\n        let nodeNames = spec.nodeNames.split(\" \");\n        this.minRepeatTerm = nodeNames.length;\n        for (let i = 0; i < spec.repeatNodeCount; i++)\n            nodeNames.push(\"\");\n        let topTerms = Object.keys(spec.topRules).map(r => spec.topRules[r][1]);\n        let nodeProps = [];\n        for (let i = 0; i < nodeNames.length; i++)\n            nodeProps.push([]);\n        function setProp(nodeID, prop, value) {\n            nodeProps[nodeID].push([prop, prop.deserialize(String(value))]);\n        }\n        if (spec.nodeProps)\n            for (let propSpec of spec.nodeProps) {\n                let prop = propSpec[0];\n                if (typeof prop == \"string\")\n                    prop = NodeProp[prop];\n                for (let i = 1; i < propSpec.length;) {\n                    let next = propSpec[i++];\n                    if (next >= 0) {\n                        setProp(next, prop, propSpec[i++]);\n                    }\n                    else {\n                        let value = propSpec[i + -next];\n                        for (let j = -next; j > 0; j--)\n                            setProp(propSpec[i++], prop, value);\n                        i++;\n                    }\n                }\n            }\n        this.nodeSet = new NodeSet(nodeNames.map((name, i) => NodeType.define({\n            name: i >= this.minRepeatTerm ? undefined : name,\n            id: i,\n            props: nodeProps[i],\n            top: topTerms.indexOf(i) > -1,\n            error: i == 0,\n            skipped: spec.skippedNodes && spec.skippedNodes.indexOf(i) > -1\n        })));\n        if (spec.propSources)\n            this.nodeSet = this.nodeSet.extend(...spec.propSources);\n        this.strict = false;\n        this.bufferLength = DefaultBufferLength;\n        let tokenArray = decodeArray(spec.tokenData);\n        this.context = spec.context;\n        this.specializerSpecs = spec.specialized || [];\n        this.specialized = new Uint16Array(this.specializerSpecs.length);\n        for (let i = 0; i < this.specializerSpecs.length; i++)\n            this.specialized[i] = this.specializerSpecs[i].term;\n        this.specializers = this.specializerSpecs.map(getSpecializer);\n        this.states = decodeArray(spec.states, Uint32Array);\n        this.data = decodeArray(spec.stateData);\n        this.goto = decodeArray(spec.goto);\n        this.maxTerm = spec.maxTerm;\n        this.tokenizers = spec.tokenizers.map(value => typeof value == \"number\" ? new TokenGroup(tokenArray, value) : value);\n        this.topRules = spec.topRules;\n        this.dialects = spec.dialects || {};\n        this.dynamicPrecedences = spec.dynamicPrecedences || null;\n        this.tokenPrecTable = spec.tokenPrec;\n        this.termNames = spec.termNames || null;\n        this.maxNode = this.nodeSet.types.length - 1;\n        this.dialect = this.parseDialect();\n        this.top = this.topRules[Object.keys(this.topRules)[0]];\n    }\n    createParse(input, fragments, ranges) {\n        let parse = new Parse(this, input, fragments, ranges);\n        for (let w of this.wrappers)\n            parse = w(parse, input, fragments, ranges);\n        return parse;\n    }\n    /**\n    Get a goto table entry @internal\n    */\n    getGoto(state, term, loose = false) {\n        let table = this.goto;\n        if (term >= table[0])\n            return -1;\n        for (let pos = table[term + 1];;) {\n            let groupTag = table[pos++], last = groupTag & 1;\n            let target = table[pos++];\n            if (last && loose)\n                return target;\n            for (let end = pos + (groupTag >> 1); pos < end; pos++)\n                if (table[pos] == state)\n                    return target;\n            if (last)\n                return -1;\n        }\n    }\n    /**\n    Check if this state has an action for a given terminal @internal\n    */\n    hasAction(state, terminal) {\n        let data = this.data;\n        for (let set = 0; set < 2; set++) {\n            for (let i = this.stateSlot(state, set ? 2 /* ParseState.Skip */ : 1 /* ParseState.Actions */), next;; i += 3) {\n                if ((next = data[i]) == 65535 /* Seq.End */) {\n                    if (data[i + 1] == 1 /* Seq.Next */)\n                        next = data[i = pair(data, i + 2)];\n                    else if (data[i + 1] == 2 /* Seq.Other */)\n                        return pair(data, i + 2);\n                    else\n                        break;\n                }\n                if (next == terminal || next == 0 /* Term.Err */)\n                    return pair(data, i + 1);\n            }\n        }\n        return 0;\n    }\n    /**\n    @internal\n    */\n    stateSlot(state, slot) {\n        return this.states[(state * 6 /* ParseState.Size */) + slot];\n    }\n    /**\n    @internal\n    */\n    stateFlag(state, flag) {\n        return (this.stateSlot(state, 0 /* ParseState.Flags */) & flag) > 0;\n    }\n    /**\n    @internal\n    */\n    validAction(state, action) {\n        return !!this.allActions(state, a => a == action ? true : null);\n    }\n    /**\n    @internal\n    */\n    allActions(state, action) {\n        let deflt = this.stateSlot(state, 4 /* ParseState.DefaultReduce */);\n        let result = deflt ? action(deflt) : undefined;\n        for (let i = this.stateSlot(state, 1 /* ParseState.Actions */); result == null; i += 3) {\n            if (this.data[i] == 65535 /* Seq.End */) {\n                if (this.data[i + 1] == 1 /* Seq.Next */)\n                    i = pair(this.data, i + 2);\n                else\n                    break;\n            }\n            result = action(pair(this.data, i + 1));\n        }\n        return result;\n    }\n    /**\n    Get the states that can follow this one through shift actions or\n    goto jumps. @internal\n    */\n    nextStates(state) {\n        let result = [];\n        for (let i = this.stateSlot(state, 1 /* ParseState.Actions */);; i += 3) {\n            if (this.data[i] == 65535 /* Seq.End */) {\n                if (this.data[i + 1] == 1 /* Seq.Next */)\n                    i = pair(this.data, i + 2);\n                else\n                    break;\n            }\n            if ((this.data[i + 2] & (65536 /* Action.ReduceFlag */ >> 16)) == 0) {\n                let value = this.data[i + 1];\n                if (!result.some((v, i) => (i & 1) && v == value))\n                    result.push(this.data[i], value);\n            }\n        }\n        return result;\n    }\n    /**\n    Configure the parser. Returns a new parser instance that has the\n    given settings modified. Settings not provided in `config` are\n    kept from the original parser.\n    */\n    configure(config) {\n        // Hideous reflection-based kludge to make it easy to create a\n        // slightly modified copy of a parser.\n        let copy = Object.assign(Object.create(LRParser.prototype), this);\n        if (config.props)\n            copy.nodeSet = this.nodeSet.extend(...config.props);\n        if (config.top) {\n            let info = this.topRules[config.top];\n            if (!info)\n                throw new RangeError(`Invalid top rule name ${config.top}`);\n            copy.top = info;\n        }\n        if (config.tokenizers)\n            copy.tokenizers = this.tokenizers.map(t => {\n                let found = config.tokenizers.find(r => r.from == t);\n                return found ? found.to : t;\n            });\n        if (config.specializers) {\n            copy.specializers = this.specializers.slice();\n            copy.specializerSpecs = this.specializerSpecs.map((s, i) => {\n                let found = config.specializers.find(r => r.from == s.external);\n                if (!found)\n                    return s;\n                let spec = Object.assign(Object.assign({}, s), { external: found.to });\n                copy.specializers[i] = getSpecializer(spec);\n                return spec;\n            });\n        }\n        if (config.contextTracker)\n            copy.context = config.contextTracker;\n        if (config.dialect)\n            copy.dialect = this.parseDialect(config.dialect);\n        if (config.strict != null)\n            copy.strict = config.strict;\n        if (config.wrap)\n            copy.wrappers = copy.wrappers.concat(config.wrap);\n        if (config.bufferLength != null)\n            copy.bufferLength = config.bufferLength;\n        return copy;\n    }\n    /**\n    Tells you whether any [parse wrappers](#lr.ParserConfig.wrap)\n    are registered for this parser.\n    */\n    hasWrappers() {\n        return this.wrappers.length > 0;\n    }\n    /**\n    Returns the name associated with a given term. This will only\n    work for all terms when the parser was generated with the\n    `--names` option. By default, only the names of tagged terms are\n    stored.\n    */\n    getName(term) {\n        return this.termNames ? this.termNames[term] : String(term <= this.maxNode && this.nodeSet.types[term].name || term);\n    }\n    /**\n    The eof term id is always allocated directly after the node\n    types. @internal\n    */\n    get eofTerm() { return this.maxNode + 1; }\n    /**\n    The type of top node produced by the parser.\n    */\n    get topNode() { return this.nodeSet.types[this.top[1]]; }\n    /**\n    @internal\n    */\n    dynamicPrecedence(term) {\n        let prec = this.dynamicPrecedences;\n        return prec == null ? 0 : prec[term] || 0;\n    }\n    /**\n    @internal\n    */\n    parseDialect(dialect) {\n        let values = Object.keys(this.dialects), flags = values.map(() => false);\n        if (dialect)\n            for (let part of dialect.split(\" \")) {\n                let id = values.indexOf(part);\n                if (id >= 0)\n                    flags[id] = true;\n            }\n        let disabled = null;\n        for (let i = 0; i < values.length; i++)\n            if (!flags[i]) {\n                for (let j = this.dialects[values[i]], id; (id = this.data[j++]) != 65535 /* Seq.End */;)\n                    (disabled || (disabled = new Uint8Array(this.maxTerm + 1)))[id] = 1;\n            }\n        return new Dialect(dialect, flags, disabled);\n    }\n    /**\n    Used by the output of the parser generator. Not available to\n    user code. @hide\n    */\n    static deserialize(spec) {\n        return new LRParser(spec);\n    }\n}\nfunction pair(data, off) { return data[off] | (data[off + 1] << 16); }\nfunction findFinished(stacks) {\n    let best = null;\n    for (let stack of stacks) {\n        let stopped = stack.p.stoppedAt;\n        if ((stack.pos == stack.p.stream.end || stopped != null && stack.pos > stopped) &&\n            stack.p.parser.stateFlag(stack.state, 2 /* StateFlag.Accepting */) &&\n            (!best || best.score < stack.score))\n            best = stack;\n    }\n    return best;\n}\nfunction getSpecializer(spec) {\n    if (spec.external) {\n        let mask = spec.extend ? 1 /* Specialize.Extend */ : 0 /* Specialize.Specialize */;\n        return (value, stack) => (spec.external(value, stack) << 1) | mask;\n    }\n    return spec.get;\n}\n\nexport { ContextTracker, ExternalTokenizer, InputStream, LRParser, LocalTokenGroup, Stack };\n","import { LRParser } from '@lezer/lr';\n\n// This file was generated by lezer-generator. You probably shouldn't edit it.\nconst Json$1 = 1,\n  Logfmt$1 = 2,\n  Unpack$1 = 3,\n  Pattern$1 = 4,\n  Regexp$1 = 5,\n  Unwrap$1 = 6,\n  LabelFormat$1 = 7,\n  LineFormat$1 = 8,\n  LabelReplace$1 = 9,\n  Vector$1 = 10,\n  Offset$1 = 11,\n  Bool$1 = 12,\n  On$1 = 13,\n  Ignoring$1 = 14,\n  GroupLeft$1 = 15,\n  GroupRight$1 = 16,\n  Decolorize$1 = 17,\n  Drop$1 = 18,\n  Keep$1 = 19,\n  By$1 = 20,\n  Without$1 = 21,\n  And$1 = 22,\n  Or$1 = 23,\n  Unless$1 = 24,\n  Sum$1 = 25,\n  Avg$1 = 26,\n  Count$1 = 27,\n  Max$1 = 28,\n  Min$1 = 29,\n  Stddev$1 = 30,\n  Stdvar$1 = 31,\n  Bottomk$1 = 32,\n  Topk$1 = 33,\n  Sort$1 = 34,\n  Sort_Desc$1 = 35;\n\nconst keywordTokens = {\n  json: Json$1,\n  logfmt: Logfmt$1,\n  unpack: Unpack$1,\n  pattern: Pattern$1,\n  regexp: Regexp$1,\n  label_format: LabelFormat$1,\n  line_format: LineFormat$1,\n  label_replace: LabelReplace$1,\n  vector: Vector$1,\n  offset: Offset$1,\n  bool: Bool$1,\n  on: On$1,\n  ignoring: Ignoring$1,\n  group_left: GroupLeft$1,\n  group_right: GroupRight$1,\n  unwrap: Unwrap$1,\n  decolorize: Decolorize$1,\n  drop: Drop$1,\n  keep: Keep$1,\n};\n\nconst specializeIdentifier = (value) => {\n  return keywordTokens[value.toLowerCase()] || -1;\n};\n\nconst contextualKeywordTokens = {\n  by: By$1,\n  without: Without$1,\n  and: And$1,\n  or: Or$1,\n  unless: Unless$1,\n  sum: Sum$1,\n  avg: Avg$1,\n  count: Count$1,\n  max: Max$1,\n  min: Min$1,\n  stddev: Stddev$1,\n  stdvar: Stdvar$1,\n  bottomk: Bottomk$1,\n  topk: Topk$1,\n  sort: Sort$1,\n  sort_desc: Sort_Desc$1,\n};\n\nconst extendIdentifier = (value) => {\n  return contextualKeywordTokens[value.toLowerCase()] || -1;\n};\n\n// This file was generated by lezer-generator. You probably shouldn't edit it.\nconst spec_Identifier = {__proto__:null,ip:295, count_over_time:301, rate:303, rate_counter:305, bytes_over_time:307, bytes_rate:309, avg_over_time:311, sum_over_time:313, min_over_time:315, max_over_time:317, stddev_over_time:319, stdvar_over_time:321, quantile_over_time:323, first_over_time:325, last_over_time:327, absent_over_time:329, bytes:335, duration:337, duration_seconds:339};\nconst parser = LRParser.deserialize({\n  version: 14,\n  states: \"EtOYQPOOO#cQPO'#DUOOQO'#ER'#ERO#hQPO'#ERO$}QPO'#DTOYQPO'#DTOOQO'#Ed'#EdO%[QPO'#EcOOQO'#FP'#FPO%aQPO'#FOQ%lQPOOO&mQPO'#F]O&rQPO'#F^OOQO'#Eb'#EbOOQO'#DS'#DSOOQO'#Ee'#EeOOQO'#Ef'#EfOOQO'#Eg'#EgOOQO'#Eh'#EhOOQO'#Ei'#EiOOQO'#Ej'#EjOOQO'#Ek'#EkOOQO'#El'#ElOOQO'#Em'#EmOOQO'#En'#EnOOQO'#Eo'#EoOOQO'#Ep'#EpOOQO'#Eq'#EqOOQO'#Er'#ErOOQO'#Es'#EsO&wQPO'#DWOOQO'#DV'#DVO'VQPO,59pOOQO,5:m,5:mOOQO'#Dc'#DcO'_QPO'#DbO'gQPO'#DaO)lQPO'#D`O*{QPO'#D`OOQO'#D_'#D_O+sQPO,59oO-}QPO,59oO.UQPO,5:|O.]QPO,5:}O.hQPO'#E|O0sQPO,5;jO0zQPO,5;jO1PQPO,5;lO1PQPO,5;lO1PQPO,5;lO1PQPO,5;lO1PQPO,5;lO1PQPO,5;lOYQPO,5;wO3cQPO,5;xO3hQPO,59rO#cQPO,59qOOQO1G/[1G/[OOQO'#Dh'#DhO3mQPO,59|O5^QPO,59|OOQO'#Di'#DiO5cQPO,59{OOQO,59{,59{O5kQPO'#DWO6YQPO'#DlO8PQPO'#DoO9sQPO'#DoOOQO'#Do'#DoOOQO'#Dv'#DvOOQO'#Dt'#DtO+kQPO'#DtO9xQPO,59zO;iQPO'#EVO;nQPO'#EWOOQO'#EZ'#EZO;sQPO'#E[O;xQPO'#E_OOQO,59z,59zOOQO,59y,59yOOQO1G/Z1G/ZOOQO1G0h1G0hO;}QPO'#EtO.`QPO'#EtO<XQPO1G0iO<^QPO1G0iO<cQPO,5;hO=oQPO1G1UO=vQPO1G1UO=}QPO1G1UO>UQPO'#FSO@dQPO'#FRO@nQPO'#FROYQPO1G1WOYQPO1G1WOYQPO1G1WOYQPO1G1WOYQPO1G1WOYQPO1G1WO@xQPO1G1cOAPQPO1G1dOOQO1G/^1G/^OOQO1G/]1G/]O5cQPO1G/hOAUQPO1G/hOAZQPO'#DjOBzQPO'#DjOOQO1G/g1G/gOCbQPO,59rOCPQPO,5:cOOQO'#Dm'#DmOClQPO,5:WOEcQPO'#DrOOQO'#Dq'#DqOGVQPO,5:_OHvQPO,5:[OOQO,5:Z,5:ZOJgQPO,5:`O+kQPO,5:`O+kQPO,5:`OOQO,5:q,5:qOJuQPO'#EYOOQO'#EX'#EXOJzQPO,5:rOLkQPO'#E^OOQO'#E^'#E^OOQO'#E]'#E]ONbQPO,5:vO!!RQPO'#EaOOQO'#Ea'#EaOOQO'#E`'#E`O!#xQPO,5:yO!%iQPO'#D`O;}QPO,5;`O!%pQPO'#EuO!%uQPO,5;`O!%}QPO,5;`O!&[QPO,5;`O!&iQPO,5;`O!&nQPO7+&TO.`QPO7+&TOOQO'#E}'#E}O!(OQPO1G1SOOQO1G1S1G1SOYQPO7+&pO!(WQPO7+&pO!)hQPO7+&pO!)oQPO7+&pO!)vQQO'#FTOOQO,5;n,5;nO!,UQPO,5;mO!,]QPO,5;mO!-nQPO7+&rO!-uQPO7+&rOOQO7+&r7+&rO!.SQPO7+&rO!.ZQPO7+&rO!/`QPO7+&rO!/pQPO7+&}OOQO7+'O7+'OOOQO7+%S7+%SO!/uQPO7+%SO5cQPO,5:UO!/zQPO,5:UO!0PQPO1G/{OOQO1G/}1G/}OOQO1G0U1G0UOOQO1G0W1G0WOOQO,5:X,5:XO!0UQPO1G/yO!1uQPO,5:^O!1zQPO,5:]OOQO1G/z1G/zO!2PQPO1G/zO!3pQPO,5:tO;nQPO,5:sO;sQPO,5:wO;xQPO,5:zO!3xQPO,5;cO!%uQPO1G0zO!4WQPO1G0zO!4`QPO,5;aO+kQPO,5;cO!4eQPO1G0zO!4oQPO'#EvO!4tQPO1G0zO!4eQPO1G0zO!4|QPO1G0zO!5ZQPO1G0zO!%xQPO1G0zOOQO1G0z1G0zOOQO<<Io<<IoO!5fQPO<<IoO!5kQPO,5;iOOQO7+&n7+&nO!5pQPO<<J[OOQO<<J[<<J[OYQPO<<J[OOQO'#FV'#FVO!5wQPO,5;oOOQO'#FU'#FUOOQO,5;o,5;oOOQO1G1X1G1XO!6PQPO1G1XO!8YQPO<<JiOOQO<<Hn<<HnOOQO1G/p1G/pO!8_QPO1G/pO!8dQPO7+%gOOQO1G/x1G/xOOQO1G/w1G/wOOQO1G0`1G0`OOQO1G0_1G0_OOQO1G0c1G0cOOQO1G0f1G0fOOQO'#Ex'#ExOOQO1G0}1G0}O!8iQPO1G0}OOQO'#Ey'#EyOOQO'#Ez'#EzOOQO'#E{'#E{OOQO7+&f7+&fOOQO1G0{1G0{O!8nQPO1G0}O!9SQPO7+&fOOQO,5;b,5;bO!9[QPO7+&fO!%xQPO7+&fO!9fQPO7+&fO!9qQPOAN?ZOOQO1G1T1G1TO!;RQPOAN?vO!<cQPOAN?vO!<jQQO1G1ZOOQO1G1Z1G1ZOOQO7+&s7+&sO!<rQPOAN@TOOQO7+%[7+%[O!<wQPO<<IRO!<|QPO7+&iO!=RQPO<<JQO!=ZQPO<<JQO!=cQPO'#EwO!=hQPO<<JQOOQOG24uG24uOOQOG25bG25bOOQO1G1[1G1[OOQO7+&u7+&uO!=pQPOG25oOOQOAN>mAN>mO!=uQPO<<JTOOQOAN?lAN?lO!=zQPOAN?lO!>SQPOLD+ZOOQOAN?oAN?oOOQO,5:r,5:rO!>XQPO!$'NuO!>^QPO!)9DaO!>cQPO!.K9{OOQO!4//g!4//gO;nQPO'#EWO!>hQPO'#D`O!?`QPO,59oO!@fQPO'#DTOYQPO1G1WOYQPO1G1WOYQPO1G1WOYQPO1G1WOYQPO1G1WOYQPO1G1WO1PQPO,5;lO1PQPO,5;lO1PQPO,5;lO1PQPO,5;lO1PQPO,5;lO1PQPO,5;lO!AqQPO7+&rO!AxQPO7+&rO!BVQPO7+&rO!C_QPO7+&rO!CfQPO7+&rO!B^QPO'#FQ\",\n  stateData: \"!Cs~O$TOStOS~OXZOY[OiWOjWOkWOlWOmWOnWOoWOpWOqWOrWOsWO!vQO!wRO!xRO$UPO$YTO$[_O$]`O$^aO$_bO$`cO$adO$beO$cfO$dgO$ehO$fiO$gjO$hkO$ilO$jmO~O{nO~O!vqO~O!OrO!QrO!WrO!XrO!YrO!ZrOfwXgwXhwX!lwX!nwX!owX!pwX!qwX!wwX!xwX#{wX#|wX#}wX$OwX~O!_vO$RwX$ZwX~P#mO$Y{O~Od|Oe|O$Y}O~Of!QOg!POh!QO!O!UO!l!UO!n!UO!o!UO!p!UO!q!UO!w!RO!x!RO#{!SO#|!SO#}!SO$O!TO~O$Y!VO~O$Y!WO~O|!XO!O!XO!P!XO!Q!XO~O$V!YO$W!ZO~O}!]O$X!_O~Og!`Of!TXh!TX!O!TX!Q!TX!W!TX!X!TX!Y!TX!Z!TX!_!TX!l!TX!n!TX!o!TX!p!TX!q!TX!w!TX!x!TX#{!TX#|!TX#}!TX$O!TX$R!TX$Z!TX$k!TX$V!TX~O!OrO!QrO!WrO!XrO!YrO!ZrO~Of!SXg!SXh!SX!_!SX!l!SX!n!SX!o!SX!p!SX!q!SX!w!SX!x!SX#{!SX#|!SX#}!SX$O!SX$R!SX$Z!SX$k!SX$V!SX~P)WOP!dOQ!cOR!fOS!eOT!eOV!lOW!kOa!mOb!nOc!oO{!bO$Y!iO~O!_vOfwagwahwa!lwa!nwa!owa!pwa!qwa!wwa!xwa#{wa#|wa#}wa$Owa$Rwa$Zwa~P)WOfvXgvXhvX!OvX!lvX!nvX!ovX!pvX!qvX!wvX!xvX#{vX#|vX#}vX$OvX~O$Z!rO~P,|O$Z!sO~P,|O!v!wO$UPO$Y!uO~O$Y!xO~OXZOY[OiWOjWOkWOlWOmWOnWOoWOpWOqWOrWOsWO!wRO!xRO$UPO$YTO$[_O$]`O$^aO$_bO$`cO$adO$beO$cfO$dgO$ehO$fiO$gjO$hkO$ilO$jmO~O!v!yO~P.mO$Y!{O~O[#OO]!|O^!|OX#uPY#uPi#uPj#uPk#uPl#uPm#uPn#uPo#uPp#uPq#uPr#uPs#uP!v#uP!w#uP!x#uP$U#uP$Y#uP$[#uP$]#uP$^#uP$_#uP$`#uP$a#uP$b#uP$c#uP$d#uP$e#uP$f#uP$g#uP$h#uP$i#uP$j#uP~O!v#WO~O}#XO~Og#ZOf!Uah!Ua!O!Ua!Q!Ua!W!Ua!X!Ua!Y!Ua!Z!Ua!_!Ua!l!Ua!n!Ua!o!Ua!p!Ua!q!Ua!w!Ua!x!Ua#{!Ua#|!Ua#}!Ua$O!Ua$R!Ua$Z!Ua$k!Ua$V!Ua~O$Y#[O~O}#]O$X!_O~O|#`O!O#`O!P!XO!Q!XO!l#aO!n#aO!o#aO!p#aO!q#aO~O{#dO!b#bOf!`Xg!`Xh!`X!O!`X!Q!`X!W!`X!X!`X!Y!`X!Z!`X!_!`X!l!`X!n!`X!o!`X!p!`X!q!`X!w!`X!x!`X#{!`X#|!`X#}!`X$O!`X$R!`X$Z!`X$k!`X$V!`X~O{#dOf!cXg!cXh!cX!O!cX!Q!cX!W!cX!X!cX!Y!cX!Z!cX!_!cX!l!cX!n!cX!o!cX!p!cX!q!cX!w!cX!x!cX#{!cX#|!cX#}!cX$O!cX$R!cX$Z!cX$k!cX$V!cX~O}#hO~Of#jOg#kO$V#jOh!Sa!O!Sa!Q!Sa!W!Sa!X!Sa!Y!Sa!Z!Sa!_!Sa!l!Sa!n!Sa!o!Sa!p!Sa!q!Sa!w!Sa!x!Sa#{!Sa#|!Sa#}!Sa$O!Sa$R!Sa$Z!Sa$k!Sa~O}#lO~O{#mO~O{#pO~O{#tO~O!_#xO$k#zO~P)WO$Z$PO~O$V$QO~O{$RO$Z$TO~Of!uXg!uXh!uX!O!uX!l!uX!n!uX!o!uX!p!uX!q!uX!w!uX!x!uX#{!uX#|!uX#}!uX$O!uX$Z!uX~O$V$UO~P<kO$Z$VO~P,|O!v$WO~P.mO$Y$YO~OX#uXY#uXi#uXj#uXk#uXl#uXm#uXn#uXo#uXp#uXq#uXr#uXs#uX!v#uX!w#uX!x#uX$U#uX$Y#uX$[#uX$]#uX$^#uX$_#uX$`#uX$a#uX$b#uX$c#uX$d#uX$e#uX$f#uX$g#uX$h#uX$i#uX$j#uX~O_$[O`$[O~P>ZO]!|O^!|O~P>ZO$V$dO~P,|O$Z$eO~O}$gO~Og$hOf!^Xh!^X!O!^X!Q!^X!W!^X!X!^X!Y!^X!Z!^X!_!^X!l!^X!n!^X!o!^X!p!^X!q!^X!w!^X!x!^X#{!^X#|!^X#}!^X$O!^X$R!^X$Z!^X$k!^X$V!^X~O$Y$iO~O!m$kO!s$lO!vQO!wRO!xRO~O}#XO$X!_O~PCPO{#dO!b$nOf!`ag!`ah!`a!O!`a!Q!`a!W!`a!X!`a!Y!`a!Z!`a!_!`a!l!`a!n!`a!o!`a!p!`a!q!`a!w!`a!x!`a#{!`a#|!`a#}!`a$O!`a$R!`a$Z!`a$k!`a$V!`a~O|$pOf!fXg!fXh!fX!O!fX!Q!fX!W!fX!X!fX!Y!fX!Z!fX!_!fX!l!fX!n!fX!o!fX!p!fX!q!fX!w!fX!x!fX#{!fX#|!fX#}!fX$O!fX$R!fX$V!fX$Z!fX$k!fX~O$V$qOf!gag!gah!ga!O!ga!Q!ga!W!ga!X!ga!Y!ga!Z!ga!_!ga!l!ga!n!ga!o!ga!p!ga!q!ga!w!ga!x!ga#{!ga#|!ga#}!ga$O!ga$R!ga$Z!ga$k!ga~O$V$qOf!dag!dah!da!O!da!Q!da!W!da!X!da!Y!da!Z!da!_!da!l!da!n!da!o!da!p!da!q!da!w!da!x!da#{!da#|!da#}!da$O!da$R!da$Z!da$k!da~Of#jOg#kO$V#jO$Z$rO~O|$tO~O$V$uOf!zag!zah!za!O!za!Q!za!W!za!X!za!Y!za!Z!za!_!za!l!za!n!za!o!za!p!za!q!za!w!za!x!za#{!za#|!za#}!za$O!za$R!za$Z!za$k!za~O|!XO!O!XO!P!XO!Q!XOf#QXg#QXh#QX!W#QX!X#QX!Y#QX!Z#QX!_#QX!l#QX!n#QX!o#QX!p#QX!q#QX!w#QX!x#QX#{#QX#|#QX#}#QX$O#QX$R#QX$V#QX$Z#QX$k#QX~O$V$vOf#Oag#Oah#Oa!O#Oa!Q#Oa!W#Oa!X#Oa!Y#Oa!Z#Oa!_#Oa!l#Oa!n#Oa!o#Oa!p#Oa!q#Oa!w#Oa!x#Oa#{#Oa#|#Oa#}#Oa$O#Oa$R#Oa$Z#Oa$k#Oa~O|!XO!O!XO!P!XO!Q!XOf#TXg#TXh#TX!W#TX!X#TX!Y#TX!Z#TX!_#TX!l#TX!n#TX!o#TX!p#TX!q#TX!w#TX!x#TX#{#TX#|#TX#}#TX$O#TX$R#TX$V#TX$Z#TX$k#TX~O$V$wOf#Rag#Rah#Ra!O#Ra!Q#Ra!W#Ra!X#Ra!Y#Ra!Z#Ra!_#Ra!l#Ra!n#Ra!o#Ra!p#Ra!q#Ra!w#Ra!x#Ra#{#Ra#|#Ra#}#Ra$O#Ra$R#Ra$Z#Ra$k#Ra~OU$xO~P*{O!m${O~O!_$|O$k#zO~OZ%OO!_#xO$Z#ha~P)WO!_#xO$Z%TO$k#zO~P)WO$Z%UO~Od|Oe|Of#Vqg#Vqh#Vq!O#Vq!l#Vq!n#Vq!o#Vq!p#Vq!q#Vq!w#Vq!x#Vq#{#Vq#|#Vq#}#Vq$O#Vq$R#Vq$Z#Vq$V#Vq~O$V%XO$Z%YO~Od|Oe|Of#rqg#rqh#rq!O#rq!l#rq!n#rq!o#rq!p#rq!q#rq!w#rq!x#rq#{#rq#|#rq#}#rq$O#rq$R#rq$Z#rq$V#rq~O$V%]O~P<kO$Z%[O~P,|O#z%^O$Z%aO~OX#uaY#uai#uaj#uak#ual#uam#uan#uao#uap#uaq#uar#uas#ua!v#ua!w#ua!x#ua$U#ua$[#ua$]#ua$^#ua$_#ua$`#ua$a#ua$b#ua$c#ua$d#ua$e#ua$f#ua$g#ua$h#ua$i#ua$j#ua~O$Y$YO~P!*OO_%cO`%cO$Y#ua~P!*OOf!QOh!QO!O!UO!l!UO!n!UO!o!UO!p!UO!q!UO!w!RO!x!RO#{#tq#|#tq#}#tq$O#tq$R#tq$Z#tq~Og#tq~P!,jOf#tqg#tqh#tq~P!,pOg!PO~P!,jO$R#tq$Z#tq~P%lOf#tqg#tqh#tq!O#tq!l#tq!n#tq!o#tq!p#tq!q#tq#{#tq#|#tq#}#tq$O#tq~O!w!RO!x!RO$R#tq$Z#tq~P!.eO}%dO~O$Z%eO~O}%gO~O$Y%hO~O$V$qOf!gig!gih!gi!O!gi!Q!gi!W!gi!X!gi!Y!gi!Z!gi!_!gi!l!gi!n!gi!o!gi!p!gi!q!gi!w!gi!x!gi#{!gi#|!gi#}!gi$O!gi$R!gi$Z!gi$k!gi~O}%iO~O{#dO~Of#jO$V#jOg!hih!hi!O!hi!Q!hi!W!hi!X!hi!Y!hi!Z!hi!_!hi!l!hi!n!hi!o!hi!p!hi!q!hi!w!hi!x!hi#{!hi#|!hi#}!hi$O!hi$R!hi$Z!hi$k!hi~O{%kO}%kO~O{%pO$m%rO$n%sO$o%tO~OZ%OO$Z#hi~O$l%vO~O!_#xO$Z#hi~P)WO!m%yO~O!_$|O$Z#hi~O!_#xO$Z%{O$k#zO~P)WO!_$|O$Z%{O$k#zO~O$Z%}O~O{&OO~O$Z&PO~P,|O$V&RO$Z&SO~O$Y$YOX#uiY#uii#uij#uik#uil#uim#uin#uio#uip#uiq#uir#uis#ui!v#ui!w#ui!x#ui$U#ui$[#ui$]#ui$^#ui$_#ui$`#ui$a#ui$b#ui$c#ui$d#ui$e#ui$f#ui$g#ui$h#ui$i#ui$j#ui~O$V&UO~O$Z&VO~O}&WO~O$Y&XO~Of#jOg#kO$V#jO!_#ki$k#ki$Z#ki~O!_$|O$Z#hq~O!_#xO$Z#hq~P)WOZ%OO!_&[O$Z#hq~Od|Oe|Of#V!Rg#V!Rh#V!R!O#V!R!l#V!R!n#V!R!o#V!R!p#V!R!q#V!R!w#V!R!x#V!R#{#V!R#|#V!R#}#V!R$O#V!R$R#V!R$Z#V!R$V#V!R~Od|Oe|Of#r!Rg#r!Rh#r!R!O#r!R!l#r!R!n#r!R!o#r!R!p#r!R!q#r!R!w#r!R!x#r!R#{#r!R#|#r!R#}#r!R$O#r!R$R#r!R$Z#r!R$V#r!R~O$Z&_O~P,|O#z%^O$Z&aO~O}&bO~O$Z&cO~O{&dO~O!_$|O$Z#hy~OZ%OO$Z#hy~OU$xO~O!_&[O$Z#hy~O$V&gO~O$Z&hO~O!_$|O$Z#h!R~O}&jO~O$V&kO~O}&lO~O$Z&mO~OP!dOQ!cOR!fOS!eOT!eOV&nOW!kOa!mOb!nOc!oO{!bO$Y!iO~O!_&oOfwagwahwa!lwa!nwa!owa!pwa!qwa!wwa!xwa#{wa#|wa#}wa$Owa$Vwa~P)WO!_&oO$VwX~P#mOf&yOh&yO!O&}O!l&}O!n&}O!o&}O!p&}O!q&}O!w&zO!x&zO#{#tq#|#tq#}#tq$O#tq$V#tq~Og#tq~P!@pOf#tqg#tqh#tq~P!@vOg&xO~P!@pOf&yOg&xOh&yO!O&}O!l&}O!n&}O!o&}O!p&}O!q&}O!w&zO!x&zO#{&{O#|&{O#}&{O$O&|O~O$V#tq~P!B^O!w&zO!x&zO$V#tq~P!.eO\",\n  goto: \"1l$RPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPP$S%R%j&Y&]PPPPPP&t'W'h'v(XPPPP(h(p(yP)S)XP)S)S)[)e)S)m*O*O*XPPPPPP*XP*O*bPPP)S)S*{+R)S)S+Y+])S+c+f+l,_,t-Z-Z-Z-Z-Z-Z-Z-Z-Z-Z-Z-Z-Z-Z-Z-p-y.^.j/S/V/V/V/Y/i,_/l,_0R0w1Y1c1fPPPPP,_,_[YOT}!{$U%]Q$^#PQ$_#QS$`#R&tQ$a#SQ$b#TQ$c#UQ'O&rQ'P&sQ'Q&uQ'R&vQ'S&wR'T!Vt^O}!V!{#P#Q#R#S#T#U$U%]&r&s&t&u&v&wRyTjSOT}!V!{#P#Q#R#S#T#U$U%]S!t{$QQ#}!u]&q&r&s&t&u&v&wRpPQoP^!hv!i#j#k#x$|&oQ#Y!YS#q!n$vT#u!o$wQxSQ#y!tQ$}#|Q%R#}Q%z%QR&p&q[wS!t#|#}%Q&q]!qx#y$}%R%z&piuSx!t#y#|#}$}%Q%R%z&p&qhtSx!t#y#|#}$}%Q%R%z&p&qR!auksSux!t#y#|#}$}%Q%R%z&p&qQ!^sV#^!`#Z$hW![s!`#Z$hR$j#`Q#_!`Q$f#ZR%f$hV!pv#x&oR#c!cQ#f!cQ#g!dR$o#cU#e!c!d#cR%j$qU!jv#x&oQ#i!iQ$r#jQ$s#kR%w$|_!hv!i#j#k#x$|&o_!gv!i#j#k#x$|&ov]OT}!V!{#P#Q#R#S#T#U$U%]&r&s&t&u&v&wT$m#`#aQ#o!lR&i&nS#n!l&nR%l$uR#s!nQ#r!nR%m$vR#w!oQ#v!oR%n$wj^O#P#Q#R#S#T#U&r&s&t&u&v&wQzTQ!z}Q#V!VQ$X!{Q%Z$UR&Q%]w]OT}!V!{#P#Q#R#S#T#U$U%]&r&s&t&u&v&wwVOT}!V!{#P#Q#R#S#T#U$U%]&r&s&t&u&v&wwUOT}!V!{#P#Q#R#S#T#U$U%]&r&s&t&u&v&wQ!v{Q$O!uR%W$QS#|!t#}W$z#y#{%R%SQ%u$yQ%|%TR&Z%{Q%Q#|Q%u$zQ&]%|R&e&ZQ#{!tS$y#y%RQ%P#|Q%S#}S%x$}%QS&Y%z%|R&f&]R%q$xR%o$xQ!OXQ%V$PQ%[$VQ&^%}R&_&PR$S!xwXOT}!V!{#P#Q#R#S#T#U$U%]&r&s&t&u&v&wQ#P!PQ#Q!QQ#R!RQ#S!SQ#T!TQ#U!UQ&r&xQ&s&yQ&t&zQ&u&{Q&v&|R&w&}h!}!P!Q!R!S!T!U&x&y&z&{&|&}R$]#OQ$Z!|Q%b$[R&T%cR%_$YQ%`$YR&`&R\",\n  nodeNames: \"⚠ Json Logfmt Unpack Pattern Regexp Unwrap LabelFormat LineFormat LabelReplace Vector Offset Bool On Ignoring GroupLeft GroupRight Decolorize Drop Keep By Without And Or Unless Sum Avg Count Max Min Stddev Stdvar Bottomk Topk Sort Sort_Desc LineComment LogQL Expr LogExpr Selector Matchers Matcher Identifier Eq String Neq Re Nre PipelineExpr PipelineStage LineFilters LineFilter Filter PipeExact PipeMatch PipePattern Npa FilterOp Ip OrFilter Pipe LogfmtParser LogfmtParserFlags ParserFlag LabelParser JsonExpressionParser LabelExtractionExpressionList LabelExtractionExpression LogfmtExpressionParser LabelFilter IpLabelFilter UnitFilter DurationFilter Gtr Duration Gte Lss Lte Eql BytesFilter Bytes NumberFilter LiteralExpr Number Add Sub LineFormatExpr LabelFormatExpr LabelsFormat LabelFormatMatcher DecolorizeExpr DropLabelsExpr DropLabels DropLabel KeepLabelsExpr KeepLabels KeepLabel MetricExpr RangeAggregationExpr RangeOp CountOverTime Rate RateCounter BytesOverTime BytesRate AvgOverTime SumOverTime MinOverTime MaxOverTime StddevOverTime StdvarOverTime QuantileOverTime FirstOverTime LastOverTime AbsentOverTime LogRangeExpr Range OffsetExpr UnwrapExpr ConvOp BytesConv DurationConv DurationSecondsConv Grouping Labels VectorAggregationExpr VectorOp BinOpExpr BinOpModifier OnOrIgnoringModifier GroupingLabels GroupingLabelList GroupingLabel LabelName Mul Div Mod Pow LabelReplaceExpr VectorExpr\",\n  maxTerm: 169,\n  skippedNodes: [0,36],\n  repeatNodeCount: 0,\n  tokenData: \"<n~RvX^#ipq#iqr$^rs$yst%kuv%vxy%{yz&Qz{&V{|&[|}&a}!O&f!O!P2v!P!Q3v!Q!R3{!R![7^![!]9]!^!_9q!_!`:O!`!a:e!c!}:r!}#O;Y#P#Q;_#Q#R;d#R#S:r#S#T;i#T#o:r#o#p;u#p#q;z#q#r<i#y#z#i$f$g#i#BY#BZ#i$IS$I_#i$I|$JO#i$JT$JU#i$KV$KW#i&FU&FV#i~#nY$T~X^#ipq#i#y#z#i$f$g#i#BY#BZ#i$IS$I_#i$I|$JO#i$JT$JU#i$KV$KW#i&FU&FV#i~$aR!_!`$j!`!a$o#r#s$t~$oO!O~~$tO!Z~~$yO!Q~~$|UOY$yZr$yrs%`s#O$y#O#P%e#P~$y~%eO}~~%hPO~$y~%pQt~OY%kZ~%k~%{O#}~~&QO$Y~~&VO$Z~~&[O#{~~&aO!w~~&fO$V~~&kQ!x~}!O&q!Q![(w~&tQ#_#`&z#g#h(X~&}P#X#Y'Q~'TP#X#Y'W~'ZP#d#e'^~'aP}!O'd~'gP#X#Y'j~'mP#a#b'p~'sP#d#e'v~'yP#h#i'|~(PP#m#n(S~(XO!b~~([P#h#i(_~(bP#f#g(e~(hP#]#^(k~(nP#V#W(q~(tP#h#i(S~(zZ!O!P)m!Q![(w#W#X0`#[#]*]#a#b+j#b#c.R#g#h/X#i#j.^#k#l1T#m#n1{${$|.^~)pP!Q![)s~)vV!Q![)s#[#]*]#a#b+j#b#c.R#g#h/X#i#j.^${$|.^~*bP!m~!Q![*e~*hV!O!P*}!Q![*e#a#b+j#b#c.R#g#h/X#i#j.^${$|.^~+QP!Q![+T~+WU!Q![+T#a#b+j#b#c.R#g#h/X#i#j.^${$|.^~+oQ!m~!Q![+u#g#h-Q~+xV!O!P,_!Q![+u#a#b,z#b#c.R#g#h/X#i#j.^${$|.^~,bP!Q![,e~,hU!Q![,e#a#b,z#b#c.R#g#h/X#i#j.^${$|.^~,}P#g#h-Q~-VP!m~!Q![-Y~-]T!O!P-l!Q![-Y#b#c.R#i#j.^${$|.^~-oP!Q![-r~-uS!Q![-r#b#c.R#i#j.^${$|.^~.UP#g#h.X~.^O!m~~.aP#g#h.d~.iP!m~!Q![.l~.oR!O!P.x!Q![.l#b#c.R~.{P!Q![/O~/RQ!Q![/O#b#c.R~/^P!m~!Q![/a~/dU!O!P/v!Q![/a#a#b,z#b#c.R#i#j.^${$|.^~/yP!Q![/|~0PT!Q![/|#a#b,z#b#c.R#i#j.^${$|.^~0eP!m~!Q![0h~0kW!O!P)m!Q![0h#[#]*]#a#b+j#b#c.R#g#h/X#i#j.^${$|.^~1YP!m~!Q![1]~1`X!O!P)m!Q![1]#W#X0`#[#]*]#a#b+j#b#c.R#g#h/X#i#j.^${$|.^~2QP!m~!Q![2T~2WY!O!P)m!Q![2T#W#X0`#[#]*]#a#b+j#b#c.R#g#h/X#i#j.^#k#l1T${$|.^~2yP!Q![2|~3RR!v~!Q![2|!g!h3[#X#Y3[~3_R{|3h}!O3h!Q![3n~3kP!Q![3n~3sP!v~!Q![3n~3{O#|~~4Qe!v~!O!P5c!Q![7^!d!e6x!g!h3[!i!j6}!m!n6}!o!p6}!r!s6}!v!w6}#W#X0`#X#Y3[#[#]*]#_#`7W#a#b+j#b#c.R#g#h/X#i#j.^#k#l1T#l#m8q#m#n1{${$|.^~5hR!v~!Q![5q!g!h3[#X#Y3[~5v`!v~!Q![5q!d!e6x!g!h3[!i!j6}!m!n6}!o!p6}!r!s6}!v!w6}#X#Y3[#[#]*]#_#`7W#a#b+j#b#c.R#g#h/X#i#j.^${$|.^~6}O!s~~7QQ!d!e6x#]#^7W~7ZP!d!e6x~7cd!v~!O!P5c!Q![7^!d!e6x!g!h3[!i!j6}!m!n6}!o!p6}!r!s6}!v!w6}#W#X0`#X#Y3[#[#]*]#_#`7W#a#b+j#b#c.R#g#h/X#i#j.^#k#l1T#m#n1{${$|.^~8tR!Q![8}!c!i8}#T#Z8}~9SR!v~!Q![8}!c!i8}#T#Z8}P9bT{P!Q![9]![!]9]!c!}9]#R#S9]#T#o9]~9vP!o~!_!`9y~:OO!p~~:TQ|~!_!`:Z#r#s:`~:`O!q~~:eO!P~~:jP!l~!_!`:m~:rO!n~R:yT{P#zQ!Q![:r![!]9]!c!}:r#R#S:r#T#o:r~;_O$k~~;dO$l~~;iO$O~~;lRO#S;i#S#T%`#T~;i~;zO$U~~<PR!_~!_!`<Y!`!a<_#r#s<d~<_O!W~~<dO!Y~~<iO!X~~<nO$W~\",\n  tokenizers: [0, 1],\n  topRules: {\"LogQL\":[0,37]},\n  specialized: [{term: 43, get: (value, stack) => (specializeIdentifier(value) << 1)},{term: 43, get: (value, stack) => (extendIdentifier(value) << 1) | 1},{term: 43, get: value => spec_Identifier[value] || -1}],\n  tokenPrec: 0\n});\n// This file was generated by lezer-generator. You probably shouldn't edit it.\nconst Json = 1,\n  Logfmt = 2,\n  Unpack = 3,\n  Pattern = 4,\n  Regexp = 5,\n  Unwrap = 6,\n  LabelFormat = 7,\n  LineFormat = 8,\n  LabelReplace = 9,\n  Vector = 10,\n  Offset = 11,\n  Bool = 12,\n  On = 13,\n  Ignoring = 14,\n  GroupLeft = 15,\n  GroupRight = 16,\n  Decolorize = 17,\n  Drop = 18,\n  Keep = 19,\n  By = 20,\n  Without = 21,\n  And = 22,\n  Or = 23,\n  Unless = 24,\n  Sum = 25,\n  Avg = 26,\n  Count = 27,\n  Max = 28,\n  Min = 29,\n  Stddev = 30,\n  Stdvar = 31,\n  Bottomk = 32,\n  Topk = 33,\n  Sort = 34,\n  Sort_Desc = 35,\n  LineComment = 36,\n  LogQL = 37,\n  Expr = 38,\n  LogExpr = 39,\n  Selector = 40,\n  Matchers = 41,\n  Matcher = 42,\n  Identifier = 43,\n  Eq = 44,\n  String = 45,\n  Neq = 46,\n  Re = 47,\n  Nre = 48,\n  PipelineExpr = 49,\n  PipelineStage = 50,\n  LineFilters = 51,\n  LineFilter = 52,\n  Filter = 53,\n  PipeExact = 54,\n  PipeMatch = 55,\n  PipePattern = 56,\n  Npa = 57,\n  FilterOp = 58,\n  Ip = 59,\n  OrFilter = 60,\n  Pipe = 61,\n  LogfmtParser = 62,\n  LogfmtParserFlags = 63,\n  ParserFlag = 64,\n  LabelParser = 65,\n  JsonExpressionParser = 66,\n  LabelExtractionExpressionList = 67,\n  LabelExtractionExpression = 68,\n  LogfmtExpressionParser = 69,\n  LabelFilter = 70,\n  IpLabelFilter = 71,\n  UnitFilter = 72,\n  DurationFilter = 73,\n  Gtr = 74,\n  Duration = 75,\n  Gte = 76,\n  Lss = 77,\n  Lte = 78,\n  Eql = 79,\n  BytesFilter = 80,\n  Bytes = 81,\n  NumberFilter = 82,\n  LiteralExpr = 83,\n  Number = 84,\n  Add = 85,\n  Sub = 86,\n  LineFormatExpr = 87,\n  LabelFormatExpr = 88,\n  LabelsFormat = 89,\n  LabelFormatMatcher = 90,\n  DecolorizeExpr = 91,\n  DropLabelsExpr = 92,\n  DropLabels = 93,\n  DropLabel = 94,\n  KeepLabelsExpr = 95,\n  KeepLabels = 96,\n  KeepLabel = 97,\n  MetricExpr = 98,\n  RangeAggregationExpr = 99,\n  RangeOp = 100,\n  CountOverTime = 101,\n  Rate = 102,\n  RateCounter = 103,\n  BytesOverTime = 104,\n  BytesRate = 105,\n  AvgOverTime = 106,\n  SumOverTime = 107,\n  MinOverTime = 108,\n  MaxOverTime = 109,\n  StddevOverTime = 110,\n  StdvarOverTime = 111,\n  QuantileOverTime = 112,\n  FirstOverTime = 113,\n  LastOverTime = 114,\n  AbsentOverTime = 115,\n  LogRangeExpr = 116,\n  Range = 117,\n  OffsetExpr = 118,\n  UnwrapExpr = 119,\n  ConvOp = 120,\n  BytesConv = 121,\n  DurationConv = 122,\n  DurationSecondsConv = 123,\n  Grouping = 124,\n  Labels = 125,\n  VectorAggregationExpr = 126,\n  VectorOp = 127,\n  BinOpExpr = 128,\n  BinOpModifier = 129,\n  OnOrIgnoringModifier = 130,\n  GroupingLabels = 131,\n  GroupingLabelList = 132,\n  GroupingLabel = 133,\n  LabelName = 134,\n  Mul = 135,\n  Div = 136,\n  Mod = 137,\n  Pow = 138,\n  LabelReplaceExpr = 139,\n  VectorExpr = 140;\n\nexport { AbsentOverTime, Add, And, Avg, AvgOverTime, BinOpExpr, BinOpModifier, Bool, Bottomk, By, Bytes, BytesConv, BytesFilter, BytesOverTime, BytesRate, ConvOp, Count, CountOverTime, Decolorize, DecolorizeExpr, Div, Drop, DropLabel, DropLabels, DropLabelsExpr, Duration, DurationConv, DurationFilter, DurationSecondsConv, Eq, Eql, Expr, Filter, FilterOp, FirstOverTime, GroupLeft, GroupRight, Grouping, GroupingLabel, GroupingLabelList, GroupingLabels, Gte, Gtr, Identifier, Ignoring, Ip, IpLabelFilter, Json, JsonExpressionParser, Keep, KeepLabel, KeepLabels, KeepLabelsExpr, LabelExtractionExpression, LabelExtractionExpressionList, LabelFilter, LabelFormat, LabelFormatExpr, LabelFormatMatcher, LabelName, LabelParser, LabelReplace, LabelReplaceExpr, Labels, LabelsFormat, LastOverTime, LineComment, LineFilter, LineFilters, LineFormat, LineFormatExpr, LiteralExpr, LogExpr, LogQL, LogRangeExpr, Logfmt, LogfmtExpressionParser, LogfmtParser, LogfmtParserFlags, Lss, Lte, Matcher, Matchers, Max, MaxOverTime, MetricExpr, Min, MinOverTime, Mod, Mul, Neq, Npa, Nre, Number, NumberFilter, Offset, OffsetExpr, On, OnOrIgnoringModifier, Or, OrFilter, ParserFlag, Pattern, Pipe, PipeExact, PipeMatch, PipePattern, PipelineExpr, PipelineStage, Pow, QuantileOverTime, Range, RangeAggregationExpr, RangeOp, Rate, RateCounter, Re, Regexp, Selector, Sort, Sort_Desc, Stddev, StddevOverTime, Stdvar, StdvarOverTime, String, Sub, Sum, SumOverTime, Topk, UnitFilter, Unless, Unpack, Unwrap, UnwrapExpr, Vector, VectorAggregationExpr, VectorExpr, VectorOp, Without, parser };\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n// expose the modules object (__webpack_modules__)\n__webpack_require__.m = __webpack_modules__;\n\n","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.f = {};\n// This file contains only the entry chunk.\n// The chunk loading function for additional chunks\n__webpack_require__.e = (chunkId) => {\n\treturn Promise.all(Object.keys(__webpack_require__.f).reduce((promises, key) => {\n\t\t__webpack_require__.f[key](chunkId, promises);\n\t\treturn promises;\n\t}, []));\n};","// This function allow to reference async chunks\n__webpack_require__.u = (chunkId) => {\n\t// return url for filenames based on template\n\treturn \"\" + chunkId + \".js\";\n};","__webpack_require__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this || new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\n\t}\n})();","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","__webpack_require__.p = \"public/plugins/grafana-lokiexplore-app/\";","__webpack_require__.b = document.baseURI || self.location.href;\n\n// object to store loaded and loading chunks\n// undefined = chunk not loaded, null = chunk preloaded/prefetched\n// [resolve, reject, Promise] = chunk loading, 0 = chunk loaded\nvar installedChunks = {\n\t231: 0\n};\n\n__webpack_require__.f.j = (chunkId, promises) => {\n\t\t// JSONP chunk loading for javascript\n\t\tvar installedChunkData = __webpack_require__.o(installedChunks, chunkId) ? installedChunks[chunkId] : undefined;\n\t\tif(installedChunkData !== 0) { // 0 means \"already installed\".\n\n\t\t\t// a Promise means \"currently loading\".\n\t\t\tif(installedChunkData) {\n\t\t\t\tpromises.push(installedChunkData[2]);\n\t\t\t} else {\n\t\t\t\tif(true) { // all chunks have JS\n\t\t\t\t\t// setup Promise in chunk cache\n\t\t\t\t\tvar promise = new Promise((resolve, reject) => (installedChunkData = installedChunks[chunkId] = [resolve, reject]));\n\t\t\t\t\tpromises.push(installedChunkData[2] = promise);\n\n\t\t\t\t\t// start chunk loading\n\t\t\t\t\tvar url = __webpack_require__.p + __webpack_require__.u(chunkId);\n\t\t\t\t\t// create error before stack unwound to get useful stacktrace later\n\t\t\t\t\tvar error = new Error();\n\t\t\t\t\tvar loadingEnded = (event) => {\n\t\t\t\t\t\tif(__webpack_require__.o(installedChunks, chunkId)) {\n\t\t\t\t\t\t\tinstalledChunkData = installedChunks[chunkId];\n\t\t\t\t\t\t\tif(installedChunkData !== 0) installedChunks[chunkId] = undefined;\n\t\t\t\t\t\t\tif(installedChunkData) {\n\t\t\t\t\t\t\t\tvar errorType = event && (event.type === 'load' ? 'missing' : event.type);\n\t\t\t\t\t\t\t\tvar realSrc = event && event.target && event.target.src;\n\t\t\t\t\t\t\t\terror.message = 'Loading chunk ' + chunkId + ' failed.\\n(' + errorType + ': ' + realSrc + ')';\n\t\t\t\t\t\t\t\terror.name = 'ChunkLoadError';\n\t\t\t\t\t\t\t\terror.type = errorType;\n\t\t\t\t\t\t\t\terror.request = realSrc;\n\t\t\t\t\t\t\t\tinstalledChunkData[1](error);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t};\n\t\t\t\t\t__webpack_require__.l(url, loadingEnded, \"chunk-\" + chunkId, chunkId);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n};\n\n// no prefetching\n\n// no preloaded\n\n// no HMR\n\n// no HMR manifest\n\n// no on chunks loaded\n\n// install a JSONP callback for chunk loading\nvar webpackJsonpCallback = (parentChunkLoadingFunction, data) => {\n\tvar [chunkIds, moreModules, runtime] = data;\n\t// add \"moreModules\" to the modules object,\n\t// then flag all \"chunkIds\" as loaded and fire callback\n\tvar moduleId, chunkId, i = 0;\n\tif(chunkIds.some((id) => (installedChunks[id] !== 0))) {\n\t\tfor(moduleId in moreModules) {\n\t\t\tif(__webpack_require__.o(moreModules, moduleId)) {\n\t\t\t\t__webpack_require__.m[moduleId] = moreModules[moduleId];\n\t\t\t}\n\t\t}\n\t\tif(runtime) var result = runtime(__webpack_require__);\n\t}\n\tif(parentChunkLoadingFunction) parentChunkLoadingFunction(data);\n\tfor(;i < chunkIds.length; i++) {\n\t\tchunkId = chunkIds[i];\n\t\tif(__webpack_require__.o(installedChunks, chunkId) && installedChunks[chunkId]) {\n\t\t\tinstalledChunks[chunkId][0]();\n\t\t}\n\t\tinstalledChunks[chunkId] = 0;\n\t}\n\n}\n\nvar chunkLoadingGlobal = self[\"webpackChunkgrafana_lokiexplore_app\"] = self[\"webpackChunkgrafana_lokiexplore_app\"] || [];\nchunkLoadingGlobal.forEach(webpackJsonpCallback.bind(null, 0));\nchunkLoadingGlobal.push = webpackJsonpCallback.bind(null, chunkLoadingGlobal.push.bind(chunkLoadingGlobal));","// startup\n// Load entry module and return exports\n// This entry module is referenced by other modules so it can't be inlined\nvar __webpack_exports__ = __webpack_require__(9077);\n"],"names":["leafPrototypes","getProto","inProgress","dataWebpackPrefix","OpenInLogsDrilldownButton","lazy","exposedComponents","id","title","description","component","props","Suspense","fallback","LinkButton","variant","disabled","App","wasmSupported","default","initRuntimeDs","initChangepoint","initOutlier","Promise","all","AppConfig","plugin","AppPlugin","setRootPage","addConfigPage","icon","body","linkConfig","linkConfigs","addLink","exposedComponentConfig","exposeComponent","PRODUCT_NAME","ExtensionPoints","MetricInvestigation","targets","PluginExtensionPoints","DashboardPanelMenu","path","createAppUrl","configure","contextToLink","ExploreToolbarAction","stringifyValues","value","EMPTY_VARIABLE_VALUE","replaceEscapeChars","replace","stringifyAdHocValues","addAdHocFilterUserInputPrefix","context","lokiQuery","find","target","datasource","type","uid","expr","labelFilters","lineFilters","fields","patternFilters","getMatcherFromQuery","labelSelector","selector","isOperatorInclusive","operator","labelValue","replaceSlash","split","labelName","key","SERVICE_NAME","sort","a","params","setUrlParameter","UrlParameters","DatasourceId","URLSearchParams","TimeRangeFrom","timeRange","from","valueOf","toString","TimeRangeTo","to","labelFilter","LabelType","Indexed","labelsAdHocFilterURLString","escapeURLDelimiters","appendUrlParameter","Labels","lineFilter","LineFilters","length","field","StructuredMetadata","LEVEL_VARIABLE_VALUE","Levels","Metadata","fieldValue","parser","adHocFilterURLString","JSON","stringify","Fields","patterns","push","PatternFilterOp","match","pattern","patternsString","renderPatternFilters","Patterns","PatternsVariable","urlParams","pluginJson","VAR_DATASOURCE","VAR_LABELS","VAR_FIELDS","VAR_METADATA","VAR_LEVELS","VAR_LINE_FILTERS","VAR_PATTERNS","initalParams","searchParams","location","search","set","append","parameter","stripAdHocFilterUserInputPrefix","Symbol","escapeUrlCommaDelimiters","escapeUrlPipeDelimiters","LabelFilterOp","NumericFilterOp","FilterOp","LineFilterOp","LineFilterCaseSensitive","defaultContext","app","version","logger","info","msg","ctx","console","log","attemptFaroInfo","warn","attemptFaroWarn","error","err","attemptFaroErr","logInfo","e","logWarning","context2","isRecord","Object","keys","forEach","hasData","data","populateFetchErrorContext","Error","logError","NodePosition","fromNode","node","contains","position","this","getExpression","query","substring","constructor","syntaxNode","getNodesFromQuery","nodeTypes","nodes","parse","iterate","enter","undefined","includes","getAllPositionsInNodeByType","positions","pos","child","childAfter","parseNonPatternFilters","lineFilterValue","quoteString","index","isRegexSelector","regex","negativeRegex","isCaseInsensitive","replaceDoubleEscape","RegExp","replaceDoubleQuoteEscape","caseInsensitive","caseSensitive","parsePatternFilters","getNumericFieldOperator","matcher","Lte","FilterOperator","lte","Lss","lt","Gte","gte","Gtr","gt","getStringFieldOperator","Eq","Equal","Neq","NotEqual","Re","RegexEqual","Nre","RegexNotEqual","filter","Selector","allMatcher","Matcher","identifierPosition","valuePosition","Identifier","String","map","parseLabelFilters","allLineFilters","LineFilter","entries","equal","PipeExact","pipeRegExp","PipeMatch","notEqual","notEqualRegExp","patternInclude","PipePattern","patternExclude","Npa","lineFilterValueNodes","getStringsFromLineFilter","lineFilterValueNode","negativeMatch","parseLineFilters","dataFrame","series","frame","refId","allFields","LabelFilter","fieldNameNode","expression","getChild","logFmtParser","Logfmt","jsonParser","Json","fieldName","fieldStringValue","fieldNumberValue","Number","fieldBytesValue","Bytes","fieldDurationValue","Duration","labelType","getLabelTypeFromFrame","Parsed","parseFields","ErrorId","isValidQuery","nodeType","isQueryWithNode","string","OrFilter","LokiQueryDirection","labelKey","typeField","name","values","isObj","o","hasProp","prop","isString","s","obj","unknownToStrings","strings","Array","isArray","i","narrowSelectedTableRow","narrowed","row","narrowLogsVisualizationType","narrowLogsSortOrder","LogsSortOrder","Ascending","Descending","narrowFieldValue","narrowRecordStringNumber","returnRecord","narrowTimeRange","unknownRange","range","narrowFilterOperator","op","NarrowingError","isOperatorExclusive","isOperatorRegex","isOperatorNumeric","numericOperatorArray","getOperatorDescription","operators","array","label","includeOperators","numericOperators","lineFilterOperators","escapeLabelValueInExactSelector","excludePatternsLine","p","join","trim","includePatterns","includePatternsLine","VAR_LABELS_EXPR","VAR_LABELS_REPLICA","VAR_LABELS_REPLICA_EXPR","VAR_FIELDS_EXPR","PENDING_FIELDS_EXPR","PENDING_METADATA_EXPR","VAR_FIELDS_AND_METADATA","VAR_METADATA_EXPR","VAR_PATTERNS_EXPR","VAR_LEVELS_EXPR","VAR_FIELD_GROUP_BY","VAR_LABEL_GROUP_BY","VAR_LABEL_GROUP_BY_EXPR","VAR_PRIMARY_LABEL_SEARCH","VAR_PRIMARY_LABEL","VAR_PRIMARY_LABEL_EXPR","VAR_DATASOURCE_EXPR","MIXED_FORMAT_EXPR","JSON_FORMAT_EXPR","LOGS_FORMAT_EXPR","VAR_LOGS_FORMAT","VAR_LOGS_FORMAT_EXPR","VAR_LINE_FILTER","VAR_LINE_FILTERS_EXPR","LOG_STREAM_SELECTOR_EXPR","DETECTED_FIELD_AND_METADATA_VALUES_EXPR","DETECTED_LEVELS_VALUES_EXPR","PATTERNS_SAMPLE_SELECTOR_EXPR","PRETTY_LOG_STREAM_SELECTOR_EXPR","EXPLORATION_DS","ALL_VARIABLE_VALUE","SERVICE_UI_LABEL","VAR_AGGREGATED_METRICS","USER_INPUT_ADHOC_VALUE_PREFIX","startsWith","isAdHocFilterValueUserInput","module","exports","__WEBPACK_EXTERNAL_MODULE__6089__","__WEBPACK_EXTERNAL_MODULE__7781__","__WEBPACK_EXTERNAL_MODULE__8531__","__WEBPACK_EXTERNAL_MODULE__2007__","__WEBPACK_EXTERNAL_MODULE__3241__","__WEBPACK_EXTERNAL_MODULE__5959__","__WEBPACK_EXTERNAL_MODULE__8398__","__WEBPACK_EXTERNAL_MODULE__200__","__WEBPACK_EXTERNAL_MODULE__3806__","__WEBPACK_EXTERNAL_MODULE__7694__","__WEBPACK_EXTERNAL_MODULE__1269__","DefaultBufferLength","nextPropID","Range","NodeProp","config","perNode","deserialize","add","RangeError","NodeType","result","closedBy","str","openedBy","group","isolate","contextHash","lookAhead","mounted","MountedTree","tree","overlay","get","noProps","create","flags","define","spec","top","skipped","src","isTop","isSkipped","isError","isAnonymous","is","indexOf","direct","groups","found","none","NodeSet","types","extend","newTypes","newProps","source","assign","CachedNode","WeakMap","CachedInnerNode","IterMode","Tree","children","ch","test","cursor","mode","TreeCursor","topNode","cursorAt","side","scope","moveTo","_tree","TreeNode","resolve","resolveNode","resolveInner","resolveStack","inner","layers","scan","parent","mount","root","iterStack","stackIterator","leave","anon","IncludeAnonymous","c","entered","firstChild","nextSibling","propValues","balance","balanceRange","makeTree","build","_a","buffer","nodeSet","maxBufferLength","reused","minRepeatType","FlatBufferCursor","takeNode","parentStart","minPos","inRepeat","depth","start","end","size","lookAheadAtStart","contextAtStart","next","startPos","maxSize","fork","skip","minStart","nodeSize","localSkipped","nodeStart","findBufferSize","Uint16Array","endPos","copyToBuffer","TreeBuffer","localChildren","localPositions","localInRepeat","lastGroup","lastEnd","makeRepeatLeaf","takeFlatNode","reverse","make","last","lookAheadProp","lastI","makeBalanced","nodeCount","stopAt","j","base","pop","pair","concat","bufferStart","startIndex","topID","buildTree","empty","childString","endIndex","findChild","dir","pick","checkSide","slice","startI","endI","b","copy","len","Math","max","overlays","IgnoreOverlays","BaseNode","before","after","r","getChildren","matchContext","matchNodeContext","enterUnfinishedNodesBefore","childBefore","lastChild","prevSibling","_parent","super","nextChild","ExcludeBuffers","BufferNode","BufferContext","hasChild","IgnoreMounts","rPos","nextSignificantParent","val","toTree","cur","externalSibling","heads","picked","newHeads","splice","StackIterator","stack","bufferNode","yieldNode","n","unshift","yieldBuf","yield","enterChild","sibling","d","atLastNode","move","prev","cache","mustLeave","some","nodeSizeCache","balanceType","mkTop","mkTree","total","maxChild","ceil","divide","offset","groupFrom","groupStart","groupSize","nextSize","only","Parser","startParse","input","fragments","ranges","StringInput","createParse","done","advance","chunk","lineChunks","read","Stack","state","reducePos","score","bufferBase","curContext","_","cx","StackContext","pushState","reduce","action","lookaheadRecord","setLookAhead","dPrec","dynamicPrecedence","getGoto","minRepeatTerm","storeNode","reduceContext","lastBigReductionStart","bigReductionCount","lastBigReductionSize","count","stateFlag","baseStateID","term","mustSink","mustMove","shift","shiftContext","maxNode","nextState","apply","nextStart","nextEnd","useNode","updateContext","tracker","reuse","stream","reset","off","recoverByDelete","isNode","canShift","sim","SimulatedStack","stateSlot","hasAction","recoverByInsert","nextStates","best","v","forceReduce","validAction","backup","findForcedReduction","seen","explore","allActions","rDepth","forceAll","deadEnd","restart","sameState","other","dialectEnabled","dialectID","dialect","emitContext","hash","emitLookAhead","newCx","close","strict","goto","StackBufferCursor","maybeNext","decodeArray","Type","out","charCodeAt","stop","digit","CachedToken","extended","mask","nullToken","InputStream","chunkOff","chunk2","chunk2Pos","token","rangeIndex","chunkPos","readNext","resolveOffset","assoc","clipPos","peek","idx","resolved","acceptToken","endOffset","acceptTokenTo","getChunk","nextChunk","setDone","min","TokenGroup","precTable","precOffset","groupMask","accEnd","allows","overrides","low","high","mid","readToken","tokenPrecTable","findOffset","tableData","tableOffset","iPrev","prototype","contextual","verbose","process","env","LOG","stackIDs","cutAt","fragment","safeFrom","safeTo","trees","nextFragment","fr","openStart","openEnd","nodeAt","TokenCache","tokens","mainToken","actions","tokenizers","getActions","actionIndex","main","tokenizer","updateCachedToken","addActions","eofTerm","getMainToken","specialized","specializers","putAction","Parse","recovering","nextStackID","minStackPos","stoppedAt","topTerm","stacks","bufferLength","parsedPos","stopped","stoppedTokens","newStacks","advanceStack","tok","finished","findFinished","stackID","stackToTree","getName","SyntaxError","runRecovery","maxRemaining","outer","strictCx","cxHash","cached","defaultReduce","localStack","advanceFully","pushStackDedup","restarted","tokenEnd","force","forceBase","insert","fromCodePoint","Dialect","LRParser","wrappers","nodeNames","repeatNodeCount","topTerms","topRules","nodeProps","setProp","nodeID","propSpec","skippedNodes","propSources","tokenArray","tokenData","specializerSpecs","getSpecializer","states","Uint32Array","stateData","maxTerm","dialects","dynamicPrecedences","tokenPrec","termNames","parseDialect","w","loose","table","groupTag","terminal","slot","flag","deflt","t","external","contextTracker","wrap","hasWrappers","prec","part","Uint8Array","keywordTokens","json","logfmt","unpack","regexp","label_format","line_format","label_replace","vector","bool","on","ignoring","group_left","group_right","unwrap","decolorize","drop","keep","contextualKeywordTokens","by","without","and","or","unless","sum","avg","stddev","stdvar","bottomk","topk","sort_desc","spec_Identifier","__proto__","ip","count_over_time","rate","rate_counter","bytes_over_time","bytes_rate","avg_over_time","sum_over_time","min_over_time","max_over_time","stddev_over_time","stdvar_over_time","quantile_over_time","first_over_time","last_over_time","absent_over_time","bytes","duration","duration_seconds","toLowerCase","specializeIdentifier","extendIdentifier","MetricExpr","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","__webpack_modules__","call","m","getter","__esModule","getPrototypeOf","then","ns","def","current","getOwnPropertyNames","definition","defineProperty","enumerable","f","chunkId","promises","u","g","globalThis","Function","window","hasOwnProperty","l","url","script","needAttach","scripts","document","getElementsByTagName","getAttribute","createElement","charset","timeout","nc","setAttribute","onScriptComplete","event","onerror","onload","clearTimeout","doneFns","parentNode","removeChild","fn","setTimeout","bind","head","appendChild","toStringTag","baseURI","self","href","installedChunks","installedChunkData","promise","reject","errorType","realSrc","message","request","webpackJsonpCallback","parentChunkLoadingFunction","chunkIds","moreModules","runtime","chunkLoadingGlobal"],"sourceRoot":""}