45 lines
1.2 KiB
C
45 lines
1.2 KiB
C
|
#include <type.h>
|
||
|
|
#include <list/list.h>
|
||
|
|
|
||
|
|
Node *copyNode(Node *p_node) {
|
||
|
|
Node *t_node = NULL;
|
||
|
|
#ifdef id_enable
|
||
|
|
if (p_node->s_id == NULL) t_node = initNode(0);
|
||
|
|
else t_node = initNode(p_node->s_id->deep);
|
||
|
|
t_node->s_id = copyS_id(p_node->s_id);
|
||
|
|
#endif
|
||
|
|
t_node->last = p_node->last;
|
||
|
|
t_node->next = p_node->next;
|
||
|
|
t_node->type = p_node->type;
|
||
|
|
t_node->value = p_node->value;
|
||
|
|
t_node->f_number = p_node->f_number;
|
||
|
|
return t_node;
|
||
|
|
}
|
||
|
|
|
||
|
|
List *copyList(List *p_list) {
|
||
|
|
Node *p_node;
|
||
|
|
Node *t_node;
|
||
|
|
List *t_list = NULL;
|
||
|
|
#ifdef id_enable
|
||
|
|
if (p_list->s_id == NULL) t_list = initList(0);
|
||
|
|
else t_list = initList(p_list->s_id->deep);
|
||
|
|
#endif
|
||
|
|
t_list->head = p_list->head;
|
||
|
|
t_list->tail = p_list->tail;
|
||
|
|
#ifdef list_simple_h
|
||
|
|
t_list->s_id = p_list->s_id;
|
||
|
|
t_list->s_head = p_list->s_head;
|
||
|
|
t_list->s_tail = p_list->s_tail;
|
||
|
|
#endif
|
||
|
|
t_list->length = p_list->length;
|
||
|
|
if(p_list->head != NULL && p_list->tail != NULL){
|
||
|
|
p_node = p_list->head;
|
||
|
|
while (p_node != NULL) {
|
||
|
|
t_node = copyNode(p_node);
|
||
|
|
insertInTail(t_list, t_node);
|
||
|
|
p_node = p_node->next;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return t_list;
|
||
|
|
}
|