#ifndef FASTPQ
#define FASTPQ

#include "PriorityQueue.h"

/*
 *  An explicit implementation of the PriorityQueue class based upon
 *  using a vector-based representation of a heap.
 */
template <typename Element>
class FastPQ : public PriorityQueue<Element> { 
public:

  // constructor
  FastPQ();

  // number of items
  int size() const;  

  // is the queue empty?
  bool isEmpty() const;  

  // insert into queue
  void insertItem(double k, const Element& e);   

  // returns element with min key
  Element& minElement() throw(EmptyContainerException);

  // returns minimum key
  double minKey() const throw(EmptyContainerException);

  // remove minimum
  void removeMin() throw(EmptyContainerException);

  // destructor
  virtual ~FastPQ();
};

#include "FastPQ.tcc"

#endif