An efficient sorted hash that you use just like a hash but that is implemented as a balanced tree (sorted by key strings). I'm so tired of working around not having this or just using a different language in order to get it (most other languages have it).
The only script-visible changes would be the module you include to say you want sorted hashes and the function it exports so you 'seek' the each operator.
- tye
In reply to Re: what would you like to see in perl5.12? (trees)
by tye
in thread what would you like to see in perl5.12?
by ysth
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |