in reply to memory-efficient hash kind for incremental sort
You want a 'trie' datastructure - a well known datastructure from the literature. The Perl regexp engine uses one (in C).
I'm not aware of a canned CPAN solution, but tries are a pretty simple datastructure.
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^2: memory-efficient hash kind for incremental sort
by grinder (Bishop) on Jan 07, 2009 at 11:56 UTC |
In Section
Seekers of Perl Wisdom