Proposal: Add these two handy functions to Data.List

[Bryan O'Sullivan]

On Fri, Jul 2, 2010 at 1:59 AM, Conor McBride <conor at strictlypositive.org>wrote:

> The question for library designers is at what level to engage with
> this structure. In doing so, we should of course take care to
> protect Joe Programmer from the Screaming Heebie-Jeebies. I am not
> qualified to judge how best this is to be done, but I thought I
> might at least offer some of the raw data for that calculation.
>

I like Cale's proposal, and in fact it reminds me of something Duncan nudged
me on a few months ago:

http://www.serpentine.com/blog/2010/07/02/whats-in-a-find-function/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/libraries/attachments/20100702/01c20256/attachment.html