Data.Impossible

Documentation

data Impossible

Constructors

Impossible

Instances

Show Impossible

Methods

showsPrec :: Int -> Impossible -> ShowS

show :: Impossible -> String

showList :: [Impossible] -> ShowS

class ImpCls

impossible :: HasCallStack => a

impossibleTo :: HasCallStack => String -> a

data ImpossibleM1 t1

Constructors

ImpossibleM1

Instances

Monad (ImpossibleM1 *)

Methods

(>>=) :: ImpossibleM1 * a -> (a -> ImpossibleM1 * b) -> ImpossibleM1 * b

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

return :: a -> ImpossibleM1 * a

fail :: String -> ImpossibleM1 * a

Functor (ImpossibleM1 *)

Methods

fmap :: (a -> b) -> ImpossibleM1 * a -> ImpossibleM1 * b

(<$) :: a -> ImpossibleM1 * b -> ImpossibleM1 * a

Applicative (ImpossibleM1 *)

Methods

pure :: a -> ImpossibleM1 * a

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

liftA2 :: (a -> b -> c) -> ImpossibleM1 * a -> ImpossibleM1 * b -> ImpossibleM1 * c

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

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

Foldable (ImpossibleM1 *)

Methods

fold :: Monoid m => ImpossibleM1 * m -> m

foldMap :: Monoid m => (a -> m) -> ImpossibleM1 * a -> m

foldr :: (a -> b -> b) -> b -> ImpossibleM1 * a -> b

foldr' :: (a -> b -> b) -> b -> ImpossibleM1 * a -> b

foldl :: (b -> a -> b) -> b -> ImpossibleM1 * a -> b

foldl' :: (b -> a -> b) -> b -> ImpossibleM1 * a -> b

foldr1 :: (a -> a -> a) -> ImpossibleM1 * a -> a

foldl1 :: (a -> a -> a) -> ImpossibleM1 * a -> a

toList :: ImpossibleM1 * a -> [a]

null :: ImpossibleM1 * a -> Bool

length :: ImpossibleM1 * a -> Int

elem :: Eq a => a -> ImpossibleM1 * a -> Bool

maximum :: Ord a => ImpossibleM1 * a -> a

minimum :: Ord a => ImpossibleM1 * a -> a

sum :: Num a => ImpossibleM1 * a -> a

product :: Num a => ImpossibleM1 * a -> a

Traversable (ImpossibleM1 *)

Methods

traverse :: Applicative f => (a -> f b) -> ImpossibleM1 * a -> f (ImpossibleM1 * b)

sequenceA :: Applicative f => ImpossibleM1 * (f a) -> f (ImpossibleM1 * a)

mapM :: Monad m => (a -> m b) -> ImpossibleM1 * a -> m (ImpossibleM1 * b)

sequence :: Monad m => ImpossibleM1 * (m a) -> m (ImpossibleM1 * a)

Show (ImpossibleM1 k t1)

Methods

showsPrec :: Int -> ImpossibleM1 k t1 -> ShowS

show :: ImpossibleM1 k t1 -> String

showList :: [ImpossibleM1 k t1] -> ShowS

data ImpossibleM2 t1 t2

Constructors

ImpossibleM2

Instances

Functor (ImpossibleM2 k * t1)

Methods

fmap :: (a -> b) -> ImpossibleM2 k * t1 a -> ImpossibleM2 k * t1 b

(<$) :: a -> ImpossibleM2 k * t1 b -> ImpossibleM2 k * t1 a

Foldable (ImpossibleM2 k * t1)

Methods

fold :: Monoid m => ImpossibleM2 k * t1 m -> m

foldMap :: Monoid m => (a -> m) -> ImpossibleM2 k * t1 a -> m

foldr :: (a -> b -> b) -> b -> ImpossibleM2 k * t1 a -> b

foldr' :: (a -> b -> b) -> b -> ImpossibleM2 k * t1 a -> b

foldl :: (b -> a -> b) -> b -> ImpossibleM2 k * t1 a -> b

foldl' :: (b -> a -> b) -> b -> ImpossibleM2 k * t1 a -> b

foldr1 :: (a -> a -> a) -> ImpossibleM2 k * t1 a -> a

foldl1 :: (a -> a -> a) -> ImpossibleM2 k * t1 a -> a

toList :: ImpossibleM2 k * t1 a -> [a]

null :: ImpossibleM2 k * t1 a -> Bool

length :: ImpossibleM2 k * t1 a -> Int

elem :: Eq a => a -> ImpossibleM2 k * t1 a -> Bool

maximum :: Ord a => ImpossibleM2 k * t1 a -> a

minimum :: Ord a => ImpossibleM2 k * t1 a -> a

sum :: Num a => ImpossibleM2 k * t1 a -> a

product :: Num a => ImpossibleM2 k * t1 a -> a

Traversable (ImpossibleM2 k * t1)

Methods

traverse :: Applicative f => (a -> f b) -> ImpossibleM2 k * t1 a -> f (ImpossibleM2 k * t1 b)

sequenceA :: Applicative f => ImpossibleM2 k * t1 (f a) -> f (ImpossibleM2 k * t1 a)

mapM :: Monad m => (a -> m b) -> ImpossibleM2 k * t1 a -> m (ImpossibleM2 k * t1 b)

sequence :: Monad m => ImpossibleM2 k * t1 (m a) -> m (ImpossibleM2 k * t1 a)

Show (ImpossibleM2 k1 k2 t1 t2)

Methods

showsPrec :: Int -> ImpossibleM2 k1 k2 t1 t2 -> ShowS

show :: ImpossibleM2 k1 k2 t1 t2 -> String

showList :: [ImpossibleM2 k1 k2 t1 t2] -> ShowS

data ImpossibleM3 t1 t2 t3

Constructors

ImpossibleM3

Instances

Functor (ImpossibleM3 k1 k2 * t1 t2)

Methods

fmap :: (a -> b) -> ImpossibleM3 k1 k2 * t1 t2 a -> ImpossibleM3 k1 k2 * t1 t2 b

(<$) :: a -> ImpossibleM3 k1 k2 * t1 t2 b -> ImpossibleM3 k1 k2 * t1 t2 a

Foldable (ImpossibleM3 k1 k2 * t1 t2)

Methods

fold :: Monoid m => ImpossibleM3 k1 k2 * t1 t2 m -> m

foldMap :: Monoid m => (a -> m) -> ImpossibleM3 k1 k2 * t1 t2 a -> m

foldr :: (a -> b -> b) -> b -> ImpossibleM3 k1 k2 * t1 t2 a -> b

foldr' :: (a -> b -> b) -> b -> ImpossibleM3 k1 k2 * t1 t2 a -> b

foldl :: (b -> a -> b) -> b -> ImpossibleM3 k1 k2 * t1 t2 a -> b

foldl' :: (b -> a -> b) -> b -> ImpossibleM3 k1 k2 * t1 t2 a -> b

foldr1 :: (a -> a -> a) -> ImpossibleM3 k1 k2 * t1 t2 a -> a

foldl1 :: (a -> a -> a) -> ImpossibleM3 k1 k2 * t1 t2 a -> a

toList :: ImpossibleM3 k1 k2 * t1 t2 a -> [a]

null :: ImpossibleM3 k1 k2 * t1 t2 a -> Bool

length :: ImpossibleM3 k1 k2 * t1 t2 a -> Int

elem :: Eq a => a -> ImpossibleM3 k1 k2 * t1 t2 a -> Bool

maximum :: Ord a => ImpossibleM3 k1 k2 * t1 t2 a -> a

minimum :: Ord a => ImpossibleM3 k1 k2 * t1 t2 a -> a

sum :: Num a => ImpossibleM3 k1 k2 * t1 t2 a -> a

product :: Num a => ImpossibleM3 k1 k2 * t1 t2 a -> a

Traversable (ImpossibleM3 k1 k2 * t1 t2)

Methods

traverse :: Applicative f => (a -> f b) -> ImpossibleM3 k1 k2 * t1 t2 a -> f (ImpossibleM3 k1 k2 * t1 t2 b)

sequenceA :: Applicative f => ImpossibleM3 k1 k2 * t1 t2 (f a) -> f (ImpossibleM3 k1 k2 * t1 t2 a)

mapM :: Monad m => (a -> m b) -> ImpossibleM3 k1 k2 * t1 t2 a -> m (ImpossibleM3 k1 k2 * t1 t2 b)

sequence :: Monad m => ImpossibleM3 k1 k2 * t1 t2 (m a) -> m (ImpossibleM3 k1 k2 * t1 t2 a)

Show (ImpossibleM3 k1 k2 k3 t1 t2 t3)

Methods

showsPrec :: Int -> ImpossibleM3 k1 k2 k3 t1 t2 t3 -> ShowS

show :: ImpossibleM3 k1 k2 k3 t1 t2 t3 -> String

showList :: [ImpossibleM3 k1 k2 k3 t1 t2 t3] -> ShowS

data ImpossibleM4 t1 t2 t3 t4

Constructors

ImpossibleM4

Instances

Functor (ImpossibleM4 k1 k2 k3 * t1 t2 t3)

Methods

fmap :: (a -> b) -> ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> ImpossibleM4 k1 k2 k3 * t1 t2 t3 b

(<$) :: a -> ImpossibleM4 k1 k2 k3 * t1 t2 t3 b -> ImpossibleM4 k1 k2 k3 * t1 t2 t3 a

Foldable (ImpossibleM4 k1 k2 k3 * t1 t2 t3)

Methods

fold :: Monoid m => ImpossibleM4 k1 k2 k3 * t1 t2 t3 m -> m

foldMap :: Monoid m => (a -> m) -> ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> m

foldr :: (a -> b -> b) -> b -> ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> b

foldr' :: (a -> b -> b) -> b -> ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> b

foldl :: (b -> a -> b) -> b -> ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> b

foldl' :: (b -> a -> b) -> b -> ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> b

foldr1 :: (a -> a -> a) -> ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> a

foldl1 :: (a -> a -> a) -> ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> a

toList :: ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> [a]

null :: ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> Bool

length :: ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> Int

elem :: Eq a => a -> ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> Bool

maximum :: Ord a => ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> a

minimum :: Ord a => ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> a

sum :: Num a => ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> a

product :: Num a => ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> a

Traversable (ImpossibleM4 k1 k2 k3 * t1 t2 t3)

Methods

traverse :: Applicative f => (a -> f b) -> ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> f (ImpossibleM4 k1 k2 k3 * t1 t2 t3 b)

sequenceA :: Applicative f => ImpossibleM4 k1 k2 k3 * t1 t2 t3 (f a) -> f (ImpossibleM4 k1 k2 k3 * t1 t2 t3 a)

mapM :: Monad m => (a -> m b) -> ImpossibleM4 k1 k2 k3 * t1 t2 t3 a -> m (ImpossibleM4 k1 k2 k3 * t1 t2 t3 b)

sequence :: Monad m => ImpossibleM4 k1 k2 k3 * t1 t2 t3 (m a) -> m (ImpossibleM4 k1 k2 k3 * t1 t2 t3 a)

Show (ImpossibleM4 k1 k2 k3 k4 t1 t2 t3 t4)

Methods

showsPrec :: Int -> ImpossibleM4 k1 k2 k3 k4 t1 t2 t3 t4 -> ShowS

show :: ImpossibleM4 k1 k2 k3 k4 t1 t2 t3 t4 -> String

showList :: [ImpossibleM4 k1 k2 k3 k4 t1 t2 t3 t4] -> ShowS

data ImpossibleM5 t1 t2 t3 t4 t5

Constructors

ImpossibleM5

Instances

Functor (ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4)

Methods

fmap :: (a -> b) -> ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 b

(<$) :: a -> ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 b -> ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a

Foldable (ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4)

Methods

fold :: Monoid m => ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 m -> m

foldMap :: Monoid m => (a -> m) -> ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> m

foldr :: (a -> b -> b) -> b -> ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> b

foldr' :: (a -> b -> b) -> b -> ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> b

foldl :: (b -> a -> b) -> b -> ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> b

foldl' :: (b -> a -> b) -> b -> ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> b

foldr1 :: (a -> a -> a) -> ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> a

foldl1 :: (a -> a -> a) -> ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> a

toList :: ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> [a]

null :: ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> Bool

length :: ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> Int

elem :: Eq a => a -> ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> Bool

maximum :: Ord a => ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> a

minimum :: Ord a => ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> a

sum :: Num a => ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> a

product :: Num a => ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> a

Traversable (ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4)

Methods

traverse :: Applicative f => (a -> f b) -> ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> f (ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 b)

sequenceA :: Applicative f => ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 (f a) -> f (ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a)

mapM :: Monad m => (a -> m b) -> ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a -> m (ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 b)

sequence :: Monad m => ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 (m a) -> m (ImpossibleM5 k1 k2 k3 k4 * t1 t2 t3 t4 a)

Show (ImpossibleM5 k1 k2 k3 k4 k5 t1 t2 t3 t4 t5)

Methods

showsPrec :: Int -> ImpossibleM5 k1 k2 k3 k4 k5 t1 t2 t3 t4 t5 -> ShowS

show :: ImpossibleM5 k1 k2 k3 k4 k5 t1 t2 t3 t4 t5 -> String

showList :: [ImpossibleM5 k1 k2 k3 k4 k5 t1 t2 t3 t4 t5] -> ShowS

data ImpossibleM6 t1 t2 t3 t4 t5 t6

Constructors

ImpossibleM6

Instances

Functor (ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5)

Methods

fmap :: (a -> b) -> ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 b

(<$) :: a -> ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 b -> ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a

Foldable (ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5)

Methods

fold :: Monoid m => ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 m -> m

foldMap :: Monoid m => (a -> m) -> ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> m

foldr :: (a -> b -> b) -> b -> ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> b

foldr' :: (a -> b -> b) -> b -> ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> b

foldl :: (b -> a -> b) -> b -> ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> b

foldl' :: (b -> a -> b) -> b -> ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> b

foldr1 :: (a -> a -> a) -> ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> a

foldl1 :: (a -> a -> a) -> ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> a

toList :: ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> [a]

null :: ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> Bool

length :: ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> Int

elem :: Eq a => a -> ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> Bool

maximum :: Ord a => ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> a

minimum :: Ord a => ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> a

sum :: Num a => ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> a

product :: Num a => ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> a

Traversable (ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5)

Methods

traverse :: Applicative f => (a -> f b) -> ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> f (ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 b)

sequenceA :: Applicative f => ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 (f a) -> f (ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a)

mapM :: Monad m => (a -> m b) -> ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a -> m (ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 b)

sequence :: Monad m => ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 (m a) -> m (ImpossibleM6 k1 k2 k3 k4 k5 * t1 t2 t3 t4 t5 a)

Show (ImpossibleM6 k1 k2 k3 k4 k5 k6 t1 t2 t3 t4 t5 t6)

Methods

showsPrec :: Int -> ImpossibleM6 k1 k2 k3 k4 k5 k6 t1 t2 t3 t4 t5 t6 -> ShowS

show :: ImpossibleM6 k1 k2 k3 k4 k5 k6 t1 t2 t3 t4 t5 t6 -> String

showList :: [ImpossibleM6 k1 k2 k3 k4 k5 k6 t1 t2 t3 t4 t5 t6] -> ShowS

data ImpossibleM7 t1 t2 t3 t4 t5 t6 t7

Constructors

ImpossibleM7

Instances

Functor (ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6)

Methods

fmap :: (a -> b) -> ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 b

(<$) :: a -> ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 b -> ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a

Foldable (ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6)

Methods

fold :: Monoid m => ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 m -> m

foldMap :: Monoid m => (a -> m) -> ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> m

foldr :: (a -> b -> b) -> b -> ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> b

foldr' :: (a -> b -> b) -> b -> ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> b

foldl :: (b -> a -> b) -> b -> ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> b

foldl' :: (b -> a -> b) -> b -> ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> b

foldr1 :: (a -> a -> a) -> ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> a

foldl1 :: (a -> a -> a) -> ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> a

toList :: ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> [a]

null :: ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> Bool

length :: ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> Int

elem :: Eq a => a -> ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> Bool

maximum :: Ord a => ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> a

minimum :: Ord a => ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> a

sum :: Num a => ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> a

product :: Num a => ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> a

Traversable (ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6)

Methods

traverse :: Applicative f => (a -> f b) -> ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> f (ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 b)

sequenceA :: Applicative f => ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 (f a) -> f (ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a)

mapM :: Monad m => (a -> m b) -> ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a -> m (ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 b)

sequence :: Monad m => ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 (m a) -> m (ImpossibleM7 k1 k2 k3 k4 k5 k6 * t1 t2 t3 t4 t5 t6 a)

Show (ImpossibleM7 k1 k2 k3 k4 k5 k6 k7 t1 t2 t3 t4 t5 t6 t7)

Methods

showsPrec :: Int -> ImpossibleM7 k1 k2 k3 k4 k5 k6 k7 t1 t2 t3 t4 t5 t6 t7 -> ShowS

show :: ImpossibleM7 k1 k2 k3 k4 k5 k6 k7 t1 t2 t3 t4 t5 t6 t7 -> String

showList :: [ImpossibleM7 k1 k2 k3 k4 k5 k6 k7 t1 t2 t3 t4 t5 t6 t7] -> ShowS

data ImpossibleM8 t1 t2 t3 t4 t5 t6 t7 t8

Constructors

ImpossibleM8

Instances

Functor (ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7)

Methods

fmap :: (a -> b) -> ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 b

(<$) :: a -> ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 b -> ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a

Foldable (ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7)

Methods

fold :: Monoid m => ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 m -> m

foldMap :: Monoid m => (a -> m) -> ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> m

foldr :: (a -> b -> b) -> b -> ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> b

foldr' :: (a -> b -> b) -> b -> ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> b

foldl :: (b -> a -> b) -> b -> ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> b

foldl' :: (b -> a -> b) -> b -> ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> b

foldr1 :: (a -> a -> a) -> ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> a

foldl1 :: (a -> a -> a) -> ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> a

toList :: ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> [a]

null :: ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> Bool

length :: ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> Int

elem :: Eq a => a -> ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> Bool

maximum :: Ord a => ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> a

minimum :: Ord a => ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> a

sum :: Num a => ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> a

product :: Num a => ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> a

Traversable (ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7)

Methods

traverse :: Applicative f => (a -> f b) -> ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> f (ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 b)

sequenceA :: Applicative f => ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 (f a) -> f (ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a)

mapM :: Monad m => (a -> m b) -> ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a -> m (ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 b)

sequence :: Monad m => ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 (m a) -> m (ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 * t1 t2 t3 t4 t5 t6 t7 a)

Show (ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 k8 t1 t2 t3 t4 t5 t6 t7 t8)

Methods

showsPrec :: Int -> ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 k8 t1 t2 t3 t4 t5 t6 t7 t8 -> ShowS

show :: ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 k8 t1 t2 t3 t4 t5 t6 t7 t8 -> String

showList :: [ImpossibleM8 k1 k2 k3 k4 k5 k6 k7 k8 t1 t2 t3 t4 t5 t6 t7 t8] -> ShowS

data ImpossibleM9 t1 t2 t3 t4 t5 t6 t7 t8 t9

Constructors

ImpossibleM9

Instances

Functor (ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8)

Methods

fmap :: (a -> b) -> ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 b

(<$) :: a -> ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 b -> ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a

Foldable (ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8)

Methods

fold :: Monoid m => ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 m -> m

foldMap :: Monoid m => (a -> m) -> ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> m

foldr :: (a -> b -> b) -> b -> ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> b

foldr' :: (a -> b -> b) -> b -> ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> b

foldl :: (b -> a -> b) -> b -> ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> b

foldl' :: (b -> a -> b) -> b -> ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> b

foldr1 :: (a -> a -> a) -> ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> a

foldl1 :: (a -> a -> a) -> ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> a

toList :: ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> [a]

null :: ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> Bool

length :: ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> Int

elem :: Eq a => a -> ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> Bool

maximum :: Ord a => ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> a

minimum :: Ord a => ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> a

sum :: Num a => ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> a

product :: Num a => ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> a

Traversable (ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8)

Methods

traverse :: Applicative f => (a -> f b) -> ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> f (ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 b)

sequenceA :: Applicative f => ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 (f a) -> f (ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a)

mapM :: Monad m => (a -> m b) -> ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a -> m (ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 b)

sequence :: Monad m => ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 (m a) -> m (ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 * t1 t2 t3 t4 t5 t6 t7 t8 a)

Show (ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 k9 t1 t2 t3 t4 t5 t6 t7 t8 t9)

Methods

showsPrec :: Int -> ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 k9 t1 t2 t3 t4 t5 t6 t7 t8 t9 -> ShowS

show :: ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 k9 t1 t2 t3 t4 t5 t6 t7 t8 t9 -> String

showList :: [ImpossibleM9 k1 k2 k3 k4 k5 k6 k7 k8 k9 t1 t2 t3 t4 t5 t6 t7 t8 t9] -> ShowS

type Imp = Impossible

type ImpM = ImpossibleM1

type ImpM1 = ImpossibleM1

type ImpM2 = ImpossibleM2

type ImpM3 = ImpossibleM3

type ImpM4 = ImpossibleM4

type ImpM5 = ImpossibleM5

type ImpM6 = ImpossibleM6

type ImpM7 = ImpossibleM7

type ImpM8 = ImpossibleM8

type ImpM9 = ImpossibleM9