util-helpers 4.23.4 → 4.23.5

package/dist/util-helpers.js

@@ -71,11 +71,7 @@
         }
         value = value.trim();
         var isBinary = reIsBinary.test(value);
-        return isBinary || reIsOctal.test(value)
-            ? parseInt(value.slice(2), isBinary ? 2 : 8)
-            : reIsBadHex.test(value)
-                ? NaN
-                : +value;
+        return isBinary || reIsOctal.test(value) ? parseInt(value.slice(2), isBinary ? 2 : 8) : reIsBadHex.test(value) ? NaN : +value;
     }
 
     function toInteger(value) {
@@ -172,7 +168,6 @@
     }
 
     var forEach = createForEach(1);
-    var forEach$1 = forEach;
 
     function isNumber(value) {
         return typeof value === 'number' || getTag(value) === numberTag;
@@ -225,14 +220,13 @@
     var freeGlobal = globalExisted && global.Object === Object && global;
     var freeSelf = selfExisted && self.Object === Object && self;
     var root = freeGlobalThis || freeGlobal || freeSelf || Function('return this')();
-    var root$1 = root;
 
     function isFinite$1(value) {
-        return numberIsFinite ? numberIsFinite(value) : typeof value === 'number' && root$1.isFinite(value);
+        return numberIsFinite ? numberIsFinite(value) : typeof value === 'number' && root.isFinite(value);
     }
 
     function isNaN(value) {
-        return isNumber(value) && root$1.isNaN(value);
+        return isNumber(value) && root.isNaN(value);
     }
 
     function isPromiseLike$1(value) {
@@ -277,10 +271,10 @@
     }
 
     var idCounter = 0;
+    var defaultPrefix$1 = '_' + Math.random().toString(36).substring(2, 4);
     function uniqueId(prefix) {
-        if (prefix === void 0) { prefix = ''; }
-        var id = ++idCounter;
-        return toString(prefix) + id;
+        if (prefix === void 0) { prefix = defaultPrefix$1; }
+        return '' + prefix + ++idCounter;
     }
 
     var reg$b = /^1[3456789]\d{9}$/;
@@ -780,18 +774,6 @@
         }
     }
 
-    function __values(o) {
-        var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
-        if (m) return m.call(o);
-        if (o && typeof o.length === "number") return {
-            next: function () {
-                if (o && i >= o.length) o = void 0;
-                return { value: o && o[i++], done: !o };
-            }
-        };
-        throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
-    }
-
     function __read(o, n) {
         var m = typeof Symbol === "function" && o[Symbol.iterator];
         if (!m) return o;
@@ -1271,7 +1253,7 @@
         if (deep === void 0) { deep = true; }
         if (isPlainObject(data)) {
             var result_1 = {};
-            forEach$1(data, function (value, key) {
+            forEach(data, function (value, key) {
                 var newValue = deep && (isPlainObject(value) || isArray(value)) ? transformObjectValue(value, fn) : fn(value, key);
                 result_1[key] = newValue;
             });
@@ -1279,7 +1261,7 @@
         }
         else if (isArray(data)) {
             var result_2 = [];
-            forEach$1(data, function (value, index) {
+            forEach(data, function (value, index) {
                 var newValue = deep && (isPlainObject(value) || isArray(value)) ? transformObjectValue(value, fn) : fn(value, index);
                 result_2.push(newValue);
             });
@@ -2532,16 +2514,11 @@
     }
 
     function findTreeNode(tree, predicate, childrenField) {
-        var e_1, _a;
         if (childrenField === void 0) { childrenField = 'children'; }
         var stack = [];
         var node;
-        if (!isArray(tree)) {
-            return node;
-        }
-        try {
-            for (var tree_1 = __values(tree), tree_1_1 = tree_1.next(); !tree_1_1.done; tree_1_1 = tree_1.next()) {
-                var item = tree_1_1.value;
+        if (isArray(tree)) {
+            forEach(tree, function (item) {
                 stack.push(item);
                 while (stack.length) {
                     var temp = stack.pop();
@@ -2559,31 +2536,19 @@
                     }
                 }
                 if (node) {
-                    break;
+                    return false;
                 }
-            }
-        }
-        catch (e_1_1) { e_1 = { error: e_1_1 }; }
-        finally {
-            try {
-                if (tree_1_1 && !tree_1_1.done && (_a = tree_1.return)) _a.call(tree_1);
-            }
-            finally { if (e_1) throw e_1.error; }
+            });
         }
         return node;
     }
 
     function findTreeNodes(tree, predicate, childrenField) {
-        var e_1, _a;
         if (childrenField === void 0) { childrenField = 'children'; }
         var stack = [];
         var nodes = [];
-        if (!isArray(tree)) {
-            return nodes;
-        }
-        try {
-            for (var tree_1 = __values(tree), tree_1_1 = tree_1.next(); !tree_1_1.done; tree_1_1 = tree_1.next()) {
-                var item = tree_1_1.value;
+        if (isArray(tree)) {
+            forEach(tree, function (item) {
                 stack.push(item);
                 while (stack.length) {
                     var temp = stack.pop();
@@ -2599,60 +2564,44 @@
                         }
                     }
                 }
-            }
-        }
-        catch (e_1_1) { e_1 = { error: e_1_1 }; }
-        finally {
-            try {
-                if (tree_1_1 && !tree_1_1.done && (_a = tree_1.return)) _a.call(tree_1);
-            }
-            finally { if (e_1) throw e_1.error; }
+            });
         }
         return nodes;
     }
 
     function internalFindTreeSelect(tree, predicate, childrenField, path) {
-        var e_1, _a;
         if (path === void 0) { path = []; }
-        if (!isArray(tree)) {
-            return [];
-        }
-        try {
-            for (var tree_1 = __values(tree), tree_1_1 = tree_1.next(); !tree_1_1.done; tree_1_1 = tree_1.next()) {
-                var item = tree_1_1.value;
+        var result = [];
+        if (isArray(tree)) {
+            forEach(tree, function (item) {
                 path.push(item);
                 if (predicate(item)) {
-                    return path;
+                    result = path;
+                    return false;
                 }
                 if (isObject(item)) {
                     var childs = item[childrenField];
                     if (isArray(childs) && childs.length > 0) {
                         var findChildren = internalFindTreeSelect(childs, predicate, childrenField, path);
                         if (findChildren.length > 0) {
-                            return findChildren;
+                            result = findChildren;
+                            return false;
                         }
                     }
                 }
                 path.pop();
-            }
-        }
-        catch (e_1_1) { e_1 = { error: e_1_1 }; }
-        finally {
-            try {
-                if (tree_1_1 && !tree_1_1.done && (_a = tree_1.return)) _a.call(tree_1);
-            }
-            finally { if (e_1) throw e_1.error; }
+            });
         }
-        return [];
+        return result;
     }
     function findTreeSelect(tree, predicate, childrenField) {
         if (childrenField === void 0) { childrenField = 'children'; }
         return internalFindTreeSelect(tree, predicate, childrenField);
     }
 
-    var VERSION = "4.23.4";
+    var VERSION = "4.23.5";
 
-    var version = "4.23.4";
+    var version = "4.23.5";
 
     exports.AsyncMemo = AsyncMemo;
     exports.VERSION = VERSION;