I'm searching hte Net (not the .NET) for information about how to optimize my Perl code. So far I've only found one articel called "Optimizing Your Perl" by Robert Spier on perl.com, which basically cites basic complexity theory.
What I'm looking fore, however, is something like "use the /o modifier in pattern matching"..
Any ideas? My project involves about 20 matchings each on around 10,000 formated text files. The gathered information is stored in about 240,000 objects (hashes).
Right now, collecting this information takes 8 seconds.