@gardenfi/swap 0.0.2 → 0.1.0-beta.1
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/index104.cjs +1 -1
- package/dist/index104.js +1 -1
- package/dist/index106.cjs +1 -1
- package/dist/index106.js +3 -3
- package/dist/index107.cjs +1 -1
- package/dist/index107.js +1 -1
- package/dist/index113.cjs +1 -1
- package/dist/index113.js +1 -1
- package/dist/index116.cjs +1 -1
- package/dist/index116.js +1 -1
- package/dist/index117.cjs +1 -1
- package/dist/index117.js +1 -1
- package/dist/index12.cjs +1 -1
- package/dist/index12.js +12 -12
- package/dist/index120.cjs +1 -1
- package/dist/index120.js +2 -2
- package/dist/index121.cjs +1 -1
- package/dist/index121.js +7 -7
- package/dist/index126.cjs +1 -1
- package/dist/index126.js +3 -3
- package/dist/index127.cjs +1 -1
- package/dist/index127.js +1 -1
- package/dist/index128.cjs +1 -1
- package/dist/index128.js +2 -2
- package/dist/index129.cjs +1 -1
- package/dist/index129.js +1 -1
- package/dist/index130.cjs +1 -1
- package/dist/index130.js +3 -3
- package/dist/index132.cjs +1 -1
- package/dist/index132.js +1 -1
- package/dist/index133.cjs +1 -1
- package/dist/index133.js +1 -1
- package/dist/index134.cjs +1 -1
- package/dist/index134.js +1 -1
- package/dist/index135.cjs +1 -1
- package/dist/index135.js +1 -1
- package/dist/index138.cjs +1 -1
- package/dist/index138.js +1 -1
- package/dist/index140.cjs +1 -1
- package/dist/index140.js +1 -1
- package/dist/index148.cjs +1 -1
- package/dist/index148.js +1 -1
- package/dist/index149.cjs +1 -1
- package/dist/index149.js +1 -1
- package/dist/index154.cjs +1 -1
- package/dist/index154.js +1 -1
- package/dist/index160.cjs +1 -1
- package/dist/index160.js +1 -1
- package/dist/index162.cjs +1 -1
- package/dist/index162.js +2 -2
- package/dist/index167.cjs +1 -1
- package/dist/index167.js +2 -2
- package/dist/index168.cjs +1 -1
- package/dist/index168.js +2 -2
- package/dist/index169.cjs +1 -1
- package/dist/index169.js +2 -2
- package/dist/index170.cjs +1 -1
- package/dist/index170.js +2 -2
- package/dist/index171.cjs +1 -1
- package/dist/index171.js +2 -2
- package/dist/index172.cjs +1 -1
- package/dist/index172.js +2 -2
- package/dist/index173.cjs +1 -1
- package/dist/index173.js +2 -2
- package/dist/index178.cjs +1 -1
- package/dist/index178.js +1 -1
- package/dist/index18.cjs +1 -1
- package/dist/index18.js +3 -3
- package/dist/index181.cjs +1 -1
- package/dist/index181.js +1 -1
- package/dist/index182.cjs +1 -1
- package/dist/index182.js +61 -42
- package/dist/index19.cjs +1 -1
- package/dist/index19.js +18 -18
- package/dist/index190.cjs +1 -1
- package/dist/index190.js +1 -1
- package/dist/index195.cjs +1 -1
- package/dist/index195.js +19 -19
- package/dist/index20.cjs +1 -1
- package/dist/index20.js +2 -2
- package/dist/index21.cjs +1 -1
- package/dist/index21.js +19 -19
- package/dist/index217.cjs +1 -1
- package/dist/index217.js +58 -49
- package/dist/index24.cjs +1 -1
- package/dist/index24.js +2 -2
- package/dist/index242.cjs +1 -1
- package/dist/index242.js +1 -1
- package/dist/index247.cjs +1 -1
- package/dist/index247.js +2 -2
- package/dist/index248.cjs +1 -1
- package/dist/index248.js +1 -1
- package/dist/index249.cjs +1 -1
- package/dist/index249.js +2 -2
- package/dist/index260.cjs +1 -1
- package/dist/index260.js +3 -3
- package/dist/index272.cjs +1 -1
- package/dist/index272.js +1 -1
- package/dist/index273.cjs +1 -1
- package/dist/index273.js +1 -1
- package/dist/index276.cjs +1 -1
- package/dist/index276.js +3 -3
- package/dist/index278.cjs +1 -1
- package/dist/index278.js +1 -1
- package/dist/index28.cjs +1 -1
- package/dist/index28.js +58 -58
- package/dist/index281.cjs +1 -1
- package/dist/index281.js +140 -54
- package/dist/index282.cjs +1 -1
- package/dist/index282.js +5 -120
- package/dist/index283.cjs +2 -1
- package/dist/index283.js +42 -5
- package/dist/index284.cjs +1 -1
- package/dist/index284.js +2 -8
- package/dist/index285.cjs +1 -1
- package/dist/index285.js +5 -4
- package/dist/index286.cjs +1 -1
- package/dist/index286.js +9 -162
- package/dist/index287.cjs +1 -1
- package/dist/index287.js +20 -5
- package/dist/index288.cjs +1 -2
- package/dist/index288.js +8 -41
- package/dist/index289.cjs +1 -1
- package/dist/index289.js +73 -2
- package/dist/index290.cjs +1 -1
- package/dist/index290.js +65 -5
- package/dist/index291.cjs +1 -1
- package/dist/index291.js +187 -9
- package/dist/index292.cjs +1 -1
- package/dist/index292.js +20 -17
- package/dist/index293.cjs +1 -1
- package/dist/index293.js +42 -8
- package/dist/index294.cjs +1 -1
- package/dist/index294.js +24 -71
- package/dist/index295.cjs +1 -1
- package/dist/index295.js +86 -61
- package/dist/index296.cjs +1 -1
- package/dist/index296.js +35 -183
- package/dist/index297.cjs +1 -1
- package/dist/index297.js +15 -21
- package/dist/index298.cjs +1 -1
- package/dist/index298.js +5 -34
- package/dist/index299.cjs +1 -1
- package/dist/index299.js +36 -24
- package/dist/index3.cjs +1 -1
- package/dist/index3.js +4 -12
- package/dist/index300.cjs +1 -1
- package/dist/index300.js +15 -90
- package/dist/index301.cjs +1 -1
- package/dist/index301.js +8 -40
- package/dist/index302.cjs +1 -1
- package/dist/index302.js +7 -16
- package/dist/index303.cjs +1 -1
- package/dist/index303.js +41 -12
- package/dist/index304.cjs +1 -1
- package/dist/index304.js +318 -35
- package/dist/index305.cjs +1 -1
- package/dist/index305.js +605 -15
- package/dist/index306.cjs +1 -1
- package/dist/index306.js +110 -9
- package/dist/index307.cjs +1 -1
- package/dist/index307.js +167 -42
- package/dist/index308.cjs +1 -1
- package/dist/index308.js +291 -310
- package/dist/index309.cjs +1 -1
- package/dist/index309.js +94 -606
- package/dist/index31.cjs +1 -1
- package/dist/index31.js +1 -1
- package/dist/index310.cjs +1 -1
- package/dist/index310.js +44 -97
- package/dist/index311.cjs +1 -1
- package/dist/index311.js +52 -166
- package/dist/index312.cjs +1 -1
- package/dist/index312.js +41 -298
- package/dist/index313.cjs +1 -1
- package/dist/index313.js +15 -93
- package/dist/index314.cjs +1 -1
- package/dist/index314.js +310 -49
- package/dist/index315.cjs +1 -1
- package/dist/index315.js +57 -51
- package/dist/index316.cjs +1 -1
- package/dist/index316.js +18 -43
- package/dist/index317.cjs +1 -1
- package/dist/index317.js +28 -14
- package/dist/index318.cjs +1 -1
- package/dist/index318.js +3 -317
- package/dist/index319.cjs +7 -1
- package/dist/index319.js +232 -54
- package/dist/index32.cjs +1 -1
- package/dist/index32.js +1 -1
- package/dist/index320.cjs +1 -1
- package/dist/index320.js +47 -19
- package/dist/index321.cjs +1 -1
- package/dist/index321.js +208 -25
- package/dist/index322.cjs +1 -1
- package/dist/index322.js +81 -3
- package/dist/index323.cjs +1 -7
- package/dist/index323.js +27 -235
- package/dist/index324.cjs +1 -1
- package/dist/index324.js +77 -48
- package/dist/index325.cjs +1 -1
- package/dist/index325.js +9 -212
- package/dist/index326.cjs +1 -1
- package/dist/index326.js +15 -80
- package/dist/index327.cjs +1 -1
- package/dist/index327.js +20 -27
- package/dist/index328.cjs +1 -1
- package/dist/index328.js +13 -76
- package/dist/index329.cjs +1 -1
- package/dist/index329.js +13 -7
- package/dist/index330.cjs +1 -1
- package/dist/index330.js +14 -11
- package/dist/index331.cjs +1 -1
- package/dist/index331.js +9 -13
- package/dist/index332.cjs +1 -1
- package/dist/index332.js +13 -10
- package/dist/index333.cjs +1 -1
- package/dist/index333.js +25 -9
- package/dist/index334.cjs +1 -1
- package/dist/index334.js +31 -16
- package/dist/index335.cjs +2 -1
- package/dist/index335.js +18 -22
- package/dist/index336.cjs +1 -1
- package/dist/index336.js +14 -13
- package/dist/index337.cjs +1 -1
- package/dist/index337.js +11 -14
- package/dist/index338.cjs +1 -1
- package/dist/index338.js +10 -7
- package/dist/index339.cjs +1 -1
- package/dist/index339.js +32 -14
- package/dist/index340.cjs +1 -1
- package/dist/index340.js +115 -25
- package/dist/index341.cjs +1 -1
- package/dist/index341.js +102 -30
- package/dist/index342.cjs +1 -2
- package/dist/index342.js +6 -18
- package/dist/index343.cjs +1 -1
- package/dist/index343.js +7 -15
- package/dist/index344.cjs +1 -1
- package/dist/index344.js +25 -32
- package/dist/index345.cjs +1 -1
- package/dist/index345.js +16 -115
- package/dist/index346.cjs +1 -1
- package/dist/index346.js +212 -101
- package/dist/index347.cjs +1 -1
- package/dist/index347.js +7 -6
- package/dist/index348.cjs +1 -1
- package/dist/index348.js +120 -7
- package/dist/index349.cjs +1 -1
- package/dist/index349.js +4 -26
- package/dist/index350.cjs +2 -1
- package/dist/index350.js +193 -16
- package/dist/index351.cjs +1 -1
- package/dist/index351.js +72 -209
- package/dist/index352.cjs +1 -2
- package/dist/index352.js +317 -167
- package/dist/index353.cjs +1 -1
- package/dist/index353.js +160 -16
- package/dist/index354.cjs +1 -1
- package/dist/index354.js +5 -15
- package/dist/index355.cjs +1 -1
- package/dist/index355.js +12 -7
- package/dist/index356.cjs +1 -1
- package/dist/index356.js +16 -52
- package/dist/index357.cjs +1 -1
- package/dist/index357.js +51 -20
- package/dist/index358.cjs +1 -1
- package/dist/index358.js +10 -2
- package/dist/index363.cjs +1 -1
- package/dist/index363.js +1 -1
- package/dist/index364.cjs +1 -1
- package/dist/index364.js +1 -1
- package/dist/index365.cjs +1 -1
- package/dist/index365.js +3 -275
- package/dist/index366.cjs +1 -1
- package/dist/index366.js +73 -170
- package/dist/index367.cjs +1 -1
- package/dist/index367.js +32 -10
- package/dist/index368.cjs +1 -1
- package/dist/index368.js +5 -107
- package/dist/index369.cjs +1 -1
- package/dist/index369.js +140 -5
- package/dist/index370.cjs +1 -1
- package/dist/index370.js +274 -72
- package/dist/index371.cjs +1 -1
- package/dist/index371.js +171 -10
- package/dist/index372.cjs +1 -1
- package/dist/index372.js +10 -32
- package/dist/index373.cjs +1 -1
- package/dist/index373.js +101 -134
- package/dist/index374.cjs +1 -1
- package/dist/index374.js +9 -3
- package/dist/index375.cjs +1 -1
- package/dist/index375.js +4 -4
- package/dist/index376.cjs +1 -1
- package/dist/index376.js +1 -1
- package/dist/index378.cjs +1 -1
- package/dist/index378.js +1 -1
- package/dist/index379.cjs +1 -1
- package/dist/index379.js +1 -1
- package/dist/index38.cjs +1 -1
- package/dist/index38.js +2 -2
- package/dist/index380.cjs +1 -1
- package/dist/index380.js +1 -1
- package/dist/index381.cjs +1 -1
- package/dist/index381.js +2 -344
- package/dist/index382.cjs +1 -1
- package/dist/index382.js +15 -154
- package/dist/index383.cjs +1 -1
- package/dist/index383.js +110 -3
- package/dist/index384.cjs +1 -1
- package/dist/index384.js +3 -63
- package/dist/index385.cjs +1 -1
- package/dist/index385.js +59 -106
- package/dist/index386.cjs +1 -1
- package/dist/index386.js +2 -2
- package/dist/index42.cjs +1 -1
- package/dist/index42.js +88 -12
- package/dist/index43.cjs +1 -1
- package/dist/index43.js +13 -58
- package/dist/index44.cjs +1 -1
- package/dist/index44.js +12 -522
- package/dist/index45.cjs +1 -1
- package/dist/index45.js +59 -30
- package/dist/index46.cjs +1 -1
- package/dist/index46.js +522 -26
- package/dist/index47.cjs +1 -1
- package/dist/index47.js +16 -12
- package/dist/index48.cjs +1 -1
- package/dist/index48.js +12 -35
- package/dist/index49.cjs +1 -1
- package/dist/index49.js +14 -16
- package/dist/index50.cjs +1 -1
- package/dist/index50.js +38 -17
- package/dist/index51.cjs +1 -1
- package/dist/index51.js +15 -18
- package/dist/index52.cjs +1 -1
- package/dist/index52.js +17 -19
- package/dist/index53.cjs +1 -1
- package/dist/index53.js +17 -42
- package/dist/index54.cjs +1 -1
- package/dist/index54.js +15 -39
- package/dist/index55.cjs +1 -1
- package/dist/index55.js +49 -29
- package/dist/index56.cjs +1 -1
- package/dist/index56.js +46 -29
- package/dist/index57.cjs +1 -1
- package/dist/index57.js +26 -20
- package/dist/index58.cjs +1 -1
- package/dist/index58.js +27 -18
- package/dist/index59.cjs +1 -1
- package/dist/index59.js +16 -14
- package/dist/index60.cjs +1 -1
- package/dist/index60.js +28 -15
- package/dist/index61.cjs +1 -1
- package/dist/index61.js +28 -14
- package/dist/index62.cjs +1 -1
- package/dist/index62.js +13 -86
- package/dist/index63.cjs +1 -1
- package/dist/index63.js +13 -13
- package/dist/index64.cjs +1 -1
- package/dist/index64.js +17 -32
- package/dist/index65.cjs +1 -1
- package/dist/index65.js +9 -14
- package/dist/index66.cjs +1 -1
- package/dist/index66.js +32 -17
- package/dist/index67.cjs +1 -1
- package/dist/index67.js +14 -9
- package/dist/index71.cjs +1 -1
- package/dist/index71.js +28 -19
- package/dist/index77.cjs +1 -1
- package/dist/index77.js +13 -13
- package/dist/index9.cjs +1 -1
- package/dist/index9.js +27 -19
- package/dist/index92.cjs +1 -1
- package/dist/index92.js +1 -1
- package/dist/src/lib/constants/wagmiConfig.d.ts +9 -9
- package/dist/src/lib/store/swapStore.d.ts +1 -1
- package/dist/src/lib/types/types.d.ts +0 -1
- package/package.json +6 -6
package/dist/index382.js
CHANGED
|
@@ -1,163 +1,24 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
dataView: new DataView(new ArrayBuffer(0)),
|
|
5
|
-
position: 0,
|
|
6
|
-
positionReadCount: /* @__PURE__ */ new Map(),
|
|
7
|
-
recursiveReadCount: 0,
|
|
8
|
-
recursiveReadLimit: Number.POSITIVE_INFINITY,
|
|
9
|
-
assertReadLimit() {
|
|
10
|
-
if (this.recursiveReadCount >= this.recursiveReadLimit)
|
|
11
|
-
throw new h({
|
|
12
|
-
count: this.recursiveReadCount + 1,
|
|
13
|
-
limit: this.recursiveReadLimit
|
|
14
|
-
});
|
|
15
|
-
},
|
|
16
|
-
assertPosition(t) {
|
|
17
|
-
if (t < 0 || t > this.bytes.length - 1)
|
|
18
|
-
throw new r({
|
|
19
|
-
length: this.bytes.length,
|
|
20
|
-
position: t
|
|
21
|
-
});
|
|
22
|
-
},
|
|
23
|
-
decrementPosition(t) {
|
|
24
|
-
if (t < 0)
|
|
25
|
-
throw new o({ offset: t });
|
|
26
|
-
const i = this.position - t;
|
|
27
|
-
this.assertPosition(i), this.position = i;
|
|
28
|
-
},
|
|
29
|
-
getReadCount(t) {
|
|
30
|
-
return this.positionReadCount.get(t || this.position) || 0;
|
|
31
|
-
},
|
|
32
|
-
incrementPosition(t) {
|
|
33
|
-
if (t < 0)
|
|
34
|
-
throw new o({ offset: t });
|
|
35
|
-
const i = this.position + t;
|
|
36
|
-
this.assertPosition(i), this.position = i;
|
|
37
|
-
},
|
|
38
|
-
inspectByte(t) {
|
|
39
|
-
const i = t ?? this.position;
|
|
40
|
-
return this.assertPosition(i), this.bytes[i];
|
|
41
|
-
},
|
|
42
|
-
inspectBytes(t, i) {
|
|
43
|
-
const s = i ?? this.position;
|
|
44
|
-
return this.assertPosition(s + t - 1), this.bytes.subarray(s, s + t);
|
|
45
|
-
},
|
|
46
|
-
inspectUint8(t) {
|
|
47
|
-
const i = t ?? this.position;
|
|
48
|
-
return this.assertPosition(i), this.bytes[i];
|
|
49
|
-
},
|
|
50
|
-
inspectUint16(t) {
|
|
51
|
-
const i = t ?? this.position;
|
|
52
|
-
return this.assertPosition(i + 1), this.dataView.getUint16(i);
|
|
53
|
-
},
|
|
54
|
-
inspectUint24(t) {
|
|
55
|
-
const i = t ?? this.position;
|
|
56
|
-
return this.assertPosition(i + 2), (this.dataView.getUint16(i) << 8) + this.dataView.getUint8(i + 2);
|
|
57
|
-
},
|
|
58
|
-
inspectUint32(t) {
|
|
59
|
-
const i = t ?? this.position;
|
|
60
|
-
return this.assertPosition(i + 3), this.dataView.getUint32(i);
|
|
61
|
-
},
|
|
62
|
-
pushByte(t) {
|
|
63
|
-
this.assertPosition(this.position), this.bytes[this.position] = t, this.position++;
|
|
64
|
-
},
|
|
65
|
-
pushBytes(t) {
|
|
66
|
-
this.assertPosition(this.position + t.length - 1), this.bytes.set(t, this.position), this.position += t.length;
|
|
67
|
-
},
|
|
68
|
-
pushUint8(t) {
|
|
69
|
-
this.assertPosition(this.position), this.bytes[this.position] = t, this.position++;
|
|
70
|
-
},
|
|
71
|
-
pushUint16(t) {
|
|
72
|
-
this.assertPosition(this.position + 1), this.dataView.setUint16(this.position, t), this.position += 2;
|
|
73
|
-
},
|
|
74
|
-
pushUint24(t) {
|
|
75
|
-
this.assertPosition(this.position + 2), this.dataView.setUint16(this.position, t >> 8), this.dataView.setUint8(this.position + 2, t & 255), this.position += 3;
|
|
76
|
-
},
|
|
77
|
-
pushUint32(t) {
|
|
78
|
-
this.assertPosition(this.position + 3), this.dataView.setUint32(this.position, t), this.position += 4;
|
|
79
|
-
},
|
|
80
|
-
readByte() {
|
|
81
|
-
this.assertReadLimit(), this._touch();
|
|
82
|
-
const t = this.inspectByte();
|
|
83
|
-
return this.position++, t;
|
|
84
|
-
},
|
|
85
|
-
readBytes(t, i) {
|
|
86
|
-
this.assertReadLimit(), this._touch();
|
|
87
|
-
const s = this.inspectBytes(t);
|
|
88
|
-
return this.position += i ?? t, s;
|
|
89
|
-
},
|
|
90
|
-
readUint8() {
|
|
91
|
-
this.assertReadLimit(), this._touch();
|
|
92
|
-
const t = this.inspectUint8();
|
|
93
|
-
return this.position += 1, t;
|
|
94
|
-
},
|
|
95
|
-
readUint16() {
|
|
96
|
-
this.assertReadLimit(), this._touch();
|
|
97
|
-
const t = this.inspectUint16();
|
|
98
|
-
return this.position += 2, t;
|
|
99
|
-
},
|
|
100
|
-
readUint24() {
|
|
101
|
-
this.assertReadLimit(), this._touch();
|
|
102
|
-
const t = this.inspectUint24();
|
|
103
|
-
return this.position += 3, t;
|
|
104
|
-
},
|
|
105
|
-
readUint32() {
|
|
106
|
-
this.assertReadLimit(), this._touch();
|
|
107
|
-
const t = this.inspectUint32();
|
|
108
|
-
return this.position += 4, t;
|
|
109
|
-
},
|
|
110
|
-
get remaining() {
|
|
111
|
-
return this.bytes.length - this.position;
|
|
112
|
-
},
|
|
113
|
-
setPosition(t) {
|
|
114
|
-
const i = this.position;
|
|
115
|
-
return this.assertPosition(t), this.position = t, () => this.position = i;
|
|
116
|
-
},
|
|
117
|
-
_touch() {
|
|
118
|
-
if (this.recursiveReadLimit === Number.POSITIVE_INFINITY)
|
|
119
|
-
return;
|
|
120
|
-
const t = this.getReadCount();
|
|
121
|
-
this.positionReadCount.set(this.position, t + 1), t > 0 && this.recursiveReadCount++;
|
|
122
|
-
}
|
|
123
|
-
};
|
|
124
|
-
function u(t, { recursiveReadLimit: i = 8192 } = {}) {
|
|
125
|
-
const s = Object.create(n);
|
|
126
|
-
return s.bytes = t, s.dataView = new DataView(t.buffer, t.byteOffset, t.byteLength), s.positionReadCount = /* @__PURE__ */ new Map(), s.recursiveReadLimit = i, s;
|
|
127
|
-
}
|
|
128
|
-
class o extends e {
|
|
129
|
-
constructor({ offset: i }) {
|
|
130
|
-
super(`Offset \`${i}\` cannot be negative.`), Object.defineProperty(this, "name", {
|
|
1
|
+
class r extends Map {
|
|
2
|
+
constructor(e) {
|
|
3
|
+
super(), Object.defineProperty(this, "maxSize", {
|
|
131
4
|
enumerable: !0,
|
|
132
5
|
configurable: !0,
|
|
133
6
|
writable: !0,
|
|
134
|
-
value:
|
|
135
|
-
});
|
|
7
|
+
value: void 0
|
|
8
|
+
}), this.maxSize = e;
|
|
136
9
|
}
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
super(`Position \`${s}\` is out of bounds (\`0 < position < ${i}\`).`), Object.defineProperty(this, "name", {
|
|
141
|
-
enumerable: !0,
|
|
142
|
-
configurable: !0,
|
|
143
|
-
writable: !0,
|
|
144
|
-
value: "Cursor.PositionOutOfBoundsError"
|
|
145
|
-
});
|
|
10
|
+
get(e) {
|
|
11
|
+
const t = super.get(e);
|
|
12
|
+
return super.has(e) && t !== void 0 && (this.delete(e), super.set(e, t)), t;
|
|
146
13
|
}
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
151
|
-
|
|
152
|
-
|
|
153
|
-
writable: !0,
|
|
154
|
-
value: "Cursor.RecursiveReadLimitExceededError"
|
|
155
|
-
});
|
|
14
|
+
set(e, t) {
|
|
15
|
+
if (super.set(e, t), this.maxSize && this.size > this.maxSize) {
|
|
16
|
+
const s = this.keys().next().value;
|
|
17
|
+
s && this.delete(s);
|
|
18
|
+
}
|
|
19
|
+
return this;
|
|
156
20
|
}
|
|
157
21
|
}
|
|
158
22
|
export {
|
|
159
|
-
|
|
160
|
-
r as PositionOutOfBoundsError,
|
|
161
|
-
h as RecursiveReadLimitExceededError,
|
|
162
|
-
u as create
|
|
23
|
+
r as LruMap
|
|
163
24
|
};
|
package/dist/index383.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */function x(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&e.constructor.name==="Uint8Array"}function p(e,r){return Array.isArray(r)?r.length===0?!0:e?r.every(t=>typeof t=="string"):r.every(t=>Number.isSafeInteger(t)):!1}function w(e,r){if(typeof r!="string")throw new Error(`${e}: string expected`);return!0}function b(e){if(!Number.isSafeInteger(e))throw new Error(`invalid integer: ${e}`)}function h(e){if(!Array.isArray(e))throw new Error("array expected")}function A(e,r){if(!p(!0,r))throw new Error(`${e}: array of strings expected`)}function m(e,r){if(!p(!1,r))throw new Error(`${e}: array of numbers expected`)}function E(...e){const r=n=>n,t=(n,a)=>o=>n(a(o)),c=e.map(n=>n.encode).reduceRight(t,r),i=e.map(n=>n.decode).reduce(t,r);return{encode:c,decode:i}}function $(e){const r=typeof e=="string"?e.split(""):e,t=r.length;A("alphabet",r);const c=new Map(r.map((i,n)=>[i,n]));return{encode:i=>(h(i),i.map(n=>{if(!Number.isSafeInteger(n)||n<0||n>=t)throw new Error(`alphabet.encode: digit index outside alphabet "${n}". Allowed: ${e}`);return r[n]})),decode:i=>(h(i),i.map(n=>{w("alphabet.decode",n);const a=c.get(n);if(a===void 0)throw new Error(`Unknown letter: "${n}". Allowed: ${e}`);return a}))}}function S(e=""){return w("join",e),{encode:r=>(A("join.decode",r),r.join(e)),decode:r=>(w("join.decode",r),r.split(e))}}function g(e,r,t){if(r<2)throw new Error(`convertRadix: invalid from=${r}, base cannot be less than 2`);if(t<2)throw new Error(`convertRadix: invalid to=${t}, base cannot be less than 2`);if(h(e),!e.length)return[];let c=0;const i=[],n=Array.from(e,o=>{if(b(o),o<0||o>=r)throw new Error(`invalid integer: ${o}`);return o}),a=n.length;for(;;){let o=0,d=!0;for(let s=c;s<a;s++){const y=n[s],l=r*o,u=l+y;if(!Number.isSafeInteger(u)||l/r!==o||u-y!==l)throw new Error("convertRadix: carry overflow");const v=u/t;o=u%t;const f=Math.floor(v);if(n[s]=f,!Number.isSafeInteger(f)||f*t+o!==u)throw new Error("convertRadix: carry overflow");if(d)f?d=!1:c=s;else continue}if(i.push(o),d)break}for(let o=0;o<e.length-1&&e[o]===0;o++)i.push(0);return i.reverse()}function j(e){b(e);const r=2**8;return{encode:t=>{if(!x(t))throw new Error("radix.encode input should be Uint8Array");return g(Array.from(t),r,e)},decode:t=>(m("radix.decode",t),Uint8Array.from(g(t,e,r)))}}const R=e=>E(j(58),$(e),S("")),N=R("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");exports.base58=N;
|
package/dist/index383.js
CHANGED
|
@@ -1,5 +1,112 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
1
|
+
/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
2
|
+
function x(e) {
|
|
3
|
+
return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
|
|
4
|
+
}
|
|
5
|
+
function g(e, r) {
|
|
6
|
+
return Array.isArray(r) ? r.length === 0 ? !0 : e ? r.every((t) => typeof t == "string") : r.every((t) => Number.isSafeInteger(t)) : !1;
|
|
7
|
+
}
|
|
8
|
+
function w(e, r) {
|
|
9
|
+
if (typeof r != "string")
|
|
10
|
+
throw new Error(`${e}: string expected`);
|
|
11
|
+
return !0;
|
|
12
|
+
}
|
|
13
|
+
function b(e) {
|
|
14
|
+
if (!Number.isSafeInteger(e))
|
|
15
|
+
throw new Error(`invalid integer: ${e}`);
|
|
16
|
+
}
|
|
17
|
+
function h(e) {
|
|
18
|
+
if (!Array.isArray(e))
|
|
19
|
+
throw new Error("array expected");
|
|
20
|
+
}
|
|
21
|
+
function A(e, r) {
|
|
22
|
+
if (!g(!0, r))
|
|
23
|
+
throw new Error(`${e}: array of strings expected`);
|
|
24
|
+
}
|
|
25
|
+
function E(e, r) {
|
|
26
|
+
if (!g(!1, r))
|
|
27
|
+
throw new Error(`${e}: array of numbers expected`);
|
|
28
|
+
}
|
|
29
|
+
// @__NO_SIDE_EFFECTS__
|
|
30
|
+
function m(...e) {
|
|
31
|
+
const r = (n) => n, t = (n, a) => (o) => n(a(o)), c = e.map((n) => n.encode).reduceRight(t, r), i = e.map((n) => n.decode).reduce(t, r);
|
|
32
|
+
return { encode: c, decode: i };
|
|
33
|
+
}
|
|
34
|
+
// @__NO_SIDE_EFFECTS__
|
|
35
|
+
function $(e) {
|
|
36
|
+
const r = typeof e == "string" ? e.split("") : e, t = r.length;
|
|
37
|
+
A("alphabet", r);
|
|
38
|
+
const c = new Map(r.map((i, n) => [i, n]));
|
|
39
|
+
return {
|
|
40
|
+
encode: (i) => (h(i), i.map((n) => {
|
|
41
|
+
if (!Number.isSafeInteger(n) || n < 0 || n >= t)
|
|
42
|
+
throw new Error(`alphabet.encode: digit index outside alphabet "${n}". Allowed: ${e}`);
|
|
43
|
+
return r[n];
|
|
44
|
+
})),
|
|
45
|
+
decode: (i) => (h(i), i.map((n) => {
|
|
46
|
+
w("alphabet.decode", n);
|
|
47
|
+
const a = c.get(n);
|
|
48
|
+
if (a === void 0)
|
|
49
|
+
throw new Error(`Unknown letter: "${n}". Allowed: ${e}`);
|
|
50
|
+
return a;
|
|
51
|
+
}))
|
|
52
|
+
};
|
|
53
|
+
}
|
|
54
|
+
// @__NO_SIDE_EFFECTS__
|
|
55
|
+
function R(e = "") {
|
|
56
|
+
return w("join", e), {
|
|
57
|
+
encode: (r) => (A("join.decode", r), r.join(e)),
|
|
58
|
+
decode: (r) => (w("join.decode", r), r.split(e))
|
|
59
|
+
};
|
|
60
|
+
}
|
|
61
|
+
function p(e, r, t) {
|
|
62
|
+
if (r < 2)
|
|
63
|
+
throw new Error(`convertRadix: invalid from=${r}, base cannot be less than 2`);
|
|
64
|
+
if (t < 2)
|
|
65
|
+
throw new Error(`convertRadix: invalid to=${t}, base cannot be less than 2`);
|
|
66
|
+
if (h(e), !e.length)
|
|
67
|
+
return [];
|
|
68
|
+
let c = 0;
|
|
69
|
+
const i = [], n = Array.from(e, (o) => {
|
|
70
|
+
if (b(o), o < 0 || o >= r)
|
|
71
|
+
throw new Error(`invalid integer: ${o}`);
|
|
72
|
+
return o;
|
|
73
|
+
}), a = n.length;
|
|
74
|
+
for (; ; ) {
|
|
75
|
+
let o = 0, d = !0;
|
|
76
|
+
for (let s = c; s < a; s++) {
|
|
77
|
+
const y = n[s], l = r * o, f = l + y;
|
|
78
|
+
if (!Number.isSafeInteger(f) || l / r !== o || f - y !== l)
|
|
79
|
+
throw new Error("convertRadix: carry overflow");
|
|
80
|
+
const v = f / t;
|
|
81
|
+
o = f % t;
|
|
82
|
+
const u = Math.floor(v);
|
|
83
|
+
if (n[s] = u, !Number.isSafeInteger(u) || u * t + o !== f)
|
|
84
|
+
throw new Error("convertRadix: carry overflow");
|
|
85
|
+
if (d)
|
|
86
|
+
u ? d = !1 : c = s;
|
|
87
|
+
else continue;
|
|
88
|
+
}
|
|
89
|
+
if (i.push(o), d)
|
|
90
|
+
break;
|
|
91
|
+
}
|
|
92
|
+
for (let o = 0; o < e.length - 1 && e[o] === 0; o++)
|
|
93
|
+
i.push(0);
|
|
94
|
+
return i.reverse();
|
|
95
|
+
}
|
|
96
|
+
// @__NO_SIDE_EFFECTS__
|
|
97
|
+
function j(e) {
|
|
98
|
+
b(e);
|
|
99
|
+
const r = 2 ** 8;
|
|
100
|
+
return {
|
|
101
|
+
encode: (t) => {
|
|
102
|
+
if (!x(t))
|
|
103
|
+
throw new Error("radix.encode input should be Uint8Array");
|
|
104
|
+
return p(Array.from(t), r, e);
|
|
105
|
+
},
|
|
106
|
+
decode: (t) => (E("radix.decode", t), Uint8Array.from(p(t, e, r)))
|
|
107
|
+
};
|
|
108
|
+
}
|
|
109
|
+
const N = /* @__NO_SIDE_EFFECTS__ */ (e) => /* @__PURE__ */ m(/* @__PURE__ */ j(58), /* @__PURE__ */ $(e), /* @__PURE__ */ R("")), S = /* @__PURE__ */ N("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
|
|
3
110
|
export {
|
|
4
|
-
|
|
111
|
+
S as base58
|
|
5
112
|
};
|
package/dist/index384.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index386.cjs"),b=e.blake2b;exports.blake2b=b;
|
package/dist/index384.js
CHANGED
|
@@ -1,65 +1,5 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
function y(r) {
|
|
4
|
-
let i = !0, t = "", e = 0, n = "", o = !1;
|
|
5
|
-
for (let s = 0; s < r.length; s++) {
|
|
6
|
-
const u = r[s];
|
|
7
|
-
if (["(", ")", ","].includes(u) && (i = !0), u === "(" && e++, u === ")" && e--, !!i) {
|
|
8
|
-
if (e === 0) {
|
|
9
|
-
if (u === " " && ["event", "function", "error", ""].includes(n))
|
|
10
|
-
n = "";
|
|
11
|
-
else if (n += u, u === ")") {
|
|
12
|
-
o = !0;
|
|
13
|
-
break;
|
|
14
|
-
}
|
|
15
|
-
continue;
|
|
16
|
-
}
|
|
17
|
-
if (u === " ") {
|
|
18
|
-
r[s - 1] !== "," && t !== "," && t !== ",(" && (t = "", i = !1);
|
|
19
|
-
continue;
|
|
20
|
-
}
|
|
21
|
-
n += u, t += u;
|
|
22
|
-
}
|
|
23
|
-
}
|
|
24
|
-
if (!o)
|
|
25
|
-
throw new f("Unable to normalize signature.");
|
|
26
|
-
return n;
|
|
27
|
-
}
|
|
28
|
-
function l(r, i) {
|
|
29
|
-
const t = typeof r, e = i.type;
|
|
30
|
-
switch (e) {
|
|
31
|
-
case "address":
|
|
32
|
-
return c(r, { strict: !1 });
|
|
33
|
-
case "bool":
|
|
34
|
-
return t === "boolean";
|
|
35
|
-
case "function":
|
|
36
|
-
return t === "string";
|
|
37
|
-
case "string":
|
|
38
|
-
return t === "string";
|
|
39
|
-
default:
|
|
40
|
-
return e === "tuple" && "components" in i ? Object.values(i.components).every((n, o) => l(Object.values(r)[o], n)) : /^u?int(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/.test(e) ? t === "number" || t === "bigint" : /^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/.test(e) ? t === "string" || r instanceof Uint8Array : /[a-z]+[1-9]{0,3}(\[[0-9]{0,}\])+$/.test(e) ? Array.isArray(r) && r.every((n) => l(n, {
|
|
41
|
-
...i,
|
|
42
|
-
// Pop off `[]` or `[M]` from end of type
|
|
43
|
-
type: e.replace(/(\[[0-9]{0,}\])$/, "")
|
|
44
|
-
})) : !1;
|
|
45
|
-
}
|
|
46
|
-
}
|
|
47
|
-
function a(r, i, t) {
|
|
48
|
-
for (const e in r) {
|
|
49
|
-
const n = r[e], o = i[e];
|
|
50
|
-
if (n.type === "tuple" && o.type === "tuple" && "components" in n && "components" in o)
|
|
51
|
-
return a(n.components, o.components, t[e]);
|
|
52
|
-
const s = [n.type, o.type];
|
|
53
|
-
if (s.includes("address") && s.includes("bytes20") ? !0 : s.includes("address") && s.includes("string") ? c(t[e], {
|
|
54
|
-
strict: !1
|
|
55
|
-
}) : s.includes("address") && s.includes("bytes") ? c(t[e], {
|
|
56
|
-
strict: !1
|
|
57
|
-
}) : !1)
|
|
58
|
-
return s;
|
|
59
|
-
}
|
|
60
|
-
}
|
|
1
|
+
import { blake2b as b } from "./index386.js";
|
|
2
|
+
const e = b;
|
|
61
3
|
export {
|
|
62
|
-
|
|
63
|
-
l as isArgOfType,
|
|
64
|
-
y as normalizeSignature
|
|
4
|
+
e as blake2b
|
|
65
5
|
};
|
package/dist/index385.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"})
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index351.cjs"),a=require("./index278.cjs");function d(r){let i=!0,t="",e=0,n="",o=!1;for(let s=0;s<r.length;s++){const u=r[s];if(["(",")",","].includes(u)&&(i=!0),u==="("&&e++,u===")"&&e--,!!i){if(e===0){if(u===" "&&["event","function","error",""].includes(n))n="";else if(n+=u,u===")"){o=!0;break}continue}if(u===" "){r[s-1]!==","&&t!==","&&t!==",("&&(t="",i=!1);continue}n+=u,t+=u}}if(!o)throw new a.BaseError("Unable to normalize signature.");return n}function l(r,i){const t=typeof r,e=i.type;switch(e){case"address":return c.validate(r,{strict:!1});case"bool":return t==="boolean";case"function":return t==="string";case"string":return t==="string";default:return e==="tuple"&&"components"in i?Object.values(i.components).every((n,o)=>l(Object.values(r)[o],n)):/^u?int(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/.test(e)?t==="number"||t==="bigint":/^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/.test(e)?t==="string"||r instanceof Uint8Array:/[a-z]+[1-9]{0,3}(\[[0-9]{0,}\])+$/.test(e)?Array.isArray(r)&&r.every(n=>l(n,{...i,type:e.replace(/(\[[0-9]{0,}\])$/,"")})):!1}}function f(r,i,t){for(const e in r){const n=r[e],o=i[e];if(n.type==="tuple"&&o.type==="tuple"&&"components"in n&&"components"in o)return f(n.components,o.components,t[e]);const s=[n.type,o.type];if(s.includes("address")&&s.includes("bytes20")?!0:s.includes("address")&&s.includes("string")?c.validate(t[e],{strict:!1}):s.includes("address")&&s.includes("bytes")?c.validate(t[e],{strict:!1}):!1)return s}}exports.getAmbiguousTypes=f;exports.isArgOfType=l;exports.normalizeSignature=d;
|
package/dist/index385.js
CHANGED
|
@@ -1,112 +1,65 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
}
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
}
|
|
21
|
-
|
|
22
|
-
if (!g(!0, r))
|
|
23
|
-
throw new Error(`${e}: array of strings expected`);
|
|
24
|
-
}
|
|
25
|
-
function E(e, r) {
|
|
26
|
-
if (!g(!1, r))
|
|
27
|
-
throw new Error(`${e}: array of numbers expected`);
|
|
28
|
-
}
|
|
29
|
-
// @__NO_SIDE_EFFECTS__
|
|
30
|
-
function m(...e) {
|
|
31
|
-
const r = (n) => n, t = (n, a) => (o) => n(a(o)), c = e.map((n) => n.encode).reduceRight(t, r), i = e.map((n) => n.decode).reduce(t, r);
|
|
32
|
-
return { encode: c, decode: i };
|
|
33
|
-
}
|
|
34
|
-
// @__NO_SIDE_EFFECTS__
|
|
35
|
-
function $(e) {
|
|
36
|
-
const r = typeof e == "string" ? e.split("") : e, t = r.length;
|
|
37
|
-
A("alphabet", r);
|
|
38
|
-
const c = new Map(r.map((i, n) => [i, n]));
|
|
39
|
-
return {
|
|
40
|
-
encode: (i) => (h(i), i.map((n) => {
|
|
41
|
-
if (!Number.isSafeInteger(n) || n < 0 || n >= t)
|
|
42
|
-
throw new Error(`alphabet.encode: digit index outside alphabet "${n}". Allowed: ${e}`);
|
|
43
|
-
return r[n];
|
|
44
|
-
})),
|
|
45
|
-
decode: (i) => (h(i), i.map((n) => {
|
|
46
|
-
w("alphabet.decode", n);
|
|
47
|
-
const a = c.get(n);
|
|
48
|
-
if (a === void 0)
|
|
49
|
-
throw new Error(`Unknown letter: "${n}". Allowed: ${e}`);
|
|
50
|
-
return a;
|
|
51
|
-
}))
|
|
52
|
-
};
|
|
53
|
-
}
|
|
54
|
-
// @__NO_SIDE_EFFECTS__
|
|
55
|
-
function R(e = "") {
|
|
56
|
-
return w("join", e), {
|
|
57
|
-
encode: (r) => (A("join.decode", r), r.join(e)),
|
|
58
|
-
decode: (r) => (w("join.decode", r), r.split(e))
|
|
59
|
-
};
|
|
60
|
-
}
|
|
61
|
-
function p(e, r, t) {
|
|
62
|
-
if (r < 2)
|
|
63
|
-
throw new Error(`convertRadix: invalid from=${r}, base cannot be less than 2`);
|
|
64
|
-
if (t < 2)
|
|
65
|
-
throw new Error(`convertRadix: invalid to=${t}, base cannot be less than 2`);
|
|
66
|
-
if (h(e), !e.length)
|
|
67
|
-
return [];
|
|
68
|
-
let c = 0;
|
|
69
|
-
const i = [], n = Array.from(e, (o) => {
|
|
70
|
-
if (b(o), o < 0 || o >= r)
|
|
71
|
-
throw new Error(`invalid integer: ${o}`);
|
|
72
|
-
return o;
|
|
73
|
-
}), a = n.length;
|
|
74
|
-
for (; ; ) {
|
|
75
|
-
let o = 0, d = !0;
|
|
76
|
-
for (let s = c; s < a; s++) {
|
|
77
|
-
const y = n[s], l = r * o, f = l + y;
|
|
78
|
-
if (!Number.isSafeInteger(f) || l / r !== o || f - y !== l)
|
|
79
|
-
throw new Error("convertRadix: carry overflow");
|
|
80
|
-
const v = f / t;
|
|
81
|
-
o = f % t;
|
|
82
|
-
const u = Math.floor(v);
|
|
83
|
-
if (n[s] = u, !Number.isSafeInteger(u) || u * t + o !== f)
|
|
84
|
-
throw new Error("convertRadix: carry overflow");
|
|
85
|
-
if (d)
|
|
86
|
-
u ? d = !1 : c = s;
|
|
87
|
-
else continue;
|
|
1
|
+
import { validate as c } from "./index351.js";
|
|
2
|
+
import { BaseError as f } from "./index278.js";
|
|
3
|
+
function y(r) {
|
|
4
|
+
let i = !0, t = "", e = 0, n = "", o = !1;
|
|
5
|
+
for (let s = 0; s < r.length; s++) {
|
|
6
|
+
const u = r[s];
|
|
7
|
+
if (["(", ")", ","].includes(u) && (i = !0), u === "(" && e++, u === ")" && e--, !!i) {
|
|
8
|
+
if (e === 0) {
|
|
9
|
+
if (u === " " && ["event", "function", "error", ""].includes(n))
|
|
10
|
+
n = "";
|
|
11
|
+
else if (n += u, u === ")") {
|
|
12
|
+
o = !0;
|
|
13
|
+
break;
|
|
14
|
+
}
|
|
15
|
+
continue;
|
|
16
|
+
}
|
|
17
|
+
if (u === " ") {
|
|
18
|
+
r[s - 1] !== "," && t !== "," && t !== ",(" && (t = "", i = !1);
|
|
19
|
+
continue;
|
|
20
|
+
}
|
|
21
|
+
n += u, t += u;
|
|
88
22
|
}
|
|
89
|
-
if (i.push(o), d)
|
|
90
|
-
break;
|
|
91
23
|
}
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
return
|
|
24
|
+
if (!o)
|
|
25
|
+
throw new f("Unable to normalize signature.");
|
|
26
|
+
return n;
|
|
95
27
|
}
|
|
96
|
-
|
|
97
|
-
|
|
98
|
-
|
|
99
|
-
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
return
|
|
105
|
-
|
|
106
|
-
|
|
107
|
-
|
|
28
|
+
function l(r, i) {
|
|
29
|
+
const t = typeof r, e = i.type;
|
|
30
|
+
switch (e) {
|
|
31
|
+
case "address":
|
|
32
|
+
return c(r, { strict: !1 });
|
|
33
|
+
case "bool":
|
|
34
|
+
return t === "boolean";
|
|
35
|
+
case "function":
|
|
36
|
+
return t === "string";
|
|
37
|
+
case "string":
|
|
38
|
+
return t === "string";
|
|
39
|
+
default:
|
|
40
|
+
return e === "tuple" && "components" in i ? Object.values(i.components).every((n, o) => l(Object.values(r)[o], n)) : /^u?int(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/.test(e) ? t === "number" || t === "bigint" : /^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/.test(e) ? t === "string" || r instanceof Uint8Array : /[a-z]+[1-9]{0,3}(\[[0-9]{0,}\])+$/.test(e) ? Array.isArray(r) && r.every((n) => l(n, {
|
|
41
|
+
...i,
|
|
42
|
+
// Pop off `[]` or `[M]` from end of type
|
|
43
|
+
type: e.replace(/(\[[0-9]{0,}\])$/, "")
|
|
44
|
+
})) : !1;
|
|
45
|
+
}
|
|
46
|
+
}
|
|
47
|
+
function a(r, i, t) {
|
|
48
|
+
for (const e in r) {
|
|
49
|
+
const n = r[e], o = i[e];
|
|
50
|
+
if (n.type === "tuple" && o.type === "tuple" && "components" in n && "components" in o)
|
|
51
|
+
return a(n.components, o.components, t[e]);
|
|
52
|
+
const s = [n.type, o.type];
|
|
53
|
+
if (s.includes("address") && s.includes("bytes20") ? !0 : s.includes("address") && s.includes("string") ? c(t[e], {
|
|
54
|
+
strict: !1
|
|
55
|
+
}) : s.includes("address") && s.includes("bytes") ? c(t[e], {
|
|
56
|
+
strict: !1
|
|
57
|
+
}) : !1)
|
|
58
|
+
return s;
|
|
59
|
+
}
|
|
108
60
|
}
|
|
109
|
-
const N = /* @__NO_SIDE_EFFECTS__ */ (e) => /* @__PURE__ */ m(/* @__PURE__ */ j(58), /* @__PURE__ */ $(e), /* @__PURE__ */ R("")), S = /* @__PURE__ */ N("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
|
|
110
61
|
export {
|
|
111
|
-
|
|
62
|
+
a as getAmbiguousTypes,
|
|
63
|
+
l as isArgOfType,
|
|
64
|
+
y as normalizeSignature
|
|
112
65
|
};
|
package/dist/index386.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const k=require("./index387.cjs"),w=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const k=require("./index387.cjs"),w=require("./index339.cjs"),l=require("./index340.cjs"),d=Uint32Array.from([4089235720,1779033703,2227873595,3144134277,4271175723,1013904242,1595750129,2773480762,2917565137,1359893119,725511199,2600822924,4215389547,528734635,327033209,1541459225]),t=new Uint32Array(32);function I(p,s,h,n,v,r){const i=v[r],e=v[r+1];let o=t[2*p],f=t[2*p+1],a=t[2*s],u=t[2*s+1],b=t[2*h],E=t[2*h+1],B=t[2*n],c=t[2*n+1],y=w.add3L(o,a,i);f=w.add3H(y,f,u,e),o=y|0,{Dh:c,Dl:B}={Dh:c^f,Dl:B^o},{Dh:c,Dl:B}={Dh:w.rotr32H(c,B),Dl:w.rotr32L(c)},{h:E,l:b}=w.add(E,b,c,B),{Bh:u,Bl:a}={Bh:u^E,Bl:a^b},{Bh:u,Bl:a}={Bh:w.rotrSH(u,a,24),Bl:w.rotrSL(u,a,24)},t[2*p]=o,t[2*p+1]=f,t[2*s]=a,t[2*s+1]=u,t[2*h]=b,t[2*h+1]=E,t[2*n]=B,t[2*n+1]=c}function x(p,s,h,n,v,r){const i=v[r],e=v[r+1];let o=t[2*p],f=t[2*p+1],a=t[2*s],u=t[2*s+1],b=t[2*h],E=t[2*h+1],B=t[2*n],c=t[2*n+1],y=w.add3L(o,a,i);f=w.add3H(y,f,u,e),o=y|0,{Dh:c,Dl:B}={Dh:c^f,Dl:B^o},{Dh:c,Dl:B}={Dh:w.rotrSH(c,B,16),Dl:w.rotrSL(c,B,16)},{h:E,l:b}=w.add(E,b,c,B),{Bh:u,Bl:a}={Bh:u^E,Bl:a^b},{Bh:u,Bl:a}={Bh:w.rotrBH(u,a,63),Bl:w.rotrBL(u,a,63)},t[2*p]=o,t[2*p+1]=f,t[2*s]=a,t[2*s+1]=u,t[2*h]=b,t[2*h+1]=E,t[2*n]=B,t[2*n+1]=c}function D(p,s={},h,n,v){if(l.anumber(h),p<0||p>h)throw new Error("outputLen bigger than keyLen");const{key:r,salt:i,personalization:e}=s;if(r!==void 0&&(r.length<1||r.length>h))throw new Error("key length must be undefined or 1.."+h);if(i!==void 0&&i.length!==n)throw new Error("salt must be undefined or "+n);if(e!==void 0&&e.length!==v)throw new Error("personalization must be undefined or "+v)}class L extends l.Hash{constructor(s,h){super(),this.finished=!1,this.destroyed=!1,this.length=0,this.pos=0,l.anumber(s),l.anumber(h),this.blockLen=s,this.outputLen=h,this.buffer=new Uint8Array(s),this.buffer32=l.u32(this.buffer)}update(s){l.aexists(this),s=l.toBytes(s),l.abytes(s);const{blockLen:h,buffer:n,buffer32:v}=this,r=s.length,i=s.byteOffset,e=s.buffer;for(let o=0;o<r;){this.pos===h&&(l.swap32IfBE(v),this.compress(v,0,!1),l.swap32IfBE(v),this.pos=0);const f=Math.min(h-this.pos,r-o),a=i+o;if(f===h&&!(a%4)&&o+f<r){const u=new Uint32Array(e,a,Math.floor((r-o)/4));l.swap32IfBE(u);for(let b=0;o+h<r;b+=v.length,o+=h)this.length+=h,this.compress(u,b,!1);l.swap32IfBE(u);continue}n.set(s.subarray(o,o+f),this.pos),this.pos+=f,this.length+=f,o+=f}return this}digestInto(s){l.aexists(this),l.aoutput(s,this);const{pos:h,buffer32:n}=this;this.finished=!0,l.clean(this.buffer.subarray(h)),l.swap32IfBE(n),this.compress(n,0,!0),l.swap32IfBE(n);const v=l.u32(s);this.get().forEach((r,i)=>v[i]=l.swap8IfBE(r))}digest(){const{buffer:s,outputLen:h}=this;this.digestInto(s);const n=s.slice(0,h);return this.destroy(),n}_cloneInto(s){const{buffer:h,length:n,finished:v,destroyed:r,outputLen:i,pos:e}=this;return s||(s=new this.constructor({dkLen:i})),s.set(...this.get()),s.buffer.set(h),s.destroyed=r,s.finished=v,s.length=n,s.pos=e,s.outputLen=i,s}clone(){return this._cloneInto()}}class A extends L{constructor(s={}){const h=s.dkLen===void 0?64:s.dkLen;super(128,h),this.v0l=d[0]|0,this.v0h=d[1]|0,this.v1l=d[2]|0,this.v1h=d[3]|0,this.v2l=d[4]|0,this.v2h=d[5]|0,this.v3l=d[6]|0,this.v3h=d[7]|0,this.v4l=d[8]|0,this.v4h=d[9]|0,this.v5l=d[10]|0,this.v5h=d[11]|0,this.v6l=d[12]|0,this.v6h=d[13]|0,this.v7l=d[14]|0,this.v7h=d[15]|0,D(h,s,64,16,16);let{key:n,personalization:v,salt:r}=s,i=0;if(n!==void 0&&(n=l.toBytes(n),i=n.length),this.v0l^=this.outputLen|i<<8|65536|1<<24,r!==void 0){r=l.toBytes(r);const e=l.u32(r);this.v4l^=l.swap8IfBE(e[0]),this.v4h^=l.swap8IfBE(e[1]),this.v5l^=l.swap8IfBE(e[2]),this.v5h^=l.swap8IfBE(e[3])}if(v!==void 0){v=l.toBytes(v);const e=l.u32(v);this.v6l^=l.swap8IfBE(e[0]),this.v6h^=l.swap8IfBE(e[1]),this.v7l^=l.swap8IfBE(e[2]),this.v7h^=l.swap8IfBE(e[3])}if(n!==void 0){const e=new Uint8Array(this.blockLen);e.set(n),this.update(e)}}get(){let{v0l:s,v0h:h,v1l:n,v1h:v,v2l:r,v2h:i,v3l:e,v3h:o,v4l:f,v4h:a,v5l:u,v5h:b,v6l:E,v6h:B,v7l:c,v7h:y}=this;return[s,h,n,v,r,i,e,o,f,a,u,b,E,B,c,y]}set(s,h,n,v,r,i,e,o,f,a,u,b,E,B,c,y){this.v0l=s|0,this.v0h=h|0,this.v1l=n|0,this.v1h=v|0,this.v2l=r|0,this.v2h=i|0,this.v3l=e|0,this.v3h=o|0,this.v4l=f|0,this.v4h=a|0,this.v5l=u|0,this.v5h=b|0,this.v6l=E|0,this.v6h=B|0,this.v7l=c|0,this.v7h=y|0}compress(s,h,n){this.get().forEach((o,f)=>t[f]=o),t.set(d,16);let{h:v,l:r}=w.fromBig(BigInt(this.length));t[24]=d[8]^r,t[25]=d[9]^v,n&&(t[28]=~t[28],t[29]=~t[29]);let i=0;const e=k.BSIGMA;for(let o=0;o<12;o++)I(0,4,8,12,s,h+2*e[i++]),x(0,4,8,12,s,h+2*e[i++]),I(1,5,9,13,s,h+2*e[i++]),x(1,5,9,13,s,h+2*e[i++]),I(2,6,10,14,s,h+2*e[i++]),x(2,6,10,14,s,h+2*e[i++]),I(3,7,11,15,s,h+2*e[i++]),x(3,7,11,15,s,h+2*e[i++]),I(0,5,10,15,s,h+2*e[i++]),x(0,5,10,15,s,h+2*e[i++]),I(1,6,11,12,s,h+2*e[i++]),x(1,6,11,12,s,h+2*e[i++]),I(2,7,8,13,s,h+2*e[i++]),x(2,7,8,13,s,h+2*e[i++]),I(3,4,9,14,s,h+2*e[i++]),x(3,4,9,14,s,h+2*e[i++]);this.v0l^=t[0]^t[16],this.v0h^=t[1]^t[17],this.v1l^=t[2]^t[18],this.v1h^=t[3]^t[19],this.v2l^=t[4]^t[20],this.v2h^=t[5]^t[21],this.v3l^=t[6]^t[22],this.v3h^=t[7]^t[23],this.v4l^=t[8]^t[24],this.v4h^=t[9]^t[25],this.v5l^=t[10]^t[26],this.v5h^=t[11]^t[27],this.v6l^=t[12]^t[28],this.v6h^=t[13]^t[29],this.v7l^=t[14]^t[30],this.v7h^=t[15]^t[31],l.clean(t)}destroy(){this.destroyed=!0,l.clean(this.buffer32),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}const g=l.createOptHasher(p=>new A(p));exports.BLAKE2=L;exports.BLAKE2b=A;exports.blake2b=g;
|
package/dist/index386.js
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import { BSIGMA as z } from "./index387.js";
|
|
2
|
-
import { fromBig as G, add3H as H, rotr32L as M, rotr32H as S, add as U, rotrSL as C, rotrSH as O, rotrBL as _, rotrBH as K, add3L as X } from "./
|
|
3
|
-
import { createOptHasher as j, toBytes as L, u32 as k, swap8IfBE as y, clean as E, Hash as m, anumber as g, aexists as I, abytes as F, swap32IfBE as D, aoutput as V } from "./
|
|
2
|
+
import { fromBig as G, add3H as H, rotr32L as M, rotr32H as S, add as U, rotrSL as C, rotrSH as O, rotrBL as _, rotrBH as K, add3L as X } from "./index339.js";
|
|
3
|
+
import { createOptHasher as j, toBytes as L, u32 as k, swap8IfBE as y, clean as E, Hash as m, anumber as g, aexists as I, abytes as F, swap32IfBE as D, aoutput as V } from "./index340.js";
|
|
4
4
|
const d = /* @__PURE__ */ Uint32Array.from([
|
|
5
5
|
4089235720,
|
|
6
6
|
1779033703,
|
package/dist/index42.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("react"),g=require("@gardenfi/garden-book"),A=require("./index36.cjs"),t=require("@gardenfi/orderbook"),I=require("./index7.cjs"),a=require("./index34.cjs"),M=require("./index6.cjs"),w=require("./index12.cjs"),_=require("./index14.cjs"),v=require("@gardenfi/react-hooks"),R=r=>{switch(r){case t.OrderStatus.Created:return"Detecting deposit";case t.OrderStatus.Expired:return"Expired";case t.OrderStatus.Initiated:return"Deposit detected (0/1)";case t.OrderStatus.InitiateDetected:return"Deposit detected (0/1)";case t.OrderStatus.AwaitingRedeem:return"Redeeming";case t.OrderStatus.Refunded:case t.OrderStatus.AwaitingRefund:case t.OrderStatus.Redeemed:return"Completed";default:return"In progress..."}},k=({order:r,status:o,isLast:f,isFirst:S})=>{const{source_swap:c,destination_swap:i}=r,{allAssets:u}=I.assetInfoStore(),{currentNetwork:h,setActiveTab:O}=M.swapStore(),{setIsOpen:b,setOrder:E}=_.orderInProgressStore(),{garden:d}=v.useGarden(),n=e.useMemo(()=>a.getAssetFromSwap(c,u),[c,u]),s=e.useMemo(()=>a.getAssetFromSwap(i,u),[i,u]),l=e.useMemo(()=>o&&R(o),[o]),m=e.useMemo(()=>n&&a.formatAmount(c.amount,(n==null?void 0:n.decimals)??0,Math.min(n.decimals,8)),[c.amount,n]),p=e.useMemo(()=>s&&a.formatAmount(i.amount,(s==null?void 0:s.decimals)??0,Math.min(s.decimals,8)),[i.amount,s]),x=e.useMemo(()=>a.getDayDifference(r.created_at),[r.created_at]),q=()=>{if(!r.order_id||!d)return;if(o===t.OrderStatus.Created&&t.isBitcoin(r.source_swap.chain)){b(!0),O(w.tabs.swap),E(d,r.order_id);return}const y=w.getApiEndpoint(h).explorer;window.open(`${y}/order/${r.order_id}`,"_blank")};return!n||!s?null:e.createElement("div",null,!S&&e.createElement("div",{className:"h-px w-full bg-white/50"}),e.createElement("div",{className:`flex flex-col gap-1 p-4 ${f?"rounded-b-2xl":""} ${l!=="Expired"?"cursor-pointer hover:bg-white/50":""}`,onClick:q},e.createElement("div",{className:"flex flex-col gap-1"},m&&p&&e.createElement(A.SwapInfo,{sendAsset:n,receiveAsset:s,sendAmount:m,receiveAmount:p}),e.createElement("div",{className:"flex justify-between"},e.createElement(g.Typography,{size:"h5",weight:"regular"},l),e.createElement(g.Typography,{size:"h5",weight:"regular"},x)))))};exports.TransactionRow=k;
|