package rd222dv_assign4; import java.util.Iterator; import static org.junit.Assert.*; import org.junit.*; public class QueueJUnit { //most of the JUnit tests have been taken from assign2 private static int test_count = 0; @Before // executed before every test method public void setUp() { test_count++; System.out.println("Test: " + test_count); } @After // executed after every test method public void tearDown() { } @Test public void testSize() { Queue queueInt = new LinkedQueue(); Queue queueStr = new LinkedQueue(); assertEquals(0, queueInt.size()); //if is Empty assertEquals(0, queueStr.size()); for (int i = 0; i < 50; i++) { //enqueue 50 queueInt.enqueue(50); queueStr.enqueue("" + 50); } assertEquals(50, queueInt.size()); //check if size is 50 assertEquals(50, queueStr.size()); } @Test public void testIsEmpty() { Queue queueInt = new LinkedQueue(); Queue queueStr = new LinkedQueue(); assertEquals(true, queueInt.isEmpty()); //if is empty assertEquals(true, queueStr.isEmpty()); queueInt.enqueue(50); //if is 50 queueStr.enqueue("" + 50); assertEquals(false, queueInt.isEmpty()); assertEquals(false, queueStr.isEmpty()); } @Test public void testEnqueue() { Queue queueInt = new LinkedQueue(); Queue queueStr = new LinkedQueue(); for (int i = 0; i < 50; i++) { queueInt.enqueue(i); queueStr.enqueue("" + i); assertTrue(!queueInt.isEmpty()); assertTrue(!queueStr.isEmpty()); } } @Test public void testEnqueueDequeue() { Queue queueInt = new LinkedQueue(); Queue queueStr = new LinkedQueue(); for (int i = 0; i < 50; i++) { //first adding queueInt.enqueue(i); queueStr.enqueue("" + i); } for (int i = 0; i < 50; i++) { //removing again assertEquals(i, (int) queueInt.dequeue()); assertEquals("" + i, queueStr.dequeue()); } } @Test public void testFirst() { Queue queueInt = new LinkedQueue(); Queue queueStr = new LinkedQueue(); for (int i = 0; i < 50; i++) { //adding to queue queueInt.enqueue(i); queueStr.enqueue("" + i); } assertEquals(0, (int) queueInt.first()); assertEquals("" + 0, queueStr.first()); Queue queueInt1 = new LinkedQueue(); //test with 1 Element Queue queueStr1 = new LinkedQueue(); queueInt1.enqueue(50); queueStr1.enqueue("" + 50); assertEquals(50, (int) queueInt1.first()); assertEquals("" + 50, queueStr1.first()); } @Test public void testLast() { Queue queueInt = new LinkedQueue(); Queue queueStr = new LinkedQueue(); for (int i = 0; i < 50; i++) { //adding to queue queueInt.enqueue(i); queueStr.enqueue("" + i); assertEquals(i, (int) queueInt.last()); //test last assertEquals("" + i, queueStr.last()); } Queue queueInt1 = new LinkedQueue(); //test with 1 element Queue queueStr1 = new LinkedQueue(); queueInt1.enqueue(50); queueStr1.enqueue("" + 50); assertEquals(50, (int) queueInt1.last()); /* Check */ assertEquals("" + 50, queueStr1.last()); } @Test public void testString() { Queue queueInt = new LinkedQueue(); Queue queueStr = new LinkedQueue(); String str = "< >"; assertEquals(str, queueInt.toString()); assertEquals(str, queueStr.toString()); } @Test public void testIterator() { Queue queueInt = new LinkedQueue(); Queue queueStr = new LinkedQueue(); for (int i = 0; i < 50; i++) { //adding to queue queueInt.enqueue(i); queueStr.enqueue("" + i); } //test if Iterator has same element as inserted above Iterator IntIt = queueInt.iterator(); Iterator StrIt = queueStr.iterator(); int j = 0; while (IntIt.hasNext()) { assertEquals(j, (int) IntIt.next()); j++; } int k = 0; while (StrIt.hasNext()) { assertEquals("" + k, StrIt.next()); k++; } Queue queueInt1 = new LinkedQueue(); //empty queue Queue queueStr1 = new LinkedQueue(); Iterator intQueue = queueInt1.iterator(); Iterator strQueue = queueStr1.iterator(); assertEquals(false, intQueue.hasNext()); assertEquals(false, strQueue.hasNext()); } }