@nberlette/math 0.7.0

package/cjs/log2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"log2.js","sourceRoot":"","sources":["../src/log2.ts"],"names":[],"mappings":";;AAkBA,oBAEC;AApBD;;;;GAIG;AACH,mDAA6C;AAC7C,qCAA+B;AAE/B;;;;;;;;;GASG;AACH,SAAgB,IAAI,CAAC,CAAS;IAC5B,OAAO,IAAA,YAAG,EAAC,CAAC,CAAC,GAAG,gBAAK,CAAC;AACxB,CAAC"}

package/cjs/max.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Returns the largest of its arguments, or `NaN` if any argument is `NaN`.
+ * If no arguments are provided, the result is `-Infinity`.
+ *
+ * This function is designed as a fast alternative to the built-in `Math.max`
+ * function. It is optimized for performance, and isn't susceptible to any
+ * global state changes or monkey-patching that might affect the built-in
+ * `Math.max` function.
+ *
+ * @param numbers The numbers to compare.
+ * @returns The largest number in the list.
+ * @category Comparison
+ * @example
+ * ```ts
+ * import { max } from "@nick/math";
+ *
+ * const largest = max(1, 2); // 2
+ * const alsoLargest = max(-1, 0); // 0
+ * ```
+ */
+export declare function max(...numbers: number[]): number;
+//# sourceMappingURL=max.d.ts.map

package/cjs/max.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"max.d.ts","sourceRoot":"","sources":["../src/max.ts"],"names":[],"mappings":"AAiBA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,GAAG,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAQhD"}

package/cjs/max.js

@@ -0,0 +1,51 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.max = max;
+/**
+ * Returns the largest of its arguments, or `NaN` if any argument is `NaN`.
+ * If no arguments are provided, the result is `-Infinity`.
+ *
+ * @example
+ * ```ts
+ * import { max } from "@nick/math";
+ *
+ * const atLeastZero = (x: number) => max(x, 0);
+ *
+ * atLeastZero(+1); // 1
+ * atLeastZero(-1); // 0
+ * ```
+ * @module max
+ */
+const negative_infinity_js_1 = require("./constants/negative_infinity.js");
+/**
+ * Returns the largest of its arguments, or `NaN` if any argument is `NaN`.
+ * If no arguments are provided, the result is `-Infinity`.
+ *
+ * This function is designed as a fast alternative to the built-in `Math.max`
+ * function. It is optimized for performance, and isn't susceptible to any
+ * global state changes or monkey-patching that might affect the built-in
+ * `Math.max` function.
+ *
+ * @param numbers The numbers to compare.
+ * @returns The largest number in the list.
+ * @category Comparison
+ * @example
+ * ```ts
+ * import { max } from "@nick/math";
+ *
+ * const largest = max(1, 2); // 2
+ * const alsoLargest = max(-1, 0); // 0
+ * ```
+ */
+function max(...numbers) {
+    let result = negative_infinity_js_1.NEGATIVE_INFINITY;
+    for (let i = 0; i < numbers.length; i++) {
+        const number = numbers[i];
+        if (number !== number)
+            return number;
+        if (number > result)
+            result = number;
+    }
+    return result;
+}
+//# sourceMappingURL=max.js.map

package/cjs/max.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"max.js","sourceRoot":"","sources":["../src/max.ts"],"names":[],"mappings":";;AAqCA,kBAQC;AA7CD;;;;;;;;;;;;;;GAcG;AACH,2EAAqE;AAErE;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAgB,GAAG,CAAC,GAAG,OAAiB;IACtC,IAAI,MAAM,GAAG,wCAA2B,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,MAAM,KAAK,MAAM;YAAE,OAAO,MAAM,CAAC;QACrC,IAAI,MAAM,GAAG,MAAM;YAAE,MAAM,GAAG,MAAM,CAAC;IACvC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/cjs/min.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Returns the smallest of its arguments, or `NaN` if any argument is `NaN`.
+ * If no arguments are provided, the result is `Infinity`.
+ *
+ * @param numbers The numbers to compare.
+ * @returns The smallest number in the list.
+ * @category Comparison
+ */
+export declare function min(...numbers: number[]): number;
+//# sourceMappingURL=min.d.ts.map

package/cjs/min.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"min.d.ts","sourceRoot":"","sources":["../src/min.ts"],"names":[],"mappings":"AASA;;;;;;;GAOG;AACH,wBAAgB,GAAG,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAchD"}

package/cjs/min.js

@@ -0,0 +1,36 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.min = min;
+/**
+ * Returns the smallest of its arguments, or `NaN` if any argument is `NaN`.
+ * If no arguments are provided, the result is `Infinity`.
+ *
+ * @module min
+ */
+const positive_infinity_js_1 = require("./constants/positive_infinity.js");
+const negative_zero_js_1 = require("./guards/negative_zero.js");
+/**
+ * Returns the smallest of its arguments, or `NaN` if any argument is `NaN`.
+ * If no arguments are provided, the result is `Infinity`.
+ *
+ * @param numbers The numbers to compare.
+ * @returns The smallest number in the list.
+ * @category Comparison
+ */
+function min(...numbers) {
+    let result = positive_infinity_js_1.POSITIVE_INFINITY;
+    for (let i = 0; i < numbers.length; i++) {
+        const number = numbers[i];
+        if (number !== number)
+            return number;
+        if (number < result) {
+            result = number;
+            continue;
+        }
+        if (number === 0 && result === 0 && (0, negative_zero_js_1.isNegativeZero)(number)) {
+            result = number;
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=min.js.map

package/cjs/min.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"min.js","sourceRoot":"","sources":["../src/min.ts"],"names":[],"mappings":";;AAiBA,kBAcC;AA/BD;;;;;GAKG;AACH,2EAAqE;AACrE,gEAA2D;AAE3D;;;;;;;GAOG;AACH,SAAgB,GAAG,CAAC,GAAG,OAAiB;IACtC,IAAI,MAAM,GAAG,wCAA2B,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,MAAM,KAAK,MAAM;YAAE,OAAO,MAAM,CAAC;QACrC,IAAI,MAAM,GAAG,MAAM,EAAE,CAAC;YACpB,MAAM,GAAG,MAAM,CAAC;YAChB,SAAS;QACX,CAAC;QACD,IAAI,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,IAAA,iCAAc,EAAC,MAAM,CAAC,EAAE,CAAC;YAC3D,MAAM,GAAG,MAAM,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/cjs/package.json

@@ -0,0 +1,3 @@
+{
+  "type": "commonjs"
+}

package/cjs/pow.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Calculates the base number raised to the power of the exponent.
+ *
+ * @module pow
+ */
+/**
+ * Calculates the base number raised to the power of the exponent.
+ *
+ * **Note**: the `**` operator is equivalent to the `^` operator in standard
+ * mathematical notation, and is used to raise a number to a power. For those
+ * unfamiliar with its syntax: `x ** y` is the same as `x^y`.
+ *
+ * @param x The base number to raise to the power of `y`
+ * @param y The exponent to raise the base number by
+ * @returns The base number raised to the power of the exponent.
+ * @category Exponentiation
+ * @example
+ * ```ts
+ * import { pow } from "@nick/math";
+ *
+ * const MAX_SAFE_INTEGER = pow(2, 53) - 1;
+ *
+ * const foursquared = pow(4, 2); // 16
+ *
+ * const infinity = pow(1, 309); // Infinity
+ *
+ * const almost_infinity = pow(1, 308); // 1.7976931348623157e+308
+ * ```
+ */
+export declare function pow(x: number, y: number): number;
+//# sourceMappingURL=pow.d.ts.map

package/cjs/pow.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pow.d.ts","sourceRoot":"","sources":["../src/pow.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAEhD"}

package/cjs/pow.js

@@ -0,0 +1,36 @@
+"use strict";
+/**
+ * Calculates the base number raised to the power of the exponent.
+ *
+ * @module pow
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.pow = pow;
+/**
+ * Calculates the base number raised to the power of the exponent.
+ *
+ * **Note**: the `**` operator is equivalent to the `^` operator in standard
+ * mathematical notation, and is used to raise a number to a power. For those
+ * unfamiliar with its syntax: `x ** y` is the same as `x^y`.
+ *
+ * @param x The base number to raise to the power of `y`
+ * @param y The exponent to raise the base number by
+ * @returns The base number raised to the power of the exponent.
+ * @category Exponentiation
+ * @example
+ * ```ts
+ * import { pow } from "@nick/math";
+ *
+ * const MAX_SAFE_INTEGER = pow(2, 53) - 1;
+ *
+ * const foursquared = pow(4, 2); // 16
+ *
+ * const infinity = pow(1, 309); // Infinity
+ *
+ * const almost_infinity = pow(1, 308); // 1.7976931348623157e+308
+ * ```
+ */
+function pow(x, y) {
+    return x ** y;
+}
+//# sourceMappingURL=pow.js.map

package/cjs/pow.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pow.js","sourceRoot":"","sources":["../src/pow.ts"],"names":[],"mappings":";AAAA;;;;GAIG;;AA0BH,kBAEC;AA1BD;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,SAAgB,GAAG,CAAC,CAAS,EAAE,CAAS;IACtC,OAAO,CAAC,IAAI,CAAC,CAAC;AAChB,CAAC"}

package/cjs/random.d.ts

@@ -0,0 +1,93 @@
+/**
+ * Mersenne Twister implementation in TypeScript.
+ *
+ * Based on the original C-code by Makoto Matsumoto and Takuji Nishimura.
+ *
+ * @remarks
+ * This implementation is a simplified version of the original API, providing
+ * only a `random()` and `randomInt()` method for generating pseudo-random
+ * numbers, and a `init()` method for seeding the generator.
+ *
+ * Benchmarks show this API to be ever-so-slightly slower than the native
+ * `Math.random` function, while still performing well within an acceptable
+ * timing window. Since this is a pure-JS implementation, achieving speeds on
+ * the same level as a native API is simply not possible.
+ * @example
+ * ```ts
+ * import { MT19937 } from "@nick/math/random";
+ *
+ * const mt = new MT19937();
+ * const n = mt.random(); // e.g. 0.9507143115624784
+ * ```
+ * @example
+ * ```ts
+ * import { MT19937 } from "@nick/math/random";
+ *
+ * const mt = new MT19937(42);
+ * console.log(mt.random()); // 0.37454011430963874
+ * ```
+ *
+ * @see http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html for the
+ * original C code this is based on and more information on Mersenne Twister.
+ */
+export declare class MT19937 {
+    #private;
+    /**
+     * Initialize the singleton instance with a seed.
+     *
+     * @param seed - The seed value.
+     * @returns The singleton instance.
+     */
+    static init(...seed: number[]): MT19937;
+    /**
+     * Generates a random number on [0, 1)-real-interval.
+     * @returns A floating-point number between 0 and 1.
+     */
+    static random(): number;
+    /**
+     * Generates a random number on [0, 0xffffffff]-interval.
+     * @returns A 32-bit unsigned integer.
+     */
+    static randomInt(): number;
+    /**
+     * Initializes a new instance of the MersenneTwister class.
+     * @param seed - The seed value.
+     */
+    constructor(seed?: number);
+    /**
+     * Initializes mt[N] with a seed.
+     * @param seed - The seed value.
+     */
+    init(seed?: number): this;
+    /**
+     * Initialize by an array with array-length.
+     * @param seeds - The array for initializing keys.
+     */
+    initFromArray(...seeds: number[]): this;
+    /**
+     * Generates a random number on [0, 0xffffffff]-interval.
+     * @returns A 32-bit unsigned integer.
+     */
+    randomInt(): number;
+    /**
+     * Generates a random number on [0, 1)-real-interval.
+     * @returns A floating-point number between 0 and 1.
+     */
+    random(): number;
+}
+/**
+ * Generates a pseudo-random number in the range `[0, 1)`. This function is not
+ * cryptographically secure, and should not be used for any security-sensitive
+ * applications. It was designed to be a drop-in replacement for the native
+ * `Math.random()` function, with support for seeding the generator.
+ *
+ * @returns A pseudo-random number in the range `[0, 1)`.
+ * @category Random
+ * @see {@linkcode random.init} for seeding the generator.
+ * @see {@linkcode MT19937} for the Mersenne-Twister implementation this uses.
+ */
+export declare function random(): number;
+export declare namespace random {
+    var init: typeof MT19937.init;
+}
+//# sourceMappingURL=random.d.ts.map

package/cjs/random.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"random.d.ts","sourceRoot":"","sources":["../src/random.ts"],"names":[],"mappings":"AA8BA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,qBAAa,OAAO;;IAGlB;;;;;OAKG;IACH,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO;IAQvC;;;OAGG;IACH,MAAM,CAAC,MAAM,IAAI,MAAM;IAIvB;;;OAGG;IACH,MAAM,CAAC,SAAS,IAAI,MAAM;IAU1B;;;OAGG;gBACS,IAAI,CAAC,EAAE,MAAM;IAIzB;;;OAGG;IACH,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI;IAezB;;;OAGG;IACH,aAAa,CAAC,GAAG,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI;IAmCvC;;;OAGG;IACH,SAAS,IAAI,MAAM;IAoCnB;;;OAGG;IACH,MAAM,IAAI,MAAM;CAGjB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,MAAM,IAAI,MAAM,CAE/B;yBAFe,MAAM"}

package/cjs/random.js

@@ -0,0 +1,242 @@
+"use strict";
+var __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {
+    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a getter");
+    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot read private member from an object whose class did not declare it");
+    return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver);
+};
+var __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {
+    if (kind === "m") throw new TypeError("Private method is not writable");
+    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a setter");
+    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot write private member to an object whose class did not declare it");
+    return (kind === "a" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;
+};
+var _a, _MT19937_instance, _MT19937_mt, _MT19937_mti;
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MT19937 = void 0;
+exports.random = random;
+/**
+ * Generates a pseudo-random number in the range `[0, 1)`.
+ *
+ * **Important**: This function is not cryptographically secure. Do not use it
+ * for security-sensitive applications.
+ *
+ * @example
+ * ```ts
+ * import { random } from "@nick/math/random";
+ *
+ * console.log(random());
+ * // => 0.5390711768976619
+ * ```
+ * @module random
+ */
+const primordials_js_1 = require("./internal/primordials.js");
+/** Period parameters */
+const N = 624;
+/** The number of 32 bit words */
+const M = 397;
+/** Constant Vector A */
+const MATRIX_A = 0x9908b0df;
+/** Most significant W-R bits */
+const UPPER_MASK = 0x80000000;
+/** Least significant R bits */
+const LOWER_MASK = 0x7fffffff;
+/** UPPER_MASK + LOWER_MASK + 1 */
+const TOTAL_MASK = 0x100000000;
+/**
+ * Mersenne Twister implementation in TypeScript.
+ *
+ * Based on the original C-code by Makoto Matsumoto and Takuji Nishimura.
+ *
+ * @remarks
+ * This implementation is a simplified version of the original API, providing
+ * only a `random()` and `randomInt()` method for generating pseudo-random
+ * numbers, and a `init()` method for seeding the generator.
+ *
+ * Benchmarks show this API to be ever-so-slightly slower than the native
+ * `Math.random` function, while still performing well within an acceptable
+ * timing window. Since this is a pure-JS implementation, achieving speeds on
+ * the same level as a native API is simply not possible.
+ * @example
+ * ```ts
+ * import { MT19937 } from "@nick/math/random";
+ *
+ * const mt = new MT19937();
+ * const n = mt.random(); // e.g. 0.9507143115624784
+ * ```
+ * @example
+ * ```ts
+ * import { MT19937 } from "@nick/math/random";
+ *
+ * const mt = new MT19937(42);
+ * console.log(mt.random()); // 0.37454011430963874
+ * ```
+ *
+ * @see http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html for the
+ * original C code this is based on and more information on Mersenne Twister.
+ */
+class MT19937 {
+    /**
+     * Initialize the singleton instance with a seed.
+     *
+     * @param seed - The seed value.
+     * @returns The singleton instance.
+     */
+    static init(...seed) {
+        if (seed.length > 1) {
+            return __classPrivateFieldGet(_a, _a, "f", _MT19937_instance).initFromArray(...seed);
+        }
+        else {
+            return __classPrivateFieldGet(_a, _a, "f", _MT19937_instance).init(seed[0]);
+        }
+    }
+    /**
+     * Generates a random number on [0, 1)-real-interval.
+     * @returns A floating-point number between 0 and 1.
+     */
+    static random() {
+        return __classPrivateFieldGet(_a, _a, "f", _MT19937_instance).random();
+    }
+    /**
+     * Generates a random number on [0, 0xffffffff]-interval.
+     * @returns A 32-bit unsigned integer.
+     */
+    static randomInt() {
+        return __classPrivateFieldGet(_a, _a, "f", _MT19937_instance).randomInt();
+    }
+    /**
+     * Initializes a new instance of the MersenneTwister class.
+     * @param seed - The seed value.
+     */
+    constructor(seed) {
+        /** the array for the state vector */
+        _MT19937_mt.set(this, (0, primordials_js_1.ArrayFrom)({ length: N }, () => 0));
+        /** mti == N + 1 means mt[N] is not initialized */
+        _MT19937_mti.set(this, N + 1);
+        this.init(seed);
+    }
+    /**
+     * Initializes mt[N] with a seed.
+     * @param seed - The seed value.
+     */
+    init(seed) {
+        seed ?? (seed = (0, primordials_js_1.DateNow)());
+        __classPrivateFieldGet(this, _MT19937_mt, "f")[0] = seed >>> 0;
+        const mt = __classPrivateFieldGet(this, _MT19937_mt, "f");
+        const x = 1812433253, y = 0xffff0000, z = 0x0000ffff;
+        for (let i = 1; i < N; i++) {
+            const s = mt[i - 1] ^ (mt[i - 1] >>> 30);
+            const l = (((s & y) >>> 16) * x) << 16;
+            const r = (s & z) * x;
+            mt[__classPrivateFieldSet(this, _MT19937_mti, i, "f")] = (l + r + i) >>> 0;
+        }
+        __classPrivateFieldSet(this, _MT19937_mti, N, "f");
+        return this;
+    }
+    /**
+     * Initialize by an array with array-length.
+     * @param seeds - The array for initializing keys.
+     */
+    initFromArray(...seeds) {
+        let i = 1, j = 0;
+        const len = seeds.length;
+        this.init(19650218);
+        let k = N > len ? N : len;
+        const w = 1566083941;
+        const x = 1664525, y = 0xffff0000, z = 0x0000ffff;
+        for (; k > 0; k--) {
+            const s = __classPrivateFieldGet(this, _MT19937_mt, "f")[i - 1] ^ (__classPrivateFieldGet(this, _MT19937_mt, "f")[i - 1] >>> 30);
+            const u = (s & z) * x;
+            let t = ((s & y) >>> 16) * x << 16;
+            __classPrivateFieldGet(this, _MT19937_mt, "f")[i] = (t = __classPrivateFieldGet(this, _MT19937_mt, "f")[i] ^ t + u, t += seeds[j] + j, t >>> 0);
+            i++, j++;
+            if (i >= N) {
+                __classPrivateFieldGet(this, _MT19937_mt, "f")[0] = __classPrivateFieldGet(this, _MT19937_mt, "f")[N - 1];
+                i = 1;
+            }
+            if (j >= len)
+                j = 0;
+        }
+        for (k = N - 1; k > 0; k--) {
+            const s = __classPrivateFieldGet(this, _MT19937_mt, "f")[i - 1] ^ (__classPrivateFieldGet(this, _MT19937_mt, "f")[i - 1] >>> 30);
+            let t = __classPrivateFieldGet(this, _MT19937_mt, "f")[i];
+            t ^= (((s & y) >>> 16) * w << 16) + (s & z) * w;
+            __classPrivateFieldGet(this, _MT19937_mt, "f")[i] = (t - i) >>> 0;
+            i++;
+            if (i >= N) {
+                __classPrivateFieldGet(this, _MT19937_mt, "f")[0] = __classPrivateFieldGet(this, _MT19937_mt, "f")[N - 1];
+                i = 1;
+            }
+        }
+        /* MSB is 1; assuring non-zero initial array */
+        __classPrivateFieldGet(this, _MT19937_mt, "f")[0] = 0x80000000;
+        return this;
+    }
+    /**
+     * Generates a random number on [0, 0xffffffff]-interval.
+     * @returns A 32-bit unsigned integer.
+     */
+    randomInt() {
+        var _b, _c;
+        let y;
+        const mag01 = [0x0, MATRIX_A];
+        if (__classPrivateFieldGet(this, _MT19937_mti, "f") >= N) {
+            let kk;
+            /* a default initial seed is used */
+            if (__classPrivateFieldGet(this, _MT19937_mti, "f") === N + 1)
+                this.init(5489);
+            for (kk = 0; kk < N - M; kk++) {
+                y = (__classPrivateFieldGet(this, _MT19937_mt, "f")[kk] & UPPER_MASK) | (__classPrivateFieldGet(this, _MT19937_mt, "f")[kk + 1] & LOWER_MASK);
+                __classPrivateFieldGet(this, _MT19937_mt, "f")[kk] = __classPrivateFieldGet(this, _MT19937_mt, "f")[kk + M] ^ (y >>> 1) ^ mag01[y & 0x1];
+            }
+            for (; kk < N - 1; kk++) {
+                y = (__classPrivateFieldGet(this, _MT19937_mt, "f")[kk] & UPPER_MASK) | (__classPrivateFieldGet(this, _MT19937_mt, "f")[kk + 1] & LOWER_MASK);
+                __classPrivateFieldGet(this, _MT19937_mt, "f")[kk] = __classPrivateFieldGet(this, _MT19937_mt, "f")[kk + (M - N)] ^ (y >>> 1) ^ mag01[y & 0x1];
+            }
+            y = (__classPrivateFieldGet(this, _MT19937_mt, "f")[N - 1] & UPPER_MASK) | (__classPrivateFieldGet(this, _MT19937_mt, "f")[0] & LOWER_MASK);
+            __classPrivateFieldGet(this, _MT19937_mt, "f")[N - 1] = __classPrivateFieldGet(this, _MT19937_mt, "f")[M - 1] ^ (y >>> 1) ^ mag01[y & 0x1];
+            __classPrivateFieldSet(this, _MT19937_mti, 0, "f");
+        }
+        y = __classPrivateFieldGet(this, _MT19937_mt, "f")[__classPrivateFieldSet(this, _MT19937_mti, (_c = __classPrivateFieldGet(this, _MT19937_mti, "f"), _b = _c++, _c), "f"), _b];
+        // Tempering
+        y ^= y >>> 11;
+        y ^= (y << 7) & 0x9d2c5680;
+        y ^= (y << 15) & 0xefc60000;
+        y ^= y >>> 18;
+        return y >>> 0;
+    }
+    /**
+     * Generates a random number on [0, 1)-real-interval.
+     * @returns A floating-point number between 0 and 1.
+     */
+    random() {
+        return this.randomInt() / TOTAL_MASK;
+    }
+}
+exports.MT19937 = MT19937;
+_a = MT19937, _MT19937_mt = new WeakMap(), _MT19937_mti = new WeakMap();
+_MT19937_instance = { value: new _a() };
+/**
+ * Generates a pseudo-random number in the range `[0, 1)`. This function is not
+ * cryptographically secure, and should not be used for any security-sensitive
+ * applications. It was designed to be a drop-in replacement for the native
+ * `Math.random()` function, with support for seeding the generator.
+ *
+ * @returns A pseudo-random number in the range `[0, 1)`.
+ * @category Random
+ * @see {@linkcode random.init} for seeding the generator.
+ * @see {@linkcode MT19937} for the Mersenne-Twister implementation this uses.
+ */
+function random() {
+    return MT19937.random();
+}
+/**
+ * Initializes the random number generator with a seed or sequence of seeds.
+ *
+ * This is useful for testing, allowing you to generate a deterministic
+ * sequence of pseudo-random numbers based on the provided seed value.
+ *
+ * @param seed - The seed value or sequence of seed values.
+ * @returns The singleton instance of the random number generator.
+ */
+random.init = MT19937.init;
+//# sourceMappingURL=random.js.map

package/cjs/random.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"random.js","sourceRoot":"","sources":["../src/random.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;AAmOA,wBAEC;AArOD;;;;;;;;;;;;;;GAcG;AACH,8DAA+D;AAE/D,wBAAwB;AACxB,MAAM,CAAC,GAAG,GAAG,CAAC;AACd,iCAAiC;AACjC,MAAM,CAAC,GAAG,GAAG,CAAC;AACd,wBAAwB;AACxB,MAAM,QAAQ,GAAG,UAAU,CAAC;AAC5B,gCAAgC;AAChC,MAAM,UAAU,GAAG,UAAU,CAAC;AAC9B,+BAA+B;AAC/B,MAAM,UAAU,GAAG,UAAU,CAAC;AAC9B,kCAAkC;AAClC,MAAM,UAAU,GAAG,WAAW,CAAC;AAE/B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAa,OAAO;IAGlB;;;;;OAKG;IACH,MAAM,CAAC,IAAI,CAAC,GAAG,IAAc;QAC3B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,OAAO,uBAAA,EAAO,6BAAU,CAAC,aAAa,CAAC,GAAG,IAAI,CAAC,CAAC;QAClD,CAAC;aAAM,CAAC;YACN,OAAO,uBAAA,EAAO,6BAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,MAAM;QACX,OAAO,uBAAA,EAAO,6BAAU,CAAC,MAAM,EAAE,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,SAAS;QACd,OAAO,uBAAA,EAAO,6BAAU,CAAC,SAAS,EAAE,CAAC;IACvC,CAAC;IAQD;;;OAGG;IACH,YAAY,IAAa;QAVzB,qCAAqC;QACrC,sBAAM,IAAA,0BAAS,EAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAC;QAExC,kDAAkD;QAClD,uBAAO,CAAC,GAAG,CAAC,EAAC;QAOX,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClB,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,IAAa;QAChB,IAAI,KAAJ,IAAI,GAAK,IAAA,wBAAO,GAAE,EAAC;QACnB,uBAAA,IAAI,mBAAI,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC;QACzB,MAAM,EAAE,GAAG,uBAAA,IAAI,mBAAI,CAAC;QACpB,MAAM,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,UAAU,CAAC;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YACzC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACtB,EAAE,CAAC,uBAAA,IAAI,gBAAQ,CAAC,MAAA,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACxC,CAAC;QACD,uBAAA,IAAI,gBAAQ,CAAC,MAAA,CAAC;QACd,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,GAAG,KAAe;QAC9B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QACjB,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpB,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAC1B,MAAM,CAAC,GAAG,UAAU,CAAC;QACrB,MAAM,CAAC,GAAG,OAAO,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,UAAU,CAAC;QAClD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAClB,MAAM,CAAC,GAAG,uBAAA,IAAI,mBAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,uBAAA,IAAI,mBAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YACrD,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACtB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACnC,uBAAA,IAAI,mBAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,uBAAA,IAAI,mBAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACpE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YACT,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACX,uBAAA,IAAI,mBAAI,CAAC,CAAC,CAAC,GAAG,uBAAA,IAAI,mBAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC9B,CAAC,GAAG,CAAC,CAAC;YACR,CAAC;YACD,IAAI,CAAC,IAAI,GAAG;gBAAE,CAAC,GAAG,CAAC,CAAC;QACtB,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,uBAAA,IAAI,mBAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,uBAAA,IAAI,mBAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YACrD,IAAI,CAAC,GAAG,uBAAA,IAAI,mBAAI,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAChD,uBAAA,IAAI,mBAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YAC5B,CAAC,EAAE,CAAC;YACJ,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACX,uBAAA,IAAI,mBAAI,CAAC,CAAC,CAAC,GAAG,uBAAA,IAAI,mBAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC9B,CAAC,GAAG,CAAC,CAAC;YACR,CAAC;QACH,CAAC;QACD,+CAA+C;QAC/C,uBAAA,IAAI,mBAAI,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,SAAS;;QACP,IAAI,CAAS,CAAC;QACd,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QAE9B,IAAI,uBAAA,IAAI,oBAAK,IAAI,CAAC,EAAE,CAAC;YACnB,IAAI,EAAU,CAAC;YAEf,oCAAoC;YACpC,IAAI,uBAAA,IAAI,oBAAK,KAAK,CAAC,GAAG,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAEzC,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;gBAC9B,CAAC,GAAG,CAAC,uBAAA,IAAI,mBAAI,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,uBAAA,IAAI,mBAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;gBAClE,uBAAA,IAAI,mBAAI,CAAC,EAAE,CAAC,GAAG,uBAAA,IAAI,mBAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;YAC/D,CAAC;YAED,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;gBACxB,CAAC,GAAG,CAAC,uBAAA,IAAI,mBAAI,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,uBAAA,IAAI,mBAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;gBAClE,uBAAA,IAAI,mBAAI,CAAC,EAAE,CAAC,GAAG,uBAAA,IAAI,mBAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;YACrE,CAAC;YAED,CAAC,GAAG,CAAC,uBAAA,IAAI,mBAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,uBAAA,IAAI,mBAAI,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;YAChE,uBAAA,IAAI,mBAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,uBAAA,IAAI,mBAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;YAC/D,uBAAA,IAAI,gBAAQ,CAAC,MAAA,CAAC;QAChB,CAAC;QAED,CAAC,GAAG,uBAAA,IAAI,mBAAI,CAAC,2CAAA,CAAA,oDAAS,EAAT,KAAA,IAAW,IAAA,CAAA,MAAA,IAAA,CAAC,CAAC;QAE1B,YAAY;QACZ,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QACd,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC;QAC3B,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,UAAU,CAAC;QAC5B,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QAEd,OAAO,CAAC,KAAK,CAAC,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,MAAM;QACJ,OAAO,IAAI,CAAC,SAAS,EAAE,GAAG,UAAU,CAAC;IACvC,CAAC;;AAvJH,0BAwJC;;AAvJiB,6BAAY,IAAI,EAAO,EAAE,EAAhB,CAAiB;AAyJ5C;;;;;;;;;;GAUG;AACH,SAAgB,MAAM;IACpB,OAAO,OAAO,CAAC,MAAM,EAAE,CAAC;AAC1B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC"}

package/cjs/round.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Rounds a number to the nearest whole number.
+ *
+ * @param x The number to round to the nearest whole number
+ * @returns The nearest whole number to the provided number.
+ * @category Rounding
+ */
+export declare function round(x: number): number;
+//# sourceMappingURL=round.d.ts.map

package/cjs/round.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"round.d.ts","sourceRoot":"","sources":["../src/round.ts"],"names":[],"mappings":"AAOA;;;;;;GAMG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAKvC"}

package/cjs/round.js

@@ -0,0 +1,24 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.round = round;
+/**
+ * Rounds a number to the nearest whole number.
+ *
+ * @module round
+ */
+const floor_js_1 = require("./floor.js");
+/**
+ * Rounds a number to the nearest whole number.
+ *
+ * @param x The number to round to the nearest whole number
+ * @returns The nearest whole number to the provided number.
+ * @category Rounding
+ */
+function round(x) {
+    x = +x;
+    if (x !== x || x === 0)
+        return x;
+    const rounded = (0, floor_js_1.floor)(x + 0.5);
+    return rounded === 0 && x < 0 ? -0 : rounded;
+}
+//# sourceMappingURL=round.js.map

package/cjs/round.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"round.js","sourceRoot":"","sources":["../src/round.ts"],"names":[],"mappings":";;AAcA,sBAKC;AAnBD;;;;GAIG;AACH,yCAAmC;AAEnC;;;;;;GAMG;AACH,SAAgB,KAAK,CAAC,CAAS;IAC7B,CAAC,GAAG,CAAC,CAAC,CAAC;IACP,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACjC,MAAM,OAAO,GAAG,IAAA,gBAAK,EAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IAC/B,OAAO,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;AAC/C,CAAC"}

package/cjs/sign.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Returns the sign of a number, indicating whether the number is positive,
+ * negative, or zero.
+ *
+ * @module sign
+ */
+/**
+ * Returns the sign of a number, indicating whether the number is positive,
+ * negative, or zero. This preserves the sign of `-0`, and returns `NaN` as-is.
+ *
+ * @param x The number to return the sign of
+ * @returns `1` if `x` is positive, `-1` if it is negative, and `0` if it is
+ * zero. This preserves the sign of `-0`, and returns `NaN` as-is.
+ * @category Arithmetic
+ */
+export declare function sign(x: number): number;
+//# sourceMappingURL=sign.d.ts.map

package/cjs/sign.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sign.d.ts","sourceRoot":"","sources":["../src/sign.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;;;;;;GAQG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAEtC"}

package/cjs/sign.js

@@ -0,0 +1,22 @@
+"use strict";
+/**
+ * Returns the sign of a number, indicating whether the number is positive,
+ * negative, or zero.
+ *
+ * @module sign
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sign = sign;
+/**
+ * Returns the sign of a number, indicating whether the number is positive,
+ * negative, or zero. This preserves the sign of `-0`, and returns `NaN` as-is.
+ *
+ * @param x The number to return the sign of
+ * @returns `1` if `x` is positive, `-1` if it is negative, and `0` if it is
+ * zero. This preserves the sign of `-0`, and returns `NaN` as-is.
+ * @category Arithmetic
+ */
+function sign(x) {
+    return x < 0 ? -1 : x > 0 ? 1 : x;
+}
+//# sourceMappingURL=sign.js.map