On Mon, Apr 13, 2015 at 3:22 PM, Thomas Helland
wrote:
>
> On 14 Apr 2015 00:05, "Jason Ekstrand" wrote:
>>
>> On Sat, Apr 11, 2015 at 4:25 PM, Thomas Helland
>> wrote:
>> > The same rationale applies here as for the hash table.
>> > Power of two size should give better performance,
>> > and usi
On Sat, Apr 11, 2015 at 4:25 PM, Thomas Helland
wrote:
> The same rationale applies here as for the hash table.
> Power of two size should give better performance,
> and using the algorithm hash = sh + i/2 + i*i/2
> should result in only distinct hash values when hitting collisions.
>
> Difference
