@nlozgachev/pipelined 0.44.0 → 0.45.0
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/README.md +7 -6
- package/dist/{InternalTypes-BL23H8Qr.d.mts → InternalTypes-CLE7qlOc.d.mts} +33 -28
- package/dist/{InternalTypes-7o9-yrHq.d.ts → InternalTypes-Mssktd7z.d.ts} +33 -28
- package/dist/{Validation-DM2eh6wj.d.ts → Validation-BMsvixWH.d.ts} +475 -443
- package/dist/{Validation-Dz70wtcG.d.mts → Validation-v38R0qH-.d.mts} +475 -443
- package/dist/{chunk-LKTOK5IT.mjs → chunk-2LKJF45J.mjs} +160 -68
- package/dist/{chunk-X6XQX3OZ.mjs → chunk-KOYYDQH4.mjs} +2 -2
- package/dist/{chunk-ND476266.mjs → chunk-VSU36S2K.mjs} +432 -309
- package/dist/{chunk-74JKKJ4R.mjs → chunk-XTVF5R6R.mjs} +8 -5
- package/dist/composition.d.mts +10 -10
- package/dist/composition.d.ts +10 -10
- package/dist/composition.js +9 -6
- package/dist/composition.mjs +2 -2
- package/dist/core.d.mts +453 -402
- package/dist/core.d.ts +453 -402
- package/dist/core.js +439 -313
- package/dist/core.mjs +2 -2
- package/dist/index.d.mts +3 -3
- package/dist/index.d.ts +3 -3
- package/dist/index.js +599 -381
- package/dist/index.mjs +4 -4
- package/dist/types.d.mts +23 -21
- package/dist/types.d.ts +23 -21
- package/dist/types.js +8 -5
- package/dist/types.mjs +1 -1
- package/dist/utils.d.mts +466 -216
- package/dist/utils.d.ts +466 -216
- package/dist/utils.js +406 -238
- package/dist/utils.mjs +3 -3
- package/package.json +1 -1
|
@@ -4,7 +4,7 @@ import {
|
|
|
4
4
|
Result,
|
|
5
5
|
Task,
|
|
6
6
|
isNonEmptyArr
|
|
7
|
-
} from "./chunk-
|
|
7
|
+
} from "./chunk-VSU36S2K.mjs";
|
|
8
8
|
|
|
9
9
|
// src/Data/Arr.ts
|
|
10
10
|
var ArrMaybe;
|
|
@@ -15,11 +15,11 @@ var ArrMaybe;
|
|
|
15
15
|
for (let i = 0; i < n; i++) {
|
|
16
16
|
const mapped = f(data[i]);
|
|
17
17
|
if (mapped.kind === "None") {
|
|
18
|
-
return Maybe.none();
|
|
18
|
+
return Maybe.make.none();
|
|
19
19
|
}
|
|
20
20
|
result[i] = mapped.value;
|
|
21
21
|
}
|
|
22
|
-
return Maybe.some(result);
|
|
22
|
+
return Maybe.make.some(result);
|
|
23
23
|
};
|
|
24
24
|
ArrMaybe2.sequence = (data) => (0, ArrMaybe2.traverse)((a) => a)(data);
|
|
25
25
|
})(ArrMaybe || (ArrMaybe = {}));
|
|
@@ -35,61 +35,69 @@ var ArrResult;
|
|
|
35
35
|
}
|
|
36
36
|
result[i] = mapped.value;
|
|
37
37
|
}
|
|
38
|
-
return Result.ok(result);
|
|
38
|
+
return Result.make.ok(result);
|
|
39
39
|
};
|
|
40
40
|
ArrResult2.sequence = (data) => (0, ArrResult2.traverse)((a) => a)(data);
|
|
41
41
|
})(ArrResult || (ArrResult = {}));
|
|
42
42
|
var ArrTaskResult;
|
|
43
43
|
((ArrTaskResult2) => {
|
|
44
|
-
ArrTaskResult2.traverse = (f) => (data) => Task.from(async () => {
|
|
44
|
+
ArrTaskResult2.traverse = (f) => (data) => Task.from.Promise(async () => {
|
|
45
45
|
const result = [];
|
|
46
46
|
for (const a of data) {
|
|
47
|
-
const r = await Deferred.
|
|
48
|
-
if (Result.
|
|
47
|
+
const r = await Deferred.to.Promise(f(a)());
|
|
48
|
+
if (Result.is.err(r)) {
|
|
49
49
|
return r;
|
|
50
50
|
}
|
|
51
51
|
result.push(r.value);
|
|
52
52
|
}
|
|
53
|
-
return Result.ok(result);
|
|
53
|
+
return Result.make.ok(result);
|
|
54
54
|
});
|
|
55
55
|
ArrTaskResult2.sequence = (data) => (0, ArrTaskResult2.traverse)((a) => a)(data);
|
|
56
56
|
})(ArrTaskResult || (ArrTaskResult = {}));
|
|
57
57
|
var ArrTask;
|
|
58
58
|
((ArrTask2) => {
|
|
59
|
-
ArrTask2.traverse = (f) => (data) => Task.from(() => Promise.all(data.map((a) => Deferred.
|
|
59
|
+
ArrTask2.traverse = (f) => (data) => Task.from.Promise(() => Promise.all(data.map((a) => Deferred.to.Promise(f(a)()))));
|
|
60
60
|
ArrTask2.sequence = (data) => (0, ArrTask2.traverse)((a) => a)(data);
|
|
61
61
|
ArrTask2.Result = ArrTaskResult;
|
|
62
62
|
})(ArrTask || (ArrTask = {}));
|
|
63
63
|
var ArrNonEmpty;
|
|
64
64
|
((ArrNonEmpty2) => {
|
|
65
65
|
ArrNonEmpty2.singleton = (value) => [value];
|
|
66
|
-
|
|
66
|
+
let from;
|
|
67
|
+
((from2) => {
|
|
68
|
+
from2.Array = (data) => isNonEmptyArr(data) ? Maybe.make.some(data) : Maybe.make.none();
|
|
69
|
+
})(from = ArrNonEmpty2.from || (ArrNonEmpty2.from = {}));
|
|
67
70
|
ArrNonEmpty2.head = (data) => data[0];
|
|
68
71
|
ArrNonEmpty2.last = (data) => data[data.length - 1];
|
|
69
72
|
ArrNonEmpty2.tail = (data) => data.slice(1);
|
|
70
73
|
ArrNonEmpty2.reduce = (f) => (data) => data.reduce(f);
|
|
74
|
+
ArrNonEmpty2.map = (f) => (data) => Arr.map(f)(data);
|
|
75
|
+
ArrNonEmpty2.mapWithIndex = (f) => (data) => Arr.mapWithIndex(f)(data);
|
|
76
|
+
ArrNonEmpty2.intersperse = (sep) => (data) => Arr.intersperse(sep)(data);
|
|
77
|
+
ArrNonEmpty2.concat = (other) => (data) => Arr.concat(other)(data);
|
|
78
|
+
ArrNonEmpty2.reverse = (data) => Arr.reverse(data);
|
|
71
79
|
})(ArrNonEmpty || (ArrNonEmpty = {}));
|
|
72
80
|
var Arr;
|
|
73
81
|
((Arr2) => {
|
|
74
|
-
Arr2.head = (data) => data.length > 0 ? Maybe.some(data[0]) : Maybe.none();
|
|
75
|
-
Arr2.last = (data) => data.length > 0 ? Maybe.some(data[data.length - 1]) : Maybe.none();
|
|
76
|
-
Arr2.tail = (data) => data.length > 0 ? Maybe.some(data.slice(1)) : Maybe.none();
|
|
77
|
-
Arr2.init = (data) => data.length > 0 ? Maybe.some(data.slice(0, -1)) : Maybe.none();
|
|
82
|
+
Arr2.head = (data) => data.length > 0 ? Maybe.make.some(data[0]) : Maybe.make.none();
|
|
83
|
+
Arr2.last = (data) => data.length > 0 ? Maybe.make.some(data[data.length - 1]) : Maybe.make.none();
|
|
84
|
+
Arr2.tail = (data) => data.length > 0 ? Maybe.make.some(data.slice(1)) : Maybe.make.none();
|
|
85
|
+
Arr2.init = (data) => data.length > 0 ? Maybe.make.some(data.slice(0, -1)) : Maybe.make.none();
|
|
78
86
|
Arr2.findFirst = (predicate) => (data) => {
|
|
79
87
|
const idx = data.findIndex(predicate);
|
|
80
|
-
return idx !== -1 ? Maybe.some(data[idx]) : Maybe.none();
|
|
88
|
+
return idx !== -1 ? Maybe.make.some(data[idx]) : Maybe.make.none();
|
|
81
89
|
};
|
|
82
90
|
Arr2.findLast = (predicate) => (data) => {
|
|
83
91
|
for (let i = data.length - 1; i >= 0; i--) {
|
|
84
92
|
if (predicate(data[i])) {
|
|
85
|
-
return Maybe.some(data[i]);
|
|
93
|
+
return Maybe.make.some(data[i]);
|
|
86
94
|
}
|
|
87
95
|
}
|
|
88
|
-
return Maybe.none();
|
|
96
|
+
return Maybe.make.none();
|
|
89
97
|
};
|
|
90
98
|
Arr2.findIndex = (predicate) => (data) => {
|
|
91
99
|
const idx = data.findIndex(predicate);
|
|
92
|
-
return idx !== -1 ? Maybe.some(idx) : Maybe.none();
|
|
100
|
+
return idx !== -1 ? Maybe.make.some(idx) : Maybe.make.none();
|
|
93
101
|
};
|
|
94
102
|
Arr2.map = (f) => (data) => {
|
|
95
103
|
const n = data.length;
|
|
@@ -286,7 +294,11 @@ var Arr;
|
|
|
286
294
|
Arr2.Maybe = ArrMaybe;
|
|
287
295
|
Arr2.Result = ArrResult;
|
|
288
296
|
Arr2.Task = ArrTask;
|
|
289
|
-
|
|
297
|
+
let is;
|
|
298
|
+
((is2) => {
|
|
299
|
+
is2.empty = (data) => data.length === 0;
|
|
300
|
+
is2.nonEmpty = (data) => isNonEmptyArr(data);
|
|
301
|
+
})(is = Arr2.is || (Arr2.is = {}));
|
|
290
302
|
Arr2.prepend = (value) => (data) => [value, ...data];
|
|
291
303
|
Arr2.append = (value) => (data) => [...data, value];
|
|
292
304
|
Arr2.size = (data) => data.length;
|
|
@@ -368,12 +380,34 @@ var Arr;
|
|
|
368
380
|
})(Arr || (Arr = {}));
|
|
369
381
|
|
|
370
382
|
// src/Data/Dict.ts
|
|
383
|
+
var DictNonEmpty;
|
|
384
|
+
((DictNonEmpty2) => {
|
|
385
|
+
DictNonEmpty2.singleton = (key, value) => new globalThis.Map([[key, value]]);
|
|
386
|
+
let from;
|
|
387
|
+
((from2) => {
|
|
388
|
+
from2.Map = (m) => m.size > 0 ? Maybe.make.some(m) : Maybe.make.none();
|
|
389
|
+
})(from = DictNonEmpty2.from || (DictNonEmpty2.from = {}));
|
|
390
|
+
DictNonEmpty2.keys = (m) => Dict.keys(m);
|
|
391
|
+
DictNonEmpty2.values = (m) => Dict.values(m);
|
|
392
|
+
DictNonEmpty2.entries = (m) => Dict.entries(m);
|
|
393
|
+
DictNonEmpty2.reduce = (f) => (m) => (0, DictNonEmpty2.values)(m).reduce(f);
|
|
394
|
+
DictNonEmpty2.map = (f) => (m) => Dict.map(f)(m);
|
|
395
|
+
DictNonEmpty2.mapWithKey = (f) => (m) => Dict.mapWithKey(f)(m);
|
|
396
|
+
})(DictNonEmpty || (DictNonEmpty = {}));
|
|
371
397
|
var Dict;
|
|
372
398
|
((Dict2) => {
|
|
399
|
+
let is;
|
|
400
|
+
((is2) => {
|
|
401
|
+
is2.empty = (m) => m.size === 0;
|
|
402
|
+
is2.nonEmpty = (m) => m.size > 0;
|
|
403
|
+
})(is = Dict2.is || (Dict2.is = {}));
|
|
373
404
|
Dict2.empty = () => new globalThis.Map();
|
|
374
405
|
Dict2.singleton = (key, value) => new globalThis.Map([[key, value]]);
|
|
375
|
-
|
|
376
|
-
|
|
406
|
+
let from;
|
|
407
|
+
((from2) => {
|
|
408
|
+
from2.entries = (entries3) => new globalThis.Map(entries3);
|
|
409
|
+
from2.Record = (rec) => new globalThis.Map(Object.entries(rec));
|
|
410
|
+
})(from = Dict2.from || (Dict2.from = {}));
|
|
377
411
|
Dict2.groupBy = (keyFn) => (items) => {
|
|
378
412
|
const result = new globalThis.Map();
|
|
379
413
|
for (const item of items) {
|
|
@@ -388,9 +422,8 @@ var Dict;
|
|
|
388
422
|
return result;
|
|
389
423
|
};
|
|
390
424
|
Dict2.has = (key) => (m) => m.has(key);
|
|
391
|
-
Dict2.lookup = (key) => (m) => m.has(key) ? Maybe.some(m.get(key)) : Maybe.none();
|
|
425
|
+
Dict2.lookup = (key) => (m) => m.has(key) ? Maybe.make.some(m.get(key)) : Maybe.make.none();
|
|
392
426
|
Dict2.size = (m) => m.size;
|
|
393
|
-
Dict2.isEmpty = (m) => m.size === 0;
|
|
394
427
|
Dict2.keys = (m) => [...m.keys()];
|
|
395
428
|
Dict2.values = (m) => [...m.values()];
|
|
396
429
|
Dict2.entries = (m) => [...m.entries()];
|
|
@@ -502,7 +535,11 @@ var Dict;
|
|
|
502
535
|
}
|
|
503
536
|
return acc;
|
|
504
537
|
};
|
|
505
|
-
|
|
538
|
+
let to;
|
|
539
|
+
((to2) => {
|
|
540
|
+
to2.Record = (m) => Object.fromEntries(m);
|
|
541
|
+
})(to = Dict2.to || (Dict2.to = {}));
|
|
542
|
+
Dict2.NonEmpty = DictNonEmpty;
|
|
506
543
|
})(Dict || (Dict = {}));
|
|
507
544
|
|
|
508
545
|
// src/Data/Num.ts
|
|
@@ -524,21 +561,21 @@ var Num;
|
|
|
524
561
|
Num2.inRange = (start, end) => (n) => n >= start && n < end;
|
|
525
562
|
Num2.parse = (s) => {
|
|
526
563
|
if (s.trim() === "") {
|
|
527
|
-
return Maybe.none();
|
|
564
|
+
return Maybe.make.none();
|
|
528
565
|
}
|
|
529
566
|
const n = Number(s);
|
|
530
|
-
return isNaN(n) ? Maybe.none() : Maybe.some(n);
|
|
567
|
+
return isNaN(n) ? Maybe.make.none() : Maybe.make.some(n);
|
|
531
568
|
};
|
|
532
569
|
Num2.add = (b) => (a) => a + b;
|
|
533
570
|
Num2.subtract = (b) => (a) => a - b;
|
|
534
571
|
Num2.multiply = (b) => (a) => a * b;
|
|
535
|
-
Num2.divide = (b) => (a) => b === 0 ? Maybe.none() : Maybe.some(a / b);
|
|
572
|
+
Num2.divide = (b) => (a) => b === 0 ? Maybe.make.none() : Maybe.make.some(a / b);
|
|
536
573
|
Num2.abs = (n) => Math.abs(n);
|
|
537
574
|
Num2.negate = (n) => -n;
|
|
538
575
|
Num2.round = (n) => Math.round(n);
|
|
539
576
|
Num2.floor = (n) => Math.floor(n);
|
|
540
577
|
Num2.ceil = (n) => Math.ceil(n);
|
|
541
|
-
Num2.remainder = (divisor) => (n) => divisor === 0 ? Maybe.none() : Maybe.some(n % divisor);
|
|
578
|
+
Num2.remainder = (divisor) => (n) => divisor === 0 ? Maybe.make.none() : Maybe.make.some(n % divisor);
|
|
542
579
|
Num2.sum = (ns) => {
|
|
543
580
|
let result = 0;
|
|
544
581
|
for (let i = 0; i < ns.length; i++) {
|
|
@@ -546,10 +583,10 @@ var Num;
|
|
|
546
583
|
}
|
|
547
584
|
return result;
|
|
548
585
|
};
|
|
549
|
-
Num2.mean = (ns) => ns.length === 0 ? Maybe.none() : Maybe.some((0, Num2.sum)(ns) / ns.length);
|
|
586
|
+
Num2.mean = (ns) => ns.length === 0 ? Maybe.make.none() : Maybe.make.some((0, Num2.sum)(ns) / ns.length);
|
|
550
587
|
Num2.min = (ns) => {
|
|
551
588
|
if (ns.length === 0) {
|
|
552
|
-
return Maybe.none();
|
|
589
|
+
return Maybe.make.none();
|
|
553
590
|
}
|
|
554
591
|
let [result] = ns;
|
|
555
592
|
for (let i = 1; i < ns.length; i++) {
|
|
@@ -557,11 +594,11 @@ var Num;
|
|
|
557
594
|
result = ns[i];
|
|
558
595
|
}
|
|
559
596
|
}
|
|
560
|
-
return Maybe.some(result);
|
|
597
|
+
return Maybe.make.some(result);
|
|
561
598
|
};
|
|
562
599
|
Num2.max = (ns) => {
|
|
563
600
|
if (ns.length === 0) {
|
|
564
|
-
return Maybe.none();
|
|
601
|
+
return Maybe.make.none();
|
|
565
602
|
}
|
|
566
603
|
let [result] = ns;
|
|
567
604
|
for (let i = 1; i < ns.length; i++) {
|
|
@@ -569,7 +606,7 @@ var Num;
|
|
|
569
606
|
result = ns[i];
|
|
570
607
|
}
|
|
571
608
|
}
|
|
572
|
-
return Maybe.some(result);
|
|
609
|
+
return Maybe.make.some(result);
|
|
573
610
|
};
|
|
574
611
|
})(Num || (Num = {}));
|
|
575
612
|
|
|
@@ -612,32 +649,43 @@ var RecResult;
|
|
|
612
649
|
var RecNonEmpty;
|
|
613
650
|
((RecNonEmpty2) => {
|
|
614
651
|
RecNonEmpty2.singleton = (key, value) => ({ [key]: value });
|
|
615
|
-
|
|
616
|
-
|
|
617
|
-
|
|
618
|
-
RecNonEmpty2.
|
|
619
|
-
RecNonEmpty2.
|
|
620
|
-
|
|
621
|
-
|
|
622
|
-
|
|
652
|
+
let from;
|
|
653
|
+
((from2) => {
|
|
654
|
+
from2.Record = (data) => _isNonEmpty(data) ? Maybe.make.some(data) : Maybe.make.none();
|
|
655
|
+
})(from = RecNonEmpty2.from || (RecNonEmpty2.from = {}));
|
|
656
|
+
RecNonEmpty2.keys = (data) => Rec.keys(data);
|
|
657
|
+
RecNonEmpty2.values = (data) => Rec.values(data);
|
|
658
|
+
RecNonEmpty2.entries = (data) => Rec.entries(data);
|
|
659
|
+
RecNonEmpty2.reduce = (f) => (data) => (0, RecNonEmpty2.values)(data).reduce(f);
|
|
660
|
+
RecNonEmpty2.map = (f) => (data) => Rec.map(f)(data);
|
|
661
|
+
RecNonEmpty2.mapWithKey = (f) => (data) => Rec.mapWithKey(f)(data);
|
|
623
662
|
})(RecNonEmpty || (RecNonEmpty = {}));
|
|
624
663
|
var Rec;
|
|
625
664
|
((Rec2) => {
|
|
626
|
-
|
|
627
|
-
|
|
665
|
+
let is;
|
|
666
|
+
((is2) => {
|
|
667
|
+
is2.empty = (data) => Object.keys(data).length === 0;
|
|
668
|
+
is2.nonEmpty = _isNonEmpty;
|
|
669
|
+
})(is = Rec2.is || (Rec2.is = {}));
|
|
670
|
+
Rec2.map = (f) => (data) => {
|
|
628
671
|
const recordKeys = Object.keys(data);
|
|
629
672
|
const recordValues = Object.values(data);
|
|
630
673
|
const result = Object.create(Object.getPrototypeOf(data));
|
|
631
674
|
for (let i = 0; i < recordKeys.length; i++) {
|
|
632
|
-
|
|
633
|
-
|
|
634
|
-
|
|
635
|
-
|
|
636
|
-
|
|
637
|
-
|
|
675
|
+
const key = recordKeys[i];
|
|
676
|
+
if (key === "__proto__") {
|
|
677
|
+
Object.defineProperty(result, "__proto__", {
|
|
678
|
+
value: f(recordValues[i]),
|
|
679
|
+
writable: true,
|
|
680
|
+
enumerable: true,
|
|
681
|
+
configurable: true
|
|
682
|
+
});
|
|
683
|
+
} else {
|
|
684
|
+
result[key] = f(recordValues[i]);
|
|
685
|
+
}
|
|
638
686
|
}
|
|
639
687
|
return result;
|
|
640
|
-
}
|
|
688
|
+
};
|
|
641
689
|
Rec2.filterMap = (f) => (data) => {
|
|
642
690
|
const recordKeys = Object.keys(data);
|
|
643
691
|
const recordValues = Object.values(data);
|
|
@@ -655,20 +703,25 @@ var Rec;
|
|
|
655
703
|
}
|
|
656
704
|
return result;
|
|
657
705
|
};
|
|
658
|
-
Rec2.mapWithKey = (f) => (
|
|
706
|
+
Rec2.mapWithKey = (f) => (data) => {
|
|
659
707
|
const recordKeys = Object.keys(data);
|
|
660
708
|
const recordValues = Object.values(data);
|
|
661
709
|
const result = Object.create(Object.getPrototypeOf(data));
|
|
662
710
|
for (let i = 0; i < recordKeys.length; i++) {
|
|
663
|
-
|
|
664
|
-
|
|
665
|
-
|
|
666
|
-
|
|
667
|
-
|
|
668
|
-
|
|
711
|
+
const key = recordKeys[i];
|
|
712
|
+
if (key === "__proto__") {
|
|
713
|
+
Object.defineProperty(result, "__proto__", {
|
|
714
|
+
value: f(key, recordValues[i]),
|
|
715
|
+
writable: true,
|
|
716
|
+
enumerable: true,
|
|
717
|
+
configurable: true
|
|
718
|
+
});
|
|
719
|
+
} else {
|
|
720
|
+
result[key] = f(key, recordValues[i]);
|
|
721
|
+
}
|
|
669
722
|
}
|
|
670
723
|
return result;
|
|
671
|
-
}
|
|
724
|
+
};
|
|
672
725
|
Rec2.filter = (predicate) => (data) => {
|
|
673
726
|
const recordKeys = Object.keys(data);
|
|
674
727
|
const recordValues = Object.values(data);
|
|
@@ -698,7 +751,10 @@ var Rec;
|
|
|
698
751
|
Rec2.keys = (data) => Object.keys(data);
|
|
699
752
|
Rec2.values = (data) => Object.values(data);
|
|
700
753
|
Rec2.entries = (data) => Object.entries(data);
|
|
701
|
-
|
|
754
|
+
let from;
|
|
755
|
+
((from2) => {
|
|
756
|
+
from2.entries = (data) => Object.fromEntries(data);
|
|
757
|
+
})(from = Rec2.from || (Rec2.from = {}));
|
|
702
758
|
Rec2.groupBy = (keyFn) => (items) => {
|
|
703
759
|
const result = {};
|
|
704
760
|
for (const item of items) {
|
|
@@ -739,7 +795,6 @@ var Rec;
|
|
|
739
795
|
...data,
|
|
740
796
|
...other
|
|
741
797
|
});
|
|
742
|
-
Rec2.isEmpty = (data) => Object.keys(data).length === 0;
|
|
743
798
|
Rec2.size = (data) => Object.keys(data).length;
|
|
744
799
|
Rec2.mapKeys = (f) => (data) => {
|
|
745
800
|
const result = {};
|
|
@@ -763,8 +818,20 @@ var Rec;
|
|
|
763
818
|
})(Rec || (Rec = {}));
|
|
764
819
|
|
|
765
820
|
// src/Data/Str.ts
|
|
821
|
+
var StrNonEmpty;
|
|
822
|
+
((StrNonEmpty2) => {
|
|
823
|
+
let from;
|
|
824
|
+
((from2) => {
|
|
825
|
+
from2.String = (s) => s.length > 0 ? Maybe.make.some(s) : Maybe.make.none();
|
|
826
|
+
})(from = StrNonEmpty2.from || (StrNonEmpty2.from = {}));
|
|
827
|
+
})(StrNonEmpty || (StrNonEmpty = {}));
|
|
766
828
|
var Str;
|
|
767
829
|
((Str2) => {
|
|
830
|
+
let is;
|
|
831
|
+
((is2) => {
|
|
832
|
+
is2.empty = (s) => s.length === 0;
|
|
833
|
+
is2.nonEmpty = (s) => s.length > 0;
|
|
834
|
+
})(is = Str2.is || (Str2.is = {}));
|
|
768
835
|
Str2.split = (separator) => (s) => s.split(separator);
|
|
769
836
|
Str2.trim = (s) => s.trim();
|
|
770
837
|
Str2.includes = (substring) => (s) => s.includes(substring);
|
|
@@ -777,7 +844,6 @@ var Str;
|
|
|
777
844
|
Str2.capitalize = (s) => s.length === 0 ? "" : s.charAt(0).toUpperCase() + s.slice(1);
|
|
778
845
|
Str2.lines = (s) => s.split(/\r?\n|\r/);
|
|
779
846
|
Str2.words = (s) => s.trim().split(/\s+/).filter(Boolean);
|
|
780
|
-
Str2.isEmpty = (s) => s.length === 0;
|
|
781
847
|
Str2.isBlank = (s) => s.trim().length === 0;
|
|
782
848
|
Str2.length = (s) => s.length;
|
|
783
849
|
Str2.slice = (start, end) => (s) => s.slice(start, end);
|
|
@@ -796,7 +862,7 @@ var Str;
|
|
|
796
862
|
*/
|
|
797
863
|
int: (s) => {
|
|
798
864
|
const n = parseInt(s, 10);
|
|
799
|
-
return isNaN(n) ? Maybe.none() : Maybe.some(n);
|
|
865
|
+
return isNaN(n) ? Maybe.make.none() : Maybe.make.some(n);
|
|
800
866
|
},
|
|
801
867
|
/**
|
|
802
868
|
* Parses a string as a floating-point number. Returns `None` if the result is `NaN`.
|
|
@@ -810,27 +876,49 @@ var Str;
|
|
|
810
876
|
*/
|
|
811
877
|
float: (s) => {
|
|
812
878
|
const n = parseFloat(s);
|
|
813
|
-
return isNaN(n) ? Maybe.none() : Maybe.some(n);
|
|
879
|
+
return isNaN(n) ? Maybe.make.none() : Maybe.make.some(n);
|
|
814
880
|
}
|
|
815
881
|
};
|
|
816
882
|
Str2.parseJson = (s) => {
|
|
817
883
|
try {
|
|
818
|
-
return Result.ok(JSON.parse(s));
|
|
884
|
+
return Result.make.ok(JSON.parse(s));
|
|
819
885
|
} catch (error) {
|
|
820
|
-
return Result.err(error);
|
|
886
|
+
return Result.make.err(error);
|
|
821
887
|
}
|
|
822
888
|
};
|
|
889
|
+
Str2.NonEmpty = StrNonEmpty;
|
|
823
890
|
})(Str || (Str = {}));
|
|
824
891
|
|
|
825
892
|
// src/Data/Uniq.ts
|
|
893
|
+
var UniqNonEmpty;
|
|
894
|
+
((UniqNonEmpty2) => {
|
|
895
|
+
UniqNonEmpty2.singleton = (item) => new globalThis.Set([item]);
|
|
896
|
+
let from;
|
|
897
|
+
((from2) => {
|
|
898
|
+
from2.Set = (s) => s.size > 0 ? Maybe.make.some(s) : Maybe.make.none();
|
|
899
|
+
})(from = UniqNonEmpty2.from || (UniqNonEmpty2.from = {}));
|
|
900
|
+
UniqNonEmpty2.reduce = (f) => (s) => to.Array(s).reduce(f);
|
|
901
|
+
UniqNonEmpty2.map = (f) => (s) => Uniq.map(f)(s);
|
|
902
|
+
let to;
|
|
903
|
+
((to2) => {
|
|
904
|
+
to2.Array = (s) => Uniq.to.Array(s);
|
|
905
|
+
})(to = UniqNonEmpty2.to || (UniqNonEmpty2.to = {}));
|
|
906
|
+
})(UniqNonEmpty || (UniqNonEmpty = {}));
|
|
826
907
|
var Uniq;
|
|
827
908
|
((Uniq2) => {
|
|
909
|
+
let is;
|
|
910
|
+
((is2) => {
|
|
911
|
+
is2.empty = (s) => s.size === 0;
|
|
912
|
+
is2.nonEmpty = (s) => s.size > 0;
|
|
913
|
+
})(is = Uniq2.is || (Uniq2.is = {}));
|
|
828
914
|
Uniq2.empty = () => new globalThis.Set();
|
|
829
915
|
Uniq2.singleton = (item) => new globalThis.Set([item]);
|
|
830
|
-
|
|
916
|
+
let from;
|
|
917
|
+
((from2) => {
|
|
918
|
+
from2.Array = (arr) => new globalThis.Set(arr);
|
|
919
|
+
})(from = Uniq2.from || (Uniq2.from = {}));
|
|
831
920
|
Uniq2.has = (item) => (s) => s.has(item);
|
|
832
921
|
Uniq2.size = (s) => s.size;
|
|
833
|
-
Uniq2.isEmpty = (s) => s.size === 0;
|
|
834
922
|
Uniq2.isSubsetOf = (other) => (s) => {
|
|
835
923
|
const set = s;
|
|
836
924
|
if (typeof set.isSubsetOf === "function") {
|
|
@@ -919,7 +1007,11 @@ var Uniq;
|
|
|
919
1007
|
}
|
|
920
1008
|
return acc;
|
|
921
1009
|
};
|
|
922
|
-
|
|
1010
|
+
let to;
|
|
1011
|
+
((to2) => {
|
|
1012
|
+
to2.Array = (s) => [...s];
|
|
1013
|
+
})(to = Uniq2.to || (Uniq2.to = {}));
|
|
1014
|
+
Uniq2.NonEmpty = UniqNonEmpty;
|
|
923
1015
|
})(Uniq || (Uniq = {}));
|
|
924
1016
|
|
|
925
1017
|
export {
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import {
|
|
2
2
|
Duration
|
|
3
|
-
} from "./chunk-
|
|
3
|
+
} from "./chunk-XTVF5R6R.mjs";
|
|
4
4
|
|
|
5
5
|
// src/Composition/compose.ts
|
|
6
6
|
function compose(f0, f1, f2, f3, f4, f5, f6, f7, f8, f9) {
|
|
@@ -377,7 +377,7 @@ function tap(f) {
|
|
|
377
377
|
const start = performance.now();
|
|
378
378
|
const triggerFinish = (duration) => {
|
|
379
379
|
if (config.label !== void 0) {
|
|
380
|
-
console.log(`[${config.label}]: ${Duration.
|
|
380
|
+
console.log(`[${config.label}]: ${Duration.to.milliseconds(duration)}ms`);
|
|
381
381
|
} else {
|
|
382
382
|
config.onFinish(duration);
|
|
383
383
|
}
|