линковка шаблона

#ifndef intrusive_list__HHHH
#define intrusive_list__HHHH
struct link_err {
	string s;
	link_err(const char* pc):s(pc){}
};
struct slink { //base class for intrusive single linked list
	slink* next;
	slink(slink* p=0):next(p) {}
};
template<class T> class intrusive_list {
	T *head;
	T *last;
	unsigned int s;
//	size_t s;
	public:
	class iterator {
		T* p;
		public:
		iterator(T* pp):p(pp) {}
		iterator& operator++(int ) { p=static_cast<T*>(p->next); return *this; }
		T& operator*() { return *p; }
		bool operator==(const iterator& i) { return p==i.p; }
		bool operator!=(const iterator& i) { return p!=i.p; }
	};
	intrusive_list():head(0),last(0),s(0) {}
	iterator begin() { return iterator(head); }
	iterator end() { return iterator(0); }
	void push_front(T& t) ; 
	void push_back(T& t) ; 
	iterator& erase(iterator& i) {
		if (!s) throw link_err("empty error");
		s--;
		if (!s)  { 
			head=last=0;
			return 0;
		}
		if ( head == i.p ) {
			head=i.p->next;
			i.p->next=0;
			i++;
			return i;
		}
	}
};


template<class T> void intrusive_list<T>::push_front(T& t) { 
	s++;
	t.next=head;
	if(! last) last=&t;
	head=&t;
	return;
}
template<class T> void intrusive_list<T>::push_back(T& t) { 
	s++;
	if(! last)  head=last=&t;
	else {
		last->next=&t;
		last=&t;
	}
	return;
}
#endif