lakutata 2.0.80 → 2.0.82

package/vendor/Package.64.mjs

@@ -1,543 +1,191 @@
-const n = "ffffffff-ffff-ffff-ffff-ffffffffffff";
-
-const t = "00000000-0000-0000-0000-000000000000";
-
-const e = /^(?:[0-9a-f]{8}-[0-9a-f]{4}-[1-8][0-9a-f]{3}-[89ab][0-9a-f]{3}-[0-9a-f]{12}|00000000-0000-0000-0000-000000000000|ffffffff-ffff-ffff-ffff-ffffffffffff)$/i;
-
-function r(n) {
-    return typeof n === "string" && e.test(n);
-}
-
-function o(n) {
-    if (!r(n)) {
-        throw TypeError("Invalid UUID");
-    }
-    let t;
-    return Uint8Array.of((t = parseInt(n.slice(0, 8), 16)) >>> 24, t >>> 16 & 255, t >>> 8 & 255, t & 255, (t = parseInt(n.slice(9, 13), 16)) >>> 8, t & 255, (t = parseInt(n.slice(14, 18), 16)) >>> 8, t & 255, (t = parseInt(n.slice(19, 23), 16)) >>> 8, t & 255, (t = parseInt(n.slice(24, 36), 16)) / 1099511627776 & 255, t / 4294967296 & 255, t >>> 24 & 255, t >>> 16 & 255, t >>> 8 & 255, t & 255);
-}
-
-const f = [];
-
-for (let n = 0; n < 256; ++n) {
-    f.push((n + 256).toString(16).slice(1));
-}
-
-function s(n, t = 0) {
-    return (f[n[t + 0]] + f[n[t + 1]] + f[n[t + 2]] + f[n[t + 3]] + "-" + f[n[t + 4]] + f[n[t + 5]] + "-" + f[n[t + 6]] + f[n[t + 7]] + "-" + f[n[t + 8]] + f[n[t + 9]] + "-" + f[n[t + 10]] + f[n[t + 11]] + f[n[t + 12]] + f[n[t + 13]] + f[n[t + 14]] + f[n[t + 15]]).toLowerCase();
-}
-
-function c(n, t = 0) {
-    const e = s(n, t);
-    if (!r(e)) {
-        throw TypeError("Stringified UUID is invalid");
-    }
-    return e;
-}
-
-let i;
-
-const u = new Uint8Array(16);
-
-function a() {
-    if (!i) {
-        if (typeof crypto === "undefined" || !crypto.getRandomValues) {
-            throw new Error("crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported");
-        }
-        i = crypto.getRandomValues.bind(crypto);
-    }
-    return i(u);
-}
-
-const l = {};
-
-function d(n, t, e) {
-    let r;
-    const o = n?._v6 ?? false;
-    if (n) {
-        const t = Object.keys(n);
-        if (t.length === 1 && t[0] === "_v6") {
-            n = undefined;
-        }
-    }
-    if (n) {
-        r = y(n.random ?? n.rng?.() ?? a(), n.msecs, n.nsecs, n.clockseq, n.node, t, e);
-    } else {
-        const n = Date.now();
-        const f = a();
-        g(l, n, f);
-        r = y(f, l.msecs, l.nsecs, o ? undefined : l.clockseq, o ? undefined : l.node, t, e);
-    }
-    return t ?? s(r);
+function isObject$1(e) {
+    return typeof e === "object" && e !== null;
 }
 
-function g(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 isArrayLike$1(e) {
+    return isObject$1(e) && typeof e.length === "number";
 }
 
-function y(n, t, e, r, o, f, s = 0) {
-    if (n.length < 16) {
-        throw new Error("Random bytes length must be >= 16");
-    }
-    if (!f) {
-        f = new Uint8Array(16);
-        s = 0;
+function arrayify(e) {
+    if (Array.isArray(e)) {
+        return e;
+    } else if (e === undefined) {
+        return [];
+    } else if (isArrayLike$1(e) || e instanceof Set) {
+        return Array.from(e);
     } else {
-        if (s < 0 || s + 16 > f.length) {
-            throw new RangeError(`UUID byte range ${s}:${s + 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;
-    f[s++] = c >>> 24 & 255;
-    f[s++] = c >>> 16 & 255;
-    f[s++] = c >>> 8 & 255;
-    f[s++] = c & 255;
-    const i = t / 4294967296 * 1e4 & 268435455;
-    f[s++] = i >>> 8 & 255;
-    f[s++] = i & 255;
-    f[s++] = i >>> 24 & 15 | 16;
-    f[s++] = i >>> 16 & 255;
-    f[s++] = r >>> 8 | 128;
-    f[s++] = r & 255;
-    for (let n = 0; n < 6; ++n) {
-        f[s++] = o[n];
-    }
-    return f;
-}
-
-function h(n) {
-    const t = typeof n === "string" ? o(n) : n;
-    const e = U(t);
-    return typeof n === "string" ? s(e) : e;
-}
-
-function U(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 p(n) {
-    const t = I(n);
-    const e = b(t, n.length * 8);
-    return w(e);
-}
-
-function w(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 [ e ];
     }
-    return t;
 }
 
-function m(n) {
-    return (n + 64 >>> 9 << 4) + 14 + 1;
+function isNumber(e) {
+    return !isNaN(parseFloat(e));
 }
 
-function b(n, t) {
-    const e = new Uint32Array(m(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 f = -1732584194;
-    let s = 271733878;
-    for (let t = 0; t < n.length; t += 16) {
-        const e = r;
-        const c = o;
-        const i = f;
-        const u = s;
-        r = E(r, o, f, s, n[t], 7, -680876936);
-        s = E(s, r, o, f, n[t + 1], 12, -389564586);
-        f = E(f, s, r, o, n[t + 2], 17, 606105819);
-        o = E(o, f, s, r, n[t + 3], 22, -1044525330);
-        r = E(r, o, f, s, n[t + 4], 7, -176418897);
-        s = E(s, r, o, f, n[t + 5], 12, 1200080426);
-        f = E(f, s, r, o, n[t + 6], 17, -1473231341);
-        o = E(o, f, s, r, n[t + 7], 22, -45705983);
-        r = E(r, o, f, s, n[t + 8], 7, 1770035416);
-        s = E(s, r, o, f, n[t + 9], 12, -1958414417);
-        f = E(f, s, r, o, n[t + 10], 17, -42063);
-        o = E(o, f, s, r, n[t + 11], 22, -1990404162);
-        r = E(r, o, f, s, n[t + 12], 7, 1804603682);
-        s = E(s, r, o, f, n[t + 13], 12, -40341101);
-        f = E(f, s, r, o, n[t + 14], 17, -1502002290);
-        o = E(o, f, s, r, n[t + 15], 22, 1236535329);
-        r = q(r, o, f, s, n[t + 1], 5, -165796510);
-        s = q(s, r, o, f, n[t + 6], 9, -1069501632);
-        f = q(f, s, r, o, n[t + 11], 14, 643717713);
-        o = q(o, f, s, r, n[t], 20, -373897302);
-        r = q(r, o, f, s, n[t + 5], 5, -701558691);
-        s = q(s, r, o, f, n[t + 10], 9, 38016083);
-        f = q(f, s, r, o, n[t + 15], 14, -660478335);
-        o = q(o, f, s, r, n[t + 4], 20, -405537848);
-        r = q(r, o, f, s, n[t + 9], 5, 568446438);
-        s = q(s, r, o, f, n[t + 14], 9, -1019803690);
-        f = q(f, s, r, o, n[t + 3], 14, -187363961);
-        o = q(o, f, s, r, n[t + 8], 20, 1163531501);
-        r = q(r, o, f, s, n[t + 13], 5, -1444681467);
-        s = q(s, r, o, f, n[t + 2], 9, -51403784);
-        f = q(f, s, r, o, n[t + 7], 14, 1735328473);
-        o = q(o, f, s, r, n[t + 12], 20, -1926607734);
-        r = v(r, o, f, s, n[t + 5], 4, -378558);
-        s = v(s, r, o, f, n[t + 8], 11, -2022574463);
-        f = v(f, s, r, o, n[t + 11], 16, 1839030562);
-        o = v(o, f, s, r, n[t + 14], 23, -35309556);
-        r = v(r, o, f, s, n[t + 1], 4, -1530992060);
-        s = v(s, r, o, f, n[t + 4], 11, 1272893353);
-        f = v(f, s, r, o, n[t + 7], 16, -155497632);
-        o = v(o, f, s, r, n[t + 10], 23, -1094730640);
-        r = v(r, o, f, s, n[t + 13], 4, 681279174);
-        s = v(s, r, o, f, n[t], 11, -358537222);
-        f = v(f, s, r, o, n[t + 3], 16, -722521979);
-        o = v(o, f, s, r, n[t + 6], 23, 76029189);
-        r = v(r, o, f, s, n[t + 9], 4, -640364487);
-        s = v(s, r, o, f, n[t + 12], 11, -421815835);
-        f = v(f, s, r, o, n[t + 15], 16, 530742520);
-        o = v(o, f, s, r, n[t + 2], 23, -995338651);
-        r = $(r, o, f, s, n[t], 6, -198630844);
-        s = $(s, r, o, f, n[t + 7], 10, 1126891415);
-        f = $(f, s, r, o, n[t + 14], 15, -1416354905);
-        o = $(o, f, s, r, n[t + 5], 21, -57434055);
-        r = $(r, o, f, s, n[t + 12], 6, 1700485571);
-        s = $(s, r, o, f, n[t + 3], 10, -1894986606);
-        f = $(f, s, r, o, n[t + 10], 15, -1051523);
-        o = $(o, f, s, r, n[t + 1], 21, -2054922799);
-        r = $(r, o, f, s, n[t + 8], 6, 1873313359);
-        s = $(s, r, o, f, n[t + 15], 10, -30611744);
-        f = $(f, s, r, o, n[t + 6], 15, -1560198380);
-        o = $(o, f, s, r, n[t + 13], 21, 1309151649);
-        r = $(r, o, f, s, n[t + 4], 6, -145523070);
-        s = $(s, r, o, f, n[t + 11], 10, -1120210379);
-        f = $(f, s, r, o, n[t + 2], 15, 718787259);
-        o = $(o, f, s, r, n[t + 9], 21, -343485551);
-        r = A(r, e);
-        o = A(o, c);
-        f = A(f, i);
-        s = A(s, u);
-    }
-    return Uint32Array.of(r, o, f, s);
+function isFiniteNumber(e) {
+    return !isNaN(parseFloat(e)) && isFinite(e);
 }
 
-function I(n) {
-    if (n.length === 0) {
-        return new Uint32Array;
-    }
-    const t = new Uint32Array(m(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 isPlainObject(e) {
+    return e !== null && typeof e === "object" && e.constructor === Object;
 }
 
-function A(n, t) {
-    const e = (n & 65535) + (t & 65535);
-    const r = (n >> 16) + (t >> 16) + (e >> 16);
-    return r << 16 | e & 65535;
+function isArrayLike(e) {
+    return isObject(e) && typeof e.length === "number";
 }
 
-function D(n, t) {
-    return n << t | n >>> 32 - t;
+function isObject(e) {
+    return typeof e === "object" && e !== null;
 }
 
-function R(n, t, e, r, o, f) {
-    return A(D(A(A(t, n), A(r, f)), o), e);
+function isDefined(e) {
+    return typeof e !== "undefined";
 }
 
-function E(n, t, e, r, o, f, s) {
-    return R(t & e | ~t & r, n, t, o, f, s);
+function isUndefined(e) {
+    return !isDefined(e);
 }
 
-function q(n, t, e, r, o, f, s) {
-    return R(t & r | e & ~r, n, t, o, f, s);
+function isNull(e) {
+    return e === null;
 }
 
-function v(n, t, e, r, o, f, s) {
-    return R(t ^ e ^ r, n, t, o, f, s);
+function isDefinedValue(e) {
+    return isDefined(e) && !isNull(e) && !Number.isNaN(e);
 }
 
-function $(n, t, e, r, o, f, s) {
-    return R(e ^ (t | ~r), n, t, o, f, s);
-}
-
-function k(n) {
-    n = unescape(encodeURIComponent(n));
-    const t = new Uint8Array(n.length);
-    for (let e = 0; e < n.length; ++e) {
-        t[e] = n.charCodeAt(e);
-    }
-    return t;
-}
-
-const M = "6ba7b810-9dad-11d1-80b4-00c04fd430c8";
-
-const S = "6ba7b811-9dad-11d1-80b4-00c04fd430c8";
-
-function N(n, t, e, r, f, c) {
-    const i = typeof e === "string" ? k(e) : e;
-    const u = typeof r === "string" ? o(r) : r;
-    if (typeof r === "string") {
-        r = o(r);
-    }
-    if (r?.length !== 16) {
-        throw TypeError("Namespace must be array-like (16 iterable integer values, 0-255)");
-    }
-    let a = new Uint8Array(16 + i.length);
-    a.set(u);
-    a.set(i, u.length);
-    a = t(a);
-    a[6] = a[6] & 15 | n;
-    a[8] = a[8] & 63 | 128;
-    if (f) {
-        c = c || 0;
-        for (let n = 0; n < 16; ++n) {
-            f[c + n] = a[n];
-        }
-        return f;
+function isClass(e) {
+    if (typeof e === "function") {
+        return /^class /.test(Function.prototype.toString.call(e));
+    } else {
+        return false;
     }
-    return s(a);
-}
-
-function T(n, t, e, r) {
-    return N(48, p, n, t, e, r);
 }
 
-T.DNS = M;
-
-T.URL = S;
-
-const C = typeof crypto !== "undefined" && crypto.randomUUID && crypto.randomUUID.bind(crypto);
-
-const L = {
-    randomUUID: C
-};
-
-function V(n, t, e) {
-    n = n || {};
-    const r = n.random ?? n.rng?.() ?? a();
-    if (r.length < 16) {
-        throw new Error("Random bytes length must be >= 16");
-    }
-    r[6] = r[6] & 15 | 64;
-    r[8] = r[8] & 63 | 128;
-    if (t) {
-        e = e || 0;
-        if (e < 0 || e + 16 > t.length) {
-            throw new RangeError(`UUID byte range ${e}:${e + 15} is out of buffer bounds`);
-        }
-        for (let n = 0; n < 16; ++n) {
-            t[e + n] = r[n];
-        }
-        return t;
-    }
-    return s(r);
-}
+function isPrimitive(e) {
+    if (e === null) return true;
+    switch (typeof e) {
+      case "string":
+      case "number":
+      case "symbol":
+      case "undefined":
+      case "boolean":
+        return true;
 
-function _(n, t, e) {
-    if (L.randomUUID && !t && !n) {
-        return L.randomUUID();
+      default:
+        return false;
     }
-    return V(n, t, e);
 }
 
-function j(n, t, e, r) {
-    switch (n) {
-      case 0:
-        return t & e ^ ~t & r;
-
-      case 1:
-        return t ^ e ^ r;
-
-      case 2:
-        return t & e ^ t & r ^ e & r;
-
-      case 3:
-        return t ^ e ^ r;
+function isPromise(e) {
+    if (e) {
+        const n = isDefined(Promise) && e instanceof Promise;
+        const i = e.then && typeof e.then === "function";
+        return !!(n || i);
+    } else {
+        return false;
     }
 }
 
-function x(n, t) {
-    return n << t | n >>> 32 - t;
-}
-
-function O(n) {
-    const t = [ 1518500249, 1859775393, 2400959708, 3395469782 ];
-    const e = [ 1732584193, 4023233417, 2562383102, 271733878, 3285377520 ];
-    const r = new Uint8Array(n.length + 1);
-    r.set(n);
-    r[n.length] = 128;
-    n = r;
-    const o = n.length / 4 + 2;
-    const f = Math.ceil(o / 16);
-    const s = new Array(f);
-    for (let t = 0; t < f; ++t) {
-        const e = new Uint32Array(16);
-        for (let r = 0; r < 16; ++r) {
-            e[r] = n[t * 64 + r * 4] << 24 | n[t * 64 + r * 4 + 1] << 16 | n[t * 64 + r * 4 + 2] << 8 | n[t * 64 + r * 4 + 3];
-        }
-        s[t] = e;
-    }
-    s[f - 1][14] = (n.length - 1) * 8 / Math.pow(2, 32);
-    s[f - 1][14] = Math.floor(s[f - 1][14]);
-    s[f - 1][15] = (n.length - 1) * 8 & 4294967295;
-    for (let n = 0; n < f; ++n) {
-        const r = new Uint32Array(80);
-        for (let t = 0; t < 16; ++t) {
-            r[t] = s[n][t];
-        }
-        for (let n = 16; n < 80; ++n) {
-            r[n] = x(r[n - 3] ^ r[n - 8] ^ r[n - 14] ^ r[n - 16], 1);
-        }
-        let o = e[0];
-        let f = e[1];
-        let c = e[2];
-        let i = e[3];
-        let u = e[4];
-        for (let n = 0; n < 80; ++n) {
-            const e = Math.floor(n / 20);
-            const s = x(o, 5) + j(e, f, c, i) + u + t[e] + r[n] >>> 0;
-            u = i;
-            i = c;
-            c = x(f, 30) >>> 0;
-            f = o;
-            o = s;
-        }
-        e[0] = e[0] + o >>> 0;
-        e[1] = e[1] + f >>> 0;
-        e[2] = e[2] + c >>> 0;
-        e[3] = e[3] + i >>> 0;
-        e[4] = e[4] + u >>> 0;
+function isIterable(e) {
+    if (e === null || !isDefined(e)) {
+        return false;
+    } else {
+        return typeof e[Symbol.iterator] === "function" || typeof e[Symbol.asyncIterator] === "function";
     }
-    return Uint8Array.of(e[0] >> 24, e[0] >> 16, e[0] >> 8, e[0], e[1] >> 24, e[1] >> 16, e[1] >> 8, e[1], e[2] >> 24, e[2] >> 16, e[2] >> 8, e[2], e[3] >> 24, e[3] >> 16, e[3] >> 8, e[3], e[4] >> 24, e[4] >> 16, e[4] >> 8, e[4]);
 }
 
-function z(n, t, e, r) {
-    return N(80, O, n, t, e, r);
+function isString(e) {
+    return typeof e === "string";
 }
 
-z.DNS = M;
-
-z.URL = S;
-
-function B(n, t, e) {
-    n ??= {};
-    e ??= 0;
-    let r = d({
-        ...n,
-        _v6: true
-    }, new Uint8Array(16));
-    r = h(r);
-    if (t) {
-        for (let n = 0; n < 16; n++) {
-            t[e + n] = r[n];
-        }
-        return t;
-    }
-    return s(r);
+function isFunction(e) {
+    return typeof e === "function";
 }
 
-function F(n) {
-    const t = typeof n === "string" ? o(n) : n;
-    const e = G(t);
-    return typeof n === "string" ? s(e) : e;
+function isAsyncFunction(e) {
+    return typeof e === "function" && e.constructor.name === "AsyncFunction";
 }
 
-function G(n) {
-    return Uint8Array.of((n[3] & 15) << 4 | n[4] >> 4 & 15, (n[4] & 15) << 4 | (n[5] & 240) >> 4, (n[5] & 15) << 4 | n[6] & 15, n[7], (n[1] & 15) << 4 | (n[2] & 240) >> 4, (n[2] & 15) << 4 | (n[3] & 240) >> 4, 16 | (n[0] & 240) >> 4, (n[0] & 15) << 4 | (n[1] & 240) >> 4, n[8], n[9], n[10], n[11], n[12], n[13], n[14], n[15]);
-}
-
-const H = {};
+const e = {
+    isNumber,
+    isFiniteNumber,
+    isPlainObject,
+    isArrayLike,
+    isObject,
+    isDefined,
+    isUndefined,
+    isNull,
+    isDefinedValue,
+    isClass,
+    isPrimitive,
+    isPromise,
+    isIterable,
+    isString,
+    isFunction,
+    isAsyncFunction
+};
 
-function J(n, t, e) {
-    let r;
-    if (n) {
-        r = P(n.random ?? n.rng?.() ?? a(), n.msecs, n.seq, t, e);
-    } else {
-        const n = Date.now();
-        const o = a();
-        K(H, n, o);
-        r = P(o, H.msecs, H.seq, t, e);
-    }
-    return t ?? s(r);
+function sortArray(e, n = {}) {
+    n = Object.assign({
+        computed: {},
+        customOrders: {},
+        nullRank: 1,
+        undefinedRank: 1,
+        nanRank: 1
+    }, n);
+    e.sort(getCompareFunc(n));
+    return e;
 }
 
-function K(n, t, e) {
-    n.msecs ??= -Infinity;
-    n.seq ??= 0;
-    if (t > n.msecs) {
-        n.seq = e[6] << 23 | e[7] << 16 | e[8] << 8 | e[9];
-        n.msecs = t;
-    } else {
-        n.seq = n.seq + 1 | 0;
-        if (n.seq === 0) {
-            n.msecs++;
+function getCompareFunc(n = {}) {
+    const i = arrayify(n.by);
+    const s = arrayify(n.order);
+    const {customOrders: t, computed: r} = n;
+    return function compareFunc(u, f, o = 0) {
+        const c = s[o] || "asc";
+        if (!(c === "asc" || c === "desc" || t[c])) {
+            return 0;
         }
-    }
-    return n;
-}
-
-function P(n, t, e, r, o = 0) {
-    if (n.length < 16) {
-        throw new Error("Random bytes length must be >= 16");
-    }
-    if (!r) {
-        r = new Uint8Array(16);
-        o = 0;
-    } else {
-        if (o < 0 || o + 16 > r.length) {
-            throw new RangeError(`UUID byte range ${o}:${o + 15} is out of buffer bounds`);
+        let l, a, d;
+        if (i.length) {
+            a = e.isDefined(u[i[o]]) ? u[i[o]] : r[i[o]] && r[i[o]](u);
+            d = e.isDefined(f[i[o]]) ? f[i[o]] : r[i[o]] && r[i[o]](f);
+        } else {
+            a = u;
+            d = f;
         }
-    }
-    t ??= Date.now();
-    e ??= n[6] * 127 << 24 | n[7] << 16 | n[8] << 8 | n[9];
-    r[o++] = t / 1099511627776 & 255;
-    r[o++] = t / 4294967296 & 255;
-    r[o++] = t / 16777216 & 255;
-    r[o++] = t / 65536 & 255;
-    r[o++] = t / 256 & 255;
-    r[o++] = t & 255;
-    r[o++] = 112 | e >>> 28 & 15;
-    r[o++] = e >>> 20 & 255;
-    r[o++] = 128 | e >>> 14 & 63;
-    r[o++] = e >>> 6 & 255;
-    r[o++] = e << 2 & 255 | n[10] & 3;
-    r[o++] = n[11];
-    r[o++] = n[12];
-    r[o++] = n[13];
-    r[o++] = n[14];
-    r[o++] = n[15];
-    return r;
-}
-
-function Q(n) {
-    if (!r(n)) {
-        throw TypeError("Invalid UUID");
-    }
-    return parseInt(n.slice(14, 15), 16);
+        if (t && t[c]) {
+            l = t[c].indexOf(a) - t[c].indexOf(d);
+        } else if (a === d) {
+            l = 0;
+        } else if (e.isNull(a) && e.isUndefined(d)) {
+            l = c === "asc" ? 1 : c === "desc" ? -1 : 0;
+        } else if (e.isUndefined(a) && e.isNull(d)) {
+            l = c === "asc" ? -1 : c === "desc" ? 1 : 0;
+        } else if (e.isNull(a) && e.isDefinedValue(d)) {
+            l = n.nullRank;
+        } else if (e.isUndefined(a) && e.isDefinedValue(d)) {
+            l = n.undefinedRank;
+        } else if (Number.isNaN(a) && e.isDefinedValue(d)) {
+            l = n.nanRank;
+        } else if (e.isNull(d) && e.isDefinedValue(a)) {
+            l = -n.nullRank;
+        } else if (e.isUndefined(d) && e.isDefinedValue(a)) {
+            l = -n.undefinedRank;
+        } else if (Number.isNaN(d) && e.isDefinedValue(a)) {
+            l = -n.nanRank;
+        } else {
+            l = a < d ? -1 : a > d ? 1 : 0;
+            if (c === "desc") {
+                l = l * -1;
+            }
+        }
+        if (l === 0 && e.isDefined(i[o + 1])) {
+            l = compareFunc(u, f, o + 1);
+        }
+        return l;
+    };
 }
 
-export { n as M, t as N, d as a, T as b, _ as c, B as d, r as e, Q as f, o as p, c as s, z as v };
+export { sortArray as s };