algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-06 17:50:39 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat: Test running overhaul, switch to Prettier & reformat everything (#1407)

Browse Source 
* 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
Download Patch File Download Diff File Expand all files Collapse all files

23
Data-Structures/Queue/CircularQueue.js
View File

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