Tag Archive for: Smart Pointers

Posts

Table of Content

March 22, 2023

0 Comments

std::unique_ptr

December 9, 2016

0 Comments

According to the RAII idiom, a std::unique_ptr manages automatically and exclusively the lifetime of…

Memory and Performance Overhead of Smart Pointers

December 6, 2016

0 Comments

C++11 offers four different smart pointers. I will have a closer look in this post regarding memory and…

Careful Handling of Resources

December 5, 2016

0 Comments

The careful handling of resources - may it be, for example, memory, files, or sockets - is a key concern…

Latest news

A Priority Scheduler for CoroutinesNovember 27, 2023 - 12:49 pm
In this post, I will extend the straightforward scheduler from Dian-Lun with priorities. This is the third post in my mini-series about schedulers for C++ coroutines. The first two posts were guest posts by Dian-Lun Lin: Dian-Lun’s schedulers were based on the container adaptor std::stack and std::queue. The std::stack schedules its tasks according to its […]
Coroutines: A Scheduler for Tasks by Dian-Lun LinNovember 20, 2023 - 10:44 am
The last post “A Concise Introduction to Coroutines by Dian-Lun Lin” provide the theory. Today, Dian-Lun presents his single-threaded scheduler for C++ coroutines. This post assumes you are familiar with the previous post “A Concise Introduction to Coroutines by Dian-Lun Lin“. A Single-threaded Scheduler for C++ Coroutines In this section, I implement a single-threaded scheduler […]
A Concise Introduction to Coroutines by Dian-Lun LinNovember 13, 2023 - 11:11 am
Today, I will start a miniseries about a scheduler for tasks. The starting point of this miniseries is a straightforward scheduler by Dian-Lun Lin that becomes increasingly sophisticated. I have already written around 15 posts about coroutines. They explain the theory about coroutines and apply this theory in various ways. However, I still fight for […]
The Ranges Library in C++20: More Design ChoicesNovember 6, 2023 - 8:27 am
The ranges library in C++20 made due to performance reasons a few unique design choices. These choices have consequences: cache issues and constness issues. Here is a short reminder. In my last post, “The Ranges Libray in C++20: Design Choices“, I presented this possible implementation of std::ranges::filter_view: if constexpr (!ranges::forward_range<V>) return /* iterator */{*this, ranges::find_if(base_, […]
The Ranges Library in C++20: Design ChoicesOctober 30, 2023 - 9:15 am
Thanks to the ranges library, working with the Standard Template Library (STL) is much more comfortable and powerful. First of all, the algorithms of the ranges library are lazy, can work directly on the container, and can be composed. Additionally, the ranges library made a few unique design choices, you must know. Before I dive […]
C++20: More Details about Module Support of the Big ThreeOctober 23, 2023 - 7:43 am
In my last post, “C++20: Module Support of the Big Three“, I compiled a simple module with the Big Three. Today, I drill deeper using the GCC, Clang, and Microsoft Compiler. Honestly, this post will be pretty technical and end with a curious note. Additionally, it requires basic modules knowledge. If you don’t have it, […]