I don't understand why you're using a tree
Consider
my @dictionary = qw/ fa la barf /;
my $in_dictionary = join '|', map \"emeta, @dictionary;
for my $string ( @strings ){
while( $string =~ m{($in_dictionary)}g ){
print "word=$1\n"
}
In reply to Re: Efficient matching with accompanying data (tree)
by Anonymous Monk
in thread Efficient matching with accompanying data
by Endless
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |