sc

Nice article! I think eventually you need to move to macros to support multiple key/value types in C. Just leaving some macro implementations for reference: - https://github.com/attractivechaos/klib/blob/master/khash.h - https://github.com/tezc/sc/tree/master/map - https://github.com/troydhanson/uthash

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.

For a vector alternative, I find this one easy to read and use : https://github.com/tezc/sc/tree/master/array It is just an array of your type, e.g int *numbers, so you have type info in debugger as well.

You skipped hs_remove but depending on implementation, hs_remove strategy may change your hs_set, e.g using tombstones. I’ve recently learnt that you don’t need tombstones at all in linear hashmaps, you just do backshift removals, it may be a simple addition to your map. Check out these repos for the example implementation: (C) https://github.com/tezc/sc/tree/master/map (C++) https://github.com/rigtorp/HashMap