Browse thread
range of hash function
- Grégoire_Seux
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: | 2010-02-20 (08:54) |
From: | Grégoire_Seux <kamaradclimber@g...> |
Subject: | range of hash function |
hello ! i would like to use the polymorhpic hash function on strings. But i would like to know what is the probability of a collision between two hashes. my first question is about the range of the Hashtbl.hash function: what is its range ? ( string -> [1..N] ?) the second question is : can i assume that the result is a uniform distribution over [1..N] ? (for 10ⶠwords which is an estimation of the english vocabulary size) the third one is : is it possible to predict which will be the collision ? I mean collisions are between words which are very 'similar' (for ex: "boy" and "boys") or are completely unpredictable. thanks ! -- Grégoire Seux