mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-06 09:28:26 +08:00
feat: Test running overhaul, switch to Prettier & reformat everything (#1407)
* 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>
This commit is contained in:
@ -12,14 +12,14 @@ describe('AVLTree Implementation: ', () => {
|
||||
const emptyTree = new AVLTree(collator.compare)
|
||||
|
||||
beforeAll(() => {
|
||||
demoData.forEach(item => {
|
||||
demoData.forEach((item) => {
|
||||
if (avlTree.add(item)) {
|
||||
dataList.push(item)
|
||||
}
|
||||
})
|
||||
|
||||
avlStringTree._comp = collator.compare
|
||||
stringData.forEach(item => avlStringTree.add(item))
|
||||
stringData.forEach((item) => avlStringTree.add(item))
|
||||
})
|
||||
|
||||
it('delete and search from empty tree', () => {
|
||||
@ -33,10 +33,10 @@ describe('AVLTree Implementation: ', () => {
|
||||
})
|
||||
|
||||
it('search if inserted element is present', () => {
|
||||
demoData.forEach(data => {
|
||||
demoData.forEach((data) => {
|
||||
expect(avlTree.find(data)).toBeTruthy()
|
||||
})
|
||||
stringData.forEach(data => {
|
||||
stringData.forEach((data) => {
|
||||
expect(avlStringTree.find(data)).toBeTruthy()
|
||||
})
|
||||
})
|
||||
|
Reference in New Issue
Block a user