org.apache.commons.collections
インタフェース PriorityQueue

既知の実装クラスの一覧:

SynchronizedPriorityQueue, BinaryHeap

public interface PriorityQueue

Interface for priority queues. This interface does not dictate whether it is min or max heap.

作成者:

Peter Donald

メソッドの概要

void	clear() Clear all elements from queue.
void	insert(java.lang.Comparable element) Insert an element into queue.
boolean	isEmpty() Test if queue is empty.
java.lang.Comparable	peek() Return element on top of heap but don't remove it.
java.lang.Comparable	pop() Return element on top of heap and remove it.

メソッドの詳細

clear

public void clear()

Clear all elements from queue.

insert

public void insert(java.lang.Comparable element)

Insert an element into queue.

パラメータ:

element - the element to be inserted

isEmpty

public boolean isEmpty()

Test if queue is empty.

戻り値:

true if queue is empty else false.

peek

public java.lang.Comparable peek()
                          throws java.util.NoSuchElementException

Return element on top of heap but don't remove it.

戻り値:

the element at top of heap

例外:

java.util.NoSuchElementException - if isEmpty() == true

pop

public java.lang.Comparable pop()
                         throws java.util.NoSuchElementException

Return element on top of heap and remove it.

戻り値:

the element at top of heap

例外:

java.util.NoSuchElementException - if isEmpty() == true