Commit graph

1 commit

Author SHA1 Message Date
Bertrand Augereau
411a588850 Introduction of a fixed size memory pool with a typical free list implementation
+ : amortized O(1) allocation, O(1) deallocation, less overhead per allocation
- : unused memory is not reclaimed until death or manual invocation of a function

svn-id: r31320
2008-03-30 05:42:39 +00:00