@gardenfi/utils 2.1.3-beta.2 → 2.1.3

package/dist/index308.js

@@ -1,66 +1,6 @@
-import { BaseError as c } from "./index300.js";
-import { padRight as h } from "./index291.js";
-import { charCodeToBase16 as b, assertSize as g, pad as m } from "./index309.js";
-import { assertSize as p } from "./index302.js";
-const l = /* @__PURE__ */ new TextEncoder();
-function E(e) {
-  return e instanceof Uint8Array ? e : typeof e == "string" ? y(e) : z(e);
-}
-function z(e) {
-  return e instanceof Uint8Array ? e : new Uint8Array(e);
-}
-function y(e, t = {}) {
-  const { size: r } = t;
-  let n = e;
-  r && (p(e, r), n = h(e, r));
-  let i = n.slice(2);
-  i.length % 2 && (i = `0${i}`);
-  const f = i.length / 2, a = new Uint8Array(f);
-  for (let s = 0, o = 0; s < f; s++) {
-    const d = b(i.charCodeAt(o++)), u = b(i.charCodeAt(o++));
-    if (d === void 0 || u === void 0)
-      throw new c(`Invalid byte sequence ("${i[o - 2]}${i[o - 1]}" in "${i}").`);
-    a[s] = d * 16 + u;
-  }
-  return a;
-}
-function C(e, t = {}) {
-  const { size: r } = t, n = l.encode(e);
-  return typeof r == "number" ? (g(n, r), x(n, r)) : n;
-}
-function x(e, t) {
-  return m(e, { dir: "right", size: t });
-}
-function U(e) {
-  return e.length;
-}
-class B extends c {
-  constructor({ givenSize: t, maxSize: r }) {
-    super(`Size cannot exceed \`${r}\` bytes. Given size: \`${t}\` bytes.`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Bytes.SizeOverflowError"
-    });
-  }
-}
-class O extends c {
-  constructor({ size: t, targetSize: r, type: n }) {
-    super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${r}\`).`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Bytes.SizeExceedsPaddingSizeError"
-    });
-  }
-}
+const e = /^(.*)\[([0-9]*)\]$/, t = /^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/, n = /^(u?int)(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/;
 export {
-  O as SizeExceedsPaddingSizeError,
-  B as SizeOverflowError,
-  E as from,
-  z as fromArray,
-  y as fromHex,
-  C as fromString,
-  x as padRight,
-  U as size
+  e as arrayRegex,
+  t as bytesRegex,
+  n as integerRegex
 };

package/dist/index309.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index308.cjs");function s(e,t){if(o.size(e)>t)throw new o.SizeOverflowError({givenSize:o.size(e),maxSize:t})}const n={zero:48,nine:57,A:65,F:70,a:97,f:102};function u(e){if(e>=n.zero&&e<=n.nine)return e-n.zero;if(e>=n.A&&e<=n.F)return e-(n.A-10);if(e>=n.a&&e<=n.f)return e-(n.a-10)}function z(e,t={}){const{dir:f,size:r=32}=t;if(r===0)return e;if(e.length>r)throw new o.SizeExceedsPaddingSizeError({size:e.length,targetSize:r,type:"Bytes"});const d=new Uint8Array(r);for(let i=0;i<r;i++){const a=f==="right";d[a?i:r-i-1]=e[a?i:e.length-i-1]}return d}exports.assertSize=s;exports.charCodeMap=n;exports.charCodeToBase16=u;exports.pad=z;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const m=require("./index291.cjs"),w=require("./index307.cjs"),N=require("./index302.cjs"),c=require("./index288.cjs"),x=require("./index308.cjs");function P({checksumAddress:e,parameters:r,values:n}){const t=[];for(let o=0;o<r.length;o++)t.push(f({checksumAddress:e,parameter:r[o],value:n[o]}));return t}function f({checksumAddress:e=!1,parameter:r,value:n}){const t=r,o=S(t.type);if(o){const[i,s]=o;return h(n,{checksumAddress:e,length:i,parameter:{...t,type:s}})}if(t.type==="tuple")return A(n,{checksumAddress:e,parameter:t});if(t.type==="address")return y(n,{checksum:e});if(t.type==="bool")return g(n);if(t.type.startsWith("uint")||t.type.startsWith("int")){const i=t.type.startsWith("int"),[,,s="256"]=x.integerRegex.exec(t.type)??[];return b(n,{signed:i,size:Number(s)})}if(t.type.startsWith("bytes"))return l(n,{type:t.type});if(t.type==="string")return z(n);throw new m.InvalidTypeError(t.type)}function u(e){let r=0;for(let i=0;i<e.length;i++){const{dynamic:s,encoded:a}=e[i];s?r+=32:r+=c.size(a)}const n=[],t=[];let o=0;for(let i=0;i<e.length;i++){const{dynamic:s,encoded:a}=e[i];s?(n.push(c.fromNumber(r+o,{size:32})),t.push(a),o+=c.size(a)):n.push(a)}return c.concat(...n,...t)}function y(e,r){const{checksum:n=!1}=r;return w.assert(e,{strict:n}),{dynamic:!1,encoded:c.padLeft(e.toLowerCase())}}function h(e,r){const{checksumAddress:n,length:t,parameter:o}=r,i=t===null;if(!Array.isArray(e))throw new m.InvalidArrayError(e);if(!i&&e.length!==t)throw new m.ArrayLengthMismatchError({expectedLength:t,givenLength:e.length,type:`${o.type}[${t}]`});let s=!1;const a=[];for(let d=0;d<e.length;d++){const p=f({checksumAddress:n,parameter:o,value:e[d]});p.dynamic&&(s=!0),a.push(p)}if(i||s){const d=u(a);if(i){const p=c.fromNumber(a.length,{size:32});return{dynamic:!0,encoded:a.length>0?c.concat(p,d):p}}if(s)return{dynamic:!0,encoded:d}}return{dynamic:!1,encoded:c.concat(...a.map(({encoded:d})=>d))}}function l(e,{type:r}){const[,n]=r.split("bytes"),t=c.size(e);if(!n){let o=e;return t%32!==0&&(o=c.padRight(o,Math.ceil((e.length-2)/2/32)*32)),{dynamic:!0,encoded:c.concat(c.padLeft(c.fromNumber(t,{size:32})),o)}}if(t!==Number.parseInt(n))throw new m.BytesSizeMismatchError({expectedSize:Number.parseInt(n),value:e});return{dynamic:!1,encoded:c.padRight(e)}}function g(e){if(typeof e!="boolean")throw new N.BaseError(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);return{dynamic:!1,encoded:c.padLeft(c.fromBoolean(e))}}function b(e,{signed:r,size:n}){if(typeof n=="number"){const t=2n**(BigInt(n)-(r?1n:0n))-1n,o=r?-t-1n:0n;if(e>t||e<o)throw new c.IntegerOutOfRangeError({max:t.toString(),min:o.toString(),signed:r,size:n/8,value:e.toString()})}return{dynamic:!1,encoded:c.fromNumber(e,{size:32,signed:r})}}function z(e){const r=c.fromString(e),n=Math.ceil(c.size(r)/32),t=[];for(let o=0;o<n;o++)t.push(c.padRight(c.slice(r,o*32,(o+1)*32)));return{dynamic:!0,encoded:c.concat(c.padRight(c.fromNumber(c.size(r),{size:32})),...t)}}function A(e,r){const{checksumAddress:n,parameter:t}=r;let o=!1;const i=[];for(let s=0;s<t.components.length;s++){const a=t.components[s],d=Array.isArray(e)?s:a.name,p=f({checksumAddress:n,parameter:a,value:e[d]});i.push(p),p.dynamic&&(o=!0)}return{dynamic:o,encoded:o?u(i):c.concat(...i.map(({encoded:s})=>s))}}function S(e){const r=e.match(/^(.*)\[(\d+)?\]$/);return r?[r[2]?Number(r[2]):null,r[1]]:void 0}exports.encode=u;exports.encodeAddress=y;exports.encodeArray=h;exports.encodeBoolean=g;exports.encodeBytes=l;exports.encodeNumber=b;exports.encodeString=z;exports.encodeTuple=A;exports.getArrayComponents=S;exports.prepareParameter=f;exports.prepareParameters=P;

package/dist/index309.js

@@ -1,47 +1,197 @@
-import { size as d, SizeOverflowError as u, SizeExceedsPaddingSizeError as a } from "./index308.js";
-function p(e, t) {
-  if (d(e) > t)
-    throw new u({
-      givenSize: d(e),
-      maxSize: t
-    });
-}
-const n = {
-  zero: 48,
-  nine: 57,
-  A: 65,
-  F: 70,
-  a: 97,
-  f: 102
-};
-function s(e) {
-  if (e >= n.zero && e <= n.nine)
-    return e - n.zero;
-  if (e >= n.A && e <= n.F)
-    return e - (n.A - 10);
-  if (e >= n.a && e <= n.f)
-    return e - (n.a - 10);
-}
-function S(e, t = {}) {
-  const { dir: z, size: i = 32 } = t;
-  if (i === 0)
-    return e;
-  if (e.length > i)
-    throw new a({
-      size: e.length,
-      targetSize: i,
-      type: "Bytes"
-    });
-  const o = new Uint8Array(i);
-  for (let r = 0; r < i; r++) {
-    const f = z === "right";
-    o[f ? r : i - r - 1] = e[f ? r : e.length - r - 1];
-  }
-  return o;
+import { InvalidTypeError as g, InvalidArrayError as b, ArrayLengthMismatchError as w, BytesSizeMismatchError as z } from "./index291.js";
+import { assert as x } from "./index307.js";
+import { BaseError as S } from "./index302.js";
+import { size as d, fromNumber as f, concat as p, padLeft as h, fromBoolean as A, IntegerOutOfRangeError as E, padRight as y, fromString as I, slice as B } from "./index288.js";
+import { integerRegex as L } from "./index308.js";
+function q({ checksumAddress: e, parameters: n, values: r }) {
+  const t = [];
+  for (let o = 0; o < n.length; o++)
+    t.push(u({
+      checksumAddress: e,
+      parameter: n[o],
+      value: r[o]
+    }));
+  return t;
+}
+function u({ checksumAddress: e = !1, parameter: n, value: r }) {
+  const t = n, o = k(t.type);
+  if (o) {
+    const [i, c] = o;
+    return P(r, {
+      checksumAddress: e,
+      length: i,
+      parameter: {
+        ...t,
+        type: c
+      }
+    });
+  }
+  if (t.type === "tuple")
+    return R(r, {
+      checksumAddress: e,
+      parameter: t
+    });
+  if (t.type === "address")
+    return N(r, {
+      checksum: e
+    });
+  if (t.type === "bool")
+    return C(r);
+  if (t.type.startsWith("uint") || t.type.startsWith("int")) {
+    const i = t.type.startsWith("int"), [, , c = "256"] = L.exec(t.type) ?? [];
+    return M(r, {
+      signed: i,
+      size: Number(c)
+    });
+  }
+  if (t.type.startsWith("bytes"))
+    return $(r, { type: t.type });
+  if (t.type === "string")
+    return W(r);
+  throw new g(t.type);
+}
+function l(e) {
+  let n = 0;
+  for (let i = 0; i < e.length; i++) {
+    const { dynamic: c, encoded: s } = e[i];
+    c ? n += 32 : n += d(s);
+  }
+  const r = [], t = [];
+  let o = 0;
+  for (let i = 0; i < e.length; i++) {
+    const { dynamic: c, encoded: s } = e[i];
+    c ? (r.push(f(n + o, { size: 32 })), t.push(s), o += d(s)) : r.push(s);
+  }
+  return p(...r, ...t);
+}
+function N(e, n) {
+  const { checksum: r = !1 } = n;
+  return x(e, { strict: r }), {
+    dynamic: !1,
+    encoded: h(e.toLowerCase())
+  };
+}
+function P(e, n) {
+  const { checksumAddress: r, length: t, parameter: o } = n, i = t === null;
+  if (!Array.isArray(e))
+    throw new b(e);
+  if (!i && e.length !== t)
+    throw new w({
+      expectedLength: t,
+      givenLength: e.length,
+      type: `${o.type}[${t}]`
+    });
+  let c = !1;
+  const s = [];
+  for (let a = 0; a < e.length; a++) {
+    const m = u({
+      checksumAddress: r,
+      parameter: o,
+      value: e[a]
+    });
+    m.dynamic && (c = !0), s.push(m);
+  }
+  if (i || c) {
+    const a = l(s);
+    if (i) {
+      const m = f(s.length, { size: 32 });
+      return {
+        dynamic: !0,
+        encoded: s.length > 0 ? p(m, a) : m
+      };
+    }
+    if (c)
+      return { dynamic: !0, encoded: a };
+  }
+  return {
+    dynamic: !1,
+    encoded: p(...s.map(({ encoded: a }) => a))
+  };
+}
+function $(e, { type: n }) {
+  const [, r] = n.split("bytes"), t = d(e);
+  if (!r) {
+    let o = e;
+    return t % 32 !== 0 && (o = y(o, Math.ceil((e.length - 2) / 2 / 32) * 32)), {
+      dynamic: !0,
+      encoded: p(h(f(t, { size: 32 })), o)
+    };
+  }
+  if (t !== Number.parseInt(r))
+    throw new z({
+      expectedSize: Number.parseInt(r),
+      value: e
+    });
+  return { dynamic: !1, encoded: y(e) };
+}
+function C(e) {
+  if (typeof e != "boolean")
+    throw new S(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);
+  return { dynamic: !1, encoded: h(A(e)) };
+}
+function M(e, { signed: n, size: r }) {
+  if (typeof r == "number") {
+    const t = 2n ** (BigInt(r) - (n ? 1n : 0n)) - 1n, o = n ? -t - 1n : 0n;
+    if (e > t || e < o)
+      throw new E({
+        max: t.toString(),
+        min: o.toString(),
+        signed: n,
+        size: r / 8,
+        value: e.toString()
+      });
+  }
+  return {
+    dynamic: !1,
+    encoded: f(e, {
+      size: 32,
+      signed: n
+    })
+  };
+}
+function W(e) {
+  const n = I(e), r = Math.ceil(d(n) / 32), t = [];
+  for (let o = 0; o < r; o++)
+    t.push(y(B(n, o * 32, (o + 1) * 32)));
+  return {
+    dynamic: !0,
+    encoded: p(y(f(d(n), { size: 32 })), ...t)
+  };
+}
+function R(e, n) {
+  const { checksumAddress: r, parameter: t } = n;
+  let o = !1;
+  const i = [];
+  for (let c = 0; c < t.components.length; c++) {
+    const s = t.components[c], a = Array.isArray(e) ? c : s.name, m = u({
+      checksumAddress: r,
+      parameter: s,
+      value: e[a]
+    });
+    i.push(m), m.dynamic && (o = !0);
+  }
+  return {
+    dynamic: o,
+    encoded: o ? l(i) : p(...i.map(({ encoded: c }) => c))
+  };
+}
+function k(e) {
+  const n = e.match(/^(.*)\[(\d+)?\]$/);
+  return n ? (
+    // Return `null` if the array is dynamic.
+    [n[2] ? Number(n[2]) : null, n[1]]
+  ) : void 0;
 }
 export {
-  p as assertSize,
-  n as charCodeMap,
-  s as charCodeToBase16,
-  S as pad
+  l as encode,
+  N as encodeAddress,
+  P as encodeArray,
+  C as encodeBoolean,
+  $ as encodeBytes,
+  M as encodeNumber,
+  W as encodeString,
+  R as encodeTuple,
+  k as getArrayComponents,
+  u as prepareParameter,
+  q as prepareParameters
 };

package/dist/index310.cjs

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

package/dist/index310.js

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

package/dist/index311.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index314.cjs"),c=require("./index315.cjs"),A=BigInt(0),u=BigInt(1),H=BigInt(2),L=BigInt(7),S=BigInt(256),T=BigInt(113),O=[],y=[],w=[];for(let n=0,t=u,s=1,i=0;n<24;n++){[s,i]=[i,(2*s+3*i)%5],O.push(2*(5*i+s)),y.push((n+1)*(n+2)/2%64);let o=A;for(let r=0;r<7;r++)t=(t<<u^(t>>L)*T)%S,t&H&&(o^=u<<(u<<BigInt(r))-u);w.push(o)}const _=f.split(w,!0),F=_[0],X=_[1],I=(n,t,s)=>s>32?f.rotlBH(n,t,s):f.rotlSH(n,t,s),x=(n,t,s)=>s>32?f.rotlBL(n,t,s):f.rotlSL(n,t,s);function b(n,t=24){const s=new Uint32Array(10);for(let i=24-t;i<24;i++){for(let e=0;e<10;e++)s[e]=n[e]^n[e+10]^n[e+20]^n[e+30]^n[e+40];for(let e=0;e<10;e+=2){const h=(e+8)%10,l=(e+2)%10,p=s[l],a=s[l+1],g=I(p,a,1)^s[h],B=x(p,a,1)^s[h+1];for(let d=0;d<50;d+=10)n[e+d]^=g,n[e+d+1]^=B}let o=n[2],r=n[3];for(let e=0;e<24;e++){const h=y[e],l=I(o,r,h),p=x(o,r,h),a=O[e];o=n[a],r=n[a+1],n[a]=l,n[a+1]=p}for(let e=0;e<50;e+=10){for(let h=0;h<10;h++)s[h]=n[e+h];for(let h=0;h<10;h++)n[e+h]^=~s[(h+2)%10]&s[(h+4)%10]}n[0]^=F[i],n[1]^=X[i]}c.clean(s)}class k extends c.Hash{constructor(t,s,i,o=!1,r=24){if(super(),this.pos=0,this.posOut=0,this.finished=!1,this.destroyed=!1,this.enableXOF=!1,this.blockLen=t,this.suffix=s,this.outputLen=i,this.enableXOF=o,this.rounds=r,c.anumber(i),!(0<t&&t<200))throw new Error("only keccak-f1600 function is supported");this.state=new Uint8Array(200),this.state32=c.u32(this.state)}clone(){return this._cloneInto()}keccak(){c.swap32IfBE(this.state32),b(this.state32,this.rounds),c.swap32IfBE(this.state32),this.posOut=0,this.pos=0}update(t){c.aexists(this),t=c.toBytes(t),c.abytes(t);const{blockLen:s,state:i}=this,o=t.length;for(let r=0;r<o;){const e=Math.min(s-this.pos,o-r);for(let h=0;h<e;h++)i[this.pos++]^=t[r++];this.pos===s&&this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;const{state:t,suffix:s,pos:i,blockLen:o}=this;t[i]^=s,s&128&&i===o-1&&this.keccak(),t[o-1]^=128,this.keccak()}writeInto(t){c.aexists(this,!1),c.abytes(t),this.finish();const s=this.state,{blockLen:i}=this;for(let o=0,r=t.length;o<r;){this.posOut>=i&&this.keccak();const e=Math.min(i-this.posOut,r-o);t.set(s.subarray(this.posOut,this.posOut+e),o),this.posOut+=e,o+=e}return t}xofInto(t){if(!this.enableXOF)throw new Error("XOF is not possible for this instance");return this.writeInto(t)}xof(t){return c.anumber(t),this.xofInto(new Uint8Array(t))}digestInto(t){if(c.aoutput(t,this),this.finished)throw new Error("digest() was already called");return this.writeInto(t),this.destroy(),t}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,c.clean(this.state)}_cloneInto(t){const{blockLen:s,suffix:i,outputLen:o,rounds:r,enableXOF:e}=this;return t||(t=new k(s,i,o,e,r)),t.state32.set(this.state32),t.pos=this.pos,t.posOut=this.posOut,t.finished=this.finished,t.rounds=r,t.suffix=i,t.outputLen=o,t.enableXOF=e,t.destroyed=this.destroyed,t}}const m=(n,t,s)=>c.createHasher(()=>new k(t,n,s)),E=m(1,136,256/8);exports.Keccak=k;exports.keccakP=b;exports.keccak_256=E;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index302.cjs"),y=require("./index288.cjs"),s=require("./index312.cjs"),z=require("./index304.cjs"),S=new TextEncoder;function x(e){return e instanceof Uint8Array?e:typeof e=="string"?h(e):g(e)}function g(e){return e instanceof Uint8Array?e:new Uint8Array(e)}function h(e,t={}){const{size:r}=t;let n=e;r&&(z.assertSize(e,r),n=y.padRight(e,r));let i=n.slice(2);i.length%2&&(i=`0${i}`);const d=i.length/2,f=new Uint8Array(d);for(let c=0,o=0;c<d;c++){const u=s.charCodeToBase16(i.charCodeAt(o++)),b=s.charCodeToBase16(i.charCodeAt(o++));if(u===void 0||b===void 0)throw new a.BaseError(`Invalid byte sequence ("${i[o-2]}${i[o-1]}" in "${i}").`);f[c]=u*16+b}return f}function m(e,t={}){const{size:r}=t,n=S.encode(e);return typeof r=="number"?(s.assertSize(n,r),l(n,r)):n}function l(e,t){return s.pad(e,{dir:"right",size:t})}function E(e){return e.length}class p extends a.BaseError{constructor({givenSize:t,maxSize:r}){super(`Size cannot exceed \`${r}\` bytes. Given size: \`${t}\` bytes.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeOverflowError"})}}class $ extends a.BaseError{constructor({size:t,targetSize:r,type:n}){super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${r}\`).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeExceedsPaddingSizeError"})}}exports.SizeExceedsPaddingSizeError=$;exports.SizeOverflowError=p;exports.from=x;exports.fromArray=g;exports.fromHex=h;exports.fromString=m;exports.padRight=l;exports.size=E;

package/dist/index311.js

@@ -1,107 +1,66 @@
-import { split as L, rotlSH as T, rotlSL as S, rotlBH as m, rotlBL as F } from "./index314.js";
-import { createHasher as X, Hash as E, anumber as d, u32 as U, swap32IfBE as I, aexists as x, toBytes as P, abytes as k, aoutput as M, clean as y } from "./index315.js";
-const R = BigInt(0), f = BigInt(1), j = BigInt(2), q = BigInt(7), v = BigInt(256), z = BigInt(113), _ = [], g = [], B = [];
-for (let n = 0, t = f, s = 1, i = 0; n < 24; n++) {
-  [s, i] = [i, (2 * s + 3 * i) % 5], _.push(2 * (5 * i + s)), g.push((n + 1) * (n + 2) / 2 % 64);
-  let o = R;
-  for (let r = 0; r < 7; r++)
-    t = (t << f ^ (t >> q) * z) % v, t & j && (o ^= f << (f << /* @__PURE__ */ BigInt(r)) - f);
-  B.push(o);
+import { BaseError as c } from "./index302.js";
+import { padRight as h } from "./index288.js";
+import { charCodeToBase16 as b, assertSize as g, pad as m } from "./index312.js";
+import { assertSize as p } from "./index304.js";
+const l = /* @__PURE__ */ new TextEncoder();
+function E(e) {
+  return e instanceof Uint8Array ? e : typeof e == "string" ? y(e) : z(e);
 }
-const A = L(B, !0), C = A[0], D = A[1], O = (n, t, s) => s > 32 ? m(n, t, s) : T(n, t, s), w = (n, t, s) => s > 32 ? F(n, t, s) : S(n, t, s);
-function G(n, t = 24) {
-  const s = new Uint32Array(10);
-  for (let i = 24 - t; i < 24; i++) {
-    for (let e = 0; e < 10; e++)
-      s[e] = n[e] ^ n[e + 10] ^ n[e + 20] ^ n[e + 30] ^ n[e + 40];
-    for (let e = 0; e < 10; e += 2) {
-      const h = (e + 8) % 10, l = (e + 2) % 10, u = s[l], c = s[l + 1], b = O(u, c, 1) ^ s[h], H = w(u, c, 1) ^ s[h + 1];
-      for (let a = 0; a < 50; a += 10)
-        n[e + a] ^= b, n[e + a + 1] ^= H;
-    }
-    let o = n[2], r = n[3];
-    for (let e = 0; e < 24; e++) {
-      const h = g[e], l = O(o, r, h), u = w(o, r, h), c = _[e];
-      o = n[c], r = n[c + 1], n[c] = l, n[c + 1] = u;
-    }
-    for (let e = 0; e < 50; e += 10) {
-      for (let h = 0; h < 10; h++)
-        s[h] = n[e + h];
-      for (let h = 0; h < 10; h++)
-        n[e + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
-    }
-    n[0] ^= C[i], n[1] ^= D[i];
-  }
-  y(s);
+function z(e) {
+  return e instanceof Uint8Array ? e : new Uint8Array(e);
 }
-class p extends E {
-  // NOTE: we accept arguments in bytes instead of bits here.
-  constructor(t, s, i, o = !1, r = 24) {
-    if (super(), this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, this.enableXOF = !1, this.blockLen = t, this.suffix = s, this.outputLen = i, this.enableXOF = o, this.rounds = r, d(i), !(0 < t && t < 200))
-      throw new Error("only keccak-f1600 function is supported");
-    this.state = new Uint8Array(200), this.state32 = U(this.state);
-  }
-  clone() {
-    return this._cloneInto();
-  }
-  keccak() {
-    I(this.state32), G(this.state32, this.rounds), I(this.state32), this.posOut = 0, this.pos = 0;
-  }
-  update(t) {
-    x(this), t = P(t), k(t);
-    const { blockLen: s, state: i } = this, o = t.length;
-    for (let r = 0; r < o; ) {
-      const e = Math.min(s - this.pos, o - r);
-      for (let h = 0; h < e; h++)
-        i[this.pos++] ^= t[r++];
-      this.pos === s && this.keccak();
-    }
-    return this;
-  }
-  finish() {
-    if (this.finished)
-      return;
-    this.finished = !0;
-    const { state: t, suffix: s, pos: i, blockLen: o } = this;
-    t[i] ^= s, s & 128 && i === o - 1 && this.keccak(), t[o - 1] ^= 128, this.keccak();
-  }
-  writeInto(t) {
-    x(this, !1), k(t), this.finish();
-    const s = this.state, { blockLen: i } = this;
-    for (let o = 0, r = t.length; o < r; ) {
-      this.posOut >= i && this.keccak();
-      const e = Math.min(i - this.posOut, r - o);
-      t.set(s.subarray(this.posOut, this.posOut + e), o), this.posOut += e, o += e;
-    }
-    return t;
-  }
-  xofInto(t) {
-    if (!this.enableXOF)
-      throw new Error("XOF is not possible for this instance");
-    return this.writeInto(t);
-  }
-  xof(t) {
-    return d(t), this.xofInto(new Uint8Array(t));
+function y(e, t = {}) {
+  const { size: r } = t;
+  let n = e;
+  r && (p(e, r), n = h(e, r));
+  let i = n.slice(2);
+  i.length % 2 && (i = `0${i}`);
+  const f = i.length / 2, a = new Uint8Array(f);
+  for (let s = 0, o = 0; s < f; s++) {
+    const d = b(i.charCodeAt(o++)), u = b(i.charCodeAt(o++));
+    if (d === void 0 || u === void 0)
+      throw new c(`Invalid byte sequence ("${i[o - 2]}${i[o - 1]}" in "${i}").`);
+    a[s] = d * 16 + u;
   }
-  digestInto(t) {
-    if (M(t, this), this.finished)
-      throw new Error("digest() was already called");
-    return this.writeInto(t), this.destroy(), t;
-  }
-  digest() {
-    return this.digestInto(new Uint8Array(this.outputLen));
-  }
-  destroy() {
-    this.destroyed = !0, y(this.state);
+  return a;
+}
+function C(e, t = {}) {
+  const { size: r } = t, n = l.encode(e);
+  return typeof r == "number" ? (g(n, r), x(n, r)) : n;
+}
+function x(e, t) {
+  return m(e, { dir: "right", size: t });
+}
+function U(e) {
+  return e.length;
+}
+class B extends c {
+  constructor({ givenSize: t, maxSize: r }) {
+    super(`Size cannot exceed \`${r}\` bytes. Given size: \`${t}\` bytes.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Bytes.SizeOverflowError"
+    });
   }
-  _cloneInto(t) {
-    const { blockLen: s, suffix: i, outputLen: o, rounds: r, enableXOF: e } = this;
-    return t || (t = new p(s, i, o, e, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = i, t.outputLen = o, t.enableXOF = e, t.destroyed = this.destroyed, t;
+}
+class O extends c {
+  constructor({ size: t, targetSize: r, type: n }) {
+    super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${r}\`).`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "Bytes.SizeExceedsPaddingSizeError"
+    });
   }
 }
-const J = (n, t, s) => X(() => new p(t, n, s)), Q = J(1, 136, 256 / 8);
 export {
-  p as Keccak,
-  G as keccakP,
-  Q as keccak_256
+  O as SizeExceedsPaddingSizeError,
+  B as SizeOverflowError,
+  E as from,
+  z as fromArray,
+  y as fromHex,
+  C as fromString,
+  x as padRight,
+  U as size
 };

package/dist/index312.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index316.cjs"),e={checksum:new c.LruMap(8192)},s=e.checksum;exports.checksum=s;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index311.cjs");function s(e,t){if(o.size(e)>t)throw new o.SizeOverflowError({givenSize:o.size(e),maxSize:t})}const n={zero:48,nine:57,A:65,F:70,a:97,f:102};function u(e){if(e>=n.zero&&e<=n.nine)return e-n.zero;if(e>=n.A&&e<=n.F)return e-(n.A-10);if(e>=n.a&&e<=n.f)return e-(n.a-10)}function z(e,t={}){const{dir:f,size:r=32}=t;if(r===0)return e;if(e.length>r)throw new o.SizeExceedsPaddingSizeError({size:e.length,targetSize:r,type:"Bytes"});const d=new Uint8Array(r);for(let i=0;i<r;i++){const a=f==="right";d[a?i:r-i-1]=e[a?i:e.length-i-1]}return d}exports.assertSize=s;exports.charCodeMap=n;exports.charCodeToBase16=u;exports.pad=z;

package/dist/index312.js

@@ -1,7 +1,47 @@
-import { LruMap as c } from "./index316.js";
-const e = {
-  checksum: /* @__PURE__ */ new c(8192)
-}, m = e.checksum;
+import { size as d, SizeOverflowError as u, SizeExceedsPaddingSizeError as a } from "./index311.js";
+function p(e, t) {
+  if (d(e) > t)
+    throw new u({
+      givenSize: d(e),
+      maxSize: t
+    });
+}
+const n = {
+  zero: 48,
+  nine: 57,
+  A: 65,
+  F: 70,
+  a: 97,
+  f: 102
+};
+function s(e) {
+  if (e >= n.zero && e <= n.nine)
+    return e - n.zero;
+  if (e >= n.A && e <= n.F)
+    return e - (n.A - 10);
+  if (e >= n.a && e <= n.f)
+    return e - (n.a - 10);
+}
+function S(e, t = {}) {
+  const { dir: z, size: i = 32 } = t;
+  if (i === 0)
+    return e;
+  if (e.length > i)
+    throw new a({
+      size: e.length,
+      targetSize: i,
+      type: "Bytes"
+    });
+  const o = new Uint8Array(i);
+  for (let r = 0; r < i; r++) {
+    const f = z === "right";
+    o[f ? r : i - r - 1] = e[f ? r : e.length - r - 1];
+  }
+  return o;
+}
 export {
-  m as checksum
+  p as assertSize,
+  n as charCodeMap,
+  s as charCodeToBase16,
+  S as pad
 };

package/dist/index313.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e="0.1.1";exports.version=e;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index316.cjs");function r(){return e.version}exports.getVersion=r;

package/dist/index313.js

@@ -1,4 +1,7 @@
-const o = "0.1.1";
+import { version as r } from "./index316.js";
+function e() {
+  return r;
+}
 export {
-  o as version
+  e as getVersion
 };

package/dist/index314.cjs

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