Subject: Re: [boost] unordered_map 32bit VS 64bit
From: Daniel James (dnljms_at_[hidden])
Date: 2012-02-07 07:31:54
On 6 February 2012 09:10, Avikam Bara-nes <avikamb_at_[hidden]> wrote:
> Sorry but I"m a bit confuse,
> 1. What should I do ?
> 2. Is there a solution ?
> 3. Is there a workaround ?
I'm going to try to do something about this for 1.50 (i.e. to be
released in 3 or 4 months). I tried gcc 4.7's implementation and it's
pretty similar to boost 1.46, a tad faster at lookup. Your benchmark
might perform better but it wouldn't if you always look up different
values (as you would in real code). I don't know about libc++ or
Visual C++'s implementation.
If you can't wait for 1.50 then your best bet is to use something like
google's dense hash containers, and try to make sure your hash
function works well with them. Or if you feel like being brave, I'll
add the new version to trunk around the time 1.49 is released.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk