lakutata
Version:
An IoC-based universal application framework.
359 lines (325 loc) • 9.99 kB
JavaScript
/* Build Date: Mon Jan 05 2026 23:52:23 GMT+0800 (China Standard Time) */
import { u as n, p as t, a as e, D as r, U as o, b as s, N as f, s as c, v as i } from "../../../vendor/Package.internal.55.mjs";
const u = "ffffffff-ffff-ffff-ffff-ffffffffffff";
let a;
const l = new Uint8Array(16);
function d() {
if (!a) {
if (typeof crypto === "undefined" || !crypto.getRandomValues) {
throw new Error("crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported");
}
a = crypto.getRandomValues.bind(crypto);
}
return a(l);
}
const U = {};
function g(t, e, r) {
let o;
const s = t?._v6 ?? false;
if (t) {
const n = Object.keys(t);
if (n.length === 1 && n[0] === "_v6") {
t = undefined;
}
}
if (t) {
o = m(t.random ?? t.rng?.() ?? d(), t.msecs, t.nsecs, t.clockseq, t.node, e, r);
} else {
const n = Date.now();
const t = d();
y(U, n, t);
o = m(t, U.msecs, U.nsecs, s ? undefined : U.clockseq, s ? undefined : U.node, e, r);
}
return e ?? n(o);
}
function y(n, t, e) {
n.msecs ??= -Infinity;
n.nsecs ??= 0;
if (t === n.msecs) {
n.nsecs++;
if (n.nsecs >= 1e4) {
n.node = undefined;
n.nsecs = 0;
}
} else if (t > n.msecs) {
n.nsecs = 0;
} else if (t < n.msecs) {
n.node = undefined;
}
if (!n.node) {
n.node = e.slice(10, 16);
n.node[0] |= 1;
n.clockseq = (e[8] << 8 | e[9]) & 16383;
}
n.msecs = t;
return n;
}
function m(n, t, e, r, o, s, f = 0) {
if (n.length < 16) {
throw new Error("Random bytes length must be >= 16");
}
if (!s) {
s = new Uint8Array(16);
f = 0;
} else {
if (f < 0 || f + 16 > s.length) {
throw new RangeError(`UUID byte range ${f}:${f + 15} is out of buffer bounds`);
}
}
t ??= Date.now();
e ??= 0;
r ??= (n[8] << 8 | n[9]) & 16383;
o ??= n.slice(10, 16);
t += 122192928e5;
const c = ((t & 268435455) * 1e4 + e) % 4294967296;
s[f++] = c >>> 24 & 255;
s[f++] = c >>> 16 & 255;
s[f++] = c >>> 8 & 255;
s[f++] = c & 255;
const i = t / 4294967296 * 1e4 & 268435455;
s[f++] = i >>> 8 & 255;
s[f++] = i & 255;
s[f++] = i >>> 24 & 15 | 16;
s[f++] = i >>> 16 & 255;
s[f++] = r >>> 8 | 128;
s[f++] = r & 255;
for (let n = 0; n < 6; ++n) {
s[f++] = o[n];
}
return s;
}
function h(e) {
const r = typeof e === "string" ? t(e) : e;
const o = p(r);
return typeof e === "string" ? n(o) : o;
}
function p(n) {
return Uint8Array.of((n[6] & 15) << 4 | n[7] >> 4 & 15, (n[7] & 15) << 4 | (n[4] & 240) >> 4, (n[4] & 15) << 4 | (n[5] & 240) >> 4, (n[5] & 15) << 4 | (n[0] & 240) >> 4, (n[0] & 15) << 4 | (n[1] & 240) >> 4, (n[1] & 15) << 4 | (n[2] & 240) >> 4, 96 | n[2] & 15, n[3], n[8], n[9], n[10], n[11], n[12], n[13], n[14], n[15]);
}
function w(n) {
const t = I(n);
const e = D(t, n.length * 8);
return b(e);
}
function b(n) {
const t = new Uint8Array(n.length * 4);
for (let e = 0; e < n.length * 4; e++) {
t[e] = n[e >> 2] >>> e % 4 * 8 & 255;
}
return t;
}
function v(n) {
return (n + 64 >>> 9 << 4) + 14 + 1;
}
function D(n, t) {
const e = new Uint32Array(v(t)).fill(0);
e.set(n);
e[t >> 5] |= 128 << t % 32;
e[e.length - 1] = t;
n = e;
let r = 1732584193;
let o = -271733879;
let s = -1732584194;
let f = 271733878;
for (let t = 0; t < n.length; t += 16) {
const e = r;
const c = o;
const i = s;
const u = f;
r = k(r, o, s, f, n[t], 7, -680876936);
f = k(f, r, o, s, n[t + 1], 12, -389564586);
s = k(s, f, r, o, n[t + 2], 17, 606105819);
o = k(o, s, f, r, n[t + 3], 22, -1044525330);
r = k(r, o, s, f, n[t + 4], 7, -176418897);
f = k(f, r, o, s, n[t + 5], 12, 1200080426);
s = k(s, f, r, o, n[t + 6], 17, -1473231341);
o = k(o, s, f, r, n[t + 7], 22, -45705983);
r = k(r, o, s, f, n[t + 8], 7, 1770035416);
f = k(f, r, o, s, n[t + 9], 12, -1958414417);
s = k(s, f, r, o, n[t + 10], 17, -42063);
o = k(o, s, f, r, n[t + 11], 22, -1990404162);
r = k(r, o, s, f, n[t + 12], 7, 1804603682);
f = k(f, r, o, s, n[t + 13], 12, -40341101);
s = k(s, f, r, o, n[t + 14], 17, -1502002290);
o = k(o, s, f, r, n[t + 15], 22, 1236535329);
r = $(r, o, s, f, n[t + 1], 5, -165796510);
f = $(f, r, o, s, n[t + 6], 9, -1069501632);
s = $(s, f, r, o, n[t + 11], 14, 643717713);
o = $(o, s, f, r, n[t], 20, -373897302);
r = $(r, o, s, f, n[t + 5], 5, -701558691);
f = $(f, r, o, s, n[t + 10], 9, 38016083);
s = $(s, f, r, o, n[t + 15], 14, -660478335);
o = $(o, s, f, r, n[t + 4], 20, -405537848);
r = $(r, o, s, f, n[t + 9], 5, 568446438);
f = $(f, r, o, s, n[t + 14], 9, -1019803690);
s = $(s, f, r, o, n[t + 3], 14, -187363961);
o = $(o, s, f, r, n[t + 8], 20, 1163531501);
r = $(r, o, s, f, n[t + 13], 5, -1444681467);
f = $(f, r, o, s, n[t + 2], 9, -51403784);
s = $(s, f, r, o, n[t + 7], 14, 1735328473);
o = $(o, s, f, r, n[t + 12], 20, -1926607734);
r = j(r, o, s, f, n[t + 5], 4, -378558);
f = j(f, r, o, s, n[t + 8], 11, -2022574463);
s = j(s, f, r, o, n[t + 11], 16, 1839030562);
o = j(o, s, f, r, n[t + 14], 23, -35309556);
r = j(r, o, s, f, n[t + 1], 4, -1530992060);
f = j(f, r, o, s, n[t + 4], 11, 1272893353);
s = j(s, f, r, o, n[t + 7], 16, -155497632);
o = j(o, s, f, r, n[t + 10], 23, -1094730640);
r = j(r, o, s, f, n[t + 13], 4, 681279174);
f = j(f, r, o, s, n[t], 11, -358537222);
s = j(s, f, r, o, n[t + 3], 16, -722521979);
o = j(o, s, f, r, n[t + 6], 23, 76029189);
r = j(r, o, s, f, n[t + 9], 4, -640364487);
f = j(f, r, o, s, n[t + 12], 11, -421815835);
s = j(s, f, r, o, n[t + 15], 16, 530742520);
o = j(o, s, f, r, n[t + 2], 23, -995338651);
r = q(r, o, s, f, n[t], 6, -198630844);
f = q(f, r, o, s, n[t + 7], 10, 1126891415);
s = q(s, f, r, o, n[t + 14], 15, -1416354905);
o = q(o, s, f, r, n[t + 5], 21, -57434055);
r = q(r, o, s, f, n[t + 12], 6, 1700485571);
f = q(f, r, o, s, n[t + 3], 10, -1894986606);
s = q(s, f, r, o, n[t + 10], 15, -1051523);
o = q(o, s, f, r, n[t + 1], 21, -2054922799);
r = q(r, o, s, f, n[t + 8], 6, 1873313359);
f = q(f, r, o, s, n[t + 15], 10, -30611744);
s = q(s, f, r, o, n[t + 6], 15, -1560198380);
o = q(o, s, f, r, n[t + 13], 21, 1309151649);
r = q(r, o, s, f, n[t + 4], 6, -145523070);
f = q(f, r, o, s, n[t + 11], 10, -1120210379);
s = q(s, f, r, o, n[t + 2], 15, 718787259);
o = q(o, s, f, r, n[t + 9], 21, -343485551);
r = A(r, e);
o = A(o, c);
s = A(s, i);
f = A(f, u);
}
return Uint32Array.of(r, o, s, f);
}
function I(n) {
if (n.length === 0) {
return new Uint32Array;
}
const t = new Uint32Array(v(n.length * 8)).fill(0);
for (let e = 0; e < n.length; e++) {
t[e >> 2] |= (n[e] & 255) << e % 4 * 8;
}
return t;
}
function A(n, t) {
const e = (n & 65535) + (t & 65535);
const r = (n >> 16) + (t >> 16) + (e >> 16);
return r << 16 | e & 65535;
}
function R(n, t) {
return n << t | n >>> 32 - t;
}
function E(n, t, e, r, o, s) {
return A(R(A(A(t, n), A(r, s)), o), e);
}
function k(n, t, e, r, o, s, f) {
return E(t & e | ~t & r, n, t, o, s, f);
}
function $(n, t, e, r, o, s, f) {
return E(t & r | e & ~r, n, t, o, s, f);
}
function j(n, t, e, r, o, s, f) {
return E(t ^ e ^ r, n, t, o, s, f);
}
function q(n, t, e, r, o, s, f) {
return E(e ^ (t | ~r), n, t, o, s, f);
}
function N(n, t, r, o) {
return e(48, w, n, t, r, o);
}
N.DNS = r;
N.URL = o;
const V = typeof crypto !== "undefined" && crypto.randomUUID && crypto.randomUUID.bind(crypto);
const _ = {
randomUUID: V
};
function L(t, e, r) {
t = t || {};
const o = t.random ?? t.rng?.() ?? d();
if (o.length < 16) {
throw new Error("Random bytes length must be >= 16");
}
o[6] = o[6] & 15 | 64;
o[8] = o[8] & 63 | 128;
if (e) {
r = r || 0;
if (r < 0 || r + 16 > e.length) {
throw new RangeError(`UUID byte range ${r}:${r + 15} is out of buffer bounds`);
}
for (let n = 0; n < 16; ++n) {
e[r + n] = o[n];
}
return e;
}
return n(o);
}
function S(n, t, e) {
if (_.randomUUID && !t && !n) {
return _.randomUUID();
}
return L(n, t, e);
}
function x(t, e, r) {
t ??= {};
r ??= 0;
let o = g({
...t,
_v6: true
}, new Uint8Array(16));
o = h(o);
if (e) {
for (let n = 0; n < 16; n++) {
e[r + n] = o[n];
}
return e;
}
return n(o);
}
function M(n) {
if (!s(n)) {
throw TypeError("Invalid UUID");
}
return parseInt(n.slice(14, 15), 16);
}
class UUID {
static {
this.NIL = f;
}
static {
this.MAX = u;
}
static parse(n) {
return t(n);
}
static stringify(n, t) {
return c(n, t);
}
static v1(n, t, e) {
return g(n, t, e);
}
static v3(n, t, e, r) {
return N(n, t, e, r);
}
static v4(n, t, e) {
return S(n, t, e);
}
static v5(n, t, e, r) {
return i(n, t, e, r);
}
static v6(n, t, e) {
return x(n, t, e);
}
static validate(n) {
return s(n);
}
static version(n) {
return M(n);
}
}
export { UUID };