@gardenfi/swap 0.0.2-beta.2 → 0.0.2-beta.3

package/dist/index353.js

@@ -1,7 +1,346 @@
-import { LruMap as c } from "./index381.js";
-const e = {
-  checksum: /* @__PURE__ */ new c(8192)
-}, m = e.checksum;
+import { InvalidTypeError as C, InvalidArrayError as _, ArrayLengthMismatchError as $, BytesSizeMismatchError as O } from "./index352.js";
+import { checksum as M, assert as R } from "./index349.js";
+import { toNumber as u, slice as T, toBoolean as D, toBigInt as U, toString as V, trimLeft as j } from "./index348.js";
+import { BaseError as q } from "./index278.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 "./index277.js";
+import { integerRegex as K } from "./index282.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 {
-  m as checksum
+  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/index354.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index382.cjs");function r(){return e.version}exports.getVersion=r;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index278.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/index354.js

@@ -1,7 +1,163 @@
-import { version as r } from "./index382.js";
-function e() {
-  return r;
+import { BaseError as e } from "./index278.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 {
-  e as getVersion
+  o as NegativeOffsetError,
+  r as PositionOutOfBoundsError,
+  h as RecursiveReadLimitExceededError,
+  u as create
 };

package/dist/index356.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index80.cjs"),u=require("./index214.cjs"),c=require("./index81.cjs"),a=require("./index82.cjs"),h=require("./index226.cjs");function d(e){const{chainId:t,nonce:o,to:r}=e,s=e.contractAddress??e.address,n=h.keccak256(i.concatHex(["0x05",a.toRlp([t?c.numberToHex(t):"0x",s,o?c.numberToHex(o):"0x"])]));return r==="bytes"?u.hexToBytes(n):n}exports.hashAuthorization=d;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index80.cjs"),u=require("./index201.cjs"),c=require("./index81.cjs"),a=require("./index82.cjs"),h=require("./index213.cjs");function d(e){const{chainId:t,nonce:o,to:r}=e,s=e.contractAddress??e.address,n=h.keccak256(i.concatHex(["0x05",a.toRlp([t?c.numberToHex(t):"0x",s,o?c.numberToHex(o):"0x"])]));return r==="bytes"?u.hexToBytes(n):n}exports.hashAuthorization=d;

package/dist/index356.js

@@ -1,8 +1,8 @@
 import { concatHex as i } from "./index80.js";
-import { hexToBytes as m } from "./index214.js";
+import { hexToBytes as m } from "./index201.js";
 import { numberToHex as c } from "./index81.js";
 import { toRlp as d } from "./index82.js";
-import { keccak256 as f } from "./index226.js";
+import { keccak256 as f } from "./index213.js";
 function b(o) {
   const { chainId: t, nonce: r, to: s } = o, e = o.contractAddress ?? o.address, n = f(i([
     "0x05",

package/dist/index357.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const w=BigInt(0),m=BigInt(1);function y(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function d(t){if(!y(t))throw new Error("Uint8Array expected")}function I(t,e){if(typeof e!="boolean")throw new Error(t+" boolean expected, got "+e)}function N(t){const e=t.toString(16);return e.length&1?"0"+e:e}function h(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);return t===""?w:BigInt("0x"+t)}const U=typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function",_=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function E(t){if(d(t),U)return t.toHex();let e="";for(let r=0;r<t.length;r++)e+=_[t[r]];return e}const u={_0:48,_9:57,A:65,F:70,a:97,f:102};function B(t){if(t>=u._0&&t<=u._9)return t-u._0;if(t>=u.A&&t<=u.F)return t-(u.A-10);if(t>=u.a&&t<=u.f)return t-(u.a-10)}function A(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);if(U)return Uint8Array.fromHex(t);const e=t.length,r=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const n=new Uint8Array(r);for(let o=0,i=0;o<r;o++,i+=2){const a=B(t.charCodeAt(i)),f=B(t.charCodeAt(i+1));if(a===void 0||f===void 0){const c=t[i]+t[i+1];throw new Error('hex string expected, got non-hex character "'+c+'" at index '+i)}n[o]=a*16+f}return n}function k(t){return h(E(t))}function O(t){return d(t),h(E(Uint8Array.from(t).reverse()))}function T(t,e){return A(t.toString(16).padStart(e*2,"0"))}function F(t,e){return T(t,e).reverse()}function M(t,e,r){let n;if(typeof e=="string")try{n=A(e)}catch(i){throw new Error(t+" must be hex string or Uint8Array, cause: "+i)}else if(y(e))n=Uint8Array.from(e);else throw new Error(t+" must be hex string or Uint8Array");const o=n.length;if(typeof r=="number"&&o!==r)throw new Error(t+" of length "+r+" expected, got "+o);return n}function v(...t){let e=0;for(let n=0;n<t.length;n++){const o=t[n];d(o),e+=o.length}const r=new Uint8Array(e);for(let n=0,o=0;n<t.length;n++){const i=t[n];r.set(i,o),o+=i.length}return r}const b=t=>typeof t=="bigint"&&w<=t;function H(t,e,r){return b(t)&&b(e)&&b(r)&&e<=t&&t<r}function R(t,e,r,n){if(!H(e,r,n))throw new Error("expected valid "+t+": "+r+" <= n < "+n+", got "+e)}function j(t){let e;for(e=0;t>w;t>>=m,e+=1);return e}const V=t=>(m<<BigInt(t))-m,p=t=>new Uint8Array(t),x=t=>Uint8Array.from(t);function z(t,e,r){if(typeof t!="number"||t<2)throw new Error("hashLen must be a number");if(typeof e!="number"||e<2)throw new Error("qByteLen must be a number");if(typeof r!="function")throw new Error("hmacFn must be a function");let n=p(t),o=p(t),i=0;const a=()=>{n.fill(1),o.fill(0),i=0},f=(...s)=>r(o,n,...s),c=(s=p(0))=>{o=f(x([0]),s),n=f(),s.length!==0&&(o=f(x([1]),s),n=f())},S=()=>{if(i++>=1e3)throw new Error("drbg: tried 1000 values");let s=0;const l=[];for(;s<e;){n=f();const g=n.slice();l.push(g),s+=n.length}return v(...l)};return(s,l)=>{a(),c(s);let g;for(;!(g=l(S()));)c();return a(),g}}const C={bigint:t=>typeof t=="bigint",function:t=>typeof t=="function",boolean:t=>typeof t=="boolean",string:t=>typeof t=="string",stringOrUint8Array:t=>typeof t=="string"||y(t),isSafeInteger:t=>Number.isSafeInteger(t),array:t=>Array.isArray(t),field:(t,e)=>e.Fp.isValid(t),hash:t=>typeof t=="function"&&Number.isSafeInteger(t.outputLen)};function D(t,e,r={}){const n=(o,i,a)=>{const f=C[i];if(typeof f!="function")throw new Error("invalid validator function");const c=t[o];if(!(a&&c===void 0)&&!f(c,t))throw new Error("param "+String(o)+" is invalid. Expected "+i+", got "+c)};for(const[o,i]of Object.entries(e))n(o,i,!1);for(const[o,i]of Object.entries(r))n(o,i,!0);return t}function L(t){const e=new WeakMap;return(r,...n)=>{const o=e.get(r);if(o!==void 0)return o;const i=t(r,...n);return e.set(r,i),i}}exports.aInRange=R;exports.abool=I;exports.abytes=d;exports.bitLen=j;exports.bitMask=V;exports.bytesToHex=E;exports.bytesToNumberBE=k;exports.bytesToNumberLE=O;exports.concatBytes=v;exports.createHmacDrbg=z;exports.ensureBytes=M;exports.hexToBytes=A;exports.hexToNumber=h;exports.inRange=H;exports.isBytes=y;exports.memoized=L;exports.numberToBytesBE=T;exports.numberToBytesLE=F;exports.numberToHexUnpadded=N;exports.validateObject=D;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index277.cjs");function r(e){return{address:e.address,amount:o.fromNumber(e.amount),index:o.fromNumber(e.index),validatorIndex:o.fromNumber(e.validatorIndex)}}exports.toRpc=r;