@gardenfi/utils 2.1.3-beta.2 → 2.1.3-beta.21
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/index107.cjs +1 -1
- package/dist/index107.js +75 -46
- package/dist/index108.cjs +1 -1
- package/dist/index108.js +4 -4
- package/dist/index110.cjs +1 -1
- package/dist/index110.js +1 -1
- package/dist/index111.cjs +1 -1
- package/dist/index111.js +1 -1
- package/dist/index112.cjs +1 -1
- package/dist/index112.js +1 -1
- package/dist/index113.cjs +1 -1
- package/dist/index113.js +1 -1
- package/dist/index125.cjs +1 -1
- package/dist/index125.js +1 -1
- package/dist/index166.cjs +1 -1
- package/dist/index166.js +36 -34
- package/dist/index192.cjs +1 -1
- package/dist/index192.js +27 -25
- package/dist/index203.cjs +1 -1
- package/dist/index203.js +16 -16
- package/dist/index22.cjs +1 -1
- package/dist/index22.js +6 -6
- package/dist/index222.cjs +1 -1
- package/dist/index222.js +2 -2
- package/dist/index225.cjs +1 -1
- package/dist/index225.js +43 -43
- package/dist/index226.cjs +1 -1
- package/dist/index226.js +3 -113
- package/dist/index228.cjs +1 -1
- package/dist/index228.js +14 -14
- package/dist/index230.cjs +1 -1
- package/dist/index230.js +10 -25
- package/dist/index231.cjs +1 -1
- package/dist/index231.js +16 -13
- package/dist/index232.cjs +1 -1
- package/dist/index232.js +21 -14
- package/dist/index233.cjs +1 -1
- package/dist/index233.js +30 -5
- package/dist/index234.cjs +1 -1
- package/dist/index234.js +2 -14
- package/dist/index235.cjs +1 -1
- package/dist/index235.js +12 -9
- package/dist/index236.cjs +1 -1
- package/dist/index236.js +12 -16
- package/dist/index237.cjs +1 -1
- package/dist/index237.js +47 -10
- package/dist/index238.cjs +1 -1
- package/dist/index238.js +10 -15
- package/dist/index239.cjs +1 -1
- package/dist/index239.js +7 -22
- package/dist/index240.cjs +1 -1
- package/dist/index240.js +9 -30
- package/dist/index241.cjs +1 -1
- package/dist/index241.js +14 -2
- package/dist/index242.cjs +1 -1
- package/dist/index242.js +14 -13
- package/dist/index243.cjs +1 -1
- package/dist/index243.js +9 -12
- package/dist/index244.cjs +1 -1
- package/dist/index244.js +24 -47
- package/dist/index245.cjs +1 -1
- package/dist/index245.js +12 -11
- package/dist/index246.cjs +1 -1
- package/dist/index246.js +24 -7
- package/dist/index247.cjs +1 -1
- package/dist/index247.js +12 -8
- package/dist/index248.cjs +1 -1
- package/dist/index248.js +15 -13
- package/dist/index249.cjs +2 -1
- package/dist/index249.js +21 -11
- package/dist/index250.cjs +1 -1
- package/dist/index250.js +52 -9
- package/dist/index251.cjs +1 -1
- package/dist/index251.js +25 -24
- package/dist/index252.cjs +1 -1
- package/dist/index252.js +13 -12
- package/dist/index253.cjs +1 -1
- package/dist/index253.js +15 -24
- package/dist/index254.cjs +1 -2
- package/dist/index254.js +5 -24
- package/dist/index255.cjs +1 -1
- package/dist/index255.js +12 -12
- package/dist/index256.cjs +1 -1
- package/dist/index256.js +10 -15
- package/dist/index257.cjs +1 -1
- package/dist/index257.js +16 -52
- package/dist/index266.cjs +1 -1
- package/dist/index266.js +1 -1
- package/dist/index277.cjs +1 -1
- package/dist/index277.js +103 -16
- package/dist/index278.cjs +1 -1
- package/dist/index278.js +5 -222
- package/dist/index279.cjs +1 -1
- package/dist/index279.js +224 -6
- package/dist/index28.cjs +1 -1
- package/dist/index28.js +2 -2
- package/dist/index280.cjs +1 -1
- package/dist/index280.js +7 -7
- package/dist/index281.cjs +1 -1
- package/dist/index281.js +7 -27
- package/dist/index282.cjs +1 -1
- package/dist/index282.js +26 -34
- package/dist/index283.cjs +1 -1
- package/dist/index283.js +13 -12
- package/dist/index284.cjs +1 -1
- package/dist/index284.js +124 -48
- package/dist/index285.cjs +1 -1
- package/dist/index285.js +3 -67
- package/dist/index286.cjs +1 -1
- package/dist/index286.js +137 -37
- package/dist/index287.cjs +1 -1
- package/dist/index287.js +156 -2
- package/dist/index288.cjs +1 -1
- package/dist/index288.js +8 -205
- package/dist/index289.cjs +1 -1
- package/dist/index289.js +113 -3
- package/dist/index290.cjs +2 -1
- package/dist/index290.js +122 -128
- package/dist/index291.cjs +1 -1
- package/dist/index291.js +137 -153
- package/dist/index292.cjs +1 -1
- package/dist/index292.js +42 -9
- package/dist/index293.cjs +1 -1
- package/dist/index293.js +72 -107
- package/dist/index294.cjs +1 -2
- package/dist/index294.js +2 -135
- package/dist/index295.cjs +1 -1
- package/dist/index295.js +68 -11
- package/dist/index296.cjs +1 -1
- package/dist/index296.js +696 -17
- package/dist/index297.cjs +1 -1
- package/dist/index297.js +200 -67
- package/dist/index298.cjs +2 -1
- package/dist/index298.js +63 -639
- package/dist/index299.cjs +1 -1
- package/dist/index299.js +4 -172
- package/dist/index30.cjs +1 -1
- package/dist/index30.js +1 -1
- package/dist/index300.cjs +1 -2
- package/dist/index300.js +39 -65
- package/dist/index301.cjs +1 -1
- package/dist/index301.js +7 -4
- package/dist/index302.cjs +1 -1
- package/dist/index302.js +60 -38
- package/dist/index303.cjs +1 -1
- package/dist/index303.js +77 -7
- package/dist/index304.cjs +1 -1
- package/dist/index304.js +4 -63
- package/dist/index305.cjs +1 -1
- package/dist/index305.js +181 -64
- package/dist/index306.cjs +1 -1
- package/dist/index306.js +12 -4
- package/dist/index307.cjs +1 -1
- package/dist/index307.js +19 -194
- package/dist/index308.cjs +1 -1
- package/dist/index308.js +3 -3
- package/dist/index310.cjs +1 -1
- package/dist/index310.js +1 -1
- package/dist/index311.cjs +1 -1
- package/dist/index311.js +5 -105
- package/dist/index312.cjs +1 -1
- package/dist/index312.js +2 -5
- package/dist/index313.cjs +1 -1
- package/dist/index313.js +22 -2
- package/dist/index35.cjs +1 -1
- package/dist/index35.js +41 -41
- package/dist/index36.cjs +1 -1
- package/dist/index36.js +1 -1
- package/dist/index39.cjs +1 -1
- package/dist/index39.js +29 -24
- package/dist/index43.cjs +1 -1
- package/dist/index43.js +40 -21
- package/dist/index44.cjs +1 -1
- package/dist/index44.js +24 -24
- package/dist/index53.cjs +1 -1
- package/dist/index53.js +2 -2
- package/dist/index54.cjs +1 -1
- package/dist/index54.js +1 -1
- package/dist/index55.cjs +1 -1
- package/dist/index55.js +2 -2
- package/dist/index56.cjs +1 -1
- package/dist/index56.js +1 -1
- package/dist/index57.cjs +1 -1
- package/dist/index57.js +2 -2
- package/dist/index58.cjs +1 -1
- package/dist/index58.js +98 -97
- package/dist/index59.cjs +1 -1
- package/dist/index59.js +2 -2
- package/dist/index60.cjs +1 -1
- package/dist/index60.js +1 -1
- package/dist/index61.cjs +1 -1
- package/dist/index61.js +1 -1
- package/dist/index62.cjs +1 -1
- package/dist/index62.js +1 -1
- package/dist/index64.cjs +1 -1
- package/dist/index64.js +4 -4
- package/dist/index73.cjs +1 -1
- package/dist/index73.js +1 -1
- package/dist/index74.cjs +1 -1
- package/dist/index74.js +1 -1
- package/dist/index79.cjs +1 -1
- package/dist/index79.js +1 -1
- package/dist/index84.cjs +1 -1
- package/dist/index84.js +53 -51
- package/dist/index85.cjs +1 -1
- package/dist/index85.js +56 -55
- package/dist/index86.cjs +1 -1
- package/dist/index86.js +55 -59
- package/dist/index88.cjs +1 -1
- package/dist/index88.js +1 -1
- package/dist/index89.cjs +1 -1
- package/dist/index89.js +1 -1
- package/dist/index90.cjs +1 -1
- package/dist/index90.js +44 -42
- package/dist/index91.cjs +1 -1
- package/dist/index91.js +41 -41
- package/dist/index92.cjs +1 -1
- package/dist/index92.js +35 -34
- package/dist/index93.cjs +1 -1
- package/dist/index93.js +28 -28
- package/dist/index94.cjs +1 -1
- package/dist/index94.js +26 -26
- package/dist/index95.cjs +1 -1
- package/dist/index95.js +1 -1
- package/package.json +1 -1
- package/dist/index314.cjs +0 -1
- package/dist/index314.js +0 -22
- package/dist/index315.cjs +0 -1
- package/dist/index315.js +0 -74
- package/dist/index316.cjs +0 -1
- package/dist/index316.js +0 -24
package/dist/index299.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 n="#__bigint";function e(i,f,r){return JSON.stringify(i,(g,t)=>typeof t=="bigint"?t.toString()+n:t,r)}exports.stringify=e;
|
package/dist/index299.js
CHANGED
|
@@ -1,175 +1,7 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
const F = BigInt(0), b = BigInt(1);
|
|
5
|
-
function h(e, s) {
|
|
6
|
-
const t = s.negate();
|
|
7
|
-
return e ? t : s;
|
|
8
|
-
}
|
|
9
|
-
function B(e, s) {
|
|
10
|
-
if (!Number.isSafeInteger(e) || e <= 0 || e > s)
|
|
11
|
-
throw new Error("invalid window size, expected [1.." + s + "], got W=" + e);
|
|
12
|
-
}
|
|
13
|
-
function m(e, s) {
|
|
14
|
-
B(e, s);
|
|
15
|
-
const t = Math.ceil(s / e) + 1, n = 2 ** (e - 1), i = 2 ** e, o = E(e), r = BigInt(e);
|
|
16
|
-
return { windows: t, windowSize: n, mask: o, maxNumber: i, shiftBy: r };
|
|
17
|
-
}
|
|
18
|
-
function A(e, s, t) {
|
|
19
|
-
const { windowSize: n, mask: i, maxNumber: o, shiftBy: r } = t;
|
|
20
|
-
let f = Number(e & i), a = e >> r;
|
|
21
|
-
f > n && (f -= o, a += b);
|
|
22
|
-
const w = s * n, c = w + Math.abs(f) - 1, l = f === 0, u = f < 0, d = s % 2 !== 0;
|
|
23
|
-
return { nextN: a, offset: c, isZero: l, isNeg: u, isNegF: d, offsetF: w };
|
|
24
|
-
}
|
|
25
|
-
function O(e, s) {
|
|
26
|
-
if (!Array.isArray(e))
|
|
27
|
-
throw new Error("array expected");
|
|
28
|
-
e.forEach((t, n) => {
|
|
29
|
-
if (!(t instanceof s))
|
|
30
|
-
throw new Error("invalid point at index " + n);
|
|
31
|
-
});
|
|
32
|
-
}
|
|
33
|
-
function k(e, s) {
|
|
34
|
-
if (!Array.isArray(e))
|
|
35
|
-
throw new Error("array of scalars expected");
|
|
36
|
-
e.forEach((t, n) => {
|
|
37
|
-
if (!s.isValid(t))
|
|
38
|
-
throw new Error("invalid scalar at index " + n);
|
|
39
|
-
});
|
|
40
|
-
}
|
|
41
|
-
const p = /* @__PURE__ */ new WeakMap(), x = /* @__PURE__ */ new WeakMap();
|
|
42
|
-
function N(e) {
|
|
43
|
-
return x.get(e) || 1;
|
|
44
|
-
}
|
|
45
|
-
function R(e, s) {
|
|
46
|
-
return {
|
|
47
|
-
constTimeNegate: h,
|
|
48
|
-
hasPrecomputes(t) {
|
|
49
|
-
return N(t) !== 1;
|
|
50
|
-
},
|
|
51
|
-
// non-const time multiplication ladder
|
|
52
|
-
unsafeLadder(t, n, i = e.ZERO) {
|
|
53
|
-
let o = t;
|
|
54
|
-
for (; n > F; )
|
|
55
|
-
n & b && (i = i.add(o)), o = o.double(), n >>= b;
|
|
56
|
-
return i;
|
|
57
|
-
},
|
|
58
|
-
/**
|
|
59
|
-
* Creates a wNAF precomputation window. Used for caching.
|
|
60
|
-
* Default window size is set by `utils.precompute()` and is equal to 8.
|
|
61
|
-
* Number of precomputed points depends on the curve size:
|
|
62
|
-
* 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
|
|
63
|
-
* - 𝑊 is the window size
|
|
64
|
-
* - 𝑛 is the bitlength of the curve order.
|
|
65
|
-
* For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
|
|
66
|
-
* @param elm Point instance
|
|
67
|
-
* @param W window size
|
|
68
|
-
* @returns precomputed point tables flattened to a single array
|
|
69
|
-
*/
|
|
70
|
-
precomputeWindow(t, n) {
|
|
71
|
-
const { windows: i, windowSize: o } = m(n, s), r = [];
|
|
72
|
-
let f = t, a = f;
|
|
73
|
-
for (let w = 0; w < i; w++) {
|
|
74
|
-
a = f, r.push(a);
|
|
75
|
-
for (let c = 1; c < o; c++)
|
|
76
|
-
a = a.add(f), r.push(a);
|
|
77
|
-
f = a.double();
|
|
78
|
-
}
|
|
79
|
-
return r;
|
|
80
|
-
},
|
|
81
|
-
/**
|
|
82
|
-
* Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
|
|
83
|
-
* @param W window size
|
|
84
|
-
* @param precomputes precomputed tables
|
|
85
|
-
* @param n scalar (we don't check here, but should be less than curve order)
|
|
86
|
-
* @returns real and fake (for const-time) points
|
|
87
|
-
*/
|
|
88
|
-
wNAF(t, n, i) {
|
|
89
|
-
let o = e.ZERO, r = e.BASE;
|
|
90
|
-
const f = m(t, s);
|
|
91
|
-
for (let a = 0; a < f.windows; a++) {
|
|
92
|
-
const { nextN: w, offset: c, isZero: l, isNeg: u, isNegF: d, offsetF: g } = A(i, a, f);
|
|
93
|
-
i = w, l ? r = r.add(h(d, n[g])) : o = o.add(h(u, n[c]));
|
|
94
|
-
}
|
|
95
|
-
return { p: o, f: r };
|
|
96
|
-
},
|
|
97
|
-
/**
|
|
98
|
-
* Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
|
|
99
|
-
* @param W window size
|
|
100
|
-
* @param precomputes precomputed tables
|
|
101
|
-
* @param n scalar (we don't check here, but should be less than curve order)
|
|
102
|
-
* @param acc accumulator point to add result of multiplication
|
|
103
|
-
* @returns point
|
|
104
|
-
*/
|
|
105
|
-
wNAFUnsafe(t, n, i, o = e.ZERO) {
|
|
106
|
-
const r = m(t, s);
|
|
107
|
-
for (let f = 0; f < r.windows && i !== F; f++) {
|
|
108
|
-
const { nextN: a, offset: w, isZero: c, isNeg: l } = A(i, f, r);
|
|
109
|
-
if (i = a, !c) {
|
|
110
|
-
const u = n[w];
|
|
111
|
-
o = o.add(l ? u.negate() : u);
|
|
112
|
-
}
|
|
113
|
-
}
|
|
114
|
-
return o;
|
|
115
|
-
},
|
|
116
|
-
getPrecomputes(t, n, i) {
|
|
117
|
-
let o = p.get(n);
|
|
118
|
-
return o || (o = this.precomputeWindow(n, t), t !== 1 && p.set(n, i(o))), o;
|
|
119
|
-
},
|
|
120
|
-
wNAFCached(t, n, i) {
|
|
121
|
-
const o = N(t);
|
|
122
|
-
return this.wNAF(o, this.getPrecomputes(o, t, i), n);
|
|
123
|
-
},
|
|
124
|
-
wNAFCachedUnsafe(t, n, i, o) {
|
|
125
|
-
const r = N(t);
|
|
126
|
-
return r === 1 ? this.unsafeLadder(t, n, o) : this.wNAFUnsafe(r, this.getPrecomputes(r, t, i), n, o);
|
|
127
|
-
},
|
|
128
|
-
// We calculate precomputes for elliptic curve point multiplication
|
|
129
|
-
// using windowed method. This specifies window size and
|
|
130
|
-
// stores precomputed values. Usually only base point would be precomputed.
|
|
131
|
-
setWindowSize(t, n) {
|
|
132
|
-
B(n, s), x.set(t, n), p.delete(t);
|
|
133
|
-
}
|
|
134
|
-
};
|
|
135
|
-
}
|
|
136
|
-
function j(e, s, t, n) {
|
|
137
|
-
if (O(t, e), k(n, s), t.length !== n.length)
|
|
138
|
-
throw new Error("arrays of points and scalars must have equal length");
|
|
139
|
-
const i = e.ZERO, o = z(BigInt(t.length)), r = o > 12 ? o - 3 : o > 4 ? o - 2 : o ? 2 : 1, f = E(r), a = new Array(Number(f) + 1).fill(i), w = Math.floor((s.BITS - 1) / r) * r;
|
|
140
|
-
let c = i;
|
|
141
|
-
for (let l = w; l >= 0; l -= r) {
|
|
142
|
-
a.fill(i);
|
|
143
|
-
for (let d = 0; d < n.length; d++) {
|
|
144
|
-
const g = n[d], S = Number(g >> BigInt(l) & f);
|
|
145
|
-
a[S] = a[S].add(t[d]);
|
|
146
|
-
}
|
|
147
|
-
let u = i;
|
|
148
|
-
for (let d = a.length - 1, g = i; d > 0; d--)
|
|
149
|
-
g = g.add(a[d]), u = u.add(g);
|
|
150
|
-
if (c = c.add(u), l !== 0)
|
|
151
|
-
for (let d = 0; d < r; d++)
|
|
152
|
-
c = c.double();
|
|
153
|
-
}
|
|
154
|
-
return c;
|
|
155
|
-
}
|
|
156
|
-
function v(e) {
|
|
157
|
-
return y(e.Fp), M(e, {
|
|
158
|
-
n: "bigint",
|
|
159
|
-
h: "bigint",
|
|
160
|
-
Gx: "field",
|
|
161
|
-
Gy: "field"
|
|
162
|
-
}, {
|
|
163
|
-
nBitLength: "isSafeInteger",
|
|
164
|
-
nByteLength: "isSafeInteger"
|
|
165
|
-
}), Object.freeze({
|
|
166
|
-
...I(e.n, e.nBitLength),
|
|
167
|
-
...e,
|
|
168
|
-
p: e.Fp.ORDER
|
|
169
|
-
});
|
|
1
|
+
const r = "#__bigint";
|
|
2
|
+
function g(i, f, n) {
|
|
3
|
+
return JSON.stringify(i, (e, t) => typeof t == "bigint" ? t.toString() + r : t, n);
|
|
170
4
|
}
|
|
171
5
|
export {
|
|
172
|
-
|
|
173
|
-
v as validateBasic,
|
|
174
|
-
R as wNAF
|
|
6
|
+
g as stringify
|
|
175
7
|
};
|
package/dist/index30.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const m=require("./index176.cjs"),s=require("./index150.cjs"),q=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const m=require("./index176.cjs"),s=require("./index150.cjs"),q=require("./index239.cjs");async function b(r,a){const{address:u,abi:n,args:c,eventName:e,fromBlock:t,strict:l,toBlock:o}=a,d=q.createFilterRequestScope(r,{method:"eth_newFilter"}),p=e?m.encodeEventTopics({abi:n,args:c,eventName:e}):void 0,i=await r.request({method:"eth_newFilter",params:[{address:u,fromBlock:typeof t=="bigint"?s.numberToHex(t):t,toBlock:typeof o=="bigint"?s.numberToHex(o):o,topics:p}]});return{abi:n,args:c,eventName:e,id:i,request:d(i),strict:!!l,type:"event"}}exports.createContractEventFilter=b;
|
package/dist/index30.js
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import { encodeEventTopics as l } from "./index176.js";
|
|
2
2
|
import { numberToHex as s } from "./index150.js";
|
|
3
|
-
import { createFilterRequestScope as u } from "./
|
|
3
|
+
import { createFilterRequestScope as u } from "./index239.js";
|
|
4
4
|
async function h(r, a) {
|
|
5
5
|
const { address: m, abi: n, args: i, eventName: e, fromBlock: t, strict: p, toBlock: o } = a, f = u(r, {
|
|
6
6
|
method: "eth_newFilter"
|
package/dist/index300.cjs
CHANGED
|
@@ -1,2 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
2
|
-
`);super(n,e.cause?{cause:e.cause}:void 0),Object.defineProperty(this,"details",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"docs",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"docsPath",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"shortMessage",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"cause",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"BaseError"}),Object.defineProperty(this,"version",{enumerable:!0,configurable:!0,writable:!0,value:`ox@${d.getVersion()}`}),this.cause=e.cause,this.details=u,this.docs=i,this.docsPath=a,this.shortMessage=r}walk(r){return l(this,r)}}function l(t,r){return r!=null&&r(t)?t:t&&typeof t=="object"&&"cause"in t&&t.cause?l(t.cause,r):r?null:t}exports.BaseError=c;
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index287.cjs");function n(t,e){if(i.size(t)>e)throw new i.SizeOverflowError({givenSize:i.size(t),maxSize:e})}function o(t,e){if(typeof e=="number"&&e>0&&e>i.size(t)-1)throw new i.SliceOffsetOutOfBoundsError({offset:e,position:"start",size:i.size(t)})}function z(t,e,r){if(typeof e=="number"&&typeof r=="number"&&i.size(t)!==r-e)throw new i.SliceOffsetOutOfBoundsError({offset:r,position:"end",size:i.size(t)})}function a(t,e={}){const{dir:r,size:s=32}=e;if(s===0)return t;const f=t.replace("0x","");if(f.length>s*2)throw new i.SizeExceedsPaddingSizeError({size:Math.ceil(f.length/2),targetSize:s,type:"Hex"});return`0x${f[r==="right"?"padEnd":"padStart"](s*2,"0")}`}exports.assertEndOffset=z;exports.assertSize=n;exports.assertStartOffset=o;exports.pad=a;
|
package/dist/index300.js
CHANGED
|
@@ -1,69 +1,43 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
return e.cause.details;
|
|
9
|
-
if (e.cause.shortMessage)
|
|
10
|
-
return e.cause.shortMessage;
|
|
11
|
-
}
|
|
12
|
-
return (s = e.cause) != null && s.message ? e.cause.message : e.details;
|
|
13
|
-
})(), a = e.cause instanceof c && e.cause.docsPath || e.docsPath, i = `https://oxlib.sh${a ?? ""}`, d = [
|
|
14
|
-
t || "An error occurred.",
|
|
15
|
-
...e.metaMessages ? ["", ...e.metaMessages] : [],
|
|
16
|
-
...u || a ? [
|
|
17
|
-
"",
|
|
18
|
-
u ? `Details: ${u}` : void 0,
|
|
19
|
-
a ? `See: ${i}` : void 0
|
|
20
|
-
] : []
|
|
21
|
-
].filter((s) => typeof s == "string").join(`
|
|
22
|
-
`);
|
|
23
|
-
super(d, e.cause ? { cause: e.cause } : void 0), Object.defineProperty(this, "details", {
|
|
24
|
-
enumerable: !0,
|
|
25
|
-
configurable: !0,
|
|
26
|
-
writable: !0,
|
|
27
|
-
value: void 0
|
|
28
|
-
}), Object.defineProperty(this, "docs", {
|
|
29
|
-
enumerable: !0,
|
|
30
|
-
configurable: !0,
|
|
31
|
-
writable: !0,
|
|
32
|
-
value: void 0
|
|
33
|
-
}), Object.defineProperty(this, "docsPath", {
|
|
34
|
-
enumerable: !0,
|
|
35
|
-
configurable: !0,
|
|
36
|
-
writable: !0,
|
|
37
|
-
value: void 0
|
|
38
|
-
}), Object.defineProperty(this, "shortMessage", {
|
|
39
|
-
enumerable: !0,
|
|
40
|
-
configurable: !0,
|
|
41
|
-
writable: !0,
|
|
42
|
-
value: void 0
|
|
43
|
-
}), Object.defineProperty(this, "cause", {
|
|
44
|
-
enumerable: !0,
|
|
45
|
-
configurable: !0,
|
|
46
|
-
writable: !0,
|
|
47
|
-
value: void 0
|
|
48
|
-
}), Object.defineProperty(this, "name", {
|
|
49
|
-
enumerable: !0,
|
|
50
|
-
configurable: !0,
|
|
51
|
-
writable: !0,
|
|
52
|
-
value: "BaseError"
|
|
53
|
-
}), Object.defineProperty(this, "version", {
|
|
54
|
-
enumerable: !0,
|
|
55
|
-
configurable: !0,
|
|
56
|
-
writable: !0,
|
|
57
|
-
value: `ox@${n()}`
|
|
58
|
-
}), this.cause = e.cause, this.details = u, this.docs = i, this.docsPath = a, this.shortMessage = t;
|
|
59
|
-
}
|
|
60
|
-
walk(t) {
|
|
61
|
-
return l(this, t);
|
|
62
|
-
}
|
|
1
|
+
import { SizeExceedsPaddingSizeError as s, size as i, SliceOffsetOutOfBoundsError as f, SizeOverflowError as p } from "./index287.js";
|
|
2
|
+
function c(t, e) {
|
|
3
|
+
if (i(t) > e)
|
|
4
|
+
throw new p({
|
|
5
|
+
givenSize: i(t),
|
|
6
|
+
maxSize: e
|
|
7
|
+
});
|
|
63
8
|
}
|
|
64
|
-
function
|
|
65
|
-
|
|
9
|
+
function S(t, e) {
|
|
10
|
+
if (typeof e == "number" && e > 0 && e > i(t) - 1)
|
|
11
|
+
throw new f({
|
|
12
|
+
offset: e,
|
|
13
|
+
position: "start",
|
|
14
|
+
size: i(t)
|
|
15
|
+
});
|
|
16
|
+
}
|
|
17
|
+
function d(t, e, r) {
|
|
18
|
+
if (typeof e == "number" && typeof r == "number" && i(t) !== r - e)
|
|
19
|
+
throw new f({
|
|
20
|
+
offset: r,
|
|
21
|
+
position: "end",
|
|
22
|
+
size: i(t)
|
|
23
|
+
});
|
|
24
|
+
}
|
|
25
|
+
function u(t, e = {}) {
|
|
26
|
+
const { dir: r, size: n = 32 } = e;
|
|
27
|
+
if (n === 0)
|
|
28
|
+
return t;
|
|
29
|
+
const o = t.replace("0x", "");
|
|
30
|
+
if (o.length > n * 2)
|
|
31
|
+
throw new s({
|
|
32
|
+
size: Math.ceil(o.length / 2),
|
|
33
|
+
targetSize: n,
|
|
34
|
+
type: "Hex"
|
|
35
|
+
});
|
|
36
|
+
return `0x${o[r === "right" ? "padEnd" : "padStart"](n * 2, "0")}`;
|
|
66
37
|
}
|
|
67
38
|
export {
|
|
68
|
-
|
|
39
|
+
d as assertEndOffset,
|
|
40
|
+
c as assertSize,
|
|
41
|
+
S as assertStartOffset,
|
|
42
|
+
u as pad
|
|
69
43
|
};
|
package/dist/index301.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n="
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index225.cjs"),o=require("./index308.cjs"),n=require("./index287.cjs");function i(e,r={}){const{as:s=typeof e=="string"?"Hex":"Bytes"}=r,t=c.keccak_256(o.from(e));return s==="Bytes"?t:n.fromBytes(t)}exports.keccak256=i;
|
package/dist/index301.js
CHANGED
|
@@ -1,7 +1,10 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
1
|
+
import { keccak_256 as f } from "./index225.js";
|
|
2
|
+
import { from as m } from "./index308.js";
|
|
3
|
+
import { fromBytes as s } from "./index287.js";
|
|
4
|
+
function p(t, o = {}) {
|
|
5
|
+
const { as: e = typeof t == "string" ? "Hex" : "Bytes" } = o, r = f(m(t));
|
|
6
|
+
return e === "Bytes" ? r : s(r);
|
|
4
7
|
}
|
|
5
8
|
export {
|
|
6
|
-
|
|
9
|
+
p as keccak256
|
|
7
10
|
};
|
package/dist/index302.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("./index303.cjs"),a=require("./index298.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/index302.js
CHANGED
|
@@ -1,43 +1,65 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
1
|
+
import { validate as c } from "./index303.js";
|
|
2
|
+
import { BaseError as f } from "./index298.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;
|
|
22
|
+
}
|
|
23
|
+
}
|
|
24
|
+
if (!o)
|
|
25
|
+
throw new f("Unable to normalize signature.");
|
|
26
|
+
return n;
|
|
8
27
|
}
|
|
9
|
-
function
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
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
|
+
}
|
|
16
46
|
}
|
|
17
|
-
function
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
if (o.length > n * 2)
|
|
31
|
-
throw new s({
|
|
32
|
-
size: Math.ceil(o.length / 2),
|
|
33
|
-
targetSize: n,
|
|
34
|
-
type: "Hex"
|
|
35
|
-
});
|
|
36
|
-
return `0x${o[r === "right" ? "padEnd" : "padStart"](n * 2, "0")}`;
|
|
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
|
+
}
|
|
37
60
|
}
|
|
38
61
|
export {
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
u as pad
|
|
62
|
+
a as getAmbiguousTypes,
|
|
63
|
+
l as isArgOfType,
|
|
64
|
+
y as normalizeSignature
|
|
43
65
|
};
|
package/dist/index303.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index311.cjs"),o=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index308.cjs"),c=require("./index311.cjs"),o=require("./index298.cjs"),m=require("./index301.cjs"),b=/^0x[a-fA-F0-9]{40}$/;function i(e,t={}){const{strict:s=!0}=t;if(!b.test(e))throw new a({address:e,cause:new l});if(s){if(e.toLowerCase()===e)return;if(d(e)!==e)throw new a({address:e,cause:new h})}}function d(e){if(c.checksum.has(e))return c.checksum.get(e);i(e,{strict:!1});const t=e.substring(2).toLowerCase(),s=m.keccak256(f.fromString(t),{as:"Bytes"}),n=t.split("");for(let r=0;r<40;r+=2)s[r>>1]>>4>=8&&n[r]&&(n[r]=n[r].toUpperCase()),(s[r>>1]&15)>=8&&n[r+1]&&(n[r+1]=n[r+1].toUpperCase());const u=`0x${n.join("")}`;return c.checksum.set(e,u),u}function p(e,t={}){const{strict:s=!0}=t??{};try{return i(e,{strict:s}),!0}catch{return!1}}class a extends o.BaseError{constructor({address:t,cause:s}){super(`Address "${t}" is invalid.`,{cause:s}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidAddressError"})}}class l extends o.BaseError{constructor(){super("Address is not a 20 byte (40 hexadecimal character) value."),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidInputError"})}}class h extends o.BaseError{constructor(){super("Address does not match its checksum counterpart."),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidChecksumError"})}}exports.InvalidAddressError=a;exports.InvalidChecksumError=h;exports.InvalidInputError=l;exports.assert=i;exports.checksum=d;exports.validate=p;
|
package/dist/index303.js
CHANGED
|
@@ -1,10 +1,80 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import {
|
|
3
|
-
import {
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
1
|
+
import { fromString as d } from "./index308.js";
|
|
2
|
+
import { checksum as o } from "./index311.js";
|
|
3
|
+
import { BaseError as c } from "./index298.js";
|
|
4
|
+
import { keccak256 as f } from "./index301.js";
|
|
5
|
+
const l = /^0x[a-fA-F0-9]{40}$/;
|
|
6
|
+
function u(r, t = {}) {
|
|
7
|
+
const { strict: s = !0 } = t;
|
|
8
|
+
if (!l.test(r))
|
|
9
|
+
throw new i({
|
|
10
|
+
address: r,
|
|
11
|
+
cause: new h()
|
|
12
|
+
});
|
|
13
|
+
if (s) {
|
|
14
|
+
if (r.toLowerCase() === r)
|
|
15
|
+
return;
|
|
16
|
+
if (m(r) !== r)
|
|
17
|
+
throw new i({
|
|
18
|
+
address: r,
|
|
19
|
+
cause: new p()
|
|
20
|
+
});
|
|
21
|
+
}
|
|
22
|
+
}
|
|
23
|
+
function m(r) {
|
|
24
|
+
if (o.has(r))
|
|
25
|
+
return o.get(r);
|
|
26
|
+
u(r, { strict: !1 });
|
|
27
|
+
const t = r.substring(2).toLowerCase(), s = f(d(t), { as: "Bytes" }), n = t.split("");
|
|
28
|
+
for (let e = 0; e < 40; e += 2)
|
|
29
|
+
s[e >> 1] >> 4 >= 8 && n[e] && (n[e] = n[e].toUpperCase()), (s[e >> 1] & 15) >= 8 && n[e + 1] && (n[e + 1] = n[e + 1].toUpperCase());
|
|
30
|
+
const a = `0x${n.join("")}`;
|
|
31
|
+
return o.set(r, a), a;
|
|
32
|
+
}
|
|
33
|
+
function k(r, t = {}) {
|
|
34
|
+
const { strict: s = !0 } = t ?? {};
|
|
35
|
+
try {
|
|
36
|
+
return u(r, { strict: s }), !0;
|
|
37
|
+
} catch {
|
|
38
|
+
return !1;
|
|
39
|
+
}
|
|
40
|
+
}
|
|
41
|
+
class i extends c {
|
|
42
|
+
constructor({ address: t, cause: s }) {
|
|
43
|
+
super(`Address "${t}" is invalid.`, {
|
|
44
|
+
cause: s
|
|
45
|
+
}), Object.defineProperty(this, "name", {
|
|
46
|
+
enumerable: !0,
|
|
47
|
+
configurable: !0,
|
|
48
|
+
writable: !0,
|
|
49
|
+
value: "Address.InvalidAddressError"
|
|
50
|
+
});
|
|
51
|
+
}
|
|
52
|
+
}
|
|
53
|
+
class h extends c {
|
|
54
|
+
constructor() {
|
|
55
|
+
super("Address is not a 20 byte (40 hexadecimal character) value."), Object.defineProperty(this, "name", {
|
|
56
|
+
enumerable: !0,
|
|
57
|
+
configurable: !0,
|
|
58
|
+
writable: !0,
|
|
59
|
+
value: "Address.InvalidInputError"
|
|
60
|
+
});
|
|
61
|
+
}
|
|
62
|
+
}
|
|
63
|
+
class p extends c {
|
|
64
|
+
constructor() {
|
|
65
|
+
super("Address does not match its checksum counterpart."), Object.defineProperty(this, "name", {
|
|
66
|
+
enumerable: !0,
|
|
67
|
+
configurable: !0,
|
|
68
|
+
writable: !0,
|
|
69
|
+
value: "Address.InvalidChecksumError"
|
|
70
|
+
});
|
|
71
|
+
}
|
|
7
72
|
}
|
|
8
73
|
export {
|
|
9
|
-
|
|
74
|
+
i as InvalidAddressError,
|
|
75
|
+
p as InvalidChecksumError,
|
|
76
|
+
h as InvalidInputError,
|
|
77
|
+
u as assert,
|
|
78
|
+
m as checksum,
|
|
79
|
+
k as validate
|
|
10
80
|
};
|
package/dist/index304.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=/^(.*)\[([0-9]*)\]$/,t=/^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/,g=/^(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)?$/;exports.arrayRegex=e;exports.bytesRegex=t;exports.integerRegex=g;
|
package/dist/index304.js
CHANGED
|
@@ -1,65 +1,6 @@
|
|
|
1
|
-
|
|
2
|
-
import { BaseError as f } from "./index300.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;
|
|
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
|
+
const e = /^(.*)\[([0-9]*)\]$/, t = /^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/, 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)?$/;
|
|
61
2
|
export {
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
3
|
+
e as arrayRegex,
|
|
4
|
+
t as bytesRegex,
|
|
5
|
+
n as integerRegex
|
|
65
6
|
};
|