>> reserve(). But if you are allocating same-size blocks then there is a
>> quality memory pool in boost. It is hidden in one of the "details"
>> directories, but I've been using it for a long time for my Chain class.
>
> Here's a link to the documentation of that library:
> http://boost.org/libs/pool/doc/index.html
In my tests (on a tactical search test suite, i.e. realistic usage) the
following was quicker than either the standard boost pool or my own
custom implementation (which was based on item 10 in Effective C++):
#define BOOST_DISABLE_THREADS 1
#define BOOST_QA_PAGE_SIZE 1024*1024
#include <boost/detail/quick_allocator.hpp>
Usage is trivial:
class Chain{
...
void* operator new(std::size_t sz){
return boost::detail::quick_allocator<Chain>::alloc(sz);
}
void operator delete(void *p,std::size_t sz){
boost::detail::quick_allocator<Chain>::dealloc(p,sz);
}
...
};
The above are the only changes to source code required.
There is one downside, which is that the pool cannot be released even
when the program shuts down. That means valgrind will complain. So I use
the above in release mode, and standard new/delete operators in debug mode.
If using threads the claim of which is quicker may be different.
Darren
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
