data-structure-typed 1.21.0 → 1.21.1
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/README.md +8 -57
- package/package.json +21 -20
package/README.md
CHANGED
|
@@ -356,15 +356,15 @@ import {UndirectedGraph} from 'data-structure-typed';
|
|
|
356
356
|
</table>
|
|
357
357
|
|
|
358
358
|
|
|
359
|
-
![]
|
|
359
|
+
[//]: # ()
|
|
360
360
|
|
|
361
|
-
![]
|
|
361
|
+
[//]: # ()
|
|
362
362
|
|
|
363
|
-
![]
|
|
363
|
+
[//]: # ()
|
|
364
364
|
|
|
365
|
-
![]
|
|
365
|
+
[//]: # ()
|
|
366
366
|
|
|
367
|
-
![]
|
|
367
|
+
[//]: # ()
|
|
368
368
|
|
|
369
369
|
|
|
370
370
|
## API docs & Examples
|
|
@@ -375,11 +375,8 @@ import {UndirectedGraph} from 'data-structure-typed';
|
|
|
375
375
|
|
|
376
376
|
<a href="https://data-structure-typed-examples.vercel.app" target="_blank">Live Examples</a>
|
|
377
377
|
|
|
378
|
-
[//]: # ([Examples Repository](https://github.com/zrwusa/data-structure-typed-examples))
|
|
379
|
-
|
|
380
378
|
<a href="https://github.com/zrwusa/data-structure-typed-examples" target="_blank">Examples Repository</a>
|
|
381
379
|
|
|
382
|
-
|
|
383
380
|
# Why
|
|
384
381
|
|
|
385
382
|
## Complexities
|
|
@@ -645,54 +642,8 @@ import {UndirectedGraph} from 'data-structure-typed';
|
|
|
645
642
|
</tbody>
|
|
646
643
|
</table>
|
|
647
644
|
|
|
648
|
-
![overview diagram]
|
|
649
|
-
|
|
650
|
-
|
|
651
|
-
|
|
652
|
-
|
|
653
|
-
|
|
654
|
-
[//]: # ()
|
|
655
|
-
|
|
656
|
-
[//]: # ()
|
|
657
|
-
[//]: # ()
|
|
658
|
-
|
|
659
|
-
[//]: # ()
|
|
660
|
-
[//]: # ()
|
|
661
|
-
|
|
662
|
-
[//]: # ()
|
|
663
|
-
[//]: # ()
|
|
664
|
-
|
|
665
|
-
[//]: # ()
|
|
666
|
-
[//]: # ()
|
|
667
|
-
|
|
668
|
-
[//]: # ()
|
|
669
|
-
[//]: # ()
|
|
670
|
-
|
|
671
|
-
[//]: # ()
|
|
672
|
-
[//]: # ()
|
|
673
|
-
|
|
674
|
-
[//]: # ()
|
|
675
|
-
[//]: # ()
|
|
676
|
-
|
|
677
|
-
[//]: # ()
|
|
678
|
-
[//]: # ()
|
|
679
|
-
|
|
680
|
-
[//]: # ()
|
|
681
|
-
[//]: # ()
|
|
682
|
-
|
|
683
|
-
[//]: # ()
|
|
684
|
-
[//]: # ()
|
|
685
|
-
|
|
686
|
-
[//]: # ()
|
|
687
|
-
[//]: # ()
|
|
688
|
-
|
|
689
|
-
[//]: # ()
|
|
690
|
-
|
|
691
|
-
[//]: # ()
|
|
692
|
-
|
|
693
|
-
[//]: # ()
|
|
694
|
-
|
|
695
|
-
|
|
696
|
-
|
|
645
|
+
[//]: # ()
|
|
697
646
|
|
|
647
|
+
|
|
698
648
|
|
|
649
|
+
|
package/package.json
CHANGED
|
@@ -1,8 +1,9 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "data-structure-typed",
|
|
3
|
-
"version": "1.21.
|
|
3
|
+
"version": "1.21.1",
|
|
4
4
|
"description": "Javascript & TypeScript Data Structure Library, meticulously crafted to empower developers with a versatile set of essential data structures. Our library includes a wide range of data structures, such as Binary Tree, AVL Tree, Binary Search Tree (BST), Tree Multiset, Segment Tree, Binary Indexed Tree, Graph, Directed Graph, Undirected Graph, Singly Linked List, Hash, CoordinateSet, CoordinateMap, Heap, Doubly Linked List, Priority Queue, Max Priority Queue, Min Priority Queue, Queue, ObjectDeque, ArrayDeque, Stack, and Trie. Each data structure is thoughtfully designed and implemented using TypeScript to provide efficient, reliable, and easy-to-use solutions for your programming needs. Whether you're optimizing algorithms, managing data, or enhancing performance, our TypeScript Data Structure Library is your go-to resource. Elevate your coding experience with these fundamental building blocks for software development.",
|
|
5
5
|
"main": "dist/index.js",
|
|
6
|
+
"module": "dist/my-library.js",
|
|
6
7
|
"scripts": {
|
|
7
8
|
"build": "rm -rf dist && npx tsc",
|
|
8
9
|
"test": "jest",
|
|
@@ -59,30 +60,30 @@
|
|
|
59
60
|
"devDependencies": {
|
|
60
61
|
"@types/jest": "^29.5.3",
|
|
61
62
|
"@types/node": "^20.4.9",
|
|
62
|
-
"avl-tree-typed": "^1.
|
|
63
|
-
"binary-tree-typed": "^1.
|
|
64
|
-
"bst-typed": "^1.
|
|
63
|
+
"avl-tree-typed": "^1.21.0",
|
|
64
|
+
"binary-tree-typed": "^1.21.0",
|
|
65
|
+
"bst-typed": "^1.21.0",
|
|
65
66
|
"dependency-cruiser": "^13.1.2",
|
|
66
|
-
"deque-typed": "^1.
|
|
67
|
-
"directed-graph-typed": "^1.
|
|
68
|
-
"doubly-linked-list-typed": "^1.
|
|
69
|
-
"graph-typed": "^1.
|
|
70
|
-
"heap-typed": "^1.
|
|
67
|
+
"deque-typed": "^1.21.0",
|
|
68
|
+
"directed-graph-typed": "^1.21.0",
|
|
69
|
+
"doubly-linked-list-typed": "^1.21.0",
|
|
70
|
+
"graph-typed": "^1.21.0",
|
|
71
|
+
"heap-typed": "^1.21.0",
|
|
71
72
|
"jest": "^29.6.2",
|
|
72
|
-
"linked-list-typed": "^1.
|
|
73
|
-
"max-heap-typed": "^1.
|
|
74
|
-
"max-priority-queue-typed": "^1.
|
|
75
|
-
"min-heap-typed": "^1.
|
|
76
|
-
"min-priority-queue-typed": "^1.
|
|
77
|
-
"priority-queue-typed": "^1.
|
|
78
|
-
"singly-linked-list-typed": "^1.
|
|
79
|
-
"stack-typed": "^1.
|
|
80
|
-
"tree-multiset-typed": "^1.
|
|
81
|
-
"trie-typed": "^1.
|
|
73
|
+
"linked-list-typed": "^1.21.0",
|
|
74
|
+
"max-heap-typed": "^1.21.0",
|
|
75
|
+
"max-priority-queue-typed": "^1.21.0",
|
|
76
|
+
"min-heap-typed": "^1.21.0",
|
|
77
|
+
"min-priority-queue-typed": "^1.21.0",
|
|
78
|
+
"priority-queue-typed": "^1.21.0",
|
|
79
|
+
"singly-linked-list-typed": "^1.21.0",
|
|
80
|
+
"stack-typed": "^1.21.0",
|
|
81
|
+
"tree-multiset-typed": "^1.21.0",
|
|
82
|
+
"trie-typed": "^1.21.0",
|
|
82
83
|
"ts-jest": "^29.1.1",
|
|
83
84
|
"typedoc": "^0.24.8",
|
|
84
85
|
"typescript": "^4.9.5",
|
|
85
|
-
"undirected-graph-typed": "^1.
|
|
86
|
+
"undirected-graph-typed": "^1.21.0"
|
|
86
87
|
},
|
|
87
88
|
"dependencies": {
|
|
88
89
|
"zod": "^3.22.2"
|