Boost logo

Boost :

Subject: Re: [boost] [pool2] Requests for comment
From: DUPUIS Etienne (e.dupuis_at_[hidden])
Date: 2012-10-12 03:43:51

Hi Francisco,

> 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 :
> 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.

If I understand correctly, the current pool implementation did not fulfill your needs (both in terms of functionality and performance), and thus you implemented suballocators in the countertree library ?


Ce message et toutes les pièces jointes sont confidentiels et établis à l'intention exclusive de ses destinataires. Toute modification, édition, utilisation ou diffusion non autorisée est interdite. Si vous avez reçu ce message par erreur, merci de nous en avertir immédiatement. ATEME décline toute responsabilité au titre de ce message s'il a été altéré, déformé, falsifié ou encore édité ou diffusé sans autorisation.
This message and any attachments are confidential and intended solely for the addressees. Any unauthorized modification, edition, use or dissemination is prohibited. If you have received this message by mistake, please notify us immediately. ATEME decline all responsibility for this message if it has been altered, deformed, falsified or even edited or disseminated without authorization.

Note: To protect against computer viruses, e-mail programs may prevent sending or receiving certain types of file attachments.

Boost list run by bdawes at, gregod at, cpdaniel at, john at