// ------------------------------------------------------------------------
// Priority queues: derived from  Container-<--Linear-<--PQueue
// A. Fischer   June 9, 2001	                           file: pqueue.hpp
// ------------------------------------------------------------------------
#pragma once

#include "ordered.hpp"
#include "linear.hpp"

template <class T>
class PQueue : public Linear<T> {
  public:          // -----------------------------------------------------
	PQueue(){}
	virtual ~PQueue(){ cout << "PQueue destructor called"; }
		// keyword "virtual" not needed here but doesn't hurt since
		// class already has (inherited) virtual methods
	void focus(){ Linear<T>::reset(); }	// Priority queue deletion is at the head.

  protected:
	// ------------------------ Insert new Cell in ascending sorted order.
	void insert( Cell<T>* cp ) {
		for (Linear<T>::reset(); !Linear<T>::end(); ++*this) {	// locate insertion spot.
			if ( !(*this < cp) )break;
		}
		Linear<T>::insert( cp ); 				// do the insertion.
	}
};