// FILE: Queuets.cpp
// FILES NEEDED: Queuet.h

//***  Queue of NodeType implemented as linked list

#ifndef Queue_CPP
#define Queue_CPP

#include "Queuet.h"
#include <stdlib.h>

template<class T>
Queue<T>::Queue(void) {
 
} //*** default constructor


template<class T>
Queue<T>::Queue(const Queue &q) {

} //*** copy constructor


/*-------------------------------
// Attempt to use enqueue fails!!
//-------------------------------
template<class T>
Queue<T>::Queue(const Queue &q) {
  if ( q.myFront == NULL ) {
    myFront = myRear = NULL; 
    return;
  }
  NodeType *source(q.myFront);
  do {
    enqueue(source->info);
    source = source->next;
  } while ( source != NULL);
} // *** copy constructor
------------------------------*/


template<class T>
Queue<T>::~Queue(void) {
  
}


template<class T>
void Queue<T>::enqueue(const T &item) {

} //*** enqueue


template<class T>
void Queue<T>::dequeue(T &item) {

} //*** dequeue


template<class T>
Queue<T> &Queue<T>::operator=(Queue &rhs) {


}


template<class T>
void Queue<T>::dequeue(void) {


} //*** dequeue


template<class T>
bool Queue<T>::isEmpty(void) const {
 
 
} //*** isEmpty


template<class T>
const T &Queue<T>::front(void) const {
 
 
}


template<class T>
int Queue<T>::length(void) const {


} //*** length


template<class T>
void Queue<T>::makeEmpty(void) {


}//**** makeEmpty


template<class T>
void Queue<T>::print(void) const {
  if ( isEmpty() )
    cout << "Queue is empty\n";
  else {
    int count(0);
    for ( NodeType *p = myFront; p != NULL; p = p->next) {
      count++;
      cout << setw(4) << count << ".  " << p->info;
    }
    cout << endl;
  }
}

#endif //Queue_CPP