Archive for year: 2021

ClassTemplate

Class Templates

May 19, 2021

/

A function template represents a family of functions. Accordingly, a class template represents a family…

RainerGrimmSmall

Which pdf bundle do you want? Make your choice!

May 19, 2021

/

Now, it's time to choose the next pdf bundle? Get all the material to your chosen topic. I…

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.…

Latest news

A Lock-Free Stack: A Hazard Pointer ImplementationMarch 10, 2025 - 11:42 am
Hazard Pointers solve all issues of the previous implementation: A Lock-Free Stack: A Simple Garbage Collector. From one Week to two Weeks You may have already noticed. I will change my blog publishing frequency from one to two weeks in the future. Writing a post using your voice is exceptionally exhausting and time-consuming. Hazard Pointers […]
A Lock-Free Stack: A Simple Garbage CollectorFebruary 24, 2025 - 11:58 am
My next lock-free stack includes a simple garbage collector. I discussed the concurrent execution of more than one topAndPush call is a Race Condition. I can safely delete a node if not more than one topAndPush call is executing concurrently. This observation is crucial for solving this memory leak issue: I store removed nodes on […]
A Lock-Free Stack: Atomic Smart PointerFebruary 17, 2025 - 11:47 am
The easiest way to solve this memory leak issue from the last post is to use a std::shared_ptr. Atomic Smart Pointer There are two ways to apply atomic operations on a std::shared_ptr: In C++11, you can use the free atomic functions on std::shared_ptr. With C++20, you can use atomic smart pointers. C++11 Using atomic operations […]
A Lock-Free Stack: A Complete ImplementationFebruary 10, 2025 - 3:01 pm
My last lock-free stack implementation was incomplete. It only supported push operations. Let’s change this. The following paragraph about sequential consistency is optional. You can easily ignore it. Sequential Consistency In my examples, I use the default memory ordering: sequential consistency. The reason is simple. Sequential consistency provides the strongest guarantees of all memory ordering […]
My Next Mentoring Program: “Generic Programming (Templates) with C++” startsFebruary 4, 2025 - 4:51 pm
My next mentoring program, “Embedded Programming with Modern C++,” starts on January 31st. Registration is open. Here are more details. Embedded Programming with Modern C++ The mentoring program consists of 16 stations. You have to invest at least 3 hours per week for each one. This means the program takes four months, and you can […]
A Lock-Free Stack: A Simplified ImplementationFebruary 3, 2025 - 10:37 am
Today, I continue my mini story about lock-free data structures. General Considerations From the outside, the caller’s responsibility (application) is to protect the data. From inside, the data structure is responsible for protecting itself. A data structure that protects itself so a data race cannot appear is called thread-safe. First, what general considerations must you […]