Syntactic Confectionery Delight | |
PerlMonks |
Re^2: Determining uniqueness in a string.by Perl Mouse (Chaplain) |
on Oct 03, 2005 at 15:20 UTC ( [id://496960]=note: print w/replies, xml ) | Need Help?? |
There will be 10! entries in the the hash. Extrapolating the size it takes to store 10!/10, 10!/5 and 10!/2 10 character strings in a hash, I estimate the needed size to be around 170Mb. Trying to stuff 10! of those strings in a hash cause all the machines I tried it on to swap - with top showing a memory usage of around half a Gb of the running program.
Perl --((8:>*
In Section
Seekers of Perl Wisdom
|
|