Commit 68ecc578 authored by Herbert Valerio Riedel's avatar Herbert Valerio Riedel 🕺
Browse files

base: replace ver 4.7.1.0 references by 4.8.0.0

Since we now had to major bump due to AMP being landed, `base-4.7.1.0` is not
gonna happen, as we're going straight for a `base-4.8.0.0` release.

[skip ci] since this is a doc-only change
parent c6f502b2
......@@ -335,7 +335,7 @@ infixl 4 <$!>
-- | Strict version of 'Data.Functor.<$>'.
--
-- /Since: 4.7.1.0/
-- /Since: 4.8.0.0/
(<$!>) :: Monad m => (a -> b) -> m a -> m b
{-# INLINE (<$!>) #-}
f <$!> m = do
......
......@@ -94,6 +94,6 @@ on :: (b -> b -> c) -> (a -> b) -> a -> a -> c
-- convenience. Its precedence is one higher than that of the forward
-- application operator '$', which allows '&' to be nested in '$'.
--
-- /Since: 4.7.1.0/
-- /Since: 4.8.0.0/
(&) :: a -> (a -> b) -> b
x & f = f x
......@@ -967,7 +967,7 @@ rqpart cmp x (y:ys) rle rgt r =
-- input list. This is called the decorate-sort-undecorate paradigm, or
-- Schwartzian transform.
--
-- /Since: 4.7.1.0/
-- /Since: 4.8.0.0/
sortOn :: Ord b => (a -> b) -> [a] -> [a]
sortOn f =
map snd . sortBy (comparing fst) . map (\x -> let y = f x in y `seq` (y, x))
......
......@@ -81,12 +81,12 @@ symbolVal :: forall n proxy. KnownSymbol n => proxy n -> String
symbolVal _ = case symbolSing :: SSymbol n of
SSymbol x -> x
-- | /Since: 4.7.1.0/
-- | /Since: 4.8.0.0/
natVal' :: forall n. KnownNat n => Proxy# n -> Integer
natVal' _ = case natSing :: SNat n of
SNat x -> x
-- | /Since: 4.7.1.0/
-- | /Since: 4.8.0.0/
symbolVal' :: forall n. KnownSymbol n => Proxy# n -> String
symbolVal' _ = case symbolSing :: SSymbol n of
SSymbol x -> x
......
......@@ -78,6 +78,6 @@ exitSuccess = exitWith ExitSuccess
-- | Write given error message to `stderr` and terminate with `exitFailure`.
--
-- /Since: 4.7.1.0/
-- /Since: 4.8.0.0/
die :: String -> IO a
die err = hPutStrLn stderr err >> exitFailure
# Changelog for [`base` package](http://hackage.haskell.org/package/base)
## 4.7.1.0 *TBA*
## 4.8.0.0 *TBA*
* Bundled with GHC 7.10.1
* Make `Applicative` a superclass of `Monad`
* Add reverse application operator `Data.Function.(&)`
* Add `Data.List.sortOn` sorting function
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment