util-helpers 4.19.1 → 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 +147 -130
- 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/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/times.js +4 -3
- package/lib/utils/devWarn.js +1 -2
- package/package.json +18 -18
package/dist/util-helpers.js
CHANGED
|
@@ -167,123 +167,6 @@
|
|
|
167
167
|
isType((function () { return arguments; })(), argType);
|
|
168
168
|
var numberIsFinite = Number.isFinite;
|
|
169
169
|
|
|
170
|
-
/******************************************************************************
|
|
171
|
-
Copyright (c) Microsoft Corporation.
|
|
172
|
-
|
|
173
|
-
Permission to use, copy, modify, and/or distribute this software for any
|
|
174
|
-
purpose with or without fee is hereby granted.
|
|
175
|
-
|
|
176
|
-
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
|
|
177
|
-
REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
|
|
178
|
-
AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
|
|
179
|
-
INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
|
|
180
|
-
LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
|
|
181
|
-
OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
|
|
182
|
-
PERFORMANCE OF THIS SOFTWARE.
|
|
183
|
-
***************************************************************************** */
|
|
184
|
-
/* global Reflect, Promise */
|
|
185
|
-
|
|
186
|
-
|
|
187
|
-
var __assign = function() {
|
|
188
|
-
__assign = Object.assign || function __assign(t) {
|
|
189
|
-
for (var s, i = 1, n = arguments.length; i < n; i++) {
|
|
190
|
-
s = arguments[i];
|
|
191
|
-
for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];
|
|
192
|
-
}
|
|
193
|
-
return t;
|
|
194
|
-
};
|
|
195
|
-
return __assign.apply(this, arguments);
|
|
196
|
-
};
|
|
197
|
-
|
|
198
|
-
function __rest(s, e) {
|
|
199
|
-
var t = {};
|
|
200
|
-
for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)
|
|
201
|
-
t[p] = s[p];
|
|
202
|
-
if (s != null && typeof Object.getOwnPropertySymbols === "function")
|
|
203
|
-
for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {
|
|
204
|
-
if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))
|
|
205
|
-
t[p[i]] = s[p[i]];
|
|
206
|
-
}
|
|
207
|
-
return t;
|
|
208
|
-
}
|
|
209
|
-
|
|
210
|
-
function __awaiter(thisArg, _arguments, P, generator) {
|
|
211
|
-
function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
|
|
212
|
-
return new (P || (P = Promise))(function (resolve, reject) {
|
|
213
|
-
function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
|
|
214
|
-
function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
|
|
215
|
-
function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
|
|
216
|
-
step((generator = generator.apply(thisArg, _arguments || [])).next());
|
|
217
|
-
});
|
|
218
|
-
}
|
|
219
|
-
|
|
220
|
-
function __generator(thisArg, body) {
|
|
221
|
-
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
|
|
222
|
-
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
|
|
223
|
-
function verb(n) { return function (v) { return step([n, v]); }; }
|
|
224
|
-
function step(op) {
|
|
225
|
-
if (f) throw new TypeError("Generator is already executing.");
|
|
226
|
-
while (g && (g = 0, op[0] && (_ = 0)), _) try {
|
|
227
|
-
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;
|
|
228
|
-
if (y = 0, t) op = [op[0] & 2, t.value];
|
|
229
|
-
switch (op[0]) {
|
|
230
|
-
case 0: case 1: t = op; break;
|
|
231
|
-
case 4: _.label++; return { value: op[1], done: false };
|
|
232
|
-
case 5: _.label++; y = op[1]; op = [0]; continue;
|
|
233
|
-
case 7: op = _.ops.pop(); _.trys.pop(); continue;
|
|
234
|
-
default:
|
|
235
|
-
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
|
|
236
|
-
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
|
|
237
|
-
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
|
|
238
|
-
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
|
|
239
|
-
if (t[2]) _.ops.pop();
|
|
240
|
-
_.trys.pop(); continue;
|
|
241
|
-
}
|
|
242
|
-
op = body.call(thisArg, _);
|
|
243
|
-
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
|
|
244
|
-
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
|
|
245
|
-
}
|
|
246
|
-
}
|
|
247
|
-
|
|
248
|
-
function __values(o) {
|
|
249
|
-
var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
|
|
250
|
-
if (m) return m.call(o);
|
|
251
|
-
if (o && typeof o.length === "number") return {
|
|
252
|
-
next: function () {
|
|
253
|
-
if (o && i >= o.length) o = void 0;
|
|
254
|
-
return { value: o && o[i++], done: !o };
|
|
255
|
-
}
|
|
256
|
-
};
|
|
257
|
-
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
|
|
258
|
-
}
|
|
259
|
-
|
|
260
|
-
function __read(o, n) {
|
|
261
|
-
var m = typeof Symbol === "function" && o[Symbol.iterator];
|
|
262
|
-
if (!m) return o;
|
|
263
|
-
var i = m.call(o), r, ar = [], e;
|
|
264
|
-
try {
|
|
265
|
-
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
|
|
266
|
-
}
|
|
267
|
-
catch (error) { e = { error: error }; }
|
|
268
|
-
finally {
|
|
269
|
-
try {
|
|
270
|
-
if (r && !r.done && (m = i["return"])) m.call(i);
|
|
271
|
-
}
|
|
272
|
-
finally { if (e) throw e.error; }
|
|
273
|
-
}
|
|
274
|
-
return ar;
|
|
275
|
-
}
|
|
276
|
-
|
|
277
|
-
function __spreadArray(to, from, pack) {
|
|
278
|
-
if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
|
|
279
|
-
if (ar || !(i in from)) {
|
|
280
|
-
if (!ar) ar = Array.prototype.slice.call(from, 0, i);
|
|
281
|
-
ar[i] = from[i];
|
|
282
|
-
}
|
|
283
|
-
}
|
|
284
|
-
return to.concat(ar || Array.prototype.slice.call(from));
|
|
285
|
-
}
|
|
286
|
-
|
|
287
170
|
function isFinite$1(value) {
|
|
288
171
|
return numberIsFinite ? numberIsFinite(value) : typeof value === 'number' && root.isFinite(value);
|
|
289
172
|
}
|
|
@@ -491,7 +374,7 @@
|
|
|
491
374
|
args[_i] = arguments[_i];
|
|
492
375
|
}
|
|
493
376
|
if (!config.disableWarning) {
|
|
494
|
-
console.warn.apply(
|
|
377
|
+
console.warn.apply(void 0, args);
|
|
495
378
|
}
|
|
496
379
|
}
|
|
497
380
|
|
|
@@ -752,6 +635,128 @@
|
|
|
752
635
|
return typeof ret === 'number' && !Number.isNaN(ret);
|
|
753
636
|
}
|
|
754
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
|
+
|
|
755
760
|
function transformEffectiveNumber(value) {
|
|
756
761
|
var ret;
|
|
757
762
|
if (isString(value)) {
|
|
@@ -1231,9 +1236,11 @@
|
|
|
1231
1236
|
for (var _i = 0; _i < arguments.length; _i++) {
|
|
1232
1237
|
nums[_i] = arguments[_i];
|
|
1233
1238
|
}
|
|
1234
|
-
var
|
|
1239
|
+
var num1 = nums[0];
|
|
1240
|
+
var num2 = nums[1] === void 0 ? 1 : nums[1];
|
|
1241
|
+
var rest = nums.slice(2);
|
|
1235
1242
|
if (rest.length > 0) {
|
|
1236
|
-
return times.apply(void 0,
|
|
1243
|
+
return times.apply(void 0, [times(num1, num2)].concat(rest));
|
|
1237
1244
|
}
|
|
1238
1245
|
num1 = transformEffectiveNumber(num1);
|
|
1239
1246
|
num2 = transformEffectiveNumber(num2);
|
|
@@ -1253,9 +1260,11 @@
|
|
|
1253
1260
|
for (var _i = 0; _i < arguments.length; _i++) {
|
|
1254
1261
|
nums[_i] = arguments[_i];
|
|
1255
1262
|
}
|
|
1256
|
-
var
|
|
1263
|
+
var num1 = nums[0];
|
|
1264
|
+
var num2 = nums[1] === void 0 ? 0 : nums[1];
|
|
1265
|
+
var rest = nums.slice(2);
|
|
1257
1266
|
if (rest.length > 0) {
|
|
1258
|
-
return plus.apply(void 0,
|
|
1267
|
+
return plus.apply(void 0, [plus(num1, num2)].concat(rest));
|
|
1259
1268
|
}
|
|
1260
1269
|
num1 = transformEffectiveNumber(num1);
|
|
1261
1270
|
num2 = transformEffectiveNumber(num2);
|
|
@@ -1271,9 +1280,11 @@
|
|
|
1271
1280
|
for (var _i = 0; _i < arguments.length; _i++) {
|
|
1272
1281
|
nums[_i] = arguments[_i];
|
|
1273
1282
|
}
|
|
1274
|
-
var
|
|
1283
|
+
var num1 = nums[0];
|
|
1284
|
+
var num2 = nums[1] === void 0 ? 0 : nums[1];
|
|
1285
|
+
var rest = nums.slice(2);
|
|
1275
1286
|
if (rest.length > 0) {
|
|
1276
|
-
return minus.apply(void 0,
|
|
1287
|
+
return minus.apply(void 0, [minus(num1, num2)].concat(rest));
|
|
1277
1288
|
}
|
|
1278
1289
|
num1 = transformEffectiveNumber(num1);
|
|
1279
1290
|
num2 = transformEffectiveNumber(num2);
|
|
@@ -1289,9 +1300,11 @@
|
|
|
1289
1300
|
for (var _i = 0; _i < arguments.length; _i++) {
|
|
1290
1301
|
nums[_i] = arguments[_i];
|
|
1291
1302
|
}
|
|
1292
|
-
var
|
|
1303
|
+
var num1 = nums[0];
|
|
1304
|
+
var num2 = nums[1] === void 0 ? 1 : nums[1];
|
|
1305
|
+
var rest = nums.slice(2);
|
|
1293
1306
|
if (rest.length > 0) {
|
|
1294
|
-
return divide.apply(void 0,
|
|
1307
|
+
return divide.apply(void 0, [divide(num1, num2)].concat(rest));
|
|
1295
1308
|
}
|
|
1296
1309
|
num1 = transformEffectiveNumber(num1);
|
|
1297
1310
|
num2 = transformEffectiveNumber(num2);
|
|
@@ -1709,7 +1722,9 @@
|
|
|
1709
1722
|
if (isObject(temp)) {
|
|
1710
1723
|
var childs = temp[childrenField];
|
|
1711
1724
|
if (Array.isArray(childs) && childs.length > 0) {
|
|
1712
|
-
|
|
1725
|
+
childs.forEach(function (c) {
|
|
1726
|
+
stack.push(c);
|
|
1727
|
+
});
|
|
1713
1728
|
}
|
|
1714
1729
|
}
|
|
1715
1730
|
}
|
|
@@ -1748,7 +1763,9 @@
|
|
|
1748
1763
|
if (isObject(temp)) {
|
|
1749
1764
|
var childs = temp[childrenField];
|
|
1750
1765
|
if (Array.isArray(childs) && childs.length > 0) {
|
|
1751
|
-
|
|
1766
|
+
childs.forEach(function (c) {
|
|
1767
|
+
stack.push(c);
|
|
1768
|
+
});
|
|
1752
1769
|
}
|
|
1753
1770
|
}
|
|
1754
1771
|
}
|
|
@@ -1803,9 +1820,9 @@
|
|
|
1803
1820
|
return internalFindTreeSelect(tree, predicate, childrenField);
|
|
1804
1821
|
}
|
|
1805
1822
|
|
|
1806
|
-
var VERSION = "4.19.
|
|
1823
|
+
var VERSION = "4.19.2";
|
|
1807
1824
|
|
|
1808
|
-
var version = "4.19.
|
|
1825
|
+
var version = "4.19.2";
|
|
1809
1826
|
|
|
1810
1827
|
exports.VERSION = VERSION;
|
|
1811
1828
|
exports.ajax = ajax;
|