sc/linked-list/README.md

55 lines
975 B
Markdown
Raw Normal View History

2020-12-27 16:14:34 +03:00
# Linked List
### Overview
2021-02-03 08:09:50 +03:00
- Intrusive doubly linked list implementation.
2020-12-27 16:14:34 +03:00
- Basically, same as adding next and prev pointers to your structs.
- Add/remove from head/tail is possible so it can be used as list, stack,
queue, dequeue etc.
#### Usage
```c
#include "sc_list.h"
#include <stdio.h>
#include <string.h>
int main(int argc, char *argv[])
{
struct user
{
char *name;
struct sc_list next;
};
struct user users[] = {{"first"},
{"second"},
{"third"},
{"fourth"},
{"fifth"}};
struct sc_list list;
sc_list_init(&list);
for (int i = 0; i < 5; i++) {
sc_list_add_tail(&list, &users[i].next);
}
struct sc_list *it;
struct user *user;
sc_list_foreach (&list, it) {
user = sc_list_entry(it, struct user, next);
printf("%s \n", user->name);
}
return 0;
}
```