Archive for category: C++26

std::execution: Composition of Senders

December 9, 2024

Most sender adaptors are composable using the pipe operator. Let me start with a simple example…

std::execution: Inclusive Scan

December 2, 2024

Inclusive scan solves problems related to range queries, such as calculating the sum of a range of elements…

std::execution: Asynchronous Algorithms

November 25, 2024

std::execution supports many asynchronous algorithms for various workflows. Presenting proposal…

std::execution

November 18, 2024

std::execution, previously known as executors or Senders/Receivers, provides “a Standard C++ framework…

C++26 Core Language: Small Improvements

November 4, 2024

There are more small improvements in the C++26 language, which you should know. static_assert…

Placeholders and Extended Character Set

October 28, 2024

Placeholders are a nice way to highlight variables that are no longer needed. Additionally, the character…

Contracts in C++26

October 21, 2024

Contracts allow you to specify preconditions, postconditions, and invariants for functions. Contracts…

Reflection in C++26: Determine the Layout

October 14, 2024

Thanks to reflection, you can determine the layout of types. My examples are based on the reflection…

Reflection in C++26: Metafunctions for Enums and Classes

October 7, 2024

Today, I continue my journey through reflection in C++26 and play with enums and classes. The…

Reflection in C++26: Metafunctions

September 30, 2024

Reflection offers many metafunctions that run at compile time. The metafunctions are declared…

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