From: Nobuyoshi Nakada <nobu@...>
Date: 2012-02-28T10:48:00+09:00
Subject: [ruby-core:42987] Re: [ruby-trunk - Feature #6079] Hash#each_sorted

Hi,

(12/02/25 9:24), Yusuke Endoh wrote:
> Agreed.  If we can implement the feature without creating an
> intermediate array, it might be useful.  But I have no idea
> to implement.

It would be possible, if you can tell if the current item is smaller
than the next item before fetching the latter.  In other words, it'll
need a time machine.

-- 
Nobu Nakada