Which pdf bundle do you want? Make your choice!
Now, it’s time to choose the next pdf bundle? Get all the material to your chosen topic.
This author has not written his bio yet.
But we are proud to say that Rainer Grimm contributed 702 entries already.
Now, it’s time to choose the next pdf bundle? Get all the material to your chosen topic.
There is a lot of power in the strange-looking three dots that are heavily used in the Standard Template Library. Today, I visualize the expansion of the three dots and show a few use cases.
A variadic template is a template that can have an arbitrary number of template parameters. If you see it for the first time, this feature may seem magical to you. So, let me demystify variadic templates.
Template instantiation is creating a concrete function or a concrete class out of a function or class template. Creating template instantiation can be implicit (compiler-generated) or explicit (user-provided).
I’m happy to present the five winners in this post including their answers.
In my last post, “Parallel Algorithms of the STL with the GCC Compiler“, I presented the necessary theory about the C++17 algorithm. Today, I made a performance test using the Microsoft and GCC compiler to answer the simple question: Does the execution policy pay off?
GCC supports my favorite C++17 feature: the Standard Template Library (STL) parallel algorithms. I recognized this a few days ago, and I’m happy to write a post about it and share my enthusiasm.
I give away five vouchers for Stephan Roth’s book “Clean C++20”, sponsored by the book’s publisher Apress.
As you may know from my previous post, Template Specialization, a function template can only be full but not partially specialized. To make my long story short: Don’t specialize function templates. Just use function overloading.
After I presented in my last post Template Specialization, the basics about template specialization, I dig deeper today. I want to present the partial and full specialization of a class template as a compile-time if.
