@gkucmierz/utils 1.29.1 → 1.30.0

package/main.mjs

@@ -71,6 +71,9 @@ 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';
@@ -96,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, 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
+  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.29.1",
+  "version": "1.30.0",
   "description": "Usefull functions for solving programming tasks",
   "keywords": [
     "utils",

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;
+    }
+  }
+};