Copyright	(c) 2013 Tabula, Inc.
Maintainer	conal@conal.net
Stability	experimental
Safe Haskell	Safe
Language	Haskell98

Data.UniformPair

Description

Uniform pairs. Because these pairs memoize functions (from Bool)--i.e., they're representable functors--these instances provided are fully determined by the corresponding instances for functions, thanks to the type class morphism principle.

Synopsis

Documentation

data Pair a Source

Uniform pairs

Constructors

a :# a infix 1

Instances

Monad Pair Source
Functor Pair Source
Applicative Pair Source
Foldable Pair Source
Traversable Pair Source
ShowF Pair Source
Eq a => Eq (Pair a) Source
Ord a => Ord (Pair a) Source
Show a => Show (Pair a) Source
Monoid a => Monoid (Pair a) Source
NFData a => NFData (Pair a) Source

fstP :: Pair a -> a Source

sndP :: Pair a -> a Source

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

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

getP :: Bool -> Pair a -> a Source

Extract an element, indexing by False for the first element and True for the second.

onElemP :: Bool -> (a -> a) -> Pair a -> Pair a Source

Update a component, indexing by False for the first element and True for the second.

compareSwap :: Ord a => Pair a -> Pair a Source