1import{u,a$ as l,b0 as h,b1 as m,b2 as p}from"./main-qVqo2fHH.js";const s=2.4;function A(r){return l(r*s)}function M(r){return u(r)/s}function $(r,i,t,a){let{color:c,ratio:e}=i,{color:f,ratio:o}=t;o===e&&(o===1?e-=1e-6:o+=1e-6);const n=p((a-e)/(o-e),0,1);m(r,c.toArray(),f.toArray(),n)}function g(r){const t=new Uint8ClampedArray(2048);if(r=r.filter(({ratio:o})=>o>=0&&o<=1).sort((o,n)=>o.ratio-n.ratio).map(({color:o,ratio:n})=>({color:o,ratio:Math.max(n,.001)})),r.length<1)return t;let a=r[0],c=r[0],e=1;const f=h();for(let o=0;o<512;o++){const n=(o+.5)/512;for(;n>c.ratio&&e<r.length;)a=c,c=r[e++];$(f,a,c,n),t.set(f,4*o)}return t}function x(r,i,t){const a=Math.sqrt(r**2+i**2)/t;return a>1?0:3/(Math.PI*t**2)*(1-a**2)**2}function d(r){return typeof r=="function"?r:r?i=>+i[r]:()=>1}export{M as a,s as c,A as e,g as f,x as l,d as u};
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.