Simple Segregated Storage. More...
Classes | |
class | boost::simple_segregated_storage< SizeType > |
Simple Segregated Storage is the simplest, and probably the fastest, memory allocation/deallocation algorithm. More... | |
Namespaces | |
boost | |
Duration formatting facet for input. | |
Macros | |
#define | BOOST_POOL_VALIDATE_INTERNALS |
Simple Segregated Storage.
A simple segregated storage implementation: simple segregated storage is the basic idea behind the Boost Pool library. Simple segregated storage is the simplest, and probably the fastest, memory allocation/deallocation algorithm. It begins by partitioning a memory block into fixed-size chunks. Where the block comes from is not important until implementation time. A Pool is some object that uses Simple Segregated Storage in this fashion.
#define BOOST_POOL_VALIDATE_INTERNALS |
Referenced by boost::simple_segregated_storage< SizeType >::add_block(), boost::simple_segregated_storage< SizeType >::add_ordered_block(), boost::simple_segregated_storage< SizeType >::BOOST_PREVENT_MACRO_SUBSTITUTION(), boost::simple_segregated_storage< SizeType >::free_n(), boost::simple_segregated_storage< SizeType >::malloc_n(), boost::simple_segregated_storage< SizeType >::ordered_free(), and boost::simple_segregated_storage< SizeType >::ordered_free_n().