@tktb-tess/util-fns 0.3.0 → 0.3.2

package/dist/brand.d.ts

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

package/dist/bundle.d.ts

@@ -1,20 +1,22 @@
-import { isEqArray, sleep, lazify, parseCSV, getHash } from './util';
-import { getRndInt, residue, toBigInt, getRandBIByBitLength, getRandBIByRange, modPow, exEuclidean, factorial, rot32, rot32BI, jacobiSymbol, isSquare } from './math';
+import { isEqual, sleep, lazify, parseCSV, getHash, toBigInt, isNode } from './util';
+import { getRndInt, residue, getRandBIByBitLength, getRandBIByRange, modPow, exEuclidean, factorial, rot32, rot32BI, jacobiSymbol, isSquare } from './math';
 import { default as PCGMinimal } from './pcg-minimal';
 import { bailliePSW, getRandPrimeByBitLength, getRandPrimeByRange } from './baillie-psw';
 import { default as Fraction } from './fraction';
 import { base64ToU8Arr, base64UrlToU8Arr, u8ArrToBase64, u8ArrToBase64Url, BItoU8Arr, u8ArrToBI } from './u8arr-ext';
+import { Brand } from './brand';
 declare const Util: {
-    isEqArray: <T>(arr1: T[], arr2: T[]) => boolean;
+    isEqual: (a: unknown, b: unknown) => boolean;
     sleep: (delay: number) => Promise<void>;
     lazify: <ArgT extends unknown[], RetT>(func: (...args: ArgT) => RetT) => (...args: ArgT) => () => RetT;
     parseCSV: (csv: string) => string[][];
     getHash: (str: string, algorithm: AlgorithmIdentifier) => Promise<Uint8Array<ArrayBuffer>>;
+    isNode: () => boolean;
+    toBigInt: (...nums: number[]) => bigint[];
 };
-declare const AdMath: {
+declare const Calc: {
     getRndInt: (min: number, max: number) => number;
     residue: (n: bigint, mod: bigint) => bigint;
-    toBigInt: (...nums: number[]) => bigint[];
     getRandBIByBitLength: (length: number, fixed?: boolean) => bigint;
     getRandBIByRange: (min: bigint, max: bigint) => bigint;
     modPow: (base: bigint, power: bigint, mod: bigint) => bigint;
@@ -28,8 +30,6 @@ declare const AdMath: {
     rot32BI: (value: bigint, rot: bigint) => bigint;
     jacobiSymbol: (a: bigint, n: bigint) => bigint;
     isSquare: (n: bigint) => boolean;
-};
-declare const Prime: {
     bailliePSW: (n: bigint) => boolean;
     getRandPrimeByBitLength: (bitLength: number, fixed?: boolean) => bigint;
     getRandPrimeByRange: (min: bigint, max: bigint) => bigint;
@@ -42,4 +42,4 @@ declare const U8Ext: {
     BItoU8Arr: (n: bigint) => Uint8Array<ArrayBuffer>;
     u8ArrToBI: (buf: Uint8Array) => bigint;
 };
-export { isEqArray, sleep, lazify, parseCSV, getHash, getRndInt, residue, toBigInt, getRandBIByBitLength, getRandBIByRange, modPow, exEuclidean, factorial, rot32, rot32BI, jacobiSymbol, isSquare, bailliePSW, getRandPrimeByBitLength, getRandPrimeByRange, PCGMinimal, Fraction, Util, AdMath, Prime, base64ToU8Arr, base64UrlToU8Arr, u8ArrToBase64, u8ArrToBase64Url, BItoU8Arr, u8ArrToBI, U8Ext, };
+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, };

package/dist/bundle.js

@@ -1,45 +1,69 @@
-const R = new TextEncoder(), x = (n, t) => {
-  if (n.length !== t.length) return !1;
-  for (let r = 0; r < n.length; r++)
-    if (n[r] !== t[r]) return !1;
-  return !0;
-}, _ = (n) => new Promise((t) => {
+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 == "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 (!p(n[i], t[i])) return !1;
+    return !0;
+  }
+  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]];
+      if (!p(h, d)) return !1;
+    }
+    return !0;
+  }
+  throw Error("comparing these objects is still unavailable");
+}, x = (n) => new Promise((t) => {
   setTimeout(() => {
     t();
   }, n);
 }), M = (n) => (...t) => () => n(...t), T = (n) => {
   const t = [];
-  let r = [], e = "", s = !1;
-  for (let i = 0; i < n.length; i++) {
-    const o = n[i];
-    o === '"' && (i === 0 || n[i - 1] !== "\\") ? s = !s : o === "," && !s ? (r.push(e.trim()), e = "") : o === `
-` && !s ? (r.push(e.trim()), t.push(r), r = [], e = "") : e += o;
+  let r = [], e = "", i = !1;
+  for (let s = 0; s < n.length; s++) {
+    const o = n[s];
+    o === '"' && (s === 0 || n[s - 1] !== "\\") ? i = !i : o === "," && !i ? (r.push(e.trim()), e = "") : o === `
+` && !i ? (r.push(e.trim()), t.push(r), r = [], e = "") : e += o;
   }
   return r.push(e.trim()), t.push(r), t;
-}, L = async (n, t) => {
+}, _ = async (n, t) => {
   const r = R.encode(n), e = await crypto.subtle.digest(t, r);
   return new Uint8Array(e);
-}, I = typeof process < "u" && typeof process.versions.node < "u", V = (n, t) => Math.floor(Math.random() * (t - n) + n), h = (n, t) => {
+}, 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) => {
   const r = n % t;
   return r < 0n ? r + t : r;
-}, j = (...n) => n.map((t) => BigInt(t)), w = (n, t = !1) => {
+}, 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 r = Math.ceil(n / 8), e = crypto.getRandomValues(new Uint8Array(r));
-  let s = Array.from(e, (i) => i.toString(2).padStart(8, "0")).join("").slice(0, n);
-  return t && (s = s.replace(/^./, "1")), BigInt("0b" + s);
+  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) => {
   if (n >= t) throw Error("rangeError");
-  const r = t - n, e = r.toString(2).length, s = (() => {
+  const r = t - n, e = r.toString(2).length, i = (() => {
     for (let o = 0; o < 1e5; o++) {
-      const c = w(e);
-      if (c >= a(2n, BigInt(e), r))
+      const c = B(e);
+      if (c >= g(2n, BigInt(e), r))
         return c % r;
     }
     throw Error("Failed to generate a random bigint");
   })();
-  return n + s;
-}, a = (n, t, r) => {
+  return n + i;
+}, g = (n, t, r) => {
   if (r < 1n) throw Error("`mod` must be positive");
   if (t < 0n) throw Error("`power` must not be negative");
   for (; n < 0n; ) n += r;
@@ -56,29 +80,29 @@ const R = new TextEncoder(), x = (n, t) => {
     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 [r, e, s] = [1n, 0n, n], [i, o, c] = [0n, -1n, t];
+  let [r, e, i] = [1n, 0n, n], [s, o, c] = [0n, -1n, t];
   for (; ; ) {
-    const u = s / c, f = s - u * c;
-    if (f === 0n) break;
-    [r, i] = [i, r - u * i], [e, o] = [o, e - u * o], [s, c] = [c, f];
+    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];
   }
-  return c < 0n && (i *= -1n, o *= -1n, c *= -1n), { x: i, y: o, gcd: c };
+  return c < 0n && (s *= -1n, o *= -1n, c *= -1n), { x: s, y: o, gcd: c };
 }, m = (n, t) => {
   if (n >= t) return 1n;
   const r = BigInt((t - 2n).toString(2).length), e = (t - n) / 2n;
   if (r * e < 63n) {
     let c = n;
-    for (let u = n + 2n; u < t; u += 2n)
-      c *= u;
+    for (let l = n + 2n; l < t; l += 2n)
+      c *= l;
     return c;
   }
-  const s = n + e | 1n, i = m(n, s), o = m(s, t);
-  return i * o;
+  const i = n + e | 1n, s = m(n, i), o = m(i, t);
+  return s * o;
 }, C = (n) => {
   let t = 3n, r = 1n, e = 1n;
-  const s = BigInt(n.toString(2).length) - 1n;
-  for (let i = s - 1n; i > -1n; --i) {
-    const o = (n >> i) + 1n | 1n;
+  const i = BigInt(n.toString(2).length) - 1n;
+  for (let s = i - 1n; s > -1n; --s) {
+    const o = (n >> s) + 1n | 1n;
     e *= m(t, o), t = o, r *= e;
   }
   return r;
@@ -87,7 +111,7 @@ const R = new TextEncoder(), x = (n, t) => {
   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, p = (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) => {
   if (t < 1n || t % 2n === 0n)
     throw Error("`n` is invalid");
   for (; n < 0n; )
@@ -103,7 +127,7 @@ const R = new TextEncoder(), x = (n, t) => {
     [n, t] = [t, n], n % 4n === 3n && t % 4n === 3n && (r *= -1n), n %= t;
   }
   return t === 1n ? r : 0n;
-}, N = (n) => {
+}, P = (n) => {
   if (n < 0n) return !1;
   if (n === 0n) return !0;
   let t = 1n, r = n;
@@ -112,13 +136,12 @@ const R = new TextEncoder(), x = (n, t) => {
     e ** 2n < n ? t = e : r = e;
   }
   return n === t ** 2n || n === (t + 1n) ** 2n;
-}, O = Symbol(), b = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn], $ = 0x5851f42d4c957f2dn;
-class F {
+}, N = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn], $ = 0x5851f42d4c957f2dn;
+class Z {
   /**
    * length = 2, `[state, increment]`
    */
   #t = new BigUint64Array(2);
-  [O];
   /** シード値の配列を返す */
   static getSeed() {
     return crypto.getRandomValues(new BigUint64Array(2));
@@ -127,14 +150,14 @@ class F {
    * @param seeds 64bit整数の配列 (長さ2以上), 省略した場合, 常に同じ値によって初期化される
    */
   constructor(t) {
-    t ? (this.#t[1] = t[1] << 1n | 1n, this.step(), this.#t[0] = t[0], this.step()) : (this.#t[0] = b[0], this.#t[1] = b[1]);
+    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]);
   }
   /** 内部状態を1サイクル進める */
-  step() {
+  #n() {
     this.#t[0] = this.#t[0] * $ + this.#t[1];
   }
   /** 32bit 乱数を返す (内部状態は変わらない) */
-  get value() {
+  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);
@@ -144,15 +167,15 @@ class F {
    *  普通はこれを使う
    */
   getRand() {
-    return this.step(), this.value;
+    return this.#n(), this.#r;
   }
   /** `bound` 未満の乱数を返す */
   getBoundedRand(t) {
     if (t > 4294967296) throw Error("`bound` exceeded limit (2^32)");
     const e = 4294967296 % t;
     for (; ; ) {
-      const s = this.getRand();
-      if (s >= e) return s % t;
+      const i = this.getRand();
+      if (i >= e) return i % t;
     }
   }
   /**
@@ -165,49 +188,49 @@ class F {
       yield typeof r == "number" ? this.getBoundedRand(r) : this.getRand();
   }
 }
-const v = (n) => {
+const K = (n) => {
   if (n <= 1n) return !1;
   if (n % 2n === 0n) return n === 2n;
   let t = n - 1n, r = 0n;
   for (; t % 2n === 0n; )
     t >>= 1n, r += 1n;
-  const [e, s] = [t, r];
-  let o = a(2n, e, n);
+  const [e, i] = [t, r];
+  let o = g(2n, e, n);
   if (o === 1n) return !0;
-  for (let c = 0n; c < s; c++) {
+  for (let c = 0n; c < i; c++) {
     if (o === n - 1n) return !0;
     o = o * o % n;
   }
   return !1;
-}, J = (n) => {
-  let t = 5n, r = p(t, n);
+}, v = (n) => {
+  let t = 5n, r = w(t, n);
   for (; r > 0n; ) {
-    if (t = t > 0n ? t + 2n : t - 2n, t *= -1n, t === -15n && N(n))
+    if (t = t > 0n ? t + 2n : t - 2n, t *= -1n, t === -15n && P(n))
       return [0n, 0n];
-    r = p(t, n);
+    r = w(t, n);
   }
   return [t, r];
-}, g = (n, t) => (n & 1n) === 1n ? h(n + t >> 1n, t) : h(n >> 1n, t), k = (n, t, r, e) => {
-  let s = 1n, i = r;
+}, y = (n, t) => (n & 1n) === 1n ? a(n + t >> 1n, t) : a(n >> 1n, t), J = (n, t, r, e) => {
+  let i = 1n, s = r;
   const o = n.toString(2).slice(1);
   for (const c of o)
-    [s, i] = [h(s * i, t), g(i * i + e * s * s, t)], c === "1" && ([s, i] = [g(r * s + i, t), g(e * s + r * i, t)]);
-  return [s, i];
-}, z = (n, t, r, e) => {
+    [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) => {
   if (n % 2n !== 1n) throw Error("`n` must be odd");
-  let s = n + 1n, i = 0n;
-  for (; s % 2n === 0n; )
-    s >>= 1n, i += 1n;
-  const [o, c] = k(s, n, r, t);
-  let u = c;
+  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;
   if (o === 0n) return !0;
-  e = a(e, s, n);
-  for (let f = 0n; f < i; f++) {
-    if (u === 0n) return !0;
-    u = h(u * u - 2n * e, n), e = a(e, 2n, n);
+  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);
   }
   return !1;
-}, y = (n) => {
+}, I = (n) => {
   if (n <= 1n) return !1;
   if (n % 2n === 0n) return n === 2n;
   const t = [
@@ -238,36 +261,35 @@ const v = (n) => {
     97n,
     101n
   ];
-  for (const i of t)
-    if (n % i === 0n)
-      return n === i;
-  if (!v(n))
+  for (const s of t)
+    if (n % s === 0n)
+      return n === s;
+  if (!K(n))
     return !1;
-  const [r, e] = J(n);
+  const [r, e] = v(n);
   if (e === 0n) return !1;
-  const s = (1n - r) / 4n;
-  return z(n, r, 1n, s);
-}, G = (n, t) => {
+  const i = (1n - r) / 4n;
+  return k(n, r, 1n, i);
+}, z = (n, t) => {
   if (t < 2n)
     throw Error("noPrimesFound");
   for (let e = 0; e < 1e5; e++) {
-    const s = S(n, t);
-    if (y(s)) return s;
+    const i = S(n, t);
+    if (I(i)) return i;
   }
   throw Error("noPrimesFound");
-}, H = (n, t = !1) => {
+}, G = (n, t = !1) => {
   if (n < 2)
     throw Error("noPrimesFound");
   for (let e = 0; e < 1e5; e++) {
-    const s = w(n, t);
-    if (y(s)) return s;
+    const i = B(n, t);
+    if (I(i)) return i;
   }
   throw Error("noPrimesFound");
-}, W = Symbol();
-class l {
+};
+class f {
   #t;
   #n;
-  [W];
   /**
    * 
    * @param numerator 
@@ -283,23 +305,23 @@ class l {
    */
   static fromDecimal(t, r = 20) {
     if (Number.isNaN(t))
-      return new l(0n, 0n);
+      return new f(0n, 0n);
     if (Math.abs(t) === 1 / 0)
-      return new l(t > 0 ? 1n : -1n, 0n);
+      return new f(t > 0 ? 1n : -1n, 0n);
     const e = t < 0;
     e && (t *= -1);
-    const s = BigInt(Math.floor(t)), i = t - Number(s);
-    if (i === 0)
-      return new l(e ? -s : s, 1n);
-    t = 1 / i;
-    let [o, c] = [1n, s], [u, f] = [0n, 1n];
-    for (; `${f}`.length < r + 1; ) {
-      const d = BigInt(Math.floor(t)), B = t - Number(d);
-      if ([o, c] = [c, d * c + o], [u, f] = [f, d * f + u], B === 0)
-        return new l(e ? -c : c, f);
-      t = 1 / B;
+    const i = BigInt(Math.floor(t)), s = t - Number(i);
+    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; ) {
+      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);
+      t = 1 / d;
     }
-    return new l(e ? -o : o, u);
+    return new f(e ? -o : o, l);
   }
   /**
    * reduction
@@ -313,14 +335,14 @@ class l {
    * @returns
    */
   minus() {
-    return new l(-this.#t, this.#n);
+    return new f(-this.#t, this.#n);
   }
   /**
    * returns inverse of this fraction
    * @returns
    */
   inverse() {
-    return new l(this.#n, this.#t);
+    return new f(this.#n, this.#t);
   }
   /**
    * returns `this + right`
@@ -329,7 +351,7 @@ class l {
    */
   add(t) {
     const r = this.#n * t.#n, e = this.#t * t.#n + t.#t * this.#n;
-    return new l(e, r);
+    return new f(e, r);
   }
   /**
    * returns `this - right`
@@ -337,7 +359,7 @@ class l {
    * @returns
    */
   substr(t) {
-    return new l(this.#t, this.#n).add(t.minus());
+    return new f(this.#t, this.#n).add(t.minus());
   }
   /**
    * returns `this * right`
@@ -346,7 +368,7 @@ class l {
    */
   multiply(t) {
     const r = this.#n * t.#n, e = this.#t * t.#t;
-    return new l(e, r);
+    return new f(e, r);
   }
   /**
    * returns `this / right`
@@ -354,7 +376,7 @@ class l {
    * @returns
    */
   divide(t) {
-    return new l(this.#t, this.#n).multiply(
+    return new f(this.#t, this.#n).multiply(
       t.inverse()
     );
   }
@@ -365,7 +387,7 @@ class l {
    */
   mediant(t) {
     const r = this.#n + t.#n, e = this.#t + t.#t;
-    return new l(e, r);
+    return new f(e, r);
   }
   /**
    * `number` 型の小数に変換
@@ -392,103 +414,103 @@ class l {
     };
   }
   static parse(t) {
-    const r = JSON.parse(t), { type: e, numerator: s, denominator: i } = r;
+    const r = JSON.parse(t), { type: e, numerator: i, denominator: s } = r;
     if (e !== "Fraction") throw Error("cannot parse");
-    if (typeof s == "string" && typeof i == "string") {
-      const o = BigInt(s), c = BigInt(i);
-      return new l(o, c);
+    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) => {
+const H = (n) => {
   let t = n.toString(16);
   t.length & 1 && (t = "0" + t);
   const r = [...t.match(/.{2}/g) ?? []];
   return Uint8Array.from(r, (e) => Number.parseInt(e, 16));
-}, X = (n) => {
+}, W = (n) => {
   const t = Array.from(n, (r) => r.toString(16).padStart(2, "0")).join("") || "00";
   return BigInt("0x" + t);
 }, U = (n) => {
-  if (I)
+  if (b())
     return Buffer.copyBytesFrom(n).toString("base64");
   {
     const t = Array.from(n, (r) => String.fromCharCode(r)).join("");
     return btoa(t);
   }
-}, P = (n) => {
-  if (I) {
+}, j = (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));
-}, Y = (n) => U(n).replaceAll(/\+/g, "-").replaceAll(/\//g, "_").replaceAll(/=*$/g, ""), Z = (n) => {
+}, X = (n) => U(n).replaceAll(/\+/g, "-").replaceAll(/\//g, "_").replaceAll(/=*$/g, ""), Y = (n) => {
   const t = n.length & 3;
   t > 0 && (n = n + "=".repeat(4 - t));
   const r = n.replaceAll(/-/g, "+").replaceAll(/_/g, "/");
-  return P(r);
-}, Q = {
-  isEqArray: x,
-  sleep: _,
+  return j(r);
+}, F = {
+  isEqual: p,
+  sleep: x,
   lazify: M,
   parseCSV: T,
-  getHash: L
-}, tt = {
+  getHash: _,
+  isNode: b,
+  toBigInt: L
+}, Q = {
   getRndInt: V,
-  residue: h,
-  toBigInt: j,
-  getRandBIByBitLength: w,
+  residue: a,
+  getRandBIByBitLength: B,
   getRandBIByRange: S,
-  modPow: a,
+  modPow: g,
   exEuclidean: A,
   factorial: q,
   rot32: E,
   rot32BI: D,
-  jacobiSymbol: p,
-  isSquare: N
-}, nt = {
-  bailliePSW: y,
-  getRandPrimeByBitLength: H,
-  getRandPrimeByRange: G
-}, rt = {
-  base64ToU8Arr: P,
-  base64UrlToU8Arr: Z,
+  jacobiSymbol: w,
+  isSquare: P,
+  bailliePSW: I,
+  getRandPrimeByBitLength: G,
+  getRandPrimeByRange: z
+}, tt = {
+  base64ToU8Arr: j,
+  base64UrlToU8Arr: Y,
   u8ArrToBase64: U,
-  u8ArrToBase64Url: Y,
-  BItoU8Arr: K,
-  u8ArrToBI: X
+  u8ArrToBase64Url: X,
+  BItoU8Arr: H,
+  u8ArrToBI: W
 };
 export {
-  tt as AdMath,
-  K as BItoU8Arr,
-  l as Fraction,
-  F as PCGMinimal,
-  nt as Prime,
-  rt as U8Ext,
-  Q as Util,
-  y as bailliePSW,
-  P as base64ToU8Arr,
-  Z as base64UrlToU8Arr,
+  H as BItoU8Arr,
+  Q 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,
   q as factorial,
-  L as getHash,
-  w as getRandBIByBitLength,
+  _ as getHash,
+  B as getRandBIByBitLength,
   S as getRandBIByRange,
-  H as getRandPrimeByBitLength,
-  G as getRandPrimeByRange,
+  G as getRandPrimeByBitLength,
+  z as getRandPrimeByRange,
   V as getRndInt,
-  x as isEqArray,
-  N as isSquare,
-  p as jacobiSymbol,
+  p as isEqual,
+  b as isNode,
+  P as isSquare,
+  w as jacobiSymbol,
   M as lazify,
-  a as modPow,
+  g as modPow,
   T as parseCSV,
-  h as residue,
+  a as residue,
   E as rot32,
   D as rot32BI,
-  _ as sleep,
-  j as toBigInt,
-  X as u8ArrToBI,
+  x as sleep,
+  L as toBigInt,
+  W as u8ArrToBI,
   U as u8ArrToBase64,
-  Y as u8ArrToBase64Url
+  X as u8ArrToBase64Url
 };

package/dist/bundle.umd.cjs

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

package/dist/fraction.d.ts

@@ -1,12 +1,10 @@
-declare const __frac_brand: unique symbol;
 export type FractionData = {
     type: 'Fraction';
     numerator: string;
     denominator: string;
 };
-export default class Fraction {
+declare class Fraction {
     #private;
-    readonly [__frac_brand]: unknown;
     /**
      *
      * @param numerator
@@ -73,4 +71,4 @@ export default class Fraction {
     toJSON(): FractionData;
     static parse(text: string): Fraction;
 }
-export {};
+export default Fraction;

package/dist/math.d.ts

@@ -12,12 +12,6 @@ export declare const getRndInt: (min: number, max: number) => number;
  * @returns
  */
 export declare const residue: (n: bigint, mod: bigint) => bigint;
-/**
- * number を bigint に変換
- * @param nums
- * @returns
- */
-export declare const toBigInt: (...nums: number[]) => bigint[];
 /**
  * `length` ビットの乱数 or `length` ビット以下の乱数を出力する
  * @param length ビット長

package/dist/pcg-minimal.d.ts

@@ -1,20 +1,14 @@
-declare const __pcg_brand: unique symbol;
 /**
  * PCG-XSH-RR (Permuted congruential generator) 乱数のクラス
  */
 export default class PCGMinimal {
     #private;
-    readonly [__pcg_brand]: unknown;
     /** シード値の配列を返す */
     static getSeed(): BigUint64Array<ArrayBuffer>;
     /**
      * @param seeds 64bit整数の配列 (長さ2以上), 省略した場合, 常に同じ値によって初期化される
      */
     constructor(seeds?: BigUint64Array<ArrayBuffer>);
-    /** 内部状態を1サイクル進める */
-    step(): void;
-    /** 32bit 乱数を返す (内部状態は変わらない) */
-    get value(): number;
     /** 内部状態を1進め、乱数を返す \
      *  普通はこれを使う
      */
@@ -28,4 +22,3 @@ export default class PCGMinimal {
      */
     genRands(step: number, bound?: number): Generator<number, void, unknown>;
 }
-export {};

package/dist/util.d.ts

@@ -1,29 +1,37 @@
 /**
- * 配列が等しいかどうかの真偽値を返す
+ * オブジェクトが等しいかどうかの真偽値を返す
  * @returns
  */
-declare const isEqArray: <T>(arr1: T[], arr2: T[]) => boolean;
+declare const isEqual: (a: unknown, b: unknown) => boolean;
 /**
- * スリープ
- * @param delay スリープ時間 (ms)
+ * sleep
+ * @param delay milliseconds
  * @returns
  */
 declare const sleep: (delay: number) => Promise<void>;
-/** 遅延評価関数化する */
+/**
+ * makes function lazy
+ */
 declare const lazify: <ArgT extends unknown[], RetT>(func: (...args: ArgT) => RetT) => (...args: ArgT) => () => RetT;
 /**
- * CSVをパースする \
- * クォート対応
+ * parses CSV string \
+ * can deal with CSV with escaping doublequote
  * @param csv CSV
  * @returns 2次元配列
  */
 declare const parseCSV: (csv: string) => string[][];
 /**
- * 文字列のハッシュ値を返す
+ * returns hash of a string
  * @param str 文字列
  * @param algorithm アルゴリズム
  * @returns ハッシュ値
  */
 declare const getHash: (str: string, algorithm: AlgorithmIdentifier) => Promise<Uint8Array<ArrayBuffer>>;
-declare const isNode: boolean;
-export { isEqArray, sleep, lazify, parseCSV, getHash, isNode };
+/**
+ * number を bigint に変換
+ * @param nums
+ * @returns
+ */
+declare const toBigInt: (...nums: number[]) => bigint[];
+declare const isNode: () => boolean;
+export { isEqual, sleep, lazify, parseCSV, getHash, isNode, toBigInt };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@tktb-tess/util-fns",
-  "version": "0.3.0",
+  "version": "0.3.2",
   "description": "Utility functions for personal use",
   "files": [
     "dist"
@@ -23,6 +23,7 @@
     "type": "git",
     "url": "https://github.com/tktb-tess/util-fns"
   },
+  "homepage": "https://github.com/tktb-tess/util-fns/blob/main/README.md",
   "scripts": {
     "dev": "vite",
     "build": "tsc && vite build",