[GHC] #11815: Data.List: Add a function to get consecutive elements (mapConsecutives)

[GHC]

#11815: Data.List: Add a function to get consecutive elements (mapConsecutives)
-------------------------------------+-------------------------------------
        Reporter:  holmisen          |                Owner:
            Type:  feature request   |               Status:  new
        Priority:  low               |            Milestone:
       Component:  libraries/base    |              Version:
      Resolution:                    |             Keywords:
Operating System:  Unknown/Multiple  |         Architecture:
                                     |  Unknown/Multiple
 Type of failure:  None/Unknown      |            Test Case:
      Blocked By:                    |             Blocking:
 Related Tickets:                    |  Differential Rev(s):
       Wiki Page:                    |
-------------------------------------+-------------------------------------

Comment (by holmisen):

 Some basic benchmarking using criterion to compare both functions
 implemented by zip and zipWith versus explicit recursion did not show much
 difference. Explicit recursion seem to be very slightly faster on my setup
 (compiling with -O).

 However, this was my first time using criterion, so I could have made all
 sorts of silly mistakes.

 I do not know how to measure the list fusion producer/consumer behavior.

--
Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/11815#comment:4>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler