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

// From questions after lecture.  Untested illustration.

// OKAY TO COPY/ADAPT ANYTHING IN THIS FILE.

static void _destroy_do_nothing(void const* value) {
    // This is for lists where the value is not on the heap.
}

static int _test_list_of_size_1() {
    mu_start();
    //────────────────────
    Node* head = NULL;
    int value = 10;
    stack_push(&head, &value);  // Note:  passing 'value' (without '*') would not work.
    // Now, we have a list of size 1:  [10|∙]→NULL

    mu_check(head != NULL);
    mu_check(head -> value == value);
    mu_check(head -> next == NULL);

    destroy_list(&head);
    mu_check(head == NULL);  // make sure destroy_list(…) set head to NULL to prevent us
                             // from accidentally using that memory after it has been freed.

    //────────────────────
    mu_end();
}
int main(int argc, char* argv[]) {
    
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */