algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-12-19 07:00:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

Enhance docs, add tests in CircularQueue (#6015)

Browse Source
This commit is contained in:
Hardik Pawar
2024-10-26 11:48:56 +05:30
committed by GitHub
parent c40eb8dbac
commit 6545688555
2 changed files with 134 additions and 31 deletions
Download Patch File Download Diff File Expand all files Collapse all files

66
src/test/java/com/thealgorithms/datastructures/queues/CircularQueueTest.java
View File

@@ -103,4 +103,70 @@ class CircularQueueTest {
cq.deQueue();
assertEquals(1, cq.size());
}
@Test
void testCircularWrapAround() {
CircularQueue<Integer> cq = new CircularQueue<>(3);
cq.enQueue(1);
cq.enQueue(2);
cq.enQueue(3);
cq.deQueue();
cq.enQueue(4);
assertEquals(2, cq.deQueue());
assertEquals(3, cq.deQueue());
assertEquals(4, cq.deQueue());
assertTrue(cq.isEmpty());
}
@Test
void testEnQueueDeQueueMultipleTimes() {
CircularQueue<Integer> cq = new CircularQueue<>(3);
cq.enQueue(1);
cq.enQueue(2);
cq.deQueue();
cq.enQueue(3);
cq.enQueue(4);
assertTrue(cq.isFull());
assertEquals(2, cq.deQueue());
assertEquals(3, cq.deQueue());
assertEquals(4, cq.deQueue());
assertTrue(cq.isEmpty());
}
@Test
void testMultipleWrapArounds() {
CircularQueue<Integer> cq = new CircularQueue<>(3);
cq.enQueue(1);
cq.deQueue();
cq.enQueue(2);
cq.deQueue();
cq.enQueue(3);
cq.deQueue();
cq.enQueue(4);
assertEquals(4, cq.peek());
}
@Test
void testSizeDuringOperations() {
CircularQueue<Integer> cq = new CircularQueue<>(3);
assertEquals(0, cq.size());
cq.enQueue(1);
cq.enQueue(2);
assertEquals(2, cq.size());
cq.deQueue();
assertEquals(1, cq.size());
cq.enQueue(3);
cq.enQueue(4);
assertEquals(3, cq.size());
cq.deQueue();
cq.deQueue();
assertEquals(1, cq.size());
}
}