#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>

typedef struct _Node { // 12+ bytes
    int value;          // 4 bytes
    struct _Node* next; // 8 bytes
} Node;

typedef struct {
    Node* head;
    Node* tail;
    size_t size;
} LinkedList;

#define log_int(n) printf("%s == %d\n", #n, n)
#define log_long(n) printf("%s == %ld\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("[%d]->", node->value);
    }
    printf("NULL\n");
}

void destroy_list(Node* head) {
    Node* node = head;
    while (node != NULL) {
        Node* next = node->next;
        free(node);
        node = next;
    }

}

void append(LinkedList* a_list, int value) {
    Node* new_node = malloc(sizeof(*new_node));
    *new_node = (Node) { .next = NULL, .value = value };

    if (a_list->head == NULL) {
        // from size 0 to size 1
        a_list->head = new_node;
    } else {
        // from size N to size N+1
        a_list->tail->next = new_node;
    }
    a_list->tail = new_node;
    a_list->size += 1;
}

int main(int argc, char* argv[]) {
    LinkedList list = { .head = NULL, .tail = NULL, .size = 0 };
    print_list(list.head);
    log_long(list.size);

    append(&list, 1);
    print_list(list.head);
    log_long(list.size);

    append(&list, 2);
    print_list(list.head);
    log_long(list.size);

    append(&list, 3);
    print_list(list.head);
    print_list(list.head->next);
    log_long(list.size);

    append(&list, 343);
    append(&list, 34);
    append(&list, 6654);
    append(&list, 545);
    append(&list, 934);
    append(&list, 49);
    print_list(list.head);
    log_long(list.size);

    destroy_list(list.head);

    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */