STC

I'd love to have some of these libraries in slimcc's test pool, but almost every one of them have hard-coded assumptions to gcc/clang/msvc/tcc in their scripts that are tiresome to undo. For example: MLIB: assumed GCC https://github.com/P-p-H-d/mlib/blob/4b9c213831624486814a483... STC: assumed -fopenmp https://github.com/stclib/STC/blob/de7313a58f748d9a6da751eb9... CC: assumed clang https://github.com/JacksonAllan/CC/blob/main/tests/run_unit_...

I went down a rabbithole and wow. Found a comment from the author of https://github.com/stclib/STC apparently and then came across this example: https://stackoverflow.com/a/76887723 int coro_a(struct a* g) { cco_routine (g) { printf("entering a\n"); for (g->i = 0; g->i < 3; g->i++) { printf("A step %d\n", g->i); cco_yield(); } cco_final: printf("returning from a\n"); } return 0; // done } gcc -E -ISTC/include co.c After running it through a preprocessor, it gives me this. int coro_a(struct a* g) { for (int* _state = &(g)->cco_state; *_state != CCO_STATE_DONE; *_state = CCO_STATE_DONE) _resume: switch (*_state) case 0: { printf("entering a\n"); for (g->i = 0; g->i < 3; g->i++) { printf("A step %d\n", g->i); do { *_state = 14; return CCO_YIELD; goto _resume; case 1

> Things like small string optimizations in C++ are simply not possible in C. I don't think this is true, I've seen a bunch of libraries implement SSO in C: https://nullprogram.com/blog/2016/10/07/ https://github.com/stclib/STC/blob/master/include/stc/cstr.h https://github.com/mystborn/sso_string/blob/master/include/s...

This caught my eye the other day & looks quite promising, though I haven't spent much time looking at it so I can't comment on it's memory safety: https://github.com/tylov/STC

This is only the case, because the C standard library is quite small and has many bad parts. You can use something like STC [1] to even the playing field. [1] https://github.com/tylov/STC

A history of PRNGs without mentioning George Marsaglia is heresy. Also, PCG didn't stop the development. Nowadays, modern PRNGs explore the usage of chaotic PRNGs (without a fixed period), which are often faster than non-chaotic ones. Notable examples are the Romu family [0] of PRNGs and sfc [1], and tylov's sfc derivative [2]. Another thing that would be nice to mention is that we went full circle, the good old middle square method already used by von Neumann, has been found to work very well if you scale it up and add a weyl sequence. [3] Edit: And how could I forget, there has also been a lot of effort in using SIMD, e.g. by SHISHUA. [4] Another thing to consider is how to efficiently distribute the generated numbers in a given distribution. I'm not aware of any recent improvements in that regard, other then some approximations that h

Maybe not it, but STC (https://github.com/tylov/STC) and CTL (https://github.com/glouw/ctl) both use this define method for creating data structures and linking up compare functions for them.

And this one may be even "better" :) https://github.com/tylov/STC