@tktb-tess/util-fns 0.12.5 → 0.13.0

package/dist/{async_worker.d.ts → esm/async_worker.d.ts}

@@ -1,25 +1,14 @@
 declare const __ID_BRAND__: unique symbol;
-type ID = ReturnType<typeof crypto.randomUUID> & {
+type ID = bigint & {
     readonly [__ID_BRAND__]: unknown;
 };
 export interface WorkerMessage<T> {
     readonly value: T;
     readonly id: ID;
 }
-interface WorkerResultBase {
-    readonly id: ID;
-}
-interface WorkerSucceededResult<T> extends WorkerResultBase {
-    readonly success: true;
-    readonly value: T;
-}
-interface WorkerFailedResult extends WorkerResultBase {
-    readonly success: false;
-    readonly error: unknown;
-}
-export type WorkerResult<T> = WorkerSucceededResult<T> | WorkerFailedResult;
-export declare class AsyncWorker<TPost = unknown, TRecv = unknown> {
+export declare class AsyncWorker<TPost = unknown, TRecv = unknown, TErr = unknown> {
     #private;
+    static readonly name = "AsyncWorker";
     constructor(w: Worker);
     /**
      * sends a message to the worker, and returns promise resolved by message from worker
@@ -29,5 +18,5 @@ export declare class AsyncWorker<TPost = unknown, TRecv = unknown> {
     readonly postMessage: (message: TPost, options?: StructuredSerializeOptions) => Promise<TRecv>;
 }
 export declare const postSuccess: <TRecv>(value: TRecv, id: ID) => void;
-export declare const postFailed: (error: unknown, id: ID) => void;
+export declare const postFailed: <TErr>(error: TErr, id: ID) => void;
 export {};

package/dist/esm/async_worker.js

@@ -0,0 +1,45 @@
+//#region lib/async_worker.ts
+var e = "AsyncWorker", t = 0n, n = () => (t === 2n ** 128n && (t = 0n), t++), r = class {
+	static name = e;
+	#e;
+	constructor(e) {
+		this.#e = e;
+	}
+	postMessage = (e, t) => new Promise((r, i) => {
+		let a = n(), o = (e) => {
+			let t = e.data;
+			t.id === a && (this.#e.removeEventListener("message", o), this.#e.removeEventListener("error", s), t.success ? r(t.value) : i(t.error));
+		}, s = (e) => {
+			this.#e.removeEventListener("message", o), this.#e.removeEventListener("error", s), i(e.error);
+		};
+		this.#e.addEventListener("message", o), this.#e.addEventListener("error", s);
+		let c = {
+			value: e,
+			id: a
+		};
+		this.#e.postMessage(c, t);
+	});
+};
+Object.defineProperty(r.prototype, Symbol.toStringTag, {
+	value: e,
+	enumerable: !0
+});
+var i = () => typeof window > "u" && typeof self < "u" && "importScripts" in self, a = (e, t) => {
+	if (!i()) throw Error("this function must be used in Worker");
+	let n = {
+		success: !0,
+		value: e,
+		id: t
+	};
+	self.postMessage(n);
+}, o = (e, t) => {
+	if (!i()) throw Error("this function must be used in Worker");
+	let n = {
+		success: !1,
+		error: e,
+		id: t
+	};
+	self.postMessage(n);
+};
+//#endregion
+export { r as AsyncWorker, o as postFailed, a as postSuccess };

package/dist/esm/baillie_psw-DzyqB4sZ.js

@@ -0,0 +1,164 @@
+import { AsyncWorker as e } from "./async_worker.js";
+import { getRandBIByBitLength as t, getRandBIByRange as n, isSquare as r, jacobiSymbol as i, modPow as a, residue as o } from "./math.js";
+//#region lib/bpsw_worker_wrap.ts
+var s, c = async () => {
+	if (!s) {
+		let { default: t } = await import("./bpsw_worker-CZOWXQMI.js");
+		s = new e(new t({ name: "bpsw_worker" }));
+	}
+	return s;
+}, l = (e) => {
+	if (e <= 1n) return !1;
+	if (e % 2n == 0n) return e === 2n;
+	let t = e - 1n, n = 0n;
+	for (; t % 2n == 0n;) t >>= 1n, n += 1n;
+	let [r, i] = [t, n], o = a(2n, r, e);
+	if (o === 1n) return !0;
+	for (let t = 0n; t < i; t++) {
+		if (o === e - 1n) return !0;
+		o = o * o % e;
+	}
+	return !1;
+}, u = (e) => {
+	let t = 5n, n = i(t, e);
+	for (; n > 0n;) {
+		if (t = t > 0n ? t + 2n : t - 2n, t *= -1n, t === -15n && r(e)) return [0n, 0n];
+		n = i(t, e);
+	}
+	return [t, n];
+}, d = (e, t) => (e & 1n) == 1n ? o(e + t >> 1n, t) : o(e >> 1n, t), f = (e, t, n, r) => {
+	let i = 1n, a = n, s = e.toString(2).slice(1);
+	for (let e of s) [i, a] = [o(i * a, t), d(a * a + r * i * i, t)], e === "1" && ([i, a] = [d(n * i + a, t), d(r * i + n * a, t)]);
+	return [i, a];
+}, p = (e, t, n, r) => {
+	if (e % 2n != 1n) throw RangeError("`n` must be odd");
+	let i = e + 1n, s = 0n;
+	for (; i % 2n == 0n;) i >>= 1n, s += 1n;
+	let [c, l] = f(i, e, n, t), u = l;
+	if (c === 0n) return !0;
+	r = a(r, i, e);
+	for (let t = 0n; t < s; t++) {
+		if (u === 0n) return !0;
+		u = o(u * u - 2n * r, e), r = a(r, 2n, e);
+	}
+	return !1;
+}, m = [
+	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,
+	103n,
+	107n,
+	109n,
+	113n,
+	127n,
+	131n,
+	137n,
+	139n,
+	149n,
+	151n,
+	157n,
+	163n,
+	167n,
+	173n,
+	179n,
+	181n,
+	191n,
+	193n,
+	197n,
+	199n,
+	211n,
+	223n,
+	227n,
+	229n,
+	233n,
+	239n,
+	241n,
+	251n,
+	257n,
+	263n,
+	269n,
+	271n,
+	277n,
+	281n,
+	283n,
+	293n,
+	307n,
+	311n,
+	313n,
+	317n,
+	331n,
+	337n,
+	347n,
+	349n,
+	353n,
+	359n,
+	367n,
+	373n,
+	379n,
+	383n,
+	389n,
+	397n,
+	401n,
+	409n,
+	419n,
+	421n,
+	431n,
+	433n,
+	439n,
+	443n,
+	449n,
+	457n,
+	461n,
+	463n,
+	467n,
+	479n,
+	487n,
+	491n,
+	499n
+], h = (e) => {
+	if (e <= 1n) return !1;
+	if (e % 2n == 0n) return e === 2n;
+	for (let t of m) if (e % t === 0n) return e === t;
+	if (!l(e)) return !1;
+	let [t, n] = u(e);
+	return n === 0n ? !1 : p(e, t, 1n, (1n - t) / 4n);
+}, g = (e, t) => {
+	if (t < 2n) throw RangeError("`max` must be 2 or larger");
+	for (let r = 0; r < 1e5; r++) {
+		let r = n(e, t);
+		if (h(r)) return r;
+	}
+	throw Error("no primes were found");
+}, _ = (e, n = !1) => {
+	if (e < 2) throw RangeError("`bitLength` must be 2 or larger");
+	for (let r = 0; r < 1e5; r++) {
+		let r = t(e, n);
+		if (h(r)) return r;
+	}
+	throw Error("no primes were found");
+}, v = async (e) => (await c()).postMessage(e);
+//#endregion
+export { g as i, v as n, _ as r, h as t };

package/dist/esm/baillie_psw.js

@@ -0,0 +1,3 @@
+import "./math.js";
+import { i as e, n as t, r as n, t as r } from "./baillie_psw-DzyqB4sZ.js";
+export { r as bailliePSW, t as bailliePSWAsync, n as getRandPrimeByBitLength, e as getRandPrimeByRange };

package/dist/esm/bpsw_worker-CZOWXQMI.js

@@ -0,0 +1,16 @@
+//#region lib/bpsw_worker.ts?worker&inline
+var e = "(function(){let e=(e,t)=>{t<0n&&(t*=-1n);let n=e%t;return n<0n?n+t:n},t=(t,n,r)=>{if(r<1n)throw RangeError(\"`mod` must be positive\");if(n<0n)throw RangeError(\"`power` must not be negative\");if(t=e(t,r),r===1n)return 0n;if(t%r===1n||t%r===0n)return t;if(t===r-1n)return n&1n?r-1n:1n;let i=1n;for(;n>0n;)n&1n&&(i=i*t%r),t=t*t%r,n>>=1n;return i},n=(e,t)=>{if(t<1n||t%2n==0n)throw RangeError(\"`n` is out of range\");for(;e<0n;)e+=t;e%=t;let n=1n;for(;e!==0n;){for(;e%2n==0n;){e/=2n;let r=t%8n;(r===3n||r===5n)&&(n*=-1n)}[e,t]=[t,e],e%4n==3n&&t%4n==3n&&(n*=-1n),e%=t}return t===1n?n:0n},r=e=>{if(e<0n)return!1;if(e===0n)return!0;let t=1n,n=e;for(;t+1n<n;){let r=(t+n)/2n;r*r<e?t=r:n=r}return e===t**2n||e===(t+1n)**2n},i=`AsyncWorker`,a=0n,o=()=>(a===2n**128n&&(a=0n),a++);Object.defineProperty(class{static name=i;#e;constructor(e){this.#e=e}postMessage=(e,t)=>new Promise((n,r)=>{let i=o(),a=e=>{let t=e.data;t.id===i&&(this.#e.removeEventListener(`message`,a),this.#e.removeEventListener(`error`,s),t.success?n(t.value):r(t.error))},s=e=>{this.#e.removeEventListener(`message`,a),this.#e.removeEventListener(`error`,s),r(e.error)};this.#e.addEventListener(`message`,a),this.#e.addEventListener(`error`,s);let c={value:e,id:i};this.#e.postMessage(c,t)})}.prototype,Symbol.toStringTag,{value:i,enumerable:!0});let s=()=>typeof window>`u`&&typeof self<`u`&&`importScripts`in self,c=(e,t)=>{if(!s())throw Error(`this function must be used in Worker`);let n={success:!0,value:e,id:t};self.postMessage(n)},l=(e,t)=>{if(!s())throw Error(`this function must be used in Worker`);let n={success:!1,error:e,id:t};self.postMessage(n)},u=e=>{if(e<=1n)return!1;if(e%2n==0n)return e===2n;let n=e-1n,r=0n;for(;n%2n==0n;)n>>=1n,r+=1n;let[i,a]=[n,r],o=t(2n,i,e);if(o===1n)return!0;for(let t=0n;t<a;t++){if(o===e-1n)return!0;o=o*o%e}return!1},d=e=>{let t=5n,i=n(t,e);for(;i>0n;){if(t=t>0n?t+2n:t-2n,t*=-1n,t===-15n&&r(e))return[0n,0n];i=n(t,e)}return[t,i]},f=(t,n)=>(t&1n)==1n?e(t+n>>1n,n):e(t>>1n,n),p=(t,n,r,i)=>{let a=1n,o=r,s=t.toString(2).slice(1);for(let t of s)[a,o]=[e(a*o,n),f(o*o+i*a*a,n)],t===`1`&&([a,o]=[f(r*a+o,n),f(i*a+r*o,n)]);return[a,o]},m=(n,r,i,a)=>{if(n%2n!=1n)throw RangeError(\"`n` must be odd\");let o=n+1n,s=0n;for(;o%2n==0n;)o>>=1n,s+=1n;let[c,l]=p(o,n,i,r),u=l;if(c===0n)return!0;a=t(a,o,n);for(let r=0n;r<s;r++){if(u===0n)return!0;u=e(u*u-2n*a,n),a=t(a,2n,n)}return!1},h=[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,103n,107n,109n,113n,127n,131n,137n,139n,149n,151n,157n,163n,167n,173n,179n,181n,191n,193n,197n,199n,211n,223n,227n,229n,233n,239n,241n,251n,257n,263n,269n,271n,277n,281n,283n,293n,307n,311n,313n,317n,331n,337n,347n,349n,353n,359n,367n,373n,379n,383n,389n,397n,401n,409n,419n,421n,431n,433n,439n,443n,449n,457n,461n,463n,467n,479n,487n,491n,499n],g=e=>{if(e<=1n)return!1;if(e%2n==0n)return e===2n;for(let t of h)if(e%t===0n)return e===t;if(!u(e))return!1;let[t,n]=d(e);return n===0n?!1:m(e,t,1n,(1n-t)/4n)};globalThis.onmessage=e=>{let{value:t,id:n}=e.data;try{c(g(t),n)}catch(e){let t=e=>{if(e==null)return;let t=`${e}`;return t===`[Object object]`?JSON.stringify(e):t};if(e instanceof Error){let{name:r,message:i,stack:a,cause:o}=e;l({name:r,message:i,stack:a,cause:t(o)},n)}else l({name:`BPSWError`,message:`unidentified error`,cause:t(e)},n)}}})();", t = typeof self < "u" && self.Blob && new Blob(["(self.URL || self.webkitURL).revokeObjectURL(self.location.href);", e], { type: "text/javascript;charset=utf-8" });
+function n(n) {
+	let r;
+	try {
+		if (r = t && (self.URL || self.webkitURL).createObjectURL(t), !r) throw "";
+		let e = new Worker(r, { name: n?.name });
+		return e.addEventListener("error", () => {
+			(self.URL || self.webkitURL).revokeObjectURL(r);
+		}), e;
+	} catch {
+		return new Worker("data:text/javascript;charset=utf-8," + encodeURIComponent(e), { name: n?.name });
+	}
+}
+//#endregion
+export { n as default };

package/dist/esm/bpsw_worker_wrap.d.ts

@@ -0,0 +1,2 @@
+import { AsyncWorker } from './async_worker';
+export declare const getWorker: () => Promise<AsyncWorker<bigint, boolean, unknown>>;

package/dist/esm/fraction.js

@@ -0,0 +1,66 @@
+import { exEuclidean as e } from "./math.js";
+//#region lib/fraction.ts
+var t = "Rational", n = class n {
+	#e;
+	#t;
+	static name = t;
+	constructor(e, t) {
+		t === 0n ? (this.#t = 0n, this.#e = e === 0n ? 0n : e > 0n ? 1n : -1n) : t > 0n ? (this.#e = e, this.#t = t) : (this.#e = -e, this.#t = -t), this.#n();
+	}
+	static fromDecimal(e, t = 5) {
+		if (Number.isNaN(e)) return new n(0n, 0n);
+		if (Math.abs(e) === Infinity) return new n(e > 0 ? 1n : -1n, 0n);
+		let r = e < 0;
+		r && (e *= -1);
+		let i = BigInt(Math.floor(e)), a = e - Number(i);
+		if (a === 0) return new n(r ? -i : i, 1n);
+		e = 1 / a;
+		let [o, s] = [1n, i], [c, l] = [0n, 1n];
+		for (; `${l}`.length <= t;) {
+			let t = BigInt(Math.floor(e)), i = e - Number(t);
+			if ([o, s] = [s, t * s + o], [c, l] = [l, t * l + c], i === 0) return new n(r ? -s : s, l);
+			e = 1 / i;
+		}
+		return new n(r ? -o : o, c);
+	}
+	#n() {
+		let { gcd: t } = e(this.#e, this.#t);
+		t !== 0n && (this.#e /= t, this.#t /= t);
+	}
+	minus = () => new n(-this.#e, this.#t);
+	inverse = () => new n(this.#t, this.#e);
+	add = (e) => {
+		let t = this.#t * e.#t;
+		return new n(this.#e * e.#t + e.#e * this.#t, t);
+	};
+	substr = (e) => this.add(e.minus());
+	multiply = (e) => {
+		let t = this.#t * e.#t;
+		return new n(this.#e * e.#e, t);
+	};
+	divide = (e) => this.multiply(e.inverse());
+	mediant = (e) => {
+		let t = this.#t + e.#t;
+		return new n(this.#e + e.#e, t);
+	};
+	toDecimal = () => Number(this.#e) / Number(this.#t);
+	toString = () => this.#e === 0n && this.#t === 0n ? "NaN" : this.#e === 0n ? "0" : this.#t === 0n ? this.#e < 0n ? "-Infinity" : "Infinity" : this.#t === 1n ? `${this.#e}` : `${this.#e}/${this.#t}`;
+	valueOf = () => this.toDecimal();
+	toJSON = () => ({
+		type: "Rational",
+		value: ["0x" + this.#e.toString(16), "0x" + this.#t.toString(16)]
+	});
+	static fromData(e) {
+		return new n(BigInt(e.value[0]), BigInt(e.value[1]));
+	}
+	static parse(e) {
+		let t = /^\s*(\d+)\s*\/\s*(\d+)\s*$/.exec(e);
+		if (!t) throw Error("cannot parse");
+		let r = t.at(1), i = t.at(2);
+		if (!r || !i) throw Error("cannot parse");
+		return new n(BigInt(r), BigInt(i));
+	}
+};
+Object.defineProperty(n.prototype, Symbol.toStringTag, { value: t });
+//#endregion
+export { n as Rational };

package/dist/esm/index.js

@@ -0,0 +1,12 @@
+import { AsyncWorker as e, postFailed as t, postSuccess as n } from "./async_worker.js";
+import { exEuclidean as r, factorial as i, getRandBIByBitLength as a, getRandBIByRange as o, getRndInt as s, isSquare as c, jacobiSymbol as l, modPow as u, residue as d, rot32 as f, rot64 as p } from "./math.js";
+import { i as m, n as h, r as g, t as _ } from "./baillie_psw-DzyqB4sZ.js";
+import { Rational as v } from "./fraction.js";
+import { decodeLEB128 as y, encodeLEB128 as b } from "./leb128.js";
+import { NamedError as x } from "./named_error.js";
+import { PCGMinimal as S } from "./pcg_minimal.js";
+import { floatRng as C } from "./random.js";
+import { fromBase64 as w, fromBase64URL as T, fromOct as E, toBase64 as D, toBase64URL as O, toOct as k } from "./u8arr_ext.js";
+import { compress as A, compressString as j, decodeRFC3986URIComponent as M, decompress as N, decompressString as P, encodeRFC3986URIComponent as F, getHash as I, getStringTag as L, isDeepStrictEqual as R, lazify as z, nullableStrictAt as B, parseCSV as V, sameValueZero as H, setTimeoutPromise as U, sleep as W, sleepSort as G, strictAt as K, withResolvers as q } from "./util.js";
+import { XoshiroMinimal as J } from "./xoshiro_minimal.js";
+export { e as AsyncWorker, x as NamedError, S as PCGMinimal, v as Rational, J as XoshiroMinimal, _ as bailliePSW, h as bailliePSWAsync, A as compress, j as compressString, y as decodeLEB128, M as decodeRFC3986URIComponent, N as decompress, P as decompressString, b as encodeLEB128, F as encodeRFC3986URIComponent, r as exEuclidean, i as factorial, C as floatRng, w as fromBase64, T as fromBase64URL, E as fromOct, I as getHash, a as getRandBIByBitLength, o as getRandBIByRange, g as getRandPrimeByBitLength, m as getRandPrimeByRange, s as getRndInt, L as getStringTag, R as isDeepStrictEqual, c as isSquare, l as jacobiSymbol, z as lazify, u as modPow, B as nullableStrictAt, V as parseCSV, t as postFailed, n as postSuccess, d as residue, f as rot32, p as rot64, H as sameValueZero, U as setTimeoutPromise, W as sleep, G as sleepSort, K as strictAt, D as toBase64, O as toBase64URL, k as toOct, q as withResolvers };

package/dist/esm/leb128.js

@@ -0,0 +1,23 @@
+//#region lib/leb128.ts
+var e = (e) => {
+	let t = e < 0n;
+	t && (e *= -1n);
+	let n = e.toString(2).length, r = e === 1n << BigInt(n - 1) && !(n % 7) && t, i = Math.floor(n / 7) + 1;
+	return r ? i - 1 : i;
+}, t = (t) => {
+	let n = e(t);
+	t = BigInt.asUintN(n * 7, t);
+	let r = new Uint8Array(n);
+	for (let e = 0; e < n - 1; ++e) r[e] = Number(t & 127n) | 128, t >>= 7n;
+	let i = Number(t & 127n);
+	return r[n - 1] = i, t >>= 7n, r;
+}, n = (e) => {
+	let t = e.length, n = 0n;
+	for (let [t, r] of e.entries()) {
+		let e = BigInt(r & 127);
+		n += e << BigInt(7 * t);
+	}
+	return BigInt.asIntN(7 * t, n);
+};
+//#endregion
+export { n as decodeLEB128, t as encodeLEB128 };

package/dist/esm/math.js

@@ -0,0 +1,120 @@
+//#region lib/math.ts
+var e = (e, t) => Math.floor(Math.random() * (t - e) + e), t = (e, t) => {
+	t < 0n && (t *= -1n);
+	let n = e % t;
+	return n < 0n ? n + t : n;
+}, n = (e, t = !1) => {
+	if (!Number.isFinite(e)) throw RangeError("`length` is not a valid number");
+	if (e <= 0) throw RangeError("`length` must be positive");
+	let n = Math.ceil(e / 8), r = crypto.getRandomValues(new Uint8Array(n)), i = Array.from(r, (e) => e.toString(2).padStart(8, "0")).join("").slice(0, e);
+	return t && (i = i.replace(/^\d/, "1")), BigInt("0b" + i);
+}, r = (e, t) => {
+	if (e >= t) throw RangeError("`min` must be smaller than `max`");
+	let r = t - e, a = r.toString(2).length;
+	return e + (() => {
+		for (let e = 0; e < 1e5; e++) {
+			let e = n(a);
+			if (e >= i(2n, BigInt(a), r)) return e % r;
+		}
+		throw Error("Failed to generate a random bigint");
+	})();
+}, i = (e, n, r) => {
+	if (r < 1n) throw RangeError("`mod` must be positive");
+	if (n < 0n) throw RangeError("`power` must not be negative");
+	if (e = t(e, r), r === 1n) return 0n;
+	if (e % r === 1n || e % r === 0n) return e;
+	if (e === r - 1n) return n & 1n ? r - 1n : 1n;
+	let i = 1n;
+	for (; n > 0n;) n & 1n && (i = i * e % r), e = e * e % r, n >>= 1n;
+	return i;
+}, a = (e, t) => {
+	if (e === 0n && t === 0n) return {
+		x: 0n,
+		y: 0n,
+		gcd: 0n
+	};
+	if (e === 0n) return t > 0n ? {
+		x: 0n,
+		y: -1n,
+		gcd: t
+	} : {
+		x: 0n,
+		y: 1n,
+		gcd: -t
+	};
+	if (t === 0n) return e > 0n ? {
+		x: 1n,
+		y: 0n,
+		gcd: e
+	} : {
+		x: -1n,
+		y: 0n,
+		gcd: -e
+	};
+	let [n, r, i] = [
+		1n,
+		0n,
+		e
+	], [a, o, s] = [
+		0n,
+		-1n,
+		t
+	];
+	for (;;) {
+		let e = i / s, t = i - e * s;
+		if (t === 0n) break;
+		[n, a] = [a, n - e * a], [r, o] = [o, r - e * o], [i, s] = [s, t];
+	}
+	return s < 0n && (a *= -1n, o *= -1n, s *= -1n), {
+		x: a,
+		y: o,
+		gcd: s
+	};
+}, o = (e, t) => {
+	if (e >= t) return 1n;
+	let n = BigInt((t - 2n).toString(2).length), r = (t - e) / 2n;
+	if (n * r < 63n) {
+		let n = e;
+		for (let r = e + 2n; r < t; r += 2n) n *= r;
+		return n;
+	}
+	let i = e + r | 1n;
+	return o(e, i) * o(i, t);
+}, s = (e) => {
+	let t = 3n, n = 1n, r = 1n, i = BigInt(e.toString(2).length) - 1n;
+	for (let a = i - 1n; a > -1n; --a) {
+		let i = (e >> a) + 1n | 1n;
+		r *= o(t, i), t = i, n *= r;
+	}
+	return n;
+}, c = (e) => {
+	if (e < 0n) throw RangeError("'n' must be non-negative");
+	if (e === 0n) return 1n;
+	let t = e - BigInt(e.toString(2).match(/1/g)?.length ?? 0);
+	return s(e) << t;
+}, l = (e, t) => (e >>> (t & 31) | e << (-t & 31)) >>> 0, u = (e, t) => BigInt.asUintN(64, e >> (t & 63n) | e << (-t & 63n)), d = (e, t) => {
+	if (t < 1n || t % 2n == 0n) throw RangeError("`n` is out of range");
+	for (; e < 0n;) e += t;
+	e %= t;
+	let n = 1n;
+	for (; e !== 0n;) {
+		for (; e % 2n == 0n;) {
+			e /= 2n;
+			let r = t % 8n;
+			(r === 3n || r === 5n) && (n *= -1n);
+		}
+		[e, t] = [t, e], e % 4n == 3n && t % 4n == 3n && (n *= -1n), e %= t;
+	}
+	return t === 1n ? n : 0n;
+}, f = (e) => {
+	if (e < 0n) return !1;
+	if (e === 0n) return !0;
+	let t = 1n, n = e;
+	for (; t + 1n < n;) {
+		let r = (t + n) / 2n;
+		r * r < e ? t = r : n = r;
+	}
+	return e === t ** 2n || e === (t + 1n) ** 2n;
+};
+//#endregion
+export { a as exEuclidean, c as factorial, n as getRandBIByBitLength, r as getRandBIByRange, e as getRndInt, f as isSquare, d as jacobiSymbol, i as modPow, t as residue, l as rot32, u as rot64 };

package/dist/esm/named_error.js

@@ -0,0 +1,25 @@
+//#region lib/named_error.ts
+var e = "NamedError", t = class extends Error {
+	static name = e;
+	errName;
+	constructor(e, t, n) {
+		super(t, n), this.errName = e;
+	}
+	toJSON = () => {
+		let e = (() => {
+			let e = this.cause;
+			if (e == null) return e;
+			let t = e.toString();
+			return t === "[object Object]" ? JSON.stringify(e) : t;
+		})(), { errName: t, message: n, stack: r } = this;
+		return {
+			name: t,
+			message: n,
+			stack: r,
+			cause: e
+		};
+	};
+};
+Object.defineProperty(t.prototype, Symbol.toStringTag, { value: e });
+//#endregion
+export { t as NamedError };

package/dist/esm/pcg_minimal.js

@@ -0,0 +1,40 @@
+import { rot32 as e } from "./math.js";
+//#region lib/pcg_minimal.ts
+var t = [9600629759793949339n, 15726070495360670683n], n = 6364136223846793005n, r = "PCGMinimal", i = class {
+	#e;
+	static name = r;
+	constructor(e) {
+		if (e && e[0] != null && e[1] != null) {
+			if (this.#e = new BigUint64Array(2), this.#e[0] == null || this.#e[1] == null) throw TypeError("unexpected");
+			this.#e[1] = e[1] << 1n | 1n, this.#t(), this.#e[0] += e[0], this.#t();
+		} else this.#e = BigUint64Array.from(t);
+	}
+	#t() {
+		if (this.#e[0] == null || this.#e[1] == null) throw TypeError("unexpected");
+		this.#e[0] = this.#e[0] * n + this.#e[1];
+	}
+	get #n() {
+		if (this.#e[0] == null || this.#e[1] == null) throw TypeError("unexpected");
+		let t = this.#e[0], n = Number(t >> 59n);
+		return e(Number(BigInt.asUintN(32, (t ^ t >> 18n) >> 27n)), n);
+	}
+	getRandU32 = () => (this.#t(), this.#n);
+	getBoundedRandU32 = (e) => {
+		let t = 4294967296;
+		if (e > t) throw RangeError("`bound` exceeded limit (2^32)");
+		if (e <= 0) throw RangeError("'bound' must be positive");
+		let n = t % e;
+		for (let t = 0; t < 1e5; ++t) {
+			let t = this.getRandU32();
+			if (t >= n) return t % e;
+		}
+		throw Error("exceeded loop limit");
+	};
+	*genRandU32s(e, t) {
+		if (e <= 0) throw RangeError("'step' must be positive");
+		for (let n = 0; n < e; n++) yield typeof t == "number" ? this.getBoundedRandU32(t) : this.getRandU32();
+	}
+};
+Object.defineProperty(i.prototype, Symbol.toStringTag, { value: r });
+//#endregion
+export { i as PCGMinimal };

package/dist/esm/random.js

@@ -0,0 +1,32 @@
+//#region lib/random.ts
+var e = (e) => {
+	if (e === 0n) return 64n;
+	let t = 0n;
+	for (; e > 0n && !(e & 1n);) ++t, e >>= 1n;
+	return BigInt.asUintN(64, t);
+}, t = (t, n) => {
+	let r = 0n, i = t & 2047n, a = 1023n - 1n;
+	if (i > 0n) return a -= e(i), a;
+	a -= 11n;
+	for (let t = 0; t < 1e5; ++t) {
+		let t = n();
+		if (t > 0n) return a -= e(t), a;
+		if (a -= 64n, a < r) return r;
+	}
+	throw Error("loop exceeded limit");
+}, n = (e) => {
+	let n = () => BigInt.asUintN(64, e()), r = () => {
+		let e = n(), r = BigInt.asUintN(52, e >> 11n), i = r === 0n && e >> 63n == 1n ? t(e, n) + 1n : t(e, n), { buffer: a } = BigUint64Array.from([i << 52n | r]), o = new Float64Array(a)[0];
+		if (o == null) throw Error("unexpected");
+		return o;
+	};
+	return () => {
+		for (let e = 0; e < 1e5; ++e) {
+			let e = r();
+			if (e < 1) return e;
+		}
+		throw Error("Loop limit exceeded");
+	};
+};
+//#endregion
+export { n as floatRng };

package/dist/esm/u8arr_ext.js

@@ -0,0 +1,19 @@
+//#region lib/u8arr_ext.ts
+var e = (e) => {
+	let t = Array.from(e, (e) => String.fromCharCode(e));
+	return btoa(t.join(""));
+}, t = (e) => {
+	let t = atob(e);
+	return Uint8Array.from(t, (e) => e.charCodeAt(0));
+}, n = (t) => e(t).replaceAll("+", "-").replaceAll("/", "_").replace(/=+$/, ""), r = (e) => {
+	let n = 4 - (e.length & 3) & 3;
+	return t(e.concat("=".repeat(n)).replaceAll("-", "+").replaceAll("_", "/"));
+}, i = (e) => {
+	let t = Array.from(e, (e) => e.toString(16).padStart(2, "0")).join(""), n = (6 - t.length % 6) % 6, r = "0".repeat(n).concat(t).matchAll(/.{6}/g);
+	return Array.from(r, (e) => Number.parseInt(e[0], 16).toString(8).padStart(8, "0")).join("").replace(/^0+/, "");
+}, a = (e) => {
+	let t = 8 - (e.length & 7) & 7, n = "0".repeat(t).concat(e).matchAll(/.{8}/g), r = Array.from(n, (e) => Number.parseInt(e[0], 8).toString(16).padStart(6, "0")).join("").matchAll(/.{2}/g);
+	return Uint8Array.from(r, (e) => Number.parseInt(e[0], 16));
+};
+//#endregion
+export { t as fromBase64, r as fromBase64URL, a as fromOct, e as toBase64, n as toBase64URL, i as toOct };

package/dist/{util.d.ts → esm/util.d.ts}

@@ -89,3 +89,4 @@ export declare const nullableStrictAt: <T>(array: T[], index: number) => T | und
  * @returns
  */
 export declare const strictAt: <T extends {}>(array: T[], index: number) => T;
+export declare const sleepSort: (array: number[]) => Promise<number[]>;