/*****************************************
 * Instructions
 *  - Replace 'uwuserid' with your uWaterloo User ID
 *  - Select the current calendar term and enter the year
 *  - List students with whom you had discussions and who helped you
 *
 * uWaterloo User ID:  uwuserid @uwaterloo.ca
 * Submitted for ECE 250
 * Department of Electrical and Computer Engineering
 * University of Waterloo
 * Calender Term of Submission:  (Winter|Spring|Fall) 201N
 *
 * By submitting this file, I affirm that
 * I am the author of all modifications to
 * the provided code.
 *
 * The following is a list of uWaterloo User IDs of those students
 * I had discussions with in preparing this project:
 *    -
 *
 * The following is a list of uWaterloo User IDs of those students
 * who helped me with this project (describe their help; e.g., debugging):
 *    -
 *****************************************/

#ifndef SINGLE_LIST_H
#define SINGLE_LIST_H

#ifndef nullptr
#define nullptr 0
#endif

#include "ece250.h"
#include "SingleNode.h"
#include "Exception.h"

template <typename Type>
class SingleList {
	private:
		SingleNode<Type> *list_head;
		SingleNode<Type> *list_tail;
		int count;

	public:
		SingleList();
		SingleList( SingleList const & );
		~SingleList();

		SingleList &operator=( SingleList const & );

		// Accessors

		int size() const;
		bool empty() const;

		Type front() const;
		Type back() const;

		SingleNode<Type> *head() const;
		SingleNode<Type> *tail() const;

		bool member( Type const &obj ) const;

		// Mutators

		void push_front( Type const &obj );
		void push_back( Type const &obj );

		Type pop_front();

		bool remove( Type const &obj );
};

template <typename Type>
SingleList<Type>::SingleList():
list_head( 0 ),
list_tail( 0 ),
count( 0 ) {
	// empty constructor
}

template <typename Type>
SingleList<Type>::SingleList( SingleList<Type> const &list ):
list_head( 0 ),
list_tail( 0 ),
count( 0 ) {
	*this = list;
}

template <typename Type>
SingleList<Type>::~SingleList() {
	// enter your implementation here
}

template <typename Type>
SingleList<Type> &SingleList<Type>::operator=( SingleList<Type> const &rhs ) {
	// empty the current object
	// make a copy of the list rhs
	return *this;
}

template <typename Type>
int SingleList<Type>::size() const {
	// enter your implementation here
	return 0;
}

template <typename Type>
bool SingleList<Type>::empty() const {
	// enter your implementation here
	return true;
}

template <typename Type>
Type SingleList<Type>::front() const {
	// enter your implementation here
	return Type();
}

template <typename Type>
Type SingleList<Type>::back() const {
	// enter your implementation here
	return Type();
}

template <typename Type>
SingleNode<Type> *SingleList<Type>::head() const {
	// enter your implementation here
	return 0;
}

template <typename Type>
SingleNode<Type> *SingleList<Type>::tail() const {
	// enter your implementation here
	return 0;
}

template <typename Type>
bool SingleList<Type>::member( Type const &obj ) const {
	// enter your implementation here
	return false;
}

template <typename Type>
void SingleList<Type>::push_front( Type const &obj ) {
	// enter your implementation here
}

template <typename Type>
void SingleList<Type>::push_back( Type const &obj ) {
	// enter your implementation here
}

template <typename Type>
Type SingleList<Type>::pop_front() {
	// enter your implementation here
	return Type();
}

template <typename Type>
bool SingleList<Type>::remove( Type const &obj ) {
	// enter your implementation here
	return false;
}

#endif