There are several ordered hash implementations on cpan already that use tie and arrays to achieve their goal: Tie::Hash::Sorted, Tie::Hash::Array, Tie::Hash::Rank, Tie::Hash::Index, Tie::SortHash, Tie::LLHash etc.
I'm intrigued by your assertion that HE* have a link back to the hash. Nothing shows up on the PerlGuts Illustrated diagram?
In reply to Re^5: Pronoun Programming
by BrowserUk
in thread Pronoun Programming
by rje
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |