@gardenfi/swap 0.0.1-beta.9 → 0.0.2

package/dist/index425.js

@@ -1,346 +0,0 @@
-import { InvalidTypeError as C, InvalidArrayError as _, ArrayLengthMismatchError as $, BytesSizeMismatchError as O } from "./index398.js";
-import { checksum as M, assert as R } from "./index423.js";
-import { toNumber as u, slice as T, toBoolean as D, toBigInt as U, toString as V, trimLeft as j } from "./index424.js";
-import { BaseError as q } from "./index401.js";
-import { size as h, fromNumber as B, concat as m, fromBytes as w, padLeft as S, fromBoolean as F, IntegerOutOfRangeError as G, padRight as b, fromString as H, slice as J } from "./index395.js";
-import { integerRegex as K } from "./index427.js";
-function p(t, e, o) {
-  const { checksumAddress: n, staticPosition: s } = o, i = I(e.type);
-  if (i) {
-    const [r, d] = i;
-    return X(t, { ...e, type: d }, { checksumAddress: n, length: r, staticPosition: s });
-  }
-  if (e.type === "tuple")
-    return tt(t, e, {
-      checksumAddress: n,
-      staticPosition: s
-    });
-  if (e.type === "address")
-    return Q(t, { checksum: n });
-  if (e.type === "bool")
-    return Y(t);
-  if (e.type.startsWith("bytes"))
-    return Z(t, e, { staticPosition: s });
-  if (e.type.startsWith("uint") || e.type.startsWith("int"))
-    return v(t, e);
-  if (e.type === "string")
-    return et(t, { staticPosition: s });
-  throw new C(e.type);
-}
-const k = 32, A = 32;
-function Q(t, e = {}) {
-  const { checksum: o = !1 } = e, n = t.readBytes(32);
-  return [((i) => o ? M(i) : i)(w(T(n, -20))), 32];
-}
-function X(t, e, o) {
-  const { checksumAddress: n, length: s, staticPosition: i } = o;
-  if (!s) {
-    const c = u(t.readBytes(A)), a = i + c, f = a + k;
-    t.setPosition(a);
-    const y = u(t.readBytes(k)), l = g(e);
-    let P = 0;
-    const N = [];
-    for (let z = 0; z < y; ++z) {
-      t.setPosition(f + (l ? z * 32 : P));
-      const [L, E] = p(t, e, {
-        checksumAddress: n,
-        staticPosition: f
-      });
-      P += E, N.push(L);
-    }
-    return t.setPosition(i + 32), [N, 32];
-  }
-  if (g(e)) {
-    const c = u(t.readBytes(A)), a = i + c, f = [];
-    for (let y = 0; y < s; ++y) {
-      t.setPosition(a + y * 32);
-      const [l] = p(t, e, {
-        checksumAddress: n,
-        staticPosition: a
-      });
-      f.push(l);
-    }
-    return t.setPosition(i + 32), [f, 32];
-  }
-  let r = 0;
-  const d = [];
-  for (let c = 0; c < s; ++c) {
-    const [a, f] = p(t, e, {
-      checksumAddress: n,
-      staticPosition: i + r
-    });
-    r += f, d.push(a);
-  }
-  return [d, r];
-}
-function Y(t) {
-  return [D(t.readBytes(32), { size: 32 }), 32];
-}
-function Z(t, e, { staticPosition: o }) {
-  const [n, s] = e.type.split("bytes");
-  if (!s) {
-    const r = u(t.readBytes(32));
-    t.setPosition(o + r);
-    const d = u(t.readBytes(32));
-    if (d === 0)
-      return t.setPosition(o + 32), ["0x", 32];
-    const c = t.readBytes(d);
-    return t.setPosition(o + 32), [w(c), 32];
-  }
-  return [w(t.readBytes(Number.parseInt(s, 10), 32)), 32];
-}
-function v(t, e) {
-  const o = e.type.startsWith("int"), n = Number.parseInt(e.type.split("int")[1] || "256", 10), s = t.readBytes(32);
-  return [
-    n > 48 ? U(s, { signed: o }) : u(s, { signed: o }),
-    32
-  ];
-}
-function tt(t, e, o) {
-  const { checksumAddress: n, staticPosition: s } = o, i = e.components.length === 0 || e.components.some(({ name: c }) => !c), r = i ? [] : {};
-  let d = 0;
-  if (g(e)) {
-    const c = u(t.readBytes(A)), a = s + c;
-    for (let f = 0; f < e.components.length; ++f) {
-      const y = e.components[f];
-      t.setPosition(a + d);
-      const [l, P] = p(t, y, {
-        checksumAddress: n,
-        staticPosition: a
-      });
-      d += P, r[i ? f : y == null ? void 0 : y.name] = l;
-    }
-    return t.setPosition(s + 32), [r, 32];
-  }
-  for (let c = 0; c < e.components.length; ++c) {
-    const a = e.components[c], [f, y] = p(t, a, {
-      checksumAddress: n,
-      staticPosition: s
-    });
-    r[i ? c : a == null ? void 0 : a.name] = f, d += y;
-  }
-  return [r, d];
-}
-function et(t, { staticPosition: e }) {
-  const o = u(t.readBytes(32)), n = e + o;
-  t.setPosition(n);
-  const s = u(t.readBytes(32));
-  if (s === 0)
-    return t.setPosition(e + 32), ["", 32];
-  const i = t.readBytes(s, 32), r = V(j(i));
-  return t.setPosition(e + 32), [r, 32];
-}
-function pt({ checksumAddress: t, parameters: e, values: o }) {
-  const n = [];
-  for (let s = 0; s < e.length; s++)
-    n.push(x({
-      checksumAddress: t,
-      parameter: e[s],
-      value: o[s]
-    }));
-  return n;
-}
-function x({ checksumAddress: t = !1, parameter: e, value: o }) {
-  const n = e, s = I(n.type);
-  if (s) {
-    const [i, r] = s;
-    return st(o, {
-      checksumAddress: t,
-      length: i,
-      parameter: {
-        ...n,
-        type: r
-      }
-    });
-  }
-  if (n.type === "tuple")
-    return dt(o, {
-      checksumAddress: t,
-      parameter: n
-    });
-  if (n.type === "address")
-    return nt(o, {
-      checksum: t
-    });
-  if (n.type === "bool")
-    return it(o);
-  if (n.type.startsWith("uint") || n.type.startsWith("int")) {
-    const i = n.type.startsWith("int"), [, , r = "256"] = K.exec(n.type) ?? [];
-    return rt(o, {
-      signed: i,
-      size: Number(r)
-    });
-  }
-  if (n.type.startsWith("bytes"))
-    return ot(o, { type: n.type });
-  if (n.type === "string")
-    return ct(o);
-  throw new C(n.type);
-}
-function W(t) {
-  let e = 0;
-  for (let i = 0; i < t.length; i++) {
-    const { dynamic: r, encoded: d } = t[i];
-    r ? e += 32 : e += h(d);
-  }
-  const o = [], n = [];
-  let s = 0;
-  for (let i = 0; i < t.length; i++) {
-    const { dynamic: r, encoded: d } = t[i];
-    r ? (o.push(B(e + s, { size: 32 })), n.push(d), s += h(d)) : o.push(d);
-  }
-  return m(...o, ...n);
-}
-function nt(t, e) {
-  const { checksum: o = !1 } = e;
-  return R(t, { strict: o }), {
-    dynamic: !1,
-    encoded: S(t.toLowerCase())
-  };
-}
-function st(t, e) {
-  const { checksumAddress: o, length: n, parameter: s } = e, i = n === null;
-  if (!Array.isArray(t))
-    throw new _(t);
-  if (!i && t.length !== n)
-    throw new $({
-      expectedLength: n,
-      givenLength: t.length,
-      type: `${s.type}[${n}]`
-    });
-  let r = !1;
-  const d = [];
-  for (let c = 0; c < t.length; c++) {
-    const a = x({
-      checksumAddress: o,
-      parameter: s,
-      value: t[c]
-    });
-    a.dynamic && (r = !0), d.push(a);
-  }
-  if (i || r) {
-    const c = W(d);
-    if (i) {
-      const a = B(d.length, { size: 32 });
-      return {
-        dynamic: !0,
-        encoded: d.length > 0 ? m(a, c) : a
-      };
-    }
-    if (r)
-      return { dynamic: !0, encoded: c };
-  }
-  return {
-    dynamic: !1,
-    encoded: m(...d.map(({ encoded: c }) => c))
-  };
-}
-function ot(t, { type: e }) {
-  const [, o] = e.split("bytes"), n = h(t);
-  if (!o) {
-    let s = t;
-    return n % 32 !== 0 && (s = b(s, Math.ceil((t.length - 2) / 2 / 32) * 32)), {
-      dynamic: !0,
-      encoded: m(S(B(n, { size: 32 })), s)
-    };
-  }
-  if (n !== Number.parseInt(o, 10))
-    throw new O({
-      expectedSize: Number.parseInt(o, 10),
-      value: t
-    });
-  return { dynamic: !1, encoded: b(t) };
-}
-function it(t) {
-  if (typeof t != "boolean")
-    throw new q(`Invalid boolean value: "${t}" (type: ${typeof t}). Expected: \`true\` or \`false\`.`);
-  return { dynamic: !1, encoded: S(F(t)) };
-}
-function rt(t, { signed: e, size: o }) {
-  if (typeof o == "number") {
-    const n = 2n ** (BigInt(o) - (e ? 1n : 0n)) - 1n, s = e ? -n - 1n : 0n;
-    if (t > n || t < s)
-      throw new G({
-        max: n.toString(),
-        min: s.toString(),
-        signed: e,
-        size: o / 8,
-        value: t.toString()
-      });
-  }
-  return {
-    dynamic: !1,
-    encoded: B(t, {
-      size: 32,
-      signed: e
-    })
-  };
-}
-function ct(t) {
-  const e = H(t), o = Math.ceil(h(e) / 32), n = [];
-  for (let s = 0; s < o; s++)
-    n.push(b(J(e, s * 32, (s + 1) * 32)));
-  return {
-    dynamic: !0,
-    encoded: m(b(B(h(e), { size: 32 })), ...n)
-  };
-}
-function dt(t, e) {
-  const { checksumAddress: o, parameter: n } = e;
-  let s = !1;
-  const i = [];
-  for (let r = 0; r < n.components.length; r++) {
-    const d = n.components[r], c = Array.isArray(t) ? r : d.name, a = x({
-      checksumAddress: o,
-      parameter: d,
-      value: t[c]
-    });
-    i.push(a), a.dynamic && (s = !0);
-  }
-  return {
-    dynamic: s,
-    encoded: s ? W(i) : m(...i.map(({ encoded: r }) => r))
-  };
-}
-function I(t) {
-  const e = t.match(/^(.*)\[(\d+)?\]$/);
-  return e ? (
-    // Return `null` if the array is dynamic.
-    [e[2] ? Number(e[2]) : null, e[1]]
-  ) : void 0;
-}
-function g(t) {
-  var n;
-  const { type: e } = t;
-  if (e === "string" || e === "bytes" || e.endsWith("[]"))
-    return !0;
-  if (e === "tuple")
-    return (n = t.components) == null ? void 0 : n.some(g);
-  const o = I(t.type);
-  return !!(o && g({
-    ...t,
-    type: o[1]
-  }));
-}
-export {
-  Q as decodeAddress,
-  X as decodeArray,
-  Y as decodeBool,
-  Z as decodeBytes,
-  v as decodeNumber,
-  p as decodeParameter,
-  et as decodeString,
-  tt as decodeTuple,
-  W as encode,
-  nt as encodeAddress,
-  st as encodeArray,
-  it as encodeBoolean,
-  ot as encodeBytes,
-  rt as encodeNumber,
-  ct as encodeString,
-  dt as encodeTuple,
-  I as getArrayComponents,
-  g as hasDynamicChild,
-  x as prepareParameter,
-  pt as prepareParameters
-};

package/dist/index426.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index401.cjs"),h={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 r({count:this.recursiveReadCount+1,limit:this.recursiveReadLimit})},assertPosition(t){if(t<0||t>this.bytes.length-1)throw new n({length:this.bytes.length,position:t})},decrementPosition(t){if(t<0)throw new e({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 e({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 a(t,{recursiveReadLimit:i=8192}={}){const s=Object.create(h);return s.bytes=t,s.dataView=new DataView(t.buffer,t.byteOffset,t.byteLength),s.positionReadCount=new Map,s.recursiveReadLimit=i,s}class e extends o.BaseError{constructor({offset:i}){super(`Offset \`${i}\` cannot be negative.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Cursor.NegativeOffsetError"})}}class n extends o.BaseError{constructor({length:i,position:s}){super(`Position \`${s}\` is out of bounds (\`0 < position < ${i}\`).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Cursor.PositionOutOfBoundsError"})}}class r extends o.BaseError{constructor({count:i,limit:s}){super(`Recursive read limit of \`${s}\` exceeded (recursive read count: \`${i}\`).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Cursor.RecursiveReadLimitExceededError"})}}exports.NegativeOffsetError=e;exports.PositionOutOfBoundsError=n;exports.RecursiveReadLimitExceededError=r;exports.create=a;

package/dist/index426.js

@@ -1,163 +0,0 @@
-import { BaseError as e } from "./index401.js";
-const n = {
-  bytes: new Uint8Array(),
-  dataView: new DataView(new ArrayBuffer(0)),
-  position: 0,
-  positionReadCount: /* @__PURE__ */ new Map(),
-  recursiveReadCount: 0,
-  recursiveReadLimit: Number.POSITIVE_INFINITY,
-  assertReadLimit() {
-    if (this.recursiveReadCount >= this.recursiveReadLimit)
-      throw new h({
-        count: this.recursiveReadCount + 1,
-        limit: this.recursiveReadLimit
-      });
-  },
-  assertPosition(t) {
-    if (t < 0 || t > this.bytes.length - 1)
-      throw new r({
-        length: this.bytes.length,
-        position: t
-      });
-  },
-  decrementPosition(t) {
-    if (t < 0)
-      throw new o({ 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({ 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 u(t, { recursiveReadLimit: i = 8192 } = {}) {
-  const s = Object.create(n);
-  return s.bytes = t, s.dataView = new DataView(t.buffer, t.byteOffset, t.byteLength), s.positionReadCount = /* @__PURE__ */ new Map(), s.recursiveReadLimit = i, s;
-}
-class o extends e {
-  constructor({ offset: i }) {
-    super(`Offset \`${i}\` cannot be negative.`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Cursor.NegativeOffsetError"
-    });
-  }
-}
-class r extends e {
-  constructor({ length: i, position: s }) {
-    super(`Position \`${s}\` is out of bounds (\`0 < position < ${i}\`).`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Cursor.PositionOutOfBoundsError"
-    });
-  }
-}
-class h extends e {
-  constructor({ count: i, limit: s }) {
-    super(`Recursive read limit of \`${s}\` exceeded (recursive read count: \`${i}\`).`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Cursor.RecursiveReadLimitExceededError"
-    });
-  }
-}
-export {
-  o as NegativeOffsetError,
-  r as PositionOutOfBoundsError,
-  h as RecursiveReadLimitExceededError,
-  u as create
-};

package/dist/index427.cjs

@@ -1 +0,0 @@
-"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])?$/,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)?$/,g=2n**256n-1n;exports.arrayRegex=e;exports.bytesRegex=t;exports.integerRegex=n;exports.maxUint256=g;

package/dist/index427.js

@@ -1,7 +0,0 @@
-const e = /^(.*)\[([0-9]*)\]$/, n = /^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/, t = /^(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)?$/, s = 2n ** 256n - 1n;
-export {
-  e as arrayRegex,
-  n as bytesRegex,
-  t as integerRegex,
-  s as maxUint256
-};

package/dist/index428.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index441.cjs"),a=require("./index438.cjs"),g=require("./index439.cjs"),i=require("./index440.cjs");function m(t){const r=[];if(typeof t=="string"){const s=i.splitParameters(t),n=s.length;for(let e=0;e<n;e++)r.push(i.parseAbiParameter(s[e],{modifiers:a.modifiers}))}else{const s=g.parseStructs(t),n=t.length;for(let e=0;e<n;e++){const c=t[e];if(a.isStructSignature(c))continue;const u=i.splitParameters(c),l=u.length;for(let o=0;o<l;o++)r.push(i.parseAbiParameter(u[o],{modifiers:a.modifiers,structs:s}))}}if(r.length===0)throw new f.InvalidAbiParametersError({params:t});return r}exports.parseAbiParameters=m;

package/dist/index428.js

@@ -1,28 +0,0 @@
-import { InvalidAbiParametersError as g } from "./index441.js";
-import { isStructSignature as h, modifiers as f } from "./index438.js";
-import { parseStructs as u } from "./index439.js";
-import { splitParameters as l, parseAbiParameter as a } from "./index440.js";
-function S(e) {
-  const r = [];
-  if (typeof e == "string") {
-    const o = l(e), n = o.length;
-    for (let t = 0; t < n; t++)
-      r.push(a(o[t], { modifiers: f }));
-  } else {
-    const o = u(e), n = e.length;
-    for (let t = 0; t < n; t++) {
-      const s = e[t];
-      if (h(s))
-        continue;
-      const c = l(s), m = c.length;
-      for (let i = 0; i < m; i++)
-        r.push(a(c[i], { modifiers: f, structs: o }));
-    }
-  }
-  if (r.length === 0)
-    throw new g({ params: e });
-  return r;
-}
-export {
-  S as parseAbiParameters
-};

package/dist/index429.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index435.cjs");function m(r){let e="";const a=r.length;for(let t=0;t<a;t++){const o=r[t];e+=i.formatAbiParameter(o),t!==a-1&&(e+=", ")}return e}exports.formatAbiParameters=m;

package/dist/index429.js

@@ -1,13 +0,0 @@
-import { formatAbiParameter as m } from "./index435.js";
-function f(e) {
-  let r = "";
-  const o = e.length;
-  for (let t = 0; t < o; t++) {
-    const a = e[t];
-    r += m(a), t !== o - 1 && (r += ", ");
-  }
-  return r;
-}
-export {
-  f as formatAbiParameters
-};

package/dist/index430.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index446.cjs");function r(){return e.version}exports.getVersion=r;

package/dist/index430.js

@@ -1,7 +0,0 @@
-import { version as r } from "./index446.js";
-function e() {
-  return r;
-}
-export {
-  e as getVersion
-};

package/dist/index431.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const k=require("./index447.cjs"),w=require("./index359.cjs"),l=require("./index360.cjs"),d=Uint32Array.from([4089235720,1779033703,2227873595,3144134277,4271175723,1013904242,1595750129,2773480762,2917565137,1359893119,725511199,2600822924,4215389547,528734635,327033209,1541459225]),t=new Uint32Array(32);function I(p,s,h,n,v,r){const i=v[r],e=v[r+1];let o=t[2*p],f=t[2*p+1],a=t[2*s],u=t[2*s+1],b=t[2*h],E=t[2*h+1],B=t[2*n],c=t[2*n+1],y=w.add3L(o,a,i);f=w.add3H(y,f,u,e),o=y|0,{Dh:c,Dl:B}={Dh:c^f,Dl:B^o},{Dh:c,Dl:B}={Dh:w.rotr32H(c,B),Dl:w.rotr32L(c)},{h:E,l:b}=w.add(E,b,c,B),{Bh:u,Bl:a}={Bh:u^E,Bl:a^b},{Bh:u,Bl:a}={Bh:w.rotrSH(u,a,24),Bl:w.rotrSL(u,a,24)},t[2*p]=o,t[2*p+1]=f,t[2*s]=a,t[2*s+1]=u,t[2*h]=b,t[2*h+1]=E,t[2*n]=B,t[2*n+1]=c}function x(p,s,h,n,v,r){const i=v[r],e=v[r+1];let o=t[2*p],f=t[2*p+1],a=t[2*s],u=t[2*s+1],b=t[2*h],E=t[2*h+1],B=t[2*n],c=t[2*n+1],y=w.add3L(o,a,i);f=w.add3H(y,f,u,e),o=y|0,{Dh:c,Dl:B}={Dh:c^f,Dl:B^o},{Dh:c,Dl:B}={Dh:w.rotrSH(c,B,16),Dl:w.rotrSL(c,B,16)},{h:E,l:b}=w.add(E,b,c,B),{Bh:u,Bl:a}={Bh:u^E,Bl:a^b},{Bh:u,Bl:a}={Bh:w.rotrBH(u,a,63),Bl:w.rotrBL(u,a,63)},t[2*p]=o,t[2*p+1]=f,t[2*s]=a,t[2*s+1]=u,t[2*h]=b,t[2*h+1]=E,t[2*n]=B,t[2*n+1]=c}function D(p,s={},h,n,v){if(l.anumber(h),p<0||p>h)throw new Error("outputLen bigger than keyLen");const{key:r,salt:i,personalization:e}=s;if(r!==void 0&&(r.length<1||r.length>h))throw new Error("key length must be undefined or 1.."+h);if(i!==void 0&&i.length!==n)throw new Error("salt must be undefined or "+n);if(e!==void 0&&e.length!==v)throw new Error("personalization must be undefined or "+v)}class L extends l.Hash{constructor(s,h){super(),this.finished=!1,this.destroyed=!1,this.length=0,this.pos=0,l.anumber(s),l.anumber(h),this.blockLen=s,this.outputLen=h,this.buffer=new Uint8Array(s),this.buffer32=l.u32(this.buffer)}update(s){l.aexists(this),s=l.toBytes(s),l.abytes(s);const{blockLen:h,buffer:n,buffer32:v}=this,r=s.length,i=s.byteOffset,e=s.buffer;for(let o=0;o<r;){this.pos===h&&(l.swap32IfBE(v),this.compress(v,0,!1),l.swap32IfBE(v),this.pos=0);const f=Math.min(h-this.pos,r-o),a=i+o;if(f===h&&!(a%4)&&o+f<r){const u=new Uint32Array(e,a,Math.floor((r-o)/4));l.swap32IfBE(u);for(let b=0;o+h<r;b+=v.length,o+=h)this.length+=h,this.compress(u,b,!1);l.swap32IfBE(u);continue}n.set(s.subarray(o,o+f),this.pos),this.pos+=f,this.length+=f,o+=f}return this}digestInto(s){l.aexists(this),l.aoutput(s,this);const{pos:h,buffer32:n}=this;this.finished=!0,l.clean(this.buffer.subarray(h)),l.swap32IfBE(n),this.compress(n,0,!0),l.swap32IfBE(n);const v=l.u32(s);this.get().forEach((r,i)=>v[i]=l.swap8IfBE(r))}digest(){const{buffer:s,outputLen:h}=this;this.digestInto(s);const n=s.slice(0,h);return this.destroy(),n}_cloneInto(s){const{buffer:h,length:n,finished:v,destroyed:r,outputLen:i,pos:e}=this;return s||(s=new this.constructor({dkLen:i})),s.set(...this.get()),s.buffer.set(h),s.destroyed=r,s.finished=v,s.length=n,s.pos=e,s.outputLen=i,s}clone(){return this._cloneInto()}}class A extends L{constructor(s={}){const h=s.dkLen===void 0?64:s.dkLen;super(128,h),this.v0l=d[0]|0,this.v0h=d[1]|0,this.v1l=d[2]|0,this.v1h=d[3]|0,this.v2l=d[4]|0,this.v2h=d[5]|0,this.v3l=d[6]|0,this.v3h=d[7]|0,this.v4l=d[8]|0,this.v4h=d[9]|0,this.v5l=d[10]|0,this.v5h=d[11]|0,this.v6l=d[12]|0,this.v6h=d[13]|0,this.v7l=d[14]|0,this.v7h=d[15]|0,D(h,s,64,16,16);let{key:n,personalization:v,salt:r}=s,i=0;if(n!==void 0&&(n=l.toBytes(n),i=n.length),this.v0l^=this.outputLen|i<<8|65536|1<<24,r!==void 0){r=l.toBytes(r);const e=l.u32(r);this.v4l^=l.swap8IfBE(e[0]),this.v4h^=l.swap8IfBE(e[1]),this.v5l^=l.swap8IfBE(e[2]),this.v5h^=l.swap8IfBE(e[3])}if(v!==void 0){v=l.toBytes(v);const e=l.u32(v);this.v6l^=l.swap8IfBE(e[0]),this.v6h^=l.swap8IfBE(e[1]),this.v7l^=l.swap8IfBE(e[2]),this.v7h^=l.swap8IfBE(e[3])}if(n!==void 0){const e=new Uint8Array(this.blockLen);e.set(n),this.update(e)}}get(){let{v0l:s,v0h:h,v1l:n,v1h:v,v2l:r,v2h:i,v3l:e,v3h:o,v4l:f,v4h:a,v5l:u,v5h:b,v6l:E,v6h:B,v7l:c,v7h:y}=this;return[s,h,n,v,r,i,e,o,f,a,u,b,E,B,c,y]}set(s,h,n,v,r,i,e,o,f,a,u,b,E,B,c,y){this.v0l=s|0,this.v0h=h|0,this.v1l=n|0,this.v1h=v|0,this.v2l=r|0,this.v2h=i|0,this.v3l=e|0,this.v3h=o|0,this.v4l=f|0,this.v4h=a|0,this.v5l=u|0,this.v5h=b|0,this.v6l=E|0,this.v6h=B|0,this.v7l=c|0,this.v7h=y|0}compress(s,h,n){this.get().forEach((o,f)=>t[f]=o),t.set(d,16);let{h:v,l:r}=w.fromBig(BigInt(this.length));t[24]=d[8]^r,t[25]=d[9]^v,n&&(t[28]=~t[28],t[29]=~t[29]);let i=0;const e=k.BSIGMA;for(let o=0;o<12;o++)I(0,4,8,12,s,h+2*e[i++]),x(0,4,8,12,s,h+2*e[i++]),I(1,5,9,13,s,h+2*e[i++]),x(1,5,9,13,s,h+2*e[i++]),I(2,6,10,14,s,h+2*e[i++]),x(2,6,10,14,s,h+2*e[i++]),I(3,7,11,15,s,h+2*e[i++]),x(3,7,11,15,s,h+2*e[i++]),I(0,5,10,15,s,h+2*e[i++]),x(0,5,10,15,s,h+2*e[i++]),I(1,6,11,12,s,h+2*e[i++]),x(1,6,11,12,s,h+2*e[i++]),I(2,7,8,13,s,h+2*e[i++]),x(2,7,8,13,s,h+2*e[i++]),I(3,4,9,14,s,h+2*e[i++]),x(3,4,9,14,s,h+2*e[i++]);this.v0l^=t[0]^t[16],this.v0h^=t[1]^t[17],this.v1l^=t[2]^t[18],this.v1h^=t[3]^t[19],this.v2l^=t[4]^t[20],this.v2h^=t[5]^t[21],this.v3l^=t[6]^t[22],this.v3h^=t[7]^t[23],this.v4l^=t[8]^t[24],this.v4h^=t[9]^t[25],this.v5l^=t[10]^t[26],this.v5h^=t[11]^t[27],this.v6l^=t[12]^t[28],this.v6h^=t[13]^t[29],this.v7l^=t[14]^t[30],this.v7h^=t[15]^t[31],l.clean(t)}destroy(){this.destroyed=!0,l.clean(this.buffer32),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}const g=l.createOptHasher(p=>new A(p));exports.BLAKE2=L;exports.BLAKE2b=A;exports.blake2b=g;