|
|||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--giden.GRDS.Queue
Copyright (c) 1993-2004 C. R. Coullard, D. S. Dilworth, J. H. Owen,
All Rights Reserved.
We make no representations or warranties about the suitability of
the software, either express or implied, including but not limited
to the implied warranties of merchantability, fitness for a
particular purpose, or non-infringement. We shall not be liable for
any damages suffered by user as a result of using, modifying or
distributing this software or its derivatives.
Queue is a first-in first-out data structure that is based on a LinkList. Objects are removed from the queue in the same order that they were added to the queue.
Copyright (c) 1993-2003 C. R. Coullard, D. S. Dilworth, J. H. Owen, All Rights Reserved.
Network
,
PQList
,
BoundedQueue
Constructor Summary | |
Queue()
Creates a queue |
Method Summary | |
void |
Append(java.lang.Object object)
Appends the object to the end of this queue |
void |
DeleteContents()
Deletes the contents of this queue |
int |
GetSize()
Gets the number of elements in this queue |
java.lang.Object |
GetTop()
Gets the object at the top of this queue without delete |
boolean |
IsEmpty()
Tests if this queue is empty |
java.lang.Object |
Pop()
Gets the object at the top of this queue with delete |
Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public Queue()
Method Detail |
public java.lang.Object GetTop()
public java.lang.Object Pop()
public void Append(java.lang.Object object)
public int GetSize()
public boolean IsEmpty()
public void DeleteContents()
|
|||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |