Re: alphabetize a hash ignoring upper/lower cases

in reply to alphabetize a hash ignoring upper/lower cases

Just compare the lowercase/uppercase variants of the strings. Make sure you convert all of them to common case (using the lc or uc methods). For example, I'd try a code like this:

foreach $orf (sort {lc($mips{$a}) cmp lc($mips{$b})} keys %mips) {
     push @mips, $mips{$orf};
}
[download]

(note: didn't test the code snippet, but confident it should work)

_____________________

# Under Construction
[download]

Comment on Re: alphabetize a hash ignoring upper/lower cases Select or Download Code

Replies are listed 'Best First'.
Re: Re: alphabetize a hash ignoring upper/lower cases by halley (Prior) on May 11, 2003 at 12:07 UTC
For very small hashes, performing two `lc(...$a...)` calls per sort iteration is okay. For larger hashes, performing all those calls per sort iteration will bog you down. As the number of items increases, the number of sorting comparison increases geometrically. If you need speed, look around for the "Schwartzian Transform" (named after our own merlyn). `my @ordered = map { $_->[0] } sort { $a->[1] cmp $b->[1] } map { [ $_, expensive_function($_) ] } # such as lc() @unordered; # such as keys %hash` [download] This calls an expensive setup operation once per item and saves the resulting value, then sorts according to these temporary values, then strips away the temporary values, leaving the original items, but in the right order. -- `[ e d @ h a l l e y . c c ]`	[reply] [d/l] [select]

Replies are listed 'Best First'.

Re: Re: alphabetize a hash ignoring upper/lower cases
by halley (Prior) on May 11, 2003 at 12:07 UTC

For very small hashes, performing two lc(...$a...) calls per sort iteration is okay.

For larger hashes, performing all those calls per sort iteration will bog you down. As the number of items increases, the number of sorting comparison increases geometrically. If you need speed, look around for the "Schwartzian Transform" (named after our own merlyn).

my @ordered =
   map { $_->[0] }
   sort { $a->[1] cmp $b->[1] }
   map { [ $_, expensive_function($_) ] }  # such as lc()
   @unordered;                             # such as keys %hash
[download]

This calls an expensive setup operation once per item and saves the resulting value, then sorts according to these temporary values, then strips away the temporary values, leaving the original items, but in the right order.

--
[ e d @ h a l l e y . c c ]

[reply]
[d/l]
[select]

In Section Seekers of Perl Wisdom