1function e(){let e=new IntersectionObserver((e,n)=>{e.forEach(e=>{if(e.isIntersecting){let r=e.target;t(0,Number.parseInt(r.innerHTML),r),n.unobserve(r)}})});document.querySelectorAll(`.animated-number`).forEach(t=>{e.observe(t)})}function t(e,n,r){e<=n&&(r.innerHTML=e,setTimeout(function(){t(e+1,n,r)},1))}function n(){let e=new IntersectionObserver((e,t)=>{e.forEach(e=>{if(e.isIntersecting){let n=e.target;r(0,parseFloat(n.dataset.target),n),t.unobserve(n)}})}),t=new IntersectionObserver((e,t)=>{e.forEach(e=>{if(e.isIntersecting){let n=e.target;i(0,parseFloat(n.dataset.target),n),t.unobserve(n)}})});document.querySelectorAll(`.animated-g2-score`).forEach(t=>{e.observe(t)}),document.querySelectorAll(`.animated-g2-stars`).forEach(e=>{t.observe(e)})}function r(e,t,n){e<=t&&(n.innerHTML=e.toFixed(1),setTimeout(function(){r(parseFloat((e+.1).toFixed(1)),t,n)},30))}function i(e,t,n){e<=t&&(n.style.width=e+`%`,setTimeout(function(){i(Math.min(e+2,t),t,n)},10))}e(),n();
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.