@thi.ng/math 5.1.2 → 5.2.0

package/CHANGELOG.md

@@ -1,6 +1,6 @@
 # Change Log
 
-- **Last updated**: 2021-11-21T17:09:28Z
+- **Last updated**: 2021-12-13T10:26:00Z
 - **Generator**: [thi.ng/monopub](https://thi.ng/monopub)
 
 All notable changes to this project will be documented in this file.
@@ -9,6 +9,16 @@ See [Conventional Commits](https://conventionalcommits.org/) for commit guidelin
 **Note:** Unlisted _patch_ versions only involve non-code or otherwise excluded changes
 and/or version bumps of transitive dependencies.
 
+## [5.2.0](https://github.com/thi-ng/umbrella/tree/@thi.ng/math@5.2.0) (2021-12-13)
+
+#### 🚀 Features
+
+- add prime number fns ([f301256](https://github.com/thi-ng/umbrella/commit/f301256))
+  - add nearestPrime()
+  - add primesUntil()
+  - add tests
+  - update pkg
+
 ## [5.1.0](https://github.com/thi-ng/umbrella/tree/@thi.ng/math@5.1.0) (2021-11-17)
 
 #### 🚀 Features

package/index.d.ts

@@ -11,6 +11,7 @@ export * from "./libc.js";
 export * from "./min-error.js";
 export * from "./mix.js";
 export * from "./prec.js";
+export * from "./prime.js";
 export * from "./ratio.js";
 export * from "./safe-div.js";
 export * from "./solve.js";

package/index.js

@@ -11,6 +11,7 @@ export * from "./libc.js";
 export * from "./min-error.js";
 export * from "./mix.js";
 export * from "./prec.js";
+export * from "./prime.js";
 export * from "./ratio.js";
 export * from "./safe-div.js";
 export * from "./solve.js";

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@thi.ng/math",
-  "version": "5.1.2",
+  "version": "5.2.0",
   "description": "Assorted common math functions & utilities",
   "type": "module",
   "module": "./index.js",
@@ -34,15 +34,15 @@
     "test": "testament test"
   },
   "dependencies": {
-    "@thi.ng/api": "^8.3.2"
+    "@thi.ng/api": "^8.3.3"
   },
   "devDependencies": {
-    "@microsoft/api-extractor": "^7.18.19",
-    "@thi.ng/testament": "^0.2.2",
+    "@microsoft/api-extractor": "^7.19.2",
+    "@thi.ng/testament": "^0.2.3",
     "rimraf": "^3.0.2",
     "tools": "^0.0.1",
-    "typedoc": "^0.22.9",
-    "typescript": "^4.5.2"
+    "typedoc": "^0.22.10",
+    "typescript": "^4.5.3"
   },
   "keywords": [
     "animation",
@@ -52,6 +52,7 @@
     "interpolation",
     "interval",
     "math",
+    "prime",
     "quadratic",
     "smooth",
     "solver",
@@ -112,6 +113,9 @@
     "./prec": {
       "import": "./prec.js"
     },
+    "./prime": {
+      "import": "./prime.js"
+    },
     "./ratio": {
       "import": "./ratio.js"
     },
@@ -128,5 +132,5 @@
   "thi.ng": {
     "year": 2013
   },
-  "gitHead": "e8a7c2a40191b391cef182c2978e5a6c85987a87\n"
+  "gitHead": "2db9dd34c0c2c60cbfde3dad0bca352b20292f5c\n"
 }

package/prime.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Returns iterator of all prime numbers ≤ given `x` using Sieve of
+ * Eratosthenes.
+ *
+ * @remarks
+ * Reference: https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
+ *
+ * @param x
+ */
+export declare function primesUntil(x: number): Generator<number, void, unknown>;
+/**
+ * Returns largest prime number ≤ given `x` using Sieve of Eratosthenes. Returns
+ * -1 if x < 1.
+ *
+ * @remarks
+ * Reference: https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
+ *
+ * @param x
+ */
+export declare const nearestPrime: (x: number) => number;
+//# sourceMappingURL=prime.d.ts.map

package/prime.js

@@ -0,0 +1,54 @@
+/**
+ * Returns iterator of all prime numbers ≤ given `x` using Sieve of
+ * Eratosthenes.
+ *
+ * @remarks
+ * Reference: https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
+ *
+ * @param x
+ */
+export function* primesUntil(x) {
+    if (x < 1)
+        return;
+    yield 1;
+    const sieve = [];
+    const max = Math.sqrt(x) | 0;
+    for (let i = 2; i <= x; i++) {
+        if (!sieve[i]) {
+            yield i;
+            __updateSieve(sieve, i, x, max);
+        }
+    }
+}
+/**
+ * Returns largest prime number ≤ given `x` using Sieve of Eratosthenes. Returns
+ * -1 if x < 1.
+ *
+ * @remarks
+ * Reference: https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
+ *
+ * @param x
+ */
+export const nearestPrime = (x) => {
+    if (x < 1)
+        return -1;
+    let prime = 1;
+    const sieve = [];
+    const max = Math.sqrt(x) | 0;
+    for (let i = 2; i <= x; i++) {
+        if (!sieve[i]) {
+            prime = i;
+            __updateSieve(sieve, i, x, max);
+        }
+    }
+    return prime;
+};
+/**
+ * @internal
+ */
+const __updateSieve = (sieve, i, x, max) => {
+    if (i <= max) {
+        for (let j = i * i; j <= x; j += i)
+            sieve[j] = true;
+    }
+};