1. 28 Oct, 2014 1 commit
    • David Feuer's avatar
      base: Refactor/clean-up *List modules · 75979f36
      David Feuer authored
      This gets rid of all hand-unboxing in `GHC.List` and moves `Foldable`
      requirements from `Data.OldList` into `GHC.List` (preparatory work for
      addressing #9716).  Specifically, this moves the definition of
      `maximum`, `minimum`, `foldl'`, `foldl1`, `foldl1'`, `sum`, and
      `product` into `GHC.List` (which now needs to import `GHC.Num`)
      Make `take`, `drop`, `length`, and `!!` generally saner (see also #9510)
      Performance overall seems minimally affected. Some things go up; some
      things go down; nothing moves horribly much. The code is much easier to
      Differential Revision: https://phabricator.haskell.org/D380
  2. 18 Sep, 2014 1 commit
    • Herbert Valerio Riedel's avatar
      Generalise Control.Monad.{sequence_,msum,mapM_,forM_} · b4060858
      Herbert Valerio Riedel authored
      This finally takes the gloves off, and performs the first actual
      generalization in order to implement #9586. This re-exports the
      respective definitions for the 4 combinators defined in Data.Foldable.
      This way, importing Data.Foldable and Control.Monad unqualified won't bring
      conflicting definitions of those 4 entities into scope anymore.
      This change seems to have some minor effect on rule-firing, which
      causes some wibble in the test-case T4007
      Reviewed By: ekmett, austin
      Differential Revision: https://phabricator.haskell.org/D226
  3. 29 Aug, 2014 1 commit
  4. 28 Aug, 2014 1 commit
  5. 18 Sep, 2013 2 commits
  6. 14 Aug, 2013 1 commit
  7. 18 Jul, 2012 1 commit
  8. 20 Jul, 2011 1 commit
  9. 05 Dec, 2010 1 commit