[Caml-list] ocaml defaut hash ?

[Christophe Raffalli <Christophe.Raffalli@univ-savoie.fr>]

[-- Attachment #1: Type: text/plain, Size: 598 bytes --]


Hello,

I am hashing value of type (bool * int array), where the size of the
array is 8.

According to the documentation, I think all words should be considered
by the default hash function.  Nevertheless, I get the following
histogram for bucket size, showing a lot of collision:

0 -> 9369
1 -> 506
2 -> 3387
3 -> 221
4 -> 1871
5 -> 119
6 -> 594
7 -> 34
8 -> 195
9 -> 16
10 -> 51
11 -> 7
12 -> 11
13 -> 1
14 -> 2

By the way what I really need is a hash function for arrays that I can
update when I update one entry in the array.  Does anyone known of
such a hash function ?

Cheers,
Christophe

[-- Attachment #2: signature.asc --]
[-- Type: application/pgp-signature, Size: 181 bytes --]