@tktb-tess/util-fns 0.9.3 → 0.10.0

package/README.md

@@ -30,7 +30,7 @@ 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.9.3/dist/bundle.min.js"></script>
+<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;
     // ...
@@ -38,7 +38,7 @@ You can also use it via CDN such as jsDelivr.
 
 <!-- or as an ES Module -->
 <script type="module">
-    import { modPow } from 'https://cdn.jsdelivr.net/npm/@tktb-tess/util-fns@0.9.3/+esm';
+    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 _ = new TextEncoder(), W = (n, t) => [n].includes(t), g = (n, t) => {
+const L = new TextEncoder(), X = (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;
@@ -10,55 +10,55 @@ const _ = new TextEncoder(), W = (n, t) => [n].includes(t), g = (n, t) => {
     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;
+    for (let o = 0; o < n.length; o++)
+      if (!g(n[o], t[o])) return !1;
     return !0;
   }
   if (n instanceof Set && t instanceof Set) {
-    const s = [...n.values()], o = [...t.values()];
-    return !!g(s, o);
+    const o = [...n.values()], s = [...t.values()];
+    return !!g(o, s);
   }
   if (n instanceof Map && t instanceof Map) {
-    const s = [...n.keys()], o = [...t.keys()];
-    if (!g(s, o)) return !1;
+    const o = [...n.keys()], s = [...t.keys()];
+    if (!g(o, s)) 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 a of i) {
-      const l = c.find((d) => d === a);
+    const o = n, s = t, i = Object.keys(o), c = Object.keys(s);
+    for (const f of i) {
+      const l = c.find((d) => d === f);
       if (l === void 0) return !1;
-      const [f, h] = [s[a], o[l]];
-      if (!g(f, h)) return !1;
+      const [u, h] = [o[f], s[l]];
+      if (!g(u, h)) return !1;
     }
     return !0;
   }
   throw Error(`comparing these objects is unavailable: ${n}, ${t}`, {
     cause: [n, t]
   });
-}, X = () => {
+}, H = () => {
   let n, t;
   return {
-    promise: new Promise((r, s) => {
-      n = r, t = s;
+    promise: new Promise((r, o) => {
+      n = r, t = o;
     }),
     resolve: n,
     reject: t
   };
-}, Y = (n) => new Promise((t) => {
+}, J = (n) => new Promise((t) => {
   setTimeout(() => t(), n);
-}), H = (n) => (...t) => () => n(...t), Z = (n) => {
+}), W = (n) => Object.prototype.toString.call(n).match(/^\[Object\s(.+)\]$/)?.at(1), Y = (n) => (...t) => () => n(...t), Z = (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;
+  let e = [], r = "", o = !1;
+  for (let s = 0; s < n.length; s++) {
+    const i = n[s];
+    i === '"' && (s === 0 || n[s - 1] !== "\\") ? o = !o : i === "," && !o ? (e.push(r.trim()), r = "") : i === `
+` && !o ? (e.push(r.trim()), t.push(e), e = [], r = "") : r += i;
   }
   return e.push(r.trim()), t.push(e), t;
 }, Q = async (n, t) => {
-  const e = _.encode(n), r = await crypto.subtle.digest(t, e);
+  const e = L.encode(n), r = await crypto.subtle.digest(t, e);
   return new Uint8Array(r);
 }, tt = () => !!globalThis.process && typeof process.version < "u" && typeof process.versions.node < "u", nt = (n) => encodeURIComponent(n).replace(
   /[!'()*]/g,
@@ -73,66 +73,66 @@ const _ = new TextEncoder(), W = (n, t) => [n].includes(t), g = (n, t) => {
 }, st = async (n, t) => {
   const r = new Blob([n]).stream().pipeThrough(new DecompressionStream(t));
   return new Response(r).bytes();
-}, ot = (n, t) => Math.floor(Math.random() * (t - n) + n), p = (n, t) => {
+}, ot = (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;
-}, v = (n, t = !1) => {
+}, A = (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);
-}, L = (n, t) => {
+  let o = Array.from(r, (s) => s.toString(2).padStart(8, "0")).join("").slice(0, n);
+  return t && (o = o.replace(/^\d/, "1")), BigInt("0b" + o);
+}, v = (n, t) => {
   if (n >= t) throw Error("rangeError");
-  const e = t - n, r = e.toString(2).length, s = (() => {
+  const e = t - n, r = e.toString(2).length, o = (() => {
     for (let i = 0; i < 1e5; i++) {
-      const c = v(r);
-      if (c >= m(2n, BigInt(r), e))
+      const c = A(r);
+      if (c >= p(2n, BigInt(r), e))
         return c % e;
     }
     throw Error("Failed to generate a random bigint");
   })();
-  return n + s;
-}, m = (n, t, e) => {
+  return n + o;
+}, 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 = p(n, e), e === 1n) return 0n;
+  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;
-}, j = (n, t) => {
+}, _ = (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];
+  let [e, r, o] = [1n, 0n, n], [s, i, c] = [0n, -1n, t];
   for (; ; ) {
-    const a = s / c, l = s - a * c;
+    const f = o / c, l = o - f * c;
     if (l === 0n) break;
-    [e, o] = [o, e - a * o], [r, i] = [i, r - a * i], [s, c] = [c, l];
+    [e, s] = [s, e - f * s], [r, i] = [i, r - f * i], [o, c] = [c, l];
   }
-  return c < 0n && (o *= -1n, i *= -1n, c *= -1n), { x: o, y: i, gcd: c };
+  return c < 0n && (s *= -1n, i *= -1n, c *= -1n), { x: s, 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 a = n + 2n; a < t; a += 2n)
-      c *= a;
+    for (let f = n + 2n; f < t; f += 2n)
+      c *= f;
     return c;
   }
-  const s = n + r | 1n, o = w(n, s), i = w(s, t);
-  return o * i;
-}, P = (n) => {
+  const o = n + r | 1n, s = w(n, o), i = w(o, t);
+  return s * i;
+}, 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) {
-    const i = (n >> o) + 1n | 1n;
+  const o = BigInt(n.toString(2).length) - 1n;
+  for (let s = o - 1n; s > -1n; --s) {
+    const i = (n >> s) + 1n | 1n;
     r *= w(t, i), t = i, e *= r;
   }
   return e;
@@ -140,8 +140,8 @@ const _ = new TextEncoder(), W = (n, t) => [n].includes(t), g = (n, t) => {
   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;
-}, C = (n, t) => (n >>> (t & 31) | n << (-t & 31)) >>> 0, I = (n, t) => BigInt.asUintN(64, n >> (t & 63n) | n << (-t & 63n)), U = (n, t) => {
+  return j(n) << t;
+}, P = (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; )
@@ -166,49 +166,49 @@ const _ = new TextEncoder(), W = (n, t) => [n].includes(t), g = (n, t) => {
     r ** 2n < n ? t = r : e = r;
   }
   return n === t ** 2n || n === (t + 1n) ** 2n;
-}, F = (n) => {
+}, 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, e += 1n;
-  const [r, s] = [t, e];
-  let i = m(2n, r, n);
+  const [r, o] = [t, e];
+  let i = p(2n, r, n);
   if (i === 1n) return !0;
-  for (let c = 0n; c < s; c++) {
+  for (let c = 0n; c < o; c++) {
     if (i === n - 1n) return !0;
     i = i * i % n;
   }
   return !1;
-}, V = (n) => {
-  let t = 5n, e = U(t, n);
+}, F = (n) => {
+  let t = 5n, e = B(t, n);
   for (; e > 0n; ) {
     if (t = t > 0n ? t + 2n : t - 2n, t *= -1n, t === -15n && O(n))
       return [0n, 0n];
-    e = U(t, n);
+    e = B(t, n);
   }
   return [t, e];
-}, b = (n, t) => (n & 1n) === 1n ? p(n + t >> 1n, t) : p(n >> 1n, t), $ = (n, t, e, r) => {
-  let s = 1n, o = e;
+}, I = (n, t) => (n & 1n) === 1n ? m(n + t >> 1n, t) : m(n >> 1n, t), V = (n, t, e, r) => {
+  let o = 1n, s = e;
   const i = n.toString(2).slice(1);
   for (const c of i)
-    [s, o] = [p(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];
+    [o, s] = [m(o * s, t), I(s * s + r * o * o, t)], c === "1" && ([o, s] = [I(e * o + s, t), I(r * o + e * s, t)]);
+  return [o, s];
 }, k = (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] = $(s, n, e, t);
-  let a = c;
+  let o = n + 1n, s = 0n;
+  for (; o % 2n === 0n; )
+    o >>= 1n, s += 1n;
+  const [i, c] = V(o, n, e, t);
+  let f = c;
   if (i === 0n) return !0;
-  r = m(r, s, n);
-  for (let l = 0n; l < o; l++) {
-    if (a === 0n) return !0;
-    a = p(a * a - 2n * r, n), r = m(r, 2n, n);
+  r = p(r, o, n);
+  for (let l = 0n; l < s; l++) {
+    if (f === 0n) return !0;
+    f = m(f * f - 2n * r, n), r = p(r, 2n, n);
   }
   return !1;
-}, M = (n) => {
+}, T = (n) => {
   if (n <= 1n) return !1;
   if (n % 2n === 0n) return n === 2n;
   const t = [
@@ -239,33 +239,33 @@ const _ = new TextEncoder(), W = (n, t) => [n].includes(t), g = (n, t) => {
     97n,
     101n
   ];
-  for (const o of t)
-    if (n % o === 0n)
-      return n === o;
-  if (!F(n))
+  for (const s of t)
+    if (n % s === 0n)
+      return n === s;
+  if (!C(n))
     return !1;
-  const [e, r] = V(n);
+  const [e, r] = F(n);
   if (r === 0n) return !1;
-  const s = (1n - e) / 4n;
-  return k(n, e, 1n, s);
+  const o = (1n - e) / 4n;
+  return k(n, e, 1n, o);
 }, ct = (n, t) => {
   if (t < 2n)
     throw Error("noPrimesFound");
   for (let r = 0; r < 1e5; r++) {
-    const s = L(n, t);
-    if (M(s)) return s;
+    const o = v(n, t);
+    if (T(o)) return o;
   }
   throw Error("noPrimesFound");
-}, at = (n, t = !1) => {
+}, ft = (n, t = !1) => {
   if (n < 2)
     throw Error("noPrimesFound");
   for (let r = 0; r < 1e5; r++) {
-    const s = v(n, t);
-    if (M(s)) return s;
+    const o = A(n, t);
+    if (T(o)) return o;
   }
   throw Error("noPrimesFound");
 };
-class u {
+class a {
   #t;
   #n;
   static name = "Rational";
@@ -284,29 +284,29 @@ class u {
    */
   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);
-    t = 1 / o;
-    let [i, c] = [1n, s], [a, l] = [0n, 1n];
+    const o = BigInt(Math.floor(t)), s = t - Number(o);
+    if (s === 0)
+      return new a(r ? -o : o, 1n);
+    t = 1 / s;
+    let [i, c] = [1n, o], [f, l] = [0n, 1n];
     for (; `${l}`.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);
+      const u = BigInt(Math.floor(t)), h = t - Number(u);
+      if ([i, c] = [c, u * c + i], [f, l] = [l, u * l + f], h === 0)
+        return new a(r ? -c : c, l);
       t = 1 / h;
     }
-    return new u(r ? -i : i, a);
+    return new a(r ? -i : i, f);
   }
   /**
    * reduction
    */
   #e() {
-    const { gcd: t } = j(this.#t, this.#n);
+    const { gcd: t } = _(this.#t, this.#n);
     t !== 0n && (this.#t /= t, this.#n /= t);
   }
   /**
@@ -314,14 +314,14 @@ class u {
    * @returns
    */
   minus() {
-    return new u(-this.#t, this.#n);
+    return new a(-this.#t, this.#n);
   }
   /**
    * returns inverse of this fraction
    * @returns
    */
   inverse() {
-    return new u(this.#n, this.#t);
+    return new a(this.#n, this.#t);
   }
   /**
    * returns `this + right`
@@ -330,7 +330,7 @@ class u {
    */
   add(t) {
     const e = this.#n * t.#n, r = this.#t * t.#n + t.#t * this.#n;
-    return new u(r, e);
+    return new a(r, e);
   }
   /**
    * returns `this - right`
@@ -347,7 +347,7 @@ class u {
    */
   multiply(t) {
     const e = this.#n * t.#n, r = this.#t * t.#t;
-    return new u(r, e);
+    return new a(r, e);
   }
   /**
    * returns `this / right`
@@ -365,7 +365,7 @@ class u {
    */
   mediant(t) {
     const e = this.#n + t.#n, r = this.#t + t.#t;
-    return new u(r, e);
+    return new a(r, e);
   }
   /**
    * returns `number` type decimal
@@ -397,7 +397,7 @@ class u {
    */
   static fromData(t) {
     const e = BigInt(t.value[0]), r = BigInt(t.value[1]);
-    return new u(e, r);
+    return new a(e, r);
   }
   /**
    * pases string whose form is `'numerator/denominator'`
@@ -408,152 +408,68 @@ class u {
     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)
+    const o = r.at(1), s = r.at(2);
+    if (!o || !s)
       throw Error("cannot parse");
-    return new u(BigInt(s), BigInt(o));
+    return new a(BigInt(o), BigInt(s));
   }
 }
-Object.defineProperty(u.prototype, Symbol.toStringTag, {
-  value: u.name
+Object.defineProperty(a.prototype, Symbol.toStringTag, {
+  value: a.name
 });
-const D = new TextEncoder(), q = new TextDecoder(), lt = (n, t) => {
-  switch (t) {
-    case "utf-8":
-      return D.encode(n);
-    case "base64":
-      return Uint8Array.from(atob(n), (e) => e.charCodeAt(0));
-    case "base64url": {
-      const e = n.length & 3;
-      return e > 0 && (n = n + "=".repeat(4 - e)), n = n.replaceAll("-", "+").replaceAll("_", "/"), Uint8Array.from(atob(n), (r) => r.charCodeAt(0));
-    }
-    case "hex": {
-      n.length & 1 && (n = "0" + n);
-      const r = n.matchAll(/.{2}/g);
-      return Uint8Array.from(r, (s) => Number.parseInt(s[0], 16));
-    }
-    case "oct": {
-      const e = n.length & 7;
-      e && (n = "0".repeat(8 - e) + n);
-      const r = n.matchAll(/.{8}/g), o = Array.from(r, (i) => {
-        const c = i[0];
-        return Number.parseInt(c, 8).toString(16).padStart(6, "0");
-      }).join("").matchAll(/.{2}/g);
-      return Uint8Array.from(
-        o,
-        (i) => Number.parseInt(i[0], 16)
-      );
-    }
-    case "bin": {
-      const e = n.length & 7;
-      e && (n = "0".repeat(8 - e) + n);
-      const r = n.matchAll(/.{8}/g), s = Array.from(r, (o) => Number.parseInt(o[0], 2));
-      return Uint8Array.from(s);
-    }
-    default:
-      throw Error(`Invalid encoding: ${t}`, { cause: t });
-  }
-}, ut = (n, t) => {
-  switch (t) {
-    case "utf-8":
-      return q.decode(n);
-    case "base64": {
-      const e = Array.from(n, (r) => String.fromCharCode(r)).join("");
-      return btoa(e);
-    }
-    case "base64url": {
-      const e = Array.from(n, (s) => String.fromCharCode(s)).join("");
-      return btoa(e).replaceAll("+", "-").replaceAll("/", "_").replace(/=+$/, "");
-    }
-    case "hex":
-      return Array.from(n, (r) => r.toString(16).padStart(2, "0")).join("").replace(/^0+/, "");
-    case "oct": {
-      let e = Array.from(
-        n,
-        (i) => i.toString(16).padStart(2, "0")
-      ).join("");
-      const r = e.length % 6;
-      r && (e = "0".repeat(6 - r) + e);
-      const s = e.matchAll(/.{6}/g);
-      return Array.from(
-        s,
-        (i) => Number.parseInt(i[0], 16).toString(8).padStart(8, "0")
-      ).join("").replace(/^0+/, "");
-    }
-    case "bin":
-      return Array.from(n, (r) => r.toString(2).padStart(8, "0")).join("").replace(/^0+/, "");
-    default:
-      throw Error(`Invalid encoding: ${t}`, { cause: t });
-  }
+const $ = (n) => {
+  const t = Array.from(n, (e) => String.fromCharCode(e));
+  return btoa(t.join(""));
+}, D = (n) => {
+  const t = atob(n);
+  return Uint8Array.from(t, (e) => e.charCodeAt(0));
+}, lt = (n) => $(n).replaceAll("+", "-").replaceAll("/", "_").replace(/=+$/, ""), at = (n) => {
+  const t = n.length & 3;
+  t > 0 && (n = n + "=".repeat(4 - t));
+  const e = n.replaceAll("-", "+").replaceAll("_", "/");
+  return D(e);
+}, ut = (n) => {
+  let t = Array.from(n, (s) => s.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,
+    (s) => Number.parseInt(s[0], 16).toString(8).padStart(8, "0")
+  ).join("").replace(/^0+/, "");
+}, ht = (n) => {
+  const t = n.length & 7;
+  t && (n = "0".repeat(8 - t) + n);
+  const e = n.matchAll(/.{8}/g), o = Array.from(e, (s) => {
+    const i = s[0];
+    return Number.parseInt(i, 8).toString(16).padStart(6, "0");
+  }).join("").matchAll(/.{2}/g);
+  return Uint8Array.from(o, (s) => Number.parseInt(s[0], 16));
 }, 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;
-}, ft = (n) => {
+  const e = n.toString(2).length, r = n === 1n << BigInt(e - 1) && !(e % 7) && t, o = Math.floor(e / 7) + 1;
+  return r ? o - 1 : o;
+}, dt = (n) => {
   const t = K(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;
+  for (let o = 0; o < t - 1; ++o) {
+    const s = Number(n & 127n) | 128;
+    e[o] = s, n >>= 7n;
   }
   const r = Number(n & 127n);
   return e[t - 1] = r, n >>= 7n, e;
-}, ht = (n) => {
+}, 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);
+    const o = BigInt(n[r] & 127);
+    e += o << BigInt(7 * r);
   }
   return BigInt.asIntN(7 * t, e);
 };
-class S {
-  #t;
-  #n;
-  static name = "Queue";
-  /**
-   * Queue
-   * @param data
-   */
-  constructor(...t) {
-    this.#t = t, this.#n = [];
-  }
-  /**
-   * enqueue data
-   * @param data
-   * @returns current queue length
-   */
-  enqueue(...t) {
-    return this.#t.push(...t), this.#t.length + this.#n.length;
-  }
-  /**
-   * dequeue data
-   * @returns data in the head
-   */
-  dequeue() {
-    if (this.#n.length === 0)
-      for (; this.#t.length > 0; ) {
-        const t = this.#t.pop();
-        this.#n.push(t);
-      }
-    return this.#n.pop();
-  }
-  toArray() {
-    return this.#n.slice().reverse().concat(this.#t);
-  }
-  toJSON() {
-    return this.toArray();
-  }
-  toString() {
-    return this.toArray().toString();
-  }
-}
-Object.defineProperty(S.prototype, Symbol.toStringTag, {
-  value: S.name
-});
-class E extends Error {
+class U extends Error {
   name;
   static name = "NamedError";
   constructor(t, e, r) {
@@ -561,34 +477,34 @@ class E extends Error {
   }
   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;
-    })(), { name: e, message: r, stack: s } = this;
+      const s = this.cause;
+      return typeof s == "string" || typeof s == "number" || typeof s == "boolean" ? s : typeof s == "bigint" ? s.toString() : typeof s == "object" && s !== null ? s instanceof Set || s instanceof Map ? Object.fromEntries(s) : s : void 0;
+    })(), { name: e, message: r, stack: o } = this;
     return {
       name: e,
       message: r,
-      stack: s,
+      stack: o,
       cause: t
     };
   }
 }
-Object.defineProperty(E.prototype, Symbol.toStringTag, {
-  value: E.name
+Object.defineProperty(U.prototype, Symbol.toStringTag, {
+  value: U.name
 });
-const B = (n) => {
+const E = (n) => {
   if (n === 0) return 32;
   let t = 0;
   for (; n > 0 && !(n & 1); )
     ++t, n >>>= 1;
   return t;
-}, x = (n) => {
+}, S = (n) => {
   if (n === 0n) return 64n;
   let t = 0n;
   for (; n > 0n && !(n & 1n); )
     ++t, n >>= 1n;
   return BigInt.asUintN(64, t);
 };
-class N {
+class R {
   #t;
   static name = "FloatRng";
   constructor(t) {
@@ -600,18 +516,18 @@ class N {
         case 32:
           return this.#t.getU32Rand() >>> 0;
         case 64: {
-          const f = this.#t.getU64Rand() & 0xffffffffn;
-          return Number(f);
+          const u = this.#t.getU64Rand() & 0xffffffffn;
+          return Number(u);
         }
       }
-    })(), s = r & 255;
-    let o = 126;
-    if (s === 0) {
-      o -= 8;
-      const f = 1e5;
+    })(), o = r & 255;
+    let s = 126;
+    if (o === 0) {
+      s -= 8;
+      const u = 1e5;
       let h = 0;
       t: for (; ; ) {
-        if (h > f)
+        if (h > u)
           throw Error("loop exceeded limit");
         const d = (() => {
           switch (this.#t.bits) {
@@ -624,24 +540,24 @@ class N {
           }
         })();
         if (d === 0) {
-          if (o -= 32, o < 0) {
-            o = 0;
+          if (s -= 32, s < 0) {
+            s = 0;
             break t;
           }
         } else {
-          o -= B(d);
+          s -= E(d);
           break t;
         }
         ++h;
       }
     } else
-      o -= B(s);
+      s -= E(o);
     const i = r >>> 8 & 8388607;
-    i === 0 && r >>> 31 && ++o;
-    const { buffer: c, byteOffset: a, length: l } = Uint32Array.from([
-      o << 23 | i
+    i === 0 && r >>> 31 && ++s;
+    const { buffer: c, byteOffset: f, length: l } = Uint32Array.from([
+      s << 23 | i
     ]);
-    return new Float32Array(c, a, l)[0];
+    return new Float32Array(c, f, l)[0];
   }
   /**
    * returns a random single-precision floating-point number (float32) in the range of [0.0, 1.0)
@@ -659,50 +575,50 @@ class N {
     const t = 0n, e = 1023n, r = (() => {
       switch (this.#t.bits) {
         case 32: {
-          const f = BigInt(this.#t.getU32Rand() >>> 0), h = BigInt(this.#t.getU32Rand() >>> 0);
-          return f << 32n | h;
+          const u = BigInt(this.#t.getU32Rand() >>> 0), h = BigInt(this.#t.getU32Rand() >>> 0);
+          return u << 32n | h;
         }
         case 64:
           return BigInt.asUintN(64, this.#t.getU64Rand());
       }
-    })(), s = r & 0x7ffn;
-    let o = e - 1n;
-    if (s === 0n) {
-      o -= 11n;
-      const f = 1e5;
+    })(), o = r & 0x7ffn;
+    let s = e - 1n;
+    if (o === 0n) {
+      s -= 11n;
+      const u = 1e5;
       let h = 0;
       t: for (; ; ) {
-        if (h > f)
+        if (h > u)
           throw Error("loop exceeded limit");
         const d = (() => {
           switch (this.#t.bits) {
             case 32: {
-              const y = BigInt(this.#t.getU32Rand() >>> 0), T = BigInt(this.#t.getU32Rand() >>> 0);
-              return y << 32n | T;
+              const y = BigInt(this.#t.getU32Rand() >>> 0), M = BigInt(this.#t.getU32Rand() >>> 0);
+              return y << 32n | M;
             }
             case 64:
               return BigInt.asUintN(64, this.#t.getU64Rand());
           }
         })();
         if (d === 0n) {
-          if (o -= 64n, o < t) {
-            o = t;
+          if (s -= 64n, s < t) {
+            s = t;
             break t;
           }
         } else {
-          o -= x(d);
+          s -= S(d);
           break t;
         }
         ++h;
       }
     } else
-      o -= x(s);
+      s -= S(o);
     const i = BigInt.asUintN(52, r >> 11n);
-    i === 0n && r >> 63n && ++o;
-    const { buffer: c, byteOffset: a, length: l } = BigUint64Array.from([
-      o << 52n | i
+    i === 0n && r >> 63n && ++s;
+    const { buffer: c, byteOffset: f, length: l } = BigUint64Array.from([
+      s << 52n | i
     ]);
-    return new Float64Array(c, a, l)[0];
+    return new Float64Array(c, f, l)[0];
   }
   /**
    * returns a random double-precision floating-point number (float64) in the range of [0.0, 1.0)
@@ -717,11 +633,11 @@ class N {
     throw Error("exceeded loop limit");
   }
 }
-Object.defineProperty(N.prototype, Symbol.toStringTag, {
-  value: N.name
+Object.defineProperty(R.prototype, Symbol.toStringTag, {
+  value: R.name
 });
-const z = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn], J = 0x5851f42d4c957f2dn;
-class R {
+const q = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn], G = 0x5851f42d4c957f2dn;
+class N {
   /**
    * length = 2, `[state, increment]`
    */
@@ -742,16 +658,16 @@ class R {
    * 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(z);
+    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(q);
   }
   /** step inner state */
   #n() {
-    this.#t[0] = this.#t[0] * J + this.#t[1];
+    this.#t[0] = this.#t[0] * G + 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 C(r, e);
+    return P(r, e);
   }
   /**
    *
@@ -767,8 +683,8 @@ class R {
     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 r = 4294967296 % t, o = 1e5;
+    for (let s = 0; s < o; ++s) {
       const i = this.getU32Rand();
       if (i >= r)
         return i % t;
@@ -790,16 +706,16 @@ class R {
       yield typeof e == "number" ? this.getBoundedU32Rand(e) : this.getU32Rand();
   }
 }
-Object.defineProperty(R.prototype, Symbol.toStringTag, {
-  value: R.name
+Object.defineProperty(N.prototype, Symbol.toStringTag, {
+  value: N.name
 });
-const G = [
+const z = [
   0xbe562cb412e2260en,
   0x2e4284137d641affn,
   0x4e19b36ee933e27en,
   0x7581cf8c4f4d4f7dn
 ];
-class A {
+class x {
   bits = 64;
   #t;
   static name = "XoshiroMinimal";
@@ -814,17 +730,18 @@ class A {
    *
    * // you should construct with random seeds.
    * const seed = crypto.getRandomValues(new BigUint64Array(4));
-   * const betterRng = new PCGMinimal(seed);
+   * 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(G);
+    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(z);
   }
   #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] = I(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] = b(this.#t[3], 45n);
   }
   get value() {
-    return I(this.#t[0] + this.#t[3], 23n) + this.#t[0];
+    const t = b(this.#t[0] + this.#t[3], 23n) + this.#t[0];
+    return BigInt.asUintN(64, t);
   }
   getU64Rand() {
     const t = this.value;
@@ -840,8 +757,8 @@ class A {
       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 r = e % t, o = 1e5;
+    for (let s = 0; s < o; ++s) {
       const i = this.getU64Rand();
       if (i >= r)
         return i % t;
@@ -869,44 +786,48 @@ class A {
       yield e === void 0 ? this.getU32Rand() : this.getBoundedU32Rand(e);
   }
 }
-Object.defineProperty(A.prototype, Symbol.toStringTag, {
-  value: A.name
+Object.defineProperty(x.prototype, Symbol.toStringTag, {
+  value: x.name
 });
 export {
-  N as FloatRng,
-  E as NamedError,
-  R as PCGMinimal,
-  S as Queue,
-  u as Rational,
-  A as XoshiroMinimal,
-  M as bailliePSW,
+  R as FloatRng,
+  U as NamedError,
+  N as PCGMinimal,
+  a as Rational,
+  x as XoshiroMinimal,
+  T as bailliePSW,
   rt as compress,
-  ht as decodeLEB128,
+  gt as decodeLEB128,
   et as decodeRFC3986URIComponent,
   st as decompress,
-  ft as encodeLEB128,
+  dt as encodeLEB128,
   nt as encodeRFC3986URIComponent,
-  j as exEuclidean,
+  _ as exEuclidean,
   it as factorial,
-  lt as fromString,
+  D as fromBase64,
+  at as fromBase64Url,
+  ht as fromOct,
   Q as getHash,
-  v as getRandBIByBitLength,
-  L as getRandBIByRange,
-  at as getRandPrimeByBitLength,
+  A as getRandBIByBitLength,
+  v as getRandBIByRange,
+  ft as getRandPrimeByBitLength,
   ct as getRandPrimeByRange,
   ot as getRndInt,
+  W as getStringTag,
   g as isDeepStrictEqual,
   tt as isNode,
   O as isSquare,
-  U as jacobiSymbol,
-  H as lazify,
-  m as modPow,
+  B as jacobiSymbol,
+  Y as lazify,
+  p as modPow,
   Z as parseCSV,
-  X as promiseWithResolvers,
-  p as residue,
-  C as rot32,
-  I as rot64,
-  W as sameValueZero,
-  Y as sleep,
-  ut as toString
+  H as promiseWithResolvers,
+  m as residue,
+  P as rot32,
+  b as rot64,
+  X as sameValueZero,
+  J as sleep,
+  $ as toBase64,
+  lt as toBase64Url,
+  ut as toOct
 };

package/dist/bundle.min.js

@@ -1,2 +1,2 @@
-(function(c,y){typeof exports=="object"&&typeof module<"u"?y(exports):typeof define=="function"&&define.amd?define(["exports"],y):(c=typeof globalThis<"u"?globalThis:c||self,y(c.UtilFns={}))})(this,(function(c){"use strict";const y=new TextEncoder,O=(n,t)=>[n].includes(t),m=(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 i=0;i<n.length;i++)if(!m(n[i],t[i]))return!1;return!0}if(n instanceof Set&&t instanceof Set){const i=[...n.values()],s=[...t.values()];return!!m(i,s)}if(n instanceof Map&&t instanceof Map){const i=[...n.keys()],s=[...t.keys()];if(!m(i,s))return!1;const o=[...n.values()],a=[...t.values()];return!!m(o,a)}if(e==="[object Object]"){const i=n,s=t,o=Object.keys(i),a=Object.keys(s);for(const l of o){const u=a.find(g=>g===l);if(u===void 0)return!1;const[h,d]=[i[l],s[u]];if(!m(h,d))return!1}return!0}throw Error(`comparing these objects is unavailable: ${n}, ${t}`,{cause:[n,t]})},x=()=>{let n,t;return{promise:new Promise((r,i)=>{n=r,t=i}),resolve:n,reject:t}},V=n=>new Promise(t=>{setTimeout(()=>t(),n)}),$=n=>(...t)=>()=>n(...t),k=n=>{const t=[];let e=[],r="",i=!1;for(let s=0;s<n.length;s++){const o=n[s];o==='"'&&(s===0||n[s-1]!=="\\")?i=!i:o===","&&!i?(e.push(r.trim()),r=""):o===`
-`&&!i?(e.push(r.trim()),t.push(e),e=[],r=""):r+=o}return e.push(r.trim()),t.push(e),t},D=async(n,t)=>{const e=y.encode(n),r=await crypto.subtle.digest(t,e);return new Uint8Array(r)},q=()=>!!globalThis.process&&typeof process.version<"u"&&typeof process.versions.node<"u",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)},W=async(n,t)=>{const r=new Blob([n]).stream().pipeThrough(new CompressionStream(t));return new Response(r).bytes()},G=async(n,t)=>{const r=new Blob([n]).stream().pipeThrough(new DecompressionStream(t));return new Response(r).bytes()},J=(n,t)=>Math.floor(Math.random()*(t-n)+n),p=(n,t)=>{t<0n&&(t*=-1n);const e=n%t;return e<0n?e+t:e},w=(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 i=Array.from(r,s=>s.toString(2).padStart(8,"0")).join("").slice(0,n);return t&&(i=i.replace(/^\d/,"1")),BigInt("0b"+i)},T=(n,t)=>{if(n>=t)throw Error("rangeError");const e=t-n,r=e.toString(2).length,i=(()=>{for(let o=0;o<1e5;o++){const a=w(r);if(a>=b(2n,BigInt(r),e))return a%e}throw Error("Failed to generate a random bigint")})();return n+i},b=(n,t,e)=>{if(e<1n)throw Error("`mod` must be positive");if(t<0n)throw Error("`power` must not be negative");if(n=p(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},j=(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,i]=[1n,0n,n],[s,o,a]=[0n,-1n,t];for(;;){const l=i/a,u=i-l*a;if(u===0n)break;[e,s]=[s,e-l*s],[r,o]=[o,r-l*o],[i,a]=[a,u]}return a<0n&&(s*=-1n,o*=-1n,a*=-1n),{x:s,y:o,gcd:a}},I=(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 i=n+r|1n,s=I(n,i),o=I(i,t);return s*o},X=n=>{let t=3n,e=1n,r=1n;const i=BigInt(n.toString(2).length)-1n;for(let s=i-1n;s>-1n;--s){const o=(n>>s)+1n|1n;r*=I(t,o),t=o,e*=r}return e},H=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},_=(n,t)=>(n>>>(t&31)|n<<(-t&31))>>>0,S=(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},P=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**2n<n?t=r:e=r}return n===t**2n||n===(t+1n)**2n},Y=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,i]=[t,e];let o=b(2n,r,n);if(o===1n)return!0;for(let a=0n;a<i;a++){if(o===n-1n)return!0;o=o*o%n}return!1},Z=n=>{let t=5n,e=B(t,n);for(;e>0n;){if(t=t>0n?t+2n:t-2n,t*=-1n,t===-15n&&P(n))return[0n,0n];e=B(t,n)}return[t,e]},U=(n,t)=>(n&1n)===1n?p(n+t>>1n,t):p(n>>1n,t),Q=(n,t,e,r)=>{let i=1n,s=e;const o=n.toString(2).slice(1);for(const a of o)[i,s]=[p(i*s,t),U(s*s+r*i*i,t)],a==="1"&&([i,s]=[U(e*i+s,t),U(r*i+e*s,t)]);return[i,s]},tt=(n,t,e,r)=>{if(n%2n!==1n)throw Error("`n` must be odd");let i=n+1n,s=0n;for(;i%2n===0n;)i>>=1n,s+=1n;const[o,a]=Q(i,n,e,t);let l=a;if(o===0n)return!0;r=b(r,i,n);for(let u=0n;u<s;u++){if(l===0n)return!0;l=p(l*l-2n*r,n),r=b(r,2n,n)}return!1},E=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 s of t)if(n%s===0n)return n===s;if(!Y(n))return!1;const[e,r]=Z(n);if(r===0n)return!1;const i=(1n-e)/4n;return tt(n,e,1n,i)},nt=(n,t)=>{if(t<2n)throw Error("noPrimesFound");for(let r=0;r<1e5;r++){const i=T(n,t);if(E(i))return i}throw Error("noPrimesFound")},et=(n,t=!1)=>{if(n<2)throw Error("noPrimesFound");for(let r=0;r<1e5;r++){const i=w(n,t);if(E(i))return i}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 i=BigInt(Math.floor(t)),s=t-Number(i);if(s===0)return new f(r?-i:i,1n);t=1/s;let[o,a]=[1n,i],[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}=j(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 i=r.at(1),s=r.at(2);if(!i||!s)throw Error("cannot parse");return new f(BigInt(i),BigInt(s))}}Object.defineProperty(f.prototype,Symbol.toStringTag,{value:f.name});const rt=new TextEncoder,it=new TextDecoder,st=(n,t)=>{switch(t){case"utf-8":return rt.encode(n);case"base64":return Uint8Array.from(atob(n),e=>e.charCodeAt(0));case"base64url":{const e=n.length&3;return e>0&&(n=n+"=".repeat(4-e)),n=n.replaceAll("-","+").replaceAll("_","/"),Uint8Array.from(atob(n),r=>r.charCodeAt(0))}case"hex":{n.length&1&&(n="0"+n);const r=n.matchAll(/.{2}/g);return Uint8Array.from(r,i=>Number.parseInt(i[0],16))}case"oct":{const e=n.length&7;e&&(n="0".repeat(8-e)+n);const r=n.matchAll(/.{8}/g),s=Array.from(r,o=>{const a=o[0];return Number.parseInt(a,8).toString(16).padStart(6,"0")}).join("").matchAll(/.{2}/g);return Uint8Array.from(s,o=>Number.parseInt(o[0],16))}case"bin":{const e=n.length&7;e&&(n="0".repeat(8-e)+n);const r=n.matchAll(/.{8}/g),i=Array.from(r,s=>Number.parseInt(s[0],2));return Uint8Array.from(i)}default:throw Error(`Invalid encoding: ${t}`,{cause:t})}},ot=(n,t)=>{switch(t){case"utf-8":return it.decode(n);case"base64":{const e=Array.from(n,r=>String.fromCharCode(r)).join("");return btoa(e)}case"base64url":{const e=Array.from(n,i=>String.fromCharCode(i)).join("");return btoa(e).replaceAll("+","-").replaceAll("/","_").replace(/=+$/,"")}case"hex":return Array.from(n,r=>r.toString(16).padStart(2,"0")).join("").replace(/^0+/,"");case"oct":{let e=Array.from(n,o=>o.toString(16).padStart(2,"0")).join("");const r=e.length%6;r&&(e="0".repeat(6-r)+e);const i=e.matchAll(/.{6}/g);return Array.from(i,o=>Number.parseInt(o[0],16).toString(8).padStart(8,"0")).join("").replace(/^0+/,"")}case"bin":return Array.from(n,r=>r.toString(2).padStart(8,"0")).join("").replace(/^0+/,"");default:throw Error(`Invalid encoding: ${t}`,{cause:t})}},ct=n=>{const t=n<0n;t&&(n*=-1n);const e=n.toString(2).length,r=n===1n<<BigInt(e-1)&&!(e%7)&&t,i=Math.floor(e/7)+1;return r?i-1:i},at=n=>{const t=ct(n);n=BigInt.asUintN(t*7,n);const e=new Uint8Array(t);for(let i=0;i<t-1;++i){const s=Number(n&127n)|128;e[i]=s,n>>=7n}const r=Number(n&127n);return e[t-1]=r,n>>=7n,e},lt=n=>{const t=n.length;let e=0n;for(let r=0;r<t;++r){const i=BigInt(n[r]&127);e+=i<<BigInt(7*r)}return BigInt.asIntN(7*t,e)};class R{#t;#n;static name="Queue";constructor(...t){this.#t=t,this.#n=[]}enqueue(...t){return this.#t.push(...t),this.#t.length+this.#n.length}dequeue(){if(this.#n.length===0)for(;this.#t.length>0;){const t=this.#t.pop();this.#n.push(t)}return this.#n.pop()}toArray(){return this.#n.slice().reverse().concat(this.#t)}toJSON(){return this.toArray()}toString(){return this.toArray().toString()}}Object.defineProperty(R.prototype,Symbol.toStringTag,{value:R.name});class N extends Error{name;static name="NamedError";constructor(t,e,r){super(e,{cause:r}),this.name=t}toJSON(){const t=(()=>{const s=this.cause;return typeof s=="string"||typeof s=="number"||typeof s=="boolean"?s:typeof s=="bigint"?s.toString():typeof s=="object"&&s!==null?s instanceof Set||s instanceof Map?Object.fromEntries(s):s:void 0})(),{name:e,message:r,stack:i}=this;return{name:e,message:r,stack:i,cause:t}}}Object.defineProperty(N.prototype,Symbol.toStringTag,{value:N.name});const C=n=>{if(n===0)return 32;let t=0;for(;n>0&&!(n&1);)++t,n>>>=1;return t},F=n=>{if(n===0n)return 64n;let t=0n;for(;n>0n&&!(n&1n);)++t,n>>=1n;return BigInt.asUintN(64,t)};class A{#t;static name="FloatRng";constructor(t){this.#t=t}#n(){const r=(()=>{switch(this.#t.bits){case 32:return this.#t.getU32Rand()>>>0;case 64:{const h=this.#t.getU64Rand()&0xffffffffn;return Number(h)}}})(),i=r&255;let s=126;if(i===0){s-=8;const h=1e5;let d=0;t:for(;;){if(d>h)throw Error("loop exceeded limit");const g=(()=>{switch(this.#t.bits){case 32:return this.#t.getU32Rand()>>>0;case 64:{const L=BigInt.asUintN(32,this.#t.getU64Rand());return Number(L)}}})();if(g===0){if(s-=32,s<0){s=0;break t}}else{s-=C(g);break t}++d}}else s-=C(i);const o=r>>>8&8388607;o===0&&r>>>31&&++s;const{buffer:a,byteOffset:l,length:u}=Uint32Array.from([s<<23|o]);return new Float32Array(a,l,u)[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 h=BigInt(this.#t.getU32Rand()>>>0),d=BigInt(this.#t.getU32Rand()>>>0);return h<<32n|d}case 64:return BigInt.asUintN(64,this.#t.getU64Rand())}})(),i=r&0x7ffn;let s=e-1n;if(i===0n){s-=11n;const h=1e5;let d=0;t:for(;;){if(d>h)throw Error("loop exceeded limit");const g=(()=>{switch(this.#t.bits){case 32:{const L=BigInt(this.#t.getU32Rand()>>>0),dt=BigInt(this.#t.getU32Rand()>>>0);return L<<32n|dt}case 64:return BigInt.asUintN(64,this.#t.getU64Rand())}})();if(g===0n){if(s-=64n,s<t){s=t;break t}}else{s-=F(g);break t}++d}}else s-=F(i);const o=BigInt.asUintN(52,r>>11n);o===0n&&r>>63n&&++s;const{buffer:a,byteOffset:l,length:u}=BigUint64Array.from([s<<52n|o]);return new Float64Array(a,l,u)[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(A.prototype,Symbol.toStringTag,{value:A.name});const ut=[0x853c49e6748fea9bn,0xda3e39cb94b95bdbn],ft=0x5851f42d4c957f2dn;class v{#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(ut)}#n(){this.#t[0]=this.#t[0]*ft+this.#t[1]}get#e(){const t=this.#t[0],e=Number(t>>59n),r=Number(BigInt.asUintN(32,(t^t>>18n)>>27n));return _(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,i=1e5;for(let s=0;s<i;++s){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(v.prototype,Symbol.toStringTag,{value:v.name});const ht=[0xbe562cb412e2260en,0x2e4284137d641affn,0x4e19b36ee933e27en,0x7581cf8c4f4d4f7dn];class M{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(ht)}#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]=S(this.#t[3],45n)}get value(){return S(this.#t[0]+this.#t[3],23n)+this.#t[0]}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,i=1e5;for(let s=0;s<i;++s){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(M.prototype,Symbol.toStringTag,{value:M.name}),c.FloatRng=A,c.NamedError=N,c.PCGMinimal=v,c.Queue=R,c.Rational=f,c.XoshiroMinimal=M,c.bailliePSW=E,c.compress=W,c.decodeLEB128=lt,c.decodeRFC3986URIComponent=z,c.decompress=G,c.encodeLEB128=at,c.encodeRFC3986URIComponent=K,c.exEuclidean=j,c.factorial=H,c.fromString=st,c.getHash=D,c.getRandBIByBitLength=w,c.getRandBIByRange=T,c.getRandPrimeByBitLength=et,c.getRandPrimeByRange=nt,c.getRndInt=J,c.isDeepStrictEqual=m,c.isNode=q,c.isSquare=P,c.jacobiSymbol=B,c.lazify=$,c.modPow=b,c.parseCSV=k,c.promiseWithResolvers=x,c.residue=p,c.rot32=_,c.rot64=S,c.sameValueZero=O,c.sleep=V,c.toString=ot,Object.defineProperty(c,Symbol.toStringTag,{value:"Module"})}));
+var UtilFns=(function(c){"use strict";const F=new TextEncoder,V=(n,t)=>[n].includes(t),m=(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 i=0;i<n.length;i++)if(!m(n[i],t[i]))return!1;return!0}if(n instanceof Set&&t instanceof Set){const i=[...n.values()],s=[...t.values()];return!!m(i,s)}if(n instanceof Map&&t instanceof Map){const i=[...n.keys()],s=[...t.keys()];if(!m(i,s))return!1;const o=[...n.values()],a=[...t.values()];return!!m(o,a)}if(e==="[object Object]"){const i=n,s=t,o=Object.keys(i),a=Object.keys(s);for(const l of o){const f=a.find(g=>g===l);if(f===void 0)return!1;const[h,d]=[i[l],s[f]];if(!m(h,d))return!1}return!0}throw Error(`comparing these objects is unavailable: ${n}, ${t}`,{cause:[n,t]})},k=()=>{let n,t;return{promise:new Promise((r,i)=>{n=r,t=i}),resolve:n,reject:t}},$=n=>new Promise(t=>{setTimeout(()=>t(),n)}),D=n=>Object.prototype.toString.call(n).match(/^\[Object\s(.+)\]$/)?.at(1),q=n=>(...t)=>()=>n(...t),K=n=>{const t=[];let e=[],r="",i=!1;for(let s=0;s<n.length;s++){const o=n[s];o==='"'&&(s===0||n[s-1]!=="\\")?i=!i:o===","&&!i?(e.push(r.trim()),r=""):o===`
+`&&!i?(e.push(r.trim()),t.push(e),e=[],r=""):r+=o}return e.push(r.trim()),t.push(e),t},G=async(n,t)=>{const e=F.encode(n),r=await crypto.subtle.digest(t,e);return new Uint8Array(r)},z=()=>!!globalThis.process&&typeof process.version<"u"&&typeof process.versions.node<"u",W=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)},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)=>Math.floor(Math.random()*(t-n)+n),y=(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 i=Array.from(r,s=>s.toString(2).padStart(8,"0")).join("").slice(0,n);return t&&(i=i.replace(/^\d/,"1")),BigInt("0b"+i)},T=(n,t)=>{if(n>=t)throw Error("rangeError");const e=t-n,r=e.toString(2).length,i=(()=>{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+i},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=y(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},A=(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,i]=[1n,0n,n],[s,o,a]=[0n,-1n,t];for(;;){const l=i/a,f=i-l*a;if(f===0n)break;[e,s]=[s,e-l*s],[r,o]=[o,r-l*o],[i,a]=[a,f]}return a<0n&&(s*=-1n,o*=-1n,a*=-1n),{x:s,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 i=n+r|1n,s=w(n,i),o=w(i,t);return s*o},Z=n=>{let t=3n,e=1n,r=1n;const i=BigInt(n.toString(2).length)-1n;for(let s=i-1n;s>-1n;--s){const o=(n>>s)+1n|1n;r*=w(t,o),t=o,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 Z(n)<<t},v=(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},P=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**2n<n?t=r:e=r}return n===t**2n||n===(t+1n)**2n},Q=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,i]=[t,e];let o=p(2n,r,n);if(o===1n)return!0;for(let a=0n;a<i;a++){if(o===n-1n)return!0;o=o*o%n}return!1},tt=n=>{let t=5n,e=B(t,n);for(;e>0n;){if(t=t>0n?t+2n:t-2n,t*=-1n,t===-15n&&P(n))return[0n,0n];e=B(t,n)}return[t,e]},U=(n,t)=>(n&1n)===1n?y(n+t>>1n,t):y(n>>1n,t),nt=(n,t,e,r)=>{let i=1n,s=e;const o=n.toString(2).slice(1);for(const a of o)[i,s]=[y(i*s,t),U(s*s+r*i*i,t)],a==="1"&&([i,s]=[U(e*i+s,t),U(r*i+e*s,t)]);return[i,s]},et=(n,t,e,r)=>{if(n%2n!==1n)throw Error("`n` must be odd");let i=n+1n,s=0n;for(;i%2n===0n;)i>>=1n,s+=1n;const[o,a]=nt(i,n,e,t);let l=a;if(o===0n)return!0;r=p(r,i,n);for(let f=0n;f<s;f++){if(l===0n)return!0;l=y(l*l-2n*r,n),r=p(r,2n,n)}return!1},E=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 s of t)if(n%s===0n)return n===s;if(!Q(n))return!1;const[e,r]=tt(n);if(r===0n)return!1;const i=(1n-e)/4n;return et(n,e,1n,i)},rt=(n,t)=>{if(t<2n)throw Error("noPrimesFound");for(let r=0;r<1e5;r++){const i=T(n,t);if(E(i))return i}throw Error("noPrimesFound")},st=(n,t=!1)=>{if(n<2)throw Error("noPrimesFound");for(let r=0;r<1e5;r++){const i=I(n,t);if(E(i))return i}throw Error("noPrimesFound")};class u{#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 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 i=BigInt(Math.floor(t)),s=t-Number(i);if(s===0)return new u(r?-i:i,1n);t=1/s;let[o,a]=[1n,i],[l,f]=[0n,1n];for(;`${f}`.length<e+1;){const h=BigInt(Math.floor(t)),d=t-Number(h);if([o,a]=[a,h*a+o],[l,f]=[f,h*f+l],d===0)return new u(r?-a:a,f);t=1/d}return new u(r?-o:o,l)}#e(){const{gcd:t}=A(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 i=r.at(1),s=r.at(2);if(!i||!s)throw Error("cannot parse");return new u(BigInt(i),BigInt(s))}}Object.defineProperty(u.prototype,Symbol.toStringTag,{value:u.name});const j=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))},it=n=>j(n).replaceAll("+","-").replaceAll("/","_").replace(/=+$/,""),ot=n=>{const t=n.length&3;t>0&&(n=n+"=".repeat(4-t));const e=n.replaceAll("-","+").replaceAll("_","/");return C(e)},ct=n=>{let t=Array.from(n,s=>s.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,s=>Number.parseInt(s[0],16).toString(8).padStart(8,"0")).join("").replace(/^0+/,"")},at=n=>{const t=n.length&7;t&&(n="0".repeat(8-t)+n);const e=n.matchAll(/.{8}/g),i=Array.from(e,s=>{const o=s[0];return Number.parseInt(o,8).toString(16).padStart(6,"0")}).join("").matchAll(/.{2}/g);return Uint8Array.from(i,s=>Number.parseInt(s[0],16))},lt=n=>{const t=n<0n;t&&(n*=-1n);const e=n.toString(2).length,r=n===1n<<BigInt(e-1)&&!(e%7)&&t,i=Math.floor(e/7)+1;return r?i-1:i},ft=n=>{const t=lt(n);n=BigInt.asUintN(t*7,n);const e=new Uint8Array(t);for(let i=0;i<t-1;++i){const s=Number(n&127n)|128;e[i]=s,n>>=7n}const r=Number(n&127n);return e[t-1]=r,n>>=7n,e},ut=n=>{const t=n.length;let e=0n;for(let r=0;r<t;++r){const i=BigInt(n[r]&127);e+=i<<BigInt(7*r)}return BigInt.asIntN(7*t,e)};class S extends Error{name;static name="NamedError";constructor(t,e,r){super(e,{cause:r}),this.name=t}toJSON(){const t=(()=>{const s=this.cause;return typeof s=="string"||typeof s=="number"||typeof s=="boolean"?s:typeof s=="bigint"?s.toString():typeof s=="object"&&s!==null?s instanceof Set||s instanceof Map?Object.fromEntries(s):s:void 0})(),{name:e,message:r,stack:i}=this;return{name:e,message:r,stack:i,cause:t}}}Object.defineProperty(S.prototype,Symbol.toStringTag,{value:S.name});const O=n=>{if(n===0)return 32;let t=0;for(;n>0&&!(n&1);)++t,n>>>=1;return t},_=n=>{if(n===0n)return 64n;let t=0n;for(;n>0n&&!(n&1n);)++t,n>>=1n;return BigInt.asUintN(64,t)};class R{#t;static name="FloatRng";constructor(t){this.#t=t}#n(){const r=(()=>{switch(this.#t.bits){case 32:return this.#t.getU32Rand()>>>0;case 64:{const h=this.#t.getU64Rand()&0xffffffffn;return Number(h)}}})(),i=r&255;let s=126;if(i===0){s-=8;const h=1e5;let d=0;t:for(;;){if(d>h)throw Error("loop exceeded limit");const g=(()=>{switch(this.#t.bits){case 32:return this.#t.getU32Rand()>>>0;case 64:{const M=BigInt.asUintN(32,this.#t.getU64Rand());return Number(M)}}})();if(g===0){if(s-=32,s<0){s=0;break t}}else{s-=O(g);break t}++d}}else s-=O(i);const o=r>>>8&8388607;o===0&&r>>>31&&++s;const{buffer:a,byteOffset:l,length:f}=Uint32Array.from([s<<23|o]);return new Float32Array(a,l,f)[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 h=BigInt(this.#t.getU32Rand()>>>0),d=BigInt(this.#t.getU32Rand()>>>0);return h<<32n|d}case 64:return BigInt.asUintN(64,this.#t.getU64Rand())}})(),i=r&0x7ffn;let s=e-1n;if(i===0n){s-=11n;const h=1e5;let d=0;t:for(;;){if(d>h)throw Error("loop exceeded limit");const g=(()=>{switch(this.#t.bits){case 32:{const M=BigInt(this.#t.getU32Rand()>>>0),mt=BigInt(this.#t.getU32Rand()>>>0);return M<<32n|mt}case 64:return BigInt.asUintN(64,this.#t.getU64Rand())}})();if(g===0n){if(s-=64n,s<t){s=t;break t}}else{s-=_(g);break t}++d}}else s-=_(i);const o=BigInt.asUintN(52,r>>11n);o===0n&&r>>63n&&++s;const{buffer:a,byteOffset:l,length:f}=BigUint64Array.from([s<<52n|o]);return new Float64Array(a,l,f)[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(R.prototype,Symbol.toStringTag,{value:R.name});const ht=[0x853c49e6748fea9bn,0xda3e39cb94b95bdbn],dt=0x5851f42d4c957f2dn;class N{#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(ht)}#n(){this.#t[0]=this.#t[0]*dt+this.#t[1]}get#e(){const t=this.#t[0],e=Number(t>>59n),r=Number(BigInt.asUintN(32,(t^t>>18n)>>27n));return v(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,i=1e5;for(let s=0;s<i;++s){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(N.prototype,Symbol.toStringTag,{value:N.name});const gt=[0xbe562cb412e2260en,0x2e4284137d641affn,0x4e19b36ee933e27en,0x7581cf8c4f4d4f7dn];class L{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(gt)}#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,i=1e5;for(let s=0;s<i;++s){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)}}return Object.defineProperty(L.prototype,Symbol.toStringTag,{value:L.name}),c.FloatRng=R,c.NamedError=S,c.PCGMinimal=N,c.Rational=u,c.XoshiroMinimal=L,c.bailliePSW=E,c.compress=H,c.decodeLEB128=ut,c.decodeRFC3986URIComponent=X,c.decompress=J,c.encodeLEB128=ft,c.encodeRFC3986URIComponent=W,c.exEuclidean=A,c.factorial=x,c.fromBase64=C,c.fromBase64Url=ot,c.fromOct=at,c.getHash=G,c.getRandBIByBitLength=I,c.getRandBIByRange=T,c.getRandPrimeByBitLength=st,c.getRandPrimeByRange=rt,c.getRndInt=Y,c.getStringTag=D,c.isDeepStrictEqual=m,c.isNode=z,c.isSquare=P,c.jacobiSymbol=B,c.lazify=q,c.modPow=p,c.parseCSV=K,c.promiseWithResolvers=k,c.residue=y,c.rot32=v,c.rot64=b,c.sameValueZero=V,c.sleep=$,c.toBase64=j,c.toBase64Url=it,c.toOct=ct,Object.defineProperty(c,Symbol.toStringTag,{value:"Module"}),c})({});

package/dist/main.d.ts

@@ -3,7 +3,6 @@ export * from './math';
 export * from './baillie-psw';
 export * from './fraction';
 export * from './u8arr-ext';
-export * from './queue';
 export * from './named-error';
 export * from './random';
 export * from './pcg-minimal';

package/dist/u8arr-ext.d.ts

@@ -1,5 +1,8 @@
-export type Encoding = 'utf-8' | 'base64' | 'base64url' | 'hex' | 'oct' | 'bin';
-export declare const fromString: (str: string, encoding: Encoding) => Uint8Array<ArrayBuffer>;
-export declare const toString: (u8Arr: Uint8Array, encoding: Encoding) => string;
+export declare const toBase64: (bin: Uint8Array) => string;
+export declare const fromBase64: (base64: string) => Uint8Array<ArrayBuffer>;
+export declare const toBase64Url: (bin: Uint8Array) => string;
+export declare const fromBase64Url: (base64Url: string) => Uint8Array<ArrayBuffer>;
+export declare const toOct: (bin: Uint8Array) => string;
+export declare const fromOct: (oct: string) => Uint8Array<ArrayBuffer>;
 export declare const encodeLEB128: (bigint: bigint) => Uint8Array<ArrayBuffer>;
 export declare const decodeLEB128: (leb128: Uint8Array<ArrayBuffer>) => bigint;

package/dist/util.d.ts

@@ -25,6 +25,12 @@ export declare const promiseWithResolvers: <T>() => {
  * @returns
  */
 export declare const sleep: (delay: number) => Promise<void>;
+/**
+ * get a value of `Symbol.toStringTag`
+ * @param obj
+ * @returns
+ */
+export declare const getStringTag: (obj: unknown) => string | undefined;
 /**
  * makes a function lazy
  * @param func function

package/dist/xoshiro-minimal.d.ts

@@ -19,7 +19,7 @@ export declare class XoshiroMinimal implements RandomGenerator64 {
      *
      * // you should construct with random seeds.
      * const seed = crypto.getRandomValues(new BigUint64Array(4));
-     * const betterRng = new PCGMinimal(seed);
+     * const betterRng = new XoshiroMinimal(seed);
      */
     constructor(seed?: BigUint64Array<ArrayBuffer>);
     get value(): bigint;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@tktb-tess/util-fns",
-  "version": "0.9.3",
+  "version": "0.10.0",
   "description": "Utility functions for personal use",
   "files": [
     "dist"

package/dist/queue.d.ts

@@ -1,23 +0,0 @@
-export declare class Queue<T> {
-    #private;
-    static readonly name = "Queue";
-    /**
-     * Queue
-     * @param data
-     */
-    constructor(...data: T[]);
-    /**
-     * enqueue data
-     * @param data
-     * @returns current queue length
-     */
-    enqueue(...data: T[]): number;
-    /**
-     * dequeue data
-     * @returns data in the head
-     */
-    dequeue(): T | undefined;
-    toArray(): T[];
-    toJSON(): T[];
-    toString(): string;
-}