data-structure-typed 1.32.2 → 1.32.9

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "data-structure-typed",
-  "version": "1.32.2",
+  "version": "1.32.9",
   "description": "Data Structures of Javascript & TypeScript. Binary Tree, BST, Graph, Heap, Priority Queue, Linked List, Queue, Deque, Stack, AVL Tree, Tree Multiset, Trie, Directed Graph, Undirected Graph, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue.",
   "main": "dist/index.js",
   "module": "lib/index.js",
@@ -27,26 +27,21 @@
     "type": "git",
     "url": "git+https://github.com/zrwusa/data-structure-typed.git"
   },
-  "targets": {
-    "default": {
-      "context": "node",
-      "includeNodeModules": true,
-      "engines": {
-        "node": "19"
-      }
-    }
-  },
-  "engines": {
-    "node": "19"
-  },
   "keywords": [
     "data",
     "structure",
     "structures",
     "data structure",
+    "datastructure",
     "data-structure",
     "data structures",
+    "datastructures",
     "data-structures",
+    "in data structures",
+    "in data structure",
+    "DataStructure",
+    "DataStructures",
+
     "binary",
     "depth",
     "breadth",
@@ -74,49 +69,83 @@
     "ts",
     "javascript",
     "typscript",
+
+    "Node.js",
+    "CommonJS",
+    "ES6",
+    "UMD",
+    "esmodule",
+
+    "java.util",
+    "c++ std",
+    "Python collections",
+    "System.Collections.Generic",
+    "STD",
+    "std",
+    "util",
+    "Collections",
+    "collections",
+    "collection",
+    "util",
     "sort",
     "algorithm",
     "binary search tree",
+    "binarysearchtree",
     "binary-search-tree",
     "binary tree",
+    "binarytree",
     "binary-tree",
     "bst",
     "BST",
     "avl tree",
+    "avltree",
     "avl-tree",
     "tree multiset",
+    "treemultiset",
     "tree-multiset",
     "binary indexed tree",
+    "binaryindexedtree",
     "binary-indexed-tree",
     "segment tree",
+    "segmenttree",
     "segment-tree",
     "trie",
     "prefix tree",
+    "prefixtree",
     "prefix-tree",
     "dfs",
     "DFS",
     "depth first Search",
+    "depthfirstSearch",
     "depth-first-Search",
     "bfs",
     "BFS",
     "breadth first search",
+    "breadthfirstsearch",
     "dfs iterative",
     "DFS Iterative",
     "recursive",
     "iterative",
     "directed graph",
+    "directedgraph",
     "directed-graph",
     "undirected graph",
+    "undirectedgraph",
     "undirected-graph",
     "min heap",
+    "minheap",
     "min-heap",
     "max heap",
+    "maxheap",
     "max-heap",
     "priority queue",
+    "priorityqueue",
     "priority-queue",
     "max priority queue",
+    "maxpriorityqueue",
     "max-priority-queue",
     "min priority queue",
+    "minpriorityqueue",
     "min-priority-queue",
     "array queue",
     "array-queue",
@@ -126,10 +155,13 @@
     "object deque",
     "array deque",
     "linked list",
+    "linkedlist",
     "linked-list",
     "singly linked list",
+    "singlylinkedlist",
     "singly-linked-list",
     "doubly linked list",
+    "doublylinkedlist",
     "doubly-linked-list",
     "morris",
     "Morris",
@@ -143,9 +175,7 @@
     "floyd-warshall",
     "tarjan",
     "Tarjan",
-    "Tarjan's",
-    "DataStructure",
-    "DataStructures"
+    "Tarjan's"
   ],
   "author": "Tyler Zeng zrwusa@gmail.com",
   "license": "MIT",
@@ -154,12 +184,14 @@
   },
   "homepage": "https://github.com/zrwusa/data-structure-typed#readme",
   "devDependencies": {
+    "@types/benchmark": "^2.1.3",
     "@types/jest": "^29.5.3",
     "@types/node": "^20.4.9",
     "@typescript-eslint/eslint-plugin": "^5.6.0",
     "@typescript-eslint/parser": "^5.11.0",
     "auto-changelog": "^2.4.0",
     "avl-tree-typed": "^1.31.0",
+    "benchmark": "^2.1.4",
     "binary-tree-typed": "^1.31.0",
     "bst-typed": "^1.31.0",
     "dependency-cruiser": "^13.1.2",

package/test/unit/data-structures/binary-tree/tree-multiset.test.ts

@@ -224,7 +224,7 @@ describe('TreeMultiset operations test', () => {
 
     expect(objTreeMultiset.has(6)).toBe(true);
 
-    const node6 = objTreeMultiset.get(6);
+    // const node6 = objTreeMultiset.get(6);
     // expect(node6 && objTreeMultiset.getHeight(node6)).toBe(2);
     // expect(node6 && objTreeMultiset.getDepth(node6)).toBe(3);
     //
@@ -403,3 +403,48 @@ describe('TreeMultiset operations test', () => {
     // expect(objTreeMultiset.count).toBe(5);
   });
 });
+
+describe('TreeMultiset Performance test', function () {
+  // const treeMS = new TreeMultiset<TreeMultisetNode<number>>();
+  // const inputSizes = [100]; // Adjust input sizes as needed
+  //
+  // // Define a function to calculate the expected O(n log n) time
+  // function expectedTime(n: number): number {
+  //   return n * Math.log(n);
+  // }
+
+  it(`Observe the time consumption of TreeMultiset.add fitting O(n log n)`, function () {
+
+    // // Create a benchmark suite
+    // const suite = new Benchmark.Suite();
+    // // Define a function to generate a random array of a given size
+    // function generateRandomArray(size: number): number[] {
+    //   const arr: number[] = [];
+    //   for (let i = 0; i < size; i++) {
+    //     arr.push(Math.floor(Math.random() * size));
+    //   }
+    //   return arr;
+    // }
+    // const inputArray = generateRandomArray(inputSizes[0]);
+    //
+    // suite.add(`TreeMultiset addMany (n=${inputSizes[0]})`, () => {
+    //   treeMS.addMany([...inputArray]);
+    // });
+    //
+    // // Run the benchmarks
+    // suite
+    //   .on('cycle', (event: any) => {
+    //     const benchmark = event.target;
+    //     const n = parseInt(benchmark.name.split('=')[1]);
+    //     const observedTime = benchmark.times.elapsed;
+    //     const expected = expectedTime(n);
+    //     console.log(`Input size (n): ${n}, Observed time: ${observedTime.toFixed(2)}ms, Expected time: ${expected.toFixed(2)}ms`);
+    //   })
+    //   .on('complete', () => {
+    //     console.log(`Benchmark (n=${inputSizes[0]}) completed.`);
+    //     done(); // Call done to indicate the test is complete
+    //   })
+    //   .run({async: true});
+  });
+
+});