2023-09-22 03:20:33 +00:00
# Data Structure Typed
2023-11-10 15:50:57 +00:00
2023-11-09 12:48:06 +00:00
2023-10-10 09:22:18 +00:00
2023-11-10 15:50:57 +00:00
2023-10-10 09:22:18 +00:00
2023-11-10 15:50:57 +00:00
[//]: # ( )
2023-10-10 09:22:18 +00:00
2023-10-10 14:18:39 +00:00
Data Structures of Javascript & TypeScript.
2023-11-03 17:21:30 +00:00
Do you envy C++ with [STL](), Python with [collections](), and Java with [java.util]() ? Well, no need to envy anymore! JavaScript and TypeScript now have [data-structure-typed]().
2023-10-10 14:18:39 +00:00
Now you can use this library in Node.js and browser environments in CommonJS(require export.modules = ), ESModule(import export), Typescript(import export), UMD(var Queue = dataStructureTyped.Queue)
2023-09-22 02:40:12 +00:00
2023-10-05 02:37:42 +00:00
[//]: # ( )
[//]: # ( )
[//]: # ( )
[//]: # ( )
2023-09-22 03:20:33 +00:00
## Installation and Usage
2023-09-24 13:31:09 +00:00
2023-08-30 16:50:23 +00:00
### npm
2023-09-24 13:31:09 +00:00
2023-08-30 16:50:23 +00:00
```bash
2023-11-10 15:50:57 +00:00
npm i data-structure-typed
2023-08-30 16:50:23 +00:00
```
2023-09-24 13:31:09 +00:00
2023-08-28 12:04:43 +00:00
### yarn
2023-09-24 13:31:09 +00:00
2023-08-28 12:04:43 +00:00
```bash
2023-09-12 03:10:09 +00:00
yarn add data-structure-typed
2023-08-28 12:04:43 +00:00
```
2023-09-24 13:31:09 +00:00
2023-10-05 02:37:42 +00:00
```js
import {
BinaryTree, Graph, Queue, Stack, PriorityQueue, BST, Trie, DoublyLinkedList,
2023-11-08 01:26:43 +00:00
AVLTree, MinHeap, SinglyLinkedList, DirectedGraph, TreeMultimap,
2023-10-05 02:37:42 +00:00
DirectedVertex, AVLTreeNode
} from 'data-structure-typed';
```
2023-09-09 15:49:53 +00:00
### CDN
2023-09-24 13:31:09 +00:00
2023-11-08 12:25:02 +00:00
Copy the line below into the head tag in an HTML document.
2023-09-09 15:49:53 +00:00
```html
2023-10-27 14:30:52 +00:00
< script src = 'https://cdn.jsdelivr.net/npm/data-structure-typed/dist/umd/data-structure-typed.min.js' > < / script >
2023-09-09 15:49:53 +00:00
```
2023-09-24 13:31:09 +00:00
2023-11-08 12:25:02 +00:00
Copy the code below into the script tag of your HTML, and you're good to go with your development work.
2023-09-22 03:20:33 +00:00
```js
2023-10-05 02:37:42 +00:00
const {Heap} = dataStructureTyped;
2023-09-24 13:31:09 +00:00
const {
2023-10-05 02:37:42 +00:00
BinaryTree, Graph, Queue, Stack, PriorityQueue, BST, Trie, DoublyLinkedList,
2023-11-08 01:26:43 +00:00
AVLTree, MinHeap, SinglyLinkedList, DirectedGraph, TreeMultimap,
2023-10-05 02:37:42 +00:00
DirectedVertex, AVLTreeNode
2023-09-24 13:31:09 +00:00
} = dataStructureTyped;
2023-09-09 15:49:53 +00:00
```
2023-09-18 14:04:39 +00:00
2023-11-08 01:26:43 +00:00
2023-09-18 14:04:39 +00:00
2023-09-09 15:49:53 +00:00
2023-08-28 12:04:43 +00:00
2023-11-08 12:25:02 +00:00
## Code Snippets
2023-09-24 13:31:09 +00:00
2023-08-28 12:04:43 +00:00
### Binary Search Tree (BST) snippet
2023-09-24 13:31:09 +00:00
2023-08-28 12:04:43 +00:00
#### TS
2023-09-24 13:31:09 +00:00
2023-09-22 03:20:33 +00:00
```ts
2023-09-24 13:31:09 +00:00
import {BST, BSTNode} from 'data-structure-typed';
const bst = new BST();
bst.add(11);
bst.add(3);
bst.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]);
bst.size === 16; // true
bst.has(6); // true
2023-11-08 12:25:02 +00:00
const node6 = bst.getNode(6); // BSTNode
2023-09-24 13:31:09 +00:00
bst.getHeight(6) === 2; // true
bst.getHeight() === 5; // true
bst.getDepth(6) === 3; // true
2023-11-08 12:25:02 +00:00
bst.getLeftMost()?.key === 1; // true
2023-09-24 13:31:09 +00:00
2023-10-28 07:58:48 +00:00
bst.delete(6);
2023-11-08 12:25:02 +00:00
bst.get(6); // undefined
2023-09-24 13:31:09 +00:00
bst.isAVLBalanced(); // true
2023-10-10 14:15:01 +00:00
bst.bfs()[0] === 11; // true
2023-09-24 13:31:09 +00:00
2023-11-08 12:25:02 +00:00
const objBST = new BST< {height: number, age: number}>();
objBST.add(11, { "name": "Pablo", "age": 15 });
objBST.add(3, { "name": "Kirk", "age": 1 });
objBST.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5], [
{ "name": "Alice", "age": 15 },
{ "name": "Bob", "age": 1 },
{ "name": "Charlie", "age": 8 },
{ "name": "David", "age": 13 },
{ "name": "Emma", "age": 16 },
{ "name": "Frank", "age": 2 },
{ "name": "Grace", "age": 6 },
{ "name": "Hannah", "age": 9 },
{ "name": "Isaac", "age": 12 },
{ "name": "Jack", "age": 14 },
{ "name": "Katie", "age": 4 },
{ "name": "Liam", "age": 7 },
{ "name": "Mia", "age": 10 },
{ "name": "Noah", "age": 5 }
]
);
2023-09-24 13:31:09 +00:00
2023-10-28 07:58:48 +00:00
objBST.delete(11);
2023-08-28 12:04:43 +00:00
```
2023-09-24 13:31:09 +00:00
2023-08-28 12:04:43 +00:00
#### JS
2023-09-24 13:31:09 +00:00
2023-09-22 03:20:33 +00:00
```js
2023-09-24 13:31:09 +00:00
const {BST, BSTNode} = require('data-structure-typed');
const bst = new BST();
bst.add(11);
bst.add(3);
bst.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]);
2023-11-08 12:25:02 +00:00
bst.size === 16; // true
bst.has(6); // true
const node6 = bst.getNode(6);
bst.getHeight(6) === 2; // true
bst.getHeight() === 5; // true
bst.getDepth(6) === 3; // true
2023-09-24 13:31:09 +00:00
const leftMost = bst.getLeftMost();
2023-11-08 12:25:02 +00:00
leftMost?.key === 1; // true
2023-10-28 07:58:48 +00:00
bst.delete(6);
2023-11-08 12:25:02 +00:00
bst.get(6); // undefined
bst.isAVLBalanced(); // true or false
2023-10-10 14:15:01 +00:00
const bfsIDs = bst.bfs();
2023-11-08 12:25:02 +00:00
bfsIDs[0] === 11; // true
2023-09-24 13:31:09 +00:00
2023-08-28 12:04:43 +00:00
```
2023-09-20 03:39:24 +00:00
### AVLTree snippet
2023-09-24 13:31:09 +00:00
2023-09-20 03:39:24 +00:00
#### TS
2023-09-24 13:31:09 +00:00
2023-09-22 03:20:33 +00:00
```ts
import {AVLTree} from 'data-structure-typed';
const avlTree = new AVLTree();
avlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
avlTree.isAVLBalanced(); // true
2023-10-28 07:58:48 +00:00
avlTree.delete(10);
2023-09-22 03:20:33 +00:00
avlTree.isAVLBalanced(); // true
2023-09-20 03:39:24 +00:00
```
2023-09-24 13:31:09 +00:00
2023-09-20 03:39:24 +00:00
#### JS
2023-09-24 13:31:09 +00:00
2023-09-22 03:20:33 +00:00
```js
const {AVLTree} = require('data-structure-typed');
const avlTree = new AVLTree();
avlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
avlTree.isAVLBalanced(); // true
2023-10-28 07:58:48 +00:00
avlTree.delete(10);
2023-09-22 03:20:33 +00:00
avlTree.isAVLBalanced(); // true
2023-09-20 03:39:24 +00:00
```
2023-08-28 12:04:43 +00:00
### Directed Graph simple snippet
2023-09-24 13:31:09 +00:00
2023-08-28 12:04:43 +00:00
#### TS or JS
2023-09-24 13:31:09 +00:00
2023-09-22 03:20:33 +00:00
```ts
2023-08-28 12:04:43 +00:00
import {DirectedGraph} from 'data-structure-typed';
2023-09-22 03:20:33 +00:00
const graph = new DirectedGraph();
graph.addVertex('A');
graph.addVertex('B');
graph.hasVertex('A'); // true
graph.hasVertex('B'); // true
graph.hasVertex('C'); // false
graph.addEdge('A', 'B');
graph.hasEdge('A', 'B'); // true
graph.hasEdge('B', 'A'); // false
2023-10-28 07:58:48 +00:00
graph.deleteEdgeSrcToDest('A', 'B');
2023-09-22 03:20:33 +00:00
graph.hasEdge('A', 'B'); // false
graph.addVertex('C');
graph.addEdge('A', 'B');
graph.addEdge('B', 'C');
2023-11-08 12:25:02 +00:00
const topologicalOrderKeys = graph.topologicalSort(); // ['A', 'B', 'C']
2023-08-28 12:04:43 +00:00
```
### Undirected Graph snippet
2023-09-24 13:31:09 +00:00
2023-08-28 12:04:43 +00:00
#### TS or JS
2023-09-24 13:31:09 +00:00
2023-09-22 03:20:33 +00:00
```ts
2023-08-28 12:04:43 +00:00
import {UndirectedGraph} from 'data-structure-typed';
2023-09-22 03:20:33 +00:00
const graph = new UndirectedGraph();
graph.addVertex('A');
graph.addVertex('B');
graph.addVertex('C');
graph.addVertex('D');
2023-10-28 07:58:48 +00:00
graph.deleteVertex('C');
2023-09-22 03:20:33 +00:00
graph.addEdge('A', 'B');
graph.addEdge('B', 'D');
const dijkstraResult = graph.dijkstra('A');
2023-11-08 12:25:02 +00:00
Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.key) // ['A', 'B', 'D']
2023-08-28 12:04:43 +00:00
```
2023-09-18 14:04:39 +00:00
2023-11-09 09:47:02 +00:00
## Built-in classic algorithms
< table >
< thead >
< tr >
< th > Algorithm< / th >
< th > Function Description< / th >
< th > Iteration Type< / th >
< / tr >
< / thead >
< tbody >
< tr >
< td > Binary Tree DFS< / td >
< td > 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.
< / td >
< td > Recursion + Iteration< / td >
< / tr >
< tr >
< td > Binary Tree BFS< / td >
< td > Traverse a binary tree in a breadth-first manner, starting from the root node, visiting nodes level by level
from left to right.
< / td >
< td > Iteration< / td >
< / tr >
< tr >
< td > Graph DFS< / td >
< td > 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.
< / td >
< td > Recursion + Iteration< / td >
< / tr >
< tr >
< td > Binary Tree Morris< / td >
< td > 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.
< / td >
< td > Iteration< / td >
< / tr >
< tr >
< td > Graph BFS< / td >
< td > 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.
< / td >
< td > Recursion + Iteration< / td >
< / tr >
< tr >
< td > Graph Tarjan's Algorithm< / td >
< td > Find strongly connected components in a graph, typically implemented using depth-first search.< / td >
< td > Recursion< / td >
< / tr >
< tr >
< td > Graph Bellman-Ford Algorithm< / td >
< td > Finding the shortest paths from a single source, can handle negative weight edges< / td >
< td > Iteration< / td >
< / tr >
< tr >
< td > Graph Dijkstra's Algorithm< / td >
< td > Finding the shortest paths from a single source, cannot handle negative weight edges< / td >
< td > Iteration< / td >
< / tr >
< tr >
< td > Graph Floyd-Warshall Algorithm< / td >
< td > Finding the shortest paths between all pairs of nodes< / td >
< td > Iteration< / td >
< / tr >
< tr >
< td > Graph getCycles< / td >
< td > Find all cycles in a graph or detect the presence of cycles.< / td >
< td > Recursion< / td >
< / tr >
< tr >
< td > Graph getCutVertexes< / td >
< td > Find cut vertices in a graph, which are nodes that, when removed, increase the number of connected components in
the graph.
< / td >
< td > Recursion< / td >
< / tr >
< tr >
< td > Graph getSCCs< / td >
< td > Find strongly connected components in a graph, which are subgraphs where any two nodes can reach each other.
< / td >
< td > Recursion< / td >
< / tr >
< tr >
< td > Graph getBridges< / td >
< td > Find bridges in a graph, which are edges that, when removed, increase the number of connected components in the
graph.
< / td >
< td > Recursion< / td >
< / tr >
< tr >
< td > Graph topologicalSort< / td >
< td > 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.
< / td >
< td > Recursion< / td >
< / tr >
< / tbody >
< / table >
## API docs & Examples
[API Docs ](https://data-structure-typed-docs.vercel.app )
[Live Examples ](https://vivid-algorithm.vercel.app )
< a href = "https://github.com/zrwusa/vivid-algorithm" target = "_blank" > Examples Repository< / a >
2023-08-16 16:50:14 +00:00
## Data Structures
2023-09-24 13:31:09 +00:00
2023-08-22 14:50:16 +00:00
< table >
< thead >
< tr >
< th > Data Structure< / th >
< th > Unit Test< / th >
< th > Performance Test< / th >
< th > API Documentation< / th >
< th > Implemented< / th >
< / tr >
< / thead >
< tbody >
< tr >
< td > Binary Tree< / td >
2023-09-09 15:49:53 +00:00
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
2023-08-22 14:50:16 +00:00
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/BinaryTree.html" > < span > Binary Tree< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Binary Search Tree (BST)< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/BST.html" > < span > BST< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > AVL Tree< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/AVLTree.html" > < span > AVLTree< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
2023-11-06 03:01:32 +00:00
< td > Red Black Tree< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
2023-11-09 09:47:02 +00:00
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/RedBlackTree.html" > < span > RedBlackTree< / span > < / a > < / td >
2023-11-06 03:01:32 +00:00
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
2023-08-22 14:50:16 +00:00
< td > Tree Multiset< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
2023-11-08 01:26:43 +00:00
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/TreeMultimap.html" > < span > TreeMultimap< / span > < / a > < / td >
2023-08-22 14:50:16 +00:00
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Segment Tree< / td >
2023-11-06 03:01:32 +00:00
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
2023-08-22 14:50:16 +00:00
< td > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/SegmentTree.html" > < span > SegmentTree< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Binary Indexed Tree< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/BinaryIndexedTree.html" > < span > BinaryIndexedTree< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Graph< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/AbstractGraph.html" > < span > AbstractGraph< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Directed Graph< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/DirectedGraph.html" > < span > DirectedGraph< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Undirected Graph< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/UndirectedGraph.html" > < span > UndirectedGraph< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Linked List< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/SinglyLinkedList.html" > < span > SinglyLinkedList< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Singly Linked List< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/SinglyLinkedList.html" > < span > SinglyLinkedList< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Doubly Linked List< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/DoublyLinkedList.html" > < span > DoublyLinkedList< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Queue< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/Queue.html" > < span > Queue< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Object Deque< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/ObjectDeque.html" > < span > ObjectDeque< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Array Deque< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/ArrayDeque.html" > < span > ArrayDeque< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Stack< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
2023-11-06 03:01:32 +00:00
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
2023-08-22 14:50:16 +00:00
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/Stack.html" > < span > Stack< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Coordinate Set< / td >
2023-11-06 03:01:32 +00:00
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
2023-08-22 14:50:16 +00:00
< td > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/CoordinateSet.html" > < span > CoordinateSet< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Coordinate Map< / td >
2023-11-06 03:01:32 +00:00
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
2023-08-22 14:50:16 +00:00
< td > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/CoordinateMap.html" > < span > CoordinateMap< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Heap< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/Heap.html" > < span > Heap< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Priority Queue< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/PriorityQueue.html" > < span > PriorityQueue< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Max Priority Queue< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/MaxPriorityQueue.html" > < span > MaxPriorityQueue< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Min Priority Queue< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/MinPriorityQueue.html" > < span > MinPriorityQueue< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< tr >
< td > Trie< / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
2023-11-06 03:01:32 +00:00
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
2023-08-22 14:50:16 +00:00
< td > < a href = "https://data-structure-typed-docs.vercel.app/classes/Trie.html" > < span > Trie< / span > < / a > < / td >
< td > < img src = "https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt = "" > < / td >
< / tr >
< / tbody >
< / table >
2023-09-26 09:09:28 +00:00
### Standard library data structure comparison
2023-10-10 09:22:18 +00:00
2023-09-26 09:09:28 +00:00
< table >
< thead >
2023-10-10 09:22:18 +00:00
< tr >
< th > Data Structure Typed< / th >
2023-11-03 17:21:30 +00:00
< th > C++ STL< / th >
2023-10-10 09:22:18 +00:00
< th > java.util< / th >
< th > Python collections< / th >
< / tr >
2023-09-26 09:09:28 +00:00
< / thead >
< tbody >
2023-10-10 09:22:18 +00:00
< tr >
< td > DoublyLinkedList< E> < / td >
< td > list< T> < / td >
< td > LinkedList< E> < / td >
< td > deque< / td >
< / tr >
< tr >
< td > SinglyLinkedList< E> < / td >
< td > -< / td >
< td > -< / td >
< td > -< / td >
< / tr >
< tr >
2023-11-08 12:25:02 +00:00
< td > Array< E> < / td >
< td > vector< T> < / td >
< td > ArrayList< E> < / td >
< td > list< / td >
2023-10-10 09:22:18 +00:00
< / tr >
< tr >
< td > Queue< E> < / td >
< td > queue< T> < / td >
< td > Queue< E> < / td >
< td > -< / td >
< / tr >
2023-11-08 12:25:02 +00:00
< tr >
< td > Deque< E> < / td >
< td > deque< T> < / td >
< td > -< / td >
< td > -< / td >
< / tr >
2023-10-10 09:22:18 +00:00
< tr >
< td > PriorityQueue< E> < / td >
< td > priority_queue< T> < / td >
< td > PriorityQueue< E> < / td >
< td > -< / td >
< / tr >
< tr >
2023-11-08 12:25:02 +00:00
< td > Heap< E> < / td >
2023-10-10 09:22:18 +00:00
< td > priority_queue< T> < / td >
< td > PriorityQueue< E> < / td >
< td > heapq< / td >
< / tr >
< tr >
< td > Stack< E> < / td >
< td > stack< T> < / td >
< td > Stack< E> < / td >
< td > -< / td >
< / tr >
< tr >
2023-11-08 12:25:02 +00:00
< td > Set< E> < / td >
< td > set< T> < / td >
< td > HashSet< E> < / td >
< td > set< / td >
< / tr >
< tr >
< td > Map< K, V> < / td >
< td > map< K, V> < / td >
< td > HashMap< K, V> < / td >
< td > dict< / td >
2023-10-10 09:22:18 +00:00
< / tr >
< tr >
< td > -< / td >
2023-11-08 12:25:02 +00:00
< td > unordered_set< T> < / td >
< td > HashSet< E> < / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
< / tr >
< tr >
< td > HashMap< K, V> < / td >
< td > unordered_map< K, V> < / td >
< td > HashMap< K, V> < / td >
< td > defaultdict< / td >
< / tr >
< tr >
2023-11-08 12:25:02 +00:00
< td > Map< K, V> < / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
< td > -< / td >
2023-11-08 12:25:02 +00:00
< td > OrderedDict< / td >
2023-10-10 09:22:18 +00:00
< / tr >
< tr >
2023-11-08 12:25:02 +00:00
< td > BinaryTree< K, V> < / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
< td > -< / td >
< td > -< / td >
< / tr >
< tr >
2023-11-08 12:25:02 +00:00
< td > BST< K, V> < / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
< td > -< / td >
< td > -< / td >
< / tr >
< tr >
2023-11-08 12:25:02 +00:00
< td > TreeMultimap< K, V> < / td >
< td > multimap< K, V> < / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
< td > -< / td >
< / tr >
< tr >
2023-11-08 12:25:02 +00:00
< td > AVLTree< E> < / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
2023-11-08 12:25:02 +00:00
< td > TreeSet< E> < / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
< / tr >
< tr >
2023-11-08 12:25:02 +00:00
< td > AVLTree< K, V> < / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
2023-11-08 12:25:02 +00:00
< td > TreeMap< K, V> < / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
2023-11-08 12:25:02 +00:00
< / tr >
< tr >
< td > AVLTree< E> < / td >
< td > set< / td >
< td > TreeSet< E> < / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
< / tr >
< tr >
2023-11-08 12:25:02 +00:00
< td > Trie< / td >
< td > -< / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
< td > -< / td >
< / tr >
< tr >
< td > -< / td >
2023-11-08 12:25:02 +00:00
< td > multiset< T> < / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
< td > -< / td >
< / tr >
< tr >
2023-11-08 12:25:02 +00:00
< td > DirectedGraph< V, E> < / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
< td > -< / td >
< td > -< / td >
< / tr >
< tr >
2023-11-08 12:25:02 +00:00
< td > UndirectedGraph< V, E> < / td >
< td > -< / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
< td > -< / td >
< / tr >
< tr >
< td > -< / td >
2023-11-08 12:25:02 +00:00
< td > unordered_multiset< / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
2023-11-08 12:25:02 +00:00
< td > Counter< / td >
2023-10-10 09:22:18 +00:00
< / tr >
< tr >
2023-11-08 12:25:02 +00:00
< td > -< / td >
< td > -< / td >
< td > LinkedHashSet< E> < / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
< / tr >
< tr >
< td > -< / td >
< td > -< / td >
2023-11-08 12:25:02 +00:00
< td > LinkedHashMap< K, V> < / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
< / tr >
< tr >
< td > -< / td >
2023-11-08 12:25:02 +00:00
< td > unordered_multimap< K, V> < / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
< td > -< / td >
< / tr >
< tr >
< td > -< / td >
2023-11-08 12:25:02 +00:00
< td > bitset< N> < / td >
< td > -< / td >
2023-10-10 09:22:18 +00:00
< td > -< / td >
< / tr >
2023-09-26 09:09:28 +00:00
< / tbody >
< / table >
2023-09-19 09:00:25 +00:00
## Code design
2023-09-24 13:31:09 +00:00
2023-10-21 12:03:54 +00:00
### Adhere to ES6 standard naming conventions for APIs.
Standardize API conventions by using 'add' and 'delete' for element manipulation methods in all data structures.
Opt for concise and clear method names, avoiding excessive length while ensuring explicit intent.
### Object-oriented programming(OOP)
2023-11-08 01:26:43 +00:00
By strictly adhering to object-oriented design (BinaryTree -> BST -> AVLTree -> TreeMultimap), you can seamlessly
2023-09-24 13:31:09 +00:00
inherit the existing data structures to implement the customized ones you need. Object-oriented design stands as the
optimal approach to data structure design.
2023-09-19 09:00:25 +00:00
2023-11-02 13:38:10 +00:00
## Benchmark
2023-11-04 02:19:09 +00:00
2023-11-08 12:25:02 +00:00
[//]: # (No deletion!!! Start of Replace Section)
2023-11-04 02:00:51 +00:00
< div class = "json-to-html-collapse clearfix 0" >
< div class = 'collapsible level0' > < span class = 'json-to-html-label' > avl-tree< / span > < / div >
2023-11-10 16:17:50 +00:00
< div class = "content" > < table style = "display: table; width:100%; table-layout: fixed;" > < tr > < th > test name< / th > < th > time taken (ms)< / th > < th > executions per sec< / th > < th > sample deviation< / th > < / tr > < tr > < td > 10,000 add randomly< / td > < td > 32.23< / td > < td > 31.03< / td > < td > 0.00< / td > < / tr > < tr > < td > 10,000 add & delete randomly< / td > < td > 72.19< / td > < td > 13.85< / td > < td > 0.00< / td > < / tr > < tr > < td > 10,000 addMany< / td > < td > 41.39< / td > < td > 24.16< / td > < td > 9.33e-4< / td > < / tr > < tr > < td > 10,000 get< / td > < td > 28.05< / td > < td > 35.66< / td > < td > 0.00< / td > < / tr > < / table > < / div >
2023-11-03 17:21:30 +00:00
< / div > < div class = "json-to-html-collapse clearfix 0" >
< div class = 'collapsible level0' > < span class = 'json-to-html-label' > binary-tree< / span > < / div >
2023-11-10 16:17:50 +00:00
< div class = "content" > < table style = "display: table; width:100%; table-layout: fixed;" > < tr > < th > test name< / th > < th > time taken (ms)< / th > < th > executions per sec< / th > < th > sample deviation< / th > < / tr > < tr > < td > 1,000 add randomly< / td > < td > 12.56< / td > < td > 79.59< / td > < td > 6.46e-4< / td > < / tr > < tr > < td > 1,000 add & delete randomly< / td > < td > 16.15< / td > < td > 61.91< / td > < td > 7.18e-4< / td > < / tr > < tr > < td > 1,000 addMany< / td > < td > 10.64< / td > < td > 93.95< / td > < td > 6.17e-4< / td > < / tr > < tr > < td > 1,000 get< / td > < td > 18.44< / td > < td > 54.22< / td > < td > 4.23e-4< / td > < / tr > < tr > < td > 1,000 dfs< / td > < td > 160.17< / td > < td > 6.24< / td > < td > 0.01< / td > < / tr > < tr > < td > 1,000 bfs< / td > < td > 57.41< / td > < td > 17.42< / td > < td > 0.00< / td > < / tr > < tr > < td > 1,000 morris< / td > < td > 264.54< / td > < td > 3.78< / td > < td > 0.00< / td > < / tr > < / table > < / div >
2023-11-03 17:21:30 +00:00
< / div > < div class = "json-to-html-collapse clearfix 0" >
< div class = 'collapsible level0' > < span class = 'json-to-html-label' > bst< / span > < / div >
2023-11-10 16:17:50 +00:00
< div class = "content" > < table style = "display: table; width:100%; table-layout: fixed;" > < tr > < th > test name< / th > < th > time taken (ms)< / th > < th > executions per sec< / th > < th > sample deviation< / th > < / tr > < tr > < td > 10,000 add randomly< / td > < td > 28.45< / td > < td > 35.15< / td > < td > 4.14e-4< / td > < / tr > < tr > < td > 10,000 add & delete randomly< / td > < td > 67.78< / td > < td > 14.75< / td > < td > 0.00< / td > < / tr > < tr > < td > 10,000 addMany< / td > < td > 29.04< / td > < td > 34.43< / td > < td > 5.76e-4< / td > < / tr > < tr > < td > 10,000 get< / td > < td > 28.67< / td > < td > 34.88< / td > < td > 8.26e-4< / td > < / tr > < / table > < / div >
2023-11-04 09:28:52 +00:00
< / div > < div class = "json-to-html-collapse clearfix 0" >
< div class = 'collapsible level0' > < span class = 'json-to-html-label' > rb-tree< / span > < / div >
2023-11-10 16:17:50 +00:00
< div class = "content" > < table style = "display: table; width:100%; table-layout: fixed;" > < tr > < th > test name< / th > < th > time taken (ms)< / th > < th > executions per sec< / th > < th > sample deviation< / th > < / tr > < tr > < td > 100,000 add randomly< / td > < td > 90.96< / td > < td > 10.99< / td > < td > 0.01< / td > < / tr > < tr > < td > 100,000 competitor add randomly< / td > < td > 50.10< / td > < td > 19.96< / td > < td > 0.01< / td > < / tr > < tr > < td > 100,000 add & delete randomly< / td > < td > 219.06< / td > < td > 4.56< / td > < td > 0.01< / td > < / tr > < tr > < td > 100,000 getNode< / td > < td > 106.06< / td > < td > 9.43< / td > < td > 0.00< / td > < / tr > < / table > < / div >
2023-11-03 17:21:30 +00:00
< / div > < div class = "json-to-html-collapse clearfix 0" >
< div class = 'collapsible level0' > < span class = 'json-to-html-label' > directed-graph< / span > < / div >
2023-11-10 16:17:50 +00:00
< div class = "content" > < table style = "display: table; width:100%; table-layout: fixed;" > < tr > < th > test name< / th > < th > time taken (ms)< / th > < th > executions per sec< / th > < th > sample deviation< / th > < / tr > < tr > < td > 1,000 addVertex< / td > < td > 0.11< / td > < td > 9433.92< / td > < td > 4.40e-6< / td > < / tr > < tr > < td > 1,000 addEdge< / td > < td > 6.24< / td > < td > 160.30< / td > < td > 2.02e-4< / td > < / tr > < tr > < td > 1,000 getVertex< / td > < td > 0.05< / td > < td > 2.13e+4< / td > < td > 1.64e-6< / td > < / tr > < tr > < td > 1,000 getEdge< / td > < td > 23.80< / td > < td > 42.02< / td > < td > 0.00< / td > < / tr > < tr > < td > tarjan< / td > < td > 218.46< / td > < td > 4.58< / td > < td > 0.01< / td > < / tr > < tr > < td > tarjan all< / td > < td > 221.95< / td > < td > 4.51< / td > < td > 0.00< / td > < / tr > < tr > < td > topologicalSort< / td > < td > 183.70< / td > < td > 5.44< / td > < td > 0.01< / td > < / tr > < / table > < / div >
2023-11-03 17:21:30 +00:00
< / div > < div class = "json-to-html-collapse clearfix 0" >
< div class = 'collapsible level0' > < span class = 'json-to-html-label' > heap< / span > < / div >
2023-11-10 16:17:50 +00:00
< div class = "content" > < table style = "display: table; width:100%; table-layout: fixed;" > < tr > < th > test name< / th > < th > time taken (ms)< / th > < th > executions per sec< / th > < th > sample deviation< / th > < / tr > < tr > < td > 10,000 add & pop< / td > < td > 4.63< / td > < td > 215.97< / td > < td > 4.50e-5< / td > < / tr > < tr > < td > 10,000 fib add & pop< / td > < td > 359.98< / td > < td > 2.78< / td > < td > 0.00< / td > < / tr > < / table > < / div >
2023-11-03 17:21:30 +00:00
< / div > < div class = "json-to-html-collapse clearfix 0" >
< div class = 'collapsible level0' > < span class = 'json-to-html-label' > doubly-linked-list< / span > < / div >
2023-11-10 16:17:50 +00:00
< div class = "content" > < table style = "display: table; width:100%; table-layout: fixed;" > < tr > < th > test name< / th > < th > time taken (ms)< / th > < th > executions per sec< / th > < th > sample deviation< / th > < / tr > < tr > < td > 1,000,000 unshift< / td > < td > 233.68< / td > < td > 4.28< / td > < td > 0.06< / td > < / tr > < tr > < td > 1,000,000 unshift & shift< / td > < td > 185.63< / td > < td > 5.39< / td > < td > 0.05< / td > < / tr > < tr > < td > 1,000,000 insertBefore< / td > < td > 321.19< / td > < td > 3.11< / td > < td > 0.04< / td > < / tr > < / table > < / div >
2023-11-03 17:21:30 +00:00
< / div > < div class = "json-to-html-collapse clearfix 0" >
< div class = 'collapsible level0' > < span class = 'json-to-html-label' > singly-linked-list< / span > < / div >
2023-11-10 16:17:50 +00:00
< div class = "content" > < table style = "display: table; width:100%; table-layout: fixed;" > < tr > < th > test name< / th > < th > time taken (ms)< / th > < th > executions per sec< / th > < th > sample deviation< / th > < / tr > < tr > < td > 10,000 push & pop< / td > < td > 217.95< / td > < td > 4.59< / td > < td > 0.01< / td > < / tr > < tr > < td > 10,000 insertBefore< / td > < td > 248.81< / td > < td > 4.02< / td > < td > 0.00< / td > < / tr > < / table > < / div >
2023-11-03 17:21:30 +00:00
< / div > < div class = "json-to-html-collapse clearfix 0" >
< div class = 'collapsible level0' > < span class = 'json-to-html-label' > max-priority-queue< / span > < / div >
2023-11-10 16:17:50 +00:00
< div class = "content" > < table style = "display: table; width:100%; table-layout: fixed;" > < tr > < th > test name< / th > < th > time taken (ms)< / th > < th > executions per sec< / th > < th > sample deviation< / th > < / tr > < tr > < td > 10,000 refill & poll< / td > < td > 11.72< / td > < td > 85.30< / td > < td > 2.79e-4< / td > < / tr > < / table > < / div >
2023-11-03 17:21:30 +00:00
< / div > < div class = "json-to-html-collapse clearfix 0" >
< div class = 'collapsible level0' > < span class = 'json-to-html-label' > deque< / span > < / div >
2023-11-10 16:17:50 +00:00
< div class = "content" > < table style = "display: table; width:100%; table-layout: fixed;" > < tr > < th > test name< / th > < th > time taken (ms)< / th > < th > executions per sec< / th > < th > sample deviation< / th > < / tr > < tr > < td > 1,000,000 push< / td > < td > 204.13< / td > < td > 4.90< / td > < td > 0.04< / td > < / tr > < tr > < td > 1,000,000 shift< / td > < td > 25.71< / td > < td > 38.89< / td > < td > 0.00< / td > < / tr > < / table > < / div >
2023-11-03 17:21:30 +00:00
< / div > < div class = "json-to-html-collapse clearfix 0" >
< div class = 'collapsible level0' > < span class = 'json-to-html-label' > queue< / span > < / div >
2023-11-10 16:17:50 +00:00
< div class = "content" > < table style = "display: table; width:100%; table-layout: fixed;" > < tr > < th > test name< / th > < th > time taken (ms)< / th > < th > executions per sec< / th > < th > sample deviation< / th > < / tr > < tr > < td > 1,000,000 push< / td > < td > 42.93< / td > < td > 23.30< / td > < td > 0.00< / td > < / tr > < tr > < td > 1,000,000 push & shift< / td > < td > 80.12< / td > < td > 12.48< / td > < td > 0.00< / td > < / tr > < / table > < / div >
2023-11-03 17:21:30 +00:00
< / div > < div class = "json-to-html-collapse clearfix 0" >
< div class = 'collapsible level0' > < span class = 'json-to-html-label' > trie< / span > < / div >
2023-11-10 16:17:50 +00:00
< div class = "content" > < table style = "display: table; width:100%; table-layout: fixed;" > < tr > < th > test name< / th > < th > time taken (ms)< / th > < th > executions per sec< / th > < th > sample deviation< / th > < / tr > < tr > < td > 100,000 push< / td > < td > 56.09< / td > < td > 17.83< / td > < td > 0.00< / td > < / tr > < tr > < td > 100,000 getWords< / td > < td > 97.76< / td > < td > 10.23< / td > < td > 0.01< / td > < / tr > < / table > < / div >
2023-11-03 17:21:30 +00:00
< / div >
2023-11-04 02:19:09 +00:00
2023-11-08 12:25:02 +00:00
[//]: # (No deletion!!! End of Replace Section)
