@tktb-tess/util-fns 0.11.2 → 0.11.3

package/README.md

@@ -1 +1,3 @@
 # util-fns
+
+Utility functions for personal use

package/dist/bundle.js

@@ -1,4 +1,4 @@
-const x = new TextEncoder(), z = (n, t) => [n].includes(t), d = (n, t) => {
+const T = new TextEncoder(), H = (n, t) => [n].includes(t), h = (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;
@@ -11,33 +11,33 @@ const x = new TextEncoder(), z = (n, t) => [n].includes(t), d = (n, t) => {
   if (Array.isArray(n) && Array.isArray(t)) {
     if (n.length !== t.length) return !1;
     for (let s = 0; s < n.length; s++)
-      if (!d(n[s], t[s])) return !1;
+      if (!h(n[s], t[s])) return !1;
     return !0;
   }
   if (n instanceof Set && t instanceof Set) {
     const s = [...n.values()], o = [...t.values()];
-    return !!d(s, o);
+    return !!h(s, o);
   }
   if (n instanceof Map && t instanceof Map) {
     const s = [...n.keys()], o = [...t.keys()];
-    if (!d(s, o)) return !1;
+    if (!h(s, o)) return !1;
     const i = [...n.values()], c = [...t.values()];
-    return !!d(i, c);
+    return !!h(i, c);
   }
   if (e === "[object Object]") {
     const s = n, o = t, i = Object.keys(s), c = Object.keys(o);
     for (const l of i) {
-      const u = c.find((M) => M === l);
+      const u = c.find((x) => x === l);
       if (u === void 0) return !1;
-      const [f, h] = [s[l], o[u]];
-      if (!d(f, h)) return !1;
+      const [f, g] = [s[l], o[u]];
+      if (!h(f, g)) return !1;
     }
     return !0;
   }
   throw Error(`comparing these objects is unavailable: ${n}, ${t}`, {
     cause: [n, t]
   });
-}, H = () => {
+}, J = () => {
   let n, t;
   return {
     promise: new Promise((r, s) => {
@@ -46,12 +46,12 @@ const x = new TextEncoder(), z = (n, t) => [n].includes(t), d = (n, t) => {
     resolve: n,
     reject: t
   };
-}, J = (n) => new Promise((t) => {
+}, Y = (n) => new Promise((t) => {
   setTimeout(() => t(), n);
-}), Y = (n) => {
+}), Z = (n) => {
   const t = Object.prototype.toString.call(n);
   return t.slice(8, t.length - 1);
-}, Z = (n) => (...t) => () => n(...t), Q = (n) => {
+}, Q = (n) => (...t) => () => n(...t), tt = (n) => {
   const t = [];
   let e = [], r = "", s = !1;
   for (let o = 0; o < n.length; o++) {
@@ -60,23 +60,23 @@ const x = new TextEncoder(), z = (n, t) => [n].includes(t), d = (n, t) => {
 ` && !s ? (e.push(r.trim()), t.push(e), e = [], r = "") : r += i;
   }
   return e.push(r.trim()), t.push(e), t;
-}, tt = async (n, t) => {
-  const e = x.encode(n), r = await crypto.subtle.digest(t, e);
+}, nt = async (n, t) => {
+  const e = T.encode(n), r = await crypto.subtle.digest(t, e);
   return new Uint8Array(r);
-}, nt = (n) => encodeURIComponent(n).replace(
+}, et = (n) => encodeURIComponent(n).replace(
   /[!'()*]/g,
   (e) => `%${e.charCodeAt(0).toString(16).toUpperCase()}`
-), et = (n) => {
+), rt = (n) => {
   if (n.includes("+"))
     throw Error("An input string has '+'");
   return decodeURIComponent(n);
-}, rt = async (n, t) => {
+}, st = async (n, t) => {
   const r = new Blob([n]).stream().pipeThrough(new CompressionStream(t));
   return new Response(r).bytes();
-}, st = async (n, t) => {
+}, ot = async (n, t) => {
   const r = new Blob([n]).stream().pipeThrough(new DecompressionStream(t));
   return new Response(r).bytes();
-}, ot = (n, t) => new Promise((e, r) => {
+}, it = (n, t) => new Promise((e, r) => {
   setTimeout(async () => {
     try {
       const s = await n();
@@ -85,16 +85,17 @@ const x = new TextEncoder(), z = (n, t) => [n].includes(t), d = (n, t) => {
       r(s);
     }
   }, t);
-}), B = "NamedError";
+}), N = "NamedError";
 class I extends Error {
   constructor(t, e, r) {
     super(e, r), this.errName = t;
   }
-  static name = B;
+  static name = N;
   toJSON() {
     const t = (() => {
       const o = this.cause;
-      return typeof o == "string" || typeof o == "number" || typeof o == "boolean" ? o : typeof o == "bigint" ? o.toString() : typeof o == "object" && o !== null ? o instanceof Set || o instanceof Map ? Object.fromEntries(o) : o : void 0;
+      if (o != null)
+        return typeof o == "string" || typeof o == "number" || typeof o == "boolean" ? o : typeof o == "bigint" ? o.toString() : typeof o == "object" ? o instanceof Set || o instanceof Map ? Object.fromEntries(o) : o : void 0;
     })(), { errName: e, message: r, stack: s } = this;
     return {
       errName: e,
@@ -105,24 +106,24 @@ class I extends Error {
   }
 }
 Object.defineProperty(I.prototype, Symbol.toStringTag, {
-  value: B
+  value: N
 });
-const it = (n, t) => Math.floor(Math.random() * (t - n) + n), g = (n, t) => {
+const ct = (n, t) => Math.floor(Math.random() * (t - n) + n), d = (n, t) => {
   t < 0n && (t *= -1n);
   const e = n % t;
   return e < 0n ? e + t : e;
-}, N = (n, t = !1) => {
+}, U = (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, (o) => o.toString(2).padStart(8, "0")).join("").slice(0, n);
   return t && (s = s.replace(/^\d/, "1")), BigInt("0b" + s);
-}, T = (n, t) => {
+}, R = (n, t) => {
   if (n >= t)
     throw new I("RangeError", "min is larger than max");
   const e = t - n, r = e.toString(2).length, s = (() => {
     for (let i = 0; i < 1e5; i++) {
-      const c = N(r);
+      const c = U(r);
       if (c >= m(2n, BigInt(r), e))
         return c % e;
     }
@@ -132,14 +133,14 @@ const it = (n, t) => Math.floor(Math.random() * (t - n) + n), g = (n, t) => {
 }, m = (n, t, e) => {
   if (e < 1n) throw Error("`mod` must be positive");
   if (t < 0n) throw Error("`power` must not be negative");
-  if (n = g(n, e), e === 1n) return 0n;
+  if (n = d(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;
-}, R = (n, t) => {
+}, P = (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 };
@@ -163,7 +164,7 @@ const it = (n, t) => Math.floor(Math.random() * (t - n) + n), g = (n, t) => {
   }
   const s = n + r | 1n, o = y(n, s), i = y(s, t);
   return o * i;
-}, P = (n) => {
+}, j = (n) => {
   let t = 3n, e = 1n, r = 1n;
   const s = BigInt(n.toString(2).length) - 1n;
   for (let o = s - 1n; o > -1n; --o) {
@@ -171,12 +172,12 @@ const it = (n, t) => Math.floor(Math.random() * (t - n) + n), g = (n, t) => {
     r *= y(t, i), t = i, e *= r;
   }
   return e;
-}, ct = (n) => {
+}, lt = (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 P(n) << t;
-}, j = (n, t) => (n >>> (t & 31) | n << (-t & 31)) >>> 0, w = (n, t) => BigInt.asUintN(64, n >> (t & 63n) | n << (-t & 63n)), E = (n, t) => {
+  return j(n) << t;
+}, _ = (n, t) => (n >>> (t & 31) | n << (-t & 31)) >>> 0, w = (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; )
@@ -192,7 +193,7 @@ const it = (n, t) => Math.floor(Math.random() * (t - n) + n), g = (n, t) => {
     [n, t] = [t, n], n % 4n === 3n && t % 4n === 3n && (e *= -1n), n %= t;
   }
   return t === 1n ? e : 0n;
-}, _ = (n) => {
+}, C = (n) => {
   if (n < 0n) return !1;
   if (n === 0n) return !0;
   let t = 1n, e = n;
@@ -201,7 +202,7 @@ const it = (n, t) => Math.floor(Math.random() * (t - n) + n), g = (n, t) => {
     r * r < n ? t = r : e = r;
   }
   return n === t ** 2n || n === (t + 1n) ** 2n;
-}, C = (n) => {
+}, O = (n) => {
   if (n <= 1n) return !1;
   if (n % 2n === 0n) return n === 2n;
   let t = n - 1n, e = 0n;
@@ -215,36 +216,36 @@ const it = (n, t) => Math.floor(Math.random() * (t - n) + n), g = (n, t) => {
     i = i * i % n;
   }
   return !1;
-}, O = (n) => {
+}, V = (n) => {
   let t = 5n, e = E(t, n);
   for (; e > 0n; ) {
-    if (t = t > 0n ? t + 2n : t - 2n, t *= -1n, t === -15n && _(n))
+    if (t = t > 0n ? t + 2n : t - 2n, t *= -1n, t === -15n && C(n))
       return [0n, 0n];
     e = E(t, n);
   }
   return [t, e];
-}, p = (n, t) => (n & 1n) === 1n ? g(n + t >> 1n, t) : g(n >> 1n, t), V = (n, t, e, r) => {
+}, p = (n, t) => (n & 1n) === 1n ? d(n + t >> 1n, t) : d(n >> 1n, t), F = (n, t, e, r) => {
   let s = 1n, o = e;
   const i = n.toString(2).slice(1);
   for (const c of i)
-    [s, o] = [g(s * o, t), p(o * o + r * s * s, t)], c === "1" && ([s, o] = [p(e * s + o, t), p(r * s + e * o, t)]);
+    [s, o] = [d(s * o, t), p(o * o + r * s * s, t)], c === "1" && ([s, o] = [p(e * s + o, t), p(r * s + e * o, t)]);
   return [s, o];
-}, F = (n, t, e, r) => {
+}, $ = (n, t, e, r) => {
   if (n % 2n !== 1n)
     throw Error("`n` must be odd");
   let s = n + 1n, o = 0n;
   for (; s % 2n === 0n; )
     s >>= 1n, o += 1n;
-  const [i, c] = V(s, n, e, t);
+  const [i, c] = F(s, n, e, t);
   let l = c;
   if (i === 0n) return !0;
   r = m(r, s, n);
   for (let u = 0n; u < o; u++) {
     if (l === 0n) return !0;
-    l = g(l * l - 2n * r, n), r = m(r, 2n, n);
+    l = d(l * l - 2n * r, n), r = m(r, 2n, n);
   }
   return !1;
-}, U = (n) => {
+}, v = (n) => {
   if (n <= 1n) return !1;
   if (n % 2n === 0n) return n === 2n;
   const t = [
@@ -278,33 +279,33 @@ const it = (n, t) => Math.floor(Math.random() * (t - n) + n), g = (n, t) => {
   for (const o of t)
     if (n % o === 0n)
       return n === o;
-  if (!C(n))
+  if (!O(n))
     return !1;
-  const [e, r] = O(n);
+  const [e, r] = V(n);
   if (r === 0n) return !1;
   const s = (1n - e) / 4n;
-  return F(n, e, 1n, s);
-}, lt = (n, t) => {
+  return $(n, e, 1n, s);
+}, ut = (n, t) => {
   if (t < 2n)
     throw Error("NoPrimesFound");
   for (let r = 0; r < 1e5; r++) {
-    const s = T(n, t);
-    if (U(s)) return s;
+    const s = R(n, t);
+    if (v(s)) return s;
   }
   throw Error("NoPrimesFound");
-}, ut = (n, t = !1) => {
+}, at = (n, t = !1) => {
   if (n < 2)
     throw Error("NoPrimesFound");
   for (let r = 0; r < 1e5; r++) {
-    const s = N(n, t);
-    if (U(s)) return s;
+    const s = U(n, t);
+    if (v(s)) return s;
   }
   throw Error("NoPrimesFound");
-}, v = "Rational";
+}, L = "Rational";
 class a {
   #t;
   #n;
-  static name = v;
+  static name = L;
   /**
    * fraction (rational) class
    * @param numerator
@@ -331,10 +332,10 @@ class a {
     t = 1 / o;
     let [i, c] = [1n, s], [l, u] = [0n, 1n];
     for (; `${u}`.length < e + 1; ) {
-      const f = BigInt(Math.floor(t)), h = t - Number(f);
-      if ([i, c] = [c, f * c + i], [l, u] = [u, f * u + l], h === 0)
+      const f = BigInt(Math.floor(t)), g = t - Number(f);
+      if ([i, c] = [c, f * c + i], [l, u] = [u, f * u + l], g === 0)
         return new a(r ? -c : c, u);
-      t = 1 / h;
+      t = 1 / g;
     }
     return new a(r ? -i : i, l);
   }
@@ -342,7 +343,7 @@ class a {
    * reduction
    */
   #e() {
-    const { gcd: t } = R(this.#t, this.#n);
+    const { gcd: t } = P(this.#t, this.#n);
     t !== 0n && (this.#t /= t, this.#n /= t);
   }
   /**
@@ -451,20 +452,20 @@ class a {
   }
 }
 Object.defineProperty(a.prototype, Symbol.toStringTag, {
-  value: v
+  value: L
 });
-const $ = (n) => {
+const D = (n) => {
   const t = Array.from(n, (e) => String.fromCharCode(e));
   return btoa(t.join(""));
-}, D = (n) => {
+}, q = (n) => {
   const t = atob(n);
   return Uint8Array.from(t, (e) => e.charCodeAt(0));
-}, at = (n) => $(n).replaceAll("+", "-").replaceAll("/", "_").replace(/=+$/, ""), ft = (n) => {
+}, ft = (n) => D(n).replaceAll("+", "-").replaceAll("/", "_").replace(/=+$/, ""), ht = (n) => {
   const t = n.length & 3;
   t > 0 && (n = n + "=".repeat(4 - t));
   const e = n.replaceAll("-", "+").replaceAll("_", "/");
-  return D(e);
-}, ht = (n) => {
+  return q(e);
+}, dt = (n) => {
   let t = Array.from(n, (o) => o.toString(16).padStart(2, "0")).join("");
   const e = t.length % 6;
   e && (t = "0".repeat(6 - e) + t);
@@ -473,7 +474,7 @@ const $ = (n) => {
     r,
     (o) => Number.parseInt(o[0], 16).toString(8).padStart(8, "0")
   ).join("").replace(/^0+/, "");
-}, dt = (n) => {
+}, gt = (n) => {
   const t = n.length & 7;
   t && (n = "0".repeat(8 - t) + n);
   const e = n.matchAll(/.{8}/g), s = Array.from(e, (o) => {
@@ -481,13 +482,13 @@ const $ = (n) => {
     return Number.parseInt(i, 8).toString(16).padStart(6, "0");
   }).join("").matchAll(/.{2}/g);
   return Uint8Array.from(s, (o) => Number.parseInt(o[0], 16));
-}, q = (n) => {
+}, K = (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;
-}, gt = (n) => {
-  const t = q(n);
+}, mt = (n) => {
+  const t = K(n);
   n = BigInt.asUintN(t * 7, n);
   const e = new Uint8Array(t);
   for (let s = 0; s < t - 1; ++s) {
@@ -496,7 +497,7 @@ const $ = (n) => {
   }
   const r = Number(n & 127n);
   return e[t - 1] = r, n >>= 7n, e;
-}, mt = (n) => {
+}, pt = (n) => {
   const t = n.length;
   let e = 0n;
   for (let r = 0; r < t; ++r) {
@@ -510,41 +511,41 @@ const $ = (n) => {
   for (; n > 0n && !(n & 1n); )
     ++t, n >>= 1n;
   return BigInt.asUintN(64, t);
-}, pt = (n) => {
-  const t = 0n, e = 1023n, r = () => BigInt.asUintN(64, n()), s = (i) => {
-    const c = i & 0x7ffn;
-    let l = e - 1n;
-    if (c > 0n)
-      return l -= b(c), l;
-    l -= 11n;
-    const u = 1e5;
-    for (let f = 0; f < u; ++f) {
-      const h = r();
-      if (h > 0n)
-        return l -= b(h), l;
-      if (l -= 64n, l < t)
-        return t;
-    }
-    throw Error("loop exceeded limit");
-  }, o = () => {
-    const i = r(), c = BigInt.asUintN(52, i >> 11n), u = c === 0n && i >> 63n === 1n ? s(i) + 1n : s(i), { buffer: f } = BigUint64Array.from([u << 52n | c]);
-    return new Float64Array(f)[0];
+}, S = (n, t) => {
+  const e = 0n, r = 1023n, s = n & 0x7ffn;
+  let o = r - 1n;
+  if (s > 0n)
+    return o -= b(s), o;
+  o -= 11n;
+  const i = 1e5;
+  for (let c = 0; c < i; ++c) {
+    const l = t();
+    if (l > 0n)
+      return o -= b(l), o;
+    if (o -= 64n, o < e)
+      return e;
+  }
+  throw Error("loop exceeded limit");
+}, yt = (n) => {
+  const t = () => BigInt.asUintN(64, n()), e = () => {
+    const r = t(), s = BigInt.asUintN(52, r >> 11n), i = s === 0n && r >> 63n === 1n ? S(r, t) + 1n : S(r, t), { buffer: c } = BigUint64Array.from([i << 52n | s]);
+    return new Float64Array(c)[0];
   };
   return () => {
-    for (let c = 0; c < 1e5; ++c) {
-      const l = o();
-      if (l < 1)
-        return l;
+    for (let s = 0; s < 1e5; ++s) {
+      const o = e();
+      if (o < 1)
+        return o;
     }
     throw Error("Loop limit exceeded");
   };
-}, K = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn], G = 0x5851f42d4c957f2dn, L = "PCGMinimal";
-class W {
+}, G = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn], W = 0x5851f42d4c957f2dn, A = "PCGMinimal";
+class X {
   /**
    * length = 2, `[state, increment]`
    */
   #t;
-  static name = L;
+  static name = A;
   /**
    * @param seeds
    * `BigUint64Array` with length 2. \
@@ -559,16 +560,16 @@ class W {
    * const betterRng = new PCGMinimal(seed);
    */
   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(K);
+    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(G);
   }
   /** step inner state */
   #n() {
-    this.#t[0] = this.#t[0] * G + this.#t[1];
+    this.#t[0] = this.#t[0] * W + this.#t[1];
   }
   /** 32bit 乱数を返す (内部状態は変わらない) */
   get #e() {
     const t = this.#t[0], e = Number(t >> 59n), r = Number(BigInt.asUintN(32, (t ^ t >> 18n) >> 27n));
-    return j(r, e);
+    return _(r, e);
   }
   /**
    *
@@ -607,16 +608,16 @@ class W {
       yield typeof e == "number" ? this.getBoundedRandU32(e) : this.getRandU32();
   }
 }
-Object.defineProperty(W.prototype, Symbol.toStringTag, {
-  value: L
+Object.defineProperty(X.prototype, Symbol.toStringTag, {
+  value: A
 });
-const X = [
+const k = [
   0xbe562cb412e2260en,
   0x2e4284137d641affn,
   0x4e19b36ee933e27en,
   0x7581cf8c4f4d4f7dn
 ];
-class S {
+class B {
   bits = 64;
   #t;
   static name = "XoshiroMinimal";
@@ -634,7 +635,7 @@ class S {
    * 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.#n(), this.#t[2] += t[2], this.#t[3] += t[3]) : this.#t = BigUint64Array.from(X);
+    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(k);
   }
   #n() {
     const t = this.#t[1] << 17n;
@@ -687,14 +688,14 @@ class S {
       yield e === void 0 ? this.getRandU32() : this.getBoundedRandU32(e);
   }
 }
-Object.defineProperty(S.prototype, Symbol.toStringTag, {
-  value: S.name
+Object.defineProperty(B.prototype, Symbol.toStringTag, {
+  value: B.name
 });
-const A = "WorkerStream";
-class k extends ReadableStream {
+const M = "WorkerStream";
+class z extends ReadableStream {
   close;
   #t;
-  static name = A;
+  static name = M;
   constructor(t, e) {
     let r, s, o;
     super(
@@ -723,49 +724,49 @@ class k extends ReadableStream {
     this.#t.postMessage(t, e);
   }
 }
-Object.defineProperty(k.prototype, Symbol.toStringTag, {
-  value: A
+Object.defineProperty(z.prototype, Symbol.toStringTag, {
+  value: M
 });
 export {
   I as NamedError,
-  W as PCGMinimal,
+  X as PCGMinimal,
   a as Rational,
-  k as WorkerStream,
-  S as XoshiroMinimal,
-  U as bailliePSW,
-  rt as compress,
-  mt as decodeLEB128,
-  et as decodeRFC3986URIComponent,
-  st as decompress,
-  gt as encodeLEB128,
-  nt as encodeRFC3986URIComponent,
-  R as exEuclidean,
-  ct as factorial,
-  pt as floatRng,
-  D as fromBase64,
-  ft as fromBase64Url,
-  dt as fromOct,
-  tt as getHash,
-  N as getRandBIByBitLength,
-  T as getRandBIByRange,
-  ut as getRandPrimeByBitLength,
-  lt as getRandPrimeByRange,
-  it as getRndInt,
-  Y as getStringTag,
-  d as isDeepStrictEqual,
-  _ as isSquare,
+  z as WorkerStream,
+  B as XoshiroMinimal,
+  v as bailliePSW,
+  st as compress,
+  pt as decodeLEB128,
+  rt as decodeRFC3986URIComponent,
+  ot as decompress,
+  mt as encodeLEB128,
+  et as encodeRFC3986URIComponent,
+  P as exEuclidean,
+  lt as factorial,
+  yt as floatRng,
+  q as fromBase64,
+  ht as fromBase64Url,
+  gt as fromOct,
+  nt as getHash,
+  U as getRandBIByBitLength,
+  R as getRandBIByRange,
+  at as getRandPrimeByBitLength,
+  ut as getRandPrimeByRange,
+  ct as getRndInt,
+  Z as getStringTag,
+  h as isDeepStrictEqual,
+  C as isSquare,
   E as jacobiSymbol,
-  Z as lazify,
+  Q as lazify,
   m as modPow,
-  Q as parseCSV,
-  g as residue,
-  j as rot32,
+  tt as parseCSV,
+  d as residue,
+  _ as rot32,
   w as rot64,
-  z as sameValueZero,
-  ot as setTimeoutPromise,
-  J as sleep,
-  $ as toBase64,
-  at as toBase64Url,
-  ht as toOct,
-  H as withResolvers
+  H as sameValueZero,
+  it as setTimeoutPromise,
+  Y as sleep,
+  D as toBase64,
+  ft as toBase64Url,
+  dt as toOct,
+  J as withResolvers
 };

package/dist/bundle.min.js

@@ -1,2 +1,2 @@
-var UtilFns=(function(a){"use strict";const V=new TextEncoder,$=(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()],o=[...t.values()];return!!g(s,o)}if(n instanceof Map&&t instanceof Map){const s=[...n.keys()],o=[...t.keys()];if(!g(s,o))return!1;const i=[...n.values()],c=[...t.values()];return!!g(i,c)}if(e==="[object Object]"){const s=n,o=t,i=Object.keys(s),c=Object.keys(o);for(const l of i){const u=c.find(pt=>pt===l);if(u===void 0)return!1;const[h,d]=[s[l],o[u]];if(!g(h,d))return!1}return!0}throw Error(`comparing these objects is unavailable: ${n}, ${t}`,{cause:[n,t]})},D=()=>{let n,t;return{promise:new Promise((r,s)=>{n=r,t=s}),resolve:n,reject:t}},q=n=>new Promise(t=>{setTimeout(()=>t(),n)}),K=n=>{const t=Object.prototype.toString.call(n);return t.slice(8,t.length-1)},W=n=>(...t)=>()=>n(...t),G=n=>{const t=[];let e=[],r="",s=!1;for(let o=0;o<n.length;o++){const i=n[o];i==='"'&&(o===0||n[o-1]!=="\\")?s=!s:i===","&&!s?(e.push(r.trim()),r=""):i===`
-`&&!s?(e.push(r.trim()),t.push(e),e=[],r=""):r+=i}return e.push(r.trim()),t.push(e),t},X=async(n,t)=>{const e=V.encode(n),r=await crypto.subtle.digest(t,e);return new Uint8Array(r)},k=n=>encodeURIComponent(n).replace(/[!'()*]/g,e=>`%${e.charCodeAt(0).toString(16).toUpperCase()}`),z=n=>{if(n.includes("+"))throw Error("An input string has '+'");return decodeURIComponent(n)},H=async(n,t)=>{const r=new Blob([n]).stream().pipeThrough(new CompressionStream(t));return new Response(r).bytes()},J=async(n,t)=>{const r=new Blob([n]).stream().pipeThrough(new DecompressionStream(t));return new Response(r).bytes()},Y=(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 o=this.cause;return typeof o=="string"||typeof o=="number"||typeof o=="boolean"?o:typeof o=="bigint"?o.toString():typeof o=="object"&&o!==null?o instanceof Set||o instanceof Map?Object.fromEntries(o):o: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 Z=(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,o=>o.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 i=0;i<1e5;i++){const c=I(r);if(c>=y(2n,BigInt(r),e))return c%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},R=(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],[o,i,c]=[0n,-1n,t];for(;;){const l=s/c,u=s-l*c;if(u===0n)break;[e,o]=[o,e-l*o],[r,i]=[i,r-l*i],[s,c]=[c,u]}return c<0n&&(o*=-1n,i*=-1n,c*=-1n),{x:o,y:i,gcd:c}},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 c=n;for(let l=n+2n;l<t;l+=2n)c*=l;return c}const s=n+r|1n,o=w(n,s),i=w(s,t);return o*i},Q=n=>{let t=3n,e=1n,r=1n;const s=BigInt(n.toString(2).length)-1n;for(let o=s-1n;o>-1n;--o){const i=(n>>o)+1n|1n;r*=w(t,i),t=i,e*=r}return e},x=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 Q(n)<<t},L=(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},M=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},tt=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 i=y(2n,r,n);if(i===1n)return!0;for(let c=0n;c<s;c++){if(i===n-1n)return!0;i=i*i%n}return!1},nt=n=>{let t=5n,e=E(t,n);for(;e>0n;){if(t=t>0n?t+2n:t-2n,t*=-1n,t===-15n&&M(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),et=(n,t,e,r)=>{let s=1n,o=e;const i=n.toString(2).slice(1);for(const c of i)[s,o]=[m(s*o,t),b(o*o+r*s*s,t)],c==="1"&&([s,o]=[b(e*s+o,t),b(r*s+e*o,t)]);return[s,o]},rt=(n,t,e,r)=>{if(n%2n!==1n)throw Error("`n` must be odd");let s=n+1n,o=0n;for(;s%2n===0n;)s>>=1n,o+=1n;const[i,c]=et(s,n,e,t);let l=c;if(i===0n)return!0;r=y(r,s,n);for(let u=0n;u<o;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 o of t)if(n%o===0n)return n===o;if(!tt(n))return!1;const[e,r]=nt(n);if(r===0n)return!1;const s=(1n-e)/4n;return rt(n,e,1n,s)},st=(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")},ot=(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")},A="Rational";class f{#t;#n;static name=A;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)),o=t-Number(s);if(o===0)return new f(r?-s:s,1n);t=1/o;let[i,c]=[1n,s],[l,u]=[0n,1n];for(;`${u}`.length<e+1;){const h=BigInt(Math.floor(t)),d=t-Number(h);if([i,c]=[c,h*c+i],[l,u]=[u,h*u+l],d===0)return new f(r?-c:c,u);t=1/d}return new f(r?-i:i,l)}#e(){const{gcd:t}=R(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),o=r.at(2);if(!s||!o)throw Error("cannot parse");return new f(BigInt(s),BigInt(o))}}Object.defineProperty(f.prototype,Symbol.toStringTag,{value:A});const T=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))},it=n=>T(n).replaceAll("+","-").replaceAll("/","_").replace(/=+$/,""),ct=n=>{const t=n.length&3;t>0&&(n=n+"=".repeat(4-t));const e=n.replaceAll("-","+").replaceAll("_","/");return P(e)},at=n=>{let t=Array.from(n,o=>o.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,o=>Number.parseInt(o[0],16).toString(8).padStart(8,"0")).join("").replace(/^0+/,"")},lt=n=>{const t=n.length&7;t&&(n="0".repeat(8-t)+n);const e=n.matchAll(/.{8}/g),s=Array.from(e,o=>{const i=o[0];return Number.parseInt(i,8).toString(16).padStart(6,"0")}).join("").matchAll(/.{2}/g);return Uint8Array.from(s,o=>Number.parseInt(o[0],16))},ut=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},ft=n=>{const t=ut(n);n=BigInt.asUintN(t*7,n);const e=new Uint8Array(t);for(let s=0;s<t-1;++s){const o=Number(n&127n)|128;e[s]=o,n>>=7n}const r=Number(n&127n);return e[t-1]=r,n>>=7n,e},ht=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)},C=n=>{if(n===0n)return 64n;let t=0n;for(;n>0n&&!(n&1n);)++t,n>>=1n;return BigInt.asUintN(64,t)},dt=n=>{const t=0n,e=1023n,r=()=>BigInt.asUintN(64,n()),s=i=>{const c=i&0x7ffn;let l=e-1n;if(c>0n)return l-=C(c),l;l-=11n;const u=1e5;for(let h=0;h<u;++h){const d=r();if(d>0n)return l-=C(d),l;if(l-=64n,l<t)return t}throw Error("loop exceeded limit")},o=()=>{const i=r(),c=BigInt.asUintN(52,i>>11n),u=c===0n&&i>>63n===1n?s(i)+1n:s(i),{buffer:h}=BigUint64Array.from([u<<52n|c]);return new Float64Array(h)[0]};return()=>{for(let c=0;c<1e5;++c){const l=o();if(l<1)return l}throw Error("Loop limit exceeded")}},gt=[0x853c49e6748fea9bn,0xda3e39cb94b95bdbn],mt=0x5851f42d4c957f2dn,j="PCGMinimal";class _{#t;static name=j;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(gt)}#n(){this.#t[0]=this.#t[0]*mt+this.#t[1]}get#e(){const t=this.#t[0],e=Number(t>>59n),r=Number(BigInt.asUintN(32,(t^t>>18n)>>27n));return L(r,e)}getRandU32(){return this.#n(),this.#e}getBoundedRandU32(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 o=0;o<s;++o){const i=this.getRandU32();if(i>=r)return i%t}throw Error("exceeded loop limit")}*genRandU32s(t,e){if(t<=0)throw Error("'step' must be positive");for(let r=0;r<t;r++)yield typeof e=="number"?this.getBoundedRandU32(e):this.getRandU32()}}Object.defineProperty(_.prototype,Symbol.toStringTag,{value:j});const yt=[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(yt)}#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)}getRandU64(){const t=this.value;return this.#n(),t}getRandU32(){const t=BigInt.asUintN(32,this.getRandU64());return Number(t)}getBoundedRandU64(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 o=0;o<s;++o){const i=this.getRandU64();if(i>=r)return i%t}throw Error("exceeded loop limit")}getBoundedRandU32(t){if(t>4294967296)throw Error("'bound' exceeded limit");if(t<=0n)throw Error("'bound' must be positive");const r=this.getBoundedRandU64(BigInt(t));return Number(r)}*genRandU64s(t,e){if(t<=0)throw Error("'step' must be positive");for(let r=0;r<t;++r)yield e===void 0?this.getRandU64():this.getBoundedRandU64(e)}*genRandU32s(t,e){if(t<=0)throw Error("'step' must be positive");for(let r=0;r<t;++r)yield e===void 0?this.getRandU32():this.getBoundedRandU32(e)}}Object.defineProperty(U.prototype,Symbol.toStringTag,{value:U.name});const O="WorkerStream";class F extends ReadableStream{close;#t;static name=O;constructor(t,e){let r,s,o;super({start:i=>{r=c=>{i.enqueue(c.data)},s=c=>{t.removeEventListener("message",r),t.removeEventListener("error",s);const l=new p("WorkerStreamError",c.message,{cause:c.error});i.error(l)},o=()=>{t.removeEventListener("message",r),t.removeEventListener("error",s),i.close()},t.addEventListener("message",r),t.addEventListener("error",s)},cancel:i=>{console.log("Canceled reason:",i),t.removeEventListener("message",r),t.removeEventListener("error",s)}},e),this.close=o,this.#t=t}postMessage(t,e){this.#t.postMessage(t,e)}}return Object.defineProperty(F.prototype,Symbol.toStringTag,{value:O}),a.NamedError=p,a.PCGMinimal=_,a.Rational=f,a.WorkerStream=F,a.XoshiroMinimal=U,a.bailliePSW=S,a.compress=H,a.decodeLEB128=ht,a.decodeRFC3986URIComponent=z,a.decompress=J,a.encodeLEB128=ft,a.encodeRFC3986URIComponent=k,a.exEuclidean=R,a.factorial=x,a.floatRng=dt,a.fromBase64=P,a.fromBase64Url=ct,a.fromOct=lt,a.getHash=X,a.getRandBIByBitLength=I,a.getRandBIByRange=v,a.getRandPrimeByBitLength=ot,a.getRandPrimeByRange=st,a.getRndInt=Z,a.getStringTag=K,a.isDeepStrictEqual=g,a.isSquare=M,a.jacobiSymbol=E,a.lazify=W,a.modPow=y,a.parseCSV=G,a.residue=m,a.rot32=L,a.rot64=B,a.sameValueZero=$,a.setTimeoutPromise=Y,a.sleep=q,a.toBase64=T,a.toBase64Url=it,a.toOct=at,a.withResolvers=D,Object.defineProperty(a,Symbol.toStringTag,{value:"Module"}),a})({});
+var UtilFns=(function(c){"use strict";const $=new TextEncoder,D=(n,t)=>[n].includes(t),h=(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(!h(n[s],t[s]))return!1;return!0}if(n instanceof Set&&t instanceof Set){const s=[...n.values()],o=[...t.values()];return!!h(s,o)}if(n instanceof Map&&t instanceof Map){const s=[...n.keys()],o=[...t.keys()];if(!h(s,o))return!1;const i=[...n.values()],a=[...t.values()];return!!h(i,a)}if(e==="[object Object]"){const s=n,o=t,i=Object.keys(s),a=Object.keys(o);for(const l of i){const f=a.find(It=>It===l);if(f===void 0)return!1;const[m,p]=[s[l],o[f]];if(!h(m,p))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)}),W=n=>{const t=Object.prototype.toString.call(n);return t.slice(8,t.length-1)},G=n=>(...t)=>()=>n(...t),X=n=>{const t=[];let e=[],r="",s=!1;for(let o=0;o<n.length;o++){const i=n[o];i==='"'&&(o===0||n[o-1]!=="\\")?s=!s:i===","&&!s?(e.push(r.trim()),r=""):i===`
+`&&!s?(e.push(r.trim()),t.push(e),e=[],r=""):r+=i}return e.push(r.trim()),t.push(e),t},k=async(n,t)=>{const e=$.encode(n),r=await crypto.subtle.digest(t,e);return new Uint8Array(r)},z=n=>encodeURIComponent(n).replace(/[!'()*]/g,e=>`%${e.charCodeAt(0).toString(16).toUpperCase()}`),H=n=>{if(n.includes("+"))throw Error("An input string has '+'");return decodeURIComponent(n)},J=async(n,t)=>{const r=new Blob([n]).stream().pipeThrough(new CompressionStream(t));return new Response(r).bytes()},Y=async(n,t)=>{const r=new Blob([n]).stream().pipeThrough(new DecompressionStream(t));return new Response(r).bytes()},Z=(n,t)=>new Promise((e,r)=>{setTimeout(async()=>{try{const s=await n();e(s)}catch(s){r(s)}},t)}),N="NamedError";class y extends Error{constructor(t,e,r){super(e,r),this.errName=t}static name=N;toJSON(){const t=(()=>{const o=this.cause;if(o!=null)return typeof o=="string"||typeof o=="number"||typeof o=="boolean"?o:typeof o=="bigint"?o.toString():typeof o=="object"?o instanceof Set||o instanceof Map?Object.fromEntries(o):o: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:N});const Q=(n,t)=>Math.floor(Math.random()*(t-n)+n),d=(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,o=>o.toString(2).padStart(8,"0")).join("").slice(0,n);return t&&(s=s.replace(/^\d/,"1")),BigInt("0b"+s)},R=(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 i=0;i<1e5;i++){const a=I(r);if(a>=g(2n,BigInt(r),e))return a%e}throw Error("Failed to generate a random bigint")})();return n+s},g=(n,t,e)=>{if(e<1n)throw Error("`mod` must be positive");if(t<0n)throw Error("`power` must not be negative");if(n=d(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},v=(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],[o,i,a]=[0n,-1n,t];for(;;){const l=s/a,f=s-l*a;if(f===0n)break;[e,o]=[o,e-l*o],[r,i]=[i,r-l*i],[s,a]=[a,f]}return a<0n&&(o*=-1n,i*=-1n,a*=-1n),{x:o,y:i,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,o=w(n,s),i=w(s,t);return o*i},x=n=>{let t=3n,e=1n,r=1n;const s=BigInt(n.toString(2).length)-1n;for(let o=s-1n;o>-1n;--o){const i=(n>>o)+1n|1n;r*=w(t,i),t=i,e*=r}return e},tt=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 x(n)<<t},L=(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},M=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},nt=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 i=g(2n,r,n);if(i===1n)return!0;for(let a=0n;a<s;a++){if(i===n-1n)return!0;i=i*i%n}return!1},et=n=>{let t=5n,e=E(t,n);for(;e>0n;){if(t=t>0n?t+2n:t-2n,t*=-1n,t===-15n&&M(n))return[0n,0n];e=E(t,n)}return[t,e]},b=(n,t)=>(n&1n)===1n?d(n+t>>1n,t):d(n>>1n,t),rt=(n,t,e,r)=>{let s=1n,o=e;const i=n.toString(2).slice(1);for(const a of i)[s,o]=[d(s*o,t),b(o*o+r*s*s,t)],a==="1"&&([s,o]=[b(e*s+o,t),b(r*s+e*o,t)]);return[s,o]},st=(n,t,e,r)=>{if(n%2n!==1n)throw Error("`n` must be odd");let s=n+1n,o=0n;for(;s%2n===0n;)s>>=1n,o+=1n;const[i,a]=rt(s,n,e,t);let l=a;if(i===0n)return!0;r=g(r,s,n);for(let f=0n;f<o;f++){if(l===0n)return!0;l=d(l*l-2n*r,n),r=g(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 o of t)if(n%o===0n)return n===o;if(!nt(n))return!1;const[e,r]=et(n);if(r===0n)return!1;const s=(1n-e)/4n;return st(n,e,1n,s)},ot=(n,t)=>{if(t<2n)throw Error("NoPrimesFound");for(let r=0;r<1e5;r++){const s=R(n,t);if(S(s))return s}throw Error("NoPrimesFound")},it=(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")},A="Rational";class u{#t;#n;static name=A;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 u(0n,0n);if(Math.abs(t)===1/0)return new u(t>0?1n:-1n,0n);const r=t<0;r&&(t*=-1);const s=BigInt(Math.floor(t)),o=t-Number(s);if(o===0)return new u(r?-s:s,1n);t=1/o;let[i,a]=[1n,s],[l,f]=[0n,1n];for(;`${f}`.length<e+1;){const m=BigInt(Math.floor(t)),p=t-Number(m);if([i,a]=[a,m*a+i],[l,f]=[f,m*f+l],p===0)return new u(r?-a:a,f);t=1/p}return new u(r?-i:i,l)}#e(){const{gcd:t}=v(this.#t,this.#n);t!==0n&&(this.#t/=t,this.#n/=t)}minus(){return new u(-this.#t,this.#n)}inverse(){return new u(this.#n,this.#t)}add(t){const e=this.#n*t.#n,r=this.#t*t.#n+t.#t*this.#n;return new u(r,e)}substr(t){return this.add(t.minus())}multiply(t){const e=this.#n*t.#n,r=this.#t*t.#t;return new u(r,e)}divide(t){return this.multiply(t.inverse())}mediant(t){const e=this.#n+t.#n,r=this.#t+t.#t;return new u(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 u(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),o=r.at(2);if(!s||!o)throw Error("cannot parse");return new u(BigInt(s),BigInt(o))}}Object.defineProperty(u.prototype,Symbol.toStringTag,{value:A});const T=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))},ct=n=>T(n).replaceAll("+","-").replaceAll("/","_").replace(/=+$/,""),at=n=>{const t=n.length&3;t>0&&(n=n+"=".repeat(4-t));const e=n.replaceAll("-","+").replaceAll("_","/");return P(e)},lt=n=>{let t=Array.from(n,o=>o.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,o=>Number.parseInt(o[0],16).toString(8).padStart(8,"0")).join("").replace(/^0+/,"")},ut=n=>{const t=n.length&7;t&&(n="0".repeat(8-t)+n);const e=n.matchAll(/.{8}/g),s=Array.from(e,o=>{const i=o[0];return Number.parseInt(i,8).toString(16).padStart(6,"0")}).join("").matchAll(/.{2}/g);return Uint8Array.from(s,o=>Number.parseInt(o[0],16))},ft=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},ht=n=>{const t=ft(n);n=BigInt.asUintN(t*7,n);const e=new Uint8Array(t);for(let s=0;s<t-1;++s){const o=Number(n&127n)|128;e[s]=o,n>>=7n}const r=Number(n&127n);return e[t-1]=r,n>>=7n,e},dt=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)},C=n=>{if(n===0n)return 64n;let t=0n;for(;n>0n&&!(n&1n);)++t,n>>=1n;return BigInt.asUintN(64,t)},j=(n,t)=>{const e=0n,r=1023n,s=n&0x7ffn;let o=r-1n;if(s>0n)return o-=C(s),o;o-=11n;const i=1e5;for(let a=0;a<i;++a){const l=t();if(l>0n)return o-=C(l),o;if(o-=64n,o<e)return e}throw Error("loop exceeded limit")},gt=n=>{const t=()=>BigInt.asUintN(64,n()),e=()=>{const r=t(),s=BigInt.asUintN(52,r>>11n),i=s===0n&&r>>63n===1n?j(r,t)+1n:j(r,t),{buffer:a}=BigUint64Array.from([i<<52n|s]);return new Float64Array(a)[0]};return()=>{for(let s=0;s<1e5;++s){const o=e();if(o<1)return o}throw Error("Loop limit exceeded")}},mt=[0x853c49e6748fea9bn,0xda3e39cb94b95bdbn],yt=0x5851f42d4c957f2dn,O="PCGMinimal";class _{#t;static name=O;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 L(r,e)}getRandU32(){return this.#n(),this.#e}getBoundedRandU32(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 o=0;o<s;++o){const i=this.getRandU32();if(i>=r)return i%t}throw Error("exceeded loop limit")}*genRandU32s(t,e){if(t<=0)throw Error("'step' must be positive");for(let r=0;r<t;r++)yield typeof e=="number"?this.getBoundedRandU32(e):this.getRandU32()}}Object.defineProperty(_.prototype,Symbol.toStringTag,{value:O});const pt=[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(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)}getRandU64(){const t=this.value;return this.#n(),t}getRandU32(){const t=BigInt.asUintN(32,this.getRandU64());return Number(t)}getBoundedRandU64(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 o=0;o<s;++o){const i=this.getRandU64();if(i>=r)return i%t}throw Error("exceeded loop limit")}getBoundedRandU32(t){if(t>4294967296)throw Error("'bound' exceeded limit");if(t<=0n)throw Error("'bound' must be positive");const r=this.getBoundedRandU64(BigInt(t));return Number(r)}*genRandU64s(t,e){if(t<=0)throw Error("'step' must be positive");for(let r=0;r<t;++r)yield e===void 0?this.getRandU64():this.getBoundedRandU64(e)}*genRandU32s(t,e){if(t<=0)throw Error("'step' must be positive");for(let r=0;r<t;++r)yield e===void 0?this.getRandU32():this.getBoundedRandU32(e)}}Object.defineProperty(U.prototype,Symbol.toStringTag,{value:U.name});const F="WorkerStream";class V extends ReadableStream{close;#t;static name=F;constructor(t,e){let r,s,o;super({start:i=>{r=a=>{i.enqueue(a.data)},s=a=>{t.removeEventListener("message",r),t.removeEventListener("error",s);const l=new y("WorkerStreamError",a.message,{cause:a.error});i.error(l)},o=()=>{t.removeEventListener("message",r),t.removeEventListener("error",s),i.close()},t.addEventListener("message",r),t.addEventListener("error",s)},cancel:i=>{console.log("Canceled reason:",i),t.removeEventListener("message",r),t.removeEventListener("error",s)}},e),this.close=o,this.#t=t}postMessage(t,e){this.#t.postMessage(t,e)}}return Object.defineProperty(V.prototype,Symbol.toStringTag,{value:F}),c.NamedError=y,c.PCGMinimal=_,c.Rational=u,c.WorkerStream=V,c.XoshiroMinimal=U,c.bailliePSW=S,c.compress=J,c.decodeLEB128=dt,c.decodeRFC3986URIComponent=H,c.decompress=Y,c.encodeLEB128=ht,c.encodeRFC3986URIComponent=z,c.exEuclidean=v,c.factorial=tt,c.floatRng=gt,c.fromBase64=P,c.fromBase64Url=at,c.fromOct=ut,c.getHash=k,c.getRandBIByBitLength=I,c.getRandBIByRange=R,c.getRandPrimeByBitLength=it,c.getRandPrimeByRange=ot,c.getRndInt=Q,c.getStringTag=W,c.isDeepStrictEqual=h,c.isSquare=M,c.jacobiSymbol=E,c.lazify=G,c.modPow=g,c.parseCSV=X,c.residue=d,c.rot32=L,c.rot64=B,c.sameValueZero=D,c.setTimeoutPromise=Z,c.sleep=K,c.toBase64=T,c.toBase64Url=ct,c.toOct=lt,c.withResolvers=q,Object.defineProperty(c,Symbol.toStringTag,{value:"Module"}),c})({});

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@tktb-tess/util-fns",
-  "version": "0.11.2",
+  "version": "0.11.3",
   "description": "Utility functions for personal use",
   "files": [
     "dist"
@@ -17,8 +17,8 @@
     "import": "./dist/bundle.js"
   },
   "engines": {
-    "node": "^22",
-    "pnpm": "^10"
+    "node": ">=22",
+    "pnpm": ">=10"
   },
   "repository": {
     "type": "git",
@@ -26,15 +26,16 @@
   },
   "homepage": "https://github.com/tktb-tess/util-fns/blob/main/README.md",
   "devDependencies": {
-    "@types/node": "^25.0.3",
+    "@types/node": "^25.0.9",
     "tsx": "^4.21.0",
     "typescript": "^5.9.3",
-    "vite": "^7.3.0",
+    "vite": "^7.3.1",
     "vite-plugin-dts": "^4.5.4",
-    "vitest": "^4.0.16"
+    "vitest": "^4.0.17"
   },
   "volta": {
-    "node": "22.21.0"
+    "node": "24.13.0",
+    "pnpm": "10.28.0"
   },
   "scripts": {
     "dev": "vite",