Permalink
Browse files

Removed trailing whitespace

  • Loading branch information...
1 parent fac7cd4 commit 03bb1ca11a5910e3e01b418328199d234b12d2f6 @ekmett committed Jan 15, 2014
@@ -13,11 +13,11 @@
-- Portability : portable
--
----------------------------------------------------------------------------
-module Data.Functor.Apply (
+module Data.Functor.Apply (
-- * Functors
Functor(..)
, (<$>) -- :: Functor f => (a -> b) -> f a -> f b
- , ( $>) -- :: Functor f => f a -> b -> f b
+ , ( $>) -- :: Functor f => f a -> b -> f b
-- * Apply - a strong lax semimonoidal endofunctor
@@ -9,7 +9,7 @@
-- Portability : portable
--
----------------------------------------------------------------------------
-module Data.Functor.Bind.Trans (
+module Data.Functor.Bind.Trans (
BindTrans(..)
) where
@@ -41,7 +41,7 @@ instance BindTrans IdentityT where
liftB = IdentityT
instance BindTrans (ReaderT e) where
- liftB = ReaderT . const
+ liftB = ReaderT . const
instance (Semigroup w, Monoid w) => BindTrans (Lazy.WriterT w) where
liftB = Lazy.WriterT . fmap (\a -> (a, mempty))
@@ -50,14 +50,14 @@ instance (Semigroup w, Monoid w) => BindTrans (Strict.WriterT w) where
liftB = Strict.WriterT . fmap (\a -> (a, mempty))
instance BindTrans (Lazy.StateT s) where
- liftB m = Lazy.StateT $ \s -> fmap (\a -> (a, s)) m
+ liftB m = Lazy.StateT $ \s -> fmap (\a -> (a, s)) m
instance BindTrans (Strict.StateT s) where
- liftB m = Strict.StateT $ \s -> fmap (\a -> (a, s)) m
+ liftB m = Strict.StateT $ \s -> fmap (\a -> (a, s)) m
instance (Semigroup w, Monoid w) => BindTrans (Lazy.RWST r w s) where
liftB m = Lazy.RWST $ \ _r s -> fmap (\a -> (a, s, mempty)) m
-
+
instance (Semigroup w, Monoid w) => BindTrans (Strict.RWST r w s) where
liftB m = Strict.RWST $ \ _r s -> fmap (\a -> (a, s, mempty)) m
View
@@ -46,14 +46,14 @@ import Data.Map (Map)
import Prelude hiding (id, (.))
-- | Laws:
---
+--
-- > zero <!> m = m
-- > m <!> zero = m
--
-- If extended to an 'Alternative' then 'zero' should equal 'empty'.
class Alt f => Plus f where
- zero :: f a
+ zero :: f a
instance Plus IO where
zero = error "zero"
@@ -93,7 +93,7 @@ instance Plus f => Plus (ReaderT e f) where
instance (Bind f, Monad f) => Plus (MaybeT f) where
zero = MaybeT $ return zero
-
+
instance (Bind f, Monad f, Error e) => Plus (ErrorT e f) where
zero = ErrorT $ return $ Left noMsg
@@ -102,18 +102,18 @@ instance (Apply f, Applicative f) => Plus (ListT f) where
instance (Plus f) => Plus (Strict.StateT e f) where
zero = Strict.StateT $ \_ -> zero
-
+
instance (Plus f) => Plus (Lazy.StateT e f) where
zero = Lazy.StateT $ \_ -> zero
instance Plus f => Plus (Strict.WriterT w f) where
zero = Strict.WriterT zero
-
+
instance Plus f => Plus (Lazy.WriterT w f) where
zero = Lazy.WriterT zero
-
+
instance Plus f => Plus (Strict.RWST r w s f) where
- zero = Strict.RWST $ \_ _ -> zero
+ zero = Strict.RWST $ \_ _ -> zero
instance Plus f => Plus (Lazy.RWST r w s f) where
zero = Lazy.RWST $ \_ _ -> zero
View
@@ -90,9 +90,9 @@ sndP :: Bi (,) (a, b) -> b
sndP (Bi (_,b)) = b
left :: a -> Bi Either (a,b)
-left = Bi . Left
+left = Bi . Left
-right :: b -> Bi Either (a,b)
+right :: b -> Bi Either (a,b)
right = Bi . Right
instance Semifunctor (Bi (,)) (Product (->) (->)) (->) where
@@ -34,7 +34,7 @@ class Foldable t => Foldable1 t where
fold1 :: Semigroup m => t m -> m
foldMap1 :: Semigroup m => (a -> m) -> t a -> m
- foldMap1 f = maybe (error "foldMap1") id . getOption . foldMap (Option . Just . f)
+ foldMap1 f = maybe (error "foldMap1") id . getOption . foldMap (Option . Just . f)
fold1 = foldMap1 id
instance Foldable1 Tree where
@@ -1,5 +1,5 @@
{-# LANGUAGE GADTs, EmptyDataDecls #-}
-module Data.Semigroupoid.Coproduct
+module Data.Semigroupoid.Coproduct
( L, R, Coproduct(..), distributeDualCoproduct, factorDualCoproduct) where
import Data.Semigroupoid
@@ -1,5 +1,5 @@
{-# LANGUAGE GADTs #-}
-module Data.Semigroupoid.Product
+module Data.Semigroupoid.Product
( Product(..)
, distributeDualProduct
, factorDualProduct

0 comments on commit 03bb1ca

Please sign in to comment.