|
Boost : |
Subject: Re: [boost] [hash] regular behaviour of hash function for double values
From: Topher Cooper (topher_at_[hidden])
Date: 2012-02-01 16:32:36
On 2/1/2012 4:01 PM, Daniel James wrote:
> On 1 February 2012 20:15, Topher Cooper<topher_at_[hidden]> wrote:
>
>> On 2/1/2012 3:59 AM, Daniel James wrote:
>>
>>> The STL hash containers are pretty much required to be implemented
>>> using a chained hash table.
>>>
> Note that I said 'pretty much required', not 'required'.
>
>
>> I've seen that claim, and I might well be missing something, but I believe
>> that coalesced hashing would also work.
>>
> Container elements can be uncopyable and unmovable.
Ah, I did miss that, but it just means that the underlying table include
indirection as open chaining generally does intrinsically (I say
generally, because it is possible to implement open chaining if that
were not a requirement with the first entry contained in the table).
Topher Cooper
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk