我的DLL插入功能有问题。它没有问题附加到列表上,但当我有一个5个对象的列表,我想在节点之间插入它什么都不做。我一直在寻找几个小时来解决这个问题,但没有任何改变。
这是我的代码: 在main.cpp中实施
cout << "\n---------------------------Insert---------------------------\n";
//Ask the user what position they want to enter the player in.
cout << "Enter the position you want to enter the player: ";
int insertChoice = validators.getNum();
//Move the iterator back to the start.
itr.Start();
//If the position is NOT equal to zero, Continue.
if (insertChoice != 0)
{
//Loop until the position entered is reached.
for (int i = 0; i < insertChoice; i++)
{
//Move the iterator forware to this position.
itr.Forth();
}
//Insert the Player to the position entered by the user.
//list.Insert(itr,stats.input());
}
//If the position entered is equal to zero, Continue.
else
{
//Append onto the list.(Add it onto the start).
list.Append(stats.input());
}
在头文件中插入函数。
// ----------------------------------------------------------------------------------------------------------------
// Name: Insert
// Description: Inserts data before the iterator, this works whether the iterator is backwards of forwards
// through the list.Inserts at the end of the list if iterator is invalid.
// Arguments: p_iterator: The iterator to insert before
// p_data: the data to insert
// Return Value: None.
// ----------------------------------------------------------------------------------------------------------------
void Insert(DoublyLinkedListIterator<Datatype>& p_itr, Datatype p_data)
{
if(p_itr.m_node != 0)
{
// insert the data before the iterator
p_itr.m_node->InsertBefore(p_data);
//if the iterator was at the head of the list,
//reset the head pointer
if(p_itr.m_node == m_head)
{
m_head = m_head->m_prev;
}
// increment the count
m_count++;
}
else
{
Append(p_data);
}
}
的追加 的
void Append(Datatype p_data)
{
if(m_head == 0)
{
// create a new head node.
m_head= m_tail= new DoublyListNode<Datatype>;
m_head->m_data= p_data;
m_head->m_next= 0;
m_head->m_prev= 0;
}
else
{
// insert a new node after the tail and reset the tail.
m_tail->InsertAfter(p_data);
m_tail= m_tail->m_next;
}
m_count++;
}
的的insertBefore 的
// ----------------------------------------------------------------
// Name: InsertBefore
// Description: This adds a node before the current node.
// Arguments: p_data - The data to store in the new node.
// Return Value: None.
// ----------------------------------------------------------------
void InsertBefore(Datatype p_data)
{
//Create new Node
DoublyLinkedListNode<Datatype>* newNode = new DoublyLinkedListNode<Datatype>;
newNode->m_data = p_data;
//Set up new Node Pointers
newNode->m_next = this;
newNode->m_prev = m_prev;
//if theres a node before it, make it point to new node
if(m_prev != 0)
m_prev = newNode;
}
我不认为问题在于main中的实现,而是实际的insert函数。先谢谢,Becca。
答案 0 :(得分:2)
的的insertBefore 强> 的
newNode->m_next = this;
newNode->m_prev = this->m_prev;
你需要告诉this
指向新节点(如前所述)。
newNode->m_next = this;
newNode->m_prev = this->m_prev;
this->m_prev->m_next = newNode;
this->m_prev = newNode;
这也应该是
在头文件中插入函数。
if(p_itr.m_node == m_head)
{
m_head = p_itr->m_prev;
^^^^^^
}