org.deeplearning4j.berkeley

Interface PriorityQueueInterface<E>

All Known Implementing Classes:

PriorityQueue

public interface PriorityQueueInterface<E>

Method Summary

Methods

Modifier and Type	Method and Description
double	getPriority() Gets the priority of the highest-priority element of the queue.
boolean	hasNext() Returns true if the priority queue is non-empty
boolean	isEmpty() True if the queue is empty (size == 0).
E	next() Returns the element in the queue with highest priority, and pops it from the queue.
E	peek() Returns the highest-priority element in the queue, but does not pop it.
void	put(E key, double priority) Adds a key to the queue with the given priority.
void	remove() Not supported -- next() already removes the head of the queue.
int	size() Number of elements in the queue.

Method Detail

hasNext

boolean hasNext()

Returns true if the priority queue is non-empty

next

E next()

Returns the element in the queue with highest priority, and pops it from the queue.

remove

void remove()

Not supported -- next() already removes the head of the queue.

peek

E peek()

Returns the highest-priority element in the queue, but does not pop it.

getPriority

double getPriority()

Gets the priority of the highest-priority element of the queue.

size

int size()

Number of elements in the queue.

isEmpty

boolean isEmpty()

True if the queue is empty (size == 0).

put

void put(E key,
       double priority)

Adds a key to the queue with the given priority. If the key is already in the queue, it will be added an additional time, NOT promoted/demoted.

Parameters:

key -

priority -