nihonium
/
mipt_clang
Archived
1
0
Fork 0
Code Releases Activity

modified: list.c

Browse Source
remotes/private/master
nihonium 3 years ago
parent 694be70461
commit d72079fcfe
1 changed files with 98 additions and 6 deletions
Show Stats Download Patch File Download Diff File

104
list_and_trees/list.c
Unescape Escape View File

@ -66,28 +66,120 @@ void list_add_first (struct List * list, Data x) {
void list_print(struct List * list) { void list_print(struct List * list) {
struct Node *ptr = list->head; struct Node *ptr = list->head;
while (ptr->next != NULL) { if (ptr == NULL) {
printf("%p:%d (next is %p)\n", ptr, ptr->val, ptr->next); printf("Empty list\n");
ptr = ptr->next; }
else {
while (ptr->next != NULL) {
printf("%d ", ptr->val);
ptr = ptr->next;
}
printf("%d\n", ptr->val);
} }
printf("%p:%d (next is NULL)\n", ptr, ptr->val);
} }
Data list_remove_first (struct List * list) { Data list_remove_first (struct List * list) {
struct Node *ptr = list->head; struct Node *ptr = list->head;
Data val = ptr->val; Data val = ptr->val;
list->head = ptr->next; if (ptr->next == NULL) {
list->head = NULL;
}
else {
list->head = list->head->next;
}
free(ptr); free(ptr);
return val; return val;
} }
Data list_remove_last (struct List * list) {
struct Node *ptr = list->head;
Data val;
if (ptr->next == NULL) {
list->head = NULL;
val = ptr->val;
free(ptr);
}
else {
while (ptr->next->next != NULL) {
ptr = ptr->next;
}
struct Node* lastNode = ptr->next;
val = lastNode->val;
ptr->next = NULL;
free(lastNode);
}
return val;
}
Data list_get_first (struct List * list) {
return list->head->val;
}
Data list_get_last (struct List * list) {
struct Node *ptr = list->head;
while (ptr->next != NULL) {
ptr = ptr->next;
}
return ptr->val;
}
int list_size(struct List * list) {
struct Node *ptr = list->head;
if (ptr == NULL) {
return 0;
}
int len = 1;
while (ptr->next != NULL) {
ptr = ptr->next;
++len;
}
return len;
}
void list_clear(struct List * list) {
struct Node *ptr = list->head;
if (ptr == NULL) {
free(ptr);
}
else {
struct Node *next;
while (ptr->next != NULL) {
next = ptr->next;
free(ptr);
ptr = next;
}
}
list->head = NULL;
}
void list_destroy (struct List * list) {
list_clear(list);
free(list);
}
int main() { int main() {
struct List * list = list_create(); struct List * list = list_create();
//printf("%d\n", list_size(list));
list_add_last(list, 5); list_add_last(list, 5);
list_add_last(list, 6); list_add_last(list, 6);
list_add_first(list, 3); list_add_first(list, 3);
list_add_last(list, 8);
list_add_last(list, 9);
list_print(list); list_print(list);
printf("Removed - %d\n", list_remove_first(list)); printf("Removed - %d\n", list_remove_first(list));
list_print(list); list_print(list);
//list_destroy(list); printf("Removed - %d\n", list_remove_last(list));
list_print(list);
printf("%d\n", list_get_first(list));
printf("%d\n", list_get_last(list));
printf("%d\n", list_size(list));
//list_clear(list);
list_print(list);
list_destroy(list);
list_print(list);
/*list = list_create();
list_add_first(list, 5);
list_print(list);
list_destroy(list);*/
} }