Tag Archive for: type-traits

Posts

TimelineCpp20Concepts

Defining Concepts with Requires Expressions

April 20, 2022

/

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

templatesTypeTraits

The Type-Traits Library: Optimization

December 17, 2021

/

The type-traits library has two main goals: correctness and optimization. Today, I write about optimization. This…

templatesTypeTraits

The Type-Traits Library: Correctness

December 8, 2021

/

The two main goals of the type-traits library are compelling: correctness and optimization. Today, I…

templatesTypeTraits

The Type-Traits Library: std::is_base_of

December 3, 2021

/

I finished the last article on the Type-Traits library with the challenge of explaining the std::is_base_of…

templatesTypeTraits

The Type-Traits Library: Type Comparisons

November 26, 2021

/

In my last post, "The Type-Traits Library: Type Checks" I introduced type checks at compile time with…

templatesTypeTraits

The Type-Traits Library: Type Checks

November 18, 2021

/

The type-traits library is part of C++11 and supports type checks, type comparisons, and type modifications…

TypeTraits

C++ Core Guidelines: Programming at Compile Time with Type-Traits (The Second)

January 24, 2019

/

The type-traits library supports type checks, type comparisons, and type modifications at compile time.…

TypeTraits

C++ Core Guidelines: Programming at Compile Time with the Type-Traits

January 17, 2019

/

My journey through programming at compile time began in the last posts with template metaprogramming.…

ContainerVersusElement

Type-Traits: Performance Matters

November 21, 2016

/

If you look carefully, you see type-traits have a big optimization potential. The type-traits support…

compare

Compare and Modify Types

October 20, 2016

/

The type-traits library empowers you to compare and modify types. All is done at compile time therefore,…

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