@gkucmierz/utils 1.26.0 → 1.28.0

package/package-lock.json

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

package/package.json

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

package/spec/Trie.spec.mjs

@@ -33,4 +33,37 @@ describe('Trie', () => {
     expect(trie.get('aa')).toEqual([]);
     expect(trie.get('')).toEqual(['', 'abc', 'abcdef', 'xyz']);
   });
+
+  it('remove node', () => {
+    const trie = Trie(['a', 'ab', 'abc']);
+    
+    expect(trie.has('abc')).toEqual(true);
+    expect(trie.remove('abc')).toEqual(true);
+    expect(trie.remove('abc')).toEqual(false);
+    expect(trie.has('abc')).toEqual(false);
+
+    expect(trie.has('ab')).toEqual(true);
+    expect(trie.remove('ab')).toEqual(true);
+    expect(trie.remove('ab')).toEqual(false);
+    expect(trie.has('ab')).toEqual(false);
+
+    expect(trie.has('a')).toEqual(true);
+    expect(trie.remove('a')).toEqual(true);
+    expect(trie.remove('a')).toEqual(false);
+    expect(trie.has('a')).toEqual(false);
+  });
+
+  it('keep child node after parent removal', () => {
+    const trie = Trie(['a', 'abc']);
+
+    expect(trie.has('a')).toEqual(true);
+    expect(trie.remove('a')).toEqual(true);
+    expect(trie.remove('a')).toEqual(false);
+    expect(trie.has('a')).toEqual(false);
+
+    expect(trie.has('abc')).toEqual(true);
+    expect(trie.remove('abc')).toEqual(true);
+    expect(trie.remove('abc')).toEqual(false);
+    expect(trie.has('abc')).toEqual(false);
+  })
 });

package/src/Trie.mjs

@@ -1,5 +1,7 @@
 
-export const Trie = (words = []) => {
+// stric = true - remove removes whole unused data structure
+// stric = false - quick remove (data structure can grow fast)
+export const Trie = (words = [], strict = true) => {
   const HAS = 0;
   const MAP = 1;
   const data = [false, new Map()];
@@ -16,14 +18,45 @@ export const Trie = (words = []) => {
     node[HAS] = true;
     return true;
   };
-  const findNode = word => {
-    let node = data;
+  const listNodes = word => {
+    const nodes = [data];
     for (let i = 0; i < word.length; ++i) {
+      const node = nodes.at(-1);
       const char = word[i];
-      if (!node[MAP]?.has(char)) return [false];
-      node = node[MAP].get(char);
+      if (!node[MAP]?.has(char)) {
+        nodes.push([false]);
+        break;
+      }
+      nodes.push(node[MAP].get(char));
+    }
+    return nodes;
+  };
+  const findNode = word => {
+    return listNodes(word).at(-1);
+  };
+  const remove = word => {
+    const nodes = listNodes(word);
+    const rev = nodes.reverse();
+    const removed = rev.at(0)[HAS];
+    rev.at(0)[HAS] = false;
+    if (!strict) return removed;
+    for (let i = 0; i < rev.length; ++i) {
+      const node = rev[i];
+      const first = i === 0;
+      const noMap = !node[MAP];
+      const size1 = node[MAP]?.size <= 1;
+      if (first) {
+        if (node[MAP]) break;
+      } else {
+        if (node[MAP]?.size <= 1) {
+          delete node[MAP];
+        } else {
+          break;
+        }
+      }
+      if (node[HAS]) break;
     }
-    return node;
+    return removed;
   };
   const has = word => findNode(word)[HAS];
   const get = begin => {
@@ -39,7 +72,7 @@ export const Trie = (words = []) => {
   };
   words.map(word => add(word));
   return {
-    add, has, get,
+    add, has, get, remove,
     getData: () => data,
   };
 };

package/src/binary-search.mjs

@@ -63,3 +63,39 @@ export const binarySearchRangeIncl = (arr, target) => {
     binarySearchLE(arr, target),
   ];
 };
+
+// binary search array less element
+const binarySearchL = (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 element
+const binarySearchG = (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;
+};