Stability | experimental |
---|---|
Maintainer | conal@tabula.com |
Safe Haskell | None |
Pair functor
- data Pair a = a :# a
- fstP :: Pair a -> a
- sndP :: Pair a -> a
- swapP :: Unop (Pair a)
- fromP :: Pair a -> (a, a)
- toP :: (a, a) -> Pair a
- inP :: Unop (a, a) -> Unop (Pair a)
- firstP :: Unop a -> Unop (Pair a)
- secondP :: Unop a -> Unop (Pair a)
- zipA :: Applicative f => Pair (f a) -> f (Pair a)
- unzipA :: Functor f => f (Pair a) -> Pair (f a)
- inZipA :: Applicative f => Unop (f (Pair a)) -> Unop (Pair (f a))
- curryP :: (Pair a -> b) -> a -> a -> b
- uncurryP :: (a -> a -> b) -> Pair a -> b
- preScanP :: (Functor f, Monoid o) => Pair (f o, o) -> (Pair (f o), o)
- sufScanP :: (Functor f, Monoid o) => Pair (o, f o) -> (o, Pair (f o))