A WebServer write by C++
-
Updated
May 14, 2019 - C++
A WebServer write by C++
A very fast cross-platform memory pool mechanism for C++ built using a data-oriented approach (3 to 24 times faster than regular new or delete, depending on operating system & compiler)
simple memory pool / thread safe / minimized context switching / Memory managed in 4 levels / Requirements(Windows xp~ / Visualstudio 2015)
A fast and efficient implementation of a MemoryPool<T>.
Dynamic memory pool implementation, for reusable fixed, or variable sized memory blocks, using pthread mutex locks.
A memory pool to allocate short lived buffers of binary data to avoid heap allocations for io such as sockets.
A simple memory pool allocator which is STL compatible. Written in C++
Lockless MemoryPool
A port to D of my Free Pascal "Binary Trees" benchmark implementation, initially written as a self-learning exercise.
ShinyAllocator is a library of a block memory allocator for real-time high-integrity embedded systems.
A port of a combination of the D and C++ ports of my Free Pascal "Binary Trees" benchmark implementation, once again written just out of curiosity to see how they all compare.
A simple allocator based on memory pool to speed up the dynamic allocation of a large number of small blocks and to reduce memory fragmentation.
This is a C++ port of my D port of my Free Pascal "Binary Trees" benchmark implementation, written out of curiosity to see how they compare.
Add a description, image, and links to the memorypool topic page so that developers can more easily learn about it.
To associate your repository with the memorypool topic, visit your repo's landing page and select "manage topics."