// Implementation of vector-implemented List Class

#include <iostream>
#include "List.h"

using namespace std;

template <class listEltType> List<listEltType>::List()
{} // No constructor necessary. Vector starts empty

// Start from scratch
template <class listEltType> void List<listEltType>::init()
{theList.clear();}

template <class listEltType> 
		void List<listEltType>::insertAtHead(const listEltType &elt)
{listIterator it=theList.begin();
 theList.insert(it,elt);
 // easier: theList.insert(theList.begin(),elt);
}

template <class listEltType> 
		void List<listEltType>::insertInOrder(const listEltType &elt)
{listIterator it;
 for (it=theList.begin();it!=theList.end() && *it<elt;it++);
 theList.insert(it,elt);
}

template <class listEltType> void List<listEltType>::removeHead()
{theList.erase(theList.begin());
}

template <class listEltType> 
		void List<listEltType>::deleteInOrder(const listEltType &elt)
{listIterator it;
 for (it=theList.begin();*it!=elt;it++);//assumes it will be found...crash if not
 theList.erase(it);
}

template <class listEltType> 
		bool List<listEltType>::search(const listEltType &elt)
{listIterator it;
 for (it=theList.begin();it!=theList.end() && *it!=elt;it++);
 return(it!=theList.end());
}

template <class listEltType> 
		listEltType &List<listEltType>::retrieve(const int &key)
{// This function can be easily adapted to search in objects or structs for
 // a member that is an int
}

template <class listEltType> int List<listEltType>::countNodes()
{return(theList.size());}


template <class listEltType> 
		ostream &operator<<(ostream &out,List<listEltType> aList)
{for (List<listEltType>::listIterator it=aList.theList.begin();
						it!=aList.theList.end();it++)
	out << *it;
 return(out);
}

ostream &operator<<(ostream &out,List<int> aList)
{for (vector<int>::iterator it=aList.theList.begin();it!=aList.theList.end();it++)
	out << *it;
 return(out);
}

template class List<int>;