Implementations for singly-linked and doubly-linked list functions.

#include <stdio.h>
#include <stdlib.h>
#include "list.h"

typedef struct node {
    int key;
    struct node *next;
} node_t;

node_t *head = NULL;
 
int main(){
    node_t *item, *tmp;

    item = malloc(sizeof(node_t));
    item->key = 5;
    item->next = NULL;
    SL_APPEND(head, item);

    SL_FOREACH(head, item) printf("%d\n", item->key);

    SL_FOREACH_SAFE(head, item, tmp){
        SL_DELETE(head, item);
        free(item);
    }

    return 0;
}

Every function has a doubly-linked list counterpart. The doubly-linked list version takes the exact same arguments. They are referred to as DL_ and the function name. For example, DL_EMPTY and DL_APPEND.

This function appends a node to the end of a linked list.

Argument 1: The head node of the list

Argument 2: The node to be appended to the list

Call:

SL_APPEND(head, node);

This function prepends a node to the start of a linked list.

Argument 1: The head node of the list

Argument 2: The node to be prepended to the list

Call:

SL_PREPEND(head, node);

This function sorts a linked list in O(n log n) time.

Argument 1: The head node of the list

Argument 2: A function pointer to a compare function

Call:

SL_SORT(head, fn *);

Note: The function pointer must be able to identify if one key is less than or equal to another and return a value accordingly. The check to swap is if the return value of the compare function is less than or equal to zero. For strings, you can use strcmp() and for integers you can simply return the difference.

This function reverses a linked list. For example, a->b->c->d becomes d->c->b->a.

Argument 1: The head node of the list

Call:

SL_REVERSE(head);

This function concatenates two linked lists. For example, list1: a->b and list2: c->d becomes a->b->c->d.

Argument 1: The head node of the first list

Argument 2: The head node of the second list

Call:

SL_CONCAT(head, head);

This function stores the length of a linked list in the second argument.

Argument 1: The head node of the list

Argument 2: An integer to store the length of the list

Call:

SL_LENGTH(head, length);

Note: The second argument will be clobbered!

This function iterates over the length of the list and returns the node at each step. This is helpful when operating on every node in the list (printing the list or altering each node).

Argument 1: The head node of the list

Argument 2: A temporary node to store each intermediary node

Call:

SL_FOREACH(head, node);

This function iterates over the length of the list and returns the node at each step. This is helpful when operating on every node in the list (printing the list, altering each node, or destroying the list).

Argument 1: The head node of the list

Argument 2: A temporary node to store each intermediary node

Argument 3: A temporary node to safely store the next node

Call:

SL_FOREACH_SAFE(head, node, tmp);

This function returns a node at the nth position in the list. The list is zero-indexed, so if you ask for the 0th node, you'll get the head.

Argument 1: The head node of the list

Argument 2: A temporary node to store the returned node

Argument 3: An integer index value

Call:

SL_INDEX(head, node, index);

Note: Check for a proper return value after a function call to SL_INDEX. If your index is out of range, a NULL node will be returned.

This function searches the list and compares each node to the query using the function pointer argument. If a valid match is found, the matching node is placed in the fourth argument node. This is one of the most versatile functions due to the nature of the function pointer. You're given the ability to search for nodes, keys (int, char *, ...), etc. The limit to which you can search the list is your ability to write a proper compare function.

Argument 1: The head node of the list

Argument 2: A function pointer to a compare function

Argument 3: The item you want to query

Argument 4: A temporary node to store the returned node

Call:

SL_SEARCH(head, cmp, query, node);

Note: Check for a proper return value after a function call to SL_SEARCH. If a node is not found, a NULL node will be returned.

This function removes a node from the linked list. SL_DELETE only unlinks the node! The memory must be freed to avoid a memory leak.

Argument 1: The head node of the list

Argument 2: The node to be removed

Call:

SL_DELETE(head, node);

Below are some common use cases for the above functions.

SL_FOREACH(head, node) printf("%d\n", node->key);

See SL_DELETE.

/* For integers */
int cmp(node_t *a, int key){
    return a->key - key;
}
SL_SEARCH(head, cmp, 5, node);

/* For strings */
int cmp(node_t *a, char *key){
    return strcmp(a->key, key);
}
SL_SEARCH(head, cmp, "Hello, world!", node);

/* For pointers */
int cmp(node_t *a, void *ptr){
    return (a->data.ptr == ptr) ? 0 : 1;
}
SL_SEARCH(head, cmp, ptr, node);

SL_DELETE(head, node);
free(node);

SL_FOREACH_SAFE(head, node, tmp){
    SL_DELETE(head, node);
    free(node);
}