Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] int hash
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: skaller <skaller@u...>
Subject: [Caml-list] int hash
I'm currently using a lot of hashtables with
sequentially allocated integers as keys.

It occurs to me a custom hash function just
masking in the low n bits would be a good hash
function, and very fast, assuming n is chosen
suitably and related somehow to the table
size. (size=2^n?) .. any comments on the performance
of a hashtable with such a hash function?

John Skaller,
voice: 061-2-9660-0850, 
snail: PO BOX 401 Glebe NSW 2037 Australia
Checkout the Felix programming language

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: