{"version":3,"file":"vendors/vendors-main-ShadowTreeWalker.main.js.bundle.js","mappings":"2FAAA,IAAIA,EAA4B,EAAQ,OACpCC,EAA2B,EAAQ,KAGvC,SAASC,EAAeC,EAAGC,EAAGC,EAAGC,GAC/BC,OAAOC,eAAeL,EAAGC,EAAG,CAACK,IAAKJ,EAAGK,IAAKJ,EAAGK,YAAY,EAAMC,cAAc,GAC/E,CAEAV,EAAeW,EAAOC,QAAS,oBAAoB,IAAMC,IACzDb,EAAeW,EAAOC,QAAS,0BAA0B,IAAME,IAI/D,MAAMD,EACF,eAAIE,GACA,OAAOC,KAAKC,YAChB,CACA,eAAIF,CAAYG,GACZ,KAAK,EAAIpB,EAA0BqB,cAAcH,KAAKI,KAAMF,GAAO,MAAM,IAAIG,MAAM,4EACnF,MAAMC,EAAU,GAChB,IAAIC,EAAUL,EACVM,EAA2BN,EAE/B,IADAF,KAAKC,aAAeC,EACdK,GAAWA,IAAYP,KAAKI,SAASG,EAAQE,WAAaC,KAAKC,uBAAwB,CACzF,MAAMC,EAAaL,EACbM,EAASb,KAAKc,KAAKC,iBAAiBH,EAAYZ,KAAKgB,WAAY,CACnEC,WAAYjB,KAAKkB,cAErBZ,EAAQa,KAAKN,GACbA,EAAOd,YAAcS,EACrBR,KAAKoB,eAAeC,IAAIR,GACxBN,EAAUC,EAA2BI,EAAWU,IACpD,MAAOf,EAAUA,EAAQgB,WACzB,MAAMV,EAASb,KAAKc,KAAKC,iBAAiBf,KAAKI,KAAMJ,KAAKgB,WAAY,CAClEC,WAAYjB,KAAKkB,cAErBZ,EAAQa,KAAKN,GACbA,EAAOd,YAAcS,EACrBR,KAAKoB,eAAeC,IAAIR,GACxBb,KAAKwB,aAAelB,CACxB,CACA,OAAImB,GACA,OAAOzB,KAAKc,IAChB,CACA,UAAAY,GACI,IAAI3B,EAAcC,KAAKD,YACnB4B,EAAU3B,KAAK4B,WACnB,OAAK,EAAI9C,EAA0BqB,cAAcJ,EAAa4B,IAI1DA,IAAS3B,KAAKD,YAAc4B,GACzBA,IAJH3B,KAAKD,YAAcA,EACZ,KAIf,CACA,SAAA8B,GACI,IACIF,EADS3B,KAAKwB,aAAa,GACVK,YAErB,OADIF,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CACA,QAAAC,GACI,MAAMA,EAAW5B,KAAKwB,aAAa,GAAGI,WACtC,GAAIA,EAAU,CAEV,GADmBA,EAAShB,WACZ,CACZ,IAAIkB,EACJ,IAAIC,EAGJ,GAF2B,mBAAhB/B,KAAKgC,OAAuBD,EAAa/B,KAAKgC,OAAOJ,IACtB,QAAhCE,EAAe9B,KAAKgC,cAAqC,IAAjBF,OAA0B,EAASA,EAAab,cAAYc,EAAa/B,KAAKgC,OAAOf,WAAWW,IAC9IG,IAAeE,WAAWC,cAE1B,OADAlC,KAAKD,YAAc6B,EACZA,EAIX,IAAID,EAAU3B,KAAK4B,WAEnB,OADID,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CAEA,OADIC,IAAU5B,KAAKD,YAAc6B,GAC1BA,CACX,CACI,GAAI5B,KAAKwB,aAAaW,OAAS,EAAG,CAC9BnC,KAAKwB,aAAaY,QAClB,IAAIT,EAAU3B,KAAK4B,WAEnB,OADID,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CAAO,OAAO,IAEtB,CACA,YAAAU,GACI,MAAMC,EAAgBtC,KAAKwB,aAAa,GACxC,GAAIc,EAAcvC,cAAgBuC,EAAclC,KAAM,CAClD,GAAIJ,KAAKoB,eAAemB,IAAID,GAAgB,CAExC,GADAtC,KAAKoB,eAAeoB,OAAOF,GACvBtC,KAAKwB,aAAaW,OAAS,EAAG,CAC9BnC,KAAKwB,aAAaY,QAClB,IAAIT,EAAU3B,KAAKqC,eAEnB,OADIV,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CAAO,OAAO,IAClB,CACA,OAAO,IACX,CACA,MAAMU,EAAeC,EAAcD,eACnC,GAAIA,EAAc,CAEd,GADmBA,EAAazB,WAChB,CACZ,IAAIkB,EACJ,IAAIC,EAGJ,GAF2B,mBAAhB/B,KAAKgC,OAAuBD,EAAa/B,KAAKgC,OAAOK,IACtB,QAAhCP,EAAe9B,KAAKgC,cAAqC,IAAjBF,OAA0B,EAASA,EAAab,cAAYc,EAAa/B,KAAKgC,OAAOf,WAAWoB,IAC9IN,IAAeE,WAAWC,cAE1B,OADIG,IAAcrC,KAAKD,YAAcsC,GAC9BA,EAIX,IAAIV,EAAU3B,KAAK6B,YAEnB,OADIF,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CAEA,OADIU,IAAcrC,KAAKD,YAAcsC,GAC9BA,CACX,CACI,GAAIrC,KAAKwB,aAAaW,OAAS,EAAG,CAC9BnC,KAAKwB,aAAaY,QAClB,IAAIT,EAAU3B,KAAKqC,eAEnB,OADIV,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CAAO,OAAO,IAEtB,CAGI,WAAAc,GAIA,OAAO,IACX,CAGI,eAAAC,GAIA,OAAO,IACX,CAGI,UAAAnB,GAIA,OAAO,IACX,CACA,WAAAoB,CAAYlB,EAAKrB,EAAMY,EAAYgB,GAC/BhC,KAAKwB,aAAe,GACpBxB,KAAKoB,eAAiB,IAAIwB,IAC1B5C,KAAKkB,YAAehB,IAChB,GAAIA,EAAKO,WAAaC,KAAKmC,aAAc,CACrC,MAAMjC,EAAaV,EAAKU,WACxB,GAAIA,EAAY,CACZ,MAAMC,EAASb,KAAKc,KAAKC,iBAAiBH,EAAYZ,KAAKgB,WAAY,CACnEC,WAAYjB,KAAKkB,cAGrB,OADAlB,KAAKwB,aAAasB,QAAQjC,GACnBoB,WAAWC,aACtB,CACI,IAAIJ,EACJ,GAA2B,mBAAhB9B,KAAKgC,OAAuB,OAAOhC,KAAKgC,OAAO9B,GACrD,GAAqC,QAAhC4B,EAAe9B,KAAKgC,cAAqC,IAAjBF,OAA0B,EAASA,EAAab,WAAY,OAAOjB,KAAKgC,OAAOf,WAAWf,GACvI,GAAoB,OAAhBF,KAAKgC,OAAiB,OAAOC,WAAWC,aAEzD,CACA,OAAOD,WAAWc,WAAW,EAEjC/C,KAAKc,KAAOW,EACZzB,KAAKI,KAAOA,EACZJ,KAAKgC,OAASA,QAAuCA,EAAS,KAC9DhC,KAAKgB,WAAaA,QAA+CA,EAAaiB,WAAWe,SACzFhD,KAAKC,aAAeG,EACpBJ,KAAKwB,aAAasB,QAAQrB,EAAIV,iBAAiBX,EAAMY,EAAYhB,KAAKkB,cACtE,MAAMN,EAAaR,EAAKQ,WACxB,GAAIA,EAAY,CACZ,MAAMC,EAASb,KAAKc,KAAKC,iBAAiBH,EAAYZ,KAAKgB,WAAY,CACnEC,WAAYjB,KAAKkB,cAErBlB,KAAKwB,aAAasB,QAAQjC,EAC9B,CACJ,EAEJ,SAASf,EAA0C2B,EAAKrB,EAAMY,EAAYgB,GACtE,OAAI,EAAIjD,EAAyBkE,aAAqB,IAAIpD,EAA0C4B,EAAKrB,EAAMY,EAAYgB,GACpHP,EAAIV,iBAAiBX,EAAMY,EAAYgB,EAClD,C,kBCpMA,IAAIlD,EAA4B,EAAQ,OACpCC,EAA2B,EAAQ,KAGvC,SAASC,EAAeC,EAAGC,EAAGC,EAAGC,GAC/BC,OAAOC,eAAeL,EAAGC,EAAG,CAACK,IAAKJ,EAAGK,IAAKJ,EAAGK,YAAY,EAAMC,cAAc,GAC/E,CAEAV,EAAeW,EAAOC,QAAS,oBAAoB,IAAMC,IACzDb,EAAeW,EAAOC,QAAS,0BAA0B,IAAME,IAI/D,MAAMD,EACF,eAAIE,GACA,OAAOC,KAAKC,YAChB,CACA,eAAIF,CAAYG,GACZ,KAAK,EAAIpB,EAA0BqB,cAAcH,KAAKI,KAAMF,GAAO,MAAM,IAAIG,MAAM,4EACnF,MAAMC,EAAU,GAChB,IAAIC,EAAUL,EACVM,EAA2BN,EAE/B,IADAF,KAAKC,aAAeC,EACdK,GAAWA,IAAYP,KAAKI,SAASG,EAAQE,WAAaC,KAAKC,uBAAwB,CACzF,MAAMC,EAAaL,EACbM,EAASb,KAAKc,KAAKC,iBAAiBH,EAAYZ,KAAKgB,WAAY,CACnEC,WAAYjB,KAAKkB,cAErBZ,EAAQa,KAAKN,GACbA,EAAOd,YAAcS,EACrBR,KAAKoB,eAAeC,IAAIR,GACxBN,EAAUC,EAA2BI,EAAWU,IACpD,MAAOf,EAAUA,EAAQgB,WACzB,MAAMV,EAASb,KAAKc,KAAKC,iBAAiBf,KAAKI,KAAMJ,KAAKgB,WAAY,CAClEC,WAAYjB,KAAKkB,cAErBZ,EAAQa,KAAKN,GACbA,EAAOd,YAAcS,EACrBR,KAAKoB,eAAeC,IAAIR,GACxBb,KAAKwB,aAAelB,CACxB,CACA,OAAImB,GACA,OAAOzB,KAAKc,IAChB,CACA,UAAAY,GACI,IAAI3B,EAAcC,KAAKD,YACnB4B,EAAU3B,KAAK4B,WACnB,OAAK,EAAI9C,EAA0BqB,cAAcJ,EAAa4B,IAI1DA,IAAS3B,KAAKD,YAAc4B,GACzBA,IAJH3B,KAAKD,YAAcA,EACZ,KAIf,CACA,SAAA8B,GACI,IACIF,EADS3B,KAAKwB,aAAa,GACVK,YAErB,OADIF,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CACA,QAAAC,GACI,MAAMA,EAAW5B,KAAKwB,aAAa,GAAGI,WACtC,GAAIA,EAAU,CAEV,GADmBA,EAAShB,WACZ,CACZ,IAAIkB,EACJ,IAAIC,EAGJ,GAF2B,mBAAhB/B,KAAKgC,OAAuBD,EAAa/B,KAAKgC,OAAOJ,IACtB,QAAhCE,EAAe9B,KAAKgC,cAAqC,IAAjBF,OAA0B,EAASA,EAAab,cAAYc,EAAa/B,KAAKgC,OAAOf,WAAWW,IAC9IG,IAAeE,WAAWC,cAE1B,OADAlC,KAAKD,YAAc6B,EACZA,EAIX,IAAID,EAAU3B,KAAK4B,WAEnB,OADID,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CAEA,OADIC,IAAU5B,KAAKD,YAAc6B,GAC1BA,CACX,CACI,GAAI5B,KAAKwB,aAAaW,OAAS,EAAG,CAC9BnC,KAAKwB,aAAaY,QAClB,IAAIT,EAAU3B,KAAK4B,WAEnB,OADID,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CAAO,OAAO,IAEtB,CACA,YAAAU,GACI,MAAMC,EAAgBtC,KAAKwB,aAAa,GACxC,GAAIc,EAAcvC,cAAgBuC,EAAclC,KAAM,CAClD,GAAIJ,KAAKoB,eAAemB,IAAID,GAAgB,CAExC,GADAtC,KAAKoB,eAAeoB,OAAOF,GACvBtC,KAAKwB,aAAaW,OAAS,EAAG,CAC9BnC,KAAKwB,aAAaY,QAClB,IAAIT,EAAU3B,KAAKqC,eAEnB,OADIV,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CAAO,OAAO,IAClB,CACA,OAAO,IACX,CACA,MAAMU,EAAeC,EAAcD,eACnC,GAAIA,EAAc,CAEd,GADmBA,EAAazB,WAChB,CACZ,IAAIkB,EACJ,IAAIC,EAGJ,GAF2B,mBAAhB/B,KAAKgC,OAAuBD,EAAa/B,KAAKgC,OAAOK,IACtB,QAAhCP,EAAe9B,KAAKgC,cAAqC,IAAjBF,OAA0B,EAASA,EAAab,cAAYc,EAAa/B,KAAKgC,OAAOf,WAAWoB,IAC9IN,IAAeE,WAAWC,cAE1B,OADIG,IAAcrC,KAAKD,YAAcsC,GAC9BA,EAIX,IAAIV,EAAU3B,KAAK6B,YAEnB,OADIF,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CAEA,OADIU,IAAcrC,KAAKD,YAAcsC,GAC9BA,CACX,CACI,GAAIrC,KAAKwB,aAAaW,OAAS,EAAG,CAC9BnC,KAAKwB,aAAaY,QAClB,IAAIT,EAAU3B,KAAKqC,eAEnB,OADIV,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CAAO,OAAO,IAEtB,CAGI,WAAAc,GAIA,OAAO,IACX,CAGI,eAAAC,GAIA,OAAO,IACX,CAGI,UAAAnB,GAIA,OAAO,IACX,CACA,WAAAoB,CAAYlB,EAAKrB,EAAMY,EAAYgB,GAC/BhC,KAAKwB,aAAe,GACpBxB,KAAKoB,eAAiB,IAAIwB,IAC1B5C,KAAKkB,YAAehB,IAChB,GAAIA,EAAKO,WAAaC,KAAKmC,aAAc,CACrC,MAAMjC,EAAaV,EAAKU,WACxB,GAAIA,EAAY,CACZ,MAAMC,EAASb,KAAKc,KAAKC,iBAAiBH,EAAYZ,KAAKgB,WAAY,CACnEC,WAAYjB,KAAKkB,cAGrB,OADAlB,KAAKwB,aAAasB,QAAQjC,GACnBoB,WAAWC,aACtB,CACI,IAAIJ,EACJ,GAA2B,mBAAhB9B,KAAKgC,OAAuB,OAAOhC,KAAKgC,OAAO9B,GACrD,GAAqC,QAAhC4B,EAAe9B,KAAKgC,cAAqC,IAAjBF,OAA0B,EAASA,EAAab,WAAY,OAAOjB,KAAKgC,OAAOf,WAAWf,GACvI,GAAoB,OAAhBF,KAAKgC,OAAiB,OAAOC,WAAWC,aAEzD,CACA,OAAOD,WAAWc,WAAW,EAEjC/C,KAAKc,KAAOW,EACZzB,KAAKI,KAAOA,EACZJ,KAAKgC,OAASA,QAAuCA,EAAS,KAC9DhC,KAAKgB,WAAaA,QAA+CA,EAAaiB,WAAWe,SACzFhD,KAAKC,aAAeG,EACpBJ,KAAKwB,aAAasB,QAAQrB,EAAIV,iBAAiBX,EAAMY,EAAYhB,KAAKkB,cACtE,MAAMN,EAAaR,EAAKQ,WACxB,GAAIA,EAAY,CACZ,MAAMC,EAASb,KAAKc,KAAKC,iBAAiBH,EAAYZ,KAAKgB,WAAY,CACnEC,WAAYjB,KAAKkB,cAErBlB,KAAKwB,aAAasB,QAAQjC,EAC9B,CACJ,EAEJ,SAASf,EAA0C2B,EAAKrB,EAAMY,EAAYgB,GACtE,OAAI,EAAIjD,EAAyBkE,aAAqB,IAAIpD,EAA0C4B,EAAKrB,EAAMY,EAAYgB,GACpHP,EAAIV,iBAAiBX,EAAMY,EAAYgB,EAClD,C,kBCpMA,IAAIlD,EAA4B,EAAQ,OACpCC,EAA2B,EAAQ,KAGvC,SAASC,EAAeC,EAAGC,EAAGC,EAAGC,GAC/BC,OAAOC,eAAeL,EAAGC,EAAG,CAACK,IAAKJ,EAAGK,IAAKJ,EAAGK,YAAY,EAAMC,cAAc,GAC/E,CAEAV,EAAeW,EAAOC,QAAS,oBAAoB,IAAMC,IACzDb,EAAeW,EAAOC,QAAS,0BAA0B,IAAME,IAI/D,MAAMD,EACF,eAAIE,GACA,OAAOC,KAAKC,YAChB,CACA,eAAIF,CAAYG,GACZ,KAAK,EAAIpB,EAA0BqB,cAAcH,KAAKI,KAAMF,GAAO,MAAM,IAAIG,MAAM,4EACnF,MAAMC,EAAU,GAChB,IAAIC,EAAUL,EACVM,EAA2BN,EAE/B,IADAF,KAAKC,aAAeC,EACdK,GAAWA,IAAYP,KAAKI,SAASG,EAAQE,WAAaC,KAAKC,uBAAwB,CACzF,MAAMC,EAAaL,EACbM,EAASb,KAAKc,KAAKC,iBAAiBH,EAAYZ,KAAKgB,WAAY,CACnEC,WAAYjB,KAAKkB,cAErBZ,EAAQa,KAAKN,GACbA,EAAOd,YAAcS,EACrBR,KAAKoB,eAAeC,IAAIR,GACxBN,EAAUC,EAA2BI,EAAWU,IACpD,MAAOf,EAAUA,EAAQgB,WACzB,MAAMV,EAASb,KAAKc,KAAKC,iBAAiBf,KAAKI,KAAMJ,KAAKgB,WAAY,CAClEC,WAAYjB,KAAKkB,cAErBZ,EAAQa,KAAKN,GACbA,EAAOd,YAAcS,EACrBR,KAAKoB,eAAeC,IAAIR,GACxBb,KAAKwB,aAAelB,CACxB,CACA,OAAImB,GACA,OAAOzB,KAAKc,IAChB,CACA,UAAAY,GACI,IAAI3B,EAAcC,KAAKD,YACnB4B,EAAU3B,KAAK4B,WACnB,OAAK,EAAI9C,EAA0BqB,cAAcJ,EAAa4B,IAI1DA,IAAS3B,KAAKD,YAAc4B,GACzBA,IAJH3B,KAAKD,YAAcA,EACZ,KAIf,CACA,SAAA8B,GACI,IACIF,EADS3B,KAAKwB,aAAa,GACVK,YAErB,OADIF,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CACA,QAAAC,GACI,MAAMA,EAAW5B,KAAKwB,aAAa,GAAGI,WACtC,GAAIA,EAAU,CAEV,GADmBA,EAAShB,WACZ,CACZ,IAAIkB,EACJ,IAAIC,EAGJ,GAF2B,mBAAhB/B,KAAKgC,OAAuBD,EAAa/B,KAAKgC,OAAOJ,IACtB,QAAhCE,EAAe9B,KAAKgC,cAAqC,IAAjBF,OAA0B,EAASA,EAAab,cAAYc,EAAa/B,KAAKgC,OAAOf,WAAWW,IAC9IG,IAAeE,WAAWC,cAE1B,OADAlC,KAAKD,YAAc6B,EACZA,EAIX,IAAID,EAAU3B,KAAK4B,WAEnB,OADID,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CAEA,OADIC,IAAU5B,KAAKD,YAAc6B,GAC1BA,CACX,CACI,GAAI5B,KAAKwB,aAAaW,OAAS,EAAG,CAC9BnC,KAAKwB,aAAaY,QAClB,IAAIT,EAAU3B,KAAK4B,WAEnB,OADID,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CAAO,OAAO,IAEtB,CACA,YAAAU,GACI,MAAMC,EAAgBtC,KAAKwB,aAAa,GACxC,GAAIc,EAAcvC,cAAgBuC,EAAclC,KAAM,CAClD,GAAIJ,KAAKoB,eAAemB,IAAID,GAAgB,CAExC,GADAtC,KAAKoB,eAAeoB,OAAOF,GACvBtC,KAAKwB,aAAaW,OAAS,EAAG,CAC9BnC,KAAKwB,aAAaY,QAClB,IAAIT,EAAU3B,KAAKqC,eAEnB,OADIV,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CAAO,OAAO,IAClB,CACA,OAAO,IACX,CACA,MAAMU,EAAeC,EAAcD,eACnC,GAAIA,EAAc,CAEd,GADmBA,EAAazB,WAChB,CACZ,IAAIkB,EACJ,IAAIC,EAGJ,GAF2B,mBAAhB/B,KAAKgC,OAAuBD,EAAa/B,KAAKgC,OAAOK,IACtB,QAAhCP,EAAe9B,KAAKgC,cAAqC,IAAjBF,OAA0B,EAASA,EAAab,cAAYc,EAAa/B,KAAKgC,OAAOf,WAAWoB,IAC9IN,IAAeE,WAAWC,cAE1B,OADIG,IAAcrC,KAAKD,YAAcsC,GAC9BA,EAIX,IAAIV,EAAU3B,KAAK6B,YAEnB,OADIF,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CAEA,OADIU,IAAcrC,KAAKD,YAAcsC,GAC9BA,CACX,CACI,GAAIrC,KAAKwB,aAAaW,OAAS,EAAG,CAC9BnC,KAAKwB,aAAaY,QAClB,IAAIT,EAAU3B,KAAKqC,eAEnB,OADIV,IAAS3B,KAAKD,YAAc4B,GACzBA,CACX,CAAO,OAAO,IAEtB,CAGI,WAAAc,GAIA,OAAO,IACX,CAGI,eAAAC,GAIA,OAAO,IACX,CAGI,UAAAnB,GAIA,OAAO,IACX,CACA,WAAAoB,CAAYlB,EAAKrB,EAAMY,EAAYgB,GAC/BhC,KAAKwB,aAAe,GACpBxB,KAAKoB,eAAiB,IAAIwB,IAC1B5C,KAAKkB,YAAehB,IAChB,GAAIA,EAAKO,WAAaC,KAAKmC,aAAc,CACrC,MAAMjC,EAAaV,EAAKU,WACxB,GAAIA,EAAY,CACZ,MAAMC,EAASb,KAAKc,KAAKC,iBAAiBH,EAAYZ,KAAKgB,WAAY,CACnEC,WAAYjB,KAAKkB,cAGrB,OADAlB,KAAKwB,aAAasB,QAAQjC,GACnBoB,WAAWC,aACtB,CACI,IAAIJ,EACJ,GAA2B,mBAAhB9B,KAAKgC,OAAuB,OAAOhC,KAAKgC,OAAO9B,GACrD,GAAqC,QAAhC4B,EAAe9B,KAAKgC,cAAqC,IAAjBF,OAA0B,EAASA,EAAab,WAAY,OAAOjB,KAAKgC,OAAOf,WAAWf,GACvI,GAAoB,OAAhBF,KAAKgC,OAAiB,OAAOC,WAAWC,aAEzD,CACA,OAAOD,WAAWc,WAAW,EAEjC/C,KAAKc,KAAOW,EACZzB,KAAKI,KAAOA,EACZJ,KAAKgC,OAASA,QAAuCA,EAAS,KAC9DhC,KAAKgB,WAAaA,QAA+CA,EAAaiB,WAAWe,SACzFhD,KAAKC,aAAeG,EACpBJ,KAAKwB,aAAasB,QAAQrB,EAAIV,iBAAiBX,EAAMY,EAAYhB,KAAKkB,cACtE,MAAMN,EAAaR,EAAKQ,WACxB,GAAIA,EAAY,CACZ,MAAMC,EAASb,KAAKc,KAAKC,iBAAiBH,EAAYZ,KAAKgB,WAAY,CACnEC,WAAYjB,KAAKkB,cAErBlB,KAAKwB,aAAasB,QAAQjC,EAC9B,CACJ,EAEJ,SAASf,EAA0C2B,EAAKrB,EAAMY,EAAYgB,GACtE,OAAI,EAAIjD,EAAyBkE,aAAqB,IAAIpD,EAA0C4B,EAAKrB,EAAMY,EAAYgB,GACpHP,EAAIV,iBAAiBX,EAAMY,EAAYgB,EAClD,C","sources":["webpack://typescript/./node_modules/@react-aria/grid/node_modules/@react-aria/utils/dist/ShadowTreeWalker.main.js","webpack://typescript/./node_modules/@react-aria/spinbutton/node_modules/@react-aria/utils/dist/ShadowTreeWalker.main.js","webpack://typescript/./node_modules/@react-aria/toggle/node_modules/@react-aria/utils/dist/ShadowTreeWalker.main.js"],"sourcesContent":["var $d723bea02f3e2567$exports = require(\"./DOMFunctions.main.js\");\nvar $hdE3O$reactstatelyflags = require(\"@react-stately/flags\");\n\n\nfunction $parcel$export(e, n, v, s) {\n  Object.defineProperty(e, n, {get: v, set: s, enumerable: true, configurable: true});\n}\n\n$parcel$export(module.exports, \"ShadowTreeWalker\", () => $8e13b2545651735a$export$63eb3ababa9c55c4);\n$parcel$export(module.exports, \"createShadowTreeWalker\", () => $8e13b2545651735a$export$4d0f8be8b12a7ef6);\n// https://github.com/microsoft/tabster/blob/a89fc5d7e332d48f68d03b1ca6e344489d1c3898/src/Shadowdomize/ShadowTreeWalker.ts\n\n\nclass $8e13b2545651735a$export$63eb3ababa9c55c4 {\n    get currentNode() {\n        return this._currentNode;\n    }\n    set currentNode(node) {\n        if (!(0, $d723bea02f3e2567$exports.nodeContains)(this.root, node)) throw new Error('Cannot set currentNode to a node that is not contained by the root node.');\n        const walkers = [];\n        let curNode = node;\n        let currentWalkerCurrentNode = node;\n        this._currentNode = node;\n        while(curNode && curNode !== this.root)if (curNode.nodeType === Node.DOCUMENT_FRAGMENT_NODE) {\n            const shadowRoot = curNode;\n            const walker = this._doc.createTreeWalker(shadowRoot, this.whatToShow, {\n                acceptNode: this._acceptNode\n            });\n            walkers.push(walker);\n            walker.currentNode = currentWalkerCurrentNode;\n            this._currentSetFor.add(walker);\n            curNode = currentWalkerCurrentNode = shadowRoot.host;\n        } else curNode = curNode.parentNode;\n        const walker = this._doc.createTreeWalker(this.root, this.whatToShow, {\n            acceptNode: this._acceptNode\n        });\n        walkers.push(walker);\n        walker.currentNode = currentWalkerCurrentNode;\n        this._currentSetFor.add(walker);\n        this._walkerStack = walkers;\n    }\n    get doc() {\n        return this._doc;\n    }\n    firstChild() {\n        let currentNode = this.currentNode;\n        let newNode = this.nextNode();\n        if (!(0, $d723bea02f3e2567$exports.nodeContains)(currentNode, newNode)) {\n            this.currentNode = currentNode;\n            return null;\n        }\n        if (newNode) this.currentNode = newNode;\n        return newNode;\n    }\n    lastChild() {\n        let walker = this._walkerStack[0];\n        let newNode = walker.lastChild();\n        if (newNode) this.currentNode = newNode;\n        return newNode;\n    }\n    nextNode() {\n        const nextNode = this._walkerStack[0].nextNode();\n        if (nextNode) {\n            const shadowRoot = nextNode.shadowRoot;\n            if (shadowRoot) {\n                var _this_filter;\n                let nodeResult;\n                if (typeof this.filter === 'function') nodeResult = this.filter(nextNode);\n                else if ((_this_filter = this.filter) === null || _this_filter === void 0 ? void 0 : _this_filter.acceptNode) nodeResult = this.filter.acceptNode(nextNode);\n                if (nodeResult === NodeFilter.FILTER_ACCEPT) {\n                    this.currentNode = nextNode;\n                    return nextNode;\n                }\n                // _acceptNode should have added new walker for this shadow,\n                // go in recursively.\n                let newNode = this.nextNode();\n                if (newNode) this.currentNode = newNode;\n                return newNode;\n            }\n            if (nextNode) this.currentNode = nextNode;\n            return nextNode;\n        } else {\n            if (this._walkerStack.length > 1) {\n                this._walkerStack.shift();\n                let newNode = this.nextNode();\n                if (newNode) this.currentNode = newNode;\n                return newNode;\n            } else return null;\n        }\n    }\n    previousNode() {\n        const currentWalker = this._walkerStack[0];\n        if (currentWalker.currentNode === currentWalker.root) {\n            if (this._currentSetFor.has(currentWalker)) {\n                this._currentSetFor.delete(currentWalker);\n                if (this._walkerStack.length > 1) {\n                    this._walkerStack.shift();\n                    let newNode = this.previousNode();\n                    if (newNode) this.currentNode = newNode;\n                    return newNode;\n                } else return null;\n            }\n            return null;\n        }\n        const previousNode = currentWalker.previousNode();\n        if (previousNode) {\n            const shadowRoot = previousNode.shadowRoot;\n            if (shadowRoot) {\n                var _this_filter;\n                let nodeResult;\n                if (typeof this.filter === 'function') nodeResult = this.filter(previousNode);\n                else if ((_this_filter = this.filter) === null || _this_filter === void 0 ? void 0 : _this_filter.acceptNode) nodeResult = this.filter.acceptNode(previousNode);\n                if (nodeResult === NodeFilter.FILTER_ACCEPT) {\n                    if (previousNode) this.currentNode = previousNode;\n                    return previousNode;\n                }\n                // _acceptNode should have added new walker for this shadow,\n                // go in recursively.\n                let newNode = this.lastChild();\n                if (newNode) this.currentNode = newNode;\n                return newNode;\n            }\n            if (previousNode) this.currentNode = previousNode;\n            return previousNode;\n        } else {\n            if (this._walkerStack.length > 1) {\n                this._walkerStack.shift();\n                let newNode = this.previousNode();\n                if (newNode) this.currentNode = newNode;\n                return newNode;\n            } else return null;\n        }\n    }\n    /**\n     * @deprecated\n     */ nextSibling() {\n        // if (__DEV__) {\n        //     throw new Error(\"Method not implemented.\");\n        // }\n        return null;\n    }\n    /**\n     * @deprecated\n     */ previousSibling() {\n        // if (__DEV__) {\n        //     throw new Error(\"Method not implemented.\");\n        // }\n        return null;\n    }\n    /**\n     * @deprecated\n     */ parentNode() {\n        // if (__DEV__) {\n        //     throw new Error(\"Method not implemented.\");\n        // }\n        return null;\n    }\n    constructor(doc, root, whatToShow, filter){\n        this._walkerStack = [];\n        this._currentSetFor = new Set();\n        this._acceptNode = (node)=>{\n            if (node.nodeType === Node.ELEMENT_NODE) {\n                const shadowRoot = node.shadowRoot;\n                if (shadowRoot) {\n                    const walker = this._doc.createTreeWalker(shadowRoot, this.whatToShow, {\n                        acceptNode: this._acceptNode\n                    });\n                    this._walkerStack.unshift(walker);\n                    return NodeFilter.FILTER_ACCEPT;\n                } else {\n                    var _this_filter;\n                    if (typeof this.filter === 'function') return this.filter(node);\n                    else if ((_this_filter = this.filter) === null || _this_filter === void 0 ? void 0 : _this_filter.acceptNode) return this.filter.acceptNode(node);\n                    else if (this.filter === null) return NodeFilter.FILTER_ACCEPT;\n                }\n            }\n            return NodeFilter.FILTER_SKIP;\n        };\n        this._doc = doc;\n        this.root = root;\n        this.filter = filter !== null && filter !== void 0 ? filter : null;\n        this.whatToShow = whatToShow !== null && whatToShow !== void 0 ? whatToShow : NodeFilter.SHOW_ALL;\n        this._currentNode = root;\n        this._walkerStack.unshift(doc.createTreeWalker(root, whatToShow, this._acceptNode));\n        const shadowRoot = root.shadowRoot;\n        if (shadowRoot) {\n            const walker = this._doc.createTreeWalker(shadowRoot, this.whatToShow, {\n                acceptNode: this._acceptNode\n            });\n            this._walkerStack.unshift(walker);\n        }\n    }\n}\nfunction $8e13b2545651735a$export$4d0f8be8b12a7ef6(doc, root, whatToShow, filter) {\n    if ((0, $hdE3O$reactstatelyflags.shadowDOM)()) return new $8e13b2545651735a$export$63eb3ababa9c55c4(doc, root, whatToShow, filter);\n    return doc.createTreeWalker(root, whatToShow, filter);\n}\n\n\n//# sourceMappingURL=ShadowTreeWalker.main.js.map\n","var $d723bea02f3e2567$exports = require(\"./DOMFunctions.main.js\");\nvar $hdE3O$reactstatelyflags = require(\"@react-stately/flags\");\n\n\nfunction $parcel$export(e, n, v, s) {\n  Object.defineProperty(e, n, {get: v, set: s, enumerable: true, configurable: true});\n}\n\n$parcel$export(module.exports, \"ShadowTreeWalker\", () => $8e13b2545651735a$export$63eb3ababa9c55c4);\n$parcel$export(module.exports, \"createShadowTreeWalker\", () => $8e13b2545651735a$export$4d0f8be8b12a7ef6);\n// https://github.com/microsoft/tabster/blob/a89fc5d7e332d48f68d03b1ca6e344489d1c3898/src/Shadowdomize/ShadowTreeWalker.ts\n\n\nclass $8e13b2545651735a$export$63eb3ababa9c55c4 {\n    get currentNode() {\n        return this._currentNode;\n    }\n    set currentNode(node) {\n        if (!(0, $d723bea02f3e2567$exports.nodeContains)(this.root, node)) throw new Error('Cannot set currentNode to a node that is not contained by the root node.');\n        const walkers = [];\n        let curNode = node;\n        let currentWalkerCurrentNode = node;\n        this._currentNode = node;\n        while(curNode && curNode !== this.root)if (curNode.nodeType === Node.DOCUMENT_FRAGMENT_NODE) {\n            const shadowRoot = curNode;\n            const walker = this._doc.createTreeWalker(shadowRoot, this.whatToShow, {\n                acceptNode: this._acceptNode\n            });\n            walkers.push(walker);\n            walker.currentNode = currentWalkerCurrentNode;\n            this._currentSetFor.add(walker);\n            curNode = currentWalkerCurrentNode = shadowRoot.host;\n        } else curNode = curNode.parentNode;\n        const walker = this._doc.createTreeWalker(this.root, this.whatToShow, {\n            acceptNode: this._acceptNode\n        });\n        walkers.push(walker);\n        walker.currentNode = currentWalkerCurrentNode;\n        this._currentSetFor.add(walker);\n        this._walkerStack = walkers;\n    }\n    get doc() {\n        return this._doc;\n    }\n    firstChild() {\n        let currentNode = this.currentNode;\n        let newNode = this.nextNode();\n        if (!(0, $d723bea02f3e2567$exports.nodeContains)(currentNode, newNode)) {\n            this.currentNode = currentNode;\n            return null;\n        }\n        if (newNode) this.currentNode = newNode;\n        return newNode;\n    }\n    lastChild() {\n        let walker = this._walkerStack[0];\n        let newNode = walker.lastChild();\n        if (newNode) this.currentNode = newNode;\n        return newNode;\n    }\n    nextNode() {\n        const nextNode = this._walkerStack[0].nextNode();\n        if (nextNode) {\n            const shadowRoot = nextNode.shadowRoot;\n            if (shadowRoot) {\n                var _this_filter;\n                let nodeResult;\n                if (typeof this.filter === 'function') nodeResult = this.filter(nextNode);\n                else if ((_this_filter = this.filter) === null || _this_filter === void 0 ? void 0 : _this_filter.acceptNode) nodeResult = this.filter.acceptNode(nextNode);\n                if (nodeResult === NodeFilter.FILTER_ACCEPT) {\n                    this.currentNode = nextNode;\n                    return nextNode;\n                }\n                // _acceptNode should have added new walker for this shadow,\n                // go in recursively.\n                let newNode = this.nextNode();\n                if (newNode) this.currentNode = newNode;\n                return newNode;\n            }\n            if (nextNode) this.currentNode = nextNode;\n            return nextNode;\n        } else {\n            if (this._walkerStack.length > 1) {\n                this._walkerStack.shift();\n                let newNode = this.nextNode();\n                if (newNode) this.currentNode = newNode;\n                return newNode;\n            } else return null;\n        }\n    }\n    previousNode() {\n        const currentWalker = this._walkerStack[0];\n        if (currentWalker.currentNode === currentWalker.root) {\n            if (this._currentSetFor.has(currentWalker)) {\n                this._currentSetFor.delete(currentWalker);\n                if (this._walkerStack.length > 1) {\n                    this._walkerStack.shift();\n                    let newNode = this.previousNode();\n                    if (newNode) this.currentNode = newNode;\n                    return newNode;\n                } else return null;\n            }\n            return null;\n        }\n        const previousNode = currentWalker.previousNode();\n        if (previousNode) {\n            const shadowRoot = previousNode.shadowRoot;\n            if (shadowRoot) {\n                var _this_filter;\n                let nodeResult;\n                if (typeof this.filter === 'function') nodeResult = this.filter(previousNode);\n                else if ((_this_filter = this.filter) === null || _this_filter === void 0 ? void 0 : _this_filter.acceptNode) nodeResult = this.filter.acceptNode(previousNode);\n                if (nodeResult === NodeFilter.FILTER_ACCEPT) {\n                    if (previousNode) this.currentNode = previousNode;\n                    return previousNode;\n                }\n                // _acceptNode should have added new walker for this shadow,\n                // go in recursively.\n                let newNode = this.lastChild();\n                if (newNode) this.currentNode = newNode;\n                return newNode;\n            }\n            if (previousNode) this.currentNode = previousNode;\n            return previousNode;\n        } else {\n            if (this._walkerStack.length > 1) {\n                this._walkerStack.shift();\n                let newNode = this.previousNode();\n                if (newNode) this.currentNode = newNode;\n                return newNode;\n            } else return null;\n        }\n    }\n    /**\n     * @deprecated\n     */ nextSibling() {\n        // if (__DEV__) {\n        //     throw new Error(\"Method not implemented.\");\n        // }\n        return null;\n    }\n    /**\n     * @deprecated\n     */ previousSibling() {\n        // if (__DEV__) {\n        //     throw new Error(\"Method not implemented.\");\n        // }\n        return null;\n    }\n    /**\n     * @deprecated\n     */ parentNode() {\n        // if (__DEV__) {\n        //     throw new Error(\"Method not implemented.\");\n        // }\n        return null;\n    }\n    constructor(doc, root, whatToShow, filter){\n        this._walkerStack = [];\n        this._currentSetFor = new Set();\n        this._acceptNode = (node)=>{\n            if (node.nodeType === Node.ELEMENT_NODE) {\n                const shadowRoot = node.shadowRoot;\n                if (shadowRoot) {\n                    const walker = this._doc.createTreeWalker(shadowRoot, this.whatToShow, {\n                        acceptNode: this._acceptNode\n                    });\n                    this._walkerStack.unshift(walker);\n                    return NodeFilter.FILTER_ACCEPT;\n                } else {\n                    var _this_filter;\n                    if (typeof this.filter === 'function') return this.filter(node);\n                    else if ((_this_filter = this.filter) === null || _this_filter === void 0 ? void 0 : _this_filter.acceptNode) return this.filter.acceptNode(node);\n                    else if (this.filter === null) return NodeFilter.FILTER_ACCEPT;\n                }\n            }\n            return NodeFilter.FILTER_SKIP;\n        };\n        this._doc = doc;\n        this.root = root;\n        this.filter = filter !== null && filter !== void 0 ? filter : null;\n        this.whatToShow = whatToShow !== null && whatToShow !== void 0 ? whatToShow : NodeFilter.SHOW_ALL;\n        this._currentNode = root;\n        this._walkerStack.unshift(doc.createTreeWalker(root, whatToShow, this._acceptNode));\n        const shadowRoot = root.shadowRoot;\n        if (shadowRoot) {\n            const walker = this._doc.createTreeWalker(shadowRoot, this.whatToShow, {\n                acceptNode: this._acceptNode\n            });\n            this._walkerStack.unshift(walker);\n        }\n    }\n}\nfunction $8e13b2545651735a$export$4d0f8be8b12a7ef6(doc, root, whatToShow, filter) {\n    if ((0, $hdE3O$reactstatelyflags.shadowDOM)()) return new $8e13b2545651735a$export$63eb3ababa9c55c4(doc, root, whatToShow, filter);\n    return doc.createTreeWalker(root, whatToShow, filter);\n}\n\n\n//# sourceMappingURL=ShadowTreeWalker.main.js.map\n","var $d723bea02f3e2567$exports = require(\"./DOMFunctions.main.js\");\nvar $hdE3O$reactstatelyflags = require(\"@react-stately/flags\");\n\n\nfunction $parcel$export(e, n, v, s) {\n  Object.defineProperty(e, n, {get: v, set: s, enumerable: true, configurable: true});\n}\n\n$parcel$export(module.exports, \"ShadowTreeWalker\", () => $8e13b2545651735a$export$63eb3ababa9c55c4);\n$parcel$export(module.exports, \"createShadowTreeWalker\", () => $8e13b2545651735a$export$4d0f8be8b12a7ef6);\n// https://github.com/microsoft/tabster/blob/a89fc5d7e332d48f68d03b1ca6e344489d1c3898/src/Shadowdomize/ShadowTreeWalker.ts\n\n\nclass $8e13b2545651735a$export$63eb3ababa9c55c4 {\n    get currentNode() {\n        return this._currentNode;\n    }\n    set currentNode(node) {\n        if (!(0, $d723bea02f3e2567$exports.nodeContains)(this.root, node)) throw new Error('Cannot set currentNode to a node that is not contained by the root node.');\n        const walkers = [];\n        let curNode = node;\n        let currentWalkerCurrentNode = node;\n        this._currentNode = node;\n        while(curNode && curNode !== this.root)if (curNode.nodeType === Node.DOCUMENT_FRAGMENT_NODE) {\n            const shadowRoot = curNode;\n            const walker = this._doc.createTreeWalker(shadowRoot, this.whatToShow, {\n                acceptNode: this._acceptNode\n            });\n            walkers.push(walker);\n            walker.currentNode = currentWalkerCurrentNode;\n            this._currentSetFor.add(walker);\n            curNode = currentWalkerCurrentNode = shadowRoot.host;\n        } else curNode = curNode.parentNode;\n        const walker = this._doc.createTreeWalker(this.root, this.whatToShow, {\n            acceptNode: this._acceptNode\n        });\n        walkers.push(walker);\n        walker.currentNode = currentWalkerCurrentNode;\n        this._currentSetFor.add(walker);\n        this._walkerStack = walkers;\n    }\n    get doc() {\n        return this._doc;\n    }\n    firstChild() {\n        let currentNode = this.currentNode;\n        let newNode = this.nextNode();\n        if (!(0, $d723bea02f3e2567$exports.nodeContains)(currentNode, newNode)) {\n            this.currentNode = currentNode;\n            return null;\n        }\n        if (newNode) this.currentNode = newNode;\n        return newNode;\n    }\n    lastChild() {\n        let walker = this._walkerStack[0];\n        let newNode = walker.lastChild();\n        if (newNode) this.currentNode = newNode;\n        return newNode;\n    }\n    nextNode() {\n        const nextNode = this._walkerStack[0].nextNode();\n        if (nextNode) {\n            const shadowRoot = nextNode.shadowRoot;\n            if (shadowRoot) {\n                var _this_filter;\n                let nodeResult;\n                if (typeof this.filter === 'function') nodeResult = this.filter(nextNode);\n                else if ((_this_filter = this.filter) === null || _this_filter === void 0 ? void 0 : _this_filter.acceptNode) nodeResult = this.filter.acceptNode(nextNode);\n                if (nodeResult === NodeFilter.FILTER_ACCEPT) {\n                    this.currentNode = nextNode;\n                    return nextNode;\n                }\n                // _acceptNode should have added new walker for this shadow,\n                // go in recursively.\n                let newNode = this.nextNode();\n                if (newNode) this.currentNode = newNode;\n                return newNode;\n            }\n            if (nextNode) this.currentNode = nextNode;\n            return nextNode;\n        } else {\n            if (this._walkerStack.length > 1) {\n                this._walkerStack.shift();\n                let newNode = this.nextNode();\n                if (newNode) this.currentNode = newNode;\n                return newNode;\n            } else return null;\n        }\n    }\n    previousNode() {\n        const currentWalker = this._walkerStack[0];\n        if (currentWalker.currentNode === currentWalker.root) {\n            if (this._currentSetFor.has(currentWalker)) {\n                this._currentSetFor.delete(currentWalker);\n                if (this._walkerStack.length > 1) {\n                    this._walkerStack.shift();\n                    let newNode = this.previousNode();\n                    if (newNode) this.currentNode = newNode;\n                    return newNode;\n                } else return null;\n            }\n            return null;\n        }\n        const previousNode = currentWalker.previousNode();\n        if (previousNode) {\n            const shadowRoot = previousNode.shadowRoot;\n            if (shadowRoot) {\n                var _this_filter;\n                let nodeResult;\n                if (typeof this.filter === 'function') nodeResult = this.filter(previousNode);\n                else if ((_this_filter = this.filter) === null || _this_filter === void 0 ? void 0 : _this_filter.acceptNode) nodeResult = this.filter.acceptNode(previousNode);\n                if (nodeResult === NodeFilter.FILTER_ACCEPT) {\n                    if (previousNode) this.currentNode = previousNode;\n                    return previousNode;\n                }\n                // _acceptNode should have added new walker for this shadow,\n                // go in recursively.\n                let newNode = this.lastChild();\n                if (newNode) this.currentNode = newNode;\n                return newNode;\n            }\n            if (previousNode) this.currentNode = previousNode;\n            return previousNode;\n        } else {\n            if (this._walkerStack.length > 1) {\n                this._walkerStack.shift();\n                let newNode = this.previousNode();\n                if (newNode) this.currentNode = newNode;\n                return newNode;\n            } else return null;\n        }\n    }\n    /**\n     * @deprecated\n     */ nextSibling() {\n        // if (__DEV__) {\n        //     throw new Error(\"Method not implemented.\");\n        // }\n        return null;\n    }\n    /**\n     * @deprecated\n     */ previousSibling() {\n        // if (__DEV__) {\n        //     throw new Error(\"Method not implemented.\");\n        // }\n        return null;\n    }\n    /**\n     * @deprecated\n     */ parentNode() {\n        // if (__DEV__) {\n        //     throw new Error(\"Method not implemented.\");\n        // }\n        return null;\n    }\n    constructor(doc, root, whatToShow, filter){\n        this._walkerStack = [];\n        this._currentSetFor = new Set();\n        this._acceptNode = (node)=>{\n            if (node.nodeType === Node.ELEMENT_NODE) {\n                const shadowRoot = node.shadowRoot;\n                if (shadowRoot) {\n                    const walker = this._doc.createTreeWalker(shadowRoot, this.whatToShow, {\n                        acceptNode: this._acceptNode\n                    });\n                    this._walkerStack.unshift(walker);\n                    return NodeFilter.FILTER_ACCEPT;\n                } else {\n                    var _this_filter;\n                    if (typeof this.filter === 'function') return this.filter(node);\n                    else if ((_this_filter = this.filter) === null || _this_filter === void 0 ? void 0 : _this_filter.acceptNode) return this.filter.acceptNode(node);\n                    else if (this.filter === null) return NodeFilter.FILTER_ACCEPT;\n                }\n            }\n            return NodeFilter.FILTER_SKIP;\n        };\n        this._doc = doc;\n        this.root = root;\n        this.filter = filter !== null && filter !== void 0 ? filter : null;\n        this.whatToShow = whatToShow !== null && whatToShow !== void 0 ? whatToShow : NodeFilter.SHOW_ALL;\n        this._currentNode = root;\n        this._walkerStack.unshift(doc.createTreeWalker(root, whatToShow, this._acceptNode));\n        const shadowRoot = root.shadowRoot;\n        if (shadowRoot) {\n            const walker = this._doc.createTreeWalker(shadowRoot, this.whatToShow, {\n                acceptNode: this._acceptNode\n            });\n            this._walkerStack.unshift(walker);\n        }\n    }\n}\nfunction $8e13b2545651735a$export$4d0f8be8b12a7ef6(doc, root, whatToShow, filter) {\n    if ((0, $hdE3O$reactstatelyflags.shadowDOM)()) return new $8e13b2545651735a$export$63eb3ababa9c55c4(doc, root, whatToShow, filter);\n    return doc.createTreeWalker(root, whatToShow, filter);\n}\n\n\n//# sourceMappingURL=ShadowTreeWalker.main.js.map\n"],"names":["$d723bea02f3e2567$exports","$hdE3O$reactstatelyflags","$parcel$export","e","n","v","s","Object","defineProperty","get","set","enumerable","configurable","module","exports","$8e13b2545651735a$export$63eb3ababa9c55c4","$8e13b2545651735a$export$4d0f8be8b12a7ef6","currentNode","this","_currentNode","node","nodeContains","root","Error","walkers","curNode","currentWalkerCurrentNode","nodeType","Node","DOCUMENT_FRAGMENT_NODE","shadowRoot","walker","_doc","createTreeWalker","whatToShow","acceptNode","_acceptNode","push","_currentSetFor","add","host","parentNode","_walkerStack","doc","firstChild","newNode","nextNode","lastChild","_this_filter","nodeResult","filter","NodeFilter","FILTER_ACCEPT","length","shift","previousNode","currentWalker","has","delete","nextSibling","previousSibling","constructor","Set","ELEMENT_NODE","unshift","FILTER_SKIP","SHOW_ALL","shadowDOM"],"sourceRoot":""}