uncurry -package:base-compat-batteries -package:fixed-length -package:singletons

uncurry :: (a -> b -> c) -> (a, b) -> c
base Prelude Data.Tuple, amazonka-core Amazonka.Prelude, hedgehog Hedgehog.Internal.Prelude, 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, Cabal-syntax Distribution.Compat.Prelude, universum Universum.Container.Reexport, ihaskell IHaskellPrelude, github GitHub.Internal.Prelude, numhask NumHask.Prelude, clash-prelude Clash.HaskellPrelude, 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, copilot-language Copilot.Language.Prelude, incipit-base Incipit.Base, LambdaHack Game.LambdaHack.Core.Prelude, cabal-install-solver Distribution.Solver.Compat.Prelude, faktory Faktory.Prelude, yesod-paginator Yesod.Paginator.Prelude, distribution-opensuse OpenSuse.Prelude, hledger-web Hledger.Web.Import, termonad Termonad.Prelude, verset Verset
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
ghc GHC.Prelude.Basic, stack Stack.Prelude
uncurry :: Functor f => (f a -> f b -> g) -> f (a, b) -> g
utility-ht Control.Functor.HT
Caution: See unzip.
uncurry :: (a -> b -> c) -> Pair a b -> c
strict Data.Strict.Tuple, strict-base-types Data.Tuple.Strict
Convert a curried function to a function on strict pairs.
uncurry :: (a -> b -> c) -> (a, b) -> c
basic-prelude CorePrelude
uncurry converts a curried function to a function on pairs.
uncurry :: HVectElim ts a -> HVect ts -> a
hvect Data.HVect
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]
data Uncurry
first-class-families Fcf Fcf.Data.Common
type family Uncurry (a1 :: a ~> b ~> c) (a2 :: (a, b)) :: c
singletons-base Data.Tuple.Singletons Prelude.Singletons
uncurry3 :: (a -> b -> c -> d) -> (a, b, c) -> d
ghc GHC.Utils.Misc, utility-ht Data.Tuple.HT Data.Tuple.Lazy Data.Tuple.Strict
uncurry3 :: (a -> b -> c -> d) -> (a, b, c) -> d
extra Data.Tuple.Extra Extra
Converts a curried function to a function on a triple.
uncurry' :: Strong p => p a (b -> c) -> p (a, b) c
profunctors Data.Profunctor Data.Profunctor.Strong
uncurryRan :: (p :-> Ran q r) -> Procompose p q :-> r
profunctors Data.Profunctor.Ran
uncurry3 :: Functor f => (f a -> f b -> f c -> g) -> f (a, b, c) -> g
utility-ht Control.Functor.HT
Caution: See unzip.
uncurryRGB :: (a -> a -> a -> b) -> RGB a -> b
colour Data.Colour.RGBSpace
Uncurries a function expecting three r, g, b parameters.
uncurry3 :: (a -> b -> c -> d) -> (a, b, c) -> d
hxt Text.XML.HXT.DOM.Util
mothers little helpers for to much curry
uncurry4 :: (a -> b -> c -> d -> e) -> (a, b, c, d) -> e
hxt Text.XML.HXT.DOM.Util
uncurry' :: (a -> b -> c) -> (a, b) -> c
optics-core Optics.Internal.Utils
uncurry with no lazy pattern matching for more efficient code.
uncurry0 :: Func0 a b -> T0 a -> b
non-empty Data.FixedLengthList
uncurry1 :: Func1 a b -> T1 a -> b
non-empty Data.FixedLengthList
uncurry2 :: Func2 a b -> T2 a -> b
non-empty Data.FixedLengthList
uncurry3 :: Func3 a b -> T3 a -> b
non-empty Data.FixedLengthList
uncurry4 :: Func4 a b -> T4 a -> b
non-empty Data.FixedLengthList
uncurry5 :: Func5 a b -> T5 a -> b
non-empty Data.FixedLengthList
uncurry6 :: Func6 a b -> T6 a -> b
non-empty Data.FixedLengthList