On Thu, Jan 25, 2007 at 10:35:12AM +0900, Bill Kelly wrote:
> I use rbtree on occasion.  About as often as I use std::map
> when programming in C++, I guess.
> 
> Once in awhile I want something that acts like a hash, but
> with keys that can be iterated in sorted order.
> 
> It has seemed to me like a pretty basic data structure to be
> missing from the core all these years... I sometimes wonder
> what other folks use, instead?

a_hash.keys.sort.each do |k|
  # ... with a_hash[k]
end

I've never used rbtree, maybe I should start.

Sam