Good move - that modification convinces me. Although in that case, the underlying algorithm we now have seems too simple to bother with the overheads of a heap module (update: because a hash
is a special sort of heap!). The following algorithm uses the bare bones to deliver the top-n into %SortaHeapy, without using any sorting (code updated):
$NumOfPortsToGet = 10;
local $loaded = 0;
my %SortaHeapy = ();
for my $key ( keys %Stats ) {
($key eq "UnauthOrigin") or SortaHeapy( $key );
}
sub SortaHeapy{
my $key = shift;
# if mini-heap not full just load it in
if ( $loaded < $NumOfPortsToGet ) {
$SortAHeapy{ $key } = $Stats{ $key };
$loaded++
return;
}
# otherwise do the degenerate heap sort/replace
for my $hkey ( keys %SortaHeapy ) {
if ( $SortaHeapy{ $hkey } < $Stats{ $key } ) {
delete $SortaHeapy{ $hkey }; # replace
SortaHeapy{ $hkey }; # but iterate the victim
return
}
}
}
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.