# Pool Allocator Sample

This sample contains a simple pool allocator that can provide blocks of fixed size
very efficiently.

The allocator allocates the entire memory at initialization time. Then, each
each allocation/free operation is a simple, O(1) operation that removes/adds an
an item to the free blocks linked list.


# Source Code

The Pool Allocator in this sample is a modified version of the Pool Allocator
in the following project:  https://github.com/mtrebi/memory-allocators

It has the following main modifications:
 - Use mmap/munmap instead of malloc/free.
 - Use union as StackLinkedList::Node type.
 - Fix crash at out-of-bounds pop().
