我正在尝试将链表(/ stack / queue)临时化,以接受int和double。但到目前为止,我无法让我的代码工作。 (我取出了列表/队列成员函数,只是尝试让它工作/在构建时不会出错。所以它主要只是堆栈的东西。)没有“模板东西”代码工作正常。如果我错过任何东西或需要添加任何LMK!
我得到的错误:
1> LinkedList_Stack.obj:错误LNK2019:函数_main
1> LinkedList_Stack.obj:错误LNK2019:函数_main中引用的未解析的外部符号“public:void __thiscall NumberList :: pop(int&)”(?pop @?$ NumberList @ H @@ QAEXAAH @ Z) / p>
1> LinkedList_Stack.obj:错误LNK2019:未解析的外部符号“public:void __thiscall NumberList :: push(int)”(?push @?$ NumberList @ H @@ QAEXH @ Z)在函数_main
1> F:\ Documents and Settings \ Riotson \ Desktop \ LinkList \ LinkedList_Stack_Queue_BNS11 \ Debug \ LinkedList_Stack_Queue_BNS11.exe:致命错误LNK1120:3个未解析的外部
我在这个网站上阅读了3个不同的帖子,并试图模仿它的临时性(在哪里放置的和什么不是)但是无法让它工作=。请帮助!!!
List.h:
#ifndef LIST_H
#define LIST_H
template<class T>
struct ListNode
{
T value; // Value in this node
struct ListNode<T> *next; // Pointer to the next node
};
// Class of LinkedList/Stack/Queue
template<class T>
class NumberList
{
private:
ListNode<T> *head, *rear; // List head pointer
public:
//Constructor
NumberList()
{ head = NULL; rear = NULL; }
//Destructor
~NumberList();
// Linked List Operations
void displayList() const;
//Stack operations
void push(T);
void pop(T &);
bool isEmpty();
};
template<class T>
void NumberList<T>::displayList() const
{
ListNode *nodePtr;
nodePtr = head;
while(nodePtr)
{
cout << nodePtr->value << endl;
nodePtr = nodePtr->next;
}
}
template<class T>
NumberList<T>::~NumberList()
{
ListNode<T> *nodePtr;
ListNode<T> *nextNode;
// Position nodePtr at the head of the list
nodePtr = head;
// While nodePtr is not at the end of the list....
while(nodePtr != NULL)
{
// Save a pointer to the next node.
nextNode = nodePtr->next;
// Delete the current node.
delete nodePtr;
// Position nodePtr at the next node.
nodePtr = nextNode;
}
}
template<class T>
void NumberList<T>::push(T num)
{
ListNode<T> *newNode; // Point to a new node
// Allocate a new node and store num there.
newNode = new ListNode;
newNode->value = num;
//If there are no nodes in the list
// make newNode the first node.
if(isEmpty())
{
head = newNode;
newNode->next = NULL;
}
else
{
newNode->next = head;
head = newNode;
}
}
template<class T>
void NumberList<T>::pop(T &num)
{
ListNode<T> *temp; // Temporary pointer
// First make sure stack isn't empty.
if(isEmpty())//Create a DynIntQueue object.
{
cout << "The stack is empty.\n";
}
else // pop value off the top of stack
{
num = head->value;
temp = head->next;
delete head;
head = temp;
}
}
// Member function isEmpty returns true if the stack/Queue
//is empty, or false otherwise.
template<class T>
bool NumberList<T>::isEmpty()
{
bool status;
if(!head)
status = true;
else
status = false;
return status;
}
#endif
主要
#include "List.h"
int main()
{ int catchVar; // To hold value popped off the stack
// Create a Dynamic IntStack object.
NumberList<int> stack;
// Push values onto stack
cout << "Pushing 1, 2, 3\n";
stack.push(1);
stack.push(2);
stack.push(3);
cout << endl;
// Pop the values off the stack
cout << "Popping...\n";
stack.pop(catchVar);
cout << catchVar << endl;
stack.pop(catchVar);
cout << catchVar << endl;
stack.pop(catchVar);
cout << catchVar << endl;
// Try to pop another value off the stack.
cout << "\nAttempting to pop again... " <<endl;
stack.pop(catchVar);
cout << endl;
// Templitization of a Double
cout << "Pushing a double of 1.5\n";
stack.push(1.5);
cout << endl;
cout << "Popping double 1.5...\n";
stack.pop(catchVar);
cout << catchVar << endl;
cout << "Templitization Succesful\n" << endl;
cout << endl;
return 0;
}
答案 0 :(得分:1)
不要将模板函数放在.cpp中。将它们放入头文件中。