> -----Original Message----- > From: Bohdan [mailto:warever@;mail.i.com.ua] > > <[EMAIL PROTECTED]> wrote in message > news:22602E7E3B92D411969B0090273CC28B1D235F@;cecexchange.cec.je > rviswebb.com... > > As John pointed out, you're not going to see much benefit (if any) when the > > standard library contains a pool allocator itself (as does STLport and > > glibc). > > All boost::pool library is about allocation of small objects > of the same size. I'm just curious how malloc can be > accelerated if it handles different size allocations?
Recommended reading: http://gee.cs.oswego.edu/dl/html/malloc.html Doug Lea's malloc uses a technique he calls "binning", which is pool-based support for chunks of certain sizes. -Steve _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost