@thi.ng/math 5.10.12 → 5.10.13

package/CHANGELOG.md

@@ -1,6 +1,6 @@
 # Change Log
 
-- **Last updated**: 2024-04-23T07:02:18Z
+- **Last updated**: 2024-05-08T18:24:32Z
 - **Generator**: [thi.ng/monopub](https://thi.ng/monopub)
 
 All notable changes to this project will be documented in this file.

package/extrema.js

@@ -14,8 +14,7 @@ const maximaIndex = (values, from = 0, to = values.length) => index(isMaxima, va
 function* indices(fn, vals, from = 0, to = vals.length) {
   while (from < to) {
     const i = fn(vals, from, to);
-    if (i < 0)
-      return;
+    if (i < 0) return;
     yield i;
     from = i + 1;
   }

package/interval.js

@@ -5,18 +5,15 @@ const clamp11 = (x) => x < -1 ? -1 : x > 1 ? 1 : x;
 const clamp05 = (x) => x < 0 ? 0 : x > 0.5 ? 0.5 : x;
 const minMax = (x, y) => x < y ? [x, y] : [y, x];
 const wrap = (x, min, max) => {
-  if (min === max)
-    return min;
+  if (min === max) return min;
   if (x > max) {
     const d = max - min;
     x -= d;
-    if (x > max)
-      x -= d * ((x - min) / d | 0);
+    if (x > max) x -= d * ((x - min) / d | 0);
   } else if (x < min) {
     const d = max - min;
     x += d;
-    if (x < min)
-      x += d * ((min - x) / d + 1 | 0);
+    if (x < min) x += d * ((min - x) / d + 1 | 0);
   }
   return x;
 };

package/libc.js

@@ -4,8 +4,7 @@ const fdim = (x, y) => Math.max(x - y, 0);
 const fma = (x, y, z) => x * y + z;
 const fmod = (x, y) => x % y;
 const frexp = (x) => {
-  if (x === 0 || !isFinite(x))
-    return [x, 0];
+  if (x === 0 || !isFinite(x)) return [x, 0];
   const abs = Math.abs(x);
   let exp = Math.max(-1023, Math.floor(Math.log2(abs)) + 1);
   let y = abs * 2 ** -exp;

package/min-error.js

@@ -1,7 +1,6 @@
 import { EPS } from "./api.js";
 const minError = (fn, error, q, res = 16, iter = 8, start = 0, end = 1, eps = EPS) => {
-  if (iter <= 0)
-    return (start + end) / 2;
+  if (iter <= 0) return (start + end) / 2;
   const delta = (end - start) / res;
   let minT = start;
   let minE = Infinity;
@@ -9,8 +8,7 @@ const minError = (fn, error, q, res = 16, iter = 8, start = 0, end = 1, eps = EP
     const t = start + i * delta;
     const e = error(q, fn(t));
     if (e < minE) {
-      if (e <= eps)
-        return t;
+      if (e <= eps) return t;
       minE = e;
       minT = t;
     }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@thi.ng/math",
-  "version": "5.10.12",
+  "version": "5.10.13",
   "description": "Assorted common math functions & utilities",
   "type": "module",
   "module": "./index.js",
@@ -39,13 +39,13 @@
     "tool:tangle": "../../node_modules/.bin/tangle src/**/*.ts"
   },
   "dependencies": {
-    "@thi.ng/api": "^8.11.1"
+    "@thi.ng/api": "^8.11.2"
   },
   "devDependencies": {
-    "@microsoft/api-extractor": "^7.43.0",
-    "esbuild": "^0.20.2",
-    "typedoc": "^0.25.12",
-    "typescript": "^5.4.3"
+    "@microsoft/api-extractor": "^7.43.2",
+    "esbuild": "^0.21.1",
+    "typedoc": "^0.25.13",
+    "typescript": "^5.4.5"
   },
   "keywords": [
     "animation",
@@ -142,5 +142,5 @@
   "thi.ng": {
     "year": 2013
   },
-  "gitHead": "5dd66c18a3862a3af69a5b2f49563f7cbdd960c2\n"
+  "gitHead": "df34b4a9e650cc7323575356de207d78933bdcf3\n"
 }

package/permutations.js

@@ -1,9 +1,7 @@
 const factorial = (n) => {
-  if (n < 0)
-    throw new Error(`illegal argument: ${n}`);
+  if (n < 0) throw new Error(`illegal argument: ${n}`);
   let res = 1;
-  for (let i = 1; i <= n; i++)
-    res *= i;
+  for (let i = 1; i <= n; i++) res *= i;
   return res;
 };
 const permutationsWithRep = (n, k) => n ** k;

package/prime.js

@@ -1,6 +1,5 @@
 function* primesUntil(x) {
-  if (x < 1)
-    return;
+  if (x < 1) return;
   yield 1;
   const sieve = [];
   const max = Math.sqrt(x) | 0;
@@ -12,8 +11,7 @@ function* primesUntil(x) {
   }
 }
 const nearestPrime = (x) => {
-  if (x < 1)
-    return -1;
+  if (x < 1) return -1;
   let prime = 1;
   const sieve = [];
   const max = Math.sqrt(x) | 0;
@@ -27,8 +25,7 @@ const nearestPrime = (x) => {
 };
 const __updateSieve = (sieve, i, x, max) => {
   if (i <= max) {
-    for (let j = i * i; j <= x; j += i)
-      sieve[j] = true;
+    for (let j = i * i; j <= x; j += i) sieve[j] = true;
   }
 };
 export {