data-structure-typed
Advanced tools
data-structure-typed - npm Package Compare versions
Comparing version 1.34.6 to 1.34.7
@@ -11,3 +11,3 @@ # Changelog | ||
| ## [v1.34.6](https://github.com/zrwusa/data-structure-typed/compare/v1.34.1...main) (upcoming) | ||
| ## [v1.34.7](https://github.com/zrwusa/data-structure-typed/compare/v1.34.1...main) (upcoming) | ||
@@ -14,0 +14,0 @@ ## [v1.34.1](https://github.com/zrwusa/data-structure-typed/compare/v1.33.4...v1.34.1) (6 October 2023) |
@@ -26,3 +26,3 @@ /** | ||
| } | ||
| export declare abstract class Heap<V = number> { | ||
| export declare abstract class Heap<V = any> { | ||
| /** | ||
@@ -29,0 +29,0 @@ * The function is a constructor for a class that initializes a priority callback function based on the |
| { | ||
| "name": "data-structure-typed", | ||
| "version": "1.34.6", | ||
| "version": "1.34.7", | ||
| "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,0 +5,0 @@ "main": "dist/index.js", |
109
README.md
@@ -9,10 +9,12 @@ # Data Structure Typed | ||
| The size after packaging is 69 kB. | ||
|  | ||
|  | ||
|  | ||
|  | ||
|  | ||
|  | ||
|  | ||
|  | ||
|  | ||
|  | ||
|  | ||
| [//]: # () | ||
@@ -428,2 +430,3 @@ | ||
| <table> | ||
@@ -455,2 +458,9 @@ <thead> | ||
| <tr> | ||
| <td>Singly Linked List</td> | ||
| <td>SinglyLinkedList<E></td> | ||
| <td>-</td> | ||
| <td>-</td> | ||
| <td>-</td> | ||
| </tr> | ||
| <tr> | ||
| <td>Set</td> | ||
@@ -470,16 +480,10 @@ <td>Set<E></td> | ||
| <tr> | ||
| <td>Unordered Set</td> | ||
| <td>Ordered Dictionary</td> | ||
| <td>Map<K, V></td> | ||
| <td>-</td> | ||
| <td>unordered_set<T></td> | ||
| <td>HashSet<E></td> | ||
| <td>-</td> | ||
| <td>OrderedDict</td> | ||
| </tr> | ||
| <tr> | ||
| <td>Unordered Map</td> | ||
| <td>HashMap<K, V></td> | ||
| <td>unordered_map<K, V></td> | ||
| <td>HashMap<K, V></td> | ||
| <td>defaultdict</td> | ||
| </tr> | ||
| <tr> | ||
| <td>Queue</td> | ||
@@ -499,2 +503,9 @@ <td>Queue<E></td> | ||
| <tr> | ||
| <td>Heap</td> | ||
| <td>Heap<V></td> | ||
| <td>priority_queue<T></td> | ||
| <td>PriorityQueue<E></td> | ||
| <td>heapq</td> | ||
| </tr> | ||
| <tr> | ||
| <td>Stack</td> | ||
@@ -507,16 +518,23 @@ <td>Stack<E></td> | ||
| <tr> | ||
| <td>Bitset</td> | ||
| <td>Deque</td> | ||
| <td>Deque<E></td> | ||
| <td>deque<T></td> | ||
| <td>-</td> | ||
| <td>bitset<N></td> | ||
| <td>-</td> | ||
| <td>-</td> | ||
| </tr> | ||
| <tr> | ||
| <td>Deque</td> | ||
| <td>Deque<E></td> | ||
| <td>deque<T></td> | ||
| <td>Trie</td> | ||
| <td>Trie</td> | ||
| <td>-</td> | ||
| <td>-</td> | ||
| <td>-</td> | ||
| </tr> | ||
| <tr> | ||
| <td>Unordered Map</td> | ||
| <td>HashMap<K, V></td> | ||
| <td>unordered_map<K, V></td> | ||
| <td>HashMap<K, V></td> | ||
| <td>defaultdict</td> | ||
| </tr> | ||
| <tr> | ||
| <td>Multiset</td> | ||
@@ -536,16 +554,37 @@ <td>-</td> | ||
| <tr> | ||
| <td>Unordered Multiset</td> | ||
| <td>Binary Tree</td> | ||
| <td>BinaryTree<K, V></td> | ||
| <td>-</td> | ||
| <td>unordered_multiset</td> | ||
| <td>Counter</td> | ||
| <td>-</td> | ||
| <td>-</td> | ||
| </tr> | ||
| <tr> | ||
| <td>Ordered Dictionary</td> | ||
| <td>Map<K, V></td> | ||
| <td>Binary Search Tree</td> | ||
| <td>BST<K, V></td> | ||
| <td>-</td> | ||
| <td>-</td> | ||
| <td>OrderedDict</td> | ||
| <td>-</td> | ||
| </tr> | ||
| <tr> | ||
| <td>Directed Graph</td> | ||
| <td>DirectedGraph<V, E></td> | ||
| <td>-</td> | ||
| <td>-</td> | ||
| <td>-</td> | ||
| </tr> | ||
| <tr> | ||
| <td>Undirected Graph</td> | ||
| <td>UndirectedGraph<V, E></td> | ||
| <td>-</td> | ||
| <td>-</td> | ||
| <td>-</td> | ||
| </tr> | ||
| <tr> | ||
| <td>Unordered Multiset</td> | ||
| <td>-</td> | ||
| <td>unordered_multiset</td> | ||
| <td>-</td> | ||
| <td>Counter</td> | ||
| </tr> | ||
| <tr> | ||
| <td>Linked Hash Set</td> | ||
@@ -586,12 +625,12 @@ <td>-</td> | ||
| <tr> | ||
| <td>Persistent Collections</td> | ||
| <td>Unordered Multimap</td> | ||
| <td>-</td> | ||
| <td>unordered_multimap<K, V></td> | ||
| <td>-</td> | ||
| <td>-</td> | ||
| <td>-</td> | ||
| </tr> | ||
| <tr> | ||
| <td>unordered multiset</td> | ||
| <td>Bitset</td> | ||
| <td>-</td> | ||
| <td>unordered_multiset<T></td> | ||
| <td>bitset<N></td> | ||
| <td>-</td> | ||
@@ -601,7 +640,7 @@ <td>-</td> | ||
| <tr> | ||
| <td>Unordered Multimap</td> | ||
| <td>unordered_multimap<K, V></td> | ||
| <td>Unordered Set</td> | ||
| <td>-</td> | ||
| <td>unordered_set<T></td> | ||
| <td>HashSet<E></td> | ||
| <td>-</td> | ||
| <td>-</td> | ||
| </tr> | ||
@@ -608,0 +647,0 @@ </tbody> |
@@ -45,3 +45,3 @@ /** | ||
| export abstract class Heap<V = number> { | ||
| export abstract class Heap<V = any> { | ||
| /** | ||
@@ -48,0 +48,0 @@ * The function is a constructor for a class that initializes a priority callback function based on the |
New alerts
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
Fixed alerts
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
Improved metrics
- Total package byte prevSize
- increased by0.03%
2264175
- Number of lines in readme file
- increased by4.48%
910