@lakuna/umath 1.3.9 → 1.4.0

package/README.md

@@ -41,4 +41,4 @@ const b = [4, 5, 6, 7];
 const c = multiply(a, b, [0, 0, 0, 0]);
 ```
 
-You can compare the performance of the raw functions versus the convenience classes on jsPerf.app [here](https://jsperf.app/qubahu/2).
+The majority of the algorithms used in the linear algebra API are adapted from [glMatrix](https://github.com/toji/gl-matrix/).

package/dist/algorithms/approx.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Determine whether or not two numbers are approximately equivalent (no greater than `epsilon` apart).
+ * @param a - The first number.
+ * @param b - The second number.
+ * @returns Whether or not the two numbers are approximately equivalent.
+ * @public
+ */
+export default function approx(a: number, b: number): boolean;
+//# sourceMappingURL=approx.d.ts.map

package/dist/algorithms/approx.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"approx.d.ts","sourceRoot":"","sources":["../../src/algorithms/approx.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAE5D"}

package/dist/algorithms/approx.js

@@ -0,0 +1,12 @@
+import epsilon from "../utility/epsilon.js";
+/**
+ * Determine whether or not two numbers are approximately equivalent (no greater than `epsilon` apart).
+ * @param a - The first number.
+ * @param b - The second number.
+ * @returns Whether or not the two numbers are approximately equivalent.
+ * @public
+ */
+export default function approx(a, b) {
+    return Math.abs(a - b) <= epsilon;
+}
+//# sourceMappingURL=approx.js.map

package/dist/algorithms/approx.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"approx.js","sourceRoot":"","sources":["../../src/algorithms/approx.ts"],"names":[],"mappings":"AAAA,OAAO,OAAO,MAAM,uBAAuB,CAAC;AAE5C;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,MAAM,CAAC,CAAS,EAAE,CAAS;IAClD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,OAAO,CAAC;AACnC,CAAC"}

package/dist/algorithms/approxRelative.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Determine whether or not two numbers are approximately equivalent relative to the size of the numbers (no greater than `epsilon * Math.max(1, Math.abs(a), Math.abs(b))` apart).
+ * @param a - The first number.
+ * @param b - The second number.
+ * @returns Whether or not the two numbers are approximately equivalent.
+ * @public
+ */
+export default function approxRelative(a: number, b: number): boolean;
+//# sourceMappingURL=approxRelative.d.ts.map

package/dist/algorithms/approxRelative.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"approxRelative.d.ts","sourceRoot":"","sources":["../../src/algorithms/approxRelative.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAEpE"}

package/dist/algorithms/approxRelative.js

@@ -0,0 +1,12 @@
+import epsilon from "../utility/epsilon.js";
+/**
+ * Determine whether or not two numbers are approximately equivalent relative to the size of the numbers (no greater than `epsilon * Math.max(1, Math.abs(a), Math.abs(b))` apart).
+ * @param a - The first number.
+ * @param b - The second number.
+ * @returns Whether or not the two numbers are approximately equivalent.
+ * @public
+ */
+export default function approxRelative(a, b) {
+    return Math.abs(a - b) <= epsilon * Math.max(1, Math.abs(a), Math.abs(b));
+}
+//# sourceMappingURL=approxRelative.js.map

package/dist/algorithms/approxRelative.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"approxRelative.js","sourceRoot":"","sources":["../../src/algorithms/approxRelative.ts"],"names":[],"mappings":"AAAA,OAAO,OAAO,MAAM,uBAAuB,CAAC;AAE5C;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,cAAc,CAAC,CAAS,EAAE,CAAS;IAC1D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3E,CAAC"}

package/dist/algorithms/combinations.d.ts

@@ -3,7 +3,8 @@
  * @param n - The total number of units.
  * @param r - The number of units taken at a time.
  * @returns The number of combinations.
- * @see [Combination](https://en.wikipedia.org/wiki/Combination)
+ * @see {@link https://en.wikipedia.org/wiki/Combination | Combination}
+ * @public
  */
 export default function combinations(n: number, r: number): number;
 //# sourceMappingURL=combinations.d.ts.map

package/dist/algorithms/combinations.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"combinations.d.ts","sourceRoot":"","sources":["../../src/algorithms/combinations.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAEjE"}
+{"version":3,"file":"combinations.d.ts","sourceRoot":"","sources":["../../src/algorithms/combinations.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,MAAM,CAAC,OAAO,UAAU,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAEjE"}

package/dist/algorithms/combinations.js

@@ -4,7 +4,8 @@ import factorial from "./factorial.js";
  * @param n - The total number of units.
  * @param r - The number of units taken at a time.
  * @returns The number of combinations.
- * @see [Combination](https://en.wikipedia.org/wiki/Combination)
+ * @see {@link https://en.wikipedia.org/wiki/Combination | Combination}
+ * @public
  */
 export default function combinations(n, r) {
     return factorial(n) / (factorial(r) * factorial(n - r));

package/dist/algorithms/combinations.js.map

@@ -1 +1 @@
-{"version":3,"file":"combinations.js","sourceRoot":"","sources":["../../src/algorithms/combinations.ts"],"names":[],"mappings":"AAAA,OAAO,SAAS,MAAM,gBAAgB,CAAC;AAEvC;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,YAAY,CAAC,CAAS,EAAE,CAAS;IACxD,OAAO,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACzD,CAAC"}
+{"version":3,"file":"combinations.js","sourceRoot":"","sources":["../../src/algorithms/combinations.ts"],"names":[],"mappings":"AAAA,OAAO,SAAS,MAAM,gBAAgB,CAAC;AAEvC;;;;;;;GAOG;AACH,MAAM,CAAC,OAAO,UAAU,YAAY,CAAC,CAAS,EAAE,CAAS;IACxD,OAAO,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACzD,CAAC"}

package/dist/algorithms/degreesToRadians.d.ts

@@ -2,8 +2,9 @@
  * Convert a number of degrees to an equivalent number of radians.
  * @param degrees - The number of degrees.
  * @returns A number of radians.
- * @see [Degree](https://en.wikipedia.org/wiki/Degree_(angle))
- * @see [Radian](https://en.wikipedia.org/wiki/Radian)
+ * @see {@link https://en.wikipedia.org/wiki/Degree_(angle) | Degree}
+ * @see {@link https://en.wikipedia.org/wiki/Radian | Radian}
+ * @public
  */
 export default function degreesToRadians(degrees: number): number;
 //# sourceMappingURL=degreesToRadians.d.ts.map

package/dist/algorithms/degreesToRadians.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"degreesToRadians.d.ts","sourceRoot":"","sources":["../../src/algorithms/degreesToRadians.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAEhE"}
+{"version":3,"file":"degreesToRadians.d.ts","sourceRoot":"","sources":["../../src/algorithms/degreesToRadians.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,MAAM,CAAC,OAAO,UAAU,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAEhE"}

package/dist/algorithms/degreesToRadians.js

@@ -1,11 +1,13 @@
+const ratio = Math.PI / 180;
 /**
  * Convert a number of degrees to an equivalent number of radians.
  * @param degrees - The number of degrees.
  * @returns A number of radians.
- * @see [Degree](https://en.wikipedia.org/wiki/Degree_(angle))
- * @see [Radian](https://en.wikipedia.org/wiki/Radian)
+ * @see {@link https://en.wikipedia.org/wiki/Degree_(angle) | Degree}
+ * @see {@link https://en.wikipedia.org/wiki/Radian | Radian}
+ * @public
  */
 export default function degreesToRadians(degrees) {
-    return (degrees * Math.PI) / 180;
+    return degrees * ratio;
 }
 //# sourceMappingURL=degreesToRadians.js.map

package/dist/algorithms/degreesToRadians.js.map

@@ -1 +1 @@
-{"version":3,"file":"degreesToRadians.js","sourceRoot":"","sources":["../../src/algorithms/degreesToRadians.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,gBAAgB,CAAC,OAAe;IACvD,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;AAClC,CAAC"}
+{"version":3,"file":"degreesToRadians.js","sourceRoot":"","sources":["../../src/algorithms/degreesToRadians.ts"],"names":[],"mappings":"AAAA,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC;AAE5B;;;;;;;GAOG;AACH,MAAM,CAAC,OAAO,UAAU,gBAAgB,CAAC,OAAe;IACvD,OAAO,OAAO,GAAG,KAAK,CAAC;AACxB,CAAC"}

package/dist/algorithms/factorial.d.ts

@@ -2,7 +2,8 @@
  * Calculate the factorial of a number.
  * @param n - The number.
  * @returns The factorial.
- * @see [Factorial](https://en.wikipedia.org/wiki/Factorial)
+ * @see {@link https://en.wikipedia.org/wiki/Factorial | Factorial}
+ * @public
  */
 export default function factorial(n: number): number;
 //# sourceMappingURL=factorial.d.ts.map

package/dist/algorithms/factorial.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"factorial.d.ts","sourceRoot":"","sources":["../../src/algorithms/factorial.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,CAAC,OAAO,UAAU,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAWnD"}
+{"version":3,"file":"factorial.d.ts","sourceRoot":"","sources":["../../src/algorithms/factorial.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAYnD"}

package/dist/algorithms/factorial.js

@@ -2,7 +2,8 @@
  * Calculate the factorial of a number.
  * @param n - The number.
  * @returns The factorial.
- * @see [Factorial](https://en.wikipedia.org/wiki/Factorial)
+ * @see {@link https://en.wikipedia.org/wiki/Factorial | Factorial}
+ * @public
  */
 export default function factorial(n) {
     if (n < 0) {

package/dist/algorithms/factorial.js.map

@@ -1 +1 @@
-{"version":3,"file":"factorial.js","sourceRoot":"","sources":["../../src/algorithms/factorial.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,CAAC,OAAO,UAAU,SAAS,CAAC,CAAS;IAC1C,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACX,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,qDAAqD;IAC3F,CAAC;IAED,yEAAyE;IACzE,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,GAAG,IAAI,CAAC,CAAC;IACV,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC"}
+{"version":3,"file":"factorial.js","sourceRoot":"","sources":["../../src/algorithms/factorial.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,SAAS,CAAC,CAAS;IAC1C,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACX,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,qDAAqD;IAC3F,CAAC;IAED,yEAAyE;IACzE,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,GAAG,IAAI,CAAC,CAAC;IACV,CAAC;IAED,OAAO,GAAG,CAAC;AACZ,CAAC"}

package/dist/algorithms/fibonacci.d.ts

@@ -1,7 +1,8 @@
 /**
  * Calculate numbers in the Fibonacci sequence.
  * @returns The next value in the Fibonacci sequence.
- * @see [Fibonacci sequence](https://en.wikipedia.org/wiki/Fibonacci_sequence)
+ * @see {@link https://en.wikipedia.org/wiki/Fibonacci_sequence | Fibonacci sequence}
+ * @public
  */
 export default function fibonacci(): Generator<number, void>;
 //# sourceMappingURL=fibonacci.d.ts.map

package/dist/algorithms/fibonacci.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fibonacci.d.ts","sourceRoot":"","sources":["../../src/algorithms/fibonacci.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,CAAC,OAAO,UAAW,SAAS,IAAI,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAQ5D"}
+{"version":3,"file":"fibonacci.d.ts","sourceRoot":"","sources":["../../src/algorithms/fibonacci.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,CAAC,OAAO,UAAW,SAAS,IAAI,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAY5D"}

package/dist/algorithms/fibonacci.js

@@ -1,14 +1,18 @@
 /**
  * Calculate numbers in the Fibonacci sequence.
  * @returns The next value in the Fibonacci sequence.
- * @see [Fibonacci sequence](https://en.wikipedia.org/wiki/Fibonacci_sequence)
+ * @see {@link https://en.wikipedia.org/wiki/Fibonacci_sequence | Fibonacci sequence}
+ * @public
  */
 export default function* fibonacci() {
     let a = 0;
     let b = 1;
     while (a >= 0) {
         yield a;
-        [a, b] = [b, a + b];
+        // `[a, b] = [b, a + b];`
+        const temp = a;
+        a = b;
+        b += temp;
     }
 }
 //# sourceMappingURL=fibonacci.js.map

package/dist/algorithms/fibonacci.js.map

@@ -1 +1 @@
-{"version":3,"file":"fibonacci.js","sourceRoot":"","sources":["../../src/algorithms/fibonacci.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,CAAC,OAAO,SAAS,CAAC,CAAC,SAAS;IACjC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACf,MAAM,CAAC,CAAC;QACR,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACrB,CAAC;AACF,CAAC"}
+{"version":3,"file":"fibonacci.js","sourceRoot":"","sources":["../../src/algorithms/fibonacci.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,CAAC,OAAO,SAAS,CAAC,CAAC,SAAS;IACjC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACf,MAAM,CAAC,CAAC;QAER,yBAAyB;QACzB,MAAM,IAAI,GAAG,CAAC,CAAC;QACf,CAAC,GAAG,CAAC,CAAC;QACN,CAAC,IAAI,IAAI,CAAC;IACX,CAAC;AACF,CAAC"}

package/dist/algorithms/greatestCommonDivisor.d.ts

@@ -3,7 +3,8 @@
  * @param a - The first integer.
  * @param b - The second integer.
  * @returns The greatest common divisor.
- * @see [Greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor)
+ * @see {@link https://en.wikipedia.org/wiki/Greatest_common_divisor | Greatest common divisor}
+ * @public
  */
 export default function greatestCommonDivisor(a: bigint, b: bigint): bigint;
 /**
@@ -11,7 +12,8 @@ export default function greatestCommonDivisor(a: bigint, b: bigint): bigint;
  * @param a - The first integer.
  * @param b - The second integer.
  * @returns The greatest common divisor.
- * @see [Greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor)
+ * @see {@link https://en.wikipedia.org/wiki/Greatest_common_divisor | Greatest common divisor}
+ * @public
  */
 export default function greatestCommonDivisor(a: number, b: number): number;
 //# sourceMappingURL=greatestCommonDivisor.d.ts.map

package/dist/algorithms/greatestCommonDivisor.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"greatestCommonDivisor.d.ts","sourceRoot":"","sources":["../../src/algorithms/greatestCommonDivisor.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,qBAAqB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;AAE5E;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,qBAAqB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC"}
+{"version":3,"file":"greatestCommonDivisor.d.ts","sourceRoot":"","sources":["../../src/algorithms/greatestCommonDivisor.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,CAAC,OAAO,UAAU,qBAAqB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;AAE5E;;;;;;;GAOG;AACH,MAAM,CAAC,OAAO,UAAU,qBAAqB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC"}

package/dist/algorithms/greatestCommonDivisor.js

@@ -1,10 +1,13 @@
 export default function greatestCommonDivisor(a, b) {
-    // Ensure that both of the integers are positive.
+    // Ensure that both of the integers are positive. Can't use `Math.abs` in case `a` and `b` are `bigint`s.
     let c = a < 0 ? -a : a;
     let d = b < 0 ? -b : b;
     // Apply the Euclidean algorithm.
     while (d) {
-        [c, d] = [d, c % d];
+        // `[c, d] = [d, (c as number) % (d as number)];`
+        const temp = c;
+        c = d;
+        d = temp % d;
     }
     return c;
 }

package/dist/algorithms/greatestCommonDivisor.js.map

@@ -1 +1 @@
-{"version":3,"file":"greatestCommonDivisor.js","sourceRoot":"","sources":["../../src/algorithms/greatestCommonDivisor.ts"],"names":[],"mappings":"AAkBA,MAAM,CAAC,OAAO,UAAU,qBAAqB,CAC5C,CAAkB,EAClB,CAAkB;IAElB,iDAAiD;IACjD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvB,iCAAiC;IACjC,OAAO,CAAC,EAAE,CAAC;QACV,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAG,CAAY,GAAI,CAAY,CAAC,CAAC;IAC7C,CAAC;IAED,OAAO,CAAC,CAAC;AACV,CAAC"}
+{"version":3,"file":"greatestCommonDivisor.js","sourceRoot":"","sources":["../../src/algorithms/greatestCommonDivisor.ts"],"names":[],"mappings":"AAoBA,MAAM,CAAC,OAAO,UAAU,qBAAqB,CAC5C,CAAkB,EAClB,CAAkB;IAElB,yGAAyG;IACzG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvB,iCAAiC;IACjC,OAAO,CAAC,EAAE,CAAC;QACV,iDAAiD;QACjD,MAAM,IAAI,GAAG,CAAC,CAAC;QACf,CAAC,GAAG,CAAC,CAAC;QACN,CAAC,GAAI,IAAe,GAAI,CAAY,CAAC;IACtC,CAAC;IAED,OAAO,CAAC,CAAC;AACV,CAAC"}

package/dist/algorithms/hypergeometricPmf.d.ts

@@ -4,8 +4,9 @@
  * @param K - The number of objects with the desired feature in the finite population.
  * @param n - The number of draws without replacement.
  * @param k - The desired number of successes.
- * @see [Hypergeometric distribution](https://en.wikipedia.org/wiki/Hypergeometric_distribution)
- * @see [Probability mass function](https://en.wikipedia.org/wiki/Probability_mass_function)
+ * @see {@link https://en.wikipedia.org/wiki/Hypergeometric_distribution | Hypergeometric distribution}
+ * @see {@link https://en.wikipedia.org/wiki/Probability_mass_function | Probability mass function}
+ * @public
  */
 export default function hypergeometricPmf(N: number, K: number, n: number, k: number): number;
 //# sourceMappingURL=hypergeometricPmf.d.ts.map

package/dist/algorithms/hypergeometricPmf.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"hypergeometricPmf.d.ts","sourceRoot":"","sources":["../../src/algorithms/hypergeometricPmf.ts"],"names":[],"mappings":"AAEA;;;;;;;;GAQG;AACH,MAAM,CAAC,OAAO,UAAU,iBAAiB,CACxC,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,GACP,MAAM,CAER"}
+{"version":3,"file":"hypergeometricPmf.d.ts","sourceRoot":"","sources":["../../src/algorithms/hypergeometricPmf.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AACH,MAAM,CAAC,OAAO,UAAU,iBAAiB,CACxC,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,GACP,MAAM,CAER"}

package/dist/algorithms/hypergeometricPmf.js

@@ -5,8 +5,9 @@ import combinations from "./combinations.js";
  * @param K - The number of objects with the desired feature in the finite population.
  * @param n - The number of draws without replacement.
  * @param k - The desired number of successes.
- * @see [Hypergeometric distribution](https://en.wikipedia.org/wiki/Hypergeometric_distribution)
- * @see [Probability mass function](https://en.wikipedia.org/wiki/Probability_mass_function)
+ * @see {@link https://en.wikipedia.org/wiki/Hypergeometric_distribution | Hypergeometric distribution}
+ * @see {@link https://en.wikipedia.org/wiki/Probability_mass_function | Probability mass function}
+ * @public
  */
 export default function hypergeometricPmf(N, K, n, k) {
     return (combinations(K, k) * combinations(N - K, n - k)) / combinations(N, n);

package/dist/algorithms/hypergeometricPmf.js.map

@@ -1 +1 @@
-{"version":3,"file":"hypergeometricPmf.js","sourceRoot":"","sources":["../../src/algorithms/hypergeometricPmf.ts"],"names":[],"mappings":"AAAA,OAAO,YAAY,MAAM,mBAAmB,CAAC;AAE7C;;;;;;;;GAQG;AACH,MAAM,CAAC,OAAO,UAAU,iBAAiB,CACxC,CAAS,EACT,CAAS,EACT,CAAS,EACT,CAAS;IAET,OAAO,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC/E,CAAC"}
+{"version":3,"file":"hypergeometricPmf.js","sourceRoot":"","sources":["../../src/algorithms/hypergeometricPmf.ts"],"names":[],"mappings":"AAAA,OAAO,YAAY,MAAM,mBAAmB,CAAC;AAE7C;;;;;;;;;GASG;AACH,MAAM,CAAC,OAAO,UAAU,iBAAiB,CACxC,CAAS,EACT,CAAS,EACT,CAAS,EACT,CAAS;IAET,OAAO,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC/E,CAAC"}

package/dist/algorithms/isPrime.d.ts

@@ -2,7 +2,8 @@
  * Returns whether or not a number is prime.
  * @param n - The number.
  * @returns Whether or not the number is prime.
- * @see [Prime number](https://en.wikipedia.org/wiki/Prime_number)
+ * @see {@link https://en.wikipedia.org/wiki/Prime_number | Prime number}
+ * @public
  */
 export default function isPrime(n: number): boolean;
 //# sourceMappingURL=isPrime.d.ts.map

package/dist/algorithms/isPrime.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"isPrime.d.ts","sourceRoot":"","sources":["../../src/algorithms/isPrime.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,CAAC,OAAO,UAAU,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAalD"}
+{"version":3,"file":"isPrime.d.ts","sourceRoot":"","sources":["../../src/algorithms/isPrime.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAalD"}

package/dist/algorithms/isPrime.js

@@ -2,7 +2,8 @@
  * Returns whether or not a number is prime.
  * @param n - The number.
  * @returns Whether or not the number is prime.
- * @see [Prime number](https://en.wikipedia.org/wiki/Prime_number)
+ * @see {@link https://en.wikipedia.org/wiki/Prime_number | Prime number}
+ * @public
  */
 export default function isPrime(n) {
     // Negatives, zero, and one can't be prime.

package/dist/algorithms/isPrime.js.map

@@ -1 +1 @@
-{"version":3,"file":"isPrime.js","sourceRoot":"","sources":["../../src/algorithms/isPrime.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,CAAC,OAAO,UAAU,OAAO,CAAC,CAAS;IACxC,2CAA2C;IAC3C,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACX,OAAO,KAAK,CAAC;IACd,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACjB,OAAO,KAAK,CAAC;QACd,CAAC;IACF,CAAC;IAED,OAAO,IAAI,CAAC;AACb,CAAC"}
+{"version":3,"file":"isPrime.js","sourceRoot":"","sources":["../../src/algorithms/isPrime.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,OAAO,CAAC,CAAS;IACxC,2CAA2C;IAC3C,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACX,OAAO,KAAK,CAAC;IACd,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACjB,OAAO,KAAK,CAAC;QACd,CAAC;IACF,CAAC;IAED,OAAO,IAAI,CAAC;AACb,CAAC"}

package/dist/algorithms/permutations.d.ts

@@ -3,7 +3,8 @@
  * @param n - The total number of units.
  * @param r - The number of units taken at a time.
  * @returns The number of permutations.
- * @see [Permutation](https://en.wikipedia.org/wiki/Permutation)
+ * @see {@link https://en.wikipedia.org/wiki/Permutation | Permutation}
+ * @public
  */
 export default function permutations(n: number, r: number): number;
 //# sourceMappingURL=permutations.d.ts.map

package/dist/algorithms/permutations.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"permutations.d.ts","sourceRoot":"","sources":["../../src/algorithms/permutations.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAEjE"}
+{"version":3,"file":"permutations.d.ts","sourceRoot":"","sources":["../../src/algorithms/permutations.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,MAAM,CAAC,OAAO,UAAU,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAEjE"}

package/dist/algorithms/permutations.js

@@ -4,7 +4,8 @@ import factorial from "./factorial.js";
  * @param n - The total number of units.
  * @param r - The number of units taken at a time.
  * @returns The number of permutations.
- * @see [Permutation](https://en.wikipedia.org/wiki/Permutation)
+ * @see {@link https://en.wikipedia.org/wiki/Permutation | Permutation}
+ * @public
  */
 export default function permutations(n, r) {
     return factorial(n) / factorial(n - r);

package/dist/algorithms/permutations.js.map

@@ -1 +1 @@
-{"version":3,"file":"permutations.js","sourceRoot":"","sources":["../../src/algorithms/permutations.ts"],"names":[],"mappings":"AAAA,OAAO,SAAS,MAAM,gBAAgB,CAAC;AAEvC;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,YAAY,CAAC,CAAS,EAAE,CAAS;IACxD,OAAO,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACxC,CAAC"}
+{"version":3,"file":"permutations.js","sourceRoot":"","sources":["../../src/algorithms/permutations.ts"],"names":[],"mappings":"AAAA,OAAO,SAAS,MAAM,gBAAgB,CAAC;AAEvC;;;;;;;GAOG;AACH,MAAM,CAAC,OAAO,UAAU,YAAY,CAAC,CAAS,EAAE,CAAS;IACxD,OAAO,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACxC,CAAC"}

package/dist/algorithms/primeFactorization.d.ts

@@ -2,7 +2,8 @@
  * Factor a number into a list of prime numbers.
  * @param n - The number to factor.
  * @returns A list of prime number factors of the number.
- * @see [Integer factorization](https://en.wikipedia.org/wiki/Integer_factorization)
+ * @see {@link https://en.wikipedia.org/wiki/Integer_factorization | Integer factorization}
+ * @public
  */
 export default function primeFactorization(n: number): number[];
 //# sourceMappingURL=primeFactorization.d.ts.map

package/dist/algorithms/primeFactorization.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"primeFactorization.d.ts","sourceRoot":"","sources":["../../src/algorithms/primeFactorization.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,CAAC,OAAO,UAAU,kBAAkB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAe9D"}
+{"version":3,"file":"primeFactorization.d.ts","sourceRoot":"","sources":["../../src/algorithms/primeFactorization.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,kBAAkB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAe9D"}

package/dist/algorithms/primeFactorization.js

@@ -2,7 +2,8 @@
  * Factor a number into a list of prime numbers.
  * @param n - The number to factor.
  * @returns A list of prime number factors of the number.
- * @see [Integer factorization](https://en.wikipedia.org/wiki/Integer_factorization)
+ * @see {@link https://en.wikipedia.org/wiki/Integer_factorization | Integer factorization}
+ * @public
  */
 export default function primeFactorization(n) {
     let m = n;

package/dist/algorithms/primeFactorization.js.map

@@ -1 +1 @@
-{"version":3,"file":"primeFactorization.js","sourceRoot":"","sources":["../../src/algorithms/primeFactorization.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,CAAC,OAAO,UAAU,kBAAkB,CAAC,CAAS;IACnD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,MAAM,GAAG,GAAG,EAAE,CAAC;IACf,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACf,IAAI,CAAC,GAAG,OAAO,KAAK,CAAC,EAAE,CAAC;YACvB,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAClB,CAAC,IAAI,OAAO,CAAC;YACb,SAAS;QACV,CAAC;QAED,OAAO,EAAE,CAAC;IACX,CAAC;IAED,OAAO,GAAG,CAAC;AACZ,CAAC"}
+{"version":3,"file":"primeFactorization.js","sourceRoot":"","sources":["../../src/algorithms/primeFactorization.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,kBAAkB,CAAC,CAAS;IACnD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,MAAM,GAAG,GAAG,EAAE,CAAC;IACf,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACf,IAAI,CAAC,GAAG,OAAO,KAAK,CAAC,EAAE,CAAC;YACvB,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAClB,CAAC,IAAI,OAAO,CAAC;YACb,SAAS;QACV,CAAC;QAED,OAAO,EAAE,CAAC;IACX,CAAC;IAED,OAAO,GAAG,CAAC;AACZ,CAAC"}

package/dist/algorithms/radiansToDegrees.d.ts

@@ -2,8 +2,9 @@
  * Convert a number of radians to an equivalent number of degrees.
  * @param radians - The number of radians.
  * @returns A number of degrees.
- * @see [Degree](https://en.wikipedia.org/wiki/Degree_(angle))
- * @see [Radian](https://en.wikipedia.org/wiki/Radian)
+ * @see {@link https://en.wikipedia.org/wiki/Degree_(angle) | Degree}
+ * @see {@link https://en.wikipedia.org/wiki/Radian | Radian}
+ * @public
  */
 export default function radiansToDegrees(radians: number): number;
 //# sourceMappingURL=radiansToDegrees.d.ts.map

package/dist/algorithms/radiansToDegrees.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"radiansToDegrees.d.ts","sourceRoot":"","sources":["../../src/algorithms/radiansToDegrees.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAEhE"}
+{"version":3,"file":"radiansToDegrees.d.ts","sourceRoot":"","sources":["../../src/algorithms/radiansToDegrees.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,MAAM,CAAC,OAAO,UAAU,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAEhE"}

package/dist/algorithms/radiansToDegrees.js

@@ -1,11 +1,13 @@
+const ratio = 180 / Math.PI;
 /**
  * Convert a number of radians to an equivalent number of degrees.
  * @param radians - The number of radians.
  * @returns A number of degrees.
- * @see [Degree](https://en.wikipedia.org/wiki/Degree_(angle))
- * @see [Radian](https://en.wikipedia.org/wiki/Radian)
+ * @see {@link https://en.wikipedia.org/wiki/Degree_(angle) | Degree}
+ * @see {@link https://en.wikipedia.org/wiki/Radian | Radian}
+ * @public
  */
 export default function radiansToDegrees(radians) {
-    return (radians * 180) / Math.PI;
+    return radians * ratio;
 }
 //# sourceMappingURL=radiansToDegrees.js.map

package/dist/algorithms/radiansToDegrees.js.map

@@ -1 +1 @@
-{"version":3,"file":"radiansToDegrees.js","sourceRoot":"","sources":["../../src/algorithms/radiansToDegrees.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,gBAAgB,CAAC,OAAe;IACvD,OAAO,CAAC,OAAO,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;AAClC,CAAC"}
+{"version":3,"file":"radiansToDegrees.js","sourceRoot":"","sources":["../../src/algorithms/radiansToDegrees.ts"],"names":[],"mappings":"AAAA,MAAM,KAAK,GAAG,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC;AAE5B;;;;;;;GAOG;AACH,MAAM,CAAC,OAAO,UAAU,gBAAgB,CAAC,OAAe;IACvD,OAAO,OAAO,GAAG,KAAK,CAAC;AACxB,CAAC"}

package/dist/algorithms/summation.d.ts

@@ -4,7 +4,8 @@
  * @param max - The upper bound (inclusive) of the index of summation.
  * @param term - The function used to generate each term.
  * @returns The sum.
- * @see [Summation](https://en.wikipedia.org/wiki/Summation)
+ * @see {@link https://en.wikipedia.org/wiki/Summation | Summation}
+ * @public
  */
 export default function summation(min: number, max: number, term: (i: number) => number): number;
 //# sourceMappingURL=summation.d.ts.map

package/dist/algorithms/summation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"summation.d.ts","sourceRoot":"","sources":["../../src/algorithms/summation.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,CAAC,OAAO,UAAU,SAAS,CAChC,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,GACzB,MAAM,CAQR"}
+{"version":3,"file":"summation.d.ts","sourceRoot":"","sources":["../../src/algorithms/summation.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,CAAC,OAAO,UAAU,SAAS,CAChC,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,GACzB,MAAM,CAQR"}

package/dist/algorithms/summation.js

@@ -4,7 +4,8 @@
  * @param max - The upper bound (inclusive) of the index of summation.
  * @param term - The function used to generate each term.
  * @returns The sum.
- * @see [Summation](https://en.wikipedia.org/wiki/Summation)
+ * @see {@link https://en.wikipedia.org/wiki/Summation | Summation}
+ * @public
  */
 export default function summation(min, max, term) {
     // Not recursive in order to avoid exceeding the maximum call stack size.

package/dist/algorithms/summation.js.map

@@ -1 +1 @@
-{"version":3,"file":"summation.js","sourceRoot":"","sources":["../../src/algorithms/summation.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,CAAC,OAAO,UAAU,SAAS,CAChC,GAAW,EACX,GAAW,EACX,IAA2B;IAE3B,yEAAyE;IACzE,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IAED,OAAO,GAAG,CAAC;AACZ,CAAC"}
+{"version":3,"file":"summation.js","sourceRoot":"","sources":["../../src/algorithms/summation.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,CAAC,OAAO,UAAU,SAAS,CAChC,GAAW,EACX,GAAW,EACX,IAA2B;IAE3B,yEAAyE;IACzE,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IAED,OAAO,GAAG,CAAC;AACZ,CAAC"}