Tag Archive for: Concepts

Posts

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…

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…

TimelineCpp20Concepts

Define Concepts

April 12, 2022

/

There are two ways to define a concept: You can combine existing concepts and compile-time predicates,…

A std::advance Implementation with C++98, C++17, and C++20

March 31, 2022

/

In my last post, I presented a possible std::advance implementation based on tag dispatching. One of…

AutomaticReturnType

Automatic Return Type (C++11/14/20)

October 21, 2021

/

I started my discussion about the "Automatic Return Type (C++98)" in my last post. Today, I'm faced…

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…

Latest news

Data-Parallel Types – A First ExampleJune 25, 2025 - 4:01 pm
After providing a theoretical introduction to the new C++ 26 feature in my last article, “Data-Parallel Types (SIMD),” I would like to follow up today with a practical example. The following introductory example is from the experimental implementation of the SIMD library. This functionality has been fully adopted in the C++ 26 draft under the […]
Data-Parallel Types (SIMD)June 16, 2025 - 10:24 am
The data-parallel types (SIMD) library provides data-parallel types and operations on them. Today, I want to take a closer look at this. Before diving into the new library, I would like to take a moment to discuss SIMD. SIMD Vectorization refers to the SIMD (Single Instruction, Multiple Data) extensions of a modern processor’s instruction set. […]
Read-copy-update (RCU)June 2, 2025 - 9:54 am
Read-copy-update is strong in multithreading environments where a data structure is read almost exclusively but rarely written. First of all, what is RCU? The excellent Wikipedia page on Read-copy-update provides a good introduction: In computer science, read-copy-update (RCU) is a synchronization mechanism that avoids the use of lock primitives while multiple threads concurrently read and […]
atomic<shared_ptr<>> by Oliver SchädlichMay 19, 2025 - 9:11 am
This blog article is an experiment. A few days ago, I received the following email (translated from German) from Oliver Schädlich (oliver.schaedlich@gmail.com). If, as I hope, this article sparks a discussion, I will be happy to summarize it in my last article. Please send an email to: Rainer.Grimm@ModernesCpp.de. I just read your latest article on […]
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 […]