Archive for category: C++ Core Guidelines

cat 633081 1280

C++ Core Guidelines: Surprises with Argument-Dependent Lookup

November 28, 2018

/

There is, in particular, one rule left to template interfaces which are quite interesting: T.47: Avoid…

banner 1183445 1280

C++ Core Guidelines: Regular and SemiRegular Types

November 22, 2018

/

The topic for today is quite important when you create your type: Regular and SemiRegular types. Here…

automatic

C++ Core Guidelines: Template Interfaces

November 8, 2018

/

This post is about template interfaces due to the C++ core guidelines: "...a critical concept", because…

contract

C++ Core Guidelines: Pass Function Objects as Operations

November 1, 2018

/

An interface is a contract between a user and an implementer and should, therefore, be written with great…

fern 821293 1280

C++ Core Guidelines: Definition of Concepts, the Second

October 25, 2018

/

Let me continue with the rules for defining concepts in the guidelines. The first of the three remaining…

definition 390785 1280

C++ Core Guidelines: Rules for the Definition of Concepts

October 12, 2018

/

Although rule T.11 states: Whenever possible, use standard concepts you sometimes have to define your…

dice 3613500 1280

C++ Core Guidelines: Rules for the Usage of Concepts

October 4, 2018

/

We will get concepts with high probability in C++20. Here are the rules from the C++ core guidelines…

roads 320371 1280

C++ Core Guidelines: Better Specific or Generic?

September 18, 2018

/

Concepts revolutionize the way we think about and use generic programming. They didn't make it in C++11…

C++ Core Guidelines: Type Erasure with Templates

September 11, 2018

/

In the last post C++ Core Guidelines: Type Erasure, I presented two ways to implement type erasure: void…

fear

C++ Core Guidelines: Type Erasure

September 6, 2018

/

The rule "T.5: Combine generic and OO techniques to amplify their strengths, not their costs" of…

Latest news

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 […]
Deferred Reclamation in C++26: Read-Copy Update and Hazard PointersJanuary 27, 2025 - 12:23 pm
Before I dive into lock-free programming, there’s a little bit of theory necessary. A common problem in concurrency is the so-called ABA problem. That means you read a variable twice, which returns the same value each time, A. Therefore, you conclude that nothing changed in between. But you forgot the B. Let me first use […]