Problems linking template linked list class

[groovinbassplaya]

I'm writing a linked list class for my computer science class and everything works except I keep getting this error.
"Main.obj : error LNK2019: unresolved external symbol "class std::basic_ostream<char,struct std::char_traits<char> > & __cdecl operator<<(class std::basic_ostream<char,struct std::char_traits<char> > &,class LinkList<char> const &)" (??6@YAAAV?$basic_ostream@DU?$char_traits@D@std@@@std@@AAV01@ABV?$LinkList@D@@@Z) referenced in function _main
Main.obj : error LNK2019: unresolved external symbol "class std::basic_ostream<char,struct std::char_traits<char> > & __cdecl operator<<(class std::basic_ostream<char,struct std::char_traits<char> > &,class LinkList<int> const &)" (??6@YAAAV?$basic_ostream@DU?$char_traits@D@std@@@std@@AAV01@ABV?$LinkList@H@@@Z) referenced in function _main"

This is the class named "LinkList.h"

#include <ostream>
using namespace std;

template <typename T>
class LinkList
{ private:
  class Node
  {
   public:
    T info;
    Node *next;
  };
  typedef Node *nodePtr;
 
 public:
  	LinkList();			//constructor 
	LinkList(const LinkList<T> & orig);	//copy constructor
	~LinkList();		//destructor
	bool empty();		//determine if the LinkList is empty
	T Front();			// returns item at front of LinkList
	T Back();			// returns item at back of LinkList
	void Push_back(const T & item);
// add an item at the end of the LinkList
	void Push_front(const T & item);
//add item at the begining of LinkList
	void pop_back();	//remove the last item of the LinkList
	void pop_front();	//remove the first item of the LinkList
	void insert(T item);
						//insert the item in ascending order
	void erase(T item);
						//remove the item in the list
	bool Search(T item);
						//search a given item, if it can be found, 
						//return true, otherwise return false
	int Count();		//return the number of items in the list
	LinkList<T>& operator=(const LinkList<T> & orig);
								//overloaded assignment operator
	friend ostream& operator<<(ostream &out, const LinkList<T> & L);
								//overloaded output operator 

  private:
      nodePtr First;		//node pointer which points to the front(first node)
};  

template<typename T>
LinkList<T>::LinkList()
{
	First = 0;
}
template<typename T>
LinkList<T>::LinkList(const LinkList<T> &orig)
{
	if(orig.First != 0)
	{
		First->info = orig.First->info;
		nodePtr temp, cursor;
		cursor = orig.First->next;
		temp = new Node;
		temp = First->next;
		while(cursor != 0)
		{
			temp->info = cursor->info;
			cursor = cursor->next;
			temp->next = new node;
			temp = temp->next;
		}
	}
	else
		cerr << "List is empty!";
}
template <typename T>
LinkList<T>::~LinkList()
{
	nodePtr cursor = First;
	while(cursor !=0)
	{
		First = First->next;
		delete cursor;
		cursor = First;
	}
}
template <typename T>
bool LinkList<T>::empty()
{
	return (First == 0);
}
template <typename T>
T LinkList<T>::Front()
{
	if(!empty())
		return First->info;
	else
		cerr << "List is empty!";
}
template <typename T>
T LinkList<T>::Back()
{
	nodePtr cursor = First;
	if(empty())
		cerr << "List is empty!";
	while(cursor->next != 0)
		cursor = cursor->next;
	return cursor->info;
}
template <typename T>
void LinkList<T>::Push_back(const T &item)
{
	nodePtr cursor = First;
	while(cursor->next != 0)
		cursor = cursor->next;
	cursor->next = new Node;
	cursor = cursor->next;
	cursor->info = item;
}
template <typename T>
void LinkList<T>::Push_front(const T &item)
{
	nodePtr cursor = new Node;
	cursor->info = item;
	cursor->next = First;
	First = cursor;
}
template <typename T>
void LinkList<T>::pop_back()
{
	nodePtr cursor = First;
	nodePtr preCursor = First;
	while(cursor->next != 0)
	{
		preCursor = cursor;
		cursor = cursor->next;
	}
	delete cursor;
	preCursor->next = 0;
}
template <typename T>
void LinkList<T>::pop_front()
{
	nodePtr cursor = First;
	First = First->next;
	delete cursor;
}
template <typename T>
void LinkList<T>::insert(T item)
{
	nodePtr cursor = First;
	while(cursor->next != 0 && cursor != 0)
	{
		if(cursor->info <= item)
			cursor = cursor->next;
		else
		{
			cursor->next = new node;
			cursor = cursor->next;
			cursor->info = item;
		}
	}
}
template <typename T>
void LinkList<T>::erase(T item)
{
	nodePtr cursor = First;
	if(!empty())
	{
		while(cursor->info != item)
			cursor = cursor->next;
		delete cursor;
	}
	else
		cerr << "List is empty!";
}
template <typename T>
bool LinkList<T>::Search(T item)
{
	nodePtr cursor = First;
	while(cursor->info != item && cursor != 0)
		cursor = cursor->next;
	return (cursor->info == item);
}
template <typename T>
int LinkList<T>::Count()
{
	nodePtr cursor = First;
	int count;
	if(!empty())
	{
		for(count = 1; cursor != 0; count++)
			cursor = cursor->next;
	}
	else
		count = 0;
	return count;
}
template <typename T>
LinkList<T>& LinkList<T>::operator=(const LinkList<T> & orig)
{
	nodePtr cursor = First;
	if(!orig.empty())
	{
		while(cursor != 0)
		{
			delete cursor;
			cursor = cursor->next;
		}
		cursor = First;
		nodePtr cursor2 = orig.First;
		while(cursor2 != 0)
		{
			cursor = new node;
			cursor->info = cursor2->info;
			cursor->next = cursor2->next;
			cursor2 = cursor2->next;
			cursor = cursor->next;
		}
	}
	else
		cerr << "Empty list cannot be copied!";
	return (*this);
}
template <typename T>
ostream& operator<<(ostream &out, const LinkList<T> &L)
{
	nodePtr cursor = L.First;
	if(!L.empty())
	{
		while(cursor != 0)
		{
			out << cursor->info << "\t";
			cursor = cursor->next;
		}
		out << endl;
		return out;
	}
	else
		out << "List is empty" << endl;
};

The driver program is "Main.cpp"

#include <iostream>
#include "LinkList.h"
using namespace std;

int main()
{
	LinkList<int> intList;
	LinkList<char> charList;
	intList.Push_back(14);
	charList.Push_front('f');
	cout << intList;
	cout << charList;
        return 0;
} 

I've tried about everything to fix it. Any suggestions?

[naraku9333]

You need template <typename T> in before declaration of friend ostream

[groovinbassplaya]

I put that before the declaration and it stopped recognizing the class objects inside the function definition. I just moved the definition into the class without the template header and now it's working for some reason but thanks for the help anyways.

[naraku9333]

I put that before the declaration and it stopped recognizing the class objects inside the function definition

change nodePtr cursor = L.First; to LinkList<T>::nodePtr cursor = L.First;
I ran your code and got several errors I had to fix to get it working. I would add a Node ctor and a check in push_back to see if First is a used node.