hsExprTest-3.6.5: Expression Testing
Safe HaskellSafe-Inferred
LanguageHaskell2010

Data.Tuple.TH.Curry

Documentation

curry1 :: (t1 -> t2) -> t1 -> t2 #

uncurry1 :: (t1 -> t2) -> t1 -> t2 #

curry16 :: ((a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p) -> t) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> t #

curry15 :: ((a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> t) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> t #

curry14 :: ((a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> t) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> t #

curry13 :: ((a, b, c, d, e, f, g, h, i, j, k, l, m) -> t) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> t #

curry12 :: ((a, b, c, d, e, f, g, h, i, j, k, l) -> t) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> t #

curry11 :: ((a, b, c, d, e, f, g, h, i, j, k) -> t) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> t #

curry10 :: ((a, b, c, d, e, f, g, h, i, j) -> t) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> t #

curry9 :: ((a, b, c, d, e, f, g, h, i) -> t) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> t #

curry8 :: ((a, b, c, d, e, f, g, h) -> t) -> a -> b -> c -> d -> e -> f -> g -> h -> t #

curry7 :: ((a, b, c, d, e, f, g) -> t) -> a -> b -> c -> d -> e -> f -> g -> t #

curry6 :: ((a, b, c, d, e, f) -> t) -> a -> b -> c -> d -> e -> f -> t #

curry5 :: ((a, b, c, d, e) -> t) -> a -> b -> c -> d -> e -> t #

curry4 :: ((a, b, c, d) -> t) -> a -> b -> c -> d -> t #

curry3 :: ((a, b, c) -> t) -> a -> b -> c -> t #

curry2 :: ((a, b) -> t) -> a -> b -> t #

uncurry16 :: (t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t) -> (t, t, t, t, t, t, t, t, t, t, t, t, t, t, t, t) -> t #

uncurry15 :: (t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t) -> (t, t, t, t, t, t, t, t, t, t, t, t, t, t, t) -> t #

uncurry14 :: (t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t) -> (t, t, t, t, t, t, t, t, t, t, t, t, t, t) -> t #

uncurry13 :: (t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t) -> (t, t, t, t, t, t, t, t, t, t, t, t, t) -> t #

uncurry12 :: (t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t) -> (t, t, t, t, t, t, t, t, t, t, t, t) -> t #

uncurry11 :: (t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t) -> (t, t, t, t, t, t, t, t, t, t, t) -> t #

uncurry10 :: (t -> t -> t -> t -> t -> t -> t -> t -> t -> t -> t) -> (t, t, t, t, t, t, t, t, t, t) -> t #

uncurry9 :: (t -> t -> t -> t -> t -> t -> t -> t -> t -> t) -> (t, t, t, t, t, t, t, t, t) -> t #

uncurry8 :: (t -> t -> t -> t -> t -> t -> t -> t -> t) -> (t, t, t, t, t, t, t, t) -> t #

uncurry7 :: (t -> t -> t -> t -> t -> t -> t -> t) -> (t, t, t, t, t, t, t) -> t #

uncurry6 :: (t -> t -> t -> t -> t -> t -> t) -> (t, t, t, t, t, t) -> t #

uncurry5 :: (t -> t -> t -> t -> t -> t) -> (t, t, t, t, t) -> t #

uncurry4 :: (t -> t -> t -> t -> t) -> (t, t, t, t) -> t #

uncurry3 :: (t -> t -> t -> t) -> (t, t, t) -> t #

uncurry2 :: (t -> t -> t) -> (t, t) -> t #