priority-queue-typed
Advanced tools
Comparing version 1.34.4 to 1.34.5
@@ -1,2 +0,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":{}} | ||
} |
{ | ||
"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.", | ||
@@ -122,4 +122,4 @@ "main": "dist/index.js", | ||
"dependencies": { | ||
"data-structure-typed": "^1.34.4" | ||
"data-structure-typed": "^1.34.5" | ||
} | ||
} |
import {PriorityQueue} from '../src'; | ||
describe('PriorityQueue Operation Test', () => { | ||
@@ -17,2 +18,44 @@ it('should validate a priority queue', () => { | ||
}); | ||
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]); | ||
}); | ||
}); |
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is not supported yet
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
528631
2771
Updateddata-structure-typed@^1.34.5