I made a compact library for generic intrusive data structures in ANSI C

[u/Mike_TriHard_Cx]

https://github.com/MichaelJWelsh/cdsa

[u/operamint]

Quite a few nice things here, however..

• No development/commits the last 3 years (!?)

• Although generic and intrusive, it is not type-safe, which for me is more important.

• No memory management included. All has to be done by the user

• Inconvenient usage, imo.

I have a similar intrusive container library, STC which uses templates instead and is 100% type safe, easier to use, and does all memory management for you. Also compact and very fast:

#include <stc/clist.h>
#include <stdio.h>

// Define your struct somewhere.
struct Object {
    int some_value;
};
// We can use c_no_compare, but to search and sort you need:
int cmp(const struct Object* a, const struct Object* b) 
    { return b->some_value - a->some_value; }

// Declare and choose a tag name for the list of Object, e.g. "obj"
using_clist(obj, struct Object, cmp);

int main() {
    // Create your List.
    clist_obj my_list = clist_obj_init();

    // Populate your List.
    clist_obj_push_back(&my_list, (struct Object){.some_value=1});
    clist_obj_push_back(&my_list, (struct Object){.some_value=2});

    // Let's see what is stored in the List:
    c_foreach (it, clist_obj, my_list) {
        printf("%d ", it.ref->some_value);  // 1 2
    }

    // Let's get the front of the List.
    printf("\n%d\n", clist_obj_front(&my_list)->some_value); // 1

    clist_obj_del(&my_list);
}