@tktb-tess/util-fns 0.3.2 → 0.3.4

package/dist/baillie-psw.d.ts

@@ -3,18 +3,19 @@
  * @param n 判定したい整数
  * @returns
  */
-export declare const bailliePSW: (n: bigint) => boolean;
+declare const bailliePSW: (n: bigint) => boolean;
 /**
  * 指定範囲内の確率的素数を返す
  * @param min 下限
  * @param max 上限
  * @returns
  */
-export declare const getRandPrimeByRange: (min: bigint, max: bigint) => bigint;
+declare const getRandPrimeByRange: (min: bigint, max: bigint) => bigint;
 /**
  * 指定ビットの確率的素数を返す
  * @param bitLength ビット長
  * @param fixed true: 固定長, false (デフォルト値): `length` ビット以下の可変ビット長
  * @returns
  */
-export declare const getRandPrimeByBitLength: (bitLength: number, fixed?: boolean) => bigint;
+declare const getRandPrimeByBitLength: (bitLength: number, fixed?: boolean) => bigint;
+export { bailliePSW, getRandPrimeByBitLength, getRandPrimeByRange };

package/dist/brand.d.ts

@@ -1,7 +1,7 @@
-declare const __brand: unique symbol;
-export type Brand<in out K extends string | symbol> = {
-    readonly [__brand]: {
-        readonly [key in K]: unknown;
+declare const Brand: unique symbol;
+type Brand<in out K extends string | symbol> = {
+    readonly [Brand]: {
+        readonly [key in K]: K;
     };
 };
-export {};
+export { Brand };

package/dist/bundle.d.ts

@@ -5,6 +5,7 @@ import { bailliePSW, getRandPrimeByBitLength, getRandPrimeByRange } from './bail
 import { default as Fraction } from './fraction';
 import { base64ToU8Arr, base64UrlToU8Arr, u8ArrToBase64, u8ArrToBase64Url, BItoU8Arr, u8ArrToBI } from './u8arr-ext';
 import { Brand } from './brand';
+import { default as Queue } from './queue';
 declare const Util: {
     isEqual: (a: unknown, b: unknown) => boolean;
     sleep: (delay: number) => Promise<void>;
@@ -42,4 +43,4 @@ declare const U8Ext: {
     BItoU8Arr: (n: bigint) => Uint8Array<ArrayBuffer>;
     u8ArrToBI: (buf: Uint8Array) => bigint;
 };
-export { isEqual, sleep, lazify, parseCSV, getHash, getRndInt, residue, toBigInt, isNode, getRandBIByBitLength, getRandBIByRange, modPow, exEuclidean, factorial, rot32, rot32BI, jacobiSymbol, isSquare, bailliePSW, getRandPrimeByBitLength, getRandPrimeByRange, base64ToU8Arr, base64UrlToU8Arr, u8ArrToBase64, u8ArrToBase64Url, BItoU8Arr, u8ArrToBI, PCGMinimal, Fraction, Util, Calc, U8Ext, type Brand, };
+export { isEqual, sleep, lazify, parseCSV, getHash, getRndInt, residue, toBigInt, isNode, getRandBIByBitLength, getRandBIByRange, modPow, exEuclidean, factorial, rot32, rot32BI, jacobiSymbol, isSquare, bailliePSW, getRandPrimeByBitLength, getRandPrimeByRange, base64ToU8Arr, base64UrlToU8Arr, u8ArrToBase64, u8ArrToBase64Url, BItoU8Arr, u8ArrToBI, PCGMinimal, Fraction, Queue, Util, Calc, U8Ext, Brand, };

package/dist/bundle.js

@@ -2,11 +2,7 @@ const R = new TextEncoder(), p = (n, t) => {
   if (typeof n != typeof t) return !1;
   const r = Object.prototype.toString.call(n), e = Object.prototype.toString.call(t);
   if (r !== e) return !1;
-  if (typeof n == "string" || typeof n == "bigint" || typeof n == "boolean" || typeof n == "symbol" || typeof n > "u")
-    return n === t;
-  if (typeof n == "number")
-    return Number.isNaN(n) && Number.isNaN(t) || n === t;
-  if (n === null) return n === t;
+  if (typeof n == "string" || typeof n == "number" || typeof n == "bigint" || typeof n == "boolean" || typeof n == "symbol" || typeof n > "u" || n === null) return n === t;
   if (typeof n == "function")
     throw Error("comparing these objects is still unavailable");
   if (Array.isArray(n) && Array.isArray(t)) {
@@ -18,20 +14,20 @@ const R = new TextEncoder(), p = (n, t) => {
   if (r === "[object Object]") {
     const i = n, s = t, o = Object.getOwnPropertyNames(n), c = Object.getOwnPropertyNames(t);
     o.push(...Object.getOwnPropertySymbols(n)), c.push(...Object.getOwnPropertySymbols(t));
-    for (const l of o) {
-      const u = c.find((O) => O === l);
-      if (u === void 0) return !1;
-      const [h, d] = [i[l], s[u]];
+    for (const u of o) {
+      const l = c.find((j) => j === u);
+      if (l === void 0) return !1;
+      const [h, d] = [i[u], s[l]];
       if (!p(h, d)) return !1;
     }
     return !0;
   }
   throw Error("comparing these objects is still unavailable");
-}, x = (n) => new Promise((t) => {
+}, T = (n) => new Promise((t) => {
   setTimeout(() => {
     t();
   }, n);
-}), M = (n) => (...t) => () => n(...t), T = (n) => {
+}), x = (n) => (...t) => () => n(...t), M = (n) => {
   const t = [];
   let r = [], e = "", i = !1;
   for (let s = 0; s < n.length; s++) {
@@ -43,20 +39,20 @@ const R = new TextEncoder(), p = (n, t) => {
 }, _ = async (n, t) => {
   const r = R.encode(n), e = await crypto.subtle.digest(t, r);
   return new Uint8Array(e);
-}, L = (...n) => n.map((t) => BigInt(t)), b = () => typeof globalThis.process < "u" && typeof globalThis.require < "u", V = (n, t) => Math.floor(Math.random() * (t - n) + n), a = (n, t) => {
+}, v = (...n) => n.map((t) => BigInt(t)), b = () => typeof globalThis.process < "u" && typeof globalThis.require < "u", L = (n, t) => Math.floor(Math.random() * (t - n) + n), a = (n, t) => {
   const r = n % t;
   return r < 0n ? r + t : r;
-}, B = (n, t = !1) => {
+}, S = (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 r = Math.ceil(n / 8), e = crypto.getRandomValues(new Uint8Array(r));
   let i = Array.from(e, (s) => s.toString(2).padStart(8, "0")).join("").slice(0, n);
   return t && (i = i.replace(/^./, "1")), BigInt("0b" + i);
-}, S = (n, t) => {
+}, A = (n, t) => {
   if (n >= t) throw Error("rangeError");
   const r = t - n, e = r.toString(2).length, i = (() => {
     for (let o = 0; o < 1e5; o++) {
-      const c = B(e);
+      const c = S(e);
       if (c >= g(2n, BigInt(e), r))
         return c % r;
     }
@@ -74,7 +70,7 @@ const R = new TextEncoder(), p = (n, t) => {
   for (; t > 0n; )
     t & 1n && (e = e * n % r), n = n * n % r, t >>= 1n;
   return e;
-}, A = (n, t) => {
+}, E = (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 };
@@ -82,9 +78,9 @@ const R = new TextEncoder(), p = (n, t) => {
     return n > 0n ? { x: 1n, y: 0n, gcd: n } : { x: -1n, y: 0n, gcd: -n };
   let [r, e, i] = [1n, 0n, n], [s, o, c] = [0n, -1n, t];
   for (; ; ) {
-    const l = i / c, u = i - l * c;
-    if (u === 0n) break;
-    [r, s] = [s, r - l * s], [e, o] = [o, e - l * o], [i, c] = [c, u];
+    const u = i / c, l = i - u * c;
+    if (l === 0n) break;
+    [r, s] = [s, r - u * s], [e, o] = [o, e - u * o], [i, c] = [c, l];
   }
   return c < 0n && (s *= -1n, o *= -1n, c *= -1n), { x: s, y: o, gcd: c };
 }, m = (n, t) => {
@@ -92,13 +88,13 @@ const R = new TextEncoder(), p = (n, t) => {
   const r = BigInt((t - 2n).toString(2).length), e = (t - n) / 2n;
   if (r * e < 63n) {
     let c = n;
-    for (let l = n + 2n; l < t; l += 2n)
-      c *= l;
+    for (let u = n + 2n; u < t; u += 2n)
+      c *= u;
     return c;
   }
   const i = n + e | 1n, s = m(n, i), o = m(i, t);
   return s * o;
-}, C = (n) => {
+}, V = (n) => {
   let t = 3n, r = 1n, e = 1n;
   const i = BigInt(n.toString(2).length) - 1n;
   for (let s = i - 1n; s > -1n; --s) {
@@ -110,8 +106,8 @@ const R = new TextEncoder(), p = (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 C(n) << t;
-}, D = (n, t) => BigInt.asUintN(32, n >> (t & 31n) | n << (-t & 31n)), E = (n, t) => (n >>> (t & 31) | n << (-t & 31)) >>> 0, w = (n, t) => {
+  return V(n) << t;
+}, C = (n, t) => BigInt.asUintN(32, n >> (t & 31n) | n << (-t & 31n)), N = (n, t) => (n >>> (t & 31) | n << (-t & 31)) >>> 0, w = (n, t) => {
   if (t < 1n || t % 2n === 0n)
     throw Error("`n` is invalid");
   for (; n < 0n; )
@@ -136,12 +132,15 @@ const R = new TextEncoder(), p = (n, t) => {
     e ** 2n < n ? t = e : r = e;
   }
   return n === t ** 2n || n === (t + 1n) ** 2n;
-}, N = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn], $ = 0x5851f42d4c957f2dn;
-class Z {
+}, I = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn], D = 0x5851f42d4c957f2dn;
+class X {
   /**
    * length = 2, `[state, increment]`
    */
   #t = new BigUint64Array(2);
+  get [Symbol.toStringTag]() {
+    return "PCGMinimal";
+  }
   /** シード値の配列を返す */
   static getSeed() {
     return crypto.getRandomValues(new BigUint64Array(2));
@@ -150,18 +149,18 @@ class Z {
    * @param seeds 64bit整数の配列 (長さ2以上), 省略した場合, 常に同じ値によって初期化される
    */
   constructor(t) {
-    t ? (this.#t[1] = t[1] << 1n | 1n, this.#n(), this.#t[0] = t[0], this.#n()) : (this.#t[0] = N[0], this.#t[1] = N[1]);
+    t ? (this.#t[1] = t[1] << 1n | 1n, this.#n(), this.#t[0] = t[0], this.#n()) : (this.#t[0] = I[0], this.#t[1] = I[1]);
   }
   /** 内部状態を1サイクル進める */
   #n() {
-    this.#t[0] = this.#t[0] * $ + this.#t[1];
+    this.#t[0] = this.#t[0] * D + this.#t[1];
   }
   /** 32bit 乱数を返す (内部状態は変わらない) */
   get #r() {
     const t = this.#t[0];
     if (!t) throw Error("empty state");
     const r = t >> 59n, e = BigInt.asUintN(32, (t ^ t >> 18n) >> 27n);
-    return E(Number(e), Number(r));
+    return N(Number(e), Number(r));
   }
   /** 内部状態を1進め、乱数を返す \
    *  普通はこれを使う
@@ -188,7 +187,7 @@ class Z {
       yield typeof r == "number" ? this.getBoundedRand(r) : this.getRand();
   }
 }
-const K = (n) => {
+const $ = (n) => {
   if (n <= 1n) return !1;
   if (n % 2n === 0n) return n === 2n;
   let t = n - 1n, r = 0n;
@@ -202,7 +201,7 @@ const K = (n) => {
     o = o * o % n;
   }
   return !1;
-}, v = (n) => {
+}, K = (n) => {
   let t = 5n, r = w(t, n);
   for (; r > 0n; ) {
     if (t = t > 0n ? t + 2n : t - 2n, t *= -1n, t === -15n && P(n))
@@ -216,21 +215,21 @@ const K = (n) => {
   for (const c of o)
     [i, s] = [a(i * s, t), y(s * s + e * i * i, t)], c === "1" && ([i, s] = [y(r * i + s, t), y(e * i + r * s, t)]);
   return [i, s];
-}, k = (n, t, r, e) => {
+}, G = (n, t, r, e) => {
   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, c] = J(i, n, r, t);
-  let l = c;
+  let u = c;
   if (o === 0n) return !0;
   e = g(e, i, n);
-  for (let u = 0n; u < s; u++) {
-    if (l === 0n) return !0;
-    l = a(l * l - 2n * e, n), e = g(e, 2n, n);
+  for (let l = 0n; l < s; l++) {
+    if (u === 0n) return !0;
+    u = a(u * u - 2n * e, n), e = g(e, 2n, n);
   }
   return !1;
-}, I = (n) => {
+}, B = (n) => {
   if (n <= 1n) return !1;
   if (n % 2n === 0n) return n === 2n;
   const t = [
@@ -264,36 +263,39 @@ const K = (n) => {
   for (const s of t)
     if (n % s === 0n)
       return n === s;
-  if (!K(n))
+  if (!$(n))
     return !1;
-  const [r, e] = v(n);
+  const [r, e] = K(n);
   if (e === 0n) return !1;
   const i = (1n - r) / 4n;
-  return k(n, r, 1n, i);
-}, z = (n, t) => {
+  return G(n, r, 1n, i);
+}, k = (n, t) => {
   if (t < 2n)
     throw Error("noPrimesFound");
   for (let e = 0; e < 1e5; e++) {
-    const i = S(n, t);
-    if (I(i)) return i;
+    const i = A(n, t);
+    if (B(i)) return i;
   }
   throw Error("noPrimesFound");
-}, G = (n, t = !1) => {
+}, z = (n, t = !1) => {
   if (n < 2)
     throw Error("noPrimesFound");
   for (let e = 0; e < 1e5; e++) {
-    const i = B(n, t);
-    if (I(i)) return i;
+    const i = S(n, t);
+    if (B(i)) return i;
   }
   throw Error("noPrimesFound");
 };
 class f {
   #t;
   #n;
+  get [Symbol.toStringTag]() {
+    return "Fraction";
+  }
   /**
-   * 
-   * @param numerator 
-   * @param denominator 
+   *
+   * @param numerator
+   * @param denominator
    */
   constructor(t, r) {
     r === 0n ? (this.#n = 0n, this.#t = t === 0n ? 0n : t > 0n ? 1n : -1n) : r > 0n ? (this.#t = t, this.#n = r) : (this.#t = -t, this.#n = -r), this.#r();
@@ -314,20 +316,20 @@ class f {
     if (s === 0)
       return new f(e ? -i : i, 1n);
     t = 1 / s;
-    let [o, c] = [1n, i], [l, u] = [0n, 1n];
-    for (; `${u}`.length < r + 1; ) {
+    let [o, c] = [1n, i], [u, l] = [0n, 1n];
+    for (; `${l}`.length < r + 1; ) {
       const h = BigInt(Math.floor(t)), d = t - Number(h);
-      if ([o, c] = [c, h * c + o], [l, u] = [u, h * u + l], d === 0)
-        return new f(e ? -c : c, u);
+      if ([o, c] = [c, h * c + o], [u, l] = [l, h * l + u], d === 0)
+        return new f(e ? -c : c, l);
       t = 1 / d;
     }
-    return new f(e ? -o : o, l);
+    return new f(e ? -o : o, u);
   }
   /**
    * reduction
    */
   #r() {
-    const { gcd: t } = A(this.#t, this.#n);
+    const { gcd: t } = E(this.#t, this.#n);
     t !== 0n && (this.#t /= t, this.#n /= t);
   }
   /**
@@ -359,7 +361,7 @@ class f {
    * @returns
    */
   substr(t) {
-    return new f(this.#t, this.#n).add(t.minus());
+    return this.add(t.minus());
   }
   /**
    * returns `this * right`
@@ -376,14 +378,12 @@ class f {
    * @returns
    */
   divide(t) {
-    return new f(this.#t, this.#n).multiply(
-      t.inverse()
-    );
+    return this.multiply(t.inverse());
   }
   /**
    * mediant
-   * @param right 
-   * @returns 
+   * @param right
+   * @returns
    */
   mediant(t) {
     const r = this.#n + t.#n, e = this.#t + t.#t;
@@ -409,16 +409,19 @@ class f {
   toJSON() {
     return {
       type: "Fraction",
-      numerator: "0x" + this.#t.toString(16),
-      denominator: "0x" + this.#n.toString(16)
+      value: ["0x" + this.#t.toString(16), "0x" + this.#n.toString(16)]
     };
   }
+  static fromData(t) {
+    const r = BigInt(t.value[0]), e = BigInt(t.value[1]);
+    return new f(r, e);
+  }
   static parse(t) {
-    const r = JSON.parse(t), { type: e, numerator: i, denominator: s } = r;
+    const r = JSON.parse(t), { type: e, value: i } = r;
     if (e !== "Fraction") throw Error("cannot parse");
-    if (typeof i == "string" && typeof s == "string") {
-      const o = BigInt(i), c = BigInt(s);
-      return new f(o, c);
+    if (Array.isArray(i) && i.length === 2) {
+      const s = BigInt(i[0]), o = BigInt(i[1]);
+      return new f(s, o);
     } else
       throw Error("cannot parse");
   }
@@ -431,86 +434,119 @@ const H = (n) => {
 }, W = (n) => {
   const t = Array.from(n, (r) => r.toString(16).padStart(2, "0")).join("") || "00";
   return BigInt("0x" + t);
-}, U = (n) => {
+}, O = (n) => {
   if (b())
     return Buffer.copyBytesFrom(n).toString("base64");
   {
     const t = Array.from(n, (r) => String.fromCharCode(r)).join("");
     return btoa(t);
   }
-}, j = (n) => {
+}, U = (n) => {
   if (b()) {
     const t = Buffer.from(n, "base64");
     return new Uint8Array(t.buffer, t.byteOffset, t.byteLength);
   } else
     return Uint8Array.from(atob(n), (t) => t.charCodeAt(0));
-}, X = (n) => U(n).replaceAll(/\+/g, "-").replaceAll(/\//g, "_").replaceAll(/=*$/g, ""), Y = (n) => {
+}, F = (n) => O(n).replaceAll(/\+/g, "-").replaceAll(/\//g, "_").replaceAll(/=*$/g, ""), Q = (n) => {
   const t = n.length & 3;
   t > 0 && (n = n + "=".repeat(4 - t));
   const r = n.replaceAll(/-/g, "+").replaceAll(/_/g, "/");
-  return j(r);
-}, F = {
+  return U(r);
+}, Y = Symbol("for-branded-type");
+class Z {
+  get [Symbol.toStringTag]() {
+    return "Queue";
+  }
+  #t;
+  #n = [];
+  constructor(...t) {
+    this.#t = t;
+  }
+  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();
+        t !== void 0 && 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();
+  }
+}
+const tt = {
   isEqual: p,
-  sleep: x,
-  lazify: M,
-  parseCSV: T,
+  sleep: T,
+  lazify: x,
+  parseCSV: M,
   getHash: _,
   isNode: b,
-  toBigInt: L
-}, Q = {
-  getRndInt: V,
+  toBigInt: v
+}, nt = {
+  getRndInt: L,
   residue: a,
-  getRandBIByBitLength: B,
-  getRandBIByRange: S,
+  getRandBIByBitLength: S,
+  getRandBIByRange: A,
   modPow: g,
-  exEuclidean: A,
+  exEuclidean: E,
   factorial: q,
-  rot32: E,
-  rot32BI: D,
+  rot32: N,
+  rot32BI: C,
   jacobiSymbol: w,
   isSquare: P,
-  bailliePSW: I,
-  getRandPrimeByBitLength: G,
-  getRandPrimeByRange: z
-}, tt = {
-  base64ToU8Arr: j,
-  base64UrlToU8Arr: Y,
-  u8ArrToBase64: U,
-  u8ArrToBase64Url: X,
+  bailliePSW: B,
+  getRandPrimeByBitLength: z,
+  getRandPrimeByRange: k
+}, rt = {
+  base64ToU8Arr: U,
+  base64UrlToU8Arr: Q,
+  u8ArrToBase64: O,
+  u8ArrToBase64Url: F,
   BItoU8Arr: H,
   u8ArrToBI: W
 };
 export {
   H as BItoU8Arr,
-  Q as Calc,
+  Y as Brand,
+  nt as Calc,
   f as Fraction,
-  Z as PCGMinimal,
-  tt as U8Ext,
-  F as Util,
-  I as bailliePSW,
-  j as base64ToU8Arr,
-  Y as base64UrlToU8Arr,
-  A as exEuclidean,
+  X as PCGMinimal,
+  Z as Queue,
+  rt as U8Ext,
+  tt as Util,
+  B as bailliePSW,
+  U as base64ToU8Arr,
+  Q as base64UrlToU8Arr,
+  E as exEuclidean,
   q as factorial,
   _ as getHash,
-  B as getRandBIByBitLength,
-  S as getRandBIByRange,
-  G as getRandPrimeByBitLength,
-  z as getRandPrimeByRange,
-  V as getRndInt,
+  S as getRandBIByBitLength,
+  A as getRandBIByRange,
+  z as getRandPrimeByBitLength,
+  k as getRandPrimeByRange,
+  L as getRndInt,
   p as isEqual,
   b as isNode,
   P as isSquare,
   w as jacobiSymbol,
-  M as lazify,
+  x as lazify,
   g as modPow,
-  T as parseCSV,
+  M as parseCSV,
   a as residue,
-  E as rot32,
-  D as rot32BI,
-  x as sleep,
-  L as toBigInt,
+  N as rot32,
+  C as rot32BI,
+  T as sleep,
+  v as toBigInt,
   W as u8ArrToBI,
-  U as u8ArrToBase64,
-  X as u8ArrToBase64Url
+  O as u8ArrToBase64,
+  F as u8ArrToBase64Url
 };

package/dist/bundle.umd.cjs

@@ -1,2 +1,2 @@
-(function(l,g){typeof exports=="object"&&typeof module<"u"?g(exports):typeof define=="function"&&define.amd?define(["exports"],g):(l=typeof globalThis<"u"?globalThis:l||self,g(l["util-fns"]={}))})(this,(function(l){"use strict";const g=new TextEncoder,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"||typeof n>"u")return n===t;if(typeof n=="number")return Number.isNaN(n)&&Number.isNaN(t)||n===t;if(n===null)return n===t;if(typeof n=="function")throw Error("comparing these objects is still unavailable");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(e==="[object Object]"){const i=n,s=t,o=Object.getOwnPropertyNames(n),c=Object.getOwnPropertyNames(t);o.push(...Object.getOwnPropertySymbols(n)),c.push(...Object.getOwnPropertySymbols(t));for(const u of o){const a=c.find(nt=>nt===u);if(a===void 0)return!1;const[y,I]=[i[u],s[a]];if(!m(y,I))return!1}return!0}throw Error("comparing these objects is still unavailable")},j=n=>new Promise(t=>{setTimeout(()=>{t()},n)}),O=n=>(...t)=>()=>n(...t),M=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},L=async(n,t)=>{const e=g.encode(n),r=await crypto.subtle.digest(t,e);return new Uint8Array(r)},_=(...n)=>n.map(t=>BigInt(t)),w=()=>typeof globalThis.process<"u"&&typeof globalThis.require<"u",C=(n,t)=>Math.floor(Math.random()*(t-n)+n),h=(n,t)=>{const e=n%t;return e<0n?e+t:e},b=(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(/^./,"1")),BigInt("0b"+i)},S=(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 c=b(r);if(c>=d(2n,BigInt(r),e))return c%e}throw Error("Failed to generate a random bigint")})();return n+i},d=(n,t,e)=>{if(e<1n)throw Error("`mod` must be positive");if(t<0n)throw Error("`power` must not be negative");for(;n<0n;)n+=e;if(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},N=(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,c]=[0n,-1n,t];for(;;){const u=i/c,a=i-u*c;if(a===0n)break;[e,s]=[s,e-u*s],[r,o]=[o,r-u*o],[i,c]=[c,a]}return c<0n&&(s*=-1n,o*=-1n,c*=-1n),{x:s,y:o,gcd:c}},A=(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 u=n+2n;u<t;u+=2n)c*=u;return c}const i=n+r|1n,s=A(n,i),o=A(i,t);return s*o},J=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*=A(t,o),t=o,e*=r}return e},V=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 J(n)<<t},q=(n,t)=>BigInt.asUintN(32,n>>(t&31n)|n<<(-t&31n)),E=(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;)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},D=[0x853c49e6748fea9bn,0xda3e39cb94b95bdbn],W=0x5851f42d4c957f2dn;class k{#t=new BigUint64Array(2);static getSeed(){return crypto.getRandomValues(new BigUint64Array(2))}constructor(t){t?(this.#t[1]=t[1]<<1n|1n,this.#n(),this.#t[0]=t[0],this.#n()):(this.#t[0]=D[0],this.#t[1]=D[1])}#n(){this.#t[0]=this.#t[0]*W+this.#t[1]}get#e(){const t=this.#t[0];if(!t)throw Error("empty state");const e=t>>59n,r=BigInt.asUintN(32,(t^t>>18n)>>27n);return E(Number(r),Number(e))}getRand(){return this.#n(),this.#e}getBoundedRand(t){if(t>4294967296)throw Error("`bound` exceeded limit (2^32)");const r=4294967296%t;for(;;){const i=this.getRand();if(i>=r)return i%t}}*genRands(t,e){for(let r=0;r<t;r++)yield typeof e=="number"?this.getBoundedRand(e):this.getRand()}}const X=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=d(2n,r,n);if(o===1n)return!0;for(let c=0n;c<i;c++){if(o===n-1n)return!0;o=o*o%n}return!1},Y=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?h(n+t>>1n,t):h(n>>1n,t),Z=(n,t,e,r)=>{let i=1n,s=e;const o=n.toString(2).slice(1);for(const c of o)[i,s]=[h(i*s,t),U(s*s+r*i*i,t)],c==="1"&&([i,s]=[U(e*i+s,t),U(r*i+e*s,t)]);return[i,s]},F=(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,c]=Z(i,n,e,t);let u=c;if(o===0n)return!0;r=d(r,i,n);for(let a=0n;a<s;a++){if(u===0n)return!0;u=h(u*u-2n*r,n),r=d(r,2n,n)}return!1},p=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(!X(n))return!1;const[e,r]=Y(n);if(r===0n)return!1;const i=(1n-e)/4n;return F(n,e,1n,i)},$=(n,t)=>{if(t<2n)throw Error("noPrimesFound");for(let r=0;r<1e5;r++){const i=S(n,t);if(p(i))return i}throw Error("noPrimesFound")},v=(n,t=!1)=>{if(n<2)throw Error("noPrimesFound");for(let r=0;r<1e5;r++){const i=b(n,t);if(p(i))return i}throw Error("noPrimesFound")};class f{#t;#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()}static fromDecimal(t,e=20){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,c]=[1n,i],[u,a]=[0n,1n];for(;`${a}`.length<e+1;){const y=BigInt(Math.floor(t)),I=t-Number(y);if([o,c]=[c,y*c+o],[u,a]=[a,y*a+u],I===0)return new f(r?-c:c,a);t=1/I}return new f(r?-o:o,u)}#e(){const{gcd:t}=N(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 new f(this.#t,this.#n).add(t.minus())}multiply(t){const e=this.#n*t.#n,r=this.#t*t.#t;return new f(r,e)}divide(t){return new f(this.#t,this.#n).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:"Fraction",numerator:"0x"+this.#t.toString(16),denominator:"0x"+this.#n.toString(16)}}static parse(t){const e=JSON.parse(t),{type:r,numerator:i,denominator:s}=e;if(r!=="Fraction")throw Error("cannot parse");if(typeof i=="string"&&typeof s=="string"){const o=BigInt(i),c=BigInt(s);return new f(o,c)}else throw Error("cannot parse")}}const K=n=>{let t=n.toString(16);t.length&1&&(t="0"+t);const e=[...t.match(/.{2}/g)??[]];return Uint8Array.from(e,r=>Number.parseInt(r,16))},z=n=>{const t=Array.from(n,e=>e.toString(16).padStart(2,"0")).join("")||"00";return BigInt("0x"+t)},R=n=>{if(w())return Buffer.copyBytesFrom(n).toString("base64");{const t=Array.from(n,e=>String.fromCharCode(e)).join("");return btoa(t)}},T=n=>{if(w()){const t=Buffer.from(n,"base64");return new Uint8Array(t.buffer,t.byteOffset,t.byteLength)}else return Uint8Array.from(atob(n),t=>t.charCodeAt(0))},G=n=>R(n).replaceAll(/\+/g,"-").replaceAll(/\//g,"_").replaceAll(/=*$/g,""),H=n=>{const t=n.length&3;t>0&&(n=n+"=".repeat(4-t));const e=n.replaceAll(/-/g,"+").replaceAll(/_/g,"/");return T(e)},Q={isEqual:m,sleep:j,lazify:O,parseCSV:M,getHash:L,isNode:w,toBigInt:_},x={getRndInt:C,residue:h,getRandBIByBitLength:b,getRandBIByRange:S,modPow:d,exEuclidean:N,factorial:V,rot32:E,rot32BI:q,jacobiSymbol:B,isSquare:P,bailliePSW:p,getRandPrimeByBitLength:v,getRandPrimeByRange:$},tt={base64ToU8Arr:T,base64UrlToU8Arr:H,u8ArrToBase64:R,u8ArrToBase64Url:G,BItoU8Arr:K,u8ArrToBI:z};l.BItoU8Arr=K,l.Calc=x,l.Fraction=f,l.PCGMinimal=k,l.U8Ext=tt,l.Util=Q,l.bailliePSW=p,l.base64ToU8Arr=T,l.base64UrlToU8Arr=H,l.exEuclidean=N,l.factorial=V,l.getHash=L,l.getRandBIByBitLength=b,l.getRandBIByRange=S,l.getRandPrimeByBitLength=v,l.getRandPrimeByRange=$,l.getRndInt=C,l.isEqual=m,l.isNode=w,l.isSquare=P,l.jacobiSymbol=B,l.lazify=O,l.modPow=d,l.parseCSV=M,l.residue=h,l.rot32=E,l.rot32BI=q,l.sleep=j,l.toBigInt=_,l.u8ArrToBI=z,l.u8ArrToBase64=R,l.u8ArrToBase64Url=G,Object.defineProperty(l,Symbol.toStringTag,{value:"Module"})}));
+(function(o,d){typeof exports=="object"&&typeof module<"u"?d(exports):typeof define=="function"&&define.amd?define(["exports"],d):(o=typeof globalThis<"u"?globalThis:o||self,d(o["util-fns"]={}))})(this,(function(o){"use strict";const d=new TextEncoder,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=="number"||typeof n=="bigint"||typeof n=="boolean"||typeof n=="symbol"||typeof n>"u"||n===null)return n===t;if(typeof n=="function")throw Error("comparing these objects is still unavailable");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(e==="[object Object]"){const i=n,s=t,u=Object.getOwnPropertyNames(n),l=Object.getOwnPropertyNames(t);u.push(...Object.getOwnPropertySymbols(n)),l.push(...Object.getOwnPropertySymbols(t));for(const c of u){const h=l.find(rt=>rt===c);if(h===void 0)return!1;const[y,S]=[i[c],s[h]];if(!m(y,S))return!1}return!0}throw Error("comparing these objects is still unavailable")},j=n=>new Promise(t=>{setTimeout(()=>{t()},n)}),O=n=>(...t)=>()=>n(...t),M=n=>{const t=[];let e=[],r="",i=!1;for(let s=0;s<n.length;s++){const u=n[s];u==='"'&&(s===0||n[s-1]!=="\\")?i=!i:u===","&&!i?(e.push(r.trim()),r=""):u===`
+`&&!i?(e.push(r.trim()),t.push(e),e=[],r=""):r+=u}return e.push(r.trim()),t.push(e),t},_=async(n,t)=>{const e=d.encode(n),r=await crypto.subtle.digest(t,e);return new Uint8Array(r)},C=(...n)=>n.map(t=>BigInt(t)),w=()=>typeof globalThis.process<"u"&&typeof globalThis.require<"u",L=(n,t)=>Math.floor(Math.random()*(t-n)+n),a=(n,t)=>{const e=n%t;return e<0n?e+t:e},b=(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(/^./,"1")),BigInt("0b"+i)},I=(n,t)=>{if(n>=t)throw Error("rangeError");const e=t-n,r=e.toString(2).length,i=(()=>{for(let u=0;u<1e5;u++){const l=b(r);if(l>=g(2n,BigInt(r),e))return l%e}throw Error("Failed to generate a random bigint")})();return n+i},g=(n,t,e)=>{if(e<1n)throw Error("`mod` must be positive");if(t<0n)throw Error("`power` must not be negative");for(;n<0n;)n+=e;if(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,u,l]=[0n,-1n,t];for(;;){const c=i/l,h=i-c*l;if(h===0n)break;[e,s]=[s,e-c*s],[r,u]=[u,r-c*u],[i,l]=[l,h]}return l<0n&&(s*=-1n,u*=-1n,l*=-1n),{x:s,y:u,gcd:l}},E=(n,t)=>{if(n>=t)return 1n;const e=BigInt((t-2n).toString(2).length),r=(t-n)/2n;if(e*r<63n){let l=n;for(let c=n+2n;c<t;c+=2n)l*=c;return l}const i=n+r|1n,s=E(n,i),u=E(i,t);return s*u},H=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 u=(n>>s)+1n|1n;r*=E(t,u),t=u,e*=r}return e},q=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 H(n)<<t},v=(n,t)=>BigInt.asUintN(32,n>>(t&31n)|n<<(-t&31n)),P=(n,t)=>(n>>>(t&31)|n<<(-t&31))>>>0,p=(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},N=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},V=[0x853c49e6748fea9bn,0xda3e39cb94b95bdbn],W=0x5851f42d4c957f2dn;class k{#t=new BigUint64Array(2);get[Symbol.toStringTag](){return"PCGMinimal"}static getSeed(){return crypto.getRandomValues(new BigUint64Array(2))}constructor(t){t?(this.#t[1]=t[1]<<1n|1n,this.#n(),this.#t[0]=t[0],this.#n()):(this.#t[0]=V[0],this.#t[1]=V[1])}#n(){this.#t[0]=this.#t[0]*W+this.#t[1]}get#e(){const t=this.#t[0];if(!t)throw Error("empty state");const e=t>>59n,r=BigInt.asUintN(32,(t^t>>18n)>>27n);return P(Number(r),Number(e))}getRand(){return this.#n(),this.#e}getBoundedRand(t){if(t>4294967296)throw Error("`bound` exceeded limit (2^32)");const r=4294967296%t;for(;;){const i=this.getRand();if(i>=r)return i%t}}*genRands(t,e){for(let r=0;r<t;r++)yield typeof e=="number"?this.getBoundedRand(e):this.getRand()}}const F=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 u=g(2n,r,n);if(u===1n)return!0;for(let l=0n;l<i;l++){if(u===n-1n)return!0;u=u*u%n}return!1},Q=n=>{let t=5n,e=p(t,n);for(;e>0n;){if(t=t>0n?t+2n:t-2n,t*=-1n,t===-15n&&N(n))return[0n,0n];e=p(t,n)}return[t,e]},T=(n,t)=>(n&1n)===1n?a(n+t>>1n,t):a(n>>1n,t),X=(n,t,e,r)=>{let i=1n,s=e;const u=n.toString(2).slice(1);for(const l of u)[i,s]=[a(i*s,t),T(s*s+r*i*i,t)],l==="1"&&([i,s]=[T(e*i+s,t),T(r*i+e*s,t)]);return[i,s]},Y=(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[u,l]=X(i,n,e,t);let c=l;if(u===0n)return!0;r=g(r,i,n);for(let h=0n;h<s;h++){if(c===0n)return!0;c=a(c*c-2n*r,n),r=g(r,2n,n)}return!1},B=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(!F(n))return!1;const[e,r]=Q(n);if(r===0n)return!1;const i=(1n-e)/4n;return Y(n,e,1n,i)},D=(n,t)=>{if(t<2n)throw Error("noPrimesFound");for(let r=0;r<1e5;r++){const i=I(n,t);if(B(i))return i}throw Error("noPrimesFound")},$=(n,t=!1)=>{if(n<2)throw Error("noPrimesFound");for(let r=0;r<1e5;r++){const i=b(n,t);if(B(i))return i}throw Error("noPrimesFound")};class f{#t;#n;get[Symbol.toStringTag](){return"Fraction"}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=20){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[u,l]=[1n,i],[c,h]=[0n,1n];for(;`${h}`.length<e+1;){const y=BigInt(Math.floor(t)),S=t-Number(y);if([u,l]=[l,y*l+u],[c,h]=[h,y*h+c],S===0)return new f(r?-l:l,h);t=1/S}return new f(r?-u:u,c)}#e(){const{gcd:t}=A(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:"Fraction",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 e=JSON.parse(t),{type:r,value:i}=e;if(r!=="Fraction")throw Error("cannot parse");if(Array.isArray(i)&&i.length===2){const s=BigInt(i[0]),u=BigInt(i[1]);return new f(s,u)}else throw Error("cannot parse")}}const K=n=>{let t=n.toString(16);t.length&1&&(t="0"+t);const e=[...t.match(/.{2}/g)??[]];return Uint8Array.from(e,r=>Number.parseInt(r,16))},G=n=>{const t=Array.from(n,e=>e.toString(16).padStart(2,"0")).join("")||"00";return BigInt("0x"+t)},U=n=>{if(w())return Buffer.copyBytesFrom(n).toString("base64");{const t=Array.from(n,e=>String.fromCharCode(e)).join("");return btoa(t)}},R=n=>{if(w()){const t=Buffer.from(n,"base64");return new Uint8Array(t.buffer,t.byteOffset,t.byteLength)}else return Uint8Array.from(atob(n),t=>t.charCodeAt(0))},J=n=>U(n).replaceAll(/\+/g,"-").replaceAll(/\//g,"_").replaceAll(/=*$/g,""),z=n=>{const t=n.length&3;t>0&&(n=n+"=".repeat(4-t));const e=n.replaceAll(/-/g,"+").replaceAll(/_/g,"/");return R(e)},Z=Symbol("for-branded-type");class x{get[Symbol.toStringTag](){return"Queue"}#t;#n=[];constructor(...t){this.#t=t}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();t!==void 0&&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()}}const tt={isEqual:m,sleep:j,lazify:O,parseCSV:M,getHash:_,isNode:w,toBigInt:C},nt={getRndInt:L,residue:a,getRandBIByBitLength:b,getRandBIByRange:I,modPow:g,exEuclidean:A,factorial:q,rot32:P,rot32BI:v,jacobiSymbol:p,isSquare:N,bailliePSW:B,getRandPrimeByBitLength:$,getRandPrimeByRange:D},et={base64ToU8Arr:R,base64UrlToU8Arr:z,u8ArrToBase64:U,u8ArrToBase64Url:J,BItoU8Arr:K,u8ArrToBI:G};o.BItoU8Arr=K,o.Brand=Z,o.Calc=nt,o.Fraction=f,o.PCGMinimal=k,o.Queue=x,o.U8Ext=et,o.Util=tt,o.bailliePSW=B,o.base64ToU8Arr=R,o.base64UrlToU8Arr=z,o.exEuclidean=A,o.factorial=q,o.getHash=_,o.getRandBIByBitLength=b,o.getRandBIByRange=I,o.getRandPrimeByBitLength=$,o.getRandPrimeByRange=D,o.getRndInt=L,o.isEqual=m,o.isNode=w,o.isSquare=N,o.jacobiSymbol=p,o.lazify=O,o.modPow=g,o.parseCSV=M,o.residue=a,o.rot32=P,o.rot32BI=v,o.sleep=j,o.toBigInt=C,o.u8ArrToBI=G,o.u8ArrToBase64=U,o.u8ArrToBase64Url=J,Object.defineProperty(o,Symbol.toStringTag,{value:"Module"})}));

package/dist/fraction.d.ts

@@ -1,10 +1,11 @@
 export type FractionData = {
     type: 'Fraction';
-    numerator: string;
-    denominator: string;
+    /** `[numerator, denominator]` */
+    value: [string, string];
 };
 declare class Fraction {
     #private;
+    get [Symbol.toStringTag](): string;
     /**
      *
      * @param numerator
@@ -69,6 +70,7 @@ declare class Fraction {
     toString(): string;
     valueOf(): number;
     toJSON(): FractionData;
+    static fromData(data: FractionData): Fraction;
     static parse(text: string): Fraction;
 }
 export default Fraction;

package/dist/pcg-minimal.d.ts

@@ -3,6 +3,7 @@
  */
 export default class PCGMinimal {
     #private;
+    get [Symbol.toStringTag](): string;
     /** シード値の配列を返す */
     static getSeed(): BigUint64Array<ArrayBuffer>;
     /**

package/dist/queue.d.ts

@@ -0,0 +1,10 @@
+export default class Queue<T> {
+    #private;
+    get [Symbol.toStringTag](): string;
+    constructor(...data: T[]);
+    enqueue(...data: T[]): number;
+    dequeue(): T | undefined;
+    toArray(): T[];
+    toJSON(): T[];
+    toString(): string;
+}

package/package.json

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