c++实现链表2（摸板类实现）

c++实现链表；

文件说明： list.h     list.cpp     main.cpp

软件：CodeBlocks

应用：摸板类

出现问题：摸板类成员函数定义在list.cpp文件中。main.cpp包含#include "list.h"出现以下错误：

         F:\Program Files\c++test\list\main.cpp|7|undefined reference to `List<int>::List()'|；

         原因是软件编译链接没有包含list.cpp,所以在main.cpp中增加了#include"list.cpp"。问题解决。

         此错误应该是软件的问题。

 

#ifndef __LIST_H
#define __LIST_H
#include <iostream>
using namespace std;

//链表结点类
template<typename T>
class ChainNode
{
 public:
    ChainNode();
    ChainNode(T data);
    ChainNode *GetNext();
    void SetNext(ChainNode *next);
    T GetData();
private:
    T m_data;
    ChainNode *m_next;
};

//链表类
template<typename T>
class List
{
public:
    List();
    virtual ~List();

    List(const List &l); //拷贝构造函数
    List &operator=(const List &l); //拷贝赋值运算符

    bool Append(T data);   //往后追加
    bool Insert(int pos, T data); //插入链表，pos: 1..n, n小于链表结点数
    bool Delete(int pos);     //删除
    void Clear(); //清空链表

    bool Traverse(int (* visit)(T data)); //遍历链表
    ChainNode<T> *GetAddr(int pos);   //获取指向pos结点的指针
private:
    ChainNode<T> *m_head;
    ChainNode<T> *m_tail;
};
#endif // __LIST_H

 

#include "list.h"

template<typename T>
 ChainNode<T>::ChainNode()
 {
      m_data = 0;
      m_next = nullptr;
 }

 template<typename T>
 ChainNode<T>::ChainNode(T data)
 {
     m_data = data;
     m_next = nullptr;
 }

 template<typename T>
  void ChainNode<T>::SetNext(ChainNode *next)
  {
      m_next = next;
  }

 template<typename T>
 ChainNode<T> *ChainNode<T>::GetNext()
 {
    return m_next;
 }

 template<typename T>
 T ChainNode<T>::GetData()
 {
     return m_data;
 }


 template<typename T>
 List<T>::List()
 {
    m_head = new ChainNode<T>();
    m_tail = m_head;
 }

template<typename T>
 List<T>::~List()
 {
    delete m_head;
 }

 template<typename T>
 List<T>::List(const List &l)
 {
    m_head = new ChainNode<T>(*l.m_head);
 }

 template<typename T>
 List<T> &List<T>::operator=(const List &l)
 {
    ChainNode<T> *newp = new ChainNode<T>(*l.m_head);
    delete m_head;
    m_head = newp;
    return *this;
 }

 template<typename T>
  bool List<T>::Append(T data)
 {
    ChainNode<T> *newp = new ChainNode<T>(data);
    m_tail->SetNext(newp);
    m_tail = newp;
    return true;
 }

 template<typename T>
 bool List<T>::Delete(int pos)
 {
     ChainNode<T> *pre = GetAddr(pos - 1);

     if((pre != nullptr) && (pre->GetNext() != nullptr))
     {
         ChainNode<T> *p = pre->GetNext();
         pre->SetNext(p->GetNext());

         if(m_tail == p)
         {
            m_tail = pre;
         }
         delete p;
         return true;
     }else
     {
         return false;
     }


 }

  template<typename T>
  ChainNode<T> *List<T>::GetAddr(int pos)
  {
      int n = 0;
      ChainNode<T> *p = m_head;

      if(pos < 0)
      {
          return nullptr;
      }

      while((p != nullptr) && n < pos)
      {
            p = p->GetNext();
            n++;
      }

      return p;
  }

template<typename T>
   void List<T>::Clear()
   {
       while(Delete(1));
   }

 template<typename T>
 bool List<T>::Insert(int pos, T data)
 {
     ChainNode<T> *newp = new ChainNode<T>(data);
     ChainNode<T> *pre = GetAddr(pos - 1);

     if(pre == nullptr)
     {
         return false;
     }

     newp->SetNext(pre->GetNext());
     pre->SetNext(newp);

     if(newp->GetNext() == nullptr)
     {
            m_tail = newp;
     }

     return true;
 }

 template<typename T>
 bool List<T>::Traverse(int (* visit)(T data))
 {
     ChainNode<T> *p = m_head->GetNext();
     while(p != nullptr)
     {
         if(!visit(p->GetData()))
         {
             return false;
         }
         p = p->GetNext();
     }
     return true;
 }

 

#include "list.h"
#include "list.cpp"
int visit(int data);

int main()
{
    List<int> *lp = new List<int>();
    lp->Append(6);
    lp->Append(7);
    lp->Append(8);
    lp->Insert(4, 9);
    lp->Append(3);
    lp->Delete(5);
    lp->Append(2);
   // lp->Clear();
    lp->Traverse(visit);
    return 0;
}

int visit(int data)
{
    cout << data << endl;
    return 1;
}