comment on

Hello,

Is it possible to set fixed hash behavior: getting the same order of keys (or values, or each)?
1. For every same hash in running script.
2. For every same hash between running script several times.

How scripts, output of which depend on hashes, are tested? E.g. once generated desired output, which is suitable for being a test case, won't be the same in the next run?

Comparing to scripts which uses 'rand' one can set the same seed ('srand CONST') for getting the same output every time.

Upd. E.g. I shuffled (10k times) an array with a hash, and got different patterns of shuffling occurrences between different script runs (see from here: Re: RFC: Kinda pseudo-shuffle using sort).

In reply to Is it possible to "fix a seed" for hash? by rsFalse

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.


Come for the quick hacks, stay for the epiphanies.
	PerlMonks