#include "myList.h"

template<class Type>
void List<Type>::add(Type &newData)
{
	Node<Type> *newNode = new Node<Type>(&newData);

	if(head != 0)
	{
		newNode->next = head;
		head = newNode;
		noEntries++;
	}
	else
	{
		newNode->next = head;
		head = newNode;
		tail = newNode;
		noEntries++;
	}
}

template<class Type>
void List<Type>::push_back(Type &newData)
{
	Node<Type> *newNode = new Node<Type>(&newData);

		if(head != 0)
		{
			tail->next = newNode;
			tail = newNode;
			noEntries++;
		}
		else
		{
			tail = newNode;
			head = newNode;
			noEntries++;
		}
}

//start at the head of the list
//delete items as you move along
//stop when at the end i.e. when
//the next pointer value is 0
/*template<class Type>
List<Type>::~List()
{
	while(head!=0)
	{
		Node<Type> *temp = head;
		head = head->next;
		delete temp;	//delete what temp points at!
	}
}*/


template<class Type>
Type *List<Type>::at(int index)
{
	Node<Type> *temp = head;
	int i;
	for(i = 0; i < index; ++i)
	{
		temp = temp->next;
	}

	return temp->dataItem;
}

template<class Type>
int List<Type>::size()
{
	int i = 0;
	Node<Type> *temp = head;

	while(temp != tail)
	{
		++i;
	}
	return i;
}

template<class Type>
void List<Type>::erase(int index)
{
	Node<Type> *temp = at(index);
	delete temp;
	//Might actually need to use the destructor at this point in which case it would be
	//something like ~Node(temp); where that deletes all variables and references relating to temp
}