|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface PriorityQueue
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(Object element)
Insert an element into queue. |
boolean |
isEmpty()
Test if queue is empty. |
Object |
peek()
Return element on top of heap but don't remove it. |
Object |
pop()
Return element on top of heap and remove it. |
Method Detail |
---|
void clear()
boolean isEmpty()
void insert(Object element)
element
- the element to be insertedObject peek() throws NoSuchElementException
NoSuchElementException
- if isEmpty() == trueObject pop() throws NoSuchElementException
NoSuchElementException
- if isEmpty() == true
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |