@thi.ng/math 5.14.0 → 5.15.0

package/README.md

@@ -7,7 +7,7 @@
 [![Mastodon Follow](https://img.shields.io/mastodon/follow/109331703950160316?domain=https%3A%2F%2Fmastodon.thi.ng&style=social)](https://mastodon.thi.ng/@toxi)
 
 > [!NOTE]
-> This is one of 211 standalone projects, maintained as part
+> This is one of 212 standalone projects, maintained as part
 > of the [@thi.ng/umbrella](https://github.com/thi-ng/umbrella/) monorepo
 > and anti-framework.
 >
@@ -77,7 +77,7 @@ For Node.js REPL:
 const math = await import("@thi.ng/math");
 ```
 
-Package sizes (brotli'd, pre-treeshake): ESM: 5.29 KB
+Package sizes (brotli'd, pre-treeshake): ESM: 5.48 KB
 
 ## Dependencies
 

package/fraction.d.ts

@@ -0,0 +1,58 @@
+import type { FnN2 } from "@thi.ng/api";
+/**
+ * Iteratively computes Greatest Common Divisor of given `a` and `b`.
+ *
+ * @remarks
+ * Reference:
+ *
+ * - https://en.wikipedia.org/wiki/Greatest_common_divisor
+ *
+ * @param a
+ * @param b
+ */
+export declare const gcd: FnN2;
+/**
+ * Computes Least Common Multiple for given `a` and `b`. Returns zero if either
+ * input is zero.
+ *
+ * @remarks
+ * Reference:
+ *
+ * - https://en.wikipedia.org/wiki/Least_common_multiple
+ *
+ * @param a
+ * @param b
+ */
+export declare const lcm: FnN2;
+/**
+ * Converts given `x` to a fraction with optional `maxDenom`inator, using
+ * continued fractions for best possible precision.
+ *
+ * @remarks
+ * Reference:
+ *
+ * - https://en.wikipedia.org/wiki/Continued_fraction
+ *
+ * @example
+ * ```ts tangle:../export/as-fraction.ts
+ * import { asFraction } from "@thi.ng/math";
+ *
+ * console.log(Math.PI, asFraction(Math.PI));
+ * // 3.141592653589793 [1146408, 364913]
+ *
+ * // keep denominator <= 1000
+ * console.log(Math.PI, asFraction(Math.PI, 1000));
+ * // 3.141592653589793 [ 355, 113 ]
+ * ```
+ *
+ * @param x
+ * @param maxDenom
+ */
+export declare const asFraction: (x: number, maxDenom?: number) => number[];
+/**
+ * Reverse op of {@link asFraction}. Converts a fraction tuple to a JS number.
+ *
+ * @param fraction
+ */
+export declare const asFloat: ([a, b]: [number, number]) => number;
+//# sourceMappingURL=fraction.d.ts.map

package/fraction.js

@@ -0,0 +1,46 @@
+const gcd = (a, b) => {
+  a = Math.abs(a);
+  b = Math.abs(b);
+  while (b !== 0) {
+    const tmp = b;
+    b = a % b;
+    a = tmp;
+  }
+  return a;
+};
+const lcm = (a, b) => {
+  if (!Number.isFinite(a) || !Number.isFinite(b))
+    throw new Error("both inputs must be finite");
+  return a && b ? Math.abs(a * b) / gcd(a, b) : 0;
+};
+const asFraction = (x, maxDenom = 1e6) => {
+  if (!Number.isFinite(x)) throw new Error("input must be a finite");
+  if (Number.isInteger(x)) return [x, 1];
+  const sign = Math.sign(x);
+  x = Math.abs(x);
+  let n0 = 0;
+  let n1 = 1;
+  let d0 = 1;
+  let d1 = 0;
+  while (true) {
+    const i = Math.floor(x);
+    const d2 = i * d1 + d0;
+    if (d2 > maxDenom) break;
+    const n2 = i * n1 + n0;
+    n0 = n1;
+    n1 = n2;
+    d0 = d1;
+    d1 = d2;
+    const rem = x - i;
+    if (rem < Number.EPSILON) break;
+    x = 1 / rem;
+  }
+  return [sign * n1, d1];
+};
+const asFloat = ([a, b]) => a / b;
+export {
+  asFloat,
+  asFraction,
+  gcd,
+  lcm
+};

package/index.d.ts

@@ -6,6 +6,7 @@ export * from "./eqdelta.js";
 export * from "./extrema.js";
 export * from "./easing.js";
 export * from "./fit.js";
+export * from "./fraction.js";
 export * from "./int.js";
 export * from "./interval.js";
 export * from "./libc.js";

package/index.js

@@ -6,6 +6,7 @@ export * from "./eqdelta.js";
 export * from "./extrema.js";
 export * from "./easing.js";
 export * from "./fit.js";
+export * from "./fraction.js";
 export * from "./int.js";
 export * from "./interval.js";
 export * from "./libc.js";

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "@thi.ng/math",
-	"version": "5.14.0",
+	"version": "5.15.0",
 	"description": "Assorted common math functions & utilities",
 	"type": "module",
 	"module": "./index.js",
@@ -42,7 +42,7 @@
 		"tool:tangle": "../../node_modules/.bin/tangle src/**/*.ts"
 	},
 	"dependencies": {
-		"@thi.ng/api": "^8.12.10"
+		"@thi.ng/api": "^8.12.11"
 	},
 	"devDependencies": {
 		"esbuild": "^0.27.0",
@@ -104,6 +104,9 @@
 		"./fit": {
 			"default": "./fit.js"
 		},
+		"./fraction": {
+			"default": "./fraction.js"
+		},
 		"./int": {
 			"default": "./int.js"
 		},
@@ -147,5 +150,5 @@
 	"thi.ng": {
 		"year": 2013
 	},
-	"gitHead": "824bf9047b5a10f777c5c5b4aeecf0c750a22c75\n"
+	"gitHead": "e7a21b9d2a188fa04d4c893d8531c40fbc0f4c06\n"
 }

package/regression.d.ts

@@ -1,43 +0,0 @@
-/**
- * Computes the coefficients of a polynomial regression for the given `samples`
- * (each a [x,y] tuple). The `degree` param defines the degree of the polynomial
- * and the number of returned coefficients (+1).
- *
- * @remarks
- * The resulting coeffs can be then used with {@link polynomial} to evaluate the
- * curve (i.e. used to make predictions).
- *
- * @param samples
- * @param degree
- */
-export declare const polynomialRegression: (samples: number[][], degree: number) => number[];
-/**
- * Computes polynomial for `x` and given `coeffs` (in order of increasing
- * exponents).
- *
- * @remarks
- * See {@link polynomialRegression} for computing coefficients.
- *
- * The number of given coefficients defines the degree (+1) of the polynomial,
- * i.e. a cubic function will require 4 coeffs, with the y-intercept being the
- * first coeff.
- *
- * @param x
- * @param coeffs
- */
-export declare const polynomial: (x: number, coeffs: number[]) => number;
-/**
- * Takes an augmented matrix (in column-major order) and uses Gaussian
- * elimination to compute solution coefficients for its system of linear
- * equations `Ax = b`.
- *
- * @remarks
- * References:
- * - https://en.wikipedia.org/wiki/Gaussian_elimination
- * - https://www.geeksforgeeks.org/dsa/gaussian-elimination/
- *
- * @param mat
- * @param degree
- */
-export declare const gaussianElimination: (mat: number[][], degree: number) => number[];
-//# sourceMappingURL=regression.d.ts.map

package/regression.js

@@ -1,51 +0,0 @@
-const polynomialRegression = (samples, degree) => {
-  const mat = [];
-  const aug = [];
-  for (let i = 0; i <= degree; i++) {
-    aug.push(samples.reduce((acc, x) => acc + x[0] ** i * x[1], 0));
-    const col = [];
-    for (let j = 0; j <= degree; j++) {
-      col.push(samples.reduce((acc, x) => acc + x[0] ** (i + j), 0));
-    }
-    mat.push(col);
-  }
-  mat.push(aug);
-  return gaussianElimination(mat, degree + 1);
-};
-const polynomial = (x, coeffs) => coeffs.reduce((sum, c, i) => sum + c * x ** i, 0);
-const gaussianElimination = (mat, degree) => {
-  const n = mat.length - 1;
-  const coeffs = [degree];
-  for (let i = 0; i < n; i++) {
-    let max = i;
-    const col = mat[i];
-    for (let j = i + 1; j < n; j++) {
-      if (Math.abs(col[j]) > Math.abs(col[max])) max = j;
-    }
-    for (let k = i; k <= n; k++) {
-      const col2 = mat[k];
-      const tmp = col2[i];
-      col2[i] = col2[max];
-      col2[max] = tmp;
-    }
-    for (let j = i + 1; j < n; j++) {
-      for (let k = n; k >= i; k--) {
-        mat[k][j] -= mat[k][i] * mat[i][j] / mat[i][i];
-      }
-    }
-  }
-  for (let j = n; j-- > 0; ) {
-    const d = mat[j][j];
-    let sum = 0;
-    for (let k = j + 1; k < n; k++) {
-      sum += mat[k][j] * coeffs[k];
-    }
-    coeffs[j] = (mat[n][j] - sum) / d;
-  }
-  return coeffs;
-};
-export {
-  gaussianElimination,
-  polynomial,
-  polynomialRegression
-};