@gardenfi/utils 2.0.6-beta.9 → 2.1.0
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/index100.cjs +1 -1
- package/dist/index100.js +79 -5
- package/dist/index101.cjs +1 -1
- package/dist/index101.js +18 -10
- package/dist/index102.cjs +1 -1
- package/dist/index102.js +12 -2
- package/dist/index103.cjs +1 -1
- package/dist/index103.js +18 -19
- package/dist/index104.cjs +1 -1
- package/dist/index104.js +12 -6
- package/dist/index105.cjs +1 -1
- package/dist/index105.js +39 -5
- package/dist/index106.cjs +1 -1
- package/dist/index106.js +5 -38
- package/dist/index107.cjs +1 -1
- package/dist/index107.js +10 -127
- package/dist/index108.cjs +1 -1
- package/dist/index108.js +2 -2
- package/dist/index109.cjs +1 -2
- package/dist/index109.js +21 -3
- package/dist/index110.cjs +1 -1
- package/dist/index110.js +126 -66
- package/dist/index111.cjs +1 -1
- package/dist/index111.js +6 -69
- package/dist/index112.cjs +1 -1
- package/dist/index112.js +2 -2
- package/dist/index113.cjs +1 -1
- package/dist/index113.js +34 -31
- package/dist/index114.cjs +1 -1
- package/dist/index114.js +5 -41
- package/dist/index115.cjs +2 -1
- package/dist/index115.js +3 -644
- package/dist/index116.cjs +1 -1
- package/dist/index116.js +15 -228
- package/dist/index117.cjs +1 -1
- package/dist/index117.js +624 -153
- package/dist/index118.cjs +1 -1
- package/dist/index118.js +171 -17
- package/dist/index15.cjs +1 -1
- package/dist/index15.js +5 -5
- package/dist/index19.cjs +1 -1
- package/dist/index19.js +17 -17
- package/dist/index20.cjs +1 -1
- package/dist/index20.js +17 -18
- package/dist/index21.cjs +1 -16
- package/dist/index21.js +30 -112
- package/dist/index22.cjs +16 -1
- package/dist/index22.js +113 -30
- package/dist/index24.cjs +1 -1
- package/dist/index24.js +1 -1
- package/dist/index25.cjs +1 -1
- package/dist/index25.js +2 -2
- package/dist/index29.cjs +1 -1
- package/dist/index29.js +9 -9
- package/dist/index30.cjs +1 -1
- package/dist/index30.js +1 -1
- package/dist/index31.cjs +1 -1
- package/dist/index31.js +1 -1
- package/dist/index35.cjs +1 -1
- package/dist/index35.js +1 -1
- package/dist/index38.cjs +1 -1
- package/dist/index38.js +1 -1
- package/dist/index41.cjs +1 -1
- package/dist/index41.js +1 -1
- package/dist/index42.cjs +1 -1
- package/dist/index42.js +3 -3
- package/dist/index43.cjs +1 -1
- package/dist/index43.js +3 -3
- package/dist/index46.cjs +1 -1
- package/dist/index46.js +14 -14
- package/dist/index50.cjs +1 -1
- package/dist/index50.js +1 -1
- package/dist/index53.cjs +1 -1
- package/dist/index53.js +2 -2
- package/dist/index54.cjs +1 -1
- package/dist/index54.js +10 -10
- package/dist/index56.cjs +1 -1
- package/dist/index56.js +1 -1
- package/dist/index57.cjs +1 -1
- package/dist/index57.js +19 -19
- package/dist/index60.cjs +1 -1
- package/dist/index60.js +12 -6
- package/dist/index61.cjs +1 -1
- package/dist/index61.js +32 -10
- package/dist/index62.cjs +1 -1
- package/dist/index62.js +8 -34
- package/dist/index63.cjs +2 -1
- package/dist/index63.js +59 -8
- package/dist/index64.cjs +1 -2
- package/dist/index64.js +2 -60
- package/dist/index65.cjs +1 -1
- package/dist/index65.js +7 -2
- package/dist/index66.cjs +1 -1
- package/dist/index66.js +6 -6
- package/dist/index69.cjs +1 -5
- package/dist/index69.js +3 -56
- package/dist/index70.cjs +5 -1
- package/dist/index70.js +56 -3
- package/dist/index71.cjs +1 -1
- package/dist/index71.js +1 -1
- package/dist/index72.cjs +1 -1
- package/dist/index72.js +2 -2
- package/dist/index77.cjs +1 -1
- package/dist/index77.js +1 -1
- package/dist/index79.cjs +1 -1
- package/dist/index79.js +3 -3
- package/dist/index81.cjs +1 -1
- package/dist/index81.js +1 -1
- package/dist/index82.cjs +1 -1
- package/dist/index82.js +1 -1
- package/dist/index85.cjs +1 -1
- package/dist/index85.js +1 -1
- package/dist/index86.cjs +1 -1
- package/dist/index86.js +5 -5
- package/dist/index88.cjs +1 -1
- package/dist/index88.js +33 -105
- package/dist/index89.cjs +1 -1
- package/dist/index89.js +33 -15
- package/dist/index9.cjs +1 -1
- package/dist/index9.js +84 -69
- package/dist/index90.cjs +1 -1
- package/dist/index90.js +59 -213
- package/dist/index91.cjs +1 -1
- package/dist/index91.js +110 -40
- package/dist/index92.cjs +1 -1
- package/dist/index92.js +55 -92
- package/dist/index93.cjs +1 -1
- package/dist/index93.js +2 -18
- package/dist/index94.cjs +1 -1
- package/dist/index94.js +15 -77
- package/dist/index95.cjs +1 -1
- package/dist/index95.js +222 -17
- package/dist/index96.cjs +1 -1
- package/dist/index96.js +230 -10
- package/dist/index97.cjs +1 -1
- package/dist/index97.js +41 -18
- package/dist/index98.cjs +1 -1
- package/dist/index98.js +102 -36
- package/dist/index99.cjs +1 -1
- package/dist/index99.js +16 -11
- package/dist/src/lib/auth/siwe/siwe.d.ts +1 -1
- package/package.json +3 -1
package/dist/index100.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e={
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const E=require("./index112.cjs"),w=require("./index108.cjs"),t=require("./index50.cjs"),P=require("./index63.cjs"),h=require("./index113.cjs"),d=require("./index65.cjs"),n=require("./index71.cjs"),c=require("./index51.cjs"),I=require("./index67.cjs"),u=require("./index105.cjs"),l=require("./index35.cjs");function m(o){const{authorizationList:e}=o;if(e)for(const s of e){const{chainId:r}=s,i=s.address;if(!c.isAddress(i))throw new t.InvalidAddressError({address:i});if(r<0)throw new d.InvalidChainIdError({chainId:r})}f(o)}function T(o){const{blobVersionedHashes:e}=o;if(e){if(e.length===0)throw new h.EmptyBlobError;for(const s of e){const r=I.size(s),i=l.hexToNumber(u.slice(s,0,1));if(r!==32)throw new h.InvalidVersionedHashSizeError({hash:s,size:r});if(i!==E.versionedHashVersionKzg)throw new h.InvalidVersionedHashVersionError({hash:s,version:i})}}f(o)}function f(o){const{chainId:e,maxPriorityFeePerGas:s,maxFeePerGas:r,to:i}=o;if(e<=0)throw new d.InvalidChainIdError({chainId:e});if(i&&!c.isAddress(i))throw new t.InvalidAddressError({address:i});if(r&&r>w.maxUint256)throw new n.FeeCapTooHighError({maxFeePerGas:r});if(s&&r&&s>r)throw new n.TipAboveFeeCapError({maxFeePerGas:r,maxPriorityFeePerGas:s})}function x(o){const{chainId:e,maxPriorityFeePerGas:s,gasPrice:r,maxFeePerGas:i,to:a}=o;if(e<=0)throw new d.InvalidChainIdError({chainId:e});if(a&&!c.isAddress(a))throw new t.InvalidAddressError({address:a});if(s||i)throw new P.BaseError("`maxFeePerGas`/`maxPriorityFeePerGas` is not a valid EIP-2930 Transaction attribute.");if(r&&r>w.maxUint256)throw new n.FeeCapTooHighError({maxFeePerGas:r})}function v(o){const{chainId:e,maxPriorityFeePerGas:s,gasPrice:r,maxFeePerGas:i,to:a}=o;if(a&&!c.isAddress(a))throw new t.InvalidAddressError({address:a});if(typeof e<"u"&&e<=0)throw new d.InvalidChainIdError({chainId:e});if(s||i)throw new P.BaseError("`maxFeePerGas`/`maxPriorityFeePerGas` is not a valid Legacy Transaction attribute.");if(r&&r>w.maxUint256)throw new n.FeeCapTooHighError({maxFeePerGas:r})}exports.assertTransactionEIP1559=f;exports.assertTransactionEIP2930=x;exports.assertTransactionEIP4844=T;exports.assertTransactionEIP7702=m;exports.assertTransactionLegacy=v;
|
package/dist/index100.js
CHANGED
|
@@ -1,7 +1,81 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
};
|
|
1
|
+
import { versionedHashVersionKzg as c } from "./index112.js";
|
|
2
|
+
import { maxUint256 as m } from "./index108.js";
|
|
3
|
+
import { InvalidAddressError as s } from "./index50.js";
|
|
4
|
+
import { BaseError as h } from "./index63.js";
|
|
5
|
+
import { EmptyBlobError as P, InvalidVersionedHashSizeError as p, InvalidVersionedHashVersionError as x } from "./index113.js";
|
|
6
|
+
import { InvalidChainIdError as n } from "./index65.js";
|
|
7
|
+
import { FeeCapTooHighError as w, TipAboveFeeCapError as E } from "./index71.js";
|
|
8
|
+
import { isAddress as f } from "./index51.js";
|
|
9
|
+
import { size as F } from "./index67.js";
|
|
10
|
+
import { slice as I } from "./index105.js";
|
|
11
|
+
import { hexToNumber as G } from "./index35.js";
|
|
12
|
+
function C(t) {
|
|
13
|
+
const { authorizationList: e } = t;
|
|
14
|
+
if (e)
|
|
15
|
+
for (const o of e) {
|
|
16
|
+
const { chainId: r } = o, i = o.address;
|
|
17
|
+
if (!f(i))
|
|
18
|
+
throw new s({ address: i });
|
|
19
|
+
if (r < 0)
|
|
20
|
+
throw new n({ chainId: r });
|
|
21
|
+
}
|
|
22
|
+
d(t);
|
|
23
|
+
}
|
|
24
|
+
function L(t) {
|
|
25
|
+
const { blobVersionedHashes: e } = t;
|
|
26
|
+
if (e) {
|
|
27
|
+
if (e.length === 0)
|
|
28
|
+
throw new P();
|
|
29
|
+
for (const o of e) {
|
|
30
|
+
const r = F(o), i = G(I(o, 0, 1));
|
|
31
|
+
if (r !== 32)
|
|
32
|
+
throw new p({ hash: o, size: r });
|
|
33
|
+
if (i !== c)
|
|
34
|
+
throw new x({
|
|
35
|
+
hash: o,
|
|
36
|
+
version: i
|
|
37
|
+
});
|
|
38
|
+
}
|
|
39
|
+
}
|
|
40
|
+
d(t);
|
|
41
|
+
}
|
|
42
|
+
function d(t) {
|
|
43
|
+
const { chainId: e, maxPriorityFeePerGas: o, maxFeePerGas: r, to: i } = t;
|
|
44
|
+
if (e <= 0)
|
|
45
|
+
throw new n({ chainId: e });
|
|
46
|
+
if (i && !f(i))
|
|
47
|
+
throw new s({ address: i });
|
|
48
|
+
if (r && r > m)
|
|
49
|
+
throw new w({ maxFeePerGas: r });
|
|
50
|
+
if (o && r && o > r)
|
|
51
|
+
throw new E({ maxFeePerGas: r, maxPriorityFeePerGas: o });
|
|
52
|
+
}
|
|
53
|
+
function B(t) {
|
|
54
|
+
const { chainId: e, maxPriorityFeePerGas: o, gasPrice: r, maxFeePerGas: i, to: a } = t;
|
|
55
|
+
if (e <= 0)
|
|
56
|
+
throw new n({ chainId: e });
|
|
57
|
+
if (a && !f(a))
|
|
58
|
+
throw new s({ address: a });
|
|
59
|
+
if (o || i)
|
|
60
|
+
throw new h("`maxFeePerGas`/`maxPriorityFeePerGas` is not a valid EIP-2930 Transaction attribute.");
|
|
61
|
+
if (r && r > m)
|
|
62
|
+
throw new w({ maxFeePerGas: r });
|
|
63
|
+
}
|
|
64
|
+
function K(t) {
|
|
65
|
+
const { chainId: e, maxPriorityFeePerGas: o, gasPrice: r, maxFeePerGas: i, to: a } = t;
|
|
66
|
+
if (a && !f(a))
|
|
67
|
+
throw new s({ address: a });
|
|
68
|
+
if (typeof e < "u" && e <= 0)
|
|
69
|
+
throw new n({ chainId: e });
|
|
70
|
+
if (o || i)
|
|
71
|
+
throw new h("`maxFeePerGas`/`maxPriorityFeePerGas` is not a valid Legacy Transaction attribute.");
|
|
72
|
+
if (r && r > m)
|
|
73
|
+
throw new w({ maxFeePerGas: r });
|
|
74
|
+
}
|
|
5
75
|
export {
|
|
6
|
-
|
|
76
|
+
d as assertTransactionEIP1559,
|
|
77
|
+
B as assertTransactionEIP2930,
|
|
78
|
+
L as assertTransactionEIP4844,
|
|
79
|
+
C as assertTransactionEIP7702,
|
|
80
|
+
K as assertTransactionLegacy
|
|
7
81
|
};
|
package/dist/index101.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("./index50.cjs"),d=require("./index30.cjs"),l=require("./index51.cjs");function a(e){if(!e||e.length===0)return[];const n=[];for(let t=0;t<e.length;t++){const{address:i,storageKeys:r}=e[t];for(let s=0;s<r.length;s++)if(r[s].length-2!==64)throw new d.InvalidStorageKeySizeError({storageKey:r[s]});if(!l.isAddress(i,{strict:!1}))throw new o.InvalidAddressError({address:i});n.push([i,r])}return n}exports.serializeAccessList=a;
|
package/dist/index101.js
CHANGED
|
@@ -1,13 +1,21 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
1
|
+
import { InvalidAddressError as s } from "./index50.js";
|
|
2
|
+
import { InvalidStorageKeySizeError as l } from "./index30.js";
|
|
3
|
+
import { isAddress as f } from "./index51.js";
|
|
4
|
+
function a(r) {
|
|
5
|
+
if (!r || r.length === 0)
|
|
6
|
+
return [];
|
|
7
|
+
const n = [];
|
|
8
|
+
for (let o = 0; o < r.length; o++) {
|
|
9
|
+
const { address: i, storageKeys: e } = r[o];
|
|
10
|
+
for (let t = 0; t < e.length; t++)
|
|
11
|
+
if (e[t].length - 2 !== 64)
|
|
12
|
+
throw new l({ storageKey: e[t] });
|
|
13
|
+
if (!f(i, { strict: !1 }))
|
|
14
|
+
throw new s({ address: i });
|
|
15
|
+
n.push([i, e]);
|
|
16
|
+
}
|
|
17
|
+
return n;
|
|
10
18
|
}
|
|
11
19
|
export {
|
|
12
|
-
a as
|
|
20
|
+
a as serializeAccessList
|
|
13
21
|
};
|
package/dist/index102.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index63.cjs");class t extends a.BaseError{constructor(e){const{docsPath:s,field:r,metaMessages:i}=e;super(`Invalid Sign-In with Ethereum message field "${r}".`,{docsPath:s,metaMessages:i,name:"SiweInvalidMessageFieldError"})}}exports.SiweInvalidMessageFieldError=t;
|
package/dist/index102.js
CHANGED
|
@@ -1,4 +1,14 @@
|
|
|
1
|
-
|
|
1
|
+
import { BaseError as i } from "./index63.js";
|
|
2
|
+
class d extends i {
|
|
3
|
+
constructor(e) {
|
|
4
|
+
const { docsPath: s, field: r, metaMessages: a } = e;
|
|
5
|
+
super(`Invalid Sign-In with Ethereum message field "${r}".`, {
|
|
6
|
+
docsPath: s,
|
|
7
|
+
metaMessages: a,
|
|
8
|
+
name: "SiweInvalidMessageFieldError"
|
|
9
|
+
});
|
|
10
|
+
}
|
|
11
|
+
}
|
|
2
12
|
export {
|
|
3
|
-
|
|
13
|
+
d as SiweInvalidMessageFieldError
|
|
4
14
|
};
|
package/dist/index103.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 o(e){if(/[^a-z0-9\:\/\?\#\[\]\@\!\$\&\'\(\)\*\+\,\;\=\.\-\_\~\%]/i.test(e)||/%[^0-9a-f]/i.test(e)||/%[0-9a-f](:?[^0-9a-f]|$)/i.test(e))return!1;const s=a(e),f=s[1],t=s[2],i=s[3],r=s[4],l=s[5];if(!(f!=null&&f.length&&i.length>=0))return!1;if(t!=null&&t.length){if(!(i.length===0||/^\//.test(i)))return!1}else if(/^\/\//.test(i))return!1;if(!/^[a-z][a-z0-9\+\-\.]*$/.test(f.toLowerCase()))return!1;let n="";return n+=`${f}:`,t!=null&&t.length&&(n+=`//${t}`),n+=i,r!=null&&r.length&&(n+=`?${r}`),l!=null&&l.length&&(n+=`#${l}`),n}function a(e){return e.match(/(?:([^:\/?#]+):)?(?:\/\/([^\/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?/)}exports.isUri=o;
|
package/dist/index103.js
CHANGED
|
@@ -1,23 +1,22 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
1
|
+
function o(e) {
|
|
2
|
+
if (/[^a-z0-9\:\/\?\#\[\]\@\!\$\&\'\(\)\*\+\,\;\=\.\-\_\~\%]/i.test(e) || /%[^0-9a-f]/i.test(e) || /%[0-9a-f](:?[^0-9a-f]|$)/i.test(e))
|
|
3
|
+
return !1;
|
|
4
|
+
const s = a(e), f = s[1], t = s[2], i = s[3], r = s[4], l = s[5];
|
|
5
|
+
if (!(f != null && f.length && i.length >= 0))
|
|
6
|
+
return !1;
|
|
7
|
+
if (t != null && t.length) {
|
|
8
|
+
if (!(i.length === 0 || /^\//.test(i)))
|
|
9
|
+
return !1;
|
|
10
|
+
} else if (/^\/\//.test(i))
|
|
11
|
+
return !1;
|
|
12
|
+
if (!/^[a-z][a-z0-9\+\-\.]*$/.test(f.toLowerCase()))
|
|
13
|
+
return !1;
|
|
14
|
+
let n = "";
|
|
15
|
+
return n += `${f}:`, t != null && t.length && (n += `//${t}`), n += i, r != null && r.length && (n += `?${r}`), l != null && l.length && (n += `#${l}`), n;
|
|
8
16
|
}
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`, { name: "PositionOutOfBoundsError" });
|
|
12
|
-
}
|
|
13
|
-
}
|
|
14
|
-
class c extends o {
|
|
15
|
-
constructor({ count: e, limit: r }) {
|
|
16
|
-
super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`, { name: "RecursiveReadLimitExceededError" });
|
|
17
|
-
}
|
|
17
|
+
function a(e) {
|
|
18
|
+
return e.match(/(?:([^:\/?#]+):)?(?:\/\/([^\/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?/);
|
|
18
19
|
}
|
|
19
20
|
export {
|
|
20
|
-
|
|
21
|
-
n as PositionOutOfBoundsError,
|
|
22
|
-
c as RecursiveReadLimitExceededError
|
|
21
|
+
o as isUri
|
|
23
22
|
};
|
package/dist/index104.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 t=require("./index63.cjs");class i extends t.BaseError{constructor({offset:r,position:s,size:e}){super(`Slice ${s==="start"?"starting":"ending"} at offset "${r}" is out-of-bounds (size: ${e}).`,{name:"SliceOffsetOutOfBoundsError"})}}class d extends t.BaseError{constructor({size:r,targetSize:s,type:e}){super(`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()} size (${r}) exceeds padding size (${s}).`,{name:"SizeExceedsPaddingSizeError"})}}exports.SizeExceedsPaddingSizeError=d;exports.SliceOffsetOutOfBoundsError=i;
|
package/dist/index104.js
CHANGED
|
@@ -1,9 +1,15 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
1
|
+
import { BaseError as o } from "./index63.js";
|
|
2
|
+
class d extends o {
|
|
3
|
+
constructor({ offset: r, position: s, size: e }) {
|
|
4
|
+
super(`Slice ${s === "start" ? "starting" : "ending"} at offset "${r}" is out-of-bounds (size: ${e}).`, { name: "SliceOffsetOutOfBoundsError" });
|
|
5
|
+
}
|
|
6
|
+
}
|
|
7
|
+
class n extends o {
|
|
8
|
+
constructor({ size: r, targetSize: s, type: e }) {
|
|
9
|
+
super(`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()} size (${r}) exceeds padding size (${s}).`, { name: "SizeExceedsPaddingSizeError" });
|
|
10
|
+
}
|
|
6
11
|
}
|
|
7
12
|
export {
|
|
8
|
-
|
|
13
|
+
n as SizeExceedsPaddingSizeError,
|
|
14
|
+
d as SliceOffsetOutOfBoundsError
|
|
9
15
|
};
|
package/dist/index105.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index104.cjs"),O=require("./index84.cjs"),n=require("./index67.cjs");function p(i,e,s,{strict:f}={}){return O.isHex(i,{strict:!1})?l(i,e,s,{strict:f}):u(i,e,s,{strict:f})}function r(i,e){if(typeof e=="number"&&e>0&&e>n.size(i)-1)throw new t.SliceOffsetOutOfBoundsError({offset:e,position:"start",size:n.size(i)})}function c(i,e,s){if(typeof e=="number"&&typeof s=="number"&&n.size(i)!==s-e)throw new t.SliceOffsetOutOfBoundsError({offset:s,position:"end",size:n.size(i)})}function u(i,e,s,{strict:f}={}){r(i,e);const o=i.slice(e,s);return f&&c(o,e,s),o}function l(i,e,s,{strict:f}={}){r(i,e);const o=`0x${i.replace("0x","").slice((e??0)*2,(s??i.length)*2)}`;return f&&c(o,e,s),o}exports.slice=p;exports.sliceBytes=u;exports.sliceHex=l;
|
package/dist/index105.js
CHANGED
|
@@ -1,7 +1,41 @@
|
|
|
1
|
-
|
|
1
|
+
import { SliceOffsetOutOfBoundsError as t } from "./index104.js";
|
|
2
|
+
import { isHex as p } from "./index84.js";
|
|
3
|
+
import { size as r } from "./index67.js";
|
|
4
|
+
function w(e, f, i, { strict: o } = {}) {
|
|
5
|
+
return p(e, { strict: !1 }) ? u(e, f, i, {
|
|
6
|
+
strict: o
|
|
7
|
+
}) : m(e, f, i, {
|
|
8
|
+
strict: o
|
|
9
|
+
});
|
|
10
|
+
}
|
|
11
|
+
function s(e, f) {
|
|
12
|
+
if (typeof f == "number" && f > 0 && f > r(e) - 1)
|
|
13
|
+
throw new t({
|
|
14
|
+
offset: f,
|
|
15
|
+
position: "start",
|
|
16
|
+
size: r(e)
|
|
17
|
+
});
|
|
18
|
+
}
|
|
19
|
+
function c(e, f, i) {
|
|
20
|
+
if (typeof f == "number" && typeof i == "number" && r(e) !== i - f)
|
|
21
|
+
throw new t({
|
|
22
|
+
offset: i,
|
|
23
|
+
position: "end",
|
|
24
|
+
size: r(e)
|
|
25
|
+
});
|
|
26
|
+
}
|
|
27
|
+
function m(e, f, i, { strict: o } = {}) {
|
|
28
|
+
s(e, f);
|
|
29
|
+
const n = e.slice(f, i);
|
|
30
|
+
return o && c(n, f, i), n;
|
|
31
|
+
}
|
|
32
|
+
function u(e, f, i, { strict: o } = {}) {
|
|
33
|
+
s(e, f);
|
|
34
|
+
const n = `0x${e.replace("0x", "").slice((f ?? 0) * 2, (i ?? e.length) * 2)}`;
|
|
35
|
+
return o && c(n, f, i), n;
|
|
36
|
+
}
|
|
2
37
|
export {
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
l as maxBytesPerTransaction
|
|
38
|
+
w as slice,
|
|
39
|
+
m as sliceBytes,
|
|
40
|
+
u as sliceHex
|
|
7
41
|
};
|
package/dist/index106.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e={ether:-9,wei:9};exports.gweiUnits=e;
|
package/dist/index106.js
CHANGED
|
@@ -1,40 +1,7 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
super("Blob size is too large.", {
|
|
6
|
-
metaMessages: [`Max: ${e} bytes`, `Given: ${r} bytes`],
|
|
7
|
-
name: "BlobSizeTooLargeError"
|
|
8
|
-
});
|
|
9
|
-
}
|
|
10
|
-
}
|
|
11
|
-
class d extends s {
|
|
12
|
-
constructor() {
|
|
13
|
-
super("Blob data must not be empty.", { name: "EmptyBlobError" });
|
|
14
|
-
}
|
|
15
|
-
}
|
|
16
|
-
class l extends s {
|
|
17
|
-
constructor({ hash: e, size: r }) {
|
|
18
|
-
super(`Versioned hash "${e}" size is invalid.`, {
|
|
19
|
-
metaMessages: ["Expected: 32", `Received: ${r}`],
|
|
20
|
-
name: "InvalidVersionedHashSizeError"
|
|
21
|
-
});
|
|
22
|
-
}
|
|
23
|
-
}
|
|
24
|
-
class c extends s {
|
|
25
|
-
constructor({ hash: e, version: r }) {
|
|
26
|
-
super(`Versioned hash "${e}" version is invalid.`, {
|
|
27
|
-
metaMessages: [
|
|
28
|
-
`Expected: ${a}`,
|
|
29
|
-
`Received: ${r}`
|
|
30
|
-
],
|
|
31
|
-
name: "InvalidVersionedHashVersionError"
|
|
32
|
-
});
|
|
33
|
-
}
|
|
34
|
-
}
|
|
1
|
+
const e = {
|
|
2
|
+
ether: -9,
|
|
3
|
+
wei: 9
|
|
4
|
+
};
|
|
35
5
|
export {
|
|
36
|
-
|
|
37
|
-
d as EmptyBlobError,
|
|
38
|
-
l as InvalidVersionedHashSizeError,
|
|
39
|
-
c as InvalidVersionedHashVersionError
|
|
6
|
+
e as gweiUnits
|
|
40
7
|
};
|
package/dist/index107.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 o(r,i){let t=r.toString();const n=t.startsWith("-");n&&(t=t.slice(1)),t=t.padStart(i,"0");let[l,e]=[t.slice(0,t.length-i),t.slice(t.length-i)];return e=e.replace(/(0+)$/,""),`${n?"-":""}${l||"0"}${e?`.${e}`:""}`}exports.formatUnits=o;
|
package/dist/index107.js
CHANGED
|
@@ -1,130 +1,13 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
if (this.recursiveReadCount >= this.recursiveReadLimit)
|
|
11
|
-
throw new e({
|
|
12
|
-
count: this.recursiveReadCount + 1,
|
|
13
|
-
limit: this.recursiveReadLimit
|
|
14
|
-
});
|
|
15
|
-
},
|
|
16
|
-
assertPosition(t) {
|
|
17
|
-
if (t < 0 || t > this.bytes.length - 1)
|
|
18
|
-
throw new n({
|
|
19
|
-
length: this.bytes.length,
|
|
20
|
-
position: t
|
|
21
|
-
});
|
|
22
|
-
},
|
|
23
|
-
decrementPosition(t) {
|
|
24
|
-
if (t < 0)
|
|
25
|
-
throw new o({ offset: t });
|
|
26
|
-
const i = this.position - t;
|
|
27
|
-
this.assertPosition(i), this.position = i;
|
|
28
|
-
},
|
|
29
|
-
getReadCount(t) {
|
|
30
|
-
return this.positionReadCount.get(t || this.position) || 0;
|
|
31
|
-
},
|
|
32
|
-
incrementPosition(t) {
|
|
33
|
-
if (t < 0)
|
|
34
|
-
throw new o({ offset: t });
|
|
35
|
-
const i = this.position + t;
|
|
36
|
-
this.assertPosition(i), this.position = i;
|
|
37
|
-
},
|
|
38
|
-
inspectByte(t) {
|
|
39
|
-
const i = t ?? this.position;
|
|
40
|
-
return this.assertPosition(i), this.bytes[i];
|
|
41
|
-
},
|
|
42
|
-
inspectBytes(t, i) {
|
|
43
|
-
const s = i ?? this.position;
|
|
44
|
-
return this.assertPosition(s + t - 1), this.bytes.subarray(s, s + t);
|
|
45
|
-
},
|
|
46
|
-
inspectUint8(t) {
|
|
47
|
-
const i = t ?? this.position;
|
|
48
|
-
return this.assertPosition(i), this.bytes[i];
|
|
49
|
-
},
|
|
50
|
-
inspectUint16(t) {
|
|
51
|
-
const i = t ?? this.position;
|
|
52
|
-
return this.assertPosition(i + 1), this.dataView.getUint16(i);
|
|
53
|
-
},
|
|
54
|
-
inspectUint24(t) {
|
|
55
|
-
const i = t ?? this.position;
|
|
56
|
-
return this.assertPosition(i + 2), (this.dataView.getUint16(i) << 8) + this.dataView.getUint8(i + 2);
|
|
57
|
-
},
|
|
58
|
-
inspectUint32(t) {
|
|
59
|
-
const i = t ?? this.position;
|
|
60
|
-
return this.assertPosition(i + 3), this.dataView.getUint32(i);
|
|
61
|
-
},
|
|
62
|
-
pushByte(t) {
|
|
63
|
-
this.assertPosition(this.position), this.bytes[this.position] = t, this.position++;
|
|
64
|
-
},
|
|
65
|
-
pushBytes(t) {
|
|
66
|
-
this.assertPosition(this.position + t.length - 1), this.bytes.set(t, this.position), this.position += t.length;
|
|
67
|
-
},
|
|
68
|
-
pushUint8(t) {
|
|
69
|
-
this.assertPosition(this.position), this.bytes[this.position] = t, this.position++;
|
|
70
|
-
},
|
|
71
|
-
pushUint16(t) {
|
|
72
|
-
this.assertPosition(this.position + 1), this.dataView.setUint16(this.position, t), this.position += 2;
|
|
73
|
-
},
|
|
74
|
-
pushUint24(t) {
|
|
75
|
-
this.assertPosition(this.position + 2), this.dataView.setUint16(this.position, t >> 8), this.dataView.setUint8(this.position + 2, t & 255), this.position += 3;
|
|
76
|
-
},
|
|
77
|
-
pushUint32(t) {
|
|
78
|
-
this.assertPosition(this.position + 3), this.dataView.setUint32(this.position, t), this.position += 4;
|
|
79
|
-
},
|
|
80
|
-
readByte() {
|
|
81
|
-
this.assertReadLimit(), this._touch();
|
|
82
|
-
const t = this.inspectByte();
|
|
83
|
-
return this.position++, t;
|
|
84
|
-
},
|
|
85
|
-
readBytes(t, i) {
|
|
86
|
-
this.assertReadLimit(), this._touch();
|
|
87
|
-
const s = this.inspectBytes(t);
|
|
88
|
-
return this.position += i ?? t, s;
|
|
89
|
-
},
|
|
90
|
-
readUint8() {
|
|
91
|
-
this.assertReadLimit(), this._touch();
|
|
92
|
-
const t = this.inspectUint8();
|
|
93
|
-
return this.position += 1, t;
|
|
94
|
-
},
|
|
95
|
-
readUint16() {
|
|
96
|
-
this.assertReadLimit(), this._touch();
|
|
97
|
-
const t = this.inspectUint16();
|
|
98
|
-
return this.position += 2, t;
|
|
99
|
-
},
|
|
100
|
-
readUint24() {
|
|
101
|
-
this.assertReadLimit(), this._touch();
|
|
102
|
-
const t = this.inspectUint24();
|
|
103
|
-
return this.position += 3, t;
|
|
104
|
-
},
|
|
105
|
-
readUint32() {
|
|
106
|
-
this.assertReadLimit(), this._touch();
|
|
107
|
-
const t = this.inspectUint32();
|
|
108
|
-
return this.position += 4, t;
|
|
109
|
-
},
|
|
110
|
-
get remaining() {
|
|
111
|
-
return this.bytes.length - this.position;
|
|
112
|
-
},
|
|
113
|
-
setPosition(t) {
|
|
114
|
-
const i = this.position;
|
|
115
|
-
return this.assertPosition(t), this.position = t, () => this.position = i;
|
|
116
|
-
},
|
|
117
|
-
_touch() {
|
|
118
|
-
if (this.recursiveReadLimit === Number.POSITIVE_INFINITY)
|
|
119
|
-
return;
|
|
120
|
-
const t = this.getReadCount();
|
|
121
|
-
this.positionReadCount.set(this.position, t + 1), t > 0 && this.recursiveReadCount++;
|
|
122
|
-
}
|
|
123
|
-
};
|
|
124
|
-
function a(t, { recursiveReadLimit: i = 8192 } = {}) {
|
|
125
|
-
const s = Object.create(h);
|
|
126
|
-
return s.bytes = t, s.dataView = new DataView(t.buffer, t.byteOffset, t.byteLength), s.positionReadCount = /* @__PURE__ */ new Map(), s.recursiveReadLimit = i, s;
|
|
1
|
+
function a(r, n) {
|
|
2
|
+
let t = r.toString();
|
|
3
|
+
const i = t.startsWith("-");
|
|
4
|
+
i && (t = t.slice(1)), t = t.padStart(n, "0");
|
|
5
|
+
let [l, e] = [
|
|
6
|
+
t.slice(0, t.length - n),
|
|
7
|
+
t.slice(t.length - n)
|
|
8
|
+
];
|
|
9
|
+
return e = e.replace(/(0+)$/, ""), `${i ? "-" : ""}${l || "0"}${e ? `.${e}` : ""}`;
|
|
127
10
|
}
|
|
128
11
|
export {
|
|
129
|
-
a as
|
|
12
|
+
a as formatUnits
|
|
130
13
|
};
|
package/dist/index108.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 t=2n**256n-1n;exports.maxUint256=t;
|
package/dist/index108.js
CHANGED
package/dist/index109.cjs
CHANGED
|
@@ -1,2 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e
|
|
2
|
-
`;exports.presignMessagePrefix=e;
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index63.cjs");class t extends o.BaseError{constructor({offset:e}){super(`Offset \`${e}\` cannot be negative.`,{name:"NegativeOffsetError"})}}class i extends o.BaseError{constructor({length:e,position:r}){super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`,{name:"PositionOutOfBoundsError"})}}class n extends o.BaseError{constructor({count:e,limit:r}){super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`,{name:"RecursiveReadLimitExceededError"})}}exports.NegativeOffsetError=t;exports.PositionOutOfBoundsError=i;exports.RecursiveReadLimitExceededError=n;
|
package/dist/index109.js
CHANGED
|
@@ -1,5 +1,23 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
1
|
+
import { BaseError as o } from "./index63.js";
|
|
2
|
+
class i extends o {
|
|
3
|
+
constructor({ offset: e }) {
|
|
4
|
+
super(`Offset \`${e}\` cannot be negative.`, {
|
|
5
|
+
name: "NegativeOffsetError"
|
|
6
|
+
});
|
|
7
|
+
}
|
|
8
|
+
}
|
|
9
|
+
class n extends o {
|
|
10
|
+
constructor({ length: e, position: r }) {
|
|
11
|
+
super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`, { name: "PositionOutOfBoundsError" });
|
|
12
|
+
}
|
|
13
|
+
}
|
|
14
|
+
class c extends o {
|
|
15
|
+
constructor({ count: e, limit: r }) {
|
|
16
|
+
super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`, { name: "RecursiveReadLimitExceededError" });
|
|
17
|
+
}
|
|
18
|
+
}
|
|
3
19
|
export {
|
|
4
|
-
|
|
20
|
+
i as NegativeOffsetError,
|
|
21
|
+
n as PositionOutOfBoundsError,
|
|
22
|
+
c as RecursiveReadLimitExceededError
|
|
5
23
|
};
|
package/dist/index110.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 o=require("./index109.cjs"),e={bytes:new Uint8Array,dataView:new DataView(new ArrayBuffer(0)),position:0,positionReadCount:new Map,recursiveReadCount:0,recursiveReadLimit:Number.POSITIVE_INFINITY,assertReadLimit(){if(this.recursiveReadCount>=this.recursiveReadLimit)throw new o.RecursiveReadLimitExceededError({count:this.recursiveReadCount+1,limit:this.recursiveReadLimit})},assertPosition(t){if(t<0||t>this.bytes.length-1)throw new o.PositionOutOfBoundsError({length:this.bytes.length,position:t})},decrementPosition(t){if(t<0)throw new o.NegativeOffsetError({offset:t});const i=this.position-t;this.assertPosition(i),this.position=i},getReadCount(t){return this.positionReadCount.get(t||this.position)||0},incrementPosition(t){if(t<0)throw new o.NegativeOffsetError({offset:t});const i=this.position+t;this.assertPosition(i),this.position=i},inspectByte(t){const i=t??this.position;return this.assertPosition(i),this.bytes[i]},inspectBytes(t,i){const s=i??this.position;return this.assertPosition(s+t-1),this.bytes.subarray(s,s+t)},inspectUint8(t){const i=t??this.position;return this.assertPosition(i),this.bytes[i]},inspectUint16(t){const i=t??this.position;return this.assertPosition(i+1),this.dataView.getUint16(i)},inspectUint24(t){const i=t??this.position;return this.assertPosition(i+2),(this.dataView.getUint16(i)<<8)+this.dataView.getUint8(i+2)},inspectUint32(t){const i=t??this.position;return this.assertPosition(i+3),this.dataView.getUint32(i)},pushByte(t){this.assertPosition(this.position),this.bytes[this.position]=t,this.position++},pushBytes(t){this.assertPosition(this.position+t.length-1),this.bytes.set(t,this.position),this.position+=t.length},pushUint8(t){this.assertPosition(this.position),this.bytes[this.position]=t,this.position++},pushUint16(t){this.assertPosition(this.position+1),this.dataView.setUint16(this.position,t),this.position+=2},pushUint24(t){this.assertPosition(this.position+2),this.dataView.setUint16(this.position,t>>8),this.dataView.setUint8(this.position+2,t&255),this.position+=3},pushUint32(t){this.assertPosition(this.position+3),this.dataView.setUint32(this.position,t),this.position+=4},readByte(){this.assertReadLimit(),this._touch();const t=this.inspectByte();return this.position++,t},readBytes(t,i){this.assertReadLimit(),this._touch();const s=this.inspectBytes(t);return this.position+=i??t,s},readUint8(){this.assertReadLimit(),this._touch();const t=this.inspectUint8();return this.position+=1,t},readUint16(){this.assertReadLimit(),this._touch();const t=this.inspectUint16();return this.position+=2,t},readUint24(){this.assertReadLimit(),this._touch();const t=this.inspectUint24();return this.position+=3,t},readUint32(){this.assertReadLimit(),this._touch();const t=this.inspectUint32();return this.position+=4,t},get remaining(){return this.bytes.length-this.position},setPosition(t){const i=this.position;return this.assertPosition(t),this.position=t,()=>this.position=i},_touch(){if(this.recursiveReadLimit===Number.POSITIVE_INFINITY)return;const t=this.getReadCount();this.positionReadCount.set(this.position,t+1),t>0&&this.recursiveReadCount++}};function n(t,{recursiveReadLimit:i=8192}={}){const s=Object.create(e);return s.bytes=t,s.dataView=new DataView(t.buffer,t.byteOffset,t.byteLength),s.positionReadCount=new Map,s.recursiveReadLimit=i,s}exports.createCursor=n;
|