A memory pool to allocate short lived buffers of binary data to avoid heap allocations for io such as sockets.
-
Updated
Apr 8, 2018 - C++
A memory pool to allocate short lived buffers of binary data to avoid heap allocations for io such as sockets.
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 core blockchain build with python and flask framework for frontend. Some of the components are private and public key, transaction, mine, memory pool, fee calculation, target difficulty, peer-2-peer network, broadcast blocks, resolve conflicts, UTXOS etc.
A very simple implementation of memory pool; expands automatically if pool is full;
Winsock-Multi-Client-Server
[]bytes manager using a bump-the-pointer allocator.
A port to D of my Free Pascal "Binary Trees" benchmark implementation, initially written as a self-learning exercise.
very simple C++ heterogeneous memory pool with thread safety
Cross platform memory management based on C++
基于C++11的STL标准库
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.
This repository consists of Project on High Performance Linked Lists.
Fast and effective memory pool allocator for C / C++
Add a description, image, and links to the memory-pool topic page so that developers can more easily learn about it.
To associate your repository with the memory-pool topic, visit your repo's landing page and select "manage topics."