Blog

foldingExpressions

std::future Extensions

February 24, 2017

/

Tasks in the form of promises and futures have in C++11 an ambivalent reputation. On the one hand, they…

fpcpp meap.png

And the Winners are

February 20, 2017

/

Mads Ravn, Antonis Polykratis, Martin Mancuska, David Farago, Edgar Rojas, and Adrian Javaloy. Here…

foldingExpressions

Atomic Smart Pointers

February 20, 2017

/

C++20 will have atomic smart pointers. To be exact, we will get a std::atomic_shared_ptr and a std::atomic_weak_ptr.…

Parallel Algorithms of the Standard Template Library

February 19, 2017

/

The idea is quite simple. The Standard Template has more than 100 algorithms for searching, counting,…

timelineCpp17andCpp20

Multithreading with C++17 and C++20

February 16, 2017

/

Forecasts about the future are difficult. In particular, when they are about C++20. Nevertheless, I will…

vectorArithmeticOperatorOverloading

Expression Templates

February 14, 2017

/

Expression templates are "structures representing a computation at compile-time, which are evaluated…

lazy

C++ is Lazy: CRTP

February 12, 2017

/

In my previous post, Recursion, List Manipulation, and Lazy Evaluation, I wrote about the characteristics…

fpcpp meap.png

Six Vouchers to Win

February 10, 2017

/

Ivan Cukic is currently writing a book on "Functional Programming in C++" for Manning Publication. Currently,…

optional

Monads in C++

February 10, 2017

/

Monads in C++? What a strange name for a post. But it's not so strange. With std::optional, C++17 gets…

typeclass

Concepts

February 8, 2017

/

We stay in the year 2020. With high probability, we will get concepts. Of course, waterproof statements…

lazy

The New Ranges Library

February 5, 2017

/

A small-time jump, and we are in the year 2020. C++ will get - as far as the future is predictable -…

foldingExpressions

Fold Expressions

February 4, 2017

/

With fold expressions, you can implement Haskell functions foldl, foldr, foldl1, and foldr1 directly…

Latest news

The Problem with C++ Safety (Part 1): Why “It Works” Isn’t Good EnoughOctober 18, 2026 - 1:58 pm
Rainer Grimm’s blog continues. In this first article of a new series, Klaus Iglberger looks at why C++ is called memory unsafe and argues that the real problem isn’t the language itself, but how we write and teach it.
Small Safety Improvements in the C++ 26 Core LanguageSeptember 22, 2025 - 10:16 am
Safety is an important concern in C++26. Contracts are probably the most important feature for safety. But C++26 has much more to offer. Today, I would like to introduce three small but important improvements in C++26 that solve typical safety issues in C++. Disallow binding a returned reference to a temporary A safety issue can be […]
Contracts: Evaluation SemanticSeptember 8, 2025 - 9:49 am
After briefly presenting the details of contracts in my last article, “Contracts: A Deep Dive“, I would like to take a closer look at the very interesting Evaluation Semantic in today’s article. If a contract assertion occurs, one of the four evaluation semantics is applied: ignore, observe, enforce, or quick-enforce. The table provides an overview […]
Contracts: A Deep DiveAugust 25, 2025 - 9:35 am
I already introduced contracts in the article “Contracts in C++26”. In this article and the next ones, I will dive deeper into the details. In this article, I refer mainly to the excellent proposal “Contracts for C++”. Unfortunately, proposal P2900R14 exceeds 100 pages in length. I will therefore try to summarize the most important points […]
Data-Parallel Types: AlgorithmsAugust 11, 2025 - 8:45 am
The data-parallel types library has four special algorithms for SIMD vectors. The four special algorithms are min, max, minmax, and clamp. min, max, and minmax The two algorithms min and max have in common that they each accept two SIMD vectors and return a SIMD vector. This contains the element-wise minimum or maximum of the […]
Data-Parallel Types: ReductionJuly 28, 2025 - 10:10 am
In this article, I will discuss reduction and mask reduction for data-parallel types. Reduction A reduction reduces the SIMD vector to a single element. The library provides three functions for this purpose: reduce, hmin, and hmax.The following program shows how these functions are used. // reduction.cpp #include <array> #include <experimental/simd> #include <functional> #include <iostream> #include […]