Yes, you could look at using vec to build a bit string representation of the strings. Another thing to look into would be using BerkeleyDB (or the like) to store your results into a DB file on disk rather than keeping the entire thing in memory.
In reply to Re: A better (problem-specific) perl hash?
by Fletch
in thread A better (problem-specific) perl hash?
by srdst13
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |