mirror of
https://github.com/zrwusa/data-structure-typed.git
synced 2024-11-23 12:54:04 +00:00
[readme] badages updated
This commit is contained in:
Revone
parent
7a2bc8556c
commit
0c5df67215
|
|
@ -8,7 +8,7 @@ All notable changes to this project will be documented in this file.
|
|||
- [Semantic Versioning](https://semver.org/spec/v2.0.0.html)
|
||||
- [`auto-changelog`](https://github.com/CookPete/auto-changelog)
|
||||
|
||||
## [v1.34.5](https://github.com/zrwusa/data-structure-typed/compare/v1.34.1...main) (upcoming)
|
||||
## [v1.34.6](https://github.com/zrwusa/data-structure-typed/compare/v1.34.1...main) (upcoming)
|
||||
|
||||
## [v1.34.1](https://github.com/zrwusa/data-structure-typed/compare/v1.33.4...v1.34.1) (6 October 2023)
|
||||
|
||||
|
|
|
|||
387
README.md
387
README.md
|
|
@ -6,13 +6,15 @@ Do you envy C++ with [std](), Python with [collections](), and Java with [java.u
|
|||
|
||||
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)
|
||||
|
||||
The size after packaging is 69 kB.
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
[//]: # ()
|
||||
|
||||
|
|
@ -424,178 +426,215 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
|
|||
|
||||
### Standard library data structure comparison
|
||||
|
||||
|
||||
<table>
|
||||
<thead>
|
||||
<tr>
|
||||
<th>Data Structure</th>
|
||||
<th>C++ std</th>
|
||||
<th>Data Structure Typed</th>
|
||||
<th>java.util</th>
|
||||
<th>Python collections</th>
|
||||
</tr>
|
||||
<tr>
|
||||
<th>Data Structure</th>
|
||||
<th>Data Structure Typed</th>
|
||||
<th>C++ std</th>
|
||||
<th>java.util</th>
|
||||
<th>Python collections</th>
|
||||
</tr>
|
||||
</thead>
|
||||
<tbody>
|
||||
<tr>
|
||||
<td>Dynamic Array</td>
|
||||
<td>std::vector<T></td>
|
||||
<td>Array<E></td>
|
||||
<td>ArrayList<E></td>
|
||||
<td>list</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Linked List</td>
|
||||
<td>std::list<T></td>
|
||||
<td>DoublyLinkedList<E></td>
|
||||
<td>LinkedList<E></td>
|
||||
<td>deque</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Set</td>
|
||||
<td>std::set<T></td>
|
||||
<td>Set<E></td>
|
||||
<td>HashSet<E></td>
|
||||
<td>set</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Map</td>
|
||||
<td>std::map<K, V></td>
|
||||
<td>Map<K, V></td>
|
||||
<td>HashMap<K, V></td>
|
||||
<td>dict</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Unordered Set</td>
|
||||
<td>std::unordered_set<T></td>
|
||||
<td>N/A</td>
|
||||
<td>HashSet<E></td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Unordered Map</td>
|
||||
<td>std::unordered_map<K, V></td>
|
||||
<td>HashMap<K, V></td>
|
||||
<td>HashMap<K, V></td>
|
||||
<td>defaultdict</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Queue</td>
|
||||
<td>std::queue<T></td>
|
||||
<td>Queue<E></td>
|
||||
<td>Queue<E></td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Priority Queue</td>
|
||||
<td>std::priority_queue<T></td>
|
||||
<td>PriorityQueue<E></td>
|
||||
<td>PriorityQueue<E></td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Stack</td>
|
||||
<td>std::stack<T></td>
|
||||
<td>Stack<E></td>
|
||||
<td>Stack<E></td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Bitset</td>
|
||||
<td>std::bitset<N></td>
|
||||
<td>N/A</td>
|
||||
<td>N/A</td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Deque</td>
|
||||
<td>std::deque<T></td>
|
||||
<td>Deque<E></td>
|
||||
<td>N/A</td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Multiset</td>
|
||||
<td>std::multiset<T></td>
|
||||
<td>N/A</td>
|
||||
<td>N/A</td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Multimap</td>
|
||||
<td>std::multimap<K, V></td>
|
||||
<td>N/A</td>
|
||||
<td>N/A</td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Unordered Multiset</td>
|
||||
<td>std::unordered_multiset</td>
|
||||
<td>N/A</td>
|
||||
<td>Counter</td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Ordered Dictionary</td>
|
||||
<td>N/A</td>
|
||||
<td>Map<K, V></td>
|
||||
<td>N/A</td>
|
||||
<td>OrderedDict</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Linked Hash Set</td>
|
||||
<td>N/A</td>
|
||||
<td>N/A</td>
|
||||
<td>LinkedHashSet<E></td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Linked Hash Map</td>
|
||||
<td>N/A</td>
|
||||
<td>N/A</td>
|
||||
<td>LinkedHashMap<K, V></td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Sorted Set</td>
|
||||
<td>N/A</td>
|
||||
<td>AVLTree</td>
|
||||
<td>TreeSet<E></td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Sorted Map</td>
|
||||
<td>N/A</td>
|
||||
<td>AVLTree</td>
|
||||
<td>TreeMap<K, V></td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Tree Set</td>
|
||||
<td>std::set</td>
|
||||
<td>AVLTree</td>
|
||||
<td>TreeSet<E></td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Persistent Collections</td>
|
||||
<td>N/A</td>
|
||||
<td>N/A</td>
|
||||
<td>N/A</td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>unordered multiset</td>
|
||||
<td>unordered multiset<T></td>
|
||||
<td>N/A</td>
|
||||
<td>N/A</td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Unordered Multimap</td>
|
||||
<td>std::unordered_multimap<K, V></td>
|
||||
<td>N/A</td>
|
||||
<td>N/A</td>
|
||||
<td>N/A</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Dynamic Array</td>
|
||||
<td>Array<E></td>
|
||||
<td>vector<T></td>
|
||||
<td>ArrayList<E></td>
|
||||
<td>list</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Linked List</td>
|
||||
<td>DoublyLinkedList<E></td>
|
||||
<td>list<T></td>
|
||||
<td>LinkedList<E></td>
|
||||
<td>deque</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Singly Linked List</td>
|
||||
<td>SinglyLinkedList<E></td>
|
||||
<td>-</td>
|
||||
<td>-</td>
|
||||
<td>-</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Set</td>
|
||||
<td>Set<E></td>
|
||||
<td>set<T></td>
|
||||
<td>HashSet<E></td>
|
||||
<td>set</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Map</td>
|
||||
<td>Map<K, V></td>
|
||||
<td>map<K, V></td>
|
||||
<td>HashMap<K, V></td>
|
||||
<td>dict</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Ordered Dictionary</td>
|
||||
<td>Map<K, V></td>
|
||||
<td>-</td>
|
||||
<td>-</td>
|
||||
<td>OrderedDict</td>
|
||||
</tr>
|
||||
|
||||
<tr>
|
||||
<td>Queue</td>
|
||||
<td>Queue<E></td>
|
||||
<td>queue<T></td>
|
||||
<td>Queue<E></td>
|
||||
<td>-</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Priority Queue</td>
|
||||
<td>PriorityQueue<E></td>
|
||||
<td>priority_queue<T></td>
|
||||
<td>PriorityQueue<E></td>
|
||||
<td>-</td>
|
||||
</tr>
|
||||
<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>
|
||||
<td>Stack<E></td>
|
||||
<td>stack<T></td>
|
||||
<td>Stack<E></td>
|
||||
<td>-</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Deque</td>
|
||||
<td>Deque<E></td>
|
||||
<td>deque<T></td>
|
||||
<td>-</td>
|
||||
<td>-</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<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>
|
||||
<td>-</td>
|
||||
<td>multiset<T></td>
|
||||
<td>-</td>
|
||||
<td>-</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Multimap</td>
|
||||
<td>-</td>
|
||||
<td>multimap<K, V></td>
|
||||
<td>-</td>
|
||||
<td>-</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Binary Tree</td>
|
||||
<td>BinaryTree<K, V></td>
|
||||
<td>-</td>
|
||||
<td>-</td>
|
||||
<td>-</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Binary Search Tree</td>
|
||||
<td>BST<K, V></td>
|
||||
<td>-</td>
|
||||
<td>-</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>
|
||||
<td>-</td>
|
||||
<td>-</td>
|
||||
<td>LinkedHashSet<E></td>
|
||||
<td>-</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Linked Hash Map</td>
|
||||
<td>-</td>
|
||||
<td>-</td>
|
||||
<td>LinkedHashMap<K, V></td>
|
||||
<td>-</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Sorted Set</td>
|
||||
<td>AVLTree<E></td>
|
||||
<td>-</td>
|
||||
<td>TreeSet<E></td>
|
||||
<td>-</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Sorted Map</td>
|
||||
<td>AVLTree<K, V></td>
|
||||
<td>-</td>
|
||||
<td>TreeMap<K, V></td>
|
||||
<td>-</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Tree Set</td>
|
||||
<td>AVLTree<E></td>
|
||||
<td>set</td>
|
||||
<td>TreeSet<E></td>
|
||||
<td>-</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Unordered Multimap</td>
|
||||
<td>-</td>
|
||||
<td>unordered_multimap<K, V></td>
|
||||
<td>-</td>
|
||||
<td>-</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Bitset</td>
|
||||
<td>-</td>
|
||||
<td>bitset<N></td>
|
||||
<td>-</td>
|
||||
<td>-</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>Unordered Set</td>
|
||||
<td>-</td>
|
||||
<td>unordered_set<T></td>
|
||||
<td>HashSet<E></td>
|
||||
<td>-</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
|
||||
|
|
|
|||
|
|
@ -1,6 +1,6 @@
|
|||
{
|
||||
"name": "data-structure-typed",
|
||||
"version": "1.34.5",
|
||||
"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.",
|
||||
"main": "dist/index.js",
|
||||
"module": "lib/index.js",
|
||||
|
|
|
|||
|
|
@ -42,7 +42,7 @@ export class HeapItem<V = any> {
|
|||
}
|
||||
}
|
||||
|
||||
export abstract class Heap<V = number> {
|
||||
export abstract class Heap<V = any> {
|
||||
/**
|
||||
* The function is a constructor for a class that initializes a priority callback function based on the
|
||||
* options provided.
|
||||
|
|
|
|||
Loading…
Reference in a new issue