@ozdao/prometheus-framework 0.2.129 → 0.2.132

package/dist/node_modules/@noble/hashes/esm/_sha2.js

@@ -1,61 +0,0 @@
-import { exists as g, output as b } from "./_assert.js";
-import { Hash as d, createView as p, toBytes as a } from "./utils.js";
-function w(u, t, n, e) {
-  if (typeof u.setBigUint64 == "function")
-    return u.setBigUint64(t, n, e);
-  const i = BigInt(32), o = BigInt(4294967295), s = Number(n >> i & o), h = Number(n & o), f = e ? 4 : 0, c = e ? 0 : 4;
-  u.setUint32(t + f, s, e), u.setUint32(t + c, h, e);
-}
-class B extends d {
-  constructor(t, n, e, i) {
-    super(), this.blockLen = t, this.outputLen = n, this.padOffset = e, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = p(this.buffer);
-  }
-  update(t) {
-    g(this);
-    const { view: n, buffer: e, blockLen: i } = this;
-    t = a(t);
-    const o = t.length;
-    for (let s = 0; s < o; ) {
-      const h = Math.min(i - this.pos, o - s);
-      if (h === i) {
-        const f = p(t);
-        for (; i <= o - s; s += i)
-          this.process(f, s);
-        continue;
-      }
-      e.set(t.subarray(s, s + h), this.pos), this.pos += h, s += h, this.pos === i && (this.process(n, 0), this.pos = 0);
-    }
-    return this.length += t.length, this.roundClean(), this;
-  }
-  digestInto(t) {
-    g(this), b(t, this), this.finished = !0;
-    const { buffer: n, view: e, blockLen: i, isLE: o } = this;
-    let { pos: s } = this;
-    n[s++] = 128, this.buffer.subarray(s).fill(0), this.padOffset > i - s && (this.process(e, 0), s = 0);
-    for (let r = s; r < i; r++)
-      n[r] = 0;
-    w(e, i - 8, BigInt(this.length * 8), o), this.process(e, 0);
-    const h = p(t), f = this.outputLen;
-    if (f % 4)
-      throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const c = f / 4, l = this.get();
-    if (c > l.length)
-      throw new Error("_sha2: outputLen bigger than state");
-    for (let r = 0; r < c; r++)
-      h.setUint32(4 * r, l[r], o);
-  }
-  digest() {
-    const { buffer: t, outputLen: n } = this;
-    this.digestInto(t);
-    const e = t.slice(0, n);
-    return this.destroy(), e;
-  }
-  _cloneInto(t) {
-    t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: n, buffer: e, length: i, finished: o, destroyed: s, pos: h } = this;
-    return t.length = i, t.pos = h, t.finished = o, t.destroyed = s, i % n && t.buffer.set(e), t;
-  }
-}
-export {
-  B as SHA2
-};

package/dist/node_modules/@noble/hashes/esm/_u64.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=BigInt(2**32-1),i=BigInt(32);function u(t,e=!1){return e?{h:Number(t&n),l:Number(t>>i&n)}:{h:Number(t>>i&n)|0,l:Number(t&n)|0}}function g(t,e=!1){let r=new Uint32Array(t.length),l=new Uint32Array(t.length);for(let o=0;o<t.length;o++){const{h:c,l:f}=u(t[o],e);[r[o],l[o]]=[c,f]}return[r,l]}const B=(t,e,r)=>t<<r|e>>>32-r,h=(t,e,r)=>e<<r|t>>>32-r,m=(t,e,r)=>e<<r-32|t>>>64-r,S=(t,e,r)=>t<<r-32|e>>>64-r;exports.fromBig=u;exports.rotlBH=m;exports.rotlBL=S;exports.rotlSH=B;exports.rotlSL=h;exports.split=g;

package/dist/node_modules/@noble/hashes/esm/_u64.js

@@ -1,21 +0,0 @@
-const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
-function f(t, r = !1) {
-  return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
-}
-function h(t, r = !1) {
-  let n = new Uint32Array(t.length), l = new Uint32Array(t.length);
-  for (let e = 0; e < t.length; e++) {
-    const { h: c, l: u } = f(t[e], r);
-    [n[e], l[e]] = [c, u];
-  }
-  return [n, l];
-}
-const g = (t, r, n) => t << n | r >>> 32 - n, m = (t, r, n) => r << n | t >>> 32 - n, A = (t, r, n) => r << n - 32 | t >>> 64 - n, B = (t, r, n) => t << n - 32 | r >>> 64 - n;
-export {
-  f as fromBig,
-  A as rotlBH,
-  B as rotlBL,
-  g as rotlSH,
-  m as rotlSL,
-  h as split
-};

package/dist/node_modules/@noble/hashes/esm/crypto.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=typeof globalThis=="object"&&"crypto"in globalThis?globalThis.crypto:void 0;exports.crypto=o;

package/dist/node_modules/@noble/hashes/esm/crypto.js

@@ -1,4 +0,0 @@
-const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
-export {
-  o as crypto
-};

package/dist/node_modules/@noble/hashes/esm/hmac.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./_assert.cjs"),c=require("./utils.cjs");class r extends c.Hash{constructor(t,i){super(),this.finished=!1,this.destroyed=!1,a.hash(t);const h=c.toBytes(i);if(this.iHash=t.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const o=this.blockLen,e=new Uint8Array(o);e.set(h.length>o?t.create().update(h).digest():h);for(let s=0;s<e.length;s++)e[s]^=54;this.iHash.update(e),this.oHash=t.create();for(let s=0;s<e.length;s++)e[s]^=106;this.oHash.update(e),e.fill(0)}update(t){return a.exists(this),this.iHash.update(t),this}digestInto(t){a.exists(this),a.bytes(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:i,iHash:h,finished:o,destroyed:e,blockLen:s,outputLen:u}=this;return t=t,t.finished=o,t.destroyed=e,t.blockLen=s,t.outputLen=u,t.oHash=i._cloneInto(t.oHash),t.iHash=h._cloneInto(t.iHash),t}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const d=(n,t,i)=>new r(n,t).update(i).digest();d.create=(n,t)=>new r(n,t);exports.HMAC=r;exports.hmac=d;

package/dist/node_modules/@noble/hashes/esm/hmac.js

@@ -1,43 +0,0 @@
-import { hash as c, exists as a, bytes as u } from "./_assert.js";
-import { Hash as H, toBytes as p } from "./utils.js";
-class r extends H {
-  constructor(t, i) {
-    super(), this.finished = !1, this.destroyed = !1, c(t);
-    const h = p(i);
-    if (this.iHash = t.create(), typeof this.iHash.update != "function")
-      throw new Error("Expected instance of class which extends utils.Hash");
-    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
-    const o = this.blockLen, e = new Uint8Array(o);
-    e.set(h.length > o ? t.create().update(h).digest() : h);
-    for (let s = 0; s < e.length; s++)
-      e[s] ^= 54;
-    this.iHash.update(e), this.oHash = t.create();
-    for (let s = 0; s < e.length; s++)
-      e[s] ^= 106;
-    this.oHash.update(e), e.fill(0);
-  }
-  update(t) {
-    return a(this), this.iHash.update(t), this;
-  }
-  digestInto(t) {
-    a(this), u(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
-  }
-  digest() {
-    const t = new Uint8Array(this.oHash.outputLen);
-    return this.digestInto(t), t;
-  }
-  _cloneInto(t) {
-    t || (t = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: i, iHash: h, finished: o, destroyed: e, blockLen: s, outputLen: d } = this;
-    return t = t, t.finished = o, t.destroyed = e, t.blockLen = s, t.outputLen = d, t.oHash = i._cloneInto(t.oHash), t.iHash = h._cloneInto(t.iHash), t;
-  }
-  destroy() {
-    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
-  }
-}
-const l = (n, t, i) => new r(n, t).update(i).digest();
-l.create = (n, t) => new r(n, t);
-export {
-  r as HMAC,
-  l as hmac
-};

package/dist/node_modules/@noble/hashes/esm/pbkdf2.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const k=require("./_assert.cjs"),g=require("./hmac.cjs"),w=require("./utils.cjs");function m(n,c,u,o){k.hash(n);const i=w.checkOpts({dkLen:32,asyncTick:10},o),{c:a,dkLen:r,asyncTick:t}=i;if(k.number(a),k.number(r),k.number(t),a<1)throw new Error("PBKDF2: iterations (c) should be >= 1");const l=w.toBytes(c),s=w.toBytes(u),d=new Uint8Array(r),p=g.hmac.create(n,l),e=p._cloneInto().update(s);return{c:a,dkLen:r,asyncTick:t,DK:d,PRF:p,PRFSalt:e}}function L(n,c,u,o,i){return n.destroy(),c.destroy(),o&&o.destroy(),i.fill(0),u}function P(n,c,u,o){const{c:i,dkLen:a,DK:r,PRF:t,PRFSalt:l}=m(n,c,u,o);let s;const d=new Uint8Array(4),p=w.createView(d),e=new Uint8Array(t.outputLen);for(let h=1,f=0;f<a;h++,f+=t.outputLen){const y=r.subarray(f,f+t.outputLen);p.setInt32(0,h,!1),(s=l._cloneInto(s)).update(d).digestInto(e),y.set(e.subarray(0,y.length));for(let I=1;I<i;I++){t._cloneInto(s).update(e).digestInto(e);for(let b=0;b<y.length;b++)y[b]^=e[b]}}return L(t,l,r,s,e)}exports.pbkdf2=P;

package/dist/node_modules/@noble/hashes/esm/pbkdf2.js

@@ -1,32 +0,0 @@
-import { hash as h, number as m } from "./_assert.js";
-import { hmac as L } from "./hmac.js";
-import { createView as F, checkOpts as P, toBytes as I } from "./utils.js";
-function g(o, c, i, e) {
-  h(o);
-  const u = P({ dkLen: 32, asyncTick: 10 }, e), { c: a, dkLen: r, asyncTick: t } = u;
-  if (m(a), m(r), m(t), a < 1)
-    throw new Error("PBKDF2: iterations (c) should be >= 1");
-  const p = I(c), s = I(i), d = new Uint8Array(r), f = L.create(o, p), n = f._cloneInto().update(s);
-  return { c: a, dkLen: r, asyncTick: t, DK: d, PRF: f, PRFSalt: n };
-}
-function R(o, c, i, e, u) {
-  return o.destroy(), c.destroy(), e && e.destroy(), u.fill(0), i;
-}
-function T(o, c, i, e) {
-  const { c: u, dkLen: a, DK: r, PRF: t, PRFSalt: p } = g(o, c, i, e);
-  let s;
-  const d = new Uint8Array(4), f = F(d), n = new Uint8Array(t.outputLen);
-  for (let w = 1, l = 0; l < a; w++, l += t.outputLen) {
-    const y = r.subarray(l, l + t.outputLen);
-    f.setInt32(0, w, !1), (s = p._cloneInto(s)).update(d).digestInto(n), y.set(n.subarray(0, y.length));
-    for (let b = 1; b < u; b++) {
-      t._cloneInto(s).update(n).digestInto(n);
-      for (let k = 0; k < y.length; k++)
-        y[k] ^= n[k];
-    }
-  }
-  return R(t, p, r, s, n);
-}
-export {
-  T as pbkdf2
-};

package/dist/node_modules/@noble/hashes/esm/scrypt.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const X=require("./_assert.cjs"),J=require("./sha256.cjs"),K=require("./pbkdf2.cjs"),D=require("./utils.cjs"),r=(t,n)=>t<<n|t>>>32-n;function H(t,n,s,l,e,c){let a=t[n++]^s[l++],o=t[n++]^s[l++],x=t[n++]^s[l++],b=t[n++]^s[l++],k=t[n++]^s[l++],y=t[n++]^s[l++],S=t[n++]^s[l++],d=t[n++]^s[l++],m=t[n++]^s[l++],f=t[n++]^s[l++],w=t[n++]^s[l++],h=t[n++]^s[l++],_=t[n++]^s[l++],I=t[n++]^s[l++],u=t[n++]^s[l++],g=t[n++]^s[l++],M=a,q=o,B=x,E=b,L=k,C=y,N=S,P=d,z=m,A=f,O=w,T=h,U=_,j=I,V=u,$=g;for(let G=0;G<8;G+=2)L^=r(M+U|0,7),z^=r(L+M|0,9),U^=r(z+L|0,13),M^=r(U+z|0,18),A^=r(C+q|0,7),j^=r(A+C|0,9),q^=r(j+A|0,13),C^=r(q+j|0,18),V^=r(O+N|0,7),B^=r(V+O|0,9),N^=r(B+V|0,13),O^=r(N+B|0,18),E^=r($+T|0,7),P^=r(E+$|0,9),T^=r(P+E|0,13),$^=r(T+P|0,18),q^=r(M+E|0,7),B^=r(q+M|0,9),E^=r(B+q|0,13),M^=r(E+B|0,18),N^=r(C+L|0,7),P^=r(N+C|0,9),L^=r(P+N|0,13),C^=r(L+P|0,18),T^=r(O+A|0,7),z^=r(T+O|0,9),A^=r(z+T|0,13),O^=r(A+z|0,18),U^=r($+V|0,7),j^=r(U+$|0,9),V^=r(j+U|0,13),$^=r(V+j|0,18);e[c++]=a+M|0,e[c++]=o+q|0,e[c++]=x+B|0,e[c++]=b+E|0,e[c++]=k+L|0,e[c++]=y+C|0,e[c++]=S+N|0,e[c++]=d+P|0,e[c++]=m+z|0,e[c++]=f+A|0,e[c++]=w+O|0,e[c++]=h+T|0,e[c++]=_+U|0,e[c++]=I+j|0,e[c++]=u+V|0,e[c++]=g+$|0}function F(t,n,s,l,e){let c=l+0,a=l+16*e;for(let o=0;o<16;o++)s[a+o]=t[n+(2*e-1)*16+o];for(let o=0;o<e;o++,c+=16,n+=16)H(s,a,t,n,s,c),o>0&&(a+=16),H(s,c,t,n+=16,s,a)}function Q(t,n,s){const l=D.checkOpts({dkLen:32,asyncTick:10,maxmem:1073742848},s),{N:e,r:c,p:a,dkLen:o,asyncTick:x,maxmem:b,onProgress:k}=l;if(X.number(e),X.number(c),X.number(a),X.number(o),X.number(x),X.number(b),k!==void 0&&typeof k!="function")throw new Error("progressCb should be function");const y=128*c,S=y/4;if(e<=1||e&e-1||e>=2**(y/8)||e>2**32)throw new Error("Scrypt: N must be larger than 1, a power of 2, less than 2^(128 * r / 8) and less than 2^32");if(a<0||a>(2**32-1)*32/y)throw new Error("Scrypt: p must be a positive integer less than or equal to ((2^32 - 1) * 32) / (128 * r)");if(o<0||o>(2**32-1)*32)throw new Error("Scrypt: dkLen should be positive integer less than or equal to (2^32 - 1) * 32");const d=y*(e+a);if(d>b)throw new Error(`Scrypt: parameters too large, ${d} (128 * r * (N + p)) > ${b} (maxmem)`);const m=K.pbkdf2(J.sha256,t,n,{c:1,dkLen:y*a}),f=D.u32(m),w=D.u32(new Uint8Array(y*e)),h=D.u32(new Uint8Array(y));let _=()=>{};if(k){const I=2*e*a,u=Math.max(Math.floor(I/1e4),1);let g=0;_=()=>{g++,k&&(!(g%u)||g===I)&&k(g/I)}}return{N:e,r:c,p:a,dkLen:o,blockSize32:S,V:w,B32:f,B:m,tmp:h,blockMixCb:_,asyncTick:x}}function R(t,n,s,l,e){const c=K.pbkdf2(J.sha256,t,s,{c:1,dkLen:n});return s.fill(0),l.fill(0),e.fill(0),c}function W(t,n,s){const{N:l,r:e,p:c,dkLen:a,blockSize32:o,V:x,B32:b,B:k,tmp:y,blockMixCb:S}=Q(t,n,s);for(let d=0;d<c;d++){const m=o*d;for(let f=0;f<o;f++)x[f]=b[m+f];for(let f=0,w=0;f<l-1;f++)F(x,w,x,w+=o,e),S();F(x,(l-1)*o,b,m,e),S();for(let f=0;f<l;f++){const w=b[m+o-16]%l;for(let h=0;h<o;h++)y[h]=b[m+h]^x[w*o+h];F(y,0,b,m,e),S()}}return R(t,a,k,x,y)}exports.scrypt=W;

package/dist/node_modules/@noble/hashes/esm/scrypt.js

@@ -1,73 +0,0 @@
-import { number as X } from "./_assert.js";
-import { sha256 as Q } from "./sha256.js";
-import { pbkdf2 as R } from "./pbkdf2.js";
-import { checkOpts as W, u32 as G } from "./utils.js";
-const r = (t, l) => t << l | t >>> 32 - l;
-function K(t, l, c, n, e, o) {
-  let f = t[l++] ^ c[n++], s = t[l++] ^ c[n++], m = t[l++] ^ c[n++], x = t[l++] ^ c[n++], h = t[l++] ^ c[n++], y = t[l++] ^ c[n++], S = t[l++] ^ c[n++], d = t[l++] ^ c[n++], k = t[l++] ^ c[n++], a = t[l++] ^ c[n++], w = t[l++] ^ c[n++], b = t[l++] ^ c[n++], D = t[l++] ^ c[n++], I = t[l++] ^ c[n++], F = t[l++] ^ c[n++], M = t[l++] ^ c[n++], g = f, B = s, E = m, L = x, C = h, N = y, z = S, A = d, P = k, U = a, q = w, O = b, T = D, V = I, $ = F, j = M;
-  for (let J = 0; J < 8; J += 2)
-    C ^= r(g + T | 0, 7), P ^= r(C + g | 0, 9), T ^= r(P + C | 0, 13), g ^= r(T + P | 0, 18), U ^= r(N + B | 0, 7), V ^= r(U + N | 0, 9), B ^= r(V + U | 0, 13), N ^= r(B + V | 0, 18), $ ^= r(q + z | 0, 7), E ^= r($ + q | 0, 9), z ^= r(E + $ | 0, 13), q ^= r(z + E | 0, 18), L ^= r(j + O | 0, 7), A ^= r(L + j | 0, 9), O ^= r(A + L | 0, 13), j ^= r(O + A | 0, 18), B ^= r(g + L | 0, 7), E ^= r(B + g | 0, 9), L ^= r(E + B | 0, 13), g ^= r(L + E | 0, 18), z ^= r(N + C | 0, 7), A ^= r(z + N | 0, 9), C ^= r(A + z | 0, 13), N ^= r(C + A | 0, 18), O ^= r(q + U | 0, 7), P ^= r(O + q | 0, 9), U ^= r(P + O | 0, 13), q ^= r(U + P | 0, 18), T ^= r(j + $ | 0, 7), V ^= r(T + j | 0, 9), $ ^= r(V + T | 0, 13), j ^= r($ + V | 0, 18);
-  e[o++] = f + g | 0, e[o++] = s + B | 0, e[o++] = m + E | 0, e[o++] = x + L | 0, e[o++] = h + C | 0, e[o++] = y + N | 0, e[o++] = S + z | 0, e[o++] = d + A | 0, e[o++] = k + P | 0, e[o++] = a + U | 0, e[o++] = w + q | 0, e[o++] = b + O | 0, e[o++] = D + T | 0, e[o++] = I + V | 0, e[o++] = F + $ | 0, e[o++] = M + j | 0;
-}
-function H(t, l, c, n, e) {
-  let o = n + 0, f = n + 16 * e;
-  for (let s = 0; s < 16; s++)
-    c[f + s] = t[l + (2 * e - 1) * 16 + s];
-  for (let s = 0; s < e; s++, o += 16, l += 16)
-    K(c, f, t, l, c, o), s > 0 && (f += 16), K(c, o, t, l += 16, c, f);
-}
-function Y(t, l, c) {
-  const n = W({
-    dkLen: 32,
-    asyncTick: 10,
-    maxmem: 1073742848
-  }, c), { N: e, r: o, p: f, dkLen: s, asyncTick: m, maxmem: x, onProgress: h } = n;
-  if (X(e), X(o), X(f), X(s), X(m), X(x), h !== void 0 && typeof h != "function")
-    throw new Error("progressCb should be function");
-  const y = 128 * o, S = y / 4;
-  if (e <= 1 || e & e - 1 || e >= 2 ** (y / 8) || e > 2 ** 32)
-    throw new Error("Scrypt: N must be larger than 1, a power of 2, less than 2^(128 * r / 8) and less than 2^32");
-  if (f < 0 || f > (2 ** 32 - 1) * 32 / y)
-    throw new Error("Scrypt: p must be a positive integer less than or equal to ((2^32 - 1) * 32) / (128 * r)");
-  if (s < 0 || s > (2 ** 32 - 1) * 32)
-    throw new Error("Scrypt: dkLen should be positive integer less than or equal to (2^32 - 1) * 32");
-  const d = y * (e + f);
-  if (d > x)
-    throw new Error(`Scrypt: parameters too large, ${d} (128 * r * (N + p)) > ${x} (maxmem)`);
-  const k = R(Q, t, l, { c: 1, dkLen: y * f }), a = G(k), w = G(new Uint8Array(y * e)), b = G(new Uint8Array(y));
-  let D = () => {
-  };
-  if (h) {
-    const I = 2 * e * f, F = Math.max(Math.floor(I / 1e4), 1);
-    let M = 0;
-    D = () => {
-      M++, h && (!(M % F) || M === I) && h(M / I);
-    };
-  }
-  return { N: e, r: o, p: f, dkLen: s, blockSize32: S, V: w, B32: a, B: k, tmp: b, blockMixCb: D, asyncTick: m };
-}
-function Z(t, l, c, n, e) {
-  const o = R(Q, t, c, { c: 1, dkLen: l });
-  return c.fill(0), n.fill(0), e.fill(0), o;
-}
-function i(t, l, c) {
-  const { N: n, r: e, p: o, dkLen: f, blockSize32: s, V: m, B32: x, B: h, tmp: y, blockMixCb: S } = Y(t, l, c);
-  for (let d = 0; d < o; d++) {
-    const k = s * d;
-    for (let a = 0; a < s; a++)
-      m[a] = x[k + a];
-    for (let a = 0, w = 0; a < n - 1; a++)
-      H(m, w, m, w += s, e), S();
-    H(m, (n - 1) * s, x, k, e), S();
-    for (let a = 0; a < n; a++) {
-      const w = x[k + s - 16] % n;
-      for (let b = 0; b < s; b++)
-        y[b] = x[k + b] ^ m[w * s + b];
-      H(y, 0, x, k, e), S();
-    }
-  }
-  return Z(t, f, h, m, y);
-}
-export {
-  i as scrypt
-};

package/dist/node_modules/@noble/hashes/esm/sha256.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const g=require("./_sha2.cjs"),e=require("./utils.cjs"),y=(n,a,c)=>n&a^~n&c,S=(n,a,c)=>n&a^n&c^a&c,w=new Uint32Array([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),o=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),h=new Uint32Array(64);class B extends g.SHA2{constructor(){super(64,32,8,!1),this.A=o[0]|0,this.B=o[1]|0,this.C=o[2]|0,this.D=o[3]|0,this.E=o[4]|0,this.F=o[5]|0,this.G=o[6]|0,this.H=o[7]|0}get(){const{A:a,B:c,C:x,D:r,E:i,F:b,G:s,H:f}=this;return[a,c,x,r,i,b,s,f]}set(a,c,x,r,i,b,s,f){this.A=a|0,this.B=c|0,this.C=x|0,this.D=r|0,this.E=i|0,this.F=b|0,this.G=s|0,this.H=f|0}process(a,c){for(let t=0;t<16;t++,c+=4)h[t]=a.getUint32(c,!1);for(let t=16;t<64;t++){const A=h[t-15],l=h[t-2],C=e.rotr(A,7)^e.rotr(A,18)^A>>>3,H=e.rotr(l,17)^e.rotr(l,19)^l>>>10;h[t]=H+h[t-7]+C+h[t-16]|0}let{A:x,B:r,C:i,D:b,E:s,F:f,G:d,H:u}=this;for(let t=0;t<64;t++){const A=e.rotr(s,6)^e.rotr(s,11)^e.rotr(s,25),l=u+A+y(s,f,d)+w[t]+h[t]|0,H=(e.rotr(x,2)^e.rotr(x,13)^e.rotr(x,22))+S(x,r,i)|0;u=d,d=f,f=s,s=b+l|0,b=i,i=r,r=x,x=l+H|0}x=x+this.A|0,r=r+this.B|0,i=i+this.C|0,b=b+this.D|0,s=s+this.E|0,f=f+this.F|0,d=d+this.G|0,u=u+this.H|0,this.set(x,r,i,b,s,f,d,u)}roundClean(){h.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const D=e.wrapConstructor(()=>new B);exports.sha256=D;

package/dist/node_modules/@noble/hashes/esm/sha256.js

@@ -1,114 +0,0 @@
-import { SHA2 as p } from "./_sha2.js";
-import { wrapConstructor as u, rotr as b } from "./utils.js";
-const g = (r, e, s) => r & e ^ ~r & s, w = (r, e, s) => r & e ^ r & s ^ e & s, B = /* @__PURE__ */ new Uint32Array([
-  1116352408,
-  1899447441,
-  3049323471,
-  3921009573,
-  961987163,
-  1508970993,
-  2453635748,
-  2870763221,
-  3624381080,
-  310598401,
-  607225278,
-  1426881987,
-  1925078388,
-  2162078206,
-  2614888103,
-  3248222580,
-  3835390401,
-  4022224774,
-  264347078,
-  604807628,
-  770255983,
-  1249150122,
-  1555081692,
-  1996064986,
-  2554220882,
-  2821834349,
-  2952996808,
-  3210313671,
-  3336571891,
-  3584528711,
-  113926993,
-  338241895,
-  666307205,
-  773529912,
-  1294757372,
-  1396182291,
-  1695183700,
-  1986661051,
-  2177026350,
-  2456956037,
-  2730485921,
-  2820302411,
-  3259730800,
-  3345764771,
-  3516065817,
-  3600352804,
-  4094571909,
-  275423344,
-  430227734,
-  506948616,
-  659060556,
-  883997877,
-  958139571,
-  1322822218,
-  1537002063,
-  1747873779,
-  1955562222,
-  2024104815,
-  2227730452,
-  2361852424,
-  2428436474,
-  2756734187,
-  3204031479,
-  3329325298
-]), o = /* @__PURE__ */ new Uint32Array([
-  1779033703,
-  3144134277,
-  1013904242,
-  2773480762,
-  1359893119,
-  2600822924,
-  528734635,
-  1541459225
-]), n = /* @__PURE__ */ new Uint32Array(64);
-class D extends p {
-  constructor() {
-    super(64, 32, 8, !1), this.A = o[0] | 0, this.B = o[1] | 0, this.C = o[2] | 0, this.D = o[3] | 0, this.E = o[4] | 0, this.F = o[5] | 0, this.G = o[6] | 0, this.H = o[7] | 0;
-  }
-  get() {
-    const { A: e, B: s, C: t, D: a, E: i, F: h, G: c, H: f } = this;
-    return [e, s, t, a, i, h, c, f];
-  }
-  // prettier-ignore
-  set(e, s, t, a, i, h, c, f) {
-    this.A = e | 0, this.B = s | 0, this.C = t | 0, this.D = a | 0, this.E = i | 0, this.F = h | 0, this.G = c | 0, this.H = f | 0;
-  }
-  process(e, s) {
-    for (let x = 0; x < 16; x++, s += 4)
-      n[x] = e.getUint32(s, !1);
-    for (let x = 16; x < 64; x++) {
-      const H = n[x - 15], l = n[x - 2], m = b(H, 7) ^ b(H, 18) ^ H >>> 3, C = b(l, 17) ^ b(l, 19) ^ l >>> 10;
-      n[x] = C + n[x - 7] + m + n[x - 16] | 0;
-    }
-    let { A: t, B: a, C: i, D: h, E: c, F: f, G: d, H: A } = this;
-    for (let x = 0; x < 64; x++) {
-      const H = b(c, 6) ^ b(c, 11) ^ b(c, 25), l = A + H + g(c, f, d) + B[x] + n[x] | 0, C = (b(t, 2) ^ b(t, 13) ^ b(t, 22)) + w(t, a, i) | 0;
-      A = d, d = f, f = c, c = h + l | 0, h = i, i = a, a = t, t = l + C | 0;
-    }
-    t = t + this.A | 0, a = a + this.B | 0, i = i + this.C | 0, h = h + this.D | 0, c = c + this.E | 0, f = f + this.F | 0, d = d + this.G | 0, A = A + this.H | 0, this.set(t, a, i, h, c, f, d, A);
-  }
-  roundClean() {
-    n.fill(0);
-  }
-  destroy() {
-    this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
-  }
-}
-const G = /* @__PURE__ */ u(() => new D());
-export {
-  G as sha256
-};

package/dist/node_modules/@noble/hashes/esm/sha3.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./_assert.cjs"),f=require("./_u64.cjs"),k=require("./utils.cjs"),[y,b,_]=[[],[],[]],B=BigInt(0),l=BigInt(1),A=BigInt(2),H=BigInt(7),S=BigInt(256),T=BigInt(113);for(let i=0,t=l,s=1,n=0;i<24;i++){[s,n]=[n,(2*s+3*n)%5],y.push(2*(5*n+s)),b.push((i+1)*(i+2)/2%64);let o=B;for(let r=0;r<7;r++)t=(t<<l^(t>>H)*T)%S,t&A&&(o^=l<<(l<<BigInt(r))-l);_.push(o)}const[m,F]=f.split(_,!0),I=(i,t,s)=>s>32?f.rotlBH(i,t,s):f.rotlSH(i,t,s),O=(i,t,s)=>s>32?f.rotlBL(i,t,s):f.rotlSL(i,t,s);function w(i,t=24){const s=new Uint32Array(10);for(let n=24-t;n<24;n++){for(let e=0;e<10;e++)s[e]=i[e]^i[e+10]^i[e+20]^i[e+30]^i[e+40];for(let e=0;e<10;e+=2){const h=(e+8)%10,a=(e+2)%10,p=s[a],c=s[a+1],g=I(p,c,1)^s[h],L=O(p,c,1)^s[h+1];for(let d=0;d<50;d+=10)i[e+d]^=g,i[e+d+1]^=L}let o=i[2],r=i[3];for(let e=0;e<24;e++){const h=b[e],a=I(o,r,h),p=O(o,r,h),c=y[e];o=i[c],r=i[c+1],i[c]=a,i[c+1]=p}for(let e=0;e<50;e+=10){for(let h=0;h<10;h++)s[h]=i[e+h];for(let h=0;h<10;h++)i[e+h]^=~s[(h+2)%10]&s[(h+4)%10]}i[0]^=m[n],i[1]^=F[n]}s.fill(0)}class x extends k.Hash{constructor(t,s,n,o=!1,r=24){if(super(),this.blockLen=t,this.suffix=s,this.outputLen=n,this.enableXOF=o,this.rounds=r,this.pos=0,this.posOut=0,this.finished=!1,this.destroyed=!1,u.number(n),0>=this.blockLen||this.blockLen>=200)throw new Error("Sha3 supports only keccak-f1600 function");this.state=new Uint8Array(200),this.state32=k.u32(this.state)}keccak(){w(this.state32,this.rounds),this.posOut=0,this.pos=0}update(t){u.exists(this);const{blockLen:s,state:n}=this;t=k.toBytes(t);const o=t.length;for(let r=0;r<o;){const e=Math.min(s-this.pos,o-r);for(let h=0;h<e;h++)n[this.pos++]^=t[r++];this.pos===s&&this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;const{state:t,suffix:s,pos:n,blockLen:o}=this;t[n]^=s,s&128&&n===o-1&&this.keccak(),t[o-1]^=128,this.keccak()}writeInto(t){u.exists(this,!1),u.bytes(t),this.finish();const s=this.state,{blockLen:n}=this;for(let o=0,r=t.length;o<r;){this.posOut>=n&&this.keccak();const e=Math.min(n-this.posOut,r-o);t.set(s.subarray(this.posOut,this.posOut+e),o),this.posOut+=e,o+=e}return t}xofInto(t){if(!this.enableXOF)throw new Error("XOF is not possible for this instance");return this.writeInto(t)}xof(t){return u.number(t),this.xofInto(new Uint8Array(t))}digestInto(t){if(u.output(t,this),this.finished)throw new Error("digest() was already called");return this.writeInto(t),this.destroy(),t}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,this.state.fill(0)}_cloneInto(t){const{blockLen:s,suffix:n,outputLen:o,rounds:r,enableXOF:e}=this;return t||(t=new x(s,n,o,e,r)),t.state32.set(this.state32),t.pos=this.pos,t.posOut=this.posOut,t.finished=this.finished,t.rounds=r,t.suffix=n,t.outputLen=o,t.enableXOF=e,t.destroyed=this.destroyed,t}}const P=(i,t,s)=>k.wrapConstructor(()=>new x(t,i,s)),X=P(1,136,256/8);exports.Keccak=x;exports.keccakP=w;exports.keccak_256=X;

package/dist/node_modules/@noble/hashes/esm/sha3.js

@@ -1,107 +0,0 @@
-import { number as d, exists as k, bytes as _, output as g } from "./_assert.js";
-import { split as B, rotlBH as A, rotlSH as H, rotlBL as m, rotlSL as S } from "./_u64.js";
-import { wrapConstructor as T, Hash as F, u32 as X, toBytes as U } from "./utils.js";
-const [O, w, y] = [[], [], []], E = /* @__PURE__ */ BigInt(0), f = /* @__PURE__ */ BigInt(1), P = /* @__PURE__ */ BigInt(2), M = /* @__PURE__ */ BigInt(7), R = /* @__PURE__ */ BigInt(256), j = /* @__PURE__ */ BigInt(113);
-for (let i = 0, t = f, s = 1, n = 0; i < 24; i++) {
-  [s, n] = [n, (2 * s + 3 * n) % 5], O.push(2 * (5 * n + s)), w.push((i + 1) * (i + 2) / 2 % 64);
-  let o = E;
-  for (let r = 0; r < 7; r++)
-    t = (t << f ^ (t >> M) * j) % R, t & P && (o ^= f << (f << /* @__PURE__ */ BigInt(r)) - f);
-  y.push(o);
-}
-const [C, q] = /* @__PURE__ */ B(y, !0), x = (i, t, s) => s > 32 ? A(i, t, s) : H(i, t, s), I = (i, t, s) => s > 32 ? m(i, t, s) : S(i, t, s);
-function v(i, t = 24) {
-  const s = new Uint32Array(10);
-  for (let n = 24 - t; n < 24; n++) {
-    for (let e = 0; e < 10; e++)
-      s[e] = i[e] ^ i[e + 10] ^ i[e + 20] ^ i[e + 30] ^ i[e + 40];
-    for (let e = 0; e < 10; e += 2) {
-      const h = (e + 8) % 10, l = (e + 2) % 10, u = s[l], c = s[l + 1], L = x(u, c, 1) ^ s[h], b = I(u, c, 1) ^ s[h + 1];
-      for (let a = 0; a < 50; a += 10)
-        i[e + a] ^= L, i[e + a + 1] ^= b;
-    }
-    let o = i[2], r = i[3];
-    for (let e = 0; e < 24; e++) {
-      const h = w[e], l = x(o, r, h), u = I(o, r, h), c = O[e];
-      o = i[c], r = i[c + 1], i[c] = l, i[c + 1] = u;
-    }
-    for (let e = 0; e < 50; e += 10) {
-      for (let h = 0; h < 10; h++)
-        s[h] = i[e + h];
-      for (let h = 0; h < 10; h++)
-        i[e + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
-    }
-    i[0] ^= C[n], i[1] ^= q[n];
-  }
-  s.fill(0);
-}
-class p extends F {
-  // NOTE: we accept arguments in bytes instead of bits here.
-  constructor(t, s, n, o = !1, r = 24) {
-    if (super(), this.blockLen = t, this.suffix = s, this.outputLen = n, this.enableXOF = o, this.rounds = r, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, d(n), 0 >= this.blockLen || this.blockLen >= 200)
-      throw new Error("Sha3 supports only keccak-f1600 function");
-    this.state = new Uint8Array(200), this.state32 = X(this.state);
-  }
-  keccak() {
-    v(this.state32, this.rounds), this.posOut = 0, this.pos = 0;
-  }
-  update(t) {
-    k(this);
-    const { blockLen: s, state: n } = this;
-    t = U(t);
-    const o = t.length;
-    for (let r = 0; r < o; ) {
-      const e = Math.min(s - this.pos, o - r);
-      for (let h = 0; h < e; h++)
-        n[this.pos++] ^= t[r++];
-      this.pos === s && this.keccak();
-    }
-    return this;
-  }
-  finish() {
-    if (this.finished)
-      return;
-    this.finished = !0;
-    const { state: t, suffix: s, pos: n, blockLen: o } = this;
-    t[n] ^= s, s & 128 && n === o - 1 && this.keccak(), t[o - 1] ^= 128, this.keccak();
-  }
-  writeInto(t) {
-    k(this, !1), _(t), this.finish();
-    const s = this.state, { blockLen: n } = this;
-    for (let o = 0, r = t.length; o < r; ) {
-      this.posOut >= n && this.keccak();
-      const e = Math.min(n - this.posOut, r - o);
-      t.set(s.subarray(this.posOut, this.posOut + e), o), this.posOut += e, o += e;
-    }
-    return t;
-  }
-  xofInto(t) {
-    if (!this.enableXOF)
-      throw new Error("XOF is not possible for this instance");
-    return this.writeInto(t);
-  }
-  xof(t) {
-    return d(t), this.xofInto(new Uint8Array(t));
-  }
-  digestInto(t) {
-    if (g(t, this), this.finished)
-      throw new Error("digest() was already called");
-    return this.writeInto(t), this.destroy(), t;
-  }
-  digest() {
-    return this.digestInto(new Uint8Array(this.outputLen));
-  }
-  destroy() {
-    this.destroyed = !0, this.state.fill(0);
-  }
-  _cloneInto(t) {
-    const { blockLen: s, suffix: n, outputLen: o, rounds: r, enableXOF: e } = this;
-    return t || (t = new p(s, n, o, e, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = n, t.outputLen = o, t.enableXOF = e, t.destroyed = this.destroyed, t;
-  }
-}
-const z = (i, t, s) => T(() => new p(t, i, s)), K = /* @__PURE__ */ z(1, 136, 256 / 8);
-export {
-  p as Keccak,
-  v as keccakP,
-  K as keccak_256
-};

package/dist/node_modules/@noble/hashes/esm/utils.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./crypto.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */const l=t=>new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4));function s(t){return t instanceof Uint8Array||t!=null&&typeof t=="object"&&t.constructor.name==="Uint8Array"}const p=t=>new DataView(t.buffer,t.byteOffset,t.byteLength),w=(t,e)=>t<<32-e|t>>>e,u=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;if(!u)throw new Error("Non little-endian hardware is not supported");function f(t){if(typeof t!="string")throw new Error(`utf8ToBytes expected string, got ${typeof t}`);return new Uint8Array(new TextEncoder().encode(t))}function y(t){if(typeof t=="string"&&(t=f(t)),!s(t))throw new Error(`expected Uint8Array, got ${typeof t}`);return t}function d(...t){let e=0;for(let n=0;n<t.length;n++){const o=t[n];if(!s(o))throw new Error("Uint8Array expected");e+=o.length}const r=new Uint8Array(e);for(let n=0,o=0;n<t.length;n++){const i=t[n];r.set(i,o),o+=i.length}return r}class g{clone(){return this._cloneInto()}}const a={}.toString;function b(t,e){if(e!==void 0&&a.call(e)!=="[object Object]")throw new Error("Options should be object or undefined");return Object.assign(t,e)}function h(t){const e=n=>t().update(y(n)).digest(),r=t();return e.outputLen=r.outputLen,e.blockLen=r.blockLen,e.create=()=>t(),e}function m(t=32){if(c.crypto&&typeof c.crypto.getRandomValues=="function")return c.crypto.getRandomValues(new Uint8Array(t));throw new Error("crypto.getRandomValues must be defined")}exports.Hash=g;exports.checkOpts=b;exports.concatBytes=d;exports.createView=p;exports.isLE=u;exports.randomBytes=m;exports.rotr=w;exports.toBytes=y;exports.u32=l;exports.utf8ToBytes=f;exports.wrapConstructor=h;

package/dist/node_modules/@noble/hashes/esm/utils.js

@@ -1,68 +0,0 @@
-import { crypto as c } from "./crypto.js";
-/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const p = (t) => new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
-function f(t) {
-  return t instanceof Uint8Array || t != null && typeof t == "object" && t.constructor.name === "Uint8Array";
-}
-const g = (t) => new DataView(t.buffer, t.byteOffset, t.byteLength), d = (t, e) => t << 32 - e | t >>> e, u = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!u)
-  throw new Error("Non little-endian hardware is not supported");
-function s(t) {
-  if (typeof t != "string")
-    throw new Error(`utf8ToBytes expected string, got ${typeof t}`);
-  return new Uint8Array(new TextEncoder().encode(t));
-}
-function y(t) {
-  if (typeof t == "string" && (t = s(t)), !f(t))
-    throw new Error(`expected Uint8Array, got ${typeof t}`);
-  return t;
-}
-function b(...t) {
-  let e = 0;
-  for (let n = 0; n < t.length; n++) {
-    const r = t[n];
-    if (!f(r))
-      throw new Error("Uint8Array expected");
-    e += r.length;
-  }
-  const o = new Uint8Array(e);
-  for (let n = 0, r = 0; n < t.length; n++) {
-    const i = t[n];
-    o.set(i, r), r += i.length;
-  }
-  return o;
-}
-class h {
-  // Safe version that clones internal state
-  clone() {
-    return this._cloneInto();
-  }
-}
-const l = {}.toString;
-function a(t, e) {
-  if (e !== void 0 && l.call(e) !== "[object Object]")
-    throw new Error("Options should be object or undefined");
-  return Object.assign(t, e);
-}
-function m(t) {
-  const e = (n) => t().update(y(n)).digest(), o = t();
-  return e.outputLen = o.outputLen, e.blockLen = o.blockLen, e.create = () => t(), e;
-}
-function A(t = 32) {
-  if (c && typeof c.getRandomValues == "function")
-    return c.getRandomValues(new Uint8Array(t));
-  throw new Error("crypto.getRandomValues must be defined");
-}
-export {
-  h as Hash,
-  a as checkOpts,
-  b as concatBytes,
-  g as createView,
-  u as isLE,
-  A as randomBytes,
-  d as rotr,
-  y as toBytes,
-  p as u32,
-  s as utf8ToBytes,
-  m as wrapConstructor
-};

package/dist/node_modules/abitype/dist/chunk-NHABU752.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var i=Object.defineProperty,l=(e,r,t)=>r in e?i(e,r,{enumerable:!0,configurable:!0,writable:!0,value:t}):e[r]=t,o=(e,r,t)=>(l(e,typeof r!="symbol"?r+"":r,t),t);exports.__publicField=o;

package/dist/node_modules/abitype/dist/chunk-NHABU752.js

@@ -1,4 +0,0 @@
-var i = Object.defineProperty, o = (e, r, t) => r in e ? i(e, r, { enumerable: !0, configurable: !0, writable: !0, value: t }) : e[r] = t, p = (e, r, t) => (o(e, typeof r != "symbol" ? r + "" : r, t), t);
-export {
-  p as __publicField
-};

package/dist/node_modules/abitype/dist/chunk-WP7KDV47.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function g(t,r){const e=t.exec(r);return e==null?void 0:e.groups}var i=/^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)?$/,s=/^\(.+?\).*?$/;exports.bytesRegex=i;exports.execTyped=g;exports.integerRegex=n;exports.isTupleRegex=s;

package/dist/node_modules/abitype/dist/chunk-WP7KDV47.js

@@ -1,11 +0,0 @@
-function n(r, t) {
-  const e = r.exec(t);
-  return e == null ? void 0 : e.groups;
-}
-var x = /^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)?$/, s = /^\(.+?\).*?$/;
-export {
-  x as bytesRegex,
-  n as execTyped,
-  g as integerRegex,
-  s as isTupleRegex
-};

package/dist/node_modules/abitype/dist/index.cjs

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=require("./chunk-WP7KDV47.cjs"),g=require("./chunk-NHABU752.cjs");var _="abitype",k="0.7.1",c=class extends Error{constructor(t,e={}){var o;const a=e.cause instanceof c?e.cause.details:(o=e.cause)!=null&&o.message?e.cause.message:e.details,s=e.cause instanceof c&&e.cause.docsPath||e.docsPath,n=[t||"An error occurred.","",...e.metaMessages?[...e.metaMessages,""]:[],...s?[`Docs: https://abitype.dev${s}`]:[],...a?[`Details: ${a}`]:[],`Version: ${_}@${k}`].join(`
-`);super(n),g.__publicField(this,"details"),g.__publicField(this,"docsPath"),g.__publicField(this,"metaMessages"),g.__publicField(this,"shortMessage"),g.__publicField(this,"name","AbiTypeError"),e.cause&&(this.cause=e.cause),this.details=a,this.docsPath=s,this.metaMessages=e.metaMessages,this.shortMessage=t}},A=/^struct (?<name>[a-zA-Z0-9_]+) \{(?<properties>.*?)\}$/;function M(t){return A.test(t)}function T(t){return l.execTyped(A,t)}var I=new Set(["memory","indexed","storage","calldata"]),R=new Set(["calldata","memory","storage"]);function B(t,e){return e?`${e}:${t}`:t}var x=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}]]),z=/^(?<type>[a-zA-Z0-9_]+?)(?<array>(?:\[\d*?\])+?)?(?:\s(?<modifier>calldata|indexed|memory|storage{1}))?(?:\s(?<name>[a-zA-Z0-9_]+))?$/,D=/^\((?<type>.+?)\)(?<array>(?:\[\d*?\])+?)?(?:\s(?<modifier>calldata|indexed|memory|storage{1}))?(?:\s(?<name>[a-zA-Z0-9_]+))?$/,F=/^u?int$/;function b(t,e){var p,m;const a=B(t,e==null?void 0:e.type);if(x.has(a))return x.get(a);const s=l.isTupleRegex.test(t),n=l.execTyped(s?D:z,t);if(!n)throw new c("Invalid ABI parameter.",{details:t});if(n.name&&K(n.name))throw new c("Invalid ABI parameter.",{details:t,metaMessages:[`"${n.name}" is a protected Solidity keyword. More info: https://docs.soliditylang.org/en/latest/cheatsheet.html`]});const o=n.name?{name:n.name}:{},i=n.modifier==="indexed"?{indexed:!0}:{},u=(e==null?void 0:e.structs)??{};let r,y={};if(s){r="tuple";const v=f(n.type),h=[],w=v.length;for(let $=0;$<w;$++)h.push(b(v[$],{structs:u}));y={components:h}}else if(n.type in u)r="tuple",y={components:u[n.type]};else if(F.test(n.type))r=`${n.type}256`;else if(r=n.type,(e==null?void 0:e.type)!=="struct"&&!P(r))throw new c("Unknown type.",{metaMessages:[`Type "${r}" is not a valid ABI type.`]});if(n.modifier){if(!((m=(p=e==null?void 0:e.modifiers)==null?void 0:p.has)!=null&&m.call(p,n.modifier)))throw new c("Invalid ABI parameter.",{details:t,metaMessages:[`Modifier "${n.modifier}" not allowed${e!=null&&e.type?` in "${e.type}" type`:""}.`]});if(R.has(n.modifier)&&!Z(r,!!n.array))throw new c("Invalid ABI parameter.",{details:t,metaMessages:[`Modifier "${n.modifier}" not allowed${e!=null&&e.type?` in "${e.type}" type`:""}.`,`Data location can only be specified for array, struct, or mapping types, but "${n.modifier}" was given.`]})}const d={type:`${r}${n.array??""}`,...o,...i,...y};return x.set(a,d),d}function f(t,e=[],a="",s=0){if(t===""){if(a==="")return e;if(s!==0)throw new c("Unbalanced parentheses.",{metaMessages:[`"${a.trim()}" has too many ${s>0?"opening":"closing"} parentheses.`],details:`Depth "${s}"`});return[...e,a.trim()]}const n=t.length;for(let o=0;o<n;o++){const i=t[o],u=t.slice(o+1);switch(i){case",":return s===0?f(u,[...e,a.trim()]):f(u,e,`${a}${i}`,s);case"(":return f(u,e,`${a}${i}`,s+1);case")":return f(u,e,`${a}${i}`,s-1);default:return f(u,e,`${a}${i}`,s)}}return[]}function P(t){return t==="address"||t==="bool"||t==="function"||t==="string"||l.bytesRegex.test(t)||l.integerRegex.test(t)}var U=/^(?:after|alias|anonymous|apply|auto|byte|calldata|case|catch|constant|copyof|default|defined|error|event|external|false|final|function|immutable|implements|in|indexed|inline|internal|let|mapping|match|memory|mutable|null|of|override|partial|private|promise|public|pure|reference|relocatable|return|returns|sizeof|static|storage|struct|super|supports|switch|this|true|try|typedef|typeof|var|view|virtual)$/;function K(t){return t==="address"||t==="bool"||t==="function"||t==="string"||t==="tuple"||l.bytesRegex.test(t)||l.integerRegex.test(t)||U.test(t)}function Z(t,e){return e||t==="bytes"||t==="string"||t==="tuple"}function C(t){const e={},a=t.length;for(let i=0;i<a;i++){const u=t[i];if(!M(u))continue;const r=T(u);if(!r)throw new c("Invalid struct signature.",{details:u});const y=r.properties.split(";"),d=[],p=y.length;for(let m=0;m<p;m++){const h=y[m].trim();if(!h)continue;const w=b(h,{type:"struct"});d.push(w)}if(!d.length)throw new c("Invalid struct signature.",{details:u,metaMessages:["No properties exist."]});e[r.name]=d}const s={},n=Object.entries(e),o=n.length;for(let i=0;i<o;i++){const[u,r]=n[i];s[u]=S(r,e)}return s}var E=/^(?<type>[a-zA-Z0-9_]+?)(?<array>(?:\[\d*?\])+?)?$/;function S(t,e,a=new Set){const s=[],n=t.length;for(let o=0;o<n;o++){const i=t[o];if(l.isTupleRegex.test(i.type))s.push(i);else{const r=l.execTyped(E,i.type);if(!(r!=null&&r.type))throw new c("Invalid ABI parameter.",{details:JSON.stringify(i,null,2),metaMessages:["ABI parameter type is invalid."]});const{array:y,type:d}=r;if(d in e){if(a.has(d))throw new c("Circular reference detected.",{metaMessages:[`Struct "${d}" is a circular reference.`]});s.push({...i,type:`tuple${y??""}`,components:S(e[d]??[],e,new Set([...a,d]))})}else if(P(d))s.push(i);else throw new c("Unknown type.",{metaMessages:[`Type "${d}" is not a valid ABI type. Perhaps you forgot to include a struct signature?`]})}}return s}function L(t){let e;if(typeof t=="string")e=b(t,{modifiers:I});else{const a=C(t),s=t.length;for(let n=0;n<s;n++){const o=t[n];if(!M(o)){e=b(o,{modifiers:I,structs:a});break}}}if(!e)throw new c("Failed to parse ABI parameter.",{details:`parseAbiParameter(${JSON.stringify(t,null,2)})`,docsPath:"/api/human.html#parseabiparameter-1"});return e}exports.BaseError=c;exports.parseAbiParameter=L;