@gkucmierz/utils 1.24.0 → 1.26.0

package/package-lock.json

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

package/package.json

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

package/spec/Trie.spec.mjs

@@ -0,0 +1,36 @@
+
+import {
+  Trie,
+} from '../src/Trie.mjs';
+
+describe('Trie', () => {
+  it('check empty', () => {
+    const trie = Trie();
+    expect(trie.has('')).toBe(false);
+    expect(trie.has('abc')).toBe(false);
+  });
+
+  it('init data', () => {
+    const trie = Trie(['abc', '']);
+    expect(trie.has('')).toBe(true);
+    expect(trie.has('abc')).toBe(true);
+  });
+
+  it('add/readd data', () => {
+    const trie = Trie();
+    expect(trie.has('')).toBe(false);
+    expect(trie.add('')).toBe(true);
+    expect(trie.has('')).toBe(true);
+    expect(trie.add('')).toBe(false);
+  });
+
+  it('list data', () => {
+    const trie = Trie(['abc', '', 'abcdef', 'xyz']);
+    const abc = ['abc', 'abcdef'];
+    expect(trie.get('a')).toEqual(abc);
+    expect(trie.get('ab')).toEqual(abc);
+    expect(trie.get('abc')).toEqual(abc);
+    expect(trie.get('aa')).toEqual([]);
+    expect(trie.get('')).toEqual(['', 'abc', 'abcdef', 'xyz']);
+  });
+});

package/spec/binary-search.spec.mjs

@@ -1,6 +1,9 @@
 
 import {
   binarySearchArr,
+  binarySearchLE,
+  binarySearchGE,
+  binarySearchRangeIncl,
 } from '../src/binary-search.mjs';
 
 describe('binarySearchArr', () => {
@@ -13,3 +16,76 @@ describe('binarySearchArr', () => {
     expect(binarySearchArr([1, 2, 3, 4], 5)).toBe(-1);
   });
 });
+
+describe('binarySearchLE', () => {
+  it('mid group', () => {
+    const arr = [0,1,2,2,3];
+    expect(binarySearchLE(arr, -100)).toBe(-1);
+    expect(binarySearchLE(arr, 0)).toBe(0);
+    expect(binarySearchLE(arr, 1)).toBe(1);
+    expect(binarySearchLE(arr, 2)).toBe(3);
+    expect(binarySearchLE(arr, 3)).toBe(4);
+    expect(binarySearchLE(arr, 100)).toBe(4);
+  });
+
+  it('begin group', () => {
+    const arr = [2,2,3];
+    expect(binarySearchLE(arr, -100)).toBe(-1);
+    expect(binarySearchLE(arr, 2)).toBe(1);
+    expect(binarySearchLE(arr, 3)).toBe(2);
+    expect(binarySearchLE(arr, 100)).toBe(2);
+  });
+
+  it('end group', () => {
+    const arr = [1,2,2];
+    expect(binarySearchLE(arr, -100)).toBe(-1);
+    expect(binarySearchLE(arr, 1)).toBe(0);
+    expect(binarySearchLE(arr, 2)).toBe(2);
+    expect(binarySearchLE(arr, 100)).toBe(2);
+  });
+});
+
+describe('binarySearchGE', () => {
+  it('mid group', () => {
+    const arr = [0,1,2,2,3];
+    expect(binarySearchGE(arr, -100)).toBe(0);
+    expect(binarySearchGE(arr, 0)).toBe(0);
+    expect(binarySearchGE(arr, 1)).toBe(1);
+    expect(binarySearchGE(arr, 2)).toBe(2);
+    expect(binarySearchGE(arr, 3)).toBe(4);
+    expect(binarySearchGE(arr, 100)).toBe(5);
+  });
+
+  it('begin group', () => {
+    const arr = [2,2,3];
+    expect(binarySearchGE(arr, -100)).toBe(0);
+    expect(binarySearchGE(arr, 2)).toBe(0);
+    expect(binarySearchGE(arr, 3)).toBe(2);
+    expect(binarySearchGE(arr, 100)).toBe(3);
+  });
+
+  it('end group', () => {
+    const arr = [1,2,2];
+    expect(binarySearchGE(arr, -100)).toBe(0);
+    expect(binarySearchGE(arr, 1)).toBe(0);
+    expect(binarySearchGE(arr, 2)).toBe(1);
+    expect(binarySearchGE(arr, 100)).toBe(3);
+  });
+});
+
+describe('binarySearchRangeIncl', () => {
+  it('basic', () => {
+    const arr = [0,1,1,3];
+    const check = [-10, ...arr, 10];
+    const expected = [
+      [0, -1],
+      [0, 0], [1, 2], [1, 2], [3, 3],
+      [4, 3],
+    ];
+
+    for (let i = 0; i < check.length; ++i) {
+      expect(binarySearchRangeIncl(arr, check[i])).toEqual(expected[i]);
+    }
+  });
+});
+

package/src/Trie.mjs

@@ -0,0 +1,45 @@
+
+export const Trie = (words = []) => {
+  const HAS = 0;
+  const MAP = 1;
+  const data = [false, new Map()];
+  const add = word => {
+    let node = data;
+    for (let i = 0; i < word.length; ++i) {
+      const char = word[i];
+      if (!node[MAP]) node[MAP] = new Map();
+      const child = node[MAP].get(char) ?? [false];
+      node[MAP].set(char, child);
+      node = child;
+    }
+    if (node[HAS]) return false;
+    node[HAS] = true;
+    return true;
+  };
+  const findNode = word => {
+    let node = data;
+    for (let i = 0; i < word.length; ++i) {
+      const char = word[i];
+      if (!node[MAP]?.has(char)) return [false];
+      node = node[MAP].get(char);
+    }
+    return node;
+  };
+  const has = word => findNode(word)[HAS];
+  const get = begin => {
+    const res = [];
+    const loop = (node, str = '') => {
+      if (!node) return;
+      if (node[HAS]) res.push(begin + str);
+      const map = node[MAP] || new Map();
+      [...map].map(([char, node]) => loop(node, str + char));
+    };
+    loop(findNode(begin));
+    return res;
+  };
+  words.map(word => add(word));
+  return {
+    add, has, get,
+    getData: () => data,
+  };
+};

package/src/binary-search.mjs

@@ -1,4 +1,6 @@
 
+// binary search array exact element
+// in sorted array
 export const binarySearchArr = (arr, target) => {
   let [a, b] = [0, arr.length];
   let lm;
@@ -17,3 +19,47 @@ export const binarySearchArr = (arr, target) => {
   }
   return -1;
 };
+
+// binary search array less or equal element
+export const binarySearchLE = (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;
+    }
+    if (lm === mid) return mid;
+    lm = mid;
+  }
+  return -1;
+};
+
+// binary search array greater or equal element
+export const binarySearchGE = (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) {
+      a = mid;
+    } else if (val >= target) {
+      b = mid;
+    }
+    if (lm === mid) return mid + 1;
+    lm = mid;
+  }
+  return 0;
+};
+
+// binary search for range of elements in array inclusive
+export const binarySearchRangeIncl = (arr, target) => {
+  return [
+    binarySearchGE(arr, target),
+    binarySearchLE(arr, target),
+  ];
+};

package/src/copy-case.mjs

@@ -1,5 +1,10 @@
 
-
+/**
+ * Copy the case of a string into another.
+ * @param {string} target String to change the case.
+ * @param {string} source Source of case pattern.
+ * @return {string} Converted string.
+ */
 export const copyCase = (word, from) => {
   const isLower = w => w.toLowerCase() === w;
   const isUpper = w => w.toUpperCase() === w;