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 mailing list
Boost-users@???
http://lists.boost.org/mailman/listinfo.cgi/boost-users
