@tktb-tess/util-fns 0.2.2 → 0.3.1

package/dist/baillie-psw.d.ts

@@ -18,4 +18,3 @@ export declare const getRandPrimeByRange: (min: bigint, max: bigint) => bigint;
  * @returns
  */
 export declare const getRandPrimeByBitLength: (bitLength: number, fixed?: boolean) => bigint;
-//# sourceMappingURL=baillie-psw.d.ts.map

package/dist/brand.d.ts

@@ -0,0 +1,4 @@
+type Brand<in out K extends symbol> = {
+    [key in K]: K;
+};
+export default Brand;

package/dist/bundle.d.ts

@@ -0,0 +1,46 @@
+import { isEqArray, sleep, lazify, parseCSV, getHash } from './util';
+import { getRndInt, residue, toBigInt, 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 { default as Brand } from './brand';
+declare const Util: {
+    isEqArray: <T>(arr1: T[], arr2: T[]) => 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>>;
+};
+declare const AdMath: {
+    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;
+    exEuclidean: (a: bigint, b: bigint) => {
+        x: bigint;
+        y: bigint;
+        gcd: bigint;
+    };
+    factorial: (n: bigint) => bigint;
+    rot32: (value: number, rot: number) => number;
+    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;
+};
+declare const U8Ext: {
+    base64ToU8Arr: (base64: string) => Uint8Array<ArrayBuffer>;
+    base64UrlToU8Arr: (base64Url: string) => Uint8Array<ArrayBuffer>;
+    u8ArrToBase64: (u8Arr: Uint8Array) => string;
+    u8ArrToBase64Url: (u8Arr: Uint8Array) => string;
+    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, type Brand, };

package/dist/bundle.js

@@ -0,0 +1,492 @@
+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;
+}, M = (n) => new Promise((t) => {
+  setTimeout(() => {
+    t();
+  }, n);
+}), T = (n) => (...t) => () => n(...t), L = (n) => {
+  const t = [];
+  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;
+}, _ = async (n, t) => {
+  const r = R.encode(n), e = await crypto.subtle.digest(t, r);
+  return new Uint8Array(e);
+}, b = typeof process < "u" && typeof process.versions.node < "u", V = (n, t) => Math.floor(Math.random() * (t - n) + n), h = (n, t) => {
+  const r = n % t;
+  return r < 0n ? r + t : r;
+}, j = (...n) => n.map((t) => BigInt(t)), p = (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) => {
+  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 = p(e);
+      if (c >= d(2n, BigInt(e), r))
+        return c % r;
+    }
+    throw Error("Failed to generate a random bigint");
+  })();
+  return n + i;
+}, d = (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;
+  if (r === 1n) return 0n;
+  if (n % r === 1n || n % r === 0n) return n;
+  if (n === r - 1n) return t & 1n ? r - 1n : 1n;
+  let e = 1n;
+  for (; t > 0n; )
+    t & 1n && (e = e * n % r), n = n * n % r, t >>= 1n;
+  return e;
+}, 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 [r, e, i] = [1n, 0n, n], [s, o, c] = [0n, -1n, t];
+  for (; ; ) {
+    const u = i / c, f = i - u * c;
+    if (f === 0n) break;
+    [r, s] = [s, r - u * s], [e, o] = [o, e - u * o], [i, c] = [c, f];
+  }
+  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;
+    return c;
+  }
+  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 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;
+}, 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 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) => {
+  if (t < 1n || t % 2n === 0n)
+    throw Error("`n` is invalid");
+  for (; n < 0n; )
+    n += t;
+  n %= t;
+  let r = 1n;
+  for (; n !== 0n; ) {
+    for (; n % 2n === 0n; ) {
+      n /= 2n;
+      const e = t % 8n;
+      (e === 3n || e === 5n) && (r *= -1n);
+    }
+    [n, t] = [t, n], n % 4n === 3n && t % 4n === 3n && (r *= -1n), n %= t;
+  }
+  return t === 1n ? r : 0n;
+}, N = (n) => {
+  if (n < 0n) return !1;
+  if (n === 0n) return !0;
+  let t = 1n, r = n;
+  for (; t + 1n < r; ) {
+    const e = (t + r) / 2n;
+    e ** 2n < n ? t = e : r = e;
+  }
+  return n === t ** 2n || n === (t + 1n) ** 2n;
+}, I = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn], O = 0x5851f42d4c957f2dn;
+class Y {
+  /**
+   * length = 2, `[state, increment]`
+   */
+  #t = new BigUint64Array(2);
+  /** シード値の配列を返す */
+  static getSeed() {
+    return crypto.getRandomValues(new BigUint64Array(2));
+  }
+  /**
+   * @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] = I[0], this.#t[1] = I[1]);
+  }
+  /** 内部状態を1サイクル進める */
+  #n() {
+    this.#t[0] = this.#t[0] * O + 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));
+  }
+  /** 内部状態を1進め、乱数を返す \
+   *  普通はこれを使う
+   */
+  getRand() {
+    return this.#n(), this.#r;
+  }
+  /** `bound` 未満の乱数を返す */
+  getBoundedRand(t) {
+    if (t > 4294967296) throw Error("`bound` exceeded limit (2^32)");
+    const e = 4294967296 % t;
+    for (; ; ) {
+      const i = this.getRand();
+      if (i >= e) return i % t;
+    }
+  }
+  /**
+   * step の値だけ乱数を生成する
+   * @param step
+   * @param bound
+   */
+  *genRands(t, r) {
+    for (let e = 0; e < t; e++)
+      yield typeof r == "number" ? this.getBoundedRand(r) : this.getRand();
+  }
+}
+const $ = (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, i] = [t, r];
+  let o = d(2n, e, 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;
+}, J = (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))
+      return [0n, 0n];
+    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 i = 1n, s = r;
+  const o = n.toString(2).slice(1);
+  for (const c of o)
+    [i, s] = [h(i * s, t), g(s * s + e * i * i, t)], c === "1" && ([i, s] = [g(r * i + s, t), g(e * i + r * s, t)]);
+  return [i, s];
+}, v = (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] = k(i, n, r, t);
+  let u = c;
+  if (o === 0n) return !0;
+  e = d(e, i, n);
+  for (let f = 0n; f < s; f++) {
+    if (u === 0n) return !0;
+    u = h(u * u - 2n * e, n), e = d(e, 2n, n);
+  }
+  return !1;
+}, y = (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 (!$(n))
+    return !1;
+  const [r, e] = J(n);
+  if (e === 0n) return !1;
+  const i = (1n - r) / 4n;
+  return v(n, r, 1n, i);
+}, z = (n, t) => {
+  if (t < 2n)
+    throw Error("noPrimesFound");
+  for (let e = 0; e < 1e5; e++) {
+    const i = S(n, t);
+    if (y(i)) return i;
+  }
+  throw Error("noPrimesFound");
+}, G = (n, t = !1) => {
+  if (n < 2)
+    throw Error("noPrimesFound");
+  for (let e = 0; e < 1e5; e++) {
+    const i = p(n, t);
+    if (y(i)) return i;
+  }
+  throw Error("noPrimesFound");
+};
+class l {
+  #t;
+  #n;
+  /**
+   * 
+   * @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();
+  }
+  /**
+   * generates fraction from `number` decimal using continued fraction
+   * @param value 値
+   * @param denominatorDigits 分母の桁数 (十進)
+   */
+  static fromDecimal(t, r = 20) {
+    if (Number.isNaN(t))
+      return new l(0n, 0n);
+    if (Math.abs(t) === 1 / 0)
+      return new l(t > 0 ? 1n : -1n, 0n);
+    const e = t < 0;
+    e && (t *= -1);
+    const i = BigInt(Math.floor(t)), s = t - Number(i);
+    if (s === 0)
+      return new l(e ? -i : i, 1n);
+    t = 1 / s;
+    let [o, c] = [1n, i], [u, f] = [0n, 1n];
+    for (; `${f}`.length < r + 1; ) {
+      const a = BigInt(Math.floor(t)), B = t - Number(a);
+      if ([o, c] = [c, a * c + o], [u, f] = [f, a * f + u], B === 0)
+        return new l(e ? -c : c, f);
+      t = 1 / B;
+    }
+    return new l(e ? -o : o, u);
+  }
+  /**
+   * reduction
+   */
+  #r() {
+    const { gcd: t } = A(this.#t, this.#n);
+    t !== 0n && (this.#t /= t, this.#n /= t);
+  }
+  /**
+   * returns a fraction multiplied by -1
+   * @returns
+   */
+  minus() {
+    return new l(-this.#t, this.#n);
+  }
+  /**
+   * returns inverse of this fraction
+   * @returns
+   */
+  inverse() {
+    return new l(this.#n, this.#t);
+  }
+  /**
+   * returns `this + right`
+   * @param right
+   * @returns
+   */
+  add(t) {
+    const r = this.#n * t.#n, e = this.#t * t.#n + t.#t * this.#n;
+    return new l(e, r);
+  }
+  /**
+   * returns `this - right`
+   * @param right
+   * @returns
+   */
+  substr(t) {
+    return new l(this.#t, this.#n).add(t.minus());
+  }
+  /**
+   * returns `this * right`
+   * @param right
+   * @returns
+   */
+  multiply(t) {
+    const r = this.#n * t.#n, e = this.#t * t.#t;
+    return new l(e, r);
+  }
+  /**
+   * returns `this / right`
+   * @param right
+   * @returns
+   */
+  divide(t) {
+    return new l(this.#t, this.#n).multiply(
+      t.inverse()
+    );
+  }
+  /**
+   * mediant
+   * @param right 
+   * @returns 
+   */
+  mediant(t) {
+    const r = this.#n + t.#n, e = this.#t + t.#t;
+    return new l(e, r);
+  }
+  /**
+   * `number` 型の小数に変換
+   * @returns
+   */
+  toDecimal() {
+    return Number(this.#t) / Number(this.#n);
+  }
+  /**
+   * 分数の文字列に変換
+   * @returns
+   */
+  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 r = JSON.parse(t), { type: e, numerator: i, denominator: s } = r;
+    if (e !== "Fraction") throw Error("cannot parse");
+    if (typeof i == "string" && typeof s == "string") {
+      const o = BigInt(i), c = BigInt(s);
+      return new l(o, c);
+    } else
+      throw Error("cannot parse");
+  }
+}
+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));
+}, W = (n) => {
+  const t = Array.from(n, (r) => r.toString(16).padStart(2, "0")).join("") || "00";
+  return BigInt("0x" + t);
+}, U = (n) => {
+  if (b)
+    return Buffer.copyBytesFrom(n).toString("base64");
+  {
+    const t = Array.from(n, (r) => String.fromCharCode(r)).join("");
+    return btoa(t);
+  }
+}, P = (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));
+}, K = (n) => U(n).replaceAll(/\+/g, "-").replaceAll(/\//g, "_").replaceAll(/=*$/g, ""), X = (n) => {
+  const t = n.length & 3;
+  t > 0 && (n = n + "=".repeat(4 - t));
+  const r = n.replaceAll(/-/g, "+").replaceAll(/_/g, "/");
+  return P(r);
+}, Z = {
+  isEqArray: x,
+  sleep: M,
+  lazify: T,
+  parseCSV: L,
+  getHash: _
+}, F = {
+  getRndInt: V,
+  residue: h,
+  toBigInt: j,
+  getRandBIByBitLength: p,
+  getRandBIByRange: S,
+  modPow: d,
+  exEuclidean: A,
+  factorial: q,
+  rot32: E,
+  rot32BI: D,
+  jacobiSymbol: w,
+  isSquare: N
+}, Q = {
+  bailliePSW: y,
+  getRandPrimeByBitLength: G,
+  getRandPrimeByRange: z
+}, tt = {
+  base64ToU8Arr: P,
+  base64UrlToU8Arr: X,
+  u8ArrToBase64: U,
+  u8ArrToBase64Url: K,
+  BItoU8Arr: H,
+  u8ArrToBI: W
+};
+export {
+  F as AdMath,
+  H as BItoU8Arr,
+  l as Fraction,
+  Y as PCGMinimal,
+  Q as Prime,
+  tt as U8Ext,
+  Z as Util,
+  y as bailliePSW,
+  P as base64ToU8Arr,
+  X as base64UrlToU8Arr,
+  A as exEuclidean,
+  q as factorial,
+  _ as getHash,
+  p as getRandBIByBitLength,
+  S as getRandBIByRange,
+  G as getRandPrimeByBitLength,
+  z as getRandPrimeByRange,
+  V as getRndInt,
+  x as isEqArray,
+  N as isSquare,
+  w as jacobiSymbol,
+  T as lazify,
+  d as modPow,
+  L as parseCSV,
+  h as residue,
+  E as rot32,
+  D as rot32BI,
+  M as sleep,
+  j as toBigInt,
+  W as u8ArrToBI,
+  U as u8ArrToBase64,
+  K as u8ArrToBase64Url
+};

package/dist/bundle.umd.cjs

@@ -0,0 +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},L=async(t,n)=>{const e=g.encode(t),r=await crypto.subtle.digest(n,e);return new Uint8Array(r)},j=typeof process<"u"&&typeof process.versions.node<"u",_=(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},I=(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}},b=(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=b(t,i),c=b(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*=b(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)),A=(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},S=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},O=[0x853c49e6748fea9bn,0xda3e39cb94b95bdbn],k=0x5851f42d4c957f2dn;class K{#n=new BigUint64Array(2);static getSeed(){return crypto.getRandomValues(new BigUint64Array(2))}constructor(n){n?(this.#n[1]=n[1]<<1n|1n,this.#t(),this.#n[0]=n[0],this.#t()):(this.#n[0]=O[0],this.#n[1]=O[1])}#t(){this.#n[0]=this.#n[0]*k+this.#n[1]}get#e(){const n=this.#n[0];if(!n)throw Error("empty state");const e=n>>59n,r=BigInt.asUintN(32,(n^n>>18n)>>27n);return A(Number(r),Number(e))}getRand(){return this.#t(),this.#e}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 X=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},Y=t=>{let n=5n,e=y(n,t);for(;e>0n;){if(n=n>0n?n+2n:n-2n,n*=-1n,n===-15n&&S(t))return[0n,0n];e=y(n,t)}return[n,e]},p=(t,n)=>(t&1n)===1n?a(t+n>>1n,n):a(t>>1n,n),Z=(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),p(s*s+r*i*i,n)],u==="1"&&([i,s]=[p(e*i+s,n),p(r*i+e*s,n)]);return[i,s]},F=(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]=Z(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(!X(t))return!1;const[e,r]=Y(t);if(r===0n)return!1;const i=(1n-e)/4n;return F(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")};class f{#n;#t;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}=I(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(j)return Buffer.copyBytesFrom(t).toString("base64");{const n=Array.from(t,e=>String.fromCharCode(e)).join("");return btoa(n)}},U=t=>{if(j){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)},Q={isEqArray:R,sleep:N,lazify:T,parseCSV:M,getHash:L},x={getRndInt:_,residue:a,toBigInt:C,getRandBIByBitLength:m,getRandBIByRange:B,modPow:d,exEuclidean:I,factorial:V,rot32:A,rot32BI:q,jacobiSymbol:y,isSquare:S},nn={bailliePSW:w,getRandPrimeByBitLength:$,getRandPrimeByRange:D},tn={base64ToU8Arr:U,base64UrlToU8Arr:H,u8ArrToBase64:E,u8ArrToBase64Url:G,BItoU8Arr:v,u8ArrToBI:z};o.AdMath=x,o.BItoU8Arr=v,o.Fraction=f,o.PCGMinimal=K,o.Prime=nn,o.U8Ext=tn,o.Util=Q,o.bailliePSW=w,o.base64ToU8Arr=U,o.base64UrlToU8Arr=H,o.exEuclidean=I,o.factorial=V,o.getHash=L,o.getRandBIByBitLength=m,o.getRandBIByRange=B,o.getRandPrimeByBitLength=$,o.getRandPrimeByRange=D,o.getRndInt=_,o.isEqArray=R,o.isSquare=S,o.jacobiSymbol=y,o.lazify=T,o.modPow=d,o.parseCSV=M,o.residue=a,o.rot32=A,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"})}));

package/dist/fraction.d.ts

@@ -1,4 +1,3 @@
-declare const __fraction_brand: unique symbol;
 export type FractionData = {
     type: 'Fraction';
     numerator: string;
@@ -6,48 +5,58 @@ export type FractionData = {
 };
 export default class Fraction {
     #private;
-    readonly [__fraction_brand]: unknown;
+    /**
+     *
+     * @param numerator
+     * @param denominator
+     */
     constructor(numerator: bigint, denominator: bigint);
     /**
-     * `number` 型から構成
+     * generates fraction from `number` decimal using continued fraction
      * @param value 値
      * @param denominatorDigits 分母の桁数 (十進)
      */
     static fromDecimal(value: number, denominatorDigits?: number): Fraction;
     /**
-     * -1 倍
+     * returns a fraction multiplied by -1
      * @returns
      */
     minus(): Fraction;
     /**
-     * 逆数
+     * returns inverse of this fraction
      * @returns
      */
     inverse(): Fraction;
     /**
-     * 加法 (非破壊的)
+     * returns `this + right`
      * @param right
      * @returns
      */
     add(right: Fraction): Fraction;
     /**
-     * 減法
+     * returns `this - right`
      * @param right
      * @returns
      */
     substr(right: Fraction): Fraction;
     /**
-     * 乗法
+     * returns `this * right`
      * @param right
      * @returns
      */
     multiply(right: Fraction): Fraction;
     /**
-     * 除法
+     * returns `this / right`
      * @param right
      * @returns
      */
     divide(right: Fraction): Fraction;
+    /**
+     * mediant
+     * @param right
+     * @returns
+     */
+    mediant(right: Fraction): Fraction;
     /**
      * `number` 型の小数に変換
      * @returns
@@ -62,5 +71,3 @@ export default class Fraction {
     toJSON(): FractionData;
     static parse(text: string): Fraction;
 }
-export {};
-//# sourceMappingURL=fraction.d.ts.map

package/dist/math.d.ts

@@ -87,4 +87,3 @@ export declare const jacobiSymbol: (a: bigint, n: bigint) => bigint;
  * @returns
  */
 export declare const isSquare: (n: bigint) => boolean;
-//# sourceMappingURL=math.d.ts.map

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,5 +22,3 @@ export default class PCGMinimal {
      */
     genRands(step: number, bound?: number): Generator<number, void, unknown>;
 }
-export {};
-//# sourceMappingURL=pcg-minimal.d.ts.map

package/dist/u8arr-ext.d.ts

@@ -0,0 +1,7 @@
+declare const BItoU8Arr: (n: bigint) => Uint8Array<ArrayBuffer>;
+declare const u8ArrToBI: (buf: Uint8Array) => bigint;
+declare const u8ArrToBase64: (u8Arr: Uint8Array) => string;
+declare const base64ToU8Arr: (base64: string) => Uint8Array<ArrayBuffer>;
+declare const u8ArrToBase64Url: (u8Arr: Uint8Array) => string;
+declare const base64UrlToU8Arr: (base64Url: string) => Uint8Array<ArrayBuffer>;
+export { BItoU8Arr, u8ArrToBI, u8ArrToBase64, base64ToU8Arr, u8ArrToBase64Url, base64UrlToU8Arr, };