Archive for year: 2023

RG E Cover M2 DPAC 720x720 2022 11 27

45% Student Discount for my Mentoring Program: “Design Patterns and Architectural Patterns with C++”

February 20, 2023

/

When you are a student and book before 24/02/2023, you will get a 45% discount. But let me first…

ClassIdioms

The Iterator Protocol

February 19, 2023

/

When you want to use a user-defined type in a range-based for-loop, your user-defined type has to implement…

RG E Cover M2 DPAC 720x720 2022 11 27

One Week left: Early Bird Price for my Mentoring Program “Design Patterns and Architectural Patterns with C++”

February 16, 2023

/

When you book it before 24/02/2023, you will get a 33% discount. But let me first present my mentoring…

ClassIdioms

The Null Object Pattern

February 12, 2023

/

A Null Object encapsulates a do nothing behavior inside an object. It is often pretty comfortable to…

ClassIdioms

Value Objects

February 5, 2023

/

A value object is a small object whose equality is based on state, but not identity. Typical value objects…

RG E Cover M2 DPAC 720x720 2022 11 27

20 Days Left: Early Bird Price for my Mentoring Program “Design Patterns and Architectural Patterns with C++”

February 4, 2023

/

When you book it before 24/02/2023, you will get a 33% discount. But let me first present my mentoring…

ClassIdioms

Regular Types

January 29, 2023

/

The concept of a regular type goes back to the creator of the Standard Template Library (STL) Alexander…

not hear g24fbc3241 1280

The Lack of Training Culture: An Employer must support their Employees

January 22, 2023

/

Our software industry has a significant Lack of Training Culture. In my last article, I wrote that "Learning…

classes

The Rule of Zero, or Six

January 22, 2023

/

The rule of zero, or six, is one of the advanced rules in modern C++. I wrote in my current book "C++…

GeneralIdioms

Argument-Dependent Lookup and the Hidden Friend Idiom

January 16, 2023

/

Argument-Dependent Lookup (ADL), also known as Koenig Lookup, is a set of "magical" rules for the lookup…

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