@superutils/core 1.2.0 → 1.2.1

package/dist/index.js

@@ -27,8 +27,8 @@ var isArrLike = (x) => isArr(x) || x instanceof Set || x instanceof Map;
 var isArrLikeSafe = (x) => ["[object Array]", "[object Map]", "[object Set]"].includes(
   Object.prototype.toString.call(x)
 );
-var isArrUnique = (arr) => isArr(arr) && new Set(arr).size === arr.length;
-var isUint8Arr = (arr) => arr instanceof Uint8Array;
+var isArrUnique = (x) => isArr(x) && new Set(x).size === x.length;
+var isUint8Arr = (x) => x instanceof Uint8Array;
 var isArr_default = isArr;
 
 // src/is/isDate.ts
@@ -769,7 +769,7 @@ var sliceMap = (data, options) => {
 function sort(data, keyOrFn, options) {
   const dataType = isArr(data) ? 1 : isMap(data) ? 2 : isSet(data) ? 3 : 0;
   if (!dataType) return data;
-  const { ignoreCase, newInstance, reverse: reverse2, undefinedFirst } = {
+  const { asString, ignoreCase, newInstance, reverse: reverse2, undefinedFirst } = {
     ...sort.defaults,
     ...isObj(options) ? options : isObj(keyOrFn) ? keyOrFn : {}
   };
@@ -781,7 +781,7 @@ function sort(data, keyOrFn, options) {
       newInstance
     );
   }
-  const alt = undefinedFirst ? "" : "Z".repeat(10);
+  const alt = asString ? undefinedFirst ? "" : "Z".repeat(10) : undefinedFirst ? -Infinity : Infinity;
   const sorted = isFn(keyOrFn) ? arrReverse(
     // handle Set with comparator function
     [...data.entries()].sort(keyOrFn),
@@ -789,17 +789,18 @@ function sort(data, keyOrFn, options) {
     false
     // not required because of entries() & spread
   ) : (() => {
-    const key = keyOrFn;
-    const getVal = (obj) => {
-      var _a;
-      const value = `${(_a = isObj(obj) && key ? obj[key] : obj) != null ? _a : alt}`;
+    let index = 1;
+    const getVal = (target) => {
+      const val = isObj(target) && index !== 0 ? target[keyOrFn] : target;
+      if (!asString) return val;
+      const value = `${val != null ? val : alt}`;
       return ignoreCase ? value.toLowerCase() : value;
     };
-    const index = keyOrFn === true ? 0 : 1;
     const [gt, lt] = reverse2 ? [-1, 1] : [1, -1];
     if ([1, 3].includes(dataType)) {
       return (dataType === 3 || newInstance ? [...data] : data).sort((a, b) => getVal(a) > getVal(b) ? gt : lt);
     }
+    index = keyOrFn === true ? 0 : 1;
     return [...data.entries()].sort(
       (a, b) => getVal(a == null ? void 0 : a[index]) > getVal(b == null ? void 0 : b[index]) ? gt : lt
     );
@@ -815,6 +816,7 @@ function sort(data, keyOrFn, options) {
   return data;
 }
 sort.defaults = {
+  asString: true,
   ignoreCase: true,
   newInstance: false,
   reverse: false,

package/package.json

@@ -42,5 +42,6 @@
 	"sideEffects": false,
 	"type": "module",
 	"types": "dist/index.d.ts",
-	"version": "1.2.0"
+	"version": "1.2.1",
+	"gitHead": "a26f4b1bb701d99d4cb71443e18680ee3ea52974"
 }