Walter Prins wrote:
On 19 July 2012 23:20, Steven D'Aprano wrote:
Selby Rowley-Cannon wrote:
I am using a hash table in a small randomization program. I know that some
hash functions can be prone to collisions, so I need a way to detect
collisions.
This entire question seems like a remarkab
On 19 July 2012 23:20, Steven D'Aprano wrote:
> Selby Rowley-Cannon wrote:
>>
>> I am using a hash table in a small randomization program. I know that some
>> hash functions can be prone to collisions, so I need a way to detect
>> collisions.
> This entire question seems like a remarkable case of
Selby Rowley-Cannon wrote:
I am using a hash table in a small randomization program. I know that
some hash functions can be prone to collisions, so I need a way to
detect collisions.
I doubt that very much.
This entire question seems like a remarkable case of premature optimization.
Start wi
On 7/19/2012 12:29 PM Selby Rowley-Cannon said...
I am using a hash table in a small randomization program. I know that
some hash functions can be prone to collisions, so I need a way to
detect collisions.
The 'hash value' will be stored as a variable. I do not want to check it
against each singu
I am using a hash table in a small randomization program. I know that
some hash functions can be prone to collisions, so I need a way to
detect collisions.
The 'hash value' will be stored as a variable. I do not want to check it
against each singular hash value, as there will be many; I need a w
