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:
Roland Hummel
2023-10-03 23:08:19 +02:00
committed by GitHub
parent 0ca18c2b2c
commit 86d333ee94
392 changed files with 5849 additions and 16622 deletions

View File

@@ -5,13 +5,13 @@
* the correct position and expand sorted part one element at a time.
*/
export function insertionSort (unsortedList) {
export function insertionSort(unsortedList) {
const len = unsortedList.length
for (let i = 1; i < len; i++) {
let j
const tmp = unsortedList[i] // Copy of the current element.
/* Check through the sorted part and compare with the number in tmp. If large, shift the number */
for (j = i - 1; j >= 0 && (unsortedList[j] > tmp); j--) {
for (j = i - 1; j >= 0 && unsortedList[j] > tmp; j--) {
// Shift the number
unsortedList[j + 1] = unsortedList[j]
}
@@ -38,7 +38,7 @@ export function insertionSort (unsortedList) {
- O(1)
*/
export function insertionSortAlternativeImplementation (array) {
export function insertionSortAlternativeImplementation(array) {
const length = array.length
if (length < 2) return array