@gardenfi/swap 0.0.2 → 0.1.0-beta.2

package/dist/index321.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index113.cjs"),l=require("./index114.cjs"),h=require("./index115.cjs");function f(e,n){switch(n){case"base58":return a.toBase58(e);case"base64":return l.toBase64(e);case"hex":return h.toHex(e);default:throw new Error("Unsupported encoding, supported values are: base64, hex")}}function p(e,n=["<",">"]){const[i,u]=n,s=[];let t="",o=0;for(let c=0;c<e.length;c++){const r=e[c];if(r===i&&o++,r===u&&o--,o===0&&r===","){s.push(t.trim()),t="";continue}t+=r}return s.push(t.trim()),s}exports.encodeStr=f;exports.splitGenericParameters=p;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index322.cjs"),n=require("./index285.cjs"),i=t=>{const r=typeof t=="string"?t:n.formatAbiItem(t);return e.normalizeSignature(r)};exports.toSignature=i;

package/dist/index321.js

@@ -1,32 +1,9 @@
-import { toBase58 as a } from "./index113.js";
-import { toBase64 as f } from "./index114.js";
-import { toHex as p } from "./index115.js";
-function d(e, o) {
-  switch (o) {
-    case "base58":
-      return a(e);
-    case "base64":
-      return f(e);
-    case "hex":
-      return p(e);
-    default:
-      throw new Error("Unsupported encoding, supported values are: base64, hex");
-  }
-}
-function g(e, o = ["<", ">"]) {
-  const [c, u] = o, n = [];
-  let t = "", s = 0;
-  for (let i = 0; i < e.length; i++) {
-    const r = e[i];
-    if (r === c && s++, r === u && s--, s === 0 && r === ",") {
-      n.push(t.trim()), t = "";
-      continue;
-    }
-    t += r;
-  }
-  return n.push(t.trim()), n;
-}
+import { normalizeSignature as o } from "./index322.js";
+import { formatAbiItem as n } from "./index285.js";
+const m = (r) => {
+  const t = typeof r == "string" ? r : n(r);
+  return o(t);
+};
 export {
-  d as encodeStr,
-  g as splitGenericParameters
+  m as toSignature
 };

package/dist/index322.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function r(e,t){return Array.from({length:Math.ceil(e.length/t)},(u,n)=>e.slice(n*t,(n+1)*t))}exports.chunk=r;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index176.cjs");function a(r){let l=!0,i="",o=0,t="",u=!1;for(let n=0;n<r.length;n++){const e=r[n];if(["(",")",","].includes(e)&&(l=!0),e==="("&&o++,e===")"&&o--,!!l){if(o===0){if(e===" "&&["event","function",""].includes(t))t="";else if(t+=e,e===")"){u=!0;break}continue}if(e===" "){r[n-1]!==","&&i!==","&&i!==",("&&(i="",l=!1);continue}t+=e,i+=e}}if(!u)throw new f.BaseError("Unable to normalize signature.");return t}exports.normalizeSignature=a;

package/dist/index322.js

@@ -1,6 +1,29 @@
-function c(t, n) {
-  return Array.from({ length: Math.ceil(t.length / n) }, (e, r) => t.slice(r * n, (r + 1) * n));
+import { BaseError as u } from "./index176.js";
+function a(r) {
+  let l = !0, i = "", f = 0, t = "", o = !1;
+  for (let n = 0; n < r.length; n++) {
+    const e = r[n];
+    if (["(", ")", ","].includes(e) && (l = !0), e === "(" && f++, e === ")" && f--, !!l) {
+      if (f === 0) {
+        if (e === " " && ["event", "function", ""].includes(t))
+          t = "";
+        else if (t += e, e === ")") {
+          o = !0;
+          break;
+        }
+        continue;
+      }
+      if (e === " ") {
+        r[n - 1] !== "," && i !== "," && i !== ",(" && (i = "", l = !1);
+        continue;
+      }
+      t += e, i += e;
+    }
+  }
+  if (!o)
+    throw new u("Unable to normalize signature.");
+  return t;
 }
 export {
-  c as chunk
+  a as normalizeSignature
 };

package/dist/index323.cjs

@@ -1,7 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});class y{constructor(e,r){if(typeof e!="function")throw new TypeError(`DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but got: ${e}.`);this._batchLoadFn=e,this._maxBatchSize=g(r),this._batchScheduleFn=w(r),this._cacheKeyFn=b(r),this._cacheMap=P(r),this._batch=null,this.name=S(r)}load(e){if(e==null)throw new TypeError(`The loader.load() function must be called with a value, but got: ${String(e)}.`);const r=m(this),c=this._cacheMap;let n;if(c){n=this._cacheKeyFn(e);const i=c.get(n);if(i){const s=r.cacheHits||(r.cacheHits=[]);return new Promise(f=>{s.push(()=>{f(i)})})}}r.keys.push(e);const a=new Promise((i,s)=>{r.callbacks.push({resolve:i,reject:s})});return c&&c.set(n,a),a}loadMany(e){if(!l(e))throw new TypeError(`The loader.loadMany() function must be called with Array<key>, but got: ${e}.`);const r=[];for(let c=0;c<e.length;c++)r.push(this.load(e[c]).catch(n=>n));return Promise.all(r)}clear(e){const r=this._cacheMap;if(r){const c=this._cacheKeyFn(e);r.delete(c)}return this}clearAll(){const e=this._cacheMap;return e&&e.clear(),this}prime(e,r){const c=this._cacheMap;if(c){const n=this._cacheKeyFn(e);if(c.get(n)===void 0){let a;r instanceof Error?(a=Promise.reject(r),a.catch(()=>{})):a=Promise.resolve(r),c.set(n,a)}}return this}}const d=typeof process=="object"&&typeof process.nextTick=="function"?function(t){o||(o=Promise.resolve()),o.then(()=>{process.nextTick(t)})}:typeof setImmediate=="function"?function(t){setImmediate(t)}:function(t){setTimeout(t)};let o;function m(t){const e=t._batch;if(e!==null&&!e.hasDispatched&&e.keys.length<t._maxBatchSize)return e;const r={hasDispatched:!1,keys:[],callbacks:[]};return t._batch=r,t._batchScheduleFn(()=>{p(t,r)}),r}function p(t,e){if(e.hasDispatched=!0,e.keys.length===0){u(e);return}let r;try{r=t._batchLoadFn(e.keys)}catch(c){return h(t,e,new TypeError(`DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but the function errored synchronously: ${String(c)}.`))}if(!r||typeof r.then!="function")return h(t,e,new TypeError(`DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but the function did not return a Promise: ${String(r)}.`));Promise.resolve(r).then(c=>{if(!l(c))throw new TypeError(`DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but the function did not return a Promise of an Array: ${String(c)}.`);if(c.length!==e.keys.length)throw new TypeError(`DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but the function did not return a Promise of an Array of the same length as the Array of keys.
-
-Keys:
-${String(e.keys)}
-
-Values:
-${String(c)}`);u(e);for(let n=0;n<e.callbacks.length;n++){const a=c[n];a instanceof Error?e.callbacks[n].reject(a):e.callbacks[n].resolve(a)}}).catch(c=>{h(t,e,c)})}function h(t,e,r){u(e);for(let c=0;c<e.keys.length;c++)t.clear(e.keys[c]),e.callbacks[c].reject(r)}function u(t){if(t.cacheHits)for(let e=0;e<t.cacheHits.length;e++)t.cacheHits[e]()}function g(t){if(!(!t||t.batch!==!1))return 1;const r=t&&t.maxBatchSize;if(r===void 0)return 1/0;if(typeof r!="number"||r<1)throw new TypeError(`maxBatchSize must be a positive number: ${r}`);return r}function w(t){const e=t&&t.batchScheduleFn;if(e===void 0)return d;if(typeof e!="function")throw new TypeError(`batchScheduleFn must be a function: ${e}`);return e}function b(t){const e=t&&t.cacheKeyFn;if(e===void 0)return r=>r;if(typeof e!="function")throw new TypeError(`cacheKeyFn must be a function: ${e}`);return e}function P(t){if(!(!t||t.cache!==!1))return null;const r=t&&t.cacheMap;if(r===void 0)return new Map;if(r!==null){const n=["get","set","delete","clear"].filter(a=>r&&typeof r[a]!="function");if(n.length!==0)throw new TypeError("Custom cacheMap missing methods: "+n.join(", "))}return r}function S(t){return t&&t.name?t.name:null}function l(t){return typeof t=="object"&&t!==null&&"length"in t&&typeof t.length=="number"&&(t.length===0||t.length>0&&Object.prototype.hasOwnProperty.call(t,t.length-1))}exports.DataLoader=y;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index366.cjs"),s=require("./index318.cjs"),o=require("./index367.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function c(e){return{hash:e,hmac:(r,...t)=>a.hmac(e,r,s.concatBytes(...t)),randomBytes:s.randomBytes}}function u(e,r){const t=n=>o.weierstrass({...e,...c(n)});return{...t(r),create:t}}exports.createCurve=u;exports.getHash=c;

package/dist/index323.js

@@ -1,240 +1,19 @@
-class k {
-  constructor(e, c) {
-    if (typeof e != "function")
-      throw new TypeError(
-        `DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but got: ${e}.`
-      );
-    this._batchLoadFn = e, this._maxBatchSize = p(c), this._batchScheduleFn = w(c), this._cacheKeyFn = g(c), this._cacheMap = b(c), this._batch = null, this.name = P(c);
-  }
-  /**
-   * Loads a key, returning a `Promise` for the value represented by that key.
-   */
-  load(e) {
-    if (e == null)
-      throw new TypeError(
-        `The loader.load() function must be called with a value, but got: ${String(e)}.`
-      );
-    const c = d(this), r = this._cacheMap;
-    let n;
-    if (r) {
-      n = this._cacheKeyFn(e);
-      const i = r.get(n);
-      if (i) {
-        const s = c.cacheHits || (c.cacheHits = []);
-        return new Promise((f) => {
-          s.push(() => {
-            f(i);
-          });
-        });
-      }
-    }
-    c.keys.push(e);
-    const a = new Promise((i, s) => {
-      c.callbacks.push({ resolve: i, reject: s });
-    });
-    return r && r.set(n, a), a;
-  }
-  /**
-   * Loads multiple keys, promising an array of values:
-   *
-   *     var [ a, b ] = await myLoader.loadMany([ 'a', 'b' ]);
-   *
-   * This is similar to the more verbose:
-   *
-   *     var [ a, b ] = await Promise.all([
-   *       myLoader.load('a'),
-   *       myLoader.load('b')
-   *     ]);
-   *
-   * However it is different in the case where any load fails. Where
-   * Promise.all() would reject, loadMany() always resolves, however each result
-   * is either a value or an Error instance.
-   *
-   *     var [ a, b, c ] = await myLoader.loadMany([ 'a', 'b', 'badkey' ]);
-   *     // c instanceof Error
-   *
-   */
-  loadMany(e) {
-    if (!l(e))
-      throw new TypeError(
-        `The loader.loadMany() function must be called with Array<key>, but got: ${e}.`
-      );
-    const c = [];
-    for (let r = 0; r < e.length; r++)
-      c.push(this.load(e[r]).catch((n) => n));
-    return Promise.all(c);
-  }
-  /**
-   * Clears the value at `key` from the cache, if it exists. Returns itself for
-   * method chaining.
-   */
-  clear(e) {
-    const c = this._cacheMap;
-    if (c) {
-      const r = this._cacheKeyFn(e);
-      c.delete(r);
-    }
-    return this;
-  }
-  /**
-   * Clears the entire cache. To be used when some event results in unknown
-   * invalidations across this particular `DataLoader`. Returns itself for
-   * method chaining.
-   */
-  clearAll() {
-    const e = this._cacheMap;
-    return e && e.clear(), this;
-  }
-  /**
-   * Adds the provided key and value to the cache. If the key already
-   * exists, no change is made. Returns itself for method chaining.
-   *
-   * To prime the cache with an error at a key, provide an Error instance.
-   */
-  prime(e, c) {
-    const r = this._cacheMap;
-    if (r) {
-      const n = this._cacheKeyFn(e);
-      if (r.get(n) === void 0) {
-        let a;
-        c instanceof Error ? (a = Promise.reject(c), a.catch(() => {
-        })) : a = Promise.resolve(c), r.set(n, a);
-      }
-    }
-    return this;
-  }
-}
-const y = (
-  /** @ts-ignore */
-  typeof process == "object" && typeof process.nextTick == "function" ? function(t) {
-    o || (o = Promise.resolve()), o.then(() => {
-      process.nextTick(t);
-    });
-  } : (
-    // @ts-ignore
-    typeof setImmediate == "function" ? function(t) {
-      setImmediate(t);
-    } : function(t) {
-      setTimeout(t);
-    }
-  )
-);
-let o;
-function d(t) {
-  const e = t._batch;
-  if (e !== null && !e.hasDispatched && e.keys.length < t._maxBatchSize)
-    return e;
-  const c = { hasDispatched: !1, keys: [], callbacks: [] };
-  return t._batch = c, t._batchScheduleFn(() => {
-    m(t, c);
-  }), c;
-}
-function m(t, e) {
-  if (e.hasDispatched = !0, e.keys.length === 0) {
-    u(e);
-    return;
-  }
-  let c;
-  try {
-    c = t._batchLoadFn(e.keys);
-  } catch (r) {
-    return h(
-      t,
-      e,
-      new TypeError(
-        `DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but the function errored synchronously: ${String(r)}.`
-      )
-    );
-  }
-  if (!c || typeof c.then != "function")
-    return h(
-      t,
-      e,
-      new TypeError(
-        `DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but the function did not return a Promise: ${String(c)}.`
-      )
-    );
-  Promise.resolve(c).then((r) => {
-    if (!l(r))
-      throw new TypeError(
-        `DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but the function did not return a Promise of an Array: ${String(r)}.`
-      );
-    if (r.length !== e.keys.length)
-      throw new TypeError(
-        `DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but the function did not return a Promise of an Array of the same length as the Array of keys.
-
-Keys:
-${String(e.keys)}
-
-Values:
-${String(r)}`
-      );
-    u(e);
-    for (let n = 0; n < e.callbacks.length; n++) {
-      const a = r[n];
-      a instanceof Error ? e.callbacks[n].reject(a) : e.callbacks[n].resolve(a);
-    }
-  }).catch((r) => {
-    h(t, e, r);
-  });
-}
-function h(t, e, c) {
-  u(e);
-  for (let r = 0; r < e.keys.length; r++)
-    t.clear(e.keys[r]), e.callbacks[r].reject(c);
-}
-function u(t) {
-  if (t.cacheHits)
-    for (let e = 0; e < t.cacheHits.length; e++)
-      t.cacheHits[e]();
-}
-function p(t) {
-  if (!(!t || t.batch !== !1))
-    return 1;
-  const c = t && t.maxBatchSize;
-  if (c === void 0)
-    return 1 / 0;
-  if (typeof c != "number" || c < 1)
-    throw new TypeError(`maxBatchSize must be a positive number: ${c}`);
-  return c;
-}
-function w(t) {
-  const e = t && t.batchScheduleFn;
-  if (e === void 0)
-    return y;
-  if (typeof e != "function")
-    throw new TypeError(`batchScheduleFn must be a function: ${e}`);
-  return e;
-}
-function g(t) {
-  const e = t && t.cacheKeyFn;
-  if (e === void 0)
-    return (c) => c;
-  if (typeof e != "function")
-    throw new TypeError(`cacheKeyFn must be a function: ${e}`);
-  return e;
-}
-function b(t) {
-  if (!(!t || t.cache !== !1))
-    return null;
-  const c = t && t.cacheMap;
-  if (c === void 0)
-    return /* @__PURE__ */ new Map();
-  if (c !== null) {
-    const n = ["get", "set", "delete", "clear"].filter(
-      (a) => c && typeof c[a] != "function"
-    );
-    if (n.length !== 0)
-      throw new TypeError("Custom cacheMap missing methods: " + n.join(", "));
-  }
-  return c;
-}
-function P(t) {
-  return t && t.name ? t.name : null;
-}
-function l(t) {
-  return typeof t == "object" && t !== null && "length" in t && typeof t.length == "number" && (t.length === 0 || t.length > 0 && Object.prototype.hasOwnProperty.call(t, t.length - 1));
+import { hmac as c } from "./index366.js";
+import { randomBytes as m, concatBytes as n } from "./index318.js";
+import { weierstrass as a } from "./index367.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function i(r) {
+  return {
+    hash: r,
+    hmac: (e, ...t) => c(r, e, n(...t)),
+    randomBytes: m
+  };
+}
+function p(r, e) {
+  const t = (o) => a({ ...r, ...i(o) });
+  return { ...t(e), create: t };
 }
 export {
-  k as DataLoader
+  p as createCurve,
+  i as getHash
 };

package/dist/index324.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index364.cjs"),e=require("./index365.cjs"),a=require("./index366.cjs"),n={...t.bcs,U8:t.bcs.u8(),U16:t.bcs.u16(),U32:t.bcs.u32(),U64:t.bcs.u64(),U128:t.bcs.u128(),U256:t.bcs.u256(),ULEB128:t.bcs.uleb128(),Bool:t.bcs.bool(),String:t.bcs.string(),Address:e.Address,AppId:e.AppId,Argument:e.Argument,CallArg:e.CallArg,Command:e.Command,CompressedSignature:e.CompressedSignature,GasData:e.GasData,Intent:e.Intent,IntentMessage:e.IntentMessage,IntentScope:e.IntentScope,IntentVersion:e.IntentVersion,MultiSig:e.MultiSig,MultiSigPkMap:e.MultiSigPkMap,MultiSigPublicKey:e.MultiSigPublicKey,ObjectArg:e.ObjectArg,ObjectDigest:e.ObjectDigest,Owner:e.Owner,PasskeyAuthenticator:e.PasskeyAuthenticator,ProgrammableMoveCall:e.ProgrammableMoveCall,ProgrammableTransaction:e.ProgrammableTransaction,PublicKey:e.PublicKey,SenderSignedData:e.SenderSignedData,SenderSignedTransaction:e.SenderSignedTransaction,SharedObjectRef:e.SharedObjectRef,StructTag:e.StructTag,SuiObjectRef:e.SuiObjectRef,TransactionData:e.TransactionData,TransactionDataV1:e.TransactionDataV1,TransactionEffects:a.TransactionEffects,TransactionExpiration:e.TransactionExpiration,TransactionKind:e.TransactionKind,TypeTag:e.TypeTag};exports.bcs=n;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index318.cjs"),a=require("./index359.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const d=BigInt(0),f=BigInt(1),h=BigInt(2),K=BigInt(3),I=BigInt(4),L=BigInt(5),T=BigInt(8);function g(t,n){const o=t%n;return o>=d?o:n+o}function Q(t,n,o){let r=t;for(;n-- >d;)r*=r,r%=o;return r}function B(t,n){if(t===d)throw new Error("invert: expected non-zero number");if(n<=d)throw new Error("invert: expected positive modulus, got "+n);let o=g(t,n),r=n,s=d,l=f;for(;o!==d;){const c=r/o,e=r%o,i=s-l*c;r=o,o=e,s=l,l=i}if(r!==f)throw new Error("invert: does not exist");return g(s,n)}function x(t,n){const o=(t.ORDER+f)/I,r=t.pow(n,o);if(!t.eql(t.sqr(r),n))throw new Error("Cannot find square root");return r}function V(t,n){const o=(t.ORDER-L)/T,r=t.mul(n,h),s=t.pow(r,o),l=t.mul(n,s),u=t.mul(t.mul(l,h),s),c=t.mul(l,t.sub(u,t.ONE));if(!t.eql(t.sqr(c),n))throw new Error("Cannot find square root");return c}function _(t){if(t<BigInt(3))throw new Error("sqrt is not defined for small field");let n=t-f,o=0;for(;n%h===d;)n/=h,o++;let r=h;const s=Z(t);for(;y(s,r)===1;)if(r++>1e3)throw new Error("Cannot find square root: probably non-prime P");if(o===1)return x;let l=s.pow(r,n);const u=(n+f)/h;return function(e,i){if(e.is0(i))return i;if(y(e,i)!==1)throw new Error("Cannot find square root");let w=o,v=e.mul(e.ONE,l),b=e.pow(i,n),E=e.pow(i,u);for(;!e.eql(b,e.ONE);){if(e.is0(b))return e.ZERO;let q=1,m=e.sqr(b);for(;!e.eql(m,e.ONE);)if(q++,m=e.sqr(m),q===w)throw new Error("Cannot find square root");const z=f<<BigInt(w-q-1),S=e.pow(v,z);w=q,v=e.sqr(S),b=e.mul(b,v),E=e.mul(E,S)}return E}}function M(t){return t%I===K?x:t%T===L?V:_(t)}const Y=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function k(t){const n={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},o=Y.reduce((r,s)=>(r[s]="function",r),n);return a.validateObject(t,o)}function O(t,n,o){if(o<d)throw new Error("invalid exponent, negatives unsupported");if(o===d)return t.ONE;if(o===f)return n;let r=t.ONE,s=n;for(;o>d;)o&f&&(r=t.mul(r,s)),s=t.sqr(s),o>>=f;return r}function A(t,n,o=!1){const r=new Array(n.length).fill(o?t.ZERO:void 0),s=n.reduce((u,c,e)=>t.is0(c)?u:(r[e]=u,t.mul(u,c)),t.ONE),l=t.inv(s);return n.reduceRight((u,c,e)=>t.is0(c)?u:(r[e]=t.mul(u,r[e]),t.mul(u,c)),l),r}function y(t,n){const o=(t.ORDER-f)/h,r=t.pow(n,o),s=t.eql(r,t.ONE),l=t.eql(r,t.ZERO),u=t.eql(r,t.neg(t.ONE));if(!s&&!l&&!u)throw new Error("invalid Legendre symbol result");return s?1:l?0:-1}function C(t,n){n!==void 0&&H.anumber(n);const o=n!==void 0?n:t.toString(2).length,r=Math.ceil(o/8);return{nBitLength:o,nByteLength:r}}function Z(t,n,o=!1,r={}){if(t<=d)throw new Error("invalid field: expected ORDER > 0, got "+t);const{nBitLength:s,nByteLength:l}=C(t,n);if(l>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let u;const c=Object.freeze({ORDER:t,isLE:o,BITS:s,BYTES:l,MASK:a.bitMask(s),ZERO:d,ONE:f,create:e=>g(e,t),isValid:e=>{if(typeof e!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof e);return d<=e&&e<t},is0:e=>e===d,isOdd:e=>(e&f)===f,neg:e=>g(-e,t),eql:(e,i)=>e===i,sqr:e=>g(e*e,t),add:(e,i)=>g(e+i,t),sub:(e,i)=>g(e-i,t),mul:(e,i)=>g(e*i,t),pow:(e,i)=>O(c,e,i),div:(e,i)=>g(e*B(i,t),t),sqrN:e=>e*e,addN:(e,i)=>e+i,subN:(e,i)=>e-i,mulN:(e,i)=>e*i,inv:e=>B(e,t),sqrt:r.sqrt||(e=>(u||(u=M(t)),u(c,e))),toBytes:e=>o?a.numberToBytesLE(e,l):a.numberToBytesBE(e,l),fromBytes:e=>{if(e.length!==l)throw new Error("Field.fromBytes: expected "+l+" bytes, got "+e.length);return o?a.bytesToNumberLE(e):a.bytesToNumberBE(e)},invertBatch:e=>A(c,e),cmov:(e,i,w)=>w?i:e});return Object.freeze(c)}function N(t){if(typeof t!="bigint")throw new Error("field order must be bigint");const n=t.toString(2).length;return Math.ceil(n/8)}function j(t){const n=N(t);return n+Math.ceil(n/2)}function P(t,n,o=!1){const r=t.length,s=N(n),l=j(n);if(r<16||r<l||r>1024)throw new Error("expected "+l+"-1024 bytes of input, got "+r);const u=o?a.bytesToNumberLE(t):a.bytesToNumberBE(t),c=g(u,n-f)+f;return o?a.numberToBytesLE(c,s):a.numberToBytesBE(c,s)}exports.Field=Z;exports.FpInvertBatch=A;exports.FpLegendre=y;exports.FpPow=O;exports.FpSqrt=M;exports.getFieldBytesLength=N;exports.getMinHashLength=j;exports.invert=B;exports.mapHashToField=P;exports.mod=g;exports.nLength=C;exports.pow2=Q;exports.tonelliShanks=_;exports.validateField=k;

package/dist/index324.js

@@ -1,50 +1,217 @@
-import { bcs as t } from "./index364.js";
-import { TransactionKind as a, TransactionData as e, TypeTag as n, TransactionExpiration as r, TransactionDataV1 as i, SuiObjectRef as o, StructTag as s, SharedObjectRef as c, SenderSignedTransaction as u, SenderSignedData as g, PublicKey as l, ProgrammableTransaction as m, ProgrammableMoveCall as S, PasskeyAuthenticator as b, Owner as d, ObjectDigest as p, ObjectArg as T, MultiSigPublicKey as f, MultiSigPkMap as U, MultiSig as A, IntentVersion as M, IntentScope as P, IntentMessage as D, Intent as I, GasData as O, CompressedSignature as j, Command as y, CallArg as C, Argument as B, AppId as E, Address as K } from "./index365.js";
-import { TransactionEffects as h } from "./index366.js";
-const V = {
-  ...t,
-  U8: t.u8(),
-  U16: t.u16(),
-  U32: t.u32(),
-  U64: t.u64(),
-  U128: t.u128(),
-  U256: t.u256(),
-  ULEB128: t.uleb128(),
-  Bool: t.bool(),
-  String: t.string(),
-  Address: K,
-  AppId: E,
-  Argument: B,
-  CallArg: C,
-  Command: y,
-  CompressedSignature: j,
-  GasData: O,
-  Intent: I,
-  IntentMessage: D,
-  IntentScope: P,
-  IntentVersion: M,
-  MultiSig: A,
-  MultiSigPkMap: U,
-  MultiSigPublicKey: f,
-  ObjectArg: T,
-  ObjectDigest: p,
-  Owner: d,
-  PasskeyAuthenticator: b,
-  ProgrammableMoveCall: S,
-  ProgrammableTransaction: m,
-  PublicKey: l,
-  SenderSignedData: g,
-  SenderSignedTransaction: u,
-  SharedObjectRef: c,
-  StructTag: s,
-  SuiObjectRef: o,
-  TransactionData: e,
-  TransactionDataV1: i,
-  TransactionEffects: h,
-  TransactionExpiration: r,
-  TransactionKind: a,
-  TypeTag: n
-};
+import { anumber as C } from "./index318.js";
+import { numberToBytesLE as I, numberToBytesBE as y, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as x, validateObject as z } from "./index359.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const d = BigInt(0), f = BigInt(1), g = /* @__PURE__ */ BigInt(2), j = /* @__PURE__ */ BigInt(3), L = /* @__PURE__ */ BigInt(4), _ = /* @__PURE__ */ BigInt(5), T = /* @__PURE__ */ BigInt(8);
+function w(t, n) {
+  const o = t % n;
+  return o >= d ? o : n + o;
+}
+function $(t, n, o) {
+  let r = t;
+  for (; n-- > d; )
+    r *= r, r %= o;
+  return r;
+}
+function B(t, n) {
+  if (t === d)
+    throw new Error("invert: expected non-zero number");
+  if (n <= d)
+    throw new Error("invert: expected positive modulus, got " + n);
+  let o = w(t, n), r = n, s = d, l = f;
+  for (; o !== d; ) {
+    const c = r / o, e = r % o, i = s - l * c;
+    r = o, o = e, s = l, l = i;
+  }
+  if (r !== f)
+    throw new Error("invert: does not exist");
+  return w(s, n);
+}
+function M(t, n) {
+  const o = (t.ORDER + f) / L, r = t.pow(n, o);
+  if (!t.eql(t.sqr(r), n))
+    throw new Error("Cannot find square root");
+  return r;
+}
+function H(t, n) {
+  const o = (t.ORDER - _) / T, r = t.mul(n, g), s = t.pow(r, o), l = t.mul(n, s), u = t.mul(t.mul(l, g), s), c = t.mul(l, t.sub(u, t.ONE));
+  if (!t.eql(t.sqr(c), n))
+    throw new Error("Cannot find square root");
+  return c;
+}
+function K(t) {
+  if (t < BigInt(3))
+    throw new Error("sqrt is not defined for small field");
+  let n = t - f, o = 0;
+  for (; n % g === d; )
+    n /= g, o++;
+  let r = g;
+  const s = J(t);
+  for (; N(s, r) === 1; )
+    if (r++ > 1e3)
+      throw new Error("Cannot find square root: probably non-prime P");
+  if (o === 1)
+    return M;
+  let l = s.pow(r, n);
+  const u = (n + f) / g;
+  return function(e, i) {
+    if (e.is0(i))
+      return i;
+    if (N(e, i) !== 1)
+      throw new Error("Cannot find square root");
+    let h = o, b = e.mul(e.ONE, l), a = e.pow(i, n), m = e.pow(i, u);
+    for (; !e.eql(a, e.ONE); ) {
+      if (e.is0(a))
+        return e.ZERO;
+      let q = 1, v = e.sqr(a);
+      for (; !e.eql(v, e.ONE); )
+        if (q++, v = e.sqr(v), q === h)
+          throw new Error("Cannot find square root");
+      const A = f << BigInt(h - q - 1), E = e.pow(b, A);
+      h = q, b = e.sqr(E), a = e.mul(a, b), m = e.mul(m, E);
+    }
+    return m;
+  };
+}
+function Q(t) {
+  return t % L === j ? M : t % T === _ ? H : K(t);
+}
+const V = [
+  "create",
+  "isValid",
+  "is0",
+  "neg",
+  "inv",
+  "sqrt",
+  "sqr",
+  "eql",
+  "add",
+  "sub",
+  "mul",
+  "pow",
+  "div",
+  "addN",
+  "subN",
+  "mulN",
+  "sqrN"
+];
+function P(t) {
+  const n = {
+    ORDER: "bigint",
+    MASK: "bigint",
+    BYTES: "isSafeInteger",
+    BITS: "isSafeInteger"
+  }, o = V.reduce((r, s) => (r[s] = "function", r), n);
+  return z(t, o);
+}
+function Y(t, n, o) {
+  if (o < d)
+    throw new Error("invalid exponent, negatives unsupported");
+  if (o === d)
+    return t.ONE;
+  if (o === f)
+    return n;
+  let r = t.ONE, s = n;
+  for (; o > d; )
+    o & f && (r = t.mul(r, s)), s = t.sqr(s), o >>= f;
+  return r;
+}
+function k(t, n, o = !1) {
+  const r = new Array(n.length).fill(o ? t.ZERO : void 0), s = n.reduce((u, c, e) => t.is0(c) ? u : (r[e] = u, t.mul(u, c)), t.ONE), l = t.inv(s);
+  return n.reduceRight((u, c, e) => t.is0(c) ? u : (r[e] = t.mul(u, r[e]), t.mul(u, c)), l), r;
+}
+function N(t, n) {
+  const o = (t.ORDER - f) / g, r = t.pow(n, o), s = t.eql(r, t.ONE), l = t.eql(r, t.ZERO), u = t.eql(r, t.neg(t.ONE));
+  if (!s && !l && !u)
+    throw new Error("invalid Legendre symbol result");
+  return s ? 1 : l ? 0 : -1;
+}
+function G(t, n) {
+  n !== void 0 && C(n);
+  const o = n !== void 0 ? n : t.toString(2).length, r = Math.ceil(o / 8);
+  return { nBitLength: o, nByteLength: r };
+}
+function J(t, n, o = !1, r = {}) {
+  if (t <= d)
+    throw new Error("invalid field: expected ORDER > 0, got " + t);
+  const { nBitLength: s, nByteLength: l } = G(t, n);
+  if (l > 2048)
+    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
+  let u;
+  const c = Object.freeze({
+    ORDER: t,
+    isLE: o,
+    BITS: s,
+    BYTES: l,
+    MASK: Z(s),
+    ZERO: d,
+    ONE: f,
+    create: (e) => w(e, t),
+    isValid: (e) => {
+      if (typeof e != "bigint")
+        throw new Error("invalid field element: expected bigint, got " + typeof e);
+      return d <= e && e < t;
+    },
+    is0: (e) => e === d,
+    isOdd: (e) => (e & f) === f,
+    neg: (e) => w(-e, t),
+    eql: (e, i) => e === i,
+    sqr: (e) => w(e * e, t),
+    add: (e, i) => w(e + i, t),
+    sub: (e, i) => w(e - i, t),
+    mul: (e, i) => w(e * i, t),
+    pow: (e, i) => Y(c, e, i),
+    div: (e, i) => w(e * B(i, t), t),
+    // Same as above, but doesn't normalize
+    sqrN: (e) => e * e,
+    addN: (e, i) => e + i,
+    subN: (e, i) => e - i,
+    mulN: (e, i) => e * i,
+    inv: (e) => B(e, t),
+    sqrt: r.sqrt || ((e) => (u || (u = Q(t)), u(c, e))),
+    toBytes: (e) => o ? I(e, l) : y(e, l),
+    fromBytes: (e) => {
+      if (e.length !== l)
+        throw new Error("Field.fromBytes: expected " + l + " bytes, got " + e.length);
+      return o ? S(e) : x(e);
+    },
+    // TODO: we don't need it here, move out to separate fn
+    invertBatch: (e) => k(c, e),
+    // We can't move this out because Fp6, Fp12 implement it
+    // and it's unclear what to return in there.
+    cmov: (e, i, h) => h ? i : e
+  });
+  return Object.freeze(c);
+}
+function O(t) {
+  if (typeof t != "bigint")
+    throw new Error("field order must be bigint");
+  const n = t.toString(2).length;
+  return Math.ceil(n / 8);
+}
+function U(t) {
+  const n = O(t);
+  return n + Math.ceil(n / 2);
+}
+function D(t, n, o = !1) {
+  const r = t.length, s = O(n), l = U(n);
+  if (r < 16 || r < l || r > 1024)
+    throw new Error("expected " + l + "-1024 bytes of input, got " + r);
+  const u = o ? S(t) : x(t), c = w(u, n - f) + f;
+  return o ? I(c, s) : y(c, s);
+}
 export {
-  V as bcs
+  J as Field,
+  k as FpInvertBatch,
+  N as FpLegendre,
+  Y as FpPow,
+  Q as FpSqrt,
+  O as getFieldBytesLength,
+  U as getMinHashLength,
+  B as invert,
+  D as mapHashToField,
+  w as mod,
+  G as nLength,
+  $ as pow2,
+  K as tonelliShanks,
+  P as validateField
 };