lakutata 2.0.82 → 2.0.83

package/vendor/Package.64.cjs

@@ -1,62 +1,62 @@
 "use strict";
 
-function isObject$1(e) {
+function e(e) {
     return typeof e === "object" && e !== null;
 }
 
-function isArrayLike$1(e) {
-    return isObject$1(e) && typeof e.length === "number";
+function n(n) {
+    return e(n) && typeof n.length === "number";
 }
 
-function arrayify(e) {
+function i(e) {
     if (Array.isArray(e)) {
         return e;
     } else if (e === undefined) {
         return [];
-    } else if (isArrayLike$1(e) || e instanceof Set) {
+    } else if (n(e) || e instanceof Set) {
         return Array.from(e);
     } else {
         return [ e ];
     }
 }
 
-function isNumber(e) {
+function t(e) {
     return !isNaN(parseFloat(e));
 }
 
-function isFiniteNumber(e) {
+function r(e) {
     return !isNaN(parseFloat(e)) && isFinite(e);
 }
 
-function isPlainObject(e) {
+function s(e) {
     return e !== null && typeof e === "object" && e.constructor === Object;
 }
 
-function isArrayLike(e) {
-    return isObject(e) && typeof e.length === "number";
+function u(e) {
+    return f(e) && typeof e.length === "number";
 }
 
-function isObject(e) {
+function f(e) {
     return typeof e === "object" && e !== null;
 }
 
-function isDefined(e) {
+function o(e) {
     return typeof e !== "undefined";
 }
 
-function isUndefined(e) {
-    return !isDefined(e);
+function c(e) {
+    return !o(e);
 }
 
-function isNull(e) {
+function l(e) {
     return e === null;
 }
 
-function isDefinedValue(e) {
-    return isDefined(e) && !isNull(e) && !Number.isNaN(e);
+function a(e) {
+    return o(e) && !l(e) && !Number.isNaN(e);
 }
 
-function isClass(e) {
+function d(e) {
     if (typeof e === "function") {
         return /^class /.test(Function.prototype.toString.call(e));
     } else {
@@ -64,7 +64,7 @@ function isClass(e) {
     }
 }
 
-function isPrimitive(e) {
+function y(e) {
     if (e === null) return true;
     switch (typeof e) {
       case "string":
@@ -79,9 +79,9 @@ function isPrimitive(e) {
     }
 }
 
-function isPromise(e) {
+function b(e) {
     if (e) {
-        const n = isDefined(Promise) && e instanceof Promise;
+        const n = o(Promise) && e instanceof Promise;
         const i = e.then && typeof e.then === "function";
         return !!(n || i);
     } else {
@@ -89,46 +89,46 @@ function isPromise(e) {
     }
 }
 
-function isIterable(e) {
-    if (e === null || !isDefined(e)) {
+function m(e) {
+    if (e === null || !o(e)) {
         return false;
     } else {
         return typeof e[Symbol.iterator] === "function" || typeof e[Symbol.asyncIterator] === "function";
     }
 }
 
-function isString(e) {
+function p(e) {
     return typeof e === "string";
 }
 
-function isFunction(e) {
+function N(e) {
     return typeof e === "function";
 }
 
-function isAsyncFunction(e) {
+function D(e) {
     return typeof e === "function" && e.constructor.name === "AsyncFunction";
 }
 
-const e = {
-    isNumber,
-    isFiniteNumber,
-    isPlainObject,
-    isArrayLike,
-    isObject,
-    isDefined,
-    isUndefined,
-    isNull,
-    isDefinedValue,
-    isClass,
-    isPrimitive,
-    isPromise,
-    isIterable,
-    isString,
-    isFunction,
-    isAsyncFunction
+const k = {
+    isNumber: t,
+    isFiniteNumber: r,
+    isPlainObject: s,
+    isArrayLike: u,
+    isObject: f,
+    isDefined: o,
+    isUndefined: c,
+    isNull: l,
+    isDefinedValue: a,
+    isClass: d,
+    isPrimitive: y,
+    isPromise: b,
+    isIterable: m,
+    isString: p,
+    isFunction: N,
+    isAsyncFunction: D
 };
 
-function sortArray(e, n = {}) {
+function R(e, n = {}) {
     n = Object.assign({
         computed: {},
         customOrders: {},
@@ -136,58 +136,58 @@ function sortArray(e, n = {}) {
         undefinedRank: 1,
         nanRank: 1
     }, n);
-    e.sort(getCompareFunc(n));
+    e.sort(g(n));
     return e;
 }
 
-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])) {
+function g(e = {}) {
+    const n = i(e.by);
+    const t = i(e.order);
+    const {customOrders: r, computed: s} = e;
+    return function i(u, f, o = 0) {
+        const c = t[o] || "asc";
+        if (!(c === "asc" || c === "desc" || r[c])) {
             return 0;
         }
         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);
+        if (n.length) {
+            a = k.isDefined(u[n[o]]) ? u[n[o]] : s[n[o]] && s[n[o]](u);
+            d = k.isDefined(f[n[o]]) ? f[n[o]] : s[n[o]] && s[n[o]](f);
         } else {
             a = u;
             d = f;
         }
-        if (t && t[c]) {
-            l = t[c].indexOf(a) - t[c].indexOf(d);
+        if (r && r[c]) {
+            l = r[c].indexOf(a) - r[c].indexOf(d);
         } else if (a === d) {
             l = 0;
-        } else if (e.isNull(a) && e.isUndefined(d)) {
+        } else if (k.isNull(a) && k.isUndefined(d)) {
             l = c === "asc" ? 1 : c === "desc" ? -1 : 0;
-        } else if (e.isUndefined(a) && e.isNull(d)) {
+        } else if (k.isUndefined(a) && k.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 if (k.isNull(a) && k.isDefinedValue(d)) {
+            l = e.nullRank;
+        } else if (k.isUndefined(a) && k.isDefinedValue(d)) {
+            l = e.undefinedRank;
+        } else if (Number.isNaN(a) && k.isDefinedValue(d)) {
+            l = e.nanRank;
+        } else if (k.isNull(d) && k.isDefinedValue(a)) {
+            l = -e.nullRank;
+        } else if (k.isUndefined(d) && k.isDefinedValue(a)) {
+            l = -e.undefinedRank;
+        } else if (Number.isNaN(d) && k.isDefinedValue(a)) {
+            l = -e.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);
+        if (l === 0 && k.isDefined(n[o + 1])) {
+            l = i(u, f, o + 1);
         }
         return l;
     };
 }
 
-exports.sortArray = sortArray;
+exports.sortArray = R;

package/vendor/Package.64.mjs

@@ -1,60 +1,60 @@
-function isObject$1(e) {
+function e(e) {
     return typeof e === "object" && e !== null;
 }
 
-function isArrayLike$1(e) {
-    return isObject$1(e) && typeof e.length === "number";
+function n(n) {
+    return e(n) && typeof n.length === "number";
 }
 
-function arrayify(e) {
+function i(e) {
     if (Array.isArray(e)) {
         return e;
     } else if (e === undefined) {
         return [];
-    } else if (isArrayLike$1(e) || e instanceof Set) {
+    } else if (n(e) || e instanceof Set) {
         return Array.from(e);
     } else {
         return [ e ];
     }
 }
 
-function isNumber(e) {
+function t(e) {
     return !isNaN(parseFloat(e));
 }
 
-function isFiniteNumber(e) {
+function s(e) {
     return !isNaN(parseFloat(e)) && isFinite(e);
 }
 
-function isPlainObject(e) {
+function r(e) {
     return e !== null && typeof e === "object" && e.constructor === Object;
 }
 
-function isArrayLike(e) {
-    return isObject(e) && typeof e.length === "number";
+function u(e) {
+    return f(e) && typeof e.length === "number";
 }
 
-function isObject(e) {
+function f(e) {
     return typeof e === "object" && e !== null;
 }
 
-function isDefined(e) {
+function o(e) {
     return typeof e !== "undefined";
 }
 
-function isUndefined(e) {
-    return !isDefined(e);
+function c(e) {
+    return !o(e);
 }
 
-function isNull(e) {
+function l(e) {
     return e === null;
 }
 
-function isDefinedValue(e) {
-    return isDefined(e) && !isNull(e) && !Number.isNaN(e);
+function a(e) {
+    return o(e) && !l(e) && !Number.isNaN(e);
 }
 
-function isClass(e) {
+function d(e) {
     if (typeof e === "function") {
         return /^class /.test(Function.prototype.toString.call(e));
     } else {
@@ -62,7 +62,7 @@ function isClass(e) {
     }
 }
 
-function isPrimitive(e) {
+function y(e) {
     if (e === null) return true;
     switch (typeof e) {
       case "string":
@@ -77,9 +77,9 @@ function isPrimitive(e) {
     }
 }
 
-function isPromise(e) {
+function b(e) {
     if (e) {
-        const n = isDefined(Promise) && e instanceof Promise;
+        const n = o(Promise) && e instanceof Promise;
         const i = e.then && typeof e.then === "function";
         return !!(n || i);
     } else {
@@ -87,46 +87,46 @@ function isPromise(e) {
     }
 }
 
-function isIterable(e) {
-    if (e === null || !isDefined(e)) {
+function m(e) {
+    if (e === null || !o(e)) {
         return false;
     } else {
         return typeof e[Symbol.iterator] === "function" || typeof e[Symbol.asyncIterator] === "function";
     }
 }
 
-function isString(e) {
+function p(e) {
     return typeof e === "string";
 }
 
-function isFunction(e) {
+function N(e) {
     return typeof e === "function";
 }
 
-function isAsyncFunction(e) {
+function D(e) {
     return typeof e === "function" && e.constructor.name === "AsyncFunction";
 }
 
-const e = {
-    isNumber,
-    isFiniteNumber,
-    isPlainObject,
-    isArrayLike,
-    isObject,
-    isDefined,
-    isUndefined,
-    isNull,
-    isDefinedValue,
-    isClass,
-    isPrimitive,
-    isPromise,
-    isIterable,
-    isString,
-    isFunction,
-    isAsyncFunction
+const k = {
+    isNumber: t,
+    isFiniteNumber: s,
+    isPlainObject: r,
+    isArrayLike: u,
+    isObject: f,
+    isDefined: o,
+    isUndefined: c,
+    isNull: l,
+    isDefinedValue: a,
+    isClass: d,
+    isPrimitive: y,
+    isPromise: b,
+    isIterable: m,
+    isString: p,
+    isFunction: N,
+    isAsyncFunction: D
 };
 
-function sortArray(e, n = {}) {
+function R(e, n = {}) {
     n = Object.assign({
         computed: {},
         customOrders: {},
@@ -134,58 +134,58 @@ function sortArray(e, n = {}) {
         undefinedRank: 1,
         nanRank: 1
     }, n);
-    e.sort(getCompareFunc(n));
+    e.sort(g(n));
     return e;
 }
 
-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])) {
+function g(e = {}) {
+    const n = i(e.by);
+    const t = i(e.order);
+    const {customOrders: s, computed: r} = e;
+    return function i(u, f, o = 0) {
+        const c = t[o] || "asc";
+        if (!(c === "asc" || c === "desc" || s[c])) {
             return 0;
         }
         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);
+        if (n.length) {
+            a = k.isDefined(u[n[o]]) ? u[n[o]] : r[n[o]] && r[n[o]](u);
+            d = k.isDefined(f[n[o]]) ? f[n[o]] : r[n[o]] && r[n[o]](f);
         } else {
             a = u;
             d = f;
         }
-        if (t && t[c]) {
-            l = t[c].indexOf(a) - t[c].indexOf(d);
+        if (s && s[c]) {
+            l = s[c].indexOf(a) - s[c].indexOf(d);
         } else if (a === d) {
             l = 0;
-        } else if (e.isNull(a) && e.isUndefined(d)) {
+        } else if (k.isNull(a) && k.isUndefined(d)) {
             l = c === "asc" ? 1 : c === "desc" ? -1 : 0;
-        } else if (e.isUndefined(a) && e.isNull(d)) {
+        } else if (k.isUndefined(a) && k.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 if (k.isNull(a) && k.isDefinedValue(d)) {
+            l = e.nullRank;
+        } else if (k.isUndefined(a) && k.isDefinedValue(d)) {
+            l = e.undefinedRank;
+        } else if (Number.isNaN(a) && k.isDefinedValue(d)) {
+            l = e.nanRank;
+        } else if (k.isNull(d) && k.isDefinedValue(a)) {
+            l = -e.nullRank;
+        } else if (k.isUndefined(d) && k.isDefinedValue(a)) {
+            l = -e.undefinedRank;
+        } else if (Number.isNaN(d) && k.isDefinedValue(a)) {
+            l = -e.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);
+        if (l === 0 && k.isDefined(n[o + 1])) {
+            l = i(u, f, o + 1);
         }
         return l;
     };
 }
 
-export { sortArray as s };
+export { R as s };