Beefy Boxes and Bandwidth Generously Provided by pair Networks BBQ
Perl: the Markov chain saw
 
PerlMonks  

Re: More efficient way to lookup with 2 AoA's.

by rir (Vicar)
on Jul 27, 2004 at 17:05 UTC ( [id://377862]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


in reply to More efficient way to lookup with 2 AoA's.

Use a hash for your smaller array. Something like:
$, = " "; # just playing with the =>'s my @gn_score = ( [ name_0 => score_0 => ], [ name_1 => score_1 => ], [ name_2 => score_2 => ], ); my @gn_start_stop_chr = ( [ name_0 => b_0 => e_0 => ], [ name_1 => b_1 => e_1 => ], [ name_2 => b_2 => e_2 => ], [ name_0 => b_30 => e_3 => ], [ name_2 => b_42=> e_4 => ], [ name_1 => b_51=> e_5 => ], ); my %score; $score{$_->[0]} = $_->[1] for (@gn_score ); for ( @gn_start_stop_chr) { my ( $name => $begin => $end => ) = @$_; die unless exists $score{$name}; print $name, # or stash your data somewhere $score{$name}, $begin, $end, $/; };

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://377862]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    hippoepoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.