On Thu, 17 May 2001, Bernd [iso-8859-2] Holzm�ller wrote:
> This partitioning function builds equivalence classes from the list
> argument, where each element list within the result list consists of
> elements that all map to the same value when applying f to it.
> Thus: partition (`div` 2) [1..5] yields [[1],[2,3],[4,5]]
>
> This is much more general than the existing partitioning function and
> applicable in many practical cases.
But here generality comes at the expense of speed I think.
Greetings :-)
Michal Gajda
[EMAIL PROTECTED]
_______________________________________________
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
