data-structure-typed 1.33.6 → 1.33.8

package/.github/workflows/ci.yml

@@ -9,6 +9,7 @@ on:
     paths-ignore:
       - 'lib/**'
       - 'dist/**'
+      - 'umd/**'
       - 'docs/**'
       - 'coverage/**'
       - '**/*.md'

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.33.5](https://github.com/zrwusa/data-structure-typed/compare/v1.33.4...main) (upcoming)
+## [v1.33.7](https://github.com/zrwusa/data-structure-typed/compare/v1.33.4...main) (upcoming)
 
 ## [v1.33.4](https://github.com/zrwusa/data-structure-typed/compare/v1.33.3...v1.33.4) (26 September 2023)
 

package/README.md

@@ -2,17 +2,27 @@
 
 Data Structures of Javascript & TypeScript.
 
-Do you envy languages like C++ with [std](), Python with [collections](), and Java with [java.util]() ? Well, no need to envy anymore! JavaScript and TypeScript now have [data-structure-typed]().
+Do you envy C++ with [std](), Python with [collections](), and Java with [java.util]() ? Well, no need to envy anymore! JavaScript and TypeScript now have [data-structure-typed]().
 
 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)
-![Branches](https://img.shields.io/badge/branches-97.54%25-brightgreen.svg?style=flat)
 ![npm](https://aleen42.github.io/badges/src/npm.svg)
 ![eslint](https://aleen42.github.io/badges/src/eslint.svg)
 
+[//]: # (![Branches](https://img.shields.io/badge/branches-55.47%25-red.svg?style=flat))
+
+[//]: # (![Statements](https://img.shields.io/badge/statements-67%25-red.svg?style=flat))
+
+[//]: # (![Functions](https://img.shields.io/badge/functions-66.38%25-red.svg?style=flat))
+
+[//]: # (![Lines](https://img.shields.io/badge/lines-68.6%25-red.svg?style=flat))
+
+
 ## Built-in classic algorithms
 
 DFS(Depth-First Search), DFSIterative, BFS(Breadth-First Search), morris, Bellman-Ford Algorithm, Dijkstra's Algorithm,
@@ -23,7 +33,7 @@ Floyd-Warshall Algorithm, Tarjan's Algorithm.
 ### npm
 
 ```bash
-npm i data-structure-typed --save
+npm i data-structure-typed
 ```
 
 ### yarn
@@ -32,6 +42,14 @@ npm i data-structure-typed --save
 yarn add data-structure-typed
 ```
 
+```js
+import {
+  BinaryTree, Graph, Queue, Stack, PriorityQueue, BST, Trie, DoublyLinkedList,
+  AVLTree, MinHeap, SinglyLinkedList, DirectedGraph, TreeMultiset,
+  DirectedVertex, AVLTreeNode
+} from 'data-structure-typed';
+```
+
 ### CDN
 
 ```html
@@ -40,18 +58,11 @@ yarn add data-structure-typed
 ```
 
 ```js
-const {AVLTree} = dataStructureTyped;
+const {Heap} = dataStructureTyped;
 const {
-  Heap,
-  MinHeap,
-  SinglyLinkedList,
-  Stack,
-  AVLTreeNode,
-  BST,
-  Trie,
-  DirectedGraph,
-  DirectedVertex,
-  TreeMultiset
+  BinaryTree, Graph, Queue, Stack, PriorityQueue, BST, Trie, DoublyLinkedList,
+  AVLTree, MinHeap, SinglyLinkedList, DirectedGraph, TreeMultiset,
+  DirectedVertex, AVLTreeNode
 } = dataStructureTyped;
 ```
 
@@ -441,24 +452,17 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <tr>
       <td>Set</td>
       <td>std::set&lt;T&gt;</td>
-      <td>Set</td>
+      <td>Set&lt;E&gt</td>
       <td>HashSet&lt;E&gt;</td>
       <td>set</td>
     </tr>
     <tr>
       <td>Map</td>
       <td>std::map&lt;K, V&gt;</td>
-      <td>Map</td>
+      <td>Map&lt;K, V&gt;</td>
       <td>HashMap&lt;K, V&gt;</td>
       <td>dict</td>
     </tr>
-    <tr>
-      <td>Unordered Map</td>
-      <td>std::unordered_map&lt;K, V&gt;</td>
-      <td>N/A</td>
-      <td>HashMap&lt;K, V&gt;</td>
-      <td>defaultdict</td>
-    </tr>
     <tr>
       <td>Unordered Set</td>
       <td>std::unordered_set&lt;T&gt;</td>
@@ -466,24 +470,31 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
       <td>HashSet&lt;E&gt;</td>
       <td>N/A</td>
     </tr>
+    <tr>
+      <td>Unordered Map</td>
+      <td>std::unordered_map&lt;K, V&gt;</td>
+      <td>HashMap&lt;K, V&gt;</td>
+      <td>HashMap&lt;K, V&gt;</td>
+      <td>defaultdict</td>
+    </tr>
     <tr>
       <td>Queue</td>
       <td>std::queue&lt;T&gt;</td>
-      <td>Queue</td>
+      <td>Queue&lt;E&gt;</td>
       <td>Queue&lt;E&gt;</td>
       <td>N/A</td>
     </tr>
     <tr>
       <td>Priority Queue</td>
       <td>std::priority_queue&lt;T&gt;</td>
-      <td>PriorityQueue</td>
+      <td>PriorityQueue&lt;E&gt;</td>
       <td>PriorityQueue&lt;E&gt;</td>
       <td>N/A</td>
     </tr>
     <tr>
       <td>Stack</td>
       <td>std::stack&lt;T&gt;</td>
-      <td>Stack</td>
+      <td>Stack&lt;E&gt;</td>
       <td>Stack&lt;E&gt;</td>
       <td>N/A</td>
     </tr>
@@ -497,7 +508,7 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <tr>
       <td>Deque</td>
       <td>std::deque&lt;T&gt;</td>
-      <td>Deque</td>
+      <td>Deque&lt;E&gt;</td>
       <td>N/A</td>
       <td>N/A</td>
     </tr>
@@ -525,17 +536,10 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <tr>
       <td>Ordered Dictionary</td>
       <td>N/A</td>
-      <td>Map</td>
+      <td>Map&lt;K, V&gt;</td>
       <td>N/A</td>
       <td>OrderedDict</td>
     </tr>
-    <tr>
-      <td>Double-Ended Queue (Deque)</td>
-      <td>std::deque&lt;T&gt;</td>
-      <td>Deque</td>
-      <td>N/A</td>
-      <td>N/A</td>
-    </tr>
     <tr>
       <td>Linked Hash Set</td>
       <td>N/A</td>
@@ -553,21 +557,21 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <tr>
       <td>Sorted Set</td>
       <td>N/A</td>
-      <td>AVLTree, RBTree</td>
+      <td>AVLTree</td>
       <td>TreeSet&lt;E&gt;</td>
       <td>N/A</td>
     </tr>
     <tr>
       <td>Sorted Map</td>
       <td>N/A</td>
-      <td>AVLTree, RBTree</td>
+      <td>AVLTree</td>
       <td>TreeMap&lt;K, V&gt;</td>
       <td>N/A</td>
     </tr>
     <tr>
       <td>Tree Set</td>
       <td>std::set</td>
-      <td>AVLTree, RBTree</td>
+      <td>AVLTree</td>
       <td>TreeSet&lt;E&gt;</td>
       <td>N/A</td>
     </tr>