Commit bd7b9732 authored by Herbert Valerio Riedel's avatar Herbert Valerio Riedel 🕺

Kill trailing whitespace in recently touched files

Signed-off-by: Herbert Valerio Riedel's avatarHerbert Valerio Riedel <hvr@gnu.org>
parent 7b04d35a
...@@ -7,7 +7,7 @@ ...@@ -7,7 +7,7 @@
-- Module : Data.Complex -- Module : Data.Complex
-- Copyright : (c) The University of Glasgow 2001 -- Copyright : (c) The University of Glasgow 2001
-- License : BSD-style (see the file libraries/base/LICENSE) -- License : BSD-style (see the file libraries/base/LICENSE)
-- --
-- Maintainer : libraries@haskell.org -- Maintainer : libraries@haskell.org
-- Stability : provisional -- Stability : provisional
-- Portability : portable -- Portability : portable
...@@ -173,4 +173,3 @@ instance (RealFloat a) => Floating (Complex a) where ...@@ -173,4 +173,3 @@ instance (RealFloat a) => Floating (Complex a) where
asinh z = log (z + sqrt (1+z*z)) asinh z = log (z + sqrt (1+z*z))
acosh z = log (z + (z+1) * sqrt ((z-1)/(z+1))) acosh z = log (z + (z+1) * sqrt ((z-1)/(z+1)))
atanh z = 0.5 * log ((1.0+z) / (1.0-z)) atanh z = 0.5 * log ((1.0+z) / (1.0-z))
...@@ -6,7 +6,7 @@ ...@@ -6,7 +6,7 @@
-- Module : Data.List -- Module : Data.List
-- Copyright : (c) The University of Glasgow 2001 -- Copyright : (c) The University of Glasgow 2001
-- License : BSD-style (see the file libraries/base/LICENSE) -- License : BSD-style (see the file libraries/base/LICENSE)
-- --
-- Maintainer : libraries@haskell.org -- Maintainer : libraries@haskell.org
-- Stability : stable -- Stability : stable
-- Portability : portable -- Portability : portable
...@@ -34,7 +34,7 @@ module Data.List ...@@ -34,7 +34,7 @@ module Data.List
, intersperse , intersperse
, intercalate , intercalate
, transpose , transpose
, subsequences , subsequences
, permutations , permutations
...@@ -343,7 +343,7 @@ nubBy eq l = nubBy' l [] ...@@ -343,7 +343,7 @@ nubBy eq l = nubBy' l []
-- Not exported: -- Not exported:
-- Note that we keep the call to `eq` with arguments in the -- Note that we keep the call to `eq` with arguments in the
-- same order as in the reference implementation -- 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 -- 'y' is the potential new element
elem_by :: (a -> a -> Bool) -> a -> [a] -> Bool elem_by :: (a -> a -> Bool) -> a -> [a] -> Bool
elem_by _ _ [] = False elem_by _ _ [] = False
...@@ -477,7 +477,7 @@ select p x ~(ts,fs) | p x = (x:ts,fs) ...@@ -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 mapAccumL :: (acc -> x -> (acc, y)) -- Function of elt of input list
-- and accumulator, returning new -- and accumulator, returning new
-- accumulator and elt of result list -- accumulator and elt of result list
-> acc -- Initial accumulator -> acc -- Initial accumulator
-> [x] -- Input list -> [x] -- Input list
-> (acc, [y]) -- Final accumulator and result list -> (acc, [y]) -- Final accumulator and result list
mapAccumL _ s [] = (s, []) mapAccumL _ s [] = (s, [])
......
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