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
Sorted list
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2007-08-04 (15:36)
From: skaller <skaller@u...>
Subject: Re: [Caml-list] Sorted list
On Sat, 2007-08-04 at 16:37 +0200, wrote:

> It seems dificult to generate an unique identifier, for this subject
> or any other (in this sense, I feel nostalgic of the old C pointers). 
> An integer counter could be valid, but, when the counter reaches the
> maximum, the counter needs to return to "0". From now on, before to
> return a new identifier, it should be checked if this value is already
> in use. And that means O(n).
> I do not see solution for that.

Use the date + time + fresh integer modulo something big enough
you know the if the CPU count that fast, your timer queue runs out
of memory .. :)

John Skaller <skaller at users dot sf dot net>
Felix, successor to C++: