Safe Haskell | Safe-Infered |
---|
- data Tup1 a = Tup1 !a
- data Tup2 a = Tup2 !a !a
- data Tup3 a = Tup3 !a !a !a
- data Tup4 a = Tup4 !a !a !a !a
- data Tup5 a = Tup5 !a !a !a !a !a
- data Tup6 a = Tup6 !a !a !a !a !a !a
- data Tup7 a = Tup7 !a !a !a !a !a !a !a
- data Tup8 a = Tup8 !a !a !a !a !a !a !a !a
- data Tup9 a = Tup9 !a !a !a !a !a !a !a !a !a
- tupTup :: Applicative f => f a -> f a -> f (Tup2 a)
- tupTup3 :: Applicative f => f a -> f a -> f a -> f (Tup3 a)
- tupTup4 :: Applicative f => f a -> f a -> f a -> f a -> f (Tup4 a)
- tupTup5 :: Applicative f => f a -> f a -> f a -> f a -> f a -> f (Tup5 a)
data type declarations
Tup1 !a |
Tup2 !a !a |
Tup3 !a !a !a |
Tup4 !a !a !a !a |
Tup5 !a !a !a !a !a |
Tup6 !a !a !a !a !a !a |
Tup7 !a !a !a !a !a !a !a |
Tup8 !a !a !a !a !a !a !a !a |
Tup9 !a !a !a !a !a !a !a !a !a |
"tupping"
tupTup :: Applicative f => f a -> f a -> f (Tup2 a)Source
tupTup3 :: Applicative f => f a -> f a -> f a -> f (Tup3 a)Source
tupTup4 :: Applicative f => f a -> f a -> f a -> f a -> f (Tup4 a)Source
tupTup5 :: Applicative f => f a -> f a -> f a -> f a -> f a -> f (Tup5 a)Source