我正在制作一个双向链表,我的错误与删除方法有关。我无法理解这个错误。有谁知道吗?
以下是错误的位置:
错误1 error C2027:使用未定义类型 'DoublyListNode' c:\users\conor\documents\college\c++\projects\repeat - doublylinkedlist\repeat - doublylinkedlist\doublylinkedlist.h 230 1 Repeat - DoublyLinkedList
如果需要更多的代码,请询问。我不想在Stack overflow用户中放置大量的代码。
以下是错误的位置:
错误1 error C2027:使用未定义类型 'DoublyListNode' c:\users\conor\documents\college\c++\projects\repeat - doublylinkedlist\repeat - doublylinkedlist\doublylinkedlist.h 230 1 Repeat - DoublyLinkedList
// -------------------------------------------------------------------------------------------------------
// Name: Remove
// Description: Removes the node that the iterator points to, moves iterator forward to the next node.
// Arguments: p_iterator: The iterator to remove
// isForward: Tells which direction the iterator was going through the list
// Return Value: None.
// -------------------------------------------------------------------------------------------------------
void Remove(DoublyListIterator<Datatype>& m_itr)
{
DoublyListNode<Datatype>* node = m_head;
// if the iteratordoesn’t belong to this list, do nothing.
if (m_itr.m_list != this)
return;
// if node is invalid, do nothing.
if (m_itr.m_node == 0)
return;
if (m_itr.m_node == m_head)
{
// move the iteratorforward and delete the head.
m_itr.Forth();
RemoveHead();
m_size--;
}
else
{
// scan forward through the list until you find
// the node prior to the node you want to remove
while (node->m_next != m_itr.m_node)
node = node->m_next;
// move the iterator forward.
m_itr.Forth();
// if the node you are deleting is the tail,
// update the tail node.
if (node->m_next == m_tail)
{
m_tail = node;
}
// delete the node.
delete node->m_next;
// re-link the list.
node->m_next = m_itr.m_node;
m_size--;
}
}
如果需要更多的代码,请询问。我不想在Stack overflow用户中放置大量的代码。
DoublyListNode
拼写稍有不同时,我遇到了这个问题。 - MartyE