org.apache.avalon.cornerstone.blocks.scheduler
Class BinaryHeap

java.lang.Object
  org.apache.avalon.cornerstone.blocks.scheduler.BinaryHeap

All Implemented Interfaces:

PriorityQueue

public final class BinaryHeap
extends Object
implements PriorityQueue

BinaryHeap implementation of priority queue. The heap is either a minimum or maximum heap as determined by parameters passed to constructor.

Since:

4.0

Version:

CVS $Revision: 1.1 $ $Date: 2004/03/16 12:49:52 $

Author:

Avalon Development Team

Field Summary

static Comparator	MAX_COMPARATOR Comparator used to instantiate a max heap - assumes contents implement the Comparable interface.
static Comparator	MIN_COMPARATOR Comparator used to instantiate a min heap - assumes contents implement the Comparable interface.

Constructor Summary

BinaryHeap()
Instantiates a new min binary heap with the default initial capacity.

BinaryHeap(boolean isMinHeap)
Create a binary heap of Comparables.

BinaryHeap(Comparator comparator)
Instantiates a new binary heap with the default initial capacity and ordered using the given Comparator.

BinaryHeap(int capacity)
Instantiates a new min binary heap with the given initial capacity.

BinaryHeap(int capacity, boolean isMinHeap)
Create a binary heap of Comparables.

BinaryHeap(int capacity, Comparator comparator)
Instantiates a new binary heap with the given initial capacity and ordered using the given Comparator.

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.
boolean	isFull() Test if queue is full.
Object	peek() Return element on top of heap but don't remove it.
Object	pop() Return element on top of heap and remove it.
int	size() Returns the number of elements currently on the heap.
String	toString() Create a string representing heap and all elements in heap.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

MIN_COMPARATOR

public static final Comparator MIN_COMPARATOR

Comparator used to instantiate a min heap - assumes contents implement the Comparable interface.

MAX_COMPARATOR

public static final Comparator MAX_COMPARATOR

Comparator used to instantiate a max heap - assumes contents implement the Comparable interface.

Constructor Detail

BinaryHeap

public BinaryHeap()

Instantiates a new min binary heap with the default initial capacity.

BinaryHeap

public BinaryHeap(int capacity)

Instantiates a new min binary heap with the given initial capacity.

Parameters:

capacity - the size of the heap

BinaryHeap

public BinaryHeap(Comparator comparator)

Instantiates a new binary heap with the default initial capacity and ordered using the given Comparator.

Parameters:

comparator - to order the contents of the heap

BinaryHeap

public BinaryHeap(int capacity,
                  Comparator comparator)

Instantiates a new binary heap with the given initial capacity and ordered using the given Comparator.

Parameters:

capacity - the size of the heap

comparator - to order the contents of the heap

BinaryHeap

public BinaryHeap(boolean isMinHeap)

Create a binary heap of Comparables. Takes a parameter to specify whether it is a minimum or maximum heap.

Parameters:

isMinHeap - true to make it a minimum heap, false to make it a max heap

BinaryHeap

public BinaryHeap(int capacity,
                  boolean isMinHeap)

Create a binary heap of Comparables. Takes a parameter to specify whether it is a minimum or maximum heap and another parameter to specify the size of the heap.

Parameters:

capacity - the size of the heap

isMinHeap - true to make it a minimum heap, false to make it a max heap

Method Detail

clear

public void clear()

Clear all elements from queue.

Specified by:

clear in interface PriorityQueue

isEmpty

public boolean isEmpty()

Test if queue is empty.

Specified by:

isEmpty in interface PriorityQueue

Returns:

true if queue is empty else false.

isFull

public boolean isFull()

Test if queue is full.

Returns:

true if queue is full else false.

size

public int size()

Returns the number of elements currently on the heap.

Returns:

the size of the heap.

insert

public void insert(Object element)

Insert an element into queue.

Specified by:

insert in interface PriorityQueue

Parameters:

element - the element to be inserted

peek

public Object peek()
            throws NoSuchElementException

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

Specified by:

peek in interface PriorityQueue

Returns:

the element at top of heap

Throws:

NoSuchElementException - if isEmpty() == true

pop

public Object pop()
           throws NoSuchElementException

Return element on top of heap and remove it.

Specified by:

pop in interface PriorityQueue

Returns:

the element at top of heap

Throws:

NoSuchElementException - if isEmpty() == true

toString

public String toString()

Create a string representing heap and all elements in heap.

Overrides:

toString in class Object

Returns:

the string representing heap