Archive for category: C++20

TimelineCpp20

C++20: The Three-Way Comparison Operator

June 11, 2020

/

The three-way comparison operator <=> is often just called the spaceship operator. The spaceship…

TimelineCpp20

C++20: Further Open Questions to Modules

June 2, 2020

/

So far, I have written in my last four posts the basics you should know about modules in C++20. Only…

C++20: Structure Modules

May 29, 2020

/

When your module becomes bigger, you want to divide its functionality into manageable components. C++20…

C++20: Module Interface Unit and Module Implementation Unit

May 18, 2020

/

Thanks to the module interface unit and implementation unit, you can separate the interface from the…

C++20: A Simple math Module

May 12, 2020

/

Modules are one of the four prominent features of C++20. They overcome the restrictions of header files…

C++20: The Advantages of Modules

May 8, 2020

/

Modules are one of the four big features of C++20: concepts, ranges, coroutines, and modules. Modules…

C++20: Thread Pools with cppcoro

May 1, 2020

/

This post is the third and final post in my miniseries to cppcoro. cppcoro is a library of coroutine…

C++20: Powerful Coroutines with cppcoro

April 23, 2020

/

I gave in my last post, "C++20: Coroutines with cppcoro", a basic introduction to the coroutines library…

C++20: Coroutines with cppcoro

April 16, 2020

/

The cppcoro library from Lewis Baker gives you what C++20 doesn't: a library of C++ coroutine abstractions…

C++20: Thread Synchronization with Coroutines

April 10, 2020

/

It's a typical requirement for thread management to synchronize them. One thread prepares, in this case,…

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 […]