| Age | Commit message (Collapse) | Author |
|
|
|
|
|
|
|
|
|
Highly optimized generation of unbiased uniform bounded random numbers. Only 33% overhead.
|
|
|
|
unbiased. Removed 32-bit pcg32 PRNG.
|
|
|
|
|
|
than a bare pointer. More docs too.
|
|
|
|
Renamed erase_at() to erase_n() in cvec and cstr to improve consistency.
|
|
- Renamed cstr_erase(s, pos, n) to cstr_erase_at(s, pos, n)
- Changed cvec_erase_at(v, pos) to cvec_erase_at(v, pos, n).
|
|
|
|
|
|
|
|
|
|
|
|
c++ unordered_maps.
|
|
https://gist.github.com/tylov/bcc956a4779f1d14204e66a14f17beb9
All examples are reverted to use printf() instead of c_print().
|
|
cstr_find*() to take a cstr_t value instead of pointer, because it returns an int position only, not iter reference.
|
|
|
|
|
|
|
|
|
|
|
|
formats. c_timef() renamed to c_ftime().
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
related and short.
|
|
|
|
|
|
|
|
internal refactor.
|
|
change again.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|