But without profiling this is only shooting in the dark
Could it be that you are parsing the files and checking if entries match against the hash?
Then trie-optimized regexes could be very performant... (you might need runs with several regexes to avoid buffer overruns, but 10000 short strings should fit)
But w/o much info that's again shooting in the dark.
Cheers Rolf
( addicted to the Perl Programming Language)
In reply to Re^3: Small Hash a Gateway to Large Hash?
by LanX
in thread Small Hash a Gateway to Large Hash?
by lsherwood
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |