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

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

base Prelude Data.Tuple, hedgehog Hedgehog.Internal.Prelude, ghc GHC.Prelude.Basic, base-compat Data.Tuple.Compat Prelude.Compat, protolude Protolude, relude Relude.Container.Reexport, rio RIO.Prelude, base-prelude BasePrelude, classy-prelude ClassyPrelude, numeric-prelude NumericPrelude NumericPrelude.Base, universum Universum.Container.Reexport, base-compat-batteries Data.Tuple.Compat, Cabal-syntax Distribution.Compat.Prelude, github GitHub.Internal.Prelude, numhask NumHask.Prelude, foundation Foundation, ghc-lib-parser GHC.Prelude.Basic, dimensional Numeric.Units.Dimensional.Prelude, rebase Rebase.Prelude, mixed-types-num Numeric.MixedTypes.PreludeHiding, xmonad-contrib XMonad.Config.Prime, stack Stack.Prelude, incipit-base Incipit.Base, LambdaHack Game.LambdaHack.Core.Prelude, cabal-install-solver Distribution.Solver.Compat.Prelude, yesod-paginator Yesod.Paginator.Prelude, distribution-opensuse OpenSuse.Prelude, faktory Faktory.Prelude, hledger-web Hledger.Web.Import, termonad Termonad.Prelude

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' :: (a -> b -> c) -> (a, b) -> c

optics-core Optics.Internal.Utils

uncurry with no lazy pattern matching for more efficient code.

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

basic-prelude CorePrelude

uncurry converts a curried function to a function on pairs.

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

hledger-lib Hledger.Utils, hledger Hledger.Cli.Script

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

prelude-compat Prelude2010

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]

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

testing-feat Test.Feat.Class