Implement trivial linked list

    *  Bring-your-own-node (generic / zero allocations)
    *  Doubly-linked and circular, forward and backward traversable
    *  Random insert/removal in constant time
    *  All operations are no-fail
    * [Some type safety concessions though]

Signed-off-by: Malfurious <m@lfurio.us>

1 files changed, 10 insertions, 0 deletions

diff --git a/list.h b/list.h
new file mode 100644
index 0000000..7d7a272
--- /dev/null
+++ b/list.h
@@ -0,0 +1,10 @@
+#pragma once
+#define LINKEDLIST void *prev, *next
+
+struct list {
+    void *tail, *head, *end;
+};
+
+extern void list_init(struct list *list);
+extern void list_insert(void *_next, void *_node);
+extern void list_remove(void *_node);