data-structure-typed 1.52.6 → 1.52.7

package/test/unit/data-structures/priority-queue/priority-queue.test.ts

@@ -86,8 +86,8 @@ describe('Priority Queue Performance Test', () => {
     // for (let i = 0; i < 10000; i++) {
     //   pq.pop();
     // }
-    isDebug && console.log(performance.now() - tS);
-    isDebug && console.log(pq.size);
+    if (isDebug) console.log(performance.now() - tS);
+    if (isDebug) console.log(pq.size);
     const cS = performance.now();
     const cpq = new CPriorityQueue();
 
@@ -98,7 +98,7 @@ describe('Priority Queue Performance Test', () => {
     // for (let i = 0; i < 10000; i++) {
     //   cpq.pop();
     // }
-    isDebug && console.log(performance.now() - cS);
-    isDebug && console.log(cpq.size());
+    if (isDebug) console.log(performance.now() - cS);
+    if (isDebug) console.log(cpq.size());
   });
 });

package/test/unit/data-structures/stack/stack.test.ts

@@ -18,6 +18,12 @@ describe('Stack', () => {
     expect(stack.size).toBe(3);
   });
 
+  it('should has and get', () => {
+    const stack = new Stack<number, { id: number; name: string }>([], { toElementFn: rawElement => rawElement.id });
+    expect(stack.has(1)).toBe(false);
+    expect(stack.size).toBe(0);
+  });
+
   it('should peek at the top element without removing it', () => {
     expect(stack.peek()).toBe(undefined);
     stack.push(1);

package/test/unit/unrestricted-interconversion.test.ts

@@ -48,61 +48,61 @@ const entries: [number, string][] = [
 describe('conversions', () => {
   it('Array to Queue', () => {
     const q = new Queue<number>(orgArr);
-    isDebug && q.print();
+    if (isDebug) q.print();
     expect([...q]).toEqual([6, 1, 2, 7, 5, 3, 4, 9, 8]);
   });
 
   it('Array to Deque', () => {
     const dq = new Deque<number>(orgArr);
-    isDebug && dq.print();
+    if (isDebug) dq.print();
     expect([...dq]).toEqual([6, 1, 2, 7, 5, 3, 4, 9, 8]);
   });
 
   it('Array to SinglyLinkedList', () => {
     const sl = new SinglyLinkedList<number>(orgArr);
-    isDebug && sl.print();
+    if (isDebug) sl.print();
     expect([...sl]).toEqual([6, 1, 2, 7, 5, 3, 4, 9, 8]);
   });
 
   it('Array to DoublyLinkedList', () => {
     const dl = new DoublyLinkedList<number>(orgArr);
-    isDebug && dl.print();
+    if (isDebug) dl.print();
     expect([...dl]).toEqual([6, 1, 2, 7, 5, 3, 4, 9, 8]);
   });
 
   it('Array to Stack', () => {
     const stack = new Stack<number>(orgArr);
-    isDebug && stack.print();
+    if (isDebug) stack.print();
     expect([...stack]).toEqual([6, 1, 2, 7, 5, 3, 4, 9, 8]);
   });
 
   it('Array to MinHeap', () => {
     const minHeap = new MinHeap<number>(orgArr);
-    isDebug && minHeap.print();
+    if (isDebug) minHeap.print();
     expect([...minHeap]).toEqual([1, 5, 2, 7, 6, 3, 4, 9, 8]);
   });
 
   it('Array to MaxHeap', () => {
     const maxHeap = new MaxHeap<number>(orgArr);
-    isDebug && maxHeap.print();
+    if (isDebug) maxHeap.print();
     expect([...maxHeap]).toEqual([9, 8, 4, 7, 5, 2, 3, 1, 6]);
   });
 
   it('Array to MinPriorityQueue', () => {
     const minPQ = new MinPriorityQueue<number>(orgArr);
-    isDebug && minPQ.print();
+    if (isDebug) minPQ.print();
     expect([...minPQ]).toEqual([1, 5, 2, 7, 6, 3, 4, 9, 8]);
   });
 
   it('Array to MaxPriorityQueue', () => {
     const maxPQ = new MaxPriorityQueue<number>(orgArr);
-    isDebug && maxPQ.print();
+    if (isDebug) maxPQ.print();
     expect([...maxPQ]).toEqual([9, 8, 4, 7, 5, 2, 3, 1, 6]);
   });
 
   it('Entry Array to BinaryTree', () => {
     const biTree = new BinaryTree<number>(entries);
-    isDebug && biTree.print();
+    if (isDebug) biTree.print();
     expect([...biTree]).toEqual([
       [9, '9'],
       [7, '7'],
@@ -119,7 +119,7 @@ describe('conversions', () => {
   it('Entry Array to BST', () => {
     const bst = new BST<number>(entries);
     expect(bst.size).toBe(9);
-    isDebug && bst.print();
+    if (isDebug) bst.print();
     expect([...bst]).toEqual([
       [1, '1'],
       [2, '2'],
@@ -136,7 +136,7 @@ describe('conversions', () => {
   it('Entry Array to RedBlackTree', () => {
     const rbTree = new RedBlackTree<number>(entries);
     expect(rbTree.size).toBe(9);
-    isDebug && rbTree.print();
+    if (isDebug) rbTree.print();
     expect([...rbTree]).toEqual([
       [1, '1'],
       [2, '2'],
@@ -153,7 +153,7 @@ describe('conversions', () => {
   it('Entry Array to AVLTree', () => {
     const avl = new AVLTree<number>(entries);
     expect(avl.size).toBe(9);
-    isDebug && avl.print();
+    if (isDebug) avl.print();
     expect([...avl]).toEqual([
       [1, '1'],
       [2, '2'],
@@ -170,7 +170,7 @@ describe('conversions', () => {
   it('Entry Array to TreeMultiMap', () => {
     const treeMulti = new TreeMultiMap<number>(entries);
     expect(treeMulti.size).toBe(9);
-    isDebug && treeMulti.print();
+    if (isDebug) treeMulti.print();
     expect([...treeMulti]).toEqual([
       [1, '1'],
       [2, '2'],
@@ -186,10 +186,10 @@ describe('conversions', () => {
 
   it('HashMap to RedBlackTree', () => {
     const hm = new HashMap(entries);
-    isDebug && hm.print();
+    if (isDebug) hm.print();
     const rbTree = new RedBlackTree<number>(hm);
     expect(rbTree.size).toBe(9);
-    isDebug && rbTree.print();
+    if (isDebug) rbTree.print();
     expect([...rbTree]).toEqual([
       [1, '1'],
       [2, '2'],
@@ -205,10 +205,10 @@ describe('conversions', () => {
 
   it('PriorityQueue to BST', () => {
     const pq = new MinPriorityQueue(orgArr);
-    isDebug && pq.print();
+    if (isDebug) pq.print();
     const bst = new BST<number>(pq);
     expect(bst.size).toBe(9);
-    isDebug && bst.print();
+    if (isDebug) bst.print();
     expect([...bst]).toEqual([
       [1, undefined],
       [2, undefined],
@@ -224,10 +224,10 @@ describe('conversions', () => {
 
   it('Deque to RedBlackTree', () => {
     const dq = new Deque(orgArr);
-    isDebug && dq.print();
+    if (isDebug) dq.print();
     const rbTree = new RedBlackTree<number>(dq);
     expect(rbTree.size).toBe(9);
-    isDebug && rbTree.print();
+    if (isDebug) rbTree.print();
     expect([...rbTree]).toEqual([
       [1, undefined],
       [2, undefined],
@@ -244,12 +244,12 @@ describe('conversions', () => {
   it('Trie to Heap to Deque', () => {
     const trie = new Trie(orgStrArr);
     expect(trie.size).toBe(10);
-    isDebug && trie.print();
+    if (isDebug) trie.print();
     const heap = new Heap<string>(trie, {
       comparator: (a, b) => Number(a) - Number(b)
     });
     expect(heap.size).toBe(10);
-    isDebug && heap.print();
+    if (isDebug) heap.print();
     expect([...heap]).toEqual([
       'transmit',
       'trace',
@@ -264,7 +264,7 @@ describe('conversions', () => {
     ]);
     const dq = new Deque<string>(heap);
     expect(dq.size).toBe(10);
-    isDebug && dq.print();
+    if (isDebug) dq.print();
     expect([...dq]).toEqual([
       'transmit',
       'trace',
@@ -280,7 +280,7 @@ describe('conversions', () => {
     const entries = dq.map((el, i) => <[number, string]>[i, el]);
     const avl = new AVLTree<number, string>(entries);
     expect(avl.size).toBe(10);
-    isDebug && avl.print();
+    if (isDebug) avl.print();
     expect([...avl]).toEqual([
       [0, 'transmit'],
       [1, 'trace'],

package/test/utils/big-o.ts

@@ -158,12 +158,12 @@ export function logBigOMetricsWrap<F extends AnyFunction>(fn: F, args: Parameter
     methodLog.push([runTime, maxDataSize]);
 
     if (methodLog.length >= 20) {
-      isDebug && console.log('triggered', methodName, methodLog);
+      if (isDebug) console.log('triggered', methodName, methodLog);
       const bigO = estimateBigO(
         methodLog.map(([runTime]) => runTime),
         methodLog.map(([runTime]) => runTime)
       );
-      isDebug && console.log(`Estimated Big O: ${bigO}`);
+      if (isDebug) console.log(`Estimated Big O: ${bigO}`);
       methodLogs.delete(methodName);
     }
   }
@@ -192,12 +192,13 @@ export function logBigOMetrics(target: any, propertyKey: string, descriptor: Pro
       methodLog.push([runTime, maxDataSize]);
 
       if (methodLog.length >= 20) {
-        isDebug && console.log('triggered', methodName, methodLog);
+        if (isDebug) console.log('triggered', methodName, methodLog);
         const bigO = estimateBigO(
           methodLog.map(([runTime]) => runTime),
           methodLog.map(([runTime]) => runTime)
         );
-        isDebug && console.log(`Estimated Big O: ${bigO}`);
+
+        if (isDebug) console.log(`Estimated Big O: ${bigO}`);
         methodLogs.delete(methodName);
       }
     }

package/.eslintrc.js

@@ -1,64 +0,0 @@
-module.exports = {
-  "parser": "@typescript-eslint/parser",
-  "plugins": [
-    "@typescript-eslint",
-    "eslint-plugin-import"
-  ],
-  "extends": [
-    "plugin:@typescript-eslint/recommended",
-    "prettier"
-  ],
-  "ignorePatterns": ["lib/", "dist/", "umd/", "coverage/", "docs/"],
-  "rules": {
-    "import/no-anonymous-default-export": "off",
-    "@typescript-eslint/no-unused-vars": "warn",
-    "@typescript-eslint/ban-ts-comment": "off",
-    "@typescript-eslint/no-explicit-any": "off",
-    "@typescript-eslint/no-var-requires": "off",
-    "@typescript-eslint/no-non-null-assertion": "off",
-    "lines-around-comment": [
-      "warn",
-      {
-        "beforeLineComment": false,
-        "beforeBlockComment": true,
-        "allowBlockStart": true,
-        "allowClassStart": true,
-        "allowObjectStart": true,
-        "allowArrayStart": true
-      }
-    ],
-    "newline-before-return": "off",
-    "import/newline-after-import": [
-      "warn",
-      {
-        "count": 1
-      }
-    ],
-    "@typescript-eslint/ban-types": [
-      "error",
-      {
-        "extendDefaults": true,
-        "types": {
-          "{}": false
-        }
-      }
-    ],
-    // "brace-style": ["error", "1tbs", { "allowSingleLine": true }],
-    "object-curly-spacing": ["warn", "always"]
-  },
-  "settings": {
-    "import/parsers": {
-      "@typescript-eslint/parser": [
-        ".ts"
-      ]
-    },
-    "import/resolver": {
-      "typescript": {
-        "alwaysTryTypes": true,
-        "project": [
-          "./tsconfig.json"
-        ]
-      }
-    }
-  }
-}