On Tue, Jul 24, 2012 at 03:13:08PM +0200, Twan van Laarhoven wrote:
On 20/07/12 22:35, Brent Yorgey wrote:
Hello everyone,
This is a proposal for the split package [1] to be included in the next major release of the Haskell platform.
Missing strategies ------------------
The specific way that the generic splitting algorithm is implemented does preclude some imaginable splitting strategies. For example, a few years ago I tried adding a strategy that used a predicate on pairs of elements, splitting down the middle of any pairs that satisfy the predicate, but gave up because it simply did not fit.
I just needed a function for splitting a list into two equal parts. This is something you often need for MergeSort-like functions. Is that something that belongs in Data.List.Split?
Perhaps, though I think this sort of thing should probably be handled outside the HP review process. Patches welcome. =) -Brent