|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
Iterface for priority queues. This interface does not dictate whether it is min or max heap.
Method Summary | |
void |
clear()
Clear all elements from queue. |
void |
insert(java.lang.Object element)
Insert an element into queue. |
boolean |
isEmpty()
Test if queue is empty. |
java.lang.Object |
peek()
Return element on top of heap but don't remove it. |
java.lang.Object |
pop()
Return element on top of heap and remove it. |
Method Detail |
public void clear()
public boolean isEmpty()
public void insert(java.lang.Object element)
element
- the element to be insertedpublic java.lang.Object peek() throws java.util.NoSuchElementException
java.util.NoSuchElementException
- if isEmpty() == truepublic java.lang.Object pop() throws java.util.NoSuchElementException
java.util.NoSuchElementException
- if isEmpty() == true
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |