1(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[1584],{41584:function(e,t,n){"use strict";n.r(t),n.d(t,{default:function(){return O}});var r=n(8307),i=n(67294),o=n(94184),s=n.n(o),a=Object.defineProperty,c=new Map,u=new WeakMap,l=0,f=void 0;i.Component;var d=n(60793),p=n.n(d),y=n(85893);function h(e,t){var n=Object.keys(e);if(Object.getOwnPropertySymbols){var r=Object.getOwnPropertySymbols(e);t&&(r=r.filter(function(t){return Object.getOwnPropertyDescriptor(e,t).enumerable})),n.push.apply(n,r)}return n}function b(e){for(var t=1;t<arguments.length;t++){var n=null!=arguments[t]?arguments[t]:{};t%2?h(Object(n),!0).forEach(function(t){(0,r.Z)(e,t,n[t])}):Object.getOwnPropertyDescriptors?Object.defineProperties(e,Object.getOwnPropertyDescriptors(n)):h(Object(n)).forEach(function(t){Object.defineProperty(e,t,Object.getOwnPropertyDescriptor(n,t))})}return e}async function v(){}function w(e){return new Promise(t=>setTimeout(()=>t(),e))}function m(e,t,n){let r=e.loadAnimation({container:t,renderer:"svg",loop:!1,autoplay:!1,animationData:n}),i=new Promise(e=>{r.addEventListener("complete",function t(){r.removeEventListener("complete",t),e()})});return[r,async()=>{r.play(),await i,r.destroy()}]}function g({className:e,onFinish:t}){let r=(0,i.useRef)(null),{ref:o,inView:a}=function({threshold:e,delay:t,trackVisibility:n,rootMargin:r,root:o,triggerOnce:s,skip:a,initialInView:d,fallbackInView:p,onChange:y}={}){var h;let[b,v]=i.useState(null),w=i.useRef(),[m,g]=i.useState({inView:!!d,entry:void 0});w.current=y,i.useEffect(()=>{let i;if(!a&&b)return i=function(e,t,n={},r=f){if(void 0===window.IntersectionObserver&&void 0!==r){let i=e.getBoundingClientRect();return t(r,{isIntersecting:r,target:e,intersectionRatio:"number"==typeof n.threshold?n.threshold:0,time:0,boundingClientRect:i,intersectionRect:i,rootBounds:i}),()=>{}}let{id:i,observer:o,elements:s}=function(e){let t=Object.keys(e).sort().filter(t=>void 0!==e[t]).map(t=>{var n;return`${t}_${"root"===t?(n=e.root)?(u.has(n)||(l+=1,u.set(n,l.toString())),u.get(n)):"0":e[t]}`}).toString(),n=c.get(t);if(!n){let r;let i=new Map,o=new IntersectionObserver(t=>{t.forEach(t=>{var n;let o=t.isIntersecting&&r.some(e=>t.intersectionRatio>=e);e.trackVisibility&&void 0===t.isVisible&&(t.isVisible=o),null==(n=i.get(t.target))||n.forEach(e=>{e(o,t)})})},e);r=o.thresholds||(Array.isArray(e.threshold)?e.threshold:[e.threshold||0]),n={id:t,observer:o,elements:i},c.set(t,n)}return n}(n),a=s.get(e)||[];return s.has(e)||s.set(e,a),a.push(t),o.observe(e),function(){a.splice(a.indexOf(t),1),0===a.length&&(s.delete(e),o.unobserve(e)),0===s.size&&(o.disconnect(),c.delete(i))}}(b,(e,t)=>{g({inView:e,entry:t}),w.current&&w.current(e,t),t.isIntersecting&&s&&i&&(i(),i=void 0)},{root:o,rootMargin:r,threshold:e,trackVisibility:n,delay:t},p),()=>{i&&i()}},[Array.isArray(e)?e.toString():e,b,o,r,s,a,n,p,t]);let O=null==(h=m.entry)?void 0:h.target,j=i.useRef();b||!O||s||a||j.current===O||(j.current=O,g({inView:!!d,entry:void 0}));let P=[v,m.inView,m.entry];return P.ref=P[0],P.inView=P[1],P.entry=P[2],P}();return(0,i.useEffect)(()=>{let e,i;let o=r.current,s=!1,c=e=>e();async function u(){let r;let[a,u]=await Promise.all([n.e(1028).then(n.t.bind(n,98234,23)).then(e=>e.default),n.e(8673).then(n.t.bind(n,98673,19)),w(500)]);await c(async function(){[e,i]=m(a,o,u),s=!0,await i()}),await c(async function(){[r]=await Promise.all([n.e(7539).then(n.t.bind(n,27539,19)),w(5e3)])}),await c(async function(){[e,i]=m(a,o,r),await i()}),s&&t()}if(o&&a)return u(),function(){var n;c=v,null===(n=e)||void 0===n||n.destroy(),s&&t()}},[r.current,a]),(0,y.jsx)("div",{"aria-hidden":"true",ref:o,className:s()(p().container,e),children:(0,y.jsx)("span",{ref:r,className:p().animation})})}var O=(0,i.memo)(function(e){let{0:t,1:n}=(0,i.useState)(!1);return t?null:(0,y.jsx)(g,b(b({},e),{},{onFinish:()=>n(!0)}))})},60793:function(e){e.exports={container:"mascot_container__6Ephf",animation:"mascot_animation__7068W"}}}]);
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.