@gkucmierz/utils 2.0.8 → 2.3.0

package/README.md

@@ -47,6 +47,10 @@ This library provides a wide range of mathematical functions and data structures
   - `gpn`: Generalized Pentagonal Numbers.
   - `heronsFormula`: Triangle area calculation.
   - `squareRoot`: Integer square root using Newton's method.
+  - `goldenRatio`, `goldenRatioBI`: The Golden Ratio calculation (with arbitrary precision support).
+
+- **Automata & Simulation**:
+  - `createLangtonsAnt`, `createUnlimitedGrid`: Infinite 2D grid and Langton's Ant cellular automaton engine (Project Euler 349 compatible).
 
 - **String & Encoding & Arrays**:
   - `base64`: Base64 and Base64Url encoding/decoding.
@@ -55,6 +59,7 @@ This library provides a wide range of mathematical functions and data structures
   - `bijectiveNumeration`: Bijective base-k numeration system.
 
 - **Developer Utilities**:
+  - `measurePerformance`: A micro-benchmarking tool for high-iteration performance testing.
   - `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.

package/main.mjs

@@ -41,6 +41,9 @@ import {
 import {
   getType
 } from './src/get-type.mjs'
+import {
+  goldenRatio, goldenRatioBI
+} from './src/golden-ratio.mjs'
 import {
   gpn, gpnBI
 } from './src/gpn.mjs'
@@ -53,6 +56,9 @@ import {
 import {
   heronsFormula, heronsFormulaBI
 } from './src/herons-formula.mjs'
+import {
+  createLangtonsAnt, createUnlimitedGrid
+} from './src/langtons-ant.mjs'
 import {
   lcm, lcmBI
 } from './src/lcm.mjs'
@@ -68,6 +74,9 @@ import {
 import {
   matrixAsArray
 } from './src/matrix.mjs'
+import {
+  measurePerformance
+} from './src/measure-performance.mjs'
 import {
   memoize
 } from './src/memoize.mjs'
@@ -128,15 +137,18 @@ export * from './src/factors.mjs';
 export * from './src/format-big-number.mjs';
 export * from './src/gcd.mjs';
 export * from './src/get-type.mjs';
+export * from './src/golden-ratio.mjs';
 export * from './src/gpn.mjs';
 export * from './src/gray-code.mjs';
 export * from './src/heap.mjs';
 export * from './src/herons-formula.mjs';
+export * from './src/langtons-ant.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/measure-performance.mjs';
 export * from './src/memoize.mjs';
 export * from './src/mod.mjs';
 export * from './src/n-choose-k.mjs';
@@ -154,5 +166,5 @@ 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, 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
+  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, goldenRatio, goldenRatioBI, gpn, gpnBI, bin2gray, gray2bin, Heap, heronsFormula, heronsFormulaBI, createLangtonsAnt, createUnlimitedGrid, lcm, lcmBI, ListNode, lucasLehmerBI, axisAngleToMatrix4, crossProduct, dotProduct, getRotationMatrixFromVectors, multiplyMatrix4, normalize, projectToTrackball, matrixAsArray, measurePerformance, 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.8",
+  "version": "2.3.0",
   "type": "module",
   "description": "Usefull functions for solving programming tasks",
   "keywords": [
@@ -9,18 +9,22 @@
     "base64",
     "bijective",
     "binary-search",
+    "benchmark",
     "combinations",
     "competitive-programming",
     "data-structures",
     "factors",
     "gcd",
+    "golden-ratio",
     "gray-code",
     "heap",
     "iterator",
     "javascript",
     "lcm",
+    "langtons-ant",
     "lucas-lehmer",
     "math",
+    "cellular-automaton",
     "memoize",
     "mersenne",
     "mod",

package/src/golden-ratio.mjs

@@ -0,0 +1,38 @@
+import { squareRootBI } from './square-root.mjs';
+
+/**
+ * The standard float approximation of the Golden Ratio (phi).
+ * @constant {number}
+ */
+export const goldenRatio = ((5 ** 0.5) + 1) / 2;
+
+/**
+ * Calculates the Golden Ratio (phi) to an arbitrary precision using BigInt.
+ * Returns a boxed BigInt object with an overridden toString() method to 
+ * automatically format the output with the correct decimal point placement.
+ * 
+ * @param {number|bigint} precision - The number of decimal places to calculate.
+ * @returns {BigInt} A boxed BigInt representing the Golden Ratio scaled by 10^precision.
+ * @throws {Error} If precision is negative.
+ */
+export const goldenRatioBI = precision => {
+  if (precision < 0) throw new Error('Precision cannot be negative');
+  const p = BigInt(precision);
+  const exp = 10n ** p;
+  
+  // (sqrt(5 * exp^2) + exp) / 2
+  const result = (squareRootBI(5n * exp * exp) + exp) / 2n;
+  
+  // Wrap primitive BigInt in an Object (Boxing)
+  const boxedResult = Object(result);
+  boxedResult.toString = function() {
+    const str = this.valueOf().toString();
+    if (precision === 0) return str;
+    
+    // The Golden Ratio is ~1.618, so the integer part is always '1'.
+    // The length of str is exactly precision + 1.
+    return str.slice(0, 1) + '.' + str.slice(1);
+  };
+  
+  return boxedResult;
+};

package/src/langtons-ant.mjs

@@ -0,0 +1,79 @@
+/**
+ * Creates an unlimited, dynamically expanding 2D grid using nested Maps.
+ * Ideal for sparse matrices or algorithms operating on an infinite plane (e.g., Langton's Ant, Game of Life).
+ * 
+ * @returns {Object} An object containing `get(x, y)` and `set(x, y, val)` methods.
+ */
+export const createUnlimitedGrid = () => {
+  const grid = new Map();
+
+  const getRow = y => {
+    let row;
+    if (!(row = grid.get(y))) {
+      row = new Map();
+      grid.set(y, row);
+    }
+    return row;
+  };
+  
+  const set = (x, y, val) => {
+    const row = getRow(y);
+    row.set(x, val);
+  };
+  
+  const get = (x, y) => {
+    const row = getRow(y);
+    return row.get(x) || 0;
+  };
+  
+  return { set, get };
+};
+
+/**
+ * Initializes a Langton's Ant automaton on a given grid.
+ * The ant follows standard rules: turns right on 0, turns left on 1, and flips the cell state.
+ * 
+ * @param {Object} grid - The grid interface containing `get(x, y)` and `set(x, y, val)` methods.
+ * @param {number} startX - The initial X coordinate of the ant.
+ * @param {number} startY - The initial Y coordinate of the ant.
+ * @param {number} [initialDir=-1] - The initial direction (0: TOP, 1: RIGHT, 2: BOTTOM, 3: LEFT). If -1, a random direction is chosen.
+ * @returns {Object} An object containing a `step()` method which advances the simulation by one tick and returns `{x, y, state}` of the modified cell.
+ */
+export const createLangtonsAnt = (grid, startX, startY, initialDir = -1) => {
+  const [X, Y] = [0, 1];
+  const [TOP, RIGHT, BOT, LEFT] = [0, 1, 2, 3];
+  const coordMap = new Map([
+    [TOP,   [ 0,-1]],
+    [RIGHT, [ 1, 0]],
+    [BOT,   [ 0, 1]],
+    [LEFT,  [-1, 0]],
+  ]);
+  
+  let dir = initialDir !== -1 ? initialDir : Math.floor(Math.random() * 4);
+  const pos = [startX, startY];
+  
+  const step = () => {
+    const currentState = grid.get(pos[X], pos[Y]);
+    const nextState = currentState === 0 ? 1 : 0;
+    
+    grid.set(pos[X], pos[Y], nextState);
+    
+    if (currentState === 0) {
+      dir = (dir + 1) % 4; // Turn Right
+    } else {
+      dir = (dir + 3) % 4; // Turn Left
+    }
+    
+    const move = coordMap.get(dir);
+    pos[X] += move[X];
+    pos[Y] += move[Y];
+    
+    return {
+      x: pos[X] - move[X],
+      y: pos[Y] - move[Y],
+      state: nextState
+    };
+  };
+  
+  return { step };
+};

package/src/measure-performance.mjs

@@ -0,0 +1,21 @@
+/**
+ * Measures the execution time of a given function by running it multiple times.
+ * Useful for micro-benchmarking and performance comparison.
+ * 
+ * @param {Function} fn - The function to benchmark.
+ * @param {number} [times=1e8] - The number of iterations to run the function.
+ * @param {string} [memo='noop'] - A descriptive label for the benchmark result.
+ * @returns {Object} An object containing the `memo` and the `duration` (in milliseconds).
+ */
+export const measurePerformance = (fn, times = 1e8, memo = 'noop') => {
+  const t1 = Date.now();
+  while (times--) {
+    fn();
+  }
+  const t2 = Date.now();
+  
+  return {
+    memo,
+    duration: t2 - t1
+  };
+};