uniform-algebras-0.1.5.1: Pointless functions and a simplistic zero and monoid
Safe HaskellSafe-Inferred
LanguageHaskell2010

Uniform.Tuples

Synopsis
  • trd3 :: (a, b, c) -> c
  • fst4 :: (a, b, c, d) -> a
  • snd4 :: (a, b, c, d) -> b
  • trd4 :: (a, b, c, d) -> c
  • thd4 :: (a, b, c, d) -> c
  • fth4 :: (a, b, c, d) -> d
  • fst5 :: (a, b, c, d, e) -> a
  • snd5 :: (a, b, c, d, e) -> b
  • thd5 :: (a, b, c, d, e) -> c
  • trd5 :: (a, b, c, d, e) -> c
  • fth5 :: (a, b, c, d, e) -> d
  • ffh5 :: (a, b, c, d, e) -> e
  • first3 :: (a1 -> b) -> (a1, a2, a3) -> (b, a2, a3)
  • second3 :: (a2 -> b) -> (a1, a2, a3) -> (a1, b, a3)
  • third3 :: (a3 -> b) -> (a1, a2, a3) -> (a1, a2, b)
  • first4 :: (a1 -> b) -> (a1, a2, a3, a4) -> (b, a2, a3, a4)
  • second4 :: (a2 -> b) -> (a1, a2, a3, a4) -> (a1, b, a3, a4)
  • third4 :: (a3 -> b) -> (a1, a2, a3, a4) -> (a1, a2, b, a4)
  • fourth4 :: (a4 -> b) -> (a1, a2, a3, a4) -> (a1, a2, a3, b)
  • thd3 :: (a, b, c) -> c
  • snd3 :: (a, b, c) -> b
  • fst3 :: (a, b, c) -> a
  • both :: (a -> b) -> (a, a) -> (b, b)
  • second :: (b -> b') -> (a, b) -> (a, b')
  • first :: (a -> a') -> (a, b) -> (a', b)

Documentation

trd3 :: (a, b, c) -> c Source #

fst4 :: (a, b, c, d) -> a Source #

snd4 :: (a, b, c, d) -> b Source #

trd4 :: (a, b, c, d) -> c Source #

thd4 :: (a, b, c, d) -> c Source #

fth4 :: (a, b, c, d) -> d Source #

fst5 :: (a, b, c, d, e) -> a Source #

snd5 :: (a, b, c, d, e) -> b Source #

thd5 :: (a, b, c, d, e) -> c Source #

trd5 :: (a, b, c, d, e) -> c Source #

fth5 :: (a, b, c, d, e) -> d Source #

ffh5 :: (a, b, c, d, e) -> e Source #

first3 :: (a1 -> b) -> (a1, a2, a3) -> (b, a2, a3) Source #

second3 :: (a2 -> b) -> (a1, a2, a3) -> (a1, b, a3) Source #

third3 :: (a3 -> b) -> (a1, a2, a3) -> (a1, a2, b) Source #

first4 :: (a1 -> b) -> (a1, a2, a3, a4) -> (b, a2, a3, a4) Source #

second4 :: (a2 -> b) -> (a1, a2, a3, a4) -> (a1, b, a3, a4) Source #

third4 :: (a3 -> b) -> (a1, a2, a3, a4) -> (a1, a2, b, a4) Source #

fourth4 :: (a4 -> b) -> (a1, a2, a3, a4) -> (a1, a2, a3, b) Source #

thd3 :: (a, b, c) -> c #

Extract the final element of a triple.

snd3 :: (a, b, c) -> b #

Extract the snd of a triple.

fst3 :: (a, b, c) -> a #

Extract the fst of a triple.

both :: (a -> b) -> (a, a) -> (b, b) #

Apply a single function to both components of a pair.

both succ (1,2) == (2,3)

second :: (b -> b') -> (a, b) -> (a, b') #

Update the second component of a pair.

second reverse (1,"test") == (1,"tset")

first :: (a -> a') -> (a, b) -> (a', b) #

Update the first component of a pair.

first succ (1,"test") == (2,"test")