sgc VS ctl

Much thought was given to this problem. C++ templates are inline by default so they do not have this issue, but they also do not generate any functions which are not called. That is not the case for my library, every function will be generated even if you do not need it. I did that for all the functions for primitive types here.

Well, I do like mine better, which is closer to the STL, and for all containers. https://github.com/rurban/ctl/

search for htable or hashtable in thousands of open source projects. only a minority has worse hashtables than this one (clisp, perl5 e.g.).

For better ones I would point to my linked list implementation: https://github.com/rurban/ctl/blob/master/ctl/unordered_set.... (because it has various security policies, nobody else has)

C Container Template Library, Rurban Variant (CTL) - The page for unordered_map reads "Implementation in work still".

There is also the rurban variant variant of CTL which is more complete.

The prototype of CC used this mechanism to provide a generic API for types instantiated via templates (so basically like other container libraries, but with an extendible-_Generic-based API laid over the top of the generated types). This approach has some significant advantages over the approach CC now uses, but I got a bit obsessed with eliminating the need to manually instantiate templates.

But the most common that I know of is this one: https://github.com/tylov/STC. There's also this one mentioned above https://rurban.github.io/ctl/

I'm also working on a proper one, but got sidetracked. https://github.com/rurban/ctl/blob/hmap/ctl/swisstable.h