get the best and fastest answer
|
|
|
|
Clear questions and runnable code get the best and fastest answer |
|
| PerlMonks |
Re: text string approxiamtions (concept for review)by gjb (Vicar) |
| on Dec 05, 2002 at 00:25 UTC ( [id://217639]=note: print w/replies, xml ) | Need Help?? |
|
You may want to have a look at Tie::Hash::Approx and Tie::Hash::Regex. I'm not sure whether the latter is faster than a manual loop, but it might be worth a try. Hope this helps, -gjb-
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||