array_pool Struct Reference
Allocator implementations

## Detailed Description

Tag type defining a memory pool optimized for arrays.

It keeps the nodes ordered inside the free list and searches the list for an appropriate memory block. Array allocations are still pretty slow, if the array gets big enough it can get slower than `new`. Node allocations are still fast, unless there is deallocation in random order.

Note
  Use this tag type only if you really need to have a memory pool!

## Typedefs

using | type = detail::array_free_memory_list