@gardenfi/utils 2.1.1 → 2.1.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/index101.cjs +1 -1
- package/dist/index101.js +1 -1
- package/dist/index104.cjs +1 -1
- package/dist/index104.js +16 -10
- package/dist/index105.cjs +1 -1
- package/dist/index105.js +3 -3
- package/dist/index106.cjs +1 -1
- package/dist/index106.js +2 -2
- package/dist/index107.cjs +1 -1
- package/dist/index107.js +10 -16
- package/dist/index109.cjs +2 -1
- package/dist/index109.js +3 -2
- package/dist/index110.cjs +1 -1
- package/dist/index110.js +2 -2
- package/dist/index111.cjs +1 -1
- package/dist/index111.js +2 -38
- package/dist/index112.cjs +1 -1
- package/dist/index112.js +33 -34
- package/dist/index113.cjs +1 -2
- package/dist/index113.js +39 -3
- package/dist/index116.cjs +1 -1
- package/dist/index116.js +2 -2
- package/dist/index117.cjs +1 -1
- package/dist/index117.js +1 -1
- package/dist/index23.cjs +1 -1
- package/dist/index23.js +3 -3
- package/dist/index24.cjs +1 -1
- package/dist/index24.js +2 -2
- package/dist/index32.cjs +1 -1
- package/dist/index32.js +1 -1
- package/dist/index33.cjs +1 -1
- package/dist/index33.js +1 -1
- package/dist/index35.cjs +1 -1
- package/dist/index35.js +2 -2
- package/dist/index36.cjs +1 -1
- package/dist/index36.js +3 -3
- package/dist/index38.cjs +1 -1
- package/dist/index38.js +1 -1
- package/dist/index39.cjs +1 -1
- package/dist/index39.js +2 -2
- package/dist/index40.cjs +1 -1
- package/dist/index40.js +9 -9
- package/dist/index41.cjs +1 -1
- package/dist/index41.js +2 -2
- package/dist/index42.cjs +1 -1
- package/dist/index42.js +1 -1
- package/dist/index44.cjs +1 -1
- package/dist/index44.js +1 -1
- package/dist/index49.cjs +1 -1
- package/dist/index49.js +1 -1
- package/dist/index60.cjs +1 -1
- package/dist/index60.js +38 -10
- package/dist/index61.cjs +1 -1
- package/dist/index61.js +32 -32
- package/dist/index62.cjs +1 -1
- package/dist/index62.js +66 -109
- package/dist/index63.cjs +1 -1
- package/dist/index63.js +112 -16
- package/dist/index64.cjs +1 -1
- package/dist/index64.js +60 -216
- package/dist/index65.cjs +1 -2
- package/dist/index65.js +2 -60
- package/dist/index66.cjs +1 -1
- package/dist/index66.js +16 -21
- package/dist/index67.cjs +1 -1
- package/dist/index67.js +219 -36
- package/dist/index68.cjs +1 -1
- package/dist/index68.js +229 -32
- package/dist/index69.cjs +1 -1
- package/dist/index69.js +9 -66
- package/dist/index70.cjs +1 -1
- package/dist/index70.js +31 -64
- package/dist/index71.cjs +2 -1
- package/dist/index71.js +60 -2
- package/dist/index72.cjs +1 -1
- package/dist/index72.js +18 -228
- package/dist/index74.cjs +1 -1
- package/dist/index74.js +1 -1
- package/dist/index75.cjs +1 -1
- package/dist/index75.js +8 -4
- package/dist/index76.cjs +1 -1
- package/dist/index76.js +104 -3
- package/dist/index77.cjs +1 -1
- package/dist/index77.js +3 -8
- package/dist/index78.cjs +1 -1
- package/dist/index78.js +17 -104
- package/dist/index79.cjs +1 -1
- package/dist/index79.js +8 -17
- package/dist/index80.cjs +1 -1
- package/dist/index80.js +10 -8
- package/dist/index81.cjs +1 -1
- package/dist/index81.js +11 -10
- package/dist/index82.cjs +1 -1
- package/dist/index82.js +13 -11
- package/dist/index83.cjs +1 -1
- package/dist/index83.js +6 -13
- package/dist/index84.cjs +1 -1
- package/dist/index84.js +78 -6
- package/dist/index85.cjs +1 -1
- package/dist/index85.js +14 -78
- package/dist/index86.cjs +1 -1
- package/dist/index86.js +18 -14
- package/dist/index87.cjs +1 -1
- package/dist/index87.js +189 -16
- package/dist/index88.cjs +1 -1
- package/dist/index88.js +58 -185
- package/dist/index89.cjs +1 -1
- package/dist/index89.js +4 -64
- package/dist/index9.cjs +1 -1
- package/dist/index9.js +49 -41
- package/dist/index91.cjs +1 -1
- package/dist/index91.js +1 -1
- package/dist/index93.cjs +1 -1
- package/dist/index93.js +2 -2
- package/dist/index94.cjs +1 -1
- package/dist/index94.js +1 -1
- package/dist/index98.cjs +1 -1
- package/dist/index98.js +2 -2
- package/dist/index99.cjs +1 -1
- package/dist/index99.js +1 -1
- package/package.json +1 -1
package/dist/index70.js
CHANGED
|
@@ -1,70 +1,37 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
if (typeof o.setBigUint64 == "function")
|
|
5
|
-
return o.setBigUint64(t, s, i);
|
|
6
|
-
const n = BigInt(32), h = BigInt(4294967295), e = Number(s >> n & h), r = Number(s & h), u = i ? 4 : 0, c = i ? 0 : 4;
|
|
7
|
-
o.setUint32(t + u, e, i), o.setUint32(t + c, r, i);
|
|
1
|
+
import { SizeExceedsPaddingSizeError as d } from "./index107.js";
|
|
2
|
+
function f(n, { dir: r, size: t = 32 } = {}) {
|
|
3
|
+
return typeof n == "string" ? p(n, { dir: r, size: t }) : i(n, { dir: r, size: t });
|
|
8
4
|
}
|
|
9
|
-
function
|
|
10
|
-
|
|
5
|
+
function p(n, { dir: r, size: t = 32 } = {}) {
|
|
6
|
+
if (t === null)
|
|
7
|
+
return n;
|
|
8
|
+
const e = n.replace("0x", "");
|
|
9
|
+
if (e.length > t * 2)
|
|
10
|
+
throw new d({
|
|
11
|
+
size: Math.ceil(e.length / 2),
|
|
12
|
+
targetSize: t,
|
|
13
|
+
type: "hex"
|
|
14
|
+
});
|
|
15
|
+
return `0x${e[r === "right" ? "padEnd" : "padStart"](t * 2, "0")}`;
|
|
11
16
|
}
|
|
12
|
-
function
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
const
|
|
24
|
-
|
|
25
|
-
const r = Math.min(n - this.pos, h - e);
|
|
26
|
-
if (r === n) {
|
|
27
|
-
const u = p(t);
|
|
28
|
-
for (; n <= h - e; e += n)
|
|
29
|
-
this.process(u, e);
|
|
30
|
-
continue;
|
|
31
|
-
}
|
|
32
|
-
i.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === n && (this.process(s, 0), this.pos = 0);
|
|
33
|
-
}
|
|
34
|
-
return this.length += t.length, this.roundClean(), this;
|
|
35
|
-
}
|
|
36
|
-
digestInto(t) {
|
|
37
|
-
g(this), d(t, this), this.finished = !0;
|
|
38
|
-
const { buffer: s, view: i, blockLen: n, isLE: h } = this;
|
|
39
|
-
let { pos: e } = this;
|
|
40
|
-
s[e++] = 128, this.buffer.subarray(e).fill(0), this.padOffset > n - e && (this.process(i, 0), e = 0);
|
|
41
|
-
for (let f = e; f < n; f++)
|
|
42
|
-
s[f] = 0;
|
|
43
|
-
w(i, n - 8, BigInt(this.length * 8), h), this.process(i, 0);
|
|
44
|
-
const r = p(t), u = this.outputLen;
|
|
45
|
-
if (u % 4)
|
|
46
|
-
throw new Error("_sha2: outputLen should be aligned to 32bit");
|
|
47
|
-
const c = u / 4, l = this.get();
|
|
48
|
-
if (c > l.length)
|
|
49
|
-
throw new Error("_sha2: outputLen bigger than state");
|
|
50
|
-
for (let f = 0; f < c; f++)
|
|
51
|
-
r.setUint32(4 * f, l[f], h);
|
|
52
|
-
}
|
|
53
|
-
digest() {
|
|
54
|
-
const { buffer: t, outputLen: s } = this;
|
|
55
|
-
this.digestInto(t);
|
|
56
|
-
const i = t.slice(0, s);
|
|
57
|
-
return this.destroy(), i;
|
|
58
|
-
}
|
|
59
|
-
_cloneInto(t) {
|
|
60
|
-
t || (t = new this.constructor()), t.set(...this.get());
|
|
61
|
-
const { blockLen: s, buffer: i, length: n, finished: h, destroyed: e, pos: r } = this;
|
|
62
|
-
return t.length = n, t.pos = r, t.finished = h, t.destroyed = e, n % s && t.buffer.set(i), t;
|
|
17
|
+
function i(n, { dir: r, size: t = 32 } = {}) {
|
|
18
|
+
if (t === null)
|
|
19
|
+
return n;
|
|
20
|
+
if (n.length > t)
|
|
21
|
+
throw new d({
|
|
22
|
+
size: n.length,
|
|
23
|
+
targetSize: t,
|
|
24
|
+
type: "bytes"
|
|
25
|
+
});
|
|
26
|
+
const e = new Uint8Array(t);
|
|
27
|
+
for (let a = 0; a < t; a++) {
|
|
28
|
+
const o = r === "right";
|
|
29
|
+
e[o ? a : t - a - 1] = n[o ? a : n.length - a - 1];
|
|
63
30
|
}
|
|
31
|
+
return e;
|
|
64
32
|
}
|
|
65
33
|
export {
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
w as setBigUint64
|
|
34
|
+
f as pad,
|
|
35
|
+
i as padBytes,
|
|
36
|
+
p as padHex
|
|
70
37
|
};
|
package/dist/index71.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 l=require("./index90.cjs");let i={getDocsUrl:({docsBaseUrl:s,docsPath:t="",docsSlug:e})=>t?`${s??"https://viem.sh"}${t}${e?`#${e}`:""}`:void 0,version:`viem@${l.version}`};class u extends Error{constructor(t,e={}){var o;const r=(()=>{var c;return e.cause instanceof u?e.cause.details:(c=e.cause)!=null&&c.message?e.cause.message:e.details})(),n=e.cause instanceof u&&e.cause.docsPath||e.docsPath,a=(o=i.getDocsUrl)==null?void 0:o.call(i,{...e,docsPath:n}),b=[t||"An error occurred.","",...e.metaMessages?[...e.metaMessages,""]:[],...a?[`Docs: ${a}`]:[],...r?[`Details: ${r}`]:[],...i.version?[`Version: ${i.version}`]:[]].join(`
|
|
2
|
+
`);super(b,e.cause?{cause:e.cause}:void 0),Object.defineProperty(this,"details",{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,"metaMessages",{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,"version",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"BaseError"}),this.details=r,this.docsPath=n,this.metaMessages=e.metaMessages,this.name=e.name??this.name,this.shortMessage=t,this.version=l.version}walk(t){return d(this,t)}}function d(s,t){return t!=null&&t(s)?s:s&&typeof s=="object"&&"cause"in s&&s.cause!==void 0?d(s.cause,t):t?null:s}exports.BaseError=u;
|
package/dist/index71.js
CHANGED
|
@@ -1,4 +1,62 @@
|
|
|
1
|
-
|
|
1
|
+
import { version as l } from "./index90.js";
|
|
2
|
+
let i = {
|
|
3
|
+
getDocsUrl: ({ docsBaseUrl: s, docsPath: t = "", docsSlug: e }) => t ? `${s ?? "https://viem.sh"}${t}${e ? `#${e}` : ""}` : void 0,
|
|
4
|
+
version: `viem@${l}`
|
|
5
|
+
};
|
|
6
|
+
class r extends Error {
|
|
7
|
+
constructor(t, e = {}) {
|
|
8
|
+
var o;
|
|
9
|
+
const u = (() => {
|
|
10
|
+
var c;
|
|
11
|
+
return e.cause instanceof r ? e.cause.details : (c = e.cause) != null && c.message ? e.cause.message : e.details;
|
|
12
|
+
})(), a = e.cause instanceof r && e.cause.docsPath || e.docsPath, n = (o = i.getDocsUrl) == null ? void 0 : o.call(i, { ...e, docsPath: a }), b = [
|
|
13
|
+
t || "An error occurred.",
|
|
14
|
+
"",
|
|
15
|
+
...e.metaMessages ? [...e.metaMessages, ""] : [],
|
|
16
|
+
...n ? [`Docs: ${n}`] : [],
|
|
17
|
+
...u ? [`Details: ${u}`] : [],
|
|
18
|
+
...i.version ? [`Version: ${i.version}`] : []
|
|
19
|
+
].join(`
|
|
20
|
+
`);
|
|
21
|
+
super(b, e.cause ? { cause: e.cause } : void 0), Object.defineProperty(this, "details", {
|
|
22
|
+
enumerable: !0,
|
|
23
|
+
configurable: !0,
|
|
24
|
+
writable: !0,
|
|
25
|
+
value: void 0
|
|
26
|
+
}), Object.defineProperty(this, "docsPath", {
|
|
27
|
+
enumerable: !0,
|
|
28
|
+
configurable: !0,
|
|
29
|
+
writable: !0,
|
|
30
|
+
value: void 0
|
|
31
|
+
}), Object.defineProperty(this, "metaMessages", {
|
|
32
|
+
enumerable: !0,
|
|
33
|
+
configurable: !0,
|
|
34
|
+
writable: !0,
|
|
35
|
+
value: void 0
|
|
36
|
+
}), Object.defineProperty(this, "shortMessage", {
|
|
37
|
+
enumerable: !0,
|
|
38
|
+
configurable: !0,
|
|
39
|
+
writable: !0,
|
|
40
|
+
value: void 0
|
|
41
|
+
}), Object.defineProperty(this, "version", {
|
|
42
|
+
enumerable: !0,
|
|
43
|
+
configurable: !0,
|
|
44
|
+
writable: !0,
|
|
45
|
+
value: void 0
|
|
46
|
+
}), Object.defineProperty(this, "name", {
|
|
47
|
+
enumerable: !0,
|
|
48
|
+
configurable: !0,
|
|
49
|
+
writable: !0,
|
|
50
|
+
value: "BaseError"
|
|
51
|
+
}), this.details = u, this.docsPath = a, this.metaMessages = e.metaMessages, this.name = e.name ?? this.name, this.shortMessage = t, this.version = l;
|
|
52
|
+
}
|
|
53
|
+
walk(t) {
|
|
54
|
+
return d(this, t);
|
|
55
|
+
}
|
|
56
|
+
}
|
|
57
|
+
function d(s, t) {
|
|
58
|
+
return t != null && t(s) ? s : s && typeof s == "object" && "cause" in s && s.cause !== void 0 ? d(s.cause, t) : t ? null : s;
|
|
59
|
+
}
|
|
2
60
|
export {
|
|
3
|
-
|
|
61
|
+
r as BaseError
|
|
4
62
|
};
|
package/dist/index72.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"})
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});class i extends Map{constructor(e){super(),Object.defineProperty(this,"maxSize",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),this.maxSize=e}get(e){const t=super.get(e);return super.has(e)&&t!==void 0&&(this.delete(e),super.set(e,t)),t}set(e,t){if(super.set(e,t),this.maxSize&&this.size>this.maxSize){const s=this.keys().next().value;s&&this.delete(s)}return this}}exports.LruMap=i;
|
package/dist/index72.js
CHANGED
|
@@ -1,234 +1,24 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
}
|
|
10
|
-
function O(t, n) {
|
|
11
|
-
if (typeof n != "boolean")
|
|
12
|
-
throw new Error(t + " boolean expected, got " + n);
|
|
13
|
-
}
|
|
14
|
-
const T = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
|
|
15
|
-
function B(t) {
|
|
16
|
-
b(t);
|
|
17
|
-
let n = "";
|
|
18
|
-
for (let r = 0; r < t.length; r++)
|
|
19
|
-
n += T[t[r]];
|
|
20
|
-
return n;
|
|
21
|
-
}
|
|
22
|
-
function S(t) {
|
|
23
|
-
const n = t.toString(16);
|
|
24
|
-
return n.length & 1 ? "0" + n : n;
|
|
25
|
-
}
|
|
26
|
-
function U(t) {
|
|
27
|
-
if (typeof t != "string")
|
|
28
|
-
throw new Error("hex string expected, got " + typeof t);
|
|
29
|
-
return t === "" ? d : BigInt("0x" + t);
|
|
30
|
-
}
|
|
31
|
-
const s = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
|
|
32
|
-
function E(t) {
|
|
33
|
-
if (t >= s._0 && t <= s._9)
|
|
34
|
-
return t - s._0;
|
|
35
|
-
if (t >= s.A && t <= s.F)
|
|
36
|
-
return t - (s.A - 10);
|
|
37
|
-
if (t >= s.a && t <= s.f)
|
|
38
|
-
return t - (s.a - 10);
|
|
39
|
-
}
|
|
40
|
-
function m(t) {
|
|
41
|
-
if (typeof t != "string")
|
|
42
|
-
throw new Error("hex string expected, got " + typeof t);
|
|
43
|
-
const n = t.length, r = n / 2;
|
|
44
|
-
if (n % 2)
|
|
45
|
-
throw new Error("hex string expected, got unpadded hex of length " + n);
|
|
46
|
-
const e = new Uint8Array(r);
|
|
47
|
-
for (let o = 0, i = 0; o < r; o++, i += 2) {
|
|
48
|
-
const a = E(t.charCodeAt(i)), f = E(t.charCodeAt(i + 1));
|
|
49
|
-
if (a === void 0 || f === void 0) {
|
|
50
|
-
const c = t[i] + t[i + 1];
|
|
51
|
-
throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i);
|
|
52
|
-
}
|
|
53
|
-
e[o] = a * 16 + f;
|
|
54
|
-
}
|
|
55
|
-
return e;
|
|
56
|
-
}
|
|
57
|
-
function V(t) {
|
|
58
|
-
return U(B(t));
|
|
59
|
-
}
|
|
60
|
-
function H(t) {
|
|
61
|
-
return b(t), U(B(Uint8Array.from(t).reverse()));
|
|
62
|
-
}
|
|
63
|
-
function v(t, n) {
|
|
64
|
-
return m(t.toString(16).padStart(n * 2, "0"));
|
|
65
|
-
}
|
|
66
|
-
function C(t, n) {
|
|
67
|
-
return v(t, n).reverse();
|
|
68
|
-
}
|
|
69
|
-
function M(t) {
|
|
70
|
-
return m(S(t));
|
|
71
|
-
}
|
|
72
|
-
function R(t, n, r) {
|
|
73
|
-
let e;
|
|
74
|
-
if (typeof n == "string")
|
|
75
|
-
try {
|
|
76
|
-
e = m(n);
|
|
77
|
-
} catch (i) {
|
|
78
|
-
throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
|
|
79
|
-
}
|
|
80
|
-
else if (h(n))
|
|
81
|
-
e = Uint8Array.from(n);
|
|
82
|
-
else
|
|
83
|
-
throw new Error(t + " must be hex string or Uint8Array");
|
|
84
|
-
const o = e.length;
|
|
85
|
-
if (typeof r == "number" && o !== r)
|
|
86
|
-
throw new Error(t + " of length " + r + " expected, got " + o);
|
|
87
|
-
return e;
|
|
88
|
-
}
|
|
89
|
-
function _(...t) {
|
|
90
|
-
let n = 0;
|
|
91
|
-
for (let e = 0; e < t.length; e++) {
|
|
92
|
-
const o = t[e];
|
|
93
|
-
b(o), n += o.length;
|
|
1
|
+
class r extends Map {
|
|
2
|
+
constructor(e) {
|
|
3
|
+
super(), Object.defineProperty(this, "maxSize", {
|
|
4
|
+
enumerable: !0,
|
|
5
|
+
configurable: !0,
|
|
6
|
+
writable: !0,
|
|
7
|
+
value: void 0
|
|
8
|
+
}), this.maxSize = e;
|
|
94
9
|
}
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
|
|
98
|
-
r.set(i, o), o += i.length;
|
|
10
|
+
get(e) {
|
|
11
|
+
const t = super.get(e);
|
|
12
|
+
return super.has(e) && t !== void 0 && (this.delete(e), super.set(e, t)), t;
|
|
99
13
|
}
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
return !1;
|
|
105
|
-
let r = 0;
|
|
106
|
-
for (let e = 0; e < t.length; e++)
|
|
107
|
-
r |= t[e] ^ n[e];
|
|
108
|
-
return r === 0;
|
|
109
|
-
}
|
|
110
|
-
function z(t) {
|
|
111
|
-
if (typeof t != "string")
|
|
112
|
-
throw new Error("string expected");
|
|
113
|
-
return new Uint8Array(new TextEncoder().encode(t));
|
|
114
|
-
}
|
|
115
|
-
const w = (t) => typeof t == "bigint" && d <= t;
|
|
116
|
-
function N(t, n, r) {
|
|
117
|
-
return w(t) && w(n) && w(r) && n <= t && t < r;
|
|
118
|
-
}
|
|
119
|
-
function D(t, n, r, e) {
|
|
120
|
-
if (!N(n, r, e))
|
|
121
|
-
throw new Error("expected valid " + t + ": " + r + " <= n < " + e + ", got " + n);
|
|
122
|
-
}
|
|
123
|
-
function G(t) {
|
|
124
|
-
let n;
|
|
125
|
-
for (n = 0; t > d; t >>= y, n += 1)
|
|
126
|
-
;
|
|
127
|
-
return n;
|
|
128
|
-
}
|
|
129
|
-
function P(t, n) {
|
|
130
|
-
return t >> BigInt(n) & y;
|
|
131
|
-
}
|
|
132
|
-
function W(t, n, r) {
|
|
133
|
-
return t | (r ? y : d) << BigInt(n);
|
|
134
|
-
}
|
|
135
|
-
const q = (t) => (I << BigInt(t - 1)) - y, p = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
|
|
136
|
-
function J(t, n, r) {
|
|
137
|
-
if (typeof t != "number" || t < 2)
|
|
138
|
-
throw new Error("hashLen must be a number");
|
|
139
|
-
if (typeof n != "number" || n < 2)
|
|
140
|
-
throw new Error("qByteLen must be a number");
|
|
141
|
-
if (typeof r != "function")
|
|
142
|
-
throw new Error("hmacFn must be a function");
|
|
143
|
-
let e = p(t), o = p(t), i = 0;
|
|
144
|
-
const a = () => {
|
|
145
|
-
e.fill(1), o.fill(0), i = 0;
|
|
146
|
-
}, f = (...u) => r(o, e, ...u), c = (u = p()) => {
|
|
147
|
-
o = f(A([0]), u), e = f(), u.length !== 0 && (o = f(A([1]), u), e = f());
|
|
148
|
-
}, x = () => {
|
|
149
|
-
if (i++ >= 1e3)
|
|
150
|
-
throw new Error("drbg: tried 1000 values");
|
|
151
|
-
let u = 0;
|
|
152
|
-
const l = [];
|
|
153
|
-
for (; u < n; ) {
|
|
154
|
-
e = f();
|
|
155
|
-
const g = e.slice();
|
|
156
|
-
l.push(g), u += e.length;
|
|
14
|
+
set(e, t) {
|
|
15
|
+
if (super.set(e, t), this.maxSize && this.size > this.maxSize) {
|
|
16
|
+
const s = this.keys().next().value;
|
|
17
|
+
s && this.delete(s);
|
|
157
18
|
}
|
|
158
|
-
return
|
|
159
|
-
}
|
|
160
|
-
return (u, l) => {
|
|
161
|
-
a(), c(u);
|
|
162
|
-
let g;
|
|
163
|
-
for (; !(g = l(x())); )
|
|
164
|
-
c();
|
|
165
|
-
return a(), g;
|
|
166
|
-
};
|
|
167
|
-
}
|
|
168
|
-
const k = {
|
|
169
|
-
bigint: (t) => typeof t == "bigint",
|
|
170
|
-
function: (t) => typeof t == "function",
|
|
171
|
-
boolean: (t) => typeof t == "boolean",
|
|
172
|
-
string: (t) => typeof t == "string",
|
|
173
|
-
stringOrUint8Array: (t) => typeof t == "string" || h(t),
|
|
174
|
-
isSafeInteger: (t) => Number.isSafeInteger(t),
|
|
175
|
-
array: (t) => Array.isArray(t),
|
|
176
|
-
field: (t, n) => n.Fp.isValid(t),
|
|
177
|
-
hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
|
|
178
|
-
};
|
|
179
|
-
function K(t, n, r = {}) {
|
|
180
|
-
const e = (o, i, a) => {
|
|
181
|
-
const f = k[i];
|
|
182
|
-
if (typeof f != "function")
|
|
183
|
-
throw new Error("invalid validator function");
|
|
184
|
-
const c = t[o];
|
|
185
|
-
if (!(a && c === void 0) && !f(c, t))
|
|
186
|
-
throw new Error("param " + String(o) + " is invalid. Expected " + i + ", got " + c);
|
|
187
|
-
};
|
|
188
|
-
for (const [o, i] of Object.entries(n))
|
|
189
|
-
e(o, i, !1);
|
|
190
|
-
for (const [o, i] of Object.entries(r))
|
|
191
|
-
e(o, i, !0);
|
|
192
|
-
return t;
|
|
193
|
-
}
|
|
194
|
-
const Q = () => {
|
|
195
|
-
throw new Error("not implemented");
|
|
196
|
-
};
|
|
197
|
-
function X(t) {
|
|
198
|
-
const n = /* @__PURE__ */ new WeakMap();
|
|
199
|
-
return (r, ...e) => {
|
|
200
|
-
const o = n.get(r);
|
|
201
|
-
if (o !== void 0)
|
|
202
|
-
return o;
|
|
203
|
-
const i = t(r, ...e);
|
|
204
|
-
return n.set(r, i), i;
|
|
205
|
-
};
|
|
19
|
+
return this;
|
|
20
|
+
}
|
|
206
21
|
}
|
|
207
22
|
export {
|
|
208
|
-
|
|
209
|
-
O as abool,
|
|
210
|
-
b as abytes,
|
|
211
|
-
P as bitGet,
|
|
212
|
-
G as bitLen,
|
|
213
|
-
q as bitMask,
|
|
214
|
-
W as bitSet,
|
|
215
|
-
B as bytesToHex,
|
|
216
|
-
V as bytesToNumberBE,
|
|
217
|
-
H as bytesToNumberLE,
|
|
218
|
-
_ as concatBytes,
|
|
219
|
-
J as createHmacDrbg,
|
|
220
|
-
R as ensureBytes,
|
|
221
|
-
j as equalBytes,
|
|
222
|
-
m as hexToBytes,
|
|
223
|
-
U as hexToNumber,
|
|
224
|
-
N as inRange,
|
|
225
|
-
h as isBytes,
|
|
226
|
-
X as memoized,
|
|
227
|
-
Q as notImplemented,
|
|
228
|
-
v as numberToBytesBE,
|
|
229
|
-
C as numberToBytesLE,
|
|
230
|
-
S as numberToHexUnpadded,
|
|
231
|
-
M as numberToVarBytesBE,
|
|
232
|
-
z as utf8ToBytes,
|
|
233
|
-
K as validateObject
|
|
23
|
+
r as LruMap
|
|
234
24
|
};
|
package/dist/index74.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index71.cjs"),u=require("./index108.cjs"),f=require("./index36.cjs"),g=require("./index24.cjs");function c(n,e="hex"){const i=o(n),s=u.createCursor(new Uint8Array(i.length));return i.encode(s),e==="hex"?g.bytesToHex(s.bytes):s.bytes}function o(n){return Array.isArray(n)?p(n.map(e=>o(e))):y(n)}function p(n){const e=n.reduce((t,h)=>t+h.length,0),i=l(e);return{length:e<=55?1+e:1+i+e,encode(t){e<=55?t.pushByte(192+e):(t.pushByte(247+i),i===1?t.pushUint8(e):i===2?t.pushUint16(e):i===3?t.pushUint24(e):t.pushUint32(e));for(const{encode:h}of n)h(t)}}}function y(n){const e=typeof n=="string"?f.hexToBytes(n):n,i=l(e.length);return{length:e.length===1&&e[0]<128?1:e.length<=55?1+e.length:1+i+e.length,encode(t){e.length===1&&e[0]<128?t.pushBytes(e):e.length<=55?(t.pushByte(128+e.length),t.pushBytes(e)):(t.pushByte(183+i),i===1?t.pushUint8(e.length):i===2?t.pushUint16(e.length):i===3?t.pushUint24(e.length):t.pushUint32(e.length),t.pushBytes(e))}}}function l(n){if(n<2**8)return 1;if(n<2**16)return 2;if(n<2**24)return 3;if(n<2**32)return 4;throw new r.BaseError("Length is too large.")}exports.toRlp=c;
|
package/dist/index74.js
CHANGED
package/dist/index75.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=require("./index109.cjs"),o=require("./index73.cjs"),s=require("./index89.cjs"),r=require("./index24.cjs");function c(e){const t=typeof e=="string"?r.stringToHex(e):typeof e.raw=="string"?e.raw:r.bytesToHex(e.raw),i=r.stringToHex(`${n.presignMessagePrefix}${s.size(t)}`);return o.concat([i,t])}exports.toPrefixedMessage=c;
|
package/dist/index75.js
CHANGED
|
@@ -1,7 +1,11 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
1
|
+
import { presignMessagePrefix as e } from "./index109.js";
|
|
2
|
+
import { concat as n } from "./index73.js";
|
|
3
|
+
import { size as f } from "./index89.js";
|
|
4
|
+
import { stringToHex as o, bytesToHex as p } from "./index24.js";
|
|
5
|
+
function u(r) {
|
|
6
|
+
const t = typeof r == "string" ? o(r) : typeof r.raw == "string" ? r.raw : p(r.raw), i = o(`${e}${f(t)}`);
|
|
7
|
+
return n([i, t]);
|
|
4
8
|
}
|
|
5
9
|
export {
|
|
6
|
-
|
|
10
|
+
u as toPrefixedMessage
|
|
7
11
|
};
|
package/dist/index76.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 l=require("./index61.cjs"),f=require("./index104.cjs"),c=require("./index62.cjs"),I=[],O=[],w=[],B=BigInt(0),a=BigInt(1),A=BigInt(2),S=BigInt(7),H=BigInt(256),T=BigInt(113);for(let i=0,t=a,s=1,n=0;i<24;i++){[s,n]=[n,(2*s+3*n)%5],I.push(2*(5*n+s)),O.push((i+1)*(i+2)/2%64);let o=B;for(let r=0;r<7;r++)t=(t<<a^(t>>S)*T)%H,t&A&&(o^=a<<(a<<BigInt(r))-a);w.push(o)}const[m,E]=f.split(w,!0),y=(i,t,s)=>s>32?f.rotlBH(i,t,s):f.rotlSH(i,t,s),b=(i,t,s)=>s>32?f.rotlBL(i,t,s):f.rotlSL(i,t,s);function L(i,t=24){const s=new Uint32Array(10);for(let n=24-t;n<24;n++){for(let e=0;e<10;e++)s[e]=i[e]^i[e+10]^i[e+20]^i[e+30]^i[e+40];for(let e=0;e<10;e+=2){const h=(e+8)%10,p=(e+2)%10,d=s[p],u=s[p+1],_=y(d,u,1)^s[h],g=b(d,u,1)^s[h+1];for(let k=0;k<50;k+=10)i[e+k]^=_,i[e+k+1]^=g}let o=i[2],r=i[3];for(let e=0;e<24;e++){const h=O[e],p=y(o,r,h),d=b(o,r,h),u=I[e];o=i[u],r=i[u+1],i[u]=p,i[u+1]=d}for(let e=0;e<50;e+=10){for(let h=0;h<10;h++)s[h]=i[e+h];for(let h=0;h<10;h++)i[e+h]^=~s[(h+2)%10]&s[(h+4)%10]}i[0]^=m[n],i[1]^=E[n]}s.fill(0)}class x extends c.Hash{constructor(t,s,n,o=!1,r=24){if(super(),this.blockLen=t,this.suffix=s,this.outputLen=n,this.enableXOF=o,this.rounds=r,this.pos=0,this.posOut=0,this.finished=!1,this.destroyed=!1,l.anumber(n),0>=this.blockLen||this.blockLen>=200)throw new Error("Sha3 supports only keccak-f1600 function");this.state=new Uint8Array(200),this.state32=c.u32(this.state)}keccak(){c.isLE||c.byteSwap32(this.state32),L(this.state32,this.rounds),c.isLE||c.byteSwap32(this.state32),this.posOut=0,this.pos=0}update(t){l.aexists(this);const{blockLen:s,state:n}=this;t=c.toBytes(t);const o=t.length;for(let r=0;r<o;){const e=Math.min(s-this.pos,o-r);for(let h=0;h<e;h++)n[this.pos++]^=t[r++];this.pos===s&&this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;const{state:t,suffix:s,pos:n,blockLen:o}=this;t[n]^=s,s&128&&n===o-1&&this.keccak(),t[o-1]^=128,this.keccak()}writeInto(t){l.aexists(this,!1),l.abytes(t),this.finish();const s=this.state,{blockLen:n}=this;for(let o=0,r=t.length;o<r;){this.posOut>=n&&this.keccak();const e=Math.min(n-this.posOut,r-o);t.set(s.subarray(this.posOut,this.posOut+e),o),this.posOut+=e,o+=e}return t}xofInto(t){if(!this.enableXOF)throw new Error("XOF is not possible for this instance");return this.writeInto(t)}xof(t){return l.anumber(t),this.xofInto(new Uint8Array(t))}digestInto(t){if(l.aoutput(t,this),this.finished)throw new Error("digest() was already called");return this.writeInto(t),this.destroy(),t}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,this.state.fill(0)}_cloneInto(t){const{blockLen:s,suffix:n,outputLen:o,rounds:r,enableXOF:e}=this;return t||(t=new x(s,n,o,e,r)),t.state32.set(this.state32),t.pos=this.pos,t.posOut=this.posOut,t.finished=this.finished,t.rounds=r,t.suffix=n,t.outputLen=o,t.enableXOF=e,t.destroyed=this.destroyed,t}}const F=(i,t,s)=>c.wrapConstructor(()=>new x(t,i,s)),P=F(1,136,256/8);exports.Keccak=x;exports.keccakP=L;exports.keccak_256=P;
|
package/dist/index76.js
CHANGED
|
@@ -1,6 +1,107 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
1
|
+
import { anumber as d, aexists as k, abytes as B, aoutput as A } from "./index61.js";
|
|
2
|
+
import { rotlSH as H, rotlSL as m, rotlBH as S, rotlBL as T, split as F } from "./index104.js";
|
|
3
|
+
import { wrapConstructor as X, Hash as E, u32 as U, isLE as x, byteSwap32 as I, toBytes as P } from "./index62.js";
|
|
4
|
+
const y = [], L = [], b = [], M = /* @__PURE__ */ BigInt(0), f = /* @__PURE__ */ BigInt(1), R = /* @__PURE__ */ BigInt(2), j = /* @__PURE__ */ BigInt(7), C = /* @__PURE__ */ BigInt(256), q = /* @__PURE__ */ BigInt(113);
|
|
5
|
+
for (let e = 0, t = f, s = 1, n = 0; e < 24; e++) {
|
|
6
|
+
[s, n] = [n, (2 * s + 3 * n) % 5], y.push(2 * (5 * n + s)), L.push((e + 1) * (e + 2) / 2 % 64);
|
|
7
|
+
let o = M;
|
|
8
|
+
for (let r = 0; r < 7; r++)
|
|
9
|
+
t = (t << f ^ (t >> j) * q) % C, t & R && (o ^= f << (f << /* @__PURE__ */ BigInt(r)) - f);
|
|
10
|
+
b.push(o);
|
|
3
11
|
}
|
|
12
|
+
const [v, z] = /* @__PURE__ */ F(b, !0), O = (e, t, s) => s > 32 ? S(e, t, s) : H(e, t, s), w = (e, t, s) => s > 32 ? T(e, t, s) : m(e, t, s);
|
|
13
|
+
function D(e, t = 24) {
|
|
14
|
+
const s = new Uint32Array(10);
|
|
15
|
+
for (let n = 24 - t; n < 24; n++) {
|
|
16
|
+
for (let i = 0; i < 10; i++)
|
|
17
|
+
s[i] = e[i] ^ e[i + 10] ^ e[i + 20] ^ e[i + 30] ^ e[i + 40];
|
|
18
|
+
for (let i = 0; i < 10; i += 2) {
|
|
19
|
+
const h = (i + 8) % 10, l = (i + 2) % 10, u = s[l], c = s[l + 1], _ = O(u, c, 1) ^ s[h], g = w(u, c, 1) ^ s[h + 1];
|
|
20
|
+
for (let a = 0; a < 50; a += 10)
|
|
21
|
+
e[i + a] ^= _, e[i + a + 1] ^= g;
|
|
22
|
+
}
|
|
23
|
+
let o = e[2], r = e[3];
|
|
24
|
+
for (let i = 0; i < 24; i++) {
|
|
25
|
+
const h = L[i], l = O(o, r, h), u = w(o, r, h), c = y[i];
|
|
26
|
+
o = e[c], r = e[c + 1], e[c] = l, e[c + 1] = u;
|
|
27
|
+
}
|
|
28
|
+
for (let i = 0; i < 50; i += 10) {
|
|
29
|
+
for (let h = 0; h < 10; h++)
|
|
30
|
+
s[h] = e[i + h];
|
|
31
|
+
for (let h = 0; h < 10; h++)
|
|
32
|
+
e[i + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
|
|
33
|
+
}
|
|
34
|
+
e[0] ^= v[n], e[1] ^= z[n];
|
|
35
|
+
}
|
|
36
|
+
s.fill(0);
|
|
37
|
+
}
|
|
38
|
+
class p extends E {
|
|
39
|
+
// NOTE: we accept arguments in bytes instead of bits here.
|
|
40
|
+
constructor(t, s, n, o = !1, r = 24) {
|
|
41
|
+
if (super(), this.blockLen = t, this.suffix = s, this.outputLen = n, this.enableXOF = o, this.rounds = r, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, d(n), 0 >= this.blockLen || this.blockLen >= 200)
|
|
42
|
+
throw new Error("Sha3 supports only keccak-f1600 function");
|
|
43
|
+
this.state = new Uint8Array(200), this.state32 = U(this.state);
|
|
44
|
+
}
|
|
45
|
+
keccak() {
|
|
46
|
+
x || I(this.state32), D(this.state32, this.rounds), x || I(this.state32), this.posOut = 0, this.pos = 0;
|
|
47
|
+
}
|
|
48
|
+
update(t) {
|
|
49
|
+
k(this);
|
|
50
|
+
const { blockLen: s, state: n } = this;
|
|
51
|
+
t = P(t);
|
|
52
|
+
const o = t.length;
|
|
53
|
+
for (let r = 0; r < o; ) {
|
|
54
|
+
const i = Math.min(s - this.pos, o - r);
|
|
55
|
+
for (let h = 0; h < i; h++)
|
|
56
|
+
n[this.pos++] ^= t[r++];
|
|
57
|
+
this.pos === s && this.keccak();
|
|
58
|
+
}
|
|
59
|
+
return this;
|
|
60
|
+
}
|
|
61
|
+
finish() {
|
|
62
|
+
if (this.finished)
|
|
63
|
+
return;
|
|
64
|
+
this.finished = !0;
|
|
65
|
+
const { state: t, suffix: s, pos: n, blockLen: o } = this;
|
|
66
|
+
t[n] ^= s, s & 128 && n === o - 1 && this.keccak(), t[o - 1] ^= 128, this.keccak();
|
|
67
|
+
}
|
|
68
|
+
writeInto(t) {
|
|
69
|
+
k(this, !1), B(t), this.finish();
|
|
70
|
+
const s = this.state, { blockLen: n } = this;
|
|
71
|
+
for (let o = 0, r = t.length; o < r; ) {
|
|
72
|
+
this.posOut >= n && this.keccak();
|
|
73
|
+
const i = Math.min(n - this.posOut, r - o);
|
|
74
|
+
t.set(s.subarray(this.posOut, this.posOut + i), o), this.posOut += i, o += i;
|
|
75
|
+
}
|
|
76
|
+
return t;
|
|
77
|
+
}
|
|
78
|
+
xofInto(t) {
|
|
79
|
+
if (!this.enableXOF)
|
|
80
|
+
throw new Error("XOF is not possible for this instance");
|
|
81
|
+
return this.writeInto(t);
|
|
82
|
+
}
|
|
83
|
+
xof(t) {
|
|
84
|
+
return d(t), this.xofInto(new Uint8Array(t));
|
|
85
|
+
}
|
|
86
|
+
digestInto(t) {
|
|
87
|
+
if (A(t, this), this.finished)
|
|
88
|
+
throw new Error("digest() was already called");
|
|
89
|
+
return this.writeInto(t), this.destroy(), t;
|
|
90
|
+
}
|
|
91
|
+
digest() {
|
|
92
|
+
return this.digestInto(new Uint8Array(this.outputLen));
|
|
93
|
+
}
|
|
94
|
+
destroy() {
|
|
95
|
+
this.destroyed = !0, this.state.fill(0);
|
|
96
|
+
}
|
|
97
|
+
_cloneInto(t) {
|
|
98
|
+
const { blockLen: s, suffix: n, outputLen: o, rounds: r, enableXOF: i } = this;
|
|
99
|
+
return t || (t = new p(s, n, o, i, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = n, t.outputLen = o, t.enableXOF = i, t.destroyed = this.destroyed, t;
|
|
100
|
+
}
|
|
101
|
+
}
|
|
102
|
+
const G = (e, t, s) => X(() => new p(t, e, s)), Q = /* @__PURE__ */ G(1, 136, 256 / 8);
|
|
4
103
|
export {
|
|
5
|
-
|
|
104
|
+
p as Keccak,
|
|
105
|
+
D as keccakP,
|
|
106
|
+
Q as keccak_256
|
|
6
107
|
};
|
package/dist/index77.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 r(t,{strict:e=!0}={}){return!t||typeof t!="string"?!1:e?/^0x[0-9a-fA-F]*$/.test(t):t.startsWith("0x")}exports.isHex=r;
|
package/dist/index77.js
CHANGED
|
@@ -1,11 +1,6 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
import { size as f } from "./index75.js";
|
|
4
|
-
import { stringToHex as o, bytesToHex as p } from "./index24.js";
|
|
5
|
-
function u(r) {
|
|
6
|
-
const t = typeof r == "string" ? o(r) : typeof r.raw == "string" ? r.raw : p(r.raw), i = o(`${e}${f(t)}`);
|
|
7
|
-
return n([i, t]);
|
|
1
|
+
function e(t, { strict: r = !0 } = {}) {
|
|
2
|
+
return !t || typeof t != "string" ? !1 : r ? /^0x[0-9a-fA-F]*$/.test(t) : t.startsWith("0x");
|
|
8
3
|
}
|
|
9
4
|
export {
|
|
10
|
-
|
|
5
|
+
e as isHex
|
|
11
6
|
};
|
package/dist/index78.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=require("./index24.cjs"),c=require("./index40.cjs");function u(t){if(!t||t.length===0)return[];const e=[];for(const r of t){const{chainId:i,nonce:o,...s}=r,a=r.address;e.push([i?n.toHex(i):"0x",a,o?n.toHex(o):"0x",...c.toYParitySignatureArray({},s)])}return e}exports.serializeAuthorizationList=u;
|