Tag Archive for: Memory

Posts

weakPtr

std::weak_ptr

December 14, 2016

/

std::unique_ptr models the concept of exclusive ownership, std::shared_ptr the concept of shared ownership.…

enabledShared

Specialities of std::shared_ptr

December 12, 2016

/

After I draw the big picture of a std::shared_ptr in the last post, I want to present two special aspects…

sharedPtr

std::shared_ptr

December 11, 2016

/

std::shared_ptr's share the resource. The shared reference counter counts the number of owners. Copying…

uniquePtr

std::unique_ptr

December 9, 2016

/

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

comparisonEng

Memory and Performance Overhead of Smart Pointers

December 6, 2016

/

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

RessourcenmanagementEng

Careful Handling of Resources

December 5, 2016

/

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

Latest news

std::execution: SenderDecember 16, 2024 - 11:25 am
std::execution offers three types of senders: factories, adapters, and consumers. I’ll take a closer look at these today. Most of the following content is from proposal P2300R10. I will try to represent it more concisely. Sender Factory A sender factory is an algorithm that takes no senders as parameters and returns a sender. execution::schedule execution::sender […]
std::execution: Composition of SendersDecember 9, 2024 - 10:25 am
Most sender adaptors are composable using the pipe operator. Let me start with a simple example of composition with the pipe operator. Instead of the nested function calls call1(call2(input)) you can write call1 | call2(input) or even: input | call1 | call2 Function composition Okay, this example was straightforward. Let’s do something more complicated. Proposal […]
std::execution: Inclusive ScanDecember 2, 2024 - 10:30 am
Inclusive scan solves problems related to range queries, such as calculating the sum of a range of elements in an array. It is also used in range minimum queries and various other algorithms. Before I present the asynchronous inclusive scan, I introduce the inclusive scan, aka prefix sum. Prefix Sum In computer science, the prefix […]
std::execution: Asynchronous AlgorithmsNovember 25, 2024 - 9:06 am
std::execution supports many asynchronous algorithms for various workflows. Presenting proposal P2300R10 is not easy. First, it is very powerful, and second, it is very long. Therefore, I concentrate on specific aspects of the proposal. What are the priorities of this proposal? Priorities The terms execution resource, execution agent, and scheduler are essential for the understanding […]
std::executionNovember 18, 2024 - 9:03 am
std::execution, previously known as executors or Senders/Receivers, provides “a Standard C++ framework for managing asynchronous execution on generic execution resources“. (P2300R10) Side Note Change of plans. My original plan was to present the C++26 library after the core language. However, the implementation status of the library is not good enough. Therefore, I decided to continue […]
C++26 Core Language: Small ImprovementsNovember 4, 2024 - 8:34 am
There are more small improvements in the C++26 language, which you should know. static_assert extension First, here’s the syntax of static_assert in C++11: static_assert(compile time predicate, unevaluated string) With C++26, the string can be a user-defined type having the following properties: static_assert can now be used with a format string. Here’s a nice example from […]