@eslint-react/jsx 0.8.10-beta.4 → 0.8.10
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/index.cjs +101 -101
- package/dist/index.js +101 -101
- package/dist/index.mjs +101 -101
- package/package.json +5 -5
package/dist/index.mjs
CHANGED
|
@@ -783,22 +783,22 @@ function add64(out, aHi, aLo, bHi, bLo) {
|
|
|
783
783
|
*/ const hash = (self)=>{
|
|
784
784
|
switch(typeof self){
|
|
785
785
|
case "number":
|
|
786
|
-
return number(self);
|
|
786
|
+
return number$1(self);
|
|
787
787
|
case "bigint":
|
|
788
|
-
return string(self.toString(10));
|
|
788
|
+
return string$1(self.toString(10));
|
|
789
789
|
case "boolean":
|
|
790
|
-
return string(String(self));
|
|
790
|
+
return string$1(String(self));
|
|
791
791
|
case "symbol":
|
|
792
|
-
return string(String(self));
|
|
792
|
+
return string$1(String(self));
|
|
793
793
|
case "string":
|
|
794
|
-
return string(self);
|
|
794
|
+
return string$1(self);
|
|
795
795
|
case "undefined":
|
|
796
|
-
return string("undefined");
|
|
796
|
+
return string$1("undefined");
|
|
797
797
|
case "function":
|
|
798
798
|
case "object":
|
|
799
799
|
{
|
|
800
800
|
if (self === null) {
|
|
801
|
-
return string("null");
|
|
801
|
+
return string$1("null");
|
|
802
802
|
}
|
|
803
803
|
if (isHash(self)) {
|
|
804
804
|
return self[symbol$1]();
|
|
@@ -815,14 +815,14 @@ function add64(out, aHi, aLo, bHi, bLo) {
|
|
|
815
815
|
* @category hashing
|
|
816
816
|
*/ const random = (self)=>{
|
|
817
817
|
if (!randomHashCache.has(self)) {
|
|
818
|
-
randomHashCache.set(self, number(pcgr.integer(Number.MAX_SAFE_INTEGER)));
|
|
818
|
+
randomHashCache.set(self, number$1(pcgr.integer(Number.MAX_SAFE_INTEGER)));
|
|
819
819
|
}
|
|
820
820
|
return randomHashCache.get(self);
|
|
821
821
|
};
|
|
822
822
|
/**
|
|
823
823
|
* @since 2.0.0
|
|
824
824
|
* @category hashing
|
|
825
|
-
*/ const combine$
|
|
825
|
+
*/ const combine$2 = (b)=>(self)=>self * 53 ^ b;
|
|
826
826
|
/**
|
|
827
827
|
* @since 2.0.0
|
|
828
828
|
* @category hashing
|
|
@@ -834,7 +834,7 @@ function add64(out, aHi, aLo, bHi, bLo) {
|
|
|
834
834
|
/**
|
|
835
835
|
* @since 2.0.0
|
|
836
836
|
* @category hashing
|
|
837
|
-
*/ const number = (n)=>{
|
|
837
|
+
*/ const number$1 = (n)=>{
|
|
838
838
|
if (n !== n || n === Infinity) {
|
|
839
839
|
return 0;
|
|
840
840
|
}
|
|
@@ -850,7 +850,7 @@ function add64(out, aHi, aLo, bHi, bLo) {
|
|
|
850
850
|
/**
|
|
851
851
|
* @since 2.0.0
|
|
852
852
|
* @category hashing
|
|
853
|
-
*/ const string = (str)=>{
|
|
853
|
+
*/ const string$1 = (str)=>{
|
|
854
854
|
let h = 5381, i = str.length;
|
|
855
855
|
while(i){
|
|
856
856
|
h = h * 33 ^ str.charCodeAt(--i);
|
|
@@ -863,7 +863,7 @@ function add64(out, aHi, aLo, bHi, bLo) {
|
|
|
863
863
|
*/ const structureKeys = (o, keys)=>{
|
|
864
864
|
let h = 12289;
|
|
865
865
|
for(let i = 0; i < keys.length; i++){
|
|
866
|
-
h ^= pipe(string(keys[i]), combine$
|
|
866
|
+
h ^= pipe(string$1(keys[i]), combine$2(hash(o[keys[i]])));
|
|
867
867
|
}
|
|
868
868
|
return optimize(h);
|
|
869
869
|
};
|
|
@@ -874,10 +874,10 @@ function add64(out, aHi, aLo, bHi, bLo) {
|
|
|
874
874
|
/**
|
|
875
875
|
* @since 2.0.0
|
|
876
876
|
* @category hashing
|
|
877
|
-
*/ const array$
|
|
877
|
+
*/ const array$3 = (arr)=>{
|
|
878
878
|
let h = 6151;
|
|
879
879
|
for(let i = 0; i < arr.length; i++){
|
|
880
|
-
h = pipe(h, combine$
|
|
880
|
+
h = pipe(h, combine$2(hash(arr[i])));
|
|
881
881
|
}
|
|
882
882
|
return optimize(h);
|
|
883
883
|
};
|
|
@@ -923,7 +923,7 @@ function compareBoth(self, that) {
|
|
|
923
923
|
*/ /**
|
|
924
924
|
* @category constructors
|
|
925
925
|
* @since 2.0.0
|
|
926
|
-
*/ const make$
|
|
926
|
+
*/ const make$a = (isEquivalent)=>(self, that)=>self === that || isEquivalent(self, that);
|
|
927
927
|
/**
|
|
928
928
|
* @since 2.0.0
|
|
929
929
|
*/ /**
|
|
@@ -1069,7 +1069,7 @@ const SomeProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Common
|
|
|
1069
1069
|
return isOption$1(that) && isSome$1(that) && equals(that.value, this.value);
|
|
1070
1070
|
},
|
|
1071
1071
|
[symbol$1] () {
|
|
1072
|
-
return combine$
|
|
1072
|
+
return combine$2(hash(this._tag))(hash(this.value));
|
|
1073
1073
|
},
|
|
1074
1074
|
toJSON () {
|
|
1075
1075
|
return {
|
|
@@ -1086,7 +1086,7 @@ const NoneProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Common
|
|
|
1086
1086
|
return isOption$1(that) && isNone$1(that);
|
|
1087
1087
|
},
|
|
1088
1088
|
[symbol$1] () {
|
|
1089
|
-
return combine$
|
|
1089
|
+
return combine$2(hash(this._tag));
|
|
1090
1090
|
},
|
|
1091
1091
|
toJSON () {
|
|
1092
1092
|
return {
|
|
@@ -1099,7 +1099,7 @@ const NoneProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Common
|
|
|
1099
1099
|
/** @internal */ const isNone$1 = (fa)=>fa._tag === "None";
|
|
1100
1100
|
/** @internal */ const isSome$1 = (fa)=>fa._tag === "Some";
|
|
1101
1101
|
/** @internal */ const none$1 = /*#__PURE__*/ Object.create(NoneProto);
|
|
1102
|
-
/** @internal */ const some$
|
|
1102
|
+
/** @internal */ const some$5 = (value)=>{
|
|
1103
1103
|
const a = Object.create(SomeProto);
|
|
1104
1104
|
a.value = value;
|
|
1105
1105
|
return a;
|
|
@@ -1128,7 +1128,7 @@ const RightProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Commo
|
|
|
1128
1128
|
return isEither$1(that) && isRight$1(that) && equals(that.right, this.right);
|
|
1129
1129
|
},
|
|
1130
1130
|
[symbol$1] () {
|
|
1131
|
-
return combine$
|
|
1131
|
+
return combine$2(hash(this._tag))(hash(this.right));
|
|
1132
1132
|
},
|
|
1133
1133
|
toJSON () {
|
|
1134
1134
|
return {
|
|
@@ -1145,7 +1145,7 @@ const LeftProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Common
|
|
|
1145
1145
|
return isEither$1(that) && isLeft$1(that) && equals(that.left, this.left);
|
|
1146
1146
|
},
|
|
1147
1147
|
[symbol$1] () {
|
|
1148
|
-
return combine$
|
|
1148
|
+
return combine$2(hash(this._tag))(hash(this.left));
|
|
1149
1149
|
},
|
|
1150
1150
|
toJSON () {
|
|
1151
1151
|
return {
|
|
@@ -1168,14 +1168,14 @@ const LeftProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Common
|
|
|
1168
1168
|
a.right = right;
|
|
1169
1169
|
return a;
|
|
1170
1170
|
};
|
|
1171
|
-
/** @internal */ const getLeft$2 = (self)=>isRight$1(self) ? none$1 : some$
|
|
1172
|
-
/** @internal */ const getRight$2 = (self)=>isLeft$1(self) ? none$1 : some$
|
|
1171
|
+
/** @internal */ const getLeft$2 = (self)=>isRight$1(self) ? none$1 : some$5(self.left);
|
|
1172
|
+
/** @internal */ const getRight$2 = (self)=>isLeft$1(self) ? none$1 : some$5(self.right);
|
|
1173
1173
|
/**
|
|
1174
1174
|
* @since 2.0.0
|
|
1175
1175
|
*/ /**
|
|
1176
1176
|
* @category constructors
|
|
1177
1177
|
* @since 2.0.0
|
|
1178
|
-
*/ const make$
|
|
1178
|
+
*/ const make$9 = (compare)=>(self, that)=>self === that ? 0 : compare(self, that);
|
|
1179
1179
|
/**
|
|
1180
1180
|
* @category symbols
|
|
1181
1181
|
* @since 2.0.0
|
|
@@ -1193,7 +1193,7 @@ const LeftProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Common
|
|
|
1193
1193
|
*
|
|
1194
1194
|
* @category constructors
|
|
1195
1195
|
* @since 2.0.0
|
|
1196
|
-
*/ const some$
|
|
1196
|
+
*/ const some$4 = some$5;
|
|
1197
1197
|
/**
|
|
1198
1198
|
* Tests if a value is a `Option`.
|
|
1199
1199
|
*
|
|
@@ -1261,7 +1261,7 @@ const LeftProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Common
|
|
|
1261
1261
|
*
|
|
1262
1262
|
* @category pattern matching
|
|
1263
1263
|
* @since 2.0.0
|
|
1264
|
-
*/ const match$
|
|
1264
|
+
*/ const match$2 = /*#__PURE__*/ dual(2, (self, { onNone, onSome })=>isNone(self) ? onNone() : onSome(self.value));
|
|
1265
1265
|
/**
|
|
1266
1266
|
* Returns a type guard from a `Option` returning function.
|
|
1267
1267
|
* This function ensures that a type guard definition is type-safe.
|
|
@@ -1296,7 +1296,7 @@ const LeftProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Common
|
|
|
1296
1296
|
* @since 2.0.0
|
|
1297
1297
|
*/ const fromIterable$5 = (collection)=>{
|
|
1298
1298
|
for (const a of collection){
|
|
1299
|
-
return some$
|
|
1299
|
+
return some$4(a);
|
|
1300
1300
|
}
|
|
1301
1301
|
return none();
|
|
1302
1302
|
};
|
|
@@ -1434,7 +1434,7 @@ const LeftProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Common
|
|
|
1434
1434
|
*
|
|
1435
1435
|
* @category conversions
|
|
1436
1436
|
* @since 2.0.0
|
|
1437
|
-
*/ const fromNullable$
|
|
1437
|
+
*/ const fromNullable$2 = (nullableValue)=>nullableValue == null ? none() : some$4(nullableValue);
|
|
1438
1438
|
/**
|
|
1439
1439
|
* This API is useful for lifting a function that returns `null` or `undefined` into the `Option` context.
|
|
1440
1440
|
*
|
|
@@ -1453,7 +1453,7 @@ const LeftProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Common
|
|
|
1453
1453
|
*
|
|
1454
1454
|
* @category conversions
|
|
1455
1455
|
* @since 2.0.0
|
|
1456
|
-
*/ const liftNullable = (f)=>(...a)=>fromNullable$
|
|
1456
|
+
*/ const liftNullable$1 = (f)=>(...a)=>fromNullable$2(f(...a));
|
|
1457
1457
|
/**
|
|
1458
1458
|
* Returns the value of the `Option` if it is a `Some`, otherwise returns `null`.
|
|
1459
1459
|
*
|
|
@@ -1502,7 +1502,7 @@ const LeftProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Common
|
|
|
1502
1502
|
* @since 2.0.0
|
|
1503
1503
|
*/ const liftThrowable = (f)=>(...a)=>{
|
|
1504
1504
|
try {
|
|
1505
|
-
return some$
|
|
1505
|
+
return some$4(f(...a));
|
|
1506
1506
|
} catch (e) {
|
|
1507
1507
|
return none();
|
|
1508
1508
|
}
|
|
@@ -1557,7 +1557,7 @@ const LeftProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Common
|
|
|
1557
1557
|
*
|
|
1558
1558
|
* @category transforming
|
|
1559
1559
|
* @since 2.0.0
|
|
1560
|
-
*/ const map$5 = /*#__PURE__*/ dual(2, (self, f)=>isNone(self) ? none() : some$
|
|
1560
|
+
*/ const map$5 = /*#__PURE__*/ dual(2, (self, f)=>isNone(self) ? none() : some$4(f(self.value)));
|
|
1561
1561
|
/**
|
|
1562
1562
|
* Maps the `Some` value of this `Option` to the specified constant value.
|
|
1563
1563
|
*
|
|
@@ -1574,13 +1574,13 @@ const LeftProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Common
|
|
|
1574
1574
|
*/ const asUnit = /*#__PURE__*/ as(undefined);
|
|
1575
1575
|
/**
|
|
1576
1576
|
* @since 2.0.0
|
|
1577
|
-
*/ const unit = /*#__PURE__*/ some$
|
|
1577
|
+
*/ const unit = /*#__PURE__*/ some$4(undefined);
|
|
1578
1578
|
/**
|
|
1579
1579
|
* Applies a function to the value of an `Option` and flattens the result, if the input is `Some`.
|
|
1580
1580
|
*
|
|
1581
1581
|
* @category transforming
|
|
1582
1582
|
* @since 2.0.0
|
|
1583
|
-
*/ const flatMap$
|
|
1583
|
+
*/ const flatMap$4 = /*#__PURE__*/ dual(2, (self, f)=>isNone(self) ? none() : f(self.value));
|
|
1584
1584
|
/**
|
|
1585
1585
|
* This is `flatMap` + `fromNullable`, useful when working with optional values.
|
|
1586
1586
|
*
|
|
@@ -1620,19 +1620,19 @@ const LeftProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Common
|
|
|
1620
1620
|
*
|
|
1621
1621
|
* @category transforming
|
|
1622
1622
|
* @since 2.0.0
|
|
1623
|
-
*/ const flatMapNullable = /*#__PURE__*/ dual(2, (self, f)=>isNone(self) ? none() : fromNullable$
|
|
1623
|
+
*/ const flatMapNullable$1 = /*#__PURE__*/ dual(2, (self, f)=>isNone(self) ? none() : fromNullable$2(f(self.value)));
|
|
1624
1624
|
/**
|
|
1625
1625
|
* @category transforming
|
|
1626
1626
|
* @since 2.0.0
|
|
1627
|
-
*/ const flatten$
|
|
1627
|
+
*/ const flatten$2 = /*#__PURE__*/ flatMap$4(identity$1);
|
|
1628
1628
|
/**
|
|
1629
1629
|
* @category transforming
|
|
1630
1630
|
* @since 2.0.0
|
|
1631
|
-
*/ const zipRight = /*#__PURE__*/ dual(2, (self, that)=>flatMap$
|
|
1631
|
+
*/ const zipRight = /*#__PURE__*/ dual(2, (self, that)=>flatMap$4(self, ()=>that));
|
|
1632
1632
|
/**
|
|
1633
1633
|
* @category transforming
|
|
1634
1634
|
* @since 2.0.0
|
|
1635
|
-
*/ const composeK = /*#__PURE__*/ dual(2, (afb, bfc)=>(a)=>flatMap$
|
|
1635
|
+
*/ const composeK = /*#__PURE__*/ dual(2, (afb, bfc)=>(a)=>flatMap$4(afb(a), bfc));
|
|
1636
1636
|
/**
|
|
1637
1637
|
* Sequences the specified `that` `Option` but ignores its value.
|
|
1638
1638
|
*
|
|
@@ -1664,11 +1664,11 @@ const LeftProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Common
|
|
|
1664
1664
|
*
|
|
1665
1665
|
* @category transforming
|
|
1666
1666
|
* @since 2.0.0
|
|
1667
|
-
*/ const tap = /*#__PURE__*/ dual(2, (self, f)=>flatMap$
|
|
1667
|
+
*/ const tap = /*#__PURE__*/ dual(2, (self, f)=>flatMap$4(self, (a)=>map$5(f(a), ()=>a)));
|
|
1668
1668
|
/**
|
|
1669
1669
|
* @category combining
|
|
1670
1670
|
* @since 2.0.0
|
|
1671
|
-
*/ const product = (self, that)=>isSome(self) && isSome(that) ? some$
|
|
1671
|
+
*/ const product = (self, that)=>isSome(self) && isSome(that) ? some$4([
|
|
1672
1672
|
self.value,
|
|
1673
1673
|
that.value
|
|
1674
1674
|
]) : none();
|
|
@@ -1688,7 +1688,7 @@ const LeftProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Common
|
|
|
1688
1688
|
}
|
|
1689
1689
|
out.push(o.value);
|
|
1690
1690
|
}
|
|
1691
|
-
return some$
|
|
1691
|
+
return some$4(out);
|
|
1692
1692
|
};
|
|
1693
1693
|
/**
|
|
1694
1694
|
* Takes a structure of `Option`s and returns an `Option` of values with the same structure.
|
|
@@ -1718,7 +1718,7 @@ const all$1 = (input)=>{
|
|
|
1718
1718
|
}
|
|
1719
1719
|
out.push(o.value);
|
|
1720
1720
|
}
|
|
1721
|
-
return some$
|
|
1721
|
+
return some$4(out);
|
|
1722
1722
|
}
|
|
1723
1723
|
const out = {};
|
|
1724
1724
|
for (const key of Object.keys(input)){
|
|
@@ -1728,7 +1728,7 @@ const all$1 = (input)=>{
|
|
|
1728
1728
|
}
|
|
1729
1729
|
out[key] = o.value;
|
|
1730
1730
|
}
|
|
1731
|
-
return some$
|
|
1731
|
+
return some$4(out);
|
|
1732
1732
|
};
|
|
1733
1733
|
/**
|
|
1734
1734
|
* Zips two `Option` values together using a provided function, returning a new `Option` of the result.
|
|
@@ -1813,11 +1813,11 @@ const all$1 = (input)=>{
|
|
|
1813
1813
|
}
|
|
1814
1814
|
const e = f(self.value);
|
|
1815
1815
|
return isLeft$1(e) ? [
|
|
1816
|
-
some$
|
|
1816
|
+
some$4(e.left),
|
|
1817
1817
|
none()
|
|
1818
1818
|
] : [
|
|
1819
1819
|
none(),
|
|
1820
|
-
some$
|
|
1820
|
+
some$4(e.right)
|
|
1821
1821
|
];
|
|
1822
1822
|
});
|
|
1823
1823
|
/**
|
|
@@ -1867,7 +1867,7 @@ const all$1 = (input)=>{
|
|
|
1867
1867
|
*
|
|
1868
1868
|
* @category filtering
|
|
1869
1869
|
* @since 2.0.0
|
|
1870
|
-
*/ const filter$
|
|
1870
|
+
*/ const filter$4 = /*#__PURE__*/ dual(2, (self, predicate)=>filterMap$4(self, (b)=>predicate(b) ? some$5(b) : none$1));
|
|
1871
1871
|
/**
|
|
1872
1872
|
* @example
|
|
1873
1873
|
* import { none, some, getEquivalence } from 'effect/Option'
|
|
@@ -1882,7 +1882,7 @@ const all$1 = (input)=>{
|
|
|
1882
1882
|
*
|
|
1883
1883
|
* @category equivalence
|
|
1884
1884
|
* @since 2.0.0
|
|
1885
|
-
*/ const getEquivalence$5 = (isEquivalent)=>make$
|
|
1885
|
+
*/ const getEquivalence$5 = (isEquivalent)=>make$a((x, y)=>x === y || (isNone(x) ? isNone(y) : isNone(y) ? false : isEquivalent(x.value, y.value)));
|
|
1886
1886
|
/**
|
|
1887
1887
|
* The `Order` instance allows `Option` values to be compared with
|
|
1888
1888
|
* `compare`, whenever there is an `Order` instance for
|
|
@@ -1904,7 +1904,7 @@ const all$1 = (input)=>{
|
|
|
1904
1904
|
*
|
|
1905
1905
|
* @category sorting
|
|
1906
1906
|
* @since 2.0.0
|
|
1907
|
-
*/ const getOrder = (O)=>make$
|
|
1907
|
+
*/ const getOrder$1 = (O)=>make$9((self, that)=>isSome(self) ? isSome(that) ? O(self.value, that.value) : 1 : -1);
|
|
1908
1908
|
/**
|
|
1909
1909
|
* Lifts a binary function into `Option`.
|
|
1910
1910
|
*
|
|
@@ -1929,7 +1929,7 @@ const all$1 = (input)=>{
|
|
|
1929
1929
|
*
|
|
1930
1930
|
* @category lifting
|
|
1931
1931
|
* @since 2.0.0
|
|
1932
|
-
*/ const liftPredicate = (predicate)=>(b)=>predicate(b) ? some$
|
|
1932
|
+
*/ const liftPredicate$1 = (predicate)=>(b)=>predicate(b) ? some$4(b) : none();
|
|
1933
1933
|
/**
|
|
1934
1934
|
* Returns a function that checks if a `Option` contains a given value using a provided `isEquivalent` function.
|
|
1935
1935
|
*
|
|
@@ -1989,13 +1989,13 @@ const let_ = /*#__PURE__*/ dual(3, (self, name, f)=>map$5(self, (a)=>Object.assi
|
|
|
1989
1989
|
/**
|
|
1990
1990
|
* @category do notation
|
|
1991
1991
|
* @since 2.0.0
|
|
1992
|
-
*/ const bind = /*#__PURE__*/ dual(3, (self, name, f)=>flatMap$
|
|
1992
|
+
*/ const bind = /*#__PURE__*/ dual(3, (self, name, f)=>flatMap$4(self, (a)=>map$5(f(a), (b)=>Object.assign({}, a, {
|
|
1993
1993
|
[name]: b
|
|
1994
1994
|
}))));
|
|
1995
1995
|
/**
|
|
1996
1996
|
* @category do notation
|
|
1997
1997
|
* @since 2.0.0
|
|
1998
|
-
*/ const Do = /*#__PURE__*/ some$
|
|
1998
|
+
*/ const Do = /*#__PURE__*/ some$4({});
|
|
1999
1999
|
const adapter$1 = /*#__PURE__*/ adapter$2();
|
|
2000
2000
|
/**
|
|
2001
2001
|
* @category generators
|
|
@@ -2004,7 +2004,7 @@ const adapter$1 = /*#__PURE__*/ adapter$2();
|
|
|
2004
2004
|
const iterator = f(adapter$1);
|
|
2005
2005
|
let state = iterator.next();
|
|
2006
2006
|
if (state.done) {
|
|
2007
|
-
return some$
|
|
2007
|
+
return some$4(state.value);
|
|
2008
2008
|
} else {
|
|
2009
2009
|
let current = state.value.value;
|
|
2010
2010
|
if (isNone(current)) {
|
|
@@ -2019,7 +2019,7 @@ const adapter$1 = /*#__PURE__*/ adapter$2();
|
|
|
2019
2019
|
}
|
|
2020
2020
|
}
|
|
2021
2021
|
}
|
|
2022
|
-
return some$
|
|
2022
|
+
return some$4(state.value);
|
|
2023
2023
|
}
|
|
2024
2024
|
};
|
|
2025
2025
|
var Option = /*#__PURE__*/ Object.freeze({
|
|
@@ -2036,14 +2036,14 @@ var Option = /*#__PURE__*/ Object.freeze({
|
|
|
2036
2036
|
contains: contains$2,
|
|
2037
2037
|
containsWith: containsWith$2,
|
|
2038
2038
|
exists: exists,
|
|
2039
|
-
filter: filter$
|
|
2039
|
+
filter: filter$4,
|
|
2040
2040
|
filterMap: filterMap$4,
|
|
2041
2041
|
firstSomeOf: firstSomeOf,
|
|
2042
|
-
flatMap: flatMap$
|
|
2043
|
-
flatMapNullable: flatMapNullable,
|
|
2044
|
-
flatten: flatten$
|
|
2042
|
+
flatMap: flatMap$4,
|
|
2043
|
+
flatMapNullable: flatMapNullable$1,
|
|
2044
|
+
flatten: flatten$2,
|
|
2045
2045
|
fromIterable: fromIterable$5,
|
|
2046
|
-
fromNullable: fromNullable$
|
|
2046
|
+
fromNullable: fromNullable$2,
|
|
2047
2047
|
gen: gen$1,
|
|
2048
2048
|
getEquivalence: getEquivalence$5,
|
|
2049
2049
|
getLeft: getLeft$1,
|
|
@@ -2052,18 +2052,18 @@ var Option = /*#__PURE__*/ Object.freeze({
|
|
|
2052
2052
|
getOrThrow: getOrThrow$1,
|
|
2053
2053
|
getOrThrowWith: getOrThrowWith$1,
|
|
2054
2054
|
getOrUndefined: getOrUndefined$1,
|
|
2055
|
-
getOrder: getOrder,
|
|
2055
|
+
getOrder: getOrder$1,
|
|
2056
2056
|
getRight: getRight$1,
|
|
2057
2057
|
isNone: isNone,
|
|
2058
2058
|
isOption: isOption,
|
|
2059
2059
|
isSome: isSome,
|
|
2060
2060
|
let: let_,
|
|
2061
2061
|
lift2: lift2,
|
|
2062
|
-
liftNullable: liftNullable,
|
|
2063
|
-
liftPredicate: liftPredicate,
|
|
2062
|
+
liftNullable: liftNullable$1,
|
|
2063
|
+
liftPredicate: liftPredicate$1,
|
|
2064
2064
|
liftThrowable: liftThrowable,
|
|
2065
2065
|
map: map$5,
|
|
2066
|
-
match: match$
|
|
2066
|
+
match: match$2,
|
|
2067
2067
|
none: none,
|
|
2068
2068
|
orElse: orElse$1,
|
|
2069
2069
|
orElseEither: orElseEither,
|
|
@@ -2071,7 +2071,7 @@ var Option = /*#__PURE__*/ Object.freeze({
|
|
|
2071
2071
|
product: product,
|
|
2072
2072
|
productMany: productMany,
|
|
2073
2073
|
reduceCompact: reduceCompact,
|
|
2074
|
-
some: some$
|
|
2074
|
+
some: some$4,
|
|
2075
2075
|
tap: tap,
|
|
2076
2076
|
toArray: toArray$2,
|
|
2077
2077
|
toRefinement: toRefinement,
|
|
@@ -2121,7 +2121,7 @@ const emptyArray = [];
|
|
|
2121
2121
|
*
|
|
2122
2122
|
* @category equivalence
|
|
2123
2123
|
* @since 2.0.0
|
|
2124
|
-
*/ const getEquivalence$1 = (isEquivalent)=>make$
|
|
2124
|
+
*/ const getEquivalence$1 = (isEquivalent)=>make$a((self, that)=>self.length === that.length && toReadonlyArray(self).every((value, i)=>isEquivalent(value, unsafeGet(that, i))));
|
|
2125
2125
|
const _equivalence$1 = /*#__PURE__*/ getEquivalence$1(equals);
|
|
2126
2126
|
const ChunkProto = {
|
|
2127
2127
|
[TypeId$4]: {
|
|
@@ -2143,7 +2143,7 @@ const ChunkProto = {
|
|
|
2143
2143
|
return isChunk(that) && _equivalence$1(this, that);
|
|
2144
2144
|
},
|
|
2145
2145
|
[symbol$1] () {
|
|
2146
|
-
return array$
|
|
2146
|
+
return array$3(toReadonlyArray(this));
|
|
2147
2147
|
},
|
|
2148
2148
|
[Symbol.iterator] () {
|
|
2149
2149
|
switch(this.backing._tag){
|
|
@@ -2567,7 +2567,7 @@ const copyToArray = (self, array, initial)=>{
|
|
|
2567
2567
|
return self;
|
|
2568
2568
|
},
|
|
2569
2569
|
context (self) {
|
|
2570
|
-
return make$
|
|
2570
|
+
return make$6(this, self);
|
|
2571
2571
|
}
|
|
2572
2572
|
};
|
|
2573
2573
|
const tagRegistry = /*#__PURE__*/ globalValue("effect/Context/Tag/tagRegistry", ()=>new Map());
|
|
@@ -2610,7 +2610,7 @@ const tagRegistry = /*#__PURE__*/ globalValue("effect/Context/Tag/tagRegistry",
|
|
|
2610
2610
|
return false;
|
|
2611
2611
|
},
|
|
2612
2612
|
[symbol$1] () {
|
|
2613
|
-
return number(this.unsafeMap.size);
|
|
2613
|
+
return number$1(this.unsafeMap.size);
|
|
2614
2614
|
},
|
|
2615
2615
|
pipe () {
|
|
2616
2616
|
return pipeArguments(this, arguments);
|
|
@@ -2636,7 +2636,7 @@ const tagRegistry = /*#__PURE__*/ globalValue("effect/Context/Tag/tagRegistry",
|
|
|
2636
2636
|
/** @internal */ const isContext = (u)=>hasProperty(u, TypeId$3);
|
|
2637
2637
|
const _empty$3 = /*#__PURE__*/ makeContext(/*#__PURE__*/ new Map());
|
|
2638
2638
|
/** @internal */ const empty$7 = ()=>_empty$3;
|
|
2639
|
-
/** @internal */ const make$
|
|
2639
|
+
/** @internal */ const make$6 = (tag, service)=>makeContext(new Map([
|
|
2640
2640
|
[
|
|
2641
2641
|
tag,
|
|
2642
2642
|
service
|
|
@@ -3015,7 +3015,7 @@ const HashMapProto = {
|
|
|
3015
3015
|
[symbol$1] () {
|
|
3016
3016
|
let hash$1 = hash(HashMapSymbolKey);
|
|
3017
3017
|
for (const item of this){
|
|
3018
|
-
hash$1 ^= pipe(hash(item[0]), combine$
|
|
3018
|
+
hash$1 ^= pipe(hash(item[0]), combine$2(hash(item[1])));
|
|
3019
3019
|
}
|
|
3020
3020
|
return hash$1;
|
|
3021
3021
|
},
|
|
@@ -3096,7 +3096,7 @@ const visitLazy = (node, f, cont = undefined)=>{
|
|
|
3096
3096
|
case "LeafNode":
|
|
3097
3097
|
{
|
|
3098
3098
|
if (isSome(node.value)) {
|
|
3099
|
-
return some$
|
|
3099
|
+
return some$4({
|
|
3100
3100
|
value: f(node.key, node.value.value),
|
|
3101
3101
|
cont
|
|
3102
3102
|
});
|
|
@@ -3182,7 +3182,7 @@ const _empty$2 = /*#__PURE__*/ makeImpl$1(false, 0, /*#__PURE__*/ new EmptyNode(
|
|
|
3182
3182
|
}
|
|
3183
3183
|
}
|
|
3184
3184
|
});
|
|
3185
|
-
/** @internal */ const set$
|
|
3185
|
+
/** @internal */ const set$3 = /*#__PURE__*/ dual(3, (self, key, value)=>modifyAt(self, key, ()=>some$4(value)));
|
|
3186
3186
|
/** @internal */ const setTree = /*#__PURE__*/ dual(3, (self, newRoot, newSize)=>{
|
|
3187
3187
|
if (self._editable) {
|
|
3188
3188
|
self._root = newRoot;
|
|
@@ -3239,7 +3239,7 @@ const HashSetProto = {
|
|
|
3239
3239
|
return keys$1(this._keyMap);
|
|
3240
3240
|
},
|
|
3241
3241
|
[symbol$1] () {
|
|
3242
|
-
return combine$
|
|
3242
|
+
return combine$2(hash(this._keyMap))(hash(HashSetSymbolKey));
|
|
3243
3243
|
},
|
|
3244
3244
|
[symbol] (that) {
|
|
3245
3245
|
if (isHashSet(that)) {
|
|
@@ -3282,7 +3282,7 @@ const _empty$1 = /*#__PURE__*/ makeImpl(/*#__PURE__*/ empty$5());
|
|
|
3282
3282
|
f(transient);
|
|
3283
3283
|
return endMutation(transient);
|
|
3284
3284
|
});
|
|
3285
|
-
/** @internal */ const add$1 = /*#__PURE__*/ dual(2, (self, value)=>self._keyMap._editable ? (set$
|
|
3285
|
+
/** @internal */ const add$1 = /*#__PURE__*/ dual(2, (self, value)=>self._keyMap._editable ? (set$3(value, true)(self._keyMap), self) : makeImpl(set$3(value, true)(self._keyMap)));
|
|
3286
3286
|
/** @internal */ const union$1 = /*#__PURE__*/ dual(2, (self, that)=>mutate(empty$4(), (set)=>{
|
|
3287
3287
|
forEach$2(self, (value)=>add$1(set, value));
|
|
3288
3288
|
for (const value of that){
|
|
@@ -3342,7 +3342,7 @@ const MutableRefProto = {
|
|
|
3342
3342
|
/**
|
|
3343
3343
|
* @since 2.0.0
|
|
3344
3344
|
* @category constructors
|
|
3345
|
-
*/ const make$
|
|
3345
|
+
*/ const make$5 = (value)=>{
|
|
3346
3346
|
const ref = Object.create(MutableRefProto);
|
|
3347
3347
|
ref.current = value;
|
|
3348
3348
|
return ref;
|
|
@@ -3360,27 +3360,27 @@ const MutableRefProto = {
|
|
|
3360
3360
|
/**
|
|
3361
3361
|
* @since 2.0.0
|
|
3362
3362
|
* @category numeric
|
|
3363
|
-
*/ const decrement = (self)=>update(self, (n)=>n - 1);
|
|
3363
|
+
*/ const decrement = (self)=>update$2(self, (n)=>n - 1);
|
|
3364
3364
|
/**
|
|
3365
3365
|
* @since 2.0.0
|
|
3366
3366
|
* @category numeric
|
|
3367
|
-
*/ const decrementAndGet = (self)=>updateAndGet(self, (n)=>n - 1);
|
|
3367
|
+
*/ const decrementAndGet = (self)=>updateAndGet$2(self, (n)=>n - 1);
|
|
3368
3368
|
/**
|
|
3369
3369
|
* @since 2.0.0
|
|
3370
3370
|
* @category general
|
|
3371
|
-
*/ const get = (self)=>self.current;
|
|
3371
|
+
*/ const get$2 = (self)=>self.current;
|
|
3372
3372
|
/**
|
|
3373
3373
|
* @since 2.0.0
|
|
3374
3374
|
* @category numeric
|
|
3375
|
-
*/ const getAndDecrement = (self)=>getAndUpdate(self, (n)=>n - 1);
|
|
3375
|
+
*/ const getAndDecrement = (self)=>getAndUpdate$2(self, (n)=>n - 1);
|
|
3376
3376
|
/**
|
|
3377
3377
|
* @since 2.0.0
|
|
3378
3378
|
* @category numeric
|
|
3379
|
-
*/ const getAndIncrement = (self)=>getAndUpdate(self, (n)=>n + 1);
|
|
3379
|
+
*/ const getAndIncrement = (self)=>getAndUpdate$2(self, (n)=>n + 1);
|
|
3380
3380
|
/**
|
|
3381
3381
|
* @since 2.0.0
|
|
3382
3382
|
* @category general
|
|
3383
|
-
*/ const getAndSet = /*#__PURE__*/ dual(2, (self, value)=>{
|
|
3383
|
+
*/ const getAndSet$2 = /*#__PURE__*/ dual(2, (self, value)=>{
|
|
3384
3384
|
const ret = self.current;
|
|
3385
3385
|
self.current = value;
|
|
3386
3386
|
return ret;
|
|
@@ -3388,63 +3388,63 @@ const MutableRefProto = {
|
|
|
3388
3388
|
/**
|
|
3389
3389
|
* @since 2.0.0
|
|
3390
3390
|
* @category general
|
|
3391
|
-
*/ const getAndUpdate = /*#__PURE__*/ dual(2, (self, f)=>getAndSet(self, f(get(self))));
|
|
3391
|
+
*/ const getAndUpdate$2 = /*#__PURE__*/ dual(2, (self, f)=>getAndSet$2(self, f(get$2(self))));
|
|
3392
3392
|
/**
|
|
3393
3393
|
* @since 2.0.0
|
|
3394
3394
|
* @category numeric
|
|
3395
|
-
*/ const increment = (self)=>update(self, (n)=>n + 1);
|
|
3395
|
+
*/ const increment = (self)=>update$2(self, (n)=>n + 1);
|
|
3396
3396
|
/**
|
|
3397
3397
|
* @since 2.0.0
|
|
3398
3398
|
* @category numeric
|
|
3399
|
-
*/ const incrementAndGet = (self)=>updateAndGet(self, (n)=>n + 1);
|
|
3399
|
+
*/ const incrementAndGet = (self)=>updateAndGet$2(self, (n)=>n + 1);
|
|
3400
3400
|
/**
|
|
3401
3401
|
* @since 2.0.0
|
|
3402
3402
|
* @category general
|
|
3403
|
-
*/ const set = /*#__PURE__*/ dual(2, (self, value)=>{
|
|
3403
|
+
*/ const set$2 = /*#__PURE__*/ dual(2, (self, value)=>{
|
|
3404
3404
|
self.current = value;
|
|
3405
3405
|
return self;
|
|
3406
3406
|
});
|
|
3407
3407
|
/**
|
|
3408
3408
|
* @since 2.0.0
|
|
3409
3409
|
* @category general
|
|
3410
|
-
*/ const setAndGet = /*#__PURE__*/ dual(2, (self, value)=>{
|
|
3410
|
+
*/ const setAndGet$2 = /*#__PURE__*/ dual(2, (self, value)=>{
|
|
3411
3411
|
self.current = value;
|
|
3412
3412
|
return self.current;
|
|
3413
3413
|
});
|
|
3414
3414
|
/**
|
|
3415
3415
|
* @since 2.0.0
|
|
3416
3416
|
* @category general
|
|
3417
|
-
*/ const update = /*#__PURE__*/ dual(2, (self, f)=>set(self, f(get(self))));
|
|
3417
|
+
*/ const update$2 = /*#__PURE__*/ dual(2, (self, f)=>set$2(self, f(get$2(self))));
|
|
3418
3418
|
/**
|
|
3419
3419
|
* @since 2.0.0
|
|
3420
3420
|
* @category general
|
|
3421
|
-
*/ const updateAndGet = /*#__PURE__*/ dual(2, (self, f)=>setAndGet(self, f(get(self))));
|
|
3421
|
+
*/ const updateAndGet$2 = /*#__PURE__*/ dual(2, (self, f)=>setAndGet$2(self, f(get$2(self))));
|
|
3422
3422
|
/**
|
|
3423
3423
|
* @since 2.0.0
|
|
3424
3424
|
* @category boolean
|
|
3425
|
-
*/ const toggle = (self)=>update(self, (_)=>!_);
|
|
3425
|
+
*/ const toggle = (self)=>update$2(self, (_)=>!_);
|
|
3426
3426
|
var MutableRef = /*#__PURE__*/ Object.freeze({
|
|
3427
3427
|
__proto__: null,
|
|
3428
3428
|
compareAndSet: compareAndSet,
|
|
3429
3429
|
decrement: decrement,
|
|
3430
3430
|
decrementAndGet: decrementAndGet,
|
|
3431
|
-
get: get,
|
|
3431
|
+
get: get$2,
|
|
3432
3432
|
getAndDecrement: getAndDecrement,
|
|
3433
3433
|
getAndIncrement: getAndIncrement,
|
|
3434
|
-
getAndSet: getAndSet,
|
|
3435
|
-
getAndUpdate: getAndUpdate,
|
|
3434
|
+
getAndSet: getAndSet$2,
|
|
3435
|
+
getAndUpdate: getAndUpdate$2,
|
|
3436
3436
|
increment: increment,
|
|
3437
3437
|
incrementAndGet: incrementAndGet,
|
|
3438
|
-
make: make$
|
|
3439
|
-
set: set,
|
|
3440
|
-
setAndGet: setAndGet,
|
|
3438
|
+
make: make$5,
|
|
3439
|
+
set: set$2,
|
|
3440
|
+
setAndGet: setAndGet$2,
|
|
3441
3441
|
toggle: toggle,
|
|
3442
|
-
update: update,
|
|
3443
|
-
updateAndGet: updateAndGet
|
|
3442
|
+
update: update$2,
|
|
3443
|
+
updateAndGet: updateAndGet$2
|
|
3444
3444
|
});
|
|
3445
3445
|
/** @internal */ const ArrayProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Array.prototype), {
|
|
3446
3446
|
[symbol$1] () {
|
|
3447
|
-
return array$
|
|
3447
|
+
return array$3(this);
|
|
3448
3448
|
},
|
|
3449
3449
|
[symbol] (that) {
|
|
3450
3450
|
if (Array.isArray(that) && this.length === that.length) {
|
|
@@ -3646,7 +3646,7 @@ function variance$1(a) {
|
|
|
3646
3646
|
_V: identity$1
|
|
3647
3647
|
}
|
|
3648
3648
|
};
|
|
3649
|
-
/** @internal */ const make$
|
|
3649
|
+
/** @internal */ const make$3 = (params)=>{
|
|
3650
3650
|
const differ = Object.create(DifferProto);
|
|
3651
3651
|
differ.empty = params.empty;
|
|
3652
3652
|
differ.diff = params.diff;
|
|
@@ -3654,7 +3654,7 @@ function variance$1(a) {
|
|
|
3654
3654
|
differ.patch = params.patch;
|
|
3655
3655
|
return differ;
|
|
3656
3656
|
};
|
|
3657
|
-
/** @internal */ const environment = ()=>make$
|
|
3657
|
+
/** @internal */ const environment = ()=>make$3({
|
|
3658
3658
|
empty: empty$1(),
|
|
3659
3659
|
combine: (first, second)=>combine(second)(first),
|
|
3660
3660
|
diff: (oldValue, newValue)=>diff(oldValue, newValue),
|
|
@@ -3677,7 +3677,7 @@ function variance$1(a) {
|
|
|
3677
3677
|
/** @internal */ const proto = {
|
|
3678
3678
|
[CauseTypeId]: variance,
|
|
3679
3679
|
[symbol$1] () {
|
|
3680
|
-
return pipe(hash(CauseSymbolKey), combine$
|
|
3680
|
+
return pipe(hash(CauseSymbolKey), combine$2(hash(flattenCause(this))));
|
|
3681
3681
|
},
|
|
3682
3682
|
[symbol] (that) {
|
|
3683
3683
|
return isCause(that) && causeEquals(this, that);
|
|
@@ -3761,7 +3761,7 @@ function variance$1(a) {
|
|
|
3761
3761
|
empty$8()
|
|
3762
3762
|
], ([parallel, sequential], cause)=>{
|
|
3763
3763
|
const [par, seq] = evaluateCause(cause);
|
|
3764
|
-
return some$
|
|
3764
|
+
return some$4([
|
|
3765
3765
|
pipe(parallel, union(par)),
|
|
3766
3766
|
pipe(sequential, appendAll$1(seq))
|
|
3767
3767
|
]);
|
|
@@ -3771,7 +3771,7 @@ function variance$1(a) {
|
|
|
3771
3771
|
empty$8()
|
|
3772
3772
|
], ([parallel, sequential], cause)=>{
|
|
3773
3773
|
const [par, seq] = evaluateCause(cause);
|
|
3774
|
-
return some$
|
|
3774
|
+
return some$4([
|
|
3775
3775
|
pipe(parallel, union(par)),
|
|
3776
3776
|
pipe(sequential, appendAll$1(seq))
|
|
3777
3777
|
]);
|
|
@@ -4327,7 +4327,7 @@ const originalSymbol = /*#__PURE__*/ Symbol.for("effect/OriginalAnnotation");
|
|
|
4327
4327
|
// -----------------------------------------------------------------------------
|
|
4328
4328
|
/** @internal */ const currentSpanFromFiber = (fiber)=>{
|
|
4329
4329
|
const span = fiber.getFiberRef(currentContext).unsafeMap.get(spanTag);
|
|
4330
|
-
return span !== undefined && span._tag === "Span" ? some$
|
|
4330
|
+
return span !== undefined && span._tag === "Span" ? some$4(span) : none();
|
|
4331
4331
|
};
|
|
4332
4332
|
/**
|
|
4333
4333
|
* @example
|