@coinbase/cdp-hooks 0.0.37 → 0.0.39

package/dist/esm/index122.js

@@ -1,130 +1,9 @@
-import { NegativeOffsetError as o, PositionOutOfBoundsError as e, RecursiveReadLimitExceededError as n } from "./index130.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/index123.js

@@ -1,41 +1,30 @@
-import { SliceOffsetOutOfBoundsError as t } from "./index107.js";
-import { isHex as p } from "./index147.js";
-import { size as r } from "./index83.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 "./index98.js";
+import { trim as o } from "./index122.js";
+import { assertSize as r, hexToNumber as s, hexToBigInt as u } from "./index142.js";
+import { bytesToHex as t } from "./index109.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
 };

package/dist/esm/index124.js

@@ -1,9 +1,194 @@
-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;
+import { AbiEncodingLengthMismatchError as y, InvalidAbiEncodingTypeError as u, InvalidArrayError as g, AbiEncodingArrayLengthMismatchError as l, AbiEncodingBytesSizeMismatchError as b } from "./index79.js";
+import { InvalidAddressError as w } from "./index104.js";
+import { BaseError as A } from "./index82.js";
+import { IntegerOutOfRangeError as x } from "./index98.js";
+import { isAddress as z } from "./index131.js";
+import { concat as f } from "./index113.js";
+import { padHex as d } from "./index132.js";
+import { size as a } from "./index81.js";
+import { slice as E } from "./index121.js";
+import { numberToHex as m, boolToHex as P, stringToHex as S } from "./index109.js";
+import { integerRegex as I } from "./index133.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))
+    throw new b({
+      expectedSize: Number.parseInt(o),
+      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 {
+    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 {
-  f as trim
+  K as encodeAbiParameters,
+  W as getArrayComponents
 };

package/dist/esm/index125.js

@@ -1,30 +1,6 @@
-import { InvalidBytesBooleanError as f } from "./index100.js";
-import { trim as o } from "./index124.js";
-import { assertSize as r, hexToNumber as s, hexToBigInt as u } from "./index144.js";
-import { bytesToHex as t } from "./index111.js";
-function c(n, i = {}) {
-  typeof i.size < "u" && r(n, { size: i.size });
-  const e = t(n, i);
-  return u(e, i);
-}
-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);
-}
+import { slice as t } from "./index121.js";
+import { toSignatureHash as r } from "./index181.js";
+const c = (o) => t(r(o), 0, 4);
 export {
-  c as bytesToBigInt,
-  T as bytesToBool,
-  b as bytesToNumber,
-  h as bytesToString
+  c as toFunctionSelector
 };