|
Boost : |
From: scleary_at_[hidden]
Date: 2002-11-11 11:30:17
> -----Original Message-----
> From: Bohdan [mailto:warever_at_[hidden]]
>
> <scleary_at_[hidden]> wrote in message
> news:22602E7E3B92D411969B0090273CC28B1D235F_at_[hidden]
> 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
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk