list.h

Go to the documentation of this file.

/* lib/list.h
 *
 * Generic C List implementation.
 * For more info, please visit: https://tangled.org/@stau.space/c-list.
 *
 */
#ifndef LIST_H_
#define LIST_H_
 
#ifdef __cplusplus
extern "C" {
#endif
 
/* ----- Includes ----- */
 
#include "lib.h"
 
/* ----- Types ----- */

typedef void* Opaque;

struct NodeOpaque {
    Opaque head;      
    struct NodeOpaque* rest;  
};

typedef struct NodeOpaque* ListOpaque;
 
/* ----- Functions ----- */

void ListOpaque_deinit(ListOpaque list);

Opaque ListOpaque_car(struct NodeOpaque node);

struct NodeOpaque* ListOpaque_cdr(struct NodeOpaque node);

ListOpaque ListOpaque_cons(Opaque fst, ListOpaque list);

ListOpaque ListOpaque_rev(ListOpaque list, ListOpaque acc);

ListOpaque ListOpaque_reverse(ListOpaque list);

size_t ListOpaque_length(ListOpaque list);

Opaque ListOpaque_at(ListOpaque list, size_t index);
 
#define DefList(type) \
struct Node##type { \
    type head; \
    struct Node##type* rest; \
}; \
typedef struct Node##type* List##type; \
void List##type##_deinit(List##type list); \
type List##type##_car(struct Node##type node); \
struct Node##type* List##type##_cdr(struct Node##type node); \
List##type List##type##_cons(type a, List##type list); \
List##type List##type##_rev(List##type list, List##type a); \
List##type List##type##_reverse(List##type list); \
size_t List##type##_length(List##type list); \
type List##type##_at(List##type list, size_t index); \
List##type List##type##_drop(List##type list, size_t n); \
List##type List##type##_drop(List##type list, size_t n);
 
#define ImplList(type) \
void List##type##_deinit(List##type list) { \
    if (list != NULL) { \
        List##type##_deinit(list->rest); \
        free(list); \
    } \
} \
 \
type List##type##_car(struct Node##type node) { \
    List##type##_deinit(node.rest); \
    return node.head; \
} \
 \
struct Node##type* List##type##_cdr(struct Node##type node) { \
    return node.rest; \
} \
 \
List##type List##type##_cons(type a, List##type list) { \
    struct Node##type* node = (struct Node##type*)calloc(1, sizeof(struct Node##type)); \
    exists(node); \
    *node = (struct Node##type){ .head = a, .rest = list }; \
    return (List##type)node; \
} \
 \
List##type List##type##_rev(List##type list, List##type a) { \
    if (list != NULL) { \
        List##type out = List##type##_rev(list->rest, List##type##_cons(list->head, a)); \
        free(list); \
        return out; \
    } else              return a; \
} \
 \
List##type List##type##_reverse(List##type list) { \
    return List##type##_rev(list, NULL); \
} \
 \
size_t List##type##_length(List##type list) { \
    if (list != NULL) return List##type##_length(list->rest) + 1; \
    else              return 0; \
} \
 \
type List##type##_at(List##type list, size_t index) { \
    if (list != NULL) return index == 1 ? list->head : List##type##_at(list->rest, index - 1); \
    else              exists(NULL); \
    return (type){0}; \
} \
 \
List##type List##type##_take(List##type list, size_t n) { \
    if (list != NULL) { \
        if (n != 0) \
            return List##type##_cons(list->head, List##type##_take(list->rest, n - 1)); \
        else { \
            List##type##_deinit(list->rest); \
            return NULL; \
        } \
    } else { \
        log(FATAL, "Took too many elements from List\n"); \
        exit(1); \
    } \
} \
 \
List##type List##type##_drop(List##type list, size_t n) { \
    if (list != NULL) { \
        if (n != 0) { \
            List##type kod = list; \
            list = list-> rest; \
            free(kod); \
            return List##type##_take(list, n - 1); \
        } else \
            return list->rest; \
    } else { \
        log(FATAL, "Took too many elements from List\n"); \
        exit(1); \
    } \
} \
 
#ifdef __cplusplus
}
#endif
 
#endif // LIST_H_