@gardenfi/swap 0.0.2-beta.1 → 0.0.2-beta.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/index104.cjs +1 -1
- package/dist/index104.js +4 -4
- package/dist/index106.cjs +1 -1
- package/dist/index106.js +3 -3
- package/dist/index107.cjs +1 -1
- package/dist/index107.js +3 -3
- 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/index120.cjs +1 -1
- package/dist/index120.js +2 -2
- package/dist/index121.cjs +1 -1
- package/dist/index121.js +7 -7
- 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 +2 -2
- package/dist/index161.cjs +1 -1
- package/dist/index161.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/index181.cjs +1 -1
- package/dist/index181.js +1 -1
- package/dist/index272.cjs +1 -1
- package/dist/index272.js +174 -9
- package/dist/index273.cjs +2 -1
- package/dist/index273.js +91 -30
- package/dist/index274.cjs +1 -1
- package/dist/index274.js +41 -2
- package/dist/index275.cjs +1 -1
- package/dist/index275.js +4 -47
- package/dist/index276.cjs +1 -1
- package/dist/index276.js +9 -11
- package/dist/index277.cjs +1 -1
- package/dist/index277.js +30 -174
- package/dist/index278.cjs +1 -2
- package/dist/index278.js +2 -92
- package/dist/index279.cjs +1 -1
- package/dist/index279.js +45 -38
- package/dist/index280.cjs +1 -1
- package/dist/index280.js +11 -4
- package/dist/index281.cjs +1 -1
- package/dist/index281.js +3 -3
- package/dist/index299.cjs +1 -1
- package/dist/index299.js +7 -37
- package/dist/index300.cjs +1 -1
- package/dist/index300.js +36 -14
- package/dist/index301.cjs +1 -1
- package/dist/index301.js +15 -8
- package/dist/index302.cjs +1 -1
- package/dist/index302.js +43 -8
- package/dist/index303.cjs +1 -1
- package/dist/index303.js +317 -39
- package/dist/index304.cjs +1 -1
- package/dist/index304.js +586 -301
- package/dist/index305.cjs +1 -1
- package/dist/index305.js +107 -603
- package/dist/index306.cjs +1 -1
- package/dist/index306.js +168 -110
- package/dist/index307.cjs +1 -1
- package/dist/index307.js +299 -165
- package/dist/index308.cjs +1 -1
- package/dist/index308.js +92 -300
- package/dist/index309.cjs +1 -1
- package/dist/index309.js +56 -93
- package/dist/index310.cjs +1 -1
- package/dist/index310.js +52 -55
- package/dist/index311.cjs +1 -1
- package/dist/index311.js +42 -51
- package/dist/index312.cjs +1 -1
- package/dist/index312.js +14 -43
- package/dist/index313.cjs +1 -1
- package/dist/index313.js +317 -15
- package/dist/index314.cjs +1 -1
- package/dist/index314.js +53 -311
- package/dist/index315.cjs +1 -1
- package/dist/index315.js +19 -59
- package/dist/index316.cjs +1 -1
- package/dist/index316.js +29 -19
- package/dist/index317.cjs +1 -1
- package/dist/index317.js +3 -29
- package/dist/index318.cjs +7 -1
- package/dist/index318.js +237 -3
- package/dist/index319.cjs +1 -7
- package/dist/index319.js +48 -238
- package/dist/index320.cjs +1 -1
- package/dist/index320.js +213 -48
- package/dist/index321.cjs +1 -1
- package/dist/index321.js +75 -206
- package/dist/index322.cjs +1 -1
- package/dist/index322.js +26 -78
- package/dist/index323.cjs +1 -1
- package/dist/index323.js +73 -26
- package/dist/index324.cjs +1 -1
- package/dist/index324.js +7 -75
- package/dist/index326.cjs +1 -1
- package/dist/index326.js +1 -1
- package/dist/index327.cjs +1 -1
- package/dist/index327.js +1 -1
- package/dist/index333.cjs +1 -1
- package/dist/index333.js +2 -2
- package/dist/index334.cjs +1 -1
- package/dist/index334.js +2 -2
- package/dist/index346.cjs +1 -1
- package/dist/index346.js +1 -1
- package/dist/index347.cjs +1 -1
- package/dist/index347.js +1 -1
- package/dist/index348.cjs +1 -1
- package/dist/index348.js +3 -3
- package/dist/index349.cjs +2 -1
- package/dist/index349.js +193 -4
- package/dist/index350.cjs +1 -2
- package/dist/index350.js +52 -168
- package/dist/index351.cjs +1 -1
- package/dist/index351.js +331 -65
- package/dist/index352.cjs +1 -1
- package/dist/index352.js +149 -332
- package/dist/index353.cjs +1 -1
- package/dist/index353.js +5 -161
- package/dist/index354.cjs +1 -1
- package/dist/index354.js +5 -5
- package/dist/index357.cjs +1 -1
- package/dist/index357.js +205 -8
- package/dist/index359.cjs +1 -1
- package/dist/index359.js +8 -205
- 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 +73 -3
- package/dist/index366.cjs +1 -1
- package/dist/index366.js +29 -138
- package/dist/index367.cjs +1 -1
- package/dist/index367.js +5 -73
- package/dist/index368.cjs +1 -1
- package/dist/index368.js +2 -30
- package/dist/index369.cjs +1 -1
- package/dist/index369.js +140 -5
- package/dist/index370.cjs +1 -1
- package/dist/index370.js +1 -1
- package/dist/index373.cjs +1 -1
- package/dist/index373.js +1 -1
- package/dist/index374.cjs +1 -1
- package/dist/index374.js +1 -1
- package/dist/index375.cjs +1 -1
- package/dist/index375.js +2 -2
- package/dist/index379.cjs +1 -1
- package/dist/index379.js +1 -1
- package/dist/index380.cjs +1 -1
- package/dist/index380.js +1 -1
- package/dist/index381.cjs +1 -1
- package/dist/index381.js +22 -2
- package/dist/index382.cjs +1 -1
- package/dist/index382.js +2 -22
- package/dist/index385.cjs +1 -1
- package/dist/index385.js +2 -2
- package/dist/index77.cjs +1 -1
- package/dist/index77.js +13 -13
- package/dist/index99.cjs +1 -1
- package/dist/index99.js +1 -1
- package/package.json +5 -5
package/dist/index352.js
CHANGED
|
@@ -1,346 +1,163 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
return tt(t, e, {
|
|
15
|
-
checksumAddress: n,
|
|
16
|
-
staticPosition: s
|
|
17
|
-
});
|
|
18
|
-
if (e.type === "address")
|
|
19
|
-
return Q(t, { checksum: n });
|
|
20
|
-
if (e.type === "bool")
|
|
21
|
-
return Y(t);
|
|
22
|
-
if (e.type.startsWith("bytes"))
|
|
23
|
-
return Z(t, e, { staticPosition: s });
|
|
24
|
-
if (e.type.startsWith("uint") || e.type.startsWith("int"))
|
|
25
|
-
return v(t, e);
|
|
26
|
-
if (e.type === "string")
|
|
27
|
-
return et(t, { staticPosition: s });
|
|
28
|
-
throw new C(e.type);
|
|
29
|
-
}
|
|
30
|
-
const k = 32, A = 32;
|
|
31
|
-
function Q(t, e = {}) {
|
|
32
|
-
const { checksum: o = !1 } = e, n = t.readBytes(32);
|
|
33
|
-
return [((i) => o ? M(i) : i)(w(T(n, -20))), 32];
|
|
34
|
-
}
|
|
35
|
-
function X(t, e, o) {
|
|
36
|
-
const { checksumAddress: n, length: s, staticPosition: i } = o;
|
|
37
|
-
if (!s) {
|
|
38
|
-
const c = u(t.readBytes(A)), a = i + c, f = a + k;
|
|
39
|
-
t.setPosition(a);
|
|
40
|
-
const y = u(t.readBytes(k)), l = g(e);
|
|
41
|
-
let P = 0;
|
|
42
|
-
const N = [];
|
|
43
|
-
for (let z = 0; z < y; ++z) {
|
|
44
|
-
t.setPosition(f + (l ? z * 32 : P));
|
|
45
|
-
const [L, E] = p(t, e, {
|
|
46
|
-
checksumAddress: n,
|
|
47
|
-
staticPosition: f
|
|
48
|
-
});
|
|
49
|
-
P += E, N.push(L);
|
|
50
|
-
}
|
|
51
|
-
return t.setPosition(i + 32), [N, 32];
|
|
52
|
-
}
|
|
53
|
-
if (g(e)) {
|
|
54
|
-
const c = u(t.readBytes(A)), a = i + c, f = [];
|
|
55
|
-
for (let y = 0; y < s; ++y) {
|
|
56
|
-
t.setPosition(a + y * 32);
|
|
57
|
-
const [l] = p(t, e, {
|
|
58
|
-
checksumAddress: n,
|
|
59
|
-
staticPosition: a
|
|
1
|
+
import { BaseError as e } from "./index273.js";
|
|
2
|
+
const n = {
|
|
3
|
+
bytes: new Uint8Array(),
|
|
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
|
|
60
14
|
});
|
|
61
|
-
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
for (let c = 0; c < s; ++c) {
|
|
68
|
-
const [a, f] = p(t, e, {
|
|
69
|
-
checksumAddress: n,
|
|
70
|
-
staticPosition: i + r
|
|
71
|
-
});
|
|
72
|
-
r += f, d.push(a);
|
|
73
|
-
}
|
|
74
|
-
return [d, r];
|
|
75
|
-
}
|
|
76
|
-
function Y(t) {
|
|
77
|
-
return [D(t.readBytes(32), { size: 32 }), 32];
|
|
78
|
-
}
|
|
79
|
-
function Z(t, e, { staticPosition: o }) {
|
|
80
|
-
const [n, s] = e.type.split("bytes");
|
|
81
|
-
if (!s) {
|
|
82
|
-
const r = u(t.readBytes(32));
|
|
83
|
-
t.setPosition(o + r);
|
|
84
|
-
const d = u(t.readBytes(32));
|
|
85
|
-
if (d === 0)
|
|
86
|
-
return t.setPosition(o + 32), ["0x", 32];
|
|
87
|
-
const c = t.readBytes(d);
|
|
88
|
-
return t.setPosition(o + 32), [w(c), 32];
|
|
89
|
-
}
|
|
90
|
-
return [w(t.readBytes(Number.parseInt(s, 10), 32)), 32];
|
|
91
|
-
}
|
|
92
|
-
function v(t, e) {
|
|
93
|
-
const o = e.type.startsWith("int"), n = Number.parseInt(e.type.split("int")[1] || "256", 10), s = t.readBytes(32);
|
|
94
|
-
return [
|
|
95
|
-
n > 48 ? U(s, { signed: o }) : u(s, { signed: o }),
|
|
96
|
-
32
|
|
97
|
-
];
|
|
98
|
-
}
|
|
99
|
-
function tt(t, e, o) {
|
|
100
|
-
const { checksumAddress: n, staticPosition: s } = o, i = e.components.length === 0 || e.components.some(({ name: c }) => !c), r = i ? [] : {};
|
|
101
|
-
let d = 0;
|
|
102
|
-
if (g(e)) {
|
|
103
|
-
const c = u(t.readBytes(A)), a = s + c;
|
|
104
|
-
for (let f = 0; f < e.components.length; ++f) {
|
|
105
|
-
const y = e.components[f];
|
|
106
|
-
t.setPosition(a + d);
|
|
107
|
-
const [l, P] = p(t, y, {
|
|
108
|
-
checksumAddress: n,
|
|
109
|
-
staticPosition: a
|
|
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
|
|
110
21
|
});
|
|
111
|
-
|
|
112
|
-
|
|
113
|
-
|
|
114
|
-
|
|
115
|
-
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
|
|
120
|
-
|
|
121
|
-
|
|
122
|
-
|
|
123
|
-
}
|
|
124
|
-
|
|
125
|
-
|
|
126
|
-
|
|
127
|
-
|
|
128
|
-
|
|
129
|
-
return
|
|
130
|
-
|
|
131
|
-
|
|
132
|
-
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
|
|
142
|
-
}
|
|
143
|
-
|
|
144
|
-
|
|
145
|
-
|
|
146
|
-
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
151
|
-
|
|
152
|
-
|
|
153
|
-
|
|
154
|
-
|
|
155
|
-
|
|
156
|
-
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
|
|
167
|
-
|
|
168
|
-
|
|
169
|
-
|
|
170
|
-
|
|
171
|
-
|
|
172
|
-
|
|
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++;
|
|
173
122
|
}
|
|
174
|
-
|
|
175
|
-
|
|
176
|
-
|
|
177
|
-
|
|
178
|
-
|
|
179
|
-
|
|
180
|
-
|
|
181
|
-
|
|
182
|
-
|
|
183
|
-
|
|
184
|
-
|
|
185
|
-
|
|
186
|
-
const o = [], n = [];
|
|
187
|
-
let s = 0;
|
|
188
|
-
for (let i = 0; i < t.length; i++) {
|
|
189
|
-
const { dynamic: r, encoded: d } = t[i];
|
|
190
|
-
r ? (o.push(B(e + s, { size: 32 })), n.push(d), s += h(d)) : o.push(d);
|
|
191
|
-
}
|
|
192
|
-
return m(...o, ...n);
|
|
193
|
-
}
|
|
194
|
-
function nt(t, e) {
|
|
195
|
-
const { checksum: o = !1 } = e;
|
|
196
|
-
return R(t, { strict: o }), {
|
|
197
|
-
dynamic: !1,
|
|
198
|
-
encoded: S(t.toLowerCase())
|
|
199
|
-
};
|
|
200
|
-
}
|
|
201
|
-
function st(t, e) {
|
|
202
|
-
const { checksumAddress: o, length: n, parameter: s } = e, i = n === null;
|
|
203
|
-
if (!Array.isArray(t))
|
|
204
|
-
throw new _(t);
|
|
205
|
-
if (!i && t.length !== n)
|
|
206
|
-
throw new $({
|
|
207
|
-
expectedLength: n,
|
|
208
|
-
givenLength: t.length,
|
|
209
|
-
type: `${s.type}[${n}]`
|
|
210
|
-
});
|
|
211
|
-
let r = !1;
|
|
212
|
-
const d = [];
|
|
213
|
-
for (let c = 0; c < t.length; c++) {
|
|
214
|
-
const a = x({
|
|
215
|
-
checksumAddress: o,
|
|
216
|
-
parameter: s,
|
|
217
|
-
value: t[c]
|
|
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", {
|
|
131
|
+
enumerable: !0,
|
|
132
|
+
configurable: !0,
|
|
133
|
+
writable: !0,
|
|
134
|
+
value: "Cursor.NegativeOffsetError"
|
|
218
135
|
});
|
|
219
|
-
a.dynamic && (r = !0), d.push(a);
|
|
220
|
-
}
|
|
221
|
-
if (i || r) {
|
|
222
|
-
const c = W(d);
|
|
223
|
-
if (i) {
|
|
224
|
-
const a = B(d.length, { size: 32 });
|
|
225
|
-
return {
|
|
226
|
-
dynamic: !0,
|
|
227
|
-
encoded: d.length > 0 ? m(a, c) : a
|
|
228
|
-
};
|
|
229
|
-
}
|
|
230
|
-
if (r)
|
|
231
|
-
return { dynamic: !0, encoded: c };
|
|
232
136
|
}
|
|
233
|
-
return {
|
|
234
|
-
dynamic: !1,
|
|
235
|
-
encoded: m(...d.map(({ encoded: c }) => c))
|
|
236
|
-
};
|
|
237
137
|
}
|
|
238
|
-
|
|
239
|
-
|
|
240
|
-
|
|
241
|
-
|
|
242
|
-
|
|
243
|
-
|
|
244
|
-
|
|
245
|
-
};
|
|
246
|
-
}
|
|
247
|
-
if (n !== Number.parseInt(o, 10))
|
|
248
|
-
throw new O({
|
|
249
|
-
expectedSize: Number.parseInt(o, 10),
|
|
250
|
-
value: t
|
|
138
|
+
class r extends e {
|
|
139
|
+
constructor({ length: i, position: s }) {
|
|
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"
|
|
251
145
|
});
|
|
252
|
-
return { dynamic: !1, encoded: b(t) };
|
|
253
|
-
}
|
|
254
|
-
function it(t) {
|
|
255
|
-
if (typeof t != "boolean")
|
|
256
|
-
throw new q(`Invalid boolean value: "${t}" (type: ${typeof t}). Expected: \`true\` or \`false\`.`);
|
|
257
|
-
return { dynamic: !1, encoded: S(F(t)) };
|
|
258
|
-
}
|
|
259
|
-
function rt(t, { signed: e, size: o }) {
|
|
260
|
-
if (typeof o == "number") {
|
|
261
|
-
const n = 2n ** (BigInt(o) - (e ? 1n : 0n)) - 1n, s = e ? -n - 1n : 0n;
|
|
262
|
-
if (t > n || t < s)
|
|
263
|
-
throw new G({
|
|
264
|
-
max: n.toString(),
|
|
265
|
-
min: s.toString(),
|
|
266
|
-
signed: e,
|
|
267
|
-
size: o / 8,
|
|
268
|
-
value: t.toString()
|
|
269
|
-
});
|
|
270
146
|
}
|
|
271
|
-
return {
|
|
272
|
-
dynamic: !1,
|
|
273
|
-
encoded: B(t, {
|
|
274
|
-
size: 32,
|
|
275
|
-
signed: e
|
|
276
|
-
})
|
|
277
|
-
};
|
|
278
|
-
}
|
|
279
|
-
function ct(t) {
|
|
280
|
-
const e = H(t), o = Math.ceil(h(e) / 32), n = [];
|
|
281
|
-
for (let s = 0; s < o; s++)
|
|
282
|
-
n.push(b(J(e, s * 32, (s + 1) * 32)));
|
|
283
|
-
return {
|
|
284
|
-
dynamic: !0,
|
|
285
|
-
encoded: m(b(B(h(e), { size: 32 })), ...n)
|
|
286
|
-
};
|
|
287
147
|
}
|
|
288
|
-
|
|
289
|
-
|
|
290
|
-
|
|
291
|
-
|
|
292
|
-
|
|
293
|
-
|
|
294
|
-
|
|
295
|
-
parameter: d,
|
|
296
|
-
value: t[c]
|
|
148
|
+
class h extends e {
|
|
149
|
+
constructor({ count: i, limit: s }) {
|
|
150
|
+
super(`Recursive read limit of \`${s}\` exceeded (recursive read count: \`${i}\`).`), Object.defineProperty(this, "name", {
|
|
151
|
+
enumerable: !0,
|
|
152
|
+
configurable: !0,
|
|
153
|
+
writable: !0,
|
|
154
|
+
value: "Cursor.RecursiveReadLimitExceededError"
|
|
297
155
|
});
|
|
298
|
-
i.push(a), a.dynamic && (s = !0);
|
|
299
156
|
}
|
|
300
|
-
return {
|
|
301
|
-
dynamic: s,
|
|
302
|
-
encoded: s ? W(i) : m(...i.map(({ encoded: r }) => r))
|
|
303
|
-
};
|
|
304
|
-
}
|
|
305
|
-
function I(t) {
|
|
306
|
-
const e = t.match(/^(.*)\[(\d+)?\]$/);
|
|
307
|
-
return e ? (
|
|
308
|
-
// Return `null` if the array is dynamic.
|
|
309
|
-
[e[2] ? Number(e[2]) : null, e[1]]
|
|
310
|
-
) : void 0;
|
|
311
|
-
}
|
|
312
|
-
function g(t) {
|
|
313
|
-
var n;
|
|
314
|
-
const { type: e } = t;
|
|
315
|
-
if (e === "string" || e === "bytes" || e.endsWith("[]"))
|
|
316
|
-
return !0;
|
|
317
|
-
if (e === "tuple")
|
|
318
|
-
return (n = t.components) == null ? void 0 : n.some(g);
|
|
319
|
-
const o = I(t.type);
|
|
320
|
-
return !!(o && g({
|
|
321
|
-
...t,
|
|
322
|
-
type: o[1]
|
|
323
|
-
}));
|
|
324
157
|
}
|
|
325
158
|
export {
|
|
326
|
-
|
|
327
|
-
|
|
328
|
-
|
|
329
|
-
|
|
330
|
-
v as decodeNumber,
|
|
331
|
-
p as decodeParameter,
|
|
332
|
-
et as decodeString,
|
|
333
|
-
tt as decodeTuple,
|
|
334
|
-
W as encode,
|
|
335
|
-
nt as encodeAddress,
|
|
336
|
-
st as encodeArray,
|
|
337
|
-
it as encodeBoolean,
|
|
338
|
-
ot as encodeBytes,
|
|
339
|
-
rt as encodeNumber,
|
|
340
|
-
ct as encodeString,
|
|
341
|
-
dt as encodeTuple,
|
|
342
|
-
I as getArrayComponents,
|
|
343
|
-
g as hasDynamicChild,
|
|
344
|
-
x as prepareParameter,
|
|
345
|
-
pt as prepareParameters
|
|
159
|
+
o as NegativeOffsetError,
|
|
160
|
+
r as PositionOutOfBoundsError,
|
|
161
|
+
h as RecursiveReadLimitExceededError,
|
|
162
|
+
u as create
|
|
346
163
|
};
|
package/dist/index353.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 c=require("./index381.cjs"),e={checksum:new c.LruMap(8192)},s=e.checksum;exports.checksum=s;
|
package/dist/index353.js
CHANGED
|
@@ -1,163 +1,7 @@
|
|
|
1
|
-
import {
|
|
2
|
-
const
|
|
3
|
-
|
|
4
|
-
|
|
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", {
|
|
131
|
-
enumerable: !0,
|
|
132
|
-
configurable: !0,
|
|
133
|
-
writable: !0,
|
|
134
|
-
value: "Cursor.NegativeOffsetError"
|
|
135
|
-
});
|
|
136
|
-
}
|
|
137
|
-
}
|
|
138
|
-
class r extends e {
|
|
139
|
-
constructor({ length: i, position: s }) {
|
|
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
|
-
});
|
|
146
|
-
}
|
|
147
|
-
}
|
|
148
|
-
class h extends e {
|
|
149
|
-
constructor({ count: i, limit: s }) {
|
|
150
|
-
super(`Recursive read limit of \`${s}\` exceeded (recursive read count: \`${i}\`).`), Object.defineProperty(this, "name", {
|
|
151
|
-
enumerable: !0,
|
|
152
|
-
configurable: !0,
|
|
153
|
-
writable: !0,
|
|
154
|
-
value: "Cursor.RecursiveReadLimitExceededError"
|
|
155
|
-
});
|
|
156
|
-
}
|
|
157
|
-
}
|
|
1
|
+
import { LruMap as c } from "./index381.js";
|
|
2
|
+
const e = {
|
|
3
|
+
checksum: /* @__PURE__ */ new c(8192)
|
|
4
|
+
}, m = e.checksum;
|
|
158
5
|
export {
|
|
159
|
-
|
|
160
|
-
r as PositionOutOfBoundsError,
|
|
161
|
-
h as RecursiveReadLimitExceededError,
|
|
162
|
-
u as create
|
|
6
|
+
m as checksum
|
|
163
7
|
};
|
package/dist/index354.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("./index382.cjs");function r(){return e.version}exports.getVersion=r;
|