util-helpers 4.19.0 → 4.19.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/util-helpers.js +208 -136
- package/dist/util-helpers.js.map +1 -1
- package/dist/util-helpers.min.js +1 -1
- package/dist/util-helpers.min.js.map +1 -1
- package/esm/VERSION.js +1 -1
- package/esm/divide.js +4 -3
- package/esm/findTreeNode.js +4 -2
- package/esm/findTreeNodes.js +4 -2
- package/esm/index.js +1 -1
- package/esm/minus.js +4 -3
- package/esm/plus.js +4 -3
- package/esm/round.js +4 -12
- package/esm/times.js +4 -3
- package/esm/utils/devWarn.js +1 -2
- package/lib/VERSION.js +1 -1
- package/lib/divide.js +4 -3
- package/lib/findTreeNode.js +3 -1
- package/lib/findTreeNodes.js +3 -1
- package/lib/index.js +1 -1
- package/lib/minus.js +4 -3
- package/lib/plus.js +4 -3
- package/lib/round.js +3 -11
- package/lib/times.js +4 -3
- package/lib/utils/devWarn.js +1 -2
- package/package.json +18 -18
- package/types/round.d.ts +2 -2
package/dist/util-helpers.js
CHANGED
|
@@ -129,121 +129,46 @@
|
|
|
129
129
|
return typeof value === 'symbol' || (isObjectLike(value) && isType(value, 'Symbol'));
|
|
130
130
|
}
|
|
131
131
|
|
|
132
|
-
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
|
|
142
|
-
|
|
143
|
-
|
|
144
|
-
|
|
145
|
-
|
|
146
|
-
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
151
|
-
|
|
152
|
-
|
|
153
|
-
|
|
154
|
-
|
|
155
|
-
|
|
156
|
-
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
|
|
167
|
-
|
|
168
|
-
|
|
169
|
-
|
|
170
|
-
|
|
171
|
-
|
|
172
|
-
function __awaiter(thisArg, _arguments, P, generator) {
|
|
173
|
-
function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
|
|
174
|
-
return new (P || (P = Promise))(function (resolve, reject) {
|
|
175
|
-
function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
|
|
176
|
-
function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
|
|
177
|
-
function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
|
|
178
|
-
step((generator = generator.apply(thisArg, _arguments || [])).next());
|
|
179
|
-
});
|
|
180
|
-
}
|
|
181
|
-
|
|
182
|
-
function __generator(thisArg, body) {
|
|
183
|
-
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
|
|
184
|
-
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
|
|
185
|
-
function verb(n) { return function (v) { return step([n, v]); }; }
|
|
186
|
-
function step(op) {
|
|
187
|
-
if (f) throw new TypeError("Generator is already executing.");
|
|
188
|
-
while (g && (g = 0, op[0] && (_ = 0)), _) try {
|
|
189
|
-
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;
|
|
190
|
-
if (y = 0, t) op = [op[0] & 2, t.value];
|
|
191
|
-
switch (op[0]) {
|
|
192
|
-
case 0: case 1: t = op; break;
|
|
193
|
-
case 4: _.label++; return { value: op[1], done: false };
|
|
194
|
-
case 5: _.label++; y = op[1]; op = [0]; continue;
|
|
195
|
-
case 7: op = _.ops.pop(); _.trys.pop(); continue;
|
|
196
|
-
default:
|
|
197
|
-
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
|
|
198
|
-
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
|
|
199
|
-
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
|
|
200
|
-
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
|
|
201
|
-
if (t[2]) _.ops.pop();
|
|
202
|
-
_.trys.pop(); continue;
|
|
203
|
-
}
|
|
204
|
-
op = body.call(thisArg, _);
|
|
205
|
-
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
|
|
206
|
-
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
|
|
207
|
-
}
|
|
208
|
-
}
|
|
209
|
-
|
|
210
|
-
function __values(o) {
|
|
211
|
-
var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
|
|
212
|
-
if (m) return m.call(o);
|
|
213
|
-
if (o && typeof o.length === "number") return {
|
|
214
|
-
next: function () {
|
|
215
|
-
if (o && i >= o.length) o = void 0;
|
|
216
|
-
return { value: o && o[i++], done: !o };
|
|
217
|
-
}
|
|
218
|
-
};
|
|
219
|
-
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
|
|
220
|
-
}
|
|
221
|
-
|
|
222
|
-
function __read(o, n) {
|
|
223
|
-
var m = typeof Symbol === "function" && o[Symbol.iterator];
|
|
224
|
-
if (!m) return o;
|
|
225
|
-
var i = m.call(o), r, ar = [], e;
|
|
226
|
-
try {
|
|
227
|
-
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
|
|
228
|
-
}
|
|
229
|
-
catch (error) { e = { error: error }; }
|
|
230
|
-
finally {
|
|
231
|
-
try {
|
|
232
|
-
if (r && !r.done && (m = i["return"])) m.call(i);
|
|
233
|
-
}
|
|
234
|
-
finally { if (e) throw e.error; }
|
|
235
|
-
}
|
|
236
|
-
return ar;
|
|
237
|
-
}
|
|
238
|
-
|
|
239
|
-
function __spreadArray(to, from, pack) {
|
|
240
|
-
if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
|
|
241
|
-
if (ar || !(i in from)) {
|
|
242
|
-
if (!ar) ar = Array.prototype.slice.call(from, 0, i);
|
|
243
|
-
ar[i] = from[i];
|
|
244
|
-
}
|
|
245
|
-
}
|
|
246
|
-
return to.concat(ar || Array.prototype.slice.call(from));
|
|
132
|
+
var reIsBinary = /^0b[01]+$/i;
|
|
133
|
+
var reIsOctal = /^0o[0-7]+$/i;
|
|
134
|
+
var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;
|
|
135
|
+
function toNumber(value) {
|
|
136
|
+
if (typeof value === 'number') {
|
|
137
|
+
return value;
|
|
138
|
+
}
|
|
139
|
+
if (isSymbol(value)) {
|
|
140
|
+
return NaN;
|
|
141
|
+
}
|
|
142
|
+
if (isObject(value)) {
|
|
143
|
+
value = Number(value);
|
|
144
|
+
}
|
|
145
|
+
if (typeof value !== 'string') {
|
|
146
|
+
return value === 0 ? value : +value;
|
|
147
|
+
}
|
|
148
|
+
value = value.trim();
|
|
149
|
+
var isBinary = reIsBinary.test(value);
|
|
150
|
+
return isBinary || reIsOctal.test(value)
|
|
151
|
+
? parseInt(value.slice(2), isBinary ? 2 : 8)
|
|
152
|
+
: reIsBadHex.test(value)
|
|
153
|
+
? NaN
|
|
154
|
+
: +value;
|
|
155
|
+
}
|
|
156
|
+
|
|
157
|
+
function toInteger(value) {
|
|
158
|
+
var result = toNumber(value);
|
|
159
|
+
if (!result || result === Infinity || result === -Infinity) {
|
|
160
|
+
return result === result ? result : 0;
|
|
161
|
+
}
|
|
162
|
+
var remainder = result % 1;
|
|
163
|
+
return remainder ? result - remainder : result;
|
|
164
|
+
}
|
|
165
|
+
|
|
166
|
+
var argType = 'Arguments';
|
|
167
|
+
isType((function () { return arguments; })(), argType);
|
|
168
|
+
var numberIsFinite = Number.isFinite;
|
|
169
|
+
|
|
170
|
+
function isFinite$1(value) {
|
|
171
|
+
return numberIsFinite ? numberIsFinite(value) : typeof value === 'number' && root.isFinite(value);
|
|
247
172
|
}
|
|
248
173
|
|
|
249
174
|
function baseToString(value) {
|
|
@@ -263,6 +188,24 @@
|
|
|
263
188
|
return value == null ? '' : baseToString(value);
|
|
264
189
|
}
|
|
265
190
|
|
|
191
|
+
function decimalAdjust(type, value, precision) {
|
|
192
|
+
if (precision === void 0) { precision = 0; }
|
|
193
|
+
var func = Math[type];
|
|
194
|
+
value = toNumber(value);
|
|
195
|
+
precision = Math.min(toInteger(precision), 292);
|
|
196
|
+
if (precision === 0 || !isFinite$1(value)) {
|
|
197
|
+
return func(value);
|
|
198
|
+
}
|
|
199
|
+
var pair = toString(value).split('e');
|
|
200
|
+
value = func(+(pair[0] + 'e' + (pair[1] ? +pair[1] + precision : precision)));
|
|
201
|
+
pair = toString(value).split('e');
|
|
202
|
+
return +(pair[0] + 'e' + (pair[1] ? +pair[1] - precision : -precision));
|
|
203
|
+
}
|
|
204
|
+
|
|
205
|
+
function round(number, precision) {
|
|
206
|
+
return decimalAdjust('round', number, precision);
|
|
207
|
+
}
|
|
208
|
+
|
|
266
209
|
function isBlob(value) {
|
|
267
210
|
return (blobExisted && value instanceof Blob) || isType(value, ['Blob', 'File']);
|
|
268
211
|
}
|
|
@@ -431,7 +374,7 @@
|
|
|
431
374
|
args[_i] = arguments[_i];
|
|
432
375
|
}
|
|
433
376
|
if (!config.disableWarning) {
|
|
434
|
-
console.warn.apply(
|
|
377
|
+
console.warn.apply(void 0, args);
|
|
435
378
|
}
|
|
436
379
|
}
|
|
437
380
|
|
|
@@ -692,6 +635,128 @@
|
|
|
692
635
|
return typeof ret === 'number' && !Number.isNaN(ret);
|
|
693
636
|
}
|
|
694
637
|
|
|
638
|
+
/******************************************************************************
|
|
639
|
+
Copyright (c) Microsoft Corporation.
|
|
640
|
+
|
|
641
|
+
Permission to use, copy, modify, and/or distribute this software for any
|
|
642
|
+
purpose with or without fee is hereby granted.
|
|
643
|
+
|
|
644
|
+
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
|
|
645
|
+
REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
|
|
646
|
+
AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
|
|
647
|
+
INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
|
|
648
|
+
LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
|
|
649
|
+
OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
|
|
650
|
+
PERFORMANCE OF THIS SOFTWARE.
|
|
651
|
+
***************************************************************************** */
|
|
652
|
+
/* global Reflect, Promise, SuppressedError, Symbol */
|
|
653
|
+
|
|
654
|
+
|
|
655
|
+
var __assign = function() {
|
|
656
|
+
__assign = Object.assign || function __assign(t) {
|
|
657
|
+
for (var s, i = 1, n = arguments.length; i < n; i++) {
|
|
658
|
+
s = arguments[i];
|
|
659
|
+
for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];
|
|
660
|
+
}
|
|
661
|
+
return t;
|
|
662
|
+
};
|
|
663
|
+
return __assign.apply(this, arguments);
|
|
664
|
+
};
|
|
665
|
+
|
|
666
|
+
function __rest(s, e) {
|
|
667
|
+
var t = {};
|
|
668
|
+
for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)
|
|
669
|
+
t[p] = s[p];
|
|
670
|
+
if (s != null && typeof Object.getOwnPropertySymbols === "function")
|
|
671
|
+
for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {
|
|
672
|
+
if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))
|
|
673
|
+
t[p[i]] = s[p[i]];
|
|
674
|
+
}
|
|
675
|
+
return t;
|
|
676
|
+
}
|
|
677
|
+
|
|
678
|
+
function __awaiter(thisArg, _arguments, P, generator) {
|
|
679
|
+
function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
|
|
680
|
+
return new (P || (P = Promise))(function (resolve, reject) {
|
|
681
|
+
function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
|
|
682
|
+
function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
|
|
683
|
+
function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
|
|
684
|
+
step((generator = generator.apply(thisArg, _arguments || [])).next());
|
|
685
|
+
});
|
|
686
|
+
}
|
|
687
|
+
|
|
688
|
+
function __generator(thisArg, body) {
|
|
689
|
+
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
|
|
690
|
+
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
|
|
691
|
+
function verb(n) { return function (v) { return step([n, v]); }; }
|
|
692
|
+
function step(op) {
|
|
693
|
+
if (f) throw new TypeError("Generator is already executing.");
|
|
694
|
+
while (g && (g = 0, op[0] && (_ = 0)), _) try {
|
|
695
|
+
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;
|
|
696
|
+
if (y = 0, t) op = [op[0] & 2, t.value];
|
|
697
|
+
switch (op[0]) {
|
|
698
|
+
case 0: case 1: t = op; break;
|
|
699
|
+
case 4: _.label++; return { value: op[1], done: false };
|
|
700
|
+
case 5: _.label++; y = op[1]; op = [0]; continue;
|
|
701
|
+
case 7: op = _.ops.pop(); _.trys.pop(); continue;
|
|
702
|
+
default:
|
|
703
|
+
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
|
|
704
|
+
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
|
|
705
|
+
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
|
|
706
|
+
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
|
|
707
|
+
if (t[2]) _.ops.pop();
|
|
708
|
+
_.trys.pop(); continue;
|
|
709
|
+
}
|
|
710
|
+
op = body.call(thisArg, _);
|
|
711
|
+
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
|
|
712
|
+
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
|
|
713
|
+
}
|
|
714
|
+
}
|
|
715
|
+
|
|
716
|
+
function __values(o) {
|
|
717
|
+
var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
|
|
718
|
+
if (m) return m.call(o);
|
|
719
|
+
if (o && typeof o.length === "number") return {
|
|
720
|
+
next: function () {
|
|
721
|
+
if (o && i >= o.length) o = void 0;
|
|
722
|
+
return { value: o && o[i++], done: !o };
|
|
723
|
+
}
|
|
724
|
+
};
|
|
725
|
+
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
|
|
726
|
+
}
|
|
727
|
+
|
|
728
|
+
function __read(o, n) {
|
|
729
|
+
var m = typeof Symbol === "function" && o[Symbol.iterator];
|
|
730
|
+
if (!m) return o;
|
|
731
|
+
var i = m.call(o), r, ar = [], e;
|
|
732
|
+
try {
|
|
733
|
+
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
|
|
734
|
+
}
|
|
735
|
+
catch (error) { e = { error: error }; }
|
|
736
|
+
finally {
|
|
737
|
+
try {
|
|
738
|
+
if (r && !r.done && (m = i["return"])) m.call(i);
|
|
739
|
+
}
|
|
740
|
+
finally { if (e) throw e.error; }
|
|
741
|
+
}
|
|
742
|
+
return ar;
|
|
743
|
+
}
|
|
744
|
+
|
|
745
|
+
function __spreadArray(to, from, pack) {
|
|
746
|
+
if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
|
|
747
|
+
if (ar || !(i in from)) {
|
|
748
|
+
if (!ar) ar = Array.prototype.slice.call(from, 0, i);
|
|
749
|
+
ar[i] = from[i];
|
|
750
|
+
}
|
|
751
|
+
}
|
|
752
|
+
return to.concat(ar || Array.prototype.slice.call(from));
|
|
753
|
+
}
|
|
754
|
+
|
|
755
|
+
typeof SuppressedError === "function" ? SuppressedError : function (error, suppressed, message) {
|
|
756
|
+
var e = new Error(message);
|
|
757
|
+
return e.name = "SuppressedError", e.error = error, e.suppressed = suppressed, e;
|
|
758
|
+
};
|
|
759
|
+
|
|
695
760
|
function transformEffectiveNumber(value) {
|
|
696
761
|
var ret;
|
|
697
762
|
if (isString(value)) {
|
|
@@ -1171,9 +1236,11 @@
|
|
|
1171
1236
|
for (var _i = 0; _i < arguments.length; _i++) {
|
|
1172
1237
|
nums[_i] = arguments[_i];
|
|
1173
1238
|
}
|
|
1174
|
-
var
|
|
1239
|
+
var num1 = nums[0];
|
|
1240
|
+
var num2 = nums[1] === void 0 ? 1 : nums[1];
|
|
1241
|
+
var rest = nums.slice(2);
|
|
1175
1242
|
if (rest.length > 0) {
|
|
1176
|
-
return times.apply(void 0,
|
|
1243
|
+
return times.apply(void 0, [times(num1, num2)].concat(rest));
|
|
1177
1244
|
}
|
|
1178
1245
|
num1 = transformEffectiveNumber(num1);
|
|
1179
1246
|
num2 = transformEffectiveNumber(num2);
|
|
@@ -1193,9 +1260,11 @@
|
|
|
1193
1260
|
for (var _i = 0; _i < arguments.length; _i++) {
|
|
1194
1261
|
nums[_i] = arguments[_i];
|
|
1195
1262
|
}
|
|
1196
|
-
var
|
|
1263
|
+
var num1 = nums[0];
|
|
1264
|
+
var num2 = nums[1] === void 0 ? 0 : nums[1];
|
|
1265
|
+
var rest = nums.slice(2);
|
|
1197
1266
|
if (rest.length > 0) {
|
|
1198
|
-
return plus.apply(void 0,
|
|
1267
|
+
return plus.apply(void 0, [plus(num1, num2)].concat(rest));
|
|
1199
1268
|
}
|
|
1200
1269
|
num1 = transformEffectiveNumber(num1);
|
|
1201
1270
|
num2 = transformEffectiveNumber(num2);
|
|
@@ -1211,9 +1280,11 @@
|
|
|
1211
1280
|
for (var _i = 0; _i < arguments.length; _i++) {
|
|
1212
1281
|
nums[_i] = arguments[_i];
|
|
1213
1282
|
}
|
|
1214
|
-
var
|
|
1283
|
+
var num1 = nums[0];
|
|
1284
|
+
var num2 = nums[1] === void 0 ? 0 : nums[1];
|
|
1285
|
+
var rest = nums.slice(2);
|
|
1215
1286
|
if (rest.length > 0) {
|
|
1216
|
-
return minus.apply(void 0,
|
|
1287
|
+
return minus.apply(void 0, [minus(num1, num2)].concat(rest));
|
|
1217
1288
|
}
|
|
1218
1289
|
num1 = transformEffectiveNumber(num1);
|
|
1219
1290
|
num2 = transformEffectiveNumber(num2);
|
|
@@ -1229,9 +1300,11 @@
|
|
|
1229
1300
|
for (var _i = 0; _i < arguments.length; _i++) {
|
|
1230
1301
|
nums[_i] = arguments[_i];
|
|
1231
1302
|
}
|
|
1232
|
-
var
|
|
1303
|
+
var num1 = nums[0];
|
|
1304
|
+
var num2 = nums[1] === void 0 ? 1 : nums[1];
|
|
1305
|
+
var rest = nums.slice(2);
|
|
1233
1306
|
if (rest.length > 0) {
|
|
1234
|
-
return divide.apply(void 0,
|
|
1307
|
+
return divide.apply(void 0, [divide(num1, num2)].concat(rest));
|
|
1235
1308
|
}
|
|
1236
1309
|
num1 = transformEffectiveNumber(num1);
|
|
1237
1310
|
num2 = transformEffectiveNumber(num2);
|
|
@@ -1245,14 +1318,9 @@
|
|
|
1245
1318
|
return times(num1Changed / num2Changed, strip(Math.pow(10, digitLength(num2) - digitLength(num1))));
|
|
1246
1319
|
}
|
|
1247
1320
|
|
|
1248
|
-
function
|
|
1321
|
+
function _round(num, precision) {
|
|
1249
1322
|
if (precision === void 0) { precision = 0; }
|
|
1250
|
-
|
|
1251
|
-
if (isNaN$1(num)) {
|
|
1252
|
-
return Number.NaN;
|
|
1253
|
-
}
|
|
1254
|
-
var base = Math.pow(10, precision);
|
|
1255
|
-
return divide(Math.round(times(num, base)), base);
|
|
1323
|
+
return round(num, precision);
|
|
1256
1324
|
}
|
|
1257
1325
|
|
|
1258
1326
|
function ajax(url, options) {
|
|
@@ -1654,7 +1722,9 @@
|
|
|
1654
1722
|
if (isObject(temp)) {
|
|
1655
1723
|
var childs = temp[childrenField];
|
|
1656
1724
|
if (Array.isArray(childs) && childs.length > 0) {
|
|
1657
|
-
|
|
1725
|
+
childs.forEach(function (c) {
|
|
1726
|
+
stack.push(c);
|
|
1727
|
+
});
|
|
1658
1728
|
}
|
|
1659
1729
|
}
|
|
1660
1730
|
}
|
|
@@ -1693,7 +1763,9 @@
|
|
|
1693
1763
|
if (isObject(temp)) {
|
|
1694
1764
|
var childs = temp[childrenField];
|
|
1695
1765
|
if (Array.isArray(childs) && childs.length > 0) {
|
|
1696
|
-
|
|
1766
|
+
childs.forEach(function (c) {
|
|
1767
|
+
stack.push(c);
|
|
1768
|
+
});
|
|
1697
1769
|
}
|
|
1698
1770
|
}
|
|
1699
1771
|
}
|
|
@@ -1748,9 +1820,9 @@
|
|
|
1748
1820
|
return internalFindTreeSelect(tree, predicate, childrenField);
|
|
1749
1821
|
}
|
|
1750
1822
|
|
|
1751
|
-
var VERSION = "4.19.
|
|
1823
|
+
var VERSION = "4.19.2";
|
|
1752
1824
|
|
|
1753
|
-
var version = "4.19.
|
|
1825
|
+
var version = "4.19.2";
|
|
1754
1826
|
|
|
1755
1827
|
exports.VERSION = VERSION;
|
|
1756
1828
|
exports.ajax = ajax;
|
|
@@ -1800,7 +1872,7 @@
|
|
|
1800
1872
|
exports.plus = plus;
|
|
1801
1873
|
exports.randomString = randomString;
|
|
1802
1874
|
exports.replaceChar = replaceChar;
|
|
1803
|
-
exports.round =
|
|
1875
|
+
exports.round = _round;
|
|
1804
1876
|
exports.safeDate = safeDate;
|
|
1805
1877
|
exports.setDataURLPrefix = setDataURLPrefix;
|
|
1806
1878
|
exports.setDisableWarning = setDisableWarning;
|