]> On Mon, Jan 20, 2003 at 08:05:38PM +0100, Christoph Bauer wrote: > Hi, > > my program need to calculate a hash key of a matrix (with dimension 8 > x 8). It is necessary that this calculation is very fast, so my > program will update the hash key after every small modification of the > matrix. My problem is that the hash key should be an unsigned int > or an unsigned long in. > > My problem occurs here (Mersenne prime number 2^31-1): > let big_prim = 2147483647 > val big_prim : int = -1 Solution #1 : buy yourself a 64bit box, and you will have integers upto 2^63-1 :))) Solution #2 : Use the Int64 module. Solution #3 : Use the ocaml bignum module. Friendly, Sven Luther ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners