Re: [boost] [pool2] Requests for comment

Hi Etienne, The problem of the returning the unused memory , in the allocation / deallocation of fixed size elements, it's well resolved in the suballocators of the countertree library. It permit a fast allocation and deallocation with a fast detection of the unused chucks of memory. You can find it in : http://dl.dropbox.com/u/8437476/works/countertree/doc/index.html You have an explanation of the algorithm used in the point 5.2 of the documentation. If I can help you in any question , please , say me, and I will try. Sincerely yours Francisco Tapia