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 <stdbool.h>
#include "clog.h"

// Use compound literal to initialize Node

typedef struct _Node {
    int value;
    struct _Node* next;  // have to use cannonical name (struct _Node) for this part
} Node;

void print_list_of_ints(Node* head) {
    for(Node* curr = head; curr != NULL; curr = curr -> next) {
        printf("[%d] ", curr -> value);
    }
}

int main(int argc, char* argv[]) {
    // Linked list of size 0 (empty)
    Node* head = NULL;
    
    // Linked list of size 1
    head = malloc(sizeof(*head));
    // head -> value = 10;
    // head -> next  = NULL;
    *head = (Node) { .value = 10, .next = NULL };
    //       ↑
    //       No asterisk
    // Type of *head is Node.
    // Type of (Node) { … } is also Node.

    // Linked list of size 2
    Node* new_node = malloc(sizeof(*new_node));
    // new_node -> value = 11;
    // new_node -> next  = NULL;
    *new_node = (Node) { .value = 11, .next = NULL };
    head -> next = new_node;  // connect the head to this new node

    print_list_of_ints(head);

    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.