Hello, maybe you could use a hash function (or unique identifier) that has lower probability of random conflicts than the probability of random RAM errors :).
Just joking, with computers, you can be never sure, so "almost sure" is usually good enough if it's just a matter of trying it again. (Btw, in my father's work, SAP got down because it sent the time 24:00 to the database :D, it happens rarely but happens.) I believe http://tools.ietf.org/html/rfc4122 is one of the possible ways to go :). Pavel On Wed, 13 Aug 2008 16:30:38 +0200 "Remko Tronçon" <[EMAIL PROTECTED]> wrote: > > How hard is it to generate a UUID or SHA hash? I suppose not all > > clients have access to such utilities... > > It's not generating the hash that was bothering me at the time, it was > more that the hash is not unique in theory, and that you would still > need to have conflict checking code in case it wasn't. But I guess the > likelihood of that happening is immensely close to zero, and if you > have a timestamp in there, it would be even closer to zero happening > twice in a row (i.e. the "Why didn't this work? I must have done > something wrong, let me try again"). So I suppose I should learn to > live with imperfection ;-) > > cheers, > Remko -- Web: http://www.pavlix.net/ Jabber & Mail: pavlix(at)pavlix.net OpenID: pavlix.net
