It may be that sorted arrays are the way to go, as mentioned elsewhere. But it might make sense to go from the data you have now to an inverted list of best matches, so as to sort each list only once: my $inv = {};
for my $index (keys %$rc) {
my $subhash = $rc->{$index};
my @sorted = sort { $subhash->{$a} <=> $subhash->{$b} } keys %$sub
+hash;
if ($subhash->{$sorted[0]} < $subhash->{$sorted[1]}) {
# this is the best match
push @{ $inv->{$sorted[0]} }, $index;
}
}
and now the strong match test becomes: return (@{ $inv{$id2} } == 1) ? 1 : 0;
I'm not sure that I fully understand the problem, so the code might need some tweaking ...
Hugo
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|