@gardenfi/swap 0.0.1-beta.9 → 0.0.2

package/dist/index215.js

@@ -1,164 +1,194 @@
-import { AbiDecodingZeroDataError as a, AbiDecodingDataSizeTooSmallError as C, InvalidAbiDecodingTypeError as D } from "./index191.js";
-import { checksumAddress as w } from "./index216.js";
-import { createCursor as _ } from "./index217.js";
-import { size as p } from "./index89.js";
-import { sliceBytes as W } from "./index218.js";
-import { trim as x } from "./index90.js";
-import { bytesToNumber as y, bytesToBool as I, bytesToBigInt as N, bytesToString as O } from "./index219.js";
-import { hexToBytes as S } from "./index220.js";
-import { bytesToHex as g } from "./index85.js";
-import { getArrayComponents as A } from "./index221.js";
-function Y(t, e) {
-  const n = typeof e == "string" ? S(e) : e, o = _(n);
-  if (p(n) === 0 && t.length > 0)
-    throw new a();
-  if (p(e) && p(e) < 32)
-    throw new C({
-      data: typeof e == "string" ? e : g(e),
-      params: t,
-      size: p(e)
+import { AbiEncodingLengthMismatchError as y, InvalidAbiEncodingTypeError as u, InvalidArrayError as g, AbiEncodingArrayLengthMismatchError as l, AbiEncodingBytesSizeMismatchError as b } from "./index187.js";
+import { InvalidAddressError as w } from "./index78.js";
+import { BaseError as A } from "./index189.js";
+import { IntegerOutOfRangeError as x } from "./index86.js";
+import { isAddress as z } from "./index79.js";
+import { concat as f } from "./index80.js";
+import { padHex as d } from "./index222.js";
+import { size as a } from "./index87.js";
+import { slice as E } from "./index212.js";
+import { numberToHex as m, boolToHex as P, stringToHex as S } from "./index81.js";
+import { integerRegex as I } from "./index223.js";
+function K(e, t) {
+  if (e.length !== t.length)
+    throw new y({
+      expectedLength: e.length,
+      givenLength: t.length
     });
-  let i = 0;
-  const d = [];
-  for (let s = 0; s < t.length; ++s) {
-    const r = t[s];
-    o.setPosition(i);
-    const [f, c] = u(o, r, {
-      staticPosition: 0
-    });
-    i += c, d.push(f);
-  }
-  return d;
+  const o = L({
+    params: e,
+    values: t
+  }), n = h(o);
+  return n.length === 0 ? "0x" : n;
+}
+function L({ params: e, values: t }) {
+  const o = [];
+  for (let n = 0; n < e.length; n++)
+    o.push(p({ param: e[n], value: t[n] }));
+  return o;
 }
-function u(t, e, { staticPosition: n }) {
-  const o = A(e.type);
+function p({ param: e, value: t }) {
+  const o = W(e.type);
   if (o) {
-    const [i, d] = o;
-    return k(t, { ...e, type: d }, { length: i, staticPosition: n });
+    const [n, r] = o;
+    return M(t, { length: n, param: { ...e, type: r } });
   }
   if (e.type === "tuple")
-    return Z(t, e, { staticPosition: n });
+    return H(t, {
+      param: e
+    });
   if (e.type === "address")
-    return E(t);
+    return B(t);
   if (e.type === "bool")
-    return H(t);
+    return T(t);
+  if (e.type.startsWith("uint") || e.type.startsWith("int")) {
+    const n = e.type.startsWith("int"), [, , r = "256"] = I.exec(e.type) ?? [];
+    return $(t, {
+      signed: n,
+      size: Number(r)
+    });
+  }
   if (e.type.startsWith("bytes"))
-    return L(t, e, { staticPosition: n });
-  if (e.type.startsWith("uint") || e.type.startsWith("int"))
-    return U(t, e);
+    return N(t, { param: e });
   if (e.type === "string")
-    return j(t, { staticPosition: n });
-  throw new D(e.type, {
-    docsPath: "/docs/contract/decodeAbiParameters"
+    return C(t);
+  throw new u(e.type, {
+    docsPath: "/docs/contract/encodeAbiParameters"
   });
 }
-const P = 32, b = 32;
-function E(t) {
-  const e = t.readBytes(32);
-  return [w(g(W(e, -20))), 32];
-}
-function k(t, e, { length: n, staticPosition: o }) {
-  if (!n) {
-    const s = y(t.readBytes(b)), r = o + s, f = r + P;
-    t.setPosition(r);
-    const c = y(t.readBytes(P)), l = h(e);
-    let m = 0;
-    const v = [];
-    for (let B = 0; B < c; ++B) {
-      t.setPosition(f + (l ? B * 32 : m));
-      const [T, z] = u(t, e, {
-        staticPosition: f
-      });
-      m += z, v.push(T);
-    }
-    return t.setPosition(o + 32), [v, 32];
+function h(e) {
+  let t = 0;
+  for (let i = 0; i < e.length; i++) {
+    const { dynamic: c, encoded: s } = e[i];
+    c ? t += 32 : t += a(s);
   }
-  if (h(e)) {
-    const s = y(t.readBytes(b)), r = o + s, f = [];
-    for (let c = 0; c < n; ++c) {
-      t.setPosition(r + c * 32);
-      const [l] = u(t, e, {
-        staticPosition: r
-      });
-      f.push(l);
-    }
-    return t.setPosition(o + 32), [f, 32];
+  const o = [], n = [];
+  let r = 0;
+  for (let i = 0; i < e.length; i++) {
+    const { dynamic: c, encoded: s } = e[i];
+    c ? (o.push(m(t + r, { size: 32 })), n.push(s), r += a(s)) : o.push(s);
   }
-  let i = 0;
-  const d = [];
-  for (let s = 0; s < n; ++s) {
-    const [r, f] = u(t, e, {
-      staticPosition: o + i
+  return f([...o, ...n]);
+}
+function B(e) {
+  if (!z(e))
+    throw new w({ address: e });
+  return { dynamic: !1, encoded: d(e.toLowerCase()) };
+}
+function M(e, { length: t, param: o }) {
+  const n = t === null;
+  if (!Array.isArray(e))
+    throw new g(e);
+  if (!n && e.length !== t)
+    throw new l({
+      expectedLength: t,
+      givenLength: e.length,
+      type: `${o.type}[${t}]`
     });
-    i += f, d.push(r);
+  let r = !1;
+  const i = [];
+  for (let c = 0; c < e.length; c++) {
+    const s = p({ param: o, value: e[c] });
+    s.dynamic && (r = !0), i.push(s);
   }
-  return [d, i];
-}
-function H(t) {
-  return [I(t.readBytes(32), { size: 32 }), 32];
+  if (n || r) {
+    const c = h(i);
+    if (n) {
+      const s = m(i.length, { size: 32 });
+      return {
+        dynamic: !0,
+        encoded: i.length > 0 ? f([s, c]) : s
+      };
+    }
+    if (r)
+      return { dynamic: !0, encoded: c };
+  }
+  return {
+    dynamic: !1,
+    encoded: f(i.map(({ encoded: c }) => c))
+  };
 }
-function L(t, e, { staticPosition: n }) {
-  const [o, i] = e.type.split("bytes");
-  if (!i) {
-    const s = y(t.readBytes(32));
-    t.setPosition(n + s);
-    const r = y(t.readBytes(32));
-    if (r === 0)
-      return t.setPosition(n + 32), ["0x", 32];
-    const f = t.readBytes(r);
-    return t.setPosition(n + 32), [g(f), 32];
+function N(e, { param: t }) {
+  const [, o] = t.type.split("bytes"), n = a(e);
+  if (!o) {
+    let r = e;
+    return n % 32 !== 0 && (r = d(r, {
+      dir: "right",
+      size: Math.ceil((e.length - 2) / 2 / 32) * 32
+    })), {
+      dynamic: !0,
+      encoded: f([d(m(n, { size: 32 })), r])
+    };
   }
-  return [g(t.readBytes(Number.parseInt(i, 10), 32)), 32];
+  if (n !== Number.parseInt(o, 10))
+    throw new b({
+      expectedSize: Number.parseInt(o, 10),
+      value: e
+    });
+  return { dynamic: !1, encoded: d(e, { dir: "right" }) };
 }
-function U(t, e) {
-  const n = e.type.startsWith("int"), o = Number.parseInt(e.type.split("int")[1] || "256", 10), i = t.readBytes(32);
-  return [
-    o > 48 ? N(i, { signed: n }) : y(i, { signed: n }),
-    32
-  ];
+function T(e) {
+  if (typeof e != "boolean")
+    throw new A(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);
+  return { dynamic: !1, encoded: d(P(e)) };
 }
-function Z(t, e, { staticPosition: n }) {
-  const o = e.components.length === 0 || e.components.some(({ name: s }) => !s), i = o ? [] : {};
-  let d = 0;
-  if (h(e)) {
-    const s = y(t.readBytes(b)), r = n + s;
-    for (let f = 0; f < e.components.length; ++f) {
-      const c = e.components[f];
-      t.setPosition(r + d);
-      const [l, m] = u(t, c, {
-        staticPosition: r
+function $(e, { signed: t, size: o = 256 }) {
+  if (typeof o == "number") {
+    const n = 2n ** (BigInt(o) - (t ? 1n : 0n)) - 1n, r = t ? -n - 1n : 0n;
+    if (e > n || e < r)
+      throw new x({
+        max: n.toString(),
+        min: r.toString(),
+        signed: t,
+        size: o / 8,
+        value: e.toString()
       });
-      d += m, i[o ? f : c == null ? void 0 : c.name] = l;
-    }
-    return t.setPosition(n + 32), [i, 32];
   }
-  for (let s = 0; s < e.components.length; ++s) {
-    const r = e.components[s], [f, c] = u(t, r, {
-      staticPosition: n
+  return {
+    dynamic: !1,
+    encoded: m(e, {
+      size: 32,
+      signed: t
+    })
+  };
+}
+function C(e) {
+  const t = S(e), o = Math.ceil(a(t) / 32), n = [];
+  for (let r = 0; r < o; r++)
+    n.push(d(E(t, r * 32, (r + 1) * 32), {
+      dir: "right"
+    }));
+  return {
+    dynamic: !0,
+    encoded: f([
+      d(m(a(t), { size: 32 })),
+      ...n
+    ])
+  };
+}
+function H(e, { param: t }) {
+  let o = !1;
+  const n = [];
+  for (let r = 0; r < t.components.length; r++) {
+    const i = t.components[r], c = Array.isArray(e) ? r : i.name, s = p({
+      param: i,
+      value: e[c]
     });
-    i[o ? s : r == null ? void 0 : r.name] = f, d += c;
+    n.push(s), s.dynamic && (o = !0);
   }
-  return [i, d];
-}
-function j(t, { staticPosition: e }) {
-  const n = y(t.readBytes(32)), o = e + n;
-  t.setPosition(o);
-  const i = y(t.readBytes(32));
-  if (i === 0)
-    return t.setPosition(e + 32), ["", 32];
-  const d = t.readBytes(i, 32), s = O(x(d));
-  return t.setPosition(e + 32), [s, 32];
+  return {
+    dynamic: o,
+    encoded: o ? h(n) : f(n.map(({ encoded: r }) => r))
+  };
 }
-function h(t) {
-  var o;
-  const { type: e } = t;
-  if (e === "string" || e === "bytes" || e.endsWith("[]"))
-    return !0;
-  if (e === "tuple")
-    return (o = t.components) == null ? void 0 : o.some(h);
-  const n = A(t.type);
-  return !!(n && h({ ...t, type: n[1] }));
+function W(e) {
+  const t = e.match(/^(.*)\[(\d+)?\]$/);
+  return t ? (
+    // Return `null` if the array is dynamic.
+    [t[2] ? Number(t[2]) : null, t[1]]
+  ) : void 0;
 }
 export {
-  Y as decodeAbiParameters
+  K as encodeAbiParameters,
+  W as getArrayComponents
 };

package/dist/index216.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const d=require("./index82.cjs"),f=require("./index220.cjs"),a=require("./index233.cjs"),l=require("./index240.cjs"),A=require("./index83.cjs"),o=new l.LruMap(8192);function u(s,t){if(o.has(`${s}.${t}`))return o.get(`${s}.${t}`);const c=s.substring(2).toLowerCase(),n=a.keccak256(f.stringToBytes(c),"bytes"),r=c.split("");for(let e=0;e<40;e+=2)n[e>>1]>>4>=8&&r[e]&&(r[e]=r[e].toUpperCase()),(n[e>>1]&15)>=8&&r[e+1]&&(r[e+1]=r[e+1].toUpperCase());const i=`0x${r.join("")}`;return o.set(`${s}.${t}`,i),i}function g(s,t){if(!A.isAddress(s,{strict:!1}))throw new d.InvalidAddressError({address:s});return u(s,t)}exports.checksumAddress=u;exports.getAddress=g;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index212.cjs"),o=require("./index249.cjs"),r=e=>t.slice(o.toSignatureHash(e),0,4);exports.toFunctionSelector=r;

package/dist/index216.js

@@ -1,24 +1,6 @@
-import { InvalidAddressError as c } from "./index82.js";
-import { stringToBytes as m } from "./index220.js";
-import { keccak256 as p } from "./index233.js";
-import { LruMap as u } from "./index240.js";
-import { isAddress as $ } from "./index83.js";
-const s = /* @__PURE__ */ new u(8192);
-function h(t, o) {
-  if (s.has(`${t}.${o}`))
-    return s.get(`${t}.${o}`);
-  const i = t.substring(2).toLowerCase(), n = p(m(i), "bytes"), e = i.split("");
-  for (let r = 0; r < 40; r += 2)
-    n[r >> 1] >> 4 >= 8 && e[r] && (e[r] = e[r].toUpperCase()), (n[r >> 1] & 15) >= 8 && e[r + 1] && (e[r + 1] = e[r + 1].toUpperCase());
-  const f = `0x${e.join("")}`;
-  return s.set(`${t}.${o}`, f), f;
-}
-function w(t, o) {
-  if (!$(t, { strict: !1 }))
-    throw new c({ address: t });
-  return h(t, o);
-}
+import { slice as t } from "./index212.js";
+import { toSignatureHash as r } from "./index249.js";
+const c = (o) => t(r(o), 0, 4);
 export {
-  h as checksumAddress,
-  w as getAddress
+  c as toFunctionSelector
 };

package/dist/index217.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index224.cjs"),e={bytes:new Uint8Array,dataView:new DataView(new ArrayBuffer(0)),position:0,positionReadCount:new Map,recursiveReadCount:0,recursiveReadLimit:Number.POSITIVE_INFINITY,assertReadLimit(){if(this.recursiveReadCount>=this.recursiveReadLimit)throw new o.RecursiveReadLimitExceededError({count:this.recursiveReadCount+1,limit:this.recursiveReadLimit})},assertPosition(t){if(t<0||t>this.bytes.length-1)throw new o.PositionOutOfBoundsError({length:this.bytes.length,position:t})},decrementPosition(t){if(t<0)throw new o.NegativeOffsetError({offset:t});const i=this.position-t;this.assertPosition(i),this.position=i},getReadCount(t){return this.positionReadCount.get(t||this.position)||0},incrementPosition(t){if(t<0)throw new o.NegativeOffsetError({offset:t});const i=this.position+t;this.assertPosition(i),this.position=i},inspectByte(t){const i=t??this.position;return this.assertPosition(i),this.bytes[i]},inspectBytes(t,i){const s=i??this.position;return this.assertPosition(s+t-1),this.bytes.subarray(s,s+t)},inspectUint8(t){const i=t??this.position;return this.assertPosition(i),this.bytes[i]},inspectUint16(t){const i=t??this.position;return this.assertPosition(i+1),this.dataView.getUint16(i)},inspectUint24(t){const i=t??this.position;return this.assertPosition(i+2),(this.dataView.getUint16(i)<<8)+this.dataView.getUint8(i+2)},inspectUint32(t){const i=t??this.position;return this.assertPosition(i+3),this.dataView.getUint32(i)},pushByte(t){this.assertPosition(this.position),this.bytes[this.position]=t,this.position++},pushBytes(t){this.assertPosition(this.position+t.length-1),this.bytes.set(t,this.position),this.position+=t.length},pushUint8(t){this.assertPosition(this.position),this.bytes[this.position]=t,this.position++},pushUint16(t){this.assertPosition(this.position+1),this.dataView.setUint16(this.position,t),this.position+=2},pushUint24(t){this.assertPosition(this.position+2),this.dataView.setUint16(this.position,t>>8),this.dataView.setUint8(this.position+2,t&255),this.position+=3},pushUint32(t){this.assertPosition(this.position+3),this.dataView.setUint32(this.position,t),this.position+=4},readByte(){this.assertReadLimit(),this._touch();const t=this.inspectByte();return this.position++,t},readBytes(t,i){this.assertReadLimit(),this._touch();const s=this.inspectBytes(t);return this.position+=i??t,s},readUint8(){this.assertReadLimit(),this._touch();const t=this.inspectUint8();return this.position+=1,t},readUint16(){this.assertReadLimit(),this._touch();const t=this.inspectUint16();return this.position+=2,t},readUint24(){this.assertReadLimit(),this._touch();const t=this.inspectUint24();return this.position+=3,t},readUint32(){this.assertReadLimit(),this._touch();const t=this.inspectUint32();return this.position+=4,t},get remaining(){return this.bytes.length-this.position},setPosition(t){const i=this.position;return this.assertPosition(t),this.position=t,()=>this.position=i},_touch(){if(this.recursiveReadLimit===Number.POSITIVE_INFINITY)return;const t=this.getReadCount();this.positionReadCount.set(this.position,t+1),t>0&&this.recursiveReadCount++}};function n(t,{recursiveReadLimit:i=8192}={}){const s=Object.create(e);return s.bytes=t,s.dataView=new DataView(t.buffer,t.byteOffset,t.byteLength),s.positionReadCount=new Map,s.recursiveReadLimit=i,s}exports.createCursor=n;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index187.cjs"),A=require("./index218.cjs"),D=require("./index87.cjs"),S=require("./index219.cjs"),b=require("./index210.cjs"),I=require("./index188.cjs"),p="/docs/contract/decodeEventLog";function q(n){const{abi:d,data:i,strict:v,topics:E}=n,m=v??!0,[f,...w]=E;if(!f)throw new a.AbiEventSignatureEmptyTopicsError({docsPath:p});const o=d.find(e=>e.type==="event"&&f===S.toEventSelector(I.formatAbiItem(e)));if(!(o&&"name"in o)||o.type!=="event")throw new a.AbiEventSignatureNotFoundError(f,{docsPath:p});const{name:y,inputs:r}=o,u=r==null?void 0:r.some(e=>!("name"in e&&e.name)),c=u?[]:{},g=r.map((e,t)=>[e,t]).filter(([e])=>"indexed"in e&&e.indexed);for(let e=0;e<g.length;e++){const[t,l]=g[e],h=w[e];if(!h)throw new a.DecodeLogTopicsMismatch({abiItem:o,param:t});c[u?l:t.name||l]=L({param:t,value:h})}const s=r.filter(e=>!("indexed"in e&&e.indexed));if(s.length>0){if(i&&i!=="0x")try{const e=b.decodeAbiParameters(s,i);if(e)if(u)for(let t=0;t<r.length;t++)c[t]=c[t]??e.shift();else for(let t=0;t<s.length;t++)c[s[t].name]=e[t]}catch(e){if(m)throw e instanceof a.AbiDecodingDataSizeTooSmallError||e instanceof A.PositionOutOfBoundsError?new a.DecodeLogDataMismatch({abiItem:o,data:i,params:s,size:D.size(i)}):e}else if(m)throw new a.DecodeLogDataMismatch({abiItem:o,data:"0x",params:s,size:0})}return{eventName:y,args:Object.values(c).length>0?c:void 0}}function L({param:n,value:d}){return n.type==="string"||n.type==="bytes"||n.type==="tuple"||n.type.match(/^(.*)\[(\d+)?\]$/)?d:(b.decodeAbiParameters([n],d)||[])[0]}exports.decodeEventLog=q;

package/dist/index217.js

@@ -1,130 +1,67 @@
-import { NegativeOffsetError as o, PositionOutOfBoundsError as e, RecursiveReadLimitExceededError as n } from "./index224.js";
-const h = {
-  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 n({
-        count: this.recursiveReadCount + 1,
-        limit: this.recursiveReadLimit
+import { AbiEventSignatureEmptyTopicsError as A, AbiEventSignatureNotFoundError as x, DecodeLogTopicsMismatch as D, AbiDecodingDataSizeTooSmallError as I, DecodeLogDataMismatch as l } from "./index187.js";
+import { PositionOutOfBoundsError as S } from "./index218.js";
+import { size as T } from "./index87.js";
+import { toEventSelector as z } from "./index219.js";
+import { decodeAbiParameters as w } from "./index210.js";
+import { formatAbiItem as L } from "./index188.js";
+const u = "/docs/contract/decodeEventLog";
+function U(o) {
+  const { abi: d, data: i, strict: E, topics: b } = o, m = E ?? !0, [a, ...v] = b;
+  if (!a)
+    throw new A({ docsPath: u });
+  const n = d.find((e) => e.type === "event" && a === z(L(e)));
+  if (!(n && "name" in n) || n.type !== "event")
+    throw new x(a, { docsPath: u });
+  const { name: y, inputs: r } = n, f = r == null ? void 0 : r.some((e) => !("name" in e && e.name)), c = f ? [] : {}, p = r.map((e, t) => [e, t]).filter(([e]) => "indexed" in e && e.indexed);
+  for (let e = 0; e < p.length; e++) {
+    const [t, g] = p[e], h = v[e];
+    if (!h)
+      throw new D({
+        abiItem: n,
+        param: t
       });
-  },
-  assertPosition(t) {
-    if (t < 0 || t > this.bytes.length - 1)
-      throw new e({
-        length: this.bytes.length,
-        position: t
+    c[f ? g : t.name || g] = O({
+      param: t,
+      value: h
+    });
+  }
+  const s = r.filter((e) => !("indexed" in e && e.indexed));
+  if (s.length > 0) {
+    if (i && i !== "0x")
+      try {
+        const e = w(s, i);
+        if (e)
+          if (f)
+            for (let t = 0; t < r.length; t++)
+              c[t] = c[t] ?? e.shift();
+          else
+            for (let t = 0; t < s.length; t++)
+              c[s[t].name] = e[t];
+      } catch (e) {
+        if (m)
+          throw e instanceof I || e instanceof S ? new l({
+            abiItem: n,
+            data: i,
+            params: s,
+            size: T(i)
+          }) : e;
+      }
+    else if (m)
+      throw new l({
+        abiItem: n,
+        data: "0x",
+        params: s,
+        size: 0
       });
-  },
-  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 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 = /* @__PURE__ */ new Map(), s.recursiveReadLimit = i, s;
+  return {
+    eventName: y,
+    args: Object.values(c).length > 0 ? c : void 0
+  };
+}
+function O({ param: o, value: d }) {
+  return o.type === "string" || o.type === "bytes" || o.type === "tuple" || o.type.match(/^(.*)\[(\d+)?\]$/) ? d : (w([o], d) || [])[0];
 }
 export {
-  a as createCursor
+  U as decodeEventLog
 };

package/dist/index218.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index206.cjs"),O=require("./index237.cjs"),n=require("./index89.cjs");function p(i,e,s,{strict:f}={}){return O.isHex(i,{strict:!1})?l(i,e,s,{strict:f}):u(i,e,s,{strict:f})}function r(i,e){if(typeof e=="number"&&e>0&&e>n.size(i)-1)throw new t.SliceOffsetOutOfBoundsError({offset:e,position:"start",size:n.size(i)})}function c(i,e,s){if(typeof e=="number"&&typeof s=="number"&&n.size(i)!==s-e)throw new t.SliceOffsetOutOfBoundsError({offset:s,position:"end",size:n.size(i)})}function u(i,e,s,{strict:f}={}){r(i,e);const o=i.slice(e,s);return f&&c(o,e,s),o}function l(i,e,s,{strict:f}={}){r(i,e);const o=`0x${i.replace("0x","").slice((e??0)*2,(s??i.length)*2)}`;return f&&c(o,e,s),o}exports.slice=p;exports.sliceBytes=u;exports.sliceHex=l;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index189.cjs");class t extends o.BaseError{constructor({offset:e}){super(`Offset \`${e}\` cannot be negative.`,{name:"NegativeOffsetError"})}}class i extends o.BaseError{constructor({length:e,position:r}){super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`,{name:"PositionOutOfBoundsError"})}}class n extends o.BaseError{constructor({count:e,limit:r}){super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`,{name:"RecursiveReadLimitExceededError"})}}exports.NegativeOffsetError=t;exports.PositionOutOfBoundsError=i;exports.RecursiveReadLimitExceededError=n;

package/dist/index218.js

@@ -1,41 +1,23 @@
-import { SliceOffsetOutOfBoundsError as t } from "./index206.js";
-import { isHex as p } from "./index237.js";
-import { size as r } from "./index89.js";
-function w(e, f, i, { strict: o } = {}) {
-  return p(e, { strict: !1 }) ? u(e, f, i, {
-    strict: o
-  }) : m(e, f, i, {
-    strict: o
-  });
-}
-function s(e, f) {
-  if (typeof f == "number" && f > 0 && f > r(e) - 1)
-    throw new t({
-      offset: f,
-      position: "start",
-      size: r(e)
-    });
-}
-function c(e, f, i) {
-  if (typeof f == "number" && typeof i == "number" && r(e) !== i - f)
-    throw new t({
-      offset: i,
-      position: "end",
-      size: r(e)
+import { BaseError as o } from "./index189.js";
+class i extends o {
+  constructor({ offset: e }) {
+    super(`Offset \`${e}\` cannot be negative.`, {
+      name: "NegativeOffsetError"
     });
+  }
 }
-function m(e, f, i, { strict: o } = {}) {
-  s(e, f);
-  const n = e.slice(f, i);
-  return o && c(n, f, i), n;
+class n extends o {
+  constructor({ length: e, position: r }) {
+    super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`, { name: "PositionOutOfBoundsError" });
+  }
 }
-function u(e, f, i, { strict: o } = {}) {
-  s(e, f);
-  const n = `0x${e.replace("0x", "").slice((f ?? 0) * 2, (i ?? e.length) * 2)}`;
-  return o && c(n, f, i), n;
+class c extends o {
+  constructor({ count: e, limit: r }) {
+    super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`, { name: "RecursiveReadLimitExceededError" });
+  }
 }
 export {
-  w as slice,
-  m as sliceBytes,
-  u as sliceHex
+  i as NegativeOffsetError,
+  n as PositionOutOfBoundsError,
+  c as RecursiveReadLimitExceededError
 };