diff --git a/CHANGELOG.md b/CHANGELOG.md index 82105c5..2f49165 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -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) diff --git a/README.md b/README.md index 3a11d1c..a36b5a5 100644 --- a/README.md +++ b/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. - -![License](https://img.shields.io/badge/License-MIT-blue.svg) -![Language](https://img.shields.io/github/languages/top/zrwusa/data-structure-typed) -![GitHub release (latest by date)](https://img.shields.io/github/v/release/zrwusa/data-structure-typed) -![npm](https://aleen42.github.io/badges/src/npm.svg) +![NPM](https://img.shields.io/npm/l/data-structure-typed) +![GitHub top language](https://img.shields.io/github/languages/top/zrwusa/data-structure-typed) +![npm](https://img.shields.io/npm/dw/data-structure-typed) ![eslint](https://aleen42.github.io/badges/src/eslint.svg) +![npm package minimized gzipped size (select exports)](https://img.shields.io/bundlejs/size/data-structure-typed) +![npm bundle size](https://img.shields.io/bundlephobia/min/data-structure-typed) +![npm](https://img.shields.io/npm/v/data-structure-typed) + + [//]: # (![Branches](https://img.shields.io/badge/branches-55.47%25-red.svg?style=flat)) @@ -424,178 +426,215 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D ### Standard library data structure comparison + - - - - - - - + + + + + + + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Data StructureC++ stdData Structure Typedjava.utilPython collections
Data StructureData Structure TypedC++ stdjava.utilPython collections
Dynamic Arraystd::vector<T>Array<E>ArrayList<E>list
Linked Liststd::list<T>DoublyLinkedList<E>LinkedList<E>deque
Setstd::set<T>Set<E>HashSet<E>set
Mapstd::map<K, V>Map<K, V>HashMap<K, V>dict
Unordered Setstd::unordered_set<T>N/AHashSet<E>N/A
Unordered Mapstd::unordered_map<K, V>HashMap<K, V>HashMap<K, V>defaultdict
Queuestd::queue<T>Queue<E>Queue<E>N/A
Priority Queuestd::priority_queue<T>PriorityQueue<E>PriorityQueue<E>N/A
Stackstd::stack<T>Stack<E>Stack<E>N/A
Bitsetstd::bitset<N>N/AN/AN/A
Dequestd::deque<T>Deque<E>N/AN/A
Multisetstd::multiset<T>N/AN/AN/A
Multimapstd::multimap<K, V>N/AN/AN/A
Unordered Multisetstd::unordered_multisetN/ACounterN/A
Ordered DictionaryN/AMap<K, V>N/AOrderedDict
Linked Hash SetN/AN/ALinkedHashSet<E>N/A
Linked Hash MapN/AN/ALinkedHashMap<K, V>N/A
Sorted SetN/AAVLTreeTreeSet<E>N/A
Sorted MapN/AAVLTreeTreeMap<K, V>N/A
Tree Setstd::setAVLTreeTreeSet<E>N/A
Persistent CollectionsN/AN/AN/AN/A
unordered multisetunordered multiset<T>N/AN/AN/A
Unordered Multimapstd::unordered_multimap<K, V>N/AN/AN/A
Dynamic ArrayArray<E>vector<T>ArrayList<E>list
Linked ListDoublyLinkedList<E>list<T>LinkedList<E>deque
Singly Linked ListSinglyLinkedList<E>---
SetSet<E>set<T>HashSet<E>set
MapMap<K, V>map<K, V>HashMap<K, V>dict
Ordered DictionaryMap<K, V>--OrderedDict
QueueQueue<E>queue<T>Queue<E>-
Priority QueuePriorityQueue<E>priority_queue<T>PriorityQueue<E>-
HeapHeap<V>priority_queue<T>PriorityQueue<E>heapq
StackStack<E>stack<T>Stack<E>-
DequeDeque<E>deque<T>--
TrieTrie---
Unordered MapHashMap<K, V>unordered_map<K, V>HashMap<K, V>defaultdict
Multiset-multiset<T>--
Multimap-multimap<K, V>--
Binary TreeBinaryTree<K, V>---
Binary Search TreeBST<K, V>---
Directed GraphDirectedGraph<V, E>---
Undirected GraphUndirectedGraph<V, E>---
Unordered Multiset-unordered_multiset-Counter
Linked Hash Set--LinkedHashSet<E>-
Linked Hash Map--LinkedHashMap<K, V>-
Sorted SetAVLTree<E>-TreeSet<E>-
Sorted MapAVLTree<K, V>-TreeMap<K, V>-
Tree SetAVLTree<E>setTreeSet<E>-
Unordered Multimap-unordered_multimap<K, V>--
Bitset-bitset<N>--
Unordered Set-unordered_set<T>HashSet<E>-
diff --git a/package.json b/package.json index 47dc859..65fc70f 100644 --- a/package.json +++ b/package.json @@ -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", diff --git a/src/data-structures/heap/heap.ts b/src/data-structures/heap/heap.ts index ecc452c..06ef9a2 100644 --- a/src/data-structures/heap/heap.ts +++ b/src/data-structures/heap/heap.ts @@ -42,7 +42,7 @@ export class HeapItem { } } -export abstract class Heap { +export abstract class Heap { /** * The function is a constructor for a class that initializes a priority callback function based on the * options provided.