From: Martin DeMello <martindemello@...>
Date: 2005-06-14T19:00:30+09:00
Subject: Re: finding Hash subsets based on key value

Pit Capitain <pit@capitain.de> wrote:
> 
> Note that Set#classify creates a set for each group, which might not 
> always be what you want. IMO, Enumerable#classify should create arrays 
> instead.

I like Robert Klemme's implementation, where each Enumerable creates
partitions of its own type, and calls << on them to populate them. OTOH
it adds an additional dependency to Enumerable (<< as well as each), but
maybe it could default to Array if << doesn't exist.

martin