@gkucmierz/utils 1.25.0 → 1.27.0

package/package-lock.json

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

package/package.json

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

package/spec/Trie.spec.mjs

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

@@ -0,0 +1,78 @@
+
+// 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()];
+  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 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)) {
+        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 removed;
+  };
+  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, remove,
+    getData: () => data,
+  };
+};