|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectnetcom.log.QueueAr
This class was made availible in DataStructures... NETCOM does not claim any responsibility of this class Array-based implementation of the queue.
| Constructor Summary | |
QueueAr()
Construct the queue. |
|
QueueAr(int capacity)
Construct the queue. |
|
| Method Summary | |
java.lang.Object |
dequeue()
Return and remove the least recently inserted item from the queue. |
void |
enqueue(java.lang.Object x)
Insert a new item into the queue. |
java.lang.Object |
getFront()
Get the least recently inserted item in the queue. |
boolean |
isEmpty()
Test if the queue is logically empty. |
boolean |
isFull()
Test if the queue is logically full. |
void |
makeEmpty()
Make the queue logically empty. |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
public QueueAr()
public QueueAr(int capacity)
| Method Detail |
public boolean isEmpty()
public boolean isFull()
public void makeEmpty()
public java.lang.Object getFront()
public java.lang.Object dequeue()
public void enqueue(java.lang.Object x)
throws Overflow
x - the item to insert.
Overflow - if queue is full.
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||