Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

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

by grinder (Bishop)
on Jan 07, 2009 at 11:56 UTC ( #734616=note: print w/replies, xml ) Need Help??


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

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://734616]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (10)
As of 2018-10-19 07:39 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    When I need money for a bigger acquisition, I usually ...














    Results (106 votes). Check out past polls.

    Notices?