test name | time taken (ms) | executions per sec | sample deviation |
---|---|---|---|
10,000 add randomly | 118.62 | 8.43 | 0.00 |
10,000 add & delete randomly | 179.74 | 5.56 | 0.00 |
10,000 addMany | 154.34 | 6.48 | 0.04 |
10,000 get | 50.53 | 19.79 | 0.00 |
# data-structure-typed ![npm](https://img.shields.io/npm/v/data-structure-typed) ![npm](https://img.shields.io/npm/dm/data-structure-typed) ![npm package minimized gzipped size (select exports)](https://img.shields.io/bundlejs/size/data-structure-typed) ![GitHub top language](https://img.shields.io/github/languages/top/zrwusa/data-structure-typed) ![GITHUB Star](https://img.shields.io/github/stars/zrwusa/data-structure-typed) ![eslint](https://aleen42.github.io/badges/src/eslint.svg) ![NPM](https://img.shields.io/npm/l/data-structure-typed) [//]: # (![npm bundle size](https://img.shields.io/bundlephobia/min/data-structure-typed))
## Why Do you envy C++ with [STL]() (std::), Python with [collections](), and Java with [java.util]() ? Well, no need to envy anymore! JavaScript and TypeScript now have [data-structure-typed]().**`Benchmark`** compared with C++ STL. **`API standards`** aligned with ES6 and Java. **`Usability`** is comparable to Python [//]: # (![Branches](https://img.shields.io/badge/branches-55.47%25-red.svg?style=flat)) [//]: # (![Statements](https://img.shields.io/badge/statements-67%25-red.svg?style=flat)) [//]: # (![Functions](https://img.shields.io/badge/functions-66.38%25-red.svg?style=flat)) [//]: # (![Lines](https://img.shields.io/badge/lines-68.6%25-red.svg?style=flat)) ### We provide data structures that are not available in JS/TS Heap, Binary Tree, RedBlack Tree, Linked List, Deque, Trie, Directed Graph, Undirected Graph, BST, AVL Tree, Priority Queue, Queue, Tree Multiset. ### Performance surpasses that of native JS/TSMethod | Time Taken (ms) | Scale | Belongs To |
---|---|---|---|
Queue.push & shift | 5.83 | 100,000 | data-structure-typed |
Array.push & shift | 2829.59 | 100,000 | Native JS |
Deque.unshift & shift | 2.44 | 100,000 | data-structure-typed |
Array.unshift & shift | 4750.37 | 100,000 | Native JS |
HashMap.set | 122.51 | 1,000,000 | data-structure-typed |
Map.set | 223.80 | 1,000,000 | Native JS |
Set.add | 185.06 | 1,000,000 | Native JS |
Data Structure | Unit Test | Performance Test | API Docs |
---|---|---|---|
Binary Tree | View | ||
Binary Search Tree (BST) | View | ||
AVL Tree | View | ||
Red Black Tree | View | ||
Tree Multimap | View | ||
Heap | View | ||
Priority Queue | View | ||
Max Priority Queue | View | ||
Min Priority Queue | View | ||
Trie | View | ||
Graph | View | ||
Directed Graph | View | ||
Undirected Graph | View | ||
Queue | View | ||
Deque | View | ||
Hash Map | View | ||
Linked List | View | ||
Singly Linked List | View | ||
Doubly Linked List | View | ||
Stack | View | ||
Segment Tree | View | ||
Binary Indexed Tree | View |
Data Structure Typed | C++ STL | java.util | Python collections |
---|---|---|---|
Heap<E> | - | - | heapq |
PriorityQueue<E> | priority_queue<T> | PriorityQueue<E> | - |
Deque<E> | deque<T> | ArrayDeque<E> | deque |
Queue<E> | queue<T> | Queue<E> | - |
HashMap<K, V> | unordered_map<K, V> | HashMap<K, V> | defaultdict |
DoublyLinkedList<E> | list<T> | LinkedList<E> | - |
SinglyLinkedList<E> | - | - | - |
BinaryTree<K, V> | - | - | - |
BST<K, V> | - | - | - |
RedBlackTree<E> | set<T> | TreeSet<E> | - |
RedBlackTree<K, V> | map<K, V> | TreeMap<K, V> | - |
TreeMultimap<K, V> | multimap<K, V> | - | - |
TreeMultimap<E> | multiset<T> | - | - |
Trie | - | - | - |
DirectedGraph<V, E> | - | - | - |
UndirectedGraph<V, E> | - | - | - |
PriorityQueue<E> | priority_queue<T> | PriorityQueue<E> | - |
Array<E> | vector<T> | ArrayList<E> | list |
Stack<E> | stack<T> | Stack<E> | - |
HashMap<E> | unordered_set<T> | HashSet<E> | set |
- | unordered_multiset | - | Counter |
LinkedHashMap<K, V> | - | LinkedHashMap<K, V> | OrderedDict |
- | unordered_multimap<K, V> | - | - |
- | bitset<N> | - | - |
Algorithm | Function Description | Iteration Type |
---|---|---|
Binary Tree DFS | Traverse a binary tree in a depth-first manner, starting from the root node, first visiting the left subtree, and then the right subtree, using recursion. | Recursion + Iteration |
Binary Tree BFS | Traverse a binary tree in a breadth-first manner, starting from the root node, visiting nodes level by level from left to right. | Iteration |
Graph DFS | Traverse a graph in a depth-first manner, starting from a given node, exploring along one path as deeply as possible, and backtracking to explore other paths. Used for finding connected components, paths, etc. | Recursion + Iteration |
Binary Tree Morris | Morris traversal is an in-order traversal algorithm for binary trees with O(1) space complexity. It allows tree traversal without additional stack or recursion. | Iteration |
Graph BFS | Traverse a graph in a breadth-first manner, starting from a given node, first visiting nodes directly connected to the starting node, and then expanding level by level. Used for finding shortest paths, etc. | Recursion + Iteration |
Graph Tarjan's Algorithm | Find strongly connected components in a graph, typically implemented using depth-first search. | Recursion |
Graph Bellman-Ford Algorithm | Finding the shortest paths from a single source, can handle negative weight edges | Iteration |
Graph Dijkstra's Algorithm | Finding the shortest paths from a single source, cannot handle negative weight edges | Iteration |
Graph Floyd-Warshall Algorithm | Finding the shortest paths between all pairs of nodes | Iteration |
Graph getCycles | Find all cycles in a graph or detect the presence of cycles. | Recursion |
Graph getCutVertexes | Find cut vertices in a graph, which are nodes that, when removed, increase the number of connected components in the graph. | Recursion |
Graph getSCCs | Find strongly connected components in a graph, which are subgraphs where any two nodes can reach each other. | Recursion |
Graph getBridges | Find bridges in a graph, which are edges that, when removed, increase the number of connected components in the graph. | Recursion |
Graph topologicalSort | Perform topological sorting on a directed acyclic graph (DAG) to find a linear order of nodes such that all directed edges go from earlier nodes to later nodes. | Recursion |
Principle | Description |
---|---|
Practicality | Follows ES6 and ESNext standards, offering unified and considerate optional parameters, and simplifies method names. |
Extensibility | Adheres to OOP (Object-Oriented Programming) principles, allowing inheritance for all data structures. |
Modularization | Includes data structure modularization and independent NPM packages. |
Efficiency | All methods provide time and space complexity, comparable to native JS performance. |
Maintainability | Follows open-source community development standards, complete documentation, continuous integration, and adheres to TDD (Test-Driven Development) patterns. |
Testability | Automated and customized unit testing, performance testing, and integration testing. |
Portability | Plans for porting to Java, Python, and C++, currently achieved to 80%. |
Reusability | Fully decoupled, minimized side effects, and adheres to OOP. |
Security | Carefully designed security for member variables and methods. Read-write separation. Data structure software does not need to consider other security aspects. |
Scalability | Data structure software does not involve load issues. |
test name | time taken (ms) | executions per sec | sample deviation |
---|---|---|---|
10,000 add randomly | 118.62 | 8.43 | 0.00 |
10,000 add & delete randomly | 179.74 | 5.56 | 0.00 |
10,000 addMany | 154.34 | 6.48 | 0.04 |
10,000 get | 50.53 | 19.79 | 0.00 |
test name | time taken (ms) | executions per sec | sample deviation |
---|---|---|---|
100,000 add | 90.63 | 11.03 | 0.01 |
100,000 add & delete randomly | 225.64 | 4.43 | 0.01 |
100,000 getNode | 174.39 | 5.73 | 0.00 |
100,000 add & iterator | 120.94 | 8.27 | 0.02 |
test name | time taken (ms) | executions per sec | sample deviation |
---|---|---|---|
1,000 addVertex | 0.10 | 9850.83 | 1.41e-6 |
1,000 addEdge | 6.21 | 160.97 | 2.65e-4 |
1,000 getVertex | 0.05 | 1.91e+4 | 2.18e-5 |
1,000 getEdge | 26.38 | 37.90 | 0.00 |
tarjan | 233.90 | 4.28 | 0.02 |
tarjan all | 7008.22 | 0.14 | 0.34 |
topologicalSort | 206.12 | 4.85 | 0.02 |
test name | time taken (ms) | executions per sec | sample deviation |
---|---|---|---|
1,000,000 set | 129.16 | 7.74 | 0.05 |
Native Map 1,000,000 set | 230.98 | 4.33 | 0.05 |
Native Set 1,000,000 add | 201.94 | 4.95 | 0.05 |
1,000,000 set & get | 132.13 | 7.57 | 0.03 |
Native Map 1,000,000 set & get | 317.16 | 3.15 | 0.06 |
Native Set 1,000,000 add & has | 229.56 | 4.36 | 0.06 |
1,000,000 ObjKey set & get | 323.02 | 3.10 | 0.04 |
Native Map 1,000,000 ObjKey set & get | 301.07 | 3.32 | 0.04 |
Native Set 1,000,000 ObjKey add & has | 282.01 | 3.55 | 0.04 |
test name | time taken (ms) | executions per sec | sample deviation |
---|---|---|---|
100,000 add & poll | 27.32 | 36.61 | 9.27e-4 |
100,000 add & dfs | 33.83 | 29.56 | 3.94e-4 |
10,000 fib add & pop | 353.37 | 2.83 | 0.00 |
test name | time taken (ms) | executions per sec | sample deviation |
---|---|---|---|
1,000,000 push | 220.80 | 4.53 | 0.02 |
1,000,000 unshift | 235.94 | 4.24 | 0.06 |
1,000,000 unshift & shift | 180.11 | 5.55 | 0.04 |
1,000,000 addBefore | 335.72 | 2.98 | 0.11 |
test name | time taken (ms) | executions per sec | sample deviation |
---|---|---|---|
1,000,000 push & shift | 217.29 | 4.60 | 0.06 |
10,000 push & pop | 223.41 | 4.48 | 0.02 |
10,000 addBefore | 253.79 | 3.94 | 0.01 |
test name | time taken (ms) | executions per sec | sample deviation |
---|---|---|---|
100,000 add & poll | 81.55 | 12.26 | 0.01 |
test name | time taken (ms) | executions per sec | sample deviation |
---|---|---|---|
1,000,000 push | 14.14 | 70.71 | 4.71e-4 |
1,000,000 push & pop | 29.75 | 33.61 | 0.01 |
100,000 push & shift | 3.06 | 326.93 | 0.00 |
Native Array 100,000 push & shift | 2211.02 | 0.45 | 0.05 |
100,000 unshift & shift | 2.23 | 447.63 | 3.63e-4 |
Native Array 100,000 unshift & shift | 4586.53 | 0.22 | 0.86 |
test name | time taken (ms) | executions per sec | sample deviation |
---|---|---|---|
1,000,000 push | 48.44 | 20.65 | 0.01 |
100,000 push & shift | 5.28 | 189.27 | 6.59e-4 |
Native Array 100,000 push & shift | 2335.96 | 0.43 | 0.14 |
Native Array 100,000 push & pop | 4.48 | 223.08 | 5.56e-4 |
test name | time taken (ms) | executions per sec | sample deviation |
---|---|---|---|
1,000,000 push | 45.61 | 21.93 | 0.01 |
1,000,000 push & pop | 50.96 | 19.62 | 0.01 |
test name | time taken (ms) | executions per sec | sample deviation |
---|---|---|---|
100,000 push | 58.40 | 17.12 | 0.02 |
100,000 getWords | 99.70 | 10.03 | 0.01 |