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 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
#include "miniunit.h"
#include "append.h"
static int _test_list_size_1() {
mu_start();
//────────────────────
// ARRANGE
Node* head = NULL;
Node* tail = NULL;
// ACT
append(10, &head, &tail);
// ASSERT (conceptually: insist that something be true)
mu_check(head -> value == 10);
mu_check(head == tail); // list of size 1
destroy_list(&head, &tail);
mu_check(head == NULL);
mu_check(tail == NULL);
//────────────────────
mu_end();
}
int main(int argc, char* argv[]) {
mu_run(_test_list_size_1);
return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */
|
© Copyright 2022 Alexander J. Quinn This content is protected and may not be shared, uploaded, or distributed.