Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
28 changes: 23 additions & 5 deletions src/queue/queue-data-structure.js
Original file line number Diff line number Diff line change
Expand Up @@ -5,23 +5,41 @@ class Queue {
}

canEnqueue() {
// ... your code goes here
if (this.queueControl.length < this.MAX_SIZE) {
return true
} else {
return false
}
}

isEmpty() {
// ... your code goes here
if(this.queueControl.length === 0) {
return true
} else {
return false
}
}

enqueue(item) {
// ... your code goes here
if (this.canEnqueue() === true) {
this.queueControl.push(item)
}
else {
throw new Error('QUEUE_OVERFLOW')
}
return this.queueControl
}

dequeue() {
// ... your code goes here
if (this.isEmpty() === false) {
return this.queueControl.shift()
} else {
throw new Error('QUEUE_UNDERFLOW')
}
}

display() {
// ... your code goes here
return this.queueControl
}
}

Expand Down
44 changes: 34 additions & 10 deletions src/queue/queue-dom.js
Original file line number Diff line number Diff line change
Expand Up @@ -10,38 +10,62 @@ const dequeue = document.querySelector('.btn-take-dequeue');
const queue = new Queue();

const clearQueueInput = () => {
// ... your code goes here
queueInput.value = '';
};

const generateListQueue = () => {
// ... your code goes here
warningTopQueue.style.display = 'none';
warningBottomQueue.style.display = 'none';
queueUL.innerHTML = '';
let length = queue.display().length;
let size = queue.MAX_SIZE - length;
queue.display().forEach(item => {
let li = document.createElement('li');
li.className = 'active';
li.innerText = item;
queueUL.appendChild(li);
});
for (let i=0; i < size; i++) {
let li = document.createElement('li');
li.className = 'inactive';
li.innerHTML = '&nbsp;';
queueUL.appendChild(li);
}
};

generateListQueue();

const generateWarningQueue = (type) => {
if (type === 'underflow') {
// ... your code goes here
warningBottomQueue.style.display = 'block';
warningBottomQueue.innerText = type;

} else if (type === 'overflow') {
// ... your code goes here
warningTopQueue.style.display = 'block'
warningTopQueue.innerText = type;
}
};

const addToQueue = () => {
try {
// ... your code goes here
queue.enqueue(queueInput.value)
clearQueueInput();
generateListQueue();
} catch (error) {
// there was an overflow error, handle it
generateWarningQueue('overflow')
}
};

const removeFromQueue = () => {
try {
// ... your code goes here
try {
queue.dequeue()
generateListQueue();
} catch (error) {
// there was an underflow error, handle it
}
generateWarningQueue('underflow')
}
};



addQueue.addEventListener('click', addToQueue);
dequeue.addEventListener('click', removeFromQueue);
27 changes: 22 additions & 5 deletions src/stack/stack-data-structure.js
Original file line number Diff line number Diff line change
Expand Up @@ -5,23 +5,40 @@ class Stack {
}

canPush() {
// ... your code goes here
if (this.stackControl.length < this.MAX_SIZE) {
return true
} else {
return false
}
}

isEmpty() {
// ... your code goes here
if (this.stackControl.length === 0) {
return true
} else {
return false
}
}

push(item) {
// ... your code goes here
if (this.canPush() === true) {
this.stackControl.push(item)
} else {
throw new Error('STACK_OVERFLOW')
}
return this.stackControl
}

pop() {
// ... your code goes here
if(this.isEmpty() === false) {
return this.stackControl.pop()
} else {
throw new Error('STACK_UNDERFLOW')
}
}

display() {
// ... your code goes here
return this.stackControl
}
}

Expand Down