functor-combo-0.3.6: Functor combinators with tries & zippers

Copyright(c) 2012 Conal Elliott
Maintainerconal@tabula.com
Stabilityexperimental
Safe HaskellNone
LanguageHaskell98

FunctorCombo.Pair

Description

Pair functor

Synopsis

Documentation

data Pair a Source

Uniform pairs

Constructors

a :# a infixl 1 

Instances

Monad Pair 
Functor Pair 
Applicative Pair 
Foldable Pair 
Traversable Pair 
EncodeF Pair 
Scan Pair 
Eq a => Eq (Pair a) 
Data a => Data (Pair a) 
Show a => Show (Pair a) 
HasTrie a => HasTrie (Pair a) 
Typeable (* -> *) Pair 
type Enc Pair = (:*:) Id Id 
type Trie (Pair a) = Trie (a, a) 

fstP :: Pair a -> a Source

sndP :: Pair a -> a Source

swapP :: Unop (Pair a) Source

fromP :: Pair a -> (a, a) Source

toP :: (a, a) -> Pair a Source

inP :: Unop (a, a) -> Unop (Pair a) Source

firstP :: Unop a -> Unop (Pair a) Source

secondP :: Unop a -> Unop (Pair a) Source

zipA :: Applicative f => Pair (f a) -> f (Pair a) Source

unzipA :: Functor f => f (Pair a) -> Pair (f a) Source

inZipA :: Applicative f => Unop (f (Pair a)) -> Unop (Pair (f a)) Source

curryP :: (Pair a -> b) -> a -> a -> b Source

uncurryP :: (a -> a -> b) -> Pair a -> b Source

preScanP :: (Functor f, Monoid o) => Pair (f o, o) -> (Pair (f o), o) Source

sufScanP :: (Functor f, Monoid o) => Pair (o, f o) -> (o, Pair (f o)) Source