Safe Haskell	Safe
Language	Haskell2010

Data.Functor.These

Documentation

data These1 (f :: Type -> Type) (g :: Type -> Type) a Source #

Constructors

This1 (f a)
That1 (g a)
These1 (f a) (g a)

Instances

Instances details

Generic1 (These1 f g :: Type -> Type) Source #

Instance details

Defined in Data.Functor.These

Associated Types

type Rep1 (These1 f g :: Type -> Type)

Instance details

Defined in Data.Functor.These

type Rep1 (These1 f g :: Type -> Type) = D1 ('MetaData "These1" "Data.Functor.These" "these-1.2.1-9ohI0r8b6M98gOYK8QHI1w" 'False) (C1 ('MetaCons "This1" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 f)) :+: (C1 ('MetaCons "That1" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 g)) :+: C1 ('MetaCons "These1" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 f) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 g))))

Methods

from1 :: These1 f g a -> Rep1 (These1 f g) a #

to1 :: Rep1 (These1 f g) a -> These1 f g a #

(Foldable f, Foldable g) => Foldable (These1 f g) Source #

Instance details

Defined in Data.Functor.These

Methods

fold :: Monoid m => These1 f g m -> m #

foldMap :: Monoid m => (a -> m) -> These1 f g a -> m #

foldMap' :: Monoid m => (a -> m) -> These1 f g a -> m #

foldr :: (a -> b -> b) -> b -> These1 f g a -> b #

foldr' :: (a -> b -> b) -> b -> These1 f g a -> b #

foldl :: (b -> a -> b) -> b -> These1 f g a -> b #

foldl' :: (b -> a -> b) -> b -> These1 f g a -> b #

foldr1 :: (a -> a -> a) -> These1 f g a -> a #

foldl1 :: (a -> a -> a) -> These1 f g a -> a #

toList :: These1 f g a -> [a] #

null :: These1 f g a -> Bool #

length :: These1 f g a -> Int #

elem :: Eq a => a -> These1 f g a -> Bool #

maximum :: Ord a => These1 f g a -> a #

minimum :: Ord a => These1 f g a -> a #

sum :: Num a => These1 f g a -> a #

product :: Num a => These1 f g a -> a #

(Foldable1 f, Foldable1 g) => Foldable1 (These1 f g) Source #

Since: 1.2

Instance details

Defined in Data.Functor.These

Methods

fold1 :: Semigroup m => These1 f g m -> m #

foldMap1 :: Semigroup m => (a -> m) -> These1 f g a -> m #

foldMap1' :: Semigroup m => (a -> m) -> These1 f g a -> m #

toNonEmpty :: These1 f g a -> NonEmpty a #

maximum :: Ord a => These1 f g a -> a #

minimum :: Ord a => These1 f g a -> a #

head :: These1 f g a -> a #

last :: These1 f g a -> a #

foldrMap1 :: (a -> b) -> (a -> b -> b) -> These1 f g a -> b #

foldlMap1' :: (a -> b) -> (b -> a -> b) -> These1 f g a -> b #

foldlMap1 :: (a -> b) -> (b -> a -> b) -> These1 f g a -> b #

foldrMap1' :: (a -> b) -> (a -> b -> b) -> These1 f g a -> b #

(Eq1 f, Eq1 g) => Eq1 (These1 f g) Source #

Instance details

Defined in Data.Functor.These

Methods

liftEq :: (a -> b -> Bool) -> These1 f g a -> These1 f g b -> Bool #

(Ord1 f, Ord1 g) => Ord1 (These1 f g) Source #

Instance details

Defined in Data.Functor.These

Methods

liftCompare :: (a -> b -> Ordering) -> These1 f g a -> These1 f g b -> Ordering #

(Read1 f, Read1 g) => Read1 (These1 f g) Source #

Instance details

Defined in Data.Functor.These

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (These1 f g a) #

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [These1 f g a] #

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (These1 f g a) #

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [These1 f g a] #

(Show1 f, Show1 g) => Show1 (These1 f g) Source #

Instance details

Defined in Data.Functor.These

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> These1 f g a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [These1 f g a] -> ShowS #

(Traversable f, Traversable g) => Traversable (These1 f g) Source #

Instance details

Defined in Data.Functor.These

Methods

traverse :: Applicative f0 => (a -> f0 b) -> These1 f g a -> f0 (These1 f g b) #

sequenceA :: Applicative f0 => These1 f g (f0 a) -> f0 (These1 f g a) #

mapM :: Monad m => (a -> m b) -> These1 f g a -> m (These1 f g b) #

sequence :: Monad m => These1 f g (m a) -> m (These1 f g a) #

(Functor f, Functor g) => Functor (These1 f g) Source #

Instance details

Defined in Data.Functor.These

Methods

fmap :: (a -> b) -> These1 f g a -> These1 f g b #

(<$) :: a -> These1 f g b -> These1 f g a #

(NFData1 f, NFData1 g) => NFData1 (These1 f g) Source #

This instance is available only with deepseq >= 1.4.3.0

Instance details

Defined in Data.Functor.These

Methods

liftRnf :: (a -> ()) -> These1 f g a -> () #

(Typeable f, Typeable g, Typeable a, Data (f a), Data (g a)) => Data (These1 f g a) Source #

Instance details

Defined in Data.Functor.These

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g0. g0 -> c g0) -> These1 f g a -> c (These1 f g a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (These1 f g a) #

toConstr :: These1 f g a -> Constr #

dataTypeOf :: These1 f g a -> DataType #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (These1 f g a)) #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (These1 f g a)) #

gmapT :: (forall b. Data b => b -> b) -> These1 f g a -> These1 f g a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> These1 f g a -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> These1 f g a -> r #

gmapQ :: (forall d. Data d => d -> u) -> These1 f g a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> These1 f g a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> These1 f g a -> m (These1 f g a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> These1 f g a -> m (These1 f g a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> These1 f g a -> m (These1 f g a) #

Generic (These1 f g a) Source #

Instance details

Defined in Data.Functor.These

Associated Types

type Rep (These1 f g a)

Instance details

Defined in Data.Functor.These

type Rep (These1 f g a) = D1 ('MetaData "These1" "Data.Functor.These" "these-1.2.1-9ohI0r8b6M98gOYK8QHI1w" 'False) (C1 ('MetaCons "This1" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (f a))) :+: (C1 ('MetaCons "That1" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (g a))) :+: C1 ('MetaCons "These1" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (f a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (g a)))))

Methods

from :: These1 f g a -> Rep (These1 f g a) x #

to :: Rep (These1 f g a) x -> These1 f g a #

(Read (f a), Read (g a), Read a) => Read (These1 f g a) Source #

Instance details

Defined in Data.Functor.These

Methods

readsPrec :: Int -> ReadS (These1 f g a) #

readList :: ReadS [These1 f g a] #

readPrec :: ReadPrec (These1 f g a) #

readListPrec :: ReadPrec [These1 f g a] #

(Show (f a), Show (g a), Show a) => Show (These1 f g a) Source #

Instance details

Defined in Data.Functor.These

Methods

showsPrec :: Int -> These1 f g a -> ShowS #

show :: These1 f g a -> String #

showList :: [These1 f g a] -> ShowS #

(NFData (f a), NFData (g a), NFData a) => NFData (These1 f g a) Source #

Available always

Since: 1.2

Instance details

Defined in Data.Functor.These

Methods

rnf :: These1 f g a -> () #

(Eq (f a), Eq (g a), Eq a) => Eq (These1 f g a) Source #

Instance details

Defined in Data.Functor.These

Methods

(==) :: These1 f g a -> These1 f g a -> Bool #

(/=) :: These1 f g a -> These1 f g a -> Bool #

(Ord (f a), Ord (g a), Ord a) => Ord (These1 f g a) Source #

Instance details

Defined in Data.Functor.These

Methods

compare :: These1 f g a -> These1 f g a -> Ordering #

(<) :: These1 f g a -> These1 f g a -> Bool #

(<=) :: These1 f g a -> These1 f g a -> Bool #

(>) :: These1 f g a -> These1 f g a -> Bool #

(>=) :: These1 f g a -> These1 f g a -> Bool #

max :: These1 f g a -> These1 f g a -> These1 f g a #

min :: These1 f g a -> These1 f g a -> These1 f g a #

type Rep1 (These1 f g :: Type -> Type) Source #

Instance details

Defined in Data.Functor.These

type Rep1 (These1 f g :: Type -> Type) = D1 ('MetaData "These1" "Data.Functor.These" "these-1.2.1-9ohI0r8b6M98gOYK8QHI1w" 'False) (C1 ('MetaCons "This1" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 f)) :+: (C1 ('MetaCons "That1" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 g)) :+: C1 ('MetaCons "These1" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 f) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 g))))

type Rep (These1 f g a) Source #

Instance details

Defined in Data.Functor.These

type Rep (These1 f g a) = D1 ('MetaData "These1" "Data.Functor.These" "these-1.2.1-9ohI0r8b6M98gOYK8QHI1w" 'False) (C1 ('MetaCons "This1" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (f a))) :+: (C1 ('MetaCons "That1" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (g a))) :+: C1 ('MetaCons "These1" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (f a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (g a)))))