|| The subroutine is_hash_randomized() allows you to check whether the hash keys in your Perl have a random or repeatable order (as returned by each or keys. By default, in Perl 5.8.1, the order of hash keys is no longer repeatable: it will be different for each run of Perl.
The subroutine returns either a defined or an undefined value. If an undefined value is returned, then the order of hash keys is not repeatable. If a defined value if returned, it indicates the hash seed that was used to generate, and thereby order, the hash keys.
When called with a Perl < 5.8.1, the value "0" is always returned. Please note though, that the same value only guarantees repeatable hash key order only for a given version of Perl, not for different Perl versions.
Ok, that's all pretty forgettable. Perl 5.8.1 will have the the hash_seed() subroutine in the Hash::Util module. From the new pod:
- my $hash_seed = hash_seed();
hash_seed() returns the seed number used to randomise
hash ordering. Zero means the "traditional" random
hash ordering, non-zero means the new even more random
hash ordering introduced in Perl 5.8.1.
It should be noted that this routine has slightly different semantics, as you can not discover whether you would or would not got different hash key orders for different runs of Perl. But it doesn't need to do any strange things, it's going directly at the Perl internals.