@gardenfi/utils 2.0.4 → 2.0.6

package/dist/index116.js

@@ -0,0 +1,234 @@
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const d = /* @__PURE__ */ BigInt(0), y = /* @__PURE__ */ BigInt(1), I = /* @__PURE__ */ BigInt(2);
+function h(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
+}
+function b(t) {
+  if (!h(t))
+    throw new Error("Uint8Array expected");
+}
+function O(t, n) {
+  if (typeof n != "boolean")
+    throw new Error(t + " boolean expected, got " + n);
+}
+const T = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
+function B(t) {
+  b(t);
+  let n = "";
+  for (let r = 0; r < t.length; r++)
+    n += T[t[r]];
+  return n;
+}
+function S(t) {
+  const n = t.toString(16);
+  return n.length & 1 ? "0" + n : n;
+}
+function U(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  return t === "" ? d : BigInt("0x" + t);
+}
+const s = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
+function E(t) {
+  if (t >= s._0 && t <= s._9)
+    return t - s._0;
+  if (t >= s.A && t <= s.F)
+    return t - (s.A - 10);
+  if (t >= s.a && t <= s.f)
+    return t - (s.a - 10);
+}
+function m(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  const n = t.length, r = n / 2;
+  if (n % 2)
+    throw new Error("hex string expected, got unpadded hex of length " + n);
+  const e = new Uint8Array(r);
+  for (let o = 0, i = 0; o < r; o++, i += 2) {
+    const a = E(t.charCodeAt(i)), f = E(t.charCodeAt(i + 1));
+    if (a === void 0 || f === void 0) {
+      const c = t[i] + t[i + 1];
+      throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i);
+    }
+    e[o] = a * 16 + f;
+  }
+  return e;
+}
+function V(t) {
+  return U(B(t));
+}
+function H(t) {
+  return b(t), U(B(Uint8Array.from(t).reverse()));
+}
+function v(t, n) {
+  return m(t.toString(16).padStart(n * 2, "0"));
+}
+function C(t, n) {
+  return v(t, n).reverse();
+}
+function M(t) {
+  return m(S(t));
+}
+function R(t, n, r) {
+  let e;
+  if (typeof n == "string")
+    try {
+      e = m(n);
+    } catch (i) {
+      throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
+    }
+  else if (h(n))
+    e = Uint8Array.from(n);
+  else
+    throw new Error(t + " must be hex string or Uint8Array");
+  const o = e.length;
+  if (typeof r == "number" && o !== r)
+    throw new Error(t + " of length " + r + " expected, got " + o);
+  return e;
+}
+function _(...t) {
+  let n = 0;
+  for (let e = 0; e < t.length; e++) {
+    const o = t[e];
+    b(o), n += o.length;
+  }
+  const r = new Uint8Array(n);
+  for (let e = 0, o = 0; e < t.length; e++) {
+    const i = t[e];
+    r.set(i, o), o += i.length;
+  }
+  return r;
+}
+function j(t, n) {
+  if (t.length !== n.length)
+    return !1;
+  let r = 0;
+  for (let e = 0; e < t.length; e++)
+    r |= t[e] ^ n[e];
+  return r === 0;
+}
+function z(t) {
+  if (typeof t != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(t));
+}
+const w = (t) => typeof t == "bigint" && d <= t;
+function N(t, n, r) {
+  return w(t) && w(n) && w(r) && n <= t && t < r;
+}
+function D(t, n, r, e) {
+  if (!N(n, r, e))
+    throw new Error("expected valid " + t + ": " + r + " <= n < " + e + ", got " + n);
+}
+function G(t) {
+  let n;
+  for (n = 0; t > d; t >>= y, n += 1)
+    ;
+  return n;
+}
+function P(t, n) {
+  return t >> BigInt(n) & y;
+}
+function W(t, n, r) {
+  return t | (r ? y : d) << BigInt(n);
+}
+const q = (t) => (I << BigInt(t - 1)) - y, p = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
+function J(t, n, r) {
+  if (typeof t != "number" || t < 2)
+    throw new Error("hashLen must be a number");
+  if (typeof n != "number" || n < 2)
+    throw new Error("qByteLen must be a number");
+  if (typeof r != "function")
+    throw new Error("hmacFn must be a function");
+  let e = p(t), o = p(t), i = 0;
+  const a = () => {
+    e.fill(1), o.fill(0), i = 0;
+  }, f = (...u) => r(o, e, ...u), c = (u = p()) => {
+    o = f(A([0]), u), e = f(), u.length !== 0 && (o = f(A([1]), u), e = f());
+  }, x = () => {
+    if (i++ >= 1e3)
+      throw new Error("drbg: tried 1000 values");
+    let u = 0;
+    const l = [];
+    for (; u < n; ) {
+      e = f();
+      const g = e.slice();
+      l.push(g), u += e.length;
+    }
+    return _(...l);
+  };
+  return (u, l) => {
+    a(), c(u);
+    let g;
+    for (; !(g = l(x())); )
+      c();
+    return a(), g;
+  };
+}
+const k = {
+  bigint: (t) => typeof t == "bigint",
+  function: (t) => typeof t == "function",
+  boolean: (t) => typeof t == "boolean",
+  string: (t) => typeof t == "string",
+  stringOrUint8Array: (t) => typeof t == "string" || h(t),
+  isSafeInteger: (t) => Number.isSafeInteger(t),
+  array: (t) => Array.isArray(t),
+  field: (t, n) => n.Fp.isValid(t),
+  hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
+};
+function K(t, n, r = {}) {
+  const e = (o, i, a) => {
+    const f = k[i];
+    if (typeof f != "function")
+      throw new Error("invalid validator function");
+    const c = t[o];
+    if (!(a && c === void 0) && !f(c, t))
+      throw new Error("param " + String(o) + " is invalid. Expected " + i + ", got " + c);
+  };
+  for (const [o, i] of Object.entries(n))
+    e(o, i, !1);
+  for (const [o, i] of Object.entries(r))
+    e(o, i, !0);
+  return t;
+}
+const Q = () => {
+  throw new Error("not implemented");
+};
+function X(t) {
+  const n = /* @__PURE__ */ new WeakMap();
+  return (r, ...e) => {
+    const o = n.get(r);
+    if (o !== void 0)
+      return o;
+    const i = t(r, ...e);
+    return n.set(r, i), i;
+  };
+}
+export {
+  D as aInRange,
+  O as abool,
+  b as abytes,
+  P as bitGet,
+  G as bitLen,
+  q as bitMask,
+  W as bitSet,
+  B as bytesToHex,
+  V as bytesToNumberBE,
+  H as bytesToNumberLE,
+  _ as concatBytes,
+  J as createHmacDrbg,
+  R as ensureBytes,
+  j as equalBytes,
+  m as hexToBytes,
+  U as hexToNumber,
+  N as inRange,
+  h as isBytes,
+  X as memoized,
+  Q as notImplemented,
+  v as numberToBytesBE,
+  C as numberToBytesLE,
+  S as numberToHexUnpadded,
+  M as numberToVarBytesBE,
+  z as utf8ToBytes,
+  K as validateObject
+};

package/dist/index117.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const A=require("./index107.cjs"),y=require("./index116.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const I=BigInt(0),p=BigInt(1);function m(e,r){const t=r.negate();return e?t:r}function E(e,r){if(!Number.isSafeInteger(e)||e<=0||e>r)throw new Error("invalid window size, expected [1.."+r+"], got W="+e)}function b(e,r){E(e,r);const t=Math.ceil(r/e)+1,n=2**(e-1);return{windows:t,windowSize:n}}function O(e,r){if(!Array.isArray(e))throw new Error("array expected");e.forEach((t,n)=>{if(!(t instanceof r))throw new Error("invalid point at index "+n)})}function x(e,r){if(!Array.isArray(e))throw new Error("array of scalars expected");e.forEach((t,n)=>{if(!r.isValid(t))throw new Error("invalid scalar at index "+n)})}const B=new WeakMap,N=new WeakMap;function S(e){return N.get(e)||1}function L(e,r){return{constTimeNegate:m,hasPrecomputes(t){return S(t)!==1},unsafeLadder(t,n,o=e.ZERO){let i=t;for(;n>I;)n&p&&(o=o.add(i)),i=i.double(),n>>=p;return o},precomputeWindow(t,n){const{windows:o,windowSize:i}=b(n,r),a=[];let c=t,d=c;for(let g=0;g<o;g++){d=c,a.push(d);for(let l=1;l<i;l++)d=d.add(c),a.push(d);c=d.double()}return a},wNAF(t,n,o){const{windows:i,windowSize:a}=b(t,r);let c=e.ZERO,d=e.BASE;const g=BigInt(2**t-1),l=2**t,w=BigInt(t);for(let u=0;u<i;u++){const s=u*a;let f=Number(o&g);o>>=w,f>a&&(f-=l,o+=p);const h=s,M=s+Math.abs(f)-1,F=u%2!==0,z=f<0;f===0?d=d.add(m(F,n[h])):c=c.add(m(z,n[M]))}return{p:c,f:d}},wNAFUnsafe(t,n,o,i=e.ZERO){const{windows:a,windowSize:c}=b(t,r),d=BigInt(2**t-1),g=2**t,l=BigInt(t);for(let w=0;w<a;w++){const u=w*c;if(o===I)break;let s=Number(o&d);if(o>>=l,s>c&&(s-=g,o+=p),s===0)continue;let f=n[u+Math.abs(s)-1];s<0&&(f=f.negate()),i=i.add(f)}return i},getPrecomputes(t,n,o){let i=B.get(n);return i||(i=this.precomputeWindow(n,t),t!==1&&B.set(n,o(i))),i},wNAFCached(t,n,o){const i=S(t);return this.wNAF(i,this.getPrecomputes(i,t,o),n)},wNAFCachedUnsafe(t,n,o,i){const a=S(t);return a===1?this.unsafeLadder(t,n,i):this.wNAFUnsafe(a,this.getPrecomputes(a,t,o),n,i)},setWindowSize(t,n){E(n,r),N.set(t,n),B.delete(t)}}}function j(e,r,t,n){if(O(t,e),x(n,r),t.length!==n.length)throw new Error("arrays of points and scalars must have equal length");const o=e.ZERO,i=y.bitLen(BigInt(t.length)),a=i>12?i-3:i>4?i-2:i?2:1,c=(1<<a)-1,d=new Array(c+1).fill(o),g=Math.floor((r.BITS-1)/a)*a;let l=o;for(let w=g;w>=0;w-=a){d.fill(o);for(let s=0;s<n.length;s++){const f=n[s],h=Number(f>>BigInt(w)&BigInt(c));d[h]=d[h].add(t[s])}let u=o;for(let s=d.length-1,f=o;s>0;s--)f=f.add(d[s]),u=u.add(f);if(l=l.add(u),w!==0)for(let s=0;s<a;s++)l=l.double()}return l}function k(e){return A.validateField(e.Fp),y.validateObject(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...A.nLength(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}exports.pippenger=j;exports.validateBasic=k;exports.wNAF=L;

package/dist/index117.js

@@ -0,0 +1,175 @@
+import { validateField as z, nLength as F } from "./index107.js";
+import { validateObject as x, bitLen as O } from "./index116.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const I = BigInt(0), p = BigInt(1);
+function m(e, r) {
+  const t = r.negate();
+  return e ? t : r;
+}
+function A(e, r) {
+  if (!Number.isSafeInteger(e) || e <= 0 || e > r)
+    throw new Error("invalid window size, expected [1.." + r + "], got W=" + e);
+}
+function b(e, r) {
+  A(e, r);
+  const t = Math.ceil(r / e) + 1, n = 2 ** (e - 1);
+  return { windows: t, windowSize: n };
+}
+function L(e, r) {
+  if (!Array.isArray(e))
+    throw new Error("array expected");
+  e.forEach((t, n) => {
+    if (!(t instanceof r))
+      throw new Error("invalid point at index " + n);
+  });
+}
+function k(e, r) {
+  if (!Array.isArray(e))
+    throw new Error("array of scalars expected");
+  e.forEach((t, n) => {
+    if (!r.isValid(t))
+      throw new Error("invalid scalar at index " + n);
+  });
+}
+const B = /* @__PURE__ */ new WeakMap(), E = /* @__PURE__ */ new WeakMap();
+function S(e) {
+  return E.get(e) || 1;
+}
+function v(e, r) {
+  return {
+    constTimeNegate: m,
+    hasPrecomputes(t) {
+      return S(t) !== 1;
+    },
+    // non-const time multiplication ladder
+    unsafeLadder(t, n, i = e.ZERO) {
+      let o = t;
+      for (; n > I; )
+        n & p && (i = i.add(o)), o = o.double(), n >>= p;
+      return i;
+    },
+    /**
+     * Creates a wNAF precomputation window. Used for caching.
+     * Default window size is set by `utils.precompute()` and is equal to 8.
+     * Number of precomputed points depends on the curve size:
+     * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
+     * - 𝑊 is the window size
+     * - 𝑛 is the bitlength of the curve order.
+     * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
+     * @param elm Point instance
+     * @param W window size
+     * @returns precomputed point tables flattened to a single array
+     */
+    precomputeWindow(t, n) {
+      const { windows: i, windowSize: o } = b(n, r), a = [];
+      let c = t, d = c;
+      for (let h = 0; h < i; h++) {
+        d = c, a.push(d);
+        for (let w = 1; w < o; w++)
+          d = d.add(c), a.push(d);
+        c = d.double();
+      }
+      return a;
+    },
+    /**
+     * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
+     * @param W window size
+     * @param precomputes precomputed tables
+     * @param n scalar (we don't check here, but should be less than curve order)
+     * @returns real and fake (for const-time) points
+     */
+    wNAF(t, n, i) {
+      const { windows: o, windowSize: a } = b(t, r);
+      let c = e.ZERO, d = e.BASE;
+      const h = BigInt(2 ** t - 1), w = 2 ** t, l = BigInt(t);
+      for (let u = 0; u < o; u++) {
+        const s = u * a;
+        let f = Number(i & h);
+        i >>= l, f > a && (f -= w, i += p);
+        const g = s, N = s + Math.abs(f) - 1, y = u % 2 !== 0, M = f < 0;
+        f === 0 ? d = d.add(m(y, n[g])) : c = c.add(m(M, n[N]));
+      }
+      return { p: c, f: d };
+    },
+    /**
+     * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
+     * @param W window size
+     * @param precomputes precomputed tables
+     * @param n scalar (we don't check here, but should be less than curve order)
+     * @param acc accumulator point to add result of multiplication
+     * @returns point
+     */
+    wNAFUnsafe(t, n, i, o = e.ZERO) {
+      const { windows: a, windowSize: c } = b(t, r), d = BigInt(2 ** t - 1), h = 2 ** t, w = BigInt(t);
+      for (let l = 0; l < a; l++) {
+        const u = l * c;
+        if (i === I)
+          break;
+        let s = Number(i & d);
+        if (i >>= w, s > c && (s -= h, i += p), s === 0)
+          continue;
+        let f = n[u + Math.abs(s) - 1];
+        s < 0 && (f = f.negate()), o = o.add(f);
+      }
+      return o;
+    },
+    getPrecomputes(t, n, i) {
+      let o = B.get(n);
+      return o || (o = this.precomputeWindow(n, t), t !== 1 && B.set(n, i(o))), o;
+    },
+    wNAFCached(t, n, i) {
+      const o = S(t);
+      return this.wNAF(o, this.getPrecomputes(o, t, i), n);
+    },
+    wNAFCachedUnsafe(t, n, i, o) {
+      const a = S(t);
+      return a === 1 ? this.unsafeLadder(t, n, o) : this.wNAFUnsafe(a, this.getPrecomputes(a, t, i), n, o);
+    },
+    // We calculate precomputes for elliptic curve point multiplication
+    // using windowed method. This specifies window size and
+    // stores precomputed values. Usually only base point would be precomputed.
+    setWindowSize(t, n) {
+      A(n, r), E.set(t, n), B.delete(t);
+    }
+  };
+}
+function Z(e, r, t, n) {
+  if (L(t, e), k(n, r), t.length !== n.length)
+    throw new Error("arrays of points and scalars must have equal length");
+  const i = e.ZERO, o = O(BigInt(t.length)), a = o > 12 ? o - 3 : o > 4 ? o - 2 : o ? 2 : 1, c = (1 << a) - 1, d = new Array(c + 1).fill(i), h = Math.floor((r.BITS - 1) / a) * a;
+  let w = i;
+  for (let l = h; l >= 0; l -= a) {
+    d.fill(i);
+    for (let s = 0; s < n.length; s++) {
+      const f = n[s], g = Number(f >> BigInt(l) & BigInt(c));
+      d[g] = d[g].add(t[s]);
+    }
+    let u = i;
+    for (let s = d.length - 1, f = i; s > 0; s--)
+      f = f.add(d[s]), u = u.add(f);
+    if (w = w.add(u), l !== 0)
+      for (let s = 0; s < a; s++)
+        w = w.double();
+  }
+  return w;
+}
+function U(e) {
+  return z(e.Fp), x(e, {
+    n: "bigint",
+    h: "bigint",
+    Gx: "field",
+    Gy: "field"
+  }, {
+    nBitLength: "isSafeInteger",
+    nByteLength: "isSafeInteger"
+  }), Object.freeze({
+    ...F(e.n, e.nBitLength),
+    ...e,
+    p: e.Fp.ORDER
+  });
+}
+export {
+  Z as pippenger,
+  U as validateBasic,
+  v as wNAF
+};

package/dist/index12.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var p=(a,t,e)=>{if(!t.has(a))throw TypeError("Cannot "+e)},u=(a,t,e)=>(p(a,t,"read from private field"),e?e.call(a):t.get(a)),w=(a,t,e)=>{if(t.has(a))throw TypeError("Cannot add the same private member more than once");t instanceof WeakSet?t.add(a):t.set(a,e)},f=(a,t,e,r)=>(p(a,t,"write to private field"),t.set(a,e),e);const d=a=>new Promise(t=>setTimeout(t,a));class g{constructor(t,e){this.maxRetries=Math.max(t,0),this.delay=e}async retry(t){let e=0,r;for(;e<this.maxRetries+1;)try{return await t()}catch(s){e++,r=s,await d(this.delay*e)}throw r}}const v=a=>{try{return JSON.parse(a)}catch{return a}};class m{static async _postWithFallback(t,e){let r="";for(const s of t)try{const i=await fetch(s,{method:"POST",...e});if(i.status>=500){r=await(i.text()||i.json());continue}return await this.parse(i)}catch(i){r=y(i);continue}throw new Error(r||"All APIs failed")}static async postWithFallback(t,e){return await n(e).retry(()=>this._postWithFallback(t,e))}static async _getWithFallback(t,e){let r="";for(const s of t)try{const i=await fetch(s,e);if(i.status>=500){r=await(i.text()||i.json());continue}return await this.parse(i)}catch(i){r=y(i);continue}throw new Error(r||"All APIs failed")}static async getWithFallback(t,e){return await n(e).retry(()=>this._getWithFallback(t,e))}static async _get(t,e){return await this.parse(await fetch(t,e))}static async get(t,e){return await n(e).retry(()=>this._get(t,e))}static async _post(t,e){return await this.parse(await fetch(t,{method:"POST",...e}))}static async post(t,e){return await n(e).retry(()=>this._post(t,e))}static async parse(t){const e=await t.text();if(t.status>=200&&t.status<300)return v(e);throw new Error(e)}}function y(a){return(a==null?void 0:a.message)||(a==null?void 0:a.toString())||"unknown error"}const n=a=>new g((a==null?void 0:a.retryCount)??2,(a==null?void 0:a.retryDelay)??1e3);var o,c,l;class h{constructor(t,e,r=void 0){w(this,o,void 0),w(this,c,void 0),w(this,l,void 0),f(this,o,t),f(this,l,r),f(this,c,e)}get ok(){return u(this,o)}get error(){return u(this,l)}get val(){return u(this,c)}}o=new WeakMap,c=new WeakMap,l=new WeakMap;const k=a=>new h(!0,a),W=(a,...t)=>{if(typeof a=="string"&&t&&t.length>0){let e=[a,...t].map(r=>{if(r){if(r instanceof Error)return r.message;if(typeof r=="string")return r;if(r!=null&&r.toString)return r.toString()}});return new h(!1,null,e.filter(r=>r!==void 0).join(" "))}return new h(!1,null,a)};exports.Err=W;exports.Fetcher=m;exports.Ok=k;exports.Result=h;exports.Retry=g;exports.safeParseJson=v;exports.sleep=d;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});class r{constructor(){this.memory=new Map}getItem(e){return this.memory.has(e)?this.memory.get(e):null}setItem(e,t){this.memory.set(e,t)}removeItem(e){this.memory.has(e)&&this.memory.delete(e)}}exports.MemoryStorage=r;

package/dist/index12.js

@@ -1,190 +1,17 @@
-var p = (e, t, a) => {
-  if (!t.has(e))
-    throw TypeError("Cannot " + a);
-}, h = (e, t, a) => (p(e, t, "read from private field"), a ? a.call(e) : t.get(e)), u = (e, t, a) => {
-  if (t.has(e))
-    throw TypeError("Cannot add the same private member more than once");
-  t instanceof WeakSet ? t.add(e) : t.set(e, a);
-}, w = (e, t, a, r) => (p(e, t, "write to private field"), t.set(e, a), a);
-const d = (e) => new Promise((t) => setTimeout(t, e));
-class g {
-  /**
-   * @param {number} maxRetries - The maximum number of retries, if less < 0 then it is set to 0
-   * @param {number} delay - The delay between retries
-   */
-  constructor(t, a) {
-    this.maxRetries = Math.max(t, 0), this.delay = a;
-  }
-  /**
-   * Retries a function until it succeeds or the max number of retries is reached
-   *
-   * @param {() => Promise<T>} fn - The function to retry
-   * @return {Promise<T>} a Promise that resolves to the result of the function
-   */
-  async retry(t) {
-    let a = 0, r;
-    for (; a < this.maxRetries + 1; )
-      try {
-        return await t();
-      } catch (i) {
-        a++, r = i, await d(this.delay * a);
-      }
-    throw r;
-  }
-}
-const v = (e) => {
-  try {
-    return JSON.parse(e);
-  } catch {
-    return e;
-  }
-};
 class m {
-  static async _postWithFallback(t, a) {
-    let r = "";
-    for (const i of t)
-      try {
-        const s = await fetch(i, {
-          method: "POST",
-          ...a
-        });
-        if (s.status >= 500) {
-          r = await (s.text() || s.json());
-          continue;
-        }
-        return await this.parse(s);
-      } catch (s) {
-        r = y(s);
-        continue;
-      }
-    throw new Error(r || "All APIs failed");
-  }
-  /**
-   * Asynchronously sends a POST request to multiple URLs with fallback logic.
-   *
-   * @param {string[]} input - array of URLs to send the POST request to
-   * @param {RequestInit} [init] - optional request initialization options
-   * @return {Promise<T>} a Promise that resolves to the parsed response data
-   */
-  static async postWithFallback(t, a) {
-    return await n(a).retry(
-      () => this._postWithFallback(t, a)
-    );
-  }
-  static async _getWithFallback(t, a) {
-    let r = "";
-    for (const i of t)
-      try {
-        const s = await fetch(i, a);
-        if (s.status >= 500) {
-          r = await (s.text() || s.json());
-          continue;
-        }
-        return await this.parse(s);
-      } catch (s) {
-        r = y(s);
-        continue;
-      }
-    throw new Error(r || "All APIs failed");
-  }
-  /**
-   * Asynchronously sends a POST request to multiple URLs with fallback mechanism.
-   *
-   * @param {string[]} input - An array of URLs to retrieve data from.
-   * @param {RequestInit} [init] - Optional request options.
-   * @return {Promise<T>} A promise that resolves to the retrieved data.
-   */
-  static async getWithFallback(t, a) {
-    return await n(a).retry(
-      () => this._getWithFallback(t, a)
-    );
-  }
-  static async _get(t, a) {
-    return await this.parse(await fetch(t, a));
+  constructor() {
+    this.memory = /* @__PURE__ */ new Map();
   }
-  /**
-   * Asynchronously retrieves data of type T from the specified URL or RequestInfo, with optional initialization options.
-   *
-   * @param {RequestInfo | URL} input - The URL or RequestInfo to fetch data from
-   * @param {RequestInit} init - Optional initialization options for the fetch request
-   * @return {Promise<T>} The retrieved data of type T
-   */
-  static async get(t, a) {
-    return await n(a).retry(() => this._get(t, a));
+  getItem(e) {
+    return this.memory.has(e) ? this.memory.get(e) : null;
   }
-  static async _post(t, a) {
-    return await this.parse(
-      await fetch(t, {
-        method: "POST",
-        ...a
-      })
-    );
+  setItem(e, t) {
+    this.memory.set(e, t);
   }
-  /**
-   * Asynchronously sends a POST request to the specified URL or RequestInfo, with optional initialization options.
-   */
-  static async post(t, a) {
-    return await n(a).retry(() => this._post(t, a));
+  removeItem(e) {
+    this.memory.has(e) && this.memory.delete(e);
   }
-  /**
-   * Parses the response and returns the result as the specified type.
-   *
-   * @param {Response} res - the response object to be parsed
-   * @return {Promise<T>} the parsed result of type T
-   */
-  static async parse(t) {
-    const a = await t.text();
-    if (t.status >= 200 && t.status < 300)
-      return v(a);
-    throw new Error(a);
-  }
-}
-function y(e) {
-  return (e == null ? void 0 : e.message) || (e == null ? void 0 : e.toString()) || "unknown error";
 }
-const n = (e) => new g((e == null ? void 0 : e.retryCount) ?? 2, (e == null ? void 0 : e.retryDelay) ?? 1e3);
-var o, c, l;
-class f {
-  constructor(t, a, r = void 0) {
-    u(this, o, void 0), u(this, c, void 0), u(this, l, void 0), w(this, o, t), w(this, l, r), w(this, c, a);
-  }
-  get ok() {
-    return h(this, o);
-  }
-  get error() {
-    return h(this, l);
-  }
-  get val() {
-    return h(this, c);
-  }
-}
-o = /* @__PURE__ */ new WeakMap(), c = /* @__PURE__ */ new WeakMap(), l = /* @__PURE__ */ new WeakMap();
-const k = (e) => new f(!0, e), W = (e, ...t) => {
-  if (typeof e == "string" && t && t.length > 0) {
-    let a = [e, ...t].map((r) => {
-      if (r) {
-        if (r instanceof Error)
-          return r.message;
-        if (typeof r == "string")
-          return r;
-        if (r != null && r.toString)
-          return r.toString();
-      }
-    });
-    return new f(
-      !1,
-      null,
-      a.filter((r) => r !== void 0).join(" ")
-    );
-  }
-  return new f(!1, null, e);
-};
 export {
-  W as Err,
-  m as Fetcher,
-  k as Ok,
-  f as Result,
-  g as Retry,
-  v as safeParseJson,
-  d as sleep
+  m as MemoryStorage
 };

package/dist/index13.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const M=require("./index18.cjs"),k=require("./index24.cjs"),g=require("./index30.cjs"),O=require("./index31.cjs"),S=require("./index34.cjs"),y=require("./index35.cjs"),$=require("./index33.cjs"),P=require("./index17.cjs"),W=require("./index23.cjs"),q=require("./index26.cjs"),x=require("./index28.cjs");async function z(n,{confirmations:c=1,hash:p,onReplaced:h,pollingInterval:m=n.pollingInterval,retryCount:w=6,retryDelay:R=({count:d})=>~~(1<<d)*200,timeout:N=18e4}){const d=$.stringify(["waitForTransactionReceipt",n.uid,p]);let a,o,e,i=!1;const{promise:B,resolve:F,reject:v}=S.withResolvers(),A=N?setTimeout(()=>v(new k.WaitForTransactionReceiptTimeoutError({hash:p})),N):void 0,j=O.observe(d,{onReplaced:h,resolve:F,reject:v},r=>{const E=g.getAction(n,x.watchBlockNumber,"watchBlockNumber")({emitMissed:!0,emitOnBegin:!0,poll:!0,pollingInterval:m,async onBlockNumber(_){const u=b=>{clearTimeout(A),E(),b(),j()};let l=_;if(!i)try{if(e){if(c>1&&(!e.blockNumber||l-e.blockNumber+1n<c))return;u(()=>r.resolve(e));return}if(a||(i=!0,await y.withRetry(async()=>{a=await g.getAction(n,W.getTransaction,"getTransaction")({hash:p}),a.blockNumber&&(l=a.blockNumber)},{delay:R,retryCount:w}),i=!1),e=await g.getAction(n,q.getTransactionReceipt,"getTransactionReceipt")({hash:p}),c>1&&(!e.blockNumber||l-e.blockNumber+1n<c))return;u(()=>r.resolve(e))}catch(b){if(b instanceof k.TransactionNotFoundError||b instanceof k.TransactionReceiptNotFoundError){if(!a){i=!1;return}try{o=a,i=!0;const f=await y.withRetry(()=>g.getAction(n,P.getBlock,"getBlock")({blockNumber:l,includeTransactions:!0}),{delay:R,retryCount:w,shouldRetry:({error:s})=>s instanceof M.BlockNotFoundError});i=!1;const t=f.transactions.find(({from:s,nonce:I})=>s===o.from&&I===o.nonce);if(!t||(e=await g.getAction(n,q.getTransactionReceipt,"getTransactionReceipt")({hash:t.hash}),c>1&&(!e.blockNumber||l-e.blockNumber+1n<c)))return;let T="replaced";t.to===o.to&&t.value===o.value&&t.input===o.input?T="repriced":t.from===t.to&&t.value===0n&&(T="cancelled"),u(()=>{var s;(s=r.onReplaced)==null||s.call(r,{reason:T,replacedTransaction:o,transaction:t,transactionReceipt:e}),r.resolve(e)})}catch(f){u(()=>r.reject(f))}}else u(()=>r.reject(b))}}})});return B}exports.waitForTransactionReceipt=z;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var t=(e=>(e.AUTH_TOKEN="auth_token",e))(t||{});exports.StoreKeys=t;