About code. Mostly on C++
The C++26 standard features a new header called <hazard_pointer> and a new class with the same name, which, together with hazard_pointer_obj_base, provides safe memory reclamation for lock-free data structures. In this article, we’ll see how all this works. The memory reclamation problem To understand why hazard_pointer exists, we first need to look at what makes … Read more
The C++26 standard features a new container called std::inplace_vector, that sits in between the std::array and std::vector containers. It’s a container with a compiled-time fix capacity – like std::array, but a runtime variable size – like std::vector. In this article, we will discuss how it works and when to use it. A tale of two … Read more
In a previous article, I discussed the C++ std::indirect type and how it helps implementing the PImpl idiom. However, the std::indirect type was inducted in the standard alongside another type called std::polymorphic. This helps implementing composite classes, where composite means a class composed of member objects in an has-a relation, where the composite own the … Read more
I am excited to announced I launched cppdashboard.dev, a website that aggregates the activity of the C++ community into one place.
PImpl (which stands for Pointer to implementation) is a programming tehnicque to remove implementation details from a class by placing them in a separate class that is accessed through an opaque pointer. Its purpose is to separate interfaces and implementations and minimize compile-time dependencies. In this article, we’ll at how the PImpl idiom is typically … Read more
The C++26 standard features a series of improvements to the format library. In this article, we will look at the most important of them.
I have recently come across a (click-bait) post on X claiming that multiplying two 1000×1000 matrices in Python was several times faster than in C++ or other languages. So how do you multiply matrices in C++? Let’s see. First of all, how do you multiply matrices? It’s pretty simple: Here, c11 is computed as follows: … Read more
In my previous post, I talked about time-based universally unique identifiers – UUID v7 for short. An alternative to UUIDs (especially to version 4) is the ULID, which stands for Universally unique Lexicographically sortable IDentifier. These are similar with UUIDs, they have the same 128 bit length, but offer several advantages. Let’s see what these … Read more
Universally Unique Identifiers (UUID for short) are 128-bit numbers with a high degree of unicity so that the possibility of collision is extremely low. They are used for various purposes such as identifying resources, correlation IDs in logging and tracing, primary keys in databases, and more. UUIDs are known as GUIDs (Globally Unique Identifiers) on … Read more
The C++ standard library provides an algorithm called nth_element() that is a useful tool for partial sorting. But how does it work and where is it useful? First of all, the algorithm is defined as follows: given a range [first, last) and an nth element within the range, the algorithm partially sorts the range so … Read more