codebase/c_linked_list.h at main · 7amdev/codebase · GitHub

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
#ifndef LinkedList_H
#define LinkedList_H

#define Link(Type) Type*
#define LinkedList(Type) Type*
#define LinkedListHeader(Type) Type* next

#define LinkedList_push(first, node) do {   \
    (node)->next = (first);                 \
    (first) = (node);                       \
} while (0)

#define LinkedList_pop(first, node_out) do {        \
    if ((first) == NULL) break;                     \
    if (node_out) *(node_out) = *(first);           \
    (first) = (first)->next;                        \
} while (0)

// [first_in]  A pointer to the starting Node.
// [offset_in] Can be a variable or a literal value.
//
#define LinkedList_peek(Type, first_in, offset_in, node_out) do {           \
    Type* loop  = (first_in);                                               \
    int _offset = (offset_in);                                              \
    for (; _offset > 0 && loop != NULL; loop = loop->next, _offset -= 1);   \
    if (_offset != 0) { *(node_out) = (Type){0}; break; }                   \
    if (loop == NULL) { *(node_out) = (Type){0}; break; }                   \
    *(node_out) = *loop;                                                    \
} while (0)

#define LinkedList_peek_top(Type, first, node_out) \
        LinkedList_peek(Type, first, 0, node_out)

#define LinkedList_insert_after(base_node, new_node) do {               \
    (new_node)->next = (base_node)->next;                               \
    (base_node)->next = (new_node);                                     \
} while (0)

#define LinkedList_foreach(Type, node, it)                                                                                  \
    for (                                                                                                                   \
        struct t__ { Type *prev; Type* curr; Type* next; int i; } it = { NULL, (node), ((node) ? (node)->next : 0), 0};     \
        (it).curr != 0;                                                                                                     \
        (it).prev = (it).curr, (it).curr = (it).curr->next, (it).next = ((it).curr) ? (it).curr->next : 0, (it).i += 1      \
    )

#define LinkedList_is_empty(first) (first == 0)

// TODO: #define LinkedList_insert_at(...)
// TODO: #define LinkedList_remove_at(...)

#endif // LinkedList_H