All Questions
Tagged with c++ memory-management
18
questions with no upvoted or accepted answers
5
votes
0
answers
1k
views
Polymorphic deleter for unique_ptr
There is a basic difference in the way C++ manages the deleter for std::unique_ptr and std::shared_ptr, mainly for allowing ...
4
votes
0
answers
276
views
Simple and safe C++ pool allocator
I have written a simple pool allocator for C++ and I'm looking for ways to improve it, in speed, usability or safety. For example, I don't know how to allocate a buffer larger than the pool size.
<...
4
votes
0
answers
417
views
SoundBoard in C++ Using Qt
I've been working on a soundboard software for tabletop games audio immersion in C++ using Qt. The software consists of 2 tabs who provides to a game master a set of individual sounds or scenes to be ...
4
votes
0
answers
312
views
cross-platform stdlib-only aligned allocator in C++14
I'm writing a program which uses OpenCL, and the OpenCL types are mostly over-aligned. Sometimes when using stl containers with these types, I'd get segfaults, so I tried to write my own aligned ...
3
votes
0
answers
159
views
Custom allocator for improved cache locality and fast iteration in C++
I am writing a custom allocator for my educational game engine project where I need to iterate through a collection of components(similar to Unity3D) every frame. There are game objects and every game ...
3
votes
0
answers
320
views
C++ object pool using C memory pool as base
I started out with this question on Stack Overflow. I have since then gotten an official answer from the mbed developers that the MemoryPool that I was asking about only issued raw C malloc/free type ...
3
votes
0
answers
296
views
A way to automatically reorder struct fields by their sizes in descending order
Using constexpr and preprocessor magic it is possible to cook a struct which have a minimal size between all possible sizes, keeping all the data members properly ...
2
votes
0
answers
48
views
Reusable storage for array of objects V4
Here is a thirdfollow up on Reusable storage for array of objects, Reusable storage for array of objects V2 and Reusable storage for array of objects V3, taking into account the provided answers.
The ...
2
votes
0
answers
101
views
Dynamic heterogeneous container
I want to have dynamic continuous block of memory for different types, that inherit from single base class. I've written structure for that purpose. I know I play with a fire here, but I would like to ...
2
votes
0
answers
108
views
A lightweight version of std::shared_ptr<T> V2
This is a lightweight version of std::shared_ptr<T> called res_ptr<T>
This post is a continuation of:
A lightweight ...
2
votes
0
answers
50
views
Fixed Size Resource Array with Versioned Indexes
I'm trying to implement a fixed sized array that uses versioned keys for dangling safety. This structure is similar to a slot map data structure, with the exception that this does not automatically ...
2
votes
0
answers
319
views
Yet Another Non-Intrusive Reference Counted Smart Pointer Implementation
I needed a reference counted smart pointer for my project, and for some reason early in my project, I decided that I did not like the std::shared_ptr. I can't ...
2
votes
0
answers
195
views
Custom checked_ptr (like std::shared_ptr) for projects without STL
I have written a class to encapsulate pointers for a platform, where the STL is not available. The idea is to have something similar to std::shared_ptr.
However, I ...
2
votes
0
answers
267
views
Fetching a weather report on an Arduino from a web service
I'm writing some code which is basically supposed to http get some information from my own website and parse it, which (finally) works. However, when I compile the code, it shows this:
Sketch uses ...
2
votes
0
answers
423
views
Implementation of a lock-free fixed-sized allocator - follow-up - with commented code
The following implementation of a lock-free fixed-size allocator is a follow-up of:
Implementation of a lock-free fixed-sized allocator
§1 - Introduction
The purpose is self-learning of atomic ...