Archive for category: C++17

Table of Content

March 22, 2023

/

Special Allocators with C++17

October 2, 2023

I introduced in my last post "Polymorphic Allocators with C++17" the theory of polymorphic allocators…

Polymorphic Allocators in C++17

September 25, 2023

This post starts a miniseries about an almost unknown feature in C++17: polymorphic allocators. I often…

C++ Parallel STL Benchmark

August 14, 2023

Today, I'm happy to present a guest post from Victor J. Duvanenko about my favorite C++17 feature: the…

timelineParallelSTL

Performance of the Parallel STL Algorithms

July 22, 2021

/

In my last post, "Parallel Algorithms of the STL with the GCC Compiler", I presented the necessary theory…

timelineParallelSTL

Parallel Algorithms of the STL with the GCC Compiler

July 16, 2021

/

GCC supports my favorite C++17 feature: the Standard Template Library (STL) parallel algorithms. I recognized…

C++17: Improved Associative Containers and Uniform Container Access

May 7, 2017

/

C++11 has eight associative containers. With C++17, you can more comfortably insert new elements into…

timeline

C++17: New Parallel Algorithms of the Standard Template Library

May 1, 2017

/

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

timeline

C++17 has a Visitor

April 23, 2017

/

What have std::optional, std::any, and std::variant in common? You can construct them in place. But that…

timeline

C++17 – Avoid Copying with std::string_view

April 16, 2017

/

The purpose of std::string_view is to avoid copying data already owned by someone else and of which only…

timeline

C++17- std::byte and std::filesystem

April 10, 2017

/

My post, C++17 - What's New in the Library, was fine for the first overview. Today, I will look deeper…

Latest news

Special Allocators with C++17October 2, 2023 - 8:35 am
I introduced in my last post “Polymorphic Allocators with C++17” the theory of polymorphic allocators in C++17. Today, I will apply the theory. Before I go on, here are the essential parts of my last post: “Polymorphic Allocators with C++17“. A Short Reminder The following program uses polymorphic allocators. // polymorphicAllocator.cpp #include <array> #include <cstddef> […]
Polymorphic Allocators in C++17September 25, 2023 - 7:43 am
This post starts a miniseries about an almost unknown feature in C++17: polymorphic allocators. I often promised that I would write about polymorphic allocators. Today, I fulfill my promise. Since C++98, you can fine-tune memory allocation in general but also for user-defined types or containers of the standard library. For example, the containers of the […]
C++23: Ranges Improvements and std::generatorSeptember 18, 2023 - 9:28 am
C++20 does not provide concrete coroutines, but C++20 provides a framework for implementing coroutines. This changes with C++23. std::generator is the first concrete coroutine. std::generator is part of the extension of the ranges library in C++23. So, let me start this post with the ranges library in C++20 and its extension in C++23. I will […]
The Final Version of my C++20 BookSeptember 13, 2023 - 7:10 pm
I have given many C++20 classes in the last two years and improved my C++20 knowledge. Consequentially, I updated my C++20 book. This update includes restructured chapters, more detailed information, and additional examples. The book now has almost 700 pages and more than 200 examples. This issue is the final one. I’m done and will […]
C++23: A Multidimensional ViewSeptember 11, 2023 - 6:26 pm
A std::mdspan is a non-owning multidimensional view of a contiguous sequence of objects. The contiguous sequence of objects can be a plain C-array, a pointer with a size, a std::array, a std::vector, or a std::string. Often, this multidimensional view is called a multidimensional array. The number of dimensions and the size of each dimension determine […]
C++23: Four new Associative ContainersSeptember 4, 2023 - 6:51 am
The four associative containers std::flat_map, std::flat_multimap, std::flat_set, and std::flat_multiset in C++23 are a drop-in replacement for the ordered associative containers std::map, std::multimap, std::set, and std::multiset. We have them for two reasons in C++23: memory consumption and performance. With C++23, we have 12 associative Containers. Twelve? Right! Now, I need a systematic and start with the […]