Safe Haskell | None |
---|---|

Language | Haskell2010 |

## Synopsis

- (-*-) :: (a -> c) -> (b -> d) -> (a, b) -> (c, d)
- mapFst :: (a -> c) -> (a, b) -> (c, b)
- mapSnd :: (b -> d) -> (a, b) -> (a, d)
- (/\) :: (a -> b) -> (a -> c) -> a -> (b, c)
- swap :: (a, b) -> (b, a)
- fst3 :: (a, b, c) -> a
- snd3 :: (a, b, c) -> b
- thd3 :: (a, b, c) -> c
- uncurry3 :: (a -> b -> c -> d) -> (a, b, c) -> d
- uncurry4 :: (a -> b -> c -> d -> e) -> (a, b, c, d) -> e
- mapPairM :: Applicative m => (a -> m c) -> (b -> m d) -> (a, b) -> m (c, d)
- mapFstM :: Applicative m => (a -> m c) -> (a, b) -> m (c, b)
- mapSndM :: Applicative m => (b -> m d) -> (a, b) -> m (a, d)
- newtype List2 a = List2 {
- list2 :: (a, a)

# Documentation

# Triple (stolen from Data.Tuple.HT)

mapPairM :: Applicative m => (a -> m c) -> (b -> m d) -> (a, b) -> m (c, d) Source #

Monadic version of `-*-`

.

mapFstM :: Applicative m => (a -> m c) -> (a, b) -> m (c, b) Source #

Monadic `mapFst`

.

mapSndM :: Applicative m => (b -> m d) -> (a, b) -> m (a, d) Source #

Monadic `mapSnd`

.

## Instances

Functor List2 Source # | |

Applicative List2 Source # | |

Foldable List2 Source # | |

Defined in Agda.Utils.Tuple fold :: Monoid m => List2 m -> m # foldMap :: Monoid m => (a -> m) -> List2 a -> m # foldr :: (a -> b -> b) -> b -> List2 a -> b # foldr' :: (a -> b -> b) -> b -> List2 a -> b # foldl :: (b -> a -> b) -> b -> List2 a -> b # foldl' :: (b -> a -> b) -> b -> List2 a -> b # foldr1 :: (a -> a -> a) -> List2 a -> a # foldl1 :: (a -> a -> a) -> List2 a -> a # elem :: Eq a => a -> List2 a -> Bool # maximum :: Ord a => List2 a -> a # minimum :: Ord a => List2 a -> a # | |

Traversable List2 Source # | |

Eq a => Eq (List2 a) Source # | |