Skip to content

Test running overhaul, switch to Prettier & reformat everything #1407

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 12 commits into from
Oct 3, 2023
Merged

Test running overhaul, switch to Prettier & reformat everything #1407

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
12 commits
Select commit Hold shift + click to select a range
cf38921
chore: Switch to Node 20 + Vitest
defaude Oct 1, 2023
2f58f98
chore: migrate to vitest mock functions
defaude Oct 1, 2023
cc35e55
chore: code style (switch to prettier)
defaude Oct 1, 2023
5ea795f
test: re-enable long-running test
defaude Oct 1, 2023
2fe0ba4
chore: code style
defaude Oct 2, 2023
f04c255
chore: fix failing tests
defaude Oct 2, 2023
1942cc2
Updated Documentation in README.md
Oct 2, 2023
ed96e23
Update contribution guidelines to state usage of Prettier
appgurueu Oct 2, 2023
60b4cff
fix: set prettier printWidth back to 80
defaude Oct 3, 2023
592cec4
chore: apply updated code style automatically
defaude Oct 3, 2023
3ac2a8f
fix: set prettier line endings to lf again
defaude Oct 3, 2023
f1d1c78
chore: apply updated code style automatically
defaude Oct 3, 2023
File filter

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
chore: migrate to vitest mock functions
  • Loading branch information
@defaude
defaude committed Oct 2, 2023
commit 2f58f9884f01926c66b3b7f45ab0a680f2b21ecb
11 changes: 2 additions & 9 deletions Data-Structures/Graph/test/Graph2.test.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -18,7 +18,7 @@ describe('Test Graph2', () => {
graph.addEdge('C', 'F')

it('Check adjacency lists', () => {
const mockFn = jest.fn()
const mockFn = vi.fn()
graph.printGraph(mockFn)

// Expect one call per vertex
Expand All @@ -27,13 +27,6 @@ describe('Test Graph2', () => {
// Collect adjacency lists from output (call args)
const adjListArr = mockFn.mock.calls.map((v) => v[0])

expect(adjListArr).toEqual([
'A -> B D E ',
'B -> A C ',
'C -> B E F ',
'D -> A E ',
'E -> A D F C ',
'F -> E C '
])
expect(adjListArr).toEqual(['A -> B D E ', 'B -> A C ', 'C -> B E F ', 'D -> A E ', 'E -> A D F C ', 'F -> E C '])
})
})
6 changes: 3 additions & 3 deletions Data-Structures/Heap/test/MinPriorityQueue.test.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,11 +7,11 @@ describe('MinPriorityQueue', () => {

beforeEach(() => {
queue = new MinPriorityQueue(capacity)
values.forEach(v => queue.insert(v))
values.forEach((v) => queue.insert(v))
})

it('Check heap ordering', () => {
const mockFn = jest.fn()
const mockFn = vi.fn()
queue.print(mockFn)

expect(mockFn.mock.calls.length).toBe(1) // Expect one call
Expand All @@ -24,7 +24,7 @@ describe('MinPriorityQueue', () => {

it('heapSort() expected to reverse the heap ordering', () => {
queue.heapReverse()
const mockFn = jest.fn()
const mockFn = vi.fn()
queue.print(mockFn)

expect(mockFn.mock.calls.length).toBe(1)
Expand Down