Blog

optional

Monads in C++

February 10, 2017

/

Monads in C++? What a strange name for a post. But it's not so strange. With std::optional, C++17 gets…

typeclass

Concepts

February 8, 2017

/

We stay in the year 2020. With high probability, we will get concepts. Of course, waterproof statements…

lazy

The New Ranges Library

February 5, 2017

/

A small-time jump, and we are in the year 2020. C++ will get - as far as the future is predictable -…

foldingExpressions

Fold Expressions

February 4, 2017

/

With fold expressions, you can implement Haskell functions foldl, foldr, foldl1, and foldr1 directly…

CharakteristikRecursionEng

Recursion, List Manipulation, and Lazy Evaluation

February 1, 2017

/

The remaining three characteristics of functional programming are told quite quickly: Recursion, manipulation…

Pure Functions

January 30, 2017

/

Pure functions are pretty similar to mathematical functions. They are the reason that Haskell is called…

CharakteristikeImmutableDataEng

Immutable Data

January 28, 2017

/

A key to purely functional languages is that their data are immutable. Therefore, assignments such as…

Higher-Order Functions

January 26, 2017

/

Higher-order functions are the pendant to First-Class Functions because higher-order functions can take…

CharakteristikenFunktionaleProgrammierungFirstClassFunctionsEng

First-Class Functions

January 24, 2017

/

One of the characteristics of functional programming is first-class functions. First-class functions…

CharakteristikenFunktionaleProgrammierungEng

The Definition of Functional Programming

January 23, 2017

/

The definition of functional programming is relatively easy. Functional programming is programming with…

timeline.FunktionalInCpp17Cpp20Eng

Functional in C++17 and C++20

January 21, 2017

/

Which functional feature can we expect with C++17, and for which functional feature can we hope with…

timeline.FunktionalInCpp11Cpp14Eng

Functional in C++11 and C++14: Dispatch Table and Generic Lambdas

January 19, 2017

/

My favorite example, the dispatch table, shows how nicely the features in modern C++ work together. A…

Latest news

Hazard Pointers in C++26May 5, 2025 - 11:12 am
Hazard pointers provide garbage collection in C++ and solve the ABA problem. First of all. What is a hazard pointer? Proposal P2530R3 gives a nice explanation: A hazard pointer is a single-writer multi-reader pointer that can be owned by at most one thread at any time. Only the owner of the hazard pointer can set […]
A Lock-Free Stack: A Hazard Pointer Implementation Explained IIApril 7, 2025 - 11:11 am
In my last post, I started to explain a hazard pointer implementation: A Lock-Free Stack: A Hazard Pointer Implementation Explained I. Today, I will continue to explain the implementation. The Retire List The retire list has the public member functions isInUse, addNode, and deleteUnusedNodes. Additionally, it has the inner class RetireNode, an atomic member of […]
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 […]