data-structure-typed 1.33.6 → 1.33.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/.github/workflows/ci.yml +1 -0
- package/CHANGELOG.md +1 -1
- package/README.md +17 -24
- package/coverage/coverage-final.json +64 -63
- package/coverage/coverage-summary.json +8 -7
- package/dist/data-structures/binary-tree/segment-tree.js +24 -6
- package/dist/data-structures/binary-tree/segment-tree.js.map +1 -1
- package/dist/data-structures/hash/hash-map.js +306 -0
- package/dist/data-structures/hash/hash-map.js.map +1 -0
- package/dist/data-structures/hash/hash-table.js +128 -38
- package/dist/data-structures/hash/hash-table.js.map +1 -1
- package/dist/data-structures/hash/index.js +1 -0
- package/dist/data-structures/hash/index.js.map +1 -1
- package/dist/data-structures/linked-list/skip-linked-list.js +122 -5
- package/dist/data-structures/linked-list/skip-linked-list.js.map +1 -1
- package/dist/types/data-structures/hash.js +3 -0
- package/dist/types/data-structures/hash.js.map +1 -0
- package/dist/types/data-structures/index.js +1 -0
- package/dist/types/data-structures/index.js.map +1 -1
- package/docs/index.html +22 -26
- package/docs/modules.html +10 -4
- package/lib/data-structures/binary-tree/segment-tree.d.ts +4 -4
- package/lib/data-structures/binary-tree/segment-tree.js +30 -14
- package/lib/data-structures/hash/hash-map.d.ts +56 -0
- package/lib/data-structures/hash/hash-map.js +167 -0
- package/lib/data-structures/hash/hash-table.d.ts +67 -23
- package/lib/data-structures/hash/hash-table.js +154 -52
- package/lib/data-structures/hash/index.d.ts +1 -0
- package/lib/data-structures/hash/index.js +1 -0
- package/lib/data-structures/linked-list/skip-linked-list.d.ts +60 -1
- package/lib/data-structures/linked-list/skip-linked-list.js +136 -1
- package/lib/types/data-structures/hash.d.ts +1 -0
- package/lib/types/data-structures/hash.js +1 -0
- package/lib/types/data-structures/index.d.ts +1 -0
- package/lib/types/data-structures/index.js +1 -0
- package/package.json +1 -1
- package/src/data-structures/binary-tree/segment-tree.ts +32 -14
- package/src/data-structures/hash/hash-map.ts +203 -0
- package/src/data-structures/hash/hash-table.ts +176 -56
- package/src/data-structures/hash/index.ts +1 -0
- package/src/data-structures/linked-list/skip-linked-list.ts +166 -1
- package/src/types/data-structures/hash.ts +1 -0
- package/src/types/data-structures/index.ts +1 -0
- package/test/unit/data-structures/binary-tree/segment-tree.test.ts +50 -0
- package/test/unit/data-structures/hash/hash-map.test.ts +104 -0
- package/test/unit/data-structures/hash/hash-table.test.ts +97 -10
- package/test/unit/data-structures/linked-list/skip-list.test.ts +55 -0
- package/umd/bundle.min.js +1 -1
- package/umd/bundle.min.js.map +1 -1
- package/tsconfig.prod.json +0 -25
package/.github/workflows/ci.yml
CHANGED
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.33.
|
|
11
|
+
## [v1.33.7](https://github.com/zrwusa/data-structure-typed/compare/v1.33.4...main) (upcoming)
|
|
12
12
|
|
|
13
13
|
## [v1.33.4](https://github.com/zrwusa/data-structure-typed/compare/v1.33.3...v1.33.4) (26 September 2023)
|
|
14
14
|
|
package/README.md
CHANGED
|
@@ -441,24 +441,17 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
|
|
|
441
441
|
<tr>
|
|
442
442
|
<td>Set</td>
|
|
443
443
|
<td>std::set<T></td>
|
|
444
|
-
<td>Set</td>
|
|
444
|
+
<td>Set<E></td>
|
|
445
445
|
<td>HashSet<E></td>
|
|
446
446
|
<td>set</td>
|
|
447
447
|
</tr>
|
|
448
448
|
<tr>
|
|
449
449
|
<td>Map</td>
|
|
450
450
|
<td>std::map<K, V></td>
|
|
451
|
-
<td>Map
|
|
451
|
+
<td>Map<K, V></td>
|
|
452
452
|
<td>HashMap<K, V></td>
|
|
453
453
|
<td>dict</td>
|
|
454
454
|
</tr>
|
|
455
|
-
<tr>
|
|
456
|
-
<td>Unordered Map</td>
|
|
457
|
-
<td>std::unordered_map<K, V></td>
|
|
458
|
-
<td>N/A</td>
|
|
459
|
-
<td>HashMap<K, V></td>
|
|
460
|
-
<td>defaultdict</td>
|
|
461
|
-
</tr>
|
|
462
455
|
<tr>
|
|
463
456
|
<td>Unordered Set</td>
|
|
464
457
|
<td>std::unordered_set<T></td>
|
|
@@ -466,24 +459,31 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
|
|
|
466
459
|
<td>HashSet<E></td>
|
|
467
460
|
<td>N/A</td>
|
|
468
461
|
</tr>
|
|
462
|
+
<tr>
|
|
463
|
+
<td>Unordered Map</td>
|
|
464
|
+
<td>std::unordered_map<K, V></td>
|
|
465
|
+
<td>HashMap<K, V></td>
|
|
466
|
+
<td>HashMap<K, V></td>
|
|
467
|
+
<td>defaultdict</td>
|
|
468
|
+
</tr>
|
|
469
469
|
<tr>
|
|
470
470
|
<td>Queue</td>
|
|
471
471
|
<td>std::queue<T></td>
|
|
472
|
-
<td>Queue
|
|
472
|
+
<td>Queue<E></td>
|
|
473
473
|
<td>Queue<E></td>
|
|
474
474
|
<td>N/A</td>
|
|
475
475
|
</tr>
|
|
476
476
|
<tr>
|
|
477
477
|
<td>Priority Queue</td>
|
|
478
478
|
<td>std::priority_queue<T></td>
|
|
479
|
-
<td>PriorityQueue
|
|
479
|
+
<td>PriorityQueue<E></td>
|
|
480
480
|
<td>PriorityQueue<E></td>
|
|
481
481
|
<td>N/A</td>
|
|
482
482
|
</tr>
|
|
483
483
|
<tr>
|
|
484
484
|
<td>Stack</td>
|
|
485
485
|
<td>std::stack<T></td>
|
|
486
|
-
<td>Stack
|
|
486
|
+
<td>Stack<E></td>
|
|
487
487
|
<td>Stack<E></td>
|
|
488
488
|
<td>N/A</td>
|
|
489
489
|
</tr>
|
|
@@ -497,7 +497,7 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
|
|
|
497
497
|
<tr>
|
|
498
498
|
<td>Deque</td>
|
|
499
499
|
<td>std::deque<T></td>
|
|
500
|
-
<td>Deque
|
|
500
|
+
<td>Deque<E></td>
|
|
501
501
|
<td>N/A</td>
|
|
502
502
|
<td>N/A</td>
|
|
503
503
|
</tr>
|
|
@@ -525,17 +525,10 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
|
|
|
525
525
|
<tr>
|
|
526
526
|
<td>Ordered Dictionary</td>
|
|
527
527
|
<td>N/A</td>
|
|
528
|
-
<td>Map
|
|
528
|
+
<td>Map<K, V></td>
|
|
529
529
|
<td>N/A</td>
|
|
530
530
|
<td>OrderedDict</td>
|
|
531
531
|
</tr>
|
|
532
|
-
<tr>
|
|
533
|
-
<td>Double-Ended Queue (Deque)</td>
|
|
534
|
-
<td>std::deque<T></td>
|
|
535
|
-
<td>Deque</td>
|
|
536
|
-
<td>N/A</td>
|
|
537
|
-
<td>N/A</td>
|
|
538
|
-
</tr>
|
|
539
532
|
<tr>
|
|
540
533
|
<td>Linked Hash Set</td>
|
|
541
534
|
<td>N/A</td>
|
|
@@ -553,21 +546,21 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
|
|
|
553
546
|
<tr>
|
|
554
547
|
<td>Sorted Set</td>
|
|
555
548
|
<td>N/A</td>
|
|
556
|
-
<td>AVLTree
|
|
549
|
+
<td>AVLTree</td>
|
|
557
550
|
<td>TreeSet<E></td>
|
|
558
551
|
<td>N/A</td>
|
|
559
552
|
</tr>
|
|
560
553
|
<tr>
|
|
561
554
|
<td>Sorted Map</td>
|
|
562
555
|
<td>N/A</td>
|
|
563
|
-
<td>AVLTree
|
|
556
|
+
<td>AVLTree</td>
|
|
564
557
|
<td>TreeMap<K, V></td>
|
|
565
558
|
<td>N/A</td>
|
|
566
559
|
</tr>
|
|
567
560
|
<tr>
|
|
568
561
|
<td>Tree Set</td>
|
|
569
562
|
<td>std::set</td>
|
|
570
|
-
<td>AVLTree
|
|
563
|
+
<td>AVLTree</td>
|
|
571
564
|
<td>TreeSet<E></td>
|
|
572
565
|
<td>N/A</td>
|
|
573
566
|
</tr>
|