I'd turn things outside in a little and have the sub actually sort the list rather than just supply a compare function especially as the sub name implies that sorting is what it is likely to do. Consider:
use strict; use warnings; my %sorts = ( 'case' => sub {return sort @_}, 'ignore' => sub {return sort {uc $a cmp uc $b} @_}, 'num' => sub {return sort {$a <=> $b} @_}, 'len' => sub {return sort {length $a <=> length $b} @_}, ); my $modeMatch = '(' . join ('|', keys %sorts) . ')'; sub shortSorts { my ($type, @list) = @_; my ($mode) = lc ($type) =~ $modeMatch; @list = map {scalar reverse $_} @list if $type =~ /\brev\b/i; @list = $sorts{$mode}->(@list); @list = map {scalar reverse $_} @list if $type =~ /\brev\b/i; @list = reverse @list if $type =~ /\bdesc\b/i; return @list; } my @unsorted_array = qw(Red yellow Green cyan Blue magenta); for my $sortType ('case rev desc', 'case desc', 'ignore') { print "$sortType:\n ", join (', ', shortSorts($sortType, @unsort +ed_array)), "\n"; }
Prints:
case rev desc: yellow, Green, cyan, Blue, Red, magenta case desc: yellow, magenta, cyan, Red, Green, Blue ignore: Blue, cyan, Green, magenta, Red, yellow
In reply to Re: short sorts
by GrandFather
in thread short sorts
by Lady_Aleena
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |