Last year I wrote about inlining just the fast path of Lemire’s| dotat.at
The goal of this project is to translate the wonderful resource http://e-maxx.ru/algo which provides descriptions of many algorithms and data structures especially popular in field of competitive programming. Moreover we want to improve the collected knowledge by extending the articles and adding new articles to the collection.| cp-algorithms.com
There are only two kinds of languages: the ones people complain about and the ones nobody uses. – Bjarne Stroustrup, creator of C++. Very few consider C++ attractive, and only some people think it’s easy. Choosing it for a project generally means you care about the performance of your code. And rightly so! Today, machines can process hundreds of Gigabytes per second, and we, as developers, should all learn to saturate those capabilities.| ashvardanian.com
If you've ever poked at high-performance C code, you've probably seen GCC's__builtin_expect extension being used to manually hint the likelihood of abranch b...| tbrindus.ca
Assume you need to parse a record based format with flexible width and one-byte delimiters. When using C++, the std::find() STL algorithm is the obvious choice for efficiently locating the delimiters. The idiomatic C solution is to use memchr(). Expectations Sample Code Methods How fast is std::find()? Does …| Georg's Log