All Packages  Class Hierarchy  This Package  Previous  Next  Index

Interface DataStructures.PriorityQueue

public abstract interface PriorityQueue

deleteMin()

Remove the smallest item from the priority queue.

findMin()

Find the smallest item in the priority queue.

insert(Comparable)

Insert into the priority queue.

isEmpty()

Test if the priority queue is logically empty.

makeEmpty()

Make the priority queue logically empty.

 public abstract void insert(Supporting.Comparable x)

Insert into the priority queue. Duplicates are allowed.

Parameters:

x - the item to insert.

 public abstract Supporting.Comparable findMin() throws Exceptions.Underflow

Find the smallest item in the priority queue.

Returns:

the smallest item.

Throws: Underflow

if the priority queue is empty.

 public abstract Supporting.Comparable deleteMin() throws Exceptions.Underflow

Remove the smallest item from the priority queue.

Returns:

the smallest item.

Throws: Underflow

if the priority queue is empty.

 public abstract void makeEmpty()

Make the priority queue logically empty.

 public abstract boolean isEmpty()

Test if the priority queue is logically empty.

Returns:

true if empty, false otherwise.

All Packages  Class Hierarchy  This Package  Previous  Next  Index