1import{e as x,f as g}from"./chunk-HBLARLGW.js";var y=x(p=>{"use strict";p.byteLength=C;p.toByteArray=L;p.fromByteArray=w;var h=[],d=[],i=typeof Uint8Array<"u"?Uint8Array:Array,u="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";for(s=0,F=u.length;s<F;++s)h[s]=u[s],d[u.charCodeAt(s)]=s;var s,F;d[45]=62;d[95]=63;function A(r){var e=r.length;if(e%4>0)throw new Error("Invalid string. Length must be a multiple of 4");var t=r.indexOf("=");t===-1&&(t=e);var a=t===e?0:4-t%4;return[t,a]}function C(r){var e=A(r),t=e[0],a=e[1];return(t+a)*3/4-a}function B(r,e,t){return(e+t)*3/4-t}function L(r){var e,t=A(r),a=t[0],o=t[1],n=new i(B(r,a,o)),c=0,f=o>0?a-4:a,v;for(v=0;v<f;v+=4)e=d[r.charCodeAt(v)]<<18|d[r.charCodeAt(v+1)]<<12|d[r.charCodeAt(v+2)]<<6|d[r.charCodeAt(v+3)],n[c++]=e>>16&255,n[c++]=e>>8&255,n[c++]=e&255;return o===2&&(e=d[r.charCodeAt(v)]<<2|d[r.charCodeAt(v+1)]>>4,n[c++]=e&255),o===1&&(e=d[r.charCodeAt(v)]<<10|d[r.charCodeAt(v+1)]<<4|d[r.charCodeAt(v+2)]>>2,n[c++]=e>>8&255,n[c++]=e&255),n}function m(r){return h[r>>18&63]+h[r>>12&63]+h[r>>6&63]+h[r&63]}function U(r,e,t){for(var a,o=[],n=e;n<t;n+=3)a=(r[n]<<16&16711680)+(r[n+1]<<8&65280)+(r[n+2]&255),o.push(m(a));return o.join("")}function w(r){for(var e,t=r.length,a=t%3,o=[],n=16383,c=0,f=t-a;c<f;c+=n)o.push(U(r,c,c+n>f?f:c+n));return a===1?(e=r[t-1],o.push(h[e>>2]+h[e<<4&63]+"==")):a===2&&(e=(r[t-2]<<8)+r[t-1],o.push(h[e>>10]+h[e>>4&63]+h[e<<2&63]+"=")),o.join("")}});var l=g(y()),j=r=>{if(r)return k(r).replace(/\+/g,"-").replace(/\//g,"_").replace(/=/g,"")},k=r=>{if(r)return(0,l.fromByteArray)(new Uint8Array(r))},H=r=>{let e=r.replace(/-/g,"+").replace(/_/g,"/"),t=r.length,a=(e+"====").substring(0,t+3-(t-1)%4);return new Uint8Array((0,l.toByteArray)(a))};export{j as a,k as b,H as c};
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.