Abstract-Data-Types VS sc

This GitHub repo: https://github.com/pavlosdais/Abstract-Data-Types is great! It uses void pointers and dynamic memory to store any kind of data type. Also, I'm currently working on a repository myself! Here's the link: https://github.com/saulvaldelvira/Generic-Data-Structures It also has the same approach, void pointers and dynamic memory, for versatility. Those are the ones I known. About documentation/Books, i don't really know about any that are focused on C. What I use for my repo is basically my notes for university. But the internet is huge! There are tons of Data Structures tutorials focused on C. Good Luck!

It is primarily made for learning purposes so if anyone is interested in taking a look the repository to it can be found here.

It is created in an abstract way by using void pointers. Also, it's made mainly for learning purposes but if anyone is interested in using it and/or helping me to find bugs here is a link to the repository.

They're all written in an abstract way using void pointers so they are applicable to any type of data and a library containing them is provided. If anyone wants to use it, provide feedblack and/or contribute to it it the repository can be found here: https://github.com/pavlosdais/Abstract-Data-Types

Common libraries and data structures for C\ (107 comments)

Can someone tell me what is this line from sc_signal.c:247 in sc/signal/

If the way it is used requires the user to break the abstraction/encapsulation and manually buffer some fields in order not to break the data structure and leak memory, I would call that a bug.

There is one use of sc_array_clear() in the test code [1] which really makes it look as if it is being used in a way that I think (again, I haven't single-stepped this code, only read it) leaks memory.

I agree on the pain of everything being macros, it's more pain than it's worth I think and will likely lead to code duplication (and more pain in debugging, probably).

I would even go so far as to think that this kind of single-file design, where each file is independent of the others, makes it harder and more annoying to implement more complicated data structures.

[1]: https://github.com/tezc/sc/blob/master/array/array_test.c#L3...

https://github.com/tezc/sc/tree/master/map

For those who are interested in faster hashmaps, I tried bunch of hashmaps and this one performs better than others. This is for C. Maybe C++ has better hashmaps.