data-structure-typed 1.33.0 → 1.33.5

package/{.eslintrc.json → .eslintrc.js}

@@ -1,4 +1,4 @@
-{
+module.exports = {
   "extends": [
     "plugin:@typescript-eslint/recommended",
     "prettier"
@@ -8,6 +8,7 @@
     "@typescript-eslint/no-unused-vars": "error",
     "@typescript-eslint/ban-ts-comment": "off",
     "@typescript-eslint/no-explicit-any": "off",
+    "@typescript-eslint/no-var-requires": "off",
     "@typescript-eslint/no-non-null-assertion": "off",
     "lines-around-comment": [
       "error",

package/.github/workflows/ci.yml

@@ -21,7 +21,7 @@ jobs:
     runs-on: ubuntu-latest
     strategy:
       matrix:
-        node-version: [19.x, 20.x]
+        node-version: [19.9.0]
     steps:
       - name: Checkout code
         uses: actions/checkout@v4
@@ -34,8 +34,20 @@ jobs:
       - name: Install dependencies
         run: npm install
 
-      - name: Build
+      - name: Print Environment Variables
+        run: env
+
+      - name: Lint
+        run: npm run lint
+
+      - name: Build and documentation
         run: npm run build
 
-      - name: Run tests and documentation
+      - name: Run tests
         run: npm test
+
+      - name: Fetch Tags
+        run: git fetch --tags
+
+      - name: Changelog
+        run:  npm run changelog

package/.github/workflows/release-package.yml

@@ -0,0 +1,32 @@
+name: data-structure-typed
+
+on:
+  release:
+    types: [created]
+
+jobs:
+  build:
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v4
+      - uses: actions/setup-node@v3
+        with:
+          node-version: 19
+      - run: npm ci
+
+  publish-gpr:
+    needs: build
+    runs-on: ubuntu-latest
+    permissions:
+      packages: write
+      contents: read
+    steps:
+      - uses: actions/checkout@v4
+      - uses: actions/setup-node@v3
+        with:
+          node-version: 19
+          registry-url: https://npm.pkg.github.com/
+      - run: npm publish
+        env:
+          NODE_AUTH_TOKEN: ${{secrets.GITHUB_TOKEN}}
+#          GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}

package/{.prettierrc → .prettierrc.js}

@@ -1,4 +1,4 @@
-{
+module.exports = {
   "arrowParens": "avoid",
   "bracketSpacing": false,
   "htmlWhitespaceSensitivity": "css",

package/CHANGELOG.md

@@ -8,7 +8,11 @@ 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.0](https://github.com/zrwusa/data-structure-typed/compare/v1.12.9...main) (upcoming)
+## [v1.33.5](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)
+
+## [v1.33.3](https://github.com/zrwusa/data-structure-typed/compare/v1.12.9...v1.33.3) (26 September 2023)
 
 ## [v1.12.9](https://github.com/zrwusa/data-structure-typed/compare/v1.12.8...v1.12.9) (14 August 2023)
 

package/README.md

@@ -1,5 +1,11 @@
 # Data Structure Typed
 
+Data Structures of Javascript & TypeScript.
+
+Do you envy languages like C++ with <span style="border-radius: 5px;background-color: #0A7DBE; color: #ffffff; padding: 0 3px;">std</span>, Python with <span style="border-radius: 5px;background-color: #0A7DBE; color: #ffffff; padding: 0 3px;">collections</span>, and Java with <span style="border-radius: 5px;background-color: #0A7DBE; color: #ffffff; padding: 0 3px;">java.util</span>? Well, no need to envy anymore! JavaScript and TypeScript now have <span style="border-radius: 5px;background-color: #0A7DBE; color: #ffffff; padding: 0 3px;">data-structure-typed</span>
+
+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)
+
 ![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)
@@ -7,10 +13,6 @@
 ![npm](https://aleen42.github.io/badges/src/npm.svg)
 ![eslint](https://aleen42.github.io/badges/src/eslint.svg)
 
-## Brief
-
-Data Structures of Javascript & TypeScript.
-
 ## Built-in classic algorithms
 
 DFS(Depth-First Search), DFSIterative, BFS(Breadth-First Search), morris, Bellman-Ford Algorithm, Dijkstra's Algorithm,
@@ -21,7 +23,7 @@ Floyd-Warshall Algorithm, Tarjan's Algorithm.
 ### npm
 
 ```bash
-npm install data-structure-typed --save
+npm i data-structure-typed --save
 ```
 
 ### yarn
@@ -34,7 +36,7 @@ yarn add data-structure-typed
 
 ```html
 
-<script src="https://cdn.jsdelivr.net/npm/data-structure-typed/umd/bundle.min.js"></script>
+<script src='https://cdn.jsdelivr.net/npm/data-structure-typed/umd/bundle.min.js'></script>
 ```
 
 ```js
@@ -96,7 +98,7 @@ bst.get(6);                     // null
 bst.isAVLBalanced();            // true
 bst.BFS()[0] === 11;            // true
 
-const objBST = new BST<BSTNode<{ id: number, keyA: number }>>();
+const objBST = new BST<BSTNode<{id: number, keyA: number}>>();
 objBST.add(11, {id: 11, keyA: 11});
 objBST.add(3, {id: 3, keyA: 3});
 
@@ -407,6 +409,193 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
 </tbody>
 </table>
 
+
+
+### 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>
+  </thead>
+  <tbody>
+    <tr>
+      <td>Dynamic Array</td>
+      <td>std::vector&lt;T&gt;</td>
+      <td>Array&lt;E&gt;</td>
+      <td>ArrayList&lt;E&gt;</td>
+      <td>list</td>
+    </tr>
+    <tr>
+      <td>Linked List</td>
+      <td>std::list&lt;T&gt;</td>
+      <td>DoublyLinkedList&lt;E&gt;</td>
+      <td>LinkedList&lt;E&gt;</td>
+      <td>deque</td>
+    </tr>
+    <tr>
+      <td>Set</td>
+      <td>std::set&lt;T&gt;</td>
+      <td>Set</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>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>
+      <td>N/A</td>
+      <td>HashSet&lt;E&gt;</td>
+      <td>N/A</td>
+    </tr>
+    <tr>
+      <td>Queue</td>
+      <td>std::queue&lt;T&gt;</td>
+      <td>Queue</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>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>N/A</td>
+    </tr>
+    <tr>
+      <td>Bitset</td>
+      <td>std::bitset&lt;N&gt;</td>
+      <td>N/A</td>
+      <td>N/A</td>
+      <td>N/A</td>
+    </tr>
+    <tr>
+      <td>Deque</td>
+      <td>std::deque&lt;T&gt;</td>
+      <td>Deque</td>
+      <td>N/A</td>
+      <td>N/A</td>
+    </tr>
+    <tr>
+      <td>Multiset</td>
+      <td>std::multiset&lt;T&gt;</td>
+      <td>N/A</td>
+      <td>N/A</td>
+      <td>N/A</td>
+    </tr>
+    <tr>
+      <td>Multimap</td>
+      <td>std::multimap&lt;K, V&gt;</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</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>
+      <td>N/A</td>
+      <td>LinkedHashSet&lt;E&gt;</td>
+      <td>N/A</td>
+    </tr>
+    <tr>
+      <td>Linked Hash Map</td>
+      <td>N/A</td>
+      <td>N/A</td>
+      <td>LinkedHashMap&lt;K, V&gt;</td>
+      <td>N/A</td>
+    </tr>
+    <tr>
+      <td>Sorted Set</td>
+      <td>N/A</td>
+      <td>AVLTree, RBTree</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>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>TreeSet&lt;E&gt;</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&lt;T&gt;</td>
+      <td>N/A</td>
+      <td>N/A</td>
+      <td>N/A</td>
+    </tr>
+    <tr>
+      <td>Unordered Multimap</td>
+      <td>std::unordered_multimap&lt;K, V&gt;</td>
+      <td>N/A</td>
+      <td>N/A</td>
+      <td>N/A</td>
+    </tr>
+  </tbody>
+</table>
+
+
 ## Code design
 
 By strictly adhering to object-oriented design (BinaryTree -> BST -> AVLTree -> TreeMultiset), you can seamlessly
@@ -675,253 +864,3 @@ optimal approach to data structure design.
 </tr>
 </tbody>
 </table>
-
-
-<table>
-  <tr>
-    <th>Data Structure</th>
-    <th>C++ STL</th>
-    <th>java.util</th>
-    <th>Python collections</th>
-  </tr>
-  <tr>
-    <td>Dynamic Array (ArrayList)</td>
-    <td>std::vector&lt;T&gt;</td>
-    <td>ArrayList&lt;E&gt;</td>
-    <td>list</td>
-  </tr>
-  <tr>
-    <td>Linked List</td>
-    <td>std::list&lt;T&gt;</td>
-    <td>LinkedList&lt;E&gt;</td>
-    <td>deque</td>
-  </tr>
-  <tr>
-    <td>Set</td>
-    <td>std::set&lt;T&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>HashMap&lt;K, V&gt;</td>
-    <td>dict</td>
-  </tr>
-  <tr>
-    <td>Stack</td>
-    <td>std::stack&lt;T&gt;</td>
-    <td>Stack&lt;E&gt;</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Queue</td>
-    <td>std::queue&lt;T&gt;</td>
-    <td>LinkedList&lt;E&gt;</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Priority Queue</td>
-    <td>std::priority_queue&lt;T&gt;</td>
-    <td>PriorityQueue&lt;E&gt;</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Hash Table</td>
-    <td>N/A</td>
-    <td>N/A</td>
-    <td>defaultdict, Counter, etc.</td>
-  </tr>
-  <tr>
-    <td>Deque</td>
-    <td>std::deque&lt;T&gt;</td>
-    <td>N/A</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Multiset</td>
-    <td>std::multiset&lt;T&gt;</td>
-    <td>N/A</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Multimap</td>
-    <td>std::multimap&lt;K, V&gt;</td>
-    <td>N/A</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Unordered Set</td>
-    <td>std::unordered_set&lt;T&gt;</td>
-    <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>N/A</td>
-  </tr>
-  <tr>
-    <td>Bitset</td>
-    <td>std::bitset&lt;N&gt;</td>
-    <td>N/A</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Ordered Dictionary (OrderedDict)</td>
-    <td>N/A</td>
-    <td>N/A</td>
-    <td>OrderedDict</td>
-  </tr>
-  <tr>
-    <td>User-Defined Dictionary</td>
-    <td>N/A</td>
-    <td>N/A</td>
-    <td>UserDict</td>
-  </tr>
-  <tr>
-    <td>User-Defined List</td>
-    <td>N/A</td>
-    <td>N/A</td>
-    <td>UserList</td>
-  </tr>
-  <tr>
-    <td>User-Defined Set</td>
-    <td>N/A</td>
-    <td>N/A</td>
-    <td>UserSet</td>
-  </tr>
-  <tr>
-    <td>Double-Ended Queue (Deque)</td>
-    <td>std::deque&lt;T&gt;</td>
-    <td>N/A</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Skip List</td>
-    <td>N/A</td>
-    <td>N/A</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Circular Queue</td>
-    <td>N/A</td>
-    <td>N/A</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Bit Array</td>
-    <td>N/A</td>
-    <td>N/A</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Bloom Filter</td>
-    <td>N/A</td>
-    <td>N/A</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Linked Hash Set</td>
-    <td>N/A</td>
-    <td>LinkedHashSet&lt;E&gt;</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Linked Hash Map</td>
-    <td>N/A</td>
-    <td>LinkedHashMap&lt;K, V&gt;</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Sorted Set</td>
-    <td>N/A</td>
-    <td>TreeSet&lt;E&gt;</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Sorted Map</td>
-    <td>N/A</td>
-    <td>TreeMap&lt;K, V&gt;</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Tree Set</td>
-    <td>N/A</td>
-    <td>N/A</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Tree Map</td>
-    <td>N/A</td>
-    <td>N/A</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>Persistent Collections</td>
-    <td>N/A</td>
-    <td>N/A</td>
-    <td>N/A</td>
-  </tr>
-<tr>
-    <td>std::unordered_multiset</td>
-    <td>std::unordered_multiset&lt;T&gt;</td>
-    <td>N/A</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>std::unordered_multimap</td>
-    <td>std::unordered_multimap&lt;K, V&gt;</td>
-    <td>N/A</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>N/A</td>
-    <td>TreeSet&lt;E&gt;</td>
-    <td>TreeSet&lt;E&gt;</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>N/A</td>
-    <td>TreeMap&lt;K, V&gt;</td>
-    <td>TreeMap&lt;K, V&gt;</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>N/A</td>
-    <td>LinkedBlockingQueue&lt;E&gt;</td>
-    <td>N/A</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>N/A</td>
-    <td>ConcurrentHashMap&lt;K, V&gt;</td>
-    <td>N/A</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>N/A</td>
-    <td>N/A</td>
-    <td>namedtuple</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>N/A</td>
-    <td>N/A</td>
-    <td>ChainMap</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>N/A</td>
-    <td>N/A</td>
-    <td>defaultdict</td>
-    <td>N/A</td>
-  </tr>
-  <tr>
-    <td>N/A</td>
-    <td>N/A</td>
-    <td>Counter</td>
-    <td>N/A</td>
-  </tr>
-</table>