@coinbase/cdp-hooks 0.0.96 → 0.0.97

package/dist/esm/index194.js

@@ -1,6 +1,9 @@
-import { slice as t } from "./index188.js";
-import { toSignatureHash as r } from "./index243.js";
-const c = (o) => t(r(o), 0, 4);
+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 {
-  c as toFunctionSelector
+  f as trim
 };

package/dist/esm/index195.js

@@ -1,76 +1,30 @@
-import { AbiEventSignatureEmptyTopicsError as A, AbiEventSignatureNotFoundError as D, DecodeLogTopicsMismatch as T, AbiDecodingDataSizeTooSmallError as S, DecodeLogDataMismatch as w } from "./index157.js";
-import { PositionOutOfBoundsError as z } from "./index196.js";
-import { size as L } from "./index159.js";
-import { toEventSelector as O } from "./index197.js";
-import { decodeAbiParameters as I } from "./index185.js";
-import { formatAbiItem as P } from "./index158.js";
-const E = "/docs/contract/decodeEventLog";
-function $(o) {
-  const { abi: a, data: s, strict: b, topics: v } = o, c = b ?? !0, [u, ...x] = v;
-  if (!u)
-    throw new A({ docsPath: E });
-  const i = a.find((e) => e.type === "event" && u === O(P(e)));
-  if (!(i && "name" in i) || i.type !== "event")
-    throw new D(u, { docsPath: E });
-  const { name: y, inputs: f } = i, m = f?.some((e) => !("name" in e && e.name)), r = m ? [] : {}, h = f.map((e, n) => [e, n]).filter(([e]) => "indexed" in e && e.indexed), l = [];
-  for (let e = 0; e < h.length; e++) {
-    const [n, t] = h[e], d = x[e];
-    if (!d) {
-      if (c)
-        throw new T({
-          abiItem: i,
-          param: n
-        });
-      l.push([n, t]);
-      continue;
-    }
-    r[m ? t : n.name || t] = M({
-      param: n,
-      value: d
-    });
-  }
-  const p = f.filter((e) => !("indexed" in e && e.indexed)), g = c ? p : [...l.map(([e]) => e), ...p];
-  if (g.length > 0) {
-    if (s && s !== "0x")
-      try {
-        const e = I(g, s);
-        if (e) {
-          let n = 0;
-          if (!c)
-            for (const [t, d] of l)
-              r[m ? d : t.name || d] = e[n++];
-          if (m)
-            for (let t = 0; t < f.length; t++)
-              r[t] === void 0 && n < e.length && (r[t] = e[n++]);
-          else
-            for (let t = 0; t < p.length; t++)
-              r[p[t].name] = e[n++];
-        }
-      } catch (e) {
-        if (c)
-          throw e instanceof S || e instanceof z ? new w({
-            abiItem: i,
-            data: s,
-            params: g,
-            size: L(s)
-          }) : e;
-      }
-    else if (c)
-      throw new w({
-        abiItem: i,
-        data: "0x",
-        params: g,
-        size: 0
-      });
-  }
-  return {
-    eventName: y,
-    args: Object.values(r).length > 0 ? r : void 0
-  };
+import { InvalidBytesBooleanError as f } from "./index181.js";
+import { trim as o } from "./index194.js";
+import { assertSize as r, hexToNumber as s, hexToBigInt as u } from "./index235.js";
+import { bytesToHex as t } from "./index197.js";
+function c(n, i = {}) {
+  typeof i.size < "u" && r(n, { size: i.size });
+  const e = t(n, i);
+  return u(e, i);
 }
-function M({ param: o, value: a }) {
-  return o.type === "string" || o.type === "bytes" || o.type === "tuple" || o.type.match(/^(.*)\[(\d+)?\]$/) ? a : (I([o], a) || [])[0];
+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 b(n, i = {}) {
+  typeof i.size < "u" && r(n, { size: i.size });
+  const e = t(n, i);
+  return s(e, i);
+}
+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 {
-  $ as decodeEventLog
+  c as bytesToBigInt,
+  T as bytesToBool,
+  b as bytesToNumber,
+  h as bytesToString
 };

package/dist/esm/index196.js

@@ -1,23 +1,58 @@
-import { BaseError as o } from "./index160.js";
-class i extends o {
-  constructor({ offset: e }) {
-    super(`Offset \`${e}\` cannot be negative.`, {
-      name: "NegativeOffsetError"
-    });
-  }
+import { BaseError as g } from "./index165.js";
+import { isHex as x } from "./index216.js";
+import { pad as s } from "./index207.js";
+import { assertSize as u } from "./index235.js";
+import { numberToHex as h } from "./index197.js";
+const A = /* @__PURE__ */ new TextEncoder();
+function F(e, n = {}) {
+  return typeof e == "number" || typeof e == "bigint" ? T(e, n) : typeof e == "boolean" ? B(e, n) : x(e) ? y(e, n) : l(e, n);
 }
-class n extends o {
-  constructor({ length: e, position: r }) {
-    super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`, { name: "PositionOutOfBoundsError" });
-  }
+function B(e, n = {}) {
+  const r = new Uint8Array(1);
+  return r[0] = Number(e), typeof n.size == "number" ? (u(r, { size: n.size }), s(r, { size: n.size })) : r;
+}
+const t = {
+  zero: 48,
+  nine: 57,
+  A: 65,
+  F: 70,
+  a: 97,
+  f: 102
+};
+function m(e) {
+  if (e >= t.zero && e <= t.nine)
+    return e - t.zero;
+  if (e >= t.A && e <= t.F)
+    return e - (t.A - 10);
+  if (e >= t.a && e <= t.f)
+    return e - (t.a - 10);
 }
-class c extends o {
-  constructor({ count: e, limit: r }) {
-    super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`, { name: "RecursiveReadLimitExceededError" });
+function y(e, n = {}) {
+  let r = e;
+  n.size && (u(r, { size: n.size }), r = s(r, { dir: "right", size: n.size }));
+  let i = r.slice(2);
+  i.length % 2 && (i = `0${i}`);
+  const z = i.length / 2, d = new Uint8Array(z);
+  for (let f = 0, o = 0; f < z; f++) {
+    const b = m(i.charCodeAt(o++)), c = m(i.charCodeAt(o++));
+    if (b === void 0 || c === void 0)
+      throw new g(`Invalid byte sequence ("${i[o - 2]}${i[o - 1]}" in "${i}").`);
+    d[f] = b * 16 + c;
   }
+  return d;
+}
+function T(e, n) {
+  const r = h(e, n);
+  return y(r);
+}
+function l(e, n = {}) {
+  const r = A.encode(e);
+  return typeof n.size == "number" ? (u(r, { size: n.size }), s(r, { dir: "right", size: n.size })) : r;
 }
 export {
-  i as NegativeOffsetError,
-  n as PositionOutOfBoundsError,
-  c as RecursiveReadLimitExceededError
+  B as boolToBytes,
+  y as hexToBytes,
+  T as numberToBytes,
+  l as stringToBytes,
+  F as toBytes
 };

package/dist/esm/index197.js

@@ -1,5 +1,48 @@
-import { toSignatureHash as t } from "./index243.js";
-const e = t;
+import { IntegerOutOfRangeError as x } from "./index181.js";
+import { pad as s } from "./index207.js";
+import { assertSize as c } from "./index235.js";
+const b = /* @__PURE__ */ Array.from({ length: 256 }, (n, e) => e.toString(16).padStart(2, "0"));
+function B(n, e = {}) {
+  return typeof n == "number" || typeof n == "bigint" ? y(n, e) : typeof n == "string" ? $(n, e) : typeof n == "boolean" ? z(n, e) : m(n, e);
+}
+function z(n, e = {}) {
+  const t = `0x${Number(n)}`;
+  return typeof e.size == "number" ? (c(t, { size: e.size }), s(t, { size: e.size })) : t;
+}
+function m(n, e = {}) {
+  let t = "";
+  for (let i = 0; i < n.length; i++)
+    t += b[n[i]];
+  const r = `0x${t}`;
+  return typeof e.size == "number" ? (c(r, { size: e.size }), s(r, { dir: "right", size: e.size })) : r;
+}
+function y(n, e = {}) {
+  const { signed: t, size: r } = e, i = BigInt(n);
+  let o;
+  r ? t ? o = (1n << BigInt(r) * 8n - 1n) - 1n : o = 2n ** (BigInt(r) * 8n) - 1n : typeof n == "number" && (o = BigInt(Number.MAX_SAFE_INTEGER));
+  const g = typeof o == "bigint" && t ? -o - 1n : 0;
+  if (o && i > o || i < g) {
+    const f = typeof n == "bigint" ? "n" : "";
+    throw new x({
+      max: o ? `${o}${f}` : void 0,
+      min: `${g}${f}`,
+      signed: t,
+      size: r,
+      value: `${n}${f}`
+    });
+  }
+  const u = `0x${(t && i < 0 ? (1n << BigInt(r * 8)) + BigInt(i) : i).toString(16)}`;
+  return r ? s(u, { size: r }) : u;
+}
+const d = /* @__PURE__ */ new TextEncoder();
+function $(n, e = {}) {
+  const t = d.encode(n);
+  return m(t, e);
+}
 export {
-  e as toEventSelector
+  z as boolToHex,
+  m as bytesToHex,
+  y as numberToHex,
+  $ as stringToHex,
+  B as toHex
 };

package/dist/esm/index198.js

@@ -1,19 +1,194 @@
-import { AbiFunctionSignatureNotFoundError as a } from "./index157.js";
-import { slice as r } from "./index188.js";
-import { toFunctionSelector as u } from "./index194.js";
-import { decodeAbiParameters as m } from "./index185.js";
-import { formatAbiItem as d } from "./index158.js";
-function g(e) {
-  const { abi: c, data: o } = e, n = r(o, 0, 4), t = c.find((i) => i.type === "function" && n === u(d(i)));
-  if (!t)
-    throw new a(n, {
-      docsPath: "/docs/contract/decodeFunctionData"
+import { AbiEncodingLengthMismatchError as y, InvalidAbiEncodingTypeError as u, InvalidArrayError as g, AbiEncodingArrayLengthMismatchError as l, AbiEncodingBytesSizeMismatchError as b } from "./index162.js";
+import { InvalidAddressError as w } from "./index166.js";
+import { BaseError as A } from "./index165.js";
+import { IntegerOutOfRangeError as x } from "./index181.js";
+import { isAddress as z } from "./index205.js";
+import { concat as f } from "./index206.js";
+import { padHex as d } from "./index207.js";
+import { size as a } from "./index164.js";
+import { slice as E } from "./index193.js";
+import { numberToHex as m, boolToHex as P, stringToHex as S } from "./index197.js";
+import { integerRegex as I } from "./index208.js";
+function K(e, t) {
+  if (e.length !== t.length)
+    throw new y({
+      expectedLength: e.length,
+      givenLength: t.length
     });
+  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 p({ param: e, value: t }) {
+  const o = W(e.type);
+  if (o) {
+    const [n, r] = o;
+    return M(t, { length: n, param: { ...e, type: r } });
+  }
+  if (e.type === "tuple")
+    return H(t, {
+      param: e
+    });
+  if (e.type === "address")
+    return B(t);
+  if (e.type === "bool")
+    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 N(t, { param: e });
+  if (e.type === "string")
+    return C(t);
+  throw new u(e.type, {
+    docsPath: "/docs/contract/encodeAbiParameters"
+  });
+}
+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);
+  }
+  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);
+  }
+  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}]`
+    });
+  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);
+  }
+  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 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])
+    };
+  }
+  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 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 $(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()
+      });
+  }
+  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 {
-    functionName: t.name,
-    args: "inputs" in t && t.inputs && t.inputs.length > 0 ? m(t.inputs, r(o, 4)) : void 0
+    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]
+    });
+    n.push(s), s.dynamic && (o = !0);
+  }
+  return {
+    dynamic: o,
+    encoded: o ? h(n) : f(n.map(({ encoded: r }) => r))
+  };
+}
+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 {
-  g as decodeFunctionData
+  K as encodeAbiParameters,
+  W as getArrayComponents
 };

package/dist/esm/index199.js

@@ -1,26 +1,6 @@
-import { AbiFunctionNotFoundError as u, AbiFunctionOutputsNotFoundError as s } from "./index157.js";
-import { decodeAbiParameters as a } from "./index185.js";
-import { getAbiItem as m } from "./index169.js";
-const e = "/docs/contract/decodeFunctionResult";
-function l(c) {
-  const { abi: r, args: d, functionName: o, data: f } = c;
-  let n = r[0];
-  if (o) {
-    const i = m({ abi: r, args: d, name: o });
-    if (!i)
-      throw new u(o, { docsPath: e });
-    n = i;
-  }
-  if (n.type !== "function")
-    throw new u(void 0, { docsPath: e });
-  if (!n.outputs)
-    throw new s(n.name, { docsPath: e });
-  const t = a(n.outputs, f);
-  if (t && t.length > 1)
-    return t;
-  if (t && t.length === 1)
-    return t[0];
-}
+import { slice as t } from "./index193.js";
+import { toSignatureHash as r } from "./index248.js";
+const c = (o) => t(r(o), 0, 4);
 export {
-  l as decodeFunctionResult
+  c as toFunctionSelector
 };

package/dist/esm/index200.js

@@ -1,14 +1,76 @@
-import { LruMap as u } from "./index215.js";
-import { checksumAddress as c } from "./index186.js";
-const i = /^0x[a-fA-F0-9]{40}$/, r = /* @__PURE__ */ new u(8192);
-function h(t, s) {
-  const { strict: n = !0 } = s ?? {}, e = `${t}.${n}`;
-  if (r.has(e))
-    return r.get(e);
-  const o = i.test(t) ? t.toLowerCase() === t ? !0 : n ? c(t) === t : !0 : !1;
-  return r.set(e, o), o;
+import { AbiEventSignatureEmptyTopicsError as A, AbiEventSignatureNotFoundError as D, DecodeLogTopicsMismatch as T, AbiDecodingDataSizeTooSmallError as S, DecodeLogDataMismatch as w } from "./index162.js";
+import { PositionOutOfBoundsError as z } from "./index201.js";
+import { size as L } from "./index164.js";
+import { toEventSelector as O } from "./index202.js";
+import { decodeAbiParameters as I } from "./index190.js";
+import { formatAbiItem as P } from "./index163.js";
+const E = "/docs/contract/decodeEventLog";
+function $(o) {
+  const { abi: a, data: s, strict: b, topics: v } = o, c = b ?? !0, [u, ...x] = v;
+  if (!u)
+    throw new A({ docsPath: E });
+  const i = a.find((e) => e.type === "event" && u === O(P(e)));
+  if (!(i && "name" in i) || i.type !== "event")
+    throw new D(u, { docsPath: E });
+  const { name: y, inputs: f } = i, m = f?.some((e) => !("name" in e && e.name)), r = m ? [] : {}, h = f.map((e, n) => [e, n]).filter(([e]) => "indexed" in e && e.indexed), l = [];
+  for (let e = 0; e < h.length; e++) {
+    const [n, t] = h[e], d = x[e];
+    if (!d) {
+      if (c)
+        throw new T({
+          abiItem: i,
+          param: n
+        });
+      l.push([n, t]);
+      continue;
+    }
+    r[m ? t : n.name || t] = M({
+      param: n,
+      value: d
+    });
+  }
+  const p = f.filter((e) => !("indexed" in e && e.indexed)), g = c ? p : [...l.map(([e]) => e), ...p];
+  if (g.length > 0) {
+    if (s && s !== "0x")
+      try {
+        const e = I(g, s);
+        if (e) {
+          let n = 0;
+          if (!c)
+            for (const [t, d] of l)
+              r[m ? d : t.name || d] = e[n++];
+          if (m)
+            for (let t = 0; t < f.length; t++)
+              r[t] === void 0 && n < e.length && (r[t] = e[n++]);
+          else
+            for (let t = 0; t < p.length; t++)
+              r[p[t].name] = e[n++];
+        }
+      } catch (e) {
+        if (c)
+          throw e instanceof S || e instanceof z ? new w({
+            abiItem: i,
+            data: s,
+            params: g,
+            size: L(s)
+          }) : e;
+      }
+    else if (c)
+      throw new w({
+        abiItem: i,
+        data: "0x",
+        params: g,
+        size: 0
+      });
+  }
+  return {
+    eventName: y,
+    args: Object.values(r).length > 0 ? r : void 0
+  };
+}
+function M({ param: o, value: a }) {
+  return o.type === "string" || o.type === "bytes" || o.type === "tuple" || o.type.match(/^(.*)\[(\d+)?\]$/) ? a : (I([o], a) || [])[0];
 }
 export {
-  h as isAddress,
-  r as isAddressCache
+  $ as decodeEventLog
 };

package/dist/esm/index201.js

@@ -1,21 +1,23 @@
-function i(t) {
-  return typeof t[0] == "string" ? f(t) : c(t);
+import { BaseError as o } from "./index165.js";
+class i extends o {
+  constructor({ offset: e }) {
+    super(`Offset \`${e}\` cannot be negative.`, {
+      name: "NegativeOffsetError"
+    });
+  }
 }
-function c(t) {
-  let n = 0;
-  for (const e of t)
-    n += e.length;
-  const r = new Uint8Array(n);
-  let o = 0;
-  for (const e of t)
-    r.set(e, o), o += e.length;
-  return r;
+class n extends o {
+  constructor({ length: e, position: r }) {
+    super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`, { name: "PositionOutOfBoundsError" });
+  }
 }
-function f(t) {
-  return `0x${t.reduce((n, r) => n + r.replace("0x", ""), "")}`;
+class c extends o {
+  constructor({ count: e, limit: r }) {
+    super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`, { name: "RecursiveReadLimitExceededError" });
+  }
 }
 export {
-  i as concat,
-  c as concatBytes,
-  f as concatHex
+  i as NegativeOffsetError,
+  n as PositionOutOfBoundsError,
+  c as RecursiveReadLimitExceededError
 };

package/dist/esm/index202.js

@@ -1,37 +1,5 @@
-import { SizeExceedsPaddingSizeError as d } from "./index175.js";
-function f(n, { dir: r, size: t = 32 } = {}) {
-  return typeof n == "string" ? p(n, { dir: r, size: t }) : i(n, { dir: r, size: t });
-}
-function p(n, { dir: r, size: t = 32 } = {}) {
-  if (t === null)
-    return n;
-  const e = n.replace("0x", "");
-  if (e.length > t * 2)
-    throw new d({
-      size: Math.ceil(e.length / 2),
-      targetSize: t,
-      type: "hex"
-    });
-  return `0x${e[r === "right" ? "padEnd" : "padStart"](t * 2, "0")}`;
-}
-function i(n, { dir: r, size: t = 32 } = {}) {
-  if (t === null)
-    return n;
-  if (n.length > t)
-    throw new d({
-      size: n.length,
-      targetSize: t,
-      type: "bytes"
-    });
-  const e = new Uint8Array(t);
-  for (let a = 0; a < t; a++) {
-    const o = r === "right";
-    e[o ? a : t - a - 1] = n[o ? a : n.length - a - 1];
-  }
-  return e;
-}
+import { toSignatureHash as t } from "./index248.js";
+const e = t;
 export {
-  f as pad,
-  i as padBytes,
-  p as padHex
+  e as toEventSelector
 };