// FILE: Queuet.h
// ----------------------------------------------------------
// Definition of templated (or container) Queue class
// Queue of class T implemented as linked list
// ----------------------------------------------------------


#ifndef QueueT_H
#define QueueT_H

template<class T>
class Queue {
 public:
  Queue(void);
  Queue(const Queue &s);
  ~Queue(void);
  void enqueue(const T &item);
  void dequeue(T &item);
  void dequeue(void);
  Queue &operator=(Queue &rhs);
  const T &front(void) const;
  bool isEmpty(void) const;
  int length(void) const;
  void print(void) const;
  void makeEmpty(void);
 private:
  struct NodeType {
    T info;
    NodeType *next;
  };
  NodeType *myFront, *myRear;
};

#endif // QueueT_H