util-helpers 4.17.0 → 4.17.2

package/README.md

@@ -92,6 +92,7 @@ formatBankCard('6228480402564890018', { spaceMark: '-' }); // 6228-4804-0256-489
   - [isIPv4](https://doly-dev.github.io/util-helpers/module-Validator.html#.isIPv4) - IPv4
   - [isIPv6](https://doly-dev.github.io/util-helpers/module-Validator.html#.isIPv6) - IPv6
   - [isUrl](https://doly-dev.github.io/util-helpers/module-Validator.html#.isUrl) - URL
+  - [isValidNumber](https://doly-dev.github.io/util-helpers/module-Validator.html#.isValidNumber) - 有效数字
   - [isBusinessLicense](https://doly-dev.github.io/util-helpers/module-Validator.html#.isBusinessLicense) - 营业执照，也叫工商注册号
   - [validatePassword](https://doly-dev.github.io/util-helpers/module-Validator.html#.validatePassword) - 验证密码
 - 其他

package/dist/util-helpers.js

@@ -164,13 +164,116 @@
         return lastCode === checkCode;
     }
 
+    /******************************************************************************
+    Copyright (c) Microsoft Corporation.
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+    REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+    AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+    INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+    LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+    OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+    PERFORMANCE OF THIS SOFTWARE.
+    ***************************************************************************** */
+
+    var __assign = function() {
+        __assign = Object.assign || function __assign(t) {
+            for (var s, i = 1, n = arguments.length; i < n; i++) {
+                s = arguments[i];
+                for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];
+            }
+            return t;
+        };
+        return __assign.apply(this, arguments);
+    };
+
+    function __awaiter(thisArg, _arguments, P, generator) {
+        function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+        return new (P || (P = Promise))(function (resolve, reject) {
+            function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+            function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+            function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+            step((generator = generator.apply(thisArg, _arguments || [])).next());
+        });
+    }
+
+    function __generator(thisArg, body) {
+        var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
+        return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+        function verb(n) { return function (v) { return step([n, v]); }; }
+        function step(op) {
+            if (f) throw new TypeError("Generator is already executing.");
+            while (g && (g = 0, op[0] && (_ = 0)), _) try {
+                if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+                if (y = 0, t) op = [op[0] & 2, t.value];
+                switch (op[0]) {
+                    case 0: case 1: t = op; break;
+                    case 4: _.label++; return { value: op[1], done: false };
+                    case 5: _.label++; y = op[1]; op = [0]; continue;
+                    case 7: op = _.ops.pop(); _.trys.pop(); continue;
+                    default:
+                        if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
+                        if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
+                        if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
+                        if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
+                        if (t[2]) _.ops.pop();
+                        _.trys.pop(); continue;
+                }
+                op = body.call(thisArg, _);
+            } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
+            if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+        }
+    }
+
+    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;
+        var i = m.call(o), r, ar = [], e;
+        try {
+            while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+        }
+        catch (error) { e = { error: error }; }
+        finally {
+            try {
+                if (r && !r.done && (m = i["return"])) m.call(i);
+            }
+            finally { if (e) throw e.error; }
+        }
+        return ar;
+    }
+
+    function __spreadArray(to, from, pack) {
+        if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+            if (ar || !(i in from)) {
+                if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+                ar[i] = from[i];
+            }
+        }
+        return to.concat(ar || Array.prototype.slice.call(from));
+    }
+
     var config = {
         disableWarning: true
     };
     function setDisableWarning(bool) {
         config.disableWarning = !!bool;
     }
-    var version = "4.17.0";
+    var version = "4.17.2";
 
     function devWarn() {
         var args = [];
@@ -178,7 +281,7 @@
             args[_i] = arguments[_i];
         }
         if (!config.disableWarning) {
-            console.warn.apply(console, args);
+            console.warn.apply(console, __spreadArray([], __read(args), false));
         }
     }
 
@@ -419,9 +522,6 @@
         return reg$1.test(valueStr);
     }
 
-    var MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER || 9007199254740991;
-    var MIN_SAFE_INTEGER = Number.MIN_SAFE_INTEGER || -9007199254740991;
-
     function isBlob(value) {
         return isType(value, 'Blob');
     }
@@ -443,6 +543,29 @@
         return isType(value, 'Symbol');
     }
 
+    function isValidNumber(value, strict) {
+        if (strict === void 0) { strict = false; }
+        var ret;
+        if (strict) {
+            ret = typeof value === 'string' && value !== '' ? Number(value) : value;
+        }
+        else {
+            if (typeof value === 'number') {
+                ret = value;
+            }
+            else if (isSymbol(value)) {
+                ret = Number.NaN;
+            }
+            else {
+                ret = Number(value);
+            }
+        }
+        return typeof ret === 'number' && !Number.isNaN(ret);
+    }
+
+    var MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER || 9007199254740991;
+    var MIN_SAFE_INTEGER = Number.MIN_SAFE_INTEGER || -9007199254740991;
+
     function transformEffectiveNumber(value) {
         var ret;
         if (isString(value)) {
@@ -597,7 +720,7 @@
         thousand = typeof thousand === 'string' ? thousand : ',';
         decimal = typeof decimal === 'string' ? decimal : '.';
         var strNum = scientificToNumber(num) + '';
-        var _d = strNum.split('.'), intStr = _d[0], decStr = _d[1];
+        var _d = __read(strNum.split('.'), 2), intStr = _d[0], decStr = _d[1];
         return symbol + formatInt(intStr, thousand) + formatDec(decStr, precision, decimal);
     };
 
@@ -872,80 +995,6 @@
         return "data:".concat(mimeType).concat(base64 ? ';base64' : '', ",").concat(data);
     }
 
-    /******************************************************************************
-    Copyright (c) Microsoft Corporation.
-
-    Permission to use, copy, modify, and/or distribute this software for any
-    purpose with or without fee is hereby granted.
-
-    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
-    REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
-    AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
-    INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
-    LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
-    OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
-    PERFORMANCE OF THIS SOFTWARE.
-    ***************************************************************************** */
-
-    var __assign = function() {
-        __assign = Object.assign || function __assign(t) {
-            for (var s, i = 1, n = arguments.length; i < n; i++) {
-                s = arguments[i];
-                for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];
-            }
-            return t;
-        };
-        return __assign.apply(this, arguments);
-    };
-
-    function __awaiter(thisArg, _arguments, P, generator) {
-        function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
-        return new (P || (P = Promise))(function (resolve, reject) {
-            function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
-            function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
-            function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
-            step((generator = generator.apply(thisArg, _arguments || [])).next());
-        });
-    }
-
-    function __generator(thisArg, body) {
-        var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
-        return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
-        function verb(n) { return function (v) { return step([n, v]); }; }
-        function step(op) {
-            if (f) throw new TypeError("Generator is already executing.");
-            while (g && (g = 0, op[0] && (_ = 0)), _) try {
-                if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
-                if (y = 0, t) op = [op[0] & 2, t.value];
-                switch (op[0]) {
-                    case 0: case 1: t = op; break;
-                    case 4: _.label++; return { value: op[1], done: false };
-                    case 5: _.label++; y = op[1]; op = [0]; continue;
-                    case 7: op = _.ops.pop(); _.trys.pop(); continue;
-                    default:
-                        if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
-                        if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
-                        if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
-                        if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
-                        if (t[2]) _.ops.pop();
-                        _.trys.pop(); continue;
-                }
-                op = body.call(thisArg, _);
-            } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
-            if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
-        }
-    }
-
-    function __spreadArray(to, from, pack) {
-        if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
-            if (ar || !(i in from)) {
-                if (!ar) ar = Array.prototype.slice.call(from, 0, i);
-                ar[i] = from[i];
-            }
-        }
-        return to.concat(ar || Array.prototype.slice.call(from));
-    }
-
     function safeDate(value) {
         var args = [];
         for (var _i = 1; _i < arguments.length; _i++) {
@@ -953,7 +1002,7 @@
         }
         var safeValue = typeof value === 'string' ? value.replace(/[\\.-]/g, '/') : value;
         if (args && args.length > 0) {
-            return new (Date.bind.apply(Date, __spreadArray([void 0, safeValue], args, false)))();
+            return new (Date.bind.apply(Date, __spreadArray([void 0, safeValue], __read(args), false)))();
         }
         return typeof safeValue === 'undefined' ? new Date() : new Date(safeValue);
     }
@@ -992,9 +1041,9 @@
         for (var _i = 0; _i < arguments.length; _i++) {
             nums[_i] = arguments[_i];
         }
-        var num1 = nums[0], _a = nums[1], num2 = _a === void 0 ? 1 : _a, rest = nums.slice(2);
+        var _a = __read(nums), num1 = _a[0], _b = _a[1], num2 = _b === void 0 ? 1 : _b, rest = _a.slice(2);
         if (rest.length > 0) {
-            return times.apply(void 0, __spreadArray([times(num1, num2)], rest, false));
+            return times.apply(void 0, __spreadArray([times(num1, num2)], __read(rest), false));
         }
         num1 = transformEffectiveNumber(num1);
         num2 = transformEffectiveNumber(num2);
@@ -1014,9 +1063,9 @@
         for (var _i = 0; _i < arguments.length; _i++) {
             nums[_i] = arguments[_i];
         }
-        var num1 = nums[0], _a = nums[1], num2 = _a === void 0 ? 0 : _a, rest = nums.slice(2);
+        var _a = __read(nums), num1 = _a[0], _b = _a[1], num2 = _b === void 0 ? 0 : _b, rest = _a.slice(2);
         if (rest.length > 0) {
-            return plus.apply(void 0, __spreadArray([plus(num1, num2)], rest, false));
+            return plus.apply(void 0, __spreadArray([plus(num1, num2)], __read(rest), false));
         }
         num1 = transformEffectiveNumber(num1);
         num2 = transformEffectiveNumber(num2);
@@ -1032,9 +1081,9 @@
         for (var _i = 0; _i < arguments.length; _i++) {
             nums[_i] = arguments[_i];
         }
-        var num1 = nums[0], _a = nums[1], num2 = _a === void 0 ? 0 : _a, rest = nums.slice(2);
+        var _a = __read(nums), num1 = _a[0], _b = _a[1], num2 = _b === void 0 ? 0 : _b, rest = _a.slice(2);
         if (rest.length > 0) {
-            return minus.apply(void 0, __spreadArray([minus(num1, num2)], rest, false));
+            return minus.apply(void 0, __spreadArray([minus(num1, num2)], __read(rest), false));
         }
         num1 = transformEffectiveNumber(num1);
         num2 = transformEffectiveNumber(num2);
@@ -1050,9 +1099,9 @@
         for (var _i = 0; _i < arguments.length; _i++) {
             nums[_i] = arguments[_i];
         }
-        var num1 = nums[0], _a = nums[1], num2 = _a === void 0 ? 1 : _a, rest = nums.slice(2);
+        var _a = __read(nums), num1 = _a[0], _b = _a[1], num2 = _b === void 0 ? 1 : _b, rest = _a.slice(2);
         if (rest.length > 0) {
-            return divide.apply(void 0, __spreadArray([divide(num1, num2)], rest, false));
+            return divide.apply(void 0, __spreadArray([divide(num1, num2)], __read(rest), false));
         }
         num1 = transformEffectiveNumber(num1);
         num2 = transformEffectiveNumber(num2);
@@ -1421,82 +1470,112 @@
     }
 
     function findTreeNode(tree, predicate, childrenField) {
+        var e_1, _a;
         if (childrenField === void 0) { childrenField = 'children'; }
         var stack = [];
         var node;
         if (!Array.isArray(tree)) {
             return node;
         }
-        for (var _i = 0, tree_1 = tree; _i < tree_1.length; _i++) {
-            var item = tree_1[_i];
-            stack.push(item);
-            while (stack.length) {
-                var temp = stack.pop();
-                if (predicate(temp)) {
-                    node = temp;
-                    break;
-                }
-                if (isObject(temp)) {
-                    var childs = temp[childrenField];
-                    if (Array.isArray(childs) && childs.length > 0) {
-                        stack.push.apply(stack, childs);
+        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;
+                stack.push(item);
+                while (stack.length) {
+                    var temp = stack.pop();
+                    if (predicate(temp)) {
+                        node = temp;
+                        break;
+                    }
+                    if (isObject(temp)) {
+                        var childs = temp[childrenField];
+                        if (Array.isArray(childs) && childs.length > 0) {
+                            stack.push.apply(stack, __spreadArray([], __read(childs), false));
+                        }
                     }
                 }
+                if (node) {
+                    break;
+                }
             }
-            if (node) {
-                break;
+        }
+        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 (!Array.isArray(tree)) {
             return nodes;
         }
-        for (var _i = 0, tree_1 = tree; _i < tree_1.length; _i++) {
-            var item = tree_1[_i];
-            stack.push(item);
-            while (stack.length) {
-                var temp = stack.pop();
-                if (predicate(temp)) {
-                    nodes.push(temp);
-                }
-                if (isObject(temp)) {
-                    var childs = temp[childrenField];
-                    if (Array.isArray(childs) && childs.length > 0) {
-                        stack.push.apply(stack, childs);
+        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;
+                stack.push(item);
+                while (stack.length) {
+                    var temp = stack.pop();
+                    if (predicate(temp)) {
+                        nodes.push(temp);
+                    }
+                    if (isObject(temp)) {
+                        var childs = temp[childrenField];
+                        if (Array.isArray(childs) && childs.length > 0) {
+                            stack.push.apply(stack, __spreadArray([], __read(childs), 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 nodes;
     }
 
     function internalFindTreeSelect(tree, predicate, childrenField, path) {
+        var e_1, _a;
         if (path === void 0) { path = []; }
         if (!Array.isArray(tree)) {
             return [];
         }
-        for (var _i = 0, tree_1 = tree; _i < tree_1.length; _i++) {
-            var item = tree_1[_i];
-            path.push(item);
-            if (predicate(item)) {
-                return path;
-            }
-            if (isObject(item)) {
-                var childs = item[childrenField];
-                if (Array.isArray(childs) && childs.length > 0) {
-                    var findChildren = internalFindTreeSelect(childs, predicate, childrenField, path);
-                    if (findChildren.length > 0) {
-                        return findChildren;
+        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;
+                path.push(item);
+                if (predicate(item)) {
+                    return path;
+                }
+                if (isObject(item)) {
+                    var childs = item[childrenField];
+                    if (Array.isArray(childs) && childs.length > 0) {
+                        var findChildren = internalFindTreeSelect(childs, predicate, childrenField, path);
+                        if (findChildren.length > 0) {
+                            return findChildren;
+                        }
                     }
                 }
+                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);
             }
-            path.pop();
+            finally { if (e_1) throw e_1.error; }
         }
         return [];
     }
@@ -1539,6 +1618,7 @@
     exports.isTWCard = isTWCard;
     exports.isTelephone = isTelephone;
     exports.isUrl = isUrl;
+    exports.isValidNumber = isValidNumber;
     exports.isVehicle = isVehicle;
     exports.isWX = isWX;
     exports.listToTree = listToTree;