Archive for year: 2022

CippiArithmetic

My Next Mentoring Program is “Design Patterns and Architectural Patterns with C++”

June 14, 2022

/

This Sunday, the poll for my next mentoring program ended. There is a unique winner: Design Patterns…

Improved Iterators with Ranges

June 9, 2022

/

There are more reasons to prefer ranges library above the classical Standard Template Library. The ranges…

Minsk 1 495x400

My Next Mentoring Program

June 4, 2022

/

I will start my next mentoring program in 2023, right after the ending of the current mentoring program,…

Sentinels and Concepts with Ranges Algorithms

May 31, 2022

/

The ranges library in C++20 supports sentinels. Sentinels stand for the end of a range and can be regarded…

Projections with Ranges

May 25, 2022

/

The algorithms of the ranges library are lazy, can work directly on the container, and can easily be…

The Ranges Library in C++20: More Details

May 19, 2022

/

Working with the Standard Template Library (STL) is much more comfortable and powerful thanks to the…

TimelineCpp20Concepts

Check Types with Concepts

May 12, 2022

/

Concepts are a powerful and elegant tool to check at compile time if a type fulfills. Thanks to static_assert,…

TimelineCpp20Concepts

Check Types with Concepts – The Motivation

May 5, 2022

/

static_assert allows you to check at compile time if a type T fulfills the Concept: static_assert(Concept<T>). Before…

TimelineCpp20Concepts

Using Requires Expression in C++20 as a Standalone Feature

April 27, 2022

/

In my last post "Defining Concepts with Requires Expressions", I exemplified how you can use requires…

TimelineCpp20Concepts

Defining Concepts with Requires Expressions

April 20, 2022

/

In my last post, "Define Concepts", I defined the concepts Integral, SignedIntegral, and UnsigendIntegral…

Latest news

A Lock-Free Stack: A Hazard Pointer Implementation Explained IMarch 24, 2025 - 11:37 am
In my last post, I presented a hazard pointer implementation: A Lock-Free Stack: A Hazard Pointer Implementation. Today, I will explain the implementation. MyNode is a class template, parametrized by the type it holds: data. MyNode models the concept Node. template <typename T> concept Node = requires(T a) { {T::data}; { *a.next } -> std::same_as<T&>; […]
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 […]