1const e = []; 2for (let n = 0; n < 256; ++n) 3 e.push((n + 256).toString(16).slice(1)); 4function i(n, t = 0) { 5 return (e[n[t + 0]] + e[n[t + 1]] + e[n[t + 2]] + e[n[t + 3]] + "-" + e[n[t + 4]] + e[n[t + 5]] + "-" + e[n[t + 6]] + e[n[t + 7]] + "-" + e[n[t + 8]] + e[n[t + 9]] + "-" + e[n[t + 10]] + e[n[t + 11]] + e[n[t + 12]] + e[n[t + 13]] + e[n[t + 14]] + e[n[t + 15]]).toLowerCase(); 6} 7let o; 8const r = new Uint8Array(16); 9function y() { 10 if (!o) { 11 if (typeof crypto > "u" || !crypto.getRandomValues) 12 throw new Error("crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported"); 13 o = crypto.getRandomValues.bind(crypto); 14 } 15 return o(r); 16} 17const m = typeof crypto < "u" && crypto.randomUUID && crypto.randomUUID.bind(crypto), d = { randomUUID: m }; 18function p(n, t, c) { 19 n = n || {}; 20 const u = n.random ?? n.rng?.() ?? y(); 21 if (u.length < 16) 22 throw new Error("Random bytes length must be >= 16"); 23 return u[6] = u[6] & 15 | 64, u[8] = u[8] & 63 | 128, i(u); 24} 25function g(n, t, c) { 26 return d.randomUUID && !n ? d.randomUUID() : p(n); 27} 28export { 29 g as v 30}; 31//# sourceMappingURL=v4.chunk-BysszJq8.js.map
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.