@tktb-tess/util-fns 0.11.0 → 0.11.2

package/dist/bundle.js

@@ -1,248 +1,252 @@
-const M = new TextEncoder(), X = (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;
-  if (typeof e == "string" || typeof e == "bigint" || typeof e == "boolean" || typeof e == "symbol" || e == null)
-    return e === t;
-  if (typeof e == "number")
-    return e !== e && t !== t || e === t;
-  if (typeof e == "function")
+const x = new TextEncoder(), z = (n, t) => [n].includes(t), d = (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(e) && Array.isArray(t)) {
-    if (e.length !== t.length) return !1;
-    for (let s = 0; s < e.length; s++)
-      if (!d(e[s], t[s])) 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 (!d(n[s], t[s])) return !1;
     return !0;
   }
-  if (e instanceof Set && t instanceof Set) {
-    const s = [...e.values()], o = [...t.values()];
+  if (n instanceof Set && t instanceof Set) {
+    const s = [...n.values()], o = [...t.values()];
     return !!d(s, o);
   }
-  if (e instanceof Map && t instanceof Map) {
-    const s = [...e.keys()], o = [...t.keys()];
+  if (n instanceof Map && t instanceof Map) {
+    const s = [...n.keys()], o = [...t.keys()];
     if (!d(s, o)) return !1;
-    const i = [...e.values()], c = [...t.values()];
+    const i = [...n.values()], c = [...t.values()];
     return !!d(i, c);
   }
-  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);
-      if (l === void 0) return !1;
-      const [f, h] = [s[a], o[l]];
+  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);
+      if (u === void 0) return !1;
+      const [f, h] = [s[l], o[u]];
       if (!d(f, h)) return !1;
     }
     return !0;
   }
-  throw Error(`comparing these objects is unavailable: ${e}, ${t}`, {
-    cause: [e, t]
+  throw Error(`comparing these objects is unavailable: ${n}, ${t}`, {
+    cause: [n, t]
   });
 }, H = () => {
-  let e, t;
+  let n, t;
   return {
     promise: new Promise((r, s) => {
-      e = r, t = s;
+      n = r, t = s;
     }),
-    resolve: e,
+    resolve: n,
     reject: t
   };
-}, J = (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) => {
+}, J = (n) => new Promise((t) => {
+  setTimeout(() => t(), n);
+}), Y = (n) => {
+  const t = Object.prototype.toString.call(n);
+  return t.slice(8, t.length - 1);
+}, Z = (n) => (...t) => () => n(...t), Q = (n) => {
   const t = [];
-  let n = [], r = "", s = !1;
-  for (let o = 0; o < e.length; o++) {
-    const i = e[o];
-    i === '"' && (o === 0 || e[o - 1] !== "\\") ? s = !s : i === "," && !s ? (n.push(r.trim()), r = "") : i === `
-` && !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);
+  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;
+}, tt = async (n, t) => {
+  const e = x.encode(n), r = await crypto.subtle.digest(t, e);
   return new Uint8Array(r);
-}, et = () => !!globalThis.process && typeof process.version < "u" && typeof process.versions.node < "u", nt = (e) => encodeURIComponent(e).replace(
+}, nt = (n) => encodeURIComponent(n).replace(
   /[!'()*]/g,
-  (n) => `%${n.charCodeAt(0).toString(16).toUpperCase()}`
-), rt = (e) => {
-  if (e.includes("+"))
+  (e) => `%${e.charCodeAt(0).toString(16).toUpperCase()}`
+), et = (n) => {
+  if (n.includes("+"))
     throw Error("An input string has '+'");
-  return decodeURIComponent(e);
-}, st = async (e, t) => {
-  const r = new Blob([e]).stream().pipeThrough(new CompressionStream(t));
+  return decodeURIComponent(n);
+}, rt = async (n, t) => {
+  const r = new Blob([n]).stream().pipeThrough(new CompressionStream(t));
   return new Response(r).bytes();
-}, ot = async (e, t) => {
-  const r = new Blob([e]).stream().pipeThrough(new DecompressionStream(t));
+}, st = async (n, t) => {
+  const r = new Blob([n]).stream().pipeThrough(new DecompressionStream(t));
   return new Response(r).bytes();
-}, it = (e, t) => new Promise((n, r) => {
+}, ot = (n, t) => new Promise((e, r) => {
   setTimeout(async () => {
     try {
-      const s = await e();
-      n(s);
+      const s = await n();
+      e(s);
     } catch (s) {
       r(s);
     }
   }, t);
-});
-class m extends Error {
-  constructor(t, n, r) {
-    super(n, r), this.errName = t;
+}), B = "NamedError";
+class I extends Error {
+  constructor(t, e, r) {
+    super(e, r), this.errName = t;
   }
-  static name = "NamedError";
+  static name = B;
   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: n, message: r, stack: s } = this;
+    })(), { errName: e, message: r, stack: s } = this;
     return {
-      errName: n,
+      errName: e,
       message: r,
       stack: s,
       cause: t
     };
   }
 }
-Object.defineProperty(m.prototype, Symbol.toStringTag, {
-  value: m.name
+Object.defineProperty(I.prototype, Symbol.toStringTag, {
+  value: B
 });
-const ct = (e, t) => Math.floor(Math.random() * (t - e) + e), g = (e, t) => {
+const it = (n, t) => Math.floor(Math.random() * (t - n) + n), g = (n, t) => {
   t < 0n && (t *= -1n);
-  const n = e % t;
-  return n < 0n ? n + t : n;
-}, N = (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);
+  const e = n % t;
+  return e < 0n ? e + t : e;
+}, N = (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);
-}, A = (e, t) => {
-  if (e >= t)
-    throw new m("RangeError", "min is larger than max");
-  const n = t - e, r = n.toString(2).length, s = (() => {
+}, T = (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);
-      if (c >= p(2n, BigInt(r), n))
-        return c % n;
+      if (c >= m(2n, BigInt(r), e))
+        return c % e;
     }
     throw Error("Failed to generate a random bigint");
   })();
-  return e + s;
-}, p = (e, t, n) => {
-  if (n < 1n) throw Error("`mod` must be positive");
+  return n + s;
+}, m = (n, t, e) => {
+  if (e < 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;
-  if (e % n === 1n || e % n === 0n) return e;
-  if (e === n - 1n) return t & 1n ? n - 1n : 1n;
+  if (n = g(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 * e % n), e = e * e % n, t >>= 1n;
+    t & 1n && (r = r * n % e), n = n * n % e, t >>= 1n;
   return r;
-}, T = (e, t) => {
-  if (e === 0n && t === 0n) return { x: 0n, y: 0n, gcd: 0n };
-  if (e === 0n)
+}, 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 e > 0n ? { x: 1n, y: 0n, gcd: e } : { x: -1n, y: 0n, gcd: -e };
-  let [n, r, s] = [1n, 0n, e], [o, i, c] = [0n, -1n, t];
+    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 a = s / c, l = s - a * c;
-    if (l === 0n) break;
-    [n, o] = [o, n - a * o], [r, i] = [i, r - a * i], [s, c] = [c, l];
+    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 = (e, t) => {
-  if (e >= t) return 1n;
-  const n = BigInt((t - 2n).toString(2).length), r = (t - e) / 2n;
-  if (n * r < 63n) {
-    let c = e;
-    for (let a = e + 2n; a < t; a += 2n)
-      c *= a;
+}, y = (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 = e + r | 1n, o = w(e, s), i = w(s, t);
+  const s = n + r | 1n, o = y(n, s), i = y(s, t);
   return o * i;
-}, P = (e) => {
-  let t = 3n, n = 1n, r = 1n;
-  const s = BigInt(e.toString(2).length) - 1n;
+}, P = (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 = (e >> o) + 1n | 1n;
-    r *= w(t, i), t = i, n *= r;
-  }
-  return n;
-}, at = (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) => {
+    const i = (n >> o) + 1n | 1n;
+    r *= y(t, i), t = i, e *= r;
+  }
+  return e;
+}, ct = (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) => {
   if (t < 1n || t % 2n === 0n)
     throw Error("`n` is invalid");
-  for (; e < 0n; )
-    e += t;
-  e %= t;
-  let n = 1n;
-  for (; e !== 0n; ) {
-    for (; e % 2n === 0n; ) {
-      e /= 2n;
+  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) && (n *= -1n);
+      (r === 3n || r === 5n) && (e *= -1n);
     }
-    [e, t] = [t, e], e % 4n === 3n && t % 4n === 3n && (n *= -1n), e %= t;
-  }
-  return t === 1n ? n : 0n;
-}, _ = (e) => {
-  if (e < 0n) return !1;
-  if (e === 0n) return !0;
-  let t = 1n, n = e;
-  for (; t + 1n < n; ) {
-    const r = (t + n) / 2n;
-    r * r < e ? t = r : n = r;
-  }
-  return e === t ** 2n || e === (t + 1n) ** 2n;
-}, C = (e) => {
-  if (e <= 1n) return !1;
-  if (e % 2n === 0n) return e === 2n;
-  let t = e - 1n, n = 0n;
+    [n, t] = [t, n], n % 4n === 3n && t % 4n === 3n && (e *= -1n), n %= t;
+  }
+  return t === 1n ? e : 0n;
+}, _ = (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;
+}, C = (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, n += 1n;
-  const [r, s] = [t, n];
-  let i = p(2n, r, e);
+    t >>= 1n, e += 1n;
+  const [r, s] = [t, e];
+  let i = m(2n, r, n);
   if (i === 1n) return !0;
   for (let c = 0n; c < s; c++) {
-    if (i === e - 1n) return !0;
-    i = i * i % e;
+    if (i === n - 1n) return !0;
+    i = i * i % n;
   }
   return !1;
-}, O = (e) => {
-  let t = 5n, n = E(t, e);
-  for (; n > 0n; ) {
-    if (t = t > 0n ? t + 2n : t - 2n, t *= -1n, t === -15n && _(e))
+}, O = (n) => {
+  let t = 5n, e = E(t, n);
+  for (; e > 0n; ) {
+    if (t = t > 0n ? t + 2n : t - 2n, t *= -1n, t === -15n && _(n))
       return [0n, 0n];
-    n = E(t, e);
+    e = E(t, n);
   }
-  return [t, n];
-}, I = (e, t) => (e & 1n) === 1n ? g(e + t >> 1n, t) : g(e >> 1n, t), F = (e, t, n, r) => {
-  let s = 1n, o = n;
-  const i = e.toString(2).slice(1);
+  return [t, e];
+}, p = (n, t) => (n & 1n) === 1n ? g(n + t >> 1n, t) : g(n >> 1n, t), V = (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), 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), 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];
-}, V = (e, t, n, r) => {
-  if (e % 2n !== 1n) throw Error("`n` must be odd");
-  let s = e + 1n, o = 0n;
+}, F = (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] = F(s, e, n, t);
-  let a = c;
+  const [i, c] = V(s, n, e, t);
+  let l = c;
   if (i === 0n) return !0;
-  r = p(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);
+  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);
   }
   return !1;
-}, R = (e) => {
-  if (e <= 1n) return !1;
-  if (e % 2n === 0n) return e === 2n;
+}, U = (n) => {
+  if (n <= 1n) return !1;
+  if (n % 2n === 0n) return n === 2n;
   const t = [
     2n,
     3n,
@@ -272,88 +276,88 @@ const ct = (e, t) => Math.floor(Math.random() * (t - e) + e), g = (e, t) => {
     101n
   ];
   for (const o of t)
-    if (e % o === 0n)
-      return e === o;
-  if (!C(e))
+    if (n % o === 0n)
+      return n === o;
+  if (!C(n))
     return !1;
-  const [n, r] = O(e);
+  const [e, r] = O(n);
   if (r === 0n) return !1;
-  const s = (1n - n) / 4n;
-  return V(e, n, 1n, s);
-}, lt = (e, t) => {
+  const s = (1n - e) / 4n;
+  return F(n, e, 1n, s);
+}, lt = (n, t) => {
   if (t < 2n)
-    throw Error("noPrimesFound");
+    throw Error("NoPrimesFound");
   for (let r = 0; r < 1e5; r++) {
-    const s = A(e, t);
-    if (R(s)) return s;
+    const s = T(n, t);
+    if (U(s)) return s;
   }
-  throw Error("noPrimesFound");
-}, ut = (e, t = !1) => {
-  if (e < 2)
-    throw Error("noPrimesFound");
+  throw Error("NoPrimesFound");
+}, ut = (n, t = !1) => {
+  if (n < 2)
+    throw Error("NoPrimesFound");
   for (let r = 0; r < 1e5; r++) {
-    const s = N(e, t);
-    if (R(s)) return s;
+    const s = N(n, t);
+    if (U(s)) return s;
   }
-  throw Error("noPrimesFound");
-};
-class u {
+  throw Error("NoPrimesFound");
+}, v = "Rational";
+class a {
   #t;
-  #e;
-  static name = "Rational";
+  #n;
+  static name = v;
   /**
    * fraction (rational) class
    * @param numerator
    * @param denominator
    */
-  constructor(t, n) {
-    n === 0n ? (this.#e = 0n, this.#t = t === 0n ? 0n : t > 0n ? 1n : -1n) : n > 0n ? (this.#t = t, this.#e = n) : (this.#t = -t, this.#e = -n), this.#n();
+  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();
   }
   /**
    * generates fraction from `number` decimal using continued fraction
    * @param value decimal
    * @param denominatorDigits limit of digits of denominator
    */
-  static fromDecimal(t, n = 5) {
+  static fromDecimal(t, e = 5) {
     if (Number.isNaN(t))
-      return new u(0n, 0n);
+      return new a(0n, 0n);
     if (Math.abs(t) === 1 / 0)
-      return new u(t > 0 ? 1n : -1n, 0n);
+      return new a(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);
+      return new a(r ? -s : s, 1n);
     t = 1 / o;
-    let [i, c] = [1n, s], [a, l] = [0n, 1n];
-    for (; `${l}`.length < n + 1; ) {
+    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], [a, l] = [l, f * l + a], h === 0)
-        return new u(r ? -c : c, l);
+      if ([i, c] = [c, f * c + i], [l, u] = [u, f * u + l], h === 0)
+        return new a(r ? -c : c, u);
       t = 1 / h;
     }
-    return new u(r ? -i : i, a);
+    return new a(r ? -i : i, l);
   }
   /**
    * reduction
    */
-  #n() {
-    const { gcd: t } = T(this.#t, this.#e);
-    t !== 0n && (this.#t /= t, this.#e /= t);
+  #e() {
+    const { gcd: t } = R(this.#t, this.#n);
+    t !== 0n && (this.#t /= t, this.#n /= t);
   }
   /**
    * returns a fraction multiplied by -1
    * @returns
    */
   minus() {
-    return new u(-this.#t, this.#e);
+    return new a(-this.#t, this.#n);
   }
   /**
    * returns inverse of this fraction
    * @returns
    */
   inverse() {
-    return new u(this.#e, this.#t);
+    return new a(this.#n, this.#t);
   }
   /**
    * returns `this + right`
@@ -361,8 +365,8 @@ class u {
    * @returns
    */
   add(t) {
-    const n = this.#e * t.#e, r = this.#t * t.#e + t.#t * this.#e;
-    return new u(r, n);
+    const e = this.#n * t.#n, r = this.#t * t.#n + t.#t * this.#n;
+    return new a(r, e);
   }
   /**
    * returns `this - right`
@@ -378,8 +382,8 @@ class u {
    * @returns
    */
   multiply(t) {
-    const n = this.#e * t.#e, r = this.#t * t.#t;
-    return new u(r, n);
+    const e = this.#n * t.#n, r = this.#t * t.#t;
+    return new a(r, e);
   }
   /**
    * returns `this / right`
@@ -396,22 +400,22 @@ class u {
    * @returns `(a+c)/(b+d)`
    */
   mediant(t) {
-    const n = this.#e + t.#e, r = this.#t + t.#t;
-    return new u(r, n);
+    const e = this.#n + t.#n, r = this.#t + t.#t;
+    return new a(r, e);
   }
   /**
    * returns `number` type decimal
    * @returns decimal
    */
   toDecimal() {
-    return Number(this.#t) / Number(this.#e);
+    return Number(this.#t) / Number(this.#n);
   }
   /**
    * returns `'numerator/denominator'`
    * @returns string form
    */
   toString() {
-    return this.#t === 0n && this.#e === 0n ? "NaN" : this.#t === 0n ? "0" : this.#e === 0n ? this.#t < 0n ? "-Infinity" : "Infinity" : this.#e === 1n ? `${this.#t}` : `${this.#t}/${this.#e}`;
+    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();
@@ -419,7 +423,7 @@ class u {
   toJSON() {
     return {
       type: "Rational",
-      value: ["0x" + this.#t.toString(16), "0x" + this.#e.toString(16)]
+      value: ["0x" + this.#t.toString(16), "0x" + this.#n.toString(16)]
     };
   }
   /**
@@ -428,8 +432,8 @@ class u {
    * @returns
    */
   static fromData(t) {
-    const n = BigInt(t.value[0]), r = BigInt(t.value[1]);
-    return new u(n, r);
+    const e = BigInt(t.value[0]), r = BigInt(t.value[1]);
+    return new a(e, r);
   }
   /**
    * pases string whose form is `'numerator/denominator'`
@@ -443,212 +447,104 @@ class u {
     const s = r.at(1), o = r.at(2);
     if (!s || !o)
       throw Error("cannot parse");
-    return new u(BigInt(s), BigInt(o));
+    return new a(BigInt(s), BigInt(o));
   }
 }
-Object.defineProperty(u.prototype, Symbol.toStringTag, {
-  value: u.name
+Object.defineProperty(a.prototype, Symbol.toStringTag, {
+  value: v
 });
-const $ = (e) => {
-  const t = Array.from(e, (n) => String.fromCharCode(n));
+const $ = (n) => {
+  const t = Array.from(n, (e) => String.fromCharCode(e));
   return btoa(t.join(""));
-}, D = (e) => {
-  const t = atob(e);
-  return Uint8Array.from(t, (n) => n.charCodeAt(0));
-}, ft = (e) => $(e).replaceAll("+", "-").replaceAll("/", "_").replace(/=+$/, ""), ht = (e) => {
-  const t = e.length & 3;
-  t > 0 && (e = e + "=".repeat(4 - t));
-  const n = e.replaceAll("-", "+").replaceAll("_", "/");
-  return D(n);
-}, dt = (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);
+}, D = (n) => {
+  const t = atob(n);
+  return Uint8Array.from(t, (e) => e.charCodeAt(0));
+}, at = (n) => $(n).replaceAll("+", "-").replaceAll("/", "_").replace(/=+$/, ""), ft = (n) => {
+  const t = n.length & 3;
+  t > 0 && (n = n + "=".repeat(4 - t));
+  const e = n.replaceAll("-", "+").replaceAll("_", "/");
+  return D(e);
+}, ht = (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+/, "");
-}, gt = (e) => {
-  const t = e.length & 7;
-  t && (e = "0".repeat(8 - t) + e);
-  const n = e.matchAll(/.{8}/g), s = Array.from(n, (o) => {
+}, dt = (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));
-}, 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;
+}, q = (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;
-}, mt = (e) => {
-  const t = k(e);
-  e = BigInt.asUintN(t * 7, e);
-  const n = new Uint8Array(t);
+}, gt = (n) => {
+  const t = q(n);
+  n = BigInt.asUintN(t * 7, n);
+  const e = new Uint8Array(t);
   for (let s = 0; s < t - 1; ++s) {
-    const o = Number(e & 127n) | 128;
-    n[s] = o, e >>= 7n;
-  }
-  const r = Number(e & 127n);
-  return n[t - 1] = r, e >>= 7n, n;
-}, pt = (e) => {
-  const t = e.length;
-  let n = 0n;
+    const o = Number(n & 127n) | 128;
+    e[s] = o, n >>= 7n;
+  }
+  const r = Number(n & 127n);
+  return e[t - 1] = r, n >>= 7n, e;
+}, mt = (n) => {
+  const t = n.length;
+  let e = 0n;
   for (let r = 0; r < t; ++r) {
-    const s = BigInt(e[r] & 127);
-    n += s << BigInt(7 * r);
-  }
-  return BigInt.asIntN(7 * t, n);
-}, B = (e) => {
-  if (e === 0) return 32;
-  let t = 0;
-  for (; e > 0 && !(e & 1); )
-    ++t, e >>>= 1;
-  return t;
-}, x = "FloatRng", S = (e) => {
-  if (e === 0n) return 64n;
+    const s = BigInt(n[r] & 127);
+    e += s << BigInt(7 * r);
+  }
+  return BigInt.asIntN(7 * t, e);
+}, b = (n) => {
+  if (n === 0n) return 64n;
   let t = 0n;
-  for (; e > 0n && !(e & 1n); )
-    ++t, e >>= 1n;
+  for (; n > 0n && !(n & 1n); )
+    ++t, n >>= 1n;
   return BigInt.asUintN(64, t);
-};
-class q {
-  #t;
-  static name = x;
-  constructor(t) {
-    this.#t = t;
-  }
-  #e() {
-    const r = (() => {
-      switch (this.#t.bits) {
-        case 32:
-          return this.#t.getU32Rand() >>> 0;
-        case 64: {
-          const a = this.#t.getU64Rand() & 0xffffffffn;
-          return Number(a);
-        }
-      }
-    })(), s = r & 255;
-    let o = 126;
-    if (s === 0) {
-      o -= 8;
-      const a = 1e5;
-      let l = 0;
-      t: for (; ; ) {
-        if (l > a)
-          throw Error("loop exceeded limit");
-        const f = (() => {
-          switch (this.#t.bits) {
-            case 32:
-              return this.#t.getU32Rand() >>> 0;
-            case 64: {
-              const h = BigInt.asUintN(32, this.#t.getU64Rand());
-              return Number(h);
-            }
-          }
-        })();
-        if (f === 0) {
-          if (o -= 32, o < 0) {
-            o = 0;
-            break t;
-          }
-        } else {
-          o -= B(f);
-          break t;
-        }
-        ++l;
-      }
-    } else
-      o -= B(s);
-    const i = r >>> 8 & 8388607;
-    i === 0 && r >>> 31 && ++o;
-    const c = Uint32Array.from([o << 23 | i]);
-    return new Float32Array(c.buffer)[0];
-  }
-  /**
-   * returns a random single-precision floating-point number (float32) in the range of [0.0, 1.0)
-   * @returns
-   */
-  getF32Rand() {
-    for (let n = 0; n < 1e5; ++n) {
-      const r = this.#e();
-      if (r < 1)
-        return r;
+}, 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("exceeded loop limit");
-  }
-  #n() {
-    const t = 0n, n = 1023n, r = (() => {
-      switch (this.#t.bits) {
-        case 32: {
-          const a = BigInt(this.#t.getU32Rand() >>> 0), l = BigInt(this.#t.getU32Rand() >>> 0);
-          return a << 32n | l;
-        }
-        case 64:
-          return BigInt.asUintN(64, this.#t.getU64Rand());
-      }
-    })(), s = r & 0x7ffn;
-    let o = n - 1n;
-    if (s === 0n) {
-      o -= 11n;
-      const a = 1e5;
-      let l = 0;
-      t: for (; ; ) {
-        if (l > a)
-          throw Error("loop exceeded limit");
-        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;
-            }
-            case 64:
-              return BigInt.asUintN(64, this.#t.getU64Rand());
-          }
-        })();
-        if (f === 0n) {
-          if (o -= 64n, o < t) {
-            o = t;
-            break t;
-          }
-        } else {
-          o -= S(f);
-          break t;
-        }
-        ++l;
-      }
-    } else
-      o -= S(s);
-    const i = BigInt.asUintN(52, r >> 11n);
-    i === 0n && r >> 63n && ++o;
-    const c = BigUint64Array.from([o << 52n | i]);
-    return new Float64Array(c.buffer)[0];
-  }
-  /**
-   * returns a random double-precision floating-point number (float64) in the range of [0.0, 1.0)
-   * @returns
-   */
-  getF64Rand() {
-    for (let n = 0; n < 1e5; ++n) {
-      const r = this.#n();
-      if (r < 1)
-        return r;
+    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];
+  };
+  return () => {
+    for (let c = 0; c < 1e5; ++c) {
+      const l = o();
+      if (l < 1)
+        return l;
     }
-    throw Error("exceeded loop limit");
-  }
-}
-Object.defineProperty(q.prototype, Symbol.toStringTag, {
-  value: x
-});
-const K = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn], G = 0x5851f42d4c957f2dn;
-class U {
+    throw Error("Loop limit exceeded");
+  };
+}, K = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn], G = 0x5851f42d4c957f2dn, L = "PCGMinimal";
+class W {
   /**
    * length = 2, `[state, increment]`
    */
   #t;
-  static name = "PCGMinimal";
-  bits = 32;
+  static name = L;
   /**
    * @param seeds
    * `BigUint64Array` with length 2. \
@@ -663,34 +559,34 @@ 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.#n(), this.#t[0] += t[0], this.#n()) : this.#t = BigUint64Array.from(K);
   }
   /** step inner state */
-  #e() {
+  #n() {
     this.#t[0] = this.#t[0] * G + 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);
+  get #e() {
+    const t = this.#t[0], e = Number(t >> 59n), r = Number(BigInt.asUintN(32, (t ^ t >> 18n) >> 27n));
+    return j(r, e);
   }
   /**
    *
    * @returns a random 32-bit unsigned integer
    */
-  getU32Rand() {
-    return this.#e(), this.#n;
+  getRandU32() {
+    return this.#n(), this.#e;
   }
   /**
    * @returns a random 32-bit unsigned integer less than `bound`
    */
-  getBoundedU32Rand(t) {
+  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.getU32Rand();
+      const i = this.getRandU32();
       if (i >= r)
         return i % t;
     }
@@ -704,23 +600,23 @@ class U {
    * the iterator that generates random 32-bit unsigned integers `step` times \
    * if `bound` is given, random integers are less than `bound`
    */
-  *genU32Rands(t, n) {
+  *genRandU32s(t, e) {
     if (t <= 0)
       throw Error("'step' must be positive");
     for (let r = 0; r < t; r++)
-      yield typeof n == "number" ? this.getBoundedU32Rand(n) : this.getU32Rand();
+      yield typeof e == "number" ? this.getBoundedRandU32(e) : this.getRandU32();
   }
 }
-Object.defineProperty(U.prototype, Symbol.toStringTag, {
-  value: U.name
+Object.defineProperty(W.prototype, Symbol.toStringTag, {
+  value: L
 });
-const W = [
+const X = [
   0xbe562cb412e2260en,
   0x2e4284137d641affn,
   0x4e19b36ee933e27en,
   0x7581cf8c4f4d4f7dn
 ];
-class v {
+class S {
   bits = 64;
   #t;
   static name = "XoshiroMinimal";
@@ -738,68 +634,68 @@ 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.#n(), this.#t[2] += t[2], this.#t[3] += t[3]) : this.#t = BigUint64Array.from(X);
   }
-  #e() {
+  #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);
+    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] = w(this.#t[3], 45n);
   }
   get value() {
-    const t = b(this.#t[0] + this.#t[3], 23n) + this.#t[0];
+    const t = w(this.#t[0] + this.#t[3], 23n) + this.#t[0];
     return BigInt.asUintN(64, t);
   }
-  getU64Rand() {
+  getRandU64() {
     const t = this.value;
-    return this.#e(), t;
+    return this.#n(), t;
   }
-  getU32Rand() {
-    const t = BigInt.asUintN(32, this.getU64Rand());
+  getRandU32() {
+    const t = BigInt.asUintN(32, this.getRandU64());
     return Number(t);
   }
-  getBoundedU64Rand(t) {
-    const n = 1n << 64n;
-    if (t > n)
+  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 = n % t, s = 1e5;
+    const r = e % t, s = 1e5;
     for (let o = 0; o < s; ++o) {
-      const i = this.getU64Rand();
+      const i = this.getRandU64();
       if (i >= r)
         return i % t;
     }
     throw Error("exceeded loop limit");
   }
-  getBoundedU32Rand(t) {
+  getBoundedRandU32(t) {
     if (t > 4294967296)
       throw Error("'bound' exceeded limit");
     if (t <= 0n)
       throw Error("'bound' must be positive");
-    const r = this.getBoundedU64Rand(BigInt(t));
+    const r = this.getBoundedRandU64(BigInt(t));
     return Number(r);
   }
-  *genU64Rands(t, n) {
+  *genRandU64s(t, e) {
     if (t <= 0)
       throw Error("'step' must be positive");
     for (let r = 0; r < t; ++r)
-      yield n === void 0 ? this.getU64Rand() : this.getBoundedU64Rand(n);
+      yield e === void 0 ? this.getRandU64() : this.getBoundedRandU64(e);
   }
-  *genU32Rands(t, n) {
+  *genRandU32s(t, e) {
     if (t <= 0)
       throw Error("'step' must be positive");
     for (let r = 0; r < t; ++r)
-      yield n === void 0 ? this.getU32Rand() : this.getBoundedU32Rand(n);
+      yield e === void 0 ? this.getRandU32() : this.getBoundedRandU32(e);
   }
 }
-Object.defineProperty(v.prototype, Symbol.toStringTag, {
-  value: v.name
+Object.defineProperty(S.prototype, Symbol.toStringTag, {
+  value: S.name
 });
-const L = "WorkerStream";
-class z extends ReadableStream {
+const A = "WorkerStream";
+class k extends ReadableStream {
   close;
   #t;
-  static name = L;
-  constructor(t, n) {
+  static name = A;
+  constructor(t, e) {
     let r, s, o;
     super(
       {
@@ -808,10 +704,10 @@ 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 l = new I("WorkerStreamError", c.message, {
               cause: c.error
             });
-            i.error(a);
+            i.error(l);
           }, o = () => {
             t.removeEventListener("message", r), t.removeEventListener("error", s), i.close();
           }, t.addEventListener("message", r), t.addEventListener("error", s);
@@ -820,57 +716,56 @@ class z extends ReadableStream {
           console.log("Canceled reason:", i), t.removeEventListener("message", r), t.removeEventListener("error", s);
         }
       },
-      n
+      e
     ), this.close = o, this.#t = t;
   }
-  postMessage(t, n) {
-    this.#t.postMessage(t, n);
+  postMessage(t, e) {
+    this.#t.postMessage(t, e);
   }
 }
-Object.defineProperty(z.prototype, Symbol.toStringTag, {
-  value: L
+Object.defineProperty(k.prototype, Symbol.toStringTag, {
+  value: A
 });
 export {
-  q as FloatRng,
-  m as NamedError,
-  U as PCGMinimal,
-  u as Rational,
-  z as WorkerStream,
-  v as XoshiroMinimal,
-  R as bailliePSW,
-  st as compress,
-  pt as decodeLEB128,
-  rt as decodeRFC3986URIComponent,
-  ot as decompress,
-  mt as encodeLEB128,
+  I as NamedError,
+  W 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,
-  T as exEuclidean,
-  at as factorial,
+  R as exEuclidean,
+  ct as factorial,
+  pt as floatRng,
   D as fromBase64,
-  ht as fromBase64Url,
-  gt as fromOct,
+  ft as fromBase64Url,
+  dt as fromOct,
   tt as getHash,
   N as getRandBIByBitLength,
-  A as getRandBIByRange,
+  T as getRandBIByRange,
   ut as getRandPrimeByBitLength,
   lt as getRandPrimeByRange,
-  ct as getRndInt,
+  it as getRndInt,
   Y as getStringTag,
   d as isDeepStrictEqual,
-  et as isNode,
   _ as isSquare,
   E as jacobiSymbol,
   Z as lazify,
-  p as modPow,
+  m as modPow,
   Q as parseCSV,
   g as residue,
   j as rot32,
-  b as rot64,
-  X as sameValueZero,
-  it as setTimeoutPromise,
+  w as rot64,
+  z as sameValueZero,
+  ot as setTimeoutPromise,
   J as sleep,
   $ as toBase64,
-  ft as toBase64Url,
-  dt as toOct,
+  at as toBase64Url,
+  ht as toOct,
   H as withResolvers
 };