http://www.perlmonks.org?node_id=734616


in reply to Re: memory-efficient hash kind for incremental sort
in thread memory-efficient hash kind for incremental sort

A good CPAN solution that I've played with in the past is Tree::Trie. I would discard Data::Trie as it doesn't do prefix lookups.

There's also Text::Trie written by the illustrious ILYAZ. While I find it's good for seriously complex problems, it doesn't make the simple things easy. Lots of make-work code to set up all the necessary callbacks.

• another intruder with the mooring in the heart of the Perl

  • Comment on Re^2: memory-efficient hash kind for incremental sort