in reply to Re: Partial Searches Against Multiple Wildcards
in thread Partial Searches Against Multiple Wildcards

Apart from the usual "better magic than readable style", nice approach.

You might want to consider to memoize the compiled regexes based on length($match)

This should be considerably faster on the long run.

OTOH it also depends on the proportion of wildcard entries.

If it's only a small percentage your solution should be faster than hv's

Of course he could also distinguish between those entries with wildcards and those without.

Cheers Rolf
(addicted to the Perl Programming Language :)
see Wikisyntax for the Monastery