data-structure-typed 1.34.4 → 1.34.6
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.
package/CHANGELOG.md
CHANGED
|
@@ -8,7 +8,7 @@ All notable changes to this project will be documented in this file.
|
|
|
8
8
|
- [Semantic Versioning](https://semver.org/spec/v2.0.0.html)
|
|
9
9
|
- [`auto-changelog`](https://github.com/CookPete/auto-changelog)
|
|
10
10
|
|
|
11
|
-
## [v1.34.
|
|
11
|
+
## [v1.34.6](https://github.com/zrwusa/data-structure-typed/compare/v1.34.1...main) (upcoming)
|
|
12
12
|
|
|
13
13
|
## [v1.34.1](https://github.com/zrwusa/data-structure-typed/compare/v1.33.4...v1.34.1) (6 October 2023)
|
|
14
14
|
|
package/README.md
CHANGED
|
@@ -426,176 +426,176 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
|
|
|
426
426
|
|
|
427
427
|
<table>
|
|
428
428
|
<thead>
|
|
429
|
-
|
|
430
|
-
|
|
431
|
-
|
|
432
|
-
|
|
433
|
-
|
|
434
|
-
|
|
435
|
-
|
|
429
|
+
<tr>
|
|
430
|
+
<th>Data Structure</th>
|
|
431
|
+
<th>Data Structure Typed</th>
|
|
432
|
+
<th>C++ std</th>
|
|
433
|
+
<th>java.util</th>
|
|
434
|
+
<th>Python collections</th>
|
|
435
|
+
</tr>
|
|
436
436
|
</thead>
|
|
437
437
|
<tbody>
|
|
438
|
-
|
|
439
|
-
|
|
440
|
-
|
|
441
|
-
|
|
442
|
-
|
|
443
|
-
|
|
444
|
-
|
|
445
|
-
|
|
446
|
-
|
|
447
|
-
|
|
448
|
-
|
|
449
|
-
|
|
450
|
-
|
|
451
|
-
|
|
452
|
-
|
|
453
|
-
|
|
454
|
-
|
|
455
|
-
|
|
456
|
-
|
|
457
|
-
|
|
458
|
-
|
|
459
|
-
|
|
460
|
-
|
|
461
|
-
|
|
462
|
-
|
|
463
|
-
|
|
464
|
-
|
|
465
|
-
|
|
466
|
-
|
|
467
|
-
|
|
468
|
-
|
|
469
|
-
|
|
470
|
-
|
|
471
|
-
|
|
472
|
-
|
|
473
|
-
|
|
474
|
-
|
|
475
|
-
|
|
476
|
-
|
|
477
|
-
|
|
478
|
-
|
|
479
|
-
|
|
480
|
-
|
|
481
|
-
|
|
482
|
-
|
|
483
|
-
|
|
484
|
-
|
|
485
|
-
|
|
486
|
-
|
|
487
|
-
|
|
488
|
-
|
|
489
|
-
|
|
490
|
-
|
|
491
|
-
|
|
492
|
-
|
|
493
|
-
|
|
494
|
-
|
|
495
|
-
|
|
496
|
-
|
|
497
|
-
|
|
498
|
-
|
|
499
|
-
|
|
500
|
-
|
|
501
|
-
|
|
502
|
-
|
|
503
|
-
|
|
504
|
-
|
|
505
|
-
|
|
506
|
-
|
|
507
|
-
|
|
508
|
-
|
|
509
|
-
|
|
510
|
-
|
|
511
|
-
|
|
512
|
-
|
|
513
|
-
|
|
514
|
-
|
|
515
|
-
|
|
516
|
-
|
|
517
|
-
|
|
518
|
-
|
|
519
|
-
|
|
520
|
-
|
|
521
|
-
|
|
522
|
-
|
|
523
|
-
|
|
524
|
-
|
|
525
|
-
|
|
526
|
-
|
|
527
|
-
|
|
528
|
-
|
|
529
|
-
|
|
530
|
-
|
|
531
|
-
|
|
532
|
-
|
|
533
|
-
|
|
534
|
-
|
|
535
|
-
|
|
536
|
-
|
|
537
|
-
|
|
538
|
-
|
|
539
|
-
|
|
540
|
-
|
|
541
|
-
|
|
542
|
-
|
|
543
|
-
|
|
544
|
-
|
|
545
|
-
|
|
546
|
-
|
|
547
|
-
|
|
548
|
-
|
|
549
|
-
|
|
550
|
-
|
|
551
|
-
|
|
552
|
-
|
|
553
|
-
|
|
554
|
-
|
|
555
|
-
|
|
556
|
-
|
|
557
|
-
|
|
558
|
-
|
|
559
|
-
|
|
560
|
-
|
|
561
|
-
|
|
562
|
-
|
|
563
|
-
|
|
564
|
-
|
|
565
|
-
|
|
566
|
-
|
|
567
|
-
|
|
568
|
-
|
|
569
|
-
|
|
570
|
-
|
|
571
|
-
|
|
572
|
-
|
|
573
|
-
|
|
574
|
-
|
|
575
|
-
|
|
576
|
-
|
|
577
|
-
|
|
578
|
-
|
|
579
|
-
|
|
580
|
-
|
|
581
|
-
|
|
582
|
-
|
|
583
|
-
|
|
584
|
-
|
|
585
|
-
|
|
586
|
-
|
|
587
|
-
|
|
588
|
-
|
|
589
|
-
|
|
590
|
-
|
|
591
|
-
|
|
592
|
-
|
|
593
|
-
|
|
594
|
-
|
|
595
|
-
|
|
596
|
-
|
|
597
|
-
|
|
598
|
-
|
|
438
|
+
<tr>
|
|
439
|
+
<td>Dynamic Array</td>
|
|
440
|
+
<td>Array<E></td>
|
|
441
|
+
<td>vector<T></td>
|
|
442
|
+
<td>ArrayList<E></td>
|
|
443
|
+
<td>list</td>
|
|
444
|
+
</tr>
|
|
445
|
+
<tr>
|
|
446
|
+
<td>Linked List</td>
|
|
447
|
+
<td>DoublyLinkedList<E></td>
|
|
448
|
+
<td>list<T></td>
|
|
449
|
+
<td>LinkedList<E></td>
|
|
450
|
+
<td>deque</td>
|
|
451
|
+
</tr>
|
|
452
|
+
<tr>
|
|
453
|
+
<td>Set</td>
|
|
454
|
+
<td>Set<E></td>
|
|
455
|
+
<td>set<T></td>
|
|
456
|
+
<td>HashSet<E></td>
|
|
457
|
+
<td>set</td>
|
|
458
|
+
</tr>
|
|
459
|
+
<tr>
|
|
460
|
+
<td>Map</td>
|
|
461
|
+
<td>Map<K, V></td>
|
|
462
|
+
<td>map<K, V></td>
|
|
463
|
+
<td>HashMap<K, V></td>
|
|
464
|
+
<td>dict</td>
|
|
465
|
+
</tr>
|
|
466
|
+
<tr>
|
|
467
|
+
<td>Unordered Set</td>
|
|
468
|
+
<td>-</td>
|
|
469
|
+
<td>unordered_set<T></td>
|
|
470
|
+
<td>HashSet<E></td>
|
|
471
|
+
<td>-</td>
|
|
472
|
+
</tr>
|
|
473
|
+
<tr>
|
|
474
|
+
<td>Unordered Map</td>
|
|
475
|
+
<td>HashMap<K, V></td>
|
|
476
|
+
<td>unordered_map<K, V></td>
|
|
477
|
+
<td>HashMap<K, V></td>
|
|
478
|
+
<td>defaultdict</td>
|
|
479
|
+
</tr>
|
|
480
|
+
<tr>
|
|
481
|
+
<td>Queue</td>
|
|
482
|
+
<td>Queue<E></td>
|
|
483
|
+
<td>queue<T></td>
|
|
484
|
+
<td>Queue<E></td>
|
|
485
|
+
<td>-</td>
|
|
486
|
+
</tr>
|
|
487
|
+
<tr>
|
|
488
|
+
<td>Priority Queue</td>
|
|
489
|
+
<td>PriorityQueue<E></td>
|
|
490
|
+
<td>priority_queue<T></td>
|
|
491
|
+
<td>PriorityQueue<E></td>
|
|
492
|
+
<td>-</td>
|
|
493
|
+
</tr>
|
|
494
|
+
<tr>
|
|
495
|
+
<td>Stack</td>
|
|
496
|
+
<td>Stack<E></td>
|
|
497
|
+
<td>stack<T></td>
|
|
498
|
+
<td>Stack<E></td>
|
|
499
|
+
<td>-</td>
|
|
500
|
+
</tr>
|
|
501
|
+
<tr>
|
|
502
|
+
<td>Bitset</td>
|
|
503
|
+
<td>-</td>
|
|
504
|
+
<td>bitset<N></td>
|
|
505
|
+
<td>-</td>
|
|
506
|
+
<td>-</td>
|
|
507
|
+
</tr>
|
|
508
|
+
<tr>
|
|
509
|
+
<td>Deque</td>
|
|
510
|
+
<td>Deque<E></td>
|
|
511
|
+
<td>deque<T></td>
|
|
512
|
+
<td>-</td>
|
|
513
|
+
<td>-</td>
|
|
514
|
+
</tr>
|
|
515
|
+
<tr>
|
|
516
|
+
<td>Multiset</td>
|
|
517
|
+
<td>-</td>
|
|
518
|
+
<td>multiset<T></td>
|
|
519
|
+
<td>-</td>
|
|
520
|
+
<td>-</td>
|
|
521
|
+
</tr>
|
|
522
|
+
<tr>
|
|
523
|
+
<td>Multimap</td>
|
|
524
|
+
<td>-</td>
|
|
525
|
+
<td>multimap<K, V></td>
|
|
526
|
+
<td>-</td>
|
|
527
|
+
<td>-</td>
|
|
528
|
+
</tr>
|
|
529
|
+
<tr>
|
|
530
|
+
<td>Unordered Multiset</td>
|
|
531
|
+
<td>-</td>
|
|
532
|
+
<td>unordered_multiset</td>
|
|
533
|
+
<td>Counter</td>
|
|
534
|
+
<td>-</td>
|
|
535
|
+
</tr>
|
|
536
|
+
<tr>
|
|
537
|
+
<td>Ordered Dictionary</td>
|
|
538
|
+
<td>Map<K, V></td>
|
|
539
|
+
<td>-</td>
|
|
540
|
+
<td>-</td>
|
|
541
|
+
<td>OrderedDict</td>
|
|
542
|
+
</tr>
|
|
543
|
+
<tr>
|
|
544
|
+
<td>Linked Hash Set</td>
|
|
545
|
+
<td>-</td>
|
|
546
|
+
<td>-</td>
|
|
547
|
+
<td>LinkedHashSet<E></td>
|
|
548
|
+
<td>-</td>
|
|
549
|
+
</tr>
|
|
550
|
+
<tr>
|
|
551
|
+
<td>Linked Hash Map</td>
|
|
552
|
+
<td>-</td>
|
|
553
|
+
<td>-</td>
|
|
554
|
+
<td>LinkedHashMap<K, V></td>
|
|
555
|
+
<td>-</td>
|
|
556
|
+
</tr>
|
|
557
|
+
<tr>
|
|
558
|
+
<td>Sorted Set</td>
|
|
559
|
+
<td>AVLTree<E></td>
|
|
560
|
+
<td>-</td>
|
|
561
|
+
<td>TreeSet<E></td>
|
|
562
|
+
<td>-</td>
|
|
563
|
+
</tr>
|
|
564
|
+
<tr>
|
|
565
|
+
<td>Sorted Map</td>
|
|
566
|
+
<td>AVLTree<K, V></td>
|
|
567
|
+
<td>-</td>
|
|
568
|
+
<td>TreeMap<K, V></td>
|
|
569
|
+
<td>-</td>
|
|
570
|
+
</tr>
|
|
571
|
+
<tr>
|
|
572
|
+
<td>Tree Set</td>
|
|
573
|
+
<td>AVLTree<E></td>
|
|
574
|
+
<td>set</td>
|
|
575
|
+
<td>TreeSet<E></td>
|
|
576
|
+
<td>-</td>
|
|
577
|
+
</tr>
|
|
578
|
+
<tr>
|
|
579
|
+
<td>Persistent Collections</td>
|
|
580
|
+
<td>-</td>
|
|
581
|
+
<td>-</td>
|
|
582
|
+
<td>-</td>
|
|
583
|
+
<td>-</td>
|
|
584
|
+
</tr>
|
|
585
|
+
<tr>
|
|
586
|
+
<td>unordered multiset</td>
|
|
587
|
+
<td>-</td>
|
|
588
|
+
<td>unordered_multiset<T></td>
|
|
589
|
+
<td>-</td>
|
|
590
|
+
<td>-</td>
|
|
591
|
+
</tr>
|
|
592
|
+
<tr>
|
|
593
|
+
<td>Unordered Multimap</td>
|
|
594
|
+
<td>unordered_multimap<K, V></td>
|
|
595
|
+
<td>-</td>
|
|
596
|
+
<td>-</td>
|
|
597
|
+
<td>-</td>
|
|
598
|
+
</tr>
|
|
599
599
|
</tbody>
|
|
600
600
|
</table>
|
|
601
601
|
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "data-structure-typed",
|
|
3
|
-
"version": "1.34.
|
|
3
|
+
"version": "1.34.6",
|
|
4
4
|
"description": "Data Structures of Javascript & TypeScript. Binary Tree, BST, Graph, Heap, Priority Queue, Linked List, Queue, Deque, Stack, AVL Tree, Tree Multiset, Trie, Directed Graph, Undirected Graph, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue.",
|
|
5
5
|
"main": "dist/index.js",
|
|
6
6
|
"module": "lib/index.js",
|
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import {MinPriorityQueue
|
|
1
|
+
import {MinPriorityQueue} from '../../../../src';
|
|
2
2
|
|
|
3
3
|
describe('MinPriorityQueue Operation Test', () => {
|
|
4
4
|
it('should check if a node exists in the queue', () => {
|
|
@@ -60,46 +60,4 @@ describe('MinPriorityQueue Operation Test', () => {
|
|
|
60
60
|
const sortedArray = priorityQueue.sort();
|
|
61
61
|
expect(sortedArray).toEqual([1, 3, 5, 7]);
|
|
62
62
|
});
|
|
63
|
-
|
|
64
|
-
it('should PriorityQueue poll, pee, heapify, toArray work well', function () {
|
|
65
|
-
const minPQ = new PriorityQueue<number>({nodes: [5, 2, 3, 4, 6, 1], comparator: (a, b) => a - b});
|
|
66
|
-
expect(minPQ.toArray()).toEqual([1, 2, 3, 4, 6, 5]);
|
|
67
|
-
minPQ.poll();
|
|
68
|
-
minPQ.poll();
|
|
69
|
-
minPQ.poll();
|
|
70
|
-
expect(minPQ.toArray()).toEqual([4, 5, 6]);
|
|
71
|
-
expect(minPQ.peek()).toBe(4);
|
|
72
|
-
expect(
|
|
73
|
-
PriorityQueue.heapify({
|
|
74
|
-
nodes: [3, 2, 1, 5, 6, 7, 8, 9, 10],
|
|
75
|
-
comparator: (a, b) => a - b
|
|
76
|
-
}).toArray()
|
|
77
|
-
).toEqual([1, 2, 3, 5, 6, 7, 8, 9, 10]);
|
|
78
|
-
});
|
|
79
|
-
|
|
80
|
-
it('should Max PriorityQueue poll, peek, heapify, toArray work well', function () {
|
|
81
|
-
const maxPriorityQueue = new PriorityQueue<number>({nodes: [5, 2, 3, 4, 6, 1], comparator: (a, b) => b - a});
|
|
82
|
-
expect(maxPriorityQueue.toArray()).toEqual([6, 5, 3, 4, 2, 1]);
|
|
83
|
-
maxPriorityQueue.poll();
|
|
84
|
-
maxPriorityQueue.poll();
|
|
85
|
-
maxPriorityQueue.poll();
|
|
86
|
-
expect(maxPriorityQueue.toArray()).toEqual([3, 2, 1]);
|
|
87
|
-
expect(maxPriorityQueue.peek()).toBe(3);
|
|
88
|
-
expect(
|
|
89
|
-
PriorityQueue.heapify({
|
|
90
|
-
nodes: [3, 2, 1, 5, 6, 7, 8, 9, 10],
|
|
91
|
-
comparator: (a, b) => a - b
|
|
92
|
-
}).toArray()
|
|
93
|
-
).toEqual([1, 2, 3, 5, 6, 7, 8, 9, 10]);
|
|
94
|
-
});
|
|
95
|
-
|
|
96
|
-
it('should PriorityQueue clone, sort, getNodes, DFS work well', function () {
|
|
97
|
-
const minPQ1 = new PriorityQueue<number>({nodes: [2, 5, 8, 3, 1, 6, 7, 4], comparator: (a, b) => a - b});
|
|
98
|
-
const clonedPriorityQueue = minPQ1.clone();
|
|
99
|
-
expect(clonedPriorityQueue.getNodes()).toEqual(minPQ1.getNodes());
|
|
100
|
-
expect(clonedPriorityQueue.sort()).toEqual([1, 2, 3, 4, 5, 6, 7, 8]);
|
|
101
|
-
expect(minPQ1.DFS('in')).toEqual([4, 3, 2, 5, 1, 8, 6, 7]);
|
|
102
|
-
expect(minPQ1.DFS('post')).toEqual([4, 3, 5, 2, 8, 7, 6, 1]);
|
|
103
|
-
expect(minPQ1.DFS('pre')).toEqual([1, 2, 3, 4, 5, 6, 8, 7]);
|
|
104
|
-
});
|
|
105
63
|
});
|
|
@@ -15,6 +15,48 @@ describe('PriorityQueue Operation Test', () => {
|
|
|
15
15
|
})
|
|
16
16
|
).toBe(false);
|
|
17
17
|
});
|
|
18
|
+
|
|
19
|
+
it('should PriorityQueue poll, pee, heapify, toArray work well', function () {
|
|
20
|
+
const minPQ = new PriorityQueue<number>({nodes: [5, 2, 3, 4, 6, 1], comparator: (a, b) => a - b});
|
|
21
|
+
expect(minPQ.toArray()).toEqual([1, 2, 3, 4, 6, 5]);
|
|
22
|
+
minPQ.poll();
|
|
23
|
+
minPQ.poll();
|
|
24
|
+
minPQ.poll();
|
|
25
|
+
expect(minPQ.toArray()).toEqual([4, 5, 6]);
|
|
26
|
+
expect(minPQ.peek()).toBe(4);
|
|
27
|
+
expect(
|
|
28
|
+
PriorityQueue.heapify({
|
|
29
|
+
nodes: [3, 2, 1, 5, 6, 7, 8, 9, 10],
|
|
30
|
+
comparator: (a, b) => a - b
|
|
31
|
+
}).toArray()
|
|
32
|
+
).toEqual([1, 2, 3, 5, 6, 7, 8, 9, 10]);
|
|
33
|
+
});
|
|
34
|
+
|
|
35
|
+
it('should Max PriorityQueue poll, peek, heapify, toArray work well', function () {
|
|
36
|
+
const maxPriorityQueue = new PriorityQueue<number>({nodes: [5, 2, 3, 4, 6, 1], comparator: (a, b) => b - a});
|
|
37
|
+
expect(maxPriorityQueue.toArray()).toEqual([6, 5, 3, 4, 2, 1]);
|
|
38
|
+
maxPriorityQueue.poll();
|
|
39
|
+
maxPriorityQueue.poll();
|
|
40
|
+
maxPriorityQueue.poll();
|
|
41
|
+
expect(maxPriorityQueue.toArray()).toEqual([3, 2, 1]);
|
|
42
|
+
expect(maxPriorityQueue.peek()).toBe(3);
|
|
43
|
+
expect(
|
|
44
|
+
PriorityQueue.heapify({
|
|
45
|
+
nodes: [3, 2, 1, 5, 6, 7, 8, 9, 10],
|
|
46
|
+
comparator: (a, b) => a - b
|
|
47
|
+
}).toArray()
|
|
48
|
+
).toEqual([1, 2, 3, 5, 6, 7, 8, 9, 10]);
|
|
49
|
+
});
|
|
50
|
+
|
|
51
|
+
it('should PriorityQueue clone, sort, getNodes, DFS work well', function () {
|
|
52
|
+
const minPQ1 = new PriorityQueue<number>({nodes: [2, 5, 8, 3, 1, 6, 7, 4], comparator: (a, b) => a - b});
|
|
53
|
+
const clonedPriorityQueue = minPQ1.clone();
|
|
54
|
+
expect(clonedPriorityQueue.getNodes()).toEqual(minPQ1.getNodes());
|
|
55
|
+
expect(clonedPriorityQueue.sort()).toEqual([1, 2, 3, 4, 5, 6, 7, 8]);
|
|
56
|
+
expect(minPQ1.DFS('in')).toEqual([4, 3, 2, 5, 1, 8, 6, 7]);
|
|
57
|
+
expect(minPQ1.DFS('post')).toEqual([4, 3, 5, 2, 8, 7, 6, 1]);
|
|
58
|
+
expect(minPQ1.DFS('pre')).toEqual([1, 2, 3, 4, 5, 6, 8, 7]);
|
|
59
|
+
});
|
|
18
60
|
});
|
|
19
61
|
|
|
20
62
|
describe('Priority Queue Performance Test', () => {
|
|
@@ -25,3 +67,4 @@ describe('Priority Queue Performance Test', () => {
|
|
|
25
67
|
expect(sorted).toEqual(values.sort((a, b) => a - b));
|
|
26
68
|
});
|
|
27
69
|
});
|
|
70
|
+
|