@coinbase/cdp-hooks 0.0.81 → 0.0.83

package/dist/esm/index150.js

@@ -1,14 +1,24 @@
-function r(n, { args: t, eventName: a } = {}) {
-  return {
-    ...n,
-    blockHash: n.blockHash ? n.blockHash : null,
-    blockNumber: n.blockNumber ? BigInt(n.blockNumber) : null,
-    logIndex: n.logIndex ? Number(n.logIndex) : null,
-    transactionHash: n.transactionHash ? n.transactionHash : null,
-    transactionIndex: n.transactionIndex ? Number(n.transactionIndex) : null,
-    ...a ? { args: t, eventName: a } : {}
-  };
+import { InvalidAddressError as c } from "./index135.js";
+import { stringToBytes as m } from "./index139.js";
+import { keccak256 as p } from "./index141.js";
+import { LruMap as u } from "./index210.js";
+import { isAddress as $ } from "./index162.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);
 }
 export {
-  r as formatLog
+  h as checksumAddress,
+  w as getAddress
 };

package/dist/esm/index151.js

@@ -1,163 +1,130 @@
-import { AbiDecodingZeroDataError as a, AbiDecodingDataSizeTooSmallError as C, InvalidAbiDecodingTypeError as D } from "./index112.js";
-import { checksumAddress as w } from "./index152.js";
-import { createCursor as _ } from "./index153.js";
-import { size as p } from "./index114.js";
-import { sliceBytes as W } from "./index154.js";
-import { trim as x } from "./index155.js";
-import { bytesToNumber as y, bytesToBool as I, bytesToBigInt as N, bytesToString as O } from "./index156.js";
-import { hexToBytes as S } from "./index141.js";
-import { bytesToHex as g } from "./index142.js";
-import { getArrayComponents as A } from "./index157.js";
-function Y(t, e) {
-  const n = typeof e == "string" ? S(e) : e, i = _(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)
-    });
-  let s = 0;
-  const d = [];
-  for (let o = 0; o < t.length; ++o) {
-    const r = t[o];
-    i.setPosition(s);
-    const [f, c] = u(i, r, {
-      staticPosition: 0
-    });
-    s += c, d.push(f);
-  }
-  return d;
-}
-function u(t, e, { staticPosition: n }) {
-  const i = A(e.type);
-  if (i) {
-    const [s, d] = i;
-    return k(t, { ...e, type: d }, { length: s, staticPosition: n });
-  }
-  if (e.type === "tuple")
-    return Z(t, e, { staticPosition: n });
-  if (e.type === "address")
-    return E(t);
-  if (e.type === "bool")
-    return H(t);
-  if (e.type.startsWith("bytes"))
-    return L(t, e, { staticPosition: n });
-  if (e.type.startsWith("uint") || e.type.startsWith("int"))
-    return U(t, e);
-  if (e.type === "string")
-    return j(t, { staticPosition: n });
-  throw new D(e.type, {
-    docsPath: "/docs/contract/decodeAbiParameters"
-  });
-}
-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: i }) {
-  if (!n) {
-    const o = y(t.readBytes(b)), r = i + o, f = r + P;
-    t.setPosition(r);
-    const c = y(t.readBytes(P)), l = m(e);
-    let h = 0;
-    const v = [];
-    for (let B = 0; B < c; ++B) {
-      t.setPosition(f + (l ? B * 32 : h));
-      const [T, z] = u(t, e, {
-        staticPosition: f
+import { NegativeOffsetError as o, PositionOutOfBoundsError as e, RecursiveReadLimitExceededError as n } from "./index159.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
       });
-      h += z, v.push(T);
-    }
-    return t.setPosition(i + 32), [v, 32];
-  }
-  if (m(e)) {
-    const o = y(t.readBytes(b)), r = i + o, 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(i + 32), [f, 32];
-  }
-  let s = 0;
-  const d = [];
-  for (let o = 0; o < n; ++o) {
-    const [r, f] = u(t, e, {
-      staticPosition: i + s
-    });
-    s += f, d.push(r);
-  }
-  return [d, s];
-}
-function H(t) {
-  return [I(t.readBytes(32), { size: 32 }), 32];
-}
-function L(t, e, { staticPosition: n }) {
-  const [i, s] = e.type.split("bytes");
-  if (!s) {
-    const o = y(t.readBytes(32));
-    t.setPosition(n + o);
-    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];
-  }
-  return [g(t.readBytes(Number.parseInt(s), 32)), 32];
-}
-function U(t, e) {
-  const n = e.type.startsWith("int"), i = Number.parseInt(e.type.split("int")[1] || "256"), s = t.readBytes(32);
-  return [
-    i > 48 ? N(s, { signed: n }) : y(s, { signed: n }),
-    32
-  ];
-}
-function Z(t, e, { staticPosition: n }) {
-  const i = e.components.length === 0 || e.components.some(({ name: o }) => !o), s = i ? [] : {};
-  let d = 0;
-  if (m(e)) {
-    const o = y(t.readBytes(b)), r = n + o;
-    for (let f = 0; f < e.components.length; ++f) {
-      const c = e.components[f];
-      t.setPosition(r + d);
-      const [l, h] = u(t, c, {
-        staticPosition: r
+  },
+  assertPosition(t) {
+    if (t < 0 || t > this.bytes.length - 1)
+      throw new e({
+        length: this.bytes.length,
+        position: t
       });
-      d += h, s[i ? f : c?.name] = l;
-    }
-    return t.setPosition(n + 32), [s, 32];
+  },
+  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++;
   }
-  for (let o = 0; o < e.components.length; ++o) {
-    const r = e.components[o], [f, c] = u(t, r, {
-      staticPosition: n
-    });
-    s[i ? o : r?.name] = f, d += c;
-  }
-  return [s, d];
-}
-function j(t, { staticPosition: e }) {
-  const n = y(t.readBytes(32)), i = e + n;
-  t.setPosition(i);
-  const s = y(t.readBytes(32));
-  if (s === 0)
-    return t.setPosition(e + 32), ["", 32];
-  const d = t.readBytes(s, 32), o = O(x(d));
-  return t.setPosition(e + 32), [o, 32];
-}
-function m(t) {
-  const { type: e } = t;
-  if (e === "string" || e === "bytes" || e.endsWith("[]"))
-    return !0;
-  if (e === "tuple")
-    return t.components?.some(m);
-  const n = A(t.type);
-  return !!(n && m({ ...t, type: n[1] }));
+};
+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;
 }
 export {
-  Y as decodeAbiParameters
+  a as createCursor
 };

package/dist/esm/index152.js

@@ -1,24 +1,41 @@
-import { InvalidAddressError as c } from "./index137.js";
-import { stringToBytes as m } from "./index141.js";
-import { keccak256 as p } from "./index143.js";
-import { LruMap as u } from "./index211.js";
-import { isAddress as $ } from "./index164.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;
+import { SliceOffsetOutOfBoundsError as t } from "./index136.js";
+import { isHex as p } from "./index176.js";
+import { size as r } from "./index112.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 w(t, o) {
-  if (!$(t, { strict: !1 }))
-    throw new c({ address: t });
-  return h(t, 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)
+    });
+}
+function m(e, f, i, { strict: o } = {}) {
+  s(e, f);
+  const n = e.slice(f, i);
+  return o && c(n, f, i), n;
+}
+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;
 }
 export {
-  h as checksumAddress,
-  w as getAddress
+  w as slice,
+  m as sliceBytes,
+  u as sliceHex
 };

package/dist/esm/index153.js

@@ -1,130 +1,9 @@
-import { NegativeOffsetError as o, PositionOutOfBoundsError as e, RecursiveReadLimitExceededError as n } from "./index161.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
-      });
-  },
-  assertPosition(t) {
-    if (t < 0 || t > this.bytes.length - 1)
-      throw new e({
-        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 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;
+function f(e, { dir: n = "left" } = {}) {
+  let t = typeof e == "string" ? e.replace("0x", "") : e, i = 0;
+  for (let l = 0; l < t.length - 1 && t[n === "left" ? l : t.length - l - 1].toString() === "0"; l++)
+    i++;
+  return t = n === "left" ? t.slice(i) : t.slice(0, t.length - i), typeof e == "string" ? (t.length === 1 && n === "right" && (t = `${t}0`), `0x${t.length % 2 === 1 ? `0${t}` : t}`) : t;
 }
 export {
-  a as createCursor
+  f as trim
 };

package/dist/esm/index154.js

@@ -1,41 +1,30 @@
-import { SliceOffsetOutOfBoundsError as t } from "./index138.js";
-import { isHex as p } from "./index178.js";
-import { size as r } from "./index114.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
-  });
+import { InvalidBytesBooleanError as f } from "./index129.js";
+import { trim as o } from "./index153.js";
+import { assertSize as r, hexToNumber as s, hexToBigInt as u } from "./index173.js";
+import { bytesToHex as t } from "./index140.js";
+function c(n, i = {}) {
+  typeof i.size < "u" && r(n, { size: i.size });
+  const e = t(n, i);
+  return u(e, i);
 }
-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 T(n, i = {}) {
+  let e = n;
+  if (typeof i.size < "u" && (r(e, { size: i.size }), e = o(e)), e.length > 1 || e[0] > 1)
+    throw new f(e);
+  return !!e[0];
 }
-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)
-    });
+function b(n, i = {}) {
+  typeof i.size < "u" && r(n, { size: i.size });
+  const e = t(n, i);
+  return s(e, i);
 }
-function m(e, f, i, { strict: o } = {}) {
-  s(e, f);
-  const n = e.slice(f, i);
-  return o && c(n, f, i), n;
-}
-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;
+function h(n, i = {}) {
+  let e = n;
+  return typeof i.size < "u" && (r(e, { size: i.size }), e = o(e, { dir: "right" })), new TextDecoder().decode(e);
 }
 export {
-  w as slice,
-  m as sliceBytes,
-  u as sliceHex
+  c as bytesToBigInt,
+  T as bytesToBool,
+  b as bytesToNumber,
+  h as bytesToString
 };