ludocode/pottery
View on GitHub ↗ ★ 132 C
Pottery - A container and algorithm template library in C
13 mentions on Hacker News by 2 people: 3 stories, 10 comments · first 2020-12-16 · latest 2022-05-17
20082026
-
…to person, which is why no library has emerged as the de facto standard for containers in C. [0]: https://github.com/ludocode/pottery [1]: https://github.com/ludocode/pottery/tree/develop/util/potter...
comment by ludocode · 2022-05-17 · in Common libraries and data structures for C -
…a day job and young children makes progress slow :( [1]: https://github.com/ludocode/mpack [2]: https://github.com/ludocode/pottery
comment by ludocode · 2021-11-01 · in Ask HN: What you up to? (Who doesn't want to be hired?) -
…and instantiable with an ordinary C compiler. This is how my metaprogramming library Pottery works: https://github.com/ludocode/pottery It uses #include for templates rather than code block macros, something the article doesn't really go…
comment by ludocode · 2021-07-10 · in Metaprogramming custom control structures in C (2012) -
…It provides vectors, hash tables, binary search trees, priority queues, sort algorithms, etc. https://github.com/ludocode/pottery These templates are composable: high-level templates are implemented using lower-level ones. It also supports…
comment by ludocode · 2021-05-17 · in Ask HN: What are some tools / libraries you built yourself? -
…and it's finally starting to become more popular. I've open sourced my own C template library here: https://github.com/ludocode/pottery Not only does it use the #include style of templates, but it actually makes the templates composable.…
comment by ludocode · 2021-04-09 · in Type-safe generic data structures in C -
…implemented a platform-independent POSIX hsearch as a wrapper to a templated hashtable in Pottery: https://github.com/ludocode/pottery/tree/master/examples/pot... Be warned, hsearch is terrible. You should probably only use this if you…
comment by ludocode · 2021-03-26 · in How to implement a hash table in C -
…and macOS qsort() are all faster than glibc at sorting integers and they don't allocate memory: https://github.com/ludocode/pottery/tree/master/examples/pot... Of course sorting is much faster if you can inline the comparator so a…
comment by ludocode · 2021-01-15 · in Beating Up on Qsort (2019) -
…map, you provide both a key comparison expression and an expression to convert values to keys. [1]: https://github.com/ludocode/pottery/tree/master/include/pott...
comment by ludocode · 2020-12-30 · in C Template Library -
Might as well plug mine too: https://github.com/ludocode/pottery I'm not really sure what makes a project take off on HN. I posted mine here a couple weeks ago and got one single upvote :(. I'm glad to see the new style of #include…
comment by ludocode · 2020-12-30 · in C Template Library -
…that all programmers with even a passing interest in chess spend some time writing an engine. [1] https://github.com/ludocode/pottery/tree/master/examples/pot... [2] https://youtube.com/watch?v=nzObJ2BpKrk
comment by ludocode · 2020-12-24 · in Building My Own Chess Engine