Re^3: Non-Repetitive Random Numbers

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.

> 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)
[download]

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)

Cheers Rolf

( addicted to the Perl Programming Language)

Comment on Re^3: Non-Repetitive Random Numbers Select or Download Code

Replies are listed 'Best First'.
Re^4: Non-Repetitive Random Numbers by BrowserUk (Patriarch) on Apr 05, 2013 at 15:24 UTC
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 ... With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday' Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error. "Science is about questioning the status quo. Questioning authority". In the absence of evidence, opinion is indistinguishable from prejudice.	[reply]

Replies are listed 'Best First'.

Re^4: Non-Repetitive Random Numbers
by BrowserUk (Patriarch) on Apr 05, 2013 at 15:24 UTC

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 ...

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority".

In the absence of evidence, opinion is indistinguishable from prejudice.