Hi Darin! :-)

 PS>> Sure, but what's a good hash for random numbers? ;)
 DM> Not that I'm an expert or anything, but I would assume that if you 
 DM> created an array that is the prime number equal to either the size of 
 DM> the list, or the next prime number after that, and then just used % 
 DM> to come up with the entry, you stand a pretty good chance of few 
 DM> collisions.
You're right, sounds like a very good approach.

Ciao
Pascal

--- Msged/LNX 6.1.1