Re^2: what would you like to see in perl5.12? (trees)

[ysth]

The only script-visible changes would be the module you include to say you want sorted hashes

It'd make more sense to me to have a :btree attribute on the hash declaration (does that mean lexical hashes only? maybe). Would the attribute take an optional comparison function?

and the function it exports so you 'seek' the each operator.

I'd put that in Hash::Util. Is that seek to a particular key value, or seek to key N?