Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re^2: Truly randomized keys() in perl 5.17 - a challenge for testing?

by davido (Cardinal)
on Sep 30, 2013 at 16:50 UTC ( [id://1056388]=note: print w/replies, xml ) Need Help??


in reply to Re: Truly randomized keys() in perl 5.17 - a challenge for testing?
in thread Truly randomized keys() in perl 5.17 - a challenge for testing?

How many keys are there? I'm sure it's not always the same, but what's the most you're likely to see?


Dave

  • Comment on Re^2: Truly randomized keys() in perl 5.17 - a challenge for testing?

Replies are listed 'Best First'.
Re^3: Truly randomized keys() in perl 5.17 - a challenge for testing?
by saintmike (Vicar) on Sep 30, 2013 at 17:02 UTC
    At this point it's more of an academic exercise, I'm looking for a general solution to the problem of having a unpredictable function somewhere deeply embedded in my call hierarchy, and writing unit tests to confirm the result.

    Do other languages have this problem, except for very few functions like random()?

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1056388]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others avoiding work at the Monastery: (3)
As of 2024-04-26 05:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found