scranton.queue
Class PriorityQueueViaHeapArray

java.lang.Object
  scranton.tree.HeapViaArray
      scranton.queue.PriorityQueueViaHeapArray

All Implemented Interfaces:

Heap, PriorityQueue

public class PriorityQueueViaHeapArray

extends HeapViaArray

implements PriorityQueue

PriorityQueueViaHeap Class applies a heap to implement a priority queue. Requires a Comparator to manage the priority queue's order

Field Summary

Fields inherited from class scranton.tree.HeapViaArray

c, heap, heapSize

Constructor Summary

(package private)	PriorityQueueViaHeapArray(java.util.Comparator c) Construct a PriorityQueue with Comparator c, and initially of size, max.
(package private)	PriorityQueueViaHeapArray(java.util.Comparator c, int max) Construct a PriorityQueue with Comparator c, and initially of size max

Method Summary

java.lang.Object	frontOf() Method frontOf return front, a0.
boolean	isEmpty() Method isEmpty returns this==().

Methods inherited from class scranton.tree.HeapViaArray

close, insert, remove, size

Methods inherited from class java.lang.Object

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

Methods inherited from interface scranton.queue.PriorityQueue

insert, remove

Constructor Detail

PriorityQueueViaHeapArray

PriorityQueueViaHeapArray(java.util.Comparator c,
                          int max)

Construct a PriorityQueue with Comparator c, and initially of size max

Parameters:

c - Priority ordering

max - Initial size of the heap

PriorityQueueViaHeapArray

PriorityQueueViaHeapArray(java.util.Comparator c)

Construct a PriorityQueue with Comparator c, and initially of size, max.

Parameters:

c - Priority ordering

Method Detail

isEmpty

public boolean isEmpty()

Description copied from interface: PriorityQueue

Method isEmpty returns this==(). this'=this .

Specified by:

isEmpty in interface PriorityQueue

Returns:

this==()

See Also:

this'=this

frontOf

public java.lang.Object frontOf()

Description copied from interface: PriorityQueue

Method frontOf return front, a₀. pre: this /= () this'=this

Specified by:

frontOf in interface PriorityQueue

Returns:

front, a₀

See Also:

pre: this /= () this'=this