{"version":3,"file":"ankerlenker-eeeaf87d6179789650a9.esm.js","mappings":"mBACA,IAAIA,EAAsB,CAAC,ECD3B,SAASC,IAAS,CCAlBD,EAAoBE,EAAI,WACvB,GAA0B,iBAAfC,WAAyB,OAAOA,WAC3C,IACC,OAAOC,MAAQ,IAAIC,SAAS,cAAb,EAChB,CAAE,MAAOC,GACR,GAAsB,iBAAXC,OAAqB,OAAOA,MACxC,CACA,CAPuB,GDkBxB,SAASC,EAAIC,GACT,OAAOA,GACX,CACA,SAASC,IACL,OAAOC,OAAOC,OAAO,KACzB,CACA,SAASC,EAAQC,GACbA,EAAIC,QAAQP,EAChB,CACA,SAASQ,EAAYC,GACjB,MAAwB,mBAAVA,CAClB,CACA,SAASC,EAAeC,EAAGC,GACvB,OAAOD,GAAKA,EAAIC,GAAKA,EAAID,IAAMC,GAAOD,GAAkB,iBAANA,GAAgC,mBAANA,CAChF,CAYA,SAASE,EAASC,GACd,OAAmC,IAA5BX,OAAOY,KAAKD,GAAKE,MAC5B,CAoIc,IAAIC,IAmClB,MAAMC,EAA6B,oBAAXnB,OAClBA,OACsB,oBAAfJ,WACHA,WACA,EAAAD,EAOV,MAAMyB,EACF,WAAAC,CAAYC,GACRzB,KAAKyB,QAAUA,EACfzB,KAAK0B,WAAa,YAAaJ,EAAU,IAAIK,aAAYC,CAC7D,CACA,OAAAC,CAAQC,EAASC,GAGb,OAFA/B,KAAK0B,WAAWM,IAAIF,EAASC,GAC7B/B,KAAKiC,eAAeJ,QAAQC,EAAS9B,KAAKyB,SACnC,KACHzB,KAAK0B,WAAWQ,OAAOJ,GACvB9B,KAAKmC,UAAUC,UAAUN,EAAQ,CAEzC,CACA,YAAAG,GACI,IAAII,EACJ,OAAiC,QAAzBA,EAAKrC,KAAKmC,iBAA8B,IAAPE,EAAgBA,EAAMrC,KAAKmC,UAAY,IAAIG,gBAAgBC,IAChG,IAAIF,EACJ,IAAK,MAAMG,KAASD,EAChBhB,EAAwBgB,QAAQP,IAAIQ,EAAMC,OAAQD,GACL,QAA5CH,EAAKrC,KAAK0B,WAAWgB,IAAIF,EAAMC,eAA4B,IAAPJ,GAAyBA,EAAGG,EACrF,GAER,EAGJjB,EAAwBgB,QAAU,YAAajB,EAAU,IAAIK,aAAYC,EAIzE,IAAIe,GAAe,EAOnB,SAASC,EAAYC,EAAKC,EAAMC,EAAKC,GAEjC,KAAOH,EAAMC,GAAM,CACf,MAAMG,EAAMJ,GAAQC,EAAOD,GAAQ,GAC/BE,EAAIE,IAAQD,EACZH,EAAMI,EAAM,EAGZH,EAAOG,CAEf,CACA,OAAOJ,CACX,CA8GA,SAASK,EAAiBT,EAAQU,GAC9B,GAAIR,EAAc,CAMd,KApHR,SAAsBF,GAClB,GAAIA,EAAOW,aACP,OACJX,EAAOW,cAAe,EAEtB,IAAIC,EAAWZ,EAAOa,WAEtB,GAAwB,SAApBb,EAAOc,SAAqB,CAC5B,MAAMC,EAAa,GACnB,IAAK,IAAIC,EAAI,EAAGA,EAAIJ,EAASjC,OAAQqC,IAAK,CACtC,MAAMN,EAAOE,EAASI,QACG7B,IAArBuB,EAAKO,aACLF,EAAWG,KAAKR,EAExB,CACAE,EAAWG,CACf,CAmBA,MAAMI,EAAI,IAAIC,WAAWR,EAASjC,OAAS,GAErC0C,EAAI,IAAID,WAAWR,EAASjC,QAClCwC,EAAE,IAAM,EACR,IAAIG,EAAU,EACd,IAAK,IAAIN,EAAI,EAAGA,EAAIJ,EAASjC,OAAQqC,IAAK,CACtC,MAAMO,EAAUX,EAASI,GAAGC,YAItBO,GAAWF,EAAU,GAAKV,EAASO,EAAEG,IAAUL,aAAeM,EAAWD,EAAU,EAAInB,EAAY,EAAGmB,GAASG,GAAOb,EAASO,EAAEM,IAAMR,aAAaM,IAAY,EACtKF,EAAEL,GAAKG,EAAEK,GAAU,EACnB,MAAME,EAASF,EAAS,EAExBL,EAAEO,GAAUV,EACZM,EAAUK,KAAKC,IAAIF,EAAQJ,EAC/B,CAEA,MAAMO,EAAM,GAENC,EAAS,GACf,IAAIC,EAAOnB,EAASjC,OAAS,EAC7B,IAAK,IAAIqD,EAAMb,EAAEG,GAAW,EAAU,GAAPU,EAAUA,EAAMX,EAAEW,EAAM,GAAI,CAEvD,IADAH,EAAIX,KAAKN,EAASoB,EAAM,IACjBD,GAAQC,EAAKD,IAChBD,EAAOZ,KAAKN,EAASmB,IAEzBA,GACJ,CACA,KAAOA,GAAQ,EAAGA,IACdD,EAAOZ,KAAKN,EAASmB,IAEzBF,EAAII,UAEJH,EAAOI,MAAK,CAAC5D,EAAGC,IAAMD,EAAE2C,YAAc1C,EAAE0C,cAExC,IAAK,IAAID,EAAI,EAAGmB,EAAI,EAAGnB,EAAIc,EAAOnD,OAAQqC,IAAK,CAC3C,KAAOmB,EAAIN,EAAIlD,QAAUmD,EAAOd,GAAGC,aAAeY,EAAIM,GAAGlB,aACrDkB,IAEJ,MAAMC,EAASD,EAAIN,EAAIlD,OAASkD,EAAIM,GAAK,KACzCnC,EAAOqC,aAAaP,EAAOd,GAAIoB,EACnC,CACJ,CAiCQE,CAAatC,SACoBb,IAA5Ba,EAAOuC,kBAAiE,OAA5BvC,EAAOuC,kBAA+BvC,EAAOuC,iBAAiBC,aAAexC,KAC1HA,EAAOuC,iBAAmBvC,EAAOyC,YAGD,OAA5BzC,EAAOuC,uBAAuEpD,IAAxCa,EAAOuC,iBAAiBtB,aAClEjB,EAAOuC,iBAAmBvC,EAAOuC,iBAAiBG,YAElDhC,IAASV,EAAOuC,sBAESpD,IAArBuB,EAAKO,aAA6BP,EAAK8B,aAAexC,GACtDA,EAAOqC,aAAa3B,EAAMV,EAAOuC,kBAIrCvC,EAAOuC,iBAAmB7B,EAAKgC,WAEvC,MACShC,EAAK8B,aAAexC,GAA+B,OAArBU,EAAKgC,aACxC1C,EAAO2C,YAAYjC,EAE3B,CAIA,SAASkC,EAAiB5C,EAAQU,EAAM0B,GAChClC,IAAiBkC,EACjB3B,EAAiBT,EAAQU,GAEpBA,EAAK8B,aAAexC,GAAUU,EAAKgC,aAAeN,GACvDpC,EAAOqC,aAAa3B,EAAM0B,GAAU,KAE5C,CACA,SAASS,EAAOnC,GACRA,EAAK8B,YACL9B,EAAK8B,WAAWM,YAAYpC,EAEpC,CAOA,SAAS,EAAQqC,GACb,OAAOC,SAASC,cAAcF,EAClC,CAmBA,SAAS,EAAKG,GACV,OAAOF,SAASG,eAAeD,EACnC,CACA,SAASE,IACL,OAAO,EAAK,IAChB,CACA,SAASC,IACL,OAAO,EAAK,GAChB,CAIA,SAASC,EAAO5C,EAAM6C,EAAOC,EAASxE,GAElC,OADA0B,EAAK+C,iBAAiBF,EAAOC,EAASxE,GAC/B,IAAM0B,EAAKgD,oBAAoBH,EAAOC,EAASxE,EAC1D,CAoCA,SAAS2E,EAAKjD,EAAMkD,EAAWrD,GACd,MAATA,EACAG,EAAKmD,gBAAgBD,GAChBlD,EAAKoD,aAAaF,KAAerD,GACtCG,EAAKqD,aAAaH,EAAWrD,EACrC,CAuHA,SAASK,EAASvB,GACd,OAAO2E,MAAMC,KAAK5E,EAAQwB,WAC9B,CACA,SAASqD,EAAgBC,QACIhF,IAArBgF,EAAMC,aACND,EAAMC,WAAa,CAAEC,WAAY,EAAGC,cAAe,GAE3D,CACA,SAASC,EAAWJ,EAAOK,EAAWC,EAAaC,EAAYC,GAAsB,GAEjFT,EAAgBC,GAChB,MAAMS,EAAa,MAEf,IAAK,IAAI5D,EAAImD,EAAMC,WAAWC,WAAYrD,EAAImD,EAAMxF,OAAQqC,IAAK,CAC7D,MAAMN,EAAOyD,EAAMnD,GACnB,GAAIwD,EAAU9D,GAAO,CACjB,MAAMmE,EAAcJ,EAAY/D,GAUhC,YAToBvB,IAAhB0F,EACAV,EAAMW,OAAO9D,EAAG,GAGhBmD,EAAMnD,GAAK6D,EAEVF,IACDR,EAAMC,WAAWC,WAAarD,GAE3BN,CACX,CACJ,CAGA,IAAK,IAAIM,EAAImD,EAAMC,WAAWC,WAAa,EAAGrD,GAAK,EAAGA,IAAK,CACvD,MAAMN,EAAOyD,EAAMnD,GACnB,GAAIwD,EAAU9D,GAAO,CACjB,MAAMmE,EAAcJ,EAAY/D,GAchC,YAboBvB,IAAhB0F,EACAV,EAAMW,OAAO9D,EAAG,GAGhBmD,EAAMnD,GAAK6D,EAEVF,OAGoBxF,IAAhB0F,GAELV,EAAMC,WAAWC,aAJjBF,EAAMC,WAAWC,WAAarD,EAM3BN,CACX,CACJ,CAEA,OAAOgE,GACV,EA1CkB,GA6CnB,OAFAE,EAAW3D,YAAckD,EAAMC,WAAWE,cAC1CH,EAAMC,WAAWE,eAAiB,EAC3BM,CACX,CACA,SAASG,EAAmBZ,EAAOpB,EAAMiC,EAAYC,GACjD,OAAOV,EAAWJ,GAAQzD,GAASA,EAAKI,WAAaiC,IAAOrC,IACxD,MAAMwE,EAAS,GACf,IAAK,IAAI/C,EAAI,EAAGA,EAAIzB,EAAKsE,WAAWrG,OAAQwD,IAAK,CAC7C,MAAMyB,EAAYlD,EAAKsE,WAAW7C,GAC7B6C,EAAWpB,EAAUb,OACtBmC,EAAOhE,KAAK0C,EAAUb,KAE9B,CACAmC,EAAOhH,SAAQiH,GAAKzE,EAAKmD,gBAAgBsB,IACzB,IACjB,IAAMF,EAAelC,IAC5B,CACA,SAASqC,EAAcjB,EAAOpB,EAAMiC,GAChC,OAAOD,EAAmBZ,EAAOpB,EAAMiC,EAAY,EACvD,CAIA,SAASK,EAAWlB,EAAOjB,GACvB,OAAOqB,EAAWJ,GAAQzD,GAA2B,IAAlBA,EAAK4E,WAAiB5E,IACrD,MAAM6E,EAAU,GAAKrC,EACrB,GAAIxC,EAAKwC,KAAKsC,WAAWD,IACrB,GAAI7E,EAAKwC,KAAKvE,SAAW4G,EAAQ5G,OAC7B,OAAO+B,EAAK+E,UAAUF,EAAQ5G,aAIlC+B,EAAKwC,KAAOqC,CAChB,IACD,IAAM,EAAKrC,KAAO,EAEzB,CACA,SAASwC,EAAYvB,GACjB,OAAOkB,EAAWlB,EAAO,IAC7B,CA4QuB,IAAIwB,IAC3B,IAmIIC,EACJ,SAASC,EAAsBC,GAC3BF,EAAoBE,CACxB,CACA,SAASC,IACL,IAAKH,EACD,MAAM,IAAII,MAAM,oDACpB,OAAOJ,CACX,CA0HA,MAAMK,EAAmB,GAEnBC,EAAoB,GAC1B,IAAIC,EAAmB,GACvB,MAAMC,EAAkB,GAClBC,EAAmCC,QAAQC,UACjD,IAAIC,GAAmB,EACvB,SAASC,IACAD,IACDA,GAAmB,EACnBH,EAAiBK,KAAKC,GAE9B,CAKA,SAASC,EAAoBhJ,GACzBuI,EAAiBjF,KAAKtD,EAC1B,CAsBA,MAAMiJ,EAAiB,IAAIjI,IAC3B,IAAIkI,EAAW,EACf,SAASH,IAIL,GAAiB,IAAbG,EACA,OAEJ,MAAMC,EAAkBnB,EACxB,EAAG,CAGC,IACI,KAAOkB,EAAWb,EAAiBtH,QAAQ,CACvC,MAAMmH,EAAYG,EAAiBa,GACnCA,IACAjB,EAAsBC,GACtBkB,EAAOlB,EAAUmB,GACrB,CACJ,CACA,MAAOxJ,GAIH,MAFAwI,EAAiBtH,OAAS,EAC1BmI,EAAW,EACLrJ,CACV,CAIA,IAHAoI,EAAsB,MACtBI,EAAiBtH,OAAS,EAC1BmI,EAAW,EACJZ,EAAkBvH,QACrBuH,EAAkBgB,KAAlBhB,GAIJ,IAAK,IAAIlF,EAAI,EAAGA,EAAImF,EAAiBxH,OAAQqC,GAAK,EAAG,CACjD,MAAMmG,EAAWhB,EAAiBnF,GAC7B6F,EAAeO,IAAID,KAEpBN,EAAeQ,IAAIF,GACnBA,IAER,CACAhB,EAAiBxH,OAAS,CAC9B,OAASsH,EAAiBtH,QAC1B,KAAOyH,EAAgBzH,QACnByH,EAAgBc,KAAhBd,GAEJI,GAAmB,EACnBK,EAAeS,QACfzB,EAAsBkB,EAC1B,CACA,SAASC,EAAOC,GACZ,GAAoB,OAAhBA,EAAGM,SAAmB,CACtBN,EAAGD,SACHhJ,EAAQiJ,EAAGO,eACX,MAAMC,EAAQR,EAAGQ,MACjBR,EAAGQ,MAAQ,EAAE,GACbR,EAAGM,UAAYN,EAAGM,SAASlG,EAAE4F,EAAGS,IAAKD,GACrCR,EAAGU,aAAazJ,QAAQ0I,EAC5B,CACJ,CAyBA,MAAMgB,EAAW,IAAIhJ,IAerB,SAASiJ,EAAcC,EAAOC,GACtBD,GAASA,EAAM9G,IACf4G,EAASnI,OAAOqI,GAChBA,EAAM9G,EAAE+G,GAEhB,CAyf2B,IAAInJ,IAAI,CA9B/B,kBACA,sBACA,QACA,YACA,WACA,UACA,WACA,UACA,QACA,WACA,iBACA,SACA,QACA,QACA,OACA,WACA,QACA,WACA,aACA,OACA,cACA,WACA,WACA,WACA,aAoIJ,IA+KIoJ,EAnFJ,SAASC,EAAkBnC,EAAWoC,GAClC,MAAMjB,EAAKnB,EAAUmB,GACD,OAAhBA,EAAGM,YA9vBX,SAAgCtJ,GAC5B,MAAMkK,EAAW,GACXC,EAAU,GAChBjC,EAAiBjI,SAASmK,IAA0B,IAApBpK,EAAIqK,QAAQD,GAAYF,EAASjH,KAAKmH,GAAKD,EAAQlH,KAAKmH,KACxFD,EAAQlK,SAASmK,GAAMA,MACvBlC,EAAmBgC,CACvB,CAyvBQI,CAAuBtB,EAAGU,cAC1B3J,EAAQiJ,EAAGuB,YACXvB,EAAGM,UAAYN,EAAGM,SAASkB,EAAEP,GAG7BjB,EAAGuB,WAAavB,EAAGM,SAAW,KAC9BN,EAAGS,IAAM,GAEjB,CASA,SAASgB,EAAK5C,EAAW9G,EAAS2J,EAAUC,EAAiBC,EAAWC,EAAOC,EAAetB,EAAQ,EAAE,IACpG,MAAMuB,EAAmBpD,EACzBC,EAAsBC,GACtB,MAAMmB,EAAKnB,EAAUmB,GAAK,CACtBM,SAAU,KACVG,IAAK,GAELoB,QACA9B,OAAQ5J,EACRyL,YACAI,MAAOpL,IAEPqL,SAAU,GACVV,WAAY,GACZW,cAAe,GACf3B,cAAe,GACfG,aAAc,GACdyB,QAAS,IAAIzD,IAAI3G,EAAQoK,UAAYJ,EAAmBA,EAAiB/B,GAAGmC,QAAU,KAEtFC,UAAWxL,IACX4J,QACA6B,YAAY,EACZC,KAAMvK,EAAQgB,QAAUgJ,EAAiB/B,GAAGsC,MAEhDR,GAAiBA,EAAc9B,EAAGsC,MAClC,IAAIC,GAAQ,EAkBZ,GAjBAvC,EAAGS,IAAMiB,EACHA,EAAS7C,EAAW9G,EAAQ8J,OAAS,CAAC,GAAG,CAAC9H,EAAGyI,KAAQC,KACnD,MAAMnJ,EAAQmJ,EAAK/K,OAAS+K,EAAK,GAAKD,EAOtC,OANIxC,EAAGS,KAAOmB,EAAU5B,EAAGS,IAAI1G,GAAIiG,EAAGS,IAAI1G,GAAKT,MACtC0G,EAAGqC,YAAcrC,EAAGgC,MAAMjI,IAC3BiG,EAAGgC,MAAMjI,GAAGT,GACZiJ,GAxCpB,SAAoB1D,EAAW9E,IACI,IAA3B8E,EAAUmB,GAAGQ,MAAM,KACnBxB,EAAiB/E,KAAK4E,GACtBW,IACAX,EAAUmB,GAAGQ,MAAMkC,KAAK,IAE5B7D,EAAUmB,GAAGQ,MAAOzG,EAAI,GAAM,IAAO,GAAMA,EAAI,EACnD,CAkCoB4I,CAAW9D,EAAW9E,IAEvByI,CAAG,IAEZ,GACNxC,EAAGD,SACHwC,GAAQ,EACRxL,EAAQiJ,EAAGO,eAEXP,EAAGM,WAAWqB,GAAkBA,EAAgB3B,EAAGS,KAC/C1I,EAAQgB,OAAQ,CAChB,GAAIhB,EAAQ6K,QAAS,CAt4DzB3J,GAAe,EAw4DP,MAAMiE,EAAQvD,EAAS5B,EAAQgB,QAE/BiH,EAAGM,UAAYN,EAAGM,SAASuC,EAAE3F,GAC7BA,EAAMjG,QAAQ2E,EAClB,MAGIoE,EAAGM,UAAYN,EAAGM,SAASc,IAE3BrJ,EAAQ+K,OACRlC,EAAc/B,EAAUmB,GAAGM,UAnGvC,SAAyBzB,EAAW9F,EAAQoC,EAAQ4H,GAChD,MAAM,SAAEzC,EAAQ,aAAEI,GAAiB7B,EAAUmB,GAC7CM,GAAYA,EAASpG,EAAEnB,EAAQoC,GAC1B4H,GAEDpD,GAAoB,KAChB,MAAMqD,EAAiBnE,EAAUmB,GAAGiC,SAASgB,IAAIvM,GAAKwM,OAAOhM,GAIzD2H,EAAUmB,GAAGuB,WACb1C,EAAUmB,GAAGuB,WAAWtH,QAAQ+I,GAKhCjM,EAAQiM,GAEZnE,EAAUmB,GAAGiC,SAAW,EAAE,IAGlCvB,EAAazJ,QAAQ0I,EACzB,CA8EQwD,CAAgBtE,EAAW9G,EAAQgB,OAAQhB,EAAQoD,OAAQpD,EAAQgL,eAh5DvE9J,GAAe,EAk5DXyG,GACJ,CACAd,EAAsBmD,EAC1B,CAE2B,mBAAhBqB,cACPrC,EAAgB,cAAcqC,YAC1B,WAAAtL,GACIuL,QACA/M,KAAKgN,aAAa,CAAEC,KAAM,QAC9B,CACA,iBAAAC,GACI,MAAM,SAAEvB,GAAa3L,KAAK0J,GAC1B1J,KAAK0J,GAAGkC,cAAgBD,EAASgB,IAAIvM,GAAKwM,OAAOhM,GAEjD,IAAK,MAAMmC,KAAO/C,KAAK0J,GAAGyD,QAEtBnN,KAAKoF,YAAYpF,KAAK0J,GAAGyD,QAAQpK,GAEzC,CACA,wBAAAqK,CAAyBhH,EAAMiH,EAAWC,GACtCtN,KAAKoG,GAAQkH,CACjB,CACA,oBAAAC,GACI9M,EAAQT,KAAK0J,GAAGkC,cACpB,CACA,QAAA4B,GACI9C,EAAkB1K,KAAM,GACxBA,KAAKwN,SAAW3N,CACpB,CACA,GAAA4N,CAAIC,EAAM9D,GAEN,IAAKhJ,EAAYgJ,GACb,OAAO/J,EAEX,MAAMiM,EAAa9L,KAAK0J,GAAGoC,UAAU4B,KAAU1N,KAAK0J,GAAGoC,UAAU4B,GAAQ,IAEzE,OADA5B,EAAUnI,KAAKiG,GACR,KACH,MAAM+D,EAAQ7B,EAAUf,QAAQnB,IACjB,IAAX+D,GACA7B,EAAUvE,OAAOoG,EAAO,EAAE,CAEtC,CACA,IAAAC,CAAKC,GACG7N,KAAK8N,QAAU7M,EAAS4M,KACxB7N,KAAK0J,GAAGqC,YAAa,EACrB/L,KAAK8N,MAAMD,GACX7N,KAAK0J,GAAGqC,YAAa,EAE7B,IAMR,MAAMgC,EACF,QAAAP,GACI9C,EAAkB1K,KAAM,GACxBA,KAAKwN,SAAW3N,CACpB,CACA,GAAA4N,CAAIC,EAAM9D,GACN,IAAKhJ,EAAYgJ,GACb,OAAO/J,EAEX,MAAMiM,EAAa9L,KAAK0J,GAAGoC,UAAU4B,KAAU1N,KAAK0J,GAAGoC,UAAU4B,GAAQ,IAEzE,OADA5B,EAAUnI,KAAKiG,GACR,KACH,MAAM+D,EAAQ7B,EAAUf,QAAQnB,IACjB,IAAX+D,GACA7B,EAAUvE,OAAOoG,EAAO,EAAE,CAEtC,CACA,IAAAC,CAAKC,GACG7N,KAAK8N,QAAU7M,EAAS4M,KACxB7N,KAAK0J,GAAGqC,YAAa,EACrB/L,KAAK8N,MAAMD,GACX7N,KAAK0J,GAAGqC,YAAa,EAE7B,EEluEG,MAIMiC,EAAe,6P,4EC6ChB,sD,8BAIL,e,wFAJK,sD,mHAIL,e,4QALL3I,EAEI5C,EAAAqB,EAAAe,GADF3B,EAAoEY,EAAAmK,G,gBAEtE5I,EAIM5C,EAAAyL,EAAArJ,GAHJ3B,EAECgL,EAAAnN,G,OADamC,EAAiEnC,EAAAoN,G,YAApBH,E,kBADhCI,G,gIAZxB,wB,+BAGA,c,+BAEe,W,6GALf,wB,6HAGA,c,6HAEe,W,2dAPpB/I,EAQM5C,EAAAyL,EAAArJ,GAPJ3B,EAECgL,EAAAG,G,OADsBnL,EAAiEmL,EAAAC,G,YAApBN,E,OAEpE9K,EAECgL,EAAAK,G,OADYrL,EAAiEqL,EAAAC,G,YAApBR,E,OAE1D9K,EAA8FgL,EAAAO,G,OAArEvL,EAAiEuL,EAAAC,G,YAApBV,C,gEARpE7D,EAAgB,GAUZA,EAAgB,IAAIA,EAAO,GAAAwE,O,EAVfC,C,sOARXR,EAAYlO,GAAC,IAAA2O,EACpB3O,EAAE4O,iBACI,OAAND,EAAA1O,SAAA0O,EAAQE,SAAS,EAAG,G,MACdC,EAAKvJ,SAASwJ,iBAAiB,MAAM,GACzC,MAAFD,GAAAA,EAAIE,MAAM,CAAEC,eAAe,G,yCA9BlBC,GAAmB,GAAKvB,EAE/BwB,GAAU,EHonChB,IAAiBhP,E,OAAAA,EGnnCP,K,IACD+O,E,aAGCE,EAAW,IAAIC,sBAClBhN,I,UACYC,KAASD,EACdC,EAAMgN,gB,IACRH,GAAU,E,IAKdI,UAAW,EACXC,WAAY,wBAGVC,EAAUlK,SAASwJ,iBAAiB,wB,UAC/BW,KAAUD,EACnBL,EAASzN,QAAQ+N,E,EHimCnBpH,IAAwBkB,GAAGiC,SAAShI,KAAKtD,G,6JIvnC7C,MAAMwP,GCDI,GDCgBC,yBAAc,kBCHmBC,GDGJC,UCFjB,IAAGD,GAAQE,MAAM,KAAK,KAAO,KAD5D,IAAoDF,GDK3D,MAAMG,WAAmBpD,YACvBI,iBAAAA,GEHa,IAAiBiD,EAAI5E,EAAJ4E,EFIpBnQ,KEJwBuL,EFIlBvL,KAAKoQ,eEHd,IAAIC,GAAI,CACb5N,OAAQ0N,EACR7D,SAAS,EACTf,SFCF,CAEA,kBAAI6E,GACF,OAAOpQ,KAAKsQ,QAAQF,eAAiBG,KAAKC,MAAMxQ,KAAKsQ,QAAQF,gBAAkB,IACjF,EAGGK,eAAe/N,IAAImN,KACtBY,eAAeC,OAAOb,GAAKK,G","sources":["webpack://dh-to-virkeligheter/webpack/bootstrap","webpack://dh-to-virkeligheter/./node_modules/svelte/internal/index.mjs","webpack://dh-to-virkeligheter/webpack/runtime/global","webpack://dh-to-virkeligheter/./node_modules/@nrk/core-icons/core-icons.mjs","webpack://dh-to-virkeligheter/ankerlenker.svelte","webpack://dh-to-virkeligheter/./src/moduler-geopolitisk/ankerlenker/client.ts","webpack://dh-to-virkeligheter/./src/lib/get-element-tag.ts","webpack://dh-to-virkeligheter/./src/moduler-geopolitisk/ankerlenker/components/hydrate.js"],"sourcesContent":["// The require scope\nvar __webpack_require__ = {};\n\n","function noop() { }\nconst identity = x => x;\nfunction assign(tar, src) {\n // @ts-ignore\n for (const k in src)\n tar[k] = src[k];\n return tar;\n}\n// Adapted from https://github.com/then/is-promise/blob/master/index.js\n// Distributed under MIT License https://github.com/then/is-promise/blob/master/LICENSE\nfunction is_promise(value) {\n return !!value && (typeof value === 'object' || typeof value === 'function') && typeof value.then === 'function';\n}\nfunction add_location(element, file, line, column, char) {\n element.__svelte_meta = {\n loc: { file, line, column, char }\n };\n}\nfunction run(fn) {\n return fn();\n}\nfunction blank_object() {\n return Object.create(null);\n}\nfunction run_all(fns) {\n fns.forEach(run);\n}\nfunction is_function(thing) {\n return typeof thing === 'function';\n}\nfunction safe_not_equal(a, b) {\n return a != a ? b == b : a !== b || ((a && typeof a === 'object') || typeof a === 'function');\n}\nlet src_url_equal_anchor;\nfunction src_url_equal(element_src, url) {\n if (!src_url_equal_anchor) {\n src_url_equal_anchor = document.createElement('a');\n }\n src_url_equal_anchor.href = url;\n return element_src === src_url_equal_anchor.href;\n}\nfunction not_equal(a, b) {\n return a != a ? b == b : a !== b;\n}\nfunction is_empty(obj) {\n return Object.keys(obj).length === 0;\n}\nfunction validate_store(store, name) {\n if (store != null && typeof store.subscribe !== 'function') {\n throw new Error(`'${name}' is not a store with a 'subscribe' method`);\n }\n}\nfunction subscribe(store, ...callbacks) {\n if (store == null) {\n return noop;\n }\n const unsub = store.subscribe(...callbacks);\n return unsub.unsubscribe ? () => unsub.unsubscribe() : unsub;\n}\nfunction get_store_value(store) {\n let value;\n subscribe(store, _ => value = _)();\n return value;\n}\nfunction component_subscribe(component, store, callback) {\n component.$$.on_destroy.push(subscribe(store, callback));\n}\nfunction create_slot(definition, ctx, $$scope, fn) {\n if (definition) {\n const slot_ctx = get_slot_context(definition, ctx, $$scope, fn);\n return definition[0](slot_ctx);\n }\n}\nfunction get_slot_context(definition, ctx, $$scope, fn) {\n return definition[1] && fn\n ? assign($$scope.ctx.slice(), definition[1](fn(ctx)))\n : $$scope.ctx;\n}\nfunction get_slot_changes(definition, $$scope, dirty, fn) {\n if (definition[2] && fn) {\n const lets = definition[2](fn(dirty));\n if ($$scope.dirty === undefined) {\n return lets;\n }\n if (typeof lets === 'object') {\n const merged = [];\n const len = Math.max($$scope.dirty.length, lets.length);\n for (let i = 0; i < len; i += 1) {\n merged[i] = $$scope.dirty[i] | lets[i];\n }\n return merged;\n }\n return $$scope.dirty | lets;\n }\n return $$scope.dirty;\n}\nfunction update_slot_base(slot, slot_definition, ctx, $$scope, slot_changes, get_slot_context_fn) {\n if (slot_changes) {\n const slot_context = get_slot_context(slot_definition, ctx, $$scope, get_slot_context_fn);\n slot.p(slot_context, slot_changes);\n }\n}\nfunction update_slot(slot, slot_definition, ctx, $$scope, dirty, get_slot_changes_fn, get_slot_context_fn) {\n const slot_changes = get_slot_changes(slot_definition, $$scope, dirty, get_slot_changes_fn);\n update_slot_base(slot, slot_definition, ctx, $$scope, slot_changes, get_slot_context_fn);\n}\nfunction get_all_dirty_from_scope($$scope) {\n if ($$scope.ctx.length > 32) {\n const dirty = [];\n const length = $$scope.ctx.length / 32;\n for (let i = 0; i < length; i++) {\n dirty[i] = -1;\n }\n return dirty;\n }\n return -1;\n}\nfunction exclude_internal_props(props) {\n const result = {};\n for (const k in props)\n if (k[0] !== '$')\n result[k] = props[k];\n return result;\n}\nfunction compute_rest_props(props, keys) {\n const rest = {};\n keys = new Set(keys);\n for (const k in props)\n if (!keys.has(k) && k[0] !== '$')\n rest[k] = props[k];\n return rest;\n}\nfunction compute_slots(slots) {\n const result = {};\n for (const key in slots) {\n result[key] = true;\n }\n return result;\n}\nfunction once(fn) {\n let ran = false;\n return function (...args) {\n if (ran)\n return;\n ran = true;\n fn.call(this, ...args);\n };\n}\nfunction null_to_empty(value) {\n return value == null ? '' : value;\n}\nfunction set_store_value(store, ret, value) {\n store.set(value);\n return ret;\n}\nconst has_prop = (obj, prop) => Object.prototype.hasOwnProperty.call(obj, prop);\nfunction action_destroyer(action_result) {\n return action_result && is_function(action_result.destroy) ? action_result.destroy : noop;\n}\nfunction split_css_unit(value) {\n const split = typeof value === 'string' && value.match(/^\\s*(-?[\\d.]+)([^\\s]*)\\s*$/);\n return split ? [parseFloat(split[1]), split[2] || 'px'] : [value, 'px'];\n}\nconst contenteditable_truthy_values = ['', true, 1, 'true', 'contenteditable'];\n\nconst is_client = typeof window !== 'undefined';\nlet now = is_client\n ? () => window.performance.now()\n : () => Date.now();\nlet raf = is_client ? cb => requestAnimationFrame(cb) : noop;\n// used internally for testing\nfunction set_now(fn) {\n now = fn;\n}\nfunction set_raf(fn) {\n raf = fn;\n}\n\nconst tasks = new Set();\nfunction run_tasks(now) {\n tasks.forEach(task => {\n if (!task.c(now)) {\n tasks.delete(task);\n task.f();\n }\n });\n if (tasks.size !== 0)\n raf(run_tasks);\n}\n/**\n * For testing purposes only!\n */\nfunction clear_loops() {\n tasks.clear();\n}\n/**\n * Creates a new task that runs on each raf frame\n * until it returns a falsy value or is aborted\n */\nfunction loop(callback) {\n let task;\n if (tasks.size === 0)\n raf(run_tasks);\n return {\n promise: new Promise(fulfill => {\n tasks.add(task = { c: callback, f: fulfill });\n }),\n abort() {\n tasks.delete(task);\n }\n };\n}\n\nconst globals = (typeof window !== 'undefined'\n ? window\n : typeof globalThis !== 'undefined'\n ? globalThis\n : global);\n\n/**\n * Resize observer singleton.\n * One listener per element only!\n * https://groups.google.com/a/chromium.org/g/blink-dev/c/z6ienONUb5A/m/F5-VcUZtBAAJ\n */\nclass ResizeObserverSingleton {\n constructor(options) {\n this.options = options;\n this._listeners = 'WeakMap' in globals ? new WeakMap() : undefined;\n }\n observe(element, listener) {\n this._listeners.set(element, listener);\n this._getObserver().observe(element, this.options);\n return () => {\n this._listeners.delete(element);\n this._observer.unobserve(element); // this line can probably be removed\n };\n }\n _getObserver() {\n var _a;\n return (_a = this._observer) !== null && _a !== void 0 ? _a : (this._observer = new ResizeObserver((entries) => {\n var _a;\n for (const entry of entries) {\n ResizeObserverSingleton.entries.set(entry.target, entry);\n (_a = this._listeners.get(entry.target)) === null || _a === void 0 ? void 0 : _a(entry);\n }\n }));\n }\n}\n// Needs to be written like this to pass the tree-shake-test\nResizeObserverSingleton.entries = 'WeakMap' in globals ? new WeakMap() : undefined;\n\n// Track which nodes are claimed during hydration. Unclaimed nodes can then be removed from the DOM\n// at the end of hydration without touching the remaining nodes.\nlet is_hydrating = false;\nfunction start_hydrating() {\n is_hydrating = true;\n}\nfunction end_hydrating() {\n is_hydrating = false;\n}\nfunction upper_bound(low, high, key, value) {\n // Return first index of value larger than input value in the range [low, high)\n while (low < high) {\n const mid = low + ((high - low) >> 1);\n if (key(mid) <= value) {\n low = mid + 1;\n }\n else {\n high = mid;\n }\n }\n return low;\n}\nfunction init_hydrate(target) {\n if (target.hydrate_init)\n return;\n target.hydrate_init = true;\n // We know that all children have claim_order values since the unclaimed have been detached if target is not \n let children = target.childNodes;\n // If target is , there may be children without claim_order\n if (target.nodeName === 'HEAD') {\n const myChildren = [];\n for (let i = 0; i < children.length; i++) {\n const node = children[i];\n if (node.claim_order !== undefined) {\n myChildren.push(node);\n }\n }\n children = myChildren;\n }\n /*\n * Reorder claimed children optimally.\n * We can reorder claimed children optimally by finding the longest subsequence of\n * nodes that are already claimed in order and only moving the rest. The longest\n * subsequence of nodes that are claimed in order can be found by\n * computing the longest increasing subsequence of .claim_order values.\n *\n * This algorithm is optimal in generating the least amount of reorder operations\n * possible.\n *\n * Proof:\n * We know that, given a set of reordering operations, the nodes that do not move\n * always form an increasing subsequence, since they do not move among each other\n * meaning that they must be already ordered among each other. Thus, the maximal\n * set of nodes that do not move form a longest increasing subsequence.\n */\n // Compute longest increasing subsequence\n // m: subsequence length j => index k of smallest value that ends an increasing subsequence of length j\n const m = new Int32Array(children.length + 1);\n // Predecessor indices + 1\n const p = new Int32Array(children.length);\n m[0] = -1;\n let longest = 0;\n for (let i = 0; i < children.length; i++) {\n const current = children[i].claim_order;\n // Find the largest subsequence length such that it ends in a value less than our current value\n // upper_bound returns first greater value, so we subtract one\n // with fast path for when we are on the current longest subsequence\n const seqLen = ((longest > 0 && children[m[longest]].claim_order <= current) ? longest + 1 : upper_bound(1, longest, idx => children[m[idx]].claim_order, current)) - 1;\n p[i] = m[seqLen] + 1;\n const newLen = seqLen + 1;\n // We can guarantee that current is the smallest value. Otherwise, we would have generated a longer sequence.\n m[newLen] = i;\n longest = Math.max(newLen, longest);\n }\n // The longest increasing subsequence of nodes (initially reversed)\n const lis = [];\n // The rest of the nodes, nodes that will be moved\n const toMove = [];\n let last = children.length - 1;\n for (let cur = m[longest] + 1; cur != 0; cur = p[cur - 1]) {\n lis.push(children[cur - 1]);\n for (; last >= cur; last--) {\n toMove.push(children[last]);\n }\n last--;\n }\n for (; last >= 0; last--) {\n toMove.push(children[last]);\n }\n lis.reverse();\n // We sort the nodes being moved to guarantee that their insertion order matches the claim order\n toMove.sort((a, b) => a.claim_order - b.claim_order);\n // Finally, we move the nodes\n for (let i = 0, j = 0; i < toMove.length; i++) {\n while (j < lis.length && toMove[i].claim_order >= lis[j].claim_order) {\n j++;\n }\n const anchor = j < lis.length ? lis[j] : null;\n target.insertBefore(toMove[i], anchor);\n }\n}\nfunction append(target, node) {\n target.appendChild(node);\n}\nfunction append_styles(target, style_sheet_id, styles) {\n const append_styles_to = get_root_for_style(target);\n if (!append_styles_to.getElementById(style_sheet_id)) {\n const style = element('style');\n style.id = style_sheet_id;\n style.textContent = styles;\n append_stylesheet(append_styles_to, style);\n }\n}\nfunction get_root_for_style(node) {\n if (!node)\n return document;\n const root = node.getRootNode ? node.getRootNode() : node.ownerDocument;\n if (root && root.host) {\n return root;\n }\n return node.ownerDocument;\n}\nfunction append_empty_stylesheet(node) {\n const style_element = element('style');\n append_stylesheet(get_root_for_style(node), style_element);\n return style_element.sheet;\n}\nfunction append_stylesheet(node, style) {\n append(node.head || node, style);\n return style.sheet;\n}\nfunction append_hydration(target, node) {\n if (is_hydrating) {\n init_hydrate(target);\n if ((target.actual_end_child === undefined) || ((target.actual_end_child !== null) && (target.actual_end_child.parentNode !== target))) {\n target.actual_end_child = target.firstChild;\n }\n // Skip nodes of undefined ordering\n while ((target.actual_end_child !== null) && (target.actual_end_child.claim_order === undefined)) {\n target.actual_end_child = target.actual_end_child.nextSibling;\n }\n if (node !== target.actual_end_child) {\n // We only insert if the ordering of this node should be modified or the parent node is not target\n if (node.claim_order !== undefined || node.parentNode !== target) {\n target.insertBefore(node, target.actual_end_child);\n }\n }\n else {\n target.actual_end_child = node.nextSibling;\n }\n }\n else if (node.parentNode !== target || node.nextSibling !== null) {\n target.appendChild(node);\n }\n}\nfunction insert(target, node, anchor) {\n target.insertBefore(node, anchor || null);\n}\nfunction insert_hydration(target, node, anchor) {\n if (is_hydrating && !anchor) {\n append_hydration(target, node);\n }\n else if (node.parentNode !== target || node.nextSibling != anchor) {\n target.insertBefore(node, anchor || null);\n }\n}\nfunction detach(node) {\n if (node.parentNode) {\n node.parentNode.removeChild(node);\n }\n}\nfunction destroy_each(iterations, detaching) {\n for (let i = 0; i < iterations.length; i += 1) {\n if (iterations[i])\n iterations[i].d(detaching);\n }\n}\nfunction element(name) {\n return document.createElement(name);\n}\nfunction element_is(name, is) {\n return document.createElement(name, { is });\n}\nfunction object_without_properties(obj, exclude) {\n const target = {};\n for (const k in obj) {\n if (has_prop(obj, k)\n // @ts-ignore\n && exclude.indexOf(k) === -1) {\n // @ts-ignore\n target[k] = obj[k];\n }\n }\n return target;\n}\nfunction svg_element(name) {\n return document.createElementNS('http://www.w3.org/2000/svg', name);\n}\nfunction text(data) {\n return document.createTextNode(data);\n}\nfunction space() {\n return text(' ');\n}\nfunction empty() {\n return text('');\n}\nfunction comment(content) {\n return document.createComment(content);\n}\nfunction listen(node, event, handler, options) {\n node.addEventListener(event, handler, options);\n return () => node.removeEventListener(event, handler, options);\n}\nfunction prevent_default(fn) {\n return function (event) {\n event.preventDefault();\n // @ts-ignore\n return fn.call(this, event);\n };\n}\nfunction stop_propagation(fn) {\n return function (event) {\n event.stopPropagation();\n // @ts-ignore\n return fn.call(this, event);\n };\n}\nfunction stop_immediate_propagation(fn) {\n return function (event) {\n event.stopImmediatePropagation();\n // @ts-ignore\n return fn.call(this, event);\n };\n}\nfunction self(fn) {\n return function (event) {\n // @ts-ignore\n if (event.target === this)\n fn.call(this, event);\n };\n}\nfunction trusted(fn) {\n return function (event) {\n // @ts-ignore\n if (event.isTrusted)\n fn.call(this, event);\n };\n}\nfunction attr(node, attribute, value) {\n if (value == null)\n node.removeAttribute(attribute);\n else if (node.getAttribute(attribute) !== value)\n node.setAttribute(attribute, value);\n}\n/**\n * List of attributes that should always be set through the attr method,\n * because updating them through the property setter doesn't work reliably.\n * In the example of `width`/`height`, the problem is that the setter only\n * accepts numeric values, but the attribute can also be set to a string like `50%`.\n * If this list becomes too big, rethink this approach.\n */\nconst always_set_through_set_attribute = ['width', 'height'];\nfunction set_attributes(node, attributes) {\n // @ts-ignore\n const descriptors = Object.getOwnPropertyDescriptors(node.__proto__);\n for (const key in attributes) {\n if (attributes[key] == null) {\n node.removeAttribute(key);\n }\n else if (key === 'style') {\n node.style.cssText = attributes[key];\n }\n else if (key === '__value') {\n node.value = node[key] = attributes[key];\n }\n else if (descriptors[key] && descriptors[key].set && always_set_through_set_attribute.indexOf(key) === -1) {\n node[key] = attributes[key];\n }\n else {\n attr(node, key, attributes[key]);\n }\n }\n}\nfunction set_svg_attributes(node, attributes) {\n for (const key in attributes) {\n attr(node, key, attributes[key]);\n }\n}\nfunction set_custom_element_data_map(node, data_map) {\n Object.keys(data_map).forEach((key) => {\n set_custom_element_data(node, key, data_map[key]);\n });\n}\nfunction set_custom_element_data(node, prop, value) {\n if (prop in node) {\n node[prop] = typeof node[prop] === 'boolean' && value === '' ? true : value;\n }\n else {\n attr(node, prop, value);\n }\n}\nfunction set_dynamic_element_data(tag) {\n return (/-/.test(tag)) ? set_custom_element_data_map : set_attributes;\n}\nfunction xlink_attr(node, attribute, value) {\n node.setAttributeNS('http://www.w3.org/1999/xlink', attribute, value);\n}\nfunction get_binding_group_value(group, __value, checked) {\n const value = new Set();\n for (let i = 0; i < group.length; i += 1) {\n if (group[i].checked)\n value.add(group[i].__value);\n }\n if (!checked) {\n value.delete(__value);\n }\n return Array.from(value);\n}\nfunction init_binding_group(group) {\n let _inputs;\n return {\n /* push */ p(...inputs) {\n _inputs = inputs;\n _inputs.forEach(input => group.push(input));\n },\n /* remove */ r() {\n _inputs.forEach(input => group.splice(group.indexOf(input), 1));\n }\n };\n}\nfunction init_binding_group_dynamic(group, indexes) {\n let _group = get_binding_group(group);\n let _inputs;\n function get_binding_group(group) {\n for (let i = 0; i < indexes.length; i++) {\n group = group[indexes[i]] = group[indexes[i]] || [];\n }\n return group;\n }\n function push() {\n _inputs.forEach(input => _group.push(input));\n }\n function remove() {\n _inputs.forEach(input => _group.splice(_group.indexOf(input), 1));\n }\n return {\n /* update */ u(new_indexes) {\n indexes = new_indexes;\n const new_group = get_binding_group(group);\n if (new_group !== _group) {\n remove();\n _group = new_group;\n push();\n }\n },\n /* push */ p(...inputs) {\n _inputs = inputs;\n push();\n },\n /* remove */ r: remove\n };\n}\nfunction to_number(value) {\n return value === '' ? null : +value;\n}\nfunction time_ranges_to_array(ranges) {\n const array = [];\n for (let i = 0; i < ranges.length; i += 1) {\n array.push({ start: ranges.start(i), end: ranges.end(i) });\n }\n return array;\n}\nfunction children(element) {\n return Array.from(element.childNodes);\n}\nfunction init_claim_info(nodes) {\n if (nodes.claim_info === undefined) {\n nodes.claim_info = { last_index: 0, total_claimed: 0 };\n }\n}\nfunction claim_node(nodes, predicate, processNode, createNode, dontUpdateLastIndex = false) {\n // Try to find nodes in an order such that we lengthen the longest increasing subsequence\n init_claim_info(nodes);\n const resultNode = (() => {\n // We first try to find an element after the previous one\n for (let i = nodes.claim_info.last_index; i < nodes.length; i++) {\n const node = nodes[i];\n if (predicate(node)) {\n const replacement = processNode(node);\n if (replacement === undefined) {\n nodes.splice(i, 1);\n }\n else {\n nodes[i] = replacement;\n }\n if (!dontUpdateLastIndex) {\n nodes.claim_info.last_index = i;\n }\n return node;\n }\n }\n // Otherwise, we try to find one before\n // We iterate in reverse so that we don't go too far back\n for (let i = nodes.claim_info.last_index - 1; i >= 0; i--) {\n const node = nodes[i];\n if (predicate(node)) {\n const replacement = processNode(node);\n if (replacement === undefined) {\n nodes.splice(i, 1);\n }\n else {\n nodes[i] = replacement;\n }\n if (!dontUpdateLastIndex) {\n nodes.claim_info.last_index = i;\n }\n else if (replacement === undefined) {\n // Since we spliced before the last_index, we decrease it\n nodes.claim_info.last_index--;\n }\n return node;\n }\n }\n // If we can't find any matching node, we create a new one\n return createNode();\n })();\n resultNode.claim_order = nodes.claim_info.total_claimed;\n nodes.claim_info.total_claimed += 1;\n return resultNode;\n}\nfunction claim_element_base(nodes, name, attributes, create_element) {\n return claim_node(nodes, (node) => node.nodeName === name, (node) => {\n const remove = [];\n for (let j = 0; j < node.attributes.length; j++) {\n const attribute = node.attributes[j];\n if (!attributes[attribute.name]) {\n remove.push(attribute.name);\n }\n }\n remove.forEach(v => node.removeAttribute(v));\n return undefined;\n }, () => create_element(name));\n}\nfunction claim_element(nodes, name, attributes) {\n return claim_element_base(nodes, name, attributes, element);\n}\nfunction claim_svg_element(nodes, name, attributes) {\n return claim_element_base(nodes, name, attributes, svg_element);\n}\nfunction claim_text(nodes, data) {\n return claim_node(nodes, (node) => node.nodeType === 3, (node) => {\n const dataStr = '' + data;\n if (node.data.startsWith(dataStr)) {\n if (node.data.length !== dataStr.length) {\n return node.splitText(dataStr.length);\n }\n }\n else {\n node.data = dataStr;\n }\n }, () => text(data), true // Text nodes should not update last index since it is likely not worth it to eliminate an increasing subsequence of actual elements\n );\n}\nfunction claim_space(nodes) {\n return claim_text(nodes, ' ');\n}\nfunction claim_comment(nodes, data) {\n return claim_node(nodes, (node) => node.nodeType === 8, (node) => {\n node.data = '' + data;\n return undefined;\n }, () => comment(data), true);\n}\nfunction find_comment(nodes, text, start) {\n for (let i = start; i < nodes.length; i += 1) {\n const node = nodes[i];\n if (node.nodeType === 8 /* comment node */ && node.textContent.trim() === text) {\n return i;\n }\n }\n return nodes.length;\n}\nfunction claim_html_tag(nodes, is_svg) {\n // find html opening tag\n const start_index = find_comment(nodes, 'HTML_TAG_START', 0);\n const end_index = find_comment(nodes, 'HTML_TAG_END', start_index);\n if (start_index === end_index) {\n return new HtmlTagHydration(undefined, is_svg);\n }\n init_claim_info(nodes);\n const html_tag_nodes = nodes.splice(start_index, end_index - start_index + 1);\n detach(html_tag_nodes[0]);\n detach(html_tag_nodes[html_tag_nodes.length - 1]);\n const claimed_nodes = html_tag_nodes.slice(1, html_tag_nodes.length - 1);\n for (const n of claimed_nodes) {\n n.claim_order = nodes.claim_info.total_claimed;\n nodes.claim_info.total_claimed += 1;\n }\n return new HtmlTagHydration(claimed_nodes, is_svg);\n}\nfunction set_data(text, data) {\n data = '' + data;\n if (text.data === data)\n return;\n text.data = data;\n}\nfunction set_data_contenteditable(text, data) {\n data = '' + data;\n if (text.wholeText === data)\n return;\n text.data = data;\n}\nfunction set_data_maybe_contenteditable(text, data, attr_value) {\n if (~contenteditable_truthy_values.indexOf(attr_value)) {\n set_data_contenteditable(text, data);\n }\n else {\n set_data(text, data);\n }\n}\nfunction set_input_value(input, value) {\n input.value = value == null ? '' : value;\n}\nfunction set_input_type(input, type) {\n try {\n input.type = type;\n }\n catch (e) {\n // do nothing\n }\n}\nfunction set_style(node, key, value, important) {\n if (value == null) {\n node.style.removeProperty(key);\n }\n else {\n node.style.setProperty(key, value, important ? 'important' : '');\n }\n}\nfunction select_option(select, value, mounting) {\n for (let i = 0; i < select.options.length; i += 1) {\n const option = select.options[i];\n if (option.__value === value) {\n option.selected = true;\n return;\n }\n }\n if (!mounting || value !== undefined) {\n select.selectedIndex = -1; // no option should be selected\n }\n}\nfunction select_options(select, value) {\n for (let i = 0; i < select.options.length; i += 1) {\n const option = select.options[i];\n option.selected = ~value.indexOf(option.__value);\n }\n}\nfunction select_value(select) {\n const selected_option = select.querySelector(':checked');\n return selected_option && selected_option.__value;\n}\nfunction select_multiple_value(select) {\n return [].map.call(select.querySelectorAll(':checked'), option => option.__value);\n}\n// unfortunately this can't be a constant as that wouldn't be tree-shakeable\n// so we cache the result instead\nlet crossorigin;\nfunction is_crossorigin() {\n if (crossorigin === undefined) {\n crossorigin = false;\n try {\n if (typeof window !== 'undefined' && window.parent) {\n void window.parent.document;\n }\n }\n catch (error) {\n crossorigin = true;\n }\n }\n return crossorigin;\n}\nfunction add_iframe_resize_listener(node, fn) {\n const computed_style = getComputedStyle(node);\n if (computed_style.position === 'static') {\n node.style.position = 'relative';\n }\n const iframe = element('iframe');\n iframe.setAttribute('style', 'display: block; position: absolute; top: 0; left: 0; width: 100%; height: 100%; ' +\n 'overflow: hidden; border: 0; opacity: 0; pointer-events: none; z-index: -1;');\n iframe.setAttribute('aria-hidden', 'true');\n iframe.tabIndex = -1;\n const crossorigin = is_crossorigin();\n let unsubscribe;\n if (crossorigin) {\n iframe.src = \"data:text/html,\";\n unsubscribe = listen(window, 'message', (event) => {\n if (event.source === iframe.contentWindow)\n fn();\n });\n }\n else {\n iframe.src = 'about:blank';\n iframe.onload = () => {\n unsubscribe = listen(iframe.contentWindow, 'resize', fn);\n // make sure an initial resize event is fired _after_ the iframe is loaded (which is asynchronous)\n // see https://github.com/sveltejs/svelte/issues/4233\n fn();\n };\n }\n append(node, iframe);\n return () => {\n if (crossorigin) {\n unsubscribe();\n }\n else if (unsubscribe && iframe.contentWindow) {\n unsubscribe();\n }\n detach(iframe);\n };\n}\nconst resize_observer_content_box = /* @__PURE__ */ new ResizeObserverSingleton({ box: 'content-box' });\nconst resize_observer_border_box = /* @__PURE__ */ new ResizeObserverSingleton({ box: 'border-box' });\nconst resize_observer_device_pixel_content_box = /* @__PURE__ */ new ResizeObserverSingleton({ box: 'device-pixel-content-box' });\nfunction toggle_class(element, name, toggle) {\n element.classList[toggle ? 'add' : 'remove'](name);\n}\nfunction custom_event(type, detail, { bubbles = false, cancelable = false } = {}) {\n const e = document.createEvent('CustomEvent');\n e.initCustomEvent(type, bubbles, cancelable, detail);\n return e;\n}\nfunction query_selector_all(selector, parent = document.body) {\n return Array.from(parent.querySelectorAll(selector));\n}\nfunction head_selector(nodeId, head) {\n const result = [];\n let started = 0;\n for (const node of head.childNodes) {\n if (node.nodeType === 8 /* comment node */) {\n const comment = node.textContent.trim();\n if (comment === `HEAD_${nodeId}_END`) {\n started -= 1;\n result.push(node);\n }\n else if (comment === `HEAD_${nodeId}_START`) {\n started += 1;\n result.push(node);\n }\n }\n else if (started > 0) {\n result.push(node);\n }\n }\n return result;\n}\nclass HtmlTag {\n constructor(is_svg = false) {\n this.is_svg = false;\n this.is_svg = is_svg;\n this.e = this.n = null;\n }\n c(html) {\n this.h(html);\n }\n m(html, target, anchor = null) {\n if (!this.e) {\n if (this.is_svg)\n this.e = svg_element(target.nodeName);\n /** #7364 target for