priority-queue-typed 1.34.4 → 1.34.5

package/coverage/clover.xml

@@ -1,10 +1,10 @@
 <?xml version="1.0" encoding="UTF-8"?>
-<coverage generated="1696600375787" clover="3.2.0">
-  <project timestamp="1696600375787" name="All files">
+<coverage generated="1696760609900" clover="3.2.0">
+  <project timestamp="1696760609900" name="All files">
     <metrics statements="1" coveredstatements="1" conditionals="0" coveredconditionals="0" methods="3" coveredmethods="1" elements="4" coveredelements="2" complexity="0" loc="1" ncloc="1" packages="1" files="1" classes="1"/>
     <file name="index.ts" path="/Users/revone/projects/data-structure-typed-individuals/priority-queue-typed/src/index.ts">
       <metrics statements="1" coveredstatements="1" conditionals="0" coveredconditionals="0" methods="3" coveredmethods="1"/>
-      <line num="8" count="5" type="stmt"/>
+      <line num="8" count="10" type="stmt"/>
     </file>
   </project>
 </coverage>

package/coverage/coverage-final.json

@@ -1,2 +1,2 @@
-{"/Users/revone/projects/data-structure-typed-individuals/priority-queue-typed/src/index.ts": {"path":"/Users/revone/projects/data-structure-typed-individuals/priority-queue-typed/src/index.ts","statementMap":{"0":{"start":{"line":8,"column":0},"end":{"line":8,"column":9}},"1":{"start":{"line":8,"column":9},"end":{"line":8,"column":24}},"2":{"start":{"line":8,"column":24},"end":{"line":8,"column":42}},"3":{"start":{"line":8,"column":42},"end":{"line":8,"column":89}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":8,"column":9},"end":{"line":8,"column":22}},"loc":{"start":{"line":8,"column":9},"end":{"line":8,"column":24}}},"1":{"name":"(anonymous_1)","decl":{"start":{"line":8,"column":24},"end":{"line":8,"column":40}},"loc":{"start":{"line":8,"column":24},"end":{"line":8,"column":42}}},"2":{"name":"(anonymous_2)","decl":{"start":{"line":8,"column":42},"end":{"line":8,"column":58}},"loc":{"start":{"line":8,"column":42},"end":{"line":8,"column":89}}}},"branchMap":{},"s":{"0":1,"1":5,"2":1,"3":1},"f":{"0":4,"1":0,"2":0},"b":{}}
+{"/Users/revone/projects/data-structure-typed-individuals/priority-queue-typed/src/index.ts": {"path":"/Users/revone/projects/data-structure-typed-individuals/priority-queue-typed/src/index.ts","statementMap":{"0":{"start":{"line":8,"column":0},"end":{"line":8,"column":9}},"1":{"start":{"line":8,"column":9},"end":{"line":8,"column":24}},"2":{"start":{"line":8,"column":24},"end":{"line":8,"column":42}},"3":{"start":{"line":8,"column":42},"end":{"line":8,"column":89}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":8,"column":9},"end":{"line":8,"column":22}},"loc":{"start":{"line":8,"column":9},"end":{"line":8,"column":24}}},"1":{"name":"(anonymous_1)","decl":{"start":{"line":8,"column":24},"end":{"line":8,"column":40}},"loc":{"start":{"line":8,"column":24},"end":{"line":8,"column":42}}},"2":{"name":"(anonymous_2)","decl":{"start":{"line":8,"column":42},"end":{"line":8,"column":58}},"loc":{"start":{"line":8,"column":42},"end":{"line":8,"column":89}}}},"branchMap":{},"s":{"0":1,"1":10,"2":1,"3":1},"f":{"0":9,"1":0,"2":0},"b":{}}
 }

package/coverage/lcov-report/index.html

@@ -101,7 +101,7 @@
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-10-06T13:52:55.804Z
+                at 2023-10-08T10:23:29.918Z
             </div>
         <script src="prettify.js"></script>
         <script>

package/coverage/lcov-report/index.ts.html

@@ -78,7 +78,7 @@
 <span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">5x</span>
+<span class="cline-any cline-yes">10x</span>
 <span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">/**
  * data-structure-typed
  *
@@ -94,7 +94,7 @@ export { PriorityQueue, <span class="fstat-no" title="function not covered" >Max
             <div class='footer quiet pad2 space-top1 center small'>
                 Code coverage generated by
                 <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-10-06T13:52:55.804Z
+                at 2023-10-08T10:23:29.918Z
             </div>
         <script src="prettify.js"></script>
         <script>

package/coverage/lcov.info

@@ -5,10 +5,10 @@ FN:8,(anonymous_1)
 FN:8,(anonymous_2)
 FNF:3
 FNH:1
-FNDA:4,(anonymous_0)
+FNDA:9,(anonymous_0)
 FNDA:0,(anonymous_1)
 FNDA:0,(anonymous_2)
-DA:8,5
+DA:8,10
 LF:1
 LH:1
 BRF:0

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "priority-queue-typed",
-  "version": "1.34.4",
+  "version": "1.34.5",
   "description": "Priority Queue, Min Priority Queue, Max Priority Queue. Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -119,6 +119,6 @@
     "typedoc": "^0.25.1"
   },
   "dependencies": {
-    "data-structure-typed": "^1.34.4"
+    "data-structure-typed": "^1.34.5"
   }
 }

package/test/index.test.ts

@@ -1,5 +1,6 @@
 import {PriorityQueue} from '../src';
 
+
 describe('PriorityQueue Operation Test', () => {
     it('should validate a priority queue', () => {
         const minPQ = new PriorityQueue<number>({nodes: [1, 5, 7, 9, 3, 6, 2], comparator: (a, b) => a - b});
@@ -14,4 +15,46 @@ describe('PriorityQueue Operation Test', () => {
             })
         ).toBe(false);
     });
+
+    it('should PriorityQueue poll, pee, heapify, toArray work well', function () {
+        const minPQ = new PriorityQueue<number>({nodes: [5, 2, 3, 4, 6, 1], comparator: (a, b) => a - b});
+        expect(minPQ.toArray()).toEqual([1, 2, 3, 4, 6, 5]);
+        minPQ.poll();
+        minPQ.poll();
+        minPQ.poll();
+        expect(minPQ.toArray()).toEqual([4, 5, 6]);
+        expect(minPQ.peek()).toBe(4);
+        expect(
+            PriorityQueue.heapify({
+                nodes: [3, 2, 1, 5, 6, 7, 8, 9, 10],
+                comparator: (a, b) => a - b
+            }).toArray()
+        ).toEqual([1, 2, 3, 5, 6, 7, 8, 9, 10]);
+    });
+
+    it('should Max PriorityQueue poll, peek, heapify, toArray work well', function () {
+        const maxPriorityQueue = new PriorityQueue<number>({nodes: [5, 2, 3, 4, 6, 1], comparator: (a, b) => b - a});
+        expect(maxPriorityQueue.toArray()).toEqual([6, 5, 3, 4, 2, 1]);
+        maxPriorityQueue.poll();
+        maxPriorityQueue.poll();
+        maxPriorityQueue.poll();
+        expect(maxPriorityQueue.toArray()).toEqual([3, 2, 1]);
+        expect(maxPriorityQueue.peek()).toBe(3);
+        expect(
+            PriorityQueue.heapify({
+                nodes: [3, 2, 1, 5, 6, 7, 8, 9, 10],
+                comparator: (a, b) => a - b
+            }).toArray()
+        ).toEqual([1, 2, 3, 5, 6, 7, 8, 9, 10]);
+    });
+
+    it('should PriorityQueue clone, sort, getNodes, DFS work well', function () {
+        const minPQ1 = new PriorityQueue<number>({nodes: [2, 5, 8, 3, 1, 6, 7, 4], comparator: (a, b) => a - b});
+        const clonedPriorityQueue = minPQ1.clone();
+        expect(clonedPriorityQueue.getNodes()).toEqual(minPQ1.getNodes());
+        expect(clonedPriorityQueue.sort()).toEqual([1, 2, 3, 4, 5, 6, 7, 8]);
+        expect(minPQ1.DFS('in')).toEqual([4, 3, 2, 5, 1, 8, 6, 7]);
+        expect(minPQ1.DFS('post')).toEqual([4, 3, 5, 2, 8, 7, 6, 1]);
+        expect(minPQ1.DFS('pre')).toEqual([1, 2, 3, 4, 5, 6, 8, 7]);
+    });
 });