Data.UniformPair

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.

Documentation

data Pair a

Uniform pairs

Constructors

a :# a infix 1

Instances

Monad Pair

Functor Pair

Applicative Pair

Foldable Pair

Traversable Pair

ShowF Pair

Eq a => Eq (Pair a)

Ord a => Ord (Pair a)

Show a => Show (Pair a)

Monoid a => Monoid (Pair a)

fstP :: Pair a -> a

sndP :: Pair a -> a

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

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

getP :: Bool -> Pair a -> a

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

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

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

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