|
|
|
| P is for Practical | |
| PerlMonks |
Re^3: maintaining a sorted structureby tilly (Archbishop) |
| on Jan 26, 2011 at 18:24 UTC ( [id://884396]=note: print w/replies, xml ) | Need Help?? |
|
Using DB_File or BerkeleyDB you can easily tie a hash to a BTree, which offers the features that you want.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||||