@tktb-tess/util-fns 0.13.0 → 0.13.1

package/dist/esm/async_worker.d.ts

@@ -6,7 +6,7 @@ export interface WorkerMessage<T> {
     readonly value: T;
     readonly id: ID;
 }
-export declare class AsyncWorker<TPost = unknown, TRecv = unknown, TErr = unknown> {
+export declare class AsyncWorker<TPost = unknown, TRecv = unknown> {
     #private;
     static readonly name = "AsyncWorker";
     constructor(w: Worker);
@@ -18,5 +18,5 @@ export declare class AsyncWorker<TPost = unknown, TRecv = unknown, TErr = unknow
     readonly postMessage: (message: TPost, options?: StructuredSerializeOptions) => Promise<TRecv>;
 }
 export declare const postSuccess: <TRecv>(value: TRecv, id: ID) => void;
-export declare const postFailed: <TErr>(error: TErr, id: ID) => void;
+export declare const postFailed: (error: unknown, id: ID) => void;
 export {};

package/dist/esm/async_worker.js

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

package/dist/esm/baillie_psw.js

@@ -1,3 +1,165 @@
-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 };
+import { n as e, t } from "./mod_pow-S-7GJ74l.js";
+import { isSquare as n, jacobiSymbol as r } from "./math.js";
+import { getRandBIByBitLength as i, getRandBIByRange as a } from "./random.js";
+//#region lib/baillie_psw.ts
+var o = [
+	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
+], s = (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;
+}, c = (e) => {
+	let t = 5n;
+	for (;;) {
+		let i = r(t, e);
+		if (i === -1n) return t;
+		if (i === 0n || (t = t > 0n ? -(t + 2n) : -(t - 2n), t === -15n && n(e))) return null;
+	}
+}, l = (t, n) => {
+	if ((n & 1n) == 0n) throw Error("`n` is not odd");
+	return (t & 1n) == 1n ? e(t + n >> 1n, n) : e(t >> 1n, n);
+}, u = (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), l(o * o + i * a * a, n)], t === "1" && ([a, o] = [l(r * a + o, n), l(i * a + r * o, n)]);
+	return [a, o];
+}, d = (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] = u(o, n, i, r), d = l;
+	if (c === 0n) return !0;
+	a = t(a, o, n);
+	for (let r = 0n; r < s; r++) {
+		if (d === 0n) return !0;
+		d = e(d * d - 2n * a, n), a = t(a, 2n, n);
+	}
+	return !1;
+}, f = (e) => {
+	if (e <= 1n) return !1;
+	if (e % 2n == 0n) return e === 2n;
+	for (let t of o) if (e % t === 0n) return e === t;
+	if (!s(e)) return !1;
+	let t = c(e);
+	return t == null ? !1 : d(e, t, 1n, (1n - t) / 4n);
+}, p = (e, t) => {
+	if (t < 2n) throw RangeError("`max` must be 2 or larger");
+	for (let n = 0; n < 1e5; n++) {
+		let n = a(e, t);
+		if (f(n)) return n;
+	}
+	throw Error("no primes were found");
+}, m = (e, t = !1) => {
+	if (e < 2) throw RangeError("`bitLength` must be 2 or larger");
+	for (let n = 0; n < 1e5; n++) {
+		let n = i(e, t);
+		if (f(n)) return n;
+	}
+	throw Error("no primes were found");
+}, h = async (e) => {
+	let { getWorker: t } = await import("./bpsw_worker_wrap-DlBkGgip.js");
+	return (await t()).postMessage(e);
+};
+//#endregion
+export { f as bailliePSW, h as bailliePSWAsync, m as getRandPrimeByBitLength, p as getRandPrimeByRange };

package/dist/esm/{u8arr_ext.d.ts → base64.d.ts}

@@ -2,5 +2,3 @@ export declare const toBase64: (bin: Uint8Array) => string;
 export declare const fromBase64: (base64: string) => Uint8Array<ArrayBuffer>;
 export declare const toBase64URL: (bin: Uint8Array) => string;
 export declare const fromBase64URL: (base64URL: string) => Uint8Array<ArrayBuffer>;
-export declare const toOct: (bin: Uint8Array) => string;
-export declare const fromOct: (oct: string) => Uint8Array<ArrayBuffer>;

package/dist/esm/base64.js

@@ -0,0 +1,13 @@
+//#region lib/base64.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("_", "/"));
+};
+//#endregion
+export { t as fromBase64, r as fromBase64URL, e as toBase64, n as toBase64URL };

package/dist/esm/bpsw_worker_wrap-DlBkGgip.js

@@ -0,0 +1,20 @@
+import { AsyncWorker as e } from "./async_worker.js";
+//#region lib/bpsw_worker.ts?worker&inline
+var t = "(function(){var e=(e,t)=>()=>(e&&(t=e(e=0)),t);let t=(e,t)=>{t<0n&&(t*=-1n);let n=e%t;return n<0n?n+t:n},n=(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},r=(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},i=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};var a,o,s,c,l,u,d,f,p=e((()=>{a=`AsyncWorker`,o=2n**128n,s=0n,c=()=>(s===o&&(s=0n),s++),l=class{static name=a;#e;constructor(e){this.#e=e}postMessage=(e,t)=>new Promise((n,r)=>{let i=c(),a=new AbortController,{signal:o}=a;this.#e.addEventListener(`message`,e=>{let t=e.data;t.id===i&&(a.abort(),t.success?n(t.value):r(t.error))},{signal:o}),this.#e.addEventListener(`error`,e=>{a.abort(),r(e.error)},{signal:o});let s={value:e,id:i};this.#e.postMessage(s,t)})},Object.defineProperty(l.prototype,Symbol.toStringTag,{value:a,enumerable:!0}),u=()=>typeof window>`u`&&typeof self<`u`&&`importScripts`in self,d=(e,t)=>{if(!u())throw Error(`this function must be used in Worker`);let n={success:!0,value:e,id:t};self.postMessage(n)},f=(e,t)=>{if(!u())throw Error(`this function must be used in Worker`);let n={success:!1,error:e,id:t};self.postMessage(n)}}));let 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;let t=e-1n,r=0n;for(;t%2n==0n;)t>>=1n,r+=1n;let[i,a]=[t,r],o=n(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},g=e=>{let t=5n;for(;;){let n=r(t,e);if(n===-1n)return t;if(n===0n||(t=t>0n?-(t+2n):-(t-2n),t===-15n&&i(e)))return null}},_=(e,n)=>{if((n&1n)==0n)throw Error(\"`n` is not odd\");return(e&1n)==1n?t(e+n>>1n,n):t(e>>1n,n)},v=(e,n,r,i)=>{let a=1n,o=r,s=e.toString(2).slice(1);for(let e of s)[a,o]=[t(a*o,n),_(o*o+i*a*a,n)],e===`1`&&([a,o]=[_(r*a+o,n),_(i*a+r*o,n)]);return[a,o]},y=(e,r,i,a)=>{if(e%2n!=1n)throw RangeError(\"`n` must be odd\");let o=e+1n,s=0n;for(;o%2n==0n;)o>>=1n,s+=1n;let[c,l]=v(o,e,i,r),u=l;if(c===0n)return!0;a=n(a,o,e);for(let r=0n;r<s;r++){if(u===0n)return!0;u=t(u*u-2n*a,e),a=n(a,2n,e)}return!1},b=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(!h(e))return!1;let t=g(e);return t==null?!1:y(e,t,1n,(1n-t)/4n)};p();let x=e=>{if(e==null)return;let t=`${e}`;return t===`[object Object]`?JSON.stringify(e):t};globalThis.onmessage=e=>{let{value:t,id:n}=e.data;try{d(b(t),n)}catch(e){if(e instanceof Error){let{name:t,message:r,stack:i,cause:a}=e;f({name:t,message:r,stack:i,cause:x(a)},n)}else f({name:`BPSWError`,message:`unidentified error`,cause:x(e)},n)}}})();", n = typeof self < "u" && self.Blob && new Blob(["(self.URL || self.webkitURL).revokeObjectURL(self.location.href);", t], { type: "text/javascript;charset=utf-8" });
+function r(e) {
+	let r;
+	try {
+		if (r = n && (self.URL || self.webkitURL).createObjectURL(n), !r) throw "";
+		let t = new Worker(r, { name: e?.name });
+		return t.addEventListener("error", () => {
+			(self.URL || self.webkitURL).revokeObjectURL(r);
+		}), t;
+	} catch {
+		return new Worker("data:text/javascript;charset=utf-8," + encodeURIComponent(t), { name: e?.name });
+	}
+}
+//#endregion
+//#region lib/bpsw_worker_wrap.ts
+var i, a = async () => (i ||= new e(new r({ name: "bpsw_worker" })), i);
+//#endregion
+export { a as getWorker };

package/dist/esm/bpsw_worker_wrap.d.ts

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

package/dist/esm/compression.d.ts

@@ -0,0 +1,30 @@
+/**
+ * Compress binary data
+ * @param raw
+ * @param format
+ * @returns
+ */
+export declare const compress: (raw: Uint8Array<ArrayBuffer>, format: CompressionFormat) => Promise<Uint8Array<ArrayBuffer>>;
+/**
+ * Decompress binary data
+ * @param compressed
+ * @param format
+ * @returns
+ */
+export declare const decompress: (compressed: Uint8Array<ArrayBuffer>, format: CompressionFormat) => Promise<Uint8Array<ArrayBuffer>>;
+/**
+ * Compress string into Base64(URL)-encoded string
+ * @param str
+ * @param format
+ * @param encoding default: `base64url`
+ * @returns
+ */
+export declare const compressString: (str: string, format: CompressionFormat, encoding?: "base64" | "base64url") => Promise<string>;
+/**
+ * Decompress Base64(URL)-encoded data
+ * @param compressedString
+ * @param format
+ * @param encoding default: `base64url`
+ * @returns
+ */
+export declare const decompressString: (compressedString: string, format: CompressionFormat, encoding?: "base64" | "base64url") => Promise<string>;

package/dist/esm/compression.js

@@ -0,0 +1,17 @@
+import { fromBase64 as e, fromBase64URL as t, toBase64 as n, toBase64URL as r } from "./base64.js";
+//#region lib/compression.ts
+var i = (e, t) => {
+	let n = new Blob([e]).stream().pipeThrough(new CompressionStream(t));
+	return new Response(n).bytes();
+}, a = (e, t) => {
+	let n = new Blob([e]).stream().pipeThrough(new DecompressionStream(t));
+	return new Response(n).bytes();
+}, o = async (e, t, i = "base64url") => {
+	let a = new Blob([e]).stream().pipeThrough(new CompressionStream(t)), o = await new Response(a).bytes();
+	return i === "base64" ? n(o) : r(o);
+}, s = (n, r, i = "base64url") => {
+	let a = i === "base64" ? e(n) : t(n), o = new Blob([a]).stream().pipeThrough(new DecompressionStream(r));
+	return new Response(o).text();
+};
+//#endregion
+export { i as compress, o as compressString, a as decompress, s as decompressString };

package/dist/esm/equality.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Compare two objects with SameValueZero method
+ * @param a
+ * @param b
+ * @returns
+ */
+export declare const sameValueZero: (a: unknown, b: unknown) => boolean;
+/**
+ * Judges whether two objects has the same (nested) properties \
+ * Compares with SameValueZero, ignores symbol keys in an object
+ * @returns
+ */
+export declare const isDeepStrictEqual: (a: unknown, b: unknown) => boolean;

package/dist/esm/equality.js

@@ -0,0 +1,29 @@
+//#region lib/equality.ts
+var e = (e, t) => [e].includes(t), t = (e, n) => {
+	if (typeof e != typeof n) return !1;
+	let r = Object.prototype.toString.call(e);
+	if (r !== Object.prototype.toString.call(n)) return !1;
+	if (typeof e == "string" || typeof e == "bigint" || typeof e == "boolean" || typeof e == "symbol" || e == null) return e === n;
+	if (typeof e == "number") return e === n || e !== e && n !== n;
+	if (typeof e == "function") return !1;
+	if (Array.isArray(e) && Array.isArray(n)) {
+		if (e.length !== n.length) return !1;
+		for (let r = 0; r < e.length; r++) if (!t(e[r], n[r])) return !1;
+		return !0;
+	}
+	if (e instanceof Set && n instanceof Set) return !!t([...e.values()], [...n.values()]);
+	if (e instanceof Map && n instanceof Map) return !(!t([...e.keys()], [...n.keys()]) || !t([...e.values()], [...n.values()]));
+	if (r === "[object Object]") {
+		let r = e, i = n, a = Object.keys(r), o = Object.keys(i);
+		for (let e of a) {
+			let n = o.find((t) => t === e);
+			if (n == null) return !1;
+			let [a, s] = [r[e], i[n]];
+			if (!t(a, s)) return !1;
+		}
+		return !0;
+	}
+	throw TypeError(`comparing these objects is unavailable: ${e}, ${n}`, { cause: [e, n] });
+};
+//#endregion
+export { t as isDeepStrictEqual, e as sameValueZero };

package/dist/esm/fixed_array.d.ts

@@ -0,0 +1,9 @@
+interface FixedUint8Array<B extends ArrayBufferLike, N extends number> extends Uint8Array<B> {
+    readonly length: N;
+    readonly byteLength: N;
+}
+declare const FixedUint8Array: {
+    new: <N extends number>(length: N) => FixedUint8Array<ArrayBuffer, N>;
+    fromBuffer: <B extends ArrayBufferLike, N extends number>(buffer: B, byteOffset: number, length: N) => FixedUint8Array<B, N>;
+};
+export { FixedUint8Array };

package/dist/esm/fixed_array.js

@@ -0,0 +1,7 @@
+//#region lib/fixed_array.ts
+var e = {
+	new: (e) => new Uint8Array(e),
+	fromBuffer: (e, t, n) => new Uint8Array(e, t, n)
+};
+//#endregion
+export { e as FixedUint8Array };

package/dist/esm/fraction.d.ts

@@ -3,64 +3,67 @@ export interface RationalData {
     /** `[numerator, denominator]` */
     value: [string, string];
 }
+/**
+ * Fraction (rational) class
+ */
 export declare class Rational {
     #private;
     static readonly name = "Rational";
     /**
-     * fraction (rational) class
+     *
      * @param numerator
      * @param denominator
      */
     constructor(numerator: bigint, denominator: bigint);
     /**
-     * generates fraction from `number` decimal using continued fraction
+     * Generates fraction from `number` decimal using continued fraction
      * @param value decimal
      * @param denominatorDigits limit of digits of denominator
      */
     static fromDecimal(value: number, denominatorDigits?: number): Rational;
     /**
-     * returns a fraction multiplied by -1
-     * @returns
+     *
+     * @returns A fraction multiplied by -1
      */
     readonly minus: () => Rational;
     /**
-     * returns inverse of this fraction
-     * @returns
+     *
+     * @returns Inverse of this fraction
      */
     readonly inverse: () => Rational;
     /**
-     * returns `this + right`
+     *
      * @param right
-     * @returns
+     * @returns `this + right`
      */
     readonly add: (right: Rational) => Rational;
     /**
-     * returns `this - right`
+     *
      * @param right
-     * @returns
+     * @returns `this - right`
      */
     readonly substr: (right: Rational) => Rational;
     /**
-     * returns `this * right`
+     *
      * @param right
-     * @returns
+     * @returns `this * right`
      */
     readonly multiply: (right: Rational) => Rational;
     /**
-     * returns `this / right`
+     *
      * @param right
-     * @returns
+     * @returns `this / right`
      */
     readonly divide: (right: Rational) => Rational;
     /**
-     * returns mediant
+     * Returns mediant
      * @param this `a / b`
      * @param right `c / d`
      * @returns `(a + c) / (b + d)`
      */
     readonly mediant: (right: Rational) => Rational;
     /**
-     * returns `number` type decimal
+     * Returns `number` type decimal
      * @returns decimal
      */
     readonly toDecimal: () => number;

package/dist/esm/fraction.js

@@ -23,10 +23,10 @@ var t = "Rational", n = class n {
 		}
 		return new n(r ? -o : o, c);
 	}
-	#n() {
+	#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) => {

package/dist/esm/index.d.ts

@@ -1,9 +1,13 @@
 export * from './util';
 export * from './math';
 export * from './baillie_psw';
+export * from './base64';
+export * from './compression';
+export * from './equality';
 export * from './fraction';
-export * from './u8arr_ext';
+export * from './fixed_array';
 export * from './named_error';
+export * from './oct';
 export * from './random';
 export * from './pcg_minimal';
 export * from './xoshiro_minimal';

package/dist/esm/index.js

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

package/dist/esm/leb128.d.ts

@@ -1,2 +1,12 @@
+/**
+ * Encode bigint to LEB128
+ * @param bigint
+ * @returns
+ */
 export declare const encodeLEB128: (bigint: bigint) => Uint8Array<ArrayBuffer>;
+/**
+ * Decode LEB128 into bigint
+ * @param LEB128
+ * @returns
+ */
 export declare const decodeLEB128: (LEB128: Uint8Array<ArrayBuffer>) => bigint;

package/dist/esm/math.d.ts

@@ -1,41 +1,6 @@
+export { residue, modPow } from './mod_pow';
 /**
- * returns an integer of `min` or more and less than `max`
- * @param min
- * @param max
- * @returns 範囲内の整数乱数
- */
-export declare const getRndInt: (min: number, max: number) => number;
-/**
- * residue, but always a positive residue even `n` is negative
- * @param n
- * @param modulo
- * @returns
- */
-export declare const residue: (n: bigint, modulo: bigint) => bigint;
-/**
- * `length` ビットの乱数 or `length` ビット以下の乱数を出力する
- * @param length ビット長
- * @param fixed true: 固定長, false (デフォルト値): `length` ビット以下の可変ビット長
- *
- */
-export declare const getRandBIByBitLength: (length: number, fixed?: boolean) => bigint;
-/**
- * returns a random integer of `min` or more and less than `max`
- * @param min minimum
- * @param max upper limit
- * @returns
- */
-export declare const getRandBIByRange: (min: bigint, max: bigint) => bigint;
-/**
- * calculates modpow
- * @param base
- * @param power
- * @param mod
- *
- */
-export declare const modPow: (base: bigint, power: bigint, mod: bigint) => bigint;
-/**
- * extended Euclidean algorithm \
+ * Extended Euclidean algorithm \
  * reference: https://qiita.com/angel_p_57/items/56a902cbd1fe519747bd
  *
  * @description `ax - by = gcd(a, b)`
@@ -49,7 +14,7 @@ export declare const exEuclidean: (a: bigint, b: bigint) => {
     gcd: bigint;
 };
 /**
- * returns factorial of an input \
+ * Returns factorial of an input \
  * ref: https://qiita.com/AkariLuminous/items/1b2e964ebabde9419224
  * @param n integer
  * @returns factorial of `n`
@@ -76,7 +41,7 @@ export declare const rot64: (value: bigint, rot: bigint) => bigint;
  */
 export declare const jacobiSymbol: (a: bigint, n: bigint) => bigint;
 /**
- * whether an input number is square
+ * Whether an input number is square
  * @param n
  * @returns
  */