@gardenfi/swap 0.0.2-beta.2 → 0.0.2-beta.4
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/index12.cjs +1 -1
- package/dist/index12.js +12 -12
- package/dist/index120.cjs +1 -1
- package/dist/index120.js +2 -2
- package/dist/index121.cjs +1 -1
- package/dist/index121.js +7 -7
- package/dist/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 +1 -1
- 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/index272.cjs +1 -1
- package/dist/index272.js +9 -174
- package/dist/index273.cjs +1 -2
- package/dist/index273.js +30 -91
- package/dist/index274.cjs +1 -1
- package/dist/index274.js +2 -41
- package/dist/index275.cjs +1 -1
- package/dist/index275.js +47 -4
- package/dist/index276.cjs +1 -1
- package/dist/index276.js +11 -9
- package/dist/index277.cjs +1 -1
- package/dist/index277.js +174 -30
- package/dist/index278.cjs +2 -1
- package/dist/index278.js +92 -2
- package/dist/index279.cjs +1 -1
- package/dist/index279.js +38 -45
- package/dist/index280.cjs +1 -1
- package/dist/index280.js +4 -11
- package/dist/index281.cjs +1 -1
- package/dist/index281.js +3 -3
- package/dist/index283.cjs +1 -2
- package/dist/index283.js +42 -41
- package/dist/index284.cjs +1 -1
- package/dist/index284.js +321 -2
- package/dist/index285.cjs +1 -1
- package/dist/index285.js +605 -5
- package/dist/index286.cjs +1 -1
- package/dist/index286.js +109 -10
- package/dist/index287.cjs +1 -1
- package/dist/index287.js +167 -19
- package/dist/index288.cjs +1 -1
- package/dist/index288.js +301 -8
- package/dist/index289.cjs +1 -1
- package/dist/index289.js +93 -72
- package/dist/index290.cjs +1 -1
- package/dist/index290.js +54 -63
- package/dist/index291.cjs +1 -1
- package/dist/index291.js +51 -186
- package/dist/index292.cjs +1 -1
- package/dist/index292.js +42 -20
- package/dist/index293.cjs +1 -1
- package/dist/index293.js +14 -41
- package/dist/index294.cjs +1 -1
- package/dist/index294.js +315 -23
- package/dist/index295.cjs +1 -1
- package/dist/index295.js +57 -88
- package/dist/index296.cjs +1 -1
- package/dist/index296.js +19 -40
- package/dist/index297.cjs +1 -1
- package/dist/index297.js +28 -15
- package/dist/index298.cjs +1 -1
- package/dist/index298.js +3 -13
- package/dist/index299.cjs +7 -1
- package/dist/index299.js +237 -7
- package/dist/index300.cjs +1 -1
- package/dist/index300.js +48 -38
- package/dist/index301.cjs +1 -1
- package/dist/index301.js +211 -14
- package/dist/index302.cjs +1 -1
- package/dist/index302.js +77 -38
- package/dist/index303.cjs +1 -1
- package/dist/index303.js +25 -316
- package/dist/index304.cjs +1 -1
- package/dist/index304.js +73 -602
- package/dist/index305.cjs +2 -1
- package/dist/index305.js +41 -109
- package/dist/index306.cjs +1 -1
- package/dist/index306.js +2 -168
- package/dist/index307.cjs +1 -1
- package/dist/index307.js +5 -301
- package/dist/index308.cjs +1 -1
- package/dist/index308.js +10 -93
- package/dist/index309.cjs +1 -1
- package/dist/index309.js +18 -55
- package/dist/index310.cjs +1 -1
- package/dist/index310.js +8 -53
- package/dist/index311.cjs +1 -1
- package/dist/index311.js +72 -44
- package/dist/index312.cjs +1 -1
- package/dist/index312.js +64 -14
- package/dist/index313.cjs +1 -1
- package/dist/index313.js +184 -313
- package/dist/index314.cjs +1 -1
- package/dist/index314.js +19 -56
- package/dist/index315.cjs +1 -1
- package/dist/index315.js +42 -19
- package/dist/index316.cjs +1 -1
- package/dist/index316.js +23 -27
- package/dist/index317.cjs +1 -1
- package/dist/index317.js +90 -3
- package/dist/index318.cjs +1 -7
- package/dist/index318.js +33 -230
- package/dist/index319.cjs +1 -1
- package/dist/index319.js +17 -48
- package/dist/index320.cjs +1 -1
- package/dist/index320.js +11 -210
- package/dist/index321.cjs +1 -1
- package/dist/index321.js +7 -81
- package/dist/index322.cjs +1 -1
- package/dist/index322.js +36 -28
- package/dist/index323.cjs +1 -1
- package/dist/index323.js +15 -76
- 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/index340.cjs +1 -1
- package/dist/index340.js +1 -1
- package/dist/index341.cjs +1 -1
- package/dist/index341.js +1 -1
- package/dist/index343.cjs +1 -1
- package/dist/index343.js +1 -1
- 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 +1 -2
- package/dist/index349.js +4 -193
- package/dist/index350.cjs +2 -1
- package/dist/index350.js +168 -52
- package/dist/index351.cjs +1 -1
- package/dist/index351.js +65 -331
- package/dist/index352.cjs +1 -1
- package/dist/index352.js +332 -149
- package/dist/index353.cjs +1 -1
- package/dist/index353.js +161 -5
- package/dist/index354.cjs +1 -1
- package/dist/index354.js +5 -5
- package/dist/index357.cjs +1 -1
- package/dist/index357.js +8 -205
- package/dist/index359.cjs +1 -1
- package/dist/index359.js +205 -8
- package/dist/index360.cjs +1 -1
- package/dist/index360.js +94 -68
- package/dist/index361.cjs +1 -1
- package/dist/index361.js +28 -94
- package/dist/index362.cjs +1 -1
- package/dist/index362.js +147 -27
- package/dist/index363.cjs +1 -1
- package/dist/index363.js +324 -118
- package/dist/index364.cjs +1 -1
- package/dist/index364.js +72 -353
- package/dist/index365.cjs +1 -1
- package/dist/index365.js +29 -71
- package/dist/index366.cjs +1 -1
- package/dist/index366.js +5 -31
- package/dist/index367.cjs +1 -1
- package/dist/index367.js +275 -5
- package/dist/index368.cjs +1 -1
- package/dist/index368.js +171 -4
- package/dist/index369.cjs +1 -1
- package/dist/index369.js +10 -141
- package/dist/index370.cjs +1 -1
- package/dist/index370.js +105 -273
- package/dist/index371.cjs +1 -1
- package/dist/index371.js +10 -171
- package/dist/index372.cjs +1 -1
- package/dist/index372.js +69 -10
- package/dist/index373.cjs +1 -1
- package/dist/index373.js +3 -107
- package/dist/index374.cjs +1 -1
- package/dist/index374.js +140 -9
- package/dist/index375.cjs +1 -1
- package/dist/index375.js +4 -4
- package/dist/index376.cjs +1 -1
- package/dist/index376.js +2 -79
- package/dist/index377.cjs +1 -1
- package/dist/index377.js +79 -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 +2 -22
- package/dist/index382.cjs +1 -1
- package/dist/index382.js +22 -2
- 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/dist/src/lib/store/swapStore.d.ts +1 -1
- package/package.json +5 -5
package/dist/index357.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"})
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index277.cjs");function r(e){return{address:e.address,amount:o.fromNumber(e.amount),index:o.fromNumber(e.index),validatorIndex:o.fromNumber(e.validatorIndex)}}exports.toRpc=r;
|
package/dist/index357.js
CHANGED
|
@@ -1,209 +1,12 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
throw new Error("Uint8Array expected");
|
|
9
|
-
}
|
|
10
|
-
function k(t, n) {
|
|
11
|
-
if (typeof n != "boolean")
|
|
12
|
-
throw new Error(t + " boolean expected, got " + n);
|
|
13
|
-
}
|
|
14
|
-
function F(t) {
|
|
15
|
-
const n = t.toString(16);
|
|
16
|
-
return n.length & 1 ? "0" + n : n;
|
|
17
|
-
}
|
|
18
|
-
function E(t) {
|
|
19
|
-
if (typeof t != "string")
|
|
20
|
-
throw new Error("hex string expected, got " + typeof t);
|
|
21
|
-
return t === "" ? w : BigInt("0x" + t);
|
|
22
|
-
}
|
|
23
|
-
const U = (
|
|
24
|
-
// @ts-ignore
|
|
25
|
-
typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function"
|
|
26
|
-
), S = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
|
|
27
|
-
function x(t) {
|
|
28
|
-
if (h(t), U)
|
|
29
|
-
return t.toHex();
|
|
30
|
-
let n = "";
|
|
31
|
-
for (let e = 0; e < t.length; e++)
|
|
32
|
-
n += S[t[e]];
|
|
33
|
-
return n;
|
|
34
|
-
}
|
|
35
|
-
const u = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
|
|
36
|
-
function m(t) {
|
|
37
|
-
if (t >= u._0 && t <= u._9)
|
|
38
|
-
return t - u._0;
|
|
39
|
-
if (t >= u.A && t <= u.F)
|
|
40
|
-
return t - (u.A - 10);
|
|
41
|
-
if (t >= u.a && t <= u.f)
|
|
42
|
-
return t - (u.a - 10);
|
|
43
|
-
}
|
|
44
|
-
function B(t) {
|
|
45
|
-
if (typeof t != "string")
|
|
46
|
-
throw new Error("hex string expected, got " + typeof t);
|
|
47
|
-
if (U)
|
|
48
|
-
return Uint8Array.fromHex(t);
|
|
49
|
-
const n = t.length, e = n / 2;
|
|
50
|
-
if (n % 2)
|
|
51
|
-
throw new Error("hex string expected, got unpadded hex of length " + n);
|
|
52
|
-
const r = new Uint8Array(e);
|
|
53
|
-
for (let o = 0, i = 0; o < e; o++, i += 2) {
|
|
54
|
-
const a = m(t.charCodeAt(i)), f = m(t.charCodeAt(i + 1));
|
|
55
|
-
if (a === void 0 || f === void 0) {
|
|
56
|
-
const c = t[i] + t[i + 1];
|
|
57
|
-
throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i);
|
|
58
|
-
}
|
|
59
|
-
r[o] = a * 16 + f;
|
|
60
|
-
}
|
|
61
|
-
return r;
|
|
62
|
-
}
|
|
63
|
-
function O(t) {
|
|
64
|
-
return E(x(t));
|
|
65
|
-
}
|
|
66
|
-
function V(t) {
|
|
67
|
-
return h(t), E(x(Uint8Array.from(t).reverse()));
|
|
68
|
-
}
|
|
69
|
-
function T(t, n) {
|
|
70
|
-
return B(t.toString(16).padStart(n * 2, "0"));
|
|
71
|
-
}
|
|
72
|
-
function C(t, n) {
|
|
73
|
-
return T(t, n).reverse();
|
|
74
|
-
}
|
|
75
|
-
function M(t, n, e) {
|
|
76
|
-
let r;
|
|
77
|
-
if (typeof n == "string")
|
|
78
|
-
try {
|
|
79
|
-
r = B(n);
|
|
80
|
-
} catch (i) {
|
|
81
|
-
throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
|
|
82
|
-
}
|
|
83
|
-
else if (b(n))
|
|
84
|
-
r = Uint8Array.from(n);
|
|
85
|
-
else
|
|
86
|
-
throw new Error(t + " must be hex string or Uint8Array");
|
|
87
|
-
const o = r.length;
|
|
88
|
-
if (typeof e == "number" && o !== e)
|
|
89
|
-
throw new Error(t + " of length " + e + " expected, got " + o);
|
|
90
|
-
return r;
|
|
91
|
-
}
|
|
92
|
-
function H(...t) {
|
|
93
|
-
let n = 0;
|
|
94
|
-
for (let r = 0; r < t.length; r++) {
|
|
95
|
-
const o = t[r];
|
|
96
|
-
h(o), n += o.length;
|
|
97
|
-
}
|
|
98
|
-
const e = new Uint8Array(n);
|
|
99
|
-
for (let r = 0, o = 0; r < t.length; r++) {
|
|
100
|
-
const i = t[r];
|
|
101
|
-
e.set(i, o), o += i.length;
|
|
102
|
-
}
|
|
103
|
-
return e;
|
|
104
|
-
}
|
|
105
|
-
const y = (t) => typeof t == "bigint" && w <= t;
|
|
106
|
-
function I(t, n, e) {
|
|
107
|
-
return y(t) && y(n) && y(e) && n <= t && t < e;
|
|
108
|
-
}
|
|
109
|
-
function R(t, n, e, r) {
|
|
110
|
-
if (!I(n, e, r))
|
|
111
|
-
throw new Error("expected valid " + t + ": " + e + " <= n < " + r + ", got " + n);
|
|
112
|
-
}
|
|
113
|
-
function j(t) {
|
|
114
|
-
let n;
|
|
115
|
-
for (n = 0; t > w; t >>= p, n += 1)
|
|
116
|
-
;
|
|
117
|
-
return n;
|
|
118
|
-
}
|
|
119
|
-
const z = (t) => (p << BigInt(t)) - p, d = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
|
|
120
|
-
function D(t, n, e) {
|
|
121
|
-
if (typeof t != "number" || t < 2)
|
|
122
|
-
throw new Error("hashLen must be a number");
|
|
123
|
-
if (typeof n != "number" || n < 2)
|
|
124
|
-
throw new Error("qByteLen must be a number");
|
|
125
|
-
if (typeof e != "function")
|
|
126
|
-
throw new Error("hmacFn must be a function");
|
|
127
|
-
let r = d(t), o = d(t), i = 0;
|
|
128
|
-
const a = () => {
|
|
129
|
-
r.fill(1), o.fill(0), i = 0;
|
|
130
|
-
}, f = (...s) => e(o, r, ...s), c = (s = d(0)) => {
|
|
131
|
-
o = f(A([0]), s), r = f(), s.length !== 0 && (o = f(A([1]), s), r = f());
|
|
132
|
-
}, v = () => {
|
|
133
|
-
if (i++ >= 1e3)
|
|
134
|
-
throw new Error("drbg: tried 1000 values");
|
|
135
|
-
let s = 0;
|
|
136
|
-
const l = [];
|
|
137
|
-
for (; s < n; ) {
|
|
138
|
-
r = f();
|
|
139
|
-
const g = r.slice();
|
|
140
|
-
l.push(g), s += r.length;
|
|
141
|
-
}
|
|
142
|
-
return H(...l);
|
|
143
|
-
};
|
|
144
|
-
return (s, l) => {
|
|
145
|
-
a(), c(s);
|
|
146
|
-
let g;
|
|
147
|
-
for (; !(g = l(v())); )
|
|
148
|
-
c();
|
|
149
|
-
return a(), g;
|
|
150
|
-
};
|
|
151
|
-
}
|
|
152
|
-
const _ = {
|
|
153
|
-
bigint: (t) => typeof t == "bigint",
|
|
154
|
-
function: (t) => typeof t == "function",
|
|
155
|
-
boolean: (t) => typeof t == "boolean",
|
|
156
|
-
string: (t) => typeof t == "string",
|
|
157
|
-
stringOrUint8Array: (t) => typeof t == "string" || b(t),
|
|
158
|
-
isSafeInteger: (t) => Number.isSafeInteger(t),
|
|
159
|
-
array: (t) => Array.isArray(t),
|
|
160
|
-
field: (t, n) => n.Fp.isValid(t),
|
|
161
|
-
hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
|
|
162
|
-
};
|
|
163
|
-
function P(t, n, e = {}) {
|
|
164
|
-
const r = (o, i, a) => {
|
|
165
|
-
const f = _[i];
|
|
166
|
-
if (typeof f != "function")
|
|
167
|
-
throw new Error("invalid validator function");
|
|
168
|
-
const c = t[o];
|
|
169
|
-
if (!(a && c === void 0) && !f(c, t))
|
|
170
|
-
throw new Error("param " + String(o) + " is invalid. Expected " + i + ", got " + c);
|
|
171
|
-
};
|
|
172
|
-
for (const [o, i] of Object.entries(n))
|
|
173
|
-
r(o, i, !1);
|
|
174
|
-
for (const [o, i] of Object.entries(e))
|
|
175
|
-
r(o, i, !0);
|
|
176
|
-
return t;
|
|
177
|
-
}
|
|
178
|
-
function W(t) {
|
|
179
|
-
const n = /* @__PURE__ */ new WeakMap();
|
|
180
|
-
return (e, ...r) => {
|
|
181
|
-
const o = n.get(e);
|
|
182
|
-
if (o !== void 0)
|
|
183
|
-
return o;
|
|
184
|
-
const i = t(e, ...r);
|
|
185
|
-
return n.set(e, i), i;
|
|
1
|
+
import { fromNumber as e } from "./index277.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)
|
|
186
8
|
};
|
|
187
9
|
}
|
|
188
10
|
export {
|
|
189
|
-
|
|
190
|
-
k as abool,
|
|
191
|
-
h as abytes,
|
|
192
|
-
j as bitLen,
|
|
193
|
-
z as bitMask,
|
|
194
|
-
x as bytesToHex,
|
|
195
|
-
O as bytesToNumberBE,
|
|
196
|
-
V as bytesToNumberLE,
|
|
197
|
-
H as concatBytes,
|
|
198
|
-
D as createHmacDrbg,
|
|
199
|
-
M as ensureBytes,
|
|
200
|
-
B as hexToBytes,
|
|
201
|
-
E as hexToNumber,
|
|
202
|
-
I as inRange,
|
|
203
|
-
b as isBytes,
|
|
204
|
-
W as memoized,
|
|
205
|
-
T as numberToBytesBE,
|
|
206
|
-
C as numberToBytesLE,
|
|
207
|
-
F as numberToHexUnpadded,
|
|
208
|
-
P as validateObject
|
|
11
|
+
r as toRpc
|
|
209
12
|
};
|
package/dist/index359.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"});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const w=BigInt(0),m=BigInt(1);function y(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function d(t){if(!y(t))throw new Error("Uint8Array expected")}function I(t,e){if(typeof e!="boolean")throw new Error(t+" boolean expected, got "+e)}function N(t){const e=t.toString(16);return e.length&1?"0"+e:e}function h(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);return t===""?w:BigInt("0x"+t)}const U=typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function",_=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function E(t){if(d(t),U)return t.toHex();let e="";for(let r=0;r<t.length;r++)e+=_[t[r]];return e}const u={_0:48,_9:57,A:65,F:70,a:97,f:102};function B(t){if(t>=u._0&&t<=u._9)return t-u._0;if(t>=u.A&&t<=u.F)return t-(u.A-10);if(t>=u.a&&t<=u.f)return t-(u.a-10)}function A(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);if(U)return Uint8Array.fromHex(t);const e=t.length,r=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const n=new Uint8Array(r);for(let o=0,i=0;o<r;o++,i+=2){const a=B(t.charCodeAt(i)),f=B(t.charCodeAt(i+1));if(a===void 0||f===void 0){const c=t[i]+t[i+1];throw new Error('hex string expected, got non-hex character "'+c+'" at index '+i)}n[o]=a*16+f}return n}function k(t){return h(E(t))}function O(t){return d(t),h(E(Uint8Array.from(t).reverse()))}function T(t,e){return A(t.toString(16).padStart(e*2,"0"))}function F(t,e){return T(t,e).reverse()}function M(t,e,r){let n;if(typeof e=="string")try{n=A(e)}catch(i){throw new Error(t+" must be hex string or Uint8Array, cause: "+i)}else if(y(e))n=Uint8Array.from(e);else throw new Error(t+" must be hex string or Uint8Array");const o=n.length;if(typeof r=="number"&&o!==r)throw new Error(t+" of length "+r+" expected, got "+o);return n}function v(...t){let e=0;for(let n=0;n<t.length;n++){const o=t[n];d(o),e+=o.length}const r=new Uint8Array(e);for(let n=0,o=0;n<t.length;n++){const i=t[n];r.set(i,o),o+=i.length}return r}const b=t=>typeof t=="bigint"&&w<=t;function H(t,e,r){return b(t)&&b(e)&&b(r)&&e<=t&&t<r}function R(t,e,r,n){if(!H(e,r,n))throw new Error("expected valid "+t+": "+r+" <= n < "+n+", got "+e)}function j(t){let e;for(e=0;t>w;t>>=m,e+=1);return e}const V=t=>(m<<BigInt(t))-m,p=t=>new Uint8Array(t),x=t=>Uint8Array.from(t);function z(t,e,r){if(typeof t!="number"||t<2)throw new Error("hashLen must be a number");if(typeof e!="number"||e<2)throw new Error("qByteLen must be a number");if(typeof r!="function")throw new Error("hmacFn must be a function");let n=p(t),o=p(t),i=0;const a=()=>{n.fill(1),o.fill(0),i=0},f=(...s)=>r(o,n,...s),c=(s=p(0))=>{o=f(x([0]),s),n=f(),s.length!==0&&(o=f(x([1]),s),n=f())},S=()=>{if(i++>=1e3)throw new Error("drbg: tried 1000 values");let s=0;const l=[];for(;s<e;){n=f();const g=n.slice();l.push(g),s+=n.length}return v(...l)};return(s,l)=>{a(),c(s);let g;for(;!(g=l(S()));)c();return a(),g}}const C={bigint:t=>typeof t=="bigint",function:t=>typeof t=="function",boolean:t=>typeof t=="boolean",string:t=>typeof t=="string",stringOrUint8Array:t=>typeof t=="string"||y(t),isSafeInteger:t=>Number.isSafeInteger(t),array:t=>Array.isArray(t),field:(t,e)=>e.Fp.isValid(t),hash:t=>typeof t=="function"&&Number.isSafeInteger(t.outputLen)};function D(t,e,r={}){const n=(o,i,a)=>{const f=C[i];if(typeof f!="function")throw new Error("invalid validator function");const c=t[o];if(!(a&&c===void 0)&&!f(c,t))throw new Error("param "+String(o)+" is invalid. Expected "+i+", got "+c)};for(const[o,i]of Object.entries(e))n(o,i,!1);for(const[o,i]of Object.entries(r))n(o,i,!0);return t}function L(t){const e=new WeakMap;return(r,...n)=>{const o=e.get(r);if(o!==void 0)return o;const i=t(r,...n);return e.set(r,i),i}}exports.aInRange=R;exports.abool=I;exports.abytes=d;exports.bitLen=j;exports.bitMask=V;exports.bytesToHex=E;exports.bytesToNumberBE=k;exports.bytesToNumberLE=O;exports.concatBytes=v;exports.createHmacDrbg=z;exports.ensureBytes=M;exports.hexToBytes=A;exports.hexToNumber=h;exports.inRange=H;exports.isBytes=y;exports.memoized=L;exports.numberToBytesBE=T;exports.numberToBytesLE=F;exports.numberToHexUnpadded=N;exports.validateObject=D;
|
package/dist/index359.js
CHANGED
|
@@ -1,12 +1,209 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
1
|
+
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
2
|
+
const w = /* @__PURE__ */ BigInt(0), p = /* @__PURE__ */ BigInt(1);
|
|
3
|
+
function b(t) {
|
|
4
|
+
return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
|
|
5
|
+
}
|
|
6
|
+
function h(t) {
|
|
7
|
+
if (!b(t))
|
|
8
|
+
throw new Error("Uint8Array expected");
|
|
9
|
+
}
|
|
10
|
+
function k(t, n) {
|
|
11
|
+
if (typeof n != "boolean")
|
|
12
|
+
throw new Error(t + " boolean expected, got " + n);
|
|
13
|
+
}
|
|
14
|
+
function F(t) {
|
|
15
|
+
const n = t.toString(16);
|
|
16
|
+
return n.length & 1 ? "0" + n : n;
|
|
17
|
+
}
|
|
18
|
+
function E(t) {
|
|
19
|
+
if (typeof t != "string")
|
|
20
|
+
throw new Error("hex string expected, got " + typeof t);
|
|
21
|
+
return t === "" ? w : BigInt("0x" + t);
|
|
22
|
+
}
|
|
23
|
+
const U = (
|
|
24
|
+
// @ts-ignore
|
|
25
|
+
typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function"
|
|
26
|
+
), S = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
|
|
27
|
+
function x(t) {
|
|
28
|
+
if (h(t), U)
|
|
29
|
+
return t.toHex();
|
|
30
|
+
let n = "";
|
|
31
|
+
for (let e = 0; e < t.length; e++)
|
|
32
|
+
n += S[t[e]];
|
|
33
|
+
return n;
|
|
34
|
+
}
|
|
35
|
+
const u = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
|
|
36
|
+
function m(t) {
|
|
37
|
+
if (t >= u._0 && t <= u._9)
|
|
38
|
+
return t - u._0;
|
|
39
|
+
if (t >= u.A && t <= u.F)
|
|
40
|
+
return t - (u.A - 10);
|
|
41
|
+
if (t >= u.a && t <= u.f)
|
|
42
|
+
return t - (u.a - 10);
|
|
43
|
+
}
|
|
44
|
+
function B(t) {
|
|
45
|
+
if (typeof t != "string")
|
|
46
|
+
throw new Error("hex string expected, got " + typeof t);
|
|
47
|
+
if (U)
|
|
48
|
+
return Uint8Array.fromHex(t);
|
|
49
|
+
const n = t.length, e = n / 2;
|
|
50
|
+
if (n % 2)
|
|
51
|
+
throw new Error("hex string expected, got unpadded hex of length " + n);
|
|
52
|
+
const r = new Uint8Array(e);
|
|
53
|
+
for (let o = 0, i = 0; o < e; o++, i += 2) {
|
|
54
|
+
const a = m(t.charCodeAt(i)), f = m(t.charCodeAt(i + 1));
|
|
55
|
+
if (a === void 0 || f === void 0) {
|
|
56
|
+
const c = t[i] + t[i + 1];
|
|
57
|
+
throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i);
|
|
58
|
+
}
|
|
59
|
+
r[o] = a * 16 + f;
|
|
60
|
+
}
|
|
61
|
+
return r;
|
|
62
|
+
}
|
|
63
|
+
function O(t) {
|
|
64
|
+
return E(x(t));
|
|
65
|
+
}
|
|
66
|
+
function V(t) {
|
|
67
|
+
return h(t), E(x(Uint8Array.from(t).reverse()));
|
|
68
|
+
}
|
|
69
|
+
function T(t, n) {
|
|
70
|
+
return B(t.toString(16).padStart(n * 2, "0"));
|
|
71
|
+
}
|
|
72
|
+
function C(t, n) {
|
|
73
|
+
return T(t, n).reverse();
|
|
74
|
+
}
|
|
75
|
+
function M(t, n, e) {
|
|
76
|
+
let r;
|
|
77
|
+
if (typeof n == "string")
|
|
78
|
+
try {
|
|
79
|
+
r = B(n);
|
|
80
|
+
} catch (i) {
|
|
81
|
+
throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
|
|
82
|
+
}
|
|
83
|
+
else if (b(n))
|
|
84
|
+
r = Uint8Array.from(n);
|
|
85
|
+
else
|
|
86
|
+
throw new Error(t + " must be hex string or Uint8Array");
|
|
87
|
+
const o = r.length;
|
|
88
|
+
if (typeof e == "number" && o !== e)
|
|
89
|
+
throw new Error(t + " of length " + e + " expected, got " + o);
|
|
90
|
+
return r;
|
|
91
|
+
}
|
|
92
|
+
function H(...t) {
|
|
93
|
+
let n = 0;
|
|
94
|
+
for (let r = 0; r < t.length; r++) {
|
|
95
|
+
const o = t[r];
|
|
96
|
+
h(o), n += o.length;
|
|
97
|
+
}
|
|
98
|
+
const e = new Uint8Array(n);
|
|
99
|
+
for (let r = 0, o = 0; r < t.length; r++) {
|
|
100
|
+
const i = t[r];
|
|
101
|
+
e.set(i, o), o += i.length;
|
|
102
|
+
}
|
|
103
|
+
return e;
|
|
104
|
+
}
|
|
105
|
+
const y = (t) => typeof t == "bigint" && w <= t;
|
|
106
|
+
function I(t, n, e) {
|
|
107
|
+
return y(t) && y(n) && y(e) && n <= t && t < e;
|
|
108
|
+
}
|
|
109
|
+
function R(t, n, e, r) {
|
|
110
|
+
if (!I(n, e, r))
|
|
111
|
+
throw new Error("expected valid " + t + ": " + e + " <= n < " + r + ", got " + n);
|
|
112
|
+
}
|
|
113
|
+
function j(t) {
|
|
114
|
+
let n;
|
|
115
|
+
for (n = 0; t > w; t >>= p, n += 1)
|
|
116
|
+
;
|
|
117
|
+
return n;
|
|
118
|
+
}
|
|
119
|
+
const z = (t) => (p << BigInt(t)) - p, d = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
|
|
120
|
+
function D(t, n, e) {
|
|
121
|
+
if (typeof t != "number" || t < 2)
|
|
122
|
+
throw new Error("hashLen must be a number");
|
|
123
|
+
if (typeof n != "number" || n < 2)
|
|
124
|
+
throw new Error("qByteLen must be a number");
|
|
125
|
+
if (typeof e != "function")
|
|
126
|
+
throw new Error("hmacFn must be a function");
|
|
127
|
+
let r = d(t), o = d(t), i = 0;
|
|
128
|
+
const a = () => {
|
|
129
|
+
r.fill(1), o.fill(0), i = 0;
|
|
130
|
+
}, f = (...s) => e(o, r, ...s), c = (s = d(0)) => {
|
|
131
|
+
o = f(A([0]), s), r = f(), s.length !== 0 && (o = f(A([1]), s), r = f());
|
|
132
|
+
}, v = () => {
|
|
133
|
+
if (i++ >= 1e3)
|
|
134
|
+
throw new Error("drbg: tried 1000 values");
|
|
135
|
+
let s = 0;
|
|
136
|
+
const l = [];
|
|
137
|
+
for (; s < n; ) {
|
|
138
|
+
r = f();
|
|
139
|
+
const g = r.slice();
|
|
140
|
+
l.push(g), s += r.length;
|
|
141
|
+
}
|
|
142
|
+
return H(...l);
|
|
143
|
+
};
|
|
144
|
+
return (s, l) => {
|
|
145
|
+
a(), c(s);
|
|
146
|
+
let g;
|
|
147
|
+
for (; !(g = l(v())); )
|
|
148
|
+
c();
|
|
149
|
+
return a(), g;
|
|
150
|
+
};
|
|
151
|
+
}
|
|
152
|
+
const _ = {
|
|
153
|
+
bigint: (t) => typeof t == "bigint",
|
|
154
|
+
function: (t) => typeof t == "function",
|
|
155
|
+
boolean: (t) => typeof t == "boolean",
|
|
156
|
+
string: (t) => typeof t == "string",
|
|
157
|
+
stringOrUint8Array: (t) => typeof t == "string" || b(t),
|
|
158
|
+
isSafeInteger: (t) => Number.isSafeInteger(t),
|
|
159
|
+
array: (t) => Array.isArray(t),
|
|
160
|
+
field: (t, n) => n.Fp.isValid(t),
|
|
161
|
+
hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
|
|
162
|
+
};
|
|
163
|
+
function P(t, n, e = {}) {
|
|
164
|
+
const r = (o, i, a) => {
|
|
165
|
+
const f = _[i];
|
|
166
|
+
if (typeof f != "function")
|
|
167
|
+
throw new Error("invalid validator function");
|
|
168
|
+
const c = t[o];
|
|
169
|
+
if (!(a && c === void 0) && !f(c, t))
|
|
170
|
+
throw new Error("param " + String(o) + " is invalid. Expected " + i + ", got " + c);
|
|
171
|
+
};
|
|
172
|
+
for (const [o, i] of Object.entries(n))
|
|
173
|
+
r(o, i, !1);
|
|
174
|
+
for (const [o, i] of Object.entries(e))
|
|
175
|
+
r(o, i, !0);
|
|
176
|
+
return t;
|
|
177
|
+
}
|
|
178
|
+
function W(t) {
|
|
179
|
+
const n = /* @__PURE__ */ new WeakMap();
|
|
180
|
+
return (e, ...r) => {
|
|
181
|
+
const o = n.get(e);
|
|
182
|
+
if (o !== void 0)
|
|
183
|
+
return o;
|
|
184
|
+
const i = t(e, ...r);
|
|
185
|
+
return n.set(e, i), i;
|
|
8
186
|
};
|
|
9
187
|
}
|
|
10
188
|
export {
|
|
11
|
-
|
|
189
|
+
R as aInRange,
|
|
190
|
+
k as abool,
|
|
191
|
+
h as abytes,
|
|
192
|
+
j as bitLen,
|
|
193
|
+
z as bitMask,
|
|
194
|
+
x as bytesToHex,
|
|
195
|
+
O as bytesToNumberBE,
|
|
196
|
+
V as bytesToNumberLE,
|
|
197
|
+
H as concatBytes,
|
|
198
|
+
D as createHmacDrbg,
|
|
199
|
+
M as ensureBytes,
|
|
200
|
+
B as hexToBytes,
|
|
201
|
+
E as hexToNumber,
|
|
202
|
+
I as inRange,
|
|
203
|
+
b as isBytes,
|
|
204
|
+
W as memoized,
|
|
205
|
+
T as numberToBytesBE,
|
|
206
|
+
C as numberToBytesLE,
|
|
207
|
+
F as numberToHexUnpadded,
|
|
208
|
+
P as validateObject
|
|
12
209
|
};
|
package/dist/index360.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index361.cjs");class n{constructor(t){this.bytePosition=0,this.dataView=new DataView(t.buffer,t.byteOffset,t.byteLength)}shift(t){return this.bytePosition+=t,this}read8(){const t=this.dataView.getUint8(this.bytePosition);return this.shift(1),t}read16(){const t=this.dataView.getUint16(this.bytePosition,!0);return this.shift(2),t}read32(){const t=this.dataView.getUint32(this.bytePosition,!0);return this.shift(4),t}read64(){const t=this.read32(),e=this.read32().toString(16)+t.toString(16).padStart(8,"0");return BigInt("0x"+e).toString(10)}read128(){const t=BigInt(this.read64()),e=BigInt(this.read64()).toString(16)+t.toString(16).padStart(16,"0");return BigInt("0x"+e).toString(10)}read256(){const t=BigInt(this.read128()),e=BigInt(this.read128()).toString(16)+t.toString(16).padStart(32,"0");return BigInt("0x"+e).toString(10)}readBytes(t){const i=this.bytePosition+this.dataView.byteOffset,e=new Uint8Array(this.dataView.buffer,i,t);return this.shift(t),e}readULEB(){const t=this.bytePosition+this.dataView.byteOffset,i=new Uint8Array(this.dataView.buffer,t),{value:e,length:s}=r.ulebDecode(i);return this.shift(s),e}readVec(t){const i=this.readULEB(),e=[];for(let s=0;s<i;s++)e.push(t(this,s,i));return e}}exports.BcsReader=n;
|
package/dist/index360.js
CHANGED
|
@@ -1,71 +1,97 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
1
|
+
import { ulebDecode as r } from "./index361.js";
|
|
2
|
+
class o {
|
|
3
|
+
/**
|
|
4
|
+
* @param {Uint8Array} data Data to use as a buffer.
|
|
5
|
+
*/
|
|
6
|
+
constructor(t) {
|
|
7
|
+
this.bytePosition = 0, this.dataView = new DataView(t.buffer, t.byteOffset, t.byteLength);
|
|
8
|
+
}
|
|
9
|
+
/**
|
|
10
|
+
* Shift current cursor position by `bytes`.
|
|
11
|
+
*
|
|
12
|
+
* @param {Number} bytes Number of bytes to
|
|
13
|
+
* @returns {this} Self for possible chaining.
|
|
14
|
+
*/
|
|
15
|
+
shift(t) {
|
|
16
|
+
return this.bytePosition += t, this;
|
|
17
|
+
}
|
|
18
|
+
/**
|
|
19
|
+
* Read U8 value from the buffer and shift cursor by 1.
|
|
20
|
+
* @returns
|
|
21
|
+
*/
|
|
22
|
+
read8() {
|
|
23
|
+
const t = this.dataView.getUint8(this.bytePosition);
|
|
24
|
+
return this.shift(1), t;
|
|
25
|
+
}
|
|
26
|
+
/**
|
|
27
|
+
* Read U16 value from the buffer and shift cursor by 2.
|
|
28
|
+
* @returns
|
|
29
|
+
*/
|
|
30
|
+
read16() {
|
|
31
|
+
const t = this.dataView.getUint16(this.bytePosition, !0);
|
|
32
|
+
return this.shift(2), t;
|
|
33
|
+
}
|
|
34
|
+
/**
|
|
35
|
+
* Read U32 value from the buffer and shift cursor by 4.
|
|
36
|
+
* @returns
|
|
37
|
+
*/
|
|
38
|
+
read32() {
|
|
39
|
+
const t = this.dataView.getUint32(this.bytePosition, !0);
|
|
40
|
+
return this.shift(4), t;
|
|
41
|
+
}
|
|
42
|
+
/**
|
|
43
|
+
* Read U64 value from the buffer and shift cursor by 8.
|
|
44
|
+
* @returns
|
|
45
|
+
*/
|
|
46
|
+
read64() {
|
|
47
|
+
const t = this.read32(), e = this.read32().toString(16) + t.toString(16).padStart(8, "0");
|
|
48
|
+
return BigInt("0x" + e).toString(10);
|
|
49
|
+
}
|
|
50
|
+
/**
|
|
51
|
+
* Read U128 value from the buffer and shift cursor by 16.
|
|
52
|
+
*/
|
|
53
|
+
read128() {
|
|
54
|
+
const t = BigInt(this.read64()), e = BigInt(this.read64()).toString(16) + t.toString(16).padStart(16, "0");
|
|
55
|
+
return BigInt("0x" + e).toString(10);
|
|
56
|
+
}
|
|
57
|
+
/**
|
|
58
|
+
* Read U128 value from the buffer and shift cursor by 32.
|
|
59
|
+
* @returns
|
|
60
|
+
*/
|
|
61
|
+
read256() {
|
|
62
|
+
const t = BigInt(this.read128()), e = BigInt(this.read128()).toString(16) + t.toString(16).padStart(32, "0");
|
|
63
|
+
return BigInt("0x" + e).toString(10);
|
|
64
|
+
}
|
|
65
|
+
/**
|
|
66
|
+
* Read `num` number of bytes from the buffer and shift cursor by `num`.
|
|
67
|
+
* @param num Number of bytes to read.
|
|
68
|
+
*/
|
|
69
|
+
readBytes(t) {
|
|
70
|
+
const i = this.bytePosition + this.dataView.byteOffset, e = new Uint8Array(this.dataView.buffer, i, t);
|
|
71
|
+
return this.shift(t), e;
|
|
72
|
+
}
|
|
73
|
+
/**
|
|
74
|
+
* Read ULEB value - an integer of varying size. Used for enum indexes and
|
|
75
|
+
* vector lengths.
|
|
76
|
+
* @returns {Number} The ULEB value.
|
|
77
|
+
*/
|
|
78
|
+
readULEB() {
|
|
79
|
+
const t = this.bytePosition + this.dataView.byteOffset, i = new Uint8Array(this.dataView.buffer, t), { value: e, length: s } = r(i);
|
|
80
|
+
return this.shift(s), e;
|
|
81
|
+
}
|
|
82
|
+
/**
|
|
83
|
+
* Read a BCS vector: read a length and then apply function `cb` X times
|
|
84
|
+
* where X is the length of the vector, defined as ULEB in BCS bytes.
|
|
85
|
+
* @param cb Callback to process elements of vector.
|
|
86
|
+
* @returns {Array<Any>} Array of the resulting values, returned by callback.
|
|
87
|
+
*/
|
|
88
|
+
readVec(t) {
|
|
89
|
+
const i = this.readULEB(), e = [];
|
|
90
|
+
for (let s = 0; s < i; s++)
|
|
91
|
+
e.push(t(this, s, i));
|
|
92
|
+
return e;
|
|
93
|
+
}
|
|
13
94
|
}
|
|
14
|
-
const p = /* @__PURE__ */ new Map([
|
|
15
|
-
// Unnamed
|
|
16
|
-
["address", { type: "address" }],
|
|
17
|
-
["bool", { type: "bool" }],
|
|
18
|
-
["bytes", { type: "bytes" }],
|
|
19
|
-
["bytes32", { type: "bytes32" }],
|
|
20
|
-
["int", { type: "int256" }],
|
|
21
|
-
["int256", { type: "int256" }],
|
|
22
|
-
["string", { type: "string" }],
|
|
23
|
-
["uint", { type: "uint256" }],
|
|
24
|
-
["uint8", { type: "uint8" }],
|
|
25
|
-
["uint16", { type: "uint16" }],
|
|
26
|
-
["uint24", { type: "uint24" }],
|
|
27
|
-
["uint32", { type: "uint32" }],
|
|
28
|
-
["uint64", { type: "uint64" }],
|
|
29
|
-
["uint96", { type: "uint96" }],
|
|
30
|
-
["uint112", { type: "uint112" }],
|
|
31
|
-
["uint160", { type: "uint160" }],
|
|
32
|
-
["uint192", { type: "uint192" }],
|
|
33
|
-
["uint256", { type: "uint256" }],
|
|
34
|
-
// Named
|
|
35
|
-
["address owner", { type: "address", name: "owner" }],
|
|
36
|
-
["address to", { type: "address", name: "to" }],
|
|
37
|
-
["bool approved", { type: "bool", name: "approved" }],
|
|
38
|
-
["bytes _data", { type: "bytes", name: "_data" }],
|
|
39
|
-
["bytes data", { type: "bytes", name: "data" }],
|
|
40
|
-
["bytes signature", { type: "bytes", name: "signature" }],
|
|
41
|
-
["bytes32 hash", { type: "bytes32", name: "hash" }],
|
|
42
|
-
["bytes32 r", { type: "bytes32", name: "r" }],
|
|
43
|
-
["bytes32 root", { type: "bytes32", name: "root" }],
|
|
44
|
-
["bytes32 s", { type: "bytes32", name: "s" }],
|
|
45
|
-
["string name", { type: "string", name: "name" }],
|
|
46
|
-
["string symbol", { type: "string", name: "symbol" }],
|
|
47
|
-
["string tokenURI", { type: "string", name: "tokenURI" }],
|
|
48
|
-
["uint tokenId", { type: "uint256", name: "tokenId" }],
|
|
49
|
-
["uint8 v", { type: "uint8", name: "v" }],
|
|
50
|
-
["uint256 balance", { type: "uint256", name: "balance" }],
|
|
51
|
-
["uint256 tokenId", { type: "uint256", name: "tokenId" }],
|
|
52
|
-
["uint256 value", { type: "uint256", name: "value" }],
|
|
53
|
-
// Indexed
|
|
54
|
-
[
|
|
55
|
-
"event:address indexed from",
|
|
56
|
-
{ type: "address", name: "from", indexed: !0 }
|
|
57
|
-
],
|
|
58
|
-
["event:address indexed to", { type: "address", name: "to", indexed: !0 }],
|
|
59
|
-
[
|
|
60
|
-
"event:uint indexed tokenId",
|
|
61
|
-
{ type: "uint256", name: "tokenId", indexed: !0 }
|
|
62
|
-
],
|
|
63
|
-
[
|
|
64
|
-
"event:uint256 indexed tokenId",
|
|
65
|
-
{ type: "uint256", name: "tokenId", indexed: !0 }
|
|
66
|
-
]
|
|
67
|
-
]);
|
|
68
95
|
export {
|
|
69
|
-
|
|
70
|
-
p as parameterCache
|
|
96
|
+
o as BcsReader
|
|
71
97
|
};
|
package/dist/index361.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function l(n){let e=BigInt(n);const t=[];let r=0;if(e===0n)return[0];for(;e>0;)t[r]=Number(e&0x7fn),e>>=7n,e>0n&&(t[r]|=128),r+=1;return t}function u(n){let e=0n,t=0n,r=0;for(;;){if(r>=n.length)throw new Error("ULEB decode error: buffer overflow");const o=n[r];if(r+=1,e+=BigInt(o&127)<<t,!(o&128))break;t+=7n}if(e>BigInt(Number.MAX_SAFE_INTEGER))throw new Error("ULEB decode error: value exceeds MAX_SAFE_INTEGER");return{value:Number(e),length:r}}exports.ulebDecode=u;exports.ulebEncode=l;
|