|
Boost Users : |
From: Seweryn Habdank-Wojewódzki (habdank_at_[hidden])
Date: 2007-04-11 11:57:58
Hi again
> Joaquín M? López Mu?oz wrote:
>> If you switched to a node-based container like vg. std::list
>> I guess you would actually see some improvement when using the
>> pool allocator.
I have switched to list using fast_pool_allocator and still nothing is
improved. I do not demand any improvement, because algorithm can be slow.
But still I am looking for design guides, when pool allocator will be better
than standard one. Maybe many "erase" operation is a key for success of
pool allocator?
Best regards.
-- |\/\/| Seweryn Habdank-Wojewódzki \/\/
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net