Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

Re: Parsing and Finding Max Min

by RMGir (Prior)
on Dec 30, 2009 at 13:56 UTC ( #814944=note: print w/replies, xml ) Need Help??

in reply to Parsing and Finding Max Min

You should definitely be using strict and warnings, for starters.

Next, do you really intend to update

$hash{$Query}[3] = $one; $hash{$Query}[4] = $two;
in all 4 blocks? That seems strange.

If you didn't intend that, what I'd suggest is modifying your code to simplify things - it would also make debugging simpler.

while (<FH>) { my ($Query, $Score, $Start, $End, $one, $two) = split; my $aref=[$Score, $Start, $End, $one, $two]; if ( ! exists ( $hash{$Query} ) ) { $hash{$Query} = $aref; } else { if ( $hash{$Query}[1] > $Start ) { $hash{$Query} = $aref; } } if ( ! exists ( $hash2{$Query} ) ) { $hash2{$Query}= $aref; } else { if ( $hash2{$Query}[2] < $End ) { $hash2{$Query} = $aref; } } }
That might make things a bit easier to debug...


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://814944]
[atcroft]: Discipulus: I looked back at your note about my Padre question from a while back, and it made me look again... as a result, I found what I was missing and was able to make the change. Thank you!

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (7)
As of 2018-02-24 20:27 GMT
Find Nodes?
    Voting Booth?
    When it is dark outside I am happiest to see ...

    Results (311 votes). Check out past polls.