@gkucmierz/utils 1.23.0 → 1.23.1

package/main.mjs

@@ -9,8 +9,8 @@ import {
   bijective2num, bijective2numBI, num2bijective, num2bijectiveBI
 } from './src/bijective-numeration.mjs'
 import {
-  bisectionSearchArr
-} from './src/bisection-search.mjs'
+  binarySearchArr
+} from './src/binary-search.mjs'
 import {
   egcd
 } from './src/egcd.mjs'
@@ -66,7 +66,7 @@ import {
 export * from './src/SetCnt.mjs';
 export * from './src/base64.mjs';
 export * from './src/bijective-numeration.mjs';
-export * from './src/bisection-search.mjs';
+export * from './src/binary-search.mjs';
 export * from './src/egcd.mjs';
 export * from './src/factors.mjs';
 export * from './src/gcd.mjs';
@@ -86,5 +86,5 @@ export * from './src/square-root.mjs';
 export * from './src/tonelli-shanks.mjs';
 
 export default [
-  SetCnt, fromBase64, fromBase64Url, toBase64, toBase64Url, bijective2num, bijective2numBI, num2bijective, num2bijectiveBI, bisectionSearchArr, 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, fromBase64, fromBase64Url, toBase64, toBase64Url, bijective2num, bijective2numBI, num2bijective, num2bijectiveBI, binarySearchArr, 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
 ];

package/package-lock.json

@@ -1,12 +1,12 @@
 {
   "name": "@gkucmierz/utils",
-  "version": "1.23.0",
+  "version": "1.23.1",
   "lockfileVersion": 2,
   "requires": true,
   "packages": {
     "": {
       "name": "@gkucmierz/utils",
-      "version": "1.23.0",
+      "version": "1.23.1",
       "license": "MIT",
       "devDependencies": {
         "husky": "^8.0.1",

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gkucmierz/utils",
-  "version": "1.23.0",
+  "version": "1.23.1",
   "description": "Usefull functions for solving programming tasks",
   "main": "main.mjs",
   "scripts": {

package/spec/binary-search.spec.mjs

@@ -0,0 +1,15 @@
+
+import {
+  binarySearchArr,
+} from '../src/binary-search.mjs';
+
+describe('binarySearchArr', () => {
+  it('few cases', () => {
+    expect(binarySearchArr([1, 2, 3, 4], 1)).toBe(0);
+    expect(binarySearchArr([1, 2, 3, 4], 2)).toBe(1);
+    expect(binarySearchArr([1, 2, 3, 4], 3)).toBe(2);
+    expect(binarySearchArr([1, 2, 3, 4], 4)).toBe(3);
+    expect(binarySearchArr([1, 2, 3, 4], 0)).toBe(-1);
+    expect(binarySearchArr([1, 2, 3, 4], 5)).toBe(-1);
+  });
+});

package/src/{bisection-search.mjs → binary-search.mjs}

@@ -1,5 +1,5 @@
 
-export const bisectionSearchArr = (arr, target) => {
+export const binarySearchArr = (arr, target) => {
   let [a, b] = [0, arr.length];
   let lm;
   while (b - a > 0) {

package/src/matrix.mjs

@@ -1,6 +1,6 @@
 
 
-// represent matrix using array using Proxy
+// represent matrix as array using Proxy
 // todo: iterator can be added
 
 export const matrixAsArray = matrix => {

package/spec/bisection-search.spec.mjs

@@ -1,15 +0,0 @@
-
-import {
-  bisectionSearchArr,
-} from '../src/bisection-search.mjs';
-
-describe('bisectionSearchArr', () => {
-  it('few cases', () => {
-    expect(bisectionSearchArr([1, 2, 3, 4], 1)).toBe(0);
-    expect(bisectionSearchArr([1, 2, 3, 4], 2)).toBe(1);
-    expect(bisectionSearchArr([1, 2, 3, 4], 3)).toBe(2);
-    expect(bisectionSearchArr([1, 2, 3, 4], 4)).toBe(3);
-    expect(bisectionSearchArr([1, 2, 3, 4], 0)).toBe(-1);
-    expect(bisectionSearchArr([1, 2, 3, 4], 5)).toBe(-1);
-  });
-});