@gardenfi/utils 2.1.3-beta.3 → 2.1.3

package/dist/index307.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const A=require("./index284.cjs"),h=require("./index294.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const y=BigInt(0),S=BigInt(1);function p(e,s){const t=s.negate();return e?t:s}function E(e,s){if(!Number.isSafeInteger(e)||e<=0||e>s)throw new Error("invalid window size, expected [1.."+s+"], got W="+e)}function m(e,s){E(e,s);const t=Math.ceil(s/e)+1,n=2**(e-1),o=2**e,i=h.bitMask(e),r=BigInt(e);return{windows:t,windowSize:n,mask:i,maxNumber:o,shiftBy:r}}function B(e,s,t){const{windowSize:n,mask:o,maxNumber:i,shiftBy:r}=t;let f=Number(e&o),a=e>>r;f>n&&(f-=i,a+=S);const l=s*n,c=l+Math.abs(f)-1,w=f===0,u=f<0,d=s%2!==0;return{nextN:a,offset:c,isZero:w,isNeg:u,isNegF:d,offsetF:l}}function x(e,s){if(!Array.isArray(e))throw new Error("array expected");e.forEach((t,n)=>{if(!(t instanceof s))throw new Error("invalid point at index "+n)})}function I(e,s){if(!Array.isArray(e))throw new Error("array of scalars expected");e.forEach((t,n)=>{if(!s.isValid(t))throw new Error("invalid scalar at index "+n)})}const N=new WeakMap,M=new WeakMap;function b(e){return M.get(e)||1}function O(e,s){return{constTimeNegate:p,hasPrecomputes(t){return b(t)!==1},unsafeLadder(t,n,o=e.ZERO){let i=t;for(;n>y;)n&S&&(o=o.add(i)),i=i.double(),n>>=S;return o},precomputeWindow(t,n){const{windows:o,windowSize:i}=m(n,s),r=[];let f=t,a=f;for(let l=0;l<o;l++){a=f,r.push(a);for(let c=1;c<i;c++)a=a.add(f),r.push(a);f=a.double()}return r},wNAF(t,n,o){let i=e.ZERO,r=e.BASE;const f=m(t,s);for(let a=0;a<f.windows;a++){const{nextN:l,offset:c,isZero:w,isNeg:u,isNegF:d,offsetF:g}=B(o,a,f);o=l,w?r=r.add(p(d,n[g])):i=i.add(p(u,n[c]))}return{p:i,f:r}},wNAFUnsafe(t,n,o,i=e.ZERO){const r=m(t,s);for(let f=0;f<r.windows&&o!==y;f++){const{nextN:a,offset:l,isZero:c,isNeg:w}=B(o,f,r);if(o=a,!c){const u=n[l];i=i.add(w?u.negate():u)}}return i},getPrecomputes(t,n,o){let i=N.get(n);return i||(i=this.precomputeWindow(n,t),t!==1&&N.set(n,o(i))),i},wNAFCached(t,n,o){const i=b(t);return this.wNAF(i,this.getPrecomputes(i,t,o),n)},wNAFCachedUnsafe(t,n,o,i){const r=b(t);return r===1?this.unsafeLadder(t,n,i):this.wNAFUnsafe(r,this.getPrecomputes(r,t,o),n,i)},setWindowSize(t,n){E(n,s),M.set(t,n),N.delete(t)}}}function z(e,s,t,n){if(x(t,e),I(n,s),t.length!==n.length)throw new Error("arrays of points and scalars must have equal length");const o=e.ZERO,i=h.bitLen(BigInt(t.length)),r=i>12?i-3:i>4?i-2:i?2:1,f=h.bitMask(r),a=new Array(Number(f)+1).fill(o),l=Math.floor((s.BITS-1)/r)*r;let c=o;for(let w=l;w>=0;w-=r){a.fill(o);for(let d=0;d<n.length;d++){const g=n[d],F=Number(g>>BigInt(w)&f);a[F]=a[F].add(t[d])}let u=o;for(let d=a.length-1,g=o;d>0;d--)g=g.add(a[d]),u=u.add(g);if(c=c.add(u),w!==0)for(let d=0;d<r;d++)c=c.double()}return c}function k(e){return A.validateField(e.Fp),h.validateObject(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...A.nLength(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}exports.pippenger=z;exports.validateBasic=k;exports.wNAF=O;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index311.cjs"),c=require("./index315.cjs"),o=require("./index302.cjs"),m=require("./index305.cjs"),b=/^0x[a-fA-F0-9]{40}$/;function i(e,t={}){const{strict:s=!0}=t;if(!b.test(e))throw new a({address:e,cause:new l});if(s){if(e.toLowerCase()===e)return;if(d(e)!==e)throw new a({address:e,cause:new h})}}function d(e){if(c.checksum.has(e))return c.checksum.get(e);i(e,{strict:!1});const t=e.substring(2).toLowerCase(),s=m.keccak256(f.fromString(t),{as:"Bytes"}),n=t.split("");for(let r=0;r<40;r+=2)s[r>>1]>>4>=8&&n[r]&&(n[r]=n[r].toUpperCase()),(s[r>>1]&15)>=8&&n[r+1]&&(n[r+1]=n[r+1].toUpperCase());const u=`0x${n.join("")}`;return c.checksum.set(e,u),u}function p(e,t={}){const{strict:s=!0}=t??{};try{return i(e,{strict:s}),!0}catch{return!1}}class a extends o.BaseError{constructor({address:t,cause:s}){super(`Address "${t}" is invalid.`,{cause:s}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidAddressError"})}}class l extends o.BaseError{constructor(){super("Address is not a 20 byte (40 hexadecimal character) value."),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidInputError"})}}class h extends o.BaseError{constructor(){super("Address does not match its checksum counterpart."),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidChecksumError"})}}exports.InvalidAddressError=a;exports.InvalidChecksumError=h;exports.InvalidInputError=l;exports.assert=i;exports.checksum=d;exports.validate=p;

package/dist/index307.js

@@ -1,175 +1,80 @@
-import { validateField as y, nLength as I } from "./index284.js";
-import { validateObject as M, bitLen as z, bitMask as E } from "./index294.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const F = BigInt(0), b = BigInt(1);
-function h(e, s) {
-  const t = s.negate();
-  return e ? t : s;
-}
-function B(e, s) {
-  if (!Number.isSafeInteger(e) || e <= 0 || e > s)
-    throw new Error("invalid window size, expected [1.." + s + "], got W=" + e);
-}
-function m(e, s) {
-  B(e, s);
-  const t = Math.ceil(s / e) + 1, n = 2 ** (e - 1), i = 2 ** e, o = E(e), r = BigInt(e);
-  return { windows: t, windowSize: n, mask: o, maxNumber: i, shiftBy: r };
-}
-function A(e, s, t) {
-  const { windowSize: n, mask: i, maxNumber: o, shiftBy: r } = t;
-  let f = Number(e & i), a = e >> r;
-  f > n && (f -= o, a += b);
-  const w = s * n, c = w + Math.abs(f) - 1, l = f === 0, u = f < 0, d = s % 2 !== 0;
-  return { nextN: a, offset: c, isZero: l, isNeg: u, isNegF: d, offsetF: w };
-}
-function O(e, s) {
-  if (!Array.isArray(e))
-    throw new Error("array expected");
-  e.forEach((t, n) => {
-    if (!(t instanceof s))
-      throw new Error("invalid point at index " + n);
-  });
+import { fromString as d } from "./index311.js";
+import { checksum as o } from "./index315.js";
+import { BaseError as c } from "./index302.js";
+import { keccak256 as f } from "./index305.js";
+const l = /^0x[a-fA-F0-9]{40}$/;
+function u(r, t = {}) {
+  const { strict: s = !0 } = t;
+  if (!l.test(r))
+    throw new i({
+      address: r,
+      cause: new h()
+    });
+  if (s) {
+    if (r.toLowerCase() === r)
+      return;
+    if (m(r) !== r)
+      throw new i({
+        address: r,
+        cause: new p()
+      });
+  }
 }
-function k(e, s) {
-  if (!Array.isArray(e))
-    throw new Error("array of scalars expected");
-  e.forEach((t, n) => {
-    if (!s.isValid(t))
-      throw new Error("invalid scalar at index " + n);
-  });
+function m(r) {
+  if (o.has(r))
+    return o.get(r);
+  u(r, { strict: !1 });
+  const t = r.substring(2).toLowerCase(), s = f(d(t), { as: "Bytes" }), n = t.split("");
+  for (let e = 0; e < 40; e += 2)
+    s[e >> 1] >> 4 >= 8 && n[e] && (n[e] = n[e].toUpperCase()), (s[e >> 1] & 15) >= 8 && n[e + 1] && (n[e + 1] = n[e + 1].toUpperCase());
+  const a = `0x${n.join("")}`;
+  return o.set(r, a), a;
 }
-const p = /* @__PURE__ */ new WeakMap(), x = /* @__PURE__ */ new WeakMap();
-function N(e) {
-  return x.get(e) || 1;
+function k(r, t = {}) {
+  const { strict: s = !0 } = t ?? {};
+  try {
+    return u(r, { strict: s }), !0;
+  } catch {
+    return !1;
+  }
 }
-function R(e, s) {
-  return {
-    constTimeNegate: h,
-    hasPrecomputes(t) {
-      return N(t) !== 1;
-    },
-    // non-const time multiplication ladder
-    unsafeLadder(t, n, i = e.ZERO) {
-      let o = t;
-      for (; n > F; )
-        n & b && (i = i.add(o)), o = o.double(), n >>= b;
-      return i;
-    },
-    /**
-     * Creates a wNAF precomputation window. Used for caching.
-     * Default window size is set by `utils.precompute()` and is equal to 8.
-     * Number of precomputed points depends on the curve size:
-     * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
-     * - 𝑊 is the window size
-     * - 𝑛 is the bitlength of the curve order.
-     * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
-     * @param elm Point instance
-     * @param W window size
-     * @returns precomputed point tables flattened to a single array
-     */
-    precomputeWindow(t, n) {
-      const { windows: i, windowSize: o } = m(n, s), r = [];
-      let f = t, a = f;
-      for (let w = 0; w < i; w++) {
-        a = f, r.push(a);
-        for (let c = 1; c < o; c++)
-          a = a.add(f), r.push(a);
-        f = a.double();
-      }
-      return r;
-    },
-    /**
-     * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @returns real and fake (for const-time) points
-     */
-    wNAF(t, n, i) {
-      let o = e.ZERO, r = e.BASE;
-      const f = m(t, s);
-      for (let a = 0; a < f.windows; a++) {
-        const { nextN: w, offset: c, isZero: l, isNeg: u, isNegF: d, offsetF: g } = A(i, a, f);
-        i = w, l ? r = r.add(h(d, n[g])) : o = o.add(h(u, n[c]));
-      }
-      return { p: o, f: r };
-    },
-    /**
-     * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @param acc accumulator point to add result of multiplication
-     * @returns point
-     */
-    wNAFUnsafe(t, n, i, o = e.ZERO) {
-      const r = m(t, s);
-      for (let f = 0; f < r.windows && i !== F; f++) {
-        const { nextN: a, offset: w, isZero: c, isNeg: l } = A(i, f, r);
-        if (i = a, !c) {
-          const u = n[w];
-          o = o.add(l ? u.negate() : u);
-        }
-      }
-      return o;
-    },
-    getPrecomputes(t, n, i) {
-      let o = p.get(n);
-      return o || (o = this.precomputeWindow(n, t), t !== 1 && p.set(n, i(o))), o;
-    },
-    wNAFCached(t, n, i) {
-      const o = N(t);
-      return this.wNAF(o, this.getPrecomputes(o, t, i), n);
-    },
-    wNAFCachedUnsafe(t, n, i, o) {
-      const r = N(t);
-      return r === 1 ? this.unsafeLadder(t, n, o) : this.wNAFUnsafe(r, this.getPrecomputes(r, t, i), n, o);
-    },
-    // We calculate precomputes for elliptic curve point multiplication
-    // using windowed method. This specifies window size and
-    // stores precomputed values. Usually only base point would be precomputed.
-    setWindowSize(t, n) {
-      B(n, s), x.set(t, n), p.delete(t);
-    }
-  };
+class i extends c {
+  constructor({ address: t, cause: s }) {
+    super(`Address "${t}" is invalid.`, {
+      cause: s
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Address.InvalidAddressError"
+    });
+  }
 }
-function j(e, s, t, n) {
-  if (O(t, e), k(n, s), t.length !== n.length)
-    throw new Error("arrays of points and scalars must have equal length");
-  const i = e.ZERO, o = z(BigInt(t.length)), r = o > 12 ? o - 3 : o > 4 ? o - 2 : o ? 2 : 1, f = E(r), a = new Array(Number(f) + 1).fill(i), w = Math.floor((s.BITS - 1) / r) * r;
-  let c = i;
-  for (let l = w; l >= 0; l -= r) {
-    a.fill(i);
-    for (let d = 0; d < n.length; d++) {
-      const g = n[d], S = Number(g >> BigInt(l) & f);
-      a[S] = a[S].add(t[d]);
-    }
-    let u = i;
-    for (let d = a.length - 1, g = i; d > 0; d--)
-      g = g.add(a[d]), u = u.add(g);
-    if (c = c.add(u), l !== 0)
-      for (let d = 0; d < r; d++)
-        c = c.double();
+class h extends c {
+  constructor() {
+    super("Address is not a 20 byte (40 hexadecimal character) value."), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Address.InvalidInputError"
+    });
   }
-  return c;
 }
-function v(e) {
-  return y(e.Fp), M(e, {
-    n: "bigint",
-    h: "bigint",
-    Gx: "field",
-    Gy: "field"
-  }, {
-    nBitLength: "isSafeInteger",
-    nByteLength: "isSafeInteger"
-  }), Object.freeze({
-    ...I(e.n, e.nBitLength),
-    ...e,
-    p: e.Fp.ORDER
-  });
+class p extends c {
+  constructor() {
+    super("Address does not match its checksum counterpart."), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Address.InvalidChecksumError"
+    });
+  }
 }
 export {
-  j as pippenger,
-  v as validateBasic,
-  R as wNAF
+  i as InvalidAddressError,
+  p as InvalidChecksumError,
+  h as InvalidInputError,
+  u as assert,
+  m as checksum,
+  k as validate
 };

package/dist/index308.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index297.cjs"),y=require("./index260.cjs"),s=require("./index309.cjs"),z=require("./index299.cjs"),S=new TextEncoder;function x(e){return e instanceof Uint8Array?e:typeof e=="string"?h(e):g(e)}function g(e){return e instanceof Uint8Array?e:new Uint8Array(e)}function h(e,t={}){const{size:r}=t;let n=e;r&&(z.assertSize(e,r),n=y.padRight(e,r));let i=n.slice(2);i.length%2&&(i=`0${i}`);const d=i.length/2,f=new Uint8Array(d);for(let c=0,o=0;c<d;c++){const u=s.charCodeToBase16(i.charCodeAt(o++)),b=s.charCodeToBase16(i.charCodeAt(o++));if(u===void 0||b===void 0)throw new a.BaseError(`Invalid byte sequence ("${i[o-2]}${i[o-1]}" in "${i}").`);f[c]=u*16+b}return f}function m(e,t={}){const{size:r}=t,n=S.encode(e);return typeof r=="number"?(s.assertSize(n,r),l(n,r)):n}function l(e,t){return s.pad(e,{dir:"right",size:t})}function E(e){return e.length}class p extends a.BaseError{constructor({givenSize:t,maxSize:r}){super(`Size cannot exceed \`${r}\` bytes. Given size: \`${t}\` bytes.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeOverflowError"})}}class $ extends a.BaseError{constructor({size:t,targetSize:r,type:n}){super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${r}\`).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeExceedsPaddingSizeError"})}}exports.SizeExceedsPaddingSizeError=$;exports.SizeOverflowError=p;exports.from=x;exports.fromArray=g;exports.fromHex=h;exports.fromString=m;exports.padRight=l;exports.size=E;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=/^(.*)\[([0-9]*)\]$/,t=/^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/,g=/^(u?int)(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/;exports.arrayRegex=e;exports.bytesRegex=t;exports.integerRegex=g;

package/dist/index308.js

@@ -1,66 +1,6 @@
-import { BaseError as c } from "./index297.js";
-import { padRight as h } from "./index260.js";
-import { charCodeToBase16 as b, assertSize as g, pad as m } from "./index309.js";
-import { assertSize as p } from "./index299.js";
-const l = /* @__PURE__ */ new TextEncoder();
-function E(e) {
-  return e instanceof Uint8Array ? e : typeof e == "string" ? y(e) : z(e);
-}
-function z(e) {
-  return e instanceof Uint8Array ? e : new Uint8Array(e);
-}
-function y(e, t = {}) {
-  const { size: r } = t;
-  let n = e;
-  r && (p(e, r), n = h(e, r));
-  let i = n.slice(2);
-  i.length % 2 && (i = `0${i}`);
-  const f = i.length / 2, a = new Uint8Array(f);
-  for (let s = 0, o = 0; s < f; s++) {
-    const d = b(i.charCodeAt(o++)), u = b(i.charCodeAt(o++));
-    if (d === void 0 || u === void 0)
-      throw new c(`Invalid byte sequence ("${i[o - 2]}${i[o - 1]}" in "${i}").`);
-    a[s] = d * 16 + u;
-  }
-  return a;
-}
-function C(e, t = {}) {
-  const { size: r } = t, n = l.encode(e);
-  return typeof r == "number" ? (g(n, r), x(n, r)) : n;
-}
-function x(e, t) {
-  return m(e, { dir: "right", size: t });
-}
-function U(e) {
-  return e.length;
-}
-class B extends c {
-  constructor({ givenSize: t, maxSize: r }) {
-    super(`Size cannot exceed \`${r}\` bytes. Given size: \`${t}\` bytes.`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Bytes.SizeOverflowError"
-    });
-  }
-}
-class O extends c {
-  constructor({ size: t, targetSize: r, type: n }) {
-    super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${r}\`).`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Bytes.SizeExceedsPaddingSizeError"
-    });
-  }
-}
+const e = /^(.*)\[([0-9]*)\]$/, t = /^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/, n = /^(u?int)(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/;
 export {
-  O as SizeExceedsPaddingSizeError,
-  B as SizeOverflowError,
-  E as from,
-  z as fromArray,
-  y as fromHex,
-  C as fromString,
-  x as padRight,
-  U as size
+  e as arrayRegex,
+  t as bytesRegex,
+  n as integerRegex
 };

package/dist/index309.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index308.cjs");function s(e,t){if(o.size(e)>t)throw new o.SizeOverflowError({givenSize:o.size(e),maxSize:t})}const n={zero:48,nine:57,A:65,F:70,a:97,f:102};function u(e){if(e>=n.zero&&e<=n.nine)return e-n.zero;if(e>=n.A&&e<=n.F)return e-(n.A-10);if(e>=n.a&&e<=n.f)return e-(n.a-10)}function z(e,t={}){const{dir:f,size:r=32}=t;if(r===0)return e;if(e.length>r)throw new o.SizeExceedsPaddingSizeError({size:e.length,targetSize:r,type:"Bytes"});const d=new Uint8Array(r);for(let i=0;i<r;i++){const a=f==="right";d[a?i:r-i-1]=e[a?i:e.length-i-1]}return d}exports.assertSize=s;exports.charCodeMap=n;exports.charCodeToBase16=u;exports.pad=z;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const m=require("./index291.cjs"),w=require("./index307.cjs"),N=require("./index302.cjs"),c=require("./index288.cjs"),x=require("./index308.cjs");function P({checksumAddress:e,parameters:r,values:n}){const t=[];for(let o=0;o<r.length;o++)t.push(f({checksumAddress:e,parameter:r[o],value:n[o]}));return t}function f({checksumAddress:e=!1,parameter:r,value:n}){const t=r,o=S(t.type);if(o){const[i,s]=o;return h(n,{checksumAddress:e,length:i,parameter:{...t,type:s}})}if(t.type==="tuple")return A(n,{checksumAddress:e,parameter:t});if(t.type==="address")return y(n,{checksum:e});if(t.type==="bool")return g(n);if(t.type.startsWith("uint")||t.type.startsWith("int")){const i=t.type.startsWith("int"),[,,s="256"]=x.integerRegex.exec(t.type)??[];return b(n,{signed:i,size:Number(s)})}if(t.type.startsWith("bytes"))return l(n,{type:t.type});if(t.type==="string")return z(n);throw new m.InvalidTypeError(t.type)}function u(e){let r=0;for(let i=0;i<e.length;i++){const{dynamic:s,encoded:a}=e[i];s?r+=32:r+=c.size(a)}const n=[],t=[];let o=0;for(let i=0;i<e.length;i++){const{dynamic:s,encoded:a}=e[i];s?(n.push(c.fromNumber(r+o,{size:32})),t.push(a),o+=c.size(a)):n.push(a)}return c.concat(...n,...t)}function y(e,r){const{checksum:n=!1}=r;return w.assert(e,{strict:n}),{dynamic:!1,encoded:c.padLeft(e.toLowerCase())}}function h(e,r){const{checksumAddress:n,length:t,parameter:o}=r,i=t===null;if(!Array.isArray(e))throw new m.InvalidArrayError(e);if(!i&&e.length!==t)throw new m.ArrayLengthMismatchError({expectedLength:t,givenLength:e.length,type:`${o.type}[${t}]`});let s=!1;const a=[];for(let d=0;d<e.length;d++){const p=f({checksumAddress:n,parameter:o,value:e[d]});p.dynamic&&(s=!0),a.push(p)}if(i||s){const d=u(a);if(i){const p=c.fromNumber(a.length,{size:32});return{dynamic:!0,encoded:a.length>0?c.concat(p,d):p}}if(s)return{dynamic:!0,encoded:d}}return{dynamic:!1,encoded:c.concat(...a.map(({encoded:d})=>d))}}function l(e,{type:r}){const[,n]=r.split("bytes"),t=c.size(e);if(!n){let o=e;return t%32!==0&&(o=c.padRight(o,Math.ceil((e.length-2)/2/32)*32)),{dynamic:!0,encoded:c.concat(c.padLeft(c.fromNumber(t,{size:32})),o)}}if(t!==Number.parseInt(n))throw new m.BytesSizeMismatchError({expectedSize:Number.parseInt(n),value:e});return{dynamic:!1,encoded:c.padRight(e)}}function g(e){if(typeof e!="boolean")throw new N.BaseError(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);return{dynamic:!1,encoded:c.padLeft(c.fromBoolean(e))}}function b(e,{signed:r,size:n}){if(typeof n=="number"){const t=2n**(BigInt(n)-(r?1n:0n))-1n,o=r?-t-1n:0n;if(e>t||e<o)throw new c.IntegerOutOfRangeError({max:t.toString(),min:o.toString(),signed:r,size:n/8,value:e.toString()})}return{dynamic:!1,encoded:c.fromNumber(e,{size:32,signed:r})}}function z(e){const r=c.fromString(e),n=Math.ceil(c.size(r)/32),t=[];for(let o=0;o<n;o++)t.push(c.padRight(c.slice(r,o*32,(o+1)*32)));return{dynamic:!0,encoded:c.concat(c.padRight(c.fromNumber(c.size(r),{size:32})),...t)}}function A(e,r){const{checksumAddress:n,parameter:t}=r;let o=!1;const i=[];for(let s=0;s<t.components.length;s++){const a=t.components[s],d=Array.isArray(e)?s:a.name,p=f({checksumAddress:n,parameter:a,value:e[d]});i.push(p),p.dynamic&&(o=!0)}return{dynamic:o,encoded:o?u(i):c.concat(...i.map(({encoded:s})=>s))}}function S(e){const r=e.match(/^(.*)\[(\d+)?\]$/);return r?[r[2]?Number(r[2]):null,r[1]]:void 0}exports.encode=u;exports.encodeAddress=y;exports.encodeArray=h;exports.encodeBoolean=g;exports.encodeBytes=l;exports.encodeNumber=b;exports.encodeString=z;exports.encodeTuple=A;exports.getArrayComponents=S;exports.prepareParameter=f;exports.prepareParameters=P;

package/dist/index309.js

@@ -1,47 +1,197 @@
-import { size as d, SizeOverflowError as u, SizeExceedsPaddingSizeError as a } from "./index308.js";
-function p(e, t) {
-  if (d(e) > t)
-    throw new u({
-      givenSize: d(e),
-      maxSize: t
-    });
-}
-const n = {
-  zero: 48,
-  nine: 57,
-  A: 65,
-  F: 70,
-  a: 97,
-  f: 102
-};
-function s(e) {
-  if (e >= n.zero && e <= n.nine)
-    return e - n.zero;
-  if (e >= n.A && e <= n.F)
-    return e - (n.A - 10);
-  if (e >= n.a && e <= n.f)
-    return e - (n.a - 10);
-}
-function S(e, t = {}) {
-  const { dir: z, size: i = 32 } = t;
-  if (i === 0)
-    return e;
-  if (e.length > i)
-    throw new a({
-      size: e.length,
-      targetSize: i,
-      type: "Bytes"
-    });
-  const o = new Uint8Array(i);
-  for (let r = 0; r < i; r++) {
-    const f = z === "right";
-    o[f ? r : i - r - 1] = e[f ? r : e.length - r - 1];
-  }
-  return o;
+import { InvalidTypeError as g, InvalidArrayError as b, ArrayLengthMismatchError as w, BytesSizeMismatchError as z } from "./index291.js";
+import { assert as x } from "./index307.js";
+import { BaseError as S } from "./index302.js";
+import { size as d, fromNumber as f, concat as p, padLeft as h, fromBoolean as A, IntegerOutOfRangeError as E, padRight as y, fromString as I, slice as B } from "./index288.js";
+import { integerRegex as L } from "./index308.js";
+function q({ checksumAddress: e, parameters: n, values: r }) {
+  const t = [];
+  for (let o = 0; o < n.length; o++)
+    t.push(u({
+      checksumAddress: e,
+      parameter: n[o],
+      value: r[o]
+    }));
+  return t;
+}
+function u({ checksumAddress: e = !1, parameter: n, value: r }) {
+  const t = n, o = k(t.type);
+  if (o) {
+    const [i, c] = o;
+    return P(r, {
+      checksumAddress: e,
+      length: i,
+      parameter: {
+        ...t,
+        type: c
+      }
+    });
+  }
+  if (t.type === "tuple")
+    return R(r, {
+      checksumAddress: e,
+      parameter: t
+    });
+  if (t.type === "address")
+    return N(r, {
+      checksum: e
+    });
+  if (t.type === "bool")
+    return C(r);
+  if (t.type.startsWith("uint") || t.type.startsWith("int")) {
+    const i = t.type.startsWith("int"), [, , c = "256"] = L.exec(t.type) ?? [];
+    return M(r, {
+      signed: i,
+      size: Number(c)
+    });
+  }
+  if (t.type.startsWith("bytes"))
+    return $(r, { type: t.type });
+  if (t.type === "string")
+    return W(r);
+  throw new g(t.type);
+}
+function l(e) {
+  let n = 0;
+  for (let i = 0; i < e.length; i++) {
+    const { dynamic: c, encoded: s } = e[i];
+    c ? n += 32 : n += d(s);
+  }
+  const r = [], t = [];
+  let o = 0;
+  for (let i = 0; i < e.length; i++) {
+    const { dynamic: c, encoded: s } = e[i];
+    c ? (r.push(f(n + o, { size: 32 })), t.push(s), o += d(s)) : r.push(s);
+  }
+  return p(...r, ...t);
+}
+function N(e, n) {
+  const { checksum: r = !1 } = n;
+  return x(e, { strict: r }), {
+    dynamic: !1,
+    encoded: h(e.toLowerCase())
+  };
+}
+function P(e, n) {
+  const { checksumAddress: r, length: t, parameter: o } = n, i = t === null;
+  if (!Array.isArray(e))
+    throw new b(e);
+  if (!i && e.length !== t)
+    throw new w({
+      expectedLength: t,
+      givenLength: e.length,
+      type: `${o.type}[${t}]`
+    });
+  let c = !1;
+  const s = [];
+  for (let a = 0; a < e.length; a++) {
+    const m = u({
+      checksumAddress: r,
+      parameter: o,
+      value: e[a]
+    });
+    m.dynamic && (c = !0), s.push(m);
+  }
+  if (i || c) {
+    const a = l(s);
+    if (i) {
+      const m = f(s.length, { size: 32 });
+      return {
+        dynamic: !0,
+        encoded: s.length > 0 ? p(m, a) : m
+      };
+    }
+    if (c)
+      return { dynamic: !0, encoded: a };
+  }
+  return {
+    dynamic: !1,
+    encoded: p(...s.map(({ encoded: a }) => a))
+  };
+}
+function $(e, { type: n }) {
+  const [, r] = n.split("bytes"), t = d(e);
+  if (!r) {
+    let o = e;
+    return t % 32 !== 0 && (o = y(o, Math.ceil((e.length - 2) / 2 / 32) * 32)), {
+      dynamic: !0,
+      encoded: p(h(f(t, { size: 32 })), o)
+    };
+  }
+  if (t !== Number.parseInt(r))
+    throw new z({
+      expectedSize: Number.parseInt(r),
+      value: e
+    });
+  return { dynamic: !1, encoded: y(e) };
+}
+function C(e) {
+  if (typeof e != "boolean")
+    throw new S(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);
+  return { dynamic: !1, encoded: h(A(e)) };
+}
+function M(e, { signed: n, size: r }) {
+  if (typeof r == "number") {
+    const t = 2n ** (BigInt(r) - (n ? 1n : 0n)) - 1n, o = n ? -t - 1n : 0n;
+    if (e > t || e < o)
+      throw new E({
+        max: t.toString(),
+        min: o.toString(),
+        signed: n,
+        size: r / 8,
+        value: e.toString()
+      });
+  }
+  return {
+    dynamic: !1,
+    encoded: f(e, {
+      size: 32,
+      signed: n
+    })
+  };
+}
+function W(e) {
+  const n = I(e), r = Math.ceil(d(n) / 32), t = [];
+  for (let o = 0; o < r; o++)
+    t.push(y(B(n, o * 32, (o + 1) * 32)));
+  return {
+    dynamic: !0,
+    encoded: p(y(f(d(n), { size: 32 })), ...t)
+  };
+}
+function R(e, n) {
+  const { checksumAddress: r, parameter: t } = n;
+  let o = !1;
+  const i = [];
+  for (let c = 0; c < t.components.length; c++) {
+    const s = t.components[c], a = Array.isArray(e) ? c : s.name, m = u({
+      checksumAddress: r,
+      parameter: s,
+      value: e[a]
+    });
+    i.push(m), m.dynamic && (o = !0);
+  }
+  return {
+    dynamic: o,
+    encoded: o ? l(i) : p(...i.map(({ encoded: c }) => c))
+  };
+}
+function k(e) {
+  const n = e.match(/^(.*)\[(\d+)?\]$/);
+  return n ? (
+    // Return `null` if the array is dynamic.
+    [n[2] ? Number(n[2]) : null, n[1]]
+  ) : void 0;
 }
 export {
-  p as assertSize,
-  n as charCodeMap,
-  s as charCodeToBase16,
-  S as pad
+  l as encode,
+  N as encodeAddress,
+  P as encodeArray,
+  C as encodeBoolean,
+  $ as encodeBytes,
+  M as encodeNumber,
+  W as encodeString,
+  R as encodeTuple,
+  k as getArrayComponents,
+  u as prepareParameter,
+  q as prepareParameters
 };

package/dist/index31.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./index32.cjs"),i=require("./index33.cjs");function d(e,o){const{abi:a,args:n,bytecode:r,...t}=o,c=s.encodeDeployData({abi:a,args:n,bytecode:r});return i.sendTransaction(e,{...t,...t.authorizationList?{to:null}:{},data:c})}exports.deployContract=d;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const g=require("./index45.cjs"),m=require("./index177.cjs"),f=require("./index221.cjs"),q=require("./index29.cjs"),G=require("./index64.cjs");async function C(i,u){const{abi:a,address:r,args:c,functionName:n,dataSuffix:o,...t}=u,d=m.encodeFunctionData({abi:a,args:c,functionName:n});try{return await q.getAction(i,G.estimateGas,"estimateGas")({data:`${d}${o?o.replace("0x",""):""}`,to:r,...t})}catch(s){const e=t.account?g.parseAccount(t.account):void 0;throw f.getContractError(s,{abi:a,address:r,args:c,docsPath:"/docs/contract/estimateContractGas",functionName:n,sender:e==null?void 0:e.address})}}exports.estimateContractGas=C;

package/dist/index31.js

@@ -1,13 +1,32 @@
-import { encodeDeployData as i } from "./index32.js";
-import { sendTransaction as s } from "./index33.js";
-function p(o, a) {
-  const { abi: n, args: r, bytecode: e, ...t } = a, c = i({ abi: n, args: r, bytecode: e });
-  return s(o, {
-    ...t,
-    ...t.authorizationList ? { to: null } : {},
-    data: c
+import { parseAccount as f } from "./index45.js";
+import { encodeFunctionData as u } from "./index177.js";
+import { getContractError as p } from "./index221.js";
+import { getAction as g } from "./index29.js";
+import { estimateGas as G } from "./index64.js";
+async function A(i, m) {
+  const { abi: o, address: r, args: e, functionName: s, dataSuffix: c, ...t } = m, d = u({
+    abi: o,
+    args: e,
+    functionName: s
   });
+  try {
+    return await g(i, G, "estimateGas")({
+      data: `${d}${c ? c.replace("0x", "") : ""}`,
+      to: r,
+      ...t
+    });
+  } catch (n) {
+    const a = t.account ? f(t.account) : void 0;
+    throw p(n, {
+      abi: o,
+      address: r,
+      args: e,
+      docsPath: "/docs/contract/estimateContractGas",
+      functionName: s,
+      sender: a == null ? void 0 : a.address
+    });
+  }
 }
 export {
-  p as deployContract
+  A as estimateContractGas
 };