Re^3: Non-Repetitive Random Numbers

[LanX]

I don't understand your point (and I'm too much in a hurry ATM to investigate your code)

Keys of a hash are always unique, in my code collisions of random numbers are simply ignored.

update

> That doesn't guarantee unique values.

maybe this is clearer:

  DB<107> $seen{int rand 10}=1 for 1 .. 1000000
 => ""

  DB<108> keys %seen
 => (6, 3, 7, 9, 2, 8, 1, 4, 0, 5)

update

one could argue that the order of hash -keys isn't random but that wasn't part of the question.

Otherwise thats a good occasion to use shuffle or pushing into an array (but this implies reseeding rand every time)

[BrowserUk]

Keys of a hash are always unique,

You're right of course.

I was thinking about an iterator which would need to check whether a value had been seen before but ...