This might work. It compiles clean but need your data to test it.
#! perl -slw use strict; my (@m_info, @data); #! Build a hash keyed by the first elements of the info data. my %m_info = map{ $_->[0] => $_ } @m_info; #! Build a (this|that|the other) regex from the search keys (Method by + [theDamian]). #! Updated to correct *my* errors when adapting [the Damian]'s code as + spotted by [Aristotle]++ below. my $regex = qr/(@{ [ join '|', map { "\Q$_\E" } keys %m_info ] })/; for my $record (@data) { if ( $record =~ $regex ) { #! $1 contains the key that matched. #! The corresponding array can be looked up from the hash my $info = $m_info{$1}; #! do the rest of your stuff #!$info->[3]... } }
Examine what is said, not who speaks.
In reply to Re: More efficient Data Structure needed
by BrowserUk
in thread More efficient Data Structure needed
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |