@gardenfi/utils 2.1.3-beta.3 → 2.1.3-beta.5

package/dist/index302.js

@@ -1,80 +1,69 @@
-import { fromString as d } from "./index308.js";
-import { checksum as o } from "./index312.js";
-import { BaseError as c } from "./index297.js";
-import { keccak256 as f } from "./index300.js";
-const l = /^0x[a-fA-F0-9]{40}$/;
-function u(r, t = {}) {
-  const { strict: s = !0 } = t;
-  if (!l.test(r))
-    throw new i({
-      address: r,
-      cause: new h()
-    });
-  if (s) {
-    if (r.toLowerCase() === r)
-      return;
-    if (m(r) !== r)
-      throw new i({
-        address: r,
-        cause: new p()
-      });
-  }
-}
-function m(r) {
-  if (o.has(r))
-    return o.get(r);
-  u(r, { strict: !1 });
-  const t = r.substring(2).toLowerCase(), s = f(d(t), { as: "Bytes" }), n = t.split("");
-  for (let e = 0; e < 40; e += 2)
-    s[e >> 1] >> 4 >= 8 && n[e] && (n[e] = n[e].toUpperCase()), (s[e >> 1] & 15) >= 8 && n[e + 1] && (n[e + 1] = n[e + 1].toUpperCase());
-  const a = `0x${n.join("")}`;
-  return o.set(r, a), a;
-}
-function k(r, t = {}) {
-  const { strict: s = !0 } = t ?? {};
-  try {
-    return u(r, { strict: s }), !0;
-  } catch {
-    return !1;
-  }
-}
-class i extends c {
-  constructor({ address: t, cause: s }) {
-    super(`Address "${t}" is invalid.`, {
-      cause: s
-    }), Object.defineProperty(this, "name", {
+import { getVersion as n } from "./index313.js";
+class c extends Error {
+  constructor(t, e = {}) {
+    const u = (() => {
+      var s;
+      if (e.cause instanceof c) {
+        if (e.cause.details)
+          return e.cause.details;
+        if (e.cause.shortMessage)
+          return e.cause.shortMessage;
+      }
+      return (s = e.cause) != null && s.message ? e.cause.message : e.details;
+    })(), a = e.cause instanceof c && e.cause.docsPath || e.docsPath, i = `https://oxlib.sh${a ?? ""}`, d = [
+      t || "An error occurred.",
+      ...e.metaMessages ? ["", ...e.metaMessages] : [],
+      ...u || a ? [
+        "",
+        u ? `Details: ${u}` : void 0,
+        a ? `See: ${i}` : void 0
+      ] : []
+    ].filter((s) => typeof s == "string").join(`
+`);
+    super(d, e.cause ? { cause: e.cause } : void 0), Object.defineProperty(this, "details", {
       enumerable: !0,
       configurable: !0,
       writable: !0,
-      value: "Address.InvalidAddressError"
-    });
-  }
-}
-class h extends c {
-  constructor() {
-    super("Address is not a 20 byte (40 hexadecimal character) value."), Object.defineProperty(this, "name", {
+      value: void 0
+    }), Object.defineProperty(this, "docs", {
       enumerable: !0,
       configurable: !0,
       writable: !0,
-      value: "Address.InvalidInputError"
-    });
-  }
-}
-class p extends c {
-  constructor() {
-    super("Address does not match its checksum counterpart."), Object.defineProperty(this, "name", {
+      value: void 0
+    }), Object.defineProperty(this, "docsPath", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: void 0
+    }), Object.defineProperty(this, "shortMessage", {
       enumerable: !0,
       configurable: !0,
       writable: !0,
-      value: "Address.InvalidChecksumError"
-    });
+      value: void 0
+    }), Object.defineProperty(this, "cause", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: void 0
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "BaseError"
+    }), Object.defineProperty(this, "version", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: `ox@${n()}`
+    }), this.cause = e.cause, this.details = u, this.docs = i, this.docsPath = a, this.shortMessage = t;
+  }
+  walk(t) {
+    return l(this, t);
   }
 }
+function l(r, t) {
+  return t != null && t(r) ? r : r && typeof r == "object" && "cause" in r && r.cause ? l(r.cause, t) : t ? null : r;
+}
 export {
-  i as InvalidAddressError,
-  p as InvalidChecksumError,
-  h as InvalidInputError,
-  u as assert,
-  m as checksum,
-  k as validate
+  c as BaseError
 };

package/dist/index303.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=/^(.*)\[([0-9]*)\]$/,t=/^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/,g=/^(u?int)(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/;exports.arrayRegex=e;exports.bytesRegex=t;exports.integerRegex=g;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n="#__bigint";function e(i,f,r){return JSON.stringify(i,(g,t)=>typeof t=="bigint"?t.toString()+n:t,r)}exports.stringify=e;

package/dist/index303.js

@@ -1,6 +1,7 @@
-const e = /^(.*)\[([0-9]*)\]$/, t = /^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/, n = /^(u?int)(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/;
+const r = "#__bigint";
+function g(i, f, n) {
+  return JSON.stringify(i, (e, t) => typeof t == "bigint" ? t.toString() + r : t, n);
+}
 export {
-  e as arrayRegex,
-  t as bytesRegex,
-  n as integerRegex
+  g as stringify
 };

package/dist/index304.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const m=require("./index263.cjs"),w=require("./index302.cjs"),N=require("./index297.cjs"),c=require("./index260.cjs"),x=require("./index303.cjs");function P({checksumAddress:e,parameters:r,values:n}){const t=[];for(let o=0;o<r.length;o++)t.push(f({checksumAddress:e,parameter:r[o],value:n[o]}));return t}function f({checksumAddress:e=!1,parameter:r,value:n}){const t=r,o=S(t.type);if(o){const[i,s]=o;return h(n,{checksumAddress:e,length:i,parameter:{...t,type:s}})}if(t.type==="tuple")return A(n,{checksumAddress:e,parameter:t});if(t.type==="address")return y(n,{checksum:e});if(t.type==="bool")return g(n);if(t.type.startsWith("uint")||t.type.startsWith("int")){const i=t.type.startsWith("int"),[,,s="256"]=x.integerRegex.exec(t.type)??[];return b(n,{signed:i,size:Number(s)})}if(t.type.startsWith("bytes"))return l(n,{type:t.type});if(t.type==="string")return z(n);throw new m.InvalidTypeError(t.type)}function u(e){let r=0;for(let i=0;i<e.length;i++){const{dynamic:s,encoded:a}=e[i];s?r+=32:r+=c.size(a)}const n=[],t=[];let o=0;for(let i=0;i<e.length;i++){const{dynamic:s,encoded:a}=e[i];s?(n.push(c.fromNumber(r+o,{size:32})),t.push(a),o+=c.size(a)):n.push(a)}return c.concat(...n,...t)}function y(e,r){const{checksum:n=!1}=r;return w.assert(e,{strict:n}),{dynamic:!1,encoded:c.padLeft(e.toLowerCase())}}function h(e,r){const{checksumAddress:n,length:t,parameter:o}=r,i=t===null;if(!Array.isArray(e))throw new m.InvalidArrayError(e);if(!i&&e.length!==t)throw new m.ArrayLengthMismatchError({expectedLength:t,givenLength:e.length,type:`${o.type}[${t}]`});let s=!1;const a=[];for(let d=0;d<e.length;d++){const p=f({checksumAddress:n,parameter:o,value:e[d]});p.dynamic&&(s=!0),a.push(p)}if(i||s){const d=u(a);if(i){const p=c.fromNumber(a.length,{size:32});return{dynamic:!0,encoded:a.length>0?c.concat(p,d):p}}if(s)return{dynamic:!0,encoded:d}}return{dynamic:!1,encoded:c.concat(...a.map(({encoded:d})=>d))}}function l(e,{type:r}){const[,n]=r.split("bytes"),t=c.size(e);if(!n){let o=e;return t%32!==0&&(o=c.padRight(o,Math.ceil((e.length-2)/2/32)*32)),{dynamic:!0,encoded:c.concat(c.padLeft(c.fromNumber(t,{size:32})),o)}}if(t!==Number.parseInt(n))throw new m.BytesSizeMismatchError({expectedSize:Number.parseInt(n),value:e});return{dynamic:!1,encoded:c.padRight(e)}}function g(e){if(typeof e!="boolean")throw new N.BaseError(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);return{dynamic:!1,encoded:c.padLeft(c.fromBoolean(e))}}function b(e,{signed:r,size:n}){if(typeof n=="number"){const t=2n**(BigInt(n)-(r?1n:0n))-1n,o=r?-t-1n:0n;if(e>t||e<o)throw new c.IntegerOutOfRangeError({max:t.toString(),min:o.toString(),signed:r,size:n/8,value:e.toString()})}return{dynamic:!1,encoded:c.fromNumber(e,{size:32,signed:r})}}function z(e){const r=c.fromString(e),n=Math.ceil(c.size(r)/32),t=[];for(let o=0;o<n;o++)t.push(c.padRight(c.slice(r,o*32,(o+1)*32)));return{dynamic:!0,encoded:c.concat(c.padRight(c.fromNumber(c.size(r),{size:32})),...t)}}function A(e,r){const{checksumAddress:n,parameter:t}=r;let o=!1;const i=[];for(let s=0;s<t.components.length;s++){const a=t.components[s],d=Array.isArray(e)?s:a.name,p=f({checksumAddress:n,parameter:a,value:e[d]});i.push(p),p.dynamic&&(o=!0)}return{dynamic:o,encoded:o?u(i):c.concat(...i.map(({encoded:s})=>s))}}function S(e){const r=e.match(/^(.*)\[(\d+)?\]$/);return r?[r[2]?Number(r[2]):null,r[1]]:void 0}exports.encode=u;exports.encodeAddress=y;exports.encodeArray=h;exports.encodeBoolean=g;exports.encodeBytes=l;exports.encodeNumber=b;exports.encodeString=z;exports.encodeTuple=A;exports.getArrayComponents=S;exports.prepareParameter=f;exports.prepareParameters=P;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index288.cjs");function n(t,e){if(i.size(t)>e)throw new i.SizeOverflowError({givenSize:i.size(t),maxSize:e})}function o(t,e){if(typeof e=="number"&&e>0&&e>i.size(t)-1)throw new i.SliceOffsetOutOfBoundsError({offset:e,position:"start",size:i.size(t)})}function z(t,e,r){if(typeof e=="number"&&typeof r=="number"&&i.size(t)!==r-e)throw new i.SliceOffsetOutOfBoundsError({offset:r,position:"end",size:i.size(t)})}function a(t,e={}){const{dir:r,size:s=32}=e;if(s===0)return t;const f=t.replace("0x","");if(f.length>s*2)throw new i.SizeExceedsPaddingSizeError({size:Math.ceil(f.length/2),targetSize:s,type:"Hex"});return`0x${f[r==="right"?"padEnd":"padStart"](s*2,"0")}`}exports.assertEndOffset=z;exports.assertSize=n;exports.assertStartOffset=o;exports.pad=a;

package/dist/index304.js

@@ -1,197 +1,43 @@
-import { InvalidTypeError as g, InvalidArrayError as b, ArrayLengthMismatchError as w, BytesSizeMismatchError as z } from "./index263.js";
-import { assert as x } from "./index302.js";
-import { BaseError as S } from "./index297.js";
-import { size as d, fromNumber as f, concat as p, padLeft as h, fromBoolean as A, IntegerOutOfRangeError as E, padRight as y, fromString as I, slice as B } from "./index260.js";
-import { integerRegex as L } from "./index303.js";
-function q({ checksumAddress: e, parameters: n, values: r }) {
-  const t = [];
-  for (let o = 0; o < n.length; o++)
-    t.push(u({
-      checksumAddress: e,
-      parameter: n[o],
-      value: r[o]
-    }));
-  return t;
-}
-function u({ checksumAddress: e = !1, parameter: n, value: r }) {
-  const t = n, o = k(t.type);
-  if (o) {
-    const [i, c] = o;
-    return P(r, {
-      checksumAddress: e,
-      length: i,
-      parameter: {
-        ...t,
-        type: c
-      }
-    });
-  }
-  if (t.type === "tuple")
-    return R(r, {
-      checksumAddress: e,
-      parameter: t
-    });
-  if (t.type === "address")
-    return N(r, {
-      checksum: e
-    });
-  if (t.type === "bool")
-    return C(r);
-  if (t.type.startsWith("uint") || t.type.startsWith("int")) {
-    const i = t.type.startsWith("int"), [, , c = "256"] = L.exec(t.type) ?? [];
-    return M(r, {
-      signed: i,
-      size: Number(c)
-    });
-  }
-  if (t.type.startsWith("bytes"))
-    return $(r, { type: t.type });
-  if (t.type === "string")
-    return W(r);
-  throw new g(t.type);
-}
-function l(e) {
-  let n = 0;
-  for (let i = 0; i < e.length; i++) {
-    const { dynamic: c, encoded: s } = e[i];
-    c ? n += 32 : n += d(s);
-  }
-  const r = [], t = [];
-  let o = 0;
-  for (let i = 0; i < e.length; i++) {
-    const { dynamic: c, encoded: s } = e[i];
-    c ? (r.push(f(n + o, { size: 32 })), t.push(s), o += d(s)) : r.push(s);
-  }
-  return p(...r, ...t);
-}
-function N(e, n) {
-  const { checksum: r = !1 } = n;
-  return x(e, { strict: r }), {
-    dynamic: !1,
-    encoded: h(e.toLowerCase())
-  };
-}
-function P(e, n) {
-  const { checksumAddress: r, length: t, parameter: o } = n, i = t === null;
-  if (!Array.isArray(e))
-    throw new b(e);
-  if (!i && e.length !== t)
-    throw new w({
-      expectedLength: t,
-      givenLength: e.length,
-      type: `${o.type}[${t}]`
-    });
-  let c = !1;
-  const s = [];
-  for (let a = 0; a < e.length; a++) {
-    const m = u({
-      checksumAddress: r,
-      parameter: o,
-      value: e[a]
-    });
-    m.dynamic && (c = !0), s.push(m);
-  }
-  if (i || c) {
-    const a = l(s);
-    if (i) {
-      const m = f(s.length, { size: 32 });
-      return {
-        dynamic: !0,
-        encoded: s.length > 0 ? p(m, a) : m
-      };
-    }
-    if (c)
-      return { dynamic: !0, encoded: a };
-  }
-  return {
-    dynamic: !1,
-    encoded: p(...s.map(({ encoded: a }) => a))
-  };
-}
-function $(e, { type: n }) {
-  const [, r] = n.split("bytes"), t = d(e);
-  if (!r) {
-    let o = e;
-    return t % 32 !== 0 && (o = y(o, Math.ceil((e.length - 2) / 2 / 32) * 32)), {
-      dynamic: !0,
-      encoded: p(h(f(t, { size: 32 })), o)
-    };
-  }
-  if (t !== Number.parseInt(r))
-    throw new z({
-      expectedSize: Number.parseInt(r),
-      value: e
-    });
-  return { dynamic: !1, encoded: y(e) };
-}
-function C(e) {
-  if (typeof e != "boolean")
-    throw new S(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);
-  return { dynamic: !1, encoded: h(A(e)) };
-}
-function M(e, { signed: n, size: r }) {
-  if (typeof r == "number") {
-    const t = 2n ** (BigInt(r) - (n ? 1n : 0n)) - 1n, o = n ? -t - 1n : 0n;
-    if (e > t || e < o)
-      throw new E({
-        max: t.toString(),
-        min: o.toString(),
-        signed: n,
-        size: r / 8,
-        value: e.toString()
-      });
-  }
-  return {
-    dynamic: !1,
-    encoded: f(e, {
-      size: 32,
-      signed: n
-    })
-  };
-}
-function W(e) {
-  const n = I(e), r = Math.ceil(d(n) / 32), t = [];
-  for (let o = 0; o < r; o++)
-    t.push(y(B(n, o * 32, (o + 1) * 32)));
-  return {
-    dynamic: !0,
-    encoded: p(y(f(d(n), { size: 32 })), ...t)
-  };
-}
-function R(e, n) {
-  const { checksumAddress: r, parameter: t } = n;
-  let o = !1;
-  const i = [];
-  for (let c = 0; c < t.components.length; c++) {
-    const s = t.components[c], a = Array.isArray(e) ? c : s.name, m = u({
-      checksumAddress: r,
-      parameter: s,
-      value: e[a]
-    });
-    i.push(m), m.dynamic && (o = !0);
-  }
-  return {
-    dynamic: o,
-    encoded: o ? l(i) : p(...i.map(({ encoded: c }) => c))
-  };
-}
-function k(e) {
-  const n = e.match(/^(.*)\[(\d+)?\]$/);
-  return n ? (
-    // Return `null` if the array is dynamic.
-    [n[2] ? Number(n[2]) : null, n[1]]
-  ) : void 0;
+import { SizeExceedsPaddingSizeError as s, size as i, SliceOffsetOutOfBoundsError as f, SizeOverflowError as p } from "./index288.js";
+function c(t, e) {
+  if (i(t) > e)
+    throw new p({
+      givenSize: i(t),
+      maxSize: e
+    });
+}
+function S(t, e) {
+  if (typeof e == "number" && e > 0 && e > i(t) - 1)
+    throw new f({
+      offset: e,
+      position: "start",
+      size: i(t)
+    });
+}
+function d(t, e, r) {
+  if (typeof e == "number" && typeof r == "number" && i(t) !== r - e)
+    throw new f({
+      offset: r,
+      position: "end",
+      size: i(t)
+    });
+}
+function u(t, e = {}) {
+  const { dir: r, size: n = 32 } = e;
+  if (n === 0)
+    return t;
+  const o = t.replace("0x", "");
+  if (o.length > n * 2)
+    throw new s({
+      size: Math.ceil(o.length / 2),
+      targetSize: n,
+      type: "Hex"
+    });
+  return `0x${o[r === "right" ? "padEnd" : "padStart"](n * 2, "0")}`;
 }
 export {
-  l as encode,
-  N as encodeAddress,
-  P as encodeArray,
-  C as encodeBoolean,
-  $ as encodeBytes,
-  M as encodeNumber,
-  W as encodeString,
-  R as encodeTuple,
-  k as getArrayComponents,
-  u as prepareParameter,
-  q as prepareParameters
+  d as assertEndOffset,
+  c as assertSize,
+  S as assertStartOffset,
+  u as pad
 };

package/dist/index305.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function r(n,a,y){let i="";if(y)for(const e of Object.entries(y)){if(!e)continue;let s="";for(const t of e[1])s+=`[${t.type}${t.name?`:${t.name}`:""}]`;i+=`(${e[0]}{${s}})`}return a?`${a}:${n}${i}`:n}const d=new Map([["address",{type:"address"}],["bool",{type:"bool"}],["bytes",{type:"bytes"}],["bytes32",{type:"bytes32"}],["int",{type:"int256"}],["int256",{type:"int256"}],["string",{type:"string"}],["uint",{type:"uint256"}],["uint8",{type:"uint8"}],["uint16",{type:"uint16"}],["uint24",{type:"uint24"}],["uint32",{type:"uint32"}],["uint64",{type:"uint64"}],["uint96",{type:"uint96"}],["uint112",{type:"uint112"}],["uint160",{type:"uint160"}],["uint192",{type:"uint192"}],["uint256",{type:"uint256"}],["address owner",{type:"address",name:"owner"}],["address to",{type:"address",name:"to"}],["bool approved",{type:"bool",name:"approved"}],["bytes _data",{type:"bytes",name:"_data"}],["bytes data",{type:"bytes",name:"data"}],["bytes signature",{type:"bytes",name:"signature"}],["bytes32 hash",{type:"bytes32",name:"hash"}],["bytes32 r",{type:"bytes32",name:"r"}],["bytes32 root",{type:"bytes32",name:"root"}],["bytes32 s",{type:"bytes32",name:"s"}],["string name",{type:"string",name:"name"}],["string symbol",{type:"string",name:"symbol"}],["string tokenURI",{type:"string",name:"tokenURI"}],["uint tokenId",{type:"uint256",name:"tokenId"}],["uint8 v",{type:"uint8",name:"v"}],["uint256 balance",{type:"uint256",name:"balance"}],["uint256 tokenId",{type:"uint256",name:"tokenId"}],["uint256 value",{type:"uint256",name:"value"}],["event:address indexed from",{type:"address",name:"from",indexed:!0}],["event:address indexed to",{type:"address",name:"to",indexed:!0}],["event:uint indexed tokenId",{type:"uint256",name:"tokenId",indexed:!0}],["event:uint256 indexed tokenId",{type:"uint256",name:"tokenId",indexed:!0}]]);exports.getParameterCacheKey=r;exports.parameterCache=d;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index314.cjs"),o=require("./index311.cjs"),n=require("./index288.cjs");function i(e,r={}){const{as:s=typeof e=="string"?"Hex":"Bytes"}=r,t=c.keccak_256(o.from(e));return s==="Bytes"?t:n.fromBytes(t)}exports.keccak256=i;

package/dist/index305.js

@@ -1,71 +1,10 @@
-function d(n, y, i) {
-  let a = "";
-  if (i)
-    for (const e of Object.entries(i)) {
-      if (!e)
-        continue;
-      let s = "";
-      for (const t of e[1])
-        s += `[${t.type}${t.name ? `:${t.name}` : ""}]`;
-      a += `(${e[0]}{${s}})`;
-    }
-  return y ? `${y}:${n}${a}` : n;
+import { keccak_256 as f } from "./index314.js";
+import { from as m } from "./index311.js";
+import { fromBytes as s } from "./index288.js";
+function p(t, o = {}) {
+  const { as: e = typeof t == "string" ? "Hex" : "Bytes" } = o, r = f(m(t));
+  return e === "Bytes" ? r : s(r);
 }
-const p = /* @__PURE__ */ new Map([
-  // Unnamed
-  ["address", { type: "address" }],
-  ["bool", { type: "bool" }],
-  ["bytes", { type: "bytes" }],
-  ["bytes32", { type: "bytes32" }],
-  ["int", { type: "int256" }],
-  ["int256", { type: "int256" }],
-  ["string", { type: "string" }],
-  ["uint", { type: "uint256" }],
-  ["uint8", { type: "uint8" }],
-  ["uint16", { type: "uint16" }],
-  ["uint24", { type: "uint24" }],
-  ["uint32", { type: "uint32" }],
-  ["uint64", { type: "uint64" }],
-  ["uint96", { type: "uint96" }],
-  ["uint112", { type: "uint112" }],
-  ["uint160", { type: "uint160" }],
-  ["uint192", { type: "uint192" }],
-  ["uint256", { type: "uint256" }],
-  // Named
-  ["address owner", { type: "address", name: "owner" }],
-  ["address to", { type: "address", name: "to" }],
-  ["bool approved", { type: "bool", name: "approved" }],
-  ["bytes _data", { type: "bytes", name: "_data" }],
-  ["bytes data", { type: "bytes", name: "data" }],
-  ["bytes signature", { type: "bytes", name: "signature" }],
-  ["bytes32 hash", { type: "bytes32", name: "hash" }],
-  ["bytes32 r", { type: "bytes32", name: "r" }],
-  ["bytes32 root", { type: "bytes32", name: "root" }],
-  ["bytes32 s", { type: "bytes32", name: "s" }],
-  ["string name", { type: "string", name: "name" }],
-  ["string symbol", { type: "string", name: "symbol" }],
-  ["string tokenURI", { type: "string", name: "tokenURI" }],
-  ["uint tokenId", { type: "uint256", name: "tokenId" }],
-  ["uint8 v", { type: "uint8", name: "v" }],
-  ["uint256 balance", { type: "uint256", name: "balance" }],
-  ["uint256 tokenId", { type: "uint256", name: "tokenId" }],
-  ["uint256 value", { type: "uint256", name: "value" }],
-  // Indexed
-  [
-    "event:address indexed from",
-    { type: "address", name: "from", indexed: !0 }
-  ],
-  ["event:address indexed to", { type: "address", name: "to", indexed: !0 }],
-  [
-    "event:uint indexed tokenId",
-    { type: "uint256", name: "tokenId", indexed: !0 }
-  ],
-  [
-    "event:uint256 indexed tokenId",
-    { type: "uint256", name: "tokenId", indexed: !0 }
-  ]
-]);
 export {
-  d as getParameterCacheKey,
-  p as parameterCache
+  p as keccak256
 };

package/dist/index306.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const tt=require("./index307.cjs"),Q=require("./index284.cjs"),a=require("./index294.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function ot(y){y.lowS!==void 0&&a.abool("lowS",y.lowS),y.prehash!==void 0&&a.abool("prehash",y.prehash)}function ct(y){const n=tt.validateBasic(y);a.validateObject(n,{a:"field",b:"field"},{allowedPrivateKeyLengths:"array",wrapPrivateKey:"boolean",isTorsionFree:"function",clearCofactor:"function",allowInfinityPoint:"boolean",fromBytes:"function",toBytes:"function"});const{endo:t,Fp:b,a:O}=n;if(t){if(!b.eql(O,b.ZERO))throw new Error("invalid endomorphism, can only be defined for Koblitz curves that have a=0");if(typeof t!="object"||typeof t.beta!="bigint"||typeof t.splitScalar!="function")throw new Error("invalid endomorphism, expected beta: bigint and splitScalar: function")}return Object.freeze({...n})}class it extends Error{constructor(n=""){super(n)}}const Y={Err:it,_tlv:{encode:(y,n)=>{const{Err:t}=Y;if(y<0||y>256)throw new t("tlv.encode: wrong tag");if(n.length&1)throw new t("tlv.encode: unpadded data");const b=n.length/2,O=a.numberToHexUnpadded(b);if(O.length/2&128)throw new t("tlv.encode: long form length too big");const Z=b>127?a.numberToHexUnpadded(O.length/2|128):"";return a.numberToHexUnpadded(y)+Z+O+n},decode(y,n){const{Err:t}=Y;let b=0;if(y<0||y>256)throw new t("tlv.encode: wrong tag");if(n.length<2||n[b++]!==y)throw new t("tlv.decode: wrong tlv");const O=n[b++],Z=!!(O&128);let x=0;if(!Z)x=O;else{const R=O&127;if(!R)throw new t("tlv.decode(long): indefinite length not supported");if(R>4)throw new t("tlv.decode(long): byte length is too big");const L=n.subarray(b,b+R);if(L.length!==R)throw new t("tlv.decode: length bytes not complete");if(L[0]===0)throw new t("tlv.decode(long): zero leftmost byte");for(const K of L)x=x<<8|K;if(b+=R,x<128)throw new t("tlv.decode(long): not minimal encoding")}const V=n.subarray(b,b+x);if(V.length!==x)throw new t("tlv.decode: wrong value length");return{v:V,l:n.subarray(b+x)}}},_int:{encode(y){const{Err:n}=Y;if(y<j)throw new n("integer: negative integers are not allowed");let t=a.numberToHexUnpadded(y);if(Number.parseInt(t[0],16)&8&&(t="00"+t),t.length&1)throw new n("unexpected DER parsing assertion: unpadded hex");return t},decode(y){const{Err:n}=Y;if(y[0]&128)throw new n("invalid signature integer: negative");if(y[0]===0&&!(y[1]&128))throw new n("invalid signature integer: unnecessary leading zero");return a.bytesToNumberBE(y)}},toSig(y){const{Err:n,_int:t,_tlv:b}=Y,O=a.ensureBytes("signature",y),{v:Z,l:x}=b.decode(48,O);if(x.length)throw new n("invalid signature: left bytes after parsing");const{v:V,l:R}=b.decode(2,Z),{v:L,l:K}=b.decode(2,R);if(K.length)throw new n("invalid signature: left bytes after parsing");return{r:t.decode(V),s:t.decode(L)}},hexFromSig(y){const{_tlv:n,_int:t}=Y,b=n.encode(2,t.encode(y.r)),O=n.encode(2,t.encode(y.s)),Z=b+O;return n.encode(48,Z)}},j=BigInt(0),T=BigInt(1);BigInt(2);const st=BigInt(3);BigInt(4);function at(y){const n=ct(y),{Fp:t}=n,b=Q.Field(n.n,n.nBitLength),O=n.toBytes||((m,e,i)=>{const c=e.toAffine();return a.concatBytes(Uint8Array.from([4]),t.toBytes(c.x),t.toBytes(c.y))}),Z=n.fromBytes||(m=>{const e=m.subarray(1),i=t.fromBytes(e.subarray(0,t.BYTES)),c=t.fromBytes(e.subarray(t.BYTES,2*t.BYTES));return{x:i,y:c}});function x(m){const{a:e,b:i}=n,c=t.sqr(m),d=t.mul(c,m);return t.add(t.add(d,t.mul(m,e)),i)}if(!t.eql(t.sqr(n.Gy),x(n.Gx)))throw new Error("bad generator point: equation left != right");function V(m){return a.inRange(m,T,n.n)}function R(m){const{allowedPrivateKeyLengths:e,nByteLength:i,wrapPrivateKey:c,n:d}=n;if(e&&typeof m!="bigint"){if(a.isBytes(m)&&(m=a.bytesToHex(m)),typeof m!="string"||!e.includes(m.length))throw new Error("invalid private key");m=m.padStart(i*2,"0")}let p;try{p=typeof m=="bigint"?m:a.bytesToNumberBE(a.ensureBytes("private key",m,i))}catch{throw new Error("invalid private key, expected hex or "+i+" bytes, got "+typeof m)}return c&&(p=Q.mod(p,d)),a.aInRange("private key",p,T,d),p}function L(m){if(!(m instanceof w))throw new Error("ProjectivePoint expected")}const K=a.memoized((m,e)=>{const{px:i,py:c,pz:d}=m;if(t.eql(d,t.ONE))return{x:i,y:c};const p=m.is0();e==null&&(e=p?t.ONE:t.inv(d));const v=t.mul(i,e),g=t.mul(c,e),l=t.mul(d,e);if(p)return{x:t.ZERO,y:t.ZERO};if(!t.eql(l,t.ONE))throw new Error("invZ was invalid");return{x:v,y:g}}),et=a.memoized(m=>{if(m.is0()){if(n.allowInfinityPoint&&!t.is0(m.py))return;throw new Error("bad point: ZERO")}const{x:e,y:i}=m.toAffine();if(!t.isValid(e)||!t.isValid(i))throw new Error("bad point: x or y not FE");const c=t.sqr(i),d=x(e);if(!t.eql(c,d))throw new Error("bad point: equation left != right");if(!m.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});class w{constructor(e,i,c){if(e==null||!t.isValid(e))throw new Error("x required");if(i==null||!t.isValid(i))throw new Error("y required");if(c==null||!t.isValid(c))throw new Error("z required");this.px=e,this.py=i,this.pz=c,Object.freeze(this)}static fromAffine(e){const{x:i,y:c}=e||{};if(!e||!t.isValid(i)||!t.isValid(c))throw new Error("invalid affine point");if(e instanceof w)throw new Error("projective point not allowed");const d=p=>t.eql(p,t.ZERO);return d(i)&&d(c)?w.ZERO:new w(i,c,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(e){const i=t.invertBatch(e.map(c=>c.pz));return e.map((c,d)=>c.toAffine(i[d])).map(w.fromAffine)}static fromHex(e){const i=w.fromAffine(Z(a.ensureBytes("pointHex",e)));return i.assertValidity(),i}static fromPrivateKey(e){return w.BASE.multiply(R(e))}static msm(e,i){return tt.pippenger(w,b,e,i)}_setWindowSize(e){C.setWindowSize(this,e)}assertValidity(){et(this)}hasEvenY(){const{y:e}=this.toAffine();if(t.isOdd)return!t.isOdd(e);throw new Error("Field doesn't support isOdd")}equals(e){L(e);const{px:i,py:c,pz:d}=this,{px:p,py:v,pz:g}=e,l=t.eql(t.mul(i,g),t.mul(p,d)),h=t.eql(t.mul(c,g),t.mul(v,d));return l&&h}negate(){return new w(this.px,t.neg(this.py),this.pz)}double(){const{a:e,b:i}=n,c=t.mul(i,st),{px:d,py:p,pz:v}=this;let g=t.ZERO,l=t.ZERO,h=t.ZERO,u=t.mul(d,d),N=t.mul(p,p),S=t.mul(v,v),B=t.mul(d,p);return B=t.add(B,B),h=t.mul(d,v),h=t.add(h,h),g=t.mul(e,h),l=t.mul(c,S),l=t.add(g,l),g=t.sub(N,l),l=t.add(N,l),l=t.mul(g,l),g=t.mul(B,g),h=t.mul(c,h),S=t.mul(e,S),B=t.sub(u,S),B=t.mul(e,B),B=t.add(B,h),h=t.add(u,u),u=t.add(h,u),u=t.add(u,S),u=t.mul(u,B),l=t.add(l,u),S=t.mul(p,v),S=t.add(S,S),u=t.mul(S,B),g=t.sub(g,u),h=t.mul(S,N),h=t.add(h,h),h=t.add(h,h),new w(g,l,h)}add(e){L(e);const{px:i,py:c,pz:d}=this,{px:p,py:v,pz:g}=e;let l=t.ZERO,h=t.ZERO,u=t.ZERO;const N=n.a,S=t.mul(n.b,st);let B=t.mul(i,p),F=t.mul(c,v),r=t.mul(d,g),o=t.add(i,c),s=t.add(p,v);o=t.mul(o,s),s=t.add(B,F),o=t.sub(o,s),s=t.add(i,d);let f=t.add(p,g);return s=t.mul(s,f),f=t.add(B,r),s=t.sub(s,f),f=t.add(c,d),l=t.add(v,g),f=t.mul(f,l),l=t.add(F,r),f=t.sub(f,l),u=t.mul(N,s),l=t.mul(S,r),u=t.add(l,u),l=t.sub(F,u),u=t.add(F,u),h=t.mul(l,u),F=t.add(B,B),F=t.add(F,B),r=t.mul(N,r),s=t.mul(S,s),F=t.add(F,r),r=t.sub(B,r),r=t.mul(N,r),s=t.add(s,r),B=t.mul(F,s),h=t.add(h,B),B=t.mul(f,s),l=t.mul(o,l),l=t.sub(l,B),B=t.mul(o,F),u=t.mul(f,u),u=t.add(u,B),new w(l,h,u)}subtract(e){return this.add(e.negate())}is0(){return this.equals(w.ZERO)}wNAF(e){return C.wNAFCached(this,e,w.normalizeZ)}multiplyUnsafe(e){const{endo:i,n:c}=n;a.aInRange("scalar",e,j,c);const d=w.ZERO;if(e===j)return d;if(this.is0()||e===T)return this;if(!i||C.hasPrecomputes(this))return C.wNAFCachedUnsafe(this,e,w.normalizeZ);let{k1neg:p,k1:v,k2neg:g,k2:l}=i.splitScalar(e),h=d,u=d,N=this;for(;v>j||l>j;)v&T&&(h=h.add(N)),l&T&&(u=u.add(N)),N=N.double(),v>>=T,l>>=T;return p&&(h=h.negate()),g&&(u=u.negate()),u=new w(t.mul(u.px,i.beta),u.py,u.pz),h.add(u)}multiply(e){const{endo:i,n:c}=n;a.aInRange("scalar",e,T,c);let d,p;if(i){const{k1neg:v,k1:g,k2neg:l,k2:h}=i.splitScalar(e);let{p:u,f:N}=this.wNAF(g),{p:S,f:B}=this.wNAF(h);u=C.constTimeNegate(v,u),S=C.constTimeNegate(l,S),S=new w(t.mul(S.px,i.beta),S.py,S.pz),d=u.add(S),p=N.add(B)}else{const{p:v,f:g}=this.wNAF(e);d=v,p=g}return w.normalizeZ([d,p])[0]}multiplyAndAddUnsafe(e,i,c){const d=w.BASE,p=(g,l)=>l===j||l===T||!g.equals(d)?g.multiplyUnsafe(l):g.multiply(l),v=p(this,i).add(p(e,c));return v.is0()?void 0:v}toAffine(e){return K(this,e)}isTorsionFree(){const{h:e,isTorsionFree:i}=n;if(e===T)return!0;if(i)return i(w,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:e,clearCofactor:i}=n;return e===T?this:i?i(w,this):this.multiplyUnsafe(n.h)}toRawBytes(e=!0){return a.abool("isCompressed",e),this.assertValidity(),O(w,this,e)}toHex(e=!0){return a.abool("isCompressed",e),a.bytesToHex(this.toRawBytes(e))}}w.BASE=new w(n.Gx,n.Gy,t.ONE),w.ZERO=new w(t.ZERO,t.ONE,t.ZERO);const M=n.nBitLength,C=tt.wNAF(w,n.endo?Math.ceil(M/2):M);return{CURVE:n,ProjectivePoint:w,normPrivateKeyToScalar:R,weierstrassEquation:x,isWithinCurveOrder:V}}function lt(y){const n=tt.validateBasic(y);return a.validateObject(n,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...n})}function ut(y){const n=lt(y),{Fp:t,n:b}=n,O=t.BYTES+1,Z=2*t.BYTES+1;function x(r){return Q.mod(r,b)}function V(r){return Q.invert(r,b)}const{ProjectivePoint:R,normPrivateKeyToScalar:L,weierstrassEquation:K,isWithinCurveOrder:et}=at({...n,toBytes(r,o,s){const f=o.toAffine(),E=t.toBytes(f.x),A=a.concatBytes;return a.abool("isCompressed",s),s?A(Uint8Array.from([o.hasEvenY()?2:3]),E):A(Uint8Array.from([4]),E,t.toBytes(f.y))},fromBytes(r){const o=r.length,s=r[0],f=r.subarray(1);if(o===O&&(s===2||s===3)){const E=a.bytesToNumberBE(f);if(!a.inRange(E,T,t.ORDER))throw new Error("Point is not on curve");const A=K(E);let z;try{z=t.sqrt(A)}catch(U){const H=U instanceof Error?": "+U.message:"";throw new Error("Point is not on curve"+H)}const q=(z&T)===T;return(s&1)===1!==q&&(z=t.neg(z)),{x:E,y:z}}else if(o===Z&&s===4){const E=t.fromBytes(f.subarray(0,t.BYTES)),A=t.fromBytes(f.subarray(t.BYTES,2*t.BYTES));return{x:E,y:A}}else{const E=O,A=Z;throw new Error("invalid Point, expected length of "+E+", or uncompressed "+A+", got "+o)}}}),w=r=>a.bytesToHex(a.numberToBytesBE(r,n.nByteLength));function M(r){const o=b>>T;return r>o}function C(r){return M(r)?x(-r):r}const m=(r,o,s)=>a.bytesToNumberBE(r.slice(o,s));class e{constructor(o,s,f){a.aInRange("r",o,T,b),a.aInRange("s",s,T,b),this.r=o,this.s=s,f!=null&&(this.recovery=f),Object.freeze(this)}static fromCompact(o){const s=n.nByteLength;return o=a.ensureBytes("compactSignature",o,s*2),new e(m(o,0,s),m(o,s,2*s))}static fromDER(o){const{r:s,s:f}=Y.toSig(a.ensureBytes("DER",o));return new e(s,f)}assertValidity(){}addRecoveryBit(o){return new e(this.r,this.s,o)}recoverPublicKey(o){const{r:s,s:f,recovery:E}=this,A=g(a.ensureBytes("msgHash",o));if(E==null||![0,1,2,3].includes(E))throw new Error("recovery id invalid");const z=E===2||E===3?s+n.n:s;if(z>=t.ORDER)throw new Error("recovery id 2 or 3 invalid");const q=E&1?"03":"02",I=R.fromHex(q+w(z)),U=V(z),H=x(-A*U),X=x(f*U),D=R.BASE.multiplyAndAddUnsafe(I,H,X);if(!D)throw new Error("point at infinify");return D.assertValidity(),D}hasHighS(){return M(this.s)}normalizeS(){return this.hasHighS()?new e(this.r,x(-this.s),this.recovery):this}toDERRawBytes(){return a.hexToBytes(this.toDERHex())}toDERHex(){return Y.hexFromSig({r:this.r,s:this.s})}toCompactRawBytes(){return a.hexToBytes(this.toCompactHex())}toCompactHex(){return w(this.r)+w(this.s)}}const i={isValidPrivateKey(r){try{return L(r),!0}catch{return!1}},normPrivateKeyToScalar:L,randomPrivateKey:()=>{const r=Q.getMinHashLength(n.n);return Q.mapHashToField(n.randomBytes(r),n.n)},precompute(r=8,o=R.BASE){return o._setWindowSize(r),o.multiply(BigInt(3)),o}};function c(r,o=!0){return R.fromPrivateKey(r).toRawBytes(o)}function d(r){const o=a.isBytes(r),s=typeof r=="string",f=(o||s)&&r.length;return o?f===O||f===Z:s?f===2*O||f===2*Z:r instanceof R}function p(r,o,s=!0){if(d(r))throw new Error("first arg must be private key");if(!d(o))throw new Error("second arg must be public key");return R.fromHex(o).multiply(L(r)).toRawBytes(s)}const v=n.bits2int||function(r){if(r.length>8192)throw new Error("input is too large");const o=a.bytesToNumberBE(r),s=r.length*8-n.nBitLength;return s>0?o>>BigInt(s):o},g=n.bits2int_modN||function(r){return x(v(r))},l=a.bitMask(n.nBitLength);function h(r){return a.aInRange("num < 2^"+n.nBitLength,r,j,l),a.numberToBytesBE(r,n.nByteLength)}function u(r,o,s=N){if(["recovered","canonical"].some(P=>P in s))throw new Error("sign() legacy options not supported");const{hash:f,randomBytes:E}=n;let{lowS:A,prehash:z,extraEntropy:q}=s;A==null&&(A=!0),r=a.ensureBytes("msgHash",r),ot(s),z&&(r=a.ensureBytes("prehashed msgHash",f(r)));const I=g(r),U=L(o),H=[h(U),h(I)];if(q!=null&&q!==!1){const P=q===!0?E(t.BYTES):q;H.push(a.ensureBytes("extraEntropy",P))}const X=a.concatBytes(...H),D=I;function nt(P){const W=v(P);if(!et(W))return;const rt=V(W),$=R.BASE.multiply(W).toAffine(),k=x($.x);if(k===j)return;const J=x(rt*x(D+k*U));if(J===j)return;let _=($.x===k?0:2)|Number($.y&T),G=J;return A&&M(J)&&(G=C(J),_^=1),new e(k,G,_)}return{seed:X,k2sig:nt}}const N={lowS:n.lowS,prehash:!1},S={lowS:n.lowS,prehash:!1};function B(r,o,s=N){const{seed:f,k2sig:E}=u(r,o,s),A=n;return a.createHmacDrbg(A.hash.outputLen,A.nByteLength,A.hmac)(f,E)}R.BASE._setWindowSize(8);function F(r,o,s,f=S){var _;const E=r;o=a.ensureBytes("msgHash",o),s=a.ensureBytes("publicKey",s);const{lowS:A,prehash:z,format:q}=f;if(ot(f),"strict"in f)throw new Error("options.strict was renamed to lowS");if(q!==void 0&&q!=="compact"&&q!=="der")throw new Error("format must be compact or der");const I=typeof E=="string"||a.isBytes(E),U=!I&&!q&&typeof E=="object"&&E!==null&&typeof E.r=="bigint"&&typeof E.s=="bigint";if(!I&&!U)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let H,X;try{if(U&&(H=new e(E.r,E.s)),I){try{q!=="compact"&&(H=e.fromDER(E))}catch(G){if(!(G instanceof Y.Err))throw G}!H&&q!=="der"&&(H=e.fromCompact(E))}X=R.fromHex(s)}catch{return!1}if(!H||A&&H.hasHighS())return!1;z&&(o=n.hash(o));const{r:D,s:nt}=H,P=g(o),W=V(nt),rt=x(P*W),$=x(D*W),k=(_=R.BASE.multiplyAndAddUnsafe(X,rt,$))==null?void 0:_.toAffine();return k?x(k.x)===D:!1}return{CURVE:n,getPublicKey:c,getSharedSecret:p,sign:B,verify:F,ProjectivePoint:R,Signature:e,utils:i}}exports.DER=Y;exports.DERErr=it;exports.weierstrass=ut;exports.weierstrassPoints=at;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index307.cjs"),a=require("./index302.cjs");function d(r){let i=!0,t="",e=0,n="",o=!1;for(let s=0;s<r.length;s++){const u=r[s];if(["(",")",","].includes(u)&&(i=!0),u==="("&&e++,u===")"&&e--,!!i){if(e===0){if(u===" "&&["event","function","error",""].includes(n))n="";else if(n+=u,u===")"){o=!0;break}continue}if(u===" "){r[s-1]!==","&&t!==","&&t!==",("&&(t="",i=!1);continue}n+=u,t+=u}}if(!o)throw new a.BaseError("Unable to normalize signature.");return n}function l(r,i){const t=typeof r,e=i.type;switch(e){case"address":return c.validate(r,{strict:!1});case"bool":return t==="boolean";case"function":return t==="string";case"string":return t==="string";default:return e==="tuple"&&"components"in i?Object.values(i.components).every((n,o)=>l(Object.values(r)[o],n)):/^u?int(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/.test(e)?t==="number"||t==="bigint":/^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/.test(e)?t==="string"||r instanceof Uint8Array:/[a-z]+[1-9]{0,3}(\[[0-9]{0,}\])+$/.test(e)?Array.isArray(r)&&r.every(n=>l(n,{...i,type:e.replace(/(\[[0-9]{0,}\])$/,"")})):!1}}function f(r,i,t){for(const e in r){const n=r[e],o=i[e];if(n.type==="tuple"&&o.type==="tuple"&&"components"in n&&"components"in o)return f(n.components,o.components,t[e]);const s=[n.type,o.type];if(s.includes("address")&&s.includes("bytes20")?!0:s.includes("address")&&s.includes("string")?c.validate(t[e],{strict:!1}):s.includes("address")&&s.includes("bytes")?c.validate(t[e],{strict:!1}):!1)return s}}exports.getAmbiguousTypes=f;exports.isArgOfType=l;exports.normalizeSignature=d;