@gardenfi/utils 2.1.2 → 2.1.3-beta.2

package/dist/index291.js

@@ -0,0 +1,158 @@
+import { BaseError as o } from "./index300.js";
+import { stringify as b } from "./index301.js";
+import { pad as d, assertEndOffset as m, assertSize as g, assertStartOffset as p } from "./index302.js";
+const $ = /* @__PURE__ */ new TextEncoder(), h = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
+function y(t, e = {}) {
+  const { strict: r = !1 } = e;
+  if (!t)
+    throw new f(t);
+  if (typeof t != "string")
+    throw new f(t);
+  if (r && !/^0x[0-9a-fA-F]*$/.test(t))
+    throw new l(t);
+  if (!t.startsWith("0x"))
+    throw new l(t);
+}
+function B(...t) {
+  return `0x${t.reduce((e, r) => e + r.replace("0x", ""), "")}`;
+}
+function P(t, e = {}) {
+  const r = `0x${Number(t)}`;
+  return typeof e.size == "number" ? (g(r, e.size), x(r, e.size)) : r;
+}
+function w(t, e = {}) {
+  let r = "";
+  for (let i = 0; i < t.length; i++)
+    r += h[t[i]];
+  const n = `0x${r}`;
+  return typeof e.size == "number" ? (g(n, e.size), E(n, e.size)) : n;
+}
+function V(t, e = {}) {
+  const { signed: r, size: n } = e, i = BigInt(t);
+  let s;
+  n ? r ? s = (1n << BigInt(n) * 8n - 1n) - 1n : s = 2n ** (BigInt(n) * 8n) - 1n : typeof t == "number" && (s = BigInt(Number.MAX_SAFE_INTEGER));
+  const u = typeof s == "bigint" && r ? -s - 1n : 0;
+  if (s && i > s || i < u) {
+    const a = typeof t == "bigint" ? "n" : "";
+    throw new O({
+      max: s ? `${s}${a}` : void 0,
+      min: `${u}${a}`,
+      signed: r,
+      size: n,
+      value: `${t}${a}`
+    });
+  }
+  const c = `0x${(r && i < 0 ? (1n << BigInt(n * 8)) + BigInt(i) : i).toString(16)}`;
+  return n ? x(c, n) : c;
+}
+function j(t, e = {}) {
+  return w($.encode(t), e);
+}
+function x(t, e) {
+  return d(t, { dir: "left", size: e });
+}
+function E(t, e) {
+  return d(t, { dir: "right", size: e });
+}
+function v(t, e, r, n = {}) {
+  const { strict: i } = n;
+  p(t, e);
+  const s = `0x${t.replace("0x", "").slice((e ?? 0) * 2, (r ?? t.length) * 2)}`;
+  return i && m(s, e, r), s;
+}
+function A(t) {
+  return Math.ceil((t.length - 2) / 2);
+}
+function N(t, e = {}) {
+  const { strict: r = !1 } = e;
+  try {
+    return y(t, { strict: r }), !0;
+  } catch {
+    return !1;
+  }
+}
+class O extends o {
+  constructor({ max: e, min: r, signed: n, size: i, value: s }) {
+    super(`Number \`${s}\` is not in safe${i ? ` ${i * 8}-bit` : ""}${n ? " signed" : " unsigned"} integer range ${e ? `(\`${r}\` to \`${e}\`)` : `(above \`${r}\`)`}`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Hex.IntegerOutOfRangeError"
+    });
+  }
+}
+class f extends o {
+  constructor(e) {
+    super(`Value \`${typeof e == "object" ? b(e) : e}\` of type \`${typeof e}\` is an invalid hex type.`, {
+      metaMessages: ['Hex types must be represented as `"0x${string}"`.']
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Hex.InvalidHexTypeError"
+    });
+  }
+}
+class l extends o {
+  constructor(e) {
+    super(`Value \`${e}\` is an invalid hex value.`, {
+      metaMessages: [
+        'Hex values must start with `"0x"` and contain only hexadecimal characters (0-9, a-f, A-F).'
+      ]
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Hex.InvalidHexValueError"
+    });
+  }
+}
+class _ extends o {
+  constructor({ givenSize: e, maxSize: r }) {
+    super(`Size cannot exceed \`${r}\` bytes. Given size: \`${e}\` bytes.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Hex.SizeOverflowError"
+    });
+  }
+}
+class M extends o {
+  constructor({ offset: e, position: r, size: n }) {
+    super(`Slice ${r === "start" ? "starting" : "ending"} at offset \`${e}\` is out-of-bounds (size: \`${n}\`).`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Hex.SliceOffsetOutOfBoundsError"
+    });
+  }
+}
+class R extends o {
+  constructor({ size: e, targetSize: r, type: n }) {
+    super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${e}\`) exceeds padding size (\`${r}\`).`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Hex.SizeExceedsPaddingSizeError"
+    });
+  }
+}
+export {
+  O as IntegerOutOfRangeError,
+  f as InvalidHexTypeError,
+  l as InvalidHexValueError,
+  R as SizeExceedsPaddingSizeError,
+  _ as SizeOverflowError,
+  M as SliceOffsetOutOfBoundsError,
+  y as assert,
+  B as concat,
+  P as fromBoolean,
+  w as fromBytes,
+  V as fromNumber,
+  j as fromString,
+  x as padLeft,
+  E as padRight,
+  A as size,
+  v as slice,
+  N as validate
+};

package/dist/index292.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index291.cjs");function r(e){return{address:e.address,amount:o.fromNumber(e.amount),index:o.fromNumber(e.index),validatorIndex:o.fromNumber(e.validatorIndex)}}exports.toRpc=r;

package/dist/index292.js

@@ -0,0 +1,12 @@
+import { fromNumber as e } from "./index291.js";
+function r(o) {
+  return {
+    address: o.address,
+    amount: e(o.amount),
+    index: e(o.index),
+    validatorIndex: e(o.validatorIndex)
+  };
+}
+export {
+  r as toRpc
+};

package/dist/index293.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const b=require("./index300.cjs"),$=require("./index303.cjs"),g=require("./index291.cjs"),c=require("./index304.cjs"),y=require("./index267.cjs"),h=require("./index260.cjs");function I(t,r={}){const{prepare:i=!0}=r,n=Array.isArray(t)||typeof t=="string"?y.parseAbiItem(t):t;return{...n,...i?{hash:o(n)}:{}}}function q(t,r,i){const{args:n=[],prepare:a=!0}=i??{},v=g.validate(r,{strict:!1}),s=t.filter(e=>v?e.type==="function"||e.type==="error"?A(e)===g.slice(r,0,4):e.type==="event"?o(e)===r:!1:"name"in e&&e.name===r);if(s.length===0)throw new l({name:r});if(s.length===1)return{...s[0],...a?{hash:o(s[0])}:{}};let u;for(const e of s){if(!("inputs"in e))continue;if(!n||n.length===0){if(!e.inputs||e.inputs.length===0)return{...e,...a?{hash:o(e)}:{}};continue}if(!e.inputs||e.inputs.length===0||e.inputs.length!==n.length)continue;if(n.every((f,E)=>{const d="inputs"in e&&e.inputs[E];return d?c.isArgOfType(f,d):!1})){if(u&&"inputs"in u&&u.inputs){const f=c.getAmbiguousTypes(e.inputs,u.inputs,n);if(f)throw new w({abiItem:e,type:f[0]},{abiItem:u,type:f[1]})}u=e}}const p=(()=>{if(u)return u;const[e,...m]=s;return{...e,overloads:m}})();if(!p)throw new l({name:r});return{...p,...a?{hash:o(p)}:{}}}function A(t){return g.slice(o(t),0,4)}function S(t){const r=typeof t=="string"?t:h.formatAbiItem(t);return c.normalizeSignature(r)}function o(t){return typeof t!="string"&&"hash"in t&&t.hash?t.hash:$.keccak256(g.fromString(S(t)))}class w extends b.BaseError{constructor(r,i){super("Found ambiguous types in overloaded ABI Items.",{metaMessages:[`\`${r.type}\` in \`${c.normalizeSignature(h.formatAbiItem(r.abiItem))}\`, and`,`\`${i.type}\` in \`${c.normalizeSignature(h.formatAbiItem(i.abiItem))}\``,"","These types encode differently and cannot be distinguished at runtime.","Remove one of the ambiguous items in the ABI."]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiItem.AmbiguityError"})}}class l extends b.BaseError{constructor({name:r,data:i,type:n="item"}){const a=r?` with name "${r}"`:i?` with data "${i}"`:"";super(`ABI ${n}${a} not found.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiItem.NotFoundError"})}}exports.AmbiguityError=w;exports.NotFoundError=l;exports.from=I;exports.fromAbi=q;exports.getSelector=A;exports.getSignature=S;exports.getSignatureHash=o;

package/dist/index293.js

@@ -0,0 +1,116 @@
+import { BaseError as y } from "./index300.js";
+import { keccak256 as v } from "./index303.js";
+import { validate as $, slice as A, fromString as S } from "./index291.js";
+import { isArgOfType as E, normalizeSignature as p, getAmbiguousTypes as B } from "./index304.js";
+import { parseAbiItem as l } from "./index267.js";
+import { formatAbiItem as h } from "./index260.js";
+function H(e, r = {}) {
+  const { prepare: i = !0 } = r, n = Array.isArray(e) ? l(e) : typeof e == "string" ? l(e) : e;
+  return {
+    ...n,
+    ...i ? { hash: s(n) } : {}
+  };
+}
+function M(e, r, i) {
+  const { args: n = [], prepare: f = !0 } = i ?? {}, b = $(r, { strict: !1 }), u = e.filter((t) => b ? t.type === "function" || t.type === "error" ? T(t) === A(r, 0, 4) : t.type === "event" ? s(t) === r : !1 : "name" in t && t.name === r);
+  if (u.length === 0)
+    throw new d({ name: r });
+  if (u.length === 1)
+    return {
+      ...u[0],
+      ...f ? { hash: s(u[0]) } : {}
+    };
+  let o;
+  for (const t of u) {
+    if (!("inputs" in t))
+      continue;
+    if (!n || n.length === 0) {
+      if (!t.inputs || t.inputs.length === 0)
+        return {
+          ...t,
+          ...f ? { hash: s(t) } : {}
+        };
+      continue;
+    }
+    if (!t.inputs || t.inputs.length === 0 || t.inputs.length !== n.length)
+      continue;
+    if (n.every((a, w) => {
+      const g = "inputs" in t && t.inputs[w];
+      return g ? E(a, g) : !1;
+    })) {
+      if (o && "inputs" in o && o.inputs) {
+        const a = B(t.inputs, o.inputs, n);
+        if (a)
+          throw new O({
+            abiItem: t,
+            type: a[0]
+          }, {
+            abiItem: o,
+            type: a[1]
+          });
+      }
+      o = t;
+    }
+  }
+  const c = (() => {
+    if (o)
+      return o;
+    const [t, ...m] = u;
+    return { ...t, overloads: m };
+  })();
+  if (!c)
+    throw new d({ name: r });
+  return {
+    ...c,
+    ...f ? { hash: s(c) } : {}
+  };
+}
+function T(e) {
+  return A(s(e), 0, 4);
+}
+function F(e) {
+  const r = typeof e == "string" ? e : h(e);
+  return p(r);
+}
+function s(e) {
+  return typeof e != "string" && "hash" in e && e.hash ? e.hash : v(S(F(e)));
+}
+class O extends y {
+  constructor(r, i) {
+    super("Found ambiguous types in overloaded ABI Items.", {
+      metaMessages: [
+        // TODO: abitype to add support for signature-formatted ABI items.
+        `\`${r.type}\` in \`${p(h(r.abiItem))}\`, and`,
+        `\`${i.type}\` in \`${p(h(i.abiItem))}\``,
+        "",
+        "These types encode differently and cannot be distinguished at runtime.",
+        "Remove one of the ambiguous items in the ABI."
+      ]
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiItem.AmbiguityError"
+    });
+  }
+}
+class d extends y {
+  constructor({ name: r, data: i, type: n = "item" }) {
+    const f = r ? ` with name "${r}"` : i ? ` with data "${i}"` : "";
+    super(`ABI ${n}${f} not found.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiItem.NotFoundError"
+    });
+  }
+}
+export {
+  O as AmbiguityError,
+  d as NotFoundError,
+  H as from,
+  M as fromAbi,
+  T as getSelector,
+  F as getSignature,
+  s as getSignatureHash
+};

package/dist/index294.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const x=require("./index305.cjs"),d=require("./index300.cjs"),a=require("./index291.cjs"),g=require("./index306.cjs"),p=require("./index307.cjs");function P(n,e,t){const{checksumAddress:r=!1}={};if(n.length!==e.length)throw new m({expectedLength:n.length,givenLength:e.length});const s=p.prepareParameters({checksumAddress:r,parameters:n,values:e}),o=p.encode(s);return o.length===0?"0x":o}function l(n,e){if(n.length!==e.length)throw new m({expectedLength:n.length,givenLength:e.length});const t=[];for(let r=0;r<n.length;r++){const s=n[r],o=e[r];t.push(l.encode(s,o))}return a.concat(...t)}(function(n){function e(t,r,s=!1){if(t==="address"){const c=r;return x.assert(c),a.padLeft(c.toLowerCase(),s?32:0)}if(t==="string")return a.fromString(r);if(t==="bytes")return r;if(t==="bool")return a.padLeft(a.fromBoolean(r),s?32:1);const o=t.match(g.integerRegex);if(o){const[c,i,u="256"]=o,h=Number.parseInt(u)/8;return a.fromNumber(r,{size:s?32:h,signed:i==="int"})}const b=t.match(g.bytesRegex);if(b){const[c,i]=b;if(Number.parseInt(i)!==(r.length-2)/2)throw new y({expectedSize:Number.parseInt(i),value:r});return a.padRight(r,s?32:0)}const f=t.match(g.arrayRegex);if(f&&Array.isArray(r)){const[c,i]=f,u=[];for(let h=0;h<r.length;h++)u.push(e(i,r[h],!0));return u.length===0?"0x":a.concat(...u)}throw new E(t)}n.encode=e})(l||(l={}));class A extends d.BaseError{constructor({expectedLength:e,givenLength:t,type:r}){super(`Array length mismatch for type \`${r}\`. Expected: \`${e}\`. Given: \`${t}\`.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.ArrayLengthMismatchError"})}}class y extends d.BaseError{constructor({expectedSize:e,value:t}){super(`Size of bytes "${t}" (bytes${a.size(t)}) does not match expected size (bytes${e}).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.BytesSizeMismatchError"})}}class m extends d.BaseError{constructor({expectedLength:e,givenLength:t}){super(["ABI encoding parameters/values length mismatch.",`Expected length (parameters): ${e}`,`Given length (values): ${t}`].join(`
+`)),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.LengthMismatchError"})}}class w extends d.BaseError{constructor(e){super(`Value \`${e}\` is not a valid array.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.InvalidArrayError"})}}class E extends d.BaseError{constructor(e){super(`Type \`${e}\` is not a valid ABI Type.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.InvalidTypeError"})}}exports.ArrayLengthMismatchError=A;exports.BytesSizeMismatchError=y;exports.InvalidArrayError=w;exports.InvalidTypeError=E;exports.LengthMismatchError=m;exports.encode=P;exports.encodePacked=l;

package/dist/index294.js

@@ -0,0 +1,137 @@
+import { assert as p } from "./index305.js";
+import { BaseError as u } from "./index300.js";
+import { size as y, padLeft as f, fromString as x, fromBoolean as w, fromNumber as E, padRight as P, concat as g } from "./index291.js";
+import { integerRegex as A, bytesRegex as $, arrayRegex as L } from "./index306.js";
+import { prepareParameters as z, encode as I } from "./index307.js";
+function N(n, e, t) {
+  const { checksumAddress: r = !1 } = {};
+  if (n.length !== e.length)
+    throw new b({
+      expectedLength: n.length,
+      givenLength: e.length
+    });
+  const a = z({
+    checksumAddress: r,
+    parameters: n,
+    values: e
+  }), s = I(a);
+  return s.length === 0 ? "0x" : s;
+}
+function m(n, e) {
+  if (n.length !== e.length)
+    throw new b({
+      expectedLength: n.length,
+      givenLength: e.length
+    });
+  const t = [];
+  for (let r = 0; r < n.length; r++) {
+    const a = n[r], s = e[r];
+    t.push(m.encode(a, s));
+  }
+  return g(...t);
+}
+(function(n) {
+  function e(t, r, a = !1) {
+    if (t === "address") {
+      const i = r;
+      return p(i), f(i.toLowerCase(), a ? 32 : 0);
+    }
+    if (t === "string")
+      return x(r);
+    if (t === "bytes")
+      return r;
+    if (t === "bool")
+      return f(w(r), a ? 32 : 1);
+    const s = t.match(A);
+    if (s) {
+      const [i, o, c = "256"] = s, h = Number.parseInt(c) / 8;
+      return E(r, {
+        size: a ? 32 : h,
+        signed: o === "int"
+      });
+    }
+    const d = t.match($);
+    if (d) {
+      const [i, o] = d;
+      if (Number.parseInt(o) !== (r.length - 2) / 2)
+        throw new M({
+          expectedSize: Number.parseInt(o),
+          value: r
+        });
+      return P(r, a ? 32 : 0);
+    }
+    const l = t.match(L);
+    if (l && Array.isArray(r)) {
+      const [i, o] = l, c = [];
+      for (let h = 0; h < r.length; h++)
+        c.push(e(o, r[h], !0));
+      return c.length === 0 ? "0x" : g(...c);
+    }
+    throw new j(t);
+  }
+  n.encode = e;
+})(m || (m = {}));
+class R extends u {
+  constructor({ expectedLength: e, givenLength: t, type: r }) {
+    super(`Array length mismatch for type \`${r}\`. Expected: \`${e}\`. Given: \`${t}\`.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.ArrayLengthMismatchError"
+    });
+  }
+}
+class M extends u {
+  constructor({ expectedSize: e, value: t }) {
+    super(`Size of bytes "${t}" (bytes${y(t)}) does not match expected size (bytes${e}).`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.BytesSizeMismatchError"
+    });
+  }
+}
+class b extends u {
+  constructor({ expectedLength: e, givenLength: t }) {
+    super([
+      "ABI encoding parameters/values length mismatch.",
+      `Expected length (parameters): ${e}`,
+      `Given length (values): ${t}`
+    ].join(`
+`)), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.LengthMismatchError"
+    });
+  }
+}
+class _ extends u {
+  constructor(e) {
+    super(`Value \`${e}\` is not a valid array.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.InvalidArrayError"
+    });
+  }
+}
+class j extends u {
+  constructor(e) {
+    super(`Type \`${e}\` is not a valid ABI Type.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiParameters.InvalidTypeError"
+    });
+  }
+}
+export {
+  R as ArrayLengthMismatchError,
+  M as BytesSizeMismatchError,
+  _ as InvalidArrayError,
+  j as InvalidTypeError,
+  b as LengthMismatchError,
+  N as encode,
+  m as encodePacked
+};

package/dist/index295.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index38.cjs");class t extends a.BaseError{constructor(e){const{docsPath:s,field:r,metaMessages:i}=e;super(`Invalid Sign-In with Ethereum message field "${r}".`,{docsPath:s,metaMessages:i,name:"SiweInvalidMessageFieldError"})}}exports.SiweInvalidMessageFieldError=t;

package/dist/index295.js

@@ -0,0 +1,14 @@
+import { BaseError as i } from "./index38.js";
+class d extends i {
+  constructor(e) {
+    const { docsPath: s, field: r, metaMessages: a } = e;
+    super(`Invalid Sign-In with Ethereum message field "${r}".`, {
+      docsPath: s,
+      metaMessages: a,
+      name: "SiweInvalidMessageFieldError"
+    });
+  }
+}
+export {
+  d as SiweInvalidMessageFieldError
+};

package/dist/index296.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function o(e){if(/[^a-z0-9\:\/\?\#\[\]\@\!\$\&\'\(\)\*\+\,\;\=\.\-\_\~\%]/i.test(e)||/%[^0-9a-f]/i.test(e)||/%[0-9a-f](:?[^0-9a-f]|$)/i.test(e))return!1;const s=a(e),f=s[1],t=s[2],i=s[3],r=s[4],l=s[5];if(!(f!=null&&f.length&&i.length>=0))return!1;if(t!=null&&t.length){if(!(i.length===0||/^\//.test(i)))return!1}else if(/^\/\//.test(i))return!1;if(!/^[a-z][a-z0-9\+\-\.]*$/.test(f.toLowerCase()))return!1;let n="";return n+=`${f}:`,t!=null&&t.length&&(n+=`//${t}`),n+=i,r!=null&&r.length&&(n+=`?${r}`),l!=null&&l.length&&(n+=`#${l}`),n}function a(e){return e.match(/(?:([^:\/?#]+):)?(?:\/\/([^\/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?/)}exports.isUri=o;

package/dist/index296.js

@@ -0,0 +1,22 @@
+function o(e) {
+  if (/[^a-z0-9\:\/\?\#\[\]\@\!\$\&\'\(\)\*\+\,\;\=\.\-\_\~\%]/i.test(e) || /%[^0-9a-f]/i.test(e) || /%[0-9a-f](:?[^0-9a-f]|$)/i.test(e))
+    return !1;
+  const s = a(e), f = s[1], t = s[2], i = s[3], r = s[4], l = s[5];
+  if (!(f != null && f.length && i.length >= 0))
+    return !1;
+  if (t != null && t.length) {
+    if (!(i.length === 0 || /^\//.test(i)))
+      return !1;
+  } else if (/^\/\//.test(i))
+    return !1;
+  if (!/^[a-z][a-z0-9\+\-\.]*$/.test(f.toLowerCase()))
+    return !1;
+  let n = "";
+  return n += `${f}:`, t != null && t.length && (n += `//${t}`), n += i, r != null && r.length && (n += `?${r}`), l != null && l.length && (n += `#${l}`), n;
+}
+function a(e) {
+  return e.match(/(?:([^:\/?#]+):)?(?:\/\/([^\/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?/);
+}
+export {
+  o as isUri
+};

package/dist/index297.cjs

@@ -0,0 +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;

package/dist/index297.js

@@ -0,0 +1,71 @@
+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;
+}
+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
+};

package/dist/index298.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const tt=require("./index299.cjs"),Q=require("./index278.cjs"),a=require("./index288.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;