data-structure-typed 1.34.6 → 1.34.7

package/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.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)
 
 ## [v1.34.1](https://github.com/zrwusa/data-structure-typed/compare/v1.33.4...v1.34.1) (6 October 2023)
 

package/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,6 +426,7 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
 
 ### Standard library data structure comparison
 
+
 <table>
   <thead>
   <tr>
@@ -449,6 +452,13 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <td>LinkedList&lt;E&gt;</td>
     <td>deque</td>
   </tr>
+  <tr>
+    <td>Singly Linked List</td>
+    <td>SinglyLinkedList&lt;E&gt;</td>
+    <td>-</td>
+    <td>-</td>
+    <td>-</td>
+  </tr>
   <tr>
     <td>Set</td>
     <td>Set&lt;E&gt;</td>
@@ -464,19 +474,13 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <td>dict</td>
   </tr>
   <tr>
-    <td>Unordered Set</td>
+    <td>Ordered Dictionary</td>
+    <td>Map&lt;K, V&gt;</td>
     <td>-</td>
-    <td>unordered_set&lt;T&gt;</td>
-    <td>HashSet&lt;E&gt;</td>
     <td>-</td>
+    <td>OrderedDict</td>
   </tr>
-  <tr>
-    <td>Unordered Map</td>
-    <td>HashMap&lt;K, V&gt;</td>
-    <td>unordered_map&lt;K, V&gt;</td>
-    <td>HashMap&lt;K, V&gt;</td>
-    <td>defaultdict</td>
-  </tr>
+
   <tr>
     <td>Queue</td>
     <td>Queue&lt;E&gt;</td>
@@ -491,6 +495,13 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <td>PriorityQueue&lt;E&gt;</td>
     <td>-</td>
   </tr>
+  <tr>
+    <td>Heap</td>
+    <td>Heap&lt;V&gt;</td>
+    <td>priority_queue&lt;T&gt;</td>
+    <td>PriorityQueue&lt;E&gt;</td>
+    <td>heapq</td>
+  </tr>
   <tr>
     <td>Stack</td>
     <td>Stack&lt;E&gt;</td>
@@ -499,19 +510,26 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <td>-</td>
   </tr>
   <tr>
-    <td>Bitset</td>
-    <td>-</td>
-    <td>bitset&lt;N&gt;</td>
+    <td>Deque</td>
+    <td>Deque&lt;E&gt;</td>
+    <td>deque&lt;T&gt;</td>
     <td>-</td>
     <td>-</td>
   </tr>
   <tr>
-    <td>Deque</td>
-    <td>Deque&lt;E&gt;</td>
-    <td>deque&lt;T&gt;</td>
+    <td>Trie</td>
+    <td>Trie</td>
+    <td>-</td>
     <td>-</td>
     <td>-</td>
   </tr>
+  <tr>
+    <td>Unordered Map</td>
+    <td>HashMap&lt;K, V&gt;</td>
+    <td>unordered_map&lt;K, V&gt;</td>
+    <td>HashMap&lt;K, V&gt;</td>
+    <td>defaultdict</td>
+  </tr>
   <tr>
     <td>Multiset</td>
     <td>-</td>
@@ -527,18 +545,39 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <td>-</td>
   </tr>
   <tr>
-    <td>Unordered Multiset</td>
+    <td>Binary Tree</td>
+    <td>BinaryTree&lt;K, V&gt;</td>
+    <td>-</td>
     <td>-</td>
-    <td>unordered_multiset</td>
-    <td>Counter</td>
     <td>-</td>
   </tr>
   <tr>
-    <td>Ordered Dictionary</td>
-    <td>Map&lt;K, V&gt;</td>
+    <td>Binary Search Tree</td>
+    <td>BST&lt;K, V&gt;</td>
     <td>-</td>
     <td>-</td>
-    <td>OrderedDict</td>
+    <td>-</td>
+  </tr>
+  <tr>
+    <td>Directed Graph</td>
+    <td>DirectedGraph&lt;V, E&gt;</td>
+    <td>-</td>
+    <td>-</td>
+    <td>-</td>
+  </tr>
+  <tr>
+    <td>Undirected Graph</td>
+    <td>UndirectedGraph&lt;V, E&gt;</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>
@@ -576,24 +615,24 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <td>-</td>
   </tr>
   <tr>
-    <td>Persistent Collections</td>
-    <td>-</td>
+    <td>Unordered Multimap</td>
     <td>-</td>
+    <td>unordered_multimap&lt;K, V&gt;</td>
     <td>-</td>
     <td>-</td>
   </tr>
   <tr>
-    <td>unordered multiset</td>
+    <td>Bitset</td>
     <td>-</td>
-    <td>unordered_multiset&lt;T&gt;</td>
+    <td>bitset&lt;N&gt;</td>
     <td>-</td>
     <td>-</td>
   </tr>
   <tr>
-    <td>Unordered Multimap</td>
-    <td>unordered_multimap&lt;K, V&gt;</td>
-    <td>-</td>
+    <td>Unordered Set</td>
     <td>-</td>
+    <td>unordered_set&lt;T&gt;</td>
+    <td>HashSet&lt;E&gt;</td>
     <td>-</td>
   </tr>
   </tbody>

package/lib/data-structures/heap/heap.d.ts

@@ -23,7 +23,7 @@ export declare class HeapItem<V = any> {
     get val(): V | null;
     set val(value: V | null);
 }
-export declare abstract class Heap<V = number> {
+export declare abstract class Heap<V = any> {
     /**
      * The function is a constructor for a class that initializes a priority callback function based on the
      * options provided.

package/package.json

@@ -1,6 +1,6 @@
 {
   "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.",
   "main": "dist/index.js",
   "module": "lib/index.js",

package/src/data-structures/heap/heap.ts

@@ -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.