@gkucmierz/utils 3.1.0 → 4.0.0

package/README.md

@@ -28,7 +28,6 @@ This library provides a wide range of mathematical functions and data structures
   - `Trie`: Efficient prefix tree implementation (`class`).
   - `Heap`: Min-heap priority queue (`class`).
   - `ListNode`: Linked list node implementation (`class`).
-  - `matrixAsArray`: 2D matrix representation as a flat array.
 
 - **Number Theory**:
   - `gcd`, `lcm`: Greatest Common Divisor and Least Common Multiple (supports BigInt).
@@ -50,9 +49,10 @@ This library provides a wide range of mathematical functions and data structures
   - `particleSwarmOptimization`: PSO algorithm for global optimization.
   - `simulatedAnnealing`: Probabilistic technique for approximating the global optimum of a given function.
 
-- **Math & 3D Geometry**:
+- **Geometry & Math**:
+  - `barycentricCoordinates`: Triangle barycentric coordinates computation (supports coordinate arrays).
+  - `matrixAsArray`: 2D matrix representation as a flat array.
   - `math3d`: Utilities for 3D vector and matrix math (`crossProduct`, `dotProduct`, `normalize`, `multiplyMatrix4`, `projectToTrackball`, `getRotationMatrixFromVectors`).
-  - `randNormal`: Normal (Gaussian) distribution random number generator (Box-Muller transform).
 
 - **Automata & Simulation**:
   - `createLangtonsAnt`, `createUnlimitedGrid`: Infinite 2D grid and Langton's Ant cellular automaton engine (Project Euler 349 compatible).
@@ -66,6 +66,7 @@ This library provides a wide range of mathematical functions and data structures
   - `formatBigNumber`: Intelligent formatting for massively large numbers with suffixes.
 
 - **Developer Utilities**:
+  - `randNormal`: Normal (Gaussian) distribution random number generator (Box-Muller transform).
   - `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.

package/main.mjs

@@ -1,174 +1,182 @@
 
 import {
-  SetCnt
-} from './src/SetCnt.mjs'
-import {
-  Trie
-} from './src/Trie.mjs'
+  createLangtonsAnt, createUnlimitedGrid
+} from './src/automata/langtons-ant.mjs'
 import {
-  arrayHistogram
-} from './src/array-histogram.mjs'
+  combinations, combinationsIterator
+} from './src/combinatorics/combinations.mjs'
 import {
-  fromBase64, fromBase64Url, toBase64, toBase64Url
-} from './src/base64.mjs'
+  bin2gray, gray2bin
+} from './src/combinatorics/gray-code.mjs'
 import {
-  bijective2num, bijective2numBI, num2bijective, num2bijectiveBI
-} from './src/bijective-numeration.mjs'
+  nChooseK
+} from './src/combinatorics/n-choose-k.mjs'
 import {
-  binarySearchArr, binarySearchGE, binarySearchLE, binarySearchRangeIncl
-} from './src/binary-search.mjs'
+  permutations, permutationsIterator
+} from './src/combinatorics/permutations.mjs'
 import {
-  chunks, chunksAsyncIterator, chunksIterator
-} from './src/chunks.mjs'
+  SetCnt
+} from './src/data-structures/SetCnt.mjs'
 import {
-  combinations, combinationsIterator
-} from './src/combinations.mjs'
+  Trie
+} from './src/data-structures/Trie.mjs'
 import {
-  consumeIteratorNonBlocking
-} from './src/consume-iterator.mjs'
+  Heap
+} from './src/data-structures/heap.mjs'
 import {
-  copyCase
-} from './src/copy-case.mjs'
+  ListNode
+} from './src/data-structures/list-node.mjs'
 import {
-  egcd
-} from './src/egcd.mjs'
+  binarySearchArr, binarySearchGE, binarySearchLE, binarySearchRangeIncl
+} from './src/developer-utils/binary-search.mjs'
 import {
-  factors, factorsBI
-} from './src/factors.mjs'
+  consumeIteratorNonBlocking
+} from './src/developer-utils/consume-iterator.mjs'
 import {
-  formatBigNumber, formatBigNumberBI, wrapFn
-} from './src/format-big-number.mjs'
+  getType
+} from './src/developer-utils/get-type.mjs'
 import {
-  gcd, gcdBI
-} from './src/gcd.mjs'
+  measurePerformance
+} from './src/developer-utils/measure-performance.mjs'
 import {
-  getType
-} from './src/get-type.mjs'
+  memoize
+} from './src/developer-utils/memoize.mjs'
 import {
-  goldenRatio, goldenRatioBI, goldenRatioStr
-} from './src/golden-ratio.mjs'
+  naturalSearch
+} from './src/developer-utils/natural-search.mjs'
 import {
-  gpn, gpnBI
-} from './src/gpn.mjs'
+  randNormal
+} from './src/developer-utils/rand-normal.mjs'
 import {
-  bin2gray, gray2bin
-} from './src/gray-code.mjs'
+  array2range, range2array
+} from './src/developer-utils/range-array.mjs'
 import {
-  Heap
-} from './src/heap.mjs'
+  setSafeInterval
+} from './src/developer-utils/set-safe-interval.mjs'
 import {
-  heronsFormula, heronsFormulaBI
-} from './src/herons-formula.mjs'
+  barycentricCoordinates
+} from './src/geometry/barycentric.mjs'
 import {
-  createLangtonsAnt, createUnlimitedGrid
-} from './src/langtons-ant.mjs'
+  axisAngleToMatrix4, crossProduct, dotProduct, getRotationMatrixFromVectors, multiplyMatrix4, normalize, projectToTrackball
+} from './src/geometry/math3d.mjs'
 import {
-  lcm, lcmBI
-} from './src/lcm.mjs'
+  matrixAsArray
+} from './src/geometry/matrix.mjs'
 import {
-  ListNode
-} from './src/list-node.mjs'
+  egcd
+} from './src/number-theory/egcd.mjs'
 import {
-  lucasLehmerBI
-} from './src/lucas-lehmer.mjs'
+  factors, factorsBI
+} from './src/number-theory/factors.mjs'
 import {
-  axisAngleToMatrix4, crossProduct, dotProduct, getRotationMatrixFromVectors, multiplyMatrix4, normalize, projectToTrackball
-} from './src/math3d.mjs'
+  gcd, gcdBI
+} from './src/number-theory/gcd.mjs'
 import {
-  matrixAsArray
-} from './src/matrix.mjs'
+  lcm, lcmBI
+} from './src/number-theory/lcm.mjs'
 import {
-  measurePerformance
-} from './src/measure-performance.mjs'
+  lucasLehmerBI
+} from './src/number-theory/lucas-lehmer.mjs'
 import {
-  memoize
-} from './src/memoize.mjs'
+  mobius, mobiusBI
+} from './src/number-theory/mobius.mjs'
 import {
   mod, modBI
-} from './src/mod.mjs'
+} from './src/number-theory/mod.mjs'
 import {
-  nChooseK
-} from './src/n-choose-k.mjs'
+  phi, phiBI
+} from './src/number-theory/phi.mjs'
 import {
-  naturalSearch
-} from './src/natural-search.mjs'
+  powMod, powModBI
+} from './src/number-theory/pow-mod.mjs'
+import {
+  tonelliShanksBI
+} from './src/number-theory/tonelli-shanks.mjs'
 import {
   nelderMead
-} from './src/nelder-mead.mjs'
+} from './src/optimization/nelder-mead.mjs'
 import {
   particleSwarmOptimization
-} from './src/particle-swarm.mjs'
+} from './src/optimization/particle-swarm.mjs'
 import {
-  permutations, permutationsIterator
-} from './src/permutations.mjs'
+  simulatedAnnealing
+} from './src/optimization/simulated-annealing.mjs'
 import {
-  phi, phiBI
-} from './src/phi.mjs'
+  goldenRatio, goldenRatioBI, goldenRatioStr
+} from './src/sequences/golden-ratio.mjs'
 import {
-  powMod, powModBI
-} from './src/pow-mod.mjs'
+  gpn, gpnBI
+} from './src/sequences/gpn.mjs'
 import {
-  randNormal
-} from './src/rand-normal.mjs'
+  heronsFormula, heronsFormulaBI
+} from './src/sequences/herons-formula.mjs'
 import {
-  array2range, range2array
-} from './src/range-array.mjs'
+  squareRoot, squareRootBI
+} from './src/sequences/square-root.mjs'
 import {
-  setSafeInterval
-} from './src/set-safe-interval.mjs'
+  arrayHistogram
+} from './src/string-arrays/array-histogram.mjs'
 import {
-  simulatedAnnealing
-} from './src/simulated-annealing.mjs'
+  fromBase64, fromBase64Url, toBase64, toBase64Url
+} from './src/string-arrays/base64.mjs'
 import {
-  squareRoot, squareRootBI
-} from './src/square-root.mjs'
+  bijective2num, bijective2numBI, num2bijective, num2bijectiveBI
+} from './src/string-arrays/bijective-numeration.mjs'
 import {
-  tonelliShanksBI
-} from './src/tonelli-shanks.mjs'
+  chunks, chunksAsyncIterator, chunksIterator
+} from './src/string-arrays/chunks.mjs'
+import {
+  copyCase
+} from './src/string-arrays/copy-case.mjs'
+import {
+  formatBigNumber, formatBigNumberBI, wrapFn
+} from './src/string-arrays/format-big-number.mjs'
 
-export * from './src/SetCnt.mjs';
-export * from './src/Trie.mjs';
-export * from './src/array-histogram.mjs';
-export * from './src/base64.mjs';
-export * from './src/bijective-numeration.mjs';
-export * from './src/binary-search.mjs';
-export * from './src/chunks.mjs';
-export * from './src/combinations.mjs';
-export * from './src/consume-iterator.mjs';
-export * from './src/copy-case.mjs';
-export * from './src/egcd.mjs';
-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';
-export * from './src/natural-search.mjs';
-export * from './src/nelder-mead.mjs';
-export * from './src/particle-swarm.mjs';
-export * from './src/permutations.mjs';
-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 * from './src/automata/langtons-ant.mjs';
+export * from './src/combinatorics/combinations.mjs';
+export * from './src/combinatorics/gray-code.mjs';
+export * from './src/combinatorics/n-choose-k.mjs';
+export * from './src/combinatorics/permutations.mjs';
+export * from './src/data-structures/SetCnt.mjs';
+export * from './src/data-structures/Trie.mjs';
+export * from './src/data-structures/heap.mjs';
+export * from './src/data-structures/list-node.mjs';
+export * from './src/developer-utils/binary-search.mjs';
+export * from './src/developer-utils/consume-iterator.mjs';
+export * from './src/developer-utils/get-type.mjs';
+export * from './src/developer-utils/measure-performance.mjs';
+export * from './src/developer-utils/memoize.mjs';
+export * from './src/developer-utils/natural-search.mjs';
+export * from './src/developer-utils/rand-normal.mjs';
+export * from './src/developer-utils/range-array.mjs';
+export * from './src/developer-utils/set-safe-interval.mjs';
+export * from './src/geometry/barycentric.mjs';
+export * from './src/geometry/math3d.mjs';
+export * from './src/geometry/matrix.mjs';
+export * from './src/number-theory/egcd.mjs';
+export * from './src/number-theory/factors.mjs';
+export * from './src/number-theory/gcd.mjs';
+export * from './src/number-theory/lcm.mjs';
+export * from './src/number-theory/lucas-lehmer.mjs';
+export * from './src/number-theory/mobius.mjs';
+export * from './src/number-theory/mod.mjs';
+export * from './src/number-theory/phi.mjs';
+export * from './src/number-theory/pow-mod.mjs';
+export * from './src/number-theory/tonelli-shanks.mjs';
+export * from './src/optimization/nelder-mead.mjs';
+export * from './src/optimization/particle-swarm.mjs';
+export * from './src/optimization/simulated-annealing.mjs';
+export * from './src/sequences/golden-ratio.mjs';
+export * from './src/sequences/gpn.mjs';
+export * from './src/sequences/herons-formula.mjs';
+export * from './src/sequences/square-root.mjs';
+export * from './src/string-arrays/array-histogram.mjs';
+export * from './src/string-arrays/base64.mjs';
+export * from './src/string-arrays/bijective-numeration.mjs';
+export * from './src/string-arrays/chunks.mjs';
+export * from './src/string-arrays/copy-case.mjs';
+export * from './src/string-arrays/format-big-number.mjs';
 
 export default [
-  SetCnt, Trie, arrayHistogram, fromBase64, fromBase64Url, toBase64, toBase64Url, bijective2num, bijective2numBI, num2bijective, num2bijectiveBI, binarySearchArr, binarySearchGE, binarySearchLE, binarySearchRangeIncl, chunks, chunksAsyncIterator, chunksIterator, combinations, combinationsIterator, consumeIteratorNonBlocking, copyCase, egcd, factors, factorsBI, formatBigNumber, formatBigNumberBI, wrapFn, gcd, gcdBI, getType, goldenRatio, goldenRatioBI, goldenRatioStr, 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
+  createLangtonsAnt, createUnlimitedGrid, combinations, combinationsIterator, bin2gray, gray2bin, nChooseK, permutations, permutationsIterator, SetCnt, Trie, Heap, ListNode, binarySearchArr, binarySearchGE, binarySearchLE, binarySearchRangeIncl, consumeIteratorNonBlocking, getType, measurePerformance, memoize, naturalSearch, randNormal, array2range, range2array, setSafeInterval, barycentricCoordinates, axisAngleToMatrix4, crossProduct, dotProduct, getRotationMatrixFromVectors, multiplyMatrix4, normalize, projectToTrackball, matrixAsArray, egcd, factors, factorsBI, gcd, gcdBI, lcm, lcmBI, lucasLehmerBI, mobius, mobiusBI, mod, modBI, phi, phiBI, powMod, powModBI, tonelliShanksBI, nelderMead, particleSwarmOptimization, simulatedAnnealing, goldenRatio, goldenRatioBI, goldenRatioStr, gpn, gpnBI, heronsFormula, heronsFormulaBI, squareRoot, squareRootBI, arrayHistogram, fromBase64, fromBase64Url, toBase64, toBase64Url, bijective2num, bijective2numBI, num2bijective, num2bijectiveBI, chunks, chunksAsyncIterator, chunksIterator, copyCase, formatBigNumber, formatBigNumberBI, wrapFn
 ];

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gkucmierz/utils",
-  "version": "3.1.0",
+  "version": "4.0.0",
   "type": "module",
   "description": "Usefull functions for solving programming tasks",
   "keywords": [
@@ -52,7 +52,12 @@
     "simulated-annealing",
     "rand-normal",
     "format-big-number",
-    "natural-search"
+    "natural-search",
+    "mobius",
+    "barycentric",
+    "barycentric-coordinates",
+    "geometry",
+    "interpolation"
   ],
   "files": [
     "main.mjs",

package/src/geometry/barycentric.mjs

@@ -0,0 +1,19 @@
+/**
+ * Calculates the barycentric coordinates of a 2D point P relative to a triangle ABC.
+ * @param {Array<number>} p - Point [x, y]
+ * @param {Array<number>} a - Vertex A [x, y]
+ * @param {Array<number>} b - Vertex B [x, y]
+ * @param {Array<number>} c - Vertex C [x, y]
+ * @returns {Array<number>} [l1, l2, l3] barycentric coordinates summing to 1
+ * @see {@link https://instacode.app/run/FASwtgDg9gTgLgAgN4IEYEMYE8DGBTAOzhhBwGEpYATEA9OPAZwQF8EAzGKMBAIgAEA5gGsArjjAg8MAF4B6UXBAAbRrwDcwYBmz4iJcpRg06DRpqA|▶ Try it live in Instacode}
+ */
+export const barycentricCoordinates = (p, a, b, c) => {
+  const det = (b[1] - c[1]) * (a[0] - c[0]) + (c[0] - b[0]) * (a[1] - c[1]);
+  if (Math.abs(det) < 1e-9) {
+    return [1/3, 1/3, 1/3]; // Fallback for collinear vertices
+  }
+  const l1 = ((b[1] - c[1]) * (p[0] - c[0]) + (c[0] - b[0]) * (p[1] - c[1])) / det;
+  const l2 = ((c[1] - a[1]) * (p[0] - c[0]) + (a[0] - c[0]) * (p[1] - c[1])) / det;
+  const l3 = 1 - l1 - l2;
+  return [l1, l2, l3];
+};

package/src/{math3d.mjs → geometry/math3d.mjs}

@@ -65,3 +65,4 @@ export const getRotationMatrixFromVectors = (u, v) => {
   const angle = Math.acos(Math.max(-1, Math.min(1, dot)));
   return axisAngleToMatrix4(axis, angle);
 };
+

package/src/number-theory/mobius.mjs

@@ -0,0 +1,31 @@
+import { factors, factorsBI } from './factors.mjs';
+
+/**
+ * Calculates the Mobius function μ(n) of a number.
+ * @param {number} n - A positive integer.
+ * @returns {number} The Mobius function value (1, -1, or 0).
+ * @see {@link https://instacode.app/run/FASwtgDg9gTgLgAgN4LFARiArgZwQXwQDMYowEAiAAQHMBrLAYzBAFMYAvAeizhABscFANzBgaTLlFA|▶ Try it live in Instacode}
+ */
+export const mobius = n => {
+  if (n < 1) return 0;
+  if (n === 1) return 1;
+  const f = factors(n);
+  const unique = new Set(f);
+  if (unique.size !== f.length) return 0;
+  return f.length % 2 === 0 ? 1 : -1;
+};
+
+/**
+ * Calculates the Mobius function μ(n) of a BigInt.
+ * @param {bigint} n - A positive BigInt.
+ * @returns {number} The Mobius function value (1, -1, or 0).
+ * @see {@link https://instacode.app/run/FASwtgDg9gTgLgAgN4LFARiArgZwEICSCAvggGYxRgIBEAAgOYDWWAxmCAKYwBeA9FjggANjhoBuYMDSZchSUA|▶ Try it live in Instacode}
+ */
+export const mobiusBI = n => {
+  if (n < 1n) return 0;
+  if (n === 1n) return 1;
+  const f = factorsBI(n);
+  const unique = new Set(f);
+  if (unique.size !== f.length) return 0;
+  return f.length % 2 === 0 ? 1 : -1;
+};