Mixins
In my previous post “More about Dynamic and Static Polymorphism”, I used the Curiously Recurring Template Pattern (CRTP) to implement static polymorphism. Another typical use case for CRTP is mixins.
This author has not written his bio yet.
But we are proud to say that Rainer Grimm contributed 699 entries already.
In my previous post “More about Dynamic and Static Polymorphism”, I used the Curiously Recurring Template Pattern (CRTP) to implement static polymorphism. Another typical use case for CRTP is mixins.
I have prepared my mentoring program and am ready to start on 22nd April.
In my last post, “Dynamic and Static Polymorphism“, I introduced dynamic polymorphism. Today, I continue with static polymorphism and present a very interesting idiom in C++: curiously recurring template pattern (CRTP).
Do you want to participate in my mentoring program “Fundamentals for C++ Professionals”? Of course, you want to read more about me on my mentoring page: About Rainer Grimm.
Polymorphism is the property that different types support the same interface. In C++, we distinguish between dynamic polymorphism and static polymorphism.
In today’s post, I want to introduce an exciting C++17 feature: constexpr if. constexpr if enables it to compile source code conditionally and can be used for nice tricks at compile time.
With C++20, constexpr became way more powerful. Additionally, we have consteval functions in C++20 that are quite similar to constexpr functions.
One month ago, I presented “My Mentoring Program “Fundamentals for C++ Professionals“. I’m overwhelmed by how my people want to participate in this first iteration of my mentoring program. What should I say? Today, I want to give you more details.
Today, I continue my story about programming at compile time. After template metaprogramming, the type-traits library, today’s topic is constexpr functions in particular.
I am happy to announce. I updated my “Concurrency with Modern C++”. This update includes a rework of the C++20 topics, a new case study, and a new chapter about lock-free data structures. Now, you get about 700 pages and more than 200 runnable programs to study the theory in practice. Here is more info: […]