@gkucmierz/utils 3.0.1 → 3.0.2

package/main.mjs

@@ -42,7 +42,7 @@ import {
   getType
 } from './src/get-type.mjs'
 import {
-  goldenRatio, goldenRatioBI
+  goldenRatio, goldenRatioBI, goldenRatioStr
 } from './src/golden-ratio.mjs'
 import {
   gpn, gpnBI
@@ -166,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, 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
+  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, 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
 ];

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gkucmierz/utils",
-  "version": "3.0.1",
+  "version": "3.0.2",
   "type": "module",
   "description": "Usefull functions for solving programming tasks",
   "keywords": [

package/src/golden-ratio.mjs

@@ -9,11 +9,9 @@ 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.
+ * @returns {BigInt} A primitive BigInt representing the Golden Ratio scaled by 10^precision.
  * @throws {Error} If precision is negative.
  * @see {@link https://instacode.app/run/FASwtgDg9gTgLgAgN4IOZQDYBMCmA7AJQEM4QoAhASQQF8EAzGKMBAIgAFUBrAVwGMwIHDABeAeh6kMAZ1YBuYMHTZ8xUhUoKgA|▶ Try it live in Instacode}
  */
@@ -24,17 +22,22 @@ export const goldenRatioBI = precision => {
   
   // (sqrt(5 * exp^2) + exp) / 2
   const result = (squareRootBI(5n * exp * exp) + exp) / 2n;
+  return result;
+};
+
+/**
+ * Calculates the Golden Ratio (phi) to an arbitrary precision and returns it as a formatted string.
+ * @param {number|bigint} precision - The number of decimal places to calculate.
+ * @returns {string} The formatted Golden Ratio string (e.g., '1.618...').
+ * @throws {Error} If precision is negative.
+ * @see {@link https://instacode.app/run/FASwtgDg9gTgLgAgN4IOZQDYBMCmA7AJQEM4QoBlOGBAXwQDMYowEAiAAVQGsBXAYzAgcMAF4B6HqQwBnVgG5gwdNnzFSFKgqA|▶ Try it live in Instacode}
+ */
+export const goldenRatioStr = precision => {
+  if (precision < 0) throw new Error('Precision cannot be negative');
+  const str = goldenRatioBI(precision).toString();
+  if (precision === 0 || precision === 0n) return str;
   
-  // Wrap primitive BigInt in an Object (Boxing)
-  const boxedResult = Object(result);
-  boxedResult.toString = () => {
-    const str = result.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;
+  // 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);
 };