Re: Proposal reminder: Add functions to get consecutive elements to Data.List

You promised a collection of use cases. I seem to have missed it. Could you send the link again? On May 19, 2016 1:35 AM, "Johan Holmquist" wrote:

The discussion period for this proposal is near (31 of May).

So far I count 1 for and 2 against the proposal.

Joachim Breitner made a good enumeration of some advantages of adding these to base. Here is an enumeration of pros:

* Availability in Data.List gives this pattern a common name.

* A common name for this makes code easier to read and decreases the risk of getting the definition wrong.

* The argument won't have to be repeated, hence making it easier to chain the functions.

* List-fusion potential.

Tobias Florek pointed out that `zip <*> tail` can be used to define this inline without the need for repeating the argument and made a reference to the Fairbairn threshold. This is elegant, but I am afraid that people might consider this obscure code golfing if used.

Cheers Johan Holmquist

---------- Forwarded message ---------- From: Henning Thielemann Date: 2016-04-13 13:28 GMT+02:00 Subject: Re: Proposal: Add functions to get consecutive elements to Data.List To: Johan Holmquist Cc: Haskell Libraries

On Wed, 13 Apr 2016, Johan Holmquist wrote:

It is not strictly more general because it cannot handle empty sequences.

...

Think of it as if it handles the non-[] case.

_______________________________________________ Libraries mailing list Libraries@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries