I've done a test with boost::intrusive::list and boost::object_pool. The boost's intrusive list is faster than mine, so I am going to use it. But the object_pool is noticeably slower, as it is not intrusive: each time a chunk is removed from the pool, the internal table is searched, one by one, to locate the pool's entry. Joaquín Mª López Muñoz wrote:
Achilleas Margaritis ha escrito:
I think std::list is slower than my list (I could be wrong of course), because it allocates memory from the heap for each node, whereas my list requires the elements to have the node embedded in them, and so blocks are also nodes.
Maybe you can then replace your private intrusive list with Boost.Intrusive:
http://igaztanaga.drivehq.com/intrusive
which is already included in the SVN trunk.
Joaquín M López Muñoz Telefónica, Investigación y Desarrollo
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost