Documentation

Methods

liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> K a c -> K b d -> Bool

Methods

liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> K a c -> K b d -> Ordering

Methods

liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (K a b)

liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [K a b]

liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (K a b)

liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [K a b]

Methods

liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> K a b -> ShowS

liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [K a b] -> ShowS

Methods

liftRnf2 :: (a -> ()) -> (b -> ()) -> K a b -> ()

Methods

liftEq :: (a0 -> b -> Bool) -> K a a0 -> K a b -> Bool

Methods

liftCompare :: (a0 -> b -> Ordering) -> K a a0 -> K a b -> Ordering

Methods

liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (K a a0)

liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [K a a0]

liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (K a a0)

liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [K a a0]

Methods

liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> K a a0 -> ShowS

liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [K a a0] -> ShowS

Methods

liftRnf :: (a0 -> ()) -> K a a0 -> ()

Methods

pure :: a0 -> K a a0

(<*>) :: K a (a0 -> b) -> K a a0 -> K a b

liftA2 :: (a0 -> b -> c) -> K a a0 -> K a b -> K a c

(*>) :: K a a0 -> K a b -> K a b

(<*) :: K a a0 -> K a b -> K a a0

Methods

fmap :: (a0 -> b) -> K a a0 -> K a b

(<$) :: a0 -> K a b -> K a a0

Methods

fold :: Monoid m => K a m -> m

foldMap :: Monoid m => (a0 -> m) -> K a a0 -> m

foldMap' :: Monoid m => (a0 -> m) -> K a a0 -> m

foldr :: (a0 -> b -> b) -> b -> K a a0 -> b

foldr' :: (a0 -> b -> b) -> b -> K a a0 -> b

foldl :: (b -> a0 -> b) -> b -> K a a0 -> b

foldl' :: (b -> a0 -> b) -> b -> K a a0 -> b

foldr1 :: (a0 -> a0 -> a0) -> K a a0 -> a0

foldl1 :: (a0 -> a0 -> a0) -> K a a0 -> a0

toList :: K a a0 -> [a0]

null :: K a a0 -> Bool

length :: K a a0 -> Int

elem :: Eq a0 => a0 -> K a a0 -> Bool

maximum :: Ord a0 => K a a0 -> a0

minimum :: Ord a0 => K a a0 -> a0

sum :: Num a0 => K a a0 -> a0

product :: Num a0 => K a a0 -> a0

Methods

traverse :: Applicative f => (a0 -> f b) -> K a a0 -> f (K a b)

sequenceA :: Applicative f => K a (f a0) -> f (K a a0)

mapM :: Monad m => (a0 -> m b) -> K a a0 -> m (K a b)

sequence :: Monad m => K a (m a0) -> m (K a a0)

Methods

rnf :: K a b -> ()

Methods

from :: K a b -> Rep (K a b) Source #

to :: Rep (K a b) -> K a b Source #

Methods

datatypeInfo :: proxy (K a b) -> DatatypeInfo (Code (K a b)) Source #

Methods

mempty :: K a b

mappend :: K a b -> K a b -> K a b

mconcat :: [K a b] -> K a b

Methods

(<>) :: K a b -> K a b -> K a b

sconcat :: NonEmpty (K a b) -> K a b

stimes :: Integral b0 => b0 -> K a b -> K a b

Methods

from :: K a b -> Rep (K a b) x

to :: Rep (K a b) x -> K a b

Methods

readsPrec :: Int -> ReadS (K a b)

readList :: ReadS [K a b]

readPrec :: ReadPrec (K a b)

readListPrec :: ReadPrec [K a b]

Methods

showsPrec :: Int -> K a b -> ShowS

show :: K a b -> String

showList :: [K a b] -> ShowS

Methods

(==) :: K a b -> K a b -> Bool

(/=) :: K a b -> K a b -> Bool

Methods

compare :: K a b -> K a b -> Ordering

(<) :: K a b -> K a b -> Bool

(<=) :: K a b -> K a b -> Bool

(>) :: K a b -> K a b -> Bool

(>=) :: K a b -> K a b -> Bool

max :: K a b -> K a b -> K a b

min :: K a b -> K a b -> K a b

Methods

liftEq :: (a -> b -> Bool) -> I a -> I b -> Bool

Methods

liftCompare :: (a -> b -> Ordering) -> I a -> I b -> Ordering

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (I a)

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [I a]

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (I a)

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [I a]

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> I a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [I a] -> ShowS

Methods

liftRnf :: (a -> ()) -> I a -> ()

Methods

pure :: a -> I a

(<*>) :: I (a -> b) -> I a -> I b

liftA2 :: (a -> b -> c) -> I a -> I b -> I c

(*>) :: I a -> I b -> I b

(<*) :: I a -> I b -> I a

Methods

fmap :: (a -> b) -> I a -> I b

(<$) :: a -> I b -> I a

Methods

(>>=) :: I a -> (a -> I b) -> I b

(>>) :: I a -> I b -> I b

return :: a -> I a

Methods

fold :: Monoid m => I m -> m

foldMap :: Monoid m => (a -> m) -> I a -> m

foldMap' :: Monoid m => (a -> m) -> I a -> m

foldr :: (a -> b -> b) -> b -> I a -> b

foldr' :: (a -> b -> b) -> b -> I a -> b

foldl :: (b -> a -> b) -> b -> I a -> b

foldl' :: (b -> a -> b) -> b -> I a -> b

foldr1 :: (a -> a -> a) -> I a -> a

foldl1 :: (a -> a -> a) -> I a -> a

toList :: I a -> [a]

null :: I a -> Bool

length :: I a -> Int

elem :: Eq a => a -> I a -> Bool

maximum :: Ord a => I a -> a

minimum :: Ord a => I a -> a

sum :: Num a => I a -> a

product :: Num a => I a -> a

Methods

traverse :: Applicative f => (a -> f b) -> I a -> f (I b)

sequenceA :: Applicative f => I (f a) -> f (I a)

mapM :: Monad m => (a -> m b) -> I a -> m (I b)

sequence :: Monad m => I (m a) -> m (I a)

Methods

rnf :: I a -> ()

Methods

from :: I a -> Rep (I a) Source #

to :: Rep (I a) -> I a Source #

Methods

datatypeInfo :: proxy (I a) -> DatatypeInfo (Code (I a)) Source #

Methods

mempty :: I a

mappend :: I a -> I a -> I a

mconcat :: [I a] -> I a

Methods

(<>) :: I a -> I a -> I a

sconcat :: NonEmpty (I a) -> I a

stimes :: Integral b => b -> I a -> I a

Methods

from :: I a -> Rep (I a) x

to :: Rep (I a) x -> I a

Methods

readsPrec :: Int -> ReadS (I a)

readList :: ReadS [I a]

readPrec :: ReadPrec (I a)

readListPrec :: ReadPrec [I a]

Methods

showsPrec :: Int -> I a -> ShowS

show :: I a -> String

showList :: [I a] -> ShowS

Methods

(==) :: I a -> I a -> Bool

(/=) :: I a -> I a -> Bool

Methods

compare :: I a -> I a -> Ordering

(<) :: I a -> I a -> Bool

(<=) :: I a -> I a -> Bool

(>) :: I a -> I a -> Bool

(>=) :: I a -> I a -> Bool

max :: I a -> I a -> I a

min :: I a -> I a -> I a

Methods

liftEq :: (a -> b -> Bool) -> (f :.: g) a -> (f :.: g) b -> Bool

Methods

liftCompare :: (a -> b -> Ordering) -> (f :.: g) a -> (f :.: g) b -> Ordering

Methods

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

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

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

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [(f :.: g) a]

Methods

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

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

Methods

liftRnf :: (a -> ()) -> (f :.: g) a -> ()

Methods

pure :: a -> (f :.: g) a

(<*>) :: (f :.: g) (a -> b) -> (f :.: g) a -> (f :.: g) b

liftA2 :: (a -> b -> c) -> (f :.: g) a -> (f :.: g) b -> (f :.: g) c

(*>) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) b

(<*) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) a

Methods

fmap :: (a -> b) -> (f :.: g) a -> (f :.: g) b

(<$) :: a -> (f :.: g) b -> (f :.: g) a

Methods

fold :: Monoid m => (f :.: g) m -> m

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

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

foldr :: (a -> b -> b) -> b -> (f :.: g) a -> b

foldr' :: (a -> b -> b) -> b -> (f :.: g) a -> b

foldl :: (b -> a -> b) -> b -> (f :.: g) a -> b

foldl' :: (b -> a -> b) -> b -> (f :.: g) a -> b

foldr1 :: (a -> a -> a) -> (f :.: g) a -> a

foldl1 :: (a -> a -> a) -> (f :.: g) a -> a

toList :: (f :.: g) a -> [a]

null :: (f :.: g) a -> Bool

length :: (f :.: g) a -> Int

elem :: Eq a => a -> (f :.: g) a -> Bool

maximum :: Ord a => (f :.: g) a -> a

minimum :: Ord a => (f :.: g) a -> a

sum :: Num a => (f :.: g) a -> a

product :: Num a => (f :.: g) a -> a

Methods

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

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

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

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

Methods

rnf :: (f :.: g) a -> ()

Methods

from :: (f :.: g) p -> Rep ((f :.: g) p) Source #

to :: Rep ((f :.: g) p) -> (f :.: g) p Source #

Methods

datatypeInfo :: proxy ((f :.: g) p) -> DatatypeInfo (Code ((f :.: g) p)) Source #

Methods

mempty :: (f :.: g) x

mappend :: (f :.: g) x -> (f :.: g) x -> (f :.: g) x

mconcat :: [(f :.: g) x] -> (f :.: g) x

Methods

(<>) :: (f :.: g) x -> (f :.: g) x -> (f :.: g) x

sconcat :: NonEmpty ((f :.: g) x) -> (f :.: g) x

stimes :: Integral b => b -> (f :.: g) x -> (f :.: g) x

Methods

from :: (f :.: g) p -> Rep ((f :.: g) p) x

to :: Rep ((f :.: g) p) x -> (f :.: g) p

Methods

readsPrec :: Int -> ReadS ((f :.: g) a)

readList :: ReadS [(f :.: g) a]

readPrec :: ReadPrec ((f :.: g) a)

readListPrec :: ReadPrec [(f :.: g) a]

Methods

showsPrec :: Int -> (f :.: g) a -> ShowS

show :: (f :.: g) a -> String

showList :: [(f :.: g) a] -> ShowS

Methods

(==) :: (f :.: g) a -> (f :.: g) a -> Bool

(/=) :: (f :.: g) a -> (f :.: g) a -> Bool

Methods

compare :: (f :.: g) a -> (f :.: g) a -> Ordering

(<) :: (f :.: g) a -> (f :.: g) a -> Bool

(<=) :: (f :.: g) a -> (f :.: g) a -> Bool

(>) :: (f :.: g) a -> (f :.: g) a -> Bool

(>=) :: (f :.: g) a -> (f :.: g) a -> Bool

max :: (f :.: g) a -> (f :.: g) a -> (f :.: g) a

min :: (f :.: g) a -> (f :.: g) a -> (f :.: g) a