andrew
/
Algorithms
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Merge pull request #2 from andrewlalis/andrew 

fixed list free function.
This commit is contained in:
Andrew Lalis 2017-05-23 21:26:30 +02:00 committed by GitHub
parent 69daec541c c1375f3882
commit c050a8b916
2 changed files with 10 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
source/handylist.h
View File

@ -67,10 +67,11 @@ Free List node:
de-allocates memory for a list, and all next items recursively.
*/
void TEMPLATE(free,LIST_NODE)(LIST_NODE* list){
if (list->next != NULL){
TEMPLATE(free,LIST_NODE)(list->next);
}
while (list->next != NULL){
LIST_NODE* next = list->next;
free(list);
list = next;
}
}
/*

16
test.c
View File

@ -26,16 +26,12 @@ int main(int argc, char* argv[]){
push_double_stack(42.5, &s);
print_double_stack(s);
float_list* l = new_float_list(5.0, NULL);
l = add_float_list(6.0, l);
l = add_float_list(7.0, l);
l = add_float_list(8.0, l);
printList(l);
l = insert_float_list(15.5525, 2, l);
l = insert_float_list(25, 0, l);
printList(l);
l = remove_float_list(2, l);
printList(l);
float_list* l = new_float_list(-1, NULL);
printf("Start.\n");
for (int i = 0; i < 100000000; i++){
l = add_float_list(i*i, l);
}
printf("End.\n");
free_float_list(l);
}