linked-list-typed 1.51.3 → 1.51.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (15) hide show
  1. package/README.md +5 -388
  2. package/dist/data-structures/binary-tree/binary-tree.js +2 -2
  3. package/dist/data-structures/binary-tree/bst.js +1 -1
  4. package/dist/data-structures/index.d.ts +1 -1
  5. package/dist/data-structures/index.js +1 -1
  6. package/dist/utils/index.d.ts +1 -0
  7. package/dist/utils/index.js +1 -0
  8. package/dist/utils/number.d.ts +1 -0
  9. package/dist/utils/number.js +11 -0
  10. package/package.json +2 -2
  11. package/src/data-structures/binary-tree/binary-tree.ts +2 -2
  12. package/src/data-structures/binary-tree/bst.ts +1 -1
  13. package/src/data-structures/index.ts +1 -1
  14. package/src/utils/index.ts +1 -0
  15. package/src/utils/number.ts +9 -0
package/README.md CHANGED
@@ -73,108 +73,7 @@ Doubly Linked List
73
73
  </tr>
74
74
  </thead>
75
75
  <tbody>
76
- <tr>
77
- <td>Binary Tree</td>
78
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
79
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
80
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryTree.html"><span>Binary Tree</span></a></td>
81
- </tr>
82
- <tr>
83
- <td>Binary Search Tree (BST)</td>
84
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
85
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
86
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/BST.html"><span>BST</span></a></td>
87
- </tr>
88
- <tr>
89
- <td>AVL Tree</td>
90
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
91
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
92
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/AVLTree.html"><span>AVLTree</span></a></td>
93
- </tr>
94
- <tr>
95
- <td>Red Black Tree</td>
96
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
97
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
98
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/RedBlackTree.html"><span>RedBlackTree</span></a></td>
99
- </tr>
100
- <tr>
101
- <td>Tree Multiset</td>
102
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
103
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
104
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/TreeMultimap.html"><span>TreeMultimap</span></a></td>
105
- </tr>
106
- <tr>
107
- <td>Segment Tree</td>
108
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
109
- <td></td>
110
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/SegmentTree.html"><span>SegmentTree</span></a></td>
111
- </tr>
112
- <tr>
113
- <td>Binary Indexed Tree</td>
114
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
115
- <td></td>
116
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryIndexedTree.html"><span>BinaryIndexedTree</span></a></td>
117
- </tr>
118
- <tr>
119
- <td>Heap</td>
120
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
121
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
122
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/Heap.html"><span>Heap</span></a></td>
123
- </tr>
124
- <tr>
125
- <td>Priority Queue</td>
126
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
127
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
128
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/PriorityQueue.html"><span>PriorityQueue</span></a></td>
129
- </tr>
130
- <tr>
131
- <td>Max Priority Queue</td>
132
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
133
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
134
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/MaxPriorityQueue.html"><span>MaxPriorityQueue</span></a></td>
135
- </tr>
136
- <tr>
137
- <td>Min Priority Queue</td>
138
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
139
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
140
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/MinPriorityQueue.html"><span>MinPriorityQueue</span></a></td>
141
- </tr>
142
- <tr>
143
- <td>Trie</td>
144
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
145
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
146
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/Trie.html"><span>Trie</span></a></td>
147
- </tr>
148
- <tr>
149
- <td>Graph</td>
150
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
151
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
152
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/AbstractGraph.html"><span>AbstractGraph</span></a></td>
153
- </tr>
154
- <tr>
155
- <td>Directed Graph</td>
156
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
157
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
158
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/DirectedGraph.html"><span>DirectedGraph</span></a></td>
159
- </tr>
160
- <tr>
161
- <td>Undirected Graph</td>
162
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
163
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
164
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/UndirectedGraph.html"><span>UndirectedGraph</span></a></td>
165
- </tr>
166
- <tr>
167
- <td>Queue</td>
168
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
169
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
170
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/Queue.html"><span>Queue</span></a></td>
171
- </tr>
172
- <tr>
173
- <td>Deque</td>
174
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
175
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
176
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/Deque.html"><span>Deque</span></a></td>
177
- </tr>
76
+
178
77
  <tr>
179
78
  <td>Linked List</td>
180
79
  <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
@@ -193,12 +92,6 @@ Doubly Linked List
193
92
  <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
194
93
  <td><a href="https://data-structure-typed-docs.vercel.app/classes/DoublyLinkedList.html"><span>DoublyLinkedList</span></a></td>
195
94
  </tr>
196
- <tr>
197
- <td>Stack</td>
198
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
199
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
200
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/Stack.html"><span>Stack</span></a></td>
201
- </tr>
202
95
  </tbody>
203
96
  </table>
204
97
 
@@ -214,30 +107,7 @@ Doubly Linked List
214
107
  </tr>
215
108
  </thead>
216
109
  <tbody>
217
- <tr>
218
- <td>Heap&lt;E&gt;</td>
219
- <td>priority_queue&lt;T&gt;</td>
220
- <td>PriorityQueue&lt;E&gt;</td>
221
- <td>heapq</td>
222
- </tr>
223
- <tr>
224
- <td>Deque&lt;E&gt;</td>
225
- <td>deque&lt;T&gt;</td>
226
- <td>ArrayDeque&lt;E&gt;</td>
227
- <td>deque</td>
228
- </tr>
229
- <tr>
230
- <td>Queue&lt;E&gt;</td>
231
- <td>queue&lt;T&gt;</td>
232
- <td>Queue&lt;E&gt;</td>
233
- <td>-</td>
234
- </tr>
235
- <tr>
236
- <td>HashMap&lt;K, V&gt;</td>
237
- <td>unordered_map&lt;K, V&gt;</td>
238
- <td>HashMap&lt;K, V&gt;</td>
239
- <td>defaultdict</td>
240
- </tr>
110
+
241
111
  <tr>
242
112
  <td>DoublyLinkedList&lt;E&gt;</td>
243
113
  <td>list&lt;T&gt;</td>
@@ -250,132 +120,6 @@ Doubly Linked List
250
120
  <td>-</td>
251
121
  <td>-</td>
252
122
  </tr>
253
- <tr>
254
- <td>BinaryTree&lt;K, V&gt;</td>
255
- <td>-</td>
256
- <td>-</td>
257
- <td>-</td>
258
- </tr>
259
- <tr>
260
- <td>BST&lt;K, V&gt;</td>
261
- <td>-</td>
262
- <td>-</td>
263
- <td>-</td>
264
- </tr>
265
- <tr>
266
- <td>RedBlackTree&lt;E&gt;</td>
267
- <td>set&lt;T&gt;</td>
268
- <td>TreeSet&lt;E&gt;</td>
269
- <td>-</td>
270
- </tr>
271
- <tr>
272
- <td>RedBlackTree&lt;K, V&gt;</td>
273
- <td>map&lt;K, V&gt;</td>
274
- <td>TreeMap&lt;K, V&gt;</td>
275
- <td>-</td>
276
- </tr>
277
- <tr>
278
- <td>TreeMultimap&lt;K, V&gt;</td>
279
- <td>multimap&lt;K, V&gt;</td>
280
- <td>-</td>
281
- <td>-</td>
282
- </tr>
283
- <tr>
284
- <td>-</td>
285
- <td>multiset&lt;T&gt;</td>
286
- <td>-</td>
287
- <td>-</td>
288
- </tr>
289
- <tr>
290
- <td>Trie</td>
291
- <td>-</td>
292
- <td>-</td>
293
- <td>-</td>
294
- </tr>
295
- <tr>
296
- <td>DirectedGraph&lt;V, E&gt;</td>
297
- <td>-</td>
298
- <td>-</td>
299
- <td>-</td>
300
- </tr>
301
- <tr>
302
- <td>UndirectedGraph&lt;V, E&gt;</td>
303
- <td>-</td>
304
- <td>-</td>
305
- <td>-</td>
306
- </tr>
307
- <tr>
308
- <td>PriorityQueue&lt;E&gt;</td>
309
- <td>priority_queue&lt;T&gt;</td>
310
- <td>PriorityQueue&lt;E&gt;</td>
311
- <td>-</td>
312
- </tr>
313
- <tr>
314
- <td>Array&lt;E&gt;</td>
315
- <td>vector&lt;T&gt;</td>
316
- <td>ArrayList&lt;E&gt;</td>
317
- <td>list</td>
318
- </tr>
319
- <tr>
320
- <td>Stack&lt;E&gt;</td>
321
- <td>stack&lt;T&gt;</td>
322
- <td>Stack&lt;E&gt;</td>
323
- <td>-</td>
324
- </tr>
325
- <tr>
326
- <td>Set&lt;E&gt;</td>
327
- <td>-</td>
328
- <td>HashSet&lt;E&gt;</td>
329
- <td>set</td>
330
- </tr>
331
- <tr>
332
- <td>Map&lt;K, V&gt;</td>
333
- <td>-</td>
334
- <td>HashMap&lt;K, V&gt;</td>
335
- <td>dict</td>
336
- </tr>
337
- <tr>
338
- <td>-</td>
339
- <td>unordered_set&lt;T&gt;</td>
340
- <td>HashSet&lt;E&gt;</td>
341
- <td>-</td>
342
- </tr>
343
- <tr>
344
- <td>Map&lt;K, V&gt;</td>
345
- <td>-</td>
346
- <td>-</td>
347
- <td>OrderedDict</td>
348
- </tr>
349
- <tr>
350
- <td>-</td>
351
- <td>unordered_multiset</td>
352
- <td>-</td>
353
- <td>Counter</td>
354
- </tr>
355
- <tr>
356
- <td>-</td>
357
- <td>-</td>
358
- <td>LinkedHashSet&lt;E&gt;</td>
359
- <td>-</td>
360
- </tr>
361
- <tr>
362
- <td>HashMap&lt;K, V&gt;</td>
363
- <td>-</td>
364
- <td>LinkedHashMap&lt;K, V&gt;</td>
365
- <td>-</td>
366
- </tr>
367
- <tr>
368
- <td>-</td>
369
- <td>unordered_multimap&lt;K, V&gt;</td>
370
- <td>-</td>
371
- <td>-</td>
372
- </tr>
373
- <tr>
374
- <td>-</td>
375
- <td>bitset&lt;N&gt;</td>
376
- <td>-</td>
377
- <td>-</td>
378
- </tr>
379
123
  </tbody>
380
124
  </table>
381
125
 
@@ -383,53 +127,12 @@ Doubly Linked List
383
127
 
384
128
  [//]: # (No deletion!!! Start of Replace Section)
385
129
  <div class="json-to-html-collapse clearfix 0">
386
- <div class='collapsible level0' ><span class='json-to-html-label'>avl-tree</span></div>
387
- <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>31.32</td><td>31.93</td><td>3.67e-4</td></tr><tr><td>10,000 add & delete randomly</td><td>70.90</td><td>14.10</td><td>0.00</td></tr><tr><td>10,000 addMany</td><td>40.58</td><td>24.64</td><td>4.87e-4</td></tr><tr><td>10,000 get</td><td>27.31</td><td>36.62</td><td>2.00e-4</td></tr></table></div>
388
- </div><div class="json-to-html-collapse clearfix 0">
389
- <div class='collapsible level0' ><span class='json-to-html-label'>binary-tree</span></div>
390
- <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.35</td><td>80.99</td><td>7.17e-5</td></tr><tr><td>1,000 add & delete randomly</td><td>15.98</td><td>62.58</td><td>7.98e-4</td></tr><tr><td>1,000 addMany</td><td>10.96</td><td>91.27</td><td>0.00</td></tr><tr><td>1,000 get</td><td>18.61</td><td>53.73</td><td>0.00</td></tr><tr><td>1,000 dfs</td><td>164.20</td><td>6.09</td><td>0.04</td></tr><tr><td>1,000 bfs</td><td>58.84</td><td>17.00</td><td>0.01</td></tr><tr><td>1,000 morris</td><td>256.66</td><td>3.90</td><td>7.70e-4</td></tr></table></div>
391
- </div><div class="json-to-html-collapse clearfix 0">
392
- <div class='collapsible level0' ><span class='json-to-html-label'>bst</span></div>
393
- <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>31.59</td><td>31.66</td><td>2.74e-4</td></tr><tr><td>10,000 add & delete randomly</td><td>74.56</td><td>13.41</td><td>8.32e-4</td></tr><tr><td>10,000 addMany</td><td>29.16</td><td>34.30</td><td>0.00</td></tr><tr><td>10,000 get</td><td>29.24</td><td>34.21</td><td>0.00</td></tr></table></div>
394
- </div><div class="json-to-html-collapse clearfix 0">
395
- <div class='collapsible level0' ><span class='json-to-html-label'>rb-tree</span></div>
396
- <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>85.85</td><td>11.65</td><td>0.00</td></tr><tr><td>100,000 add & delete randomly</td><td>211.54</td><td>4.73</td><td>0.00</td></tr><tr><td>100,000 getNode</td><td>37.92</td><td>26.37</td><td>1.65e-4</td></tr></table></div>
397
- </div><div class="json-to-html-collapse clearfix 0">
398
- <div class='collapsible level0' ><span class='json-to-html-label'>comparison</span></div>
399
- <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>SRC PQ 10,000 add</td><td>0.57</td><td>1748.73</td><td>4.96e-6</td></tr><tr><td>CJS PQ 10,000 add</td><td>0.57</td><td>1746.69</td><td>4.91e-6</td></tr><tr><td>MJS PQ 10,000 add</td><td>0.57</td><td>1749.68</td><td>4.43e-6</td></tr><tr><td>SRC PQ 10,000 add & pop</td><td>3.47</td><td>288.14</td><td>6.38e-4</td></tr><tr><td>CJS PQ 10,000 add & pop</td><td>3.39</td><td>295.36</td><td>3.90e-5</td></tr><tr><td>MJS PQ 10,000 add & pop</td><td>3.37</td><td>297.17</td><td>3.03e-5</td></tr></table></div>
400
- </div><div class="json-to-html-collapse clearfix 0">
401
- <div class='collapsible level0' ><span class='json-to-html-label'>directed-graph</span></div>
402
- <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>9534.93</td><td>8.72e-7</td></tr><tr><td>1,000 addEdge</td><td>6.30</td><td>158.67</td><td>0.00</td></tr><tr><td>1,000 getVertex</td><td>0.05</td><td>2.16e+4</td><td>3.03e-7</td></tr><tr><td>1,000 getEdge</td><td>22.31</td><td>44.82</td><td>0.00</td></tr><tr><td>tarjan</td><td>210.90</td><td>4.74</td><td>0.01</td></tr><tr><td>tarjan all</td><td>214.72</td><td>4.66</td><td>0.01</td></tr><tr><td>topologicalSort</td><td>172.52</td><td>5.80</td><td>0.00</td></tr></table></div>
403
- </div><div class="json-to-html-collapse clearfix 0">
404
- <div class='collapsible level0' ><span class='json-to-html-label'>hash-map</span></div>
405
- <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>275.88</td><td>3.62</td><td>0.12</td></tr><tr><td>1,000,000 Map set</td><td>211.66</td><td>4.72</td><td>0.01</td></tr><tr><td>1,000,000 Set add</td><td>177.72</td><td>5.63</td><td>0.02</td></tr><tr><td>1,000,000 set & get</td><td>317.60</td><td>3.15</td><td>0.02</td></tr><tr><td>1,000,000 Map set & get</td><td>274.99</td><td>3.64</td><td>0.03</td></tr><tr><td>1,000,000 Set add & has</td><td>172.23</td><td>5.81</td><td>0.02</td></tr><tr><td>1,000,000 ObjKey set & get</td><td>929.40</td><td>1.08</td><td>0.07</td></tr><tr><td>1,000,000 Map ObjKey set & get</td><td>310.02</td><td>3.23</td><td>0.05</td></tr><tr><td>1,000,000 Set ObjKey add & has</td><td>283.28</td><td>3.53</td><td>0.04</td></tr></table></div>
406
- </div><div class="json-to-html-collapse clearfix 0">
407
- <div class='collapsible level0' ><span class='json-to-html-label'>heap</span></div>
408
- <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>5.80</td><td>172.35</td><td>8.78e-5</td></tr><tr><td>10,000 fib add & pop</td><td>357.92</td><td>2.79</td><td>0.00</td></tr></table></div>
409
- </div><div class="json-to-html-collapse clearfix 0">
410
130
  <div class='collapsible level0' ><span class='json-to-html-label'>doubly-linked-list</span></div>
411
131
  <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>221.57</td><td>4.51</td><td>0.03</td></tr><tr><td>1,000,000 unshift</td><td>229.02</td><td>4.37</td><td>0.07</td></tr><tr><td>1,000,000 unshift & shift</td><td>169.21</td><td>5.91</td><td>0.02</td></tr><tr><td>1,000,000 insertBefore</td><td>314.48</td><td>3.18</td><td>0.07</td></tr></table></div>
412
- </div><div class="json-to-html-collapse clearfix 0">
132
+ </div>
133
+ <div class="json-to-html-collapse clearfix 0">
413
134
  <div class='collapsible level0' ><span class='json-to-html-label'>singly-linked-list</span></div>
414
135
  <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>212.98</td><td>4.70</td><td>0.01</td></tr><tr><td>10,000 insertBefore</td><td>250.68</td><td>3.99</td><td>0.01</td></tr></table></div>
415
- </div><div class="json-to-html-collapse clearfix 0">
416
- <div class='collapsible level0' ><span class='json-to-html-label'>max-priority-queue</span></div>
417
- <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>8.91</td><td>112.29</td><td>2.26e-4</td></tr></table></div>
418
- </div><div class="json-to-html-collapse clearfix 0">
419
- <div class='collapsible level0' ><span class='json-to-html-label'>priority-queue</span></div>
420
- <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 & pop</td><td>103.59</td><td>9.65</td><td>0.00</td></tr></table></div>
421
- </div><div class="json-to-html-collapse clearfix 0">
422
- <div class='collapsible level0' ><span class='json-to-html-label'>deque</span></div>
423
- <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>14.55</td><td>68.72</td><td>6.91e-4</td></tr><tr><td>1,000,000 push & pop</td><td>23.40</td><td>42.73</td><td>5.94e-4</td></tr><tr><td>1,000,000 push & shift</td><td>24.41</td><td>40.97</td><td>1.45e-4</td></tr><tr><td>1,000,000 unshift & shift</td><td>22.56</td><td>44.32</td><td>1.30e-4</td></tr></table></div>
424
- </div><div class="json-to-html-collapse clearfix 0">
425
- <div class='collapsible level0' ><span class='json-to-html-label'>queue</span></div>
426
- <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.90</td><td>25.07</td><td>0.01</td></tr><tr><td>1,000,000 push & shift</td><td>81.79</td><td>12.23</td><td>0.00</td></tr></table></div>
427
- </div><div class="json-to-html-collapse clearfix 0">
428
- <div class='collapsible level0' ><span class='json-to-html-label'>stack</span></div>
429
- <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>37.60</td><td>26.60</td><td>0.00</td></tr><tr><td>1,000,000 push & pop</td><td>47.01</td><td>21.27</td><td>0.00</td></tr></table></div>
430
- </div><div class="json-to-html-collapse clearfix 0">
431
- <div class='collapsible level0' ><span class='json-to-html-label'>trie</span></div>
432
- <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>45.97</td><td>21.76</td><td>0.00</td></tr><tr><td>100,000 getWords</td><td>66.20</td><td>15.11</td><td>0.00</td></tr></table></div>
433
136
  </div>
434
137
 
435
138
  [//]: # (No deletion!!! End of Replace Section)
@@ -445,93 +148,7 @@ Doubly Linked List
445
148
  </tr>
446
149
  </thead>
447
150
  <tbody>
448
- <tr>
449
- <td>Binary Tree DFS</td>
450
- <td>Traverse a binary tree in a depth-first manner, starting from the root node, first visiting the left subtree,
451
- and then the right subtree, using recursion.
452
- </td>
453
- <td>Recursion + Iteration</td>
454
- </tr>
455
- <tr>
456
- <td>Binary Tree BFS</td>
457
- <td>Traverse a binary tree in a breadth-first manner, starting from the root node, visiting nodes level by level
458
- from left to right.
459
- </td>
460
- <td>Iteration</td>
461
- </tr>
462
- <tr>
463
- <td>Graph DFS</td>
464
- <td>Traverse a graph in a depth-first manner, starting from a given node, exploring along one path as deeply as
465
- possible, and backtracking to explore other paths. Used for finding connected components, paths, etc.
466
- </td>
467
- <td>Recursion + Iteration</td>
468
- </tr>
469
- <tr>
470
- <td>Binary Tree Morris</td>
471
- <td>Morris traversal is an in-order traversal algorithm for binary trees with O(1) space complexity. It allows tree
472
- traversal without additional stack or recursion.
473
- </td>
474
- <td>Iteration</td>
475
- </tr>
476
- <tr>
477
- <td>Graph BFS</td>
478
- <td>Traverse a graph in a breadth-first manner, starting from a given node, first visiting nodes directly connected
479
- to the starting node, and then expanding level by level. Used for finding shortest paths, etc.
480
- </td>
481
- <td>Recursion + Iteration</td>
482
- </tr>
483
- <tr>
484
- <td>Graph Tarjan's Algorithm</td>
485
- <td>Find strongly connected components in a graph, typically implemented using depth-first search.</td>
486
- <td>Recursion</td>
487
- </tr>
488
- <tr>
489
- <td>Graph Bellman-Ford Algorithm</td>
490
- <td>Finding the shortest paths from a single source, can handle negative weight edges</td>
491
- <td>Iteration</td>
492
- </tr>
493
- <tr>
494
- <td>Graph Dijkstra's Algorithm</td>
495
- <td>Finding the shortest paths from a single source, cannot handle negative weight edges</td>
496
- <td>Iteration</td>
497
- </tr>
498
- <tr>
499
- <td>Graph Floyd-Warshall Algorithm</td>
500
- <td>Finding the shortest paths between all pairs of nodes</td>
501
- <td>Iteration</td>
502
- </tr>
503
- <tr>
504
- <td>Graph getCycles</td>
505
- <td>Find all cycles in a graph or detect the presence of cycles.</td>
506
- <td>Recursion</td>
507
- </tr>
508
- <tr>
509
- <td>Graph getCutVertexes</td>
510
- <td>Find cut vertices in a graph, which are nodes that, when removed, increase the number of connected components in
511
- the graph.
512
- </td>
513
- <td>Recursion</td>
514
- </tr>
515
- <tr>
516
- <td>Graph getSCCs</td>
517
- <td>Find strongly connected components in a graph, which are subgraphs where any two nodes can reach each other.
518
- </td>
519
- <td>Recursion</td>
520
- </tr>
521
- <tr>
522
- <td>Graph getBridges</td>
523
- <td>Find bridges in a graph, which are edges that, when removed, increase the number of connected components in the
524
- graph.
525
- </td>
526
- <td>Recursion</td>
527
- </tr>
528
- <tr>
529
- <td>Graph topologicalSort</td>
530
- <td>Perform topological sorting on a directed acyclic graph (DAG) to find a linear order of nodes such that all
531
- directed edges go from earlier nodes to later nodes.
532
- </td>
533
- <td>Recursion</td>
534
- </tr>
151
+
535
152
  </tbody>
536
153
  </table>
537
154
 
package/dist/data-structures/binary-tree/binary-tree.js CHANGED
@@ -266,9 +266,9 @@ class BinaryTree extends base_1.IterableEntryBase {
266
266
  * @returns a boolean value.
267
267
  */
268
268
  isRealNode(node) {
269
- if (!this.isNode(node))
269
+ if (node === this.NIL || node === null || node === undefined)
270
270
  return false;
271
- return node !== this.NIL;
271
+ return this.isNode(node);
272
272
  }
273
273
  /**
274
274
  * The function checks if a given node is a BinaryTreeNode instance and has a key value of NaN.
package/dist/data-structures/binary-tree/bst.js CHANGED
@@ -608,7 +608,7 @@ class BST extends binary_tree_1.BinaryTree {
608
608
  if (!current)
609
609
  return undefined;
610
610
  if (this._variant === 'STANDARD') {
611
- // For BSTVariant.MIN, find the rightmost node
611
+ // For 'STANDARD', find the rightmost node
612
612
  while (current.right !== undefined) {
613
613
  current = current.right;
614
614
  }
package/dist/data-structures/index.d.ts CHANGED
@@ -4,9 +4,9 @@ export * from './stack';
4
4
  export * from './queue';
5
5
  export * from './graph';
6
6
  export * from './binary-tree';
7
- export * from './tree';
8
7
  export * from './heap';
9
8
  export * from './priority-queue';
10
9
  export * from './matrix';
11
10
  export * from './trie';
12
11
  export * from './base';
12
+ export * from './tree';
package/dist/data-structures/index.js CHANGED
@@ -20,9 +20,9 @@ __exportStar(require("./stack"), exports);
20
20
  __exportStar(require("./queue"), exports);
21
21
  __exportStar(require("./graph"), exports);
22
22
  __exportStar(require("./binary-tree"), exports);
23
- __exportStar(require("./tree"), exports);
24
23
  __exportStar(require("./heap"), exports);
25
24
  __exportStar(require("./priority-queue"), exports);
26
25
  __exportStar(require("./matrix"), exports);
27
26
  __exportStar(require("./trie"), exports);
28
27
  __exportStar(require("./base"), exports);
28
+ __exportStar(require("./tree"), exports);
package/dist/utils/index.d.ts CHANGED
@@ -1 +1,2 @@
1
1
  export * from './utils';
2
+ export * from './number';
package/dist/utils/index.js CHANGED
@@ -15,3 +15,4 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
15
15
  };
16
16
  Object.defineProperty(exports, "__esModule", { value: true });
17
17
  __exportStar(require("./utils"), exports);
18
+ __exportStar(require("./number"), exports);
package/dist/utils/number.d.ts ADDED
@@ -0,0 +1 @@
1
+ export declare function toBinaryString(num: number, digit?: number): string;
package/dist/utils/number.js ADDED
@@ -0,0 +1,11 @@
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ exports.toBinaryString = void 0;
4
+ function toBinaryString(num, digit = 32) {
5
+ // Convert number to binary string
6
+ let binaryString = (num >>> 0).toString(2); // Use the unsigned right shift operator to ensure you get a binary representation of a 32-bit unsigned integer
7
+ // Use pad Start to ensure the string length is 32 bits
8
+ binaryString = binaryString.padStart(digit, '0');
9
+ return binaryString;
10
+ }
11
+ exports.toBinaryString = toBinaryString;
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "linked-list-typed",
3
- "version": "1.51.3",
3
+ "version": "1.51.4",
4
4
  "description": "Linked List, Doubly Linked List, Singly Linked List. Javascript & Typescript Data Structure.",
5
5
  "main": "dist/index.js",
6
6
  "scripts": {
@@ -66,6 +66,6 @@
66
66
  "typescript": "^4.9.5"
67
67
  },
68
68
  "dependencies": {
69
- "data-structure-typed": "^1.51.3"
69
+ "data-structure-typed": "^1.51.4"
70
70
  }
71
71
  }
package/src/data-structures/binary-tree/binary-tree.ts CHANGED
@@ -316,8 +316,8 @@ export class BinaryTree<
316
316
  * @returns a boolean value.
317
317
  */
318
318
  isRealNode(node: KeyOrNodeOrEntry<K, V, NODE>): node is NODE {
319
- if (!this.isNode(node)) return false;
320
- return node !== this.NIL;
319
+ if (node === this.NIL || node === null || node === undefined) return false;
320
+ return this.isNode(node);
321
321
  }
322
322
 
323
323
  /**
package/src/data-structures/binary-tree/bst.ts CHANGED
@@ -695,7 +695,7 @@ export class BST<
695
695
  if (!current) return undefined;
696
696
 
697
697
  if (this._variant === 'STANDARD') {
698
- // For BSTVariant.MIN, find the rightmost node
698
+ // For 'STANDARD', find the rightmost node
699
699
  while (current.right !== undefined) {
700
700
  current = current.right;
701
701
  }
package/src/data-structures/index.ts CHANGED
@@ -4,9 +4,9 @@ export * from './stack';
4
4
  export * from './queue';
5
5
  export * from './graph';
6
6
  export * from './binary-tree';
7
- export * from './tree';
8
7
  export * from './heap';
9
8
  export * from './priority-queue';
10
9
  export * from './matrix';
11
10
  export * from './trie';
12
11
  export * from './base';
12
+ export * from './tree';
package/src/utils/index.ts CHANGED
@@ -1 +1,2 @@
1
1
  export * from './utils';
2
+ export * from './number';
package/src/utils/number.ts ADDED
@@ -0,0 +1,9 @@
1
+ export function toBinaryString(num: number, digit = 32) {
2
+ // Convert number to binary string
3
+ let binaryString = (num >>> 0).toString(2); // Use the unsigned right shift operator to ensure you get a binary representation of a 32-bit unsigned integer
4
+
5
+ // Use pad Start to ensure the string length is 32 bits
6
+ binaryString = binaryString.padStart(digit, '0');
7
+
8
+ return binaryString;
9
+ }