data-structure-typed 1.50.4 → 1.50.6

package/CHANGELOG.md

@@ -8,7 +8,7 @@ All notable changes to this project will be documented in this file.
 - [Semantic Versioning](https://semver.org/spec/v2.0.0.html)
 - [`auto-changelog`](https://github.com/CookPete/auto-changelog)
 
-## [v1.50.4](https://github.com/zrwusa/data-structure-typed/compare/v1.35.0...main) (upcoming)
+## [v1.50.6](https://github.com/zrwusa/data-structure-typed/compare/v1.35.0...main) (upcoming)
 
 ### Changes
 

package/README.md

@@ -1,6 +1,5 @@
 # data-structure-typed
 
-
 ![npm](https://img.shields.io/npm/dm/data-structure-typed)
 ![GitHub contributors](https://img.shields.io/github/contributors/zrwusa/data-structure-typed)
 ![npm package minimized gzipped size (select exports)](https://img.shields.io/bundlejs/size/data-structure-typed)
@@ -17,7 +16,8 @@
 ## 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
+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))
@@ -28,13 +28,15 @@ anymore! JavaScript and TypeScript now have [data-structure-typed]().**`Benchmar
 
 [//]: # (![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, Red Black Tree, Linked List, Deque, Trie, Directed Graph, Undirected Graph, BST, AVL Tree, Priority Queue, Queue, Tree Multiset.
+### Data structures available
 
+We provide data structures that are not available in JS/TS
+Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, Directed Graph, Undirected Graph, BST, AVL Tree, Priority
+Queue, Queue, Tree Multiset.
 
-### Performance surpasses that of native JS/TS
+### Performance
 
+Performance surpasses that of native JS/TS
 
 <table style="display: table; width:100%; table-layout: fixed;">
   <thead>
@@ -99,6 +101,53 @@ Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, Directed Graph, Und
   </tbody>
 </table>
 
+### Conciseness and uniformity
+In Java.utils, you need to memorize a table for all sequential data structures(Queue, Deque, LinkedList),
+
+<table>
+        <thead>
+            <tr>
+                <th>Operation</th>
+                <th>Java ArrayList</th>
+                <th>Java Queue</th>
+                <th>Java ArrayDeque</th>
+                <th>Java LinkedList</th>
+            </tr>
+        </thead>
+        <tbody>
+            <tr>
+                <td>push</td>
+                <td>add</td>
+                <td>offer</td>
+                <td>push</td>
+                <td>push</td>
+            </tr>
+            <tr>
+                <td>pop</td>
+                <td>remove</td>
+                <td>poll</td>
+                <td>removeLast</td>
+                <td>removeLast</td>
+            </tr>
+            <tr>
+                <td>shift</td>
+                <td>remove</td>
+                <td>poll</td>
+                <td>removeFirst</td>
+                <td>removeFirst</td>
+            </tr>
+            <tr>
+                <td>unshift</td>
+                <td>add(0, element)</td>
+                <td>offerFirst</td>
+                <td>unshift</td>
+                <td>unshift</td>
+            </tr>
+        </tbody>
+    </table>
+
+whereas in our data-structure-typed, you **only** need to remember four methods: `push`, `pop`, `shift`, and `unshift` for all sequential data structures.
+
 ## Installation and Usage
 
 ### npm
@@ -155,7 +204,7 @@ our [visual tool](https://github.com/zrwusa/vivid-algorithm)
 #### TS
 
 ```ts
-import {RedBlackTree} from 'data-structure-typed';
+import { RedBlackTree } from 'data-structure-typed';
 
 const rbTree = new RedBlackTree<number>();
 rbTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
@@ -177,7 +226,7 @@ rbTree.print()
 #### JS
 
 ```js
-import {RedBlackTree} from 'data-structure-typed';
+import { RedBlackTree } from 'data-structure-typed';
 
 const rbTree = new RedBlackTree();
 rbTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
@@ -204,31 +253,31 @@ const orgStrArr = ["trie", "trial", "trick", "trip", "tree", "trend", "triangle"
 const entries = [[6, "6"], [1, "1"], [2, "2"], [7, "7"], [5, "5"], [3, "3"], [4, "4"], [9, "9"], [8, "8"]];
 
 const queue = new Queue(orgArr);
-queue.print();      
+queue.print();
 // [6, 1, 2, 7, 5, 3, 4, 9, 8]
 
 const deque = new Deque(orgArr);
-deque.print();      
+deque.print();
 // [6, 1, 2, 7, 5, 3, 4, 9, 8]
 
 const sList = new SinglyLinkedList(orgArr);
-sList.print();      
+sList.print();
 // [6, 1, 2, 7, 5, 3, 4, 9, 8]
 
 const dList = new DoublyLinkedList(orgArr);
-dList.print();      
+dList.print();
 // [6, 1, 2, 7, 5, 3, 4, 9, 8]
 
 const stack = new Stack(orgArr);
-stack.print();      
+stack.print();
 // [6, 1, 2, 7, 5, 3, 4, 9, 8]
 
 const minHeap = new MinHeap(orgArr);
-minHeap.print();    
+minHeap.print();
 // [1, 5, 2, 7, 6, 3, 4, 9, 8]
 
 const maxPQ = new MaxPriorityQueue(orgArr);
-maxPQ.print();      
+maxPQ.print();
 // [9, 8, 4, 7, 5, 2, 3, 1, 6]
 
 const biTree = new BinaryTree(entries);
@@ -284,7 +333,7 @@ treeMulti.print();
 //              7   9
 
 const hm = new HashMap(entries);
-hm.print()    
+hm.print()
 // [[6, "6"], [1, "1"], [2, "2"], [7, "7"], [5, "5"], [3, "3"], [4, "4"], [9, "9"], [8, "8"]]
 
 const rbTreeH = new RedBlackTree(hm);
@@ -298,7 +347,7 @@ rbTreeH.print();
 //              7   9
 
 const pq = new MinPriorityQueue(orgArr);
-pq.print();   
+pq.print();
 // [1, 5, 2, 7, 6, 3, 4, 9, 8]
 
 const bst1 = new BST(pq);
@@ -312,7 +361,7 @@ bst1.print();
 //        4         9
 
 const dq1 = new Deque(orgArr);
-dq1.print();    
+dq1.print();
 // [6, 1, 2, 7, 5, 3, 4, 9, 8]
 const rbTree1 = new RedBlackTree(dq1);
 rbTree1.print();
@@ -326,13 +375,13 @@ rbTree1.print();
 
 
 const trie2 = new Trie(orgStrArr);
-trie2.print();    
+trie2.print();
 // ['trie', 'trial', 'triangle', 'trick', 'trip', 'tree', 'trend', 'track', 'trace', 'transmit']
 const heap2 = new Heap(trie2, { comparator: (a, b) => Number(a) - Number(b) });
-heap2.print();    
+heap2.print();
 // ['transmit', 'trace', 'tree', 'trend', 'track', 'trial', 'trip', 'trie', 'trick', 'triangle']
 const dq2 = new Deque(heap2);
-dq2.print();      
+dq2.print();
 // ['transmit', 'trace', 'tree', 'trend', 'track', 'trial', 'trip', 'trie', 'trick', 'triangle']
 const entries2 = dq2.map((el, i) => [i, el]);
 const avl2 = new AVLTree(entries2);
@@ -349,7 +398,7 @@ avl2.print();
 ### Binary Search Tree (BST) snippet
 
 ```ts
-import {BST, BSTNode} from 'data-structure-typed';
+import { BST, BSTNode } from 'data-structure-typed';
 
 const bst = new BST<number>();
 bst.add(11);
@@ -381,7 +430,7 @@ bst.print()
 //            \                          
 //            7
 
-const objBST = new BST<number, {height: number, age: number}>();
+const objBST = new BST<number, { height: number, age: number }>();
 
 objBST.add(11, { "name": "Pablo", "age": 15 });
 objBST.add(3, { "name": "Kirk", "age": 1 });
@@ -410,7 +459,7 @@ objBST.delete(11);
 ### AVLTree snippet
 
 ```ts
-import {AVLTree} from 'data-structure-typed';
+import { AVLTree } from 'data-structure-typed';
 
 const avlTree = new AVLTree<number>();
 avlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
@@ -422,7 +471,7 @@ avlTree.isAVLBalanced();    // true
 ### Directed Graph simple snippet
 
 ```ts
-import {DirectedGraph} from 'data-structure-typed';
+import { DirectedGraph } from 'data-structure-typed';
 
 const graph = new DirectedGraph<string>();
 
@@ -451,7 +500,7 @@ const topologicalOrderKeys = graph.topologicalSort(); // ['A', 'B', 'C']
 ### Undirected Graph snippet
 
 ```ts
-import {UndirectedGraph} from 'data-structure-typed';
+import { UndirectedGraph } from 'data-structure-typed';
 
 const graph = new UndirectedGraph<string>();
 graph.addVertex('A');
@@ -885,7 +934,10 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.key) // ['A', 'B', '
 
 ## Software Engineering Design Standards
 
-We strictly adhere to computer science theory and software development standards. Our LinkedList is designed in the traditional sense of the LinkedList data structure, and we refrain from substituting it with a Deque solely for the purpose of showcasing performance test data. However, we have also implemented a Deque based on a dynamic array concurrently.
+We strictly adhere to computer science theory and software development standards. Our LinkedList is designed in the
+traditional sense of the LinkedList data structure, and we refrain from substituting it with a Deque solely for the
+purpose of showcasing performance test data. However, we have also implemented a Deque based on a dynamic array
+concurrently.
 
 
 <table style="display: table; width:100%; table-layout: fixed;">
@@ -935,56 +987,63 @@ We strictly adhere to computer science theory and software development standards
     </tr>
 </table>
 
-
 ## Benchmark
 
+macOS Big Sur
+Version 11.7.9
+
+MacBook Pro (15-inch, 2018)
+Processor 2.2 GHz 6-Core Intel Core i7
+Memory 16 GB 2400 MHz DDR4
+Graphics Radeon Pro 555X 4 GB
+Intel UHD Graphics 630 1536 MB
+
 [//]: # (No deletion!!! Start of Replace Section)
 <div class="json-to-html-collapse clearfix 0">
-      <div class='collapsible level0' ><span class='json-to-html-label'>avl-tree</span></div>
-      <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>125.60</td><td>7.96</td><td>0.00</td></tr><tr><td>10,000 add & delete randomly</td><td>181.22</td><td>5.52</td><td>0.00</td></tr><tr><td>10,000 addMany</td><td>134.12</td><td>7.46</td><td>0.01</td></tr><tr><td>10,000 get</td><td>55.08</td><td>18.16</td><td>0.01</td></tr></table></div>
-    </div><div class="json-to-html-collapse clearfix 0">
-      <div class='collapsible level0' ><span class='json-to-html-label'>binary-tree-overall</span></div>
-      <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 RBTree add</td><td>6.17</td><td>161.95</td><td>0.00</td></tr><tr><td>10,000 RBTree add & delete randomly</td><td>16.07</td><td>62.22</td><td>2.62e-4</td></tr><tr><td>10,000 RBTree get</td><td>19.86</td><td>50.36</td><td>2.44e-4</td></tr><tr><td>10,000 AVLTree add</td><td>134.38</td><td>7.44</td><td>0.02</td></tr><tr><td>10,000 AVLTree add & delete randomly</td><td>207.20</td><td>4.83</td><td>0.06</td></tr><tr><td>10,000 AVLTree get</td><td>0.98</td><td>1015.54</td><td>2.73e-5</td></tr></table></div>
+      <div class='collapsible level0' ><span class='json-to-html-label'>heap</span></div>
+      <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</td><td>6.42</td><td>155.87</td><td>1.90e-4</td></tr><tr><td>100,000 add & poll</td><td>31.50</td><td>31.74</td><td>8.72e-4</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>rb-tree</span></div>
-      <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</td><td>86.65</td><td>11.54</td><td>0.02</td></tr><tr><td>100,000 add & delete randomly</td><td>221.02</td><td>4.52</td><td>0.03</td></tr><tr><td>100,000 getNode</td><td>190.54</td><td>5.25</td><td>0.00</td></tr><tr><td>100,000 add & iterator</td><td>122.10</td><td>8.19</td><td>0.01</td></tr></table></div>
+      <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 orderly</td><td>42.46</td><td>23.55</td><td>0.01</td></tr><tr><td>100,000 delete orderly</td><td>176.04</td><td>5.68</td><td>0.01</td></tr><tr><td>100,000 add randomly</td><td>98.02</td><td>10.20</td><td>0.00</td></tr><tr><td>100,000 delete randomly</td><td>182.58</td><td>5.48</td><td>0.00</td></tr><tr><td>100,000 add orderly</td><td>42.10</td><td>23.76</td><td>8.79e-4</td></tr><tr><td>100,000 delete randomly</td><td>182.16</td><td>5.49</td><td>5.65e-4</td></tr><tr><td>100,000 getNode randomly</td><td>180.63</td><td>5.54</td><td>0.00</td></tr><tr><td>100,000 add & iterator</td><td>129.92</td><td>7.70</td><td>0.00</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
-      <div class='collapsible level0' ><span class='json-to-html-label'>directed-graph</span></div>
-      <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>8896.51</td><td>2.63e-5</td></tr><tr><td>1,000 addEdge</td><td>6.53</td><td>153.21</td><td>0.00</td></tr><tr><td>1,000 getVertex</td><td>0.05</td><td>2.08e+4</td><td>1.06e-5</td></tr><tr><td>1,000 getEdge</td><td>27.53</td><td>36.33</td><td>0.01</td></tr><tr><td>tarjan</td><td>224.53</td><td>4.45</td><td>0.01</td></tr><tr><td>topologicalSort</td><td>184.02</td><td>5.43</td><td>0.00</td></tr></table></div>
+      <div class='collapsible level0' ><span class='json-to-html-label'>queue</span></div>
+      <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>44.33</td><td>22.56</td><td>0.01</td></tr><tr><td>100,000 push & shift</td><td>4.68</td><td>213.63</td><td>1.41e-4</td></tr><tr><td>Native JS Array 100,000 push & shift</td><td>2633.11</td><td>0.38</td><td>0.44</td></tr></table></div>
+    </div><div class="json-to-html-collapse clearfix 0">
+      <div class='collapsible level0' ><span class='json-to-html-label'>deque</span></div>
+      <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>24.62</td><td>40.62</td><td>0.00</td></tr><tr><td>1,000,000 push & pop</td><td>30.71</td><td>32.56</td><td>0.00</td></tr><tr><td>1,000,000 push & shift</td><td>31.93</td><td>31.32</td><td>0.01</td></tr><tr><td>100,000 push & shift</td><td>3.25</td><td>307.22</td><td>2.74e-4</td></tr><tr><td>Native JS Array 100,000 push & shift</td><td>2455.51</td><td>0.41</td><td>0.29</td></tr><tr><td>100,000 unshift & shift</td><td>2.94</td><td>340.31</td><td>2.39e-4</td></tr><tr><td>Native JS Array 100,000 unshift & shift</td><td>4314.20</td><td>0.23</td><td>0.41</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>hash-map</span></div>
-      <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 set</td><td>126.27</td><td>7.92</td><td>0.05</td></tr><tr><td>Native Map 1,000,000 set</td><td>229.80</td><td>4.35</td><td>0.03</td></tr><tr><td>Native Set 1,000,000 add</td><td>175.83</td><td>5.69</td><td>0.01</td></tr><tr><td>1,000,000 set & get</td><td>121.34</td><td>8.24</td><td>0.03</td></tr><tr><td>Native Map 1,000,000 set & get</td><td>290.80</td><td>3.44</td><td>0.03</td></tr><tr><td>Native Set 1,000,000 add & has</td><td>180.71</td><td>5.53</td><td>0.01</td></tr><tr><td>1,000,000 ObjKey set & get</td><td>357.68</td><td>2.80</td><td>0.07</td></tr><tr><td>Native Map 1,000,000 ObjKey set & get</td><td>310.57</td><td>3.22</td><td>0.06</td></tr><tr><td>Native Set 1,000,000 ObjKey add & has</td><td>278.42</td><td>3.59</td><td>0.05</td></tr></table></div>
+      <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 set</td><td>116.60</td><td>8.58</td><td>0.02</td></tr><tr><td>Native JS Map 1,000,000 set</td><td>202.39</td><td>4.94</td><td>0.01</td></tr><tr><td>Native JS Set 1,000,000 add</td><td>167.89</td><td>5.96</td><td>0.01</td></tr><tr><td>1,000,000 set & get</td><td>125.21</td><td>7.99</td><td>0.03</td></tr><tr><td>Native JS Map 1,000,000 set & get</td><td>272.20</td><td>3.67</td><td>0.03</td></tr><tr><td>Native JS Set 1,000,000 add & has</td><td>168.51</td><td>5.93</td><td>0.01</td></tr><tr><td>1,000,000 ObjKey set & get</td><td>309.10</td><td>3.24</td><td>0.01</td></tr><tr><td>Native JS Map 1,000,000 ObjKey set & get</td><td>299.43</td><td>3.34</td><td>0.03</td></tr><tr><td>Native JS Set 1,000,000 ObjKey add & has</td><td>260.93</td><td>3.83</td><td>0.02</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
-      <div class='collapsible level0' ><span class='json-to-html-label'>heap</span></div>
-      <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 & poll</td><td>24.85</td><td>40.24</td><td>0.00</td></tr><tr><td>100,000 add & dfs</td><td>33.14</td><td>30.17</td><td>0.00</td></tr><tr><td>10,000 fib add & pop</td><td>366.11</td><td>2.73</td><td>0.00</td></tr></table></div>
+      <div class='collapsible level0' ><span class='json-to-html-label'>trie</span></div>
+      <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>43.32</td><td>23.08</td><td>6.16e-4</td></tr><tr><td>100,000 getWords</td><td>84.84</td><td>11.79</td><td>0.00</td></tr></table></div>
+    </div><div class="json-to-html-collapse clearfix 0">
+      <div class='collapsible level0' ><span class='json-to-html-label'>avl-tree</span></div>
+      <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>129.04</td><td>7.75</td><td>0.00</td></tr><tr><td>10,000 get</td><td>51.31</td><td>19.49</td><td>5.76e-4</td></tr><tr><td>10,000 add & delete randomly</td><td>190.44</td><td>5.25</td><td>0.00</td></tr><tr><td>10,000 addMany</td><td>137.94</td><td>7.25</td><td>0.00</td></tr></table></div>
+    </div><div class="json-to-html-collapse clearfix 0">
+      <div class='collapsible level0' ><span class='json-to-html-label'>binary-tree-overall</span></div>
+      <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 RBTree add</td><td>8.13</td><td>122.97</td><td>1.87e-4</td></tr><tr><td>10,000 RBTree add & delete randomly</td><td>58.30</td><td>17.15</td><td>5.24e-4</td></tr><tr><td>10,000 RBTree get</td><td>18.16</td><td>55.06</td><td>2.06e-4</td></tr><tr><td>10,000 AVLTree add</td><td>129.10</td><td>7.75</td><td>0.00</td></tr><tr><td>10,000 AVLTree get</td><td>51.37</td><td>19.47</td><td>7.26e-4</td></tr><tr><td>10,000 AVLTree add & delete randomly</td><td>189.84</td><td>5.27</td><td>8.96e-4</td></tr></table></div>
+    </div><div class="json-to-html-collapse clearfix 0">
+      <div class='collapsible level0' ><span class='json-to-html-label'>directed-graph</span></div>
+      <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.10</td><td>9882.73</td><td>1.12e-6</td></tr><tr><td>1,000 addEdge</td><td>6.18</td><td>161.76</td><td>7.54e-4</td></tr><tr><td>1,000 getVertex</td><td>0.05</td><td>2.17e+4</td><td>3.35e-7</td></tr><tr><td>1,000 getEdge</td><td>23.36</td><td>42.81</td><td>0.00</td></tr><tr><td>tarjan</td><td>208.84</td><td>4.79</td><td>0.01</td></tr><tr><td>topologicalSort</td><td>178.78</td><td>5.59</td><td>0.00</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>doubly-linked-list</span></div>
-      <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>217.98</td><td>4.59</td><td>0.07</td></tr><tr><td>1,000,000 unshift</td><td>223.20</td><td>4.48</td><td>0.08</td></tr><tr><td>1,000,000 unshift & shift</td><td>172.87</td><td>5.78</td><td>0.03</td></tr><tr><td>1,000,000 addBefore</td><td>387.13</td><td>2.58</td><td>0.20</td></tr></table></div>
+      <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>217.73</td><td>4.59</td><td>0.05</td></tr><tr><td>1,000,000 unshift</td><td>200.41</td><td>4.99</td><td>0.04</td></tr><tr><td>1,000,000 unshift & shift</td><td>168.75</td><td>5.93</td><td>0.04</td></tr><tr><td>1,000,000 addBefore</td><td>298.21</td><td>3.35</td><td>0.06</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>singly-linked-list</span></div>
-      <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 & shift</td><td>225.13</td><td>4.44</td><td>0.07</td></tr><tr><td>10,000 push & pop</td><td>234.54</td><td>4.26</td><td>0.02</td></tr><tr><td>10,000 addBefore</td><td>252.62</td><td>3.96</td><td>0.00</td></tr></table></div>
+      <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 & shift</td><td>196.65</td><td>5.09</td><td>0.04</td></tr><tr><td>10,000 push & pop</td><td>221.63</td><td>4.51</td><td>0.02</td></tr><tr><td>10,000 addBefore</td><td>249.40</td><td>4.01</td><td>0.01</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>priority-queue</span></div>
-      <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 & poll</td><td>76.49</td><td>13.07</td><td>0.00</td></tr></table></div>
-    </div><div class="json-to-html-collapse clearfix 0">
-      <div class='collapsible level0' ><span class='json-to-html-label'>deque</span></div>
-      <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>13.20</td><td>75.75</td><td>2.79e-4</td></tr><tr><td>1,000,000 push & pop</td><td>22.21</td><td>45.03</td><td>3.27e-4</td></tr><tr><td>100,000 push & shift</td><td>2.26</td><td>442.24</td><td>1.43e-4</td></tr><tr><td>Native Array 100,000 push & shift</td><td>2329.51</td><td>0.43</td><td>0.10</td></tr><tr><td>100,000 unshift & shift</td><td>2.16</td><td>463.83</td><td>8.20e-5</td></tr><tr><td>Native Array 100,000 unshift & shift</td><td>4590.64</td><td>0.22</td><td>0.33</td></tr></table></div>
-    </div><div class="json-to-html-collapse clearfix 0">
-      <div class='collapsible level0' ><span class='json-to-html-label'>queue</span></div>
-      <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>49.92</td><td>20.03</td><td>0.02</td></tr><tr><td>100,000 push & shift</td><td>5.07</td><td>197.28</td><td>5.86e-4</td></tr><tr><td>Native Array 100,000 push & shift</td><td>2315.78</td><td>0.43</td><td>0.13</td></tr><tr><td>Native Array 100,000 push & pop</td><td>4.37</td><td>228.72</td><td>1.32e-4</td></tr></table></div>
+      <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</td><td>28.95</td><td>34.55</td><td>0.00</td></tr><tr><td>100,000 add & poll</td><td>76.25</td><td>13.11</td><td>6.57e-4</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>stack</span></div>
-      <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>44.50</td><td>22.47</td><td>0.01</td></tr><tr><td>1,000,000 push & pop</td><td>53.57</td><td>18.67</td><td>0.02</td></tr></table></div>
-    </div><div class="json-to-html-collapse clearfix 0">
-      <div class='collapsible level0' ><span class='json-to-html-label'>trie</span></div>
-      <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>42.95</td><td>23.28</td><td>6.68e-4</td></tr><tr><td>100,000 getWords</td><td>92.11</td><td>10.86</td><td>0.01</td></tr></table></div>
+      <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>39.72</td><td>25.18</td><td>0.01</td></tr><tr><td>1,000,000 push & pop</td><td>49.18</td><td>20.33</td><td>0.01</td></tr></table></div>
     </div>
 
 [//]: # (No deletion!!! End of Replace Section)
 
-
-
 ## supported module system
+
 Now you can use it in Node.js and browser environments
 
 CommonJS:**`require export.modules =`**
@@ -1002,19 +1061,21 @@ Copy the line below into the head tag in an HTML document.
 #### development
 
 ```html
+
 <script src='https://cdn.jsdelivr.net/npm/data-structure-typed/dist/umd/data-structure-typed.js'></script>
 ```
 
 #### production
 
 ```html
+
 <script src='https://cdn.jsdelivr.net/npm/data-structure-typed/dist/umd/data-structure-typed.min.js'></script>
 ```
 
 Copy the code below into the script tag of your HTML, and you're good to go with your development.
 
 ```js
-const {Heap} = dataStructureTyped;
+const { Heap } = dataStructureTyped;
 const {
   BinaryTree, Graph, Queue, Stack, PriorityQueue, BST, Trie, DoublyLinkedList,
   AVLTree, MinHeap, SinglyLinkedList, DirectedGraph, TreeMultiMap,

package/SPECIFICATION.md

@@ -45,7 +45,7 @@
 
 ### Use of Commonly Understood Industry Standard Naming
 
-- `enqueue`, `dequeue`, `push`, `pop`, `poll`, `addLast`, `addFirst`, `pollFirst`, `pollLast`, `isEmpty`, `clear`, `print`, `clone`.
+- `enqueue`, `dequeue`, `push`, `pop`, `poll`, `push`, `unshift`, `shift`, `pop`, `isEmpty`, `clear`, `print`, `clone`.
 
 ### Implementation of Customizable Features Whenever Possible
 
@@ -53,4 +53,4 @@
 
 ### Comprehensive Documentation
 
-- The documentation not only explains the purpose of methods but also annotates time and space complexity across the entire series.
+- The documentation not only explains the purpose of methods but also annotates time and space complexity across the entire series.

package/SPECIFICATION_zh-CN.md

@@ -0,0 +1,81 @@
+
+[NPM](https://www.npmjs.com/package/data-structure-typed)
+
+[Github](https://github.com/zrwusa/data-structure-typed)
+
+## Pain Points Addressed
+
+### Enhancing the Performance of Simulated Data Structures in JS/TS
+
+- `Queue`: While many resort to using Arrays to simulate Queues and Deques, the time complexity of Array.shift is O(n). We have tackled this challenge by implementing a Queue and Deque with O(1) time complexity for enqueue and dequeue operations.
+
+- `HashMap`: Opting for a pure HashMap over the built-in Map (technically a LinkedHashMap) can boost algorithmic speed. However, the performance is compromised due to the necessity of considering insertion order. We have independently implemented an optimized HashMap.
+
+- `Stack`: In JS, simulating a Stack with an Array is acceptable, and its performance is on par with a genuine Stack.
+
+### Introducing Missing Native Data Structures in JS/TS
+
+- `Heap / Priority Queue`: Algorithms with O(log n) time complexity have been pivotal in improving efficiency since the dawn of computers. A Heap supports insertion, deletion, and search with O(log n) time complexity, coupled with the ability to obtain the minimum / maximum value in O(1) time.
+
+- `Red Black Tree`: Developers well-versed in databases, file systems, Linux virtual memory management, and network routing tables often have a nuanced understanding of Red-Black Trees. It stands out as the least operation-intensive among all balanced binary search trees, offering optimal performance balance in CRUD operations.
+
+- `Linked List`: In scenarios where insertion or deletion of elements with O(1) time complexity is required at a specific index in an ordered collection, JS lacks a provided data structure. Hence, the need for a LinkedList to implement this functionality.
+
+- `Trie`: Efficient for fast string queries and space-efficient string storage, yet not commonly found in the standard libraries of most programming languages.
+
+- `Graph`: This data structure is not commonly found in the standard libraries of most languages, making it a non-issue in JS.
+
+## Advantages
+
+### Performance:
+
+- The performance of some ours data structures has surpassed JS's built-in data structures (`Queue`, `Deque`, `HashMap`), while most are comparable to or even surpass those in other languages. Some are still undergoing refinement (`Graph`, `AVL Tree`).
+
+### Uniformity
+
+- 1. Implementation or constraint of `forEach`, `filter`, `map`, `every`, `some`, `reduce`, `find`, `has`, `hasValue`, `get`, `print`, `isEmpty`, `clear`, `clone` methods in the base class.
+- 2. Use of generators to uniformly implement `[Symbol.iterator]`, `entries`, `keys`, `values`. Delaying iterator execution prevents performance loss and provides control during traversal.
+- 3. All deletion methods uniformly use the widely adopted `delete` in ES6, while addition methods uniformly use `add`. Compatibility with some specifications in Java.
+- 4. The first parameter for all constructors is data, and the second parameter is configuration, maintaining uniformity. The first parameter accepts any iterable type for seamless conversion between data structures.
+- 5. Uniform return types, for example, the `add` method consistently returns a boolean.
+
+### Convenience and Simplicity of APIs
+
+- Inspired by ES6, Java, ESNext, TypeScript, Python, featuring methods like `forEach`, `filter`, `map`, `every`, `some`, `reduce`, `find`, `has`, `hasValue` and `get`.
+
+### Use of Commonly Understood Industry Standard Naming
+
+- `enqueue`, `dequeue`, `push`, `pop`, `poll`, `push`, `unshift`, `shift`, `pop`, `isEmpty`, `clear`, `print`, `clone`.
+
+### Implementation of Customizable Features Whenever Possible
+
+- Such as providing callback functions (lambda expressions) for all traversal methods.
+
+### Comprehensive Documentation
+
+- The documentation not only explains the purpose of methods but also annotates time and space complexity across the entire series.
+
+像getter和setter是优于Java的getXxx和setXxx
+
+Java中
+添加元素（类似 push）：
+add(E element): 将元素添加到列表的末尾。
+add(int index, E element): 在指定的索引位置插入元素。
+
+移除元素（类似 pop）：
+remove(int index): 移除指定索引位置的元素。
+
+获取并移除首个元素（类似 shift）：
+remove(0): 移除索引为0的元素。
+
+在首位插入元素（类似 unshift）：
+add(0, E element): 在指定索引（0）处插入元素。
+
+
+大多数程序员更喜欢JS中的Array的push, pop, shift, unshift。
+
+原因有以下几点：
+
+命名更直观。JS中的push, pop, shift, unshift的命名更加直观，可以直接理解其操作的含义。而Java中的add和remove的命名则比较抽象，需要一定的理解才能理解其操作的含义。
+使用更方便。JS中的push, pop, shift, unshift的操作更加方便，只需要一个参数即可完成操作。而Java中的add和remove的操作则需要两个参数，第一个参数指定操作的索引，第二个参数指定操作的值。
+性能更高。JS中的push, pop, shift, unshift的性能更高，因为其操作只需要修改数组的长度即可完成。而Java中的add和remove的性能则较低，因为其操作需要移动数组中的元素。

package/{SPONSOR-zh-CN.md → SPONSOR_zh-CN.md}

@@ -68,7 +68,7 @@
 
 ### 使用通俗易懂业界常用命名
 
-- `enqueue`, `dequeue`, `push`, `pop`, `poll`, `addLast`, `addFirst`, `pollFirst`, `pollLast`, `isEmpty`, `clear`, `print`, `clone`
+- `enqueue`, `dequeue`, `push`, `pop`, `poll`, `push`, `unshift`, `shift`, `pop`, `isEmpty`, `clear`, `print`, `clone`
 
 ### 尽量实现可定制化功能