@gardenfi/swap 0.1.3-beta.18 → 0.1.3-beta.19

package/dist/index371.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./index332.cjs"),i=require("./index120.cjs"),o=/^vector<(.+)>$/,l=/^([^:]+)::([^:]+)::([^<]+)(<(.+)>)?/;class t{static parseFromStr(r,e=!1){if(r==="address")return{address:null};if(r==="bool")return{bool:null};if(r==="u8")return{u8:null};if(r==="u16")return{u16:null};if(r==="u32")return{u32:null};if(r==="u64")return{u64:null};if(r==="u128")return{u128:null};if(r==="u256")return{u256:null};if(r==="signer")return{signer:null};const u=r.match(o);if(u)return{vector:t.parseFromStr(u[1],e)};const n=r.match(l);if(n)return{struct:{address:e?i.normalizeSuiAddress(n[1]):n[1],module:n[2],name:n[3],typeParams:n[5]===void 0?[]:t.parseStructTypeArgs(n[5],e)}};throw new Error(`Encountered unexpected token when parsing type args for ${r}`)}static parseStructTypeArgs(r,e=!1){return s.splitGenericParameters(r).map(u=>t.parseFromStr(u,e))}static tagToString(r){if("bool"in r)return"bool";if("u8"in r)return"u8";if("u16"in r)return"u16";if("u32"in r)return"u32";if("u64"in r)return"u64";if("u128"in r)return"u128";if("u256"in r)return"u256";if("address"in r)return"address";if("signer"in r)return"signer";if("vector"in r)return`vector<${t.tagToString(r.vector)}>`;if("struct"in r){const e=r.struct,u=e.typeParams.map(t.tagToString).join(", ");return`${e.address}::${e.module}::${e.name}${u?`<${u}>`:""}`}throw new Error("Invalid TypeTag")}}exports.TypeTagSerializer=t;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const B=require("./index327.cjs"),m=require("./index362.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/index371.js

@@ -1,76 +1,180 @@
-import { splitGenericParameters as s } from "./index332.js";
-import { normalizeSuiAddress as i } from "./index120.js";
-const o = /^vector<(.+)>$/, l = /^([^:]+)::([^:]+)::([^<]+)(<(.+)>)?/;
-class t {
-  static parseFromStr(r, e = !1) {
-    if (r === "address")
-      return { address: null };
-    if (r === "bool")
-      return { bool: null };
-    if (r === "u8")
-      return { u8: null };
-    if (r === "u16")
-      return { u16: null };
-    if (r === "u32")
-      return { u32: null };
-    if (r === "u64")
-      return { u64: null };
-    if (r === "u128")
-      return { u128: null };
-    if (r === "u256")
-      return { u256: null };
-    if (r === "signer")
-      return { signer: null };
-    const n = r.match(o);
-    if (n)
-      return {
-        vector: t.parseFromStr(n[1], e)
-      };
-    const u = r.match(l);
-    if (u)
-      return {
-        struct: {
-          address: e ? i(u[1]) : u[1],
-          module: u[2],
-          name: u[3],
-          typeParams: u[5] === void 0 ? [] : t.parseStructTypeArgs(u[5], e)
+import { validateField as M, nLength as z } from "./index327.js";
+import { validateObject as O, bitLen as k, bitMask as x } from "./index362.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);
         }
-      };
-    throw new Error(`Encountered unexpected token when parsing type args for ${r}`);
-  }
-  static parseStructTypeArgs(r, e = !1) {
-    return s(r).map(
-      (n) => t.parseFromStr(n, e)
-    );
-  }
-  static tagToString(r) {
-    if ("bool" in r)
-      return "bool";
-    if ("u8" in r)
-      return "u8";
-    if ("u16" in r)
-      return "u16";
-    if ("u32" in r)
-      return "u32";
-    if ("u64" in r)
-      return "u64";
-    if ("u128" in r)
-      return "u128";
-    if ("u256" in r)
-      return "u256";
-    if ("address" in r)
-      return "address";
-    if ("signer" in r)
-      return "signer";
-    if ("vector" in r)
-      return `vector<${t.tagToString(r.vector)}>`;
-    if ("struct" in r) {
-      const e = r.struct, n = e.typeParams.map(t.tagToString).join(", ");
-      return `${e.address}::${e.module}::${e.name}${n ? `<${n}>` : ""}`;
+      }
+      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);
     }
-    throw new Error("Invalid TypeTag");
+  };
+}
+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 {
-  t as TypeTagSerializer
+  U as pippenger,
+  C as validateBasic,
+  v as wNAF
 };

package/dist/index372.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index370.cjs"),n=require("./index374.cjs");function c(r){switch(r){case"u8":return e.bcs.u8();case"u16":return e.bcs.u16();case"u32":return e.bcs.u32();case"u64":return e.bcs.u64();case"u128":return e.bcs.u128();case"u256":return e.bcs.u256();case"bool":return e.bcs.bool();case"string":return e.bcs.string();case"id":case"address":return n.Address}const s=r.match(/^(vector|option)<(.+)>$/);if(s){const[u,t]=s.slice(1);return u==="vector"?e.bcs.vector(c(t)):e.bcs.option(c(t))}throw new Error(`Invalid Pure type name: ${r}`)}exports.pureBcsSchemaFromTypeName=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index373.cjs");class n{constructor(t){this.bytePosition=0,this.dataView=new DataView(t.buffer,t.byteOffset,t.byteLength)}shift(t){return this.bytePosition+=t,this}read8(){const t=this.dataView.getUint8(this.bytePosition);return this.shift(1),t}read16(){const t=this.dataView.getUint16(this.bytePosition,!0);return this.shift(2),t}read32(){const t=this.dataView.getUint32(this.bytePosition,!0);return this.shift(4),t}read64(){const t=this.read32(),e=this.read32().toString(16)+t.toString(16).padStart(8,"0");return BigInt("0x"+e).toString(10)}read128(){const t=BigInt(this.read64()),e=BigInt(this.read64()).toString(16)+t.toString(16).padStart(16,"0");return BigInt("0x"+e).toString(10)}read256(){const t=BigInt(this.read128()),e=BigInt(this.read128()).toString(16)+t.toString(16).padStart(32,"0");return BigInt("0x"+e).toString(10)}readBytes(t){const i=this.bytePosition+this.dataView.byteOffset,e=new Uint8Array(this.dataView.buffer,i,t);return this.shift(t),e}readULEB(){const t=this.bytePosition+this.dataView.byteOffset,i=new Uint8Array(this.dataView.buffer,t),{value:e,length:s}=r.ulebDecode(i);return this.shift(s),e}readVec(t){const i=this.readULEB(),e=[];for(let s=0;s<i;s++)e.push(t(this,s,i));return e}}exports.BcsReader=n;

package/dist/index372.js

@@ -1,34 +1,97 @@
-import { bcs as r } from "./index370.js";
-import { Address as s } from "./index374.js";
-function n(e) {
-  switch (e) {
-    case "u8":
-      return r.u8();
-    case "u16":
-      return r.u16();
-    case "u32":
-      return r.u32();
-    case "u64":
-      return r.u64();
-    case "u128":
-      return r.u128();
-    case "u256":
-      return r.u256();
-    case "bool":
-      return r.bool();
-    case "string":
-      return r.string();
-    case "id":
-    case "address":
-      return s;
-  }
-  const t = e.match(/^(vector|option)<(.+)>$/);
-  if (t) {
-    const [c, u] = t.slice(1);
-    return c === "vector" ? r.vector(n(u)) : r.option(n(u));
-  }
-  throw new Error(`Invalid Pure type name: ${e}`);
+import { ulebDecode as r } from "./index373.js";
+class o {
+  /**
+   * @param {Uint8Array} data Data to use as a buffer.
+   */
+  constructor(t) {
+    this.bytePosition = 0, this.dataView = new DataView(t.buffer, t.byteOffset, t.byteLength);
+  }
+  /**
+   * Shift current cursor position by `bytes`.
+   *
+   * @param {Number} bytes Number of bytes to
+   * @returns {this} Self for possible chaining.
+   */
+  shift(t) {
+    return this.bytePosition += t, this;
+  }
+  /**
+   * Read U8 value from the buffer and shift cursor by 1.
+   * @returns
+   */
+  read8() {
+    const t = this.dataView.getUint8(this.bytePosition);
+    return this.shift(1), t;
+  }
+  /**
+   * Read U16 value from the buffer and shift cursor by 2.
+   * @returns
+   */
+  read16() {
+    const t = this.dataView.getUint16(this.bytePosition, !0);
+    return this.shift(2), t;
+  }
+  /**
+   * Read U32 value from the buffer and shift cursor by 4.
+   * @returns
+   */
+  read32() {
+    const t = this.dataView.getUint32(this.bytePosition, !0);
+    return this.shift(4), t;
+  }
+  /**
+   * Read U64 value from the buffer and shift cursor by 8.
+   * @returns
+   */
+  read64() {
+    const t = this.read32(), e = this.read32().toString(16) + t.toString(16).padStart(8, "0");
+    return BigInt("0x" + e).toString(10);
+  }
+  /**
+   * Read U128 value from the buffer and shift cursor by 16.
+   */
+  read128() {
+    const t = BigInt(this.read64()), e = BigInt(this.read64()).toString(16) + t.toString(16).padStart(16, "0");
+    return BigInt("0x" + e).toString(10);
+  }
+  /**
+   * Read U128 value from the buffer and shift cursor by 32.
+   * @returns
+   */
+  read256() {
+    const t = BigInt(this.read128()), e = BigInt(this.read128()).toString(16) + t.toString(16).padStart(32, "0");
+    return BigInt("0x" + e).toString(10);
+  }
+  /**
+   * Read `num` number of bytes from the buffer and shift cursor by `num`.
+   * @param num Number of bytes to read.
+   */
+  readBytes(t) {
+    const i = this.bytePosition + this.dataView.byteOffset, e = new Uint8Array(this.dataView.buffer, i, t);
+    return this.shift(t), e;
+  }
+  /**
+   * Read ULEB value - an integer of varying size. Used for enum indexes and
+   * vector lengths.
+   * @returns {Number} The ULEB value.
+   */
+  readULEB() {
+    const t = this.bytePosition + this.dataView.byteOffset, i = new Uint8Array(this.dataView.buffer, t), { value: e, length: s } = r(i);
+    return this.shift(s), e;
+  }
+  /**
+   * Read a BCS vector: read a length and then apply function `cb` X times
+   * where X is the length of the vector, defined as ULEB in BCS bytes.
+   * @param cb Callback to process elements of vector.
+   * @returns {Array<Any>} Array of the resulting values, returned by callback.
+   */
+  readVec(t) {
+    const i = this.readULEB(), e = [];
+    for (let s = 0; s < i; s++)
+      e.push(t(this, s, i));
+    return e;
+  }
 }
 export {
-  n as pureBcsSchemaFromTypeName
+  o as BcsReader
 };

package/dist/index373.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index388.cjs");function s(n,a){const e=Array.from(`${n}::`).map(r=>r.charCodeAt(0)),t=new Uint8Array(e.length+a.length);return t.set(e),t.set(a,e.length),o.blake2b(t,{dkLen:32})}exports.hashTypedData=s;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function l(n){let e=BigInt(n);const t=[];let r=0;if(e===0n)return[0];for(;e>0;)t[r]=Number(e&0x7fn),e>>=7n,e>0n&&(t[r]|=128),r+=1;return t}function u(n){let e=0n,t=0n,r=0;for(;;){if(r>=n.length)throw new Error("ULEB decode error: buffer overflow");const o=n[r];if(r+=1,e+=BigInt(o&127)<<t,!(o&128))break;t+=7n}if(e>BigInt(Number.MAX_SAFE_INTEGER))throw new Error("ULEB decode error: value exceeds MAX_SAFE_INTEGER");return{value:Number(e),length:r}}exports.ulebDecode=u;exports.ulebEncode=l;

package/dist/index373.js

@@ -1,8 +1,31 @@
-import { blake2b as o } from "./index388.js";
-function s(r, n) {
-  const t = Array.from(`${r}::`).map((a) => a.charCodeAt(0)), e = new Uint8Array(t.length + n.length);
-  return e.set(t), e.set(n, t.length), o(e, { dkLen: 32 });
+function l(t) {
+  let e = BigInt(t);
+  const n = [];
+  let r = 0;
+  if (e === 0n)
+    return [0];
+  for (; e > 0; )
+    n[r] = Number(e & 0x7fn), e >>= 7n, e > 0n && (n[r] |= 128), r += 1;
+  return n;
+}
+function u(t) {
+  let e = 0n, n = 0n, r = 0;
+  for (; ; ) {
+    if (r >= t.length)
+      throw new Error("ULEB decode error: buffer overflow");
+    const o = t[r];
+    if (r += 1, e += BigInt(o & 127) << n, !(o & 128))
+      break;
+    n += 7n;
+  }
+  if (e > BigInt(Number.MAX_SAFE_INTEGER))
+    throw new Error("ULEB decode error: value exceeds MAX_SAFE_INTEGER");
+  return {
+    value: Number(e),
+    length: r
+  };
 }
 export {
-  s as hashTypedData
+  u as ulebDecode,
+  l as ulebEncode
 };

package/dist/index374.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./index116.cjs"),r=require("./index117.cjs"),i=require("./index118.cjs"),t=require("./index370.cjs"),o=require("./index120.cjs"),m=require("./index371.cjs");function x(e){return t.bcs.u64({name:"unsafe_u64",...e}).transform({input:c=>c,output:c=>Number(c)})}function z(e){return t.bcs.enum("Option",{None:null,Some:e})}const s=t.bcs.bytes(o.SUI_ADDRESS_LENGTH).transform({validate:e=>{const c=typeof e=="string"?e:i.toHex(e);if(!c||!o.isValidSuiAddress(o.normalizeSuiAddress(c)))throw new Error(`Invalid Sui address ${c}`)},input:e=>typeof e=="string"?i.fromHex(o.normalizeSuiAddress(e)):e,output:e=>o.normalizeSuiAddress(i.toHex(e))}),g=t.bcs.byteVector().transform({name:"ObjectDigest",input:e=>u.fromBase58(e),output:e=>u.toBase58(new Uint8Array(e)),validate:e=>{if(u.fromBase58(e).length!==32)throw new Error("ObjectDigest must be 32 bytes")}}),a=t.bcs.struct("SuiObjectRef",{objectId:s,version:t.bcs.u64(),digest:g}),d=t.bcs.struct("SharedObjectRef",{objectId:s,initialSharedVersion:t.bcs.u64(),mutable:t.bcs.bool()}),p=t.bcs.enum("ObjectArg",{ImmOrOwnedObject:a,SharedObject:d,Receiving:a}),U=t.bcs.enum("Owner",{AddressOwner:s,ObjectOwner:s,Shared:t.bcs.struct("Shared",{initialSharedVersion:t.bcs.u64()}),Immutable:null,ConsensusAddressOwner:t.bcs.struct("ConsensusAddressOwner",{owner:s,startVersion:t.bcs.u64()})}),S=t.bcs.enum("CallArg",{Pure:t.bcs.struct("Pure",{bytes:t.bcs.byteVector().transform({input:e=>typeof e=="string"?r.fromBase64(e):e,output:e=>r.toBase64(new Uint8Array(e))})}),Object:p}),b=t.bcs.enum("TypeTag",{bool:null,u8:null,u64:null,u128:null,address:null,signer:null,vector:t.bcs.lazy(()=>b),struct:t.bcs.lazy(()=>M),u16:null,u32:null,u256:null}),l=b.transform({input:e=>typeof e=="string"?m.TypeTagSerializer.parseFromStr(e,!0):e,output:e=>m.TypeTagSerializer.tagToString(e)}),n=t.bcs.enum("Argument",{GasCoin:null,Input:t.bcs.u16(),Result:t.bcs.u16(),NestedResult:t.bcs.tuple([t.bcs.u16(),t.bcs.u16()])}),y=t.bcs.struct("ProgrammableMoveCall",{package:s,module:t.bcs.string(),function:t.bcs.string(),typeArguments:t.bcs.vector(l),arguments:t.bcs.vector(n)}),f=t.bcs.enum("Command",{MoveCall:y,TransferObjects:t.bcs.struct("TransferObjects",{objects:t.bcs.vector(n),address:n}),SplitCoins:t.bcs.struct("SplitCoins",{coin:n,amounts:t.bcs.vector(n)}),MergeCoins:t.bcs.struct("MergeCoins",{destination:n,sources:t.bcs.vector(n)}),Publish:t.bcs.struct("Publish",{modules:t.bcs.vector(t.bcs.byteVector().transform({input:e=>typeof e=="string"?r.fromBase64(e):e,output:e=>r.toBase64(new Uint8Array(e))})),dependencies:t.bcs.vector(s)}),MakeMoveVec:t.bcs.struct("MakeMoveVec",{type:z(l).transform({input:e=>e===null?{None:!0}:{Some:e},output:e=>e.Some??null}),elements:t.bcs.vector(n)}),Upgrade:t.bcs.struct("Upgrade",{modules:t.bcs.vector(t.bcs.byteVector().transform({input:e=>typeof e=="string"?r.fromBase64(e):e,output:e=>r.toBase64(new Uint8Array(e))})),dependencies:t.bcs.vector(s),package:s,ticket:n})}),T=t.bcs.struct("ProgrammableTransaction",{inputs:t.bcs.vector(S),commands:t.bcs.vector(f)}),A=t.bcs.enum("TransactionKind",{ProgrammableTransaction:T,ChangeEpoch:null,Genesis:null,ConsensusCommitPrologue:null}),O=t.bcs.enum("TransactionExpiration",{None:null,Epoch:x()}),M=t.bcs.struct("StructTag",{address:s,module:t.bcs.string(),name:t.bcs.string(),typeParams:t.bcs.vector(b)}),P=t.bcs.struct("GasData",{payment:t.bcs.vector(a),owner:s,price:t.bcs.u64(),budget:t.bcs.u64()}),h=t.bcs.struct("TransactionDataV1",{kind:A,sender:s,gasData:P,expiration:O}),C=t.bcs.enum("TransactionData",{V1:h}),D=t.bcs.enum("IntentScope",{TransactionData:null,TransactionEffects:null,CheckpointSummary:null,PersonalMessage:null}),I=t.bcs.enum("IntentVersion",{V0:null}),V=t.bcs.enum("AppId",{Sui:null}),j=t.bcs.struct("Intent",{scope:D,version:I,appId:V});function k(e){return t.bcs.struct(`IntentMessage<${e.name}>`,{intent:j,value:e})}const v=t.bcs.enum("CompressedSignature",{ED25519:t.bcs.bytes(64),Secp256k1:t.bcs.bytes(64),Secp256r1:t.bcs.bytes(64),ZkLogin:t.bcs.byteVector(),Passkey:t.bcs.byteVector()}),w=t.bcs.enum("PublicKey",{ED25519:t.bcs.bytes(32),Secp256k1:t.bcs.bytes(33),Secp256r1:t.bcs.bytes(33),ZkLogin:t.bcs.byteVector(),Passkey:t.bcs.bytes(33)}),E=t.bcs.struct("MultiSigPkMap",{pubKey:w,weight:t.bcs.u8()}),B=t.bcs.struct("MultiSigPublicKey",{pk_map:t.bcs.vector(E),threshold:t.bcs.u16()}),q=t.bcs.struct("MultiSig",{sigs:t.bcs.vector(v),bitmap:t.bcs.u16(),multisig_pk:B}),K=t.bcs.byteVector().transform({input:e=>typeof e=="string"?r.fromBase64(e):e,output:e=>r.toBase64(new Uint8Array(e))}),R=t.bcs.struct("SenderSignedTransaction",{intentMessage:k(C),txSignatures:t.bcs.vector(K)}),G=t.bcs.vector(R,{name:"SenderSignedData"}),N=t.bcs.struct("PasskeyAuthenticator",{authenticatorData:t.bcs.byteVector(),clientDataJson:t.bcs.string(),userSignature:t.bcs.byteVector()});exports.Address=s;exports.AppId=V;exports.Argument=n;exports.CallArg=S;exports.Command=f;exports.CompressedSignature=v;exports.GasData=P;exports.Intent=j;exports.IntentMessage=k;exports.IntentScope=D;exports.IntentVersion=I;exports.MultiSig=q;exports.MultiSigPkMap=E;exports.MultiSigPublicKey=B;exports.ObjectArg=p;exports.ObjectDigest=g;exports.Owner=U;exports.PasskeyAuthenticator=N;exports.ProgrammableMoveCall=y;exports.ProgrammableTransaction=T;exports.PublicKey=w;exports.SenderSignedData=G;exports.SenderSignedTransaction=R;exports.SharedObjectRef=d;exports.StructTag=M;exports.SuiObjectRef=a;exports.TransactionData=C;exports.TransactionDataV1=h;exports.TransactionExpiration=O;exports.TransactionKind=A;exports.TypeTag=l;exports.base64String=K;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const h=require("./index373.cjs"),o=require("./index342.cjs");class a{constructor({initialSize:t=1024,maxSize:i=1/0,allocateSize:e=1024}={}){this.bytePosition=0,this.size=t,this.maxSize=i,this.allocateSize=e,this.dataView=new DataView(new ArrayBuffer(t))}ensureSizeOrGrow(t){const i=this.bytePosition+t;if(i>this.size){const e=Math.min(this.maxSize,Math.max(this.size+i,this.size+this.allocateSize));if(i>e)throw new Error(`Attempting to serialize to BCS, but buffer does not have enough size. Allocated size: ${this.size}, Max size: ${this.maxSize}, Required size: ${i}`);this.size=e;const s=new ArrayBuffer(this.size);new Uint8Array(s).set(new Uint8Array(this.dataView.buffer)),this.dataView=new DataView(s)}}shift(t){return this.bytePosition+=t,this}write8(t){return this.ensureSizeOrGrow(1),this.dataView.setUint8(this.bytePosition,Number(t)),this.shift(1)}writeBytes(t){this.ensureSizeOrGrow(t.length);for(let i=0;i<t.length;i++)this.dataView.setUint8(this.bytePosition+i,t[i]);return this.shift(t.length)}write16(t){return this.ensureSizeOrGrow(2),this.dataView.setUint16(this.bytePosition,Number(t),!0),this.shift(2)}write32(t){return this.ensureSizeOrGrow(4),this.dataView.setUint32(this.bytePosition,Number(t),!0),this.shift(4)}write64(t){return n(BigInt(t),8).forEach(i=>this.write8(i)),this}write128(t){return n(BigInt(t),16).forEach(i=>this.write8(i)),this}write256(t){return n(BigInt(t),32).forEach(i=>this.write8(i)),this}writeULEB(t){return h.ulebEncode(t).forEach(i=>this.write8(i)),this}writeVec(t,i){return this.writeULEB(t.length),Array.from(t).forEach((e,s)=>i(this,e,s,t.length)),this}*[Symbol.iterator](){for(let t=0;t<this.bytePosition;t++)yield this.dataView.getUint8(t);return this.toBytes()}toBytes(){return new Uint8Array(this.dataView.buffer.slice(0,this.bytePosition))}toString(t){return o.encodeStr(this.toBytes(),t)}}function n(r,t){const i=new Uint8Array(t);let e=0;for(;r>0;)i[e]=Number(r%BigInt(256)),r=r/BigInt(256),e+=1;return i}exports.BcsWriter=a;