7import java.util.NoSuchElementException;
10import static org.junit.Assert.*;
29 assertTrue(queue.
front().intValue()==1);
42 for (
int i=0;i<10;++i)
45 for (
int i=0;i<100;++i)
50 for (
int i=0;((n=queue.
dequeue())!=-1);++i)
53 for (
int i=0;i<100;++i)
57 for (
int i=0;((n=queue.
dequeue())!=-1);++i)
59 for (
int i=0;((n=queue.
dequeue())!=-1);++i)
65 @Test(expected=NoSuchElementException.class)
70 @Test(expected=NoSuchElementException.class)
75 @Test(expected=NoSuchElementException.class)
80 @Test(expected=NoSuchElementException.class)
86 public static void main(String args[]) {
87 org.junit.runner.JUnitCore.main(
"aud.test.QueueTest");
Impementation of AbstractQueue based on doubly linked list DList.
T front()
Get front element of queue.
T dequeue()
Remove front element from queue.
Implementation of AbstractQueue as a (dynamically resized) circular buffer based on array.
T dequeue()
Remove front element from queue.
T front()
Get front element of queue.
Interface for an ADT queue.
abstract boolean is_empty()
Is queue empty?
abstract void enqueue(T x)
Enqueue element at end of queue.
abstract T front()
Get front element of queue.
abstract T dequeue()
Remove front element from queue.
void testInvalid_dequeue()
void testInvalid_dequeueDL()
void testInvalid_frontDL()
static void main(String args[])
AuD lecture: Data structures, algorithms, examples.