2 commits

Author	SHA1	Message	Date
Bertrand Augereau	a84d1ea78b	The hashmap uses the memorypool for allocating/deallocating its Nodes ... (It is faster and it saves approximately 70kB the DS or other small devices will appreciate having) svn-id: r31321	2008-03-30 06:02:34 +00:00
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