@gkucmierz/utils 2.0.6 → 2.0.8

package/README.md

@@ -41,6 +41,7 @@ This library provides a wide range of mathematical functions and data structures
   - `mod`, `powMod`: Modular arithmetic with Python-like behavior for negative numbers.
   - `egcd`: Extended Euclidean Algorithm.
   - `tonelliShanksBI`: Modular square root algorithm.
+  - `lucasLehmerBI`: Lucas-Lehmer primality test for Mersenne primes.
 
 - **Sequences & Formulas**:
   - `gpn`: Generalized Pentagonal Numbers.
@@ -54,6 +55,7 @@ This library provides a wide range of mathematical functions and data structures
   - `bijectiveNumeration`: Bijective base-k numeration system.
 
 - **Developer Utilities**:
+  - `setSafeInterval`: A safe, asynchronous alternative to `setInterval` that prevents overlapping executions and supports immediate yielding.
   - `consumeIteratorNonBlocking`: Yield consumption macro-tasks queue resolver for heavy computations.
   - `memoize`: Function memoization based on arguments.
   - `binarySearch`: Various binary search implementations (exact, lower bound, upper bound).

package/main.mjs

@@ -59,6 +59,9 @@ import {
 import {
   ListNode
 } from './src/list-node.mjs'
+import {
+  lucasLehmerBI
+} from './src/lucas-lehmer.mjs'
 import {
   axisAngleToMatrix4, crossProduct, dotProduct, getRotationMatrixFromVectors, multiplyMatrix4, normalize, projectToTrackball
 } from './src/math3d.mjs'
@@ -98,6 +101,9 @@ import {
 import {
   array2range, range2array
 } from './src/range-array.mjs'
+import {
+  setSafeInterval
+} from './src/set-safe-interval.mjs'
 import {
   simulatedAnnealing
 } from './src/simulated-annealing.mjs'
@@ -128,6 +134,7 @@ export * from './src/heap.mjs';
 export * from './src/herons-formula.mjs';
 export * from './src/lcm.mjs';
 export * from './src/list-node.mjs';
+export * from './src/lucas-lehmer.mjs';
 export * from './src/math3d.mjs';
 export * from './src/matrix.mjs';
 export * from './src/memoize.mjs';
@@ -141,10 +148,11 @@ export * from './src/phi.mjs';
 export * from './src/pow-mod.mjs';
 export * from './src/rand-normal.mjs';
 export * from './src/range-array.mjs';
+export * from './src/set-safe-interval.mjs';
 export * from './src/simulated-annealing.mjs';
 export * from './src/square-root.mjs';
 export * from './src/tonelli-shanks.mjs';
 
 export default [
-  SetCnt, Trie, arrayHistogram, fromBase64, fromBase64Url, toBase64, toBase64Url, bijective2num, bijective2numBI, num2bijective, num2bijectiveBI, binarySearchArr, binarySearchGE, binarySearchLE, binarySearchRangeIncl, combinations, combinationsIterator, consumeIteratorNonBlocking, copyCase, egcd, factors, factorsBI, formatBigNumber, formatBigNumberBI, wrapFn, gcd, gcdBI, getType, gpn, gpnBI, bin2gray, gray2bin, Heap, heronsFormula, heronsFormulaBI, lcm, lcmBI, ListNode, axisAngleToMatrix4, crossProduct, dotProduct, getRotationMatrixFromVectors, multiplyMatrix4, normalize, projectToTrackball, matrixAsArray, memoize, mod, modBI, nChooseK, naturalSearch, nelderMead, particleSwarmOptimization, permutations, permutationsIterator, phi, phiBI, powMod, powModBI, randNormal, array2range, range2array, simulatedAnnealing, squareRoot, squareRootBI, tonelliShanksBI
+  SetCnt, Trie, arrayHistogram, fromBase64, fromBase64Url, toBase64, toBase64Url, bijective2num, bijective2numBI, num2bijective, num2bijectiveBI, binarySearchArr, binarySearchGE, binarySearchLE, binarySearchRangeIncl, combinations, combinationsIterator, consumeIteratorNonBlocking, copyCase, egcd, factors, factorsBI, formatBigNumber, formatBigNumberBI, wrapFn, gcd, gcdBI, getType, gpn, gpnBI, bin2gray, gray2bin, Heap, heronsFormula, heronsFormulaBI, lcm, lcmBI, ListNode, lucasLehmerBI, axisAngleToMatrix4, crossProduct, dotProduct, getRotationMatrixFromVectors, multiplyMatrix4, normalize, projectToTrackball, matrixAsArray, memoize, mod, modBI, nChooseK, naturalSearch, nelderMead, particleSwarmOptimization, permutations, permutationsIterator, phi, phiBI, powMod, powModBI, randNormal, array2range, range2array, setSafeInterval, simulatedAnnealing, squareRoot, squareRootBI, tonelliShanksBI
 ];

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gkucmierz/utils",
-  "version": "2.0.6",
+  "version": "2.0.8",
   "type": "module",
   "description": "Usefull functions for solving programming tasks",
   "keywords": [
@@ -19,8 +19,10 @@
     "iterator",
     "javascript",
     "lcm",
+    "lucas-lehmer",
     "math",
     "memoize",
+    "mersenne",
     "mod",
     "n-choose-k",
     "node",
@@ -29,7 +31,12 @@
     "permutations",
     "phi",
     "pow-mod",
+    "primality-test",
+    "prime",
     "range-array",
+    "set-safe-interval",
+    "setinterval",
+    "settimeout",
     "square-root",
     "tonelli-shanks",
     "trie",

package/src/lucas-lehmer.mjs

@@ -0,0 +1,18 @@
+/**
+ * Calculates whether a given Mersenne number (2^p - 1) is prime using the Lucas-Lehmer primality test.
+ * 
+ * @param {number|bigint} exp - The exponent p of the Mersenne number M_p.
+ * @param {boolean} [verbose=false] - If true, logs the calculation progress.
+ * @returns {boolean} True if the Mersenne number is prime, false otherwise.
+ */
+export const lucasLehmerBI = (exp, verbose = false) => {
+  const steps = exp - 2;
+  const prime = 2n ** BigInt(exp) - 1n;
+  verbose && console.log('prime: ', prime);
+  let s = 4n;
+  for (let i = 0; i < steps; ++i) {
+    s = (s ** 2n - 2n) % prime;
+    verbose && console.log(i, s);
+  }
+  return s === 0n;
+};

package/src/math3d.mjs

@@ -20,9 +20,9 @@ export const projectToTrackball = (x, y, radius = 1) => {
   const d2 = x*x + y*y;
   const r2 = radius * radius;
   if (d2 <= r2 * 0.5) {
-     return normalize([x, y, Math.sqrt(r2 - d2)]);
+    return normalize([x, y, Math.sqrt(r2 - d2)]);
   } else {
-     return normalize([x, y, (r2 * 0.5) / Math.sqrt(d2)]);
+    return normalize([x, y, (r2 * 0.5) / Math.sqrt(d2)]);
   }
 };
 
@@ -47,7 +47,7 @@ export const multiplyMatrix4 = (a, b) => {
     for (let r = 0; r < 4; r++) {
       let sum = 0;
       for (let i = 0; i < 4; i++) {
-         sum += a[i*4 + r] * b[c*4 + i]; // Note: column-major alignment
+        sum += a[i*4 + r] * b[c*4 + i]; // Note: column-major alignment
       }
       out[c*4 + r] = sum;
     }
@@ -58,7 +58,7 @@ export const multiplyMatrix4 = (a, b) => {
 export const getRotationMatrixFromVectors = (u, v) => {
   const axis = crossProduct(u, v);
   if (axis[0] === 0 && axis[1] === 0 && axis[2] === 0) {
-      return [1,0,0,0,  0,1,0,0,  0,0,1,0,  0,0,0,1]; // Identity
+    return [1,0,0,0,  0,1,0,0,  0,0,1,0,  0,0,0,1]; // Identity
   }
   const dot = dotProduct(u, v);
   const angle = Math.acos(Math.max(-1, Math.min(1, dot)));

package/src/rand-normal.mjs

@@ -1,3 +1,10 @@
+/**
+ * Generates a random number from a normal (Gaussian) distribution.
+ * Uses the Box-Muller transform.
+ * @param {number} [mean=0] - The mean of the normal distribution.
+ * @param {number} [sigma=1] - The standard deviation of the normal distribution.
+ * @returns {number} A random number from the specified normal distribution.
+ */
 export const randNormal = (mean = 0, sigma = 1) => {
   const y1 = Math.random();
   const y2 = Math.random();

package/src/set-safe-interval.mjs

@@ -0,0 +1,44 @@
+/**
+ * A safe alternative to setInterval that uses recursive setTimeout.
+ * It waits for the callback (even if it's async) to finish before scheduling the next tick,
+ * preventing overlapping executions and event loop blocking.
+ *
+ * @param {Function} cb - Function to execute (can be async)
+ * @param {number} delay - Delay in ms between executions
+ * @param {boolean} [immediate=true] - Whether to fire the first execution immediately
+ * @param {boolean} [nextTick=false] - If immediate is true, whether to yield to the event loop before the first execution
+ * @returns {Function} A function to clear the interval
+ */
+export const setSafeInterval = (cb, delay, immediate = true, nextTick = false) => {
+  let isCleared = false;
+  let timerId = null;
+
+  const loop = async () => {
+    if (isCleared) return;
+    
+    try {
+      await cb();
+    } catch (e) {
+      console.error('SafeInterval callback error:', e);
+    }
+    
+    if (!isCleared) {
+      timerId = setTimeout(loop, delay);
+    }
+  };
+
+  if (immediate) {
+    if (nextTick) {
+      timerId = setTimeout(loop, 0);
+    } else {
+      loop();
+    }
+  } else {
+    timerId = setTimeout(loop, delay);
+  }
+
+  return () => {
+    isCleared = true;
+    clearTimeout(timerId);
+  };
+};