From perlfunc:keys
The actual random order is subject to change in future versions of perl, but it is guaranteed to be the same order as either the values or each function produces (given that the hash has not been modified).
As far as I'm aware, the only way to iterate the values of a hash (internally), is to iterate the keys and use them to retrieve the values, so unless an extra step was added to randomise them after retrieval, the returns from keys and values (and each) would have to come back in the same order?
In reply to Re: Re^4: split to hash, problem with random keys
by BrowserUk
in thread split to hash, problem with random keys
by december
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |