@gardenfi/utils 2.4.5-beta.2 → 2.4.5-beta.3
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/index10.cjs +1 -1
- package/dist/index10.js +3 -3
- package/dist/index100.cjs +1 -1
- package/dist/index100.js +2 -2
- package/dist/index121.cjs +1 -1
- package/dist/index121.js +1 -1
- package/dist/index16.cjs +1 -1
- package/dist/index16.js +3 -3
- package/dist/index18.cjs +1 -1
- package/dist/index18.js +2 -2
- package/dist/index197.cjs +1 -1
- package/dist/index197.js +3 -3
- package/dist/index226.cjs +1 -1
- package/dist/index226.js +2 -2
- package/dist/index229.cjs +1 -1
- package/dist/index229.js +2 -2
- package/dist/index230.cjs +1 -1
- package/dist/index230.js +1 -1
- package/dist/index235.cjs +1 -1
- package/dist/index235.js +1 -1
- package/dist/index236.cjs +1 -1
- package/dist/index236.js +1 -1
- package/dist/index237.cjs +1 -1
- package/dist/index237.js +2 -2
- package/dist/index24.cjs +1 -1
- package/dist/index24.js +27 -31
- package/dist/index242.cjs +1 -1
- package/dist/index242.js +3 -3
- package/dist/index249.cjs +1 -1
- package/dist/index249.js +3 -3
- package/dist/index25.cjs +1 -1
- package/dist/index25.js +7 -31
- package/dist/index250.cjs +1 -1
- package/dist/index250.js +3 -3
- package/dist/index26.cjs +1 -1
- package/dist/index26.js +10 -9
- package/dist/index262.cjs +1 -2
- package/dist/index262.js +102 -40
- package/dist/index263.cjs +1 -1
- package/dist/index263.js +7 -2
- package/dist/index264.cjs +1 -1
- package/dist/index264.js +224 -5
- package/dist/index265.cjs +1 -1
- package/dist/index265.js +6 -10
- package/dist/index266.cjs +1 -1
- package/dist/index266.js +7 -20
- package/dist/index267.cjs +2 -1
- package/dist/index267.js +41 -8
- package/dist/index268.cjs +1 -1
- package/dist/index268.js +2 -67
- package/dist/index269.cjs +1 -1
- package/dist/index269.js +5 -65
- package/dist/index270.cjs +1 -1
- package/dist/index270.js +9 -185
- package/dist/index271.cjs +1 -1
- package/dist/index271.js +17 -20
- package/dist/index272.cjs +1 -1
- package/dist/index272.js +8 -42
- package/dist/index273.cjs +1 -1
- package/dist/index273.js +62 -72
- package/dist/index274.cjs +1 -1
- package/dist/index274.js +61 -36
- package/dist/index275.cjs +1 -1
- package/dist/index275.js +185 -15
- package/dist/index276.cjs +1 -1
- package/dist/index276.js +21 -12
- package/dist/index277.cjs +1 -1
- package/dist/index277.js +42 -12
- package/dist/index278.cjs +1 -2
- package/dist/index278.js +76 -18
- package/dist/index279.cjs +1 -1
- package/dist/index279.js +39 -13
- package/dist/index28.cjs +16 -1
- package/dist/index28.js +113 -12
- package/dist/index280.cjs +1 -1
- package/dist/index280.js +16 -11
- package/dist/index281.cjs +1 -1
- package/dist/index281.js +7 -149
- package/dist/index282.cjs +1 -1
- package/dist/index282.js +10 -7
- package/dist/index283.cjs +2 -1
- package/dist/index283.js +16 -111
- package/dist/index284.cjs +1 -2
- package/dist/index284.js +13 -133
- package/dist/index285.cjs +1 -1
- package/dist/index285.js +11 -103
- package/dist/index286.cjs +1 -1
- package/dist/index286.js +26 -6
- package/dist/index287.cjs +1 -1
- package/dist/index287.js +18 -223
- package/dist/index288.cjs +1 -1
- package/dist/index288.js +146 -6
- package/dist/index289.cjs +1 -1
- package/dist/index289.js +4 -7
- package/dist/index29.cjs +1 -16
- package/dist/index29.js +30 -112
- package/dist/index290.cjs +1 -1
- package/dist/index290.js +137 -23
- package/dist/index291.cjs +1 -1
- package/dist/index291.js +153 -17
- package/dist/index292.cjs +1 -1
- package/dist/index292.js +9 -146
- package/dist/index293.cjs +1 -1
- package/dist/index293.js +113 -3
- package/dist/index294.cjs +2 -1
- package/dist/index294.js +122 -128
- package/dist/index295.cjs +1 -1
- package/dist/index295.js +41 -10
- package/dist/index296.cjs +1 -1
- package/dist/index296.js +77 -18
- package/dist/index297.cjs +1 -1
- package/dist/index297.js +2 -43
- package/dist/index298.cjs +1 -1
- package/dist/index298.js +10 -77
- package/dist/index299.cjs +1 -1
- package/dist/index299.js +20 -2
- package/dist/index30.cjs +1 -1
- package/dist/index30.js +31 -27
- package/dist/index300.cjs +1 -1
- package/dist/index300.js +698 -68
- package/dist/index301.cjs +1 -2
- package/dist/index301.js +137 -64
- package/dist/index302.cjs +1 -1
- package/dist/index302.js +201 -4
- package/dist/index303.cjs +1 -1
- package/dist/index303.js +68 -40
- package/dist/index304.cjs +2 -1
- package/dist/index304.js +66 -7
- package/dist/index305.cjs +1 -1
- package/dist/index305.js +4 -62
- package/dist/index306.cjs +1 -1
- package/dist/index306.js +33 -70
- package/dist/index307.cjs +1 -1
- package/dist/index307.js +8 -4
- package/dist/index308.cjs +1 -1
- package/dist/index308.js +55 -187
- package/dist/index309.cjs +1 -1
- package/dist/index309.js +68 -689
- package/dist/index31.cjs +1 -1
- package/dist/index31.js +12 -8
- package/dist/index310.cjs +1 -1
- package/dist/index310.js +4 -140
- package/dist/index311.cjs +1 -1
- package/dist/index311.js +181 -188
- package/dist/index312.cjs +1 -1
- package/dist/index312.js +4 -63
- package/dist/index313.cjs +1 -1
- package/dist/index313.js +59 -40
- package/dist/index314.cjs +1 -1
- package/dist/index314.js +44 -4
- package/dist/index55.cjs +1 -1
- package/dist/index55.js +1 -1
- package/package.json +1 -1
package/dist/index292.js
CHANGED
|
@@ -1,149 +1,12 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
}
|
|
10
|
-
function c(t, ...e) {
|
|
11
|
-
if (!w(t))
|
|
12
|
-
throw new Error("Uint8Array expected");
|
|
13
|
-
if (e.length > 0 && !e.includes(t.length))
|
|
14
|
-
throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
|
|
15
|
-
}
|
|
16
|
-
function U(t) {
|
|
17
|
-
if (typeof t != "function" || typeof t.create != "function")
|
|
18
|
-
throw new Error("Hash should be wrapped by utils.createHasher");
|
|
19
|
-
l(t.outputLen), l(t.blockLen);
|
|
20
|
-
}
|
|
21
|
-
function B(t, e = !0) {
|
|
22
|
-
if (t.destroyed)
|
|
23
|
-
throw new Error("Hash instance has been destroyed");
|
|
24
|
-
if (e && t.finished)
|
|
25
|
-
throw new Error("Hash#digest() has already been called");
|
|
26
|
-
}
|
|
27
|
-
function H(t, e) {
|
|
28
|
-
c(t);
|
|
29
|
-
const n = e.outputLen;
|
|
30
|
-
if (t.length < n)
|
|
31
|
-
throw new Error("digestInto() expects output buffer of length at least " + n);
|
|
32
|
-
}
|
|
33
|
-
function L(t) {
|
|
34
|
-
return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
|
|
35
|
-
}
|
|
36
|
-
function V(...t) {
|
|
37
|
-
for (let e = 0; e < t.length; e++)
|
|
38
|
-
t[e].fill(0);
|
|
39
|
-
}
|
|
40
|
-
function _(t) {
|
|
41
|
-
return new DataView(t.buffer, t.byteOffset, t.byteLength);
|
|
42
|
-
}
|
|
43
|
-
function S(t, e) {
|
|
44
|
-
return t << 32 - e | t >>> e;
|
|
45
|
-
}
|
|
46
|
-
const d = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
|
|
47
|
-
function h(t) {
|
|
48
|
-
return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
|
|
49
|
-
}
|
|
50
|
-
function x(t) {
|
|
51
|
-
for (let e = 0; e < t.length; e++)
|
|
52
|
-
t[e] = h(t[e]);
|
|
53
|
-
return t;
|
|
54
|
-
}
|
|
55
|
-
const T = d ? (t) => t : x, p = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", A = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
|
|
56
|
-
function k(t) {
|
|
57
|
-
if (c(t), p)
|
|
58
|
-
return t.toHex();
|
|
59
|
-
let e = "";
|
|
60
|
-
for (let n = 0; n < t.length; n++)
|
|
61
|
-
e += A[t[n]];
|
|
62
|
-
return e;
|
|
63
|
-
}
|
|
64
|
-
const f = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
|
|
65
|
-
function y(t) {
|
|
66
|
-
if (t >= f._0 && t <= f._9)
|
|
67
|
-
return t - f._0;
|
|
68
|
-
if (t >= f.A && t <= f.F)
|
|
69
|
-
return t - (f.A - 10);
|
|
70
|
-
if (t >= f.a && t <= f.f)
|
|
71
|
-
return t - (f.a - 10);
|
|
72
|
-
}
|
|
73
|
-
function I(t) {
|
|
74
|
-
if (typeof t != "string")
|
|
75
|
-
throw new Error("hex string expected, got " + typeof t);
|
|
76
|
-
if (p)
|
|
77
|
-
return Uint8Array.fromHex(t);
|
|
78
|
-
const e = t.length, n = e / 2;
|
|
79
|
-
if (e % 2)
|
|
80
|
-
throw new Error("hex string expected, got unpadded hex of length " + e);
|
|
81
|
-
const r = new Uint8Array(n);
|
|
82
|
-
for (let o = 0, i = 0; o < n; o++, i += 2) {
|
|
83
|
-
const s = y(t.charCodeAt(i)), a = y(t.charCodeAt(i + 1));
|
|
84
|
-
if (s === void 0 || a === void 0) {
|
|
85
|
-
const g = t[i] + t[i + 1];
|
|
86
|
-
throw new Error('hex string expected, got non-hex character "' + g + '" at index ' + i);
|
|
87
|
-
}
|
|
88
|
-
r[o] = s * 16 + a;
|
|
89
|
-
}
|
|
90
|
-
return r;
|
|
91
|
-
}
|
|
92
|
-
function m(t) {
|
|
93
|
-
if (typeof t != "string")
|
|
94
|
-
throw new Error("string expected");
|
|
95
|
-
return new Uint8Array(new TextEncoder().encode(t));
|
|
96
|
-
}
|
|
97
|
-
function b(t) {
|
|
98
|
-
return typeof t == "string" && (t = m(t)), c(t), t;
|
|
99
|
-
}
|
|
100
|
-
function R(...t) {
|
|
101
|
-
let e = 0;
|
|
102
|
-
for (let r = 0; r < t.length; r++) {
|
|
103
|
-
const o = t[r];
|
|
104
|
-
c(o), e += o.length;
|
|
105
|
-
}
|
|
106
|
-
const n = new Uint8Array(e);
|
|
107
|
-
for (let r = 0, o = 0; r < t.length; r++) {
|
|
108
|
-
const i = t[r];
|
|
109
|
-
n.set(i, o), o += i.length;
|
|
110
|
-
}
|
|
111
|
-
return n;
|
|
112
|
-
}
|
|
113
|
-
class F {
|
|
114
|
-
}
|
|
115
|
-
function O(t) {
|
|
116
|
-
const e = (r) => t().update(b(r)).digest(), n = t();
|
|
117
|
-
return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
|
|
118
|
-
}
|
|
119
|
-
function v(t = 32) {
|
|
120
|
-
if (u && typeof u.getRandomValues == "function")
|
|
121
|
-
return u.getRandomValues(new Uint8Array(t));
|
|
122
|
-
if (u && typeof u.randomBytes == "function")
|
|
123
|
-
return Uint8Array.from(u.randomBytes(t));
|
|
124
|
-
throw new Error("crypto.getRandomValues must be defined");
|
|
1
|
+
import { fromNumber as e } from "./index291.js";
|
|
2
|
+
function r(o) {
|
|
3
|
+
return {
|
|
4
|
+
address: o.address,
|
|
5
|
+
amount: e(o.amount),
|
|
6
|
+
index: e(o.index),
|
|
7
|
+
validatorIndex: e(o.validatorIndex)
|
|
8
|
+
};
|
|
125
9
|
}
|
|
126
10
|
export {
|
|
127
|
-
|
|
128
|
-
c as abytes,
|
|
129
|
-
B as aexists,
|
|
130
|
-
U as ahash,
|
|
131
|
-
l as anumber,
|
|
132
|
-
H as aoutput,
|
|
133
|
-
h as byteSwap,
|
|
134
|
-
x as byteSwap32,
|
|
135
|
-
k as bytesToHex,
|
|
136
|
-
V as clean,
|
|
137
|
-
R as concatBytes,
|
|
138
|
-
O as createHasher,
|
|
139
|
-
_ as createView,
|
|
140
|
-
I as hexToBytes,
|
|
141
|
-
w as isBytes,
|
|
142
|
-
d as isLE,
|
|
143
|
-
v as randomBytes,
|
|
144
|
-
S as rotr,
|
|
145
|
-
T as swap32IfBE,
|
|
146
|
-
b as toBytes,
|
|
147
|
-
L as u32,
|
|
148
|
-
m as utf8ToBytes
|
|
11
|
+
r as toRpc
|
|
149
12
|
};
|
package/dist/index293.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function t(e){return
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const b=require("./index304.cjs"),$=require("./index307.cjs"),g=require("./index291.cjs"),c=require("./index308.cjs"),y=require("./index276.cjs"),h=require("./index269.cjs");function I(t,r={}){const{prepare:i=!0}=r,n=Array.isArray(t)||typeof t=="string"?y.parseAbiItem(t):t;return{...n,...i?{hash:o(n)}:{}}}function q(t,r,i){const{args:n=[],prepare:a=!0}=i??{},v=g.validate(r,{strict:!1}),s=t.filter(e=>v?e.type==="function"||e.type==="error"?A(e)===g.slice(r,0,4):e.type==="event"?o(e)===r:!1:"name"in e&&e.name===r);if(s.length===0)throw new l({name:r});if(s.length===1)return{...s[0],...a?{hash:o(s[0])}:{}};let u;for(const e of s){if(!("inputs"in e))continue;if(!n||n.length===0){if(!e.inputs||e.inputs.length===0)return{...e,...a?{hash:o(e)}:{}};continue}if(!e.inputs||e.inputs.length===0||e.inputs.length!==n.length)continue;if(n.every((f,E)=>{const d="inputs"in e&&e.inputs[E];return d?c.isArgOfType(f,d):!1})){if(u&&"inputs"in u&&u.inputs){const f=c.getAmbiguousTypes(e.inputs,u.inputs,n);if(f)throw new w({abiItem:e,type:f[0]},{abiItem:u,type:f[1]})}u=e}}const p=(()=>{if(u)return u;const[e,...m]=s;return{...e,overloads:m}})();if(!p)throw new l({name:r});return{...p,...a?{hash:o(p)}:{}}}function A(t){return g.slice(o(t),0,4)}function S(t){const r=typeof t=="string"?t:h.formatAbiItem(t);return c.normalizeSignature(r)}function o(t){return typeof t!="string"&&"hash"in t&&t.hash?t.hash:$.keccak256(g.fromString(S(t)))}class w extends b.BaseError{constructor(r,i){super("Found ambiguous types in overloaded ABI Items.",{metaMessages:[`\`${r.type}\` in \`${c.normalizeSignature(h.formatAbiItem(r.abiItem))}\`, and`,`\`${i.type}\` in \`${c.normalizeSignature(h.formatAbiItem(i.abiItem))}\``,"","These types encode differently and cannot be distinguished at runtime.","Remove one of the ambiguous items in the ABI."]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiItem.AmbiguityError"})}}class l extends b.BaseError{constructor({name:r,data:i,type:n="item"}){const a=r?` with name "${r}"`:i?` with data "${i}"`:"";super(`ABI ${n}${a} not found.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiItem.NotFoundError"})}}exports.AmbiguityError=w;exports.NotFoundError=l;exports.from=I;exports.fromAbi=q;exports.getSelector=A;exports.getSignature=S;exports.getSignatureHash=o;
|
package/dist/index293.js
CHANGED
|
@@ -1,6 +1,116 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
1
|
+
import { BaseError as y } from "./index304.js";
|
|
2
|
+
import { keccak256 as v } from "./index307.js";
|
|
3
|
+
import { validate as $, slice as A, fromString as S } from "./index291.js";
|
|
4
|
+
import { isArgOfType as E, normalizeSignature as p, getAmbiguousTypes as B } from "./index308.js";
|
|
5
|
+
import { parseAbiItem as l } from "./index276.js";
|
|
6
|
+
import { formatAbiItem as h } from "./index269.js";
|
|
7
|
+
function H(e, r = {}) {
|
|
8
|
+
const { prepare: i = !0 } = r, n = Array.isArray(e) ? l(e) : typeof e == "string" ? l(e) : e;
|
|
9
|
+
return {
|
|
10
|
+
...n,
|
|
11
|
+
...i ? { hash: s(n) } : {}
|
|
12
|
+
};
|
|
13
|
+
}
|
|
14
|
+
function M(e, r, i) {
|
|
15
|
+
const { args: n = [], prepare: f = !0 } = i ?? {}, b = $(r, { strict: !1 }), u = e.filter((t) => b ? t.type === "function" || t.type === "error" ? T(t) === A(r, 0, 4) : t.type === "event" ? s(t) === r : !1 : "name" in t && t.name === r);
|
|
16
|
+
if (u.length === 0)
|
|
17
|
+
throw new d({ name: r });
|
|
18
|
+
if (u.length === 1)
|
|
19
|
+
return {
|
|
20
|
+
...u[0],
|
|
21
|
+
...f ? { hash: s(u[0]) } : {}
|
|
22
|
+
};
|
|
23
|
+
let o;
|
|
24
|
+
for (const t of u) {
|
|
25
|
+
if (!("inputs" in t))
|
|
26
|
+
continue;
|
|
27
|
+
if (!n || n.length === 0) {
|
|
28
|
+
if (!t.inputs || t.inputs.length === 0)
|
|
29
|
+
return {
|
|
30
|
+
...t,
|
|
31
|
+
...f ? { hash: s(t) } : {}
|
|
32
|
+
};
|
|
33
|
+
continue;
|
|
34
|
+
}
|
|
35
|
+
if (!t.inputs || t.inputs.length === 0 || t.inputs.length !== n.length)
|
|
36
|
+
continue;
|
|
37
|
+
if (n.every((a, w) => {
|
|
38
|
+
const g = "inputs" in t && t.inputs[w];
|
|
39
|
+
return g ? E(a, g) : !1;
|
|
40
|
+
})) {
|
|
41
|
+
if (o && "inputs" in o && o.inputs) {
|
|
42
|
+
const a = B(t.inputs, o.inputs, n);
|
|
43
|
+
if (a)
|
|
44
|
+
throw new O({
|
|
45
|
+
abiItem: t,
|
|
46
|
+
type: a[0]
|
|
47
|
+
}, {
|
|
48
|
+
abiItem: o,
|
|
49
|
+
type: a[1]
|
|
50
|
+
});
|
|
51
|
+
}
|
|
52
|
+
o = t;
|
|
53
|
+
}
|
|
54
|
+
}
|
|
55
|
+
const c = (() => {
|
|
56
|
+
if (o)
|
|
57
|
+
return o;
|
|
58
|
+
const [t, ...m] = u;
|
|
59
|
+
return { ...t, overloads: m };
|
|
60
|
+
})();
|
|
61
|
+
if (!c)
|
|
62
|
+
throw new d({ name: r });
|
|
63
|
+
return {
|
|
64
|
+
...c,
|
|
65
|
+
...f ? { hash: s(c) } : {}
|
|
66
|
+
};
|
|
67
|
+
}
|
|
68
|
+
function T(e) {
|
|
69
|
+
return A(s(e), 0, 4);
|
|
70
|
+
}
|
|
71
|
+
function F(e) {
|
|
72
|
+
const r = typeof e == "string" ? e : h(e);
|
|
73
|
+
return p(r);
|
|
74
|
+
}
|
|
75
|
+
function s(e) {
|
|
76
|
+
return typeof e != "string" && "hash" in e && e.hash ? e.hash : v(S(F(e)));
|
|
77
|
+
}
|
|
78
|
+
class O extends y {
|
|
79
|
+
constructor(r, i) {
|
|
80
|
+
super("Found ambiguous types in overloaded ABI Items.", {
|
|
81
|
+
metaMessages: [
|
|
82
|
+
// TODO: abitype to add support for signature-formatted ABI items.
|
|
83
|
+
`\`${r.type}\` in \`${p(h(r.abiItem))}\`, and`,
|
|
84
|
+
`\`${i.type}\` in \`${p(h(i.abiItem))}\``,
|
|
85
|
+
"",
|
|
86
|
+
"These types encode differently and cannot be distinguished at runtime.",
|
|
87
|
+
"Remove one of the ambiguous items in the ABI."
|
|
88
|
+
]
|
|
89
|
+
}), Object.defineProperty(this, "name", {
|
|
90
|
+
enumerable: !0,
|
|
91
|
+
configurable: !0,
|
|
92
|
+
writable: !0,
|
|
93
|
+
value: "AbiItem.AmbiguityError"
|
|
94
|
+
});
|
|
95
|
+
}
|
|
96
|
+
}
|
|
97
|
+
class d extends y {
|
|
98
|
+
constructor({ name: r, data: i, type: n = "item" }) {
|
|
99
|
+
const f = r ? ` with name "${r}"` : i ? ` with data "${i}"` : "";
|
|
100
|
+
super(`ABI ${n}${f} not found.`), Object.defineProperty(this, "name", {
|
|
101
|
+
enumerable: !0,
|
|
102
|
+
configurable: !0,
|
|
103
|
+
writable: !0,
|
|
104
|
+
value: "AbiItem.NotFoundError"
|
|
105
|
+
});
|
|
106
|
+
}
|
|
3
107
|
}
|
|
4
108
|
export {
|
|
5
|
-
|
|
109
|
+
O as AmbiguityError,
|
|
110
|
+
d as NotFoundError,
|
|
111
|
+
H as from,
|
|
112
|
+
M as fromAbi,
|
|
113
|
+
T as getSelector,
|
|
114
|
+
F as getSignature,
|
|
115
|
+
s as getSignatureHash
|
|
6
116
|
};
|
package/dist/index294.cjs
CHANGED
|
@@ -1 +1,2 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const x=require("./index309.cjs"),d=require("./index304.cjs"),a=require("./index291.cjs"),g=require("./index310.cjs"),p=require("./index311.cjs");function P(n,e,t){const{checksumAddress:r=!1}={};if(n.length!==e.length)throw new m({expectedLength:n.length,givenLength:e.length});const s=p.prepareParameters({checksumAddress:r,parameters:n,values:e}),o=p.encode(s);return o.length===0?"0x":o}function l(n,e){if(n.length!==e.length)throw new m({expectedLength:n.length,givenLength:e.length});const t=[];for(let r=0;r<n.length;r++){const s=n[r],o=e[r];t.push(l.encode(s,o))}return a.concat(...t)}(function(n){function e(t,r,s=!1){if(t==="address"){const c=r;return x.assert(c),a.padLeft(c.toLowerCase(),s?32:0)}if(t==="string")return a.fromString(r);if(t==="bytes")return r;if(t==="bool")return a.padLeft(a.fromBoolean(r),s?32:1);const o=t.match(g.integerRegex);if(o){const[c,i,u="256"]=o,h=Number.parseInt(u)/8;return a.fromNumber(r,{size:s?32:h,signed:i==="int"})}const b=t.match(g.bytesRegex);if(b){const[c,i]=b;if(Number.parseInt(i)!==(r.length-2)/2)throw new y({expectedSize:Number.parseInt(i),value:r});return a.padRight(r,s?32:0)}const f=t.match(g.arrayRegex);if(f&&Array.isArray(r)){const[c,i]=f,u=[];for(let h=0;h<r.length;h++)u.push(e(i,r[h],!0));return u.length===0?"0x":a.concat(...u)}throw new E(t)}n.encode=e})(l||(l={}));class A extends d.BaseError{constructor({expectedLength:e,givenLength:t,type:r}){super(`Array length mismatch for type \`${r}\`. Expected: \`${e}\`. Given: \`${t}\`.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.ArrayLengthMismatchError"})}}class y extends d.BaseError{constructor({expectedSize:e,value:t}){super(`Size of bytes "${t}" (bytes${a.size(t)}) does not match expected size (bytes${e}).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.BytesSizeMismatchError"})}}class m extends d.BaseError{constructor({expectedLength:e,givenLength:t}){super(["ABI encoding parameters/values length mismatch.",`Expected length (parameters): ${e}`,`Given length (values): ${t}`].join(`
|
|
2
|
+
`)),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.LengthMismatchError"})}}class w extends d.BaseError{constructor(e){super(`Value \`${e}\` is not a valid array.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.InvalidArrayError"})}}class E extends d.BaseError{constructor(e){super(`Type \`${e}\` is not a valid ABI Type.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.InvalidTypeError"})}}exports.ArrayLengthMismatchError=A;exports.BytesSizeMismatchError=y;exports.InvalidArrayError=w;exports.InvalidTypeError=E;exports.LengthMismatchError=m;exports.encode=P;exports.encodePacked=l;
|
package/dist/index294.js
CHANGED
|
@@ -1,143 +1,137 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import {
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
} catch (e) {
|
|
13
|
-
return typeof e == "object" && typeof e.response < "u" || !globalThis.hasOwnProperty("Image") ? !1 : new Promise((n) => {
|
|
14
|
-
const r = new Image();
|
|
15
|
-
r.onload = () => {
|
|
16
|
-
n(!0);
|
|
17
|
-
}, r.onerror = () => {
|
|
18
|
-
n(!1);
|
|
19
|
-
}, r.src = t;
|
|
1
|
+
import { assert as p } from "./index309.js";
|
|
2
|
+
import { BaseError as u } from "./index304.js";
|
|
3
|
+
import { size as y, padLeft as f, fromString as x, fromBoolean as w, fromNumber as E, padRight as P, concat as g } from "./index291.js";
|
|
4
|
+
import { integerRegex as A, bytesRegex as $, arrayRegex as L } from "./index310.js";
|
|
5
|
+
import { prepareParameters as z, encode as I } from "./index311.js";
|
|
6
|
+
function N(n, e, t) {
|
|
7
|
+
const { checksumAddress: r = !1 } = {};
|
|
8
|
+
if (n.length !== e.length)
|
|
9
|
+
throw new b({
|
|
10
|
+
expectedLength: n.length,
|
|
11
|
+
givenLength: e.length
|
|
20
12
|
});
|
|
21
|
-
|
|
13
|
+
const a = z({
|
|
14
|
+
checksumAddress: r,
|
|
15
|
+
parameters: n,
|
|
16
|
+
values: e
|
|
17
|
+
}), s = I(a);
|
|
18
|
+
return s.length === 0 ? "0x" : s;
|
|
22
19
|
}
|
|
23
|
-
function
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
return e != null && e.arweave && (I = t.replace(/https:\/\/arweave.net/g, e == null ? void 0 : e.arweave)), { uri: I, isOnChain: !1, isEncoded: !1 };
|
|
20
|
+
function m(n, e) {
|
|
21
|
+
if (n.length !== e.length)
|
|
22
|
+
throw new b({
|
|
23
|
+
expectedLength: n.length,
|
|
24
|
+
givenLength: e.length
|
|
25
|
+
});
|
|
26
|
+
const t = [];
|
|
27
|
+
for (let r = 0; r < n.length; r++) {
|
|
28
|
+
const a = n[r], s = e[r];
|
|
29
|
+
t.push(m.encode(a, s));
|
|
34
30
|
}
|
|
35
|
-
|
|
36
|
-
return {
|
|
37
|
-
uri: `${r}/${u ? "ipns" : "ipfs"}/${s}${m}`,
|
|
38
|
-
isOnChain: !1,
|
|
39
|
-
isEncoded: !1
|
|
40
|
-
};
|
|
41
|
-
if (o === "ar:/" && s)
|
|
42
|
-
return {
|
|
43
|
-
uri: `${a}/${s}${m || ""}`,
|
|
44
|
-
isOnChain: !1,
|
|
45
|
-
isEncoded: !1
|
|
46
|
-
};
|
|
47
|
-
let c = t.replace(C, "");
|
|
48
|
-
if (c.startsWith("<svg") && (c = `data:image/svg+xml;base64,${btoa(c)}`), c.startsWith("data:") || c.startsWith("{"))
|
|
49
|
-
return {
|
|
50
|
-
uri: c,
|
|
51
|
-
isOnChain: !0,
|
|
52
|
-
isEncoded: !1
|
|
53
|
-
};
|
|
54
|
-
throw new d({ uri: t });
|
|
31
|
+
return g(...t);
|
|
55
32
|
}
|
|
56
|
-
function
|
|
57
|
-
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
|
|
61
|
-
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
33
|
+
(function(n) {
|
|
34
|
+
function e(t, r, a = !1) {
|
|
35
|
+
if (t === "address") {
|
|
36
|
+
const i = r;
|
|
37
|
+
return p(i), f(i.toLowerCase(), a ? 32 : 0);
|
|
38
|
+
}
|
|
39
|
+
if (t === "string")
|
|
40
|
+
return x(r);
|
|
41
|
+
if (t === "bytes")
|
|
42
|
+
return r;
|
|
43
|
+
if (t === "bool")
|
|
44
|
+
return f(w(r), a ? 32 : 1);
|
|
45
|
+
const s = t.match(A);
|
|
46
|
+
if (s) {
|
|
47
|
+
const [i, o, c = "256"] = s, h = Number.parseInt(c) / 8;
|
|
48
|
+
return E(r, {
|
|
49
|
+
size: a ? 32 : h,
|
|
50
|
+
signed: o === "int"
|
|
51
|
+
});
|
|
52
|
+
}
|
|
53
|
+
const d = t.match($);
|
|
54
|
+
if (d) {
|
|
55
|
+
const [i, o] = d;
|
|
56
|
+
if (Number.parseInt(o) !== (r.length - 2) / 2)
|
|
57
|
+
throw new M({
|
|
58
|
+
expectedSize: Number.parseInt(o),
|
|
59
|
+
value: r
|
|
60
|
+
});
|
|
61
|
+
return P(r, a ? 32 : 0);
|
|
62
|
+
}
|
|
63
|
+
const l = t.match(L);
|
|
64
|
+
if (l && Array.isArray(r)) {
|
|
65
|
+
const [i, o] = l, c = [];
|
|
66
|
+
for (let h = 0; h < r.length; h++)
|
|
67
|
+
c.push(e(o, r[h], !0));
|
|
68
|
+
return c.length === 0 ? "0x" : g(...c);
|
|
69
|
+
}
|
|
70
|
+
throw new j(t);
|
|
71
|
+
}
|
|
72
|
+
n.encode = e;
|
|
73
|
+
})(m || (m = {}));
|
|
74
|
+
class R extends u {
|
|
75
|
+
constructor({ expectedLength: e, givenLength: t, type: r }) {
|
|
76
|
+
super(`Array length mismatch for type \`${r}\`. Expected: \`${e}\`. Given: \`${t}\`.`), Object.defineProperty(this, "name", {
|
|
77
|
+
enumerable: !0,
|
|
78
|
+
configurable: !0,
|
|
79
|
+
writable: !0,
|
|
80
|
+
value: "AbiParameters.ArrayLengthMismatchError"
|
|
67
81
|
});
|
|
68
|
-
} catch {
|
|
69
|
-
throw new d({ uri: e });
|
|
70
82
|
}
|
|
71
83
|
}
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
84
|
+
class M extends u {
|
|
85
|
+
constructor({ expectedSize: e, value: t }) {
|
|
86
|
+
super(`Size of bytes "${t}" (bytes${y(t)}) does not match expected size (bytes${e}).`), Object.defineProperty(this, "name", {
|
|
87
|
+
enumerable: !0,
|
|
88
|
+
configurable: !0,
|
|
89
|
+
writable: !0,
|
|
90
|
+
value: "AbiParameters.BytesSizeMismatchError"
|
|
91
|
+
});
|
|
92
|
+
}
|
|
77
93
|
}
|
|
78
|
-
|
|
79
|
-
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
|
|
94
|
+
class b extends u {
|
|
95
|
+
constructor({ expectedLength: e, givenLength: t }) {
|
|
96
|
+
super([
|
|
97
|
+
"ABI encoding parameters/values length mismatch.",
|
|
98
|
+
`Expected length (parameters): ${e}`,
|
|
99
|
+
`Given length (values): ${t}`
|
|
100
|
+
].join(`
|
|
101
|
+
`)), Object.defineProperty(this, "name", {
|
|
102
|
+
enumerable: !0,
|
|
103
|
+
configurable: !0,
|
|
104
|
+
writable: !0,
|
|
105
|
+
value: "AbiParameters.LengthMismatchError"
|
|
89
106
|
});
|
|
90
|
-
|
|
91
|
-
throw new f({ reason: "Token ID not found" });
|
|
92
|
-
if (!p)
|
|
93
|
-
throw new f({ reason: "ERC namespace not found" });
|
|
94
|
-
return {
|
|
95
|
-
chainID: Number.parseInt(o),
|
|
96
|
-
namespace: p.toLowerCase(),
|
|
97
|
-
contractAddress: s,
|
|
98
|
-
tokenID: a
|
|
99
|
-
};
|
|
107
|
+
}
|
|
100
108
|
}
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
|
|
105
|
-
|
|
106
|
-
|
|
107
|
-
|
|
108
|
-
type: "function",
|
|
109
|
-
stateMutability: "view",
|
|
110
|
-
inputs: [{ name: "tokenId", type: "uint256" }],
|
|
111
|
-
outputs: [{ name: "", type: "string" }]
|
|
112
|
-
}
|
|
113
|
-
],
|
|
114
|
-
functionName: "tokenURI",
|
|
115
|
-
args: [BigInt(e.tokenID)]
|
|
109
|
+
class _ extends u {
|
|
110
|
+
constructor(e) {
|
|
111
|
+
super(`Value \`${e}\` is not a valid array.`), Object.defineProperty(this, "name", {
|
|
112
|
+
enumerable: !0,
|
|
113
|
+
configurable: !0,
|
|
114
|
+
writable: !0,
|
|
115
|
+
value: "AbiParameters.InvalidArrayError"
|
|
116
116
|
});
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
|
|
120
|
-
|
|
121
|
-
|
|
122
|
-
|
|
123
|
-
|
|
124
|
-
|
|
125
|
-
|
|
126
|
-
outputs: [{ name: "", type: "string" }]
|
|
127
|
-
}
|
|
128
|
-
],
|
|
129
|
-
functionName: "uri",
|
|
130
|
-
args: [BigInt(e.tokenID)]
|
|
117
|
+
}
|
|
118
|
+
}
|
|
119
|
+
class j extends u {
|
|
120
|
+
constructor(e) {
|
|
121
|
+
super(`Type \`${e}\` is not a valid ABI Type.`), Object.defineProperty(this, "name", {
|
|
122
|
+
enumerable: !0,
|
|
123
|
+
configurable: !0,
|
|
124
|
+
writable: !0,
|
|
125
|
+
value: "AbiParameters.InvalidTypeError"
|
|
131
126
|
});
|
|
132
|
-
|
|
127
|
+
}
|
|
133
128
|
}
|
|
134
129
|
export {
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
|
|
142
|
-
N as resolveAvatarUri
|
|
130
|
+
R as ArrayLengthMismatchError,
|
|
131
|
+
M as BytesSizeMismatchError,
|
|
132
|
+
_ as InvalidArrayError,
|
|
133
|
+
j as InvalidTypeError,
|
|
134
|
+
b as LengthMismatchError,
|
|
135
|
+
N as encode,
|
|
136
|
+
m as encodePacked
|
|
143
137
|
};
|
package/dist/index295.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 i=require("./index288.cjs");class r extends i.Hash{constructor(t,h){super(),this.finished=!1,this.destroyed=!1,i.ahash(t);const n=i.toBytes(h);if(this.iHash=t.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const a=this.blockLen,e=new Uint8Array(a);e.set(n.length>a?t.create().update(n).digest():n);for(let s=0;s<e.length;s++)e[s]^=54;this.iHash.update(e),this.oHash=t.create();for(let s=0;s<e.length;s++)e[s]^=106;this.oHash.update(e),i.clean(e)}update(t){return i.aexists(this),this.iHash.update(t),this}digestInto(t){i.aexists(this),i.abytes(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:h,iHash:n,finished:a,destroyed:e,blockLen:s,outputLen:d}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=d,t.oHash=h._cloneInto(t.oHash),t.iHash=n._cloneInto(t.iHash),t}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const c=(o,t,h)=>new r(o,t).update(h).digest();c.create=(o,t)=>new r(o,t);exports.HMAC=r;exports.hmac=c;
|
package/dist/index295.js
CHANGED
|
@@ -1,14 +1,45 @@
|
|
|
1
|
-
import {
|
|
2
|
-
class
|
|
3
|
-
constructor(
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
1
|
+
import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./index288.js";
|
|
2
|
+
class r extends d {
|
|
3
|
+
constructor(t, i) {
|
|
4
|
+
super(), this.finished = !1, this.destroyed = !1, u(t);
|
|
5
|
+
const h = H(i);
|
|
6
|
+
if (this.iHash = t.create(), typeof this.iHash.update != "function")
|
|
7
|
+
throw new Error("Expected instance of class which extends utils.Hash");
|
|
8
|
+
this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
|
|
9
|
+
const o = this.blockLen, e = new Uint8Array(o);
|
|
10
|
+
e.set(h.length > o ? t.create().update(h).digest() : h);
|
|
11
|
+
for (let s = 0; s < e.length; s++)
|
|
12
|
+
e[s] ^= 54;
|
|
13
|
+
this.iHash.update(e), this.oHash = t.create();
|
|
14
|
+
for (let s = 0; s < e.length; s++)
|
|
15
|
+
e[s] ^= 106;
|
|
16
|
+
this.oHash.update(e), l(e);
|
|
17
|
+
}
|
|
18
|
+
update(t) {
|
|
19
|
+
return a(this), this.iHash.update(t), this;
|
|
20
|
+
}
|
|
21
|
+
digestInto(t) {
|
|
22
|
+
a(this), p(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
|
|
23
|
+
}
|
|
24
|
+
digest() {
|
|
25
|
+
const t = new Uint8Array(this.oHash.outputLen);
|
|
26
|
+
return this.digestInto(t), t;
|
|
27
|
+
}
|
|
28
|
+
_cloneInto(t) {
|
|
29
|
+
t || (t = Object.create(Object.getPrototypeOf(this), {}));
|
|
30
|
+
const { oHash: i, iHash: h, finished: o, destroyed: e, blockLen: s, outputLen: c } = this;
|
|
31
|
+
return t = t, t.finished = o, t.destroyed = e, t.blockLen = s, t.outputLen = c, t.oHash = i._cloneInto(t.oHash), t.iHash = h._cloneInto(t.iHash), t;
|
|
32
|
+
}
|
|
33
|
+
clone() {
|
|
34
|
+
return this._cloneInto();
|
|
35
|
+
}
|
|
36
|
+
destroy() {
|
|
37
|
+
this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
|
|
10
38
|
}
|
|
11
39
|
}
|
|
40
|
+
const y = (n, t, i) => new r(n, t).update(i).digest();
|
|
41
|
+
y.create = (n, t) => new r(n, t);
|
|
12
42
|
export {
|
|
13
|
-
|
|
43
|
+
r as HMAC,
|
|
44
|
+
y as hmac
|
|
14
45
|
};
|