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

uncurry converts a curried function to a function on pairs.

Examples

>>> uncurry (+) (1,2)
3

>>> uncurry ($) (show, 1)
"1"

>>> map (uncurry max) [(1,2), (3,4), (6,8)]
[2,4,8]

uncurry with no lazy pattern matching for more efficient code.

uncurry converts a curried function to a function on pairs.

uncurry converts a curried function to a function on pairs.

Examples

>>> uncurry (+) (1,2)
3

>>> uncurry ($) (show, 1)
"1"

>>> map (uncurry max) [(1,2), (3,4), (6,8)]
[2,4,8]

Case analysis on a tuple. Interestingly, this is the same as uncurry. Equivalent type signature:

tupleR :: forall a b r. AnalysisR (a, b) r

Case analysis on a tuple. Same as uncurry, except the tuple comes before the case function. Equivalent type signature:

tupleL :: forall a b r. Analysis (a, b) r