in reply to RE: Module Proposal: Tie::SortHash
in thread Module Proposal: Tie::SortHash
Tie::IxHash attempts to give you more of an array like behavior and keeps the order that things were added to the hash, just like arrays. I'm not trying to do that.
Tie::LLHash gives you the ability to poke and prod the hash, while keeping it's state of where and how things were entered into it. I'm also not looking to do that.
The advantage is that there is no overhead or fluf with Tie::SortHash. It's designed to do one thing, rather transparently. I like the transparent part, you don't get that with the other two modules.
Transparent meaning, for most cases, there's only two 'out of the ordinary' lines in your program. One usees Tie::SortHash, the other implements the tie.
-- Casey
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
RE: RE: RE: Module Proposal: Tie::SortHash
by KM (Priest) on Aug 18, 2000 at 23:58 UTC |