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
46
47
48
49
50
51
52
53
54
55
#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 the data
    // at «addr».  If we try, we will get an error from GCC.
    //
    // This would cause an error:
    // node -> value = 999;  // attempting to modify memory at address node
    //
    // This would also cause an error:
    // *node = some_other_node;  // writing to memory marked as const
    //
    // This would also cause an error:
    // struct Node* copy_of_node = node;
    // … because you are "discarding the `const' qualifier".  You could
    // then attempt to write to that memory with
    // … copy_of_node -> value = 99;
    // for the same effect as before.
    //
    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.