mirror of
https://codeberg.org/dnkl/yambar.git
synced 2025-04-20 03:35:41 +02:00
tllist: typed-linked-list: a generic linked-list implementation
This commit is contained in:
Daniel Eklöf
parent
1712362da9
commit
cc457be4d8
1 changed files with 154 additions and 0 deletions
154
tllist.h
Normal file
154
tllist.h
Normal file
|
|
@ -0,0 +1,154 @@
|
|||
#pragma once
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <stddef.h>
|
||||
#include <assert.h>
|
||||
|
||||
#define TLL_PASTE2( a, b) a##b
|
||||
#define TLL_PASTE( a, b) TLL_PASTE2( a, b)
|
||||
|
||||
/* Utility macro to generate a list element struct with a unique struct tag */
|
||||
#define TLL_UNIQUE_INNER_STRUCT(TYPE, ID) \
|
||||
struct TLL_PASTE(__tllist_ , ID) { \
|
||||
TYPE item; \
|
||||
struct TLL_PASTE(__tllist_, ID) *prev; \
|
||||
struct TLL_PASTE(__tllist_, ID) *next; \
|
||||
} *head, *tail;
|
||||
|
||||
/*
|
||||
* Defines a new typed-list type, or directly instantiate a typed-list variable
|
||||
*
|
||||
* Example a, declare a variable (list of integers):
|
||||
* tll(int) my_list;
|
||||
*
|
||||
* Example b, declare a type, and then use the type:
|
||||
* tll(int, my_list_type);
|
||||
* struct my_list_type my_list;
|
||||
*/
|
||||
#define tll(TYPE, ...) \
|
||||
struct __VA_ARGS__ { \
|
||||
TLL_UNIQUE_INNER_STRUCT(TYPE, __COUNTER__) \
|
||||
size_t length; \
|
||||
}
|
||||
|
||||
/* Initializer: tll(int) my_list = tll_init(); */
|
||||
#define tll_init() {.head = NULL, .tail = NULL, .length = 0}
|
||||
|
||||
/* Length/size of list: printf("size: %zu\n", tll_length(my_list)); */
|
||||
#define tll_length(list) (list).length
|
||||
|
||||
/* Adds a new item to the back of the list */
|
||||
#define tll_push_back(list, new_item) \
|
||||
do { \
|
||||
__typeof((list).head) __e = malloc(sizeof(*__e)); \
|
||||
__e->item = (new_item); \
|
||||
__e->prev = (list).tail; \
|
||||
__e->next = NULL; \
|
||||
if ((list).head == NULL) \
|
||||
(list).head = (list).tail = __e; \
|
||||
else { \
|
||||
(list).tail->next = __e; \
|
||||
(list).tail = __e; \
|
||||
} \
|
||||
(list).length++; \
|
||||
} while (0)
|
||||
|
||||
/* Adds a new item to the front of the list */
|
||||
#define tll_push_front(list, new_item) \
|
||||
do { \
|
||||
__typeof((list).head) __e = malloc(sizeof(*__e)); \
|
||||
__e->item = (new_item); \
|
||||
__e->prev = NULL; \
|
||||
__e->next = (list).head; \
|
||||
if ((list).head == NULL) \
|
||||
(list).head = (list).tail = __e; \
|
||||
else { \
|
||||
(list).head->prev = __e; \
|
||||
(list).head = __e; \
|
||||
} \
|
||||
(list).length++; \
|
||||
} while (0)
|
||||
|
||||
|
||||
/*
|
||||
* Iterates the list. <it> is an iterator pointer. You can access the
|
||||
* list item with ->item:
|
||||
*
|
||||
* tll(int) my_list = vinit();
|
||||
* tll_push_back(my_list, 5);
|
||||
*
|
||||
* tll_foreach(my_list i) {
|
||||
* printf("%d\n", i->item);
|
||||
* }
|
||||
*/
|
||||
#define tll_foreach(list, it) \
|
||||
for (__typeof((list).head) it = (list).head, \
|
||||
it_next = it != NULL ? it->next : NULL; \
|
||||
it != NULL; \
|
||||
it = it_next, \
|
||||
it_next = it_next != NULL ? it_next->next : NULL)
|
||||
|
||||
/* Same as tll_foreach(), but iterates backwards */
|
||||
#define tll_rforeach(list, it) \
|
||||
for (__typeof((list).tail) it = (list).tail, \
|
||||
it_prev = it != NULL ? it->prev : NULL; \
|
||||
it != NULL; \
|
||||
it = it_prev, \
|
||||
it_prev = it_prev != NULL ? it_prev->prev : NULL)
|
||||
|
||||
/*
|
||||
* Removes an entry from the list. <it> is an iterator. I.e. you can
|
||||
* only call this from inside a tll_foreach() or tll_rforeach() loop.
|
||||
*/
|
||||
#define tll_remove(list, it) \
|
||||
do { \
|
||||
assert((list).length > 0); \
|
||||
__typeof((list).head) __prev = it->prev; \
|
||||
__typeof((list).head) __next = it->next; \
|
||||
if (__prev != NULL) \
|
||||
__prev->next = __next; \
|
||||
else \
|
||||
(list).head = __next; \
|
||||
if (__next != NULL) \
|
||||
__next->prev = __prev; \
|
||||
else \
|
||||
(list).tail = __prev; \
|
||||
free(it); \
|
||||
(list).length--; \
|
||||
} while (0)
|
||||
|
||||
/* Same as tll_remove(), but calls free_callback(it->item) */
|
||||
#define tll_remove_and_free(list, it, free_callback) \
|
||||
do { \
|
||||
free_callback((it)->item); \
|
||||
tll_remove((list), (it)); \
|
||||
} while (0)
|
||||
|
||||
/*
|
||||
* Removes the first element from the list, and returns it (note:
|
||||
* returns the *actual* item, not an iterator.
|
||||
*/
|
||||
#define tll_pop_front(list) \
|
||||
({__typeof((list).head) it = (list).head; \
|
||||
__typeof((list).head->item) __ret = it->item; \
|
||||
tll_remove((list), it); \
|
||||
__ret; \
|
||||
})
|
||||
|
||||
/* Same as tll_pop_front(), but returns/removes the *last* element */
|
||||
#define tll_pop_back(list) \
|
||||
({__typeof((list).tail) it = (list).tail; \
|
||||
__typeof((list).tail->item) __ret = it->item; \
|
||||
tll_remove((list), it); \
|
||||
__ret; \
|
||||
})
|
||||
|
||||
/* Frees the list. This call is *not* needed if the list is already empty. */
|
||||
#define tll_free(list) \
|
||||
tll_foreach(list, __it) \
|
||||
tll_remove(list, __it)
|
||||
|
||||
/* Same as tll_free(), but also calls free_callback(item) for every item */
|
||||
#define tll_free_and_free(list, free_callback) \
|
||||
tll_foreach(list, __it) \
|
||||
tll_remove_and_free(list, __it, free_callback)
|
||||
Loading…
Add table
Reference in a new issue