At 17.29 12/8/97, Strider wrote: >It looks for duplicates using a hash system (not too accurate, I know, but >it works, and I figure it's much faster than using s// (am I wrong?)) and >outputs a database without duplicates. The file I'm parsing is 4.7mb, and >using 10mb of memory, Perl runs out. Is there a leak here, do hashes take >up a huge amount of space more than tab-delimited text, or what? Hashes take lots of internal Perl memory, yes. I am not sure what you are trying to do in "finding duplicates" ... there is probably another way. -- Chris Nandor pudge@pobox.com http://pudge.net/ %PGPKey=('B76E72AD',[1024,'0824 090B CE73 CA10 1FF7 7F13 8180 B6B6']) #== MacPerl: Power and Ease ==# #== Publishing Date: Early 1998. http://www.ptf.com/macperl/ ==# ***** Want to unsubscribe from this list? ***** Send mail with body "unsubscribe" to mac-perl-request@iis.ee.ethz.ch