I'm not aware of a canned CPAN solution, but tries are a pretty simple datastructure.
In reply to Re: memory-efficient hash kind for incremental sort
by JavaFan
in thread memory-efficient hash kind for incremental sort
by iaw4
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |