#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
#include <string.h>
#include "linked_list.h"

void _print_integer(void* a_value) {
    int* a_num = a_value;
    printf("%d", *a_num);
}

int main(int argc, char* argv[]) {
    int numbers[4] = {5, 2, 9, 8473};

    // linked list of size 0
    // NULL
    Node* head = NULL;
    Node* tail = NULL;
    print_linked_list(head, _print_integer);
    assert(head == NULL);
    assert(tail == NULL);

    // linked list of size 1
    // [5]->NULL
    append(numbers + 0, &head, &tail);
    print_linked_list(head, _print_integer);
    assert(head != NULL);
    assert(tail != NULL);
    assert(head == tail);
    int* tail_value = tail->a_value;
    assert(*tail_value == 5);

    // linked list of size 2
    // [5]->[2]->NULL
    append(numbers + 1, &head, &tail);
    print_linked_list(head, _print_integer);
    assert(head != tail);
    tail_value = tail->a_value;
    assert(*tail_value == 2);

    // linked list of size 3
    // [5]->[2]->[9]->NULL
    append(numbers + 2, &head, &tail);
    print_linked_list(head, _print_integer);
    tail_value = tail->a_value;
    assert(*tail_value == 9);

    // linked list of size 4
    // [5]->[2]->[9]->[8473]->NULL
    append(numbers + 3, &head, &tail);
    print_linked_list(head, _print_integer);
    tail_value = tail->a_value;
    assert(*tail_value == 8473);

    // a later node in a linked list is a valid linked list
    print_linked_list(head->next, _print_integer);

    destroy_linked_list(&head, &tail);
    assert(head == NULL);
    assert(tail == NULL);

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