@gardenfi/utils 3.0.0-beta.1 → 3.0.0-beta.2

package/dist/index235.js

@@ -1,217 +1,68 @@
-import { anumber as C } from "./index229.js";
-import { numberToBytesLE as I, numberToBytesBE as y, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as x, validateObject as z } from "./index245.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const d = BigInt(0), f = BigInt(1), g = /* @__PURE__ */ BigInt(2), j = /* @__PURE__ */ BigInt(3), L = /* @__PURE__ */ BigInt(4), _ = /* @__PURE__ */ BigInt(5), T = /* @__PURE__ */ BigInt(8);
-function w(t, n) {
-  const o = t % n;
-  return o >= d ? o : n + o;
-}
-function $(t, n, o) {
-  let r = t;
-  for (; n-- > d; )
-    r *= r, r %= o;
-  return r;
-}
-function B(t, n) {
-  if (t === d)
-    throw new Error("invert: expected non-zero number");
-  if (n <= d)
-    throw new Error("invert: expected positive modulus, got " + n);
-  let o = w(t, n), r = n, s = d, l = f;
-  for (; o !== d; ) {
-    const c = r / o, e = r % o, i = s - l * c;
-    r = o, o = e, s = l, l = i;
+import { isTupleRegex as g, execTyped as w } from "./index233.js";
+import { UnknownTypeError as S } from "./index237.js";
+import { InvalidAbiTypeParameterError as d } from "./index238.js";
+import { InvalidSignatureError as T, InvalidStructSignatureError as v } from "./index239.js";
+import { CircularReferenceError as x } from "./index241.js";
+import { isStructSignature as E, execStructSignature as b } from "./index234.js";
+import { parseAbiParameter as A, isSolidityType as $ } from "./index236.js";
+function C(s) {
+  const n = {}, c = s.length;
+  for (let t = 0; t < c; t++) {
+    const i = s[t];
+    if (!E(i))
+      continue;
+    const r = b(i);
+    if (!r)
+      throw new T({ signature: i, type: "struct" });
+    const u = r.properties.split(";"), e = [], h = u.length;
+    for (let l = 0; l < h; l++) {
+      const m = u[l].trim();
+      if (!m)
+        continue;
+      const y = A(m, {
+        type: "struct"
+      });
+      e.push(y);
+    }
+    if (!e.length)
+      throw new v({ signature: i });
+    n[r.name] = e;
   }
-  if (r !== f)
-    throw new Error("invert: does not exist");
-  return w(s, n);
-}
-function M(t, n) {
-  const o = (t.ORDER + f) / L, r = t.pow(n, o);
-  if (!t.eql(t.sqr(r), n))
-    throw new Error("Cannot find square root");
-  return r;
-}
-function H(t, n) {
-  const o = (t.ORDER - _) / T, r = t.mul(n, g), s = t.pow(r, o), l = t.mul(n, s), u = t.mul(t.mul(l, g), s), c = t.mul(l, t.sub(u, t.ONE));
-  if (!t.eql(t.sqr(c), n))
-    throw new Error("Cannot find square root");
-  return c;
-}
-function K(t) {
-  if (t < BigInt(3))
-    throw new Error("sqrt is not defined for small field");
-  let n = t - f, o = 0;
-  for (; n % g === d; )
-    n /= g, o++;
-  let r = g;
-  const s = J(t);
-  for (; N(s, r) === 1; )
-    if (r++ > 1e3)
-      throw new Error("Cannot find square root: probably non-prime P");
-  if (o === 1)
-    return M;
-  let l = s.pow(r, n);
-  const u = (n + f) / g;
-  return function(e, i) {
-    if (e.is0(i))
-      return i;
-    if (N(e, i) !== 1)
-      throw new Error("Cannot find square root");
-    let h = o, b = e.mul(e.ONE, l), a = e.pow(i, n), m = e.pow(i, u);
-    for (; !e.eql(a, e.ONE); ) {
-      if (e.is0(a))
-        return e.ZERO;
-      let q = 1, v = e.sqr(a);
-      for (; !e.eql(v, e.ONE); )
-        if (q++, v = e.sqr(v), q === h)
-          throw new Error("Cannot find square root");
-      const A = f << BigInt(h - q - 1), E = e.pow(b, A);
-      h = q, b = e.sqr(E), a = e.mul(a, b), m = e.mul(m, E);
+  const o = {}, a = Object.entries(n), p = a.length;
+  for (let t = 0; t < p; t++) {
+    const [i, r] = a[t];
+    o[i] = f(r, n);
+  }
+  return o;
+}
+const I = /^(?<type>[a-zA-Z$_][a-zA-Z0-9$_]*)(?<array>(?:\[\d*?\])+?)?$/;
+function f(s = [], n = {}, c = /* @__PURE__ */ new Set()) {
+  const o = [], a = s.length;
+  for (let p = 0; p < a; p++) {
+    const t = s[p];
+    if (g.test(t.type))
+      o.push(t);
+    else {
+      const r = w(I, t.type);
+      if (!(r != null && r.type))
+        throw new d({ abiParameter: t });
+      const { array: u, type: e } = r;
+      if (e in n) {
+        if (c.has(e))
+          throw new x({ type: e });
+        o.push({
+          ...t,
+          type: `tuple${u ?? ""}`,
+          components: f(n[e], n, /* @__PURE__ */ new Set([...c, e]))
+        });
+      } else if ($(e))
+        o.push(t);
+      else
+        throw new S({ type: e });
     }
-    return m;
-  };
-}
-function Q(t) {
-  return t % L === j ? M : t % T === _ ? H : K(t);
-}
-const V = [
-  "create",
-  "isValid",
-  "is0",
-  "neg",
-  "inv",
-  "sqrt",
-  "sqr",
-  "eql",
-  "add",
-  "sub",
-  "mul",
-  "pow",
-  "div",
-  "addN",
-  "subN",
-  "mulN",
-  "sqrN"
-];
-function P(t) {
-  const n = {
-    ORDER: "bigint",
-    MASK: "bigint",
-    BYTES: "isSafeInteger",
-    BITS: "isSafeInteger"
-  }, o = V.reduce((r, s) => (r[s] = "function", r), n);
-  return z(t, o);
-}
-function Y(t, n, o) {
-  if (o < d)
-    throw new Error("invalid exponent, negatives unsupported");
-  if (o === d)
-    return t.ONE;
-  if (o === f)
-    return n;
-  let r = t.ONE, s = n;
-  for (; o > d; )
-    o & f && (r = t.mul(r, s)), s = t.sqr(s), o >>= f;
-  return r;
-}
-function k(t, n, o = !1) {
-  const r = new Array(n.length).fill(o ? t.ZERO : void 0), s = n.reduce((u, c, e) => t.is0(c) ? u : (r[e] = u, t.mul(u, c)), t.ONE), l = t.inv(s);
-  return n.reduceRight((u, c, e) => t.is0(c) ? u : (r[e] = t.mul(u, r[e]), t.mul(u, c)), l), r;
-}
-function N(t, n) {
-  const o = (t.ORDER - f) / g, r = t.pow(n, o), s = t.eql(r, t.ONE), l = t.eql(r, t.ZERO), u = t.eql(r, t.neg(t.ONE));
-  if (!s && !l && !u)
-    throw new Error("invalid Legendre symbol result");
-  return s ? 1 : l ? 0 : -1;
-}
-function G(t, n) {
-  n !== void 0 && C(n);
-  const o = n !== void 0 ? n : t.toString(2).length, r = Math.ceil(o / 8);
-  return { nBitLength: o, nByteLength: r };
-}
-function J(t, n, o = !1, r = {}) {
-  if (t <= d)
-    throw new Error("invalid field: expected ORDER > 0, got " + t);
-  const { nBitLength: s, nByteLength: l } = G(t, n);
-  if (l > 2048)
-    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
-  let u;
-  const c = Object.freeze({
-    ORDER: t,
-    isLE: o,
-    BITS: s,
-    BYTES: l,
-    MASK: Z(s),
-    ZERO: d,
-    ONE: f,
-    create: (e) => w(e, t),
-    isValid: (e) => {
-      if (typeof e != "bigint")
-        throw new Error("invalid field element: expected bigint, got " + typeof e);
-      return d <= e && e < t;
-    },
-    is0: (e) => e === d,
-    isOdd: (e) => (e & f) === f,
-    neg: (e) => w(-e, t),
-    eql: (e, i) => e === i,
-    sqr: (e) => w(e * e, t),
-    add: (e, i) => w(e + i, t),
-    sub: (e, i) => w(e - i, t),
-    mul: (e, i) => w(e * i, t),
-    pow: (e, i) => Y(c, e, i),
-    div: (e, i) => w(e * B(i, t), t),
-    // Same as above, but doesn't normalize
-    sqrN: (e) => e * e,
-    addN: (e, i) => e + i,
-    subN: (e, i) => e - i,
-    mulN: (e, i) => e * i,
-    inv: (e) => B(e, t),
-    sqrt: r.sqrt || ((e) => (u || (u = Q(t)), u(c, e))),
-    toBytes: (e) => o ? I(e, l) : y(e, l),
-    fromBytes: (e) => {
-      if (e.length !== l)
-        throw new Error("Field.fromBytes: expected " + l + " bytes, got " + e.length);
-      return o ? S(e) : x(e);
-    },
-    // TODO: we don't need it here, move out to separate fn
-    invertBatch: (e) => k(c, e),
-    // We can't move this out because Fp6, Fp12 implement it
-    // and it's unclear what to return in there.
-    cmov: (e, i, h) => h ? i : e
-  });
-  return Object.freeze(c);
-}
-function O(t) {
-  if (typeof t != "bigint")
-    throw new Error("field order must be bigint");
-  const n = t.toString(2).length;
-  return Math.ceil(n / 8);
-}
-function U(t) {
-  const n = O(t);
-  return n + Math.ceil(n / 2);
-}
-function D(t, n, o = !1) {
-  const r = t.length, s = O(n), l = U(n);
-  if (r < 16 || r < l || r > 1024)
-    throw new Error("expected " + l + "-1024 bytes of input, got " + r);
-  const u = o ? S(t) : x(t), c = w(u, n - f) + f;
-  return o ? I(c, s) : y(c, s);
+  }
+  return o;
 }
 export {
-  J as Field,
-  k as FpInvertBatch,
-  N as FpLegendre,
-  Y as FpPow,
-  Q as FpSqrt,
-  O as getFieldBytesLength,
-  U as getMinHashLength,
-  B as invert,
-  D as mapHashToField,
-  w as mod,
-  G as nLength,
-  $ as pow2,
-  K as tonelliShanks,
-  P as validateField
+  C as parseStructs
 };

package/dist/index236.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index229.cjs");class r extends i.Hash{constructor(t,h){super(),this.finished=!1,this.destroyed=!1,i.ahash(t);const n=i.toBytes(h);if(this.iHash=t.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const a=this.blockLen,e=new Uint8Array(a);e.set(n.length>a?t.create().update(n).digest():n);for(let s=0;s<e.length;s++)e[s]^=54;this.iHash.update(e),this.oHash=t.create();for(let s=0;s<e.length;s++)e[s]^=106;this.oHash.update(e),i.clean(e)}update(t){return i.aexists(this),this.iHash.update(t),this}digestInto(t){i.aexists(this),i.abytes(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:h,iHash:n,finished:a,destroyed:e,blockLen:s,outputLen:d}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=d,t.oHash=h._cloneInto(t.oHash),t.iHash=n._cloneInto(t.iHash),t}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const c=(o,t,h)=>new r(o,t).update(h).digest();c.create=(o,t)=>new r(o,t);exports.HMAC=r;exports.hmac=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const m=require("./index233.cjs"),A=require("./index237.cjs"),g=require("./index238.cjs"),d=require("./index239.cjs"),q=require("./index240.cjs"),h=require("./index254.cjs"),o=require("./index234.cjs");function z(e,t={}){if(o.isFunctionSignature(e))return E(e,t);if(o.isEventSignature(e))return P(e,t);if(o.isErrorSignature(e))return M(e,t);if(o.isConstructorSignature(e))return I(e,t);if(o.isFallbackSignature(e))return R(e);if(o.isReceiveSignature(e))return{type:"receive",stateMutability:"payable"};throw new d.UnknownSignatureError({signature:e})}function E(e,t={}){const a=o.execFunctionSignature(e);if(!a)throw new d.InvalidSignatureError({signature:e,type:"function"});const n=u(a.parameters),r=[],c=n.length;for(let s=0;s<c;s++)r.push(y(n[s],{modifiers:o.functionModifiers,structs:t,type:"function"}));const i=[];if(a.returns){const s=u(a.returns),l=s.length;for(let f=0;f<l;f++)i.push(y(s[f],{modifiers:o.functionModifiers,structs:t,type:"function"}))}return{name:a.name,type:"function",stateMutability:a.stateMutability??"nonpayable",inputs:r,outputs:i}}function P(e,t={}){const a=o.execEventSignature(e);if(!a)throw new d.InvalidSignatureError({signature:e,type:"event"});const n=u(a.parameters),r=[],c=n.length;for(let i=0;i<c;i++)r.push(y(n[i],{modifiers:o.eventModifiers,structs:t,type:"event"}));return{name:a.name,type:"event",inputs:r}}function M(e,t={}){const a=o.execErrorSignature(e);if(!a)throw new d.InvalidSignatureError({signature:e,type:"error"});const n=u(a.parameters),r=[],c=n.length;for(let i=0;i<c;i++)r.push(y(n[i],{structs:t,type:"error"}));return{name:a.name,type:"error",inputs:r}}function I(e,t={}){const a=o.execConstructorSignature(e);if(!a)throw new d.InvalidSignatureError({signature:e,type:"constructor"});const n=u(a.parameters),r=[],c=n.length;for(let i=0;i<c;i++)r.push(y(n[i],{structs:t,type:"constructor"}));return{type:"constructor",stateMutability:a.stateMutability??"nonpayable",inputs:r}}function R(e){const t=o.execFallbackSignature(e);if(!t)throw new d.InvalidSignatureError({signature:e,type:"fallback"});return{type:"fallback",stateMutability:t.stateMutability??"nonpayable"}}const _=/^(?<type>[a-zA-Z$_][a-zA-Z0-9$_]*(?:\spayable)?)(?<array>(?:\[\d*?\])+?)?(?:\s(?<modifier>calldata|indexed|memory|storage{1}))?(?:\s(?<name>[a-zA-Z$_][a-zA-Z0-9$_]*))?$/,$=/^\((?<type>.+?)\)(?<array>(?:\[\d*?\])+?)?(?:\s(?<modifier>calldata|indexed|memory|storage{1}))?(?:\s(?<name>[a-zA-Z$_][a-zA-Z0-9$_]*))?$/,K=/^u?int$/;function y(e,t){var p,w;const a=h.getParameterCacheKey(e,t==null?void 0:t.type,t==null?void 0:t.structs);if(h.parameterCache.has(a))return h.parameterCache.get(a);const n=m.isTupleRegex.test(e),r=m.execTyped(n?$:_,e);if(!r)throw new g.InvalidParameterError({param:e});if(r.name&&F(r.name))throw new g.SolidityProtectedKeywordError({param:e,name:r.name});const c=r.name?{name:r.name}:{},i=r.modifier==="indexed"?{indexed:!0}:{},s=(t==null?void 0:t.structs)??{};let l,f={};if(n){l="tuple";const v=u(r.type),x=[],k=v.length;for(let b=0;b<k;b++)x.push(y(v[b],{structs:s}));f={components:x}}else if(r.type in s)l="tuple",f={components:s[r.type]};else if(K.test(r.type))l=`${r.type}256`;else if(r.type==="address payable")l="address";else if(l=r.type,(t==null?void 0:t.type)!=="struct"&&!C(l))throw new A.UnknownSolidityTypeError({type:l});if(r.modifier){if(!((w=(p=t==null?void 0:t.modifiers)==null?void 0:p.has)!=null&&w.call(p,r.modifier)))throw new g.InvalidModifierError({param:e,type:t==null?void 0:t.type,modifier:r.modifier});if(o.functionModifiers.has(r.modifier)&&!T(l,!!r.array))throw new g.InvalidFunctionModifierError({param:e,type:t==null?void 0:t.type,modifier:r.modifier})}const S={type:`${l}${r.array??""}`,...c,...i,...f};return h.parameterCache.set(a,S),S}function u(e,t=[],a="",n=0){const r=e.trim().length;for(let c=0;c<r;c++){const i=e[c],s=e.slice(c+1);switch(i){case",":return n===0?u(s,[...t,a.trim()]):u(s,t,`${a}${i}`,n);case"(":return u(s,t,`${a}${i}`,n+1);case")":return u(s,t,`${a}${i}`,n-1);default:return u(s,t,`${a}${i}`,n)}}if(a==="")return t;if(n!==0)throw new q.InvalidParenthesisError({current:a,depth:n});return t.push(a.trim()),t}function C(e){return e==="address"||e==="bool"||e==="function"||e==="string"||m.bytesRegex.test(e)||m.integerRegex.test(e)}const Z=/^(?:after|alias|anonymous|apply|auto|byte|calldata|case|catch|constant|copyof|default|defined|error|event|external|false|final|function|immutable|implements|in|indexed|inline|internal|let|mapping|match|memory|mutable|null|of|override|partial|private|promise|public|pure|reference|relocatable|return|returns|sizeof|static|storage|struct|super|supports|switch|this|true|try|typedef|typeof|var|view|virtual)$/;function F(e){return e==="address"||e==="bool"||e==="function"||e==="string"||e==="tuple"||m.bytesRegex.test(e)||m.integerRegex.test(e)||Z.test(e)}function T(e,t){return t||e==="bytes"||e==="string"||e==="tuple"}exports.isSolidityKeyword=F;exports.isSolidityType=C;exports.isValidDataLocation=T;exports.parseAbiParameter=y;exports.parseConstructorSignature=I;exports.parseErrorSignature=M;exports.parseEventSignature=P;exports.parseFallbackSignature=R;exports.parseFunctionSignature=E;exports.parseSignature=z;exports.splitParameters=u;

package/dist/index236.js

@@ -1,45 +1,191 @@
-import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./index229.js";
-class r extends d {
-  constructor(t, i) {
-    super(), this.finished = !1, this.destroyed = !1, u(t);
-    const h = H(i);
-    if (this.iHash = t.create(), typeof this.iHash.update != "function")
-      throw new Error("Expected instance of class which extends utils.Hash");
-    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
-    const o = this.blockLen, e = new Uint8Array(o);
-    e.set(h.length > o ? t.create().update(h).digest() : h);
-    for (let s = 0; s < e.length; s++)
-      e[s] ^= 54;
-    this.iHash.update(e), this.oHash = t.create();
-    for (let s = 0; s < e.length; s++)
-      e[s] ^= 106;
-    this.oHash.update(e), l(e);
-  }
-  update(t) {
-    return a(this), this.iHash.update(t), this;
-  }
-  digestInto(t) {
-    a(this), p(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
-  }
-  digest() {
-    const t = new Uint8Array(this.oHash.outputLen);
-    return this.digestInto(t), t;
-  }
-  _cloneInto(t) {
-    t || (t = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: i, iHash: h, finished: o, destroyed: e, blockLen: s, outputLen: c } = this;
-    return t = t, t.finished = o, t.destroyed = e, t.blockLen = s, t.outputLen = c, t.oHash = i._cloneInto(t.oHash), t.iHash = h._cloneInto(t.iHash), t;
+import { execTyped as E, isTupleRegex as P, bytesRegex as x, integerRegex as $ } from "./index233.js";
+import { UnknownSolidityTypeError as M } from "./index237.js";
+import { InvalidParameterError as R, SolidityProtectedKeywordError as k, InvalidModifierError as z, InvalidFunctionModifierError as A } from "./index238.js";
+import { UnknownSignatureError as F, InvalidSignatureError as m } from "./index239.js";
+import { InvalidParenthesisError as T } from "./index240.js";
+import { getParameterCacheKey as _, parameterCache as p } from "./index254.js";
+import { isFunctionSignature as C, isEventSignature as I, isErrorSignature as Z, isConstructorSignature as K, isFallbackSignature as L, isReceiveSignature as U, functionModifiers as h, execFunctionSignature as W, execEventSignature as D, eventModifiers as V, execErrorSignature as j, execConstructorSignature as q, execFallbackSignature as B } from "./index234.js";
+function le(e, t = {}) {
+  if (C(e))
+    return G(e, t);
+  if (I(e))
+    return H(e, t);
+  if (Z(e))
+    return J(e, t);
+  if (K(e))
+    return N(e, t);
+  if (L(e))
+    return O(e);
+  if (U(e))
+    return {
+      type: "receive",
+      stateMutability: "payable"
+    };
+  throw new F({ signature: e });
+}
+function G(e, t = {}) {
+  const n = W(e);
+  if (!n)
+    throw new m({ signature: e, type: "function" });
+  const a = u(n.parameters), r = [], c = a.length;
+  for (let o = 0; o < c; o++)
+    r.push(l(a[o], {
+      modifiers: h,
+      structs: t,
+      type: "function"
+    }));
+  const i = [];
+  if (n.returns) {
+    const o = u(n.returns), s = o.length;
+    for (let f = 0; f < s; f++)
+      i.push(l(o[f], {
+        modifiers: h,
+        structs: t,
+        type: "function"
+      }));
   }
-  clone() {
-    return this._cloneInto();
+  return {
+    name: n.name,
+    type: "function",
+    stateMutability: n.stateMutability ?? "nonpayable",
+    inputs: r,
+    outputs: i
+  };
+}
+function H(e, t = {}) {
+  const n = D(e);
+  if (!n)
+    throw new m({ signature: e, type: "event" });
+  const a = u(n.parameters), r = [], c = a.length;
+  for (let i = 0; i < c; i++)
+    r.push(l(a[i], {
+      modifiers: V,
+      structs: t,
+      type: "event"
+    }));
+  return { name: n.name, type: "event", inputs: r };
+}
+function J(e, t = {}) {
+  const n = j(e);
+  if (!n)
+    throw new m({ signature: e, type: "error" });
+  const a = u(n.parameters), r = [], c = a.length;
+  for (let i = 0; i < c; i++)
+    r.push(l(a[i], { structs: t, type: "error" }));
+  return { name: n.name, type: "error", inputs: r };
+}
+function N(e, t = {}) {
+  const n = q(e);
+  if (!n)
+    throw new m({ signature: e, type: "constructor" });
+  const a = u(n.parameters), r = [], c = a.length;
+  for (let i = 0; i < c; i++)
+    r.push(l(a[i], { structs: t, type: "constructor" }));
+  return {
+    type: "constructor",
+    stateMutability: n.stateMutability ?? "nonpayable",
+    inputs: r
+  };
+}
+function O(e) {
+  const t = B(e);
+  if (!t)
+    throw new m({ signature: e, type: "fallback" });
+  return {
+    type: "fallback",
+    stateMutability: t.stateMutability ?? "nonpayable"
+  };
+}
+const Q = /^(?<type>[a-zA-Z$_][a-zA-Z0-9$_]*(?:\spayable)?)(?<array>(?:\[\d*?\])+?)?(?:\s(?<modifier>calldata|indexed|memory|storage{1}))?(?:\s(?<name>[a-zA-Z$_][a-zA-Z0-9$_]*))?$/, X = /^\((?<type>.+?)\)(?<array>(?:\[\d*?\])+?)?(?:\s(?<modifier>calldata|indexed|memory|storage{1}))?(?:\s(?<name>[a-zA-Z$_][a-zA-Z0-9$_]*))?$/, Y = /^u?int$/;
+function l(e, t) {
+  var y, b;
+  const n = _(e, t == null ? void 0 : t.type, t == null ? void 0 : t.structs);
+  if (p.has(n))
+    return p.get(n);
+  const a = P.test(e), r = E(a ? X : Q, e);
+  if (!r)
+    throw new R({ param: e });
+  if (r.name && re(r.name))
+    throw new k({ param: e, name: r.name });
+  const c = r.name ? { name: r.name } : {}, i = r.modifier === "indexed" ? { indexed: !0 } : {}, o = (t == null ? void 0 : t.structs) ?? {};
+  let s, f = {};
+  if (a) {
+    s = "tuple";
+    const w = u(r.type), S = [], v = w.length;
+    for (let d = 0; d < v; d++)
+      S.push(l(w[d], { structs: o }));
+    f = { components: S };
+  } else if (r.type in o)
+    s = "tuple", f = { components: o[r.type] };
+  else if (Y.test(r.type))
+    s = `${r.type}256`;
+  else if (r.type === "address payable")
+    s = "address";
+  else if (s = r.type, (t == null ? void 0 : t.type) !== "struct" && !ee(s))
+    throw new M({ type: s });
+  if (r.modifier) {
+    if (!((b = (y = t == null ? void 0 : t.modifiers) == null ? void 0 : y.has) != null && b.call(y, r.modifier)))
+      throw new z({
+        param: e,
+        type: t == null ? void 0 : t.type,
+        modifier: r.modifier
+      });
+    if (h.has(r.modifier) && !ne(s, !!r.array))
+      throw new A({
+        param: e,
+        type: t == null ? void 0 : t.type,
+        modifier: r.modifier
+      });
   }
-  destroy() {
-    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
+  const g = {
+    type: `${s}${r.array ?? ""}`,
+    ...c,
+    ...i,
+    ...f
+  };
+  return p.set(n, g), g;
+}
+function u(e, t = [], n = "", a = 0) {
+  const r = e.trim().length;
+  for (let c = 0; c < r; c++) {
+    const i = e[c], o = e.slice(c + 1);
+    switch (i) {
+      case ",":
+        return a === 0 ? u(o, [...t, n.trim()]) : u(o, t, `${n}${i}`, a);
+      case "(":
+        return u(o, t, `${n}${i}`, a + 1);
+      case ")":
+        return u(o, t, `${n}${i}`, a - 1);
+      default:
+        return u(o, t, `${n}${i}`, a);
+    }
   }
+  if (n === "")
+    return t;
+  if (a !== 0)
+    throw new T({ current: n, depth: a });
+  return t.push(n.trim()), t;
+}
+function ee(e) {
+  return e === "address" || e === "bool" || e === "function" || e === "string" || x.test(e) || $.test(e);
+}
+const te = /^(?:after|alias|anonymous|apply|auto|byte|calldata|case|catch|constant|copyof|default|defined|error|event|external|false|final|function|immutable|implements|in|indexed|inline|internal|let|mapping|match|memory|mutable|null|of|override|partial|private|promise|public|pure|reference|relocatable|return|returns|sizeof|static|storage|struct|super|supports|switch|this|true|try|typedef|typeof|var|view|virtual)$/;
+function re(e) {
+  return e === "address" || e === "bool" || e === "function" || e === "string" || e === "tuple" || x.test(e) || $.test(e) || te.test(e);
+}
+function ne(e, t) {
+  return t || e === "bytes" || e === "string" || e === "tuple";
 }
-const y = (n, t, i) => new r(n, t).update(i).digest();
-y.create = (n, t) => new r(n, t);
 export {
-  r as HMAC,
-  y as hmac
+  re as isSolidityKeyword,
+  ee as isSolidityType,
+  ne as isValidDataLocation,
+  l as parseAbiParameter,
+  N as parseConstructorSignature,
+  J as parseErrorSignature,
+  H as parseEventSignature,
+  O as parseFallbackSignature,
+  G as parseFunctionSignature,
+  le as parseSignature,
+  u as splitParameters
 };

package/dist/index237.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index229.cjs");function p(o,t,s,i){if(typeof o.setBigUint64=="function")return o.setBigUint64(t,s,i);const n=BigInt(32),r=BigInt(4294967295),e=Number(s>>n&r),h=Number(s&r),u=i?4:0,l=i?0:4;o.setUint32(t+u,e,i),o.setUint32(t+l,h,i)}function g(o,t,s){return o&t^~o&s}function b(o,t,s){return o&t^o&s^t&s}class d extends f.Hash{constructor(t,s,i,n){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=t,this.outputLen=s,this.padOffset=i,this.isLE=n,this.buffer=new Uint8Array(t),this.view=f.createView(this.buffer)}update(t){f.aexists(this),t=f.toBytes(t),f.abytes(t);const{view:s,buffer:i,blockLen:n}=this,r=t.length;for(let e=0;e<r;){const h=Math.min(n-this.pos,r-e);if(h===n){const u=f.createView(t);for(;n<=r-e;e+=n)this.process(u,e);continue}i.set(t.subarray(e,e+h),this.pos),this.pos+=h,e+=h,this.pos===n&&(this.process(s,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){f.aexists(this),f.aoutput(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:n,isLE:r}=this;let{pos:e}=this;s[e++]=128,f.clean(this.buffer.subarray(e)),this.padOffset>n-e&&(this.process(i,0),e=0);for(let c=e;c<n;c++)s[c]=0;p(i,n-8,BigInt(this.length*8),r),this.process(i,0);const h=f.createView(t),u=this.outputLen;if(u%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=u/4,a=this.get();if(l>a.length)throw new Error("_sha2: outputLen bigger than state");for(let c=0;c<l;c++)h.setUint32(4*c,a[c],r)}digest(){const{buffer:t,outputLen:s}=this;this.digestInto(t);const i=t.slice(0,s);return this.destroy(),i}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:s,buffer:i,length:n,finished:r,destroyed:e,pos:h}=this;return t.destroyed=e,t.finished=r,t.length=n,t.pos=h,n%s&&t.buffer.set(i),t}clone(){return this._cloneInto()}}const w=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]);exports.Chi=g;exports.HashMD=d;exports.Maj=b;exports.SHA256_IV=w;exports.setBigUint64=p;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index228.cjs");class t extends r.BaseError{constructor({type:e}){super("Unknown type.",{metaMessages:[`Type "${e}" is not a valid ABI type. Perhaps you forgot to include a struct signature?`]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"UnknownTypeError"})}}class o extends r.BaseError{constructor({type:e}){super("Unknown type.",{metaMessages:[`Type "${e}" is not a valid ABI type.`]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"UnknownSolidityTypeError"})}}exports.UnknownSolidityTypeError=o;exports.UnknownTypeError=t;

package/dist/index237.js

@@ -1,81 +1,31 @@
-import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index229.js";
-function y(o, t, s, n) {
-  if (typeof o.setBigUint64 == "function")
-    return o.setBigUint64(t, s, n);
-  const i = BigInt(32), h = BigInt(4294967295), e = Number(s >> i & h), r = Number(s & h), c = n ? 4 : 0, u = n ? 0 : 4;
-  o.setUint32(t + c, e, n), o.setUint32(t + u, r, n);
-}
-function U(o, t, s) {
-  return o & t ^ ~o & s;
-}
-function _(o, t, s) {
-  return o & t ^ o & s ^ t & s;
-}
-class m extends g {
-  constructor(t, s, n, i) {
-    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = t, this.outputLen = s, this.padOffset = n, this.isLE = i, this.buffer = new Uint8Array(t), this.view = l(this.buffer);
-  }
-  update(t) {
-    b(this), t = a(t), d(t);
-    const { view: s, buffer: n, blockLen: i } = this, h = t.length;
-    for (let e = 0; e < h; ) {
-      const r = Math.min(i - this.pos, h - e);
-      if (r === i) {
-        const c = l(t);
-        for (; i <= h - e; e += i)
-          this.process(c, e);
-        continue;
-      }
-      n.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === i && (this.process(s, 0), this.pos = 0);
-    }
-    return this.length += t.length, this.roundClean(), this;
+import { BaseError as r } from "./index228.js";
+class o extends r {
+  constructor({ type: e }) {
+    super("Unknown type.", {
+      metaMessages: [
+        `Type "${e}" is not a valid ABI type. Perhaps you forgot to include a struct signature?`
+      ]
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "UnknownTypeError"
+    });
   }
-  digestInto(t) {
-    b(this), x(t, this), this.finished = !0;
-    const { buffer: s, view: n, blockLen: i, isLE: h } = this;
-    let { pos: e } = this;
-    s[e++] = 128, w(this.buffer.subarray(e)), this.padOffset > i - e && (this.process(n, 0), e = 0);
-    for (let f = e; f < i; f++)
-      s[f] = 0;
-    y(n, i - 8, BigInt(this.length * 8), h), this.process(n, 0);
-    const r = l(t), c = this.outputLen;
-    if (c % 4)
-      throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const u = c / 4, p = this.get();
-    if (u > p.length)
-      throw new Error("_sha2: outputLen bigger than state");
-    for (let f = 0; f < u; f++)
-      r.setUint32(4 * f, p[f], h);
-  }
-  digest() {
-    const { buffer: t, outputLen: s } = this;
-    this.digestInto(t);
-    const n = t.slice(0, s);
-    return this.destroy(), n;
-  }
-  _cloneInto(t) {
-    t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: s, buffer: n, length: i, finished: h, destroyed: e, pos: r } = this;
-    return t.destroyed = e, t.finished = h, t.length = i, t.pos = r, i % s && t.buffer.set(n), t;
-  }
-  clone() {
-    return this._cloneInto();
+}
+class a extends r {
+  constructor({ type: e }) {
+    super("Unknown type.", {
+      metaMessages: [`Type "${e}" is not a valid ABI type.`]
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "UnknownSolidityTypeError"
+    });
   }
 }
-const B = /* @__PURE__ */ Uint32Array.from([
-  1779033703,
-  3144134277,
-  1013904242,
-  2773480762,
-  1359893119,
-  2600822924,
-  528734635,
-  1541459225
-]);
 export {
-  U as Chi,
-  m as HashMD,
-  _ as Maj,
-  B as SHA256_IV,
-  y as setBigUint64
+  a as UnknownSolidityTypeError,
+  o as UnknownTypeError
 };