`parListChunk` previously split a list up into chunks, applied
the given strategy to each chunk, and then put them all together
again. This led to two extra copies of the list.

We get very little benefit from actually splitting the list, because the
parallel computations need to traverse their part anyway; we can instead just
hand off the whole list and let them count out their chunk.  We count each
chunk twice, but that shouldn't cost enough to matter.

Now that `Eval` has a `MonadFix` instance, we can avoid actually having
to put together lists at the end; instead, we pass each parallel
computation the (as-yet-uncomputed) result of calculating the rest
of the list.

---------

Co-authored-by: konsumlamm <44230978+konsumlamm@users.noreply.github.com>

* Fix dot documentation

* Deprecate `dot`

* Improve documentation of `Control.Parallel`
* Update changelog
* Update CI
* Fix typo

Co-authored-by: ˌbodʲɪˈɡrʲim <andrew.lelechenko@gmail.com>

- add stackage badges
- replace broken travis badge by GHA badge

Allow base-4.18

Update documentation

fix typos

Widen base bounds and update CI infrastructure

Add parFmap function

This commit was performed automatically by a script.
https://github.com/RyanGlScott/travis-maintenance

This is needed for upcoming GHC 8.8 rls

This commit was performed automatically by a script.
https://github.com/RyanGlScott/travis-maintenance

This commit was performed automatically by a script.
https://github.com/RyanGlScott/travis-maintenance

This commit was performed automatically by a script.
https://github.com/RyanGlScott/travis-maintenance

Provide 'parEval' to spark computations in parallel

Simplify test case rparWith_r0