@tktb-tess/util-fns 0.8.4 → 0.8.6

package/dist/bundle.js

@@ -1,4 +1,4 @@
-const T = new TextEncoder(), K = (n, t) => [n].includes(t), d = (n, t) => {
+const T = new TextEncoder(), K = (n, t) => [n].includes(t), g = (n, t) => {
   if (typeof n != typeof t) return !1;
   const e = Object.prototype.toString.call(n), r = Object.prototype.toString.call(t);
   if (e !== r) return !1;
@@ -10,27 +10,27 @@ const T = new TextEncoder(), K = (n, t) => [n].includes(t), d = (n, t) => {
     return !1;
   if (Array.isArray(n) && Array.isArray(t)) {
     if (n.length !== t.length) return !1;
-    for (let o = 0; o < n.length; o++)
-      if (!d(n[o], t[o])) return !1;
+    for (let s = 0; s < n.length; s++)
+      if (!g(n[s], t[s])) return !1;
     return !0;
   }
   if (n instanceof Set && t instanceof Set) {
-    const o = [...n.values()], s = [...t.values()];
-    return !!d(o, s);
+    const s = [...n.values()], o = [...t.values()];
+    return !!g(s, o);
   }
   if (n instanceof Map && t instanceof Map) {
-    const o = [...n.keys()], s = [...t.keys()];
-    if (!d(o, s)) return !1;
+    const s = [...n.keys()], o = [...t.keys()];
+    if (!g(s, o)) return !1;
     const i = [...n.values()], c = [...t.values()];
-    return !!d(i, c);
+    return !!g(i, c);
   }
   if (e === "[object Object]") {
-    const o = n, s = t, i = Object.keys(o), c = Object.keys(s);
+    const s = n, o = t, i = Object.keys(s), c = Object.keys(o);
     for (const a of i) {
-      const f = c.find((g) => g === a);
+      const f = c.find((d) => d === a);
       if (f === void 0) return !1;
-      const [h, u] = [o[a], s[f]];
-      if (!d(h, u)) return !1;
+      const [h, u] = [s[a], o[f]];
+      if (!g(h, u)) return !1;
     }
     return !0;
   }
@@ -40,8 +40,8 @@ const T = new TextEncoder(), K = (n, t) => [n].includes(t), d = (n, t) => {
 }, z = () => {
   let n, t;
   return {
-    promise: new Promise((r, o) => {
-      n = r, t = o;
+    promise: new Promise((r, s) => {
+      n = r, t = s;
     }),
     resolve: n,
     reject: t
@@ -50,17 +50,17 @@ const T = new TextEncoder(), K = (n, t) => [n].includes(t), d = (n, t) => {
   setTimeout(() => t(), n);
 }), W = (n) => (...t) => () => n(...t), G = (n) => {
   const t = [];
-  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;
+  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;
 }, H = async (n, t) => {
   const e = T.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", X = (n) => encodeURIComponent(n).replace(
+}, Z = () => !!globalThis.process && typeof process.version < "u" && typeof process.versions.node < "u", X = (n) => encodeURIComponent(n).replace(
   /[!'()*]/g,
   (e) => `%${e.charCodeAt(0).toString(16).toUpperCase()}`
 ), Y = (n) => {
@@ -77,23 +77,23 @@ const T = new TextEncoder(), K = (n, t) => [n].includes(t), d = (n, t) => {
   t < 0n && (t *= -1n);
   const e = n % t;
   return e < 0n ? e + t : e;
-}, B = (n, t = !1) => {
+}, E = (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 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);
+  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);
 }, j = (n, t) => {
   if (n >= t) throw Error("rangeError");
-  const e = t - n, r = e.toString(2).length, o = (() => {
+  const e = t - n, r = e.toString(2).length, s = (() => {
     for (let i = 0; i < 1e5; i++) {
-      const c = B(r);
+      const c = E(r);
       if (c >= p(2n, BigInt(r), e))
         return c % e;
     }
     throw Error("Failed to generate a random bigint");
   })();
-  return n + o;
+  return n + s;
 }, p = (n, t, e) => {
   if (e < 1n) throw Error("`mod` must be positive");
   if (t < 0n) throw Error("`power` must not be negative");
@@ -104,19 +104,19 @@ const T = new TextEncoder(), K = (n, t) => [n].includes(t), d = (n, t) => {
   for (; t > 0n; )
     t & 1n && (r = r * n % e), n = n * n % e, t >>= 1n;
   return r;
-}, L = (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, o] = [1n, 0n, n], [s, i, c] = [0n, -1n, t];
+  let [e, r, s] = [1n, 0n, n], [o, i, c] = [0n, -1n, t];
   for (; ; ) {
-    const a = o / c, f = o - a * c;
+    const a = s / c, f = s - a * c;
     if (f === 0n) break;
-    [e, s] = [s, e - a * s], [r, i] = [i, r - a * i], [o, c] = [c, f];
+    [e, o] = [o, e - a * o], [r, i] = [i, r - a * i], [s, c] = [c, f];
   }
-  return c < 0n && (s *= -1n, i *= -1n, c *= -1n), { x: s, y: i, gcd: c };
+  return c < 0n && (o *= -1n, i *= -1n, c *= -1n), { x: o, y: i, gcd: c };
 }, w = (n, t) => {
   if (n >= t) return 1n;
   const e = BigInt((t - 2n).toString(2).length), r = (t - n) / 2n;
@@ -126,13 +126,13 @@ const T = new TextEncoder(), K = (n, t) => [n].includes(t), d = (n, t) => {
       c *= a;
     return c;
   }
-  const o = n + r | 1n, s = w(n, o), i = w(o, t);
-  return s * i;
-}, _ = (n) => {
+  const s = n + r | 1n, o = w(n, s), i = w(s, t);
+  return o * i;
+}, v = (n) => {
   let t = 3n, e = 1n, r = 1n;
-  const o = BigInt(n.toString(2).length) - 1n;
-  for (let s = o - 1n; s > -1n; --s) {
-    const i = (n >> s) + 1n | 1n;
+  const s = BigInt(n.toString(2).length) - 1n;
+  for (let o = s - 1n; o > -1n; --o) {
+    const i = (n >> o) + 1n | 1n;
     r *= w(t, i), t = i, e *= r;
   }
   return e;
@@ -140,8 +140,8 @@ const T = new TextEncoder(), K = (n, t) => [n].includes(t), d = (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 _(n) << t;
-}, rt = (n, t) => BigInt.asUintN(32, n >> (t & 31n) | n << (-t & 31n)), v = (n, t) => (n >>> (t & 31) | n << (-t & 31)) >>> 0, b = (n, t) => {
+  return v(n) << t;
+}, rt = (n, t) => BigInt.asUintN(32, n >> (t & 31n) | n << (-t & 31n)), C = (n, t) => (n >>> (t & 31) | n << (-t & 31)) >>> 0, b = (n, t) => {
   if (t < 1n || t % 2n === 0n)
     throw Error("`n` is invalid");
   for (; n < 0n; )
@@ -157,7 +157,7 @@ const T = new TextEncoder(), K = (n, t) => [n].includes(t), d = (n, t) => {
     [n, t] = [t, n], n % 4n === 3n && t % 4n === 3n && (e *= -1n), n %= t;
   }
   return t === 1n ? e : 0n;
-}, C = (n) => {
+}, F = (n) => {
   if (n < 0n) return !1;
   if (n === 0n) return !0;
   let t = 1n, e = n;
@@ -166,16 +166,16 @@ const T = new TextEncoder(), K = (n, t) => [n].includes(t), d = (n, t) => {
     r ** 2n < n ? t = r : e = r;
   }
   return n === t ** 2n || n === (t + 1n) ** 2n;
-}, F = (n) => {
+}, L = (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, o] = [t, e];
+  const [r, s] = [t, e];
   let i = p(2n, r, n);
   if (i === 1n) return !0;
-  for (let c = 0n; c < o; c++) {
+  for (let c = 0n; c < s; c++) {
     if (i === n - 1n) return !0;
     i = i * i % n;
   }
@@ -183,32 +183,32 @@ const T = new TextEncoder(), K = (n, t) => [n].includes(t), d = (n, t) => {
 }, P = (n) => {
   let t = 5n, e = b(t, n);
   for (; e > 0n; ) {
-    if (t = t > 0n ? t + 2n : t - 2n, t *= -1n, t === -15n && C(n))
+    if (t = t > 0n ? t + 2n : t - 2n, t *= -1n, t === -15n && F(n))
       return [0n, 0n];
     e = b(t, n);
   }
   return [t, e];
 }, y = (n, t) => (n & 1n) === 1n ? m(n + t >> 1n, t) : m(n >> 1n, t), V = (n, t, e, r) => {
-  let o = 1n, s = e;
+  let s = 1n, o = e;
   const i = n.toString(2).slice(1);
   for (const c of i)
-    [o, s] = [m(o * s, t), y(s * s + r * o * o, t)], c === "1" && ([o, s] = [y(e * o + s, t), y(r * o + e * s, t)]);
-  return [o, s];
+    [s, o] = [m(s * o, t), y(o * o + r * s * s, t)], c === "1" && ([s, o] = [y(e * s + o, t), y(r * s + e * o, t)]);
+  return [s, o];
 }, O = (n, t, e, r) => {
   if (n % 2n !== 1n) throw Error("`n` must be odd");
-  let o = n + 1n, s = 0n;
-  for (; o % 2n === 0n; )
-    o >>= 1n, s += 1n;
-  const [i, c] = V(o, n, e, t);
+  let s = n + 1n, o = 0n;
+  for (; s % 2n === 0n; )
+    s >>= 1n, o += 1n;
+  const [i, c] = V(s, n, e, t);
   let a = c;
   if (i === 0n) return !0;
-  r = p(r, o, n);
-  for (let f = 0n; f < s; f++) {
+  r = p(r, s, n);
+  for (let f = 0n; f < o; f++) {
     if (a === 0n) return !0;
     a = m(a * a - 2n * r, n), r = p(r, 2n, n);
   }
   return !1;
-}, E = (n) => {
+}, x = (n) => {
   if (n <= 1n) return !1;
   if (n % 2n === 0n) return n === 2n;
   const t = [
@@ -239,29 +239,29 @@ const T = new TextEncoder(), K = (n, t) => [n].includes(t), d = (n, t) => {
     97n,
     101n
   ];
-  for (const s of t)
-    if (n % s === 0n)
-      return n === s;
-  if (!F(n))
+  for (const o of t)
+    if (n % o === 0n)
+      return n === o;
+  if (!L(n))
     return !1;
   const [e, r] = P(n);
   if (r === 0n) return !1;
-  const o = (1n - e) / 4n;
-  return O(n, e, 1n, o);
+  const s = (1n - e) / 4n;
+  return O(n, e, 1n, s);
 }, st = (n, t) => {
   if (t < 2n)
     throw Error("noPrimesFound");
   for (let r = 0; r < 1e5; r++) {
-    const o = j(n, t);
-    if (E(o)) return o;
+    const s = j(n, t);
+    if (x(s)) return s;
   }
   throw Error("noPrimesFound");
 }, ot = (n, t = !1) => {
   if (n < 2)
     throw Error("noPrimesFound");
   for (let r = 0; r < 1e5; r++) {
-    const o = B(n, t);
-    if (E(o)) return o;
+    const s = E(n, t);
+    if (x(s)) return s;
   }
   throw Error("noPrimesFound");
 };
@@ -290,11 +290,11 @@ class l {
       return new l(t > 0 ? 1n : -1n, 0n);
     const r = t < 0;
     r && (t *= -1);
-    const o = BigInt(Math.floor(t)), s = t - Number(o);
-    if (s === 0)
-      return new l(r ? -o : o, 1n);
-    t = 1 / s;
-    let [i, c] = [1n, o], [a, f] = [0n, 1n];
+    const s = BigInt(Math.floor(t)), o = t - Number(s);
+    if (o === 0)
+      return new l(r ? -s : s, 1n);
+    t = 1 / o;
+    let [i, c] = [1n, s], [a, f] = [0n, 1n];
     for (; `${f}`.length < e + 1; ) {
       const h = BigInt(Math.floor(t)), u = t - Number(h);
       if ([i, c] = [c, h * c + i], [a, f] = [f, h * f + a], u === 0)
@@ -307,7 +307,7 @@ class l {
    * reduction
    */
   #e() {
-    const { gcd: t } = L(this.#t, this.#n);
+    const { gcd: t } = _(this.#t, this.#n);
     t !== 0n && (this.#t /= t, this.#n /= t);
   }
   /**
@@ -409,10 +409,10 @@ class l {
     const r = /^\s*(\d+)\s*\/\s*(\d+)\s*$/.exec(t);
     if (!r)
       throw Error("cannot parse");
-    const o = r.at(1), s = r.at(2);
-    if (!o || !s)
+    const s = r.at(1), o = r.at(2);
+    if (!s || !o)
       throw Error("cannot parse");
-    return new l(BigInt(o), BigInt(s));
+    return new l(BigInt(s), BigInt(o));
   }
 }
 const $ = new TextEncoder(), k = new TextDecoder(), it = (n, t) => {
@@ -428,25 +428,25 @@ const $ = new TextEncoder(), k = new TextDecoder(), it = (n, t) => {
     case "hex": {
       n.length & 1 && (n = "0" + n);
       const r = n.matchAll(/.{2}/g);
-      return Uint8Array.from(r, (o) => Number.parseInt(o[0], 16));
+      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), s = Array.from(r, (i) => {
+      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(
-        s,
+        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), o = Array.from(r, (s) => Number.parseInt(s[0], 2));
-      return Uint8Array.from(o);
+      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 });
@@ -460,7 +460,7 @@ const $ = new TextEncoder(), k = new TextDecoder(), it = (n, t) => {
       return btoa(e);
     }
     case "base64url": {
-      const e = Array.from(n, (o) => String.fromCharCode(o)).join("");
+      const e = Array.from(n, (s) => String.fromCharCode(s)).join("");
       return btoa(e).replaceAll("+", "-").replaceAll("/", "_").replace(/=+$/, "");
     }
     case "hex":
@@ -472,9 +472,9 @@ const $ = new TextEncoder(), k = new TextDecoder(), it = (n, t) => {
       ).join("");
       const r = e.length % 6;
       r && (e = "0".repeat(6 - r) + e);
-      const o = e.matchAll(/.{6}/g);
+      const s = e.matchAll(/.{6}/g);
       return Array.from(
-        o,
+        s,
         (i) => Number.parseInt(i[0], 16).toString(8).padStart(8, "0")
       ).join("").replace(/^0+/, "");
     }
@@ -483,32 +483,12 @@ const $ = new TextEncoder(), k = new TextDecoder(), it = (n, t) => {
     default:
       throw Error(`Invalid encoding: ${t}`, { cause: t });
   }
-}, at = (n) => {
-  const t = n < 0n;
-  t && (n *= -1n);
-  const e = n.toString(2).length, r = Math.ceil(e / 7);
-  t && (n = BigInt.asUintN(7 * r, ~n + 1n));
-  const o = new Uint8Array(r);
-  for (let s = 0; s < r - 1; ++s) {
-    const i = Number(n & 127n) | 128;
-    o[s] = i, n >>= 7n;
-  }
-  return o[r - 1] = Number(n), o;
-}, ft = (n) => {
-  const t = n.length;
-  let e = 0n;
-  for (let s = 0; s < t; ++s) {
-    const i = n[s] & 127;
-    e += BigInt(i) << BigInt(7 * s);
-  }
-  const r = 1n << BigInt(7 * t - 1);
-  return (e & r) === 1n && (e = BigInt.asIntN(7 * t, e)), e;
 };
-class N {
+class A {
   #t;
   #n;
   static name = "Queue";
-  [Symbol.toStringTag] = N.name;
+  [Symbol.toStringTag] = A.name;
   /**
    * Queue
    * @param data
@@ -546,22 +526,22 @@ class N {
     return this.toArray().toString();
   }
 }
-class A extends Error {
+class B extends Error {
   name;
   static name = "NamedError";
-  [Symbol.toStringTag] = A.name;
+  [Symbol.toStringTag] = B.name;
   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: o } = this;
+      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;
     return {
       name: e,
       message: r,
-      stack: o,
+      stack: s,
       cause: t
     };
   }
@@ -579,42 +559,41 @@ const I = (n) => {
     ++t, n >>= 1n;
   return BigInt.asUintN(64, t);
 };
-class x {
+class U {
   #t;
-  #n;
   static name = "FloatRand";
-  [Symbol.toStringTag] = x.name;
-  constructor(t, e) {
-    this.#t = t, this.#n = e;
+  [Symbol.toStringTag] = U.name;
+  constructor(t) {
+    this.#t = t;
   }
-  #e() {
-    const r = this.#t.getU32Rand() | 0, o = r & 255;
-    let s = 126;
-    if (o === 0) {
-      s -= 8;
+  #n() {
+    const r = this.#t.getU32Rand() >>> 0, s = r & 255;
+    let o = 126;
+    if (s === 0) {
+      o -= 8;
       const h = 1e5;
       let u = 0;
       t: for (; ; ) {
         if (u > h)
           throw Error("loop exceeded limit");
-        const g = this.#t.getU32Rand() | 0;
-        if (g === 0) {
-          if (s -= 32, s < 0) {
-            s = 0;
+        const d = this.#t.getU32Rand() >>> 0;
+        if (d === 0) {
+          if (o -= 32, o < 0) {
+            o = 0;
             break t;
           }
         } else {
-          s -= I(g);
+          o -= I(d);
           break t;
         }
         ++u;
       }
     } else
-      s -= I(o);
+      o -= I(s);
     const i = r >>> 8 & 8388607;
-    i === 0 && r >>> 31 && ++s;
+    i === 0 && r >>> 31 && ++o;
     const { buffer: c, byteOffset: a, length: f } = Uint32Array.from([
-      s << 23 | i
+      o << 23 | i
     ]);
     return new Float32Array(c, a, f)[0];
   }
@@ -624,46 +603,46 @@ class x {
    */
   getF32Rand() {
     for (let e = 0; e < 1e5; ++e) {
-      const r = this.#e();
+      const r = this.#n();
       if (r < 1)
         return r;
     }
     throw Error("exceeded loop limit");
   }
-  #r() {
+  #e() {
     const t = 0n, e = 1023n, r = (() => {
-      const h = BigInt(this.#t.getU32Rand() | 0), u = BigInt(this.#n.getU32Rand() | 0);
+      const h = BigInt(this.#t.getU32Rand() >>> 0), u = BigInt(this.#t.getU32Rand() >>> 0);
       return h << 32n | u;
-    })(), o = r & 0x7ffn;
-    let s = e - 1n;
-    if (o === 0n) {
-      s -= 11n;
+    })(), s = r & 0x7ffn;
+    let o = e - 1n;
+    if (s === 0n) {
+      o -= 11n;
       const h = 1e5;
       let u = 0;
       t: for (; ; ) {
         if (u > h)
           throw Error("loop exceeded limit");
-        const g = (() => {
-          const M = BigInt(this.#t.getU32Rand() | 0), R = BigInt(this.#n.getU32Rand() | 0);
-          return M << 32n | R;
+        const d = (() => {
+          const R = BigInt(this.#t.getU32Rand() >>> 0), M = BigInt(this.#t.getU32Rand() >>> 0);
+          return R << 32n | M;
         })();
-        if (g === 0n) {
-          if (s -= 64n, s < t) {
-            s = t;
+        if (d === 0n) {
+          if (o -= 64n, o < t) {
+            o = t;
             break t;
           }
         } else {
-          s -= S(g);
+          o -= S(d);
           break t;
         }
         ++u;
       }
     } else
-      s -= S(o);
+      o -= S(s);
     const i = r >> 11n & 0xfffffffffffffn;
-    i === 0n && r >> 63n && ++s;
+    i === 0n && r >> 63n && ++o;
     const { buffer: c, byteOffset: a, length: f } = BigUint64Array.from([
-      s << 52n | i
+      o << 52n | i
     ]);
     return new Float64Array(c, a, f)[0];
   }
@@ -673,7 +652,7 @@ class x {
    */
   getF64Rand() {
     for (let e = 0; e < 1e5; ++e) {
-      const r = this.#r();
+      const r = this.#e();
       if (r < 1)
         return r;
     }
@@ -681,13 +660,13 @@ class x {
   }
 }
 const D = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn], q = 0x5851f42d4c957f2dn;
-class U {
+class N {
   /**
    * length = 2, `[state, increment]`
    */
   #t;
   static name = "PCGMinimal";
-  [Symbol.toStringTag] = U.name;
+  [Symbol.toStringTag] = N.name;
   /**
    * returns seed for constructing `PCGMinimal` instance
    * @returns random seed `BigUint64Array` with length 2
@@ -719,7 +698,7 @@ class U {
   /** 32bit 乱数を返す (内部状態は変わらない) */
   get #e() {
     const t = this.#t[0], e = Number(t >> 59n), r = Number(BigInt.asUintN(32, (t ^ t >> 18n) >> 27n));
-    return v(r, e);
+    return C(r, e);
   }
   /**
    *
@@ -735,8 +714,8 @@ class U {
     if (t > 4294967296) throw Error("`bound` exceeded limit (2^32)");
     const r = 4294967296 % t;
     for (; ; ) {
-      const o = this.getU32Rand();
-      if (o >= r) return o % t;
+      const s = this.getU32Rand();
+      if (s >= r) return s % t;
     }
   }
   /**
@@ -753,37 +732,35 @@ class U {
   }
 }
 export {
-  x as FloatRand,
-  A as NamedError,
-  U as PCGMinimal,
-  N as Queue,
+  U as FloatRand,
+  B as NamedError,
+  N as PCGMinimal,
+  A as Queue,
   l as Rational,
-  E as bailliePSW,
+  x as bailliePSW,
   Q as compress,
-  ft as decodeLEB128,
   Y as decodeRFC3986URIComponent,
   tt as decompress,
-  at as encodeLEB128,
   X as encodeRFC3986URIComponent,
-  L as exEuclidean,
+  _ as exEuclidean,
   et as factorial,
   it as fromString,
   H as getHash,
-  B as getRandBIByBitLength,
+  E as getRandBIByBitLength,
   j as getRandBIByRange,
   ot as getRandPrimeByBitLength,
   st as getRandPrimeByRange,
   nt as getRndInt,
-  d as isDeepStrictEqual,
+  g as isDeepStrictEqual,
   Z as isNode,
-  C as isSquare,
+  F as isSquare,
   b as jacobiSymbol,
   W as lazify,
   p as modPow,
   G as parseCSV,
   z as promiseWithResolvers,
   m as residue,
-  v as rot32,
+  C as rot32,
   rt as rot32BI,
   K as sameValueZero,
   J as sleep,

package/dist/main.d.ts

@@ -6,3 +6,4 @@ export * from './u8arr-ext';
 export * from './queue';
 export * from './named-error';
 export * from './random';
+export * from './pcg-minimal';

package/dist/pcg-minimal.d.ts

@@ -0,0 +1,47 @@
+import { RandomGenerator } from './random';
+/**
+ * PCG-XSH-RR (Permuted congruential generator)
+ */
+export declare class PCGMinimal implements RandomGenerator {
+    #private;
+    static readonly name = "PCGMinimal";
+    readonly [Symbol.toStringTag] = "PCGMinimal";
+    /**
+     * returns seed for constructing `PCGMinimal` instance
+     * @returns random seed `BigUint64Array` with length 2
+     * @example
+     * const rng = new PCGMinimal(PCGMinimal.getSeed())
+     */
+    static getSeed(): BigUint64Array<ArrayBuffer>;
+    /**
+     * @param seeds
+     * `BigUintArray` with length 2. \
+     * if it is not given, initialized by default value
+     * @example
+     * // the following example is always initialized by the same seeds.
+     * // it's not recommended
+     * const weakRng = new PCGMinimal();
+     *
+     * // you should construct with random seeds generated by `PCGMinimal.getSeed()`.
+     * const betterRng = new PCGMinimal(PCGMinimal.getSeed());
+     */
+    constructor(seeds?: BigUint64Array<ArrayBuffer>);
+    /**
+     *
+     * @returns a random 32-bit unsigned integer
+     */
+    getU32Rand(): number;
+    /**
+     * @returns a random 32-bit unsigned integer less than `bound`
+     */
+    getBoundedU32Rand(bound: number): number;
+    /**
+     *
+     * @param step the number of needed random integers
+     * @param bound upper limit
+     * @returns
+     * the iterator that generates random 32-bit unsigned integers `step` times \
+     * if `bound` is given, random integers are less than `bound`
+     */
+    genU32Rands(step: number, bound?: number): Generator<number, void, unknown>;
+}

package/dist/random.d.ts

@@ -7,7 +7,7 @@ export declare class FloatRand {
     #private;
     static readonly name = "FloatRand";
     readonly [Symbol.toStringTag] = "FloatRand";
-    constructor(rng: RandomGenerator, rng2: RandomGenerator);
+    constructor(rng: RandomGenerator);
     /**
      * returns a random single-precision floating-point number (float32) in the range of [0.0, 1.0)
      * @returns
@@ -19,49 +19,3 @@ export declare class FloatRand {
      */
     getF64Rand(): number;
 }
-/**
- * PCG-XSH-RR (Permuted congruential generator)
- */
-export declare class PCGMinimal implements RandomGenerator {
-    #private;
-    static readonly name = "PCGMinimal";
-    readonly [Symbol.toStringTag] = "PCGMinimal";
-    /**
-     * returns seed for constructing `PCGMinimal` instance
-     * @returns random seed `BigUint64Array` with length 2
-     * @example
-     * const rng = new PCGMinimal(PCGMinimal.getSeed())
-     */
-    static getSeed(): BigUint64Array<ArrayBuffer>;
-    /**
-     * @param seeds
-     * `BigUintArray` with length 2. \
-     * if it is not given, initialized by default value
-     * @example
-     * // the following example is always initialized by the same seeds.
-     * // it's not recommended
-     * const weakRng = new PCGMinimal();
-     *
-     * // you should construct with random seeds generated by `PCGMinimal.getSeed()`.
-     * const betterRng = new PCGMinimal(PCGMinimal.getSeed());
-     */
-    constructor(seeds?: BigUint64Array<ArrayBuffer>);
-    /**
-     *
-     * @returns a random 32-bit unsigned integer
-     */
-    getU32Rand(): number;
-    /**
-     * @returns a random 32-bit unsigned integer less than `bound`
-     */
-    getBoundedU32Rand(bound: number): number;
-    /**
-     *
-     * @param step the number of needed random integers
-     * @param bound upper limit
-     * @returns
-     * the iterator that generates random 32-bit unsigned integers `step` times \
-     * if `bound` is given, random integers are less than `bound`
-     */
-    genU32Rands(step: number, bound?: number): Generator<number, void, unknown>;
-}

package/dist/u8arr-ext.d.ts

@@ -1,10 +1,3 @@
 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;
-/**
- * encode a bigint as a signed LEB128 format
- * @param n
- * @returns
- */
-export declare const encodeLEB128: (n: bigint) => Uint8Array<ArrayBuffer>;
-export declare const decodeLEB128: (leb128: Uint8Array<ArrayBuffer>) => bigint;

package/package.json

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