diff options
| author | Herbert Valerio Riedel <hvr@gnu.org> | 2014-04-19 14:39:29 +0200 |
|---|---|---|
| committer | Herbert Valerio Riedel <hvr@gnu.org> | 2014-04-19 14:39:29 +0200 |
| commit | bd7b97328d9326fb3a425bc6d01bad8b03990ed4 (patch) | |
| tree | 4d2b85b08062a682ce4c0ae8e904ac0ceb6910e3 /libraries | |
| parent | 7b04d35a87f1ee2904579a916ef1a6b0aa6fc7b8 (diff) | |
| download | haskell-bd7b97328d9326fb3a425bc6d01bad8b03990ed4.tar.gz | |
Kill trailing whitespace in recently touched files
Signed-off-by: Herbert Valerio Riedel <hvr@gnu.org>
Diffstat (limited to 'libraries')
| -rw-r--r-- | libraries/base/Data/Complex.hs | 3 | ||||
| -rw-r--r-- | libraries/base/Data/List.hs | 8 |
2 files changed, 5 insertions, 6 deletions
diff --git a/libraries/base/Data/Complex.hs b/libraries/base/Data/Complex.hs index b03848b636..af593cda2f 100644 --- a/libraries/base/Data/Complex.hs +++ b/libraries/base/Data/Complex.hs @@ -7,7 +7,7 @@ -- Module : Data.Complex -- Copyright : (c) The University of Glasgow 2001 -- License : BSD-style (see the file libraries/base/LICENSE) --- +-- -- Maintainer : libraries@haskell.org -- Stability : provisional -- Portability : portable @@ -173,4 +173,3 @@ instance (RealFloat a) => Floating (Complex a) where asinh z = log (z + sqrt (1+z*z)) acosh z = log (z + (z+1) * sqrt ((z-1)/(z+1))) atanh z = 0.5 * log ((1.0+z) / (1.0-z)) - diff --git a/libraries/base/Data/List.hs b/libraries/base/Data/List.hs index 7f66528a44..49edfd56ab 100644 --- a/libraries/base/Data/List.hs +++ b/libraries/base/Data/List.hs @@ -6,7 +6,7 @@ -- Module : Data.List -- Copyright : (c) The University of Glasgow 2001 -- License : BSD-style (see the file libraries/base/LICENSE) --- +-- -- Maintainer : libraries@haskell.org -- Stability : stable -- Portability : portable @@ -34,7 +34,7 @@ module Data.List , intersperse , intercalate , transpose - + , subsequences , permutations @@ -343,7 +343,7 @@ nubBy eq l = nubBy' l [] -- Not exported: -- Note that we keep the call to `eq` with arguments in the -- same order as in the reference implementation --- 'xs' is the list of things we've seen so far, +-- 'xs' is the list of things we've seen so far, -- 'y' is the potential new element elem_by :: (a -> a -> Bool) -> a -> [a] -> Bool elem_by _ _ [] = False @@ -477,7 +477,7 @@ select p x ~(ts,fs) | p x = (x:ts,fs) mapAccumL :: (acc -> x -> (acc, y)) -- Function of elt of input list -- and accumulator, returning new -- accumulator and elt of result list - -> acc -- Initial accumulator + -> acc -- Initial accumulator -> [x] -- Input list -> (acc, [y]) -- Final accumulator and result list mapAccumL _ s [] = (s, []) |