data-structure-typed 1.34.5 → 1.34.7
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 +1 -1
- package/README.md +213 -174
- package/lib/data-structures/heap/heap.d.ts +1 -1
- package/package.json +1 -1
- package/src/data-structures/heap/heap.ts +1 -1
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.7](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
|
@@ -6,13 +6,15 @@ Do you envy C++ with [std](), Python with [collections](), and Java with [java.u
|
|
|
6
6
|
|
|
7
7
|
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)
|
|
8
8
|
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
13
|
-
|
|
14
|
-
|
|
9
|
+
|
|
10
|
+
|
|
11
|
+
|
|
15
12
|
|
|
13
|
+
|
|
14
|
+
|
|
15
|
+
|
|
16
|
+
|
|
17
|
+
|
|
16
18
|
|
|
17
19
|
[//]: # ()
|
|
18
20
|
|
|
@@ -424,178 +426,215 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
|
|
|
424
426
|
|
|
425
427
|
### Standard library data structure comparison
|
|
426
428
|
|
|
429
|
+
|
|
427
430
|
<table>
|
|
428
431
|
<thead>
|
|
429
|
-
|
|
430
|
-
|
|
431
|
-
|
|
432
|
-
|
|
433
|
-
|
|
434
|
-
|
|
435
|
-
|
|
432
|
+
<tr>
|
|
433
|
+
<th>Data Structure</th>
|
|
434
|
+
<th>Data Structure Typed</th>
|
|
435
|
+
<th>C++ std</th>
|
|
436
|
+
<th>java.util</th>
|
|
437
|
+
<th>Python collections</th>
|
|
438
|
+
</tr>
|
|
436
439
|
</thead>
|
|
437
440
|
<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
|
-
|
|
441
|
+
<tr>
|
|
442
|
+
<td>Dynamic Array</td>
|
|
443
|
+
<td>Array<E></td>
|
|
444
|
+
<td>vector<T></td>
|
|
445
|
+
<td>ArrayList<E></td>
|
|
446
|
+
<td>list</td>
|
|
447
|
+
</tr>
|
|
448
|
+
<tr>
|
|
449
|
+
<td>Linked List</td>
|
|
450
|
+
<td>DoublyLinkedList<E></td>
|
|
451
|
+
<td>list<T></td>
|
|
452
|
+
<td>LinkedList<E></td>
|
|
453
|
+
<td>deque</td>
|
|
454
|
+
</tr>
|
|
455
|
+
<tr>
|
|
456
|
+
<td>Singly Linked List</td>
|
|
457
|
+
<td>SinglyLinkedList<E></td>
|
|
458
|
+
<td>-</td>
|
|
459
|
+
<td>-</td>
|
|
460
|
+
<td>-</td>
|
|
461
|
+
</tr>
|
|
462
|
+
<tr>
|
|
463
|
+
<td>Set</td>
|
|
464
|
+
<td>Set<E></td>
|
|
465
|
+
<td>set<T></td>
|
|
466
|
+
<td>HashSet<E></td>
|
|
467
|
+
<td>set</td>
|
|
468
|
+
</tr>
|
|
469
|
+
<tr>
|
|
470
|
+
<td>Map</td>
|
|
471
|
+
<td>Map<K, V></td>
|
|
472
|
+
<td>map<K, V></td>
|
|
473
|
+
<td>HashMap<K, V></td>
|
|
474
|
+
<td>dict</td>
|
|
475
|
+
</tr>
|
|
476
|
+
<tr>
|
|
477
|
+
<td>Ordered Dictionary</td>
|
|
478
|
+
<td>Map<K, V></td>
|
|
479
|
+
<td>-</td>
|
|
480
|
+
<td>-</td>
|
|
481
|
+
<td>OrderedDict</td>
|
|
482
|
+
</tr>
|
|
483
|
+
|
|
484
|
+
<tr>
|
|
485
|
+
<td>Queue</td>
|
|
486
|
+
<td>Queue<E></td>
|
|
487
|
+
<td>queue<T></td>
|
|
488
|
+
<td>Queue<E></td>
|
|
489
|
+
<td>-</td>
|
|
490
|
+
</tr>
|
|
491
|
+
<tr>
|
|
492
|
+
<td>Priority Queue</td>
|
|
493
|
+
<td>PriorityQueue<E></td>
|
|
494
|
+
<td>priority_queue<T></td>
|
|
495
|
+
<td>PriorityQueue<E></td>
|
|
496
|
+
<td>-</td>
|
|
497
|
+
</tr>
|
|
498
|
+
<tr>
|
|
499
|
+
<td>Heap</td>
|
|
500
|
+
<td>Heap<V></td>
|
|
501
|
+
<td>priority_queue<T></td>
|
|
502
|
+
<td>PriorityQueue<E></td>
|
|
503
|
+
<td>heapq</td>
|
|
504
|
+
</tr>
|
|
505
|
+
<tr>
|
|
506
|
+
<td>Stack</td>
|
|
507
|
+
<td>Stack<E></td>
|
|
508
|
+
<td>stack<T></td>
|
|
509
|
+
<td>Stack<E></td>
|
|
510
|
+
<td>-</td>
|
|
511
|
+
</tr>
|
|
512
|
+
<tr>
|
|
513
|
+
<td>Deque</td>
|
|
514
|
+
<td>Deque<E></td>
|
|
515
|
+
<td>deque<T></td>
|
|
516
|
+
<td>-</td>
|
|
517
|
+
<td>-</td>
|
|
518
|
+
</tr>
|
|
519
|
+
<tr>
|
|
520
|
+
<td>Trie</td>
|
|
521
|
+
<td>Trie</td>
|
|
522
|
+
<td>-</td>
|
|
523
|
+
<td>-</td>
|
|
524
|
+
<td>-</td>
|
|
525
|
+
</tr>
|
|
526
|
+
<tr>
|
|
527
|
+
<td>Unordered Map</td>
|
|
528
|
+
<td>HashMap<K, V></td>
|
|
529
|
+
<td>unordered_map<K, V></td>
|
|
530
|
+
<td>HashMap<K, V></td>
|
|
531
|
+
<td>defaultdict</td>
|
|
532
|
+
</tr>
|
|
533
|
+
<tr>
|
|
534
|
+
<td>Multiset</td>
|
|
535
|
+
<td>-</td>
|
|
536
|
+
<td>multiset<T></td>
|
|
537
|
+
<td>-</td>
|
|
538
|
+
<td>-</td>
|
|
539
|
+
</tr>
|
|
540
|
+
<tr>
|
|
541
|
+
<td>Multimap</td>
|
|
542
|
+
<td>-</td>
|
|
543
|
+
<td>multimap<K, V></td>
|
|
544
|
+
<td>-</td>
|
|
545
|
+
<td>-</td>
|
|
546
|
+
</tr>
|
|
547
|
+
<tr>
|
|
548
|
+
<td>Binary Tree</td>
|
|
549
|
+
<td>BinaryTree<K, V></td>
|
|
550
|
+
<td>-</td>
|
|
551
|
+
<td>-</td>
|
|
552
|
+
<td>-</td>
|
|
553
|
+
</tr>
|
|
554
|
+
<tr>
|
|
555
|
+
<td>Binary Search Tree</td>
|
|
556
|
+
<td>BST<K, V></td>
|
|
557
|
+
<td>-</td>
|
|
558
|
+
<td>-</td>
|
|
559
|
+
<td>-</td>
|
|
560
|
+
</tr>
|
|
561
|
+
<tr>
|
|
562
|
+
<td>Directed Graph</td>
|
|
563
|
+
<td>DirectedGraph<V, E></td>
|
|
564
|
+
<td>-</td>
|
|
565
|
+
<td>-</td>
|
|
566
|
+
<td>-</td>
|
|
567
|
+
</tr>
|
|
568
|
+
<tr>
|
|
569
|
+
<td>Undirected Graph</td>
|
|
570
|
+
<td>UndirectedGraph<V, E></td>
|
|
571
|
+
<td>-</td>
|
|
572
|
+
<td>-</td>
|
|
573
|
+
<td>-</td>
|
|
574
|
+
</tr>
|
|
575
|
+
<tr>
|
|
576
|
+
<td>Unordered Multiset</td>
|
|
577
|
+
<td>-</td>
|
|
578
|
+
<td>unordered_multiset</td>
|
|
579
|
+
<td>-</td>
|
|
580
|
+
<td>Counter</td>
|
|
581
|
+
</tr>
|
|
582
|
+
<tr>
|
|
583
|
+
<td>Linked Hash Set</td>
|
|
584
|
+
<td>-</td>
|
|
585
|
+
<td>-</td>
|
|
586
|
+
<td>LinkedHashSet<E></td>
|
|
587
|
+
<td>-</td>
|
|
588
|
+
</tr>
|
|
589
|
+
<tr>
|
|
590
|
+
<td>Linked Hash Map</td>
|
|
591
|
+
<td>-</td>
|
|
592
|
+
<td>-</td>
|
|
593
|
+
<td>LinkedHashMap<K, V></td>
|
|
594
|
+
<td>-</td>
|
|
595
|
+
</tr>
|
|
596
|
+
<tr>
|
|
597
|
+
<td>Sorted Set</td>
|
|
598
|
+
<td>AVLTree<E></td>
|
|
599
|
+
<td>-</td>
|
|
600
|
+
<td>TreeSet<E></td>
|
|
601
|
+
<td>-</td>
|
|
602
|
+
</tr>
|
|
603
|
+
<tr>
|
|
604
|
+
<td>Sorted Map</td>
|
|
605
|
+
<td>AVLTree<K, V></td>
|
|
606
|
+
<td>-</td>
|
|
607
|
+
<td>TreeMap<K, V></td>
|
|
608
|
+
<td>-</td>
|
|
609
|
+
</tr>
|
|
610
|
+
<tr>
|
|
611
|
+
<td>Tree Set</td>
|
|
612
|
+
<td>AVLTree<E></td>
|
|
613
|
+
<td>set</td>
|
|
614
|
+
<td>TreeSet<E></td>
|
|
615
|
+
<td>-</td>
|
|
616
|
+
</tr>
|
|
617
|
+
<tr>
|
|
618
|
+
<td>Unordered Multimap</td>
|
|
619
|
+
<td>-</td>
|
|
620
|
+
<td>unordered_multimap<K, V></td>
|
|
621
|
+
<td>-</td>
|
|
622
|
+
<td>-</td>
|
|
623
|
+
</tr>
|
|
624
|
+
<tr>
|
|
625
|
+
<td>Bitset</td>
|
|
626
|
+
<td>-</td>
|
|
627
|
+
<td>bitset<N></td>
|
|
628
|
+
<td>-</td>
|
|
629
|
+
<td>-</td>
|
|
630
|
+
</tr>
|
|
631
|
+
<tr>
|
|
632
|
+
<td>Unordered Set</td>
|
|
633
|
+
<td>-</td>
|
|
634
|
+
<td>unordered_set<T></td>
|
|
635
|
+
<td>HashSet<E></td>
|
|
636
|
+
<td>-</td>
|
|
637
|
+
</tr>
|
|
599
638
|
</tbody>
|
|
600
639
|
</table>
|
|
601
640
|
|
|
@@ -23,7 +23,7 @@ export declare class HeapItem<V = any> {
|
|
|
23
23
|
get val(): V | null;
|
|
24
24
|
set val(value: V | null);
|
|
25
25
|
}
|
|
26
|
-
export declare abstract class Heap<V =
|
|
26
|
+
export declare abstract class Heap<V = any> {
|
|
27
27
|
/**
|
|
28
28
|
* The function is a constructor for a class that initializes a priority callback function based on the
|
|
29
29
|
* options provided.
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "data-structure-typed",
|
|
3
|
-
"version": "1.34.
|
|
3
|
+
"version": "1.34.7",
|
|
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",
|
|
@@ -42,7 +42,7 @@ export class HeapItem<V = any> {
|
|
|
42
42
|
}
|
|
43
43
|
}
|
|
44
44
|
|
|
45
|
-
export abstract class Heap<V =
|
|
45
|
+
export abstract class Heap<V = any> {
|
|
46
46
|
/**
|
|
47
47
|
* The function is a constructor for a class that initializes a priority callback function based on the
|
|
48
48
|
* options provided.
|