@gkucmierz/utils 1.21.0 → 1.23.0

package/main.mjs

@@ -8,6 +8,9 @@ import {
 import {
   bijective2num, bijective2numBI, num2bijective, num2bijectiveBI
 } from './src/bijective-numeration.mjs'
+import {
+  bisectionSearchArr
+} from './src/bisection-search.mjs'
 import {
   egcd
 } from './src/egcd.mjs'
@@ -35,6 +38,9 @@ import {
 import {
   ListNode
 } from './src/list-node.mjs'
+import {
+  matrixAsArray
+} from './src/matrix.mjs'
 import {
   memoize
 } from './src/memoize.mjs'
@@ -60,6 +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/egcd.mjs';
 export * from './src/factors.mjs';
 export * from './src/gcd.mjs';
@@ -69,6 +76,7 @@ export * from './src/heap.mjs';
 export * from './src/herons-formula.mjs';
 export * from './src/lcm.mjs';
 export * from './src/list-node.mjs';
+export * from './src/matrix.mjs';
 export * from './src/memoize.mjs';
 export * from './src/mod.mjs';
 export * from './src/phi.mjs';
@@ -78,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, egcd, factors, factorsBI, gcd, gcdBI, getType, gpn, gpnBI, Heap, heronsFormula, heronsFormulaBI, lcm, lcmBI, ListNode, memoize, mod, modBI, phi, phiBI, powMod, powModBI, array2range, range2array, squareRoot, squareRootBI, tonelliShanksBI
+  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
 ];

package/package-lock.json

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

package/package.json

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

package/spec/bisection-search.spec.mjs

@@ -0,0 +1,15 @@
+
+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);
+  });
+});

package/spec/list-node.spec.mjs

@@ -24,4 +24,10 @@ describe('ListNode', () => {
     const arr = [1, 2, 3, 4, 5];
     expect(ListNode.fromArr(arr).toArr()).toEqual(arr);
   });
+
+  it('cyclic reference', () => {
+    const node = ListNode.fromArr([1, 2]);
+    node.next.next = node;
+    expect(() => node.toArr()).toThrow(new Error('Cyclic reference detected'));
+  });
 });

package/spec/matrix.spec.mjs

@@ -0,0 +1,19 @@
+
+import {
+  matrixAsArray,
+} from '../src/matrix.mjs';
+
+describe('matrix', () => {
+  it('matrixAsArray', () => {
+    const m = [
+      [1, 2],
+      [3, 4],
+    ];
+    const arr = matrixAsArray(m);
+    expect(arr.length).toBe(4);
+    expect(arr[0]).toBe(1);
+    expect(arr[1]).toBe(2);
+    expect(arr[2]).toBe(3);
+    expect(arr[3]).toBe(4);
+  });
+});

package/src/bisection-search.mjs

@@ -0,0 +1,19 @@
+
+export const bisectionSearchArr = (arr, target) => {
+  let [a, b] = [0, arr.length];
+  let lm;
+  while (b - a > 0) {
+    const mid = (a + b) / 2 | 0;
+    const val = arr[mid];
+    if (target < val) {
+      b = mid;
+    } else if (val < target) {
+      a = mid;
+    } else {
+      return mid;
+    }
+    if (lm === mid) break;
+    lm = mid;
+  }
+  return -1;
+};

package/src/list-node.mjs

@@ -9,7 +9,10 @@ export class ListNode {
   toArr() {
     const ret = [];
     let node = this;
+    const set = new Set();
     while (node) {
+      if (set.has(node)) throw Error('Cyclic reference detected');
+      set.add(node);
       ret.push(node.val);
       node = node.next;
     }

package/src/matrix.mjs

@@ -0,0 +1,17 @@
+
+
+// represent matrix using array using Proxy
+// todo: iterator can be added
+
+export const matrixAsArray = matrix => {
+  const [h, w] = [matrix.length, matrix[0].length];
+  return new Proxy([], {
+    get(target, prop, receiver) {
+      if (prop === 'length') return h * w;
+      const idx = +prop;
+      const col = idx % w;
+      const row = (idx - col) / w;
+      return matrix[row][col];
+    }
+  });
+};