Archive for year: 2021

TemplateMetaprogramming

Template Metaprogramming – How it Works

November 5, 2021

/

In my last post, "Template Metaprogramming - How it All Started", I wrote about the roots of template…

TemplateMetaprogramming

Template Metaprogramming – How it All Started

October 26, 2021

/

Metaprogramming is programming on programs. C++ applies metaprogramming at compile time. It started in…

AutomaticReturnType

Automatic Return Type (C++11/14/20)

October 21, 2021

/

I started my discussion about the "Automatic Return Type (C++98)" in my last post. Today, I'm faced…

AutomaticReturnType

Automatic Return Type (C++98)

October 15, 2021

/

Depending on the used C++ standard, there are different ways to return the correct return type of a function…

templates

Dependent Names

October 7, 2021

/

A dependent name is essentially a name that depends on a template parameter. A dependent name can be…

templates

The Special Friendship of Templates

September 29, 2021

/

A friend has unrestricted access to the members of a class. Consequently, friendship should be given…

templates

Visiting a std::variant with the Overload Pattern

September 23, 2021

/

Typically, you use the overload pattern for a std::variant. std::variant is a type-safe union. A std::variant…

templates

Smart Tricks with Parameter Packs and Fold Expressions

September 16, 2021

/

To complete my post about variadic templates and fold expressions, I present in this post smart tricks…

bundle

The New pdf Bundle is Ready: C++20 Modules

September 15, 2021

/

I have prepared the pdf bundle. To get it is quite simple. If you subscribe to the newsletter,…

bundle3

Modern C++ Collection

September 10, 2021

/

Get all my books about modern C++ in one bundle. C++20 Concurrency with Modern C++, including…

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