in reply to Name matching -memory leakage

Can't you load first file to the array (20000 x 30 bytes each? = 600kB) and then read second file one name at a time (30 bytes?) and compare to all names from first one?

Update: Sorry, just read what the module does and it looks much more clever than just 'eq' :)

Replies are listed 'Best First'.
Re^2: Name matching -memory leakage
by grizzley (Chaplain) on Apr 02, 2008 at 15:34 UTC
    I have another idea: I would try to run your program for 100 names, see how long does it take and how much memory it consumes. Next, the same for 200 names, for 500, 1000 etc. This way I could estimate how much will it take for 20.000 names and... look for better algorithm :)
[reply]

In Section Seekers of Perl Wisdom