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 | #include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "miniunit.h"
struct Node {
int value;
struct Node* next;
};
void print_int_list(const struct Node* node) {
// const ▒▒▒* «addr» means this function promises not to modify *«addr».
if (node == NULL) {
printf("NO_NODES\n"); // not same as HW07
}
else {
printf("«%d»", node -> value);
}
}
int _test() {
mu_start();
// Stage 1: Empty list
struct Node* head = NULL;
print_int_list(head);
// Stage 2: List of size 1
struct Node temp_node = (struct Node) { .value = 5, .next = NULL };
print_int_list(&temp_node); // This is weird, for example.
// Avoiding malloc(…) temporarily, for this example. This is weird.
mu_end();
}
int main(int argc, char* argv[]) {
mu_run(_test);
return EXIT_SUCCESS;
}
/*
*/
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */
|
© Copyright 2020 Alexander J. Quinn This content is protected and may not be shared, uploaded, or distributed.