mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-05 16:26:47 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
56 lines
1.6 KiB
JavaScript
56 lines
1.6 KiB
JavaScript
import { MinPriorityQueue } from '../MinPriorityQueue'
|
|
|
|
describe('MinPriorityQueue', () => {
|
|
const values = [5, 2, 4, 1, 7, 6, 3, 8]
|
|
const capacity = values.length
|
|
let queue
|
|
|
|
beforeEach(() => {
|
|
queue = new MinPriorityQueue(capacity)
|
|
values.forEach((v) => queue.insert(v))
|
|
})
|
|
|
|
it('Check heap ordering', () => {
|
|
const mockFn = vi.fn()
|
|
queue.print(mockFn)
|
|
|
|
expect(mockFn.mock.calls.length).toBe(1) // Expect one call
|
|
expect(mockFn.mock.calls[0].length).toBe(1) // Expect one argument
|
|
|
|
const heap = mockFn.mock.calls[0][0]
|
|
expect(heap.length).toBe(capacity)
|
|
expect(heap).toStrictEqual([1, 2, 3, 5, 7, 6, 4, 8])
|
|
})
|
|
|
|
it('heapSort() expected to reverse the heap ordering', () => {
|
|
queue.heapReverse()
|
|
const mockFn = vi.fn()
|
|
queue.print(mockFn)
|
|
|
|
expect(mockFn.mock.calls.length).toBe(1)
|
|
expect(mockFn.mock.calls[0].length).toBe(1)
|
|
|
|
const heap = mockFn.mock.calls[0][0]
|
|
expect(heap.length).toBe(capacity)
|
|
expect(heap).toStrictEqual([8, 7, 6, 5, 4, 3, 2, 1])
|
|
})
|
|
|
|
describe('delete() function work properly', () => {
|
|
it('return undefined if heap is empty', () => {
|
|
const minqueue = new MinPriorityQueue(capacity)
|
|
const min = minqueue.delete()
|
|
expect(min).toBe(undefined)
|
|
})
|
|
it('return min value and remove it', () => {
|
|
const sortedValues = values.sort()
|
|
let initialSize = queue.size
|
|
sortedValues.forEach((minValue, index) => {
|
|
const min = queue.delete()
|
|
expect(min).toBe(minValue)
|
|
expect(queue.size).toBe(--initialSize)
|
|
})
|
|
expect(queue.size).toBe(0)
|
|
})
|
|
})
|
|
})
|