Sort problem lists by value instead of level

diff --git a/lib/Plack/App/Gruntmaster/HTML.pm b/lib/Plack/App/Gruntmaster/HTML.pm
index e69dac980ba6a87d8b1b568d34cfa44cd3435661..7a980737a7fd4eb5fe6da2a7bcf075d0e1845956 100644 (file)
--- a/lib/Plack/App/Gruntmaster/HTML.pm
+++ b/lib/Plack/App/Gruntmaster/HTML.pm
@@ -9,7 +9,6 @@ use HTML::TreeBuilder;
 use POSIX qw//;
 use Data::Dumper qw/Dumper/;
 use Sort::ByExample
-  sorter => {-as => 'pb_sort', example => [qw/beginner easy medium hard/], xform => sub {$_->{level}}},
   sorter => {-as => 'ct_sort', example => [qw/Running Pending Finished/], xform => sub {$_->{status}}};
 
 my $optional_end_tags = {%HTML::Tagset::optionalEndTag, tr => 1, td => 1, th => 1};
@@ -221,7 +220,7 @@ sub process_pb {
                $tr->find('td')->attr(class => $tr->find('td')->attr('class').' warning') if $data->{private} && !$args{args}{contest};
        };
 
-       $tree->find('tbody')->find('tr')->iter3([pb_sort @{$args{pb}}], $iter);
+       $tree->find('tbody')->find('tr')->iter3([sort { $a->{value} <=> $b->{value} } @{$args{pb}}], $iter);
        $tree->fid('open-alert')->detach unless $args{args}{contest};
 }