Re: reusable hash value sort

I can suggest a solution which is not good to use in programs, but meets your requirements.

my $current_href = {};
sub byValue {
  $current_href->{$a} cmp $current_href->{$a};
}
# ... somewhere in your program
$current_href = \%myHash;
[download]

Just assign hash ref to current hash in consideration

Courage, the Cowardly Dog.

Comment on Re: reusable hash value sort Download Code

Replies are listed 'Best First'.
Re: Re: reusable hash value sort by jdavidboyd (Friar) on Jul 13, 2002 at 13:31 UTC
Being a Perl newbie, I must ask, why is this "not good to use in programs"?	[reply]
Re: Re: Re: reusable hash value sort by Courage (Parson) on Jul 14, 2002 at 15:46 UTC
I beleive it's better to create "independent" subroutines, in that sence of a word that they will not depend on a state of some external global variable. When you'll return to this subroutine after many years and will reuse it, then you have a chance to use it incorrectly. As a second point, you may accidentially break that external variable somehow and after that something bad will happen, including coredumps (AFAIK some versions of perl will coredump on sort routines when criteria subroutine does not behave well) Courage, the Cowardly Dog	[reply]