结构体的定义如下:
typedef struct dataRecord {
//will complie the struct according to the FLAG
int iUnitFlag;
char cData[MAX_CDATA];
}DataRecord,* PDataRecord;链表中的结构定义如下:
struct Node //ｽﾚｵｹ
{
struct Node *last; ｰﾒｻｸ
char *element;
struct Node *next; ﾖｸﾏｻｸﾚｵ
};
struct Node *m_head;
我已经把typedef struct dataRecord 中的数据插入到struct Node中的element中,现在我需要从struct Node的element取出,复制到typedef struct dataRecord 中,如何
操作,我的处理如下:bool CLinkList::Search(const char *element, int &position, DataRecord * dataRecord)
{
DataRecord *dataRecordTemp;
dataRecordTemp = dataRecord;
memcpy(dataRecordTemp,temp->element,sizeof(element));
...............}
为何会出现数据丢失呢?????
ﾄｸ
typedef struct dataRecord {
//will complie the struct according to the FLAG
int iUnitFlag;
char cData[MAX_CDATA];
}DataRecord,* PDataRecord;链表中的结构定义如下:
struct Node //ｽﾚｵｹ
{
struct Node *last; ｰﾒｻｸ
char *element;
struct Node *next; ﾖｸﾏｻｸﾚｵ
};
struct Node *m_head;
我已经把typedef struct dataRecord 中的数据插入到struct Node中的element中,现在我需要从struct Node的element取出,复制到typedef struct dataRecord 中,如何
操作,我的处理如下:bool CLinkList::Search(const char *element, int &position, DataRecord * dataRecord)
{
DataRecord *dataRecordTemp;
dataRecordTemp = dataRecord;
memcpy(dataRecordTemp,temp->element,sizeof(element));
...............}
为何会出现数据丢失呢?????
ﾄｸ
void CFlowChartApp::InsertDataToLinkNode(DataRecord * PDataRecordTemp)
{
if (PDataRecordTemp == NULL)
return;
DataRecord * PDataRecord = PDataRecordTemp;
//m_CobArray.SetAt(0, *PDataRecordTemp);
m_CobTable.Count(iInsertNum);
if (iInsertNum < 0)
return;
if (m_CobTable.Insert(++iInsertNum, (char *)PDataRecord) == true)
{
//AfxMessageBox("Insert Succeed !");
}
else
{
AfxMessageBox("Insert Failed!");
return ;
}
}//ﾔﾚﾖｸｶｨﾎｻﾖﾃﾉﾏﾌ晴ﾓｽﾚｵ・
bool CLinkList::Insert(int position, const char *element)
{
int index = 0;
int len = 0;
//ﾁﾙﾊｱｵﾄｽﾚｵ聊ｸﾕ・
struct Node *temp = NULL;
struct Node *back = NULL;
struct Node *newNode = NULL; if ((position < 1) || (position > (m_count+1))) //ﾖｸｶｨｵﾄﾎｻﾖﾃｲｻﾕﾈｷ
{
return false;
}
if (m_head != NULL) //ｱ楨ｷﾖｸﾕ・ｻﾎｪｿﾕ
{
//temp = m_head->next; //ﾖｸﾏﾚﾒｻｸﾚｵ・ //by echo
temp = m_head; //the head point //ﾁｴｱ﨔ｪｿﾕ｣ｬﾃｻﾓﾐﾈﾎｺﾎｽﾚｵ飜ｱ
if (NULL != temp && m_count == 0)
{
newNode = new Node; //ﾎｪｵﾚﾒｻｸﾚｵ翹・・ﾚｴ豼ﾕｼ・
if (newNode != NULL) //ﾄﾚｴ賈・・ﾉｹｦ
{
//m_head->next = newNode; //ｱ楨ｷﾖｸﾕ・ｸﾏﾚﾒｻｸﾚｵ・ //by echo
m_head = newNode; //the head point
newNode->last = m_head; //ｵﾚﾒｻｸﾚｵ聊ｸﾏ楨ｷﾖｸﾕ・
//ｿｽｱｴｽﾚｵ耿ｪﾋﾘﾖｵ
len = strlen(element);
newNode->element = new char[len+1];
strcpy(newNode->element, element);
newNode->next = NULL; //ﾃｻﾓﾐｺﾌｽﾚｵ・
++m_count; //ｽﾚｵ羣ｼﾓ1
return true;
}
else //ﾄﾚｴ賈・・ｧｰﾜ
{
return false;
}
} //end of if //ﾔﾚ 1｡｢1ﾓ・_countﾖｮｼ茖｢m_count ﾎｻﾖﾃﾉﾏｲ衒・ﾚｵ飜ｱ
while (temp != NULL) //the head point is existing
{
++index;
if (position == index) //ﾕﾒｵｽﾆ･ﾅ莊ﾄﾎｻﾖﾃ
{
newNode = new Node; //ﾎｪｲ衒・ﾄｽﾚｵ翹・・ﾚｴ豼ﾕｼ・
if (newNode != NULL) //ﾄﾚｴ賈・・ﾉｹｦ
{
//temp->last->next = newNode; //ﾊｹﾇｰﾒｻｸﾚｵ聊ｸﾏﾂｴｴｽｨｵﾄｽﾚｵ・
temp = newNode; //let the pri point the new point
newNode->last = temp->last; //ﾊｹﾐﾂｴｴｽｨｵﾄｽﾚｵ聊ｸﾏｰﾒｻｸﾚｵ・
//ｿｽｱｴｽﾚｵ耿ｪﾋﾘﾖｵ
len = strlen(element);
newNode->element = new char[len+1];
strcpy(newNode->element, element);
newNode->next = temp; //ﾊｹﾐﾂｴｴｽｨｵﾄｽﾚｵ聊ｸﾏﾃﾎｻﾖﾃﾉﾏﾔｭﾀｴｵﾄｽﾚｵ罐ｬｼｴﾏﾖﾔﾚｵﾄﾏﾂﾒｻｸﾚｵ罍｣
temp->last = newNode; //ｸﾃﾎｻﾖﾃﾉﾏﾔｭﾀｴｵﾄｽﾚｵ・ｼｴﾏﾖﾔﾚｵﾄﾏﾂﾒｻｸﾚｵ・ﾖｸﾏﾂｴｴｽｨｵﾄｽﾚｵ・
++m_count; //ｽﾚｵ羣ｼﾓ1
return true;
}
else //ﾄﾚｴ賈・・ｧｰﾜ
{
return false;
}
} //end of if
back = temp; //ｱ｣ｴ貮ｰﾒｻｸﾚｵ羞ﾄﾖｸﾕ・
temp = temp->next; //ﾖｸﾏﾂﾒｻｸﾚｵ・
} //end of while
//ﾔﾚﾎｻﾖﾃ m_count+1 ﾉﾏｲ衒・ﾚｵ飜ｱ
newNode = new Node; //ﾎｪｲ衒・ﾄｽﾚｵ翹・・ﾚｴ豼ﾕｼ・
if (newNode != NULL) //ﾄﾚｴ賈・・ﾉｹｦ
{
back->next = newNode; //ﾊｹﾇｰﾒｻｸﾚｵ聊ｸﾏﾂｴｴｽｨｵﾄｽﾚｵ・
newNode->last = back; //ﾊｹﾐﾂｴｴｽｨｵﾄｽﾚｵ聊ｸﾏｰﾒｻｸﾚｵ・
//ｿｽｱｴｽﾚｵ耿ｪﾋﾘﾖｵ
len = strlen(element);
newNode->element = new char[len+1];
strcpy(newNode->element, element);
newNode->next = NULL; //ﾃｻﾓﾐｺﾌｽﾚｵ・
++m_count; //ｽﾚｵ羣ｼﾓ1
return true;
}
else //ﾄﾚｴ賈・・ｧｰﾜ
{
return false;
}
}
else //ｱ楨ｷﾖｸﾕ・ｪｿﾕ
{
return false;
}
}
插入的代码如上,请看看对吗?
bool CLinkList::Insert(int position, const char *element)
{
int index = 0;
int len = 0; struct Node *temp = NULL;
struct Node *back = NULL;
struct Node *newNode = NULL; if ((position < 1) || (position > (m_count+1)))
{
return false;
}
if (m_head != NULL)
{
//temp = m_head->next; //by echo
temp = m_head; //the head point
if (NULL != temp && m_count == 0)
{
newNode = new Node;
if (newNode != NULL)
{
//m_head->next = newNode;
m_head = newNode;
newNode->last = m_head;
len = strlen(element);
newNode->element = new char[len+1];
strcpy(newNode->element, element);
newNode->next = NULL;
++m_count;
return true;
}
else
{
return false;
}
} //end of if
while (temp != NULL) //the head point is existing
{
++index;
if (position == index)
{
newNode = new Node;
if (newNode != NULL)
{
//temp->last->next = newNode;
temp = newNode; //let the pri point the new point
newNode->last = temp->last;
len = strlen(element);
newNode->element = new char[len+1];
strcpy(newNode->element, element);
newNode->next = temp;
temp->last = newNode;
return true;
}
else /
{
return false;
}
} //end of if
back = temp;
temp = temp->next;
} //end of while
newNode = new Node;
if (newNode != NULL)
{
back->next = newNode;
newNode->last = back;
len = strlen(element);
newNode->element = new char[len+1];
strcpy(newNode->element, element);
newNode->next = NULL;
++m_count;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
}
//insert the record to LinkNode
void CFlowChartApp::InsertDataToLinkNode(DataRecord * PDataRecordTemp)
{
if (PDataRecordTemp == NULL)
return;
DataRecord * PDataRecord = PDataRecordTemp;
//m_CobArray.SetAt(0, *PDataRecordTemp);
m_CobTable.Count(iInsertNum);
if (iInsertNum < 0)
return;
if (m_CobTable.Insert(++iInsertNum, (char *)PDataRecord) == true)
{
//AfxMessageBox("Insert Succeed !");
}
else
{
AfxMessageBox("Insert Failed!");
return ;
}
}其中DataRecord * PDataRecord = PDataRecordTemp;在指针PDataRecord中的数据都有,但执行if (m_CobTable.Insert(++iInsertNum, (char *)PDataRecord) == true)进行了类型转换,需要调用
bool CLinkList::Insert(int position, const char *element)这个函数,因为其第二个参数为const char *element,但这应该不会丢失数据啊.
请帮我看看插入的此函数Insert()是否有错.
我取数据的时候进行了转换,
int index = 0;
struct Node *temp = NULL;
position = 0;
if (m_head != NULL)
{
temp = m_head;
if (temp != NULL)
{
while (temp != NULL)
{
++index;
DataRecord * dataRecordTemp;
dataRecordTemp = dataRecord;
dataRecordTemp = (DataRecord *)temp->element;
//但这里dataRecordTemp 数据就乱掉了????
................................
}
bool CLinkList::Search(const char *element, int &position, DataRecord * dataRecord)
{
int index = 0;
struct Node *temp = NULL;
position = 0;
if (m_head != NULL)
{
temp = m_head;
if (temp != NULL)
{
while (temp != NULL)
{
++index;
DataRecord * dataRecordTemp;
dataRecordTemp = dataRecord;
dataRecordTemp = (DataRecord *)temp->element;
//但这里dataRecordTemp 数据就乱掉了????
................................
}
//added by handwolf 2004-12-1 (begin)
//把前面的指针和刚插入的衔接起来，下面前面指向刚插入的～
if(back != NULL)
back->next = newNode;
else
m_head = newNode;
//added by handwolf 2004-12-1 (end) bool CLinkList::Insert(int position, const char *element)
{
int index = 0;
int len = 0; struct Node *temp = NULL;
struct Node *back = NULL;
struct Node *newNode = NULL; if ((position < 1) || (position > (m_count+1)))
{
return false;
}
if (m_head != NULL)
{
//temp = m_head->next; //by echo
temp = m_head; //the head point
if (NULL != temp && m_count == 0)
{
newNode = new Node;
if (newNode != NULL)
{
//m_head->next = newNode;
m_head = newNode;
newNode->last = m_head;
len = strlen(element);
newNode->element = new char[len+1];
strcpy(newNode->element, element);
newNode->next = NULL;
++m_count;
return true;
}
else
{
return false;
}
} //end of if
while (temp != NULL) //the head point is existing
{
++index;
if (position == index)
{
newNode = new Node;
if (newNode != NULL)
{
//temp->last->next = newNode;
temp = newNode; //let the pri point the new point
newNode->last = temp->last;
len = strlen(element);
newNode->element = new char[len+1];
strcpy(newNode->element, element);
newNode->next = temp;
temp->last = newNode; //added by handwolf 2004-12-1 (begin)
//把前面的指针和刚插入的衔接起来，下面前面指向刚插入的～
if(back != NULL)
back->next = newNode;
else
m_head = newNode;
//added by handwolf 2004-12-1 (end) return true;
}
else /
{
return false;
}
} //end of if
back = temp;
temp = temp->next;
} //end of while
newNode = new Node;
if (newNode != NULL)
{
back->next = newNode;
newNode->last = back;
len = strlen(element);
newNode->element = new char[len+1];
strcpy(newNode->element, element);
newNode->next = NULL;
++m_count;
return true;
}
else
{
return false;
}
}
else
{
return false;
}
}
还有，最好你可以自己调试一下，看看里面的内容！
bool CLinkList::Search(int &position, DataRecord * dataRecord)
{
DataRecord *dataRecordTemp;
dataRecordTemp = dataRecord;
int index = 0;
int len = 0; struct Node *temp = NULL;
if ((position < 1) || (position > (m_count+1)) || dataRecord == NULL)//增加
{
return false;
}
if (m_head != NULL)
{
temp = m_head; //the head point
while (temp != NULL) //the head point is existing
{
++index;
if (position == index)
{
len = strlen(temp->element）；
//changed by handwolf
memcpy(dataRecordTemp->cData,temp->element,len);
return true;
｝
temp = temp->next;
} //end of while
}
else
{
return false;
}
return false;
}
{
DataRecord *dataRecordTemp;
dataRecordTemp = dataRecord;
int index = 0;
int len = 0; struct Node *temp = NULL;
if ((position < 1) || (position > (m_count+1)) || dataRecord == NULL)//增加
{
return false;
}
if (m_head != NULL)
{
temp = m_head; //the head point
while (temp != NULL) //the head point is existing
{
++index;
if (position == index)
{
len = strlen(temp->element)；
//changed by handwolf
memcpy(dataRecordTemp->cData,temp->element,len);
return true;
}
temp = temp->next;
} //end of while
}
else
{
return false;
}
return false;
}