Blog

templatesNew

Function Templates – More Details about Explicit Template Arguments and Concepts

May 13, 2021

/

In the last post, "Function Templates", I wrote about the overloading of function templates and automatically…

templatesNew

Function Templates

May 4, 2021

/

A function template is a family of functions. In this post, I want to dive deeper into function templates. Here…

templates

Templates – First Steps

April 29, 2021

/

The idea of this post is quite simple. I want to visualize templates and, in particular, the template…

cover

Printed Version of C++20 & Source Code on GitHub

April 27, 2021

/

I have two great news. First, you have my C++20 on Amazon and second, you can download the source…

result

And The Winner is: Templates

April 22, 2021

/

The future of C++ speaks templates, and so does my blog Modernes C++. Based on the poll of my last post,…

Quo Vadis – Modernes C++

April 16, 2021

/

DONE: I have written almost 100 posts about C++20. Now, I want to ask you: What should be my next big…

Automatically Resuming a Job with Coroutines on a Separate Thread

March 9, 2021

/

In my last post "Starting Jobs with Coroutines", I applied co_await to start a job. In this post, I improve…

Starting Jobs with Coroutines

March 7, 2021

/

C++20 has three new keywords to make a coroutine out of a function: co_return, co_yield, and co_await.…

A Generic Data Stream with Coroutines in C++20

March 7, 2021

/

In my last post in this mini-series on coroutines from the practical perspective, I presented the workflow…

An Infinite Data Stream with Coroutines in C++20

March 6, 2021

/

In this post, I analyze the new keyword co_yield. Thanks to co_yield, you can create an infinite data…

Executing a Future in a Separate Thread with Coroutines

March 6, 2021

/

This post concludes my posts about co_return in C++20. I started with an eager future, and continued…

Lazy Futures with Coroutines

March 4, 2021

/

Based on the coroutines-based implementation of a simple future in my last post "Implementing Simple…

Latest news

Data-Parallel Types – A First ExampleJune 25, 2025 - 4:01 pm
After providing a theoretical introduction to the new C++ 26 feature in my last article, “Data-Parallel Types (SIMD),” I would like to follow up today with a practical example. The following introductory example is from the experimental implementation of the SIMD library. This functionality has been fully adopted in the C++ 26 draft under the […]
Data-Parallel Types (SIMD)June 16, 2025 - 10:24 am
The data-parallel types (SIMD) library provides data-parallel types and operations on them. Today, I want to take a closer look at this. Before diving into the new library, I would like to take a moment to discuss SIMD. SIMD Vectorization refers to the SIMD (Single Instruction, Multiple Data) extensions of a modern processor’s instruction set. […]
Read-copy-update (RCU)June 2, 2025 - 9:54 am
Read-copy-update is strong in multithreading environments where a data structure is read almost exclusively but rarely written. First of all, what is RCU? The excellent Wikipedia page on Read-copy-update provides a good introduction: In computer science, read-copy-update (RCU) is a synchronization mechanism that avoids the use of lock primitives while multiple threads concurrently read and […]
atomic<shared_ptr<>> by Oliver SchädlichMay 19, 2025 - 9:11 am
This blog article is an experiment. A few days ago, I received the following email (translated from German) from Oliver Schädlich (oliver.schaedlich@gmail.com). If, as I hope, this article sparks a discussion, I will be happy to summarize it in my last article. Please send an email to: Rainer.Grimm@ModernesCpp.de. I just read your latest article on […]
Hazard Pointers in C++26May 5, 2025 - 11:12 am
Hazard pointers provide garbage collection in C++ and solve the ABA problem. First of all. What is a hazard pointer? Proposal P2530R3 gives a nice explanation: A hazard pointer is a single-writer multi-reader pointer that can be owned by at most one thread at any time. Only the owner of the hazard pointer can set […]
A Lock-Free Stack: A Hazard Pointer Implementation Explained IIApril 7, 2025 - 11:11 am
In my last post, I started to explain a hazard pointer implementation: A Lock-Free Stack: A Hazard Pointer Implementation Explained I. Today, I will continue to explain the implementation. The Retire List The retire list has the public member functions isInUse, addNode, and deleteUnusedNodes. Additionally, it has the inner class RetireNode, an atomic member of […]