Spruce it up #1
+4
-3
@@ -44,13 +44,12 @@ int is_list_init(struct node **list)
|
||||
else
|
||||
return 0;
|
||||
}
|
||||
|
||||
int list_size(struct node **list)
|
||||
{
|
||||
int count = 0;
|
||||
struct node *tmp = *list;
|
||||
|
||||
struct node *in_tmp = NULL;
|
||||
|
||||
while (tmp != NULL || tmp->next != NULL) {
|
||||
in_tmp = tmp;
|
||||
tmp = tmp->next;
|
||||
@@ -81,6 +80,7 @@ void insert_at_begin(struct node **list, void *val, size_t val_size)
|
||||
tmp->next = *list;
|
||||
*list = tmp;
|
||||
}
|
||||
|
||||
void insert_at_end(struct node **list, void *val, size_t val_size)
|
||||
{
|
||||
struct node *tmp = (struct node*)malloc(sizeof(struct node));
|
||||
@@ -102,6 +102,7 @@ void insert_at_end(struct node **list, void *val, size_t val_size)
|
||||
tmp->next->data = tmp_val;
|
||||
tmp->next->next = NULL;
|
||||
}
|
||||
|
||||
void free_list(struct node **list)
|
||||
{
|
||||
struct node *t = NULL;
|
||||
@@ -120,8 +121,8 @@ void free_list(struct node **list)
|
||||
return;
|
||||
}
|
||||
while (l->next != NULL);
|
||||
|
||||
}
|
||||
|
||||
void traverse(struct node *list, void (*print_val)(struct node*))
|
||||
{
|
||||
if (list == NULL)
|
||||
|
||||
Reference in New Issue
Block a user