{-# LANGUAGE CPP #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE StandaloneDeriving #-}
{-# LANGUAGE UndecidableInstances #-}
#if __GLASGOW_HASKELL__ >= 702
{-# LANGUAGE DeriveGeneric #-}
#endif
#if __GLASGOW_HASKELL__ >= 704
{-# LANGUAGE Safe #-}
#elif __GLASGOW_HASKELL__ >= 702
{-# LANGUAGE Trustworthy #-}
#endif
#if __GLASGOW_HASKELL__ >= 706
{-# LANGUAGE PolyKinds #-}
#endif
#include "bifunctors-common.h"
module Data.Bifunctor.Join
( Join(..)
) where
#if __GLASGOW_HASKELL__ < 710
import Control.Applicative
#endif
import Data.Biapplicative
import Data.Bifoldable
import Data.Bitraversable
#if __GLASGOW_HASKELL__ < 710
import Data.Foldable
import Data.Traversable
#endif
#if __GLASGOW_HASKELL__ >= 708
import Data.Typeable
#endif
#if __GLASGOW_HASKELL__ >= 702
import GHC.Generics
#endif
#if LIFTED_FUNCTOR_CLASSES
import Data.Functor.Classes
#endif
newtype Join p a = Join { runJoin :: p a a }
deriving
(
#if __GLASGOW_HASKELL__ >= 702
Generic
#endif
#if __GLASGOW_HASKELL__ >= 708
, Typeable
#endif
)
deriving instance Eq (p a a) => Eq (Join p a)
deriving instance Ord (p a a) => Ord (Join p a)
deriving instance Show (p a a) => Show (Join p a)
deriving instance Read (p a a) => Read (Join p a)
#if LIFTED_FUNCTOR_CLASSES
instance Eq2 p => Eq1 (Join p) where
liftEq f (Join x) (Join y) = liftEq2 f f x y
instance Ord2 p => Ord1 (Join p) where
liftCompare f (Join x) (Join y) = liftCompare2 f f x y
instance Read2 p => Read1 (Join p) where
liftReadsPrec rp1 rl1 p = readParen (p > 10) $ \s0 -> do
("Join", s1) <- lex s0
("{", s2) <- lex s1
("runJoin", s3) <- lex s2
(x, s4) <- liftReadsPrec2 rp1 rl1 rp1 rl1 0 s3
("}", s5) <- lex s4
return (Join x, s5)
instance Show2 p => Show1 (Join p) where
liftShowsPrec sp1 sl1 p (Join x) = showParen (p > 10) $
showString "Join {runJoin = "
. liftShowsPrec2 sp1 sl1 sp1 sl1 0 x
. showChar '}'
#endif
instance Bifunctor p => Functor (Join p) where
fmap f (Join a) = Join (bimap f f a)
{-# INLINE fmap #-}
instance Biapplicative p => Applicative (Join p) where
pure a = Join (bipure a a)
{-# INLINE pure #-}
Join f <*> Join a = Join (f <<*>> a)
{-# INLINE (<*>) #-}
Join a *> Join b = Join (a *>> b)
{-# INLINE (*>) #-}
Join a <* Join b = Join (a <<* b)
{-# INLINE (<*) #-}
instance Bifoldable p => Foldable (Join p) where
foldMap f (Join a) = bifoldMap f f a
{-# INLINE foldMap #-}
instance Bitraversable p => Traversable (Join p) where
traverse f (Join a) = fmap Join (bitraverse f f a)
{-# INLINE traverse #-}
sequenceA (Join a) = fmap Join (bisequenceA a)
{-# INLINE sequenceA #-}