@byloth/core 1.5.0-rc.3 → 1.5.0-rc.4
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/core.js +215 -255
- package/dist/core.js.map +1 -1
- package/dist/core.umd.cjs +2 -2
- package/dist/core.umd.cjs.map +1 -1
- package/package.json +1 -1
- package/src/index.ts +1 -1
- package/src/models/promises/deferred-promise.ts +8 -73
- package/src/models/promises/smart-promise.ts +43 -21
- package/src/models/promises/timed-promise.ts +5 -24
package/dist/core.js
CHANGED
|
@@ -1,11 +1,11 @@
|
|
|
1
|
-
var
|
|
2
|
-
var
|
|
3
|
-
var
|
|
4
|
-
class
|
|
1
|
+
var g = Object.defineProperty;
|
|
2
|
+
var p = (s, e, t) => e in s ? g(s, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : s[e] = t;
|
|
3
|
+
var u = (s, e, t) => (p(s, typeof e != "symbol" ? e + "" : e, t), t);
|
|
4
|
+
class l {
|
|
5
5
|
constructor(e) {
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
6
|
+
u(this, "_iterator");
|
|
7
|
+
u(this, "return");
|
|
8
|
+
u(this, "throw");
|
|
9
9
|
e instanceof Function ? this._iterator = e() : Symbol.iterator in e ? this._iterator = e[Symbol.iterator]() : this._iterator = e, this._iterator.return && (this.return = (t) => this._iterator.return(t)), this._iterator.throw && (this.throw = (t) => this._iterator.throw(t));
|
|
10
10
|
}
|
|
11
11
|
every(e) {
|
|
@@ -32,41 +32,41 @@ class c {
|
|
|
32
32
|
}
|
|
33
33
|
filter(e) {
|
|
34
34
|
const t = this._iterator;
|
|
35
|
-
return new
|
|
35
|
+
return new l(function* () {
|
|
36
36
|
let n = 0;
|
|
37
37
|
for (; ; ) {
|
|
38
|
-
const
|
|
39
|
-
if (
|
|
40
|
-
return
|
|
41
|
-
e(
|
|
38
|
+
const r = t.next();
|
|
39
|
+
if (r.done)
|
|
40
|
+
return r.value;
|
|
41
|
+
e(r.value, n) && (yield r.value), n += 1;
|
|
42
42
|
}
|
|
43
43
|
});
|
|
44
44
|
}
|
|
45
45
|
map(e) {
|
|
46
46
|
const t = this._iterator;
|
|
47
|
-
return new
|
|
47
|
+
return new l(function* () {
|
|
48
48
|
let n = 0;
|
|
49
49
|
for (; ; ) {
|
|
50
|
-
const
|
|
51
|
-
if (
|
|
52
|
-
return
|
|
53
|
-
yield e(
|
|
50
|
+
const r = t.next();
|
|
51
|
+
if (r.done)
|
|
52
|
+
return r.value;
|
|
53
|
+
yield e(r.value, n), n += 1;
|
|
54
54
|
}
|
|
55
55
|
});
|
|
56
56
|
}
|
|
57
57
|
reduce(e, t) {
|
|
58
|
-
let n = 0,
|
|
59
|
-
if (
|
|
60
|
-
const
|
|
61
|
-
if (
|
|
58
|
+
let n = 0, r = t;
|
|
59
|
+
if (r === void 0) {
|
|
60
|
+
const o = this._iterator.next();
|
|
61
|
+
if (o.done)
|
|
62
62
|
throw new TypeError("Reduce of empty iterator with no initial value");
|
|
63
|
-
|
|
63
|
+
r = o.value, n += 1;
|
|
64
64
|
}
|
|
65
65
|
for (; ; ) {
|
|
66
|
-
const
|
|
67
|
-
if (
|
|
68
|
-
return
|
|
69
|
-
|
|
66
|
+
const o = this._iterator.next();
|
|
67
|
+
if (o.done)
|
|
68
|
+
return r;
|
|
69
|
+
r = e(r, o.value, n), n += 1;
|
|
70
70
|
}
|
|
71
71
|
}
|
|
72
72
|
enumerate() {
|
|
@@ -74,7 +74,7 @@ class c {
|
|
|
74
74
|
}
|
|
75
75
|
unique() {
|
|
76
76
|
const e = this._iterator;
|
|
77
|
-
return new
|
|
77
|
+
return new l(function* () {
|
|
78
78
|
const t = /* @__PURE__ */ new Set();
|
|
79
79
|
for (; ; ) {
|
|
80
80
|
const n = e.next();
|
|
@@ -114,28 +114,28 @@ class c {
|
|
|
114
114
|
return this;
|
|
115
115
|
}
|
|
116
116
|
}
|
|
117
|
-
class
|
|
117
|
+
class c {
|
|
118
118
|
constructor(e) {
|
|
119
|
-
|
|
120
|
-
this._elements = new
|
|
119
|
+
u(this, "_elements");
|
|
120
|
+
this._elements = new l(e);
|
|
121
121
|
}
|
|
122
122
|
filter(e) {
|
|
123
123
|
const t = this._elements;
|
|
124
|
-
return new
|
|
125
|
-
for (const [n, [
|
|
126
|
-
e(
|
|
124
|
+
return new c(function* () {
|
|
125
|
+
for (const [n, [r, o]] of t.enumerate())
|
|
126
|
+
e(r, o, n) && (yield [r, o]);
|
|
127
127
|
});
|
|
128
128
|
}
|
|
129
129
|
map(e) {
|
|
130
130
|
const t = this._elements;
|
|
131
|
-
return new
|
|
132
|
-
for (const [n, [
|
|
133
|
-
yield [
|
|
131
|
+
return new c(function* () {
|
|
132
|
+
for (const [n, [r, o]] of t.enumerate())
|
|
133
|
+
yield [r, e(r, o, n)];
|
|
134
134
|
});
|
|
135
135
|
}
|
|
136
136
|
keys() {
|
|
137
137
|
const e = this._elements;
|
|
138
|
-
return new
|
|
138
|
+
return new l(function* () {
|
|
139
139
|
for (const [t] of e)
|
|
140
140
|
yield t;
|
|
141
141
|
});
|
|
@@ -145,7 +145,7 @@ class a {
|
|
|
145
145
|
}
|
|
146
146
|
values() {
|
|
147
147
|
const e = this._elements;
|
|
148
|
-
return new
|
|
148
|
+
return new l(function* () {
|
|
149
149
|
for (const [t, n] of e)
|
|
150
150
|
yield n;
|
|
151
151
|
});
|
|
@@ -165,38 +165,38 @@ class a {
|
|
|
165
165
|
}
|
|
166
166
|
class h {
|
|
167
167
|
constructor(e) {
|
|
168
|
-
|
|
169
|
-
this._elements = new
|
|
168
|
+
u(this, "_elements");
|
|
169
|
+
this._elements = new l(e);
|
|
170
170
|
}
|
|
171
171
|
every(e) {
|
|
172
172
|
const t = /* @__PURE__ */ new Map();
|
|
173
|
-
for (const [n,
|
|
174
|
-
const [
|
|
175
|
-
|
|
173
|
+
for (const [n, r] of this._elements) {
|
|
174
|
+
const [o, i] = t.get(n) ?? [0, !0];
|
|
175
|
+
i && t.set(n, [o + 1, e(n, r, o)]);
|
|
176
176
|
}
|
|
177
|
-
return new
|
|
178
|
-
for (const [n, [
|
|
179
|
-
yield [n,
|
|
177
|
+
return new c(function* () {
|
|
178
|
+
for (const [n, [r, o]] of t)
|
|
179
|
+
yield [n, o];
|
|
180
180
|
});
|
|
181
181
|
}
|
|
182
182
|
some(e) {
|
|
183
183
|
const t = /* @__PURE__ */ new Map();
|
|
184
|
-
for (const [n,
|
|
185
|
-
const [
|
|
186
|
-
|
|
184
|
+
for (const [n, r] of this._elements) {
|
|
185
|
+
const [o, i] = t.get(n) ?? [0, !1];
|
|
186
|
+
i || t.set(n, [o + 1, e(n, r, o)]);
|
|
187
187
|
}
|
|
188
|
-
return new
|
|
189
|
-
for (const [n, [
|
|
190
|
-
yield [n,
|
|
188
|
+
return new c(function* () {
|
|
189
|
+
for (const [n, [r, o]] of t)
|
|
190
|
+
yield [n, o];
|
|
191
191
|
});
|
|
192
192
|
}
|
|
193
193
|
filter(e) {
|
|
194
194
|
const t = this._elements;
|
|
195
195
|
return new h(function* () {
|
|
196
196
|
const n = /* @__PURE__ */ new Map();
|
|
197
|
-
for (const [
|
|
198
|
-
const
|
|
199
|
-
n.set(
|
|
197
|
+
for (const [r, o] of t) {
|
|
198
|
+
const i = n.get(r) ?? 0;
|
|
199
|
+
n.set(r, i + 1), e(r, o, i) && (yield [r, o]);
|
|
200
200
|
}
|
|
201
201
|
});
|
|
202
202
|
}
|
|
@@ -204,38 +204,38 @@ class h {
|
|
|
204
204
|
const t = this._elements;
|
|
205
205
|
return new h(function* () {
|
|
206
206
|
const n = /* @__PURE__ */ new Map();
|
|
207
|
-
for (const [
|
|
208
|
-
const
|
|
209
|
-
n.set(
|
|
207
|
+
for (const [r, o] of t) {
|
|
208
|
+
const i = n.get(r) ?? 0;
|
|
209
|
+
n.set(r, i + 1), yield [r, e(r, o, i)];
|
|
210
210
|
}
|
|
211
211
|
});
|
|
212
212
|
}
|
|
213
213
|
reduce(e, t) {
|
|
214
214
|
const n = /* @__PURE__ */ new Map();
|
|
215
|
-
for (const [
|
|
216
|
-
let
|
|
217
|
-
if (n.has(
|
|
218
|
-
[
|
|
215
|
+
for (const [r, o] of this._elements) {
|
|
216
|
+
let i, a;
|
|
217
|
+
if (n.has(r))
|
|
218
|
+
[i, a] = n.get(r), i += 1;
|
|
219
219
|
else if (t !== void 0)
|
|
220
|
-
|
|
220
|
+
i = 0, a = t(r);
|
|
221
221
|
else {
|
|
222
|
-
n.set(
|
|
222
|
+
n.set(r, [0, o]);
|
|
223
223
|
continue;
|
|
224
224
|
}
|
|
225
|
-
|
|
225
|
+
a = e(r, a, o, i), n.set(r, [i, a]);
|
|
226
226
|
}
|
|
227
|
-
return new
|
|
228
|
-
for (const [
|
|
229
|
-
yield [
|
|
227
|
+
return new c(function* () {
|
|
228
|
+
for (const [r, [o, i]] of n)
|
|
229
|
+
yield [r, i];
|
|
230
230
|
});
|
|
231
231
|
}
|
|
232
232
|
unique() {
|
|
233
233
|
const e = this._elements;
|
|
234
234
|
return new h(function* () {
|
|
235
235
|
const t = /* @__PURE__ */ new Map();
|
|
236
|
-
for (const [n,
|
|
237
|
-
const
|
|
238
|
-
|
|
236
|
+
for (const [n, r] of e) {
|
|
237
|
+
const o = t.get(n) ?? /* @__PURE__ */ new Set();
|
|
238
|
+
o.has(r) || (o.add(r), t.set(n, o), yield [n, r]);
|
|
239
239
|
}
|
|
240
240
|
});
|
|
241
241
|
}
|
|
@@ -245,7 +245,7 @@ class h {
|
|
|
245
245
|
const n = e.get(t) ?? 0;
|
|
246
246
|
e.set(t, n + 1);
|
|
247
247
|
}
|
|
248
|
-
return new
|
|
248
|
+
return new c(function* () {
|
|
249
249
|
for (const [t, n] of e)
|
|
250
250
|
yield [t, n];
|
|
251
251
|
});
|
|
@@ -254,7 +254,7 @@ class h {
|
|
|
254
254
|
const e = /* @__PURE__ */ new Map();
|
|
255
255
|
for (const [t, n] of this._elements)
|
|
256
256
|
e.has(t) || e.set(t, n);
|
|
257
|
-
return new
|
|
257
|
+
return new c(function* () {
|
|
258
258
|
for (const [t, n] of e)
|
|
259
259
|
yield [t, n];
|
|
260
260
|
});
|
|
@@ -263,14 +263,14 @@ class h {
|
|
|
263
263
|
const e = /* @__PURE__ */ new Map();
|
|
264
264
|
for (const [t, n] of this._elements)
|
|
265
265
|
e.set(t, n);
|
|
266
|
-
return new
|
|
266
|
+
return new c(function* () {
|
|
267
267
|
for (const [t, n] of e)
|
|
268
268
|
yield [t, n];
|
|
269
269
|
});
|
|
270
270
|
}
|
|
271
271
|
keys() {
|
|
272
272
|
const e = this._elements;
|
|
273
|
-
return new
|
|
273
|
+
return new l(function* () {
|
|
274
274
|
for (const [t] of e)
|
|
275
275
|
yield t;
|
|
276
276
|
});
|
|
@@ -280,7 +280,7 @@ class h {
|
|
|
280
280
|
}
|
|
281
281
|
values() {
|
|
282
282
|
const e = this._elements;
|
|
283
|
-
return new
|
|
283
|
+
return new l(function* () {
|
|
284
284
|
for (const [t, n] of e)
|
|
285
285
|
yield n;
|
|
286
286
|
});
|
|
@@ -291,16 +291,16 @@ class h {
|
|
|
291
291
|
toMap() {
|
|
292
292
|
const e = /* @__PURE__ */ new Map();
|
|
293
293
|
for (const [t, n] of this._elements) {
|
|
294
|
-
const
|
|
295
|
-
|
|
294
|
+
const r = e.get(t) ?? [];
|
|
295
|
+
r.push(n), e.set(t, r);
|
|
296
296
|
}
|
|
297
297
|
return e;
|
|
298
298
|
}
|
|
299
299
|
toObject() {
|
|
300
300
|
const e = {};
|
|
301
301
|
for (const [t, n] of this._elements) {
|
|
302
|
-
const
|
|
303
|
-
|
|
302
|
+
const r = e[t] ?? [];
|
|
303
|
+
r.push(n), e[t] = r;
|
|
304
304
|
}
|
|
305
305
|
return e;
|
|
306
306
|
}
|
|
@@ -310,8 +310,8 @@ class h {
|
|
|
310
310
|
}
|
|
311
311
|
class m {
|
|
312
312
|
constructor(e) {
|
|
313
|
-
|
|
314
|
-
this._elements = new
|
|
313
|
+
u(this, "_elements");
|
|
314
|
+
this._elements = new l(e);
|
|
315
315
|
}
|
|
316
316
|
filter(e) {
|
|
317
317
|
return new m(this._elements.filter(e));
|
|
@@ -358,7 +358,7 @@ class v extends f {
|
|
|
358
358
|
return "ReferenceException";
|
|
359
359
|
}
|
|
360
360
|
}
|
|
361
|
-
class
|
|
361
|
+
class x extends f {
|
|
362
362
|
constructor(e, t, n = "TimeoutException") {
|
|
363
363
|
super(e, t, n);
|
|
364
364
|
}
|
|
@@ -366,7 +366,7 @@ class p extends f {
|
|
|
366
366
|
return "TimeoutException";
|
|
367
367
|
}
|
|
368
368
|
}
|
|
369
|
-
class
|
|
369
|
+
class _ extends f {
|
|
370
370
|
constructor(e, t, n = "ValueException") {
|
|
371
371
|
super(e, t, n);
|
|
372
372
|
}
|
|
@@ -374,32 +374,32 @@ class g extends f {
|
|
|
374
374
|
return "ValueException";
|
|
375
375
|
}
|
|
376
376
|
}
|
|
377
|
-
class
|
|
377
|
+
class T {
|
|
378
378
|
constructor(e = !0) {
|
|
379
|
-
|
|
380
|
-
|
|
381
|
-
|
|
379
|
+
u(this, "_preferPersistence");
|
|
380
|
+
u(this, "_volatile");
|
|
381
|
+
u(this, "_persistent");
|
|
382
382
|
this._preferPersistence = e, this._volatile = window.sessionStorage, this._persistent = window.localStorage;
|
|
383
383
|
}
|
|
384
384
|
_get(e, t, n) {
|
|
385
|
-
const
|
|
386
|
-
if (
|
|
385
|
+
const r = e.getItem(t);
|
|
386
|
+
if (r)
|
|
387
387
|
try {
|
|
388
|
-
return JSON.parse(
|
|
388
|
+
return JSON.parse(r);
|
|
389
389
|
} catch {
|
|
390
390
|
console.warn(
|
|
391
|
-
`The "${
|
|
391
|
+
`The "${r}" value for "${t}" property cannot be parsed. Clearing the storage...`
|
|
392
392
|
), e.removeItem(t);
|
|
393
393
|
}
|
|
394
394
|
return n;
|
|
395
395
|
}
|
|
396
396
|
_set(e, t, n) {
|
|
397
|
-
const
|
|
398
|
-
|
|
397
|
+
const r = JSON.stringify(n);
|
|
398
|
+
r ? e.setItem(t, r) : e.removeItem(t);
|
|
399
399
|
}
|
|
400
400
|
get(e, t, n = this._preferPersistence) {
|
|
401
|
-
const
|
|
402
|
-
return this._get(
|
|
401
|
+
const r = n ? this._persistent : this._volatile;
|
|
402
|
+
return this._get(r, e, t);
|
|
403
403
|
}
|
|
404
404
|
recall(e, t) {
|
|
405
405
|
return this._get(this._volatile, e, t);
|
|
@@ -461,8 +461,8 @@ class k {
|
|
|
461
461
|
* @param persistent Whether to use the persistent `localStorage` or the volatile `sessionStorage`.
|
|
462
462
|
*/
|
|
463
463
|
set(e, t, n = this._preferPersistence) {
|
|
464
|
-
const
|
|
465
|
-
this._set(
|
|
464
|
+
const r = n ? this._persistent : this._volatile;
|
|
465
|
+
this._set(r, e, t);
|
|
466
466
|
}
|
|
467
467
|
/**
|
|
468
468
|
* Sets the value with the specified name in the volatile `sessionStorage`.
|
|
@@ -512,9 +512,9 @@ class k {
|
|
|
512
512
|
return "JsonStorage";
|
|
513
513
|
}
|
|
514
514
|
}
|
|
515
|
-
class
|
|
515
|
+
class M {
|
|
516
516
|
constructor() {
|
|
517
|
-
|
|
517
|
+
u(this, "_subscribers");
|
|
518
518
|
this._subscribers = [];
|
|
519
519
|
}
|
|
520
520
|
add(e) {
|
|
@@ -533,37 +533,17 @@ class P {
|
|
|
533
533
|
return "Subscribers";
|
|
534
534
|
}
|
|
535
535
|
}
|
|
536
|
-
class
|
|
537
|
-
constructor(
|
|
538
|
-
|
|
539
|
-
|
|
540
|
-
|
|
541
|
-
|
|
542
|
-
const u = await o, d = t(u);
|
|
543
|
-
s(d);
|
|
544
|
-
} catch (u) {
|
|
545
|
-
this._reject(u);
|
|
546
|
-
}
|
|
547
|
-
} : this._resolve = (o) => {
|
|
548
|
-
this._isPending = !1, this._isFulfilled = !0, s(o);
|
|
549
|
-
}, n ? this._reject = (o) => {
|
|
550
|
-
this._isPending = !1, this._isRejected = !0;
|
|
551
|
-
try {
|
|
552
|
-
const u = n(o);
|
|
553
|
-
s(u);
|
|
554
|
-
} catch (u) {
|
|
555
|
-
i(u);
|
|
556
|
-
}
|
|
557
|
-
} : this._reject = (o) => {
|
|
558
|
-
this._isPending = !1, this._isRejected = !0, i(o);
|
|
559
|
-
};
|
|
560
|
-
});
|
|
561
|
-
l(this, "_isPending");
|
|
562
|
-
l(this, "_isFulfilled");
|
|
563
|
-
l(this, "_isRejected");
|
|
564
|
-
l(this, "_resolve");
|
|
565
|
-
l(this, "_reject");
|
|
536
|
+
class w {
|
|
537
|
+
constructor(e) {
|
|
538
|
+
u(this, "_isPending");
|
|
539
|
+
u(this, "_isFulfilled");
|
|
540
|
+
u(this, "_isRejected");
|
|
541
|
+
u(this, "_promise");
|
|
566
542
|
this._isPending = !0, this._isFulfilled = !1, this._isRejected = !1;
|
|
543
|
+
const t = (r) => (this._isPending = !1, this._isFulfilled = !0, r), n = (r) => {
|
|
544
|
+
throw this._isPending = !1, this._isRejected = !0, r;
|
|
545
|
+
};
|
|
546
|
+
this._promise = new Promise(e).then(t, n);
|
|
567
547
|
}
|
|
568
548
|
get isPending() {
|
|
569
549
|
return this._isPending;
|
|
@@ -574,77 +554,57 @@ class T extends Promise {
|
|
|
574
554
|
get isRejected() {
|
|
575
555
|
return this._isRejected;
|
|
576
556
|
}
|
|
577
|
-
|
|
578
|
-
return this.
|
|
557
|
+
then(e, t) {
|
|
558
|
+
return this._promise.then(e, t);
|
|
579
559
|
}
|
|
580
|
-
|
|
581
|
-
return this.
|
|
560
|
+
catch(e) {
|
|
561
|
+
return this._promise.catch(e);
|
|
582
562
|
}
|
|
583
|
-
|
|
584
|
-
return
|
|
563
|
+
finally(e) {
|
|
564
|
+
return this._promise.finally(e);
|
|
585
565
|
}
|
|
586
566
|
get [Symbol.toStringTag]() {
|
|
587
|
-
return "
|
|
567
|
+
return "SmartPromise";
|
|
588
568
|
}
|
|
589
569
|
}
|
|
590
|
-
class
|
|
591
|
-
constructor(t) {
|
|
592
|
-
super((
|
|
593
|
-
|
|
594
|
-
this._isPending = !1, this._isFulfilled = !0, n(u);
|
|
595
|
-
}, (u) => {
|
|
596
|
-
this._isPending = !1, this._isRejected = !0, s(u);
|
|
597
|
-
});
|
|
570
|
+
class P extends w {
|
|
571
|
+
constructor(t, n) {
|
|
572
|
+
super((r, o) => {
|
|
573
|
+
this._resolve = r, this._reject = o;
|
|
598
574
|
});
|
|
599
|
-
|
|
600
|
-
|
|
601
|
-
|
|
602
|
-
this._isPending = !0, this._isFulfilled = !1, this._isRejected = !1;
|
|
575
|
+
u(this, "_resolve");
|
|
576
|
+
u(this, "_reject");
|
|
577
|
+
this._promise.then(t, n);
|
|
603
578
|
}
|
|
604
|
-
get
|
|
605
|
-
return this.
|
|
579
|
+
get resolve() {
|
|
580
|
+
return this._resolve;
|
|
606
581
|
}
|
|
607
|
-
get
|
|
608
|
-
return this.
|
|
582
|
+
get reject() {
|
|
583
|
+
return this._reject;
|
|
609
584
|
}
|
|
610
|
-
|
|
611
|
-
return this.
|
|
585
|
+
watch(t) {
|
|
586
|
+
return t.then(this.resolve, this.reject), this;
|
|
612
587
|
}
|
|
613
588
|
get [Symbol.toStringTag]() {
|
|
614
|
-
return "
|
|
589
|
+
return "DeferredPromise";
|
|
615
590
|
}
|
|
616
591
|
}
|
|
617
|
-
class
|
|
618
|
-
constructor(
|
|
619
|
-
super((
|
|
620
|
-
const o = (
|
|
621
|
-
|
|
622
|
-
},
|
|
623
|
-
|
|
624
|
-
},
|
|
625
|
-
|
|
626
|
-
}, n);
|
|
627
|
-
t(o, u);
|
|
592
|
+
class j extends w {
|
|
593
|
+
constructor(e, t) {
|
|
594
|
+
super((n, r) => {
|
|
595
|
+
const o = (d) => {
|
|
596
|
+
clearTimeout(y), n(d);
|
|
597
|
+
}, i = (d) => {
|
|
598
|
+
clearTimeout(y), r(d);
|
|
599
|
+
}, y = setTimeout(() => i(new x("The operation has timed out.")), t);
|
|
600
|
+
e(o, i);
|
|
628
601
|
});
|
|
629
|
-
l(this, "_isPending");
|
|
630
|
-
l(this, "_isFulfilled");
|
|
631
|
-
l(this, "_isRejected");
|
|
632
|
-
this._isPending = !0, this._isFulfilled = !1, this._isRejected = !1;
|
|
633
|
-
}
|
|
634
|
-
get isPending() {
|
|
635
|
-
return this._isPending;
|
|
636
|
-
}
|
|
637
|
-
get isFulfilled() {
|
|
638
|
-
return this._isFulfilled;
|
|
639
|
-
}
|
|
640
|
-
get isRejected() {
|
|
641
|
-
return this._isRejected;
|
|
642
602
|
}
|
|
643
603
|
get [Symbol.toStringTag]() {
|
|
644
604
|
return "TimedPromise";
|
|
645
605
|
}
|
|
646
606
|
}
|
|
647
|
-
class
|
|
607
|
+
class E {
|
|
648
608
|
static Boolean(e = 0.5) {
|
|
649
609
|
return Math.random() < e;
|
|
650
610
|
}
|
|
@@ -661,141 +621,141 @@ class R {
|
|
|
661
621
|
constructor() {
|
|
662
622
|
}
|
|
663
623
|
}
|
|
664
|
-
async function
|
|
665
|
-
return new Promise((e, t) => setTimeout(e,
|
|
624
|
+
async function I(s) {
|
|
625
|
+
return new Promise((e, t) => setTimeout(e, s));
|
|
666
626
|
}
|
|
667
|
-
async function
|
|
668
|
-
return new Promise((
|
|
627
|
+
async function R() {
|
|
628
|
+
return new Promise((s, e) => requestAnimationFrame(() => s()));
|
|
669
629
|
}
|
|
670
|
-
var
|
|
671
|
-
function
|
|
672
|
-
return Math.floor((e.getTime() -
|
|
630
|
+
var b = /* @__PURE__ */ ((s) => (s[s.Second = 1e3] = "Second", s[s.Minute = 6e4] = "Minute", s[s.Hour = 36e5] = "Hour", s[s.Day = 864e5] = "Day", s[s.Week = 6048e5] = "Week", s[s.Month = 2592e6] = "Month", s[s.Year = 31536e6] = "Year", s))(b || {});
|
|
631
|
+
function A(s, e, t = 864e5) {
|
|
632
|
+
return Math.floor((e.getTime() - s.getTime()) / t);
|
|
673
633
|
}
|
|
674
|
-
function
|
|
675
|
-
return new
|
|
634
|
+
function F(s, e, t = 864e5) {
|
|
635
|
+
return new l(function* () {
|
|
676
636
|
const n = e.getTime();
|
|
677
|
-
let
|
|
678
|
-
for (;
|
|
679
|
-
yield new Date(
|
|
637
|
+
let r = s.getTime();
|
|
638
|
+
for (; r < n; )
|
|
639
|
+
yield new Date(r), r += t;
|
|
680
640
|
});
|
|
681
641
|
}
|
|
682
|
-
function q(
|
|
683
|
-
return new Date(Math.floor(
|
|
642
|
+
function q(s, e = 864e5) {
|
|
643
|
+
return new Date(Math.floor(s.getTime() / e) * e);
|
|
684
644
|
}
|
|
685
|
-
async function C(
|
|
645
|
+
async function C(s, e = "text/javascript") {
|
|
686
646
|
return new Promise((t, n) => {
|
|
687
|
-
const
|
|
688
|
-
|
|
647
|
+
const r = document.createElement("script");
|
|
648
|
+
r.async = !0, r.defer = !0, r.src = s, r.type = e, r.onload = () => t(), r.onerror = () => n(), document.body.appendChild(r);
|
|
689
649
|
});
|
|
690
650
|
}
|
|
691
|
-
function O(
|
|
692
|
-
if (Array.isArray(
|
|
693
|
-
return
|
|
651
|
+
function O(s) {
|
|
652
|
+
if (Array.isArray(s))
|
|
653
|
+
return s.length;
|
|
694
654
|
let e = 0;
|
|
695
|
-
for (const t of
|
|
655
|
+
for (const t of s)
|
|
696
656
|
e += 1;
|
|
697
657
|
return e;
|
|
698
658
|
}
|
|
699
|
-
function $(
|
|
700
|
-
return new
|
|
701
|
-
e === void 0 && (e =
|
|
702
|
-
for (let n =
|
|
659
|
+
function $(s, e, t = 1) {
|
|
660
|
+
return new l(function* () {
|
|
661
|
+
e === void 0 && (e = s, s = 0), s > e && (t = t ?? -1);
|
|
662
|
+
for (let n = s; n < e; n += t)
|
|
703
663
|
yield n;
|
|
704
664
|
});
|
|
705
665
|
}
|
|
706
|
-
function V(
|
|
707
|
-
const e = Array.from(
|
|
666
|
+
function V(s) {
|
|
667
|
+
const e = Array.from(s);
|
|
708
668
|
for (let t = e.length - 1; t > 0; t -= 1) {
|
|
709
669
|
const n = Math.floor(Math.random() * (t + 1));
|
|
710
670
|
[e[t], e[n]] = [e[n], e[t]];
|
|
711
671
|
}
|
|
712
672
|
return e;
|
|
713
673
|
}
|
|
714
|
-
function J(
|
|
715
|
-
return new
|
|
674
|
+
function J(s) {
|
|
675
|
+
return new l(function* () {
|
|
716
676
|
const e = /* @__PURE__ */ new Set();
|
|
717
|
-
for (const t of
|
|
677
|
+
for (const t of s)
|
|
718
678
|
e.has(t) || (e.add(t), yield t);
|
|
719
679
|
});
|
|
720
680
|
}
|
|
721
|
-
function
|
|
722
|
-
return new
|
|
723
|
-
const t =
|
|
681
|
+
function S(s, e) {
|
|
682
|
+
return new l(function* () {
|
|
683
|
+
const t = s[Symbol.iterator](), n = e[Symbol.iterator]();
|
|
724
684
|
for (; ; ) {
|
|
725
|
-
const
|
|
726
|
-
if (
|
|
685
|
+
const r = t.next(), o = n.next();
|
|
686
|
+
if (r.done || o.done)
|
|
727
687
|
break;
|
|
728
|
-
yield [
|
|
688
|
+
yield [r.value, o.value];
|
|
729
689
|
}
|
|
730
690
|
});
|
|
731
691
|
}
|
|
732
|
-
function Y(
|
|
692
|
+
function Y(s, e) {
|
|
733
693
|
if (e === void 0) {
|
|
734
|
-
let
|
|
735
|
-
for (const
|
|
736
|
-
|
|
737
|
-
if (
|
|
738
|
-
throw new
|
|
739
|
-
return
|
|
740
|
-
}
|
|
741
|
-
let t = 0, n = 0,
|
|
742
|
-
for (const [
|
|
743
|
-
t +=
|
|
744
|
-
if (
|
|
745
|
-
throw new
|
|
694
|
+
let o = 0, i = 0;
|
|
695
|
+
for (const a of s)
|
|
696
|
+
o += a, i += 1;
|
|
697
|
+
if (i === 0)
|
|
698
|
+
throw new _("You must provide at least one value.");
|
|
699
|
+
return o / i;
|
|
700
|
+
}
|
|
701
|
+
let t = 0, n = 0, r = 0;
|
|
702
|
+
for (const [o, i] of S(s, e))
|
|
703
|
+
t += o * i, n += i, r += 1;
|
|
704
|
+
if (r === 0)
|
|
705
|
+
throw new _("You must provide at least one value and weight.");
|
|
746
706
|
if (n === 0)
|
|
747
|
-
throw new
|
|
707
|
+
throw new _("The sum of weights must be greater than zero.");
|
|
748
708
|
return t / n;
|
|
749
709
|
}
|
|
750
|
-
function z(
|
|
710
|
+
function z(s) {
|
|
751
711
|
let e = 0;
|
|
752
|
-
for (let t = 0; t <
|
|
753
|
-
const n =
|
|
712
|
+
for (let t = 0; t < s.length; t += 1) {
|
|
713
|
+
const n = s.charCodeAt(t);
|
|
754
714
|
e = (e << 5) - e + n, e |= 0;
|
|
755
715
|
}
|
|
756
716
|
return e;
|
|
757
717
|
}
|
|
758
|
-
function B(
|
|
718
|
+
function B(s) {
|
|
759
719
|
let e = 0;
|
|
760
|
-
for (const t of
|
|
720
|
+
for (const t of s)
|
|
761
721
|
e += t;
|
|
762
722
|
return e;
|
|
763
723
|
}
|
|
764
|
-
function H(
|
|
765
|
-
return `${
|
|
724
|
+
function H(s) {
|
|
725
|
+
return `${s.charAt(0).toUpperCase()}${s.slice(1)}`;
|
|
766
726
|
}
|
|
767
|
-
const W = "1.5.0-rc.
|
|
727
|
+
const W = "1.5.0-rc.4";
|
|
768
728
|
export {
|
|
769
729
|
h as AggregatedIterator,
|
|
770
730
|
m as Aggregator,
|
|
771
|
-
|
|
772
|
-
|
|
731
|
+
b as DateUnit,
|
|
732
|
+
P as DeferredPromise,
|
|
773
733
|
f as Exception,
|
|
774
|
-
|
|
775
|
-
|
|
776
|
-
|
|
734
|
+
T as JsonStorage,
|
|
735
|
+
E as Random,
|
|
736
|
+
c as ReducedIterator,
|
|
777
737
|
v as ReferenceException,
|
|
778
|
-
|
|
779
|
-
|
|
780
|
-
|
|
781
|
-
|
|
782
|
-
|
|
738
|
+
l as SmartIterator,
|
|
739
|
+
w as SmartPromise,
|
|
740
|
+
M as Subscribers,
|
|
741
|
+
j as TimedPromise,
|
|
742
|
+
x as TimeoutException,
|
|
783
743
|
W as VERSION,
|
|
784
|
-
|
|
744
|
+
_ as ValueException,
|
|
785
745
|
Y as average,
|
|
786
746
|
H as capitalize,
|
|
787
747
|
O as count,
|
|
788
|
-
|
|
789
|
-
|
|
748
|
+
A as dateDifference,
|
|
749
|
+
F as dateRange,
|
|
790
750
|
q as dateRound,
|
|
791
|
-
|
|
751
|
+
I as delay,
|
|
792
752
|
z as hash,
|
|
793
753
|
C as loadScript,
|
|
794
|
-
|
|
754
|
+
R as nextAnimationFrame,
|
|
795
755
|
$ as range,
|
|
796
756
|
V as shuffle,
|
|
797
757
|
B as sum,
|
|
798
758
|
J as unique,
|
|
799
|
-
|
|
759
|
+
S as zip
|
|
800
760
|
};
|
|
801
761
|
//# sourceMappingURL=core.js.map
|