1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
typedef struct _Node { // 16+ bytes
char* value; // 8 bytes
struct _Node* next; // 8 bytes
} Node;
#define log_int(n) printf("%s == %d\n", #n, n)
void print_list(const Node* head) {
// good code quality: using a for loop
for (const Node* node = head; node != NULL; node = node->next) {
printf("[\"%s\"]->", node->value);
}
printf("NULL\n");
}
void destroy_list(Node* head) {
Node* node = head;
while (node != NULL) {
Node* next = node->next;
// the value is assumed to be stack allocated or on the
// data segment, no freeing required
free(node);
node = next;
}
}
void append(Node** a_head, Node** a_tail, char* value) {
Node* new_node = malloc(sizeof(*new_node));
*new_node = (Node) { .next = NULL, .value = value };
if (*a_head == NULL) {
// from size 0 to size 1
*a_head = new_node;
} else {
// from size N to size N+1
(*a_tail)->next = new_node;
}
*a_tail = new_node;
}
int get_size_of_list(const Node* head) {
int size = 0;
for (const Node* node = head; node != NULL; node = node->next) {
size += 1;
}
return size;
}
int main(int argc, char* argv[]) {
Node* head = NULL;
Node* tail = NULL;
print_list(head);
append(&head, &tail, "One");
print_list(head);
append(&head, &tail, "Two");
print_list(head);
append(&head, &tail, "Three");
print_list(head);
print_list(head->next);
append(&head, &tail, "Hello");
append(&head, &tail, "Class");
append(&head, &tail, "This Is a Linked List");
append(&head, &tail, "With lots of nodes");
append(&head, &tail, "String");
append(&head, &tail, "I am running out of ideas");
print_list(head);
log_int(get_size_of_list(head));
log_int(get_size_of_list(head->next));
destroy_list(head);
return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */
|
© Copyright 2024 Alexander J. Quinn & David Burnett This content is protected and may not be shared, uploaded, or distributed.