@gardenfi/swap 0.0.1 → 0.0.2

package/dist/index38.js

@@ -0,0 +1,153 @@
+import e, { useState as x, useRef as b, useMemo as p } from "react";
+import { Typography as f, InfoIcon as k, GasStationIcon as I, KeyboardDownIcon as $ } from "@gardenfi/garden-book";
+import { isBitcoin as h, isSolana as u } from "@gardenfi/orderbook";
+import { AnimatePresence as w, motion as n } from "framer-motion";
+import { formatAmount as S, formatAmountUsd as D } from "./index34.js";
+import { delayedFadeAnimation as d } from "./index64.js";
+import { swapStore as F } from "./index6.js";
+import { SwapSavingsAndAddresses as R } from "./index65.js";
+import { useAddresses as z } from "./index25.js";
+const N = ({
+  inputAsset: t,
+  outputAsset: s,
+  formattedRate: l,
+  formattedTokenPrice: i,
+  className: a = ""
+}) => /* @__PURE__ */ e.createElement("div", { className: "flex min-w-fit items-center gap-1" }, /* @__PURE__ */ e.createElement(
+  f,
+  {
+    size: "h5",
+    weight: "regular",
+    className: `!text-nowrap ${a}`
+  },
+  "1 ",
+  t == null ? void 0 : t.symbol,
+  " ≈"
+), /* @__PURE__ */ e.createElement(
+  f,
+  {
+    size: "h5",
+    weight: "regular",
+    className: `!text-nowrap ${a}`
+  },
+  l && `${l} ${s == null ? void 0 : s.symbol}`,
+  i && `$${i}`
+)), O = () => {
+  const [t, s] = x(!1), [, l] = x(!1), i = b(null), {
+    inputAsset: a,
+    outputAsset: r,
+    // rate,
+    networkFees: g
+    // showComparisonHandler,
+  } = F(), { solanaAddress: m, bitcoinAddress: c, evmAddress: o } = z(), E = p(
+    () => S((a == null ? void 0 : a.price) ?? 0, 0, 2),
+    [a == null ? void 0 : a.price]
+  ), v = p(
+    () => a ? h(a.chain) ? c : u(a.chain) ? m : o : void 0,
+    [a, c, m, o]
+  ), y = p(
+    () => r ? h(r.chain) ? c : u(r.chain) ? m : o : void 0,
+    [r, c, m, o]
+  );
+  return /* @__PURE__ */ e.createElement("div", { className: "flex flex-col rounded-2xl bg-white/50 pb-4 mt-3 transition-all duration-200" }, /* @__PURE__ */ e.createElement("div", { className: "flex w-full items-center justify-between rounded-2xl px-4 pt-4" }, /* @__PURE__ */ e.createElement("div", { className: "relative flex w-full items-center justify-start gap-1" }, /* @__PURE__ */ e.createElement(w, { mode: "wait" }, t ? /* @__PURE__ */ e.createElement(
+    n.div,
+    {
+      key: "expanded",
+      className: "w-fit",
+      ...d
+    },
+    /* @__PURE__ */ e.createElement("div", { className: "flex items-center gap-1" }, /* @__PURE__ */ e.createElement(
+      f,
+      {
+        size: "h5",
+        weight: "regular",
+        className: "!text-mid-grey"
+      },
+      "Rate"
+    ), /* @__PURE__ */ e.createElement(
+      "span",
+      {
+        ref: i,
+        className: "inline-block cursor-pointer",
+        onMouseEnter: () => l(!0),
+        onMouseLeave: () => l(!1)
+      },
+      /* @__PURE__ */ e.createElement(k, { className: "h-3 w-3 !fill-mid-grey" })
+    ))
+  ) : /* @__PURE__ */ e.createElement(
+    n.div,
+    {
+      key: "collapsed",
+      className: "w-fit",
+      ...d
+    },
+    /* @__PURE__ */ e.createElement(
+      N,
+      {
+        inputAsset: a,
+        outputAsset: r,
+        formattedTokenPrice: E,
+        className: "!text-mid-grey"
+      }
+    )
+  ))), /* @__PURE__ */ e.createElement("div", { className: "flex w-full items-center justify-end gap-1" }, /* @__PURE__ */ e.createElement(w, { mode: "wait" }, t ? /* @__PURE__ */ e.createElement(
+    n.div,
+    {
+      key: "expanded",
+      className: "w-fit",
+      ...d
+    },
+    /* @__PURE__ */ e.createElement(
+      N,
+      {
+        inputAsset: a,
+        outputAsset: r,
+        formattedTokenPrice: E
+      }
+    )
+  ) : /* @__PURE__ */ e.createElement(
+    n.div,
+    {
+      key: "collapsed",
+      className: "w-fit",
+      ...d
+    },
+    /* @__PURE__ */ e.createElement("div", { className: "flex min-w-fit items-center gap-1" }, /* @__PURE__ */ e.createElement(I, { className: "h-3 w-3" }), /* @__PURE__ */ e.createElement(
+      f,
+      {
+        size: "h5",
+        weight: "regular",
+        className: "!text-nowrap"
+      },
+      "Free"
+    ))
+  ))), /* @__PURE__ */ e.createElement(
+    n.div,
+    {
+      initial: { width: 0, scale: 0, opacity: 0 },
+      animate: { width: "auto", scale: 1, opacity: 1 },
+      exit: { width: 0, scale: 0, opacity: 0 },
+      transition: { duration: 0.2, ease: "easeInOut" },
+      className: "pl-1"
+    },
+    /* @__PURE__ */ e.createElement(
+      $,
+      {
+        className: `h-4 w-4 cursor-pointer px-1 transition-transform duration-300 ${t ? "rotate-180" : ""}`,
+        onClick: () => s(!t)
+      }
+    )
+  )), /* @__PURE__ */ e.createElement(w, null, t && /* @__PURE__ */ e.createElement(
+    R,
+    {
+      refundAddress: v,
+      receiveAddress: y,
+      showComparison: () => {
+      },
+      networkFeesValue: Number(D(g, 0))
+    }
+  )));
+};
+export {
+  O as FeesAndRateDetails
+};

package/dist/index380.cjs

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

package/dist/index380.js

@@ -0,0 +1,180 @@
+import { validateField as M, nLength as z } from "./index351.js";
+import { validateObject as O, bitLen as k, bitMask as x } from "./index359.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const E = BigInt(0), F = BigInt(1);
+function m(e, a) {
+  const t = a.negate();
+  return e ? t : a;
+}
+function y(e, a) {
+  if (!Number.isSafeInteger(e) || e <= 0 || e > a)
+    throw new Error("invalid window size, expected [1.." + a + "], got W=" + e);
+}
+function N(e, a) {
+  y(e, a);
+  const t = Math.ceil(a / e) + 1, n = 2 ** (e - 1), i = 2 ** e, o = x(e), r = BigInt(e);
+  return { windows: t, windowSize: n, mask: o, maxNumber: i, shiftBy: r };
+}
+function B(e, a, t) {
+  const { windowSize: n, mask: i, maxNumber: o, shiftBy: r } = t;
+  let f = Number(e & i), s = e >> r;
+  f > n && (f -= o, s += F);
+  const c = a * n, d = c + Math.abs(f) - 1, g = f === 0, l = f < 0, u = a % 2 !== 0;
+  return { nextN: s, offset: d, isZero: g, isNeg: l, isNegF: u, offsetF: c };
+}
+function L(e, a) {
+  if (!Array.isArray(e))
+    throw new Error("array expected");
+  e.forEach((t, n) => {
+    if (!(t instanceof a))
+      throw new Error("invalid point at index " + n);
+  });
+}
+function Z(e, a) {
+  if (!Array.isArray(e))
+    throw new Error("array of scalars expected");
+  e.forEach((t, n) => {
+    if (!a.isValid(t))
+      throw new Error("invalid scalar at index " + n);
+  });
+}
+const b = /* @__PURE__ */ new WeakMap(), I = /* @__PURE__ */ new WeakMap();
+function S(e) {
+  return I.get(e) || 1;
+}
+function v(e, a) {
+  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 > E; )
+        n & F && (i = i.add(o)), o = o.double(), n >>= F;
+      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 } = N(n, a), r = [];
+      let f = t, s = f;
+      for (let c = 0; c < i; c++) {
+        s = f, r.push(s);
+        for (let d = 1; d < o; d++)
+          s = s.add(f), r.push(s);
+        f = s.double();
+      }
+      return r;
+    },
+    /**
+     * 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) {
+      let o = e.ZERO, r = e.BASE;
+      const f = N(t, a);
+      for (let s = 0; s < f.windows; s++) {
+        const { nextN: c, offset: d, isZero: g, isNeg: l, isNegF: u, offsetF: h } = B(i, s, f);
+        i = c, g ? r = r.add(m(u, n[h])) : o = o.add(m(l, n[d]));
+      }
+      return { p: o, f: r };
+    },
+    /**
+     * 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 r = N(t, a);
+      for (let f = 0; f < r.windows && i !== E; f++) {
+        const { nextN: s, offset: c, isZero: d, isNeg: g } = B(i, f, r);
+        if (i = s, !d) {
+          const l = n[c];
+          o = o.add(g ? l.negate() : l);
+        }
+      }
+      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 r = S(t);
+      return r === 1 ? this.unsafeLadder(t, n, o) : this.wNAFUnsafe(r, this.getPrecomputes(r, 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) {
+      y(n, a), I.set(t, n), b.delete(t);
+    }
+  };
+}
+function U(e, a, t, n) {
+  L(t, e), Z(n, a);
+  const i = t.length, o = n.length;
+  if (i !== o)
+    throw new Error("arrays of points and scalars must have equal length");
+  const r = e.ZERO, f = k(BigInt(i));
+  let s = 1;
+  f > 12 ? s = f - 3 : f > 4 ? s = f - 2 : f > 0 && (s = 2);
+  const c = x(s), d = new Array(Number(c) + 1).fill(r), g = Math.floor((a.BITS - 1) / s) * s;
+  let l = r;
+  for (let u = g; u >= 0; u -= s) {
+    d.fill(r);
+    for (let w = 0; w < o; w++) {
+      const p = n[w], A = Number(p >> BigInt(u) & c);
+      d[A] = d[A].add(t[w]);
+    }
+    let h = r;
+    for (let w = d.length - 1, p = r; w > 0; w--)
+      p = p.add(d[w]), h = h.add(p);
+    if (l = l.add(h), u !== 0)
+      for (let w = 0; w < s; w++)
+        l = l.double();
+  }
+  return l;
+}
+function C(e) {
+  return M(e.Fp), O(e, {
+    n: "bigint",
+    h: "bigint",
+    Gx: "field",
+    Gy: "field"
+  }, {
+    nBitLength: "isSafeInteger",
+    nByteLength: "isSafeInteger"
+  }), Object.freeze({
+    ...z(e.n, e.nBitLength),
+    ...e,
+    p: e.Fp.ORDER
+  });
+}
+export {
+  U as pippenger,
+  C as validateBasic,
+  v as wNAF
+};

package/dist/index381.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const g=require("./index352.cjs"),x=require("./index281.cjs"),y=require("./index282.cjs"),U=require("./index278.cjs"),c=require("./index277.cjs"),V=require("./index287.cjs");function l(e,t,s){const{checksumAddress:n,staticPosition:o}=s,r=P(t.type);if(r){const[i,a]=r;return I(e,{...t,type:a},{checksumAddress:n,length:i,staticPosition:o})}if(t.type==="tuple")return k(e,t,{checksumAddress:n,staticPosition:o});if(t.type==="address")return C(e,{checksum:n});if(t.type==="bool")return L(e);if(t.type.startsWith("bytes"))return E(e,t,{staticPosition:o});if(t.type.startsWith("uint")||t.type.startsWith("int"))return W(e,t);if(t.type==="string")return O(e,{staticPosition:o});throw new g.InvalidTypeError(t.type)}const S=32,z=32;function C(e,t={}){const{checksum:s=!1}=t,n=e.readBytes(32);return[(r=>s?x.checksum(r):r)(c.fromBytes(y.slice(n,-20))),32]}function I(e,t,s){const{checksumAddress:n,length:o,staticPosition:r}=s;if(!o){const d=y.toNumber(e.readBytes(z)),f=r+d,u=f+S;e.setPosition(f);const m=y.toNumber(e.readBytes(S)),h=p(t);let b=0;const w=[];for(let N=0;N<m;++N){e.setPosition(u+(h?N*32:b));const[j,H]=l(e,t,{checksumAddress:n,staticPosition:u});b+=H,w.push(j)}return e.setPosition(r+32),[w,32]}if(p(t)){const d=y.toNumber(e.readBytes(z)),f=r+d,u=[];for(let m=0;m<o;++m){e.setPosition(f+m*32);const[h]=l(e,t,{checksumAddress:n,staticPosition:f});u.push(h)}return e.setPosition(r+32),[u,32]}let i=0;const a=[];for(let d=0;d<o;++d){const[f,u]=l(e,t,{checksumAddress:n,staticPosition:r+i});i+=u,a.push(f)}return[a,i]}function L(e){return[y.toBoolean(e.readBytes(32),{size:32}),32]}function E(e,t,{staticPosition:s}){const[n,o]=t.type.split("bytes");if(!o){const i=y.toNumber(e.readBytes(32));e.setPosition(s+i);const a=y.toNumber(e.readBytes(32));if(a===0)return e.setPosition(s+32),["0x",32];const d=e.readBytes(a);return e.setPosition(s+32),[c.fromBytes(d),32]}return[c.fromBytes(e.readBytes(Number.parseInt(o,10),32)),32]}function W(e,t){const s=t.type.startsWith("int"),n=Number.parseInt(t.type.split("int")[1]||"256",10),o=e.readBytes(32);return[n>48?y.toBigInt(o,{signed:s}):y.toNumber(o,{signed:s}),32]}function k(e,t,s){const{checksumAddress:n,staticPosition:o}=s,r=t.components.length===0||t.components.some(({name:d})=>!d),i=r?[]:{};let a=0;if(p(t)){const d=y.toNumber(e.readBytes(z)),f=o+d;for(let u=0;u<t.components.length;++u){const m=t.components[u];e.setPosition(f+a);const[h,b]=l(e,m,{checksumAddress:n,staticPosition:f});a+=b,i[r?u:m==null?void 0:m.name]=h}return e.setPosition(o+32),[i,32]}for(let d=0;d<t.components.length;++d){const f=t.components[d],[u,m]=l(e,f,{checksumAddress:n,staticPosition:o});i[r?d:f==null?void 0:f.name]=u,a+=m}return[i,a]}function O(e,{staticPosition:t}){const s=y.toNumber(e.readBytes(32)),n=t+s;e.setPosition(n);const o=y.toNumber(e.readBytes(32));if(o===0)return e.setPosition(t+32),["",32];const r=e.readBytes(o,32),i=y.toString(y.trimLeft(r));return e.setPosition(t+32),[i,32]}function F({checksumAddress:e,parameters:t,values:s}){const n=[];for(let o=0;o<t.length;o++)n.push(B({checksumAddress:e,parameter:t[o],value:s[o]}));return n}function B({checksumAddress:e=!1,parameter:t,value:s}){const n=t,o=P(n.type);if(o){const[r,i]=o;return _(s,{checksumAddress:e,length:r,parameter:{...n,type:i}})}if(n.type==="tuple")return D(s,{checksumAddress:e,parameter:n});if(n.type==="address")return T(s,{checksum:e});if(n.type==="bool")return R(s);if(n.type.startsWith("uint")||n.type.startsWith("int")){const r=n.type.startsWith("int"),[,,i="256"]=V.integerRegex.exec(n.type)??[];return M(s,{signed:r,size:Number(i)})}if(n.type.startsWith("bytes"))return q(s,{type:n.type});if(n.type==="string")return $(s);throw new g.InvalidTypeError(n.type)}function A(e){let t=0;for(let r=0;r<e.length;r++){const{dynamic:i,encoded:a}=e[r];i?t+=32:t+=c.size(a)}const s=[],n=[];let o=0;for(let r=0;r<e.length;r++){const{dynamic:i,encoded:a}=e[r];i?(s.push(c.fromNumber(t+o,{size:32})),n.push(a),o+=c.size(a)):s.push(a)}return c.concat(...s,...n)}function T(e,t){const{checksum:s=!1}=t;return x.assert(e,{strict:s}),{dynamic:!1,encoded:c.padLeft(e.toLowerCase())}}function _(e,t){const{checksumAddress:s,length:n,parameter:o}=t,r=n===null;if(!Array.isArray(e))throw new g.InvalidArrayError(e);if(!r&&e.length!==n)throw new g.ArrayLengthMismatchError({expectedLength:n,givenLength:e.length,type:`${o.type}[${n}]`});let i=!1;const a=[];for(let d=0;d<e.length;d++){const f=B({checksumAddress:s,parameter:o,value:e[d]});f.dynamic&&(i=!0),a.push(f)}if(r||i){const d=A(a);if(r){const f=c.fromNumber(a.length,{size:32});return{dynamic:!0,encoded:a.length>0?c.concat(f,d):f}}if(i)return{dynamic:!0,encoded:d}}return{dynamic:!1,encoded:c.concat(...a.map(({encoded:d})=>d))}}function q(e,{type:t}){const[,s]=t.split("bytes"),n=c.size(e);if(!s){let o=e;return n%32!==0&&(o=c.padRight(o,Math.ceil((e.length-2)/2/32)*32)),{dynamic:!0,encoded:c.concat(c.padLeft(c.fromNumber(n,{size:32})),o)}}if(n!==Number.parseInt(s,10))throw new g.BytesSizeMismatchError({expectedSize:Number.parseInt(s,10),value:e});return{dynamic:!1,encoded:c.padRight(e)}}function R(e){if(typeof e!="boolean")throw new U.BaseError(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);return{dynamic:!1,encoded:c.padLeft(c.fromBoolean(e))}}function M(e,{signed:t,size:s}){if(typeof s=="number"){const n=2n**(BigInt(s)-(t?1n:0n))-1n,o=t?-n-1n:0n;if(e>n||e<o)throw new c.IntegerOutOfRangeError({max:n.toString(),min:o.toString(),signed:t,size:s/8,value:e.toString()})}return{dynamic:!1,encoded:c.fromNumber(e,{size:32,signed:t})}}function $(e){const t=c.fromString(e),s=Math.ceil(c.size(t)/32),n=[];for(let o=0;o<s;o++)n.push(c.padRight(c.slice(t,o*32,(o+1)*32)));return{dynamic:!0,encoded:c.concat(c.padRight(c.fromNumber(c.size(t),{size:32})),...n)}}function D(e,t){const{checksumAddress:s,parameter:n}=t;let o=!1;const r=[];for(let i=0;i<n.components.length;i++){const a=n.components[i],d=Array.isArray(e)?i:a.name,f=B({checksumAddress:s,parameter:a,value:e[d]});r.push(f),f.dynamic&&(o=!0)}return{dynamic:o,encoded:o?A(r):c.concat(...r.map(({encoded:i})=>i))}}function P(e){const t=e.match(/^(.*)\[(\d+)?\]$/);return t?[t[2]?Number(t[2]):null,t[1]]:void 0}function p(e){var n;const{type:t}=e;if(t==="string"||t==="bytes"||t.endsWith("[]"))return!0;if(t==="tuple")return(n=e.components)==null?void 0:n.some(p);const s=P(e.type);return!!(s&&p({...e,type:s[1]}))}exports.decodeAddress=C;exports.decodeArray=I;exports.decodeBool=L;exports.decodeBytes=E;exports.decodeNumber=W;exports.decodeParameter=l;exports.decodeString=O;exports.decodeTuple=k;exports.encode=A;exports.encodeAddress=T;exports.encodeArray=_;exports.encodeBoolean=R;exports.encodeBytes=q;exports.encodeNumber=M;exports.encodeString=$;exports.encodeTuple=D;exports.getArrayComponents=P;exports.hasDynamicChild=p;exports.prepareParameter=B;exports.prepareParameters=F;

package/dist/index381.js

@@ -0,0 +1,346 @@
+import { InvalidTypeError as C, InvalidArrayError as _, ArrayLengthMismatchError as $, BytesSizeMismatchError as O } from "./index352.js";
+import { checksum as M, assert as R } from "./index281.js";
+import { toNumber as u, slice as T, toBoolean as D, toBigInt as U, toString as V, trimLeft as j } from "./index282.js";
+import { BaseError as q } from "./index278.js";
+import { size as h, fromNumber as B, concat as m, fromBytes as w, padLeft as S, fromBoolean as F, IntegerOutOfRangeError as G, padRight as b, fromString as H, slice as J } from "./index277.js";
+import { integerRegex as K } from "./index287.js";
+function p(t, e, o) {
+  const { checksumAddress: n, staticPosition: s } = o, i = I(e.type);
+  if (i) {
+    const [r, d] = i;
+    return X(t, { ...e, type: d }, { checksumAddress: n, length: r, staticPosition: s });
+  }
+  if (e.type === "tuple")
+    return tt(t, e, {
+      checksumAddress: n,
+      staticPosition: s
+    });
+  if (e.type === "address")
+    return Q(t, { checksum: n });
+  if (e.type === "bool")
+    return Y(t);
+  if (e.type.startsWith("bytes"))
+    return Z(t, e, { staticPosition: s });
+  if (e.type.startsWith("uint") || e.type.startsWith("int"))
+    return v(t, e);
+  if (e.type === "string")
+    return et(t, { staticPosition: s });
+  throw new C(e.type);
+}
+const k = 32, A = 32;
+function Q(t, e = {}) {
+  const { checksum: o = !1 } = e, n = t.readBytes(32);
+  return [((i) => o ? M(i) : i)(w(T(n, -20))), 32];
+}
+function X(t, e, o) {
+  const { checksumAddress: n, length: s, staticPosition: i } = o;
+  if (!s) {
+    const c = u(t.readBytes(A)), a = i + c, f = a + k;
+    t.setPosition(a);
+    const y = u(t.readBytes(k)), l = g(e);
+    let P = 0;
+    const N = [];
+    for (let z = 0; z < y; ++z) {
+      t.setPosition(f + (l ? z * 32 : P));
+      const [L, E] = p(t, e, {
+        checksumAddress: n,
+        staticPosition: f
+      });
+      P += E, N.push(L);
+    }
+    return t.setPosition(i + 32), [N, 32];
+  }
+  if (g(e)) {
+    const c = u(t.readBytes(A)), a = i + c, f = [];
+    for (let y = 0; y < s; ++y) {
+      t.setPosition(a + y * 32);
+      const [l] = p(t, e, {
+        checksumAddress: n,
+        staticPosition: a
+      });
+      f.push(l);
+    }
+    return t.setPosition(i + 32), [f, 32];
+  }
+  let r = 0;
+  const d = [];
+  for (let c = 0; c < s; ++c) {
+    const [a, f] = p(t, e, {
+      checksumAddress: n,
+      staticPosition: i + r
+    });
+    r += f, d.push(a);
+  }
+  return [d, r];
+}
+function Y(t) {
+  return [D(t.readBytes(32), { size: 32 }), 32];
+}
+function Z(t, e, { staticPosition: o }) {
+  const [n, s] = e.type.split("bytes");
+  if (!s) {
+    const r = u(t.readBytes(32));
+    t.setPosition(o + r);
+    const d = u(t.readBytes(32));
+    if (d === 0)
+      return t.setPosition(o + 32), ["0x", 32];
+    const c = t.readBytes(d);
+    return t.setPosition(o + 32), [w(c), 32];
+  }
+  return [w(t.readBytes(Number.parseInt(s, 10), 32)), 32];
+}
+function v(t, e) {
+  const o = e.type.startsWith("int"), n = Number.parseInt(e.type.split("int")[1] || "256", 10), s = t.readBytes(32);
+  return [
+    n > 48 ? U(s, { signed: o }) : u(s, { signed: o }),
+    32
+  ];
+}
+function tt(t, e, o) {
+  const { checksumAddress: n, staticPosition: s } = o, i = e.components.length === 0 || e.components.some(({ name: c }) => !c), r = i ? [] : {};
+  let d = 0;
+  if (g(e)) {
+    const c = u(t.readBytes(A)), a = s + c;
+    for (let f = 0; f < e.components.length; ++f) {
+      const y = e.components[f];
+      t.setPosition(a + d);
+      const [l, P] = p(t, y, {
+        checksumAddress: n,
+        staticPosition: a
+      });
+      d += P, r[i ? f : y == null ? void 0 : y.name] = l;
+    }
+    return t.setPosition(s + 32), [r, 32];
+  }
+  for (let c = 0; c < e.components.length; ++c) {
+    const a = e.components[c], [f, y] = p(t, a, {
+      checksumAddress: n,
+      staticPosition: s
+    });
+    r[i ? c : a == null ? void 0 : a.name] = f, d += y;
+  }
+  return [r, d];
+}
+function et(t, { staticPosition: e }) {
+  const o = u(t.readBytes(32)), n = e + o;
+  t.setPosition(n);
+  const s = u(t.readBytes(32));
+  if (s === 0)
+    return t.setPosition(e + 32), ["", 32];
+  const i = t.readBytes(s, 32), r = V(j(i));
+  return t.setPosition(e + 32), [r, 32];
+}
+function pt({ checksumAddress: t, parameters: e, values: o }) {
+  const n = [];
+  for (let s = 0; s < e.length; s++)
+    n.push(x({
+      checksumAddress: t,
+      parameter: e[s],
+      value: o[s]
+    }));
+  return n;
+}
+function x({ checksumAddress: t = !1, parameter: e, value: o }) {
+  const n = e, s = I(n.type);
+  if (s) {
+    const [i, r] = s;
+    return st(o, {
+      checksumAddress: t,
+      length: i,
+      parameter: {
+        ...n,
+        type: r
+      }
+    });
+  }
+  if (n.type === "tuple")
+    return dt(o, {
+      checksumAddress: t,
+      parameter: n
+    });
+  if (n.type === "address")
+    return nt(o, {
+      checksum: t
+    });
+  if (n.type === "bool")
+    return it(o);
+  if (n.type.startsWith("uint") || n.type.startsWith("int")) {
+    const i = n.type.startsWith("int"), [, , r = "256"] = K.exec(n.type) ?? [];
+    return rt(o, {
+      signed: i,
+      size: Number(r)
+    });
+  }
+  if (n.type.startsWith("bytes"))
+    return ot(o, { type: n.type });
+  if (n.type === "string")
+    return ct(o);
+  throw new C(n.type);
+}
+function W(t) {
+  let e = 0;
+  for (let i = 0; i < t.length; i++) {
+    const { dynamic: r, encoded: d } = t[i];
+    r ? e += 32 : e += h(d);
+  }
+  const o = [], n = [];
+  let s = 0;
+  for (let i = 0; i < t.length; i++) {
+    const { dynamic: r, encoded: d } = t[i];
+    r ? (o.push(B(e + s, { size: 32 })), n.push(d), s += h(d)) : o.push(d);
+  }
+  return m(...o, ...n);
+}
+function nt(t, e) {
+  const { checksum: o = !1 } = e;
+  return R(t, { strict: o }), {
+    dynamic: !1,
+    encoded: S(t.toLowerCase())
+  };
+}
+function st(t, e) {
+  const { checksumAddress: o, length: n, parameter: s } = e, i = n === null;
+  if (!Array.isArray(t))
+    throw new _(t);
+  if (!i && t.length !== n)
+    throw new $({
+      expectedLength: n,
+      givenLength: t.length,
+      type: `${s.type}[${n}]`
+    });
+  let r = !1;
+  const d = [];
+  for (let c = 0; c < t.length; c++) {
+    const a = x({
+      checksumAddress: o,
+      parameter: s,
+      value: t[c]
+    });
+    a.dynamic && (r = !0), d.push(a);
+  }
+  if (i || r) {
+    const c = W(d);
+    if (i) {
+      const a = B(d.length, { size: 32 });
+      return {
+        dynamic: !0,
+        encoded: d.length > 0 ? m(a, c) : a
+      };
+    }
+    if (r)
+      return { dynamic: !0, encoded: c };
+  }
+  return {
+    dynamic: !1,
+    encoded: m(...d.map(({ encoded: c }) => c))
+  };
+}
+function ot(t, { type: e }) {
+  const [, o] = e.split("bytes"), n = h(t);
+  if (!o) {
+    let s = t;
+    return n % 32 !== 0 && (s = b(s, Math.ceil((t.length - 2) / 2 / 32) * 32)), {
+      dynamic: !0,
+      encoded: m(S(B(n, { size: 32 })), s)
+    };
+  }
+  if (n !== Number.parseInt(o, 10))
+    throw new O({
+      expectedSize: Number.parseInt(o, 10),
+      value: t
+    });
+  return { dynamic: !1, encoded: b(t) };
+}
+function it(t) {
+  if (typeof t != "boolean")
+    throw new q(`Invalid boolean value: "${t}" (type: ${typeof t}). Expected: \`true\` or \`false\`.`);
+  return { dynamic: !1, encoded: S(F(t)) };
+}
+function rt(t, { signed: e, size: o }) {
+  if (typeof o == "number") {
+    const n = 2n ** (BigInt(o) - (e ? 1n : 0n)) - 1n, s = e ? -n - 1n : 0n;
+    if (t > n || t < s)
+      throw new G({
+        max: n.toString(),
+        min: s.toString(),
+        signed: e,
+        size: o / 8,
+        value: t.toString()
+      });
+  }
+  return {
+    dynamic: !1,
+    encoded: B(t, {
+      size: 32,
+      signed: e
+    })
+  };
+}
+function ct(t) {
+  const e = H(t), o = Math.ceil(h(e) / 32), n = [];
+  for (let s = 0; s < o; s++)
+    n.push(b(J(e, s * 32, (s + 1) * 32)));
+  return {
+    dynamic: !0,
+    encoded: m(b(B(h(e), { size: 32 })), ...n)
+  };
+}
+function dt(t, e) {
+  const { checksumAddress: o, parameter: n } = e;
+  let s = !1;
+  const i = [];
+  for (let r = 0; r < n.components.length; r++) {
+    const d = n.components[r], c = Array.isArray(t) ? r : d.name, a = x({
+      checksumAddress: o,
+      parameter: d,
+      value: t[c]
+    });
+    i.push(a), a.dynamic && (s = !0);
+  }
+  return {
+    dynamic: s,
+    encoded: s ? W(i) : m(...i.map(({ encoded: r }) => r))
+  };
+}
+function I(t) {
+  const e = t.match(/^(.*)\[(\d+)?\]$/);
+  return e ? (
+    // Return `null` if the array is dynamic.
+    [e[2] ? Number(e[2]) : null, e[1]]
+  ) : void 0;
+}
+function g(t) {
+  var n;
+  const { type: e } = t;
+  if (e === "string" || e === "bytes" || e.endsWith("[]"))
+    return !0;
+  if (e === "tuple")
+    return (n = t.components) == null ? void 0 : n.some(g);
+  const o = I(t.type);
+  return !!(o && g({
+    ...t,
+    type: o[1]
+  }));
+}
+export {
+  Q as decodeAddress,
+  X as decodeArray,
+  Y as decodeBool,
+  Z as decodeBytes,
+  v as decodeNumber,
+  p as decodeParameter,
+  et as decodeString,
+  tt as decodeTuple,
+  W as encode,
+  nt as encodeAddress,
+  st as encodeArray,
+  it as encodeBoolean,
+  ot as encodeBytes,
+  rt as encodeNumber,
+  ct as encodeString,
+  dt as encodeTuple,
+  I as getArrayComponents,
+  g as hasDynamicChild,
+  x as prepareParameter,
+  pt as prepareParameters
+};