Beefy Boxes and Bandwidth Generously Provided by pair Networks
Come for the quick hacks, stay for the epiphanies.

Re: Re: List::Ranking

by miyagawa (Chaplain)
on Dec 10, 2001 at 20:31 UTC ( #130694=note: print w/replies, xml ) Need Help??

in reply to Re: List::Ranking
in thread List::Ranking

Usually do I also. But this code doesn't care the fact that "" and "" have the same value (150). What this module does is that.

Tatsuhiko Miyagawa

Replies are listed 'Best First'.
Re(2): List::Ranking
by dmmiller2k (Chaplain) on Dec 11, 2001 at 01:33 UTC

    Right. So instead, try this:

    my %data = ( '' => 180, '' => 150, '' => 150, '' => 120, ); my @keys = keys %data; # invert the %data hash, creating arrayrefs each with list # of elements with the same ranking my %ranks; push @{$ranks{$data{$_}}}, $_ for @keys; # count/sort the rankings my @ranks = reverse sort {$a<=>$b} keys %ranks; for my $rank ( 0 .. $#ranks ) { # print them my @tied = @{$ranks{ $ranks[$rank] }}; if (@tied > 1) { # more than one with this ranking local $"=', '; my $last = pop @tied; print "@tied and $last all have rank ". 1+$ranks[$rank] ."\n"; } else { print "@tied has rank ". 1+$ranks[$rank] ."\n"; } }

    Update: Rankings should be 1-based.


    You can give a man a fish and feed him for a day ...
    Or, you can
    teach him to fish and feed him for a lifetime

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://130694]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (3)
As of 2023-10-04 19:19 GMT
Find Nodes?
    Voting Booth?

    No recent polls found