1function v(p,t){for(var n=0;n<t.length;n++){const o=t[n];if(typeof o!="string"&&!Array.isArray(o)){for(const e in o)if(e!=="default"&&!(e in p)){const a=Object.getOwnPropertyDescriptor(o,e);a&&Object.defineProperty(p,e,a.get?a:{enumerable:!0,get:()=>o[e]})}}}return Object.freeze(Object.defineProperty(p,Symbol.toStringTag,{value:"Module"}))}var d={};/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */var y=d.read=function(p,t,n,o,e){var a,r,s=e*8-o-1,c=(1<<s)-1,h=c>>1,i=-7,f=n?e-1:0,w=n?-1:1,M=p[t+f];for(f+=w,a=M&(1<<-i)-1,M>>=-i,i+=s;i>0;a=a*256+p[t+f],f+=w,i-=8);for(r=a&(1<<-i)-1,a>>=-i,i+=o;i>0;r=r*256+p[t+f],f+=w,i-=8);if(a===0)a=1-h;else{if(a===c)return r?NaN:(M?-1:1)*(1/0);r=r+Math.pow(2,o),a=a-h}return(M?-1:1)*r*Math.pow(2,a-o)},x=d.write=function(p,t,n,o,e,a){var r,s,c,h=a*8-e-1,i=(1<<h)-1,f=i>>1,w=e===23?Math.pow(2,-24)-Math.pow(2,-77):0,M=o?0:a-1,g=o?1:-1,N=t<0||t===0&&1/t<0?1:0;for(t=Math.abs(t),isNaN(t)||t===1/0?(s=isNaN(t)?1:0,r=i):(r=Math.floor(Math.log(t)/Math.LN2),t*(c=Math.pow(2,-r))<1&&(r--,c*=2),r+f>=1?t+=w/c:t+=w*Math.pow(2,1-f),t*c>=2&&(r++,c/=2),r+f>=i?(s=0,r=i):r+f>=1?(s=(t*c-1)*Math.pow(2,e),r=r+f):(s=t*Math.pow(2,f-1)*Math.pow(2,e),r=0));e>=8;p[n+M]=s&255,M+=g,s/=256,e-=8);for(r=r<<e|s,h+=e;h>0;p[n+M]=r&255,M+=g,r/=256,h-=8);p[n+M-g]|=N*128};const O=v({__proto__:null,default:d,read:y,write:x},[d]);export{O as S};
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.