@gkucmierz/utils 1.28.8 → 1.30.0

package/main.mjs

@@ -2,6 +2,9 @@
 import {
   SetCnt
 } from './src/SetCnt.mjs'
+import {
+  Trie
+} from './src/Trie.mjs'
 import {
   fromBase64, fromBase64Url, toBase64, toBase64Url
 } from './src/base64.mjs'
@@ -9,7 +12,7 @@ import {
   bijective2num, bijective2numBI, num2bijective, num2bijectiveBI
 } from './src/bijective-numeration.mjs'
 import {
-  binarySearchArr
+  binarySearchArr, binarySearchGE, binarySearchLE, binarySearchRangeIncl
 } from './src/binary-search.mjs'
 import {
   copyCase
@@ -20,6 +23,9 @@ import {
 import {
   factors, factorsBI
 } from './src/factors.mjs'
+import {
+  formatBigNumber, formatBigNumberBI, wrapFn
+} from './src/format-big-number.mjs'
 import {
   gcd, gcdBI
 } from './src/gcd.mjs'
@@ -65,14 +71,19 @@ import {
 import {
   tonelliShanksBI
 } from './src/tonelli-shanks.mjs'
+import {
+  naturalSearch
+} from './src/natural-search.mjs'
 
 export * from './src/SetCnt.mjs';
+export * from './src/Trie.mjs';
 export * from './src/base64.mjs';
 export * from './src/bijective-numeration.mjs';
 export * from './src/binary-search.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/gpn.mjs';
@@ -88,7 +99,8 @@ export * from './src/pow-mod.mjs';
 export * from './src/range-array.mjs';
 export * from './src/square-root.mjs';
 export * from './src/tonelli-shanks.mjs';
+export * from './src/natural-search.mjs';
 
 export default [
-  SetCnt, fromBase64, fromBase64Url, toBase64, toBase64Url, bijective2num, bijective2numBI, num2bijective, num2bijectiveBI, binarySearchArr, copyCase, egcd, factors, factorsBI, gcd, gcdBI, getType, gpn, gpnBI, Heap, heronsFormula, heronsFormulaBI, lcm, lcmBI, ListNode, matrixAsArray, memoize, mod, modBI, phi, phiBI, powMod, powModBI, array2range, range2array, squareRoot, squareRootBI, tonelliShanksBI
+  SetCnt, Trie, fromBase64, fromBase64Url, toBase64, toBase64Url, bijective2num, bijective2numBI, num2bijective, num2bijectiveBI, binarySearchArr, binarySearchGE, binarySearchLE, binarySearchRangeIncl, copyCase, egcd, factors, factorsBI, formatBigNumber, formatBigNumberBI, wrapFn, gcd, gcdBI, getType, gpn, gpnBI, Heap, heronsFormula, heronsFormulaBI, lcm, lcmBI, ListNode, matrixAsArray, memoize, mod, modBI, phi, phiBI, powMod, powModBI, array2range, range2array, squareRoot, squareRootBI, tonelliShanksBI, naturalSearch
 ];

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gkucmierz/utils",
-  "version": "1.28.8",
+  "version": "1.30.0",
   "description": "Usefull functions for solving programming tasks",
   "keywords": [
     "utils",

package/src/format-big-number.mjs

@@ -0,0 +1,49 @@
+
+/**
+ * Formats a BigNumber, Number or string representation of a number
+ * by separating thousands with a provided separator.
+ *
+ * @param {number|string|bigint} num - The number to format.
+ * @param {string} [separator=''] - The string to use as a thousand separator.
+ * @param {function(string): string} [wrapFn=_=>_] - Optional function to wrap each part of the number.
+ * @returns {string} The formatted number.
+ */
+const formatBigNumberBoth = (num, separator = '', wrapFn = _ => _) => {
+  const str = String(num);
+  const rev = [...str].reverse().join('');
+  const match = rev.match(/(\d*\.\-?)|(\d{3}\-?)|(\d{1,3}\-?)|(\-)/g);
+  const revInside = (match && match.join('') === rev)
+    ? match.map(part => [...part].reverse().join(''))
+    : [str];
+  const wrap = revInside.map(wrapFn);
+  return wrap.reverse().join(separator);
+};
+
+/**
+ * Formats a BigNumber, Number or string representation of a number
+ * by separating thousands with a provided separator.
+ * @param {number|string|bigint} num - The number to format.
+ * @param {string} [separator=''] - The string to use as a thousand separator.
+ * @param {function(string): string} [wrapFn=_=>_] - Optional function to wrap each part of the number.
+ * @returns {string} The formatted number.
+ */
+export const formatBigNumber = formatBigNumberBoth;
+
+/**
+ * Formats a BigNumber, Number or string representation of a number
+ * by separating thousands with a provided separator. (Alias for BigInt logic)
+ * @param {number|string|bigint} num - The number to format.
+ * @param {string} [separator=''] - The string to use as a thousand separator.
+ * @param {function(string): string} [wrapFn=_=>_] - Optional function to wrap each part of the number.
+ * @returns {string} The formatted number.
+ */
+export const formatBigNumberBI = formatBigNumberBoth;
+
+export const wrapFn = () => {
+  let even = true;
+  return part => {
+    const cls = even ? 'even' : 'odd';
+    even = !even;
+    return `<span class="${cls}">${part}</span>`;
+  };
+};

package/src/natural-search.mjs

@@ -0,0 +1,32 @@
+/**
+ * Natural Search Algorithm by gkucmierz
+ * Mathematically finds the exponential boundary and binary searches bounds for a conditional function.
+ * Useful for finding bounds in sigmoidal functions without known boundaries.
+ * @param {Function} cond - The condition evaluator function.
+ * @param {Boolean} [retFirstTrue=true] - If true, returns the first match bounding condition true.
+ * @returns {Number} The optimized integer step boundary that satisfies the condition structure.
+ */
+export const naturalSearch = (cond, retFirstTrue = true) => {
+  let min = 1;
+  let max = 1;
+  while(1) {
+    const stop = cond(max);
+    if (stop) break;
+    min = max;
+    max *= 2;
+  }
+  let mid;
+  while (1) {
+    mid = Math.floor((min + max) / 2);
+    const stop = cond(mid);
+    if (stop) {
+      max = mid;
+    } else {
+      min = mid;
+    }
+    const diff = max - min;
+    if (max - min <= 1) {
+      return retFirstTrue ? max : min;
+    }
+  }
+};