C++11 added the keywords final and override. One of them is super useful, and the other one... not as much.

C++ STL's std::for_each algorithms applies a function to a whole sequence of elements. Here is how to make it stop after a condition is true on an element.

To apply a function on the first N elements of a collection, the STL offers for_each_n. But we see more modern techniques that you should use instead.

Here are several ways, in C++20 and before, to iterate over a C++ collection in reverse order, with expressive code.

The transform adaptor is a very useful component, but is rarely available in C++ configs today. Here is how to emulate its usage.

I was on Software Engineering Radio to talk about working with and understanding legacy code!

Combining several functions in C++ requires to use a lambda at best. This article shows 4 ways to combine functions with the help of generic components.

This article shows how to short-circuit code in C++ and to use the right operators so that the code doesn't have a unexepcted behaviour.

The Mikado method is a powerful technique to achive large refactoring in safe steps. Here is a simple technique to use it in your C++ code.

Rockstool interviewed me to know more about my story.

This article shows how to use the STL to increment a dynamic bitset with expressive code.

The SoA optimizes the cache when accessing one member of a structure in a collection. Here is how to implement the SoA in C++ to be compatible with the STL.

With C++17 2 new methods for insertion were added to the exiting ones (try_emplace, insert_or_assign). Here is an overview on how to insert in a map in C++.

Sometimes, defining a variadic template with all arguments of the same types mess with overload resolution. Here is a library to fix this.

Here is how to use the SoA to optimize caching and performance when accessing one member of a structure in a collection.

Until they are in the standard, you should write your algorithms on ranges to simplify your code. Here we discuss how to pass collection to them.

Expressive code in C++

Here is an analogy that can help you explain how bad in shapr some code is, and that a refactoring is necessary to make it evolve.

When a for loop assigns to a data member of the elements in a collection, we can't replace it with an STL algorithm. Here are alternatives, ranges and pipes

This article shows how to learn things about a piece of code just by looking at the shapes formed by its lines of code.

Lexigographical comparaison determines which one of two containers is smaller. Here is how to perform such comparisons in C++.

This article presents dry-comparisons, a library to make if statements more expressive in C++.

Coupling is a fundamental notion in programming. Here is how to understand what it is, and think about how it relates to other programming princples.

Here is a smart output iterator to insert several values inside of a sorted collection, with expressive code in C++.

C++ Smart Pointers: A free ebook that contains the basic, medium and advanced aspects of C++ smart pointers.

This article will show you how to implement named arguments in C++, such as f(firstName = "John", lastName = "Doe)