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

@ -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
}
}