I would like to know how to adapt section 11.14 of the C++-FAQ-lite to arrays. Basically, I would want something like this: class Pool { public: void* allocate(size_t size) {...} void deallocate(void* p, size_t size) {...} }; void* operator new[](size_t size, Pool& pool) { return pool.allocate(size); } void operator delete[](void*...
I'm implementing a memory pool in C for a real time application. A container data structure is used by the real time thread of the program to process a specific type of data which it needs to add and remove from the container. The implementation of the container is designed so each instance has its own personal memory pool. (Although the...
I have heard the term before and I would like to know how to design and code one. Should I use the STL allocator if available? How can it be done on devices with no OS? What are the tradeoffs between using it and using the regular compiler implemented malloc/new? ...
Hello, In our C# (.NET 4.0) application, we allocate and de-allocate a lot of memory, in different size chunks. We want to move to an object pool, to improve performance. We implemented an object pool already and saw some performance improvement. We're currently using a stack-based backing store. Other possible alternatives are, queue ...