Blog

TimelineCpp20Concepts

Concepts in C++20: An Evolution or a Revolution?

February 7, 2020

/

Let me conclude my series to concepts with this meta-post. Are concepts an evolution or a revolution…

TimelineCpp20Concepts

C++20: Define the Concept Regular and SemiRegular

January 30, 2020

/

When you want to define a concrete type that works well in the C++ ecosystem, you should define a type…

TimelineCpp20Concepts

C++20: Define the Concepts Equal and Ordering

January 24, 2020

/

In my last post, I defined the concept Equal. Now, I go one step further and use the concept Equal to…

TimelineCpp20Concepts

C++20: Define Concepts

January 17, 2020

/

With this post, I start my last fascinating topic to concepts: define your concepts. Consequentially,…

TimelineCpp20Concepts

C++20: Concepts – Predefined Concepts

January 10, 2020

/

C++20 has many predefined concepts. Consequentially, before you define your concept, you should know…

TimelineCpp20Concepts

C++20: Concepts – What we don’t get

December 20, 2019

/

The Template Introduction from the Concepts TS is a new way to use concepts. This syntactic variant is…

TimelineCpp20Concepts

C++20: Concepts – Syntactic Sugar

December 13, 2019

/

Today, my post is not about something new to concepts. It's about syntactic sugar. I write about abbreviated…

null pointer

A Brief Overview of the PVS-Studio Static Code Analyzer

December 6, 2019

/

During one of C++Russia conferences, I got acquainted with the team, developing the PVS-Studio code…

TimelineCpp20Concepts

C++20: Concepts, the Placeholder Syntax

December 6, 2019

/

Today, I have a simple answer to a challenging question: Where can I use my concept? Concepts can be…

TimelineCpp20Concepts

C++20: Concepts, the Details

November 29, 2019

/

In my last post, C++20: Two Extremes and the Rescue with Concepts, I gave the first motivation for concepts.…

TimelineCpp20Concepts

C++20: Two Extremes and the Rescue with Concepts

November 21, 2019

/

I finished my overview of C++20 in the last post. Now, it's time to dive into the details. What can be…

TimelineCpp20Concurrency

C++20: Concurrency

October 29, 2019

/

This post concludes my overview of C++20. Today's post is about the concurrency features in the next…

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