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>

Data-Structures/Queue/CircularQueue.js

@@ -4,7 +4,7 @@
 // Doesn’t use dynamic memory so No memory leaks
 
 class CircularQueue {
-  constructor (maxLength) {
+  constructor(maxLength) {
     this.queue = []
     this.front = 0
     this.rear = 0
@@ -12,7 +12,7 @@ class CircularQueue {
   }
 
   // ADD ELEMENTS TO QUEUE
-  enqueue (value) {
+  enqueue(value) {
     if (this.checkOverflow()) return
     if (this.checkEmpty()) {
       this.front += 1
@@ -26,7 +26,7 @@ class CircularQueue {
   }
 
   // REMOVES ELEMENTS
-  dequeue () {
+  dequeue() {
     if (this.checkEmpty()) {
       // UNDERFLOW
       return
@@ -44,13 +44,13 @@ class CircularQueue {
   }
 
   // checks if the queue is empty or not
-  checkEmpty () {
+  checkEmpty() {
     if (this.front === 0 && this.rear === 0) {
       return true
     }
   }
 
-  checkSingleelement () {
+  checkSingleelement() {
     if (this.front === this.rear && this.rear !== 0) {
       this.front = this.rear = 0
       return true
@@ -58,27 +58,30 @@ class CircularQueue {
   }
 
   // Checks if max capacity of queue has been reached or not
-  checkOverflow () {
-    if ((this.front === 1 && this.rear === this.maxLength) || (this.front === this.rear + 1)) {
+  checkOverflow() {
+    if (
+      (this.front === 1 && this.rear === this.maxLength) ||
+      this.front === this.rear + 1
+    ) {
       // CIRCULAR QUEUE OVERFLOW
       return true
     }
   }
 
   // Prints the entire array ('*' represents blank space)
-  display (output = value => console.log(value)) {
+  display(output = (value) => console.log(value)) {
     for (let index = 1; index < this.queue.length; index++) {
       output(this.queue[index])
     }
   }
 
   // Displays the length of queue
-  length () {
+  length() {
     return this.queue.length - 1
   }
 
   // Display the top most value of queue
-  peek () {
+  peek() {
     return this.queue[this.front]
   }
 }

Data-Structures/Queue/Queue.js

@@ -1,15 +1,15 @@
 /* Queue
-* A Queue is a data structure that allows you to add an element to the end of
-* a list and remove the item at the front. A queue follows a FIFO (First In First Out)
-* system, where the first item to enter the queue is the first to be removed,
-* All these operation complexities are O(1).
-* This implementation following the linked list structure.
-*/
+ * A Queue is a data structure that allows you to add an element to the end of
+ * a list and remove the item at the front. A queue follows a FIFO (First In First Out)
+ * system, where the first item to enter the queue is the first to be removed,
+ * All these operation complexities are O(1).
+ * This implementation following the linked list structure.
+ */
 
 class Queue {
   #size
 
-  constructor () {
+  constructor() {
     this.head = null
     this.tail = null
     this.#size = 0
@@ -17,7 +17,7 @@ class Queue {
     return Object.seal(this)
   }
 
-  get length () {
+  get length() {
     return this.#size
   }
 
@@ -26,7 +26,7 @@ class Queue {
    * @param {*} data
    * @returns {number} - The current size of queue
    */
-  enqueue (data) {
+  enqueue(data) {
     const node = { data, next: null }
 
     if (!this.head && !this.tail) {
@@ -44,7 +44,7 @@ class Queue {
    * @description - Removes the value at the front of the queue
    * @returns {*} - The first data of the queue
    */
-  dequeue () {
+  dequeue() {
     if (this.isEmpty()) {
       throw new Error('Queue is Empty')
     }
@@ -66,7 +66,7 @@ class Queue {
    * @description - Return the item at the front of the queue
    * @returns {*}
    */
-  peekFirst () {
+  peekFirst() {
     if (this.isEmpty()) {
       throw new Error('Queue is Empty')
     }
@@ -78,7 +78,7 @@ class Queue {
    * @description - Return the item at the tail of the queue
    * @returns {*}
    */
-  peekLast () {
+  peekLast() {
     if (this.isEmpty()) {
       throw new Error('Queue is Empty')
     }
@@ -90,7 +90,7 @@ class Queue {
    * @description - Return the array of Queue
    * @returns {Array<*>}
    */
-  toArray () {
+  toArray() {
     const array = []
     let node = this.head
 
@@ -103,10 +103,10 @@ class Queue {
   }
 
   /**
-  * @description - Return is queue empty or not
-  * @returns {boolean}
-  */
-  isEmpty () {
+   * @description - Return is queue empty or not
+   * @returns {boolean}
+   */
+  isEmpty() {
     return this.length === 0
   }
 }

Data-Structures/Queue/QueueUsing2Stacks.js

@@ -2,17 +2,17 @@
 // contribution made by hamza chabchoub for a university project
 
 class Queue {
-  constructor () {
+  constructor() {
     this.inputStack = []
     this.outputStack = []
   }
 
   // Push item into the inputstack
-  enqueue (item) {
+  enqueue(item) {
     this.inputStack.push(item)
   }
 
-  dequeue () {
+  dequeue() {
     // push all items to outputstack
     this.outputStack = []
     while (this.inputStack.length > 0) {
@@ -31,7 +31,7 @@ class Queue {
   }
 
   // display elements of the inputstack
-  listIn (output = value => console.log(value)) {
+  listIn(output = (value) => console.log(value)) {
     let i = 0
     while (i < this.inputStack.length) {
       output(this.inputStack[i])
@@ -40,7 +40,7 @@ class Queue {
   }
 
   // display element of the outputstack
-  listOut (output = value => console.log(value)) {
+  listOut(output = (value) => console.log(value)) {
     let i = 0
     while (i < this.outputStack.length) {
       output(this.outputStack[i])