1"use strict";(self.webpackChunk=self.webpackChunk||[]).push([[5820],{35820:(t,e,r)=>{r.r(e),r.d(e,{default:()=>o});r(39393),r(96083),r(72254);var s=r(70006);const o=class{constructor(t){this.$el=t,this.scrollToEl=this.$el.dataset.scrollTo,this.$parent=this.$el.parentNode,this.updatedParent="",this.mql=window.matchMedia("(min-width: 1200px)"),this.noMotion=window.matchMedia("(prefers-reduced-motion: reduce)"),this.$header=document.querySelectorAll(".global-header"),this.headerHeight=this.$header[0].offsetHeight,this.visibleClass="visible",this.activeClass="active",this.scrollToEl&&(this.findParent(this.$el),this.$parent=document.querySelector("."+this.updatedParent)),this.$el.addEventListener("click",(()=>{let t=window.innerWidth>=1200?80:70;this.$parent.style.position="relative",this.$parent.style.top="-"+t+"px",this.$parent.scrollIntoView({behavior:this.noMotion.matches?"auto":"smooth",block:"start"}),this.$parent.style.top=0,this.$parent.style.position="relative"})),this.handleBackToTopObserver()}findParent(t){for(;t.parentNode&&"body"!=t.parentNode.nodeName.toLowerCase()&&t.parentNode.className;)(t=t.parentNode).className==this.scrollToEl&&(this.updatedParent=t.className);return this.updatedParent}handleBackToTopObserver(){let t=this.$parent;let e=new IntersectionObserver((t=>{t.forEach((t=>{t.isIntersecting?(0,s.T)(this.$el,300):(0,s.z)(this.$el,300)}))}),{threshold:0,rootMargin:"0px 0px -100% 0px"}),r=()=>{this.mql.matches?e.observe(t):(e.unobserve(t),this.$el.setAttribute("style",""),this.$el.classList.remove("hidden"))};r(),this.mql.addEventListener?this.mql.addEventListener("change",(()=>{r()})):this.mql.addListener(r())}}},70006:(t,e,r)=>{r.d(e,{T:()=>o,z:()=>s});const s=(t,e)=>{e?(t.style.transition="opacity "+e+"ms ease-in-out",t.style.opacity="0",setTimeout((()=>{t.classList.add("hidden")}),e)):t.classList.add("hidden"),t.setAttribute("aria-hidden","true")},o=(t,e)=>{t.classList.remove("hidden"),t.setAttribute("aria-hidden","false"),e&&(t.style.transition="opacity "+e+"ms ease-in-out",t.style.opacity="1")}},87739:(t,e,r)=>{var s=r(22086),o=r(59413),i=r(45089),n=r(56112),a=r(10563),h=r(2964),c=s.TypeError,l=function(t){var e=0==t,r=1==t,s=2==t,l=3==t;return function(t,d,u){n(t);var p=a("Promise"),f=i(t.next),v=0,m=void 0!==d;return!m&&e||i(d),new p((function(i,a){var y=function(e,r){try{var s=h(t,"return");if(s)return p.resolve(o(s,t)).then((function(){e(r)}),(function(t){a(t)}))}catch(t){return a(t)}e(r)},b=function(t){y(a,t)},$=function(){try{if(e&&v>9007199254740991&&m)throw c("The allowed number of iterations has been exceeded");p.resolve(n(o(f,t))).then((function(t){try{if(n(t).done)e?(u.length=v,i(u)):i(!l&&(s||void 0));else{var o=t.value;m?p.resolve(e?d(o,v):d(o)).then((function(t){r?$():s?t?$():y(i,!1):e?(u[v++]=t,$()):t?y(i,l||o):$()}),b):(u[v++]=o,$())}}catch(t){b(t)}}),b)}catch(t){b(t)}};$()}))}};t.exports={toArray:l(0),forEach:l(1),every:l(2),some:l(3),find:l(4)}},39393:(t,e,r)=>{var s=r(51695),o=r(87739).forEach;s({target:"AsyncIterator",proto:!0,real:!0,forced:!0},{forEach:function(t){return o(this,t)}})},96083:(t,e,r)=>{var s=r(51695),o=r(22086),i=r(51855),n=r(90930),a=r(72585),h=r(63677),c=r(49606),l=r(50211),d=r(13083).IteratorPrototype,u=r(43296),p=l("toStringTag"),f=o.Iterator,v=u||!n(f)||f.prototype!==d||!h((function(){f({})})),m=function(){i(this,d)};c(d,p)||a(d,p,"Iterator"),!v&&c(d,"constructor")&&d.constructor!==Object||a(d,"constructor",m),m.prototype=d,s({global:!0,forced:v},{Iterator:m})},72254:(t,e,r)=>{var s=r(51695),o=r(94722),i=r(56112);s({target:"Iterator",proto:!0,real:!0,forced:!0},{forEach:function(t){o(i(this),t,{IS_ITERATOR:!0})}})}}]);
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.