51 lines
1.7 KiB
C
51 lines
1.7 KiB
C
/**
|
|
* @brief General-purpose doubly-linked list.
|
|
*/
|
|
#pragma once
|
|
|
|
#include <stdint.h>
|
|
#include <stddef.h>
|
|
|
|
typedef struct node {
|
|
struct node * next;
|
|
struct node * prev;
|
|
void * value;
|
|
struct ListHeader * owner;
|
|
} __attribute__((packed)) node_t;
|
|
|
|
typedef struct ListHeader {
|
|
node_t * head;
|
|
node_t * tail;
|
|
size_t length;
|
|
const char * name;
|
|
const void * metadata;
|
|
} __attribute__((packed)) list_t;
|
|
|
|
extern void list_destroy(list_t * list);
|
|
extern void list_free(list_t * list);
|
|
extern void list_append(list_t * list, node_t * item);
|
|
extern node_t * list_insert(list_t * list, void * item);
|
|
extern list_t * list_create(const char * name, const void * metadata);
|
|
extern node_t * list_find(list_t * list, void * value);
|
|
extern int list_index_of(list_t * list, void * value);
|
|
extern void list_remove(list_t * list, size_t index);
|
|
extern void list_delete(list_t * list, node_t * node);
|
|
extern node_t * list_pop(list_t * list);
|
|
extern node_t * list_dequeue(list_t * list);
|
|
extern list_t * list_copy(list_t * original);
|
|
extern void list_merge(list_t * target, list_t * source);
|
|
extern void * list_index(list_t * list, int index);
|
|
|
|
extern void list_append_after(list_t * list, node_t * before, node_t * node);
|
|
extern node_t * list_insert_after(list_t * list, node_t * before, void * item);
|
|
|
|
extern void list_append_before(list_t * list, node_t * after, node_t * node);
|
|
extern node_t * list_insert_before(list_t * list, node_t * after, void * item);
|
|
|
|
/* Known to conflict with some popular third-party libraries. */
|
|
#ifndef TOARU_LIST_NO_FOREACH
|
|
# define foreach(i, list) for (node_t * i = (list)->head; i != NULL; i = i->next)
|
|
# define foreachr(i, list) for (node_t * i = (list)->tail; i != NULL; i = i->prev)
|
|
#endif
|
|
|