Feature #6079: Hash#each_sorted

• Status: Rejected
• Assignee: -
• Target version: -

[walker (Walter Urbaniak)]

I often use my own mixin'd Hash#each_sorted that sorts the hash keys and then calls the block with the key and value. It would be useful to be added to Hash. (If this is already in Hash or Enumerable, I didn't see it.)

class Hash
def each_sorted(&block) # sort by key
self.keys.sort.each {|key| block.call(key, self[key])}
end
end

[marcandre (Marc-Andre Lafortune)]

I feel there is no need for each_sorted as it is equivalent to sort.each (and 2 characters longer). Try:

{1 => 2, 0 => 4}.sort.each{|k, v| p "#{k} => #{v}"}

[mame (Yusuke Endoh)]

Hello,

2012/2/25 Marc-Andre Lafortune [e-mail]:

I feel there is no need for each_sorted as it is equivalent to sort.each (and 2 characters longer).

Agreed. If we can implement the feature without creating an
intermediate array, it might be useful. But I have no idea
to implement.

--
Yusuke Endoh [e-mail]

[trans (Thomas Sawyer)]

=begin
{1 => 2, 0 => 4}.lazy.sort.each{|k, v| p "#{k} => #{v}"}
=end

?

[nobu (Nobuyoshi Nakada)]

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

[marcandre (Marc-Andre Lafortune)]

• Status changed from Open to Rejected

Closing as no implementation can improve on simple sort.each.