/*
 *  This file contains the implementation of the methods for the
 *  templated SlowPQ class.
 */ 


// constructor
template <typename Element>
SlowPQ<Element>::SlowPQ() {

}


// number of items
template <typename Element>
int SlowPQ<Element>::size() const {
  return -1; // stub
}

// is the queue empty?
template <typename Element>
bool SlowPQ<Element>::isEmpty() const {
  return true; // stub
}


// insert into queue
template <typename Element>
void SlowPQ<Element>::insertItem(double k, const Element& e) {

}


// returns element with min key
template <typename Element>
Element& SlowPQ<Element>::minElement() throw(EmptyContainerException) {
  static Element junk;   // replace these lines as needed
  return junk;           // replace these lines as needed
}


// returns min key
template <typename Element>
double SlowPQ<Element>::minKey() const throw(EmptyContainerException) {
  return 0.0; // stub
}


// remove minimum
template <typename Element>
void SlowPQ<Element>::removeMin() throw(EmptyContainerException) {

}

// destructor
template <typename Element>
SlowPQ<Element>::~SlowPQ() {

}