net.datastructures

Interface PriorityQueue<K,V>

All Known Subinterfaces:

AdaptablePriorityQueue<K,V>

All Known Implementing Classes:

CS16AdaptableHeapPriorityQueue, HeapAdaptablePriorityQueue, HeapPriorityQueue, SortedListAdaptablePriorityQueue, SortedListPriorityQueue

public interface PriorityQueue<K,V>

Interface for the priority queue ADT

Method Summary

Modifier and Type	Method and Description
Entry<K,V>	insert(K key, V value) Inserts a key-value pair and return the entry created.
boolean	isEmpty() Returns whether the priority queue is empty.
Entry<K,V>	min() Returns but does not remove an entry with minimum key.
Entry<K,V>	removeMin() Removes and returns an entry with minimum key.
int	size() Returns the number of items in the priority queue.

Method Detail

insert

Entry<K,V> insert(K key,
                  V value)
           throws InvalidKeyException

Inserts a key-value pair and return the entry created.

Throws:

InvalidKeyException

isEmpty

boolean isEmpty()

Returns whether the priority queue is empty.

min

Entry<K,V> min()
        throws EmptyPriorityQueueException

Returns but does not remove an entry with minimum key.

Throws:

EmptyPriorityQueueException

removeMin

Entry<K,V> removeMin()
              throws EmptyPriorityQueueException

Removes and returns an entry with minimum key.

Throws:

EmptyPriorityQueueException

size

int size()

Returns the number of items in the priority queue.