@tktb-tess/util-fns 0.11.0 → 0.11.1

package/README.md

@@ -1,47 +1 @@
 # util-fns
-
-Utility functions for personal use
-
-Available in both a browser and Node.js environment.
-
-## Install
-
-```bash
-npm i @tktb-tess/util-fns
-```
-
-### Usage
-
-```ts
-import { modPow, bailliePSW } from '@tktb-tess/util-fns';
-
-const ans = modPow(2n, 16n, 17n);
-console.log(ans); // 1n
-
-// Baillie-PSW primality test
-console.log(bailliePSW(2n)); // true
-console.log(bailliePSW(4n)): // false
-
-```
-
-### CDN
-
-You can also use it via CDN such as jsDelivr.
-
-```html
-<!-- You can import it as a global variable -->
-<script src="https://cdn.jsdelivr.net/npm/@tktb-tess/util-fns@0.10.0/dist/bundle.min.js"></script>
-<script type="module">
-    const { modPow } = UtilFns;
-    // ...
-</script>
-
-<!-- or as an ES Module -->
-<script type="module">
-    import { modPow } from 'https://cdn.jsdelivr.net/npm/@tktb-tess/util-fns@0.10.0/+esm';
-    // ...
-</script>
-```
-
-
-

package/dist/bundle.js

@@ -1,4 +1,4 @@
-const M = new TextEncoder(), X = (e, t) => [e].includes(t), d = (e, t) => {
+const T = new TextEncoder(), Y = (e, t) => [e].includes(t), d = (e, t) => {
   if (typeof e != typeof t) return !1;
   const n = Object.prototype.toString.call(e), r = Object.prototype.toString.call(t);
   if (n !== r) return !1;
@@ -27,7 +27,7 @@ const M = new TextEncoder(), X = (e, t) => [e].includes(t), d = (e, t) => {
   if (n === "[object Object]") {
     const s = e, o = t, i = Object.keys(s), c = Object.keys(o);
     for (const a of i) {
-      const l = c.find((y) => y === a);
+      const l = c.find((p) => p === a);
       if (l === void 0) return !1;
       const [f, h] = [s[a], o[l]];
       if (!d(f, h)) return !1;
@@ -37,7 +37,7 @@ const M = new TextEncoder(), X = (e, t) => [e].includes(t), d = (e, t) => {
   throw Error(`comparing these objects is unavailable: ${e}, ${t}`, {
     cause: [e, t]
   });
-}, H = () => {
+}, Z = () => {
   let e, t;
   return {
     promise: new Promise((r, s) => {
@@ -46,9 +46,12 @@ const M = new TextEncoder(), X = (e, t) => [e].includes(t), d = (e, t) => {
     resolve: e,
     reject: t
   };
-}, J = (e) => new Promise((t) => {
+}, Q = (e) => new Promise((t) => {
   setTimeout(() => t(), e);
-}), Y = (e) => Object.prototype.toString.call(e).match(/^\[Object\s(.+)\]$/)?.at(1), Z = (e) => (...t) => () => e(...t), Q = (e) => {
+}), tt = (e) => {
+  const t = Object.prototype.toString.call(e);
+  return t.slice(8, t.length - 1);
+}, et = (e) => (...t) => () => e(...t), nt = (e) => {
   const t = [];
   let n = [], r = "", s = !1;
   for (let o = 0; o < e.length; o++) {
@@ -57,23 +60,23 @@ const M = new TextEncoder(), X = (e, t) => [e].includes(t), d = (e, t) => {
 ` && !s ? (n.push(r.trim()), t.push(n), n = [], r = "") : r += i;
   }
   return n.push(r.trim()), t.push(n), t;
-}, tt = async (e, t) => {
-  const n = M.encode(e), r = await crypto.subtle.digest(t, n);
+}, rt = async (e, t) => {
+  const n = T.encode(e), r = await crypto.subtle.digest(t, n);
   return new Uint8Array(r);
-}, et = () => !!globalThis.process && typeof process.version < "u" && typeof process.versions.node < "u", nt = (e) => encodeURIComponent(e).replace(
+}, st = () => !!globalThis.process && typeof process.version < "u" && typeof process.versions.node < "u", ot = (e) => encodeURIComponent(e).replace(
   /[!'()*]/g,
   (n) => `%${n.charCodeAt(0).toString(16).toUpperCase()}`
-), rt = (e) => {
+), it = (e) => {
   if (e.includes("+"))
     throw Error("An input string has '+'");
   return decodeURIComponent(e);
-}, st = async (e, t) => {
+}, ct = async (e, t) => {
   const r = new Blob([e]).stream().pipeThrough(new CompressionStream(t));
   return new Response(r).bytes();
-}, ot = async (e, t) => {
+}, at = async (e, t) => {
   const r = new Blob([e]).stream().pipeThrough(new DecompressionStream(t));
   return new Response(r).bytes();
-}, it = (e, t) => new Promise((n, r) => {
+}, lt = (e, t) => new Promise((n, r) => {
   setTimeout(async () => {
     try {
       const s = await e();
@@ -82,12 +85,12 @@ const M = new TextEncoder(), X = (e, t) => [e].includes(t), d = (e, t) => {
       r(s);
     }
   }, t);
-});
-class m extends Error {
+}), N = "NamedError";
+class w extends Error {
   constructor(t, n, r) {
     super(n, r), this.errName = t;
   }
-  static name = "NamedError";
+  static name = N;
   toJSON() {
     const t = (() => {
       const o = this.cause;
@@ -101,32 +104,32 @@ class m extends Error {
     };
   }
 }
-Object.defineProperty(m.prototype, Symbol.toStringTag, {
-  value: m.name
+Object.defineProperty(w.prototype, Symbol.toStringTag, {
+  value: N
 });
-const ct = (e, t) => Math.floor(Math.random() * (t - e) + e), g = (e, t) => {
+const ut = (e, t) => Math.floor(Math.random() * (t - e) + e), g = (e, t) => {
   t < 0n && (t *= -1n);
   const n = e % t;
   return n < 0n ? n + t : n;
-}, N = (e, t = !1) => {
+}, v = (e, t = !1) => {
   if (!Number.isFinite(e)) throw Error("`length` is not a valid number");
   if (e <= 0) throw Error("`length` must be positive");
   const n = Math.ceil(e / 8), r = crypto.getRandomValues(new Uint8Array(n));
   let s = Array.from(r, (o) => o.toString(2).padStart(8, "0")).join("").slice(0, e);
   return t && (s = s.replace(/^\d/, "1")), BigInt("0b" + s);
-}, A = (e, t) => {
+}, P = (e, t) => {
   if (e >= t)
-    throw new m("RangeError", "min is larger than max");
+    throw new w("RangeError", "min is larger than max");
   const n = t - e, r = n.toString(2).length, s = (() => {
     for (let i = 0; i < 1e5; i++) {
-      const c = N(r);
-      if (c >= p(2n, BigInt(r), n))
+      const c = v(r);
+      if (c >= m(2n, BigInt(r), n))
         return c % n;
     }
     throw Error("Failed to generate a random bigint");
   })();
   return e + s;
-}, p = (e, t, n) => {
+}, m = (e, t, n) => {
   if (n < 1n) throw Error("`mod` must be positive");
   if (t < 0n) throw Error("`power` must not be negative");
   if (e = g(e, n), n === 1n) return 0n;
@@ -136,7 +139,7 @@ const ct = (e, t) => Math.floor(Math.random() * (t - e) + e), g = (e, t) => {
   for (; t > 0n; )
     t & 1n && (r = r * e % n), e = e * e % n, t >>= 1n;
   return r;
-}, T = (e, t) => {
+}, _ = (e, t) => {
   if (e === 0n && t === 0n) return { x: 0n, y: 0n, gcd: 0n };
   if (e === 0n)
     return t > 0n ? { x: 0n, y: -1n, gcd: t } : { x: 0n, y: 1n, gcd: -t };
@@ -149,7 +152,7 @@ const ct = (e, t) => Math.floor(Math.random() * (t - e) + e), g = (e, t) => {
     [n, o] = [o, n - a * o], [r, i] = [i, r - a * i], [s, c] = [c, l];
   }
   return c < 0n && (o *= -1n, i *= -1n, c *= -1n), { x: o, y: i, gcd: c };
-}, w = (e, t) => {
+}, I = (e, t) => {
   if (e >= t) return 1n;
   const n = BigInt((t - 2n).toString(2).length), r = (t - e) / 2n;
   if (n * r < 63n) {
@@ -158,22 +161,22 @@ const ct = (e, t) => Math.floor(Math.random() * (t - e) + e), g = (e, t) => {
       c *= a;
     return c;
   }
-  const s = e + r | 1n, o = w(e, s), i = w(s, t);
+  const s = e + r | 1n, o = I(e, s), i = I(s, t);
   return o * i;
-}, P = (e) => {
+}, j = (e) => {
   let t = 3n, n = 1n, r = 1n;
   const s = BigInt(e.toString(2).length) - 1n;
   for (let o = s - 1n; o > -1n; --o) {
     const i = (e >> o) + 1n | 1n;
-    r *= w(t, i), t = i, n *= r;
+    r *= I(t, i), t = i, n *= r;
   }
   return n;
-}, at = (e) => {
+}, ft = (e) => {
   if (e < 0n) throw Error("'n' must be non-negative");
   if (e === 0n) return 1n;
   const t = e - BigInt(e.toString(2).match(/1/g)?.length ?? 0);
-  return P(e) << t;
-}, j = (e, t) => (e >>> (t & 31) | e << (-t & 31)) >>> 0, b = (e, t) => BigInt.asUintN(64, e >> (t & 63n) | e << (-t & 63n)), E = (e, t) => {
+  return j(e) << t;
+}, C = (e, t) => (e >>> (t & 31) | e << (-t & 31)) >>> 0, b = (e, t) => BigInt.asUintN(64, e >> (t & 63n) | e << (-t & 63n)), E = (e, t) => {
   if (t < 1n || t % 2n === 0n)
     throw Error("`n` is invalid");
   for (; e < 0n; )
@@ -189,7 +192,7 @@ const ct = (e, t) => Math.floor(Math.random() * (t - e) + e), g = (e, t) => {
     [e, t] = [t, e], e % 4n === 3n && t % 4n === 3n && (n *= -1n), e %= t;
   }
   return t === 1n ? n : 0n;
-}, _ = (e) => {
+}, O = (e) => {
   if (e < 0n) return !1;
   if (e === 0n) return !0;
   let t = 1n, n = e;
@@ -198,46 +201,47 @@ const ct = (e, t) => Math.floor(Math.random() * (t - e) + e), g = (e, t) => {
     r * r < e ? t = r : n = r;
   }
   return e === t ** 2n || e === (t + 1n) ** 2n;
-}, C = (e) => {
+}, F = (e) => {
   if (e <= 1n) return !1;
   if (e % 2n === 0n) return e === 2n;
   let t = e - 1n, n = 0n;
   for (; t % 2n === 0n; )
     t >>= 1n, n += 1n;
   const [r, s] = [t, n];
-  let i = p(2n, r, e);
+  let i = m(2n, r, e);
   if (i === 1n) return !0;
   for (let c = 0n; c < s; c++) {
     if (i === e - 1n) return !0;
     i = i * i % e;
   }
   return !1;
-}, O = (e) => {
+}, V = (e) => {
   let t = 5n, n = E(t, e);
   for (; n > 0n; ) {
-    if (t = t > 0n ? t + 2n : t - 2n, t *= -1n, t === -15n && _(e))
+    if (t = t > 0n ? t + 2n : t - 2n, t *= -1n, t === -15n && O(e))
       return [0n, 0n];
     n = E(t, e);
   }
   return [t, n];
-}, I = (e, t) => (e & 1n) === 1n ? g(e + t >> 1n, t) : g(e >> 1n, t), F = (e, t, n, r) => {
+}, y = (e, t) => (e & 1n) === 1n ? g(e + t >> 1n, t) : g(e >> 1n, t), $ = (e, t, n, r) => {
   let s = 1n, o = n;
   const i = e.toString(2).slice(1);
   for (const c of i)
-    [s, o] = [g(s * o, t), I(o * o + r * s * s, t)], c === "1" && ([s, o] = [I(n * s + o, t), I(r * s + n * o, t)]);
+    [s, o] = [g(s * o, t), y(o * o + r * s * s, t)], c === "1" && ([s, o] = [y(n * s + o, t), y(r * s + n * o, t)]);
   return [s, o];
-}, V = (e, t, n, r) => {
-  if (e % 2n !== 1n) throw Error("`n` must be odd");
+}, D = (e, t, n, r) => {
+  if (e % 2n !== 1n)
+    throw Error("`n` must be odd");
   let s = e + 1n, o = 0n;
   for (; s % 2n === 0n; )
     s >>= 1n, o += 1n;
-  const [i, c] = F(s, e, n, t);
+  const [i, c] = $(s, e, n, t);
   let a = c;
   if (i === 0n) return !0;
-  r = p(r, s, e);
+  r = m(r, s, e);
   for (let l = 0n; l < o; l++) {
     if (a === 0n) return !0;
-    a = g(a * a - 2n * r, e), r = p(r, 2n, e);
+    a = g(a * a - 2n * r, e), r = m(r, 2n, e);
   }
   return !1;
 }, R = (e) => {
@@ -274,33 +278,33 @@ const ct = (e, t) => Math.floor(Math.random() * (t - e) + e), g = (e, t) => {
   for (const o of t)
     if (e % o === 0n)
       return e === o;
-  if (!C(e))
+  if (!F(e))
     return !1;
-  const [n, r] = O(e);
+  const [n, r] = V(e);
   if (r === 0n) return !1;
   const s = (1n - n) / 4n;
-  return V(e, n, 1n, s);
-}, lt = (e, t) => {
+  return D(e, n, 1n, s);
+}, ht = (e, t) => {
   if (t < 2n)
-    throw Error("noPrimesFound");
+    throw Error("NoPrimesFound");
   for (let r = 0; r < 1e5; r++) {
-    const s = A(e, t);
+    const s = P(e, t);
     if (R(s)) return s;
   }
-  throw Error("noPrimesFound");
-}, ut = (e, t = !1) => {
+  throw Error("NoPrimesFound");
+}, dt = (e, t = !1) => {
   if (e < 2)
-    throw Error("noPrimesFound");
+    throw Error("NoPrimesFound");
   for (let r = 0; r < 1e5; r++) {
-    const s = N(e, t);
+    const s = v(e, t);
     if (R(s)) return s;
   }
-  throw Error("noPrimesFound");
-};
+  throw Error("NoPrimesFound");
+}, x = "Rational";
 class u {
   #t;
   #e;
-  static name = "Rational";
+  static name = x;
   /**
    * fraction (rational) class
    * @param numerator
@@ -338,7 +342,7 @@ class u {
    * reduction
    */
   #n() {
-    const { gcd: t } = T(this.#t, this.#e);
+    const { gcd: t } = _(this.#t, this.#e);
     t !== 0n && (this.#t /= t, this.#e /= t);
   }
   /**
@@ -447,20 +451,20 @@ class u {
   }
 }
 Object.defineProperty(u.prototype, Symbol.toStringTag, {
-  value: u.name
+  value: x
 });
-const $ = (e) => {
+const k = (e) => {
   const t = Array.from(e, (n) => String.fromCharCode(n));
   return btoa(t.join(""));
-}, D = (e) => {
+}, q = (e) => {
   const t = atob(e);
   return Uint8Array.from(t, (n) => n.charCodeAt(0));
-}, ft = (e) => $(e).replaceAll("+", "-").replaceAll("/", "_").replace(/=+$/, ""), ht = (e) => {
+}, gt = (e) => k(e).replaceAll("+", "-").replaceAll("/", "_").replace(/=+$/, ""), mt = (e) => {
   const t = e.length & 3;
   t > 0 && (e = e + "=".repeat(4 - t));
   const n = e.replaceAll("-", "+").replaceAll("_", "/");
-  return D(n);
-}, dt = (e) => {
+  return q(n);
+}, pt = (e) => {
   let t = Array.from(e, (o) => o.toString(16).padStart(2, "0")).join("");
   const n = t.length % 6;
   n && (t = "0".repeat(6 - n) + t);
@@ -469,7 +473,7 @@ const $ = (e) => {
     r,
     (o) => Number.parseInt(o[0], 16).toString(8).padStart(8, "0")
   ).join("").replace(/^0+/, "");
-}, gt = (e) => {
+}, yt = (e) => {
   const t = e.length & 7;
   t && (e = "0".repeat(8 - t) + e);
   const n = e.matchAll(/.{8}/g), s = Array.from(n, (o) => {
@@ -477,13 +481,13 @@ const $ = (e) => {
     return Number.parseInt(i, 8).toString(16).padStart(6, "0");
   }).join("").matchAll(/.{2}/g);
   return Uint8Array.from(s, (o) => Number.parseInt(o[0], 16));
-}, k = (e) => {
+}, K = (e) => {
   const t = e < 0n;
   t && (e *= -1n);
   const n = e.toString(2).length, r = e === 1n << BigInt(n - 1) && !(n % 7) && t, s = Math.floor(n / 7) + 1;
   return r ? s - 1 : s;
-}, mt = (e) => {
-  const t = k(e);
+}, It = (e) => {
+  const t = K(e);
   e = BigInt.asUintN(t * 7, e);
   const n = new Uint8Array(t);
   for (let s = 0; s < t - 1; ++s) {
@@ -492,7 +496,7 @@ const $ = (e) => {
   }
   const r = Number(e & 127n);
   return n[t - 1] = r, e >>= 7n, n;
-}, pt = (e) => {
+}, wt = (e) => {
   const t = e.length;
   let n = 0n;
   for (let r = 0; r < t; ++r) {
@@ -506,16 +510,16 @@ const $ = (e) => {
   for (; e > 0 && !(e & 1); )
     ++t, e >>>= 1;
   return t;
-}, x = "FloatRng", S = (e) => {
+}, M = "FloatRng", S = (e) => {
   if (e === 0n) return 64n;
   let t = 0n;
   for (; e > 0n && !(e & 1n); )
     ++t, e >>= 1n;
   return BigInt.asUintN(64, t);
 };
-class q {
+class G {
   #t;
-  static name = x;
+  static name = M;
   constructor(t) {
     this.#t = t;
   }
@@ -600,8 +604,8 @@ class q {
         const f = (() => {
           switch (this.#t.bits) {
             case 32: {
-              const h = BigInt(this.#t.getU32Rand() >>> 0), y = BigInt(this.#t.getU32Rand() >>> 0);
-              return h << 32n | y;
+              const h = BigInt(this.#t.getU32Rand() >>> 0), p = BigInt(this.#t.getU32Rand() >>> 0);
+              return h << 32n | p;
             }
             case 64:
               return BigInt.asUintN(64, this.#t.getU64Rand());
@@ -638,16 +642,16 @@ class q {
     throw Error("exceeded loop limit");
   }
 }
-Object.defineProperty(q.prototype, Symbol.toStringTag, {
-  value: x
+Object.defineProperty(G.prototype, Symbol.toStringTag, {
+  value: M
 });
-const K = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn], G = 0x5851f42d4c957f2dn;
-class U {
+const W = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn], z = 0x5851f42d4c957f2dn, A = "PCGMinimal";
+class X {
   /**
    * length = 2, `[state, increment]`
    */
   #t;
-  static name = "PCGMinimal";
+  static name = A;
   bits = 32;
   /**
    * @param seeds
@@ -663,16 +667,16 @@ class U {
    * const betterRng = new PCGMinimal(seed);
    */
   constructor(t) {
-    t && t.length >= 2 ? (this.#t = new BigUint64Array(2), this.#t[1] = t[1] << 1n | 1n, this.#e(), this.#t[0] += t[0], this.#e()) : this.#t = BigUint64Array.from(K);
+    t && t.length >= 2 ? (this.#t = new BigUint64Array(2), this.#t[1] = t[1] << 1n | 1n, this.#e(), this.#t[0] += t[0], this.#e()) : this.#t = BigUint64Array.from(W);
   }
   /** step inner state */
   #e() {
-    this.#t[0] = this.#t[0] * G + this.#t[1];
+    this.#t[0] = this.#t[0] * z + this.#t[1];
   }
   /** 32bit 乱数を返す (内部状態は変わらない) */
   get #n() {
     const t = this.#t[0], n = Number(t >> 59n), r = Number(BigInt.asUintN(32, (t ^ t >> 18n) >> 27n));
-    return j(r, n);
+    return C(r, n);
   }
   /**
    *
@@ -711,16 +715,16 @@ class U {
       yield typeof n == "number" ? this.getBoundedU32Rand(n) : this.getU32Rand();
   }
 }
-Object.defineProperty(U.prototype, Symbol.toStringTag, {
-  value: U.name
+Object.defineProperty(X.prototype, Symbol.toStringTag, {
+  value: A
 });
-const W = [
+const H = [
   0xbe562cb412e2260en,
   0x2e4284137d641affn,
   0x4e19b36ee933e27en,
   0x7581cf8c4f4d4f7dn
 ];
-class v {
+class U {
   bits = 64;
   #t;
   static name = "XoshiroMinimal";
@@ -738,7 +742,7 @@ class v {
    * const betterRng = new XoshiroMinimal(seed);
    */
   constructor(t) {
-    t && t.length >= 4 ? (this.#t = new BigUint64Array(4), this.#t[0] = t[0], this.#t[1] = t[1], this.#e(), this.#t[2] += t[2], this.#t[3] += t[3]) : this.#t = BigUint64Array.from(W);
+    t && t.length >= 4 ? (this.#t = new BigUint64Array(4), this.#t[0] = t[0], this.#t[1] = t[1], this.#e(), this.#t[2] += t[2], this.#t[3] += t[3]) : this.#t = BigUint64Array.from(H);
   }
   #e() {
     const t = this.#t[1] << 17n;
@@ -791,11 +795,11 @@ class v {
       yield n === void 0 ? this.getU32Rand() : this.getBoundedU32Rand(n);
   }
 }
-Object.defineProperty(v.prototype, Symbol.toStringTag, {
-  value: v.name
+Object.defineProperty(U.prototype, Symbol.toStringTag, {
+  value: U.name
 });
 const L = "WorkerStream";
-class z extends ReadableStream {
+class J extends ReadableStream {
   close;
   #t;
   static name = L;
@@ -808,7 +812,7 @@ class z extends ReadableStream {
             i.enqueue(c.data);
           }, s = (c) => {
             t.removeEventListener("message", r), t.removeEventListener("error", s);
-            const a = new m("WorkerStreamError", c.message, {
+            const a = new w("WorkerStreamError", c.message, {
               cause: c.error
             });
             i.error(a);
@@ -827,50 +831,50 @@ class z extends ReadableStream {
     this.#t.postMessage(t, n);
   }
 }
-Object.defineProperty(z.prototype, Symbol.toStringTag, {
+Object.defineProperty(J.prototype, Symbol.toStringTag, {
   value: L
 });
 export {
-  q as FloatRng,
-  m as NamedError,
-  U as PCGMinimal,
+  G as FloatRng,
+  w as NamedError,
+  X as PCGMinimal,
   u as Rational,
-  z as WorkerStream,
-  v as XoshiroMinimal,
+  J as WorkerStream,
+  U as XoshiroMinimal,
   R as bailliePSW,
-  st as compress,
-  pt as decodeLEB128,
-  rt as decodeRFC3986URIComponent,
-  ot as decompress,
-  mt as encodeLEB128,
-  nt as encodeRFC3986URIComponent,
-  T as exEuclidean,
-  at as factorial,
-  D as fromBase64,
-  ht as fromBase64Url,
-  gt as fromOct,
-  tt as getHash,
-  N as getRandBIByBitLength,
-  A as getRandBIByRange,
-  ut as getRandPrimeByBitLength,
-  lt as getRandPrimeByRange,
-  ct as getRndInt,
-  Y as getStringTag,
+  ct as compress,
+  wt as decodeLEB128,
+  it as decodeRFC3986URIComponent,
+  at as decompress,
+  It as encodeLEB128,
+  ot as encodeRFC3986URIComponent,
+  _ as exEuclidean,
+  ft as factorial,
+  q as fromBase64,
+  mt as fromBase64Url,
+  yt as fromOct,
+  rt as getHash,
+  v as getRandBIByBitLength,
+  P as getRandBIByRange,
+  dt as getRandPrimeByBitLength,
+  ht as getRandPrimeByRange,
+  ut as getRndInt,
+  tt as getStringTag,
   d as isDeepStrictEqual,
-  et as isNode,
-  _ as isSquare,
+  st as isNode,
+  O as isSquare,
   E as jacobiSymbol,
-  Z as lazify,
-  p as modPow,
-  Q as parseCSV,
+  et as lazify,
+  m as modPow,
+  nt as parseCSV,
   g as residue,
-  j as rot32,
+  C as rot32,
   b as rot64,
-  X as sameValueZero,
-  it as setTimeoutPromise,
-  J as sleep,
-  $ as toBase64,
-  ft as toBase64Url,
-  dt as toOct,
-  H as withResolvers
+  Y as sameValueZero,
+  lt as setTimeoutPromise,
+  Q as sleep,
+  k as toBase64,
+  gt as toBase64Url,
+  pt as toOct,
+  Z as withResolvers
 };

package/dist/bundle.min.js

@@ -1,2 +1,2 @@
-var UtilFns=(function(c){"use strict";const $=new TextEncoder,D=(n,t)=>[n].includes(t),g=(n,t)=>{if(typeof n!=typeof t)return!1;const e=Object.prototype.toString.call(n),r=Object.prototype.toString.call(t);if(e!==r)return!1;if(typeof n=="string"||typeof n=="bigint"||typeof n=="boolean"||typeof n=="symbol"||n==null)return n===t;if(typeof n=="number")return n!==n&&t!==t||n===t;if(typeof n=="function")return!1;if(Array.isArray(n)&&Array.isArray(t)){if(n.length!==t.length)return!1;for(let s=0;s<n.length;s++)if(!g(n[s],t[s]))return!1;return!0}if(n instanceof Set&&t instanceof Set){const s=[...n.values()],i=[...t.values()];return!!g(s,i)}if(n instanceof Map&&t instanceof Map){const s=[...n.keys()],i=[...t.keys()];if(!g(s,i))return!1;const o=[...n.values()],a=[...t.values()];return!!g(o,a)}if(e==="[object Object]"){const s=n,i=t,o=Object.keys(s),a=Object.keys(i);for(const l of o){const u=a.find(v=>v===l);if(u===void 0)return!1;const[h,d]=[s[l],i[u]];if(!g(h,d))return!1}return!0}throw Error(`comparing these objects is unavailable: ${n}, ${t}`,{cause:[n,t]})},q=()=>{let n,t;return{promise:new Promise((r,s)=>{n=r,t=s}),resolve:n,reject:t}},k=n=>new Promise(t=>{setTimeout(()=>t(),n)}),K=n=>Object.prototype.toString.call(n).match(/^\[Object\s(.+)\]$/)?.at(1),W=n=>(...t)=>()=>n(...t),G=n=>{const t=[];let e=[],r="",s=!1;for(let i=0;i<n.length;i++){const o=n[i];o==='"'&&(i===0||n[i-1]!=="\\")?s=!s:o===","&&!s?(e.push(r.trim()),r=""):o===`
-`&&!s?(e.push(r.trim()),t.push(e),e=[],r=""):r+=o}return e.push(r.trim()),t.push(e),t},z=async(n,t)=>{const e=$.encode(n),r=await crypto.subtle.digest(t,e);return new Uint8Array(r)},X=()=>!!globalThis.process&&typeof process.version<"u"&&typeof process.versions.node<"u",H=n=>encodeURIComponent(n).replace(/[!'()*]/g,e=>`%${e.charCodeAt(0).toString(16).toUpperCase()}`),J=n=>{if(n.includes("+"))throw Error("An input string has '+'");return decodeURIComponent(n)},Y=async(n,t)=>{const r=new Blob([n]).stream().pipeThrough(new CompressionStream(t));return new Response(r).bytes()},Z=async(n,t)=>{const r=new Blob([n]).stream().pipeThrough(new DecompressionStream(t));return new Response(r).bytes()},x=(n,t)=>new Promise((e,r)=>{setTimeout(async()=>{try{const s=await n();e(s)}catch(s){r(s)}},t)});class y extends Error{constructor(t,e,r){super(e,r),this.errName=t}static name="NamedError";toJSON(){const t=(()=>{const i=this.cause;return typeof i=="string"||typeof i=="number"||typeof i=="boolean"?i:typeof i=="bigint"?i.toString():typeof i=="object"&&i!==null?i instanceof Set||i instanceof Map?Object.fromEntries(i):i:void 0})(),{errName:e,message:r,stack:s}=this;return{errName:e,message:r,stack:s,cause:t}}}Object.defineProperty(y.prototype,Symbol.toStringTag,{value:y.name});const Q=(n,t)=>Math.floor(Math.random()*(t-n)+n),m=(n,t)=>{t<0n&&(t*=-1n);const e=n%t;return e<0n?e+t:e},I=(n,t=!1)=>{if(!Number.isFinite(n))throw Error("`length` is not a valid number");if(n<=0)throw Error("`length` must be positive");const e=Math.ceil(n/8),r=crypto.getRandomValues(new Uint8Array(e));let s=Array.from(r,i=>i.toString(2).padStart(8,"0")).join("").slice(0,n);return t&&(s=s.replace(/^\d/,"1")),BigInt("0b"+s)},N=(n,t)=>{if(n>=t)throw new y("RangeError","min is larger than max");const e=t-n,r=e.toString(2).length,s=(()=>{for(let o=0;o<1e5;o++){const a=I(r);if(a>=p(2n,BigInt(r),e))return a%e}throw Error("Failed to generate a random bigint")})();return n+s},p=(n,t,e)=>{if(e<1n)throw Error("`mod` must be positive");if(t<0n)throw Error("`power` must not be negative");if(n=m(n,e),e===1n)return 0n;if(n%e===1n||n%e===0n)return n;if(n===e-1n)return t&1n?e-1n:1n;let r=1n;for(;t>0n;)t&1n&&(r=r*n%e),n=n*n%e,t>>=1n;return r},L=(n,t)=>{if(n===0n&&t===0n)return{x:0n,y:0n,gcd:0n};if(n===0n)return t>0n?{x:0n,y:-1n,gcd:t}:{x:0n,y:1n,gcd:-t};if(t===0n)return n>0n?{x:1n,y:0n,gcd:n}:{x:-1n,y:0n,gcd:-n};let[e,r,s]=[1n,0n,n],[i,o,a]=[0n,-1n,t];for(;;){const l=s/a,u=s-l*a;if(u===0n)break;[e,i]=[i,e-l*i],[r,o]=[o,r-l*o],[s,a]=[a,u]}return a<0n&&(i*=-1n,o*=-1n,a*=-1n),{x:i,y:o,gcd:a}},w=(n,t)=>{if(n>=t)return 1n;const e=BigInt((t-2n).toString(2).length),r=(t-n)/2n;if(e*r<63n){let a=n;for(let l=n+2n;l<t;l+=2n)a*=l;return a}const s=n+r|1n,i=w(n,s),o=w(s,t);return i*o},tt=n=>{let t=3n,e=1n,r=1n;const s=BigInt(n.toString(2).length)-1n;for(let i=s-1n;i>-1n;--i){const o=(n>>i)+1n|1n;r*=w(t,o),t=o,e*=r}return e},nt=n=>{if(n<0n)throw Error("'n' must be non-negative");if(n===0n)return 1n;const t=n-BigInt(n.toString(2).match(/1/g)?.length??0);return tt(n)<<t},M=(n,t)=>(n>>>(t&31)|n<<(-t&31))>>>0,b=(n,t)=>BigInt.asUintN(64,n>>(t&63n)|n<<(-t&63n)),B=(n,t)=>{if(t<1n||t%2n===0n)throw Error("`n` is invalid");for(;n<0n;)n+=t;n%=t;let e=1n;for(;n!==0n;){for(;n%2n===0n;){n/=2n;const r=t%8n;(r===3n||r===5n)&&(e*=-1n)}[n,t]=[t,n],n%4n===3n&&t%4n===3n&&(e*=-1n),n%=t}return t===1n?e:0n},T=n=>{if(n<0n)return!1;if(n===0n)return!0;let t=1n,e=n;for(;t+1n<e;){const r=(t+e)/2n;r*r<n?t=r:e=r}return n===t**2n||n===(t+1n)**2n},et=n=>{if(n<=1n)return!1;if(n%2n===0n)return n===2n;let t=n-1n,e=0n;for(;t%2n===0n;)t>>=1n,e+=1n;const[r,s]=[t,e];let o=p(2n,r,n);if(o===1n)return!0;for(let a=0n;a<s;a++){if(o===n-1n)return!0;o=o*o%n}return!1},rt=n=>{let t=5n,e=B(t,n);for(;e>0n;){if(t=t>0n?t+2n:t-2n,t*=-1n,t===-15n&&T(n))return[0n,0n];e=B(t,n)}return[t,e]},E=(n,t)=>(n&1n)===1n?m(n+t>>1n,t):m(n>>1n,t),st=(n,t,e,r)=>{let s=1n,i=e;const o=n.toString(2).slice(1);for(const a of o)[s,i]=[m(s*i,t),E(i*i+r*s*s,t)],a==="1"&&([s,i]=[E(e*s+i,t),E(r*s+e*i,t)]);return[s,i]},it=(n,t,e,r)=>{if(n%2n!==1n)throw Error("`n` must be odd");let s=n+1n,i=0n;for(;s%2n===0n;)s>>=1n,i+=1n;const[o,a]=st(s,n,e,t);let l=a;if(o===0n)return!0;r=p(r,s,n);for(let u=0n;u<i;u++){if(l===0n)return!0;l=m(l*l-2n*r,n),r=p(r,2n,n)}return!1},S=n=>{if(n<=1n)return!1;if(n%2n===0n)return n===2n;const t=[2n,3n,5n,7n,11n,13n,17n,19n,23n,29n,31n,37n,41n,43n,47n,53n,59n,61n,67n,71n,73n,79n,83n,89n,97n,101n];for(const i of t)if(n%i===0n)return n===i;if(!et(n))return!1;const[e,r]=rt(n);if(r===0n)return!1;const s=(1n-e)/4n;return it(n,e,1n,s)},ot=(n,t)=>{if(t<2n)throw Error("noPrimesFound");for(let r=0;r<1e5;r++){const s=N(n,t);if(S(s))return s}throw Error("noPrimesFound")},ct=(n,t=!1)=>{if(n<2)throw Error("noPrimesFound");for(let r=0;r<1e5;r++){const s=I(n,t);if(S(s))return s}throw Error("noPrimesFound")};class f{#t;#n;static name="Rational";constructor(t,e){e===0n?(this.#n=0n,this.#t=t===0n?0n:t>0n?1n:-1n):e>0n?(this.#t=t,this.#n=e):(this.#t=-t,this.#n=-e),this.#e()}static fromDecimal(t,e=5){if(Number.isNaN(t))return new f(0n,0n);if(Math.abs(t)===1/0)return new f(t>0?1n:-1n,0n);const r=t<0;r&&(t*=-1);const s=BigInt(Math.floor(t)),i=t-Number(s);if(i===0)return new f(r?-s:s,1n);t=1/i;let[o,a]=[1n,s],[l,u]=[0n,1n];for(;`${u}`.length<e+1;){const h=BigInt(Math.floor(t)),d=t-Number(h);if([o,a]=[a,h*a+o],[l,u]=[u,h*u+l],d===0)return new f(r?-a:a,u);t=1/d}return new f(r?-o:o,l)}#e(){const{gcd:t}=L(this.#t,this.#n);t!==0n&&(this.#t/=t,this.#n/=t)}minus(){return new f(-this.#t,this.#n)}inverse(){return new f(this.#n,this.#t)}add(t){const e=this.#n*t.#n,r=this.#t*t.#n+t.#t*this.#n;return new f(r,e)}substr(t){return this.add(t.minus())}multiply(t){const e=this.#n*t.#n,r=this.#t*t.#t;return new f(r,e)}divide(t){return this.multiply(t.inverse())}mediant(t){const e=this.#n+t.#n,r=this.#t+t.#t;return new f(r,e)}toDecimal(){return Number(this.#t)/Number(this.#n)}toString(){return this.#t===0n&&this.#n===0n?"NaN":this.#t===0n?"0":this.#n===0n?this.#t<0n?"-Infinity":"Infinity":this.#n===1n?`${this.#t}`:`${this.#t}/${this.#n}`}valueOf(){return this.toDecimal()}toJSON(){return{type:"Rational",value:["0x"+this.#t.toString(16),"0x"+this.#n.toString(16)]}}static fromData(t){const e=BigInt(t.value[0]),r=BigInt(t.value[1]);return new f(e,r)}static parse(t){const r=/^\s*(\d+)\s*\/\s*(\d+)\s*$/.exec(t);if(!r)throw Error("cannot parse");const s=r.at(1),i=r.at(2);if(!s||!i)throw Error("cannot parse");return new f(BigInt(s),BigInt(i))}}Object.defineProperty(f.prototype,Symbol.toStringTag,{value:f.name});const A=n=>{const t=Array.from(n,e=>String.fromCharCode(e));return btoa(t.join(""))},P=n=>{const t=atob(n);return Uint8Array.from(t,e=>e.charCodeAt(0))},at=n=>A(n).replaceAll("+","-").replaceAll("/","_").replace(/=+$/,""),lt=n=>{const t=n.length&3;t>0&&(n=n+"=".repeat(4-t));const e=n.replaceAll("-","+").replaceAll("_","/");return P(e)},ut=n=>{let t=Array.from(n,i=>i.toString(16).padStart(2,"0")).join("");const e=t.length%6;e&&(t="0".repeat(6-e)+t);const r=t.matchAll(/.{6}/g);return Array.from(r,i=>Number.parseInt(i[0],16).toString(8).padStart(8,"0")).join("").replace(/^0+/,"")},ft=n=>{const t=n.length&7;t&&(n="0".repeat(8-t)+n);const e=n.matchAll(/.{8}/g),s=Array.from(e,i=>{const o=i[0];return Number.parseInt(o,8).toString(16).padStart(6,"0")}).join("").matchAll(/.{2}/g);return Uint8Array.from(s,i=>Number.parseInt(i[0],16))},ht=n=>{const t=n<0n;t&&(n*=-1n);const e=n.toString(2).length,r=n===1n<<BigInt(e-1)&&!(e%7)&&t,s=Math.floor(e/7)+1;return r?s-1:s},dt=n=>{const t=ht(n);n=BigInt.asUintN(t*7,n);const e=new Uint8Array(t);for(let s=0;s<t-1;++s){const i=Number(n&127n)|128;e[s]=i,n>>=7n}const r=Number(n&127n);return e[t-1]=r,n>>=7n,e},gt=n=>{const t=n.length;let e=0n;for(let r=0;r<t;++r){const s=BigInt(n[r]&127);e+=s<<BigInt(7*r)}return BigInt.asIntN(7*t,e)},j=n=>{if(n===0)return 32;let t=0;for(;n>0&&!(n&1);)++t,n>>>=1;return t},C="FloatRng",_=n=>{if(n===0n)return 64n;let t=0n;for(;n>0n&&!(n&1n);)++t,n>>=1n;return BigInt.asUintN(64,t)};class O{#t;static name=C;constructor(t){this.#t=t}#n(){const r=(()=>{switch(this.#t.bits){case 32:return this.#t.getU32Rand()>>>0;case 64:{const l=this.#t.getU64Rand()&0xffffffffn;return Number(l)}}})(),s=r&255;let i=126;if(s===0){i-=8;const l=1e5;let u=0;t:for(;;){if(u>l)throw Error("loop exceeded limit");const h=(()=>{switch(this.#t.bits){case 32:return this.#t.getU32Rand()>>>0;case 64:{const d=BigInt.asUintN(32,this.#t.getU64Rand());return Number(d)}}})();if(h===0){if(i-=32,i<0){i=0;break t}}else{i-=j(h);break t}++u}}else i-=j(s);const o=r>>>8&8388607;o===0&&r>>>31&&++i;const a=Uint32Array.from([i<<23|o]);return new Float32Array(a.buffer)[0]}getF32Rand(){for(let e=0;e<1e5;++e){const r=this.#n();if(r<1)return r}throw Error("exceeded loop limit")}#e(){const t=0n,e=1023n,r=(()=>{switch(this.#t.bits){case 32:{const l=BigInt(this.#t.getU32Rand()>>>0),u=BigInt(this.#t.getU32Rand()>>>0);return l<<32n|u}case 64:return BigInt.asUintN(64,this.#t.getU64Rand())}})(),s=r&0x7ffn;let i=e-1n;if(s===0n){i-=11n;const l=1e5;let u=0;t:for(;;){if(u>l)throw Error("loop exceeded limit");const h=(()=>{switch(this.#t.bits){case 32:{const d=BigInt(this.#t.getU32Rand()>>>0),v=BigInt(this.#t.getU32Rand()>>>0);return d<<32n|v}case 64:return BigInt.asUintN(64,this.#t.getU64Rand())}})();if(h===0n){if(i-=64n,i<t){i=t;break t}}else{i-=_(h);break t}++u}}else i-=_(s);const o=BigInt.asUintN(52,r>>11n);o===0n&&r>>63n&&++i;const a=BigUint64Array.from([i<<52n|o]);return new Float64Array(a.buffer)[0]}getF64Rand(){for(let e=0;e<1e5;++e){const r=this.#e();if(r<1)return r}throw Error("exceeded loop limit")}}Object.defineProperty(O.prototype,Symbol.toStringTag,{value:C});const mt=[0x853c49e6748fea9bn,0xda3e39cb94b95bdbn],yt=0x5851f42d4c957f2dn;class U{#t;static name="PCGMinimal";bits=32;constructor(t){t&&t.length>=2?(this.#t=new BigUint64Array(2),this.#t[1]=t[1]<<1n|1n,this.#n(),this.#t[0]+=t[0],this.#n()):this.#t=BigUint64Array.from(mt)}#n(){this.#t[0]=this.#t[0]*yt+this.#t[1]}get#e(){const t=this.#t[0],e=Number(t>>59n),r=Number(BigInt.asUintN(32,(t^t>>18n)>>27n));return M(r,e)}getU32Rand(){return this.#n(),this.#e}getBoundedU32Rand(t){if(t>4294967296)throw Error("`bound` exceeded limit (2^32)");if(t<=0)throw Error("'bound' must be positive");const r=4294967296%t,s=1e5;for(let i=0;i<s;++i){const o=this.getU32Rand();if(o>=r)return o%t}throw Error("exceeded loop limit")}*genU32Rands(t,e){if(t<=0)throw Error("'step' must be positive");for(let r=0;r<t;r++)yield typeof e=="number"?this.getBoundedU32Rand(e):this.getU32Rand()}}Object.defineProperty(U.prototype,Symbol.toStringTag,{value:U.name});const pt=[0xbe562cb412e2260en,0x2e4284137d641affn,0x4e19b36ee933e27en,0x7581cf8c4f4d4f7dn];class R{bits=64;#t;static name="XoshiroMinimal";constructor(t){t&&t.length>=4?(this.#t=new BigUint64Array(4),this.#t[0]=t[0],this.#t[1]=t[1],this.#n(),this.#t[2]+=t[2],this.#t[3]+=t[3]):this.#t=BigUint64Array.from(pt)}#n(){const t=this.#t[1]<<17n;this.#t[2]^=this.#t[0],this.#t[3]^=this.#t[1],this.#t[1]^=this.#t[2],this.#t[0]^=this.#t[3],this.#t[2]^=t,this.#t[3]=b(this.#t[3],45n)}get value(){const t=b(this.#t[0]+this.#t[3],23n)+this.#t[0];return BigInt.asUintN(64,t)}getU64Rand(){const t=this.value;return this.#n(),t}getU32Rand(){const t=BigInt.asUintN(32,this.getU64Rand());return Number(t)}getBoundedU64Rand(t){const e=1n<<64n;if(t>e)throw Error("'bound' exceeded limit");if(t<=0n)throw Error("'bound' must be positive");const r=e%t,s=1e5;for(let i=0;i<s;++i){const o=this.getU64Rand();if(o>=r)return o%t}throw Error("exceeded loop limit")}getBoundedU32Rand(t){if(t>4294967296)throw Error("'bound' exceeded limit");if(t<=0n)throw Error("'bound' must be positive");const r=this.getBoundedU64Rand(BigInt(t));return Number(r)}*genU64Rands(t,e){if(t<=0)throw Error("'step' must be positive");for(let r=0;r<t;++r)yield e===void 0?this.getU64Rand():this.getBoundedU64Rand(e)}*genU32Rands(t,e){if(t<=0)throw Error("'step' must be positive");for(let r=0;r<t;++r)yield e===void 0?this.getU32Rand():this.getBoundedU32Rand(e)}}Object.defineProperty(R.prototype,Symbol.toStringTag,{value:R.name});const F="WorkerStream";class V extends ReadableStream{close;#t;static name=F;constructor(t,e){let r,s,i;super({start:o=>{r=a=>{o.enqueue(a.data)},s=a=>{t.removeEventListener("message",r),t.removeEventListener("error",s);const l=new y("WorkerStreamError",a.message,{cause:a.error});o.error(l)},i=()=>{t.removeEventListener("message",r),t.removeEventListener("error",s),o.close()},t.addEventListener("message",r),t.addEventListener("error",s)},cancel:o=>{console.log("Canceled reason:",o),t.removeEventListener("message",r),t.removeEventListener("error",s)}},e),this.close=i,this.#t=t}postMessage(t,e){this.#t.postMessage(t,e)}}return Object.defineProperty(V.prototype,Symbol.toStringTag,{value:F}),c.FloatRng=O,c.NamedError=y,c.PCGMinimal=U,c.Rational=f,c.WorkerStream=V,c.XoshiroMinimal=R,c.bailliePSW=S,c.compress=Y,c.decodeLEB128=gt,c.decodeRFC3986URIComponent=J,c.decompress=Z,c.encodeLEB128=dt,c.encodeRFC3986URIComponent=H,c.exEuclidean=L,c.factorial=nt,c.fromBase64=P,c.fromBase64Url=lt,c.fromOct=ft,c.getHash=z,c.getRandBIByBitLength=I,c.getRandBIByRange=N,c.getRandPrimeByBitLength=ct,c.getRandPrimeByRange=ot,c.getRndInt=Q,c.getStringTag=K,c.isDeepStrictEqual=g,c.isNode=X,c.isSquare=T,c.jacobiSymbol=B,c.lazify=W,c.modPow=p,c.parseCSV=G,c.residue=m,c.rot32=M,c.rot64=b,c.sameValueZero=D,c.setTimeoutPromise=x,c.sleep=k,c.toBase64=A,c.toBase64Url=at,c.toOct=ut,c.withResolvers=q,Object.defineProperty(c,Symbol.toStringTag,{value:"Module"}),c})({});
+var UtilFns=(function(c){"use strict";const k=new TextEncoder,K=(n,t)=>[n].includes(t),g=(n,t)=>{if(typeof n!=typeof t)return!1;const e=Object.prototype.toString.call(n),r=Object.prototype.toString.call(t);if(e!==r)return!1;if(typeof n=="string"||typeof n=="bigint"||typeof n=="boolean"||typeof n=="symbol"||n==null)return n===t;if(typeof n=="number")return n!==n&&t!==t||n===t;if(typeof n=="function")return!1;if(Array.isArray(n)&&Array.isArray(t)){if(n.length!==t.length)return!1;for(let s=0;s<n.length;s++)if(!g(n[s],t[s]))return!1;return!0}if(n instanceof Set&&t instanceof Set){const s=[...n.values()],i=[...t.values()];return!!g(s,i)}if(n instanceof Map&&t instanceof Map){const s=[...n.keys()],i=[...t.keys()];if(!g(s,i))return!1;const o=[...n.values()],a=[...t.values()];return!!g(o,a)}if(e==="[object Object]"){const s=n,i=t,o=Object.keys(s),a=Object.keys(i);for(const l of o){const u=a.find(R=>R===l);if(u===void 0)return!1;const[h,d]=[s[l],i[u]];if(!g(h,d))return!1}return!0}throw Error(`comparing these objects is unavailable: ${n}, ${t}`,{cause:[n,t]})},W=()=>{let n,t;return{promise:new Promise((r,s)=>{n=r,t=s}),resolve:n,reject:t}},G=n=>new Promise(t=>{setTimeout(()=>t(),n)}),z=n=>{const t=Object.prototype.toString.call(n);return t.slice(8,t.length-1)},X=n=>(...t)=>()=>n(...t),H=n=>{const t=[];let e=[],r="",s=!1;for(let i=0;i<n.length;i++){const o=n[i];o==='"'&&(i===0||n[i-1]!=="\\")?s=!s:o===","&&!s?(e.push(r.trim()),r=""):o===`
+`&&!s?(e.push(r.trim()),t.push(e),e=[],r=""):r+=o}return e.push(r.trim()),t.push(e),t},J=async(n,t)=>{const e=k.encode(n),r=await crypto.subtle.digest(t,e);return new Uint8Array(r)},Y=()=>!!globalThis.process&&typeof process.version<"u"&&typeof process.versions.node<"u",Z=n=>encodeURIComponent(n).replace(/[!'()*]/g,e=>`%${e.charCodeAt(0).toString(16).toUpperCase()}`),x=n=>{if(n.includes("+"))throw Error("An input string has '+'");return decodeURIComponent(n)},Q=async(n,t)=>{const r=new Blob([n]).stream().pipeThrough(new CompressionStream(t));return new Response(r).bytes()},tt=async(n,t)=>{const r=new Blob([n]).stream().pipeThrough(new DecompressionStream(t));return new Response(r).bytes()},nt=(n,t)=>new Promise((e,r)=>{setTimeout(async()=>{try{const s=await n();e(s)}catch(s){r(s)}},t)}),N="NamedError";class p extends Error{constructor(t,e,r){super(e,r),this.errName=t}static name=N;toJSON(){const t=(()=>{const i=this.cause;return typeof i=="string"||typeof i=="number"||typeof i=="boolean"?i:typeof i=="bigint"?i.toString():typeof i=="object"&&i!==null?i instanceof Set||i instanceof Map?Object.fromEntries(i):i:void 0})(),{errName:e,message:r,stack:s}=this;return{errName:e,message:r,stack:s,cause:t}}}Object.defineProperty(p.prototype,Symbol.toStringTag,{value:N});const et=(n,t)=>Math.floor(Math.random()*(t-n)+n),m=(n,t)=>{t<0n&&(t*=-1n);const e=n%t;return e<0n?e+t:e},I=(n,t=!1)=>{if(!Number.isFinite(n))throw Error("`length` is not a valid number");if(n<=0)throw Error("`length` must be positive");const e=Math.ceil(n/8),r=crypto.getRandomValues(new Uint8Array(e));let s=Array.from(r,i=>i.toString(2).padStart(8,"0")).join("").slice(0,n);return t&&(s=s.replace(/^\d/,"1")),BigInt("0b"+s)},v=(n,t)=>{if(n>=t)throw new p("RangeError","min is larger than max");const e=t-n,r=e.toString(2).length,s=(()=>{for(let o=0;o<1e5;o++){const a=I(r);if(a>=y(2n,BigInt(r),e))return a%e}throw Error("Failed to generate a random bigint")})();return n+s},y=(n,t,e)=>{if(e<1n)throw Error("`mod` must be positive");if(t<0n)throw Error("`power` must not be negative");if(n=m(n,e),e===1n)return 0n;if(n%e===1n||n%e===0n)return n;if(n===e-1n)return t&1n?e-1n:1n;let r=1n;for(;t>0n;)t&1n&&(r=r*n%e),n=n*n%e,t>>=1n;return r},L=(n,t)=>{if(n===0n&&t===0n)return{x:0n,y:0n,gcd:0n};if(n===0n)return t>0n?{x:0n,y:-1n,gcd:t}:{x:0n,y:1n,gcd:-t};if(t===0n)return n>0n?{x:1n,y:0n,gcd:n}:{x:-1n,y:0n,gcd:-n};let[e,r,s]=[1n,0n,n],[i,o,a]=[0n,-1n,t];for(;;){const l=s/a,u=s-l*a;if(u===0n)break;[e,i]=[i,e-l*i],[r,o]=[o,r-l*o],[s,a]=[a,u]}return a<0n&&(i*=-1n,o*=-1n,a*=-1n),{x:i,y:o,gcd:a}},w=(n,t)=>{if(n>=t)return 1n;const e=BigInt((t-2n).toString(2).length),r=(t-n)/2n;if(e*r<63n){let a=n;for(let l=n+2n;l<t;l+=2n)a*=l;return a}const s=n+r|1n,i=w(n,s),o=w(s,t);return i*o},rt=n=>{let t=3n,e=1n,r=1n;const s=BigInt(n.toString(2).length)-1n;for(let i=s-1n;i>-1n;--i){const o=(n>>i)+1n|1n;r*=w(t,o),t=o,e*=r}return e},st=n=>{if(n<0n)throw Error("'n' must be non-negative");if(n===0n)return 1n;const t=n-BigInt(n.toString(2).match(/1/g)?.length??0);return rt(n)<<t},M=(n,t)=>(n>>>(t&31)|n<<(-t&31))>>>0,b=(n,t)=>BigInt.asUintN(64,n>>(t&63n)|n<<(-t&63n)),E=(n,t)=>{if(t<1n||t%2n===0n)throw Error("`n` is invalid");for(;n<0n;)n+=t;n%=t;let e=1n;for(;n!==0n;){for(;n%2n===0n;){n/=2n;const r=t%8n;(r===3n||r===5n)&&(e*=-1n)}[n,t]=[t,n],n%4n===3n&&t%4n===3n&&(e*=-1n),n%=t}return t===1n?e:0n},A=n=>{if(n<0n)return!1;if(n===0n)return!0;let t=1n,e=n;for(;t+1n<e;){const r=(t+e)/2n;r*r<n?t=r:e=r}return n===t**2n||n===(t+1n)**2n},it=n=>{if(n<=1n)return!1;if(n%2n===0n)return n===2n;let t=n-1n,e=0n;for(;t%2n===0n;)t>>=1n,e+=1n;const[r,s]=[t,e];let o=y(2n,r,n);if(o===1n)return!0;for(let a=0n;a<s;a++){if(o===n-1n)return!0;o=o*o%n}return!1},ot=n=>{let t=5n,e=E(t,n);for(;e>0n;){if(t=t>0n?t+2n:t-2n,t*=-1n,t===-15n&&A(n))return[0n,0n];e=E(t,n)}return[t,e]},B=(n,t)=>(n&1n)===1n?m(n+t>>1n,t):m(n>>1n,t),ct=(n,t,e,r)=>{let s=1n,i=e;const o=n.toString(2).slice(1);for(const a of o)[s,i]=[m(s*i,t),B(i*i+r*s*s,t)],a==="1"&&([s,i]=[B(e*s+i,t),B(r*s+e*i,t)]);return[s,i]},at=(n,t,e,r)=>{if(n%2n!==1n)throw Error("`n` must be odd");let s=n+1n,i=0n;for(;s%2n===0n;)s>>=1n,i+=1n;const[o,a]=ct(s,n,e,t);let l=a;if(o===0n)return!0;r=y(r,s,n);for(let u=0n;u<i;u++){if(l===0n)return!0;l=m(l*l-2n*r,n),r=y(r,2n,n)}return!1},S=n=>{if(n<=1n)return!1;if(n%2n===0n)return n===2n;const t=[2n,3n,5n,7n,11n,13n,17n,19n,23n,29n,31n,37n,41n,43n,47n,53n,59n,61n,67n,71n,73n,79n,83n,89n,97n,101n];for(const i of t)if(n%i===0n)return n===i;if(!it(n))return!1;const[e,r]=ot(n);if(r===0n)return!1;const s=(1n-e)/4n;return at(n,e,1n,s)},lt=(n,t)=>{if(t<2n)throw Error("NoPrimesFound");for(let r=0;r<1e5;r++){const s=v(n,t);if(S(s))return s}throw Error("NoPrimesFound")},ut=(n,t=!1)=>{if(n<2)throw Error("NoPrimesFound");for(let r=0;r<1e5;r++){const s=I(n,t);if(S(s))return s}throw Error("NoPrimesFound")},T="Rational";class f{#t;#n;static name=T;constructor(t,e){e===0n?(this.#n=0n,this.#t=t===0n?0n:t>0n?1n:-1n):e>0n?(this.#t=t,this.#n=e):(this.#t=-t,this.#n=-e),this.#e()}static fromDecimal(t,e=5){if(Number.isNaN(t))return new f(0n,0n);if(Math.abs(t)===1/0)return new f(t>0?1n:-1n,0n);const r=t<0;r&&(t*=-1);const s=BigInt(Math.floor(t)),i=t-Number(s);if(i===0)return new f(r?-s:s,1n);t=1/i;let[o,a]=[1n,s],[l,u]=[0n,1n];for(;`${u}`.length<e+1;){const h=BigInt(Math.floor(t)),d=t-Number(h);if([o,a]=[a,h*a+o],[l,u]=[u,h*u+l],d===0)return new f(r?-a:a,u);t=1/d}return new f(r?-o:o,l)}#e(){const{gcd:t}=L(this.#t,this.#n);t!==0n&&(this.#t/=t,this.#n/=t)}minus(){return new f(-this.#t,this.#n)}inverse(){return new f(this.#n,this.#t)}add(t){const e=this.#n*t.#n,r=this.#t*t.#n+t.#t*this.#n;return new f(r,e)}substr(t){return this.add(t.minus())}multiply(t){const e=this.#n*t.#n,r=this.#t*t.#t;return new f(r,e)}divide(t){return this.multiply(t.inverse())}mediant(t){const e=this.#n+t.#n,r=this.#t+t.#t;return new f(r,e)}toDecimal(){return Number(this.#t)/Number(this.#n)}toString(){return this.#t===0n&&this.#n===0n?"NaN":this.#t===0n?"0":this.#n===0n?this.#t<0n?"-Infinity":"Infinity":this.#n===1n?`${this.#t}`:`${this.#t}/${this.#n}`}valueOf(){return this.toDecimal()}toJSON(){return{type:"Rational",value:["0x"+this.#t.toString(16),"0x"+this.#n.toString(16)]}}static fromData(t){const e=BigInt(t.value[0]),r=BigInt(t.value[1]);return new f(e,r)}static parse(t){const r=/^\s*(\d+)\s*\/\s*(\d+)\s*$/.exec(t);if(!r)throw Error("cannot parse");const s=r.at(1),i=r.at(2);if(!s||!i)throw Error("cannot parse");return new f(BigInt(s),BigInt(i))}}Object.defineProperty(f.prototype,Symbol.toStringTag,{value:T});const P=n=>{const t=Array.from(n,e=>String.fromCharCode(e));return btoa(t.join(""))},C=n=>{const t=atob(n);return Uint8Array.from(t,e=>e.charCodeAt(0))},ft=n=>P(n).replaceAll("+","-").replaceAll("/","_").replace(/=+$/,""),ht=n=>{const t=n.length&3;t>0&&(n=n+"=".repeat(4-t));const e=n.replaceAll("-","+").replaceAll("_","/");return C(e)},dt=n=>{let t=Array.from(n,i=>i.toString(16).padStart(2,"0")).join("");const e=t.length%6;e&&(t="0".repeat(6-e)+t);const r=t.matchAll(/.{6}/g);return Array.from(r,i=>Number.parseInt(i[0],16).toString(8).padStart(8,"0")).join("").replace(/^0+/,"")},gt=n=>{const t=n.length&7;t&&(n="0".repeat(8-t)+n);const e=n.matchAll(/.{8}/g),s=Array.from(e,i=>{const o=i[0];return Number.parseInt(o,8).toString(16).padStart(6,"0")}).join("").matchAll(/.{2}/g);return Uint8Array.from(s,i=>Number.parseInt(i[0],16))},mt=n=>{const t=n<0n;t&&(n*=-1n);const e=n.toString(2).length,r=n===1n<<BigInt(e-1)&&!(e%7)&&t,s=Math.floor(e/7)+1;return r?s-1:s},yt=n=>{const t=mt(n);n=BigInt.asUintN(t*7,n);const e=new Uint8Array(t);for(let s=0;s<t-1;++s){const i=Number(n&127n)|128;e[s]=i,n>>=7n}const r=Number(n&127n);return e[t-1]=r,n>>=7n,e},pt=n=>{const t=n.length;let e=0n;for(let r=0;r<t;++r){const s=BigInt(n[r]&127);e+=s<<BigInt(7*r)}return BigInt.asIntN(7*t,e)},j=n=>{if(n===0)return 32;let t=0;for(;n>0&&!(n&1);)++t,n>>>=1;return t},_="FloatRng",O=n=>{if(n===0n)return 64n;let t=0n;for(;n>0n&&!(n&1n);)++t,n>>=1n;return BigInt.asUintN(64,t)};class F{#t;static name=_;constructor(t){this.#t=t}#n(){const r=(()=>{switch(this.#t.bits){case 32:return this.#t.getU32Rand()>>>0;case 64:{const l=this.#t.getU64Rand()&0xffffffffn;return Number(l)}}})(),s=r&255;let i=126;if(s===0){i-=8;const l=1e5;let u=0;t:for(;;){if(u>l)throw Error("loop exceeded limit");const h=(()=>{switch(this.#t.bits){case 32:return this.#t.getU32Rand()>>>0;case 64:{const d=BigInt.asUintN(32,this.#t.getU64Rand());return Number(d)}}})();if(h===0){if(i-=32,i<0){i=0;break t}}else{i-=j(h);break t}++u}}else i-=j(s);const o=r>>>8&8388607;o===0&&r>>>31&&++i;const a=Uint32Array.from([i<<23|o]);return new Float32Array(a.buffer)[0]}getF32Rand(){for(let e=0;e<1e5;++e){const r=this.#n();if(r<1)return r}throw Error("exceeded loop limit")}#e(){const t=0n,e=1023n,r=(()=>{switch(this.#t.bits){case 32:{const l=BigInt(this.#t.getU32Rand()>>>0),u=BigInt(this.#t.getU32Rand()>>>0);return l<<32n|u}case 64:return BigInt.asUintN(64,this.#t.getU64Rand())}})(),s=r&0x7ffn;let i=e-1n;if(s===0n){i-=11n;const l=1e5;let u=0;t:for(;;){if(u>l)throw Error("loop exceeded limit");const h=(()=>{switch(this.#t.bits){case 32:{const d=BigInt(this.#t.getU32Rand()>>>0),R=BigInt(this.#t.getU32Rand()>>>0);return d<<32n|R}case 64:return BigInt.asUintN(64,this.#t.getU64Rand())}})();if(h===0n){if(i-=64n,i<t){i=t;break t}}else{i-=O(h);break t}++u}}else i-=O(s);const o=BigInt.asUintN(52,r>>11n);o===0n&&r>>63n&&++i;const a=BigUint64Array.from([i<<52n|o]);return new Float64Array(a.buffer)[0]}getF64Rand(){for(let e=0;e<1e5;++e){const r=this.#e();if(r<1)return r}throw Error("exceeded loop limit")}}Object.defineProperty(F.prototype,Symbol.toStringTag,{value:_});const It=[0x853c49e6748fea9bn,0xda3e39cb94b95bdbn],wt=0x5851f42d4c957f2dn,V="PCGMinimal";class ${#t;static name=V;bits=32;constructor(t){t&&t.length>=2?(this.#t=new BigUint64Array(2),this.#t[1]=t[1]<<1n|1n,this.#n(),this.#t[0]+=t[0],this.#n()):this.#t=BigUint64Array.from(It)}#n(){this.#t[0]=this.#t[0]*wt+this.#t[1]}get#e(){const t=this.#t[0],e=Number(t>>59n),r=Number(BigInt.asUintN(32,(t^t>>18n)>>27n));return M(r,e)}getU32Rand(){return this.#n(),this.#e}getBoundedU32Rand(t){if(t>4294967296)throw Error("`bound` exceeded limit (2^32)");if(t<=0)throw Error("'bound' must be positive");const r=4294967296%t,s=1e5;for(let i=0;i<s;++i){const o=this.getU32Rand();if(o>=r)return o%t}throw Error("exceeded loop limit")}*genU32Rands(t,e){if(t<=0)throw Error("'step' must be positive");for(let r=0;r<t;r++)yield typeof e=="number"?this.getBoundedU32Rand(e):this.getU32Rand()}}Object.defineProperty($.prototype,Symbol.toStringTag,{value:V});const bt=[0xbe562cb412e2260en,0x2e4284137d641affn,0x4e19b36ee933e27en,0x7581cf8c4f4d4f7dn];class U{bits=64;#t;static name="XoshiroMinimal";constructor(t){t&&t.length>=4?(this.#t=new BigUint64Array(4),this.#t[0]=t[0],this.#t[1]=t[1],this.#n(),this.#t[2]+=t[2],this.#t[3]+=t[3]):this.#t=BigUint64Array.from(bt)}#n(){const t=this.#t[1]<<17n;this.#t[2]^=this.#t[0],this.#t[3]^=this.#t[1],this.#t[1]^=this.#t[2],this.#t[0]^=this.#t[3],this.#t[2]^=t,this.#t[3]=b(this.#t[3],45n)}get value(){const t=b(this.#t[0]+this.#t[3],23n)+this.#t[0];return BigInt.asUintN(64,t)}getU64Rand(){const t=this.value;return this.#n(),t}getU32Rand(){const t=BigInt.asUintN(32,this.getU64Rand());return Number(t)}getBoundedU64Rand(t){const e=1n<<64n;if(t>e)throw Error("'bound' exceeded limit");if(t<=0n)throw Error("'bound' must be positive");const r=e%t,s=1e5;for(let i=0;i<s;++i){const o=this.getU64Rand();if(o>=r)return o%t}throw Error("exceeded loop limit")}getBoundedU32Rand(t){if(t>4294967296)throw Error("'bound' exceeded limit");if(t<=0n)throw Error("'bound' must be positive");const r=this.getBoundedU64Rand(BigInt(t));return Number(r)}*genU64Rands(t,e){if(t<=0)throw Error("'step' must be positive");for(let r=0;r<t;++r)yield e===void 0?this.getU64Rand():this.getBoundedU64Rand(e)}*genU32Rands(t,e){if(t<=0)throw Error("'step' must be positive");for(let r=0;r<t;++r)yield e===void 0?this.getU32Rand():this.getBoundedU32Rand(e)}}Object.defineProperty(U.prototype,Symbol.toStringTag,{value:U.name});const D="WorkerStream";class q extends ReadableStream{close;#t;static name=D;constructor(t,e){let r,s,i;super({start:o=>{r=a=>{o.enqueue(a.data)},s=a=>{t.removeEventListener("message",r),t.removeEventListener("error",s);const l=new p("WorkerStreamError",a.message,{cause:a.error});o.error(l)},i=()=>{t.removeEventListener("message",r),t.removeEventListener("error",s),o.close()},t.addEventListener("message",r),t.addEventListener("error",s)},cancel:o=>{console.log("Canceled reason:",o),t.removeEventListener("message",r),t.removeEventListener("error",s)}},e),this.close=i,this.#t=t}postMessage(t,e){this.#t.postMessage(t,e)}}return Object.defineProperty(q.prototype,Symbol.toStringTag,{value:D}),c.FloatRng=F,c.NamedError=p,c.PCGMinimal=$,c.Rational=f,c.WorkerStream=q,c.XoshiroMinimal=U,c.bailliePSW=S,c.compress=Q,c.decodeLEB128=pt,c.decodeRFC3986URIComponent=x,c.decompress=tt,c.encodeLEB128=yt,c.encodeRFC3986URIComponent=Z,c.exEuclidean=L,c.factorial=st,c.fromBase64=C,c.fromBase64Url=ht,c.fromOct=gt,c.getHash=J,c.getRandBIByBitLength=I,c.getRandBIByRange=v,c.getRandPrimeByBitLength=ut,c.getRandPrimeByRange=lt,c.getRndInt=et,c.getStringTag=z,c.isDeepStrictEqual=g,c.isNode=Y,c.isSquare=A,c.jacobiSymbol=E,c.lazify=X,c.modPow=y,c.parseCSV=H,c.residue=m,c.rot32=M,c.rot64=b,c.sameValueZero=K,c.setTimeoutPromise=nt,c.sleep=G,c.toBase64=P,c.toBase64Url=ft,c.toOct=dt,c.withResolvers=W,Object.defineProperty(c,Symbol.toStringTag,{value:"Module"}),c})({});

package/dist/main.d.ts

@@ -6,5 +6,5 @@ export * from './u8arr_ext';
 export * from './named_error';
 export * from './random';
 export * from './pcg_minimal';
-export * from './xoshiro-minimal';
+export * from './xoshiro_minimal';
 export * from './worker_stream';

package/dist/math.d.ts

@@ -6,7 +6,7 @@
  */
 export declare const getRndInt: (min: number, max: number) => number;
 /**
- * residue, but returns a positive residue even `n` is negative
+ * residue, but always a positive residue even `n` is negative
  * @param n
  * @param modulo
  * @returns

package/dist/util.d.ts

@@ -30,7 +30,7 @@ export declare const sleep: (delay: number) => Promise<void>;
  * @param obj
  * @returns
  */
-export declare const getStringTag: (obj: unknown) => string | undefined;
+export declare const getStringTag: (obj: unknown) => string;
 /**
  * makes a function lazy
  * @param func function
@@ -72,9 +72,9 @@ export declare const decodeRFC3986URIComponent: (encodedURIComponent: string) =>
 export declare const compress: (raw: Uint8Array<ArrayBuffer>, format: CompressionFormat) => Promise<Uint8Array<ArrayBuffer>>;
 export declare const decompress: (compressed: Uint8Array<ArrayBuffer>, format: CompressionFormat) => Promise<Uint8Array<ArrayBuffer>>;
 /**
- *
- * @param handler
- * @param timeout timeout
+ * Schedules execution of a one-time `callback` after `delay` milliseconds, and returns promise resolved by a return value of `callback`.
+ * @param callback
+ * @param delay **Default:** `1`
  * @returns
  */
-export declare const setTimeoutPromise: <T>(handler: () => T, timeout?: number) => Promise<T>;
+export declare const setTimeoutPromise: <TRtrn>(callback: () => TRtrn, delay?: number) => Promise<TRtrn>;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@tktb-tess/util-fns",
-  "version": "0.11.0",
+  "version": "0.11.1",
   "description": "Utility functions for personal use",
   "files": [
     "dist"
@@ -26,12 +26,12 @@
   },
   "homepage": "https://github.com/tktb-tess/util-fns/blob/main/README.md",
   "devDependencies": {
-    "@types/node": "^24.10.2",
+    "@types/node": "^25.0.3",
     "tsx": "^4.21.0",
     "typescript": "^5.9.3",
-    "vite": "^7.2.7",
+    "vite": "^7.3.0",
     "vite-plugin-dts": "^4.5.4",
-    "vitest": "^4.0.15"
+    "vitest": "^4.0.16"
   },
   "volta": {
     "node": "22.21.0"